From 057e82797806b0dabd23c1e67d411afaaa3e7eb8 Mon Sep 17 00:00:00 2001
From: Julien Eluard <julien.eluard@gmail.com>
Date: Tue, 17 Jul 2018 09:52:12 +0200
Subject: [PATCH] Deploy website

Deploy website version based on 6a605fdb91194be53c3c38851c771b05d5907107
---
 docs/Development.html                         |     4 +-
 docs/Examples.html                            |     4 +-
 docs/Manifesto.html                           |     4 +-
 docs/Roadmap.html                             |    70 +
 docs/concepts/Anatomy.html                    |    36 +
 docs/concepts/Hook.html                       |    54 +
 docs/concepts/Reference.html                  |    23 +
 docs/concepts/Registry.html                   |    36 +
 docs/concepts/Type.html                       |     2 +
 docs/concepts/View.html                       |     2 +
 docs/format/Hook.html                         |    31 -
 docs/format/Reference.html                    |    46 -
 docs/format/Registry.html                     |    13 -
 docs/format/Type.html                         |     2 -
 docs/format/View.html                         |     2 -
 en/index.html                                 |     2 +-
 extensions/demo/extension.edn                 |    19 +
 extensions/piplette/extension.edn             |    52 +
 index.html                                    |     2 +-
 js/cljs/core.cljs                             | 11539 +++++
 js/cljs/core.cljs.cache.json                  |     1 +
 js/cljs/core.js                               | 37629 ++++++++++++++++
 js/cljs/core/constants.js                     |   392 +
 js/cljs/tools/reader.cljs                     |   944 +
 js/cljs/tools/reader.cljs.cache.json          |     1 +
 js/cljs/tools/reader.js                       |  1782 +
 js/cljs/tools/reader/impl/commons.cljs        |   131 +
 .../tools/reader/impl/commons.cljs.cache.json |     1 +
 js/cljs/tools/reader/impl/commons.js          |   192 +
 js/cljs/tools/reader/impl/errors.cljs         |   253 +
 .../tools/reader/impl/errors.cljs.cache.json  |     1 +
 js/cljs/tools/reader/impl/errors.js           |   422 +
 js/cljs/tools/reader/impl/inspect.cljs        |    90 +
 .../tools/reader/impl/inspect.cljs.cache.json |     1 +
 js/cljs/tools/reader/impl/inspect.js          |   155 +
 js/cljs/tools/reader/impl/utils.cljs          |    97 +
 .../tools/reader/impl/utils.cljs.cache.json   |     1 +
 js/cljs/tools/reader/impl/utils.js            |   380 +
 js/cljs/tools/reader/reader_types.cljs        |   283 +
 .../tools/reader/reader_types.cljs.cache.json |     1 +
 js/cljs/tools/reader/reader_types.js          |   797 +
 js/cljsc_opts.edn                             |     1 +
 .../production/create-react-class.min.inc.js  |  1298 +
 .../react-dom/production/react-dom.min.inc.js | 17098 +++++++
 js/cljsjs/react/production/react.min.inc.js   |  1740 +
 js/clojure/data.cljs                          |   162 +
 js/clojure/data.cljs.cache.json               |     1 +
 js/clojure/data.js                            |   358 +
 js/clojure/set.cljs                           |   161 +
 js/clojure/set.cljs.cache.json                |     1 +
 js/clojure/set.js                             |   394 +
 js/clojure/string.cljs                        |   289 +
 js/clojure/string.cljs.cache.json             |     1 +
 js/clojure/string.js                          |   478 +
 js/clojure/walk.cljs                          |    97 +
 js/clojure/walk.cljs.cache.json               |     1 +
 js/clojure/walk.js                            |   131 +
 js/goog/array/array.js                        |  1665 +
 js/goog/asserts/asserts.js                    |   369 +
 js/goog/async/nexttick.js                     |   265 +
 js/goog/base.js                               |  2921 ++
 js/goog/debug/entrypointregistry.js           |   159 +
 js/goog/debug/error.js                        |    63 +
 js/goog/dom/htmlelement.js                    |    29 +
 js/goog/dom/nodetype.js                       |    48 +
 js/goog/dom/tagname.js                        |   562 +
 js/goog/functions/functions.js                |   483 +
 js/goog/iter/iter.js                          |  1284 +
 js/goog/labs/useragent/browser.js             |   338 +
 js/goog/labs/useragent/engine.js              |   156 +
 js/goog/labs/useragent/util.js                |   147 +
 js/goog/math/integer.js                       |   808 +
 js/goog/math/long.js                          |   965 +
 js/goog/math/math.js                          |   448 +
 js/goog/object/object.js                      |   751 +
 js/goog/reflect/reflect.js                    |   138 +
 js/goog/string/string.js                      |  1641 +
 js/goog/string/stringbuffer.js                |   103 +
 js/goog/structs/map.js                        |   458 +
 js/goog/structs/structs.js                    |   354 +
 js/goog/uri/uri.js                            |  1547 +
 js/goog/uri/utils.js                          |  1103 +
 js/pluto.js                                   |   886 +
 js/pluto/components/html.cljs.cache.json      |     1 +
 js/pluto/components/html.js                   |   107 +
 js/pluto/examples.cljs.cache.json             |     1 +
 js/pluto/examples.js                          |   189 +
 js/pluto/reader.cljc.cache.json               |     1 +
 js/pluto/reader.js                            |   226 +
 js/pluto/reader/blocks.cljc.cache.json        |     1 +
 js/pluto/reader/blocks.js                     |   152 +
 js/pluto/reader/reference.cljc.cache.json     |     1 +
 js/pluto/reader/reference.js                  |    46 +
 js/pluto/storage.cljc.cache.json              |     1 +
 js/pluto/storage.js                           |    30 +
 js/pluto/storage/http.cljs.cache.json         |     1 +
 js/pluto/storage/http.js                      |    64 +
 js/pluto/storage/ipfs.cljs.cache.json         |     1 +
 js/pluto/storage/ipfs.js                      |   268 +
 js/pluto/utils.cljc.cache.json                |     1 +
 js/pluto/utils.js                             |    13 +
 js/process/env.cljs                           |    12 +
 js/process/env.cljs.cache.json                |     1 +
 js/process/env.js                             |     7 +
 js/re_frame/cofx.cljc                         |   114 +
 js/re_frame/cofx.cljc.cache.json              |     1 +
 js/re_frame/cofx.js                           |   126 +
 js/re_frame/core.cljc                         |   237 +
 js/re_frame/core.cljc.cache.json              |     1 +
 js/re_frame/core.js                           |   368 +
 js/re_frame/db.cljc                           |    11 +
 js/re_frame/db.cljc.cache.json                |     1 +
 js/re_frame/db.js                             |     6 +
 js/re_frame/events.cljc                       |    68 +
 js/re_frame/events.cljc.cache.json            |     1 +
 js/re_frame/events.js                         |   136 +
 js/re_frame/fx.cljc                           |   167 +
 js/re_frame/fx.cljc.cache.json                |     1 +
 js/re_frame/fx.js                             |   444 +
 js/re_frame/interceptor.cljc                  |   201 +
 js/re_frame/interceptor.cljc.cache.json       |     1 +
 js/re_frame/interceptor.js                    |   345 +
 js/re_frame/interop.cljs                      |    58 +
 js/re_frame/interop.cljs.cache.json           |     1 +
 js/re_frame/interop.js                        |    96 +
 js/re_frame/loggers.cljc                      |    51 +
 js/re_frame/loggers.cljc.cache.json           |     1 +
 js/re_frame/loggers.js                        |    73 +
 js/re_frame/registrar.cljc                    |    56 +
 js/re_frame/registrar.cljc.cache.json         |     1 +
 js/re_frame/registrar.js                      |   120 +
 js/re_frame/router.cljc                       |   266 +
 js/re_frame/router.cljc.cache.json            |     1 +
 js/re_frame/router.js                         |   731 +
 js/re_frame/std_interceptors.cljc             |   358 +
 js/re_frame/std_interceptors.cljc.cache.json  |     1 +
 js/re_frame/std_interceptors.js               |   462 +
 js/re_frame/subs.cljc                         |   354 +
 js/re_frame/subs.cljc.cache.json              |     1 +
 js/re_frame/subs.js                           |   901 +
 js/re_frame/trace.cljc                        |   125 +
 js/re_frame/trace.cljc.cache.json             |     1 +
 js/re_frame/trace.js                          |   145 +
 js/re_frame/utils.cljc                        |    24 +
 js/re_frame/utils.cljc.cache.json             |     1 +
 js/re_frame/utils.js                          |    43 +
 js/reagent/core.cljs                          |   348 +
 js/reagent/core.cljs.cache.json               |     1 +
 js/reagent/core.js                            |   770 +
 js/reagent/debug.cljs                         |    27 +
 js/reagent/debug.cljs.cache.json              |     1 +
 js/reagent/debug.js                           |    78 +
 js/reagent/dom.cljs                           |    70 +
 js/reagent/dom.cljs.cache.json                |     1 +
 js/reagent/dom.js                             |   174 +
 js/reagent/impl/batching.cljs                 |   113 +
 js/reagent/impl/batching.cljs.cache.json      |     1 +
 js/reagent/impl/batching.js                   |   248 +
 js/reagent/impl/component.cljs                |   342 +
 js/reagent/impl/component.cljs.cache.json     |     1 +
 js/reagent/impl/component.js                  |   681 +
 js/reagent/impl/template.cljs                 |   480 +
 js/reagent/impl/template.cljs.cache.json      |     1 +
 js/reagent/impl/template.js                   |   729 +
 js/reagent/impl/util.cljs                     |   141 +
 js/reagent/impl/util.cljs.cache.json          |     1 +
 js/reagent/impl/util.js                       |   552 +
 js/reagent/interop.cljs                       |     2 +
 js/reagent/interop.cljs.cache.json            |     1 +
 js/reagent/interop.js                         |     4 +
 js/reagent/ratom.cljs                         |   595 +
 js/reagent/ratom.cljs.cache.json              |     1 +
 js/reagent/ratom.js                           |  1637 +
 sitemap.xml                                   |    12 +-
 174 files changed, 109528 insertions(+), 107 deletions(-)
 create mode 100644 docs/Roadmap.html
 create mode 100644 docs/concepts/Anatomy.html
 create mode 100644 docs/concepts/Hook.html
 create mode 100644 docs/concepts/Reference.html
 create mode 100644 docs/concepts/Registry.html
 create mode 100644 docs/concepts/Type.html
 create mode 100644 docs/concepts/View.html
 delete mode 100644 docs/format/Hook.html
 delete mode 100644 docs/format/Reference.html
 delete mode 100644 docs/format/Registry.html
 delete mode 100644 docs/format/Type.html
 delete mode 100644 docs/format/View.html
 create mode 100644 extensions/demo/extension.edn
 create mode 100644 extensions/piplette/extension.edn
 create mode 100644 js/cljs/core.cljs
 create mode 100644 js/cljs/core.cljs.cache.json
 create mode 100644 js/cljs/core.js
 create mode 100644 js/cljs/core/constants.js
 create mode 100644 js/cljs/tools/reader.cljs
 create mode 100644 js/cljs/tools/reader.cljs.cache.json
 create mode 100644 js/cljs/tools/reader.js
 create mode 100644 js/cljs/tools/reader/impl/commons.cljs
 create mode 100644 js/cljs/tools/reader/impl/commons.cljs.cache.json
 create mode 100644 js/cljs/tools/reader/impl/commons.js
 create mode 100644 js/cljs/tools/reader/impl/errors.cljs
 create mode 100644 js/cljs/tools/reader/impl/errors.cljs.cache.json
 create mode 100644 js/cljs/tools/reader/impl/errors.js
 create mode 100644 js/cljs/tools/reader/impl/inspect.cljs
 create mode 100644 js/cljs/tools/reader/impl/inspect.cljs.cache.json
 create mode 100644 js/cljs/tools/reader/impl/inspect.js
 create mode 100644 js/cljs/tools/reader/impl/utils.cljs
 create mode 100644 js/cljs/tools/reader/impl/utils.cljs.cache.json
 create mode 100644 js/cljs/tools/reader/impl/utils.js
 create mode 100644 js/cljs/tools/reader/reader_types.cljs
 create mode 100644 js/cljs/tools/reader/reader_types.cljs.cache.json
 create mode 100644 js/cljs/tools/reader/reader_types.js
 create mode 100644 js/cljsc_opts.edn
 create mode 100644 js/cljsjs/create-react-class/production/create-react-class.min.inc.js
 create mode 100644 js/cljsjs/react-dom/production/react-dom.min.inc.js
 create mode 100644 js/cljsjs/react/production/react.min.inc.js
 create mode 100644 js/clojure/data.cljs
 create mode 100644 js/clojure/data.cljs.cache.json
 create mode 100644 js/clojure/data.js
 create mode 100644 js/clojure/set.cljs
 create mode 100644 js/clojure/set.cljs.cache.json
 create mode 100644 js/clojure/set.js
 create mode 100644 js/clojure/string.cljs
 create mode 100644 js/clojure/string.cljs.cache.json
 create mode 100644 js/clojure/string.js
 create mode 100644 js/clojure/walk.cljs
 create mode 100644 js/clojure/walk.cljs.cache.json
 create mode 100644 js/clojure/walk.js
 create mode 100644 js/goog/array/array.js
 create mode 100644 js/goog/asserts/asserts.js
 create mode 100644 js/goog/async/nexttick.js
 create mode 100644 js/goog/base.js
 create mode 100644 js/goog/debug/entrypointregistry.js
 create mode 100644 js/goog/debug/error.js
 create mode 100644 js/goog/dom/htmlelement.js
 create mode 100644 js/goog/dom/nodetype.js
 create mode 100644 js/goog/dom/tagname.js
 create mode 100644 js/goog/functions/functions.js
 create mode 100644 js/goog/iter/iter.js
 create mode 100644 js/goog/labs/useragent/browser.js
 create mode 100644 js/goog/labs/useragent/engine.js
 create mode 100644 js/goog/labs/useragent/util.js
 create mode 100644 js/goog/math/integer.js
 create mode 100644 js/goog/math/long.js
 create mode 100644 js/goog/math/math.js
 create mode 100644 js/goog/object/object.js
 create mode 100644 js/goog/reflect/reflect.js
 create mode 100644 js/goog/string/string.js
 create mode 100644 js/goog/string/stringbuffer.js
 create mode 100644 js/goog/structs/map.js
 create mode 100644 js/goog/structs/structs.js
 create mode 100644 js/goog/uri/uri.js
 create mode 100644 js/goog/uri/utils.js
 create mode 100644 js/pluto.js
 create mode 100644 js/pluto/components/html.cljs.cache.json
 create mode 100644 js/pluto/components/html.js
 create mode 100644 js/pluto/examples.cljs.cache.json
 create mode 100644 js/pluto/examples.js
 create mode 100644 js/pluto/reader.cljc.cache.json
 create mode 100644 js/pluto/reader.js
 create mode 100644 js/pluto/reader/blocks.cljc.cache.json
 create mode 100644 js/pluto/reader/blocks.js
 create mode 100644 js/pluto/reader/reference.cljc.cache.json
 create mode 100644 js/pluto/reader/reference.js
 create mode 100644 js/pluto/storage.cljc.cache.json
 create mode 100644 js/pluto/storage.js
 create mode 100644 js/pluto/storage/http.cljs.cache.json
 create mode 100644 js/pluto/storage/http.js
 create mode 100644 js/pluto/storage/ipfs.cljs.cache.json
 create mode 100644 js/pluto/storage/ipfs.js
 create mode 100644 js/pluto/utils.cljc.cache.json
 create mode 100644 js/pluto/utils.js
 create mode 100644 js/process/env.cljs
 create mode 100644 js/process/env.cljs.cache.json
 create mode 100644 js/process/env.js
 create mode 100644 js/re_frame/cofx.cljc
 create mode 100644 js/re_frame/cofx.cljc.cache.json
 create mode 100644 js/re_frame/cofx.js
 create mode 100644 js/re_frame/core.cljc
 create mode 100644 js/re_frame/core.cljc.cache.json
 create mode 100644 js/re_frame/core.js
 create mode 100644 js/re_frame/db.cljc
 create mode 100644 js/re_frame/db.cljc.cache.json
 create mode 100644 js/re_frame/db.js
 create mode 100644 js/re_frame/events.cljc
 create mode 100644 js/re_frame/events.cljc.cache.json
 create mode 100644 js/re_frame/events.js
 create mode 100644 js/re_frame/fx.cljc
 create mode 100644 js/re_frame/fx.cljc.cache.json
 create mode 100644 js/re_frame/fx.js
 create mode 100644 js/re_frame/interceptor.cljc
 create mode 100644 js/re_frame/interceptor.cljc.cache.json
 create mode 100644 js/re_frame/interceptor.js
 create mode 100644 js/re_frame/interop.cljs
 create mode 100644 js/re_frame/interop.cljs.cache.json
 create mode 100644 js/re_frame/interop.js
 create mode 100644 js/re_frame/loggers.cljc
 create mode 100644 js/re_frame/loggers.cljc.cache.json
 create mode 100644 js/re_frame/loggers.js
 create mode 100644 js/re_frame/registrar.cljc
 create mode 100644 js/re_frame/registrar.cljc.cache.json
 create mode 100644 js/re_frame/registrar.js
 create mode 100644 js/re_frame/router.cljc
 create mode 100644 js/re_frame/router.cljc.cache.json
 create mode 100644 js/re_frame/router.js
 create mode 100644 js/re_frame/std_interceptors.cljc
 create mode 100644 js/re_frame/std_interceptors.cljc.cache.json
 create mode 100644 js/re_frame/std_interceptors.js
 create mode 100644 js/re_frame/subs.cljc
 create mode 100644 js/re_frame/subs.cljc.cache.json
 create mode 100644 js/re_frame/subs.js
 create mode 100644 js/re_frame/trace.cljc
 create mode 100644 js/re_frame/trace.cljc.cache.json
 create mode 100644 js/re_frame/trace.js
 create mode 100644 js/re_frame/utils.cljc
 create mode 100644 js/re_frame/utils.cljc.cache.json
 create mode 100644 js/re_frame/utils.js
 create mode 100644 js/reagent/core.cljs
 create mode 100644 js/reagent/core.cljs.cache.json
 create mode 100644 js/reagent/core.js
 create mode 100644 js/reagent/debug.cljs
 create mode 100644 js/reagent/debug.cljs.cache.json
 create mode 100644 js/reagent/debug.js
 create mode 100644 js/reagent/dom.cljs
 create mode 100644 js/reagent/dom.cljs.cache.json
 create mode 100644 js/reagent/dom.js
 create mode 100644 js/reagent/impl/batching.cljs
 create mode 100644 js/reagent/impl/batching.cljs.cache.json
 create mode 100644 js/reagent/impl/batching.js
 create mode 100644 js/reagent/impl/component.cljs
 create mode 100644 js/reagent/impl/component.cljs.cache.json
 create mode 100644 js/reagent/impl/component.js
 create mode 100644 js/reagent/impl/template.cljs
 create mode 100644 js/reagent/impl/template.cljs.cache.json
 create mode 100644 js/reagent/impl/template.js
 create mode 100644 js/reagent/impl/util.cljs
 create mode 100644 js/reagent/impl/util.cljs.cache.json
 create mode 100644 js/reagent/impl/util.js
 create mode 100644 js/reagent/interop.cljs
 create mode 100644 js/reagent/interop.cljs.cache.json
 create mode 100644 js/reagent/interop.js
 create mode 100644 js/reagent/ratom.cljs
 create mode 100644 js/reagent/ratom.cljs.cache.json
 create mode 100644 js/reagent/ratom.js

diff --git a/docs/Development.html b/docs/Development.html
index b5a72ed..f21c415 100644
--- a/docs/Development.html
+++ b/docs/Development.html
@@ -1,4 +1,4 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Development · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Development is split in feature driven milestones. Each milestone&#x27;s goal is to ship an identified set of features in a short (few weeks) time."/><meta property="og:title" content="Development · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Development is split in feature driven milestones. Each milestone&#x27;s goal is to ship an identified set of features in a short (few weeks) time."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Contributing</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li></ul></div><div class="navGroup navGroupActive"><h3>Format</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/format/Reference.html">Reference</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/Development.html">Development</a></li></ul></div></div></section></div><script>
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Development · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Development is split in feature driven milestones. Each milestone&#x27;s goal is to ship an identified set of features in a short (few weeks) time."/><meta property="og:title" content="Development · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Development is split in feature driven milestones. Each milestone&#x27;s goal is to ship an identified set of features in a short (few weeks) time."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Contributing</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Anatomy.html">Anatomy</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Hook.html">Hook</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Registry.html">Registry</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/Development.html">Development</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/Roadmap.html">Roadmap</a></li></ul></div></div></section></div><script>
             document.addEventListener('DOMContentLoaded', function() {
               createToggler('#navToggler', '#docsNav', 'docsSliderActive');
               createToggler('#tocToggler', 'body', 'tocActive');
@@ -76,4 +76,4 @@ All commits are squashed into a single commit for final merge.</p>
 <ul>
 <li>status:  available, in progress, blocked by design, 3rd party, review needed, revision needed, accepted</li>
 </ul>
-</span></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="Examples.html">← Examples</a></div></div></div><nav class="onPageNav"><ul class="toc-headings"><li><a href="#pull-request-content">Pull request content</a></li><li><a href="#definition-of-done">Definition of done</a></li><li><a href="#pull-request-lifecycle">Pull request lifecycle</a></li><li><a href="#tags">Tags</a><ul class="toc-headings"><li><a href="#issues-tags">Issues tags</a></li><li><a href="#pr-tags">PR tags</a></li></ul></li></ul></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
+</span></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="Examples.html">← Examples</a><a class="docs-next button" href="Roadmap.html">Roadmap →</a></div></div></div><nav class="onPageNav"><ul class="toc-headings"><li><a href="#pull-request-content">Pull request content</a></li><li><a href="#definition-of-done">Definition of done</a></li><li><a href="#pull-request-lifecycle">Pull request lifecycle</a></li><li><a href="#tags">Tags</a><ul class="toc-headings"><li><a href="#issues-tags">Issues tags</a></li><li><a href="#pr-tags">PR tags</a></li></ul></li></ul></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/Examples.html b/docs/Examples.html
index 1b148fb..f4bd812 100644
--- a/docs/Examples.html
+++ b/docs/Examples.html
@@ -1,4 +1,4 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Examples · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A website for testing"/><meta property="og:title" content="Examples · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A website for testing"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Examples</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li></ul></div><div class="navGroup navGroupActive"><h3>Format</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/format/Reference.html">Reference</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li></ul></div></div></section></div><script>
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Examples · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A website for testing"/><meta property="og:title" content="Examples · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A website for testing"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Examples</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Anatomy.html">Anatomy</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Hook.html">Hook</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Registry.html">Registry</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/Roadmap.html">Roadmap</a></li></ul></div></div></section></div><script>
             document.addEventListener('DOMContentLoaded', function() {
               createToggler('#navToggler', '#docsNav', 'docsSliderActive');
               createToggler('#tocToggler', 'body', 'tocActive');
@@ -21,4 +21,4 @@
                 };
               }
             });
-        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>Examples</h1></header><article><div></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="format/Reference.html">← format/Reference</a><a class="docs-next button" href="Development.html">Development →</a></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
+        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>Examples</h1></header><article><div></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="concepts/Registry.html">← concepts/Registry</a><a class="docs-next button" href="Development.html">Development →</a></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/Manifesto.html b/docs/Manifesto.html
index 3305401..2907382 100644
--- a/docs/Manifesto.html
+++ b/docs/Manifesto.html
@@ -1,4 +1,4 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Manifesto · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A website for testing"/><meta property="og:title" content="Manifesto · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A website for testing"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive siteNavItemActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Concepts</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/Manifesto.html">Manifesto</a></li></ul></div><div class="navGroup navGroupActive"><h3>Format</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/format/Reference.html">Reference</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li></ul></div></div></section></div><script>
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Manifesto · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A website for testing"/><meta property="og:title" content="Manifesto · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A website for testing"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive siteNavItemActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Concepts</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/Manifesto.html">Manifesto</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Anatomy.html">Anatomy</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Hook.html">Hook</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Registry.html">Registry</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/Roadmap.html">Roadmap</a></li></ul></div></div></section></div><script>
             document.addEventListener('DOMContentLoaded', function() {
               createToggler('#navToggler', '#docsNav', 'docsSliderActive');
               createToggler('#tocToggler', 'body', 'tocActive');
@@ -21,4 +21,4 @@
                 };
               }
             });
-        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>Manifesto</h1></header><article><div></div></article></div><div class="docs-prevnext"><a class="docs-next button" href="format/Reference.html">format/Reference →</a></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
+        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>Manifesto</h1></header><article><div></div></article></div><div class="docs-prevnext"><a class="docs-next button" href="concepts/Anatomy.html">concepts/Anatomy →</a></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/Roadmap.html b/docs/Roadmap.html
new file mode 100644
index 0000000..b65d799
--- /dev/null
+++ b/docs/Roadmap.html
@@ -0,0 +1,70 @@
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Roadmap · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Extensions development is currently in progress"/><meta property="og:title" content="Roadmap · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Extensions development is currently in progress"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Contributing</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Anatomy.html">Anatomy</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Hook.html">Hook</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Registry.html">Registry</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/Roadmap.html">Roadmap</a></li></ul></div></div></section></div><script>
+            document.addEventListener('DOMContentLoaded', function() {
+              createToggler('#navToggler', '#docsNav', 'docsSliderActive');
+              createToggler('#tocToggler', 'body', 'tocActive');
+
+              const headings = document.querySelector('.toc-headings');
+              headings && headings.addEventListener('click', function(event) {
+                if (event.target.tagName === 'A') {
+                  document.body.classList.remove('tocActive');
+                }
+              }, false);
+
+              function createToggler(togglerSelector, targetSelector, className) {
+                var toggler = document.querySelector(togglerSelector);
+                var target = document.querySelector(targetSelector);
+
+                toggler.onclick = function(event) {
+                  event.preventDefault();
+
+                  target.classList.toggle(className);
+                };
+              }
+            });
+        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>Roadmap</h1></header><article><div><span><p>Extensions development is currently in progress</p>
+<h2><a class="anchor" aria-hidden="true" id="done"></a><a href="#done" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Done</h2>
+<h3><a class="anchor" aria-hidden="true" id="pre-mvp"></a><a href="#pre-mvp" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Pre-MVP</h3>
+<p>Validate technical feasibility.</p>
+<ul>
+<li>general mechanism (UI, conditionals, queries, events)</li>
+<li>HTML based</li>
+<li>stored in ipfs (via gateway)</li>
+<li>no concept of hooks</li>
+<li>no custom code</li>
+<li>extension are activated when loaded and cannot be deactivated</li>
+</ul>
+<h3><a class="anchor" aria-hidden="true" id="mvp"></a><a href="#mvp" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>MVP</h3>
+<p>Pre-MVP integrated in Status.</p>
+<h2><a class="anchor" aria-hidden="true" id="in-progress"></a><a href="#in-progress" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>In progress</h2>
+<h3><a class="anchor" aria-hidden="true" id="iteration-1"></a><a href="#iteration-1" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Iteration 1</h3>
+<p>Migrate old commands to extensions.</p>
+<ul>
+<li>implement hooks and proposed extension points <em>DONE</em></li>
+<li>registry and hooks API <em>DONE</em></li>
+<li>define extensions points for status <em>DONE</em></li>
+<li>implement i18n <a href="https://github.com/status-im/pluto/issues/10">#10</a></li>
+<li>query and events API (data can be passed around) <a href="https://github.com/status-im/pluto/issues/9">#9</a> and <a href="https://github.com/status-im/pluto/issues/8">#8</a></li>
+<li>implement destructuring <a href="https://github.com/status-im/pluto/issues/28">#28</a></li>
+<li>isolated data per extension <a href="https://github.com/status-im/pluto/issues/29">#29</a></li>
+</ul>
+<h2><a class="anchor" aria-hidden="true" id="next"></a><a href="#next" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Next</h2>
+<h3><a class="anchor" aria-hidden="true" id="iteration-2"></a><a href="#iteration-2" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Iteration 2</h3>
+<p>Add custom code support.</p>
+<ul>
+<li>implement security mechanism / permissions</li>
+<li>remote code loading</li>
+<li>JavaScript API</li>
+</ul>
+<h3><a class="anchor" aria-hidden="true" id="iteration-3"></a><a href="#iteration-3" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Iteration 3</h3>
+<p>Persistent extensions.</p>
+<ul>
+<li>implement data persistence</li>
+<li>add extension registry UI</li>
+</ul>
+<h3><a class="anchor" aria-hidden="true" id="iteration-4"></a><a href="#iteration-4" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Iteration 4</h3>
+<p>Support dependencies.</p>
+<ul>
+<li>add versioning support</li>
+<li>extensions can depend on others extensions</li>
+</ul>
+</span></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="Development.html">← Development</a></div></div></div><nav class="onPageNav"><ul class="toc-headings"><li><a href="#done">Done</a><ul class="toc-headings"><li><a href="#pre-mvp">Pre-MVP</a></li><li><a href="#mvp">MVP</a></li></ul></li><li><a href="#in-progress">In progress</a><ul class="toc-headings"><li><a href="#iteration-1">Iteration 1</a></li></ul></li><li><a href="#next">Next</a><ul class="toc-headings"><li><a href="#iteration-2">Iteration 2</a></li><li><a href="#iteration-3">Iteration 3</a></li><li><a href="#iteration-4">Iteration 4</a></li></ul></li></ul></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/concepts/Anatomy.html b/docs/concepts/Anatomy.html
new file mode 100644
index 0000000..fe77497
--- /dev/null
+++ b/docs/concepts/Anatomy.html
@@ -0,0 +1,36 @@
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>concepts/Anatomy · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A host defines a number of [hooks](Hook) in various parts of the app. Those hooks are contracts that 3rd party devs can "/><meta property="og:title" content="concepts/Anatomy · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A host defines a number of [hooks](Hook) in various parts of the app. Those hooks are contracts that 3rd party devs can "/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Concepts</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/concepts/Anatomy.html">Anatomy</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Hook.html">Hook</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Registry.html">Registry</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/Roadmap.html">Roadmap</a></li></ul></div></div></section></div><script>
+            document.addEventListener('DOMContentLoaded', function() {
+              createToggler('#navToggler', '#docsNav', 'docsSliderActive');
+              createToggler('#tocToggler', 'body', 'tocActive');
+
+              const headings = document.querySelector('.toc-headings');
+              headings && headings.addEventListener('click', function(event) {
+                if (event.target.tagName === 'A') {
+                  document.body.classList.remove('tocActive');
+                }
+              }, false);
+
+              function createToggler(togglerSelector, targetSelector, className) {
+                var toggler = document.querySelector(togglerSelector);
+                var target = document.querySelector(targetSelector);
+
+                toggler.onclick = function(event) {
+                  event.preventDefault();
+
+                  target.classList.toggle(className);
+                };
+              }
+            });
+        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>concepts/Anatomy</h1></header><article><div><span><p>A host defines a number of <a href="Hook">hooks</a> in various parts of the app. Those hooks are contracts that 3rd party devs can
+use to extend a host with their own logic / UI.
+e.g. custom chat commands, custom chat actions, custom collectible displays.</p>
+<p>An <code>extension</code> is provided by 3rd party developers and provides one or multiple hooks implementation.</p>
+<p>To implement a hook, a 3rd party devs has access to some APIs:</p>
+<ul>
+<li><code>view</code> to create native UI (e.g. text, list)</li>
+<li><code>query</code> to access host data (e.g contacts, whisper key)</li>
+<li><code>event</code> to modify host state (e.g. create a contact, scan a QR code, send a chat message)</li>
+</ul>
+<p>Extensions are stored in IPFS or SWARM. They can be identified using ENS names.</p>
+<p>A user can discover extensions and decide to install them. Once installed associated hooks become active and modify the host.</p>
+</span></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="../Manifesto.html">← Manifesto</a><a class="docs-next button" href="Hook.html">concepts/Hook →</a></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/concepts/Hook.html b/docs/concepts/Hook.html
new file mode 100644
index 0000000..5116551
--- /dev/null
+++ b/docs/concepts/Hook.html
@@ -0,0 +1,54 @@
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>concepts/Hook · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Hook is the mechanism allowing a specific extensions host to define what (and how) can be extended."/><meta property="og:title" content="concepts/Hook · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Hook is the mechanism allowing a specific extensions host to define what (and how) can be extended."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Concepts</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Anatomy.html">Anatomy</a></li><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/concepts/Hook.html">Hook</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Registry.html">Registry</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/Roadmap.html">Roadmap</a></li></ul></div></div></section></div><script>
+            document.addEventListener('DOMContentLoaded', function() {
+              createToggler('#navToggler', '#docsNav', 'docsSliderActive');
+              createToggler('#tocToggler', 'body', 'tocActive');
+
+              const headings = document.querySelector('.toc-headings');
+              headings && headings.addEventListener('click', function(event) {
+                if (event.target.tagName === 'A') {
+                  document.body.classList.remove('tocActive');
+                }
+              }, false);
+
+              function createToggler(togglerSelector, targetSelector, className) {
+                var toggler = document.querySelector(togglerSelector);
+                var target = document.querySelector(targetSelector);
+
+                toggler.onclick = function(event) {
+                  event.preventDefault();
+
+                  target.classList.toggle(className);
+                };
+              }
+            });
+        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>concepts/Hook</h1></header><article><div><span><p>Hook is the mechanism allowing a specific extensions host to define what (and how) can be extended.</p>
+<p>Hooks are defined as part of capacities by maps detailing properties and their associated type. They leverage <a href="Reference">references</a> to use various extensions elements.</p>
+<pre><code class="hljs css languages- clojure"><span class="token punctuation">{</span><span class="token operator">:capacities</span> <span class="token punctuation">{</span>hooks/main <span class="token punctuation">{</span><span class="token operator">:properties</span> <span class="token punctuation">[</span><span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token operator">:view</span> <span class="token operator">:type</span> <span class="token operator">:view</span><span class="token punctuation">}</span> <span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token operator">:name</span> <span class="token operator">:type</span> <span class="token operator">:string</span><span class="token punctuation">}</span><span class="token punctuation">]</span><span class="token punctuation">}</span><span class="token punctuation">}</span><span class="token punctuation">}</span>
+</code></pre>
+<p>Extensions can then specify hooks that will match associated host capacities.
+Hooks implemented by extensions must be qualified with an extra id. This id will be globally unique across all extensions per hook.
+e.g. an extension implementing <code>hooks/main</code> could name it <code>hooks/main.demo</code>.</p>
+<pre><code class="hljs css languages- clojure"><span class="token punctuation">{</span><span class="token keyword">meta</span>
+ <span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token string">""</span>
+  <span class="token keyword">..</span>.<span class="token punctuation">}</span>
+ 
+ views/main
+ <span class="token punctuation">[</span>text <span class="token punctuation">{</span><span class="token punctuation">}</span>
+  <span class="token string">""</span><span class="token punctuation">]</span>
+
+ hooks/main.demo
+ <span class="token punctuation">{</span><span class="token operator">:view</span> @views/main
+  <span class="token operator">:name</span> <span class="token string">"test"</span><span class="token punctuation">}</span><span class="token punctuation">}</span>
+</code></pre>
+<p>Once a host has loaded a valid extension with matching hooks, it can query the resulting map.</p>
+<pre><code class="hljs css languages- clojure"><span class="token punctuation">{</span><span class="token keyword">meta</span>
+ <span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token string">""</span>
+  <span class="token keyword">..</span>.<span class="token punctuation">}</span>
+
+ hooks/main.demo
+ <span class="token punctuation">{</span><span class="token operator">:view</span>
+  <span class="token punctuation">[</span>text <span class="token punctuation">{</span><span class="token punctuation">}</span>
+   <span class="token string">""</span><span class="token punctuation">]</span>
+  <span class="token operator">:name</span> <span class="token string">"test"</span><span class="token punctuation">}</span><span class="token punctuation">}</span>
+</code></pre>
+</span></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="Anatomy.html">← concepts/Anatomy</a><a class="docs-next button" href="Registry.html">concepts/Registry →</a></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/concepts/Reference.html b/docs/concepts/Reference.html
new file mode 100644
index 0000000..d0ba796
--- /dev/null
+++ b/docs/concepts/Reference.html
@@ -0,0 +1,23 @@
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>concepts/Reference · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="References are identified by a symbol preceded by a @. This symbol must be define a namespace that identifies the reference type."/><meta property="og:title" content="concepts/Reference · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="References are identified by a symbol preceded by a @. This symbol must be define a namespace that identifies the reference type."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>concepts/Reference</h1></header><article><div><span><p>References are identified by a symbol preceded by a @. This symbol must be define a namespace that identifies the reference type.</p>
+<p>Reference can be:</p>
+<ul>
+<li>local (@views/id)</li>
+<li>pluto defaults, depending on the platform  (@views/<a href="http://pluto.name">pluto.name</a>)</li>
+<li>third party extensions (@views/<a href="http://my-extension.id">my-extension.id</a>) (<code>my-extension</code> registered in .stateofus.eth)</li>
+</ul>
+<pre><code class="hljs css languages- edn"><span class="hljs-symbol">:type</span>
+ <span class="hljs-symbol">:view</span> <span class="hljs-symbol">:event</span> <span class="hljs-symbol">:query</span> <span class="hljs-symbol">:i18n</span> <span class="hljs-symbol">:style</span> <span class="hljs-symbol">:extension</span> <span class="hljs-symbol">:hook</span>
+</code></pre>
+<h2><a class="anchor" aria-hidden="true" id="view"></a><a href="#view" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>View</h2>
+<h2><a class="anchor" aria-hidden="true" id="style"></a><a href="#style" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Style</h2>
+<p>Can only be resolved in properties block for the :style attribute.</p>
+<p>{:type      :view
+:positions #{:style-value}}</p>
+<h2><a class="anchor" aria-hidden="true" id="i18n"></a><a href="#i18n" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>i18n</h2>
+<p>Used as a string. Valid positions: Views/child or property value.</p>
+<pre><code class="hljs css languages- edn">{<span class="hljs-symbol">:type</span>      <span class="hljs-symbol">:view</span>
+ <span class="hljs-symbol">:positions</span> #{<span class="hljs-symbol">:child</span> <span class="hljs-symbol">:property-value</span>}}
+</code></pre>
+<h2><a class="anchor" aria-hidden="true" id="query"></a><a href="#query" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Query</h2>
+<h2><a class="anchor" aria-hidden="true" id="event"></a><a href="#event" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Event</h2>
+</span></div></article></div><div class="docs-prevnext"></div></div></div><nav class="onPageNav"><ul class="toc-headings"><li><a href="#view">View</a></li><li><a href="#style">Style</a></li><li><a href="#i18n">i18n</a></li><li><a href="#query">Query</a></li><li><a href="#event">Event</a></li></ul></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/concepts/Registry.html b/docs/concepts/Registry.html
new file mode 100644
index 0000000..f0122a3
--- /dev/null
+++ b/docs/concepts/Registry.html
@@ -0,0 +1,36 @@
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>concepts/Registry · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Registry allows to manage a set of extensions. Using registry a host can access hooks uniformly."/><meta property="og:title" content="concepts/Registry · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Registry allows to manage a set of extensions. Using registry a host can access hooks uniformly."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Concepts</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Anatomy.html">Anatomy</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/concepts/Hook.html">Hook</a></li><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/concepts/Registry.html">Registry</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li><li class="navListItem"><a class="navItem" href="/pluto/docs/Roadmap.html">Roadmap</a></li></ul></div></div></section></div><script>
+            document.addEventListener('DOMContentLoaded', function() {
+              createToggler('#navToggler', '#docsNav', 'docsSliderActive');
+              createToggler('#tocToggler', 'body', 'tocActive');
+
+              const headings = document.querySelector('.toc-headings');
+              headings && headings.addEventListener('click', function(event) {
+                if (event.target.tagName === 'A') {
+                  document.body.classList.remove('tocActive');
+                }
+              }, false);
+
+              function createToggler(togglerSelector, targetSelector, className) {
+                var toggler = document.querySelector(togglerSelector);
+                var target = document.querySelector(targetSelector);
+
+                toggler.onclick = function(event) {
+                  event.preventDefault();
+
+                  target.classList.toggle(className);
+                };
+              }
+            });
+        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>concepts/Registry</h1></header><article><div><span><p>Registry allows to manage a set of extensions. Using registry a host can access hooks uniformly.</p>
+<pre><code class="hljs css languages- clojure"><span class="token punctuation">(</span>registry/<span class="token number">add</span>! registry id extension<span class="token punctuation">)</span>
+</code></pre>
+<p>Extensions id are uniques. Hooks defined in extensions also must have global unique ids.</p>
+<p>Once in a registry an extension is inactive.
+It can be either <code>active</code> or <code>inactive</code>.</p>
+<pre><code class="hljs css languages- clojure"><span class="token punctuation">(</span>registry/deactivate! registry id<span class="token punctuation">)</span>
+<span class="token punctuation">(</span>registry/activate! registry id<span class="token punctuation">)</span>
+</code></pre>
+<p>Active hooks can then be accessed by hook id path.</p>
+<pre><code class="hljs css languages- clojure"><span class="token punctuation">(</span>registry/hooks! registry <span class="token operator">'hooks</span>/<span class="token keyword">some</span>.<span class="token keyword">name</span><span class="token punctuation">)</span>
+</code></pre>
+</span></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="Hook.html">← concepts/Hook</a><a class="docs-next button" href="../Examples.html">Examples →</a></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/concepts/Type.html b/docs/concepts/Type.html
new file mode 100644
index 0000000..d7ad82d
--- /dev/null
+++ b/docs/concepts/Type.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>concepts/Type · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Definition keys are namespaced. Namespace is used as type."/><meta property="og:title" content="concepts/Type · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Definition keys are namespaced. Namespace is used as type."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>concepts/Type</h1></header><article><div><span><p>Definition keys are namespaced. Namespace is used as type.</p>
+</span></div></article></div><div class="docs-prevnext"></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/concepts/View.html b/docs/concepts/View.html
new file mode 100644
index 0000000..fe5668c
--- /dev/null
+++ b/docs/concepts/View.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>concepts/View · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md"/><meta property="og:title" content="concepts/View · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>concepts/View</h1></header><article><div><span><p><a href="https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md">https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md</a></p>
+</span></div></article></div><div class="docs-prevnext"></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/format/Hook.html b/docs/format/Hook.html
deleted file mode 100644
index 9490a4c..0000000
--- a/docs/format/Hook.html
+++ /dev/null
@@ -1,31 +0,0 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>format/Hook · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Hook is the mechanism allowing a specific extensions host to define what (and how) can be extended."/><meta property="og:title" content="format/Hook · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Hook is the mechanism allowing a specific extensions host to define what (and how) can be extended."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>format/Hook</h1></header><article><div><span><p>Hook is the mechanism allowing a specific extensions host to define what (and how) can be extended.</p>
-<p>Hooks are defined as part of capacities by maps detailing properties and their associated type. They leverage <a href="/reference">references</a> to use various extensions elements.</p>
-<pre><code class="hljs css languages- clojure"><span class="token punctuation">{</span><span class="token operator">:capacities</span> <span class="token punctuation">{</span>hooks/main <span class="token punctuation">{</span><span class="token operator">:properties</span> <span class="token punctuation">[</span><span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token operator">:view</span> <span class="token operator">:type</span> <span class="token operator">:view</span><span class="token punctuation">}</span> <span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token operator">:name</span> <span class="token operator">:type</span> <span class="token operator">:string</span><span class="token punctuation">}</span><span class="token punctuation">]</span><span class="token punctuation">}</span><span class="token punctuation">}</span><span class="token punctuation">}</span>
-</code></pre>
-<p>Extensions can then specify hooks that will match associated host capacities.
-Hooks implemented by extensions must be qualified with an extra id. This id will be globally unique across all extensions per hook.
-e.g. an extension implementing <code>hooks/main</code> could name it <code>hooks/main.demo</code>.</p>
-<pre><code class="hljs css languages- clojure"><span class="token punctuation">{</span><span class="token keyword">meta</span>
- <span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token string">""</span>
-  <span class="token keyword">..</span>.<span class="token punctuation">}</span>
- 
- views/main
- <span class="token punctuation">[</span>text <span class="token punctuation">{</span><span class="token punctuation">}</span>
-  <span class="token string">""</span><span class="token punctuation">]</span>
-
- hooks/main.demo
- <span class="token punctuation">{</span><span class="token operator">:view</span> @views/main
-  <span class="token operator">:name</span> <span class="token string">"test"</span><span class="token punctuation">}</span><span class="token punctuation">}</span>
-</code></pre>
-<p>Once a host has loaded a valid extension with matching hooks, it can query the resulting map.</p>
-<pre><code class="hljs css languages- clojure"><span class="token punctuation">{</span><span class="token keyword">meta</span>
- <span class="token punctuation">{</span><span class="token operator">:name</span> <span class="token string">""</span>
-  <span class="token keyword">..</span>.<span class="token punctuation">}</span>
-
- hooks/main.demo
- <span class="token punctuation">{</span><span class="token operator">:view</span>
-  <span class="token punctuation">[</span>text <span class="token punctuation">{</span><span class="token punctuation">}</span>
-   <span class="token string">""</span><span class="token punctuation">]</span>
-  <span class="token operator">:name</span> <span class="token string">"test"</span><span class="token punctuation">}</span><span class="token punctuation">}</span>
-</code></pre>
-</span></div></article></div><div class="docs-prevnext"></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/format/Reference.html b/docs/format/Reference.html
deleted file mode 100644
index e22f135..0000000
--- a/docs/format/Reference.html
+++ /dev/null
@@ -1,46 +0,0 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>format/Reference · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="References are identified by a symbol preceded by a @. This symbol must be define a namespace that identifies the reference type."/><meta property="og:title" content="format/Reference · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="References are identified by a symbol preceded by a @. This symbol must be define a namespace that identifies the reference type."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class="siteNavGroupActive"><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container docsNavContainer" id="docsNav"><nav class="toc"><div class="toggleNav"><section class="navWrapper wrapper"><div class="navBreadcrumb wrapper"><div class="navToggle" id="navToggler"><i></i></div><h2><i>›</i><span>Format</span></h2><div class="tocToggler" id="tocToggler"><i class="icon-toc"></i></div></div><div class="navGroups"><div class="navGroup navGroupActive"><h3>Concepts</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Manifesto.html">Manifesto</a></li></ul></div><div class="navGroup navGroupActive"><h3>Format</h3><ul><li class="navListItem navListItemActive"><a class="navItem navItemActive" href="/pluto/docs/format/Reference.html">Reference</a></li></ul></div><div class="navGroup navGroupActive"><h3>Examples</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Examples.html">Examples</a></li></ul></div><div class="navGroup navGroupActive"><h3>Contributing</h3><ul><li class="navListItem"><a class="navItem" href="/pluto/docs/Development.html">Development</a></li></ul></div></div></section></div><script>
-            document.addEventListener('DOMContentLoaded', function() {
-              createToggler('#navToggler', '#docsNav', 'docsSliderActive');
-              createToggler('#tocToggler', 'body', 'tocActive');
-
-              const headings = document.querySelector('.toc-headings');
-              headings && headings.addEventListener('click', function(event) {
-                if (event.target.tagName === 'A') {
-                  document.body.classList.remove('tocActive');
-                }
-              }, false);
-
-              function createToggler(togglerSelector, targetSelector, className) {
-                var toggler = document.querySelector(togglerSelector);
-                var target = document.querySelector(targetSelector);
-
-                toggler.onclick = function(event) {
-                  event.preventDefault();
-
-                  target.classList.toggle(className);
-                };
-              }
-            });
-        </script></nav></div><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>format/Reference</h1></header><article><div><span><p>References are identified by a symbol preceded by a @. This symbol must be define a namespace that identifies the reference type.</p>
-<p>Reference can be:</p>
-<ul>
-<li>local (@views/id)</li>
-<li>pluto defaults, depending on the platform  (@views/<a href="http://pluto.name">pluto.name</a>)</li>
-<li>third party extensions (@views/<a href="http://my-extension.id">my-extension.id</a>) (<code>my-extension</code> registered in .stateofus.eth)</li>
-</ul>
-<pre><code class="hljs css languages- edn"><span class="hljs-symbol">:type</span>
- <span class="hljs-symbol">:view</span> <span class="hljs-symbol">:event</span> <span class="hljs-symbol">:query</span> <span class="hljs-symbol">:i18n</span> <span class="hljs-symbol">:style</span> <span class="hljs-symbol">:extension</span> <span class="hljs-symbol">:hook</span>
-</code></pre>
-<h2><a class="anchor" aria-hidden="true" id="view"></a><a href="#view" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>View</h2>
-<h2><a class="anchor" aria-hidden="true" id="style"></a><a href="#style" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Style</h2>
-<p>Can only be resolved in properties block for the :style attribute.</p>
-<p>{:type      :view
-:positions #{:style-value}}</p>
-<h2><a class="anchor" aria-hidden="true" id="i18n"></a><a href="#i18n" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>i18n</h2>
-<p>Used as a string. Valid positions: Views/child or property value.</p>
-<pre><code class="hljs css languages- edn">{<span class="hljs-symbol">:type</span>      <span class="hljs-symbol">:view</span>
- <span class="hljs-symbol">:positions</span> #{<span class="hljs-symbol">:child</span> <span class="hljs-symbol">:property-value</span>}}
-</code></pre>
-<h2><a class="anchor" aria-hidden="true" id="query"></a><a href="#query" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Query</h2>
-<h2><a class="anchor" aria-hidden="true" id="event"></a><a href="#event" aria-hidden="true" class="hash-link"><svg class="hash-link-icon" aria-hidden="true" height="16" version="1.1" viewBox="0 0 16 16" width="16"><path fill-rule="evenodd" d="M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z"></path></svg></a>Event</h2>
-</span></div></article></div><div class="docs-prevnext"><a class="docs-prev button" href="../Manifesto.html">← Manifesto</a><a class="docs-next button" href="../Examples.html">Examples →</a></div></div></div><nav class="onPageNav"><ul class="toc-headings"><li><a href="#view">View</a></li><li><a href="#style">Style</a></li><li><a href="#i18n">i18n</a></li><li><a href="#query">Query</a></li><li><a href="#event">Event</a></li></ul></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/format/Registry.html b/docs/format/Registry.html
deleted file mode 100644
index fe9c481..0000000
--- a/docs/format/Registry.html
+++ /dev/null
@@ -1,13 +0,0 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>format/Registry · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Registry allows to manage a set of extensions. Using registry a host can access hooks uniformly."/><meta property="og:title" content="format/Registry · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Registry allows to manage a set of extensions. Using registry a host can access hooks uniformly."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>format/Registry</h1></header><article><div><span><p>Registry allows to manage a set of extensions. Using registry a host can access hooks uniformly.</p>
-<pre><code class="hljs css languages- clojure"><span class="token punctuation">(</span>registry/<span class="token number">add</span>! registry id extension<span class="token punctuation">)</span>
-</code></pre>
-<p>Extensions id are uniques. Hooks defined in extensions also must have global unique ids.</p>
-<p>Once in a registry an extension is inactive.
-It can be either <code>active</code> or <code>inactive</code>.</p>
-<pre><code class="hljs css languages- clojure"><span class="token punctuation">(</span>registry/deactivate! registry id<span class="token punctuation">)</span>
-<span class="token punctuation">(</span>registry/activate! registry id<span class="token punctuation">)</span>
-</code></pre>
-<p>Active hooks can then be accessed by hook id path.</p>
-<pre><code class="hljs css languages- clojure"><span class="token punctuation">(</span>registry/hooks! registry <span class="token operator">'hooks</span>/<span class="token keyword">some</span>.<span class="token keyword">name</span><span class="token punctuation">)</span>
-</code></pre>
-</span></div></article></div><div class="docs-prevnext"></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/format/Type.html b/docs/format/Type.html
deleted file mode 100644
index 62c8924..0000000
--- a/docs/format/Type.html
+++ /dev/null
@@ -1,2 +0,0 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>format/Type · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="Definition keys are namespaced. Namespace is used as type."/><meta property="og:title" content="format/Type · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="Definition keys are namespaced. Namespace is used as type."/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>format/Type</h1></header><article><div><span><p>Definition keys are namespaced. Namespace is used as type.</p>
-</span></div></article></div><div class="docs-prevnext"></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/docs/format/View.html b/docs/format/View.html
deleted file mode 100644
index 4926c78..0000000
--- a/docs/format/View.html
+++ /dev/null
@@ -1,2 +0,0 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>format/View · Pluto</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md"/><meta property="og:title" content="format/View · Pluto"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="sideNavVisible doc separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div class="docMainWrapper wrapper"><div class="container mainContainer"><div class="wrapper"><div class="post"><header class="postHeader"><h1>format/View</h1></header><article><div><span><p><a href="https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md">https://github.com/airbnb/Lona/blob/master/docs/file-formats/component.md</a></p>
-</span></div></article></div><div class="docs-prevnext"></div></div></div><nav class="onPageNav"></nav></div><footer class="nav-footer" id="footer"><section class="sitemap"><a href="/pluto/" class="nav-home"><img src="/pluto/img/logo_white.png" alt="Pluto" width="66" height="58"/></a><div><h5>Docs</h5><a href="docs/Tutorial">Getting Started</a><a href="docs/API">API Reference</a></div><div><h5>Community</h5><a href="https://chat.status.im">Project Chat</a><a href="https://twitter.com/ethstatus" target="_blank" rel="noreferrer noopener">Twitter</a></div><div><h5>More</h5><a href="https://blog.status.im/">Blog</a><a href="https://github.com/status-im/pluto/">GitHub</a></div></section><section class="copyright">Copyright © 2018 Status.im</section></footer></div></body></html>
\ No newline at end of file
diff --git a/en/index.html b/en/index.html
index 8e6e26a..b85d83c 100644
--- a/en/index.html
+++ b/en/index.html
@@ -1,4 +1,4 @@
-<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Pluto · A website for testing</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A website for testing"/><meta property="og:title" content="Pluto · A website for testing"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A website for testing"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div><div class="homeContainer"><div class="homeSplashFade"><div class="wrapper homeWrapper"><div class="inner"><h2 class="projectTitle">Pluto<small>A grammar for data manipulation</small></h2><div class="section promoSection"><div class="promoRow"><div class="pluginRowBlock"><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/en/Tutorial" target="_self">Getting started</a></div><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/en/Try" target="_self">Try It Out</a></div></div></div></div></div></div></div></div><div class="mainContainer"><div class="container paddingBottom paddingTop"><div class="wrapper"><div class="gridBlock"><div class="blockElement alignCenter fourByGridBlock"><div class="blockContent"><h2><div><span><p>Unidirectional flow</p>
+<!DOCTYPE html><html lang="en"><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Pluto · A website for testing</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A website for testing"/><meta property="og:title" content="Pluto · A website for testing"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A website for testing"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/en/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div><div class="homeContainer"><div class="homeSplashFade"><div class="wrapper homeWrapper"><div class="inner"><h2 class="projectTitle">Pluto<small>A grammar for data manipulation</small></h2><div class="section promoSection"><div class="promoRow"><div class="pluginRowBlock"><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/en/Manifesto" target="_self">Getting started</a></div><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/en/Roadmap" target="_self">Roadmap</a></div></div></div></div></div></div></div></div><div class="mainContainer"><div class="container paddingBottom paddingTop"><div class="wrapper"><div class="gridBlock"><div class="blockElement alignCenter fourByGridBlock"><div class="blockContent"><h2><div><span><p>Unidirectional flow</p>
 </span></div></h2><div><span><p>Simple model: static UI definition, queries and events</p>
 </span></div></div></div><div class="blockElement alignCenter fourByGridBlock"><div class="blockContent"><h2><div><span><p>Security and privacy first</p>
 </span></div></h2><div><span><p>Fine grain permission model - pure data</p>
diff --git a/extensions/demo/extension.edn b/extensions/demo/extension.edn
new file mode 100644
index 0000000..91f9256
--- /dev/null
+++ b/extensions/demo/extension.edn
@@ -0,0 +1,19 @@
+{:meta
+ {:name          "Simple Demo"
+  :description   "A simple demo of extension"
+  :documentation "Nothing. Just see a text with dynamic random color."}
+
+ :hooks/main
+ {:name        ""
+  :description ""
+  :view        @views/main}
+
+ :views/main
+ [view {}
+  [text {} "Hello"]
+  (let [cond? @queries/random-boolean]
+    (if cond?
+      [text {:style {:color "green"}}
+       "World?"]
+      [text {:style {:color "red"}}
+       "World?"]))]}
diff --git a/extensions/piplette/extension.edn b/extensions/piplette/extension.edn
new file mode 100644
index 0000000..5edc94b
--- /dev/null
+++ b/extensions/piplette/extension.edn
@@ -0,0 +1,52 @@
+{meta
+ {:name          "Piplette"
+  :description   "A light client for Peepeth"
+  :documentation "..."}
+
+ lifecycle
+ {:on-activated  [@events/fetch-all-posts]}
+
+ events/fetch-all-posts
+ [@events/ethereum.logs {:address "0xfa28ec7198028438514b49a3cf353bca5541ce1d"
+                         :topics  ["PeepEth()"]
+                         :inputs  [{:name :hash :type :string}] ;; Allows to decode transaction data
+                         :on-log  [@events/fetch-ipfs]}] ;; A map of decoded data will be injected
+
+ events/fetch-ipfs
+ (let [{:keys [hash]} properties]
+   [@queries/ipfs.get {:hash       hash
+                       :on-success [@events/db.append {:path [:all-posts]}]}])
+
+ queries/all-posts
+ [@queries/db.get {:path  [:all-posts]
+                   :limit 20}]
+
+ views/post
+ ;; TODO get account details
+ ;;      handle threads
+ (let [{:keys [content untrustedAddress untrustedTimestamp parentID]} properties]
+   [view {}
+    [view {}
+     [text {}
+      untrustedAddress]
+     [text {}
+      untrustedTimestamp]]
+    [text {}
+     content]])
+
+ styles/screen
+ {:background-color #?(:android :green
+                       :ios     :red
+                       :web     :white)}
+
+ i18n/title
+ {:en "Peepeth !!"}
+
+ hooks/main
+ [screen {:style @styles/screen}
+  [toolbar {}
+   [text {}
+    @i18n/title]]
+  (let [posts @queries/all-posts]
+   [list {:data     posts
+          :template [@views/post]}])]}
diff --git a/index.html b/index.html
index 0d8f66b..c5a3d76 100644
--- a/index.html
+++ b/index.html
@@ -1,4 +1,4 @@
-<!DOCTYPE html><html><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Pluto · A grammar for data manipulation</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A grammar for data manipulation"/><meta property="og:title" content="Pluto · A grammar for data manipulation"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A grammar for data manipulation"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div><div class="homeContainer"><div class="homeSplashFade"><div class="wrapper homeWrapper"><div class="inner"><h2 class="projectTitle">Pluto<small>A grammar for data manipulation</small></h2><div class="section promoSection"><div class="promoRow"><div class="pluginRowBlock"><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/Tutorial" target="_self">Getting started</a></div><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/Try" target="_self">Try It Out</a></div></div></div></div></div></div></div></div><div class="mainContainer"><div class="container paddingBottom paddingTop"><div class="wrapper"><div class="gridBlock"><div class="blockElement alignCenter fourByGridBlock"><div class="blockContent"><h2><div><span><p>Unidirectional flow</p>
+<!DOCTYPE html><html><head><meta charSet="utf-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge"/><title>Pluto · A grammar for data manipulation</title><meta name="viewport" content="width=device-width"/><meta name="generator" content="Docusaurus"/><meta name="description" content="A grammar for data manipulation"/><meta property="og:title" content="Pluto · A grammar for data manipulation"/><meta property="og:type" content="website"/><meta property="og:url" content="https://status-im.github.io/pluto/index.html"/><meta property="og:description" content="A grammar for data manipulation"/><meta name="twitter:card" content="summary"/><link rel="shortcut icon" href="/pluto/img/favicon.png"/><link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/default.min.css"/><script type="text/javascript" src="https://buttons.github.io/buttons.js"></script><script type="text/javascript" src="/pluto/js/pluto.js"></script><link rel="stylesheet" href="/pluto/css/prism.css"/><link rel="stylesheet" href="/pluto/css/main.css"/></head><body class="separateOnPageNav"><div class="fixedHeaderContainer"><div class="headerWrapper wrapper"><header><a href="/pluto/"><img class="logo" src="/pluto/img/logo_white.png" alt="Pluto"/><h2 class="headerTitleWithLogo">Pluto</h2></a><div class="navigationWrapper navigationSlider"><nav class="slidingNav"><ul class="nav-site nav-site-internal"><li class=""><a href="/pluto/docs/Manifesto.html" target="_self">Docs</a></li><li class=""><a href="/pluto/examples.html" target="_self">Examples</a></li><li class=""><a href="/pluto/todo.html" target="_self">Try</a></li></ul></nav></div></header></div></div><div class="navPusher"><div><div class="homeContainer"><div class="homeSplashFade"><div class="wrapper homeWrapper"><div class="inner"><h2 class="projectTitle">Pluto<small>A grammar for data manipulation</small></h2><div class="section promoSection"><div class="promoRow"><div class="pluginRowBlock"><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/Manifesto" target="_self">Getting started</a></div><div class="pluginWrapper buttonWrapper"><a class="button" href="/pluto/docs/Roadmap" target="_self">Roadmap</a></div></div></div></div></div></div></div></div><div class="mainContainer"><div class="container paddingBottom paddingTop"><div class="wrapper"><div class="gridBlock"><div class="blockElement alignCenter fourByGridBlock"><div class="blockContent"><h2><div><span><p>Unidirectional flow</p>
 </span></div></h2><div><span><p>Simple model: static UI definition, queries and events</p>
 </span></div></div></div><div class="blockElement alignCenter fourByGridBlock"><div class="blockContent"><h2><div><span><p>Security and privacy first</p>
 </span></div></h2><div><span><p>Fine grain permission model - pure data</p>
diff --git a/js/cljs/core.cljs b/js/cljs/core.cljs
new file mode 100644
index 0000000..6011f4e
--- /dev/null
+++ b/js/cljs/core.cljs
@@ -0,0 +1,11539 @@
+;   Copyright (c) Rich Hickey. All rights reserved.
+;   The use and distribution terms for this software are covered by the
+;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;   which can be found in the file epl-v10.html at the root of this distribution.
+;   By using this software in any fashion, you are agreeing to be bound by
+;   the terms of this license.
+;   You must not remove this notice, or any other, from this software.
+
+(ns cljs.core
+  (:require goog.math.Long
+            goog.math.Integer
+            [goog.string :as gstring]
+            [goog.object :as gobject]
+            [goog.array :as garray]
+            [goog.Uri])
+  (:import [goog.string StringBuffer]))
+
+;; next line is auto-generated by the build-script - Do not edit!
+(def *clojurescript-version* "1.10.329")
+
+;; Setting of these Vars is in ClojureScript code is associated with intrinsics
+;; that affect compilation state, but otherwise turn into no-ops in the emitted
+;; JavaScript.
+
+;; The scope of *unchecked-if* is controlled by balanced pairs of set! calls.
+(def *unchecked-if* false)
+;; The scope of *unchecked-arrays* is file-scope: In JVM ClojureScript its side-
+;; effect is to set same-named analyzer dynamic Var, which is unset via binding
+;; scopes. In self-hosted it is cleared via cljs.js/post-file-side-effects.
+(def *unchecked-arrays* false)
+;; The scope of *warn-on-infer* is file-scope: Its side effect is to set the
+;; cljs.analyzer/*cljs-warnings* dynamic Var, which is unset via binding scopes.
+(def *warn-on-infer* false)
+
+(set! *unchecked-arrays* true)
+
+(defonce PROTOCOL_SENTINEL #js {})
+
+(def MODULE_URIS nil) ;; set by compiler
+(def MODULE_INFOS nil) ;; set by compiler
+
+(goog-define
+  ^{:dynamic true
+    :doc "Var bound to the name value of the compiler build :target option.
+  For example, if the compiler build :target is :nodejs, *target* will be bound
+  to \"nodejs\". *target* is a Google Closure define and can be set by compiler
+  :closure-defines option."}
+  *target* "default")
+
+(def
+  ^{:dynamic true
+    :doc "Var bound to the current namespace. Only used for bootstrapping."
+    :jsdoc ["@type {*}"]}
+  *ns* nil)
+
+(def
+  ^{:dynamic true
+    :jsdoc ["@type {*}"]}
+  *out* nil)
+
+(def
+  ^{:dynamic true}
+  *assert* true)
+
+(defonce
+  ^{:doc "Each runtime environment provides a different way to print output.
+  Whatever function *print-fn* is bound to will be passed any
+  Strings which should be printed." :dynamic true}
+  *print-fn* nil)
+
+(defn ^{:doc "Arranges to have tap functions executed via the supplied f, a
+  function of no arguments. Returns true if successful, false otherwise." :dynamic true}
+  *exec-tap-fn*
+  [f]
+  (and
+   (exists? js/setTimeout)
+   (js/setTimeout f 0)
+   true))
+
+(defonce
+  ^{:doc "Each runtime environment provides a different way to print error output.
+  Whatever function *print-err-fn* is bound to will be passed any
+  Strings which should be printed." :dynamic true}
+  *print-err-fn* nil)
+
+(defn set-print-fn!
+  "Set *print-fn* to f."
+  [f] (set! *print-fn* f))
+
+(defn set-print-err-fn!
+  "Set *print-err-fn* to f."
+  [f] (set! *print-err-fn* f))
+
+(def
+  ^{:dynamic true
+    :doc "When set to true, output will be flushed whenever a newline is printed.
+
+  Defaults to true."}
+  *flush-on-newline* true)
+
+(def
+  ^{:dynamic true
+    :doc "When set to logical false will drop newlines from printing calls.
+  This is to work around the implicit newlines emitted by standard JavaScript
+  console objects."}
+  *print-newline* true)
+
+(def
+  ^{:dynamic true
+    :doc "When set to logical false, strings and characters will be printed with
+  non-alphanumeric characters converted to the appropriate escape sequences.
+
+  Defaults to true"}
+  *print-readably* true)
+
+(def
+  ^{:dynamic true
+    :doc "If set to logical true, when printing an object, its metadata will also
+  be printed in a form that can be read back by the reader.
+
+  Defaults to false."}
+  *print-meta* false)
+
+(def
+  ^{:dynamic true
+    :doc "When set to logical true, objects will be printed in a way that preserves
+  their type when read in later.
+
+  Defaults to false."}
+  *print-dup* false)
+
+(def
+  ^{:dynamic true
+    :doc "*print-namespace-maps* controls whether the printer will print
+  namespace map literal syntax.
+
+  Defaults to false, but the REPL binds it to true."}
+  *print-namespace-maps* false)
+
+(def
+  ^{:dynamic true
+    :doc "*print-length* controls how many items of each collection the
+  printer will print. If it is bound to logical false, there is no
+  limit. Otherwise, it must be bound to an integer indicating the maximum
+  number of items of each collection to print. If a collection contains
+  more items, the printer will print items up to the limit followed by
+  '...' to represent the remaining items. The root binding is nil
+  indicating no limit."
+    :jsdoc ["@type {null|number}"]}
+  *print-length* nil)
+
+(def
+  ^{:dynamic true
+    :doc "*print-level* controls how many levels deep the printer will
+  print nested objects. If it is bound to logical false, there is no
+  limit. Otherwise, it must be bound to an integer indicating the maximum
+  level to print. Each argument to print is at level 0; if an argument is a
+  collection, its items are at level 1; and so on. If an object is a
+  collection and is at a level greater than or equal to the value bound to
+  *print-level*, the printer prints '#' to represent it. The root binding
+  is nil indicating no limit."
+    :jsdoc ["@type {null|number}"]}
+  *print-level* nil)
+
+(def
+  ^{:dynamic true
+    :doc "*print-fns-bodies* controls whether functions print their source or
+    only their names."}
+  *print-fn-bodies* false)
+
+(defonce
+  ^{:dynamic true
+    :jsdoc ["@type {*}"]}
+  *loaded-libs* nil)
+
+(defn- pr-opts []
+  {:flush-on-newline *flush-on-newline*
+   :readably *print-readably*
+   :meta *print-meta*
+   :dup *print-dup*
+   :print-length *print-length*})
+
+(declare into-array)
+
+(defn enable-console-print!
+  "Set *print-fn* to console.log"
+  []
+  (set! *print-newline* false)
+  (set-print-fn!
+    (fn []
+      (let [xs (js-arguments)]
+        (.apply (.-log js/console) js/console (garray/clone xs)))))
+  (set-print-err-fn!
+    (fn []
+      (let [xs (js-arguments)]
+        (.apply (.-error js/console) js/console (garray/clone xs)))))
+  nil)
+
+(def
+  ^{:doc "bound in a repl thread to the most recent value printed"}
+  *1)
+
+(def
+  ^{:doc "bound in a repl thread to the second most recent value printed"}
+  *2)
+
+(def
+  ^{:doc "bound in a repl thread to the third most recent value printed"}
+  *3)
+
+(def
+  ^{:doc "bound in a repl thread to the most recent exception caught by the repl"}
+  *e)
+
+(defn truth_
+  "Internal - do not use!"
+  [x]
+  (cljs.core/truth_ x))
+
+(def not-native nil)
+
+(declare instance? Keyword)
+
+(defn ^boolean identical?
+  "Tests if 2 arguments are the same object"
+  [x y]
+  (cljs.core/identical? x y))
+
+(defn ^boolean nil?
+  "Returns true if x is nil, false otherwise."
+  [x]
+  (coercive-= x nil))
+
+(defn ^boolean array?
+  "Returns true if x is a JavaScript array."
+  [x]
+  (if (identical? *target* "nodejs")
+    (.isArray js/Array x)
+    (instance? js/Array x)))
+
+(defn ^boolean number?
+  "Returns true if x is a JavaScript number."
+  [x]
+  (cljs.core/number? x))
+
+(defn ^boolean not
+  "Returns true if x is logical false, false otherwise."
+  [x]
+  (cond
+    (nil? x) true
+    (false? x) true
+    :else false))
+
+(defn ^boolean some?
+  "Returns true if x is not nil, false otherwise."
+  [x] (not (nil? x)))
+
+(defn ^boolean object?
+  "Returns true if x's constructor is Object"
+  [x]
+  (if-not (nil? x)
+    (identical? (.-constructor x) js/Object)
+    false))
+
+(defn ^boolean string?
+  "Returns true if x is a JavaScript string."
+  [x]
+  (goog/isString x))
+
+(defn ^boolean char?
+  "Returns true if x is a JavaScript string of length one."
+  [x]
+  (and (string? x) (== 1 (.-length x))))
+
+(defn ^boolean any?
+  "Returns true if given any argument."
+  [x] true)
+
+(set! *unchecked-if* true)
+(defn ^boolean native-satisfies?
+  "Internal - do not use!"
+  [p x]
+  (let [x (if (nil? x) nil x)]
+    (cond
+     (unchecked-get p (goog/typeOf x)) true
+     (unchecked-get p "_") true
+     :else false)))
+(set! *unchecked-if* false)
+
+(defn is_proto_
+  [x]
+  (identical? (.-prototype (.-constructor x)) x))
+
+(def
+  ^{:doc "When compiled for a command-line target, whatever function
+  *main-cli-fn* is set to will be called with the command-line
+  argv as arguments"}
+  *main-cli-fn* nil)
+
+(def
+  ^{:doc "A sequence of the supplied command line arguments, or nil if
+  none were supplied"}
+  *command-line-args* nil)
+
+(defn type
+  "Return x's constructor."
+  [x]
+  (when-not (nil? x)
+    (.-constructor x)))
+
+(defn missing-protocol [proto obj]
+  (let [ty (type obj)
+        ty (if (and ty (.-cljs$lang$type ty))
+             (.-cljs$lang$ctorStr ty)
+             (goog/typeOf obj))]
+   (js/Error.
+     (.join (array "No protocol method " proto
+                   " defined for type " ty ": " obj) ""))))
+
+(defn type->str [ty]
+  (if-let [s (.-cljs$lang$ctorStr ty)]
+    s
+    (str ty)))
+
+;; INTERNAL - do not use, only for Node.js
+(defn load-file [file]
+  (when-not js/COMPILED
+    (cljs.core/load-file* file)))
+
+(if (and (exists? js/Symbol)
+         (identical? (goog/typeOf js/Symbol) "function"))
+  (def ITER_SYMBOL (.-iterator js/Symbol))
+  (def ITER_SYMBOL "@@iterator"))
+
+(def ^{:jsdoc ["@enum {string}"]}
+  CHAR_MAP
+  #js {"-"    "_"
+       ":"    "_COLON_"
+       "+"    "_PLUS_"
+       ">"    "_GT_"
+       "<"    "_LT_"
+       "="    "_EQ_"
+       "~"    "_TILDE_"
+       "!"    "_BANG_"
+       "@"    "_CIRCA_"
+       "#"    "_SHARP_"
+       "'"    "_SINGLEQUOTE_"
+       "\\\"" "_DOUBLEQUOTE_"
+       "%"    "_PERCENT_"
+       "^"    "_CARET_"
+       "&"    "_AMPERSAND_"
+       "*"    "_STAR_"
+       "|"    "_BAR_"
+       "{"    "_LBRACE_"
+       "}"    "_RBRACE_"
+       "["    "_LBRACK_"
+       "]"    "_RBRACK_"
+       "/"    "_SLASH_"
+       "\\\\" "_BSLASH_"
+       "?"    "_QMARK_"})
+
+(def ^{:jsdoc ["@enum {string}"]}
+  DEMUNGE_MAP
+  #js {"_"             "-"
+       "_COLON_"       ":"
+       "_PLUS_"        "+"
+       "_GT_"          ">"
+       "_LT_"          "<"
+       "_EQ_"          "="
+       "_TILDE_"       "~"
+       "_BANG_"        "!"
+       "_CIRCA_"       "@"
+       "_SHARP_"       "#"
+       "_SINGLEQUOTE_" "'"
+       "_DOUBLEQUOTE_" "\\\""
+       "_PERCENT_"     "%"
+       "_CARET_"       "^"
+       "_AMPERSAND_"   "&"
+       "_STAR_"        "*"
+       "_BAR_"         "|"
+       "_LBRACE_"      "{"
+       "_RBRACE_"      "}"
+       "_LBRACK_"      "["
+       "_RBRACK_"      "]"
+       "_SLASH_"       "/"
+       "_BSLASH_"      "\\\\"
+       "_QMARK_"       "?"})
+
+(def DEMUNGE_PATTERN nil)
+
+(defn system-time
+  "Returns highest resolution time offered by host in milliseconds."
+  []
+  (cond
+    (and (exists? js/performance)
+         (not (nil? (. js/performance -now))))
+    (.now js/performance)
+
+    (and (exists? js/process)
+         (not (nil? (. js/process -hrtime))))
+    (let [t (.hrtime js/process)]
+      (/ (+ (* (aget t 0) 1e9) (aget t 1)) 1e6))
+
+    :else (.getTime (js/Date.))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; arrays ;;;;;;;;;;;;;;;;
+
+(declare apply)
+
+(defn ^array make-array
+  "Construct a JavaScript array of the specified dimensions. Accepts ignored
+  type argument for compatibility with Clojure. Note that there is no efficient
+  way to allocate multi-dimensional arrays in JavaScript; as such, this function
+  will run in polynomial time when called with 3 or more arguments."
+  ([size]
+     (js/Array. size))
+  ([type size]
+     (make-array size))
+  ([type size & more-sizes]
+    (let [dims more-sizes
+          dimarray (make-array size)]
+      (dotimes [i (alength dimarray)]
+        (aset dimarray i (apply make-array nil dims)))
+      dimarray)))
+
+(defn aclone
+  "Returns a javascript array, cloned from the passed in array"
+  [arr]
+  (let [len (alength arr)
+        new-arr (make-array len)]
+    (dotimes [i len]
+      (aset new-arr i (aget arr i)))
+    new-arr))
+
+(defn ^array array
+  "Creates a new javascript array.
+@param {...*} var_args" ;;array is a special case, don't emulate this doc string
+  [var-args]            ;; [& items]
+  (let [a (js/Array. (alength (cljs.core/js-arguments)))]
+    (loop [i 0]
+      (if (< i (alength a))
+        (do
+          (aset a i (aget (cljs.core/js-arguments) i))
+          (recur (inc i)))
+        a))))
+
+(defn- maybe-warn
+  [e]
+  (when *print-err-fn*
+    (*print-err-fn* e)))
+
+(defn- checked-aget
+  ([array idx]
+   (when-assert
+     (try
+       (assert (or (array? array) (goog/isArrayLike array)))
+       (assert (number? idx))
+       (assert (not (neg? idx)))
+       (assert (< idx (alength array)))
+       (catch :default e
+         (maybe-warn e))))
+   (unchecked-get array idx))
+  ([array idx & idxs]
+   (apply checked-aget (checked-aget array idx) idxs)))
+
+(defn- checked-aset
+  ([array idx val]
+   (when-assert
+     (try
+       (assert (or (array? array) (goog/isArrayLike array)))
+       (assert (number? idx))
+       (assert (not (neg? idx)))
+       (assert (< idx (alength array)))
+       (catch :default e
+         (maybe-warn e))))
+   (unchecked-set array idx val))
+  ([array idx idx2 & idxv]
+   (apply checked-aset (checked-aget array idx) idx2 idxv)))
+
+(defn- checked-aget'
+  ([array idx]
+   {:pre [(or (array? array) (goog/isArrayLike array))
+          (number? idx) (not (neg? idx)) (< idx (alength array))]}
+   (unchecked-get array idx))
+  ([array idx & idxs]
+   (apply checked-aget' (checked-aget' array idx) idxs)))
+
+(defn- checked-aset'
+  ([array idx val]
+   {:pre [(or (array? array) (goog/isArrayLike array))
+          (number? idx) (not (neg? idx)) (< idx (alength array))]}
+   (unchecked-set array idx val))
+  ([array idx idx2 & idxv]
+   (apply checked-aset' (checked-aget' array idx) idx2 idxv)))
+
+(defn aget
+  "Returns the value at the index/indices. Works on JavaScript arrays."
+  ([array idx]
+     (cljs.core/aget array idx))
+  ([array idx & idxs]
+     (apply aget (aget array idx) idxs)))
+
+(defn aset
+  "Sets the value at the index/indices. Works on JavaScript arrays.
+  Returns val."
+  ([array idx val]
+    (cljs.core/aset array idx val))
+  ([array idx idx2 & idxv]
+    (apply aset (aget array idx) idx2 idxv)))
+
+(defn ^number alength
+  "Returns the length of the array. Works on arrays of all types."
+  [array]
+  (cljs.core/alength array))
+
+(declare reduce)
+
+(defn ^array into-array
+  "Returns an array with components set to the values in aseq. Optional type
+  argument accepted for compatibility with Clojure."
+  ([aseq]
+     (into-array nil aseq))
+  ([type aseq]
+     (reduce (fn [a x] (.push a x) a) (array) aseq)))
+
+(defn js-invoke
+  "Invoke JavaScript object method via string. Needed when the
+  string is not a valid unquoted property name."
+  [obj s & args]
+  (.apply (unchecked-get obj s) obj (into-array args)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;; core protocols ;;;;;;;;;;;;;
+
+(defprotocol Fn
+  "Marker protocol")
+
+(defprotocol IFn
+  "Protocol for adding the ability to invoke an object as a function.
+  For example, a vector can also be used to look up a value:
+  ([1 2 3 4] 1) => 2"
+  (-invoke
+    [this]
+    [this a]
+    [this a b]
+    [this a b c]
+    [this a b c d]
+    [this a b c d e]
+    [this a b c d e f]
+    [this a b c d e f g]
+    [this a b c d e f g h]
+    [this a b c d e f g h i]
+    [this a b c d e f g h i j]
+    [this a b c d e f g h i j k]
+    [this a b c d e f g h i j k l]
+    [this a b c d e f g h i j k l m]
+    [this a b c d e f g h i j k l m n]
+    [this a b c d e f g h i j k l m n o]
+    [this a b c d e f g h i j k l m n o p]
+    [this a b c d e f g h i j k l m n o p q]
+    [this a b c d e f g h i j k l m n o p q r]
+    [this a b c d e f g h i j k l m n o p q r s]
+    [this a b c d e f g h i j k l m n o p q r s t]
+    [this a b c d e f g h i j k l m n o p q r s t rest]))
+
+(defprotocol ICloneable
+  "Protocol for cloning a value."
+  (^clj -clone [value]
+    "Creates a clone of value."))
+
+(defprotocol ICounted
+  "Protocol for adding the ability to count a collection in constant time."
+  (^number -count [coll]
+    "Calculates the count of coll in constant time. Used by cljs.core/count."))
+
+(defprotocol IEmptyableCollection
+  "Protocol for creating an empty collection."
+  (-empty [coll]
+    "Returns an empty collection of the same category as coll. Used
+     by cljs.core/empty."))
+
+(defprotocol ICollection
+  "Protocol for adding to a collection."
+  (^clj -conj [coll o]
+    "Returns a new collection of coll with o added to it. The new item
+     should be added to the most efficient place, e.g.
+     (conj [1 2 3 4] 5) => [1 2 3 4 5]
+     (conj '(2 3 4 5) 1) => '(1 2 3 4 5)"))
+
+#_(defprotocol IOrdinal
+    (-index [coll]))
+
+(defprotocol IIndexed
+  "Protocol for collections to provide indexed-based access to their items."
+  (-nth [coll n] [coll n not-found]
+    "Returns the value at the index n in the collection coll.
+     Returns not-found if index n is out of bounds and not-found is supplied."))
+
+(defprotocol ASeq
+  "Marker protocol indicating an array sequence.")
+
+(defprotocol ISeq
+  "Protocol for collections to provide access to their items as sequences."
+  (-first [coll]
+    "Returns the first item in the collection coll. Used by cljs.core/first.")
+  (^clj -rest [coll]
+    "Returns a new collection of coll without the first item. It should
+     always return a seq, e.g.
+     (rest []) => ()
+     (rest nil) => ()"))
+
+(defprotocol INext
+  "Protocol for accessing the next items of a collection."
+  (^clj-or-nil -next [coll]
+    "Returns a new collection of coll without the first item. In contrast to
+     rest, it should return nil if there are no more items, e.g.
+     (next []) => nil
+     (next nil) => nil"))
+
+(defprotocol ILookup
+  "Protocol for looking up a value in a data structure."
+  (-lookup [o k] [o k not-found]
+    "Use k to look up a value in o. If not-found is supplied and k is not
+     a valid value that can be used for look up, not-found is returned."))
+
+(defprotocol IAssociative
+  "Protocol for adding associativity to collections."
+  (^boolean -contains-key? [coll k]
+    "Returns true if k is a key in coll.")
+  #_(-entry-at [coll k])
+  (^clj -assoc [coll k v]
+    "Returns a new collection of coll with a mapping from key k to
+     value v added to it."))
+
+(defprotocol IFind
+  "Protocol for implementing entry finding in collections."
+  (-find [coll k] "Returns the map entry for key, or nil if key not present."))
+
+(defprotocol IMap
+  "Protocol for adding mapping functionality to collections."
+  #_(-assoc-ex [coll k v])
+  (^clj -dissoc [coll k]
+    "Returns a new collection of coll without the mapping for key k."))
+
+(defprotocol IMapEntry
+  "Protocol for examining a map entry."
+  (-key [coll]
+    "Returns the key of the map entry.")
+  (-val [coll]
+    "Returns the value of the map entry."))
+
+(defprotocol ISet
+  "Protocol for adding set functionality to a collection."
+  (^clj -disjoin [coll v]
+    "Returns a new collection of coll that does not contain v."))
+
+(defprotocol IStack
+  "Protocol for collections to provide access to their items as stacks. The top
+  of the stack should be accessed in the most efficient way for the different
+  data structures."
+  (-peek [coll]
+    "Returns the item from the top of the stack. Is used by cljs.core/peek.")
+  (^clj -pop [coll]
+    "Returns a new stack without the item on top of the stack. Is used
+     by cljs.core/pop."))
+
+(defprotocol IVector
+  "Protocol for adding vector functionality to collections."
+  (^clj -assoc-n [coll n val]
+    "Returns a new vector with value val added at position n."))
+
+(defprotocol IDeref
+  "Protocol for adding dereference functionality to a reference."
+  (-deref [o]
+    "Returns the value of the reference o."))
+
+(defprotocol IDerefWithTimeout
+  (-deref-with-timeout [o msec timeout-val]))
+
+(defprotocol IMeta
+  "Protocol for accessing the metadata of an object."
+  (^clj-or-nil -meta [o]
+    "Returns the metadata of object o."))
+
+(defprotocol IWithMeta
+  "Protocol for adding metadata to an object."
+  (^clj -with-meta [o meta]
+    "Returns a new object with value of o and metadata meta added to it."))
+
+(defprotocol IReduce
+  "Protocol for seq types that can reduce themselves.
+  Called by cljs.core/reduce."
+  (-reduce [coll f] [coll f start]
+    "f should be a function of 2 arguments. If start is not supplied,
+     returns the result of applying f to the first 2 items in coll, then
+     applying f to that result and the 3rd item, etc."))
+
+(defprotocol IKVReduce
+  "Protocol for associative types that can reduce themselves
+  via a function of key and val. Called by cljs.core/reduce-kv."
+  (-kv-reduce [coll f init]
+    "Reduces an associative collection and returns the result. f should be
+     a function that takes three arguments."))
+
+(defprotocol IEquiv
+  "Protocol for adding value comparison functionality to a type."
+  (^boolean -equiv [o other]
+    "Returns true if o and other are equal, false otherwise."))
+
+(defprotocol IHash
+  "Protocol for adding hashing functionality to a type."
+  (-hash [o]
+    "Returns the hash code of o."))
+
+(defprotocol ISeqable
+  "Protocol for adding the ability to a type to be transformed into a sequence."
+  (^clj-or-nil -seq [o]
+    "Returns a seq of o, or nil if o is empty."))
+
+(defprotocol ISequential
+  "Marker interface indicating a persistent collection of sequential items")
+
+(defprotocol IList
+  "Marker interface indicating a persistent list")
+
+(defprotocol IRecord
+  "Marker interface indicating a record object")
+
+(defprotocol IReversible
+  "Protocol for reversing a seq."
+  (^clj -rseq [coll]
+    "Returns a seq of the items in coll in reversed order."))
+
+(defprotocol ISorted
+  "Protocol for a collection which can represent their items
+  in a sorted manner. "
+  (^clj -sorted-seq [coll ascending?]
+    "Returns a sorted seq from coll in either ascending or descending order.")
+  (^clj -sorted-seq-from [coll k ascending?]
+    "Returns a sorted seq from coll in either ascending or descending order.
+     If ascending is true, the result should contain all items which are > or >=
+     than k. If ascending is false, the result should contain all items which
+     are < or <= than k, e.g.
+     (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 true) => (3 4 5)
+     (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 false) => (3 2 1)")
+  (-entry-key [coll entry]
+    "Returns the key for entry.")
+  (-comparator [coll]
+    "Returns the comparator for coll."))
+
+(defprotocol IWriter
+  "Protocol for writing. Currently only implemented by StringBufferWriter."
+  (-write [writer s]
+    "Writes s with writer and returns the result.")
+  (-flush [writer]
+    "Flush writer."))
+
+(defprotocol IPrintWithWriter
+  "The old IPrintable protocol's implementation consisted of building a giant
+   list of strings to concatenate.  This involved lots of concat calls,
+   intermediate vectors, and lazy-seqs, and was very slow in some older JS
+   engines.  IPrintWithWriter implements printing via the IWriter protocol, so it
+   be implemented efficiently in terms of e.g. a StringBuffer append."
+  (-pr-writer [o writer opts]))
+
+(defprotocol IPending
+  "Protocol for types which can have a deferred realization. Currently only
+  implemented by Delay and LazySeq."
+  (^boolean -realized? [x]
+    "Returns true if a value for x has been produced, false otherwise."))
+
+(defprotocol IWatchable
+  "Protocol for types that can be watched. Currently only implemented by Atom."
+  (-notify-watches [this oldval newval]
+    "Calls all watchers with this, oldval and newval.")
+  (-add-watch [this key f]
+    "Adds a watcher function f to this. Keys must be unique per reference,
+     and can be used to remove the watch with -remove-watch.")
+  (-remove-watch [this key]
+    "Removes watcher that corresponds to key from this."))
+
+(defprotocol IEditableCollection
+  "Protocol for collections which can transformed to transients."
+  (^clj -as-transient [coll]
+    "Returns a new, transient version of the collection, in constant time."))
+
+(defprotocol ITransientCollection
+  "Protocol for adding basic functionality to transient collections."
+  (^clj -conj! [tcoll val]
+    "Adds value val to tcoll and returns tcoll.")
+  (^clj -persistent! [tcoll]
+    "Creates a persistent data structure from tcoll and returns it."))
+
+(defprotocol ITransientAssociative
+  "Protocol for adding associativity to transient collections."
+  (^clj -assoc! [tcoll key val]
+    "Returns a new transient collection of tcoll with a mapping from key to
+     val added to it."))
+
+(defprotocol ITransientMap
+  "Protocol for adding mapping functionality to transient collections."
+  (^clj -dissoc! [tcoll key]
+    "Returns a new transient collection of tcoll without the mapping for key."))
+
+(defprotocol ITransientVector
+  "Protocol for adding vector functionality to transient collections."
+  (^clj -assoc-n! [tcoll n val]
+    "Returns tcoll with value val added at position n.")
+  (^clj -pop! [tcoll]
+    "Returns tcoll with the last item removed from it."))
+
+(defprotocol ITransientSet
+  "Protocol for adding set functionality to a transient collection."
+  (^clj -disjoin! [tcoll v]
+    "Returns tcoll without v."))
+
+(defprotocol IComparable
+  "Protocol for values that can be compared."
+  (^number -compare [x y]
+    "Returns a negative number, zero, or a positive number when x is logically
+     'less than', 'equal to', or 'greater than' y."))
+
+(defprotocol IChunk
+  "Protocol for accessing the items of a chunk."
+  (-drop-first [coll]
+    "Return a new chunk of coll with the first item removed."))
+
+(defprotocol IChunkedSeq
+  "Protocol for accessing a collection as sequential chunks."
+  (-chunked-first [coll]
+    "Returns the first chunk in coll.")
+  (-chunked-rest [coll]
+    "Return a new collection of coll with the first chunk removed."))
+
+(defprotocol IChunkedNext
+  "Protocol for accessing the chunks of a collection."
+  (-chunked-next [coll]
+    "Returns a new collection of coll without the first chunk."))
+
+(defprotocol INamed
+  "Protocol for adding a name."
+  (^string -name [x]
+    "Returns the name String of x.")
+  (^string -namespace [x]
+    "Returns the namespace String of x."))
+
+(defprotocol IAtom
+  "Marker protocol indicating an atom.")
+
+(defprotocol IReset
+  "Protocol for adding resetting functionality."
+  (-reset! [o new-value]
+    "Sets the value of o to new-value."))
+
+(defprotocol ISwap
+  "Protocol for adding swapping functionality."
+  (-swap! [o f] [o f a] [o f a b] [o f a b xs]
+    "Swaps the value of o to be (apply f current-value-of-atom args)."))
+
+(defprotocol IVolatile
+  "Protocol for adding volatile functionality."
+  (-vreset! [o new-value]
+    "Sets the value of volatile o to new-value without regard for the
+     current value. Returns new-value."))
+
+(defprotocol IIterable
+  "Protocol for iterating over a collection."
+  (-iterator [coll]
+    "Returns an iterator for coll."))
+
+;; Printing support
+
+(deftype StringBufferWriter [sb]
+  IWriter
+  (-write [_ s] (.append sb s))
+  (-flush [_] nil))
+
+(defn pr-str*
+  "Support so that collections can implement toString without
+   loading all the printing machinery."
+  [^not-native obj]
+  (let [sb (StringBuffer.)
+        writer (StringBufferWriter. sb)]
+    (-pr-writer obj writer (pr-opts))
+    (-flush writer)
+    (str sb)))
+
+;;;;;;;;;;;;;;;;;;; Murmur3 ;;;;;;;;;;;;;;;
+
+;;http://hg.openjdk.java.net/jdk7u/jdk7u6/jdk/file/8c2c5d63a17e/src/share/classes/java/lang/Integer.java
+(defn ^number int-rotate-left [x n]
+  (bit-or
+    (bit-shift-left x n)
+    (unsigned-bit-shift-right x (- n))))
+
+;; http://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/imul
+(if (and (exists? Math/imul)
+         (not (zero? (Math/imul 0xffffffff 5))))
+  (defn ^number imul [a b] (Math/imul a b))
+  (defn ^number imul [a b]
+    (let [ah (bit-and (unsigned-bit-shift-right a 16) 0xffff)
+          al (bit-and a 0xffff)
+          bh (bit-and (unsigned-bit-shift-right b 16) 0xffff)
+          bl (bit-and b 0xffff)]
+      (bit-or
+        (+ (* al bl)
+           (unsigned-bit-shift-right
+             (bit-shift-left (+ (* ah bl) (* al bh)) 16) 0)) 0))))
+
+;; http://smhasher.googlecode.com/svn/trunk/MurmurHash3.cpp
+(def m3-seed 0)
+(def m3-C1 (int 0xcc9e2d51))
+(def m3-C2 (int 0x1b873593))
+
+(defn ^number m3-mix-K1 [k1]
+  (-> (int k1) (imul m3-C1) (int-rotate-left 15) (imul m3-C2)))
+
+(defn ^number m3-mix-H1 [h1 k1]
+  (int (-> (int h1) (bit-xor (int k1)) (int-rotate-left 13) (imul 5) (+ (int 0xe6546b64)))))
+
+(defn ^number m3-fmix [h1 len]
+  (as-> (int h1) h1
+    (bit-xor h1 len)
+    (bit-xor h1 (unsigned-bit-shift-right h1 16))
+    (imul h1 (int 0x85ebca6b))
+    (bit-xor h1 (unsigned-bit-shift-right h1 13))
+    (imul h1 (int 0xc2b2ae35))
+    (bit-xor h1 (unsigned-bit-shift-right h1 16))))
+
+(defn ^number m3-hash-int [in]
+  (if (zero? in)
+    in
+    (let [k1 (m3-mix-K1 in)
+          h1 (m3-mix-H1 m3-seed k1)]
+      (m3-fmix h1 4))))
+
+(defn ^number m3-hash-unencoded-chars [in]
+  (let [h1 (loop [i 1 h1 m3-seed]
+             (if (< i (.-length in))
+               (recur (+ i 2)
+                 (m3-mix-H1 h1
+                   (m3-mix-K1
+                     (bit-or (.charCodeAt in (dec i))
+                       (bit-shift-left (.charCodeAt in i) 16)))))
+               h1))
+        h1 (if (== (bit-and (.-length in) 1) 1)
+             (bit-xor h1 (m3-mix-K1 (.charCodeAt in (dec (.-length in)))))
+             h1)]
+    (m3-fmix h1 (imul 2 (.-length in)))))
+
+;;;;;;;;;;;;;;;;;;; symbols ;;;;;;;;;;;;;;;
+
+(declare list Symbol = compare)
+
+;; Simple caching of string hashcode
+(def string-hash-cache (js-obj))
+(def string-hash-cache-count 0)
+
+;;http://hg.openjdk.java.net/jdk7u/jdk7u6/jdk/file/8c2c5d63a17e/src/share/classes/java/lang/String.java
+(defn hash-string* [s]
+  (if-not (nil? s)
+    (let [len (.-length s)]
+      (if (pos? len)
+        (loop [i 0 hash 0]
+          (if (< i len)
+            (recur (inc i) (+ (imul 31 hash) (.charCodeAt s i)))
+            hash))
+        0))
+    0))
+
+(defn add-to-string-hash-cache [k]
+  (let [h (hash-string* k)]
+    (gobject/set string-hash-cache k h)
+    (set! string-hash-cache-count (inc string-hash-cache-count))
+    h))
+
+(defn hash-string [k]
+  (when (> string-hash-cache-count 255)
+    (set! string-hash-cache (js-obj))
+    (set! string-hash-cache-count 0))
+  (if (nil? k)
+    0
+    (let [h (unchecked-get string-hash-cache k)]
+      (if (number? h)
+        h
+        (add-to-string-hash-cache k)))))
+
+(defn hash
+  "Returns the hash code of its argument. Note this is the hash code
+   consistent with =."
+  [o]
+  (cond
+    (implements? IHash o)
+    (bit-xor (-hash ^not-native o) 0)
+
+    (number? o)
+    (if (js/isFinite o)
+      (js-mod (Math/floor o) 2147483647)
+      (case o
+        ##Inf
+        2146435072
+        ##-Inf
+        -1048576
+        2146959360))
+
+    ;; note: mirrors Clojure's behavior on the JVM, where the hashCode is
+    ;; 1231 for true and 1237 for false
+    ;; http://docs.oracle.com/javase/7/docs/api/java/lang/Boolean.html#hashCode%28%29
+    (true? o) 1231
+
+    (false? o) 1237
+
+    (string? o)
+    (m3-hash-int (hash-string o))
+
+    (instance? js/Date o)
+    (bit-xor (.valueOf o) 0)
+
+    (nil? o) 0
+
+    :else
+    (bit-xor (-hash o) 0)))
+
+(defn hash-combine [seed hash]
+  ; a la boost
+  (bit-xor seed
+    (+ hash 0x9e3779b9
+      (bit-shift-left seed 6)
+      (bit-shift-right seed 2))))
+
+(defn ^boolean instance?
+  "Evaluates x and tests if it is an instance of the type
+  c. Returns true or false"
+  [c x]
+  (cljs.core/instance? c x))
+
+(defn ^boolean symbol?
+  "Return true if x is a Symbol"
+  [x]
+  (instance? Symbol x))
+
+(defn- hash-symbol [sym]
+  (hash-combine
+    (m3-hash-unencoded-chars (.-name sym))
+    (hash-string (.-ns sym))))
+
+(defn- compare-symbols [a b]
+  (cond
+   (identical? (.-str a) (.-str b)) 0
+   (and (not (.-ns a)) (.-ns b)) -1
+   (.-ns a) (if-not (.-ns b)
+              1
+              (let [nsc (garray/defaultCompare (.-ns a) (.-ns b))]
+                (if (== 0 nsc)
+                  (garray/defaultCompare (.-name a) (.-name b))
+                  nsc)))
+   :default (garray/defaultCompare (.-name a) (.-name b))))
+
+(declare get)
+
+(deftype Symbol [ns name str ^:mutable _hash _meta]
+  Object
+  (toString [_] str)
+  (equiv [this other] (-equiv this other))
+
+  IEquiv
+  (-equiv [_ other]
+    (if (instance? Symbol other)
+      (identical? str (.-str other))
+      false))
+
+  IFn
+  (-invoke [sym coll]
+    (get coll sym))
+  (-invoke [sym coll not-found]
+    (get coll sym not-found))
+
+  IMeta
+  (-meta [_] _meta)
+
+  IWithMeta
+  (-with-meta [_ new-meta] (Symbol. ns name str _hash new-meta))
+
+  IHash
+  (-hash [sym]
+    (caching-hash sym hash-symbol _hash))
+
+  INamed
+  (-name [_] name)
+  (-namespace [_] ns)
+
+  IPrintWithWriter
+  (-pr-writer [o writer _] (-write writer str)))
+
+(defn symbol
+  "Returns a Symbol with the given namespace and name."
+  ([name]
+   (if (symbol? name)
+     name
+     (let [idx (.indexOf name "/")]
+       (if (< idx 1)
+         (symbol nil name)
+         (symbol (.substring name 0 idx)
+                 (.substring name (inc idx) (. name -length)))))))
+  ([ns name]
+   (let [sym-str (if-not (nil? ns)
+                   (str ns "/" name)
+                   name)]
+     (Symbol. ns name sym-str nil nil))))
+
+(deftype Var [val sym _meta]
+  Object
+  (isMacro [_]
+    (. (val) -cljs$lang$macro))
+  (toString [_]
+    (str "#'" sym))
+  IDeref
+  (-deref [_] (val))
+  IMeta
+  (-meta [_] _meta)
+  IWithMeta
+  (-with-meta [_ new-meta]
+    (Var. val sym new-meta))
+  IEquiv
+  (-equiv [this other]
+    (if (instance? Var other)
+      (= (.-sym this) (.-sym other))
+      false))
+  IHash
+  (-hash [_]
+    (hash-symbol sym))
+  Fn
+  IFn
+  (-invoke [_]
+    ((val)))
+  (-invoke [_ a]
+    ((val) a))
+  (-invoke [_ a b]
+    ((val) a b))
+  (-invoke [_ a b c]
+    ((val) a b c))
+  (-invoke [_ a b c d]
+    ((val) a b c d))
+  (-invoke [_ a b c d e]
+    ((val) a b c d e))
+  (-invoke [_ a b c d e f]
+    ((val) a b c d e f))
+  (-invoke [_ a b c d e f g]
+    ((val) a b c d e f g))
+  (-invoke [_ a b c d e f g h]
+    ((val) a b c d e f g h))
+  (-invoke [_ a b c d e f g h i]
+    ((val) a b c d e f g h i))
+  (-invoke [_ a b c d e f g h i j]
+    ((val) a b c d e f g h i j))
+  (-invoke [_ a b c d e f g h i j k]
+    ((val) a b c d e f g h i j k))
+  (-invoke [_ a b c d e f g h i j k l]
+    ((val) a b c d e f g h i j k l))
+  (-invoke [_ a b c d e f g h i j k l m]
+    ((val) a b c d e f g h i j k l m))
+  (-invoke [_ a b c d e f g h i j k l m n]
+    ((val) a b c d e f g h i j k l m n))
+  (-invoke [_ a b c d e f g h i j k l m n o]
+    ((val) a b c d e f g h i j k l m n o))
+  (-invoke [_ a b c d e f g h i j k l m n o p]
+    ((val) a b c d e f g h i j k l m n o p))
+  (-invoke [_ a b c d e f g h i j k l m n o p q]
+    ((val) a b c d e f g h i j k l m n o p q))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r]
+    ((val) a b c d e f g h i j k l m n o p q r))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s]
+    ((val) a b c d e f g h i j k l m n o p q r s))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s t]
+    ((val) a b c d e f g h i j k l m n o p q r s t))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s t rest]
+    (apply (val) a b c d e f g h i j k l m n o p q r s t rest)))
+
+(defn ^boolean var?
+  "Returns true if v is of type cljs.core.Var"
+  [v]
+  (instance? cljs.core.Var v))
+
+;;;;;;;;;;;;;;;;;;; fundamentals ;;;;;;;;;;;;;;;
+
+(declare array-seq prim-seq IndexedSeq)
+
+(defn ^boolean iterable?
+  "Return true if x implements IIterable protocol."
+  [x]
+  (satisfies? IIterable x))
+
+(defn clone
+  "Clone the supplied value which must implement ICloneable."
+  [value]
+  (-clone value))
+
+(defn ^boolean cloneable?
+  "Return true if x implements ICloneable protocol."
+  [value]
+  (satisfies? ICloneable value))
+
+(defn ^seq seq
+  "Returns a seq on the collection. If the collection is
+  empty, returns nil.  (seq nil) returns nil. seq also works on
+  Strings."
+  [coll]
+  (when-not (nil? coll)
+    (cond
+      (implements? ISeqable coll)
+      (-seq ^not-native coll)
+
+      (array? coll)
+      (when-not (zero? (alength coll))
+        (IndexedSeq. coll 0 nil))
+
+      (string? coll)
+      (when-not (zero? (alength coll))
+        (IndexedSeq. coll 0 nil))
+
+      (native-satisfies? ISeqable coll)
+      (-seq coll)
+
+      :else (throw (js/Error. (str coll " is not ISeqable"))))))
+
+(defn first
+  "Returns the first item in the collection. Calls seq on its
+  argument. If coll is nil, returns nil."
+  [coll]
+  (when-not (nil? coll)
+    (if (implements? ISeq coll)
+      (-first ^not-native coll)
+      (let [s (seq coll)]
+        (when-not (nil? s)
+          (-first s))))))
+
+(defn ^seq rest
+  "Returns a possibly empty seq of the items after the first. Calls seq on its
+  argument."
+  [coll]
+  (if-not (nil? coll)
+    (if (implements? ISeq coll)
+      (-rest ^not-native coll)
+      (let [s (seq coll)]
+        (if s
+          (-rest ^not-native s)
+          ())))
+    ()))
+
+(defn ^seq next
+  "Returns a seq of the items after the first. Calls seq on its
+  argument.  If there are no more items, returns nil"
+  [coll]
+  (when-not (nil? coll)
+    (if (implements? INext coll)
+      (-next ^not-native coll)
+      (seq (rest coll)))))
+
+(defn ^boolean =
+  "Equality. Returns true if x equals y, false if not. Compares
+  numbers and collections in a type-independent manner.  Clojure's immutable data
+  structures define -equiv (and thus =) as a value, not an identity,
+  comparison."
+  ([x] true)
+  ([x y]
+    (if (nil? x)
+      (nil? y)
+      (or (identical? x y)
+        ^boolean (-equiv x y))))
+  ([x y & more]
+     (if (= x y)
+       (if (next more)
+         (recur y (first more) (next more))
+         (= y (first more)))
+       false)))
+
+;; EXPERIMENTAL: subject to change
+(deftype ES6Iterator [^:mutable s]
+  Object
+  (next [_]
+    (if-not (nil? s)
+      (let [x (first s)]
+        (set! s (next s))
+        #js {:value x :done false})
+      #js {:value nil :done true})))
+
+(defn es6-iterator
+  "EXPERIMENTAL: Return a ES2015 compatible iterator for coll."
+  [coll]
+  (ES6Iterator. (seq coll)))
+
+(declare es6-iterator-seq)
+
+(deftype ES6IteratorSeq [value iter ^:mutable _rest]
+  ISeqable
+  (-seq [this] this)
+  ISeq
+  (-first [_] value)
+  (-rest [_]
+    (when (nil? _rest)
+      (set! _rest (es6-iterator-seq iter)))
+    _rest))
+
+(defn es6-iterator-seq
+  "EXPERIMENTAL: Given an ES2015 compatible iterator return a seq."
+  [iter]
+  (let [v (.next iter)]
+    (if (.-done v)
+      ()
+      (ES6IteratorSeq. (.-value v) iter nil))))
+
+;;;;;;;;;;;;;;;;;;; Murmur3 Helpers ;;;;;;;;;;;;;;;;
+
+(defn ^number mix-collection-hash
+  "Mix final collection hash for ordered or unordered collections.
+   hash-basis is the combined collection hash, count is the number
+   of elements included in the basis. Note this is the hash code
+   consistent with =, different from .hashCode.
+   See http://clojure.org/data_structures#hash for full algorithms."
+  [hash-basis count]
+  (let [h1 m3-seed
+        k1 (m3-mix-K1 hash-basis)
+        h1 (m3-mix-H1 h1 k1)]
+    (m3-fmix h1 count)))
+
+(defn ^number hash-ordered-coll
+  "Returns the hash code, consistent with =, for an external ordered
+   collection implementing Iterable.
+   See http://clojure.org/data_structures#hash for full algorithms."
+  [coll]
+  (loop [n 0 hash-code 1 coll (seq coll)]
+    (if-not (nil? coll)
+      (recur (inc n) (bit-or (+ (imul 31 hash-code) (hash (first coll))) 0)
+        (next coll))
+      (mix-collection-hash hash-code n))))
+
+(def ^:private empty-ordered-hash
+  (mix-collection-hash 1 0))
+
+(defn ^number hash-unordered-coll
+  "Returns the hash code, consistent with =, for an external unordered
+   collection implementing Iterable. For maps, the iterator should
+   return map entries whose hash is computed as
+     (hash-ordered-coll [k v]).
+   See http://clojure.org/data_structures#hash for full algorithms."
+  [coll]
+  (loop [n 0 hash-code 0 coll (seq coll)]
+    (if-not (nil? coll)
+      (recur (inc n) (bit-or (+ hash-code (hash (first coll))) 0) (next coll))
+      (mix-collection-hash hash-code n))))
+
+(def ^:private empty-unordered-hash
+  (mix-collection-hash 0 0))
+
+;;;;;;;;;;;;;;;;;;; protocols on primitives ;;;;;;;;
+(declare hash-map list equiv-sequential)
+
+(extend-type nil
+  ICounted
+  (-count [_] 0))
+
+;; TODO: we should remove this and handle date equality checking
+;; by some other means, probably by adding a new primitive type
+;; case to the hash table lookup - David
+
+(extend-type js/Date
+  IEquiv
+  (-equiv [o other]
+    (and (instance? js/Date other)
+         (== (.valueOf o) (.valueOf other))))
+
+  IComparable
+  (-compare [this other]
+    (if (instance? js/Date other)
+      (garray/defaultCompare (.valueOf this) (.valueOf other))
+      (throw (js/Error. (str "Cannot compare " this " to " other))))))
+
+(defprotocol Inst
+  (inst-ms* [inst]))
+
+(extend-protocol Inst
+  js/Date
+  (inst-ms* [inst] (.getTime inst)))
+
+(defn inst-ms
+  "Return the number of milliseconds since January 1, 1970, 00:00:00 GMT"
+  [inst]
+  (inst-ms* inst))
+
+(defn ^boolean inst?
+  "Return true if x satisfies Inst"
+  [x]
+  (satisfies? Inst x))
+
+(extend-type number
+  IEquiv
+  (-equiv [x o] (identical? x o)))
+
+(declare with-meta)
+
+(extend-type function
+  Fn
+  IMeta
+  (-meta [_] nil))
+
+(extend-type default
+  IHash
+  (-hash [o]
+    (goog/getUid o)))
+
+;;this is primitive because & emits call to array-seq
+(defn inc
+  "Returns a number one greater than num."
+  [x] (cljs.core/+ x 1))
+
+(declare deref)
+
+(deftype Reduced [val]
+  IDeref
+  (-deref [o] val))
+
+(defn reduced
+  "Wraps x in a way such that a reduce will terminate with the value x"
+  [x]
+  (Reduced. x))
+
+(defn ^boolean reduced?
+  "Returns true if x is the result of a call to reduced"
+  [r]
+  (instance? Reduced r))
+
+(defn ensure-reduced
+  "If x is already reduced?, returns it, else returns (reduced x)"
+  [x]
+  (if (reduced? x) x (reduced x)))
+
+(defn unreduced
+  "If x is reduced?, returns (deref x), else returns x"
+  [x]
+  (if (reduced? x) (deref x) x))
+
+;; generic to all refs
+;; (but currently hard-coded to atom!)
+(defn deref
+  "Also reader macro: @var/@atom/@delay. Returns the
+   most-recently-committed value of ref. When applied to a var
+   or atom, returns its current state. When applied to a delay, forces
+   it if not already forced. See also - realized?."
+  [o]
+  (-deref o))
+
+(defn- ci-reduce
+  "Accepts any collection which satisfies the ICount and IIndexed protocols and
+reduces them without incurring seq initialization"
+  ([cicoll f]
+     (let [cnt (-count cicoll)]
+       (if (zero? cnt)
+         (f)
+         (loop [val (-nth cicoll 0), n 1]
+           (if (< n cnt)
+             (let [nval (f val (-nth cicoll n))]
+               (if (reduced? nval)
+                 @nval
+                 (recur nval (inc n))))
+             val)))))
+  ([cicoll f val]
+     (let [cnt (-count cicoll)]
+       (loop [val val, n 0]
+         (if (< n cnt)
+           (let [nval (f val (-nth cicoll n))]
+             (if (reduced? nval)
+               @nval
+               (recur nval (inc n))))
+           val))))
+  ([cicoll f val idx]
+     (let [cnt (-count cicoll)]
+       (loop [val val, n idx]
+         (if (< n cnt)
+           (let [nval (f val (-nth cicoll n))]
+             (if (reduced? nval)
+               @nval
+               (recur nval (inc n))))
+           val)))))
+
+(defn- array-reduce
+  ([arr f]
+     (let [cnt (alength arr)]
+       (if (zero? (alength arr))
+         (f)
+         (loop [val (aget arr 0), n 1]
+           (if (< n cnt)
+             (let [nval (f val (aget arr n))]
+               (if (reduced? nval)
+                 @nval
+                 (recur nval (inc n))))
+             val)))))
+  ([arr f val]
+     (let [cnt (alength arr)]
+       (loop [val val, n 0]
+         (if (< n cnt)
+           (let [nval (f val (aget arr n))]
+             (if (reduced? nval)
+               @nval
+               (recur nval (inc n))))
+           val))))
+  ([arr f val idx]
+     (let [cnt (alength arr)]
+       (loop [val val, n idx]
+         (if (< n cnt)
+           (let [nval (f val (aget arr n))]
+             (if (reduced? nval)
+               @nval
+               (recur nval (inc n))))
+           val)))))
+
+(declare hash-coll cons drop count nth RSeq List)
+
+(defn ^boolean counted?
+  "Returns true if coll implements count in constant time"
+  [x] (satisfies? ICounted x))
+
+(defn ^boolean indexed?
+  "Returns true if coll implements nth in constant time"
+  [x] (satisfies? IIndexed x))
+
+(defn- -indexOf
+  ([coll x]
+   (-indexOf coll x 0))
+  ([coll x start]
+   (let [len (count coll)]
+     (if (>= start len)
+       -1
+       (loop [idx (cond
+                    (pos? start) start
+                    (neg? start) (max 0 (+ start len))
+                    :else start)]
+         (if (< idx len)
+           (if (= (nth coll idx) x)
+             idx
+             (recur (inc idx)))
+           -1))))))
+
+(defn- -lastIndexOf
+  ([coll x]
+   (-lastIndexOf coll x (count coll)))
+  ([coll x start]
+   (let [len (count coll)]
+    (if (zero? len)
+      -1
+      (loop [idx (cond
+                   (pos? start) (min (dec len) start)
+                   (neg? start) (+ len start)
+                   :else start)]
+        (if (>= idx 0)
+          (if (= (nth coll idx) x)
+            idx
+            (recur (dec idx)))
+          -1))))))
+
+(deftype IndexedSeqIterator [arr ^:mutable i]
+  Object
+  (hasNext [_]
+    (< i (alength arr)))
+  (next [_]
+    (let [ret (aget arr i)]
+      (set! i (inc i))
+      ret)))
+
+(deftype IndexedSeq [arr i meta]
+  Object
+  (toString [coll]
+   (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ICloneable
+  (-clone [_] (IndexedSeq. arr i meta))
+
+  ISeqable
+  (-seq [this]
+    (when (< i (alength arr))
+      this))
+
+  IMeta
+  (-meta [coll] meta)
+  IWithMeta
+  (-with-meta [coll new-meta]
+    (IndexedSeq. arr i new-meta))
+
+  ASeq
+  ISeq
+  (-first [_] (aget arr i))
+  (-rest [_] (if (< (inc i) (alength arr))
+               (IndexedSeq. arr (inc i) nil)
+               (list)))
+
+  INext
+  (-next [_] (if (< (inc i) (alength arr))
+               (IndexedSeq. arr (inc i) nil)
+               nil))
+
+  ICounted
+  (-count [_]
+    (max 0 (- (alength arr) i)))
+
+  IIndexed
+  (-nth [coll n]
+    (let [i (+ n i)]
+      (if (and (<= 0 i) (< i (alength arr)))
+        (aget arr i)
+        (throw (js/Error. "Index out of bounds")))))
+  (-nth [coll n not-found]
+    (let [i (+ n i)]
+      (if (and (<= 0 i) (< i (alength arr)))
+        (aget arr i)
+        not-found)))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IIterable
+  (-iterator [coll]
+    (IndexedSeqIterator. arr i))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (.-EMPTY List))
+
+  IReduce
+  (-reduce [coll f]
+    (array-reduce arr f (aget arr i) (inc i)))
+  (-reduce [coll f start]
+    (array-reduce arr f start i))
+
+  IHash
+  (-hash [coll] (hash-ordered-coll coll))
+
+  IReversible
+  (-rseq [coll]
+    (let [c (-count coll)]
+      (if (pos? c)
+        (RSeq. coll (dec c) nil)))))
+
+(es6-iterable IndexedSeq)
+
+(defn prim-seq
+  "Create seq from a primitive JavaScript Array-like."
+  ([prim]
+     (prim-seq prim 0))
+  ([prim i]
+     (when (< i (alength prim))
+       (IndexedSeq. prim i nil))))
+
+(defn array-seq
+  "Create a seq from a JavaScript array."
+  ([array]
+     (prim-seq array 0))
+  ([array i]
+     (prim-seq array i)))
+
+(declare with-meta seq-reduce)
+
+(deftype RSeq [ci i meta]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ICloneable
+  (-clone [_] (RSeq. ci i meta))
+
+  IMeta
+  (-meta [coll] meta)
+  IWithMeta
+  (-with-meta [coll new-meta]
+    (RSeq. ci i new-meta))
+
+  ISeqable
+  (-seq [coll] coll)
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  ISeq
+  (-first [coll]
+    (-nth ci i))
+  (-rest [coll]
+    (if (pos? i)
+      (RSeq. ci (dec i) nil)
+      ()))
+  
+  INext
+  (-next [coll]
+    (when (pos? i)
+      (RSeq. ci (dec i) nil)))
+
+  ICounted
+  (-count [coll] (inc i))
+
+  ICollection
+  (-conj [coll o]
+    (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  IHash
+  (-hash [coll] (hash-ordered-coll coll))
+
+  IReduce
+  (-reduce [col f] (seq-reduce f col))
+  (-reduce [col f start] (seq-reduce f start col)))
+
+(es6-iterable RSeq)
+
+(defn second
+  "Same as (first (next x))"
+  [coll]
+  (first (next coll)))
+
+(defn ffirst
+  "Same as (first (first x))"
+  [coll]
+  (first (first coll)))
+
+(defn nfirst
+  "Same as (next (first x))"
+  [coll]
+  (next (first coll)))
+
+(defn fnext
+  "Same as (first (next x))"
+  [coll]
+  (first (next coll)))
+
+(defn nnext
+  "Same as (next (next x))"
+  [coll]
+  (next (next coll)))
+
+(defn last
+  "Return the last item in coll, in linear time"
+  [s]
+  (let [sn (next s)]
+    (if-not (nil? sn)
+      (recur sn)
+      (first s))))
+
+(extend-type default
+  IEquiv
+  (-equiv [x o] (identical? x o)))
+
+(defn conj
+  "conj[oin]. Returns a new collection with the xs
+  'added'. (conj nil item) returns (item).  The 'addition' may
+  happen at different 'places' depending on the concrete type."
+  ([] [])
+  ([coll] coll)
+  ([coll x]
+    (if-not (nil? coll)
+      (-conj coll x)
+      (list x)))
+  ([coll x & xs]
+    (if xs
+      (recur (conj coll x) (first xs) (next xs))
+      (conj coll x))))
+
+(defn empty
+  "Returns an empty collection of the same category as coll, or nil"
+  [coll]
+  (when-not (nil? coll)
+    (-empty coll)))
+
+(defn- accumulating-seq-count [coll]
+  (loop [s (seq coll) acc 0]
+    (if (counted? s) ; assumes nil is counted, which it currently is
+      (+ acc (-count s))
+      (recur (next s) (inc acc)))))
+
+(defn count
+  "Returns the number of items in the collection. (count nil) returns
+  0.  Also works on strings, arrays, and Maps"
+  [coll]
+  (if-not (nil? coll)
+    (cond
+      (implements? ICounted coll)
+      (-count ^not-native coll)
+
+      (array? coll)
+      (alength coll)
+    
+      (string? coll)
+      (.-length coll)
+
+      (implements? ISeqable coll)
+      (accumulating-seq-count coll)
+
+      :else (-count coll))
+    0))
+
+(defn- linear-traversal-nth
+  ([coll n]
+     (cond
+       (nil? coll)     (throw (js/Error. "Index out of bounds"))
+       (zero? n)       (if (seq coll)
+                         (first coll)
+                         (throw (js/Error. "Index out of bounds")))
+       (indexed? coll) (-nth coll n)
+       (seq coll)      (recur (next coll) (dec n))
+       :else           (throw (js/Error. "Index out of bounds"))))
+  ([coll n not-found]
+     (cond
+       (nil? coll)     not-found
+       (zero? n)       (if (seq coll)
+                         (first coll)
+                         not-found)
+       (indexed? coll) (-nth coll n not-found)
+       (seq coll)      (recur (next coll) (dec n) not-found)
+       :else           not-found)))
+
+(defn nth
+  "Returns the value at the index. get returns nil if index out of
+  bounds, nth throws an exception unless not-found is supplied.  nth
+  also works for strings, arrays, regex Matchers and Lists, and,
+  in O(n) time, for sequences."
+  ([coll n]
+    (cond
+      (not (number? n))
+      (throw (js/Error. "Index argument to nth must be a number"))
+
+      (nil? coll)
+      coll
+
+      (implements? IIndexed coll)
+      (-nth ^not-native coll n)
+
+      (array? coll)
+      (if (and (>= n 0) (< n (.-length coll)))
+        (aget coll n)
+        (throw (js/Error. "Index out of bounds")))
+
+      (string? coll)
+      (if (and (>= n 0) (< n (.-length coll)))
+        (.charAt coll n)
+        (throw (js/Error. "Index out of bounds")))
+
+      (or (implements? ISeq coll)
+          (implements? ISequential coll))
+      (linear-traversal-nth coll n)
+
+      (native-satisfies? IIndexed coll)
+      (-nth coll n)
+
+      :else
+      (throw (js/Error. (str "nth not supported on this type "
+                          (type->str (type coll)))))))
+  ([coll n not-found]
+    (cond
+      (not (number? n))
+      (throw (js/Error. "Index argument to nth must be a number."))
+
+      (nil? coll)
+      not-found
+
+      (implements? IIndexed coll)
+      (-nth ^not-native coll n not-found)
+
+      (array? coll)
+      (if (and (>= n 0) (< n (.-length coll)))
+        (aget coll n)
+        not-found)
+
+      (string? coll)
+      (if (and (>= n 0) (< n (.-length coll)))
+        (.charAt coll n)
+        not-found)
+
+      (or (implements? ISeq coll)
+          (implements? ISequential coll))
+      (linear-traversal-nth coll n not-found)
+
+      (native-satisfies? IIndexed coll)
+      (-nth coll n not-found)
+
+      :else
+      (throw (js/Error. (str "nth not supported on this type "
+                          (type->str (type coll))))))))
+
+(defn nthrest
+  "Returns the nth rest of coll, coll when n is 0."
+  [coll n]
+    (loop [n n xs coll]
+      (if-let [xs (and (pos? n) (seq xs))]
+        (recur (dec n) (rest xs))
+        xs)))
+
+(defn get
+  "Returns the value mapped to key, not-found or nil if key not present."
+  ([o k]
+    (when-not (nil? o)
+      (cond
+        (implements? ILookup o)
+        (-lookup ^not-native o k)
+
+        (array? o)
+        (when (and (some? k) (< k (.-length o)))
+          (aget o (int k)))
+
+        (string? o)
+        (when (and (some? k) (< k (.-length o)))
+          (.charAt o (int k)))
+
+        (native-satisfies? ILookup o)
+        (-lookup o k)
+
+        :else nil)))
+  ([o k not-found]
+    (if-not (nil? o)
+      (cond
+        (implements? ILookup o)
+        (-lookup ^not-native o k not-found)
+
+        (array? o)
+        (if (and (some? k) (>= k 0) (< k (.-length o)))
+          (aget o (int k))
+          not-found)
+
+        (string? o)
+        (if (and (some? k) (>= k 0) (< k (.-length o)))
+          (.charAt o (int k))
+          not-found)
+
+        (native-satisfies? ILookup o)
+        (-lookup o k not-found)
+
+        :else not-found)
+      not-found)))
+
+(declare PersistentHashMap PersistentArrayMap MapEntry)
+
+(defn assoc
+  "assoc[iate]. When applied to a map, returns a new map of the
+   same (hashed/sorted) type, that contains the mapping of key(s) to
+   val(s). When applied to a vector, returns a new vector that
+   contains val at index."
+  ([coll k v]
+    (if-not (nil? coll)
+      (-assoc coll k v)
+      (array-map k v)))
+  ([coll k v & kvs]
+     (let [ret (assoc coll k v)]
+       (if kvs
+         (recur ret (first kvs) (second kvs) (nnext kvs))
+         ret))))
+
+(defn dissoc
+  "dissoc[iate]. Returns a new map of the same (hashed/sorted) type,
+  that does not contain a mapping for key(s)."
+  ([coll] coll)
+  ([coll k]
+    (when-not (nil? coll)
+      (-dissoc coll k)))
+  ([coll k & ks]
+    (when-not (nil? coll)
+      (let [ret (dissoc coll k)]
+        (if ks
+          (recur ret (first ks) (next ks))
+          ret)))))
+
+(defn ^boolean fn?
+  "Return true if f is a JavaScript function or satisfies the Fn protocol."
+  [f]
+  (or ^boolean (goog/isFunction f) (satisfies? Fn f)))
+
+(deftype MetaFn [afn meta]
+  IMeta
+  (-meta [_] meta)
+  IWithMeta
+  (-with-meta [_ new-meta]
+    (MetaFn. afn new-meta))
+  Fn
+  IFn
+  (-invoke [_]
+    (afn))
+  (-invoke [_ a]
+    (afn a))
+  (-invoke [_ a b]
+    (afn a b))
+  (-invoke [_ a b c]
+    (afn a b c))
+  (-invoke [_ a b c d]
+    (afn a b c d))
+  (-invoke [_ a b c d e]
+    (afn a b c d e))
+  (-invoke [_ a b c d e f]
+    (afn a b c d e f))
+  (-invoke [_ a b c d e f g]
+    (afn a b c d e f g))
+  (-invoke [_ a b c d e f g h]
+    (afn a b c d e f g h))
+  (-invoke [_ a b c d e f g h i]
+    (afn a b c d e f g h i))
+  (-invoke [_ a b c d e f g h i j]
+    (afn a b c d e f g h i j))
+  (-invoke [_ a b c d e f g h i j k]
+    (afn a b c d e f g h i j k))
+  (-invoke [_ a b c d e f g h i j k l]
+    (afn a b c d e f g h i j k l))
+  (-invoke [_ a b c d e f g h i j k l m]
+    (afn a b c d e f g h i j k l m))
+  (-invoke [_ a b c d e f g h i j k l m n]
+    (afn a b c d e f g h i j k l m n))
+  (-invoke [_ a b c d e f g h i j k l m n o]
+    (afn a b c d e f g h i j k l m n o))
+  (-invoke [_ a b c d e f g h i j k l m n o p]
+    (afn a b c d e f g h i j k l m n o p))
+  (-invoke [_ a b c d e f g h i j k l m n o p q]
+    (afn a b c d e f g h i j k l m n o p q))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r]
+    (afn a b c d e f g h i j k l m n o p q r))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s]
+    (afn a b c d e f g h i j k l m n o p q r s))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s t]
+    (afn a b c d e f g h i j k l m n o p q r s t))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s t rest]
+    (apply afn a b c d e f g h i j k l m n o p q r s t rest)))
+
+(defn with-meta
+  "Returns an object of the same type and value as obj, with
+  map m as its metadata."
+  [o meta]
+  (if ^boolean (goog/isFunction o)
+    (MetaFn. o meta)
+    (when-not (nil? o)
+      (-with-meta o meta))))
+
+(defn meta
+  "Returns the metadata of obj, returns nil if there is no metadata."
+  [o]
+  (when (and (not (nil? o))
+             (satisfies? IMeta o))
+    (-meta o)))
+
+(defn peek
+  "For a list or queue, same as first, for a vector, same as, but much
+  more efficient than, last. If the collection is empty, returns nil."
+  [coll]
+  (when-not (nil? coll)
+    (-peek coll)))
+
+(defn pop
+  "For a list or queue, returns a new list/queue without the first
+  item, for a vector, returns a new vector without the last item.
+  Note - not the same as next/butlast."
+  [coll]
+  (when-not (nil? coll)
+    (-pop coll)))
+
+(defn disj
+  "disj[oin]. Returns a new set of the same (hashed/sorted) type, that
+  does not contain key(s)."
+  ([coll] coll)
+  ([coll k]
+    (when-not (nil? coll)
+      (-disjoin coll k)))
+  ([coll k & ks]
+    (when-not (nil? coll)
+      (let [ret (disj coll k)]
+        (if ks
+          (recur ret (first ks) (next ks))
+          ret)))))
+
+(defn ^boolean empty?
+  "Returns true if coll has no items - same as (not (seq coll)).
+  Please use the idiom (seq x) rather than (not (empty? x))"
+  [coll] (or (nil? coll)
+             (not (seq coll))))
+
+(defn ^boolean coll?
+  "Returns true if x satisfies ICollection"
+  [x]
+  (if (nil? x)
+    false
+    (satisfies? ICollection x)))
+
+(defn ^boolean set?
+  "Returns true if x satisfies ISet"
+  [x]
+  (if (nil? x)
+    false
+    (satisfies? ISet x)))
+
+(defn ^boolean associative?
+ "Returns true if coll implements IAssociative"
+  [x] (satisfies? IAssociative x))
+
+(defn ^boolean ifind?
+ "Returns true if coll implements IFind"
+  [x] (satisfies? IFind x))
+
+(defn ^boolean sequential?
+  "Returns true if coll satisfies ISequential"
+  [x] (satisfies? ISequential x))
+
+(defn ^boolean sorted?
+  "Returns true if coll satisfies ISorted"
+  [x] (satisfies? ISorted x))
+
+(defn ^boolean reduceable?
+  "Returns true if coll satisfies IReduce"
+  [x] (satisfies? IReduce x))
+
+(defn ^boolean map?
+  "Return true if x satisfies IMap"
+  [x]
+  (if (nil? x)
+    false
+    (satisfies? IMap x)))
+
+(defn ^boolean record?
+  "Return true if x satisfies IRecord"
+  [x]
+  (satisfies? IRecord x))
+
+(defn ^boolean vector?
+  "Return true if x satisfies IVector"
+  [x] (satisfies? IVector x))
+
+(declare ChunkedCons ChunkedSeq)
+
+(defn ^boolean chunked-seq?
+  "Return true if x is satisfies IChunkedSeq."
+  [x] (implements? IChunkedSeq x))
+
+;;;;;;;;;;;;;;;;;;;; js primitives ;;;;;;;;;;;;
+(defn js-obj
+  "Create JavaSript object from an even number arguments representing
+  interleaved keys and values."
+  ([]
+     (cljs.core/js-obj))
+  ([& keyvals]
+     (apply gobject/create keyvals)))
+
+(defn js-keys
+  "Return the JavaScript keys for an object."
+  [obj]
+  (gobject/getKeys obj))
+
+(defn js-delete
+  "Delete a property from a JavaScript object.
+  Returns true upon success, false otherwise."
+  [obj key]
+  (cljs.core/js-delete obj key))
+
+(defn- array-copy
+  ([from i to j len]
+    (loop [i i j j len len]
+       (if (zero? len)
+         to
+         (do (aset to j (aget from i))
+             (recur (inc i) (inc j) (dec len)))))))
+
+(defn- array-copy-downward
+  ([from i to j len]
+     (loop [i (+ i (dec len)) j (+ j (dec len)) len len]
+       (if (zero? len)
+         to
+         (do (aset to j (aget from i))
+             (recur (dec i) (dec j) (dec len)))))))
+
+;;;;;;;;;;;;;;;; preds ;;;;;;;;;;;;;;;;;;
+
+(def ^:private lookup-sentinel (js-obj))
+
+(defn ^boolean false?
+  "Returns true if x is the value false, false otherwise."
+  [x] (cljs.core/false? x))
+
+(defn ^boolean true?
+  "Returns true if x is the value true, false otherwise."
+  [x] (cljs.core/true? x))
+
+(defn ^boolean boolean?
+  "Return true if x is a Boolean"
+  [x] (or (cljs.core/true? x) (cljs.core/false? x)))
+
+(defn ^boolean undefined?
+  "Returns true if x identical to the JavaScript undefined value."
+  [x]
+  (cljs.core/undefined? x))
+
+(defn ^boolean seq?
+  "Return true if s satisfies ISeq"
+  [s]
+  (if (nil? s)
+    false
+    (satisfies? ISeq s)))
+
+(defn ^boolean seqable?
+  "Return true if the seq function is supported for s"
+  [s]
+  (or
+   (satisfies? ISeqable s)
+   (array? s)
+   (string? s)))
+
+(defn ^boolean boolean
+  "Coerce to boolean"
+  [x]
+  (cond
+    (nil? x) false
+    (false? x) false
+    :else true))
+
+(defn ^boolean ifn?
+  "Returns true if f returns true for fn? or satisfies IFn."
+  [f]
+  (or (fn? f) (satisfies? IFn f)))
+
+(defn ^boolean integer?
+  "Returns true if n is a JavaScript number with no decimal part."
+  [n]
+  (and (number? n)
+       (not ^boolean (js/isNaN n))
+       (not (identical? n js/Infinity))
+       (== (js/parseFloat n) (js/parseInt n 10))))
+
+(defn ^boolean int?
+  "Return true if x satisfies integer? or is an instance of goog.math.Integer
+   or goog.math.Long."
+  [x]
+  (or (integer? x)
+      (instance? goog.math.Integer x)
+      (instance? goog.math.Long x)))
+
+(defn ^boolean pos-int?
+  "Return true if x satisfies int? and is positive."
+  [x]
+  (cond
+    (integer? x) (pos? x)
+
+    (instance? goog.math.Integer x)
+    (and (not (.isNegative x))
+         (not (.isZero x)))
+
+    (instance? goog.math.Long x)
+    (and (not (.isNegative x))
+         (not (.isZero x)))
+
+    :else false))
+
+(defn ^boolean neg-int?
+  "Return true if x satisfies int? and is negative."
+  [x]
+  (cond
+    (integer? x) (neg? x)
+
+    (instance? goog.math.Integer x)
+    (.isNegative x)
+
+    (instance? goog.math.Long x)
+    (.isNegative x)
+
+    :else false))
+
+(defn ^boolean nat-int?
+  "Return true if x satisfies int? and is a natural integer value."
+  [x]
+  (cond
+    (integer? x)
+    (not (neg? x))
+
+    (instance? goog.math.Integer x)
+    (not (.isNegative x))
+
+    (instance? goog.math.Long x)
+    (not (.isNegative x))
+
+    :else false))
+
+(defn ^boolean float?
+  "Returns true for JavaScript numbers, false otherwise."
+  [x]
+  (number? x))
+
+(defn ^boolean double?
+  "Returns true for JavaScript numbers, false otherwise."
+  [x]
+  (number? x))
+
+(defn ^boolean infinite?
+  "Returns true for Infinity and -Infinity values."
+  [x]
+  (or (identical? x js/Number.POSITIVE_INFINITY)
+      (identical? x js/Number.NEGATIVE_INFINITY)))
+
+(defn ^boolean contains?
+  "Returns true if key is present in the given collection, otherwise
+  returns false.  Note that for numerically indexed collections like
+  vectors and arrays, this tests if the numeric key is within the
+  range of indexes. 'contains?' operates constant or logarithmic time;
+  it will not perform a linear search for a value.  See also 'some'."
+  [coll v]
+  (if (identical? (get coll v lookup-sentinel) lookup-sentinel)
+    false
+    true))
+
+(defn find
+  "Returns the map entry for key, or nil if key not present."
+  [coll k]
+  (if (ifind? coll)
+    (-find coll k)
+    (when (and (not (nil? coll))
+            (associative? coll)
+            (contains? coll k))
+      (MapEntry. k (get coll k) nil))))
+
+(defn ^boolean distinct?
+  "Returns true if no two of the arguments are ="
+  ([x] true)
+  ([x y] (not (= x y)))
+  ([x y & more]
+     (if (not (= x y))
+     (loop [s #{x y} xs more]
+       (let [x (first xs)
+             etc (next xs)]
+         (if xs
+           (if (contains? s x)
+             false
+             (recur (conj s x) etc))
+           true)))
+     false)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Seq fns ;;;;;;;;;;;;;;;;
+
+(defn ^number compare
+  "Comparator. Returns a negative number, zero, or a positive number
+  when x is logically 'less than', 'equal to', or 'greater than'
+  y. Uses IComparable if available and google.array.defaultCompare for objects
+ of the same type and special-cases nil to be less than any other object."
+  [x y]
+  (cond
+   (identical? x y) 0
+
+   (nil? x) -1
+
+   (nil? y) 1
+
+   (number? x) (if (number? y)
+                 (garray/defaultCompare x y)
+                 (throw (js/Error. (str "Cannot compare " x " to " y))))
+
+   (satisfies? IComparable x)
+   (-compare x y)
+
+   :else
+   (if (and (or (string? x) (array? x) (true? x) (false? x))
+            (identical? (type x) (type y)))
+     (garray/defaultCompare x y)
+     (throw (js/Error. (str "Cannot compare " x " to " y))))))
+
+(defn ^:private compare-indexed
+  "Compare indexed collection."
+  ([xs ys]
+     (let [xl (count xs)
+           yl (count ys)]
+       (cond
+        (< xl yl) -1
+        (> xl yl) 1
+        (== xl 0) 0
+        :else (compare-indexed xs ys xl 0))))
+  ([xs ys len n]
+     (let [d (compare (nth xs n) (nth ys n))]
+       (if (and (zero? d) (< (+ n 1) len))
+         (recur xs ys len (inc n))
+         d))))
+
+(defn ^:private fn->comparator
+  "Given a fn that might be boolean valued or a comparator,
+   return a fn that is a comparator."
+  [f]
+  (if (= f compare)
+    compare
+    (fn [x y]
+      (let [r (f x y)]
+        (if (number? r)
+          r
+          (if r
+            -1
+            (if (f y x) 1 0)))))))
+
+(declare to-array)
+
+(defn sort
+  "Returns a sorted sequence of the items in coll. Comp can be
+   boolean-valued comparison function, or a -/0/+ valued comparator.
+   Comp defaults to compare."
+  ([coll]
+   (sort compare coll))
+  ([comp coll]
+   (if (seq coll)
+     (let [a (to-array coll)]
+       ;; matching Clojure's stable sort, though docs don't promise it
+       (garray/stableSort a (fn->comparator comp))
+       (seq a))
+     ())))
+
+(defn sort-by
+  "Returns a sorted sequence of the items in coll, where the sort
+   order is determined by comparing (keyfn item).  Comp can be
+   boolean-valued comparison function, or a -/0/+ valued comparator.
+   Comp defaults to compare."
+  ([keyfn coll]
+   (sort-by keyfn compare coll))
+  ([keyfn comp coll]
+     (sort (fn [x y] ((fn->comparator comp) (keyfn x) (keyfn y))) coll)))
+
+; simple reduce based on seqs, used as default
+(defn- seq-reduce
+  ([f coll]
+    (if-let [s (seq coll)]
+      (reduce f (first s) (next s))
+      (f)))
+  ([f val coll]
+    (loop [val val, coll (seq coll)]
+      (if coll
+        (let [nval (f val (first coll))]
+          (if (reduced? nval)
+            @nval
+            (recur nval (next coll))))
+        val))))
+
+(declare vec)
+
+(defn shuffle
+  "Return a random permutation of coll"
+  [coll]
+  (let [a (to-array coll)]
+    (garray/shuffle a)
+    (vec a)))
+
+(defn- iter-reduce
+  ([coll f]
+   (let [iter (-iterator coll)]
+     (if (.hasNext iter)
+       (let [init (.next iter)]
+         (loop [acc init]
+           (if ^boolean (.hasNext iter)
+             (let [nacc (f acc (.next iter))]
+               (if (reduced? nacc)
+                 @nacc
+                 (recur nacc)))
+             acc)))
+       (f))))
+  ([coll f init]
+   (let [iter (-iterator coll)]
+     (loop [acc init]
+       (if ^boolean (.hasNext iter)
+         (let [nacc (f acc (.next iter))]
+           (if (reduced? nacc)
+             @nacc
+             (recur nacc)))
+         acc)))))
+
+(defn reduce
+  "f should be a function of 2 arguments. If val is not supplied,
+  returns the result of applying f to the first 2 items in coll, then
+  applying f to that result and the 3rd item, etc. If coll contains no
+  items, f must accept no arguments as well, and reduce returns the
+  result of calling f with no arguments.  If coll has only 1 item, it
+  is returned and f is not called.  If val is supplied, returns the
+  result of applying f to val and the first item in coll, then
+  applying f to that result and the 2nd item, etc. If coll contains no
+  items, returns val and f is not called."
+  ([f coll]
+     (cond
+       (implements? IReduce coll)
+       (-reduce ^not-native coll f)
+
+       (array? coll)
+       (array-reduce coll f)
+
+       (string? coll)
+       (array-reduce coll f)
+
+       (native-satisfies? IReduce coll)
+       (-reduce coll f)
+
+       (iterable? coll)
+       (iter-reduce coll f)
+
+       :else
+       (seq-reduce f coll)))
+  ([f val coll]
+     (cond
+       (implements? IReduce coll)
+       (-reduce ^not-native coll f val)
+
+       (array? coll)
+       (array-reduce coll f val)
+      
+       (string? coll)
+       (array-reduce coll f val)
+
+       (native-satisfies? IReduce coll)
+       (-reduce coll f val)
+
+       (iterable? coll)
+       (iter-reduce coll f val)
+
+       :else
+       (seq-reduce f val coll))))
+
+(defn reduce-kv
+  "Reduces an associative collection. f should be a function of 3
+  arguments. Returns the result of applying f to init, the first key
+  and the first value in coll, then applying f to that result and the
+  2nd key and value, etc. If coll contains no entries, returns init
+  and f is not called. Note that reduce-kv is supported on vectors,
+  where the keys will be the ordinals."
+  ([f init coll]
+    (if-not (nil? coll)
+      (-kv-reduce coll f init)
+      init)))
+
+(defn identity
+  "Returns its argument."
+  [x] x)
+
+(defn completing
+  "Takes a reducing function f of 2 args and returns a fn suitable for
+  transduce by adding an arity-1 signature that calls cf (default -
+  identity) on the result argument."
+  ([f] (completing f identity))
+  ([f cf]
+    (fn
+      ([] (f))
+      ([x] (cf x))
+      ([x y] (f x y)))))
+
+(defn transduce
+  "reduce with a transformation of f (xf). If init is not
+  supplied, (f) will be called to produce it. f should be a reducing
+  step function that accepts both 1 and 2 arguments, if it accepts
+  only 2 you can add the arity-1 with 'completing'. Returns the result
+  of applying (the transformed) xf to init and the first item in coll,
+  then applying xf to that result and the 2nd item, etc. If coll
+  contains no items, returns init and f is not called. Note that
+  certain transforms may inject or skip items."
+  ([xform f coll] (transduce xform f (f) coll))
+  ([xform f init coll]
+     (let [f (xform f)
+           ret (reduce f init coll)]
+       (f ret))))
+
+;;; Math - variadic forms will not work until the following implemented:
+;;; first, next, reduce
+
+(defn ^number +
+  "Returns the sum of nums. (+) returns 0."
+  ([] 0)
+  ([x] x)
+  ([x y] (cljs.core/+ x y))
+  ([x y & more]
+    (reduce + (cljs.core/+ x y) more)))
+
+(defn ^number -
+  "If no ys are supplied, returns the negation of x, else subtracts
+  the ys from x and returns the result."
+  ([x] (cljs.core/- x))
+  ([x y] (cljs.core/- x y))
+  ([x y & more] (reduce - (cljs.core/- x y) more)))
+
+(defn ^number *
+  "Returns the product of nums. (*) returns 1."
+  ([] 1)
+  ([x] x)
+  ([x y] (cljs.core/* x y))
+  ([x y & more] (reduce * (cljs.core/* x y) more)))
+
+(declare divide)
+
+(defn ^number /
+  "If no denominators are supplied, returns 1/numerator,
+  else returns numerator divided by all of the denominators."
+  ([x] (/ 1 x))
+  ([x y] (cljs.core/divide x y)) ;; FIXME: waiting on cljs.core//
+  ([x y & more] (reduce / (/ x y) more)))
+
+(defn ^boolean <
+  "Returns non-nil if nums are in monotonically increasing order,
+  otherwise false."
+  ([x] true)
+  ([x y] (cljs.core/< x y))
+  ([x y & more]
+     (if (cljs.core/< x y)
+       (if (next more)
+         (recur y (first more) (next more))
+         (cljs.core/< y (first more)))
+       false)))
+
+(defn ^boolean <=
+  "Returns non-nil if nums are in monotonically non-decreasing order,
+  otherwise false."
+  ([x] true)
+  ([x y] (cljs.core/<= x y))
+  ([x y & more]
+   (if (cljs.core/<= x y)
+     (if (next more)
+       (recur y (first more) (next more))
+       (cljs.core/<= y (first more)))
+     false)))
+
+(defn ^boolean >
+  "Returns non-nil if nums are in monotonically decreasing order,
+  otherwise false."
+  ([x] true)
+  ([x y] (cljs.core/> x y))
+  ([x y & more]
+   (if (cljs.core/> x y)
+     (if (next more)
+       (recur y (first more) (next more))
+       (cljs.core/> y (first more)))
+     false)))
+
+(defn ^boolean >=
+  "Returns non-nil if nums are in monotonically non-increasing order,
+  otherwise false."
+  ([x] true)
+  ([x y] (cljs.core/>= x y))
+  ([x y & more]
+   (if (cljs.core/>= x y)
+     (if (next more)
+       (recur y (first more) (next more))
+       (cljs.core/>= y (first more)))
+     false)))
+
+(defn dec
+  "Returns a number one less than num."
+  [x] (- x 1))
+
+(defn ^number max
+  "Returns the greatest of the nums."
+  ([x] x)
+  ([x y] (cljs.core/max x y))
+  ([x y & more]
+   (reduce max (cljs.core/max x y) more)))
+
+(defn ^number min
+  "Returns the least of the nums."
+  ([x] x)
+  ([x y] (cljs.core/min x y))
+  ([x y & more]
+   (reduce min (cljs.core/min x y) more)))
+
+(defn ^number byte [x] x)
+
+(defn char
+  "Coerce to char"
+  [x]
+  (cond
+    (number? x) (.fromCharCode js/String x)
+    (and (string? x) (== (.-length x) 1)) x
+    :else (throw (js/Error. "Argument to char must be a character or number"))))
+
+(defn ^number short [x] x)
+(defn ^number float [x] x)
+(defn ^number double [x] x)
+
+(defn ^number unchecked-byte [x] x)
+(defn ^number unchecked-char [x] x)
+(defn ^number unchecked-short [x] x)
+(defn ^number unchecked-float [x] x)
+(defn ^number unchecked-double [x] x)
+
+(defn ^number unchecked-add
+  "Returns the sum of nums. (+) returns 0."
+  ([] 0)
+  ([x] x)
+  ([x y] (cljs.core/unchecked-add x y))
+  ([x y & more] (reduce unchecked-add (cljs.core/unchecked-add x y) more)))
+
+(defn ^number unchecked-add-int
+  "Returns the sum of nums. (+) returns 0."
+  ([] 0)
+  ([x] x)
+  ([x y] (cljs.core/unchecked-add-int x y))
+  ([x y & more] (reduce unchecked-add-int (cljs.core/unchecked-add-int x y) more)))
+
+(defn unchecked-dec
+  "Returns a number one less than x, an int."
+  [x]
+  (cljs.core/unchecked-dec x))
+
+(defn unchecked-dec-int
+  "Returns a number one less than x, an int."
+  [x]
+  (cljs.core/unchecked-dec-int x))
+
+(defn ^number unchecked-divide-int
+  "If no denominators are supplied, returns 1/numerator,
+  else returns numerator divided by all of the denominators."
+  ([x] (unchecked-divide-int 1 x))
+  ([x y] (cljs.core/divide x y)) ;; FIXME: waiting on cljs.core//
+  ([x y & more] (reduce unchecked-divide-int (unchecked-divide-int x y) more)))
+
+(defn unchecked-inc [x]
+  (cljs.core/unchecked-inc x))
+
+(defn unchecked-inc-int [x]
+  (cljs.core/unchecked-inc-int x))
+
+(defn ^number unchecked-multiply
+  "Returns the product of nums. (*) returns 1."
+  ([] 1)
+  ([x] x)
+  ([x y] (cljs.core/unchecked-multiply x y))
+  ([x y & more] (reduce unchecked-multiply (cljs.core/unchecked-multiply x y) more)))
+
+(defn ^number unchecked-multiply-int
+  "Returns the product of nums. (*) returns 1."
+  ([] 1)
+  ([x] x)
+  ([x y] (cljs.core/unchecked-multiply-int x y))
+  ([x y & more] (reduce unchecked-multiply-int (cljs.core/unchecked-multiply-int x y) more)))
+
+(defn unchecked-negate [x]
+  (cljs.core/unchecked-negate x))
+
+(defn unchecked-negate-int [x]
+  (cljs.core/unchecked-negate-int x))
+
+(declare mod)
+
+(defn unchecked-remainder-int [x n]
+  (cljs.core/unchecked-remainder-int x n))
+
+(defn ^number unchecked-subtract
+  "If no ys are supplied, returns the negation of x, else subtracts
+  the ys from x and returns the result."
+  ([x] (cljs.core/unchecked-subtract x))
+  ([x y] (cljs.core/unchecked-subtract x y))
+  ([x y & more] (reduce unchecked-subtract (cljs.core/unchecked-subtract x y) more)))
+
+(defn ^number unchecked-subtract-int
+  "If no ys are supplied, returns the negation of x, else subtracts
+  the ys from x and returns the result."
+  ([x] (cljs.core/unchecked-subtract-int x))
+  ([x y] (cljs.core/unchecked-subtract-int x y))
+  ([x y & more] (reduce unchecked-subtract-int (cljs.core/unchecked-subtract-int x y) more)))
+
+(defn- ^number fix [q]
+  (if (>= q 0)
+    (Math/floor q)
+    (Math/ceil q)))
+
+(defn int
+  "Coerce to int by stripping decimal places."
+  [x]
+  (bit-or x 0))
+
+(defn unchecked-int
+  "Coerce to int by stripping decimal places."
+  [x]
+  (fix x))
+
+(defn long
+  "Coerce to long by stripping decimal places. Identical to `int'."
+  [x]
+  (fix x))
+
+(defn unchecked-long
+  "Coerce to long by stripping decimal places. Identical to `int'."
+  [x]
+  (fix x))
+
+(defn booleans [x] x)
+(defn bytes [x] x)
+(defn chars [x] x)
+(defn shorts [x] x)
+(defn ints [x] x)
+(defn floats [x] x)
+(defn doubles [x] x)
+(defn longs [x] x)
+
+(defn js-mod
+  "Modulus of num and div with original javascript behavior. i.e. bug for negative numbers"
+  [n d]
+  (cljs.core/js-mod n d))
+
+(defn mod
+  "Modulus of num and div. Truncates toward negative infinity."
+  [n d]
+  (js-mod (+ (js-mod n d) d) d))
+
+(defn quot
+  "quot[ient] of dividing numerator by denominator."
+  [n d]
+  (let [rem (js-mod n d)]
+    (fix (/ (- n rem) d))))
+
+(defn rem
+  "remainder of dividing numerator by denominator."
+  [n d]
+  (let [q (quot n d)]
+    (- n (* d q))))
+
+(defn bit-xor
+  "Bitwise exclusive or"
+  ([x y] (cljs.core/bit-xor x y))
+  ([x y & more]
+     (reduce bit-xor (cljs.core/bit-xor x y) more)))
+
+(defn bit-and
+  "Bitwise and"
+  ([x y] (cljs.core/bit-and x y))
+  ([x y & more]
+     (reduce bit-and (cljs.core/bit-and x y) more)))
+
+(defn bit-or
+  "Bitwise or"
+  ([x y] (cljs.core/bit-or x y))
+  ([x y & more]
+     (reduce bit-or (cljs.core/bit-or x y) more)))
+
+(defn bit-and-not
+  "Bitwise and with complement"
+  ([x y] (cljs.core/bit-and-not x y))
+  ([x y & more]
+     (reduce bit-and-not (cljs.core/bit-and-not x y) more)))
+
+(defn bit-clear
+  "Clear bit at index n"
+  [x n]
+  (cljs.core/bit-clear x n))
+
+(defn bit-flip
+  "Flip bit at index n"
+  [x n]
+  (cljs.core/bit-flip x n))
+
+(defn bit-not
+  "Bitwise complement"
+  [x] (cljs.core/bit-not x))
+
+(defn bit-set
+  "Set bit at index n"
+  [x n]
+  (cljs.core/bit-set x n))
+
+(defn ^boolean bit-test
+  "Test bit at index n"
+  [x n]
+  (cljs.core/bit-test x n))
+
+(defn bit-shift-left
+  "Bitwise shift left"
+  [x n] (cljs.core/bit-shift-left x n))
+
+(defn bit-shift-right
+  "Bitwise shift right"
+  [x n] (cljs.core/bit-shift-right x n))
+
+(defn bit-shift-right-zero-fill
+  "DEPRECATED: Bitwise shift right with zero fill"
+  [x n] (cljs.core/bit-shift-right-zero-fill x n))
+
+(defn unsigned-bit-shift-right
+  "Bitwise shift right with zero fill"
+  [x n] (cljs.core/unsigned-bit-shift-right x n))
+
+(defn bit-count
+  "Counts the number of bits set in n"
+  [v]
+  (let [v (- v (bit-and (bit-shift-right v 1) 0x55555555))
+        v (+ (bit-and v 0x33333333) (bit-and (bit-shift-right v 2) 0x33333333))]
+    (bit-shift-right (* (bit-and (+ v (bit-shift-right v 4)) 0xF0F0F0F) 0x1010101) 24)))
+
+(defn ^boolean ==
+  "Returns non-nil if nums all have the equivalent
+  value, otherwise false. Behavior on non nums is
+  undefined."
+  ([x] true)
+  ([x y] (-equiv x y))
+  ([x y & more]
+   (if (== x y)
+     (if (next more)
+       (recur y (first more) (next more))
+       (== y (first more)))
+     false)))
+
+(defn ^boolean pos?
+  "Returns true if num is greater than zero, else false"
+  [x] (cljs.core/pos? x))
+
+(defn ^boolean zero?
+  "Returns true if num is zero, else false"
+  [x]
+  (cljs.core/zero? x))
+
+(defn ^boolean neg?
+  "Returns true if num is less than zero, else false"
+  [x] (cljs.core/neg? x))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; protocols for host types ;;;;;;
+
+(defn nthnext
+  "Returns the nth next of coll, (seq coll) when n is 0."
+  [coll n]
+  (loop [n n xs (seq coll)]
+    (if (and xs (pos? n))
+      (recur (dec n) (next xs))
+      xs)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;; basics ;;;;;;;;;;;;;;;;;;
+
+(defn str
+  "With no args, returns the empty string. With one arg x, returns
+  x.toString().  (str nil) returns the empty string. With more than
+  one arg, returns the concatenation of the str values of the args."
+  ([] "")
+  ([x] (if (nil? x)
+         ""
+         (.join #js [x] "")))
+  ([x & ys]
+    (loop [sb (StringBuffer. (str x)) more ys]
+      (if more
+        (recur (. sb  (append (str (first more)))) (next more))
+        (.toString sb)))))
+
+(defn subs
+  "Returns the substring of s beginning at start inclusive, and ending
+  at end (defaults to length of string), exclusive."
+  ([s start] (.substring s start))
+  ([s start end] (.substring s start end)))
+
+(declare map name)
+
+(defn- equiv-sequential
+  "Assumes x is sequential. Returns true if x equals y, otherwise
+  returns false."
+  [x y]
+  (boolean
+    (when (sequential? y)
+      (if (and (counted? x) (counted? y)
+               (not (== (count x) (count y))))
+        false
+        (loop [xs (seq x) ys (seq y)]
+          (cond (nil? xs) (nil? ys)
+            (nil? ys) false
+            (= (first xs) (first ys)) (recur (next xs) (next ys))
+            :else false))))))
+
+(defn- hash-coll [coll]
+  (if (seq coll)
+    (loop [res (hash (first coll)) s (next coll)]
+      (if (nil? s)
+        res
+        (recur (hash-combine res (hash (first s))) (next s))))
+    0))
+
+(declare key val)
+
+(defn- hash-imap [m]
+  ;; a la clojure.lang.APersistentMap
+  (loop [h 0 s (seq m)]
+    (if s
+      (let [e (first s)]
+        (recur (js-mod (+ h (bit-xor (hash (key e)) (hash (val e))))
+                    4503599627370496)
+               (next s)))
+      h)))
+
+(defn- hash-iset [s]
+  ;; a la clojure.lang.APersistentSet
+  (loop [h 0 s (seq s)]
+    (if s
+      (let [e (first s)]
+        (recur (js-mod (+ h (hash e)) 4503599627370496)
+               (next s)))
+      h)))
+
+(declare name chunk-first chunk-rest)
+
+(defn- extend-object!
+  "Takes a JavaScript object and a map of names to functions and
+  attaches said functions as methods on the object.  Any references to
+  JavaScript's implicit this (via the this-as macro) will resolve to the
+  object that the function is attached."
+  [obj fn-map]
+  (doseq [[key-name f] fn-map]
+    (let [str-name (name key-name)]
+      (gobject/set obj str-name f)))
+  obj)
+
+;;;;;;;;;;;;;;;; cons ;;;;;;;;;;;;;;;;
+(deftype List [meta first rest count ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x count))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IList
+
+  ICloneable
+  (-clone [_] (List. meta first rest count __hash))
+
+  IWithMeta
+  (-with-meta [coll meta] (List. meta first rest count __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ASeq
+  ISeq
+  (-first [coll] first)
+  (-rest [coll]
+    (if (== count 1)
+      ()
+      rest))
+
+  INext
+  (-next [coll]
+    (if (== count 1)
+      nil
+      rest))
+
+  IStack
+  (-peek [coll] first)
+  (-pop [coll] (-rest coll))
+
+  ICollection
+  (-conj [coll o] (List. meta o coll (inc count) nil))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISeqable
+  (-seq [coll] coll)
+
+  ICounted
+  (-count [coll] count)
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(defn ^boolean list?
+  "Returns true if x implements IList"
+  [x]
+  (satisfies? IList x))
+
+(es6-iterable List)
+
+(deftype EmptyList [meta]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IList
+
+  ICloneable
+  (-clone [_] (EmptyList. meta))
+
+  IWithMeta
+  (-with-meta [coll meta] (EmptyList. meta))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISeq
+  (-first [coll] nil)
+  (-rest [coll] ())
+
+  INext
+  (-next [coll] nil)
+
+  IStack
+  (-peek [coll] nil)
+  (-pop [coll] (throw (js/Error. "Can't pop empty list")))
+
+  ICollection
+  (-conj [coll o] (List. meta o nil 1 nil))
+
+  IEmptyableCollection
+  (-empty [coll] coll)
+
+  ISequential
+  IEquiv
+  (-equiv [coll other]
+    (if (or (list? other)
+            (sequential? other))
+      (nil? (seq other))
+      false))
+
+  IHash
+  (-hash [coll] empty-ordered-hash)
+
+  ISeqable
+  (-seq [coll] nil)
+
+  ICounted
+  (-count [coll] 0)
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(set! (.-EMPTY List) (EmptyList. nil))
+
+(es6-iterable EmptyList)
+
+(defn ^boolean reversible?
+  "Returns true if coll satisfies? IReversible."
+  [coll]
+  (satisfies? IReversible coll))
+
+(defn ^seq rseq
+  "Returns, in constant time, a seq of the items in rev (which
+  can be a vector or sorted-map), in reverse order. If rev is empty returns nil"
+  [rev]
+  (-rseq rev))
+
+(defn reverse
+  "Returns a seq of the items in coll in reverse order. Not lazy."
+  [coll]
+  (if (reversible? coll)
+    (or (rseq coll) ())
+    (reduce conj () coll)))
+
+(defn list
+  "Creates a new list containing the items."
+  [& xs]
+  (let [arr (if (and (instance? IndexedSeq xs) (zero? (.-i xs)))
+              (.-arr xs)
+              (let [arr (array)]
+                (loop [^not-native xs xs]
+                  (if-not (nil? xs)
+                    (do
+                      (.push arr (-first xs))
+                      (recur (-next xs)))
+                    arr))))]
+    (loop [i (alength arr) ^not-native r ()]
+      (if (> i 0)
+        (recur (dec i) (-conj r (aget arr (dec i))))
+        r))))
+
+(deftype Cons [meta first rest ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IList
+
+  ICloneable
+  (-clone [_] (Cons. meta first rest __hash))
+
+  IWithMeta
+  (-with-meta [coll meta] (Cons. meta first rest __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ASeq
+  ISeq
+  (-first [coll] first)
+  (-rest [coll] (if (nil? rest) () rest))
+
+  INext
+  (-next [coll]
+    (if (nil? rest) nil (seq rest)))
+
+  ICollection
+  (-conj [coll o] (Cons. nil o coll nil))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISeqable
+  (-seq [coll] coll)
+  
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable Cons)
+
+(defn cons
+  "Returns a new seq where x is the first element and coll is the rest."
+  [x coll]
+  (if (or (nil? coll)
+          (implements? ISeq coll))
+    (Cons. nil x coll nil)
+    (Cons. nil x (seq coll) nil)))
+
+(defn hash-keyword [k]
+  (int (+ (hash-symbol k) 0x9e3779b9)))
+
+(defn- compare-keywords [a b]
+  (cond
+   (identical? (.-fqn a) (.-fqn b)) 0
+   (and (not (.-ns a)) (.-ns b)) -1
+   (.-ns a) (if-not (.-ns b)
+              1
+              (let [nsc (garray/defaultCompare (.-ns a) (.-ns b))]
+                (if (== 0 nsc)
+                  (garray/defaultCompare (.-name a) (.-name b))
+                  nsc)))
+   :default (garray/defaultCompare (.-name a) (.-name b))))
+
+(deftype Keyword [ns name fqn ^:mutable _hash]
+  Object
+  (toString [_] (str ":" fqn))
+  (equiv [this other]
+    (-equiv this other))
+  
+  IEquiv
+  (-equiv [_ other]
+    (if (instance? Keyword other)
+      (identical? fqn (.-fqn other))
+      false))
+  IFn
+  (-invoke [kw coll]
+    (get coll kw))
+  (-invoke [kw coll not-found]
+    (get coll kw not-found))
+
+  IHash
+  (-hash [this]
+    (caching-hash this hash-keyword _hash))
+
+  INamed
+  (-name [_] name)
+  (-namespace [_] ns)
+
+  IPrintWithWriter
+  (-pr-writer [o writer _] (-write writer (str ":" fqn))))
+
+(defn ^boolean keyword?
+  "Return true if x is a Keyword"
+  [x]
+  (instance? Keyword x))
+
+(defn ^boolean keyword-identical?
+  "Efficient test to determine that two keywords are identical."
+  [x y]
+  (if (identical? x y)
+    true
+    (if (and (keyword? x) (keyword? y))
+      (identical? (.-fqn x) (.-fqn y))
+      false)))
+
+(defn ^boolean symbol-identical?
+  "Efficient test to determine that two symbols are identical."
+  [x y]
+  (if (identical? x y)
+    true
+    (if (and (symbol? x) (symbol? y))
+      (identical? (.-str x) (.-str y))
+      false)))
+
+(defn namespace
+  "Returns the namespace String of a symbol or keyword, or nil if not present."
+  [x]
+  (if (implements? INamed x)
+    (-namespace ^not-native x)
+    (throw (js/Error. (str "Doesn't support namespace: " x)))))
+
+(defn ^boolean ident?
+  "Return true if x is a symbol or keyword"
+  [x] (or (keyword? x) (symbol? x)))
+
+(defn ^boolean simple-ident?
+  "Return true if x is a symbol or keyword without a namespace"
+  [x] (and (ident? x) (nil? (namespace x))))
+
+(defn ^boolean qualified-ident?
+  "Return true if x is a symbol or keyword with a namespace"
+  [x] (boolean (and (ident? x) (namespace x) true)))
+
+(defn ^boolean simple-symbol?
+  "Return true if x is a symbol without a namespace"
+  [x] (and (symbol? x) (nil? (namespace x))))
+
+(defn ^boolean qualified-symbol?
+  "Return true if x is a symbol with a namespace"
+  [x] (boolean (and (symbol? x) (namespace x) true)))
+
+(defn ^boolean simple-keyword?
+  "Return true if x is a keyword without a namespace"
+  [x] (and (keyword? x) (nil? (namespace x))))
+
+(defn ^boolean qualified-keyword?
+  "Return true if x is a keyword with a namespace"
+  [x] (boolean (and (keyword? x) (namespace x) true)))
+
+(defn keyword
+  "Returns a Keyword with the given namespace and name.  Do not use :
+  in the keyword strings, it will be added automatically."
+  ([name] (cond
+            (keyword? name) name
+            (symbol? name) (Keyword.
+                             (cljs.core/namespace name)
+                             (cljs.core/name name) (.-str name) nil)
+            (string? name) (let [parts (.split name "/")]
+                             (if (== (alength parts) 2)
+                               (Keyword. (aget parts 0) (aget parts 1) name nil)
+                               (Keyword. nil (aget parts 0) name nil)))))
+  ([ns name]
+   (let [ns   (cond
+                (keyword? ns) (cljs.core/name ns)
+                (symbol? ns)  (cljs.core/name ns)
+                :else ns)
+         name (cond
+                (keyword? name) (cljs.core/name name)
+                (symbol? name) (cljs.core/name name)
+                :else name)]
+     (Keyword. ns name (str (when ns (str ns "/")) name) nil))))
+
+
+(deftype LazySeq [meta ^:mutable fn ^:mutable s ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (sval [coll]
+    (if (nil? fn)
+      s
+      (do
+        (set! s (fn))
+        (set! fn nil)
+        s)))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IPending
+  (-realized? [coll]
+    (not fn))
+
+  IWithMeta
+  (-with-meta [coll meta] (LazySeq. meta #(-seq coll) nil __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISeq
+  (-first [coll]
+    (-seq coll)
+    (when-not (nil? s)
+      (first s)))
+  (-rest [coll]
+    (-seq coll)
+    (if-not (nil? s)
+      (rest s)
+      ()))
+
+  INext
+  (-next [coll]
+    (-seq coll)
+    (when-not (nil? s)
+      (next s)))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISeqable
+  (-seq [coll]
+    (.sval coll)
+    (when-not (nil? s)
+      (loop [ls s]
+        (if (instance? LazySeq ls)
+          (recur (.sval ls))
+          (do (set! s ls)
+            (seq s))))))
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable LazySeq)
+
+(declare ArrayChunk)
+
+(deftype ChunkBuffer [^:mutable buf ^:mutable end]
+  Object
+  (add [_ o]
+    (aset buf end o)
+    (set! end (inc end)))
+
+  (chunk [_]
+    (let [ret (ArrayChunk. buf 0 end)]
+      (set! buf nil)
+      ret))
+
+  ICounted
+  (-count [_] end))
+
+(defn chunk-buffer [capacity]
+  (ChunkBuffer. (make-array capacity) 0))
+
+(deftype ArrayChunk [arr off end]
+  ICounted
+  (-count [_] (- end off))
+
+  IIndexed
+  (-nth [coll i]
+    (aget arr (+ off i)))
+  (-nth [coll i not-found]
+    (if (and (>= i 0) (< i (- end off)))
+      (aget arr (+ off i))
+      not-found))
+
+  IChunk
+  (-drop-first [coll]
+    (if (== off end)
+      (throw (js/Error. "-drop-first of empty chunk"))
+      (ArrayChunk. arr (inc off) end)))
+
+  IReduce
+  (-reduce [coll f]
+    (array-reduce arr f (aget arr off) (inc off)))
+  (-reduce [coll f start]
+    (array-reduce arr f start off)))
+
+(defn array-chunk
+  ([arr]
+     (ArrayChunk. arr 0 (alength arr)))
+  ([arr off]
+     (ArrayChunk. arr off (alength arr)))
+  ([arr off end]
+     (ArrayChunk. arr off end)))
+
+(deftype ChunkedCons [chunk more meta ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IWithMeta
+  (-with-meta [coll m]
+    (ChunkedCons. chunk more m __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  ISeqable
+  (-seq [coll] coll)
+
+  ASeq
+  ISeq
+  (-first [coll] (-nth chunk 0))
+  (-rest [coll]
+    (if (> (-count chunk) 1)
+      (ChunkedCons. (-drop-first chunk) more meta nil)
+      (if (nil? more)
+        ()
+        more)))
+
+  INext
+  (-next [coll]
+    (if (> (-count chunk) 1)
+      (ChunkedCons. (-drop-first chunk) more meta nil)
+      (let [more (-seq more)]
+        (when-not (nil? more)
+          more))))
+
+  IChunkedSeq
+  (-chunked-first [coll] chunk)
+  (-chunked-rest [coll]
+    (if (nil? more)
+      ()
+      more))
+
+  IChunkedNext
+  (-chunked-next [coll]
+    (if (nil? more)
+      nil
+      more))
+
+  ICollection
+  (-conj [this o]
+    (cons o this))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash)))
+
+(es6-iterable ChunkedCons)
+
+(defn chunk-cons [chunk rest]
+  (if (zero? (-count chunk))
+    rest
+    (ChunkedCons. chunk rest nil nil)))
+
+(defn chunk-append [b x]
+  (.add b x))
+
+(defn chunk [b]
+  (.chunk b))
+
+(defn chunk-first [s]
+  (-chunked-first s))
+
+(defn chunk-rest [s]
+  (-chunked-rest s))
+
+(defn chunk-next [s]
+  (if (implements? IChunkedNext s)
+    (-chunked-next s)
+    (seq (-chunked-rest s))))
+
+;;;;;;;;;;;;;;;;
+
+(defn to-array
+  "Naive impl of to-array as a start."
+  [s]
+  (let [ary (array)]
+    (loop [s (seq s)]
+      (if-not (nil? s)
+        (do (. ary push (first s))
+            (recur (next s)))
+        ary))))
+
+(defn to-array-2d
+  "Returns a (potentially-ragged) 2-dimensional array
+  containing the contents of coll."
+  [coll]
+    (let [ret (make-array (count coll))]
+      (loop [i 0 xs (seq coll)]
+        (when-not (nil? xs)
+          (aset ret i (to-array (first xs)))
+          (recur (inc i) (next xs))))
+      ret))
+
+(defn int-array
+  "Creates an array of ints. Does not coerce array, provided for compatibility
+  with Clojure."
+  ([size-or-seq]
+     (if (number? size-or-seq)
+       (int-array size-or-seq nil)
+       (into-array size-or-seq)))
+  ([size init-val-or-seq]
+     (let [a (make-array size)]
+       (if (seq? init-val-or-seq)
+         (let [s (seq init-val-or-seq)]
+           (loop [i 0 s s]
+             (if (and s (< i size))
+               (do
+                 (aset a i (first s))
+                 (recur (inc i) (next s)))
+               a)))
+         (do
+           (dotimes [i size]
+             (aset a i init-val-or-seq))
+           a)))))
+
+(defn long-array
+  "Creates an array of longs. Does not coerce array, provided for compatibility
+  with Clojure."
+  ([size-or-seq]
+     (if (number? size-or-seq)
+       (long-array size-or-seq nil)
+       (into-array size-or-seq)))
+  ([size init-val-or-seq]
+     (let [a (make-array size)]
+       (if (seq? init-val-or-seq)
+         (let [s (seq init-val-or-seq)]
+           (loop [i 0 s s]
+             (if (and s (< i size))
+               (do
+                 (aset a i (first s))
+                 (recur (inc i) (next s)))
+               a)))
+         (do
+           (dotimes [i size]
+             (aset a i init-val-or-seq))
+           a)))))
+
+(defn double-array
+  "Creates an array of doubles. Does not coerce array, provided for compatibility
+  with Clojure."
+  ([size-or-seq]
+     (if (number? size-or-seq)
+       (double-array size-or-seq nil)
+       (into-array size-or-seq)))
+  ([size init-val-or-seq]
+     (let [a (make-array size)]
+       (if (seq? init-val-or-seq)
+         (let [s (seq init-val-or-seq)]
+           (loop [i 0 s s]
+             (if (and s (< i size))
+               (do
+                 (aset a i (first s))
+                 (recur (inc i) (next s)))
+               a)))
+         (do
+           (dotimes [i size]
+             (aset a i init-val-or-seq))
+           a)))))
+
+(defn object-array
+  "Creates an array of objects. Does not coerce array, provided for compatibility
+  with Clojure."
+  ([size-or-seq]
+     (if (number? size-or-seq)
+       (object-array size-or-seq nil)
+       (into-array size-or-seq)))
+  ([size init-val-or-seq]
+     (let [a (make-array size)]
+       (if (seq? init-val-or-seq)
+         (let [s (seq init-val-or-seq)]
+           (loop [i 0 s s]
+             (if (and s (< i size))
+               (do
+                 (aset a i (first s))
+                 (recur (inc i) (next s)))
+               a)))
+         (do
+           (dotimes [i size]
+             (aset a i init-val-or-seq))
+           a)))))
+
+(defn bounded-count
+  "If coll is counted? returns its count, else will count at most the first n
+   elements of coll using its seq"
+  {:added "1.9"}
+  [n coll]
+  (if (counted? coll)
+    (count coll)
+    (loop [i 0 s (seq coll)]
+      (if (and (not (nil? s)) (< i n))
+        (recur (inc i) (next s))
+        i))))
+
+(defn spread
+  [arglist]
+  (when-not (nil? arglist)
+    (let [n (next arglist)]
+      (if (nil? n)
+        (seq (first arglist))
+        (cons (first arglist)
+              (spread n))))))
+
+(defn concat
+  "Returns a lazy seq representing the concatenation of the elements in the supplied colls."
+  ([] (lazy-seq nil))
+  ([x] (lazy-seq x))
+  ([x y]
+    (lazy-seq
+      (let [s (seq x)]
+        (if s
+          (if (chunked-seq? s)
+            (chunk-cons (chunk-first s) (concat (chunk-rest s) y))
+            (cons (first s) (concat (rest s) y)))
+          y))))
+  ([x y & zs]
+     (let [cat (fn cat [xys zs]
+                 (lazy-seq
+                   (let [xys (seq xys)]
+                     (if xys
+                       (if (chunked-seq? xys)
+                         (chunk-cons (chunk-first xys)
+                                     (cat (chunk-rest xys) zs))
+                         (cons (first xys) (cat (rest xys) zs)))
+                       (when zs
+                         (cat (first zs) (next zs)))))))]
+       (cat (concat x y) zs))))
+
+(defn list*
+  "Creates a new list containing the items prepended to the rest, the
+  last of which will be treated as a sequence."
+  ([args] (seq args))
+  ([a args] (cons a args))
+  ([a b args] (cons a (cons b args)))
+  ([a b c args] (cons a (cons b (cons c args))))
+  ([a b c d & more]
+     (cons a (cons b (cons c (cons d (spread more)))))))
+
+
+;;; Transients
+
+(defn transient
+  "Returns a new, transient version of the collection, in constant time."
+  [coll]
+  (-as-transient coll))
+
+(defn persistent!
+  "Returns a new, persistent version of the transient collection, in
+  constant time. The transient collection cannot be used after this
+  call, any such use will throw an exception."
+  [tcoll]
+  (-persistent! tcoll))
+
+(defn conj!
+  "Adds val to the transient collection, and return tcoll. The 'addition'
+  may happen at different 'places' depending on the concrete type."
+  ([] (transient []))
+  ([tcoll] tcoll)
+  ([tcoll val]
+    (-conj! tcoll val))
+  ([tcoll val & vals]
+    (let [ntcoll (-conj! tcoll val)]
+      (if vals
+        (recur ntcoll (first vals) (next vals))
+        ntcoll))))
+
+(defn assoc!
+  "When applied to a transient map, adds mapping of key(s) to
+  val(s). When applied to a transient vector, sets the val at index.
+  Note - index must be <= (count vector). Returns coll."
+  ([tcoll key val]
+    (-assoc! tcoll key val))
+  ([tcoll key val & kvs]
+    (let [ntcoll (-assoc! tcoll key val)]
+      (if kvs
+        (recur ntcoll (first kvs) (second kvs) (nnext kvs))
+        ntcoll))))
+
+(defn dissoc!
+  "Returns a transient map that doesn't contain a mapping for key(s)."
+  ([tcoll key]
+    (-dissoc! tcoll key))
+  ([tcoll key & ks]
+    (let [ntcoll (-dissoc! tcoll key)]
+      (if ks
+        (recur ntcoll (first ks) (next ks))
+        ntcoll))))
+
+(defn pop!
+  "Removes the last item from a transient vector. If
+  the collection is empty, throws an exception. Returns tcoll"
+  [tcoll]
+  (-pop! tcoll))
+
+(defn disj!
+  "disj[oin]. Returns a transient set of the same (hashed/sorted) type, that
+  does not contain key(s)."
+  ([tcoll val]
+    (-disjoin! tcoll val))
+  ([tcoll val & vals]
+    (let [ntcoll (-disjoin! tcoll val)]
+      (if vals
+        (recur ntcoll (first vals) (next vals))
+        ntcoll))))
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; apply ;;;;;;;;;;;;;;;;
+
+;; see core.clj
+(gen-apply-to)
+
+(set! *unchecked-if* true)
+
+(defn- apply-to-simple
+  "Internal. DO NOT USE!
+  Assumes args was already called with seq beforehand!"
+  ([f ^seq args]
+   (if (nil? args)
+     (if (.-cljs$core$IFn$_invoke$arity$0 f)
+       (.cljs$core$IFn$_invoke$arity$0 f)
+       (.call f f))
+     (apply-to-simple f (-first args) (next args))))
+  ([f a0 ^seq args]
+   (if (nil? args)
+     (if (.-cljs$core$IFn$_invoke$arity$1 f)
+       (.cljs$core$IFn$_invoke$arity$1 f a0)
+       (.call f f a0))
+     (apply-to-simple f a0 (-first args) (next args))))
+  ([f a0 a1 ^seq args]
+   (if (nil? args)
+     (if (.-cljs$core$IFn$_invoke$arity$2 f)
+       (.cljs$core$IFn$_invoke$arity$2 f a0 a1)
+       (.call f f a0 a1))
+     (apply-to-simple f a0 a1 (-first args) (next args))))
+  ([f a0 a1 a2 ^seq args]
+   (if (nil? args)
+     (if (.-cljs$core$IFn$_invoke$arity$3 f)
+       (.cljs$core$IFn$_invoke$arity$3 f a0 a1 a2)
+       (.call f f a0 a1 a2))
+     (apply-to-simple f a0 a1 a2 (-first args) (next args))))
+  ([f a0 a1 a2 a3 ^seq args]
+   (if (nil? args)
+     (if (.-cljs$core$IFn$_invoke$arity$4 f)
+       (.cljs$core$IFn$_invoke$arity$4 f a0 a1 a2 a3)
+       (.call f f a0 a1 a2 a3))
+     (gen-apply-to-simple f 4 args))))
+
+(defn apply
+  "Applies fn f to the argument list formed by prepending intervening arguments to args."
+  ([f args]
+   (if (.-cljs$lang$applyTo f)
+     (let [fixed-arity (.-cljs$lang$maxFixedArity f)
+           bc (bounded-count (inc fixed-arity) args)]
+       (if (<= bc fixed-arity)
+         (apply-to f bc args)
+         (.cljs$lang$applyTo f args)))
+     (apply-to-simple f (seq args))))
+  ([f x args]
+   (if (.-cljs$lang$applyTo f)
+     (let [arglist (list* x args)
+           fixed-arity (.-cljs$lang$maxFixedArity f)
+           bc (inc (bounded-count fixed-arity args))]
+       (if (<= bc fixed-arity)
+         (apply-to f bc arglist)
+         (.cljs$lang$applyTo f arglist)))
+     (apply-to-simple f x (seq args))))
+  ([f x y args]
+   (if (.-cljs$lang$applyTo f)
+     (let [arglist (list* x y args)
+           fixed-arity (.-cljs$lang$maxFixedArity f)
+           bc (+ 2 (bounded-count (dec fixed-arity) args))]
+       (if (<= bc fixed-arity)
+         (apply-to f bc arglist)
+         (.cljs$lang$applyTo f arglist)))
+     (apply-to-simple f x y (seq args))))
+  ([f x y z args]
+   (if (.-cljs$lang$applyTo f)
+     (let [arglist (list* x y z args)
+           fixed-arity (.-cljs$lang$maxFixedArity f)
+           bc (+ 3 (bounded-count (- fixed-arity 2) args))]
+       (if (<= bc fixed-arity)
+         (apply-to f bc arglist)
+         (.cljs$lang$applyTo f arglist)))
+     (apply-to-simple f x y z (seq args))))
+  ([f a b c d & args]
+   (if (.-cljs$lang$applyTo f)
+     (let [spread-args (spread args)
+           arglist (cons a (cons b (cons c (cons d spread-args))))
+           fixed-arity (.-cljs$lang$maxFixedArity f)
+           bc (+ 4 (bounded-count (- fixed-arity 3) spread-args))]
+       (if (<= bc fixed-arity)
+         (apply-to f bc arglist)
+         (.cljs$lang$applyTo f arglist)))
+     (apply-to-simple f a b c d (spread args)))))
+
+(set! *unchecked-if* false)
+
+(defn vary-meta
+ "Returns an object of the same type and value as obj, with
+  (apply f (meta obj) args) as its metadata."
+  ([obj f]
+   (with-meta obj (f (meta obj))))
+  ([obj f a]
+   (with-meta obj (f (meta obj) a)))
+  ([obj f a b]
+   (with-meta obj (f (meta obj) a b)))
+  ([obj f a b c]
+   (with-meta obj (f (meta obj) a b c)))
+  ([obj f a b c d]
+   (with-meta obj (f (meta obj) a b c d)))
+  ([obj f a b c d & args]
+   (with-meta obj (apply f (meta obj) a b c d args))))
+
+(defn ^boolean not=
+  "Same as (not (= obj1 obj2))"
+  ([x] false)
+  ([x y] (not (= x y)))
+  ([x y & more]
+   (not (apply = x y more))))
+
+(defn not-empty
+  "If coll is empty, returns nil, else coll"
+  [coll] (when (seq coll) coll))
+
+(defn nil-iter []
+  (reify
+    Object
+    (hasNext [_] false)
+    (next [_] (js/Error. "No such element"))
+    (remove [_] (js/Error. "Unsupported operation"))))
+
+(deftype StringIter [s ^:mutable i]
+  Object
+  (hasNext [_] (< i (.-length s)))
+  (next [_]
+    (let [ret (.charAt s i)]
+      (set! i (inc i))
+      ret))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(defn string-iter [x]
+  (StringIter. x 0))
+
+(deftype ArrayIter [arr ^:mutable i]
+  Object
+  (hasNext [_] (< i (alength arr)))
+  (next [_]
+    (let [ret (aget arr i)]
+      (set! i (inc i))
+      ret))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(defn array-iter [x]
+  (ArrayIter. x 0))
+
+(def INIT #js {})
+(def START #js {})
+
+(deftype SeqIter [^:mutable _seq ^:mutable _next]
+  Object
+  (hasNext [_]
+    (if (identical? _seq INIT)
+      (do
+        (set! _seq START)
+        (set! _next (seq _next)))
+      (if (identical? _seq _next)
+        (set! _next (next _seq))))
+    (not (nil? _next)))
+  (next [this]
+    (if-not ^boolean (.hasNext this)
+      (throw (js/Error. "No such element"))
+      (do
+        (set! _seq _next)
+        (first _next))))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(defn seq-iter [coll]
+  (SeqIter. INIT coll))
+
+(defn iter [coll]
+  (cond
+    (iterable? coll) (-iterator coll)
+    (nil? coll) (nil-iter)
+    (string? coll) (string-iter coll)
+    (array? coll) (array-iter coll)
+    (seqable? coll) (seq-iter coll)
+    :else (throw (js/Error. (str "Cannot create iterator from " coll)))))
+
+(deftype Many [vals]
+  Object
+  (add [this o]
+    (.push vals o)
+    this)
+  (remove [this]
+    (.shift vals))
+  (isEmpty [this]
+    (zero? (.-length vals)))
+  (toString [this]
+    (str "Many: " vals)))
+
+(def ^:private NONE #js {})
+
+(deftype Single [^:mutable val]
+  Object
+  (add [this o]
+    (if (identical? val NONE)
+      (do
+        (set! val o)
+        this)
+      (Many. #js [val o])))
+  (remove [this]
+    (if (identical? val NONE)
+      (throw (js/Error. (str "Removing object from empty buffer")))
+      (let [ret val]
+        (set! val NONE)
+        ret)))
+  (isEmpty [this]
+    (identical? val NONE))
+  (toString [this]
+    (str "Single: " val)))
+
+(deftype Empty []
+  Object
+  (add [this o]
+    (Single. o))
+  (remove [this]
+    (throw (js/Error. (str "Removing object from empty buffer"))))
+  (isEmpty [this]
+    true)
+  (toString [this]
+    "Empty"))
+
+(def ^:private EMPTY (Empty.))
+
+(deftype MultiIterator [iters]
+  Object
+  (hasNext [_]
+    (loop [iters (seq iters)]
+      (if-not (nil? iters)
+        (let [iter (first iters)]
+          (if-not ^boolean (.hasNext iter)
+            false
+            (recur (next iters))))
+        true)))
+  (next [_]
+    (let [nexts (array)]
+      (dotimes [i (alength iters)]
+        (aset nexts i (.next (aget iters i))))
+      (prim-seq nexts 0))))
+
+(defn- chunkIteratorSeq [iter]
+  (lazy-seq
+    (when ^boolean (.hasNext iter)
+      (let [arr (array)]
+        (loop [n 0]
+          (if (and (.hasNext iter) (< n 32))
+            (do
+              (aset arr n (.next iter))
+              (recur (inc n)))
+            (chunk-cons (array-chunk arr 0 n) (chunkIteratorSeq iter))))))))
+
+(deftype TransformerIterator [^:mutable buffer ^:mutable _next ^:mutable completed ^:mutable xf sourceIter multi]
+  Object
+  (step [this]
+    (if-not (identical? _next NONE)
+      true
+      (loop []
+        (if (identical? _next NONE)
+          (if ^boolean (.isEmpty buffer)
+            (if ^boolean completed
+              false
+              (if ^boolean (.hasNext sourceIter)
+                (let [iter (if ^boolean multi
+                             (apply xf (cons nil (.next sourceIter)))
+                             (xf nil (.next sourceIter)))]
+                  (when (reduced? iter)
+                    (xf nil)
+                    (set! completed true))
+                  (recur))
+                (do
+                  (xf nil)
+                  (set! completed true)
+                  (recur))))
+            (do
+              (set! _next (.remove buffer))
+              (recur)))
+          true))))
+  (hasNext [this]
+    (.step this))
+  (next [this]
+    (if ^boolean (.hasNext this)
+      (let [ret _next]
+        (set! _next NONE)
+        ret)
+      (throw (js/Error. "No such element"))))
+  (remove [_]
+    (js/Error. "Unsupported operation")))
+
+(es6-iterable TransformerIterator)
+
+(defn transformer-iterator
+  [xform sourceIter multi]
+  (let [iterator (TransformerIterator. EMPTY NONE false nil sourceIter multi)]
+    (set! (.-xf iterator)
+      (xform (fn
+               ([] nil)
+               ([acc] acc)
+               ([acc o]
+                (set! (.-buffer iterator) (.add (.-buffer iterator) o))
+                acc))))
+    iterator))
+
+(set! (.-create TransformerIterator)
+  (fn [xform source]
+    (transformer-iterator xform source false)))
+
+(set! (.-createMulti TransformerIterator)
+  (fn [xform sources]
+    (transformer-iterator xform (MultiIterator. (to-array sources)) true)))
+
+(defn sequence
+  "Coerces coll to a (possibly empty) sequence, if it is not already
+  one. Will not force a lazy seq. (sequence nil) yields (), When a
+  transducer is supplied, returns a lazy sequence of applications of
+  the transform to the items in coll(s), i.e. to the set of first
+  items of each coll, followed by the set of second
+  items in each coll, until any one of the colls is exhausted.  Any
+  remaining items in other colls are ignored. The transform should accept
+  number-of-colls arguments"
+  ([coll]
+     (if (seq? coll)
+       coll
+       (or (seq coll) ())))
+  ([xform coll]
+   (or (chunkIteratorSeq
+         (.create TransformerIterator xform (iter coll)))
+       ()))
+  ([xform coll & colls]
+   (or (chunkIteratorSeq
+         (.createMulti TransformerIterator xform (map iter (cons coll colls))))
+       ())))
+
+(defn ^boolean every?
+  "Returns true if (pred x) is logical true for every x in coll, else
+  false."
+  [pred coll]
+  (cond
+   (nil? (seq coll)) true
+   (pred (first coll)) (recur pred (next coll))
+   :else false))
+
+(defn ^boolean not-every?
+  "Returns false if (pred x) is logical true for every x in
+  coll, else true."
+  [pred coll] (not (every? pred coll)))
+
+(defn some
+  "Returns the first logical true value of (pred x) for any x in coll,
+  else nil.  One common idiom is to use a set as pred, for example
+  this will return :fred if :fred is in the sequence, otherwise nil:
+  (some #{:fred} coll)"
+  [pred coll]
+    (when (seq coll)
+      (or (pred (first coll)) (recur pred (next coll)))))
+
+(defn ^boolean not-any?
+  "Returns false if (pred x) is logical true for any x in coll,
+  else true."
+  [pred coll] (not (some pred coll)))
+
+(defn ^boolean even?
+  "Returns true if n is even, throws an exception if n is not an integer"
+   [n] (if (integer? n)
+        (zero? (bit-and n 1))
+        (throw (js/Error. (str "Argument must be an integer: " n)))))
+
+(defn ^boolean odd?
+  "Returns true if n is odd, throws an exception if n is not an integer"
+  [n] (not (even? n)))
+
+(defn complement
+  "Takes a fn f and returns a fn that takes the same arguments as f,
+  has the same effects, if any, and returns the opposite truth value."
+  [f]
+  (fn
+    ([] (not (f)))
+    ([x] (not (f x)))
+    ([x y] (not (f x y)))
+    ([x y & zs] (not (apply f x y zs)))))
+
+(defn constantly
+  "Returns a function that takes any number of arguments and returns x."
+  [x] (fn [& args] x))
+
+(defn comp
+  "Takes a set of functions and returns a fn that is the composition
+  of those fns.  The returned fn takes a variable number of args,
+  applies the rightmost of fns to the args, the next
+  fn (right-to-left) to the result, etc."
+  ([] identity)
+  ([f] f)
+  ([f g]
+     (fn
+       ([] (f (g)))
+       ([x] (f (g x)))
+       ([x y] (f (g x y)))
+       ([x y z] (f (g x y z)))
+       ([x y z & args] (f (apply g x y z args)))))
+  ([f g h]
+     (fn
+       ([] (f (g (h))))
+       ([x] (f (g (h x))))
+       ([x y] (f (g (h x y))))
+       ([x y z] (f (g (h x y z))))
+       ([x y z & args] (f (g (apply h x y z args))))))
+  ([f1 f2 f3 & fs]
+    (let [fs (reverse (list* f1 f2 f3 fs))]
+      (fn [& args]
+        (loop [ret (apply (first fs) args) fs (next fs)]
+          (if fs
+            (recur ((first fs) ret) (next fs))
+            ret))))))
+
+(defn partial
+  "Takes a function f and fewer than the normal arguments to f, and
+  returns a fn that takes a variable number of additional args. When
+  called, the returned function calls f with args + additional args."
+  ([f] f)
+  ([f arg1]
+   (fn
+     ([] (f arg1))
+     ([x] (f arg1 x))
+     ([x y] (f arg1 x y))
+     ([x y z] (f arg1 x y z))
+     ([x y z & args] (apply f arg1 x y z args))))
+  ([f arg1 arg2]
+   (fn
+     ([] (f arg1 arg2))
+     ([x] (f arg1 arg2 x))
+     ([x y] (f arg1 arg2 x y))
+     ([x y z] (f arg1 arg2 x y z))
+     ([x y z & args] (apply f arg1 arg2 x y z args))))
+  ([f arg1 arg2 arg3]
+   (fn
+     ([] (f arg1 arg2 arg3))
+     ([x] (f arg1 arg2 arg3 x))
+     ([x y] (f arg1 arg2 arg3 x y))
+     ([x y z] (f arg1 arg2 arg3 x y z))
+     ([x y z & args] (apply f arg1 arg2 arg3 x y z args))))
+  ([f arg1 arg2 arg3 & more]
+   (fn [& args] (apply f arg1 arg2 arg3 (concat more args)))))
+
+(defn fnil
+  "Takes a function f, and returns a function that calls f, replacing
+  a nil first argument to f with the supplied value x. Higher arity
+  versions can replace arguments in the second and third
+  positions (y, z). Note that the function f can take any number of
+  arguments, not just the one(s) being nil-patched."
+  ([f x]
+   (fn
+     ([a] (f (if (nil? a) x a)))
+     ([a b] (f (if (nil? a) x a) b))
+     ([a b c] (f (if (nil? a) x a) b c))
+     ([a b c & ds] (apply f (if (nil? a) x a) b c ds))))
+  ([f x y]
+   (fn
+     ([a b] (f (if (nil? a) x a) (if (nil? b) y b)))
+     ([a b c] (f (if (nil? a) x a) (if (nil? b) y b) c))
+     ([a b c & ds] (apply f (if (nil? a) x a) (if (nil? b) y b) c ds))))
+  ([f x y z]
+   (fn
+     ([a b] (f (if (nil? a) x a) (if (nil? b) y b)))
+     ([a b c] (f (if (nil? a) x a) (if (nil? b) y b) (if (nil? c) z c)))
+     ([a b c & ds] (apply f (if (nil? a) x a) (if (nil? b) y b) (if (nil? c) z c) ds)))))
+
+(declare volatile!)
+
+(defn map-indexed
+  "Returns a lazy sequence consisting of the result of applying f to 0
+  and the first item of coll, followed by applying f to 1 and the second
+  item in coll, etc, until coll is exhausted. Thus function f should
+  accept 2 arguments, index and item. Returns a stateful transducer when
+  no collection is provided."
+  ([f]
+    (fn [rf]
+      (let [i (volatile! -1)]
+        (fn
+          ([] (rf))
+          ([result] (rf result))
+          ([result input]
+            (rf result (f (vswap! i inc) input)))))))
+  ([f coll]
+    (letfn [(mapi [idx coll]
+              (lazy-seq
+                (when-let [s (seq coll)]
+                  (if (chunked-seq? s)
+                    (let [c (chunk-first s)
+                          size (count c)
+                          b (chunk-buffer size)]
+                      (dotimes [i size]
+                        (chunk-append b (f (+ idx i) (-nth c i))))
+                      (chunk-cons (chunk b) (mapi (+ idx size) (chunk-rest s))))
+                    (cons (f idx (first s)) (mapi (inc idx) (rest s)))))))]
+      (mapi 0 coll))))
+
+(defn keep
+  "Returns a lazy sequence of the non-nil results of (f item). Note,
+  this means false return values will be included.  f must be free of
+  side-effects.  Returns a transducer when no collection is provided."
+  ([f]
+   (fn [rf]
+     (fn
+       ([] (rf))
+       ([result] (rf result))
+       ([result input]
+          (let [v (f input)]
+            (if (nil? v)
+              result
+              (rf result v)))))))
+  ([f coll]
+   (lazy-seq
+    (when-let [s (seq coll)]
+      (if (chunked-seq? s)
+        (let [c (chunk-first s)
+              size (count c)
+              b (chunk-buffer size)]
+          (dotimes [i size]
+            (let [x (f (-nth c i))]
+              (when-not (nil? x)
+                (chunk-append b x))))
+          (chunk-cons (chunk b) (keep f (chunk-rest s))))
+        (let [x (f (first s))]
+          (if (nil? x)
+            (keep f (rest s))
+            (cons x (keep f (rest s))))))))))
+
+;; =============================================================================
+;; Atom
+
+(deftype Atom [state meta validator watches]
+  Object
+  (equiv [this other]
+    (-equiv this other))
+
+  IAtom
+
+  IEquiv
+  (-equiv [o other] (identical? o other))
+
+  IDeref
+  (-deref [_] state)
+
+  IMeta
+  (-meta [_] meta)
+
+  IWatchable
+  (-notify-watches [this oldval newval]
+    (doseq [[key f] watches]
+      (f key this oldval newval)))
+  (-add-watch [this key f]
+    (set! (.-watches this) (assoc watches key f))
+    this)
+  (-remove-watch [this key]
+    (set! (.-watches this) (dissoc watches key)))
+
+  IHash
+  (-hash [this] (goog/getUid this)))
+
+(defn atom
+  "Creates and returns an Atom with an initial value of x and zero or
+  more options (in any order):
+
+  :meta metadata-map
+
+  :validator validate-fn
+
+  If metadata-map is supplied, it will be come the metadata on the
+  atom. validate-fn must be nil or a side-effect-free fn of one
+  argument, which will be passed the intended new state on any state
+  change. If the new state is unacceptable, the validate-fn should
+  return false or throw an Error.  If either of these error conditions
+  occur, then the value of the atom will not change."
+  ([x] (Atom. x nil nil nil))
+  ([x & {:keys [meta validator]}] (Atom. x meta validator nil)))
+
+(declare pr-str)
+
+(defn reset!
+  "Sets the value of atom to newval without regard for the
+  current value. Returns new-value."
+  [a new-value]
+  (if (instance? Atom a)
+    (let [validate (.-validator a)]
+      (when-not (nil? validate)
+        (when-not (validate new-value)
+          (throw (js/Error. "Validator rejected reference state"))))
+      (let [old-value (.-state a)]
+        (set! (.-state a) new-value)
+        (when-not (nil? (.-watches a))
+          (-notify-watches a old-value new-value))
+        new-value))
+    (-reset! a new-value)))
+
+(defn reset-vals!
+  "Sets the value of atom to newval. Returns [old new], the value of the
+   atom before and after the reset."
+  {:added "1.9"}
+  [a new-value]
+  (let [validate (.-validator a)]
+    (when-not (nil? validate)
+      (when-not (validate new-value)
+        (throw (js/Error. "Validator rejected reference state"))))
+    (let [old-value (.-state a)]
+      (set! (.-state a) new-value)
+      (when-not (nil? (.-watches a))
+        (-notify-watches a old-value new-value))
+      [old-value new-value])))
+
+(defn swap!
+  "Atomically swaps the value of atom to be:
+  (apply f current-value-of-atom args). Note that f may be called
+  multiple times, and thus should be free of side effects.  Returns
+  the value that was swapped in."
+  ([a f]
+   (if (instance? Atom a)
+     (reset! a (f (.-state a)))
+     (-swap! a f)))
+  ([a f x]
+   (if (instance? Atom a)
+     (reset! a (f (.-state a) x))
+     (-swap! a f x)))
+  ([a f x y]
+   (if (instance? Atom a)
+     (reset! a (f (.-state a) x y))
+     (-swap! a f x y)))
+  ([a f x y & more]
+   (if (instance? Atom a)
+     (reset! a (apply f (.-state a) x y more))
+     (-swap! a f x y more))))
+
+(defn swap-vals!
+  "Atomically swaps the value of atom to be:
+  (apply f current-value-of-atom args). Note that f may be called
+  multiple times, and thus should be free of side effects.
+  Returns [old new], the value of the atom before and after the swap."
+  {:added "1.9"}
+  ([a f]
+   (reset-vals! a (f (.-state a))))
+  ([a f x]
+   (reset-vals! a (f (.-state a) x)))
+  ([a f x y]
+   (reset-vals! a (f (.-state a) x y)))
+  ([a f x y & more]
+   (reset-vals! a (apply f (.-state a) x y more))))
+
+(defn compare-and-set!
+  "Atomically sets the value of atom to newval if and only if the
+  current value of the atom is equal to oldval. Returns true if
+  set happened, else false."
+  [^not-native a oldval newval]
+  (if (= (-deref a) oldval)
+    (do (reset! a newval) true)
+    false))
+
+(defn set-validator!
+  "Sets the validator-fn for an atom. validator-fn must be nil or a
+  side-effect-free fn of one argument, which will be passed the intended
+  new state on any state change. If the new state is unacceptable, the
+  validator-fn should return false or throw an Error. If the current state
+  is not acceptable to the new validator, an Error will be thrown and the
+  validator will not be changed."
+  [iref val]
+  (when (and (some? val)
+             (not (val (-deref iref))))
+    (throw (js/Error. "Validator rejected reference state")))
+  (set! (.-validator iref) val))
+
+(defn get-validator
+  "Gets the validator-fn for a var/ref/agent/atom."
+  [iref]
+  (.-validator iref))
+
+(deftype Volatile [^:mutable state]
+  IVolatile
+  (-vreset! [_ new-state]
+    (set! state new-state))
+
+  IDeref
+  (-deref [_] state))
+
+(defn volatile!
+  "Creates and returns a Volatile with an initial value of val."
+  [val]
+  (Volatile. val))
+
+(defn ^boolean volatile?
+  "Returns true if x is a volatile."
+  [x] (instance? Volatile x))
+
+(defn vreset!
+  "Sets the value of volatile to newval without regard for the
+   current value. Returns newval."
+  [vol newval]  (-vreset! vol newval))
+
+(defn keep-indexed
+  "Returns a lazy sequence of the non-nil results of (f index item). Note,
+  this means false return values will be included.  f must be free of
+  side-effects.  Returns a stateful transducer when no collection is
+  provided."
+  ([f]
+   (fn [rf]
+     (let [ia (volatile! -1)]
+       (fn
+         ([] (rf))
+         ([result] (rf result))
+         ([result input]
+            (let [i (vswap! ia inc)
+                  v (f i input)]
+              (if (nil? v)
+                result
+                (rf result v))))))))
+  ([f coll]
+     (letfn [(keepi [idx coll]
+               (lazy-seq
+                (when-let [s (seq coll)]
+                  (if (chunked-seq? s)
+                    (let [c (chunk-first s)
+                          size (count c)
+                          b (chunk-buffer size)]
+                      (dotimes [i size]
+                        (let [x (f (+ idx i) (-nth c i))]
+                          (when-not (nil? x)
+                            (chunk-append b x))))
+                      (chunk-cons (chunk b) (keepi (+ idx size) (chunk-rest s))))
+                    (let [x (f idx (first s))]
+                      (if (nil? x)
+                        (keepi (inc idx) (rest s))
+                        (cons x (keepi (inc idx) (rest s)))))))))]
+       (keepi 0 coll))))
+
+(defn every-pred
+  "Takes a set of predicates and returns a function f that returns true if all of its
+  composing predicates return a logical true value against all of its arguments, else it returns
+  false. Note that f is short-circuiting in that it will stop execution on the first
+  argument that triggers a logical false result against the original predicates."
+  ([p]
+     (fn ep1
+       ([] true)
+       ([x] (boolean (p x)))
+       ([x y] (boolean (and (p x) (p y))))
+       ([x y z] (boolean (and (p x) (p y) (p z))))
+       ([x y z & args] (boolean (and (ep1 x y z)
+                                     (every? p args))))))
+  ([p1 p2]
+     (fn ep2
+       ([] true)
+       ([x] (boolean (and (p1 x) (p2 x))))
+       ([x y] (boolean (and (p1 x) (p1 y) (p2 x) (p2 y))))
+       ([x y z] (boolean (and (p1 x) (p1 y) (p1 z) (p2 x) (p2 y) (p2 z))))
+       ([x y z & args] (boolean (and (ep2 x y z)
+                                     (every? #(and (p1 %) (p2 %)) args))))))
+  ([p1 p2 p3]
+     (fn ep3
+       ([] true)
+       ([x] (boolean (and (p1 x) (p2 x) (p3 x))))
+       ([x y] (boolean (and (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y))))
+       ([x y z] (boolean (and (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y) (p1 z) (p2 z) (p3 z))))
+       ([x y z & args] (boolean (and (ep3 x y z)
+                                     (every? #(and (p1 %) (p2 %) (p3 %)) args))))))
+  ([p1 p2 p3 & ps]
+     (let [ps (list* p1 p2 p3 ps)]
+       (fn epn
+         ([] true)
+         ([x] (every? #(% x) ps))
+         ([x y] (every? #(and (% x) (% y)) ps))
+         ([x y z] (every? #(and (% x) (% y) (% z)) ps))
+         ([x y z & args] (boolean (and (epn x y z)
+                                       (every? #(every? % args) ps))))))))
+
+(defn some-fn
+  "Takes a set of predicates and returns a function f that returns the first logical true value
+  returned by one of its composing predicates against any of its arguments, else it returns
+  logical false. Note that f is short-circuiting in that it will stop execution on the first
+  argument that triggers a logical true result against the original predicates."
+  ([p]
+     (fn sp1
+       ([] nil)
+       ([x] (p x))
+       ([x y] (or (p x) (p y)))
+       ([x y z] (or (p x) (p y) (p z)))
+       ([x y z & args] (or (sp1 x y z)
+                           (some p args)))))
+  ([p1 p2]
+     (fn sp2
+       ([] nil)
+       ([x] (or (p1 x) (p2 x)))
+       ([x y] (or (p1 x) (p1 y) (p2 x) (p2 y)))
+       ([x y z] (or (p1 x) (p1 y) (p1 z) (p2 x) (p2 y) (p2 z)))
+       ([x y z & args] (or (sp2 x y z)
+                           (some #(or (p1 %) (p2 %)) args)))))
+  ([p1 p2 p3]
+     (fn sp3
+       ([] nil)
+       ([x] (or (p1 x) (p2 x) (p3 x)))
+       ([x y] (or (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y)))
+       ([x y z] (or (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y) (p1 z) (p2 z) (p3 z)))
+       ([x y z & args] (or (sp3 x y z)
+                           (some #(or (p1 %) (p2 %) (p3 %)) args)))))
+  ([p1 p2 p3 & ps]
+     (let [ps (list* p1 p2 p3 ps)]
+       (fn spn
+         ([] nil)
+         ([x] (some #(% x) ps))
+         ([x y] (some #(or (% x) (% y)) ps))
+         ([x y z] (some #(or (% x) (% y) (% z)) ps))
+         ([x y z & args] (or (spn x y z)
+                             (some #(some % args) ps)))))))
+
+(defn map
+  "Returns a lazy sequence consisting of the result of applying f to
+  the set of first items of each coll, followed by applying f to the
+  set of second items in each coll, until any one of the colls is
+  exhausted.  Any remaining items in other colls are ignored. Function
+  f should accept number-of-colls arguments. Returns a transducer when
+  no collection is provided."
+  ([f]
+    (fn [rf]
+      (fn
+        ([] (rf))
+        ([result] (rf result))
+        ([result input]
+           (rf result (f input)))
+        ([result input & inputs]
+           (rf result (apply f input inputs))))))
+  ([f coll]
+   (lazy-seq
+    (when-let [s (seq coll)]
+      (if (chunked-seq? s)
+        (let [c (chunk-first s)
+              size (count c)
+              b (chunk-buffer size)]
+          (dotimes [i size]
+              (chunk-append b (f (-nth c i))))
+          (chunk-cons (chunk b) (map f (chunk-rest s))))
+        (cons (f (first s)) (map f (rest s)))))))
+  ([f c1 c2]
+   (lazy-seq
+    (let [s1 (seq c1) s2 (seq c2)]
+      (when (and s1 s2)
+        (cons (f (first s1) (first s2))
+              (map f (rest s1) (rest s2)))))))
+  ([f c1 c2 c3]
+   (lazy-seq
+    (let [s1 (seq c1) s2 (seq c2) s3 (seq c3)]
+      (when (and  s1 s2 s3)
+        (cons (f (first s1) (first s2) (first s3))
+              (map f (rest s1) (rest s2) (rest s3)))))))
+  ([f c1 c2 c3 & colls]
+   (let [step (fn step [cs]
+                 (lazy-seq
+                  (let [ss (map seq cs)]
+                    (when (every? identity ss)
+                      (cons (map first ss) (step (map rest ss)))))))]
+     (map #(apply f %) (step (conj colls c3 c2 c1))))))
+
+(defn take
+  "Returns a lazy sequence of the first n items in coll, or all items if
+  there are fewer than n.  Returns a stateful transducer when
+  no collection is provided."
+  ([n]
+   {:pre [(number? n)]}
+     (fn [rf]
+       (let [na (volatile! n)]
+         (fn
+           ([] (rf))
+           ([result] (rf result))
+           ([result input]
+              (let [n @na
+                    nn (vswap! na dec)
+                    result (if (pos? n)
+                             (rf result input)
+                             result)]
+                (if (not (pos? nn))
+                  (ensure-reduced result)
+                  result)))))))
+  ([n coll]
+   {:pre [(number? n)]}
+     (lazy-seq
+       (when (pos? n)
+         (when-let [s (seq coll)]
+           (cons (first s) (take (dec n) (rest s))))))))
+
+(defn drop
+  "Returns a lazy sequence of all but the first n items in coll.
+  Returns a stateful transducer when no collection is provided."
+  ([n]
+   {:pre [(number? n)]}
+     (fn [rf]
+       (let [na (volatile! n)]
+         (fn
+           ([] (rf))
+           ([result] (rf result))
+           ([result input]
+              (let [n @na]
+                (vswap! na dec)
+                (if (pos? n)
+                  result
+                  (rf result input))))))))
+  ([n coll]
+   {:pre [(number? n)]}
+     (let [step (fn [n coll]
+                  (let [s (seq coll)]
+                    (if (and (pos? n) s)
+                      (recur (dec n) (rest s))
+                      s)))]
+       (lazy-seq (step n coll)))))
+
+(defn drop-last
+  "Return a lazy sequence of all but the last n (default 1) items in coll"
+  ([s] (drop-last 1 s))
+  ([n s] (map (fn [x _] x) s (drop n s))))
+
+(defn take-last
+  "Returns a seq of the last n items in coll.  Depending on the type
+  of coll may be no better than linear time.  For vectors, see also subvec."
+  [n coll]
+  (loop [s (seq coll), lead (seq (drop n coll))]
+    (if lead
+      (recur (next s) (next lead))
+      s)))
+
+(defn drop-while
+  "Returns a lazy sequence of the items in coll starting from the
+  first item for which (pred item) returns logical false.  Returns a
+  stateful transducer when no collection is provided."
+  ([pred]
+     (fn [rf]
+       (let [da (volatile! true)]
+         (fn
+           ([] (rf))
+           ([result] (rf result))
+           ([result input]
+              (let [drop? @da]
+                (if (and drop? (pred input))
+                  result
+                  (do
+                    (vreset! da nil)
+                    (rf result input)))))))))
+  ([pred coll]
+     (let [step (fn [pred coll]
+                  (let [s (seq coll)]
+                    (if (and s (pred (first s)))
+                      (recur pred (rest s))
+                      s)))]
+       (lazy-seq (step pred coll)))))
+
+(deftype Cycle [meta all prev ^:mutable current ^:mutable _next]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (currentval [coll]
+    (when-not ^seq current
+      (if-let [c (next prev)]
+        (set! current c)
+        (set! current all)))
+    current)
+
+  IPending
+  (-realized? [coll]
+    (some? current))
+
+  IWithMeta
+  (-with-meta [coll meta] (Cycle. meta all prev current _next))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISeq
+  (-first [coll]
+    (first (.currentval coll)))
+  (-rest [coll]
+    (when (nil? _next)
+      (set! _next (Cycle. nil all (.currentval coll) nil nil)))
+    _next)
+
+  INext
+  (-next [coll]
+    (-rest coll))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  ISeqable
+  (-seq [coll] coll)
+
+  IReduce
+  (-reduce [coll f]
+    (loop [s (.currentval coll) ret (first s)]
+      (let [s   (or (next s) all)
+            ret (f ret (first s))]
+        (if (reduced? ret)
+          @ret
+          (recur s ret)))))
+  (-reduce [coll f start]
+    (loop [s (.currentval coll) ret start]
+      (let [ret (f ret (first s))]
+        (if (reduced? ret)
+          @ret
+          (recur (or (next s) all) ret))))))
+
+(defn cycle
+  "Returns a lazy (infinite!) sequence of repetitions of the items in coll."
+  [coll] (if-let [vals (seq coll)]
+           (Cycle. nil vals nil vals nil)
+           (.-EMPTY List)))
+
+(defn split-at
+  "Returns a vector of [(take n coll) (drop n coll)]"
+  [n coll]
+  [(take n coll) (drop n coll)])
+
+(deftype Repeat [meta count val ^:mutable next ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x count))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IPending
+  (-realized? [coll] false)
+  
+  IWithMeta
+  (-with-meta [coll meta] (Repeat. meta count val next nil))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISeq
+  (-first [coll]
+    val)
+  (-rest [coll]
+    (if (nil? next)
+      (if (> count 1)
+        (do
+          (set! next (Repeat. nil (dec count) val nil nil))
+          next)
+        (if (== -1 count)
+          coll
+          ()))
+      next))
+
+  INext
+  (-next [coll]
+    (if (nil? next)
+      (if (> count 1)
+        (do
+          (set! next (Repeat. nil (dec count) val nil nil))
+          next)
+        (if (== -1 count)
+          coll
+          nil))
+      next))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISequential
+  ISeqable
+  (-seq [coll] coll)
+  
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IReduce
+  (-reduce [coll f]
+    (if (== count -1)
+      (loop [ret (f val val)]
+        (if (reduced? ret)
+          @ret
+          (recur (f ret val))))
+      (loop [i 1 ret val]
+        (if (< i count)
+          (let [ret (f ret val)]
+            (if (reduced? ret)
+              @ret
+              (recur (inc i) ret)))
+          ret))))
+  (-reduce [coll f start]
+    (if (== count -1)
+      (loop [ret (f start val)]
+        (if (reduced? ret)
+          @ret
+          (recur (f ret val))))
+      (loop [i 0 ret start]
+        (if (< i count)
+          (let [ret (f ret val)]
+            (if (reduced? ret)
+              @ret
+              (recur (inc i) ret)))
+          ret)))))
+
+(defn repeat
+  "Returns a lazy (infinite!, or length n if supplied) sequence of xs."
+  ([x] (Repeat. nil -1 x nil nil))
+  ([n x] (if (pos? n)
+           (Repeat. nil n x nil nil)
+           (.-EMPTY List))))
+
+(defn replicate
+  "DEPRECATED: Use 'repeat' instead.
+  Returns a lazy seq of n xs."
+  [n x] (take n (repeat x)))
+
+(defn repeatedly
+  "Takes a function of no args, presumably with side effects, and
+  returns an infinite (or length n if supplied) lazy sequence of calls
+  to it"
+  ([f] (lazy-seq (cons (f) (repeatedly f))))
+  ([n f] (take n (repeatedly f))))
+
+(def ^:private UNREALIZED-SEED #js {})
+
+(deftype Iterate [meta f prev-seed ^:mutable seed ^:mutable next]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+
+  IPending
+  (-realized? [coll]
+    (not (identical? seed UNREALIZED-SEED)))
+
+  IWithMeta
+  (-with-meta [coll meta] (Iterate. meta f prev-seed seed next))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISeq
+  (-first [coll]
+    (when (identical? UNREALIZED-SEED seed)
+      (set! seed (f prev-seed)))
+    seed)
+  (-rest [coll]
+    (when (nil? next)
+      (set! next (Iterate. nil f (-first coll) UNREALIZED-SEED nil)))
+    next)
+
+  INext
+  (-next [coll]
+    (-rest coll))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  ISeqable
+  (-seq [coll] coll)
+
+  IReduce
+  (-reduce [coll rf]
+    (let [first (-first coll)
+          v     (f first)]
+      (loop [ret (rf first v) v v]
+        (if (reduced? ret)
+          @ret
+          (let [v (f v)]
+            (recur (rf ret v) v))))))
+  (-reduce [coll rf start]
+    (let [v (-first coll)]
+      (loop [ret (rf start v) v v]
+        (if (reduced? ret)
+          @ret
+          (let [v (f v)]
+            (recur (rf ret v) v)))))))
+
+(defn iterate
+  "Returns a lazy sequence of x, (f x), (f (f x)) etc. f must be free of side-effects"
+  {:added "1.0"}
+  [f x] (Iterate. nil f nil x nil))
+
+(defn interleave
+  "Returns a lazy seq of the first item in each coll, then the second etc."
+  ([] ())
+  ([c1] (lazy-seq c1))
+  ([c1 c2]
+     (lazy-seq
+      (let [s1 (seq c1) s2 (seq c2)]
+        (when (and s1 s2)
+          (cons (first s1) (cons (first s2)
+                                 (interleave (rest s1) (rest s2))))))))
+  ([c1 c2 & colls]
+     (lazy-seq
+      (let [ss (map seq (conj colls c2 c1))]
+        (when (every? identity ss)
+          (concat (map first ss) (apply interleave (map rest ss))))))))
+
+(defn interpose
+  "Returns a lazy seq of the elements of coll separated by sep.
+  Returns a stateful transducer when no collection is provided."
+  ([sep]
+    (fn [rf]
+      (let [started (volatile! false)]
+        (fn
+          ([] (rf))
+          ([result] (rf result))
+          ([result input]
+            (if @started
+              (let [sepr (rf result sep)]
+                (if (reduced? sepr)
+                  sepr
+                  (rf sepr input)))
+              (do
+                (vreset! started true)
+                (rf result input))))))))
+  ([sep coll] (drop 1 (interleave (repeat sep) coll))))
+
+
+
+(defn- flatten1
+  "Take a collection of collections, and return a lazy seq
+  of items from the inner collection"
+  [colls]
+  (let [cat (fn cat [coll colls]
+              (lazy-seq
+                (if-let [coll (seq coll)]
+                  (cons (first coll) (cat (rest coll) colls))
+                  (when (seq colls)
+                    (cat (first colls) (rest colls))))))]
+    (cat nil colls)))
+
+(declare cat)
+
+(defn mapcat
+  "Returns the result of applying concat to the result of applying map
+  to f and colls.  Thus function f should return a collection. Returns
+  a transducer when no collections are provided"
+  {:added "1.0"
+   :static true}
+  ([f] (comp (map f) cat))
+  ([f & colls]
+     (apply concat (apply map f colls))))
+
+(defn filter
+  "Returns a lazy sequence of the items in coll for which
+  (pred item) returns logical true. pred must be free of side-effects.
+  Returns a transducer when no collection is provided."
+  ([pred]
+    (fn [rf]
+      (fn
+        ([] (rf))
+        ([result] (rf result))
+        ([result input]
+           (if (pred input)
+             (rf result input)
+             result)))))
+  ([pred coll]
+   (lazy-seq
+    (when-let [s (seq coll)]
+      (if (chunked-seq? s)
+        (let [c (chunk-first s)
+              size (count c)
+              b (chunk-buffer size)]
+          (dotimes [i size]
+              (when (pred (-nth c i))
+                (chunk-append b (-nth c i))))
+          (chunk-cons (chunk b) (filter pred (chunk-rest s))))
+        (let [f (first s) r (rest s)]
+          (if (pred f)
+            (cons f (filter pred r))
+            (filter pred r))))))))
+
+(defn remove
+  "Returns a lazy sequence of the items in coll for which
+  (pred item) returns logical false. pred must be free of side-effects.
+  Returns a transducer when no collection is provided."
+  ([pred] (filter (complement pred)))
+  ([pred coll]
+     (filter (complement pred) coll)))
+
+(defn tree-seq
+  "Returns a lazy sequence of the nodes in a tree, via a depth-first walk.
+  branch? must be a fn of one arg that returns true if passed a node
+  that can have children (but may not).  children must be a fn of one
+  arg that returns a sequence of the children. Will only be called on
+  nodes for which branch? returns true. Root is the root node of the
+  tree."
+   [branch? children root]
+   (let [walk (fn walk [node]
+                (lazy-seq
+                 (cons node
+                  (when (branch? node)
+                    (mapcat walk (children node))))))]
+     (walk root)))
+
+(defn flatten
+  "Takes any nested combination of sequential things (lists, vectors,
+  etc.) and returns their contents as a single, flat sequence.
+  (flatten nil) returns nil."
+  [x]
+  (filter #(not (sequential? %))
+          (rest (tree-seq sequential? seq x))))
+
+(defn into
+  "Returns a new coll consisting of to-coll with all of the items of
+  from-coll conjoined. A transducer may be supplied."
+  ([] [])
+  ([to] to)
+  ([to from]
+     (if-not (nil? to)
+       (if (implements? IEditableCollection to)
+         (-with-meta (persistent! (reduce -conj! (transient to) from)) (meta to))
+         (reduce -conj to from))
+       (reduce conj () from)))
+  ([to xform from]
+     (if (implements? IEditableCollection to)
+       (-with-meta (persistent! (transduce xform conj! (transient to) from)) (meta to))
+       (transduce xform conj to from))))
+
+(defn mapv
+  "Returns a vector consisting of the result of applying f to the
+  set of first items of each coll, followed by applying f to the set
+  of second items in each coll, until any one of the colls is
+  exhausted.  Any remaining items in other colls are ignored. Function
+  f should accept number-of-colls arguments."
+  ([f coll]
+     (-> (reduce (fn [v o] (conj! v (f o))) (transient []) coll)
+         persistent!))
+  ([f c1 c2]
+     (into [] (map f c1 c2)))
+  ([f c1 c2 c3]
+     (into [] (map f c1 c2 c3)))
+  ([f c1 c2 c3 & colls]
+     (into [] (apply map f c1 c2 c3 colls))))
+
+(defn filterv
+  "Returns a vector of the items in coll for which
+  (pred item) returns logical true. pred must be free of side-effects."
+  [pred coll]
+  (-> (reduce (fn [v o] (if (pred o) (conj! v o) v))
+              (transient [])
+              coll)
+      persistent!))
+
+(defn partition
+  "Returns a lazy sequence of lists of n items each, at offsets step
+  apart. If step is not supplied, defaults to n, i.e. the partitions
+  do not overlap. If a pad collection is supplied, use its elements as
+  necessary to complete last partition up to n items. In case there are
+  not enough padding elements, return a partition with less than n items."
+  ([n coll]
+     (partition n n coll))
+  ([n step coll]
+     (lazy-seq
+       (when-let [s (seq coll)]
+         (let [p (take n s)]
+           (when (== n (count p))
+             (cons p (partition n step (drop step s))))))))
+  ([n step pad coll]
+     (lazy-seq
+       (when-let [s (seq coll)]
+         (let [p (take n s)]
+           (if (== n (count p))
+             (cons p (partition n step pad (drop step s)))
+             (list (take n (concat p pad)))))))))
+
+(defn get-in
+  "Returns the value in a nested associative structure,
+  where ks is a sequence of keys. Returns nil if the key is not present,
+  or the not-found value if supplied."
+  {:added "1.2"
+   :static true}
+  ([m ks]
+     (reduce get m ks))
+  ([m ks not-found]
+     (loop [sentinel lookup-sentinel
+            m m
+            ks (seq ks)]
+       (if-not (nil? ks)
+         (let [m (get m (first ks) sentinel)]
+           (if (identical? sentinel m)
+             not-found
+             (recur sentinel m (next ks))))
+         m))))
+
+(defn assoc-in
+  "Associates a value in a nested associative structure, where ks is a
+  sequence of keys and v is the new value and returns a new nested structure.
+  If any levels do not exist, hash-maps will be created."
+  [m [k & ks] v]
+  (if ks
+    (assoc m k (assoc-in (get m k) ks v))
+    (assoc m k v)))
+
+(defn update-in
+  "'Updates' a value in a nested associative structure, where ks is a
+  sequence of keys and f is a function that will take the old value
+  and any supplied args and return the new value, and returns a new
+  nested structure.  If any levels do not exist, hash-maps will be
+  created."
+  ([m [k & ks] f]
+   (if ks
+     (assoc m k (update-in (get m k) ks f))
+     (assoc m k (f (get m k)))))
+  ([m [k & ks] f a]
+   (if ks
+     (assoc m k (update-in (get m k) ks f a))
+     (assoc m k (f (get m k) a))))
+  ([m [k & ks] f a b]
+   (if ks
+     (assoc m k (update-in (get m k) ks f a b))
+     (assoc m k (f (get m k) a b))))
+  ([m [k & ks] f a b c]
+   (if ks
+     (assoc m k (update-in (get m k) ks f a b c))
+     (assoc m k (f (get m k) a b c))))
+  ([m [k & ks] f a b c & args]
+   (if ks
+     (assoc m k (apply update-in (get m k) ks f a b c args))
+     (assoc m k (apply f (get m k) a b c args)))))
+
+(defn update
+  "'Updates' a value in an associative structure, where k is a
+  key and f is a function that will take the old value
+  and any supplied args and return the new value, and returns a new
+  structure.  If the key does not exist, nil is passed as the old value."
+  ([m k f]
+   (assoc m k (f (get m k))))
+  ([m k f x]
+   (assoc m k (f (get m k) x)))
+  ([m k f x y]
+   (assoc m k (f (get m k) x y)))
+  ([m k f x y z]
+   (assoc m k (f (get m k) x y z)))
+  ([m k f x y z & more]
+   (assoc m k (apply f (get m k) x y z more))))
+
+;;; PersistentVector
+
+(deftype VectorNode [edit arr])
+
+(defn- pv-fresh-node [edit]
+  (VectorNode. edit (make-array 32)))
+
+(defn- pv-aget [node idx]
+  (aget (.-arr node) idx))
+
+(defn- pv-aset [node idx val]
+  (aset (.-arr node) idx val))
+
+(defn- pv-clone-node [node]
+  (VectorNode. (.-edit node) (aclone (.-arr node))))
+
+(defn- tail-off [pv]
+  (let [cnt (.-cnt pv)]
+    (if (< cnt 32)
+      0
+      (bit-shift-left (bit-shift-right-zero-fill (dec cnt) 5) 5))))
+
+(defn- new-path [edit level node]
+  (loop [ll level
+         ret node]
+    (if (zero? ll)
+      ret
+      (let [embed ret
+            r (pv-fresh-node edit)
+            _ (pv-aset r 0 embed)]
+        (recur (- ll 5) r)))))
+
+(defn- push-tail [pv level parent tailnode]
+  (let [ret (pv-clone-node parent)
+        subidx (bit-and (bit-shift-right-zero-fill (dec (.-cnt pv)) level) 0x01f)]
+    (if (== 5 level)
+      (do
+        (pv-aset ret subidx tailnode)
+        ret)
+      (let [child (pv-aget parent subidx)]
+        (if-not (nil? child)
+          (let [node-to-insert (push-tail pv (- level 5) child tailnode)]
+            (pv-aset ret subidx node-to-insert)
+            ret)
+          (let [node-to-insert (new-path nil (- level 5) tailnode)]
+            (pv-aset ret subidx node-to-insert)
+            ret))))))
+
+(defn- vector-index-out-of-bounds [i cnt]
+  (throw (js/Error. (str "No item " i " in vector of length " cnt))))
+
+(defn- first-array-for-longvec [pv]
+  ;; invariants: (count pv) > 32.
+  (loop [node (.-root pv)
+         level (.-shift pv)]
+    (if (pos? level)
+      (recur (pv-aget node 0) (- level 5))
+      (.-arr node))))
+
+(defn- unchecked-array-for [pv i]
+  ;; invariant: i is a valid index of pv (use array-for if unknown).
+  (if (>= i (tail-off pv))
+      (.-tail pv)
+      (loop [node (.-root pv)
+             level (.-shift pv)]
+        (if (pos? level)
+          (recur (pv-aget node (bit-and (bit-shift-right-zero-fill i level) 0x01f))
+                 (- level 5))
+          (.-arr node)))))
+
+(defn- array-for [pv i]
+  (if (and (<= 0 i) (< i (.-cnt pv)))
+    (unchecked-array-for pv i)
+    (vector-index-out-of-bounds i (.-cnt pv))))
+
+(defn- do-assoc [pv level node i val]
+  (let [ret (pv-clone-node node)]
+    (if (zero? level)
+      (do
+        (pv-aset ret (bit-and i 0x01f) val)
+        ret)
+      (let [subidx (bit-and (bit-shift-right-zero-fill i level) 0x01f)]
+        (pv-aset ret subidx (do-assoc pv (- level 5) (pv-aget node subidx) i val))
+        ret))))
+
+(defn- pop-tail [pv level node]
+  (let [subidx (bit-and (bit-shift-right-zero-fill (- (.-cnt pv) 2) level) 0x01f)]
+    (cond
+     (> level 5) (let [new-child (pop-tail pv (- level 5) (pv-aget node subidx))]
+                   (if (and (nil? new-child) (zero? subidx))
+                     nil
+                     (let [ret (pv-clone-node node)]
+                       (pv-aset ret subidx new-child)
+                       ret)))
+     (zero? subidx) nil
+     :else (let [ret (pv-clone-node node)]
+             (pv-aset ret subidx nil)
+             ret))))
+
+(deftype RangedIterator [^:mutable i ^:mutable base ^:mutable arr v start end]
+  Object
+  (hasNext [this]
+    (< i end))
+  (next [this]
+    (when (== (- i base) 32)
+      (set! arr (unchecked-array-for v i))
+      (set! base (+ base 32)))
+    (let [ret (aget arr (bit-and i 0x01f))]
+      (set! i (inc i))
+      ret)))
+
+(defn ranged-iterator [v start end]
+  (let [i start]
+    (RangedIterator. i (- i (js-mod i 32))
+      (when (< start (count v))
+        (unchecked-array-for v i))
+      v start end)))
+
+(defn- pv-reduce
+  ([pv f start end]
+   (if (< start end)
+     (pv-reduce pv f (nth pv start) (inc start) end)
+     (f)))
+  ([pv f init start end]
+   (loop [acc init i start arr (unchecked-array-for pv start)]
+     (if (< i end)
+       (let [j (bit-and i 0x01f)
+             arr (if (zero? j) (unchecked-array-for pv i) arr)
+             nacc (f acc (aget arr j))]
+         (if (reduced? nacc)
+           @nacc
+           (recur nacc (inc i) arr)))
+       acc))))
+
+(declare tv-editable-root tv-editable-tail TransientVector deref
+         pr-sequential-writer pr-writer chunked-seq)
+
+(defprotocol APersistentVector
+  "Marker protocol")
+
+(deftype PersistentVector [meta cnt shift root tail ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ICloneable
+  (-clone [_] (PersistentVector. meta cnt shift root tail __hash))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentVector. meta cnt shift root tail __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  IStack
+  (-peek [coll]
+    (when (> cnt 0)
+      (-nth coll (dec cnt))))
+  (-pop [coll]
+    (cond
+     (zero? cnt) (throw (js/Error. "Can't pop empty vector"))
+     (== 1 cnt) (-with-meta (.-EMPTY PersistentVector) meta)
+     (< 1 (- cnt (tail-off coll)))
+      (PersistentVector. meta (dec cnt) shift root (.slice tail 0 -1) nil)
+      :else (let [new-tail (unchecked-array-for coll (- cnt 2))
+                  nr (pop-tail coll shift root)
+                  new-root (if (nil? nr) (.-EMPTY-NODE PersistentVector) nr)
+                  cnt-1 (dec cnt)]
+              (if (and (< 5 shift) (nil? (pv-aget new-root 1)))
+                (PersistentVector. meta cnt-1 (- shift 5) (pv-aget new-root 0) new-tail nil)
+                (PersistentVector. meta cnt-1 shift new-root new-tail nil)))))
+
+  ICollection
+  (-conj [coll o]
+    (if (< (- cnt (tail-off coll)) 32)
+      (let [len (alength tail)
+            new-tail (make-array (inc len))]
+        (dotimes [i len]
+          (aset new-tail i (aget tail i)))
+        (aset new-tail len o)
+        (PersistentVector. meta (inc cnt) shift root new-tail nil))
+      (let [root-overflow? (> (bit-shift-right-zero-fill cnt 5) (bit-shift-left 1 shift))
+            new-shift (if root-overflow? (+ shift 5) shift)
+            new-root (if root-overflow?
+                       (let [n-r (pv-fresh-node nil)]
+                           (pv-aset n-r 0 root)
+                           (pv-aset n-r 1 (new-path nil shift (VectorNode. nil tail)))
+                           n-r)
+                       (push-tail coll shift root (VectorNode. nil tail)))]
+        (PersistentVector. meta (inc cnt) new-shift new-root (array o) nil))))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY PersistentVector) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other]
+    (if (instance? PersistentVector other)
+      (if (== cnt (count other))
+        (let [me-iter  (-iterator coll)
+              you-iter (-iterator other)]
+          (loop []
+            (if ^boolean (.hasNext me-iter)
+              (let [x (.next me-iter)
+                    y (.next you-iter)]
+                (if (= x y)
+                  (recur)
+                  false))
+              true)))
+        false)
+      (equiv-sequential coll other)))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISeqable
+  (-seq [coll]
+    (cond
+      (zero? cnt) nil
+      (<= cnt 32) (IndexedSeq. tail 0 nil)
+      :else (chunked-seq coll (first-array-for-longvec coll) 0 0)))
+
+  ICounted
+  (-count [coll] cnt)
+
+  IIndexed
+  (-nth [coll n]
+    (aget (array-for coll n) (bit-and n 0x01f)))
+  (-nth [coll n not-found]
+    (if (and (<= 0 n) (< n cnt))
+      (aget (unchecked-array-for coll n) (bit-and n 0x01f))
+      not-found))
+
+  ILookup
+  (-lookup [coll k] (-lookup coll k nil))
+  (-lookup [coll k not-found] (if (number? k)
+                                (-nth coll k not-found)
+                                not-found))
+
+  IAssociative
+  (-assoc [coll k v]
+    (if (number? k)
+      (-assoc-n coll k v)
+      (throw (js/Error. "Vector's key for assoc must be a number."))))
+  (-contains-key? [coll k]
+    (if (integer? k)
+      (and (<= 0 k) (< k cnt))
+      false))
+
+  IFind
+  (-find [coll n]
+    (when (and (<= 0 n) (< n cnt))
+      (MapEntry. n (aget (unchecked-array-for coll n) (bit-and n 0x01f)) nil)))
+
+  APersistentVector
+  IVector
+  (-assoc-n [coll n val]
+    (cond
+       (and (<= 0 n) (< n cnt))
+       (if (<= (tail-off coll) n)
+         (let [new-tail (aclone tail)]
+           (aset new-tail (bit-and n 0x01f) val)
+           (PersistentVector. meta cnt shift root new-tail nil))
+         (PersistentVector. meta cnt shift (do-assoc coll shift root n val) tail nil))
+       (== n cnt) (-conj coll val)
+       :else (throw (js/Error. (str "Index " n " out of bounds  [0," cnt "]")))))
+
+  IReduce
+  (-reduce [v f]
+    (pv-reduce v f 0 cnt))
+  (-reduce [v f init]
+    (loop [i 0 init init]
+      (if (< i cnt)
+        (let [arr  (unchecked-array-for v i)
+              len  (alength arr)
+              init (loop [j 0 init init]
+                     (if (< j len)
+                       (let [init (f init (aget arr j))]
+                         (if (reduced? init)
+                           init
+                           (recur (inc j) init)))
+                       init))]
+          (if (reduced? init)
+            @init
+            (recur (+ i len) init)))
+        init)))
+
+  IKVReduce
+  (-kv-reduce [v f init]
+    (loop [i 0 init init]
+      (if (< i cnt)
+        (let [arr  (unchecked-array-for v i)
+              len  (alength arr)
+              init (loop [j 0 init init]
+                     (if (< j len)
+                       (let [init (f init (+ j i) (aget arr j))]
+                         (if (reduced? init)
+                           init
+                           (recur (inc j) init)))
+                       init))]
+          (if (reduced? init)
+            @init
+            (recur (+ i len) init)))
+        init)))
+
+  IFn
+  (-invoke [coll k]
+    (-nth coll k))
+  (-invoke [coll k not-found]
+    (-nth coll k not-found))
+
+  IEditableCollection
+  (-as-transient [coll]
+    (TransientVector. cnt shift (tv-editable-root root) (tv-editable-tail tail)))
+
+  IReversible
+  (-rseq [coll]
+    (when (pos? cnt)
+      (RSeq. coll (dec cnt) nil)))
+
+  IIterable
+  (-iterator [this]
+    (ranged-iterator this 0 cnt)))
+
+(set! (.-EMPTY-NODE PersistentVector) (VectorNode. nil (make-array 32)))
+
+(set! (.-EMPTY PersistentVector)
+  (PersistentVector. nil 0 5 (.-EMPTY-NODE PersistentVector) (array) empty-ordered-hash))
+
+(set! (.-fromArray PersistentVector)
+  (fn [xs ^boolean no-clone]
+    (let [l (alength xs)
+          xs (if no-clone xs (aclone xs))]
+      (if (< l 32)
+        (PersistentVector. nil l 5 (.-EMPTY-NODE PersistentVector) xs nil)
+        (let [node (.slice xs 0 32)
+              v (PersistentVector. nil 32 5 (.-EMPTY-NODE PersistentVector) node nil)]
+          (loop [i 32 out (-as-transient v)]
+            (if (< i l)
+              (recur (inc i) (conj! out (aget xs i)))
+              (persistent! out))))))))
+
+(es6-iterable PersistentVector)
+
+(defn vec
+  "Creates a new vector containing the contents of coll. JavaScript arrays
+  will be aliased and should not be modified."
+  [coll]
+  (if (array? coll)
+    (.fromArray PersistentVector coll true)
+    (-persistent!
+      (reduce -conj!
+        (-as-transient (.-EMPTY PersistentVector))
+        coll))))
+
+(defn vector
+  "Creates a new vector containing the args."
+  [& args]
+  (if (and (instance? IndexedSeq args) (zero? (.-i args)))
+    (.fromArray PersistentVector (.-arr args) true)
+    (vec args)))
+
+(declare subvec)
+
+(deftype ChunkedSeq [vec node i off meta ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IWithMeta
+  (-with-meta [coll m]
+    (chunked-seq vec node i off m))
+  IMeta
+  (-meta [coll] meta)
+
+  ISeqable
+  (-seq [coll] coll)
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  ASeq
+  ISeq
+  (-first [coll]
+    (aget node off))
+  (-rest [coll]
+    (if (< (inc off) (alength node))
+      (let [s (chunked-seq vec node i (inc off))]
+        (if (nil? s)
+          ()
+          s))
+      (-chunked-rest coll)))
+
+  INext
+  (-next [coll]
+    (if (< (inc off) (alength node))
+      (let [s (chunked-seq vec node i (inc off))]
+        (if (nil? s)
+          nil
+          s))
+      (-chunked-next coll)))
+
+  ICollection
+  (-conj [coll o]
+    (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll]
+    ())
+
+  IChunkedSeq
+  (-chunked-first [coll]
+    (array-chunk node off))
+  (-chunked-rest [coll]
+    (let [end (+ i (alength node))]
+      (if (< end (-count vec))
+        (chunked-seq vec (unchecked-array-for vec end) end 0)
+        ())))
+
+  IChunkedNext
+  (-chunked-next [coll]
+    (let [end (+ i (alength node))]
+      (when (< end (-count vec))
+        (chunked-seq vec (unchecked-array-for vec end) end 0))))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  IReduce
+  (-reduce [coll f]
+    (pv-reduce vec f (+ i off) (count vec)))
+
+  (-reduce [coll f start]
+    (pv-reduce vec f start (+ i off) (count vec))))
+
+(es6-iterable ChunkedSeq)
+
+(defn chunked-seq
+  ([vec i off] (ChunkedSeq. vec (array-for vec i) i off nil nil))
+  ([vec node i off] (ChunkedSeq. vec node i off nil nil))
+  ([vec node i off meta]
+     (ChunkedSeq. vec node i off meta nil)))
+
+(declare build-subvec)
+
+(deftype Subvec [meta v start end ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ICloneable
+  (-clone [_] (Subvec. meta v start end __hash))
+
+  IWithMeta
+  (-with-meta [coll meta] (build-subvec meta v start end __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  IStack
+  (-peek [coll]
+    (-nth v (dec end)))
+  (-pop [coll]
+    (if (== start end)
+      (throw (js/Error. "Can't pop empty vector"))
+      (build-subvec meta v start (dec end) nil)))
+
+  ICollection
+  (-conj [coll o]
+    (build-subvec meta (-assoc-n v end o) start (inc end) nil))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY PersistentVector) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISeqable
+  (-seq [coll]
+    (let [subvec-seq (fn subvec-seq [i]
+                       (when-not (== i end)
+                         (cons (-nth v i)
+                               (lazy-seq
+                                (subvec-seq (inc i))))))]
+      (subvec-seq start)))
+
+  IReversible
+  (-rseq [coll]
+    (if-not (== start end)
+      (RSeq. coll (dec (- end start)) nil)))
+
+  ICounted
+  (-count [coll] (- end start))
+
+  IIndexed
+  (-nth [coll n]
+    (if (or (neg? n) (<= end (+ start n)))
+      (vector-index-out-of-bounds n (- end start))
+      (-nth v (+ start n))))
+  (-nth [coll n not-found]
+    (if (or (neg? n) (<= end (+ start n)))
+      not-found
+      (-nth v (+ start n) not-found)))
+
+  ILookup
+  (-lookup [coll k] (-lookup coll k nil))
+  (-lookup [coll k not-found] (if (number? k)
+                                (-nth coll k not-found)
+                                not-found))
+
+  IAssociative
+  (-assoc [coll key val]
+    (if (number? key)
+      (-assoc-n coll key val)
+      (throw (js/Error. "Subvec's key for assoc must be a number."))))
+
+  IFind
+  (-find [coll n]
+    (when-not (neg? n)
+      (let [idx (+ start n)]
+        (when (< idx end)
+          (MapEntry. n (-lookup v idx) nil)))))
+
+  IVector
+  (-assoc-n [coll n val]
+    (let [v-pos (+ start n)]
+      (if (or (neg? n) (<= (inc end) v-pos))
+        (throw (js/Error. (str "Index " n " out of bounds [0," (-count coll) "]")))
+        (build-subvec meta (assoc v v-pos val) start (max end (inc v-pos)) nil))))
+
+  IReduce
+  (-reduce [coll f]
+    (if (implements? APersistentVector v)
+      (pv-reduce v f start end)
+      (ci-reduce coll f)))
+  (-reduce [coll f init]
+    (if (implements? APersistentVector v)
+      (pv-reduce v f init start end)
+      (ci-reduce coll f init)))
+
+  IKVReduce
+  (-kv-reduce [coll f init]
+    (loop [i start j 0 init init]
+      (if (< i end)
+        (let [init (f init j (-nth v i))]
+          (if (reduced? init)
+            @init
+            (recur (inc i) (inc j) init)))
+        init)))
+
+  IFn
+  (-invoke [coll k]
+    (-nth coll k))
+  (-invoke [coll k not-found]
+    (-nth coll k not-found))
+
+  IIterable
+  (-iterator [coll]
+    (if (implements? APersistentVector v)
+      (ranged-iterator v start end)
+      (seq-iter coll))))
+
+(es6-iterable Subvec)
+
+(defn- build-subvec [meta v start end __hash]
+  (if (instance? Subvec v)
+    (recur meta (.-v v) (+ (.-start v) start) (+ (.-start v) end) __hash)
+    (do
+      (when-not (vector? v)
+        (throw (js/Error. "v must satisfy IVector")))
+      (let [c (count v)]
+        (when (or (neg? start)
+                  (neg? end)
+                  (> start c)
+                  (> end c))
+          (throw (js/Error. "Index out of bounds"))))
+      (Subvec. meta v start end __hash))))
+
+(defn subvec
+  "Returns a persistent vector of the items in vector from
+  start (inclusive) to end (exclusive).  If end is not supplied,
+  defaults to (count vector). This operation is O(1) and very fast, as
+  the resulting vector shares structure with the original and no
+  trimming is done."
+  ([v start]
+   (subvec v start (count v)))
+  ([v start end]
+   (assert (and (not (nil? start)) (not (nil? end))))
+   (build-subvec nil v (int start) (int end) nil)))
+
+(defn- tv-ensure-editable [edit node]
+  (if (identical? edit (.-edit node))
+    node
+    (VectorNode. edit (aclone (.-arr node)))))
+
+(defn- tv-editable-root [node]
+  (VectorNode. (js-obj) (aclone (.-arr node))))
+
+(defn- tv-editable-tail [tl]
+  (let [ret (make-array 32)]
+    (array-copy tl 0 ret 0 (alength tl))
+    ret))
+
+(defn- tv-push-tail [tv level parent tail-node]
+  (let [ret    (tv-ensure-editable (.. tv -root -edit) parent)
+        subidx (bit-and (bit-shift-right-zero-fill (dec (.-cnt tv)) level) 0x01f)]
+    (pv-aset ret subidx
+             (if (== level 5)
+               tail-node
+               (let [child (pv-aget ret subidx)]
+                 (if-not (nil? child)
+                   (tv-push-tail tv (- level 5) child tail-node)
+                   (new-path (.. tv -root -edit) (- level 5) tail-node)))))
+    ret))
+
+(defn- tv-pop-tail [tv level node]
+  (let [node   (tv-ensure-editable (.. tv -root -edit) node)
+        subidx (bit-and (bit-shift-right-zero-fill (- (.-cnt tv) 2) level) 0x01f)]
+    (cond
+      (> level 5) (let [new-child (tv-pop-tail
+                                   tv (- level 5) (pv-aget node subidx))]
+                    (if (and (nil? new-child) (zero? subidx))
+                      nil
+                      (do (pv-aset node subidx new-child)
+                          node)))
+      (zero? subidx) nil
+      :else (do (pv-aset node subidx nil)
+                node))))
+
+(defn- unchecked-editable-array-for [tv i]
+  ;; invariant: i is a valid index of tv.
+  (if (>= i (tail-off tv))
+    (.-tail tv)
+    (let [root (.-root tv)]
+      (loop [node  root
+             level (.-shift tv)]
+        (if (pos? level)
+          (recur (tv-ensure-editable
+                   (.-edit root)
+                   (pv-aget node
+                            (bit-and (bit-shift-right-zero-fill i level)
+                                     0x01f)))
+                 (- level 5))
+          (.-arr node))))))
+
+(deftype TransientVector [^:mutable cnt
+                          ^:mutable shift
+                          ^:mutable root
+                          ^:mutable tail]
+  ITransientCollection
+  (-conj! [tcoll o]
+    (if ^boolean (.-edit root)
+      (if (< (- cnt (tail-off tcoll)) 32)
+        (do (aset tail (bit-and cnt 0x01f) o)
+            (set! cnt (inc cnt))
+            tcoll)
+        (let [tail-node (VectorNode. (.-edit root) tail)
+              new-tail  (make-array 32)]
+          (aset new-tail 0 o)
+          (set! tail new-tail)
+          (if (> (bit-shift-right-zero-fill cnt 5)
+                 (bit-shift-left 1 shift))
+            (let [new-root-array (make-array 32)
+                  new-shift      (+ shift 5)]
+              (aset new-root-array 0 root)
+              (aset new-root-array 1 (new-path (.-edit root) shift tail-node))
+              (set! root  (VectorNode. (.-edit root) new-root-array))
+              (set! shift new-shift)
+              (set! cnt   (inc cnt))
+              tcoll)
+            (let [new-root (tv-push-tail tcoll shift root tail-node)]
+              (set! root new-root)
+              (set! cnt  (inc cnt))
+              tcoll))))
+      (throw (js/Error. "conj! after persistent!"))))
+
+  (-persistent! [tcoll]
+    (if ^boolean (.-edit root)
+      (do (set! (.-edit root) nil)
+          (let [len (- cnt (tail-off tcoll))
+                trimmed-tail (make-array len)]
+            (array-copy tail 0 trimmed-tail 0 len)
+            (PersistentVector. nil cnt shift root trimmed-tail nil)))
+      (throw (js/Error. "persistent! called twice"))))
+
+  ITransientAssociative
+  (-assoc! [tcoll key val]
+    (if (number? key)
+      (-assoc-n! tcoll key val)
+      (throw (js/Error. "TransientVector's key for assoc! must be a number."))))
+
+  ITransientVector
+  (-assoc-n! [tcoll n val]
+    (if ^boolean (.-edit root)
+      (cond
+        (and (<= 0 n) (< n cnt))
+        (if (<= (tail-off tcoll) n)
+          (do (aset tail (bit-and n 0x01f) val)
+              tcoll)
+          (let [new-root
+                ((fn go [level node]
+                   (let [node (tv-ensure-editable (.-edit root) node)]
+                     (if (zero? level)
+                       (do (pv-aset node (bit-and n 0x01f) val)
+                           node)
+                       (let [subidx (bit-and (bit-shift-right-zero-fill n level)
+                                             0x01f)]
+                         (pv-aset node subidx
+                                  (go (- level 5) (pv-aget node subidx)))
+                         node))))
+                 shift root)]
+            (set! root new-root)
+            tcoll))
+        (== n cnt) (-conj! tcoll val)
+        :else
+        (throw
+         (js/Error.
+          (str "Index " n " out of bounds for TransientVector of length" cnt))))
+      (throw (js/Error. "assoc! after persistent!"))))
+
+  (-pop! [tcoll]
+    (if ^boolean (.-edit root)
+      (cond
+        (zero? cnt) (throw (js/Error. "Can't pop empty vector"))
+        (== 1 cnt)                       (do (set! cnt 0) tcoll)
+        (pos? (bit-and (dec cnt) 0x01f)) (do (set! cnt (dec cnt)) tcoll)
+        :else
+        (let [new-tail (unchecked-editable-array-for tcoll (- cnt 2))
+              new-root (let [nr (tv-pop-tail tcoll shift root)]
+                         (if-not (nil? nr)
+                           nr
+                           (VectorNode. (.-edit root) (make-array 32))))]
+          (if (and (< 5 shift) (nil? (pv-aget new-root 1)))
+            (let [new-root (tv-ensure-editable (.-edit root) (pv-aget new-root 0))]
+              (set! root  new-root)
+              (set! shift (- shift 5))
+              (set! cnt   (dec cnt))
+              (set! tail  new-tail)
+              tcoll)
+            (do (set! root new-root)
+                (set! cnt  (dec cnt))
+                (set! tail new-tail)
+                tcoll))))
+      (throw (js/Error. "pop! after persistent!"))))
+
+  ICounted
+  (-count [coll]
+    (if ^boolean (.-edit root)
+      cnt
+      (throw (js/Error. "count after persistent!"))))
+
+  IIndexed
+  (-nth [coll n]
+    (if ^boolean (.-edit root)
+      (aget (array-for coll n) (bit-and n 0x01f))
+      (throw (js/Error. "nth after persistent!"))))
+
+  (-nth [coll n not-found]
+    (if (and (<= 0 n) (< n cnt))
+      (-nth coll n)
+      not-found))
+
+  ILookup
+  (-lookup [coll k] (-lookup coll k nil))
+
+  (-lookup [coll k not-found] (if (number? k)
+                                (-nth coll k not-found)
+                                not-found))
+
+  IFn
+  (-invoke [coll k]
+    (-lookup coll k))
+
+  (-invoke [coll k not-found]
+    (-lookup coll k not-found)))
+
+;;; PersistentQueue ;;;
+
+(deftype PersistentQueueIter [^:mutable fseq riter]
+  Object
+  (hasNext [_]
+    (or (and (some? fseq) (seq fseq)) (and (some? riter) (.hasNext riter))))
+  (next [_]
+    (cond
+      (some? fseq)
+      (let [ret (first fseq)]
+        (set! fseq (next fseq))
+        ret)
+      (and (some? riter) ^boolean (.hasNext riter))
+      (.next riter)
+      :else (throw (js/Error. "No such element"))))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(deftype PersistentQueueSeq [meta front rear ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentQueueSeq. meta front rear __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISeq
+  (-first [coll] (first front))
+  (-rest  [coll]
+    (if-let [f1 (next front)]
+      (PersistentQueueSeq. meta f1 rear nil)
+      (if (nil? rear)
+        (-empty coll)
+        (PersistentQueueSeq. meta rear nil nil))))
+
+  INext
+  (-next [coll]
+    (if-let [f1 (next front)]
+      (PersistentQueueSeq. meta f1 rear nil)
+      (when (some? rear)
+        (PersistentQueueSeq. meta rear nil nil))))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISeqable
+  (-seq [coll] coll))
+
+(es6-iterable PersistentQueueSeq)
+
+(deftype PersistentQueue [meta count front rear ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ICloneable
+  (-clone [coll] (PersistentQueue. meta count front rear __hash))
+
+  IIterable
+  (-iterator [coll]
+    (PersistentQueueIter. front (-iterator rear)))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentQueue. meta count front rear __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ISeq
+  (-first [coll] (first front))
+  (-rest [coll] (rest (seq coll)))
+
+  IStack
+  (-peek [coll] (first front))
+  (-pop [coll]
+    (if front
+      (if-let [f1 (next front)]
+        (PersistentQueue. meta (dec count) f1 rear nil)
+        (PersistentQueue. meta (dec count) (seq rear) [] nil))
+      coll))
+
+  ICollection
+  (-conj [coll o]
+    (if front
+      (PersistentQueue. meta (inc count) front (conj (or rear []) o) nil)
+      (PersistentQueue. meta (inc count) (conj front o) [] nil)))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY PersistentQueue) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  ISeqable
+  (-seq [coll]
+    (let [rear (seq rear)]
+      (if (or front rear)
+        (PersistentQueueSeq. nil front (seq rear) nil))))
+
+  ICounted
+  (-count [coll] count))
+
+(set! (.-EMPTY PersistentQueue) (PersistentQueue. nil 0 nil [] empty-ordered-hash))
+
+(es6-iterable PersistentQueue)
+
+(deftype NeverEquiv []
+  Object
+  (equiv [this other]
+    (-equiv this other))
+  IEquiv
+  (-equiv [o other] false))
+
+(def ^:private never-equiv (NeverEquiv.))
+
+(defn ^boolean equiv-map
+  "Test map equivalence. Returns true if x equals y, otherwise returns false."
+  [x y]
+  (boolean
+    (when (and (map? y) (not (record? y)))
+      ; assume all maps are counted
+      (when (== (count x) (count y))
+        (if (satisfies? IKVReduce x)
+          (reduce-kv
+            (fn [_ k v]
+              (if (= (get y k never-equiv) v)
+                true
+                (reduced false)))
+            true x)
+          (every?
+            (fn [xkv]
+              (= (get y (first xkv) never-equiv) (second xkv)))
+            x))))))
+
+
+(defn- scan-array [incr k array]
+  (let [len (alength array)]
+    (loop [i 0]
+      (when (< i len)
+        (if (identical? k (aget array i))
+          i
+          (recur (+ i incr)))))))
+
+; The keys field is an array of all keys of this map, in no particular
+; order. Any string, keyword, or symbol key is used as a property name
+; to store the value in strobj.  If a key is assoc'ed when that same
+; key already exists in strobj, the old value is overwritten. If a
+; non-string key is assoc'ed, return a HashMap object instead.
+
+(defn- obj-map-compare-keys [a b]
+  (let [a (hash a)
+        b (hash b)]
+    (cond
+     (< a b) -1
+     (> a b) 1
+     :else 0)))
+
+(defn- obj-map->hash-map [m k v]
+  (let [ks  (.-keys m)
+        len (alength ks)
+        so  (.-strobj m)
+        mm  (meta m)]
+    (loop [i   0
+           out (transient (.-EMPTY PersistentHashMap))]
+      (if (< i len)
+        (let [k (aget ks i)]
+          (recur (inc i) (assoc! out k (gobject/get so k))))
+        (-with-meta (persistent! (assoc! out k v)) mm)))))
+
+;;; ObjMap - DEPRECATED
+
+(defn- obj-clone [obj ks]
+  (let [new-obj (js-obj)
+        l (alength ks)]
+    (loop [i 0]
+      (when (< i l)
+        (let [k (aget ks i)]
+          (gobject/set new-obj k (gobject/get obj k))
+          (recur (inc i)))))
+    new-obj))
+
+(deftype ObjMap [meta keys strobj update-count ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+
+  IWithMeta
+  (-with-meta [coll meta] (ObjMap. meta keys strobj update-count __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ICollection
+  (-conj [coll entry]
+    (if (vector? entry)
+      (-assoc coll (-nth entry 0) (-nth entry 1))
+      (reduce -conj
+              coll
+              entry)))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY ObjMap) meta))
+
+  IEquiv
+  (-equiv [coll other] (equiv-map coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-unordered-coll __hash))
+
+  ISeqable
+  (-seq [coll]
+    (when (pos? (alength keys))
+      (map #(vector % (unchecked-get strobj %))
+           (.sort keys obj-map-compare-keys))))
+
+  ICounted
+  (-count [coll] (alength keys))
+
+  ILookup
+  (-lookup [coll k] (-lookup coll k nil))
+  (-lookup [coll k not-found]
+    (if (and ^boolean (goog/isString k)
+             (not (nil? (scan-array 1 k keys))))
+      (unchecked-get strobj k)
+      not-found))
+
+  IAssociative
+  (-assoc [coll k v]
+    (if ^boolean (goog/isString k)
+        (if (or (> update-count (.-HASHMAP_THRESHOLD ObjMap))
+                (>= (alength keys) (.-HASHMAP_THRESHOLD ObjMap)))
+          (obj-map->hash-map coll k v)
+          (if-not (nil? (scan-array 1 k keys))
+            (let [new-strobj (obj-clone strobj keys)]
+              (gobject/set new-strobj k v)
+              (ObjMap. meta keys new-strobj (inc update-count) nil)) ; overwrite
+            (let [new-strobj (obj-clone strobj keys) ; append
+                  new-keys (aclone keys)]
+              (gobject/set new-strobj k v)
+              (.push new-keys k)
+              (ObjMap. meta new-keys new-strobj (inc update-count) nil))))
+        ;; non-string key. game over.
+        (obj-map->hash-map coll k v)))
+  (-contains-key? [coll k]
+    (if (and ^boolean (goog/isString k)
+             (not (nil? (scan-array 1 k keys))))
+      true
+      false))
+
+  IFind
+  (-find [coll k]
+    (when (and ^boolean (goog/isString k)
+            (not (nil? (scan-array 1 k keys))))
+      (MapEntry. k (unchecked-get strobj k) nil)))
+
+  IKVReduce
+  (-kv-reduce [coll f init]
+    (let [len (alength keys)]
+      (loop [keys (.sort keys obj-map-compare-keys)
+             init init]
+        (if (seq keys)
+          (let [k (first keys)
+                init (f init k (unchecked-get strobj k))]
+            (if (reduced? init)
+              @init
+              (recur (rest keys) init)))
+          init))))
+
+  IMap
+  (-dissoc [coll k]
+    (if (and ^boolean (goog/isString k)
+             (not (nil? (scan-array 1 k keys))))
+      (let [new-keys (aclone keys)
+            new-strobj (obj-clone strobj keys)]
+        (.splice new-keys (scan-array 1 k new-keys) 1)
+        (js-delete new-strobj k)
+        (ObjMap. meta new-keys new-strobj (inc update-count) nil))
+      coll)) ; key not found, return coll unchanged
+
+  IFn
+  (-invoke [coll k]
+    (-lookup coll k))
+  (-invoke [coll k not-found]
+    (-lookup coll k not-found))
+
+  IEditableCollection
+  (-as-transient [coll]
+    (transient (into (hash-map) coll))))
+
+(set! (.-EMPTY ObjMap) (ObjMap. nil (array) (js-obj) 0 empty-unordered-hash))
+
+(set! (.-HASHMAP_THRESHOLD ObjMap) 8)
+
+(set! (.-fromObject ObjMap) (fn [ks obj] (ObjMap. nil ks obj 0 nil)))
+
+;; Record Iterator
+(deftype RecordIter [^:mutable i record base-count fields ext-map-iter]
+  Object
+  (hasNext [_]
+    (or (< i base-count) (.hasNext ext-map-iter)))
+  (next [_]
+    (if (< i base-count)
+      (let [k (nth fields i)]
+        (set! i (inc i))
+        (MapEntry. k (-lookup record k) nil))
+      (.next ext-map-iter)))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+;; EXPERIMENTAL: subject to change
+(deftype ES6EntriesIterator [^:mutable s]
+  Object
+  (next [_]
+    (if-not (nil? s)
+      (let [[k v] (first s)]
+        (set! s (next s))
+        #js {:value #js [k v] :done false})
+      #js {:value nil :done true})))
+
+(defn es6-entries-iterator [coll]
+  (ES6EntriesIterator. (seq coll)))
+
+;; EXPERIMENTAL: subject to change
+(deftype ES6SetEntriesIterator [^:mutable s]
+  Object
+  (next [_]
+    (if-not (nil? s)
+      (let [x (first s)]
+        (set! s (next s))
+        #js {:value #js [x x] :done false})
+      #js {:value nil :done true})))
+
+(defn es6-set-entries-iterator [coll]
+  (ES6SetEntriesIterator. (seq coll)))
+
+;;; PersistentArrayMap
+
+(defn- array-index-of-nil? [arr]
+  (let [len (alength arr)]
+    (loop [i 0]
+      (cond
+        (<= len i) -1
+        (nil? (aget arr i)) i
+        :else (recur (+ i 2))))))
+
+(defn- array-index-of-keyword? [arr k]
+  (let [len  (alength arr)
+        kstr (.-fqn k)]
+    (loop [i 0]
+      (cond
+        (<= len i) -1
+        (and (keyword? (aget arr i))
+             (identical? kstr (.-fqn (aget arr i)))) i
+        :else (recur (+ i 2))))))
+
+(defn- array-index-of-symbol? [arr k]
+  (let [len  (alength arr)
+        kstr (.-str k)]
+    (loop [i 0]
+      (cond
+        (<= len i) -1
+        (and (symbol? (aget arr i))
+             (identical? kstr (.-str (aget arr i)))) i
+        :else (recur (+ i 2))))))
+
+(defn- array-index-of-identical? [arr k]
+  (let [len (alength arr)]
+    (loop [i 0]
+      (cond
+        (<= len i) -1
+        (identical? k (aget arr i)) i
+        :else (recur (+ i 2))))))
+
+(defn- array-index-of-equiv? [arr k]
+  (let [len (alength arr)]
+    (loop [i 0]
+      (cond
+        (<= len i) -1
+        (= k (aget arr i)) i
+        :else (recur (+ i 2))))))
+
+(defn array-index-of [arr k]
+  (cond
+    (keyword? k) (array-index-of-keyword? arr k)
+
+    (or ^boolean (goog/isString k) (number? k))
+    (array-index-of-identical? arr k)
+
+    (symbol? k) (array-index-of-symbol? arr k)
+
+    (nil? k)
+    (array-index-of-nil? arr)
+
+    :else (array-index-of-equiv? arr k)))
+
+(defn- array-map-index-of [m k]
+  (array-index-of (.-arr m) k))
+
+(defn- array-extend-kv [arr k v]
+  (let [l (alength arr)
+        narr (make-array (+ l 2))]
+    (loop [i 0]
+      (when (< i l)
+        (aset narr i (aget arr i))
+        (recur (inc i))))
+    (aset narr l k)
+    (aset narr (inc l) v)
+    narr))
+
+(defn- array-map-extend-kv [m k v]
+  (array-extend-kv (.-arr m) k v))
+
+(declare TransientArrayMap)
+
+(deftype MapEntry [key val ^:mutable __hash]
+  Object
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMapEntry
+  (-key [node] key)
+  (-val [node] val)
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IMeta
+  (-meta [node] nil)
+
+  IWithMeta
+  (-with-meta [node meta]
+    (with-meta [key val] meta))
+
+  IStack
+  (-peek [node] val)
+
+  (-pop [node] [key])
+
+  ICollection
+  (-conj [node o] [key val o])
+
+  IEmptyableCollection
+  (-empty [node] nil)
+
+  ISequential
+  ISeqable
+  (-seq [node] (IndexedSeq. #js [key val] 0 nil))
+
+  IReversible
+  (-rseq [node] (IndexedSeq. #js [val key] 0 nil))
+
+  ICounted
+  (-count [node] 2)
+
+  IIndexed
+  (-nth [node n]
+    (cond (== n 0) key
+          (== n 1) val
+          :else    (throw (js/Error. "Index out of bounds"))))
+
+  (-nth [node n not-found]
+    (cond (== n 0) key
+          (== n 1) val
+          :else    not-found))
+
+  ILookup
+  (-lookup [node k] (-nth node k nil))
+  (-lookup [node k not-found] (-nth node k not-found))
+
+  IAssociative
+  (-assoc [node k v]
+    (assoc [key val] k v))
+  (-contains-key? [node k]
+    (or (== k 0) (== k 1)))
+
+  IFind
+  (-find [node k]
+    (case k
+      0 (MapEntry. 0 key nil)
+      1 (MapEntry. 1 val nil)
+      nil))
+
+  IVector
+  (-assoc-n [node n v]
+    (-assoc-n [key val] n v))
+
+  IReduce
+  (-reduce [node f]
+    (ci-reduce node f))
+
+  (-reduce [node f start]
+    (ci-reduce node f start))
+
+  IFn
+  (-invoke [node k]
+    (-nth node k))
+
+  (-invoke [node k not-found]
+    (-nth node k not-found)))
+
+(defn ^boolean map-entry?
+  "Returns true if x satisfies IMapEntry"
+  [x]
+  (implements? IMapEntry x))
+
+(deftype PersistentArrayMapSeq [arr i _meta]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMeta
+  (-meta [coll] _meta)
+
+  IWithMeta
+  (-with-meta [coll new-meta]
+    (PersistentArrayMapSeq. arr i new-meta))
+
+  ICounted
+  (-count [coll]
+    (/ (- (alength arr) i) 2))
+
+  ISeqable
+  (-seq [coll] coll)
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  ICollection
+  (-conj [coll o]
+    (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) _meta))
+
+  IHash
+  (-hash [coll] (hash-ordered-coll coll))
+
+  ISeq
+  (-first [coll]
+    (MapEntry. (aget arr i) (aget arr (inc i)) nil))
+
+  (-rest [coll]
+    (if (< i (- (alength arr) 2))
+      (PersistentArrayMapSeq. arr (+ i 2) _meta)
+      ()))
+
+  INext
+  (-next [coll]
+    (when (< i (- (alength arr) 2))
+      (PersistentArrayMapSeq. arr (+ i 2) _meta)))
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable PersistentArrayMapSeq)
+
+(defn persistent-array-map-seq [arr i _meta]
+  (when (<= i (- (alength arr) 2))
+    (PersistentArrayMapSeq. arr i _meta)))
+
+(declare keys vals)
+
+(deftype PersistentArrayMapIterator [arr ^:mutable i cnt]
+  Object
+  (hasNext [_]
+    (< i cnt))
+  (next [_]
+    (let [ret (MapEntry. (aget arr i) (aget arr (inc i)) nil)]
+      (set! i (+ i 2))
+      ret)))
+
+(deftype PersistentArrayMap [meta cnt arr ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+
+  ;; EXPERIMENTAL: subject to change
+  (keys [coll]
+    (es6-iterator (keys coll)))
+  (entries [coll]
+    (es6-entries-iterator (seq coll)))
+  (values [coll]
+    (es6-iterator (vals coll)))
+  (has [coll k]
+    (contains? coll k))
+  (get [coll k not-found]
+    (-lookup coll k not-found))
+  (forEach [coll f]
+    (doseq [[k v] coll]
+      (f v k)))
+
+  ICloneable
+  (-clone [_] (PersistentArrayMap. meta cnt arr __hash))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentArrayMap. meta cnt arr __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ICollection
+  (-conj [coll entry]
+    (if (vector? entry)
+      (-assoc coll (-nth entry 0) (-nth entry 1))
+      (loop [ret coll es (seq entry)]
+        (if (nil? es)
+          ret
+          (let [e (first es)]
+            (if (vector? e)
+              (recur (-assoc ret (-nth e 0) (-nth e 1))
+                     (next es))
+              (throw (js/Error. "conj on a map takes map entries or seqables of map entries"))))))))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY PersistentArrayMap) meta))
+
+  IEquiv
+  (-equiv [coll other]
+    (if (and (map? other) (not (record? other)))
+      (let [alen (alength arr)
+            ^not-native other other]
+        (if (== cnt (-count other))
+          (loop [i 0]
+            (if (< i alen)
+              (let [v (-lookup other (aget arr i) lookup-sentinel)]
+                (if-not (identical? v lookup-sentinel)
+                  (if (= (aget arr (inc i)) v)
+                    (recur (+ i 2))
+                    false)
+                  false))
+              true))
+          false))
+      false))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-unordered-coll __hash))
+
+  IIterable
+  (-iterator [this]
+    (PersistentArrayMapIterator. arr 0 (* cnt 2)))
+
+  ISeqable
+  (-seq [coll]
+    (persistent-array-map-seq arr 0 nil))
+
+  ICounted
+  (-count [coll] cnt)
+
+  ILookup
+  (-lookup [coll k]
+    (-lookup coll k nil))
+
+  (-lookup [coll k not-found]
+    (let [idx (array-map-index-of coll k)]
+      (if (== idx -1)
+        not-found
+        (aget arr (inc idx)))))
+
+  IAssociative
+  (-assoc [coll k v]
+    (let [idx (array-map-index-of coll k)]
+      (cond
+        (== idx -1)
+        (if (< cnt (.-HASHMAP-THRESHOLD PersistentArrayMap))
+          (let [arr (array-map-extend-kv coll k v)]
+            (PersistentArrayMap. meta (inc cnt) arr nil))
+          (-> (into (.-EMPTY PersistentHashMap) coll)
+            (-assoc k v)
+            (-with-meta meta)))
+
+        (identical? v (aget arr (inc idx)))
+        coll
+
+        :else
+        (let [arr (doto (aclone arr)
+                    (aset (inc idx) v))]
+          (PersistentArrayMap. meta cnt arr nil)))))
+
+  (-contains-key? [coll k]
+    (not (== (array-map-index-of coll k) -1)))
+
+  IFind
+  (-find [coll k]
+    (let [idx (array-map-index-of coll k)]
+      (when-not (== idx -1)
+        (MapEntry. (aget arr idx) (aget arr (inc idx)) nil))))
+
+  IMap
+  (-dissoc [coll k]
+    (let [idx (array-map-index-of coll k)]
+      (if (>= idx 0)
+        (let [len     (alength arr)
+              new-len (- len 2)]
+          (if (zero? new-len)
+            (-empty coll)
+            (let [new-arr (make-array new-len)]
+              (loop [s 0 d 0]
+                (cond
+                  (>= s len) (PersistentArrayMap. meta (dec cnt) new-arr nil)
+                  (= k (aget arr s)) (recur (+ s 2) d)
+                  :else (do (aset new-arr d (aget arr s))
+                            (aset new-arr (inc d) (aget arr (inc s)))
+                            (recur (+ s 2) (+ d 2))))))))
+        coll)))
+
+  IKVReduce
+  (-kv-reduce [coll f init]
+    (let [len (alength arr)]
+      (loop [i 0 init init]
+        (if (< i len)
+          (let [init (f init (aget arr i) (aget arr (inc i)))]
+            (if (reduced? init)
+              @init
+              (recur (+ i 2) init)))
+          init))))
+  
+  IReduce
+  (-reduce [coll f]
+    (iter-reduce coll f))
+  (-reduce [coll f start]
+    (iter-reduce coll f start))
+  
+  IFn
+  (-invoke [coll k]
+    (-lookup coll k))
+
+  (-invoke [coll k not-found]
+    (-lookup coll k not-found))
+
+  IEditableCollection
+  (-as-transient [coll]
+    (TransientArrayMap. (js-obj) (alength arr) (aclone arr))))
+
+(set! (.-EMPTY PersistentArrayMap) (PersistentArrayMap. nil 0 (array) empty-unordered-hash))
+
+(set! (.-HASHMAP-THRESHOLD PersistentArrayMap) 8)
+
+(set! (.-fromArray PersistentArrayMap)
+  (fn [arr ^boolean no-clone ^boolean no-check]
+    (as-> (if no-clone arr (aclone arr)) arr
+      (if no-check
+        arr
+        (let [ret (array)]
+          (loop [i 0]
+            (when (< i (alength arr))
+              (let [k (aget arr i)
+                    v (aget arr (inc i))
+                    idx (array-index-of ret k)]
+                (when (== idx -1)
+                  (.push ret k)
+                  (.push ret v)))
+              (recur (+ i 2))))
+          ret))
+      (let [cnt (/ (alength arr) 2)]
+        (PersistentArrayMap. nil cnt arr nil)))))
+
+(set! (.-createWithCheck PersistentArrayMap)
+  (fn [arr]
+    (let [ret (array)]
+      (loop [i 0]
+        (when (< i (alength arr))
+          (let [k (aget arr i)
+                v (aget arr (inc i))
+                idx (array-index-of ret k)]
+            (if (== idx -1)
+              (doto ret (.push k) (.push v))
+              (throw (js/Error. (str "Duplicate key: " k)))))
+          (recur (+ i 2))))
+      (let [cnt (/ (alength arr) 2)]
+        (PersistentArrayMap. nil cnt arr nil)))))
+
+(set! (.-createAsIfByAssoc PersistentArrayMap)
+  (fn [arr]
+    (let [ret (array)]
+      (loop [i 0]
+        (when (< i (alength arr))
+          (let [k (aget arr i)
+                v (aget arr (inc i))
+                idx (array-index-of ret k)]
+            (if (== idx -1)
+              (doto ret (.push k) (.push v))
+              (aset ret (inc idx) v)))
+          (recur (+ i 2))))
+      (PersistentArrayMap. nil (/ (alength ret) 2) ret nil))))
+
+(es6-iterable PersistentArrayMap)
+
+(declare array->transient-hash-map)
+
+(deftype TransientArrayMap [^:mutable editable?
+                            ^:mutable len
+                            arr]
+  ICounted
+  (-count [tcoll]
+    (if editable?
+      (quot len 2)
+      (throw (js/Error. "count after persistent!"))))
+
+  ILookup
+  (-lookup [tcoll k]
+    (-lookup tcoll k nil))
+
+  (-lookup [tcoll k not-found]
+    (if editable?
+      (let [idx (array-map-index-of tcoll k)]
+        (if (== idx -1)
+          not-found
+          (aget arr (inc idx))))
+      (throw (js/Error. "lookup after persistent!"))))
+
+  ITransientCollection
+  (-conj! [tcoll o]
+    (if editable?
+      (cond
+        (map-entry? o)
+        (-assoc! tcoll (key o) (val o))
+
+        (vector? o)
+        (-assoc! tcoll (o 0) (o 1))
+
+        :else
+        (loop [es (seq o) tcoll tcoll]
+          (if-let [e (first es)]
+            (recur (next es)
+                   (-assoc! tcoll (key e) (val e)))
+            tcoll)))
+      (throw (js/Error. "conj! after persistent!"))))
+
+  (-persistent! [tcoll]
+    (if editable?
+      (do (set! editable? false)
+          (PersistentArrayMap. nil (quot len 2) arr nil))
+      (throw (js/Error. "persistent! called twice"))))
+
+  ITransientAssociative
+  (-assoc! [tcoll key val]
+    (if editable?
+      (let [idx (array-map-index-of tcoll key)]
+        (if (== idx -1)
+          (if (<= (+ len 2) (* 2 (.-HASHMAP-THRESHOLD PersistentArrayMap)))
+            (do (set! len (+ len 2))
+                (.push arr key)
+                (.push arr val)
+                tcoll)
+            (assoc! (array->transient-hash-map len arr) key val))
+          (if (identical? val (aget arr (inc idx)))
+            tcoll
+            (do (aset arr (inc idx) val)
+                tcoll))))
+      (throw (js/Error. "assoc! after persistent!"))))
+
+  ITransientMap
+  (-dissoc! [tcoll key]
+    (if editable?
+      (let [idx (array-map-index-of tcoll key)]
+        (when (>= idx 0)
+          (aset arr idx (aget arr (- len 2)))
+          (aset arr (inc idx) (aget arr (dec len)))
+          (doto arr .pop .pop)
+          (set! len (- len 2)))
+        tcoll)
+      (throw (js/Error. "dissoc! after persistent!"))))
+  
+  IFn
+  (-invoke [tcoll key]
+    (-lookup tcoll key nil))
+  (-invoke [tcoll key not-found]
+    (-lookup tcoll key not-found)))
+
+(declare TransientHashMap)
+
+(defn- array->transient-hash-map [len arr]
+  (loop [out (transient (.-EMPTY PersistentHashMap))
+         i   0]
+    (if (< i len)
+      (recur (assoc! out (aget arr i) (aget arr (inc i))) (+ i 2))
+      out)))
+
+;;; PersistentHashMap
+
+(deftype Box [^:mutable val])
+
+(declare create-inode-seq create-array-node-seq reset! create-node atom deref)
+
+(defn ^boolean key-test [key other]
+  (cond
+    (identical? key other) true
+    (keyword-identical? key other) true
+    :else (= key other)))
+
+(defn- mask [hash shift]
+  (bit-and (bit-shift-right-zero-fill hash shift) 0x01f))
+
+(defn- clone-and-set
+  ([arr i a]
+     (doto (aclone arr)
+       (aset i a)))
+  ([arr i a j b]
+     (doto (aclone arr)
+       (aset i a)
+       (aset j b))))
+
+(defn- remove-pair [arr i]
+  (let [new-arr (make-array (- (alength arr) 2))]
+    (array-copy arr 0 new-arr 0 (* 2 i))
+    (array-copy arr (* 2 (inc i)) new-arr (* 2 i) (- (alength new-arr) (* 2 i)))
+    new-arr))
+
+(defn- bitmap-indexed-node-index [bitmap bit]
+  (bit-count (bit-and bitmap (dec bit))))
+
+(defn- bitpos [hash shift]
+  (bit-shift-left 1 (mask hash shift)))
+
+(defn- edit-and-set
+  ([inode edit i a]
+     (let [editable (.ensure-editable inode edit)]
+       (aset (.-arr editable) i a)
+       editable))
+  ([inode edit i a j b]
+     (let [editable (.ensure-editable inode edit)]
+       (aset (.-arr editable) i a)
+       (aset (.-arr editable) j b)
+       editable)))
+
+(defn- inode-kv-reduce [arr f init]
+  (let [len (alength arr)]
+    (loop [i 0 init init]
+      (if (< i len)
+        (let [init (let [k (aget arr i)]
+                     (if-not (nil? k)
+                       (f init k (aget arr (inc i)))
+                       (let [node (aget arr (inc i))]
+                         (if-not (nil? node)
+                           (.kv-reduce node f init)
+                           init))))]
+          (if (reduced? init)
+            init
+            (recur (+ i 2) init)))
+        init))))
+
+(declare ArrayNode)
+
+ (deftype NodeIterator [arr ^:mutable i ^:mutable next-entry ^:mutable next-iter]
+  Object
+  (advance [this]
+    (let [len (alength arr)]
+      (loop []
+        (if (< i len)
+          (let [key (aget arr i)
+                node-or-val (aget arr (inc i))
+                ^boolean found
+                (cond (some? key)
+                      (set! next-entry (MapEntry. key node-or-val nil))
+                      (some? node-or-val)
+                      (let [new-iter (-iterator node-or-val)]
+                        (if ^boolean (.hasNext new-iter)
+                          (set! next-iter new-iter)
+                          false))
+                      :else false)]
+            (set! i (+ i 2))
+            (if found true (recur)))
+          false))))
+  (hasNext [this]
+    (or (some? next-entry) (some? next-iter) (.advance this)))
+  (next [this]
+    (cond
+      (some? next-entry)
+      (let [ret next-entry]
+        (set! next-entry nil)
+        ret)
+      (some? next-iter)
+      (let [ret (.next next-iter)]
+        (when-not ^boolean (.hasNext next-iter)
+          (set! next-iter nil))
+        ret)
+      ^boolean (.advance this)
+      (.next this)
+      :else (throw (js/Error. "No such element"))))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(deftype BitmapIndexedNode [edit ^:mutable bitmap ^:mutable arr]
+  Object
+  (inode-assoc [inode shift hash key val added-leaf?]
+    (let [bit (bitpos hash shift)
+          idx (bitmap-indexed-node-index bitmap bit)]
+      (if (zero? (bit-and bitmap bit))
+        (let [n (bit-count bitmap)]
+          (if (>= n 16)
+            (let [nodes (make-array 32)
+                  jdx   (mask hash shift)]
+              (aset nodes jdx (.inode-assoc (.-EMPTY BitmapIndexedNode) (+ shift 5) hash key val added-leaf?))
+              (loop [i 0 j 0]
+                (if (< i 32)
+                  (if (zero? (bit-and (bit-shift-right-zero-fill bitmap i) 1))
+                    (recur (inc i) j)
+                    (do (aset nodes i
+                              (if-not (nil? (aget arr j))
+                                (.inode-assoc (.-EMPTY BitmapIndexedNode)
+                                              (+ shift 5) (cljs.core/hash (aget arr j)) (aget arr j) (aget arr (inc j)) added-leaf?)
+                                (aget arr (inc j))))
+                        (recur (inc i) (+ j 2))))))
+              (ArrayNode. nil (inc n) nodes))
+            (let [new-arr (make-array (* 2 (inc n)))]
+              (array-copy arr 0 new-arr 0 (* 2 idx))
+              (aset new-arr (* 2 idx) key)
+              (aset new-arr (inc (* 2 idx)) val)
+              (array-copy arr (* 2 idx) new-arr (* 2 (inc idx)) (* 2 (- n idx)))
+              (set! (.-val added-leaf?) true)
+              (BitmapIndexedNode. nil (bit-or bitmap bit) new-arr))))
+        (let [key-or-nil  (aget arr (* 2 idx))
+              val-or-node (aget arr (inc (* 2 idx)))]
+          (cond (nil? key-or-nil)
+                (let [n (.inode-assoc val-or-node (+ shift 5) hash key val added-leaf?)]
+                  (if (identical? n val-or-node)
+                    inode
+                    (BitmapIndexedNode. nil bitmap (clone-and-set arr (inc (* 2 idx)) n))))
+
+                (key-test key key-or-nil)
+                (if (identical? val val-or-node)
+                  inode
+                  (BitmapIndexedNode. nil bitmap (clone-and-set arr (inc (* 2 idx)) val)))
+
+                :else
+                (do (set! (.-val added-leaf?) true)
+                    (BitmapIndexedNode. nil bitmap
+                                        (clone-and-set arr (* 2 idx) nil (inc (* 2 idx))
+                                                       (create-node (+ shift 5) key-or-nil val-or-node hash key val)))))))))
+
+  (inode-without [inode shift hash key]
+    (let [bit (bitpos hash shift)]
+      (if (zero? (bit-and bitmap bit))
+        inode
+        (let [idx         (bitmap-indexed-node-index bitmap bit)
+              key-or-nil  (aget arr (* 2 idx))
+              val-or-node (aget arr (inc (* 2 idx)))]
+          (cond (nil? key-or-nil)
+                (let [n (.inode-without val-or-node (+ shift 5) hash key)]
+                  (cond (identical? n val-or-node) inode
+                        (not (nil? n)) (BitmapIndexedNode. nil bitmap (clone-and-set arr (inc (* 2 idx)) n))
+                        (== bitmap bit) nil
+                        :else (BitmapIndexedNode. nil (bit-xor bitmap bit) (remove-pair arr idx))))
+                (key-test key key-or-nil)
+                (BitmapIndexedNode. nil (bit-xor bitmap bit) (remove-pair arr idx))
+                :else inode)))))
+
+  (inode-lookup [inode shift hash key not-found]
+    (let [bit (bitpos hash shift)]
+      (if (zero? (bit-and bitmap bit))
+        not-found
+        (let [idx         (bitmap-indexed-node-index bitmap bit)
+              key-or-nil  (aget arr (* 2 idx))
+              val-or-node (aget arr (inc (* 2 idx)))]
+          (cond (nil? key-or-nil)  (.inode-lookup val-or-node (+ shift 5) hash key not-found)
+                (key-test key key-or-nil) val-or-node
+                :else not-found)))))
+
+  (inode-find [inode shift hash key not-found]
+    (let [bit (bitpos hash shift)]
+      (if (zero? (bit-and bitmap bit))
+        not-found
+        (let [idx         (bitmap-indexed-node-index bitmap bit)
+              key-or-nil  (aget arr (* 2 idx))
+              val-or-node (aget arr (inc (* 2 idx)))]
+          (cond (nil? key-or-nil) (.inode-find val-or-node (+ shift 5) hash key not-found)
+                (key-test key key-or-nil)          (MapEntry. key-or-nil val-or-node nil)
+                :else not-found)))))
+
+  (inode-seq [inode]
+    (create-inode-seq arr))
+
+  (ensure-editable [inode e]
+    (if (identical? e edit)
+      inode
+      (let [n       (bit-count bitmap)
+            new-arr (make-array (if (neg? n) 4 (* 2 (inc n))))]
+        (array-copy arr 0 new-arr 0 (* 2 n))
+        (BitmapIndexedNode. e bitmap new-arr))))
+
+  (edit-and-remove-pair [inode e bit i]
+    (if (== bitmap bit)
+      nil
+      (let [editable (.ensure-editable inode e)
+            earr     (.-arr editable)
+            len      (alength earr)]
+        (set! (.-bitmap editable) (bit-xor bit (.-bitmap editable)))
+        (array-copy earr (* 2 (inc i))
+                    earr (* 2 i)
+                    (- len (* 2 (inc i))))
+        (aset earr (- len 2) nil)
+        (aset earr (dec len) nil)
+        editable)))
+
+  (inode-assoc! [inode edit shift hash key val added-leaf?]
+    (let [bit (bitpos hash shift)
+          idx (bitmap-indexed-node-index bitmap bit)]
+      (if (zero? (bit-and bitmap bit))
+        (let [n (bit-count bitmap)]
+          (cond
+            (< (* 2 n) (alength arr))
+            (let [editable (.ensure-editable inode edit)
+                  earr     (.-arr editable)]
+              (set! (.-val added-leaf?) true)
+              (array-copy-downward earr (* 2 idx)
+                                   earr (* 2 (inc idx))
+                                   (* 2 (- n idx)))
+              (aset earr (* 2 idx) key)
+              (aset earr (inc (* 2 idx)) val)
+              (set! (.-bitmap editable) (bit-or (.-bitmap editable) bit))
+              editable)
+
+            (>= n 16)
+            (let [nodes (make-array 32)
+                  jdx   (mask hash shift)]
+              (aset nodes jdx (.inode-assoc! (.-EMPTY BitmapIndexedNode) edit (+ shift 5) hash key val added-leaf?))
+              (loop [i 0 j 0]
+                (if (< i 32)
+                  (if (zero? (bit-and (bit-shift-right-zero-fill bitmap i) 1))
+                    (recur (inc i) j)
+                    (do (aset nodes i
+                              (if-not (nil? (aget arr j))
+                                (.inode-assoc! (.-EMPTY BitmapIndexedNode)
+                                               edit (+ shift 5) (cljs.core/hash (aget arr j)) (aget arr j) (aget arr (inc j)) added-leaf?)
+                                (aget arr (inc j))))
+                        (recur (inc i) (+ j 2))))))
+              (ArrayNode. edit (inc n) nodes))
+
+            :else
+            (let [new-arr (make-array (* 2 (+ n 4)))]
+              (array-copy arr 0 new-arr 0 (* 2 idx))
+              (aset new-arr (* 2 idx) key)
+              (aset new-arr (inc (* 2 idx)) val)
+              (array-copy arr (* 2 idx) new-arr (* 2 (inc idx)) (* 2 (- n idx)))
+              (set! (.-val added-leaf?) true)
+              (let [editable (.ensure-editable inode edit)]
+                (set! (.-arr editable) new-arr)
+                (set! (.-bitmap editable) (bit-or (.-bitmap editable) bit))
+                editable))))
+        (let [key-or-nil  (aget arr (* 2 idx))
+              val-or-node (aget arr (inc (* 2 idx)))]
+          (cond (nil? key-or-nil)
+                (let [n (.inode-assoc! val-or-node edit (+ shift 5) hash key val added-leaf?)]
+                  (if (identical? n val-or-node)
+                    inode
+                    (edit-and-set inode edit (inc (* 2 idx)) n)))
+
+                (key-test key key-or-nil)
+                (if (identical? val val-or-node)
+                  inode
+                  (edit-and-set inode edit (inc (* 2 idx)) val))
+
+                :else
+                (do (set! (.-val added-leaf?) true)
+                    (edit-and-set inode edit (* 2 idx) nil (inc (* 2 idx))
+                                  (create-node edit (+ shift 5) key-or-nil val-or-node hash key val))))))))
+
+  (inode-without! [inode edit shift hash key removed-leaf?]
+    (let [bit (bitpos hash shift)]
+      (if (zero? (bit-and bitmap bit))
+        inode
+        (let [idx         (bitmap-indexed-node-index bitmap bit)
+              key-or-nil  (aget arr (* 2 idx))
+              val-or-node (aget arr (inc (* 2 idx)))]
+          (cond (nil? key-or-nil)
+                (let [n (.inode-without! val-or-node edit (+ shift 5) hash key removed-leaf?)]
+                  (cond (identical? n val-or-node) inode
+                        (not (nil? n)) (edit-and-set inode edit (inc (* 2 idx)) n)
+                        (== bitmap bit) nil
+                        :else (.edit-and-remove-pair inode edit bit idx)))
+                (key-test key key-or-nil)
+                (do (set! (.-val removed-leaf?) true)
+                    (.edit-and-remove-pair inode edit bit idx))
+                :else inode)))))
+
+  (kv-reduce [inode f init]
+    (inode-kv-reduce arr f init))
+
+  IIterable
+  (-iterator [coll]
+    (NodeIterator. arr 0 nil nil)))
+
+(set! (.-EMPTY BitmapIndexedNode) (BitmapIndexedNode. nil 0 (make-array 0)))
+
+(defn- pack-array-node [array-node edit idx]
+  (let [arr     (.-arr array-node)
+        len     (alength arr)
+        new-arr (make-array (* 2 (dec (.-cnt array-node))))]
+    (loop [i 0 j 1 bitmap 0]
+      (if (< i len)
+        (if (and (not (== i idx))
+                 (not (nil? (aget arr i))))
+          (do (aset new-arr j (aget arr i))
+              (recur (inc i) (+ j 2) (bit-or bitmap (bit-shift-left 1 i))))
+          (recur (inc i) j bitmap))
+        (BitmapIndexedNode. edit bitmap new-arr)))))
+
+(deftype ArrayNodeIterator [arr ^:mutable i ^:mutable next-iter]
+  Object
+  (hasNext [this]
+    (let [len (alength arr)]
+      (loop []
+        (if-not (and  (some? next-iter) ^boolean (.hasNext next-iter))
+          (if (< i len)
+            (let [node (aget arr i)]
+              (set! i (inc i))
+              (when (some? node)
+                (set! next-iter (-iterator node)))
+              (recur))
+            false)
+          true))))
+  (next [this]
+    (if ^boolean (.hasNext this)
+      (.next next-iter)
+      (throw (js/Error. "No such element"))))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(deftype ArrayNode [edit ^:mutable cnt ^:mutable arr]
+  Object
+  (inode-assoc [inode shift hash key val added-leaf?]
+    (let [idx  (mask hash shift)
+          node (aget arr idx)]
+      (if (nil? node)
+        (ArrayNode. nil (inc cnt) (clone-and-set arr idx (.inode-assoc (.-EMPTY BitmapIndexedNode) (+ shift 5) hash key val added-leaf?)))
+        (let [n (.inode-assoc node (+ shift 5) hash key val added-leaf?)]
+          (if (identical? n node)
+            inode
+            (ArrayNode. nil cnt (clone-and-set arr idx n)))))))
+
+  (inode-without [inode shift hash key]
+    (let [idx  (mask hash shift)
+          node (aget arr idx)]
+      (if-not (nil? node)
+        (let [n (.inode-without node (+ shift 5) hash key)]
+          (cond
+            (identical? n node)
+            inode
+
+            (nil? n)
+            (if (<= cnt 8)
+              (pack-array-node inode nil idx)
+              (ArrayNode. nil (dec cnt) (clone-and-set arr idx n)))
+
+            :else
+            (ArrayNode. nil cnt (clone-and-set arr idx n))))
+        inode)))
+
+  (inode-lookup [inode shift hash key not-found]
+    (let [idx  (mask hash shift)
+          node (aget arr idx)]
+      (if-not (nil? node)
+        (.inode-lookup node (+ shift 5) hash key not-found)
+        not-found)))
+
+  (inode-find [inode shift hash key not-found]
+    (let [idx  (mask hash shift)
+          node (aget arr idx)]
+      (if-not (nil? node)
+        (.inode-find node (+ shift 5) hash key not-found)
+        not-found)))
+
+  (inode-seq [inode]
+    (create-array-node-seq arr))
+
+  (ensure-editable [inode e]
+    (if (identical? e edit)
+      inode
+      (ArrayNode. e cnt (aclone arr))))
+
+  (inode-assoc! [inode edit shift hash key val added-leaf?]
+    (let [idx  (mask hash shift)
+          node (aget arr idx)]
+      (if (nil? node)
+        (let [editable (edit-and-set inode edit idx (.inode-assoc! (.-EMPTY BitmapIndexedNode) edit (+ shift 5) hash key val added-leaf?))]
+          (set! (.-cnt editable) (inc (.-cnt editable)))
+          editable)
+        (let [n (.inode-assoc! node edit (+ shift 5) hash key val added-leaf?)]
+          (if (identical? n node)
+            inode
+            (edit-and-set inode edit idx n))))))
+
+  (inode-without! [inode edit shift hash key removed-leaf?]
+    (let [idx  (mask hash shift)
+          node (aget arr idx)]
+      (if (nil? node)
+        inode
+        (let [n (.inode-without! node edit (+ shift 5) hash key removed-leaf?)]
+          (cond
+            (identical? n node)
+            inode
+
+            (nil? n)
+            (if (<= cnt 8)
+              (pack-array-node inode edit idx)
+              (let [editable (edit-and-set inode edit idx n)]
+                (set! (.-cnt editable) (dec (.-cnt editable)))
+                editable))
+
+            :else
+            (edit-and-set inode edit idx n))))))
+
+  (kv-reduce [inode f init]
+    (let [len (alength arr)]           ; actually 32
+      (loop [i 0 init init]
+        (if (< i len)
+          (let [node (aget arr i)]
+            (if-not (nil? node)
+              (let [init (.kv-reduce node f init)]
+                (if (reduced? init)
+                  init
+                  (recur (inc i) init)))
+              (recur (inc i) init)))
+          init))))
+
+ IIterable
+ (-iterator [coll]
+    (ArrayNodeIterator. arr 0 nil)))
+
+(defn- hash-collision-node-find-index [arr cnt key]
+  (let [lim (* 2 cnt)]
+    (loop [i 0]
+      (if (< i lim)
+        (if (key-test key (aget arr i))
+          i
+          (recur (+ i 2)))
+        -1))))
+
+(deftype HashCollisionNode [edit
+                            ^:mutable collision-hash
+                            ^:mutable cnt
+                            ^:mutable arr]
+  Object
+  (inode-assoc [inode shift hash key val added-leaf?]
+    (if (== hash collision-hash)
+      (let [idx (hash-collision-node-find-index arr cnt key)]
+        (if (== idx -1)
+          (let [len     (* 2 cnt)
+                new-arr (make-array (+ len 2))]
+            (array-copy arr 0 new-arr 0 len)
+            (aset new-arr len key)
+            (aset new-arr (inc len) val)
+            (set! (.-val added-leaf?) true)
+            (HashCollisionNode. nil collision-hash (inc cnt) new-arr))
+          (if (= (aget arr (inc idx)) val)
+            inode
+            (HashCollisionNode. nil collision-hash cnt (clone-and-set arr (inc idx) val)))))
+      (.inode-assoc (BitmapIndexedNode. nil (bitpos collision-hash shift) (array nil inode))
+                    shift hash key val added-leaf?)))
+
+  (inode-without [inode shift hash key]
+    (let [idx (hash-collision-node-find-index arr cnt key)]
+      (cond (== idx -1) inode
+            (== cnt 1)  nil
+            :else (HashCollisionNode. nil collision-hash (dec cnt) (remove-pair arr (quot idx 2))))))
+
+  (inode-lookup [inode shift hash key not-found]
+    (let [idx (hash-collision-node-find-index arr cnt key)]
+      (cond (< idx 0)              not-found
+            (key-test key (aget arr idx)) (aget arr (inc idx))
+            :else                  not-found)))
+
+  (inode-find [inode shift hash key not-found]
+    (let [idx (hash-collision-node-find-index arr cnt key)]
+      (cond (< idx 0)              not-found
+            (key-test key (aget arr idx)) (MapEntry. (aget arr idx) (aget arr (inc idx)) nil)
+            :else                  not-found)))
+
+  (inode-seq [inode]
+    (create-inode-seq arr))
+
+  (ensure-editable [inode e]
+    (if (identical? e edit)
+      inode
+      (let [new-arr (make-array (* 2 (inc cnt)))]
+        (array-copy arr 0 new-arr 0 (* 2 cnt))
+        (HashCollisionNode. e collision-hash cnt new-arr))))
+
+  (ensure-editable-array [inode e count array]
+    (if (identical? e edit)
+      (do (set! arr array)
+          (set! cnt count)
+          inode)
+      (HashCollisionNode. edit collision-hash count array)))
+
+  (inode-assoc! [inode edit shift hash key val added-leaf?]
+    (if (== hash collision-hash)
+      (let [idx (hash-collision-node-find-index arr cnt key)]
+        (if (== idx -1)
+          (if (> (alength arr) (* 2 cnt))
+            (let [editable (edit-and-set inode edit (* 2 cnt) key (inc (* 2 cnt)) val)]
+              (set! (.-val added-leaf?) true)
+              (set! (.-cnt editable) (inc (.-cnt editable)))
+              editable)
+            (let [len     (alength arr)
+                  new-arr (make-array (+ len 2))]
+              (array-copy arr 0 new-arr 0 len)
+              (aset new-arr len key)
+              (aset new-arr (inc len) val)
+              (set! (.-val added-leaf?) true)
+              (.ensure-editable-array inode edit (inc cnt) new-arr)))
+          (if (identical? (aget arr (inc idx)) val)
+            inode
+            (edit-and-set inode edit (inc idx) val))))
+      (.inode-assoc! (BitmapIndexedNode. edit (bitpos collision-hash shift) (array nil inode nil nil))
+                     edit shift hash key val added-leaf?)))
+
+  (inode-without! [inode edit shift hash key removed-leaf?]
+    (let [idx (hash-collision-node-find-index arr cnt key)]
+      (if (== idx -1)
+        inode
+        (do (set! (.-val removed-leaf?) true)
+            (if (== cnt 1)
+              nil
+              (let [editable (.ensure-editable inode edit)
+                    earr     (.-arr editable)]
+                (aset earr idx (aget earr (- (* 2 cnt) 2)))
+                (aset earr (inc idx) (aget earr (dec (* 2 cnt))))
+                (aset earr (dec (* 2 cnt)) nil)
+                (aset earr (- (* 2 cnt) 2) nil)
+                (set! (.-cnt editable) (dec (.-cnt editable)))
+                editable))))))
+
+  (kv-reduce [inode f init]
+    (inode-kv-reduce arr f init))
+
+  IIterable
+  (-iterator [coll]
+    (NodeIterator. arr 0 nil nil)))
+
+(defn- create-node
+  ([shift key1 val1 key2hash key2 val2]
+     (let [key1hash (hash key1)]
+       (if (== key1hash key2hash)
+         (HashCollisionNode. nil key1hash 2 (array key1 val1 key2 val2))
+         (let [added-leaf? (Box. false)]
+           (-> (.-EMPTY BitmapIndexedNode)
+               (.inode-assoc shift key1hash key1 val1 added-leaf?)
+               (.inode-assoc shift key2hash key2 val2 added-leaf?))))))
+  ([edit shift key1 val1 key2hash key2 val2]
+     (let [key1hash (hash key1)]
+       (if (== key1hash key2hash)
+         (HashCollisionNode. nil key1hash 2 (array key1 val1 key2 val2))
+         (let [added-leaf? (Box. false)]
+           (-> (.-EMPTY BitmapIndexedNode)
+               (.inode-assoc! edit shift key1hash key1 val1 added-leaf?)
+               (.inode-assoc! edit shift key2hash key2 val2 added-leaf?)))))))
+
+(deftype NodeSeq [meta nodes i s ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMeta
+  (-meta [coll] meta)
+
+  IWithMeta
+  (-with-meta [coll meta] (NodeSeq. meta nodes i s __hash))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  ISeq
+  (-first [coll]
+    (if (nil? s)
+      (MapEntry. (aget nodes i) (aget nodes (inc i)) nil)
+      (first s)))
+
+  (-rest [coll]
+    (let [ret (if (nil? s)
+                (create-inode-seq nodes (+ i 2) nil)
+                (create-inode-seq nodes i (next s)))]
+      (if-not (nil? ret) ret ())))
+
+  INext
+  (-next [coll]
+    (if (nil? s)
+      (create-inode-seq nodes (+ i 2) nil)
+      (create-inode-seq nodes i (next s))))
+
+  ISeqable
+  (-seq [this] this)
+
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable NodeSeq)
+
+(defn- create-inode-seq
+  ([nodes]
+     (create-inode-seq nodes 0 nil))
+  ([nodes i s]
+     (if (nil? s)
+       (let [len (alength nodes)]
+         (loop [j i]
+           (if (< j len)
+             (if-not (nil? (aget nodes j))
+               (NodeSeq. nil nodes j nil nil)
+               (if-let [node (aget nodes (inc j))]
+                 (if-let [node-seq (.inode-seq node)]
+                   (NodeSeq. nil nodes (+ j 2) node-seq nil)
+                   (recur (+ j 2)))
+                 (recur (+ j 2)))))))
+       (NodeSeq. nil nodes i s nil))))
+
+(deftype ArrayNodeSeq [meta nodes i s ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMeta
+  (-meta [coll] meta)
+
+  IWithMeta
+  (-with-meta [coll meta] (ArrayNodeSeq. meta nodes i s __hash))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  ISeq
+  (-first [coll] (first s))
+  (-rest  [coll]
+    (let [ret (create-array-node-seq nil nodes i (next s))]
+      (if-not (nil? ret) ret ())))
+
+  INext
+  (-next [coll]
+    (create-array-node-seq nil nodes i (next s)))
+
+  ISeqable
+  (-seq [this] this)
+
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable ArrayNodeSeq)
+
+(defn- create-array-node-seq
+  ([nodes] (create-array-node-seq nil nodes 0 nil))
+  ([meta nodes i s]
+     (if (nil? s)
+       (let [len (alength nodes)]
+         (loop [j i]
+           (if (< j len)
+             (if-let [nj (aget nodes j)]
+               (if-let [ns (.inode-seq nj)]
+                 (ArrayNodeSeq. meta nodes (inc j) ns nil)
+                 (recur (inc j)))
+               (recur (inc j))))))
+       (ArrayNodeSeq. meta nodes i s nil))))
+
+(deftype HashMapIter [nil-val root-iter ^:mutable seen]
+  Object
+  (hasNext [_]
+    (or (not ^boolean seen) ^boolean (.hasNext root-iter)))
+  (next [_]
+    (if-not ^boolean seen
+      (do
+        (set! seen true)
+        (MapEntry. nil nil-val nil))
+      (.next root-iter)))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(deftype PersistentHashMap [meta cnt root ^boolean has-nil? nil-val ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+
+  ;; EXPERIMENTAL: subject to change
+  (keys [coll]
+    (es6-iterator (keys coll)))
+  (entries [coll]
+    (es6-entries-iterator (seq coll)))
+  (values [coll]
+    (es6-iterator (vals coll)))
+  (has [coll k]
+    (contains? coll k))
+  (get [coll k not-found]
+    (-lookup coll k not-found))
+  (forEach [coll f]
+    (doseq [[k v] coll]
+      (f v k)))
+
+  ICloneable
+  (-clone [_] (PersistentHashMap. meta cnt root has-nil? nil-val __hash))
+
+  IIterable
+  (-iterator [coll]
+    (let [root-iter (if ^boolean root (-iterator root) (nil-iter))]
+      (if has-nil?
+        (HashMapIter. nil-val root-iter false)
+        root-iter)))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentHashMap. meta cnt root has-nil? nil-val __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ICollection
+  (-conj [coll entry]
+    (if (vector? entry)
+      (-assoc coll (-nth entry 0) (-nth entry 1))
+      (loop [ret coll es (seq entry)]
+        (if (nil? es)
+          ret
+          (let [e (first es)]
+            (if (vector? e)
+              (recur (-assoc ret (-nth e 0) (-nth e 1))
+                     (next es))
+              (throw (js/Error. "conj on a map takes map entries or seqables of map entries"))))))))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY PersistentHashMap) meta))
+
+  IEquiv
+  (-equiv [coll other] (equiv-map coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-unordered-coll __hash))
+
+  ISeqable
+  (-seq [coll]
+    (when (pos? cnt)
+      (let [s (if-not (nil? root) (.inode-seq root))]
+        (if has-nil?
+          (cons (MapEntry. nil nil-val nil) s)
+          s))))
+
+  ICounted
+  (-count [coll] cnt)
+
+  ILookup
+  (-lookup [coll k]
+    (-lookup coll k nil))
+
+  (-lookup [coll k not-found]
+    (cond (nil? k)    (if has-nil?
+                        nil-val
+                        not-found)
+          (nil? root) not-found
+          :else       (.inode-lookup root 0 (hash k) k not-found)))
+
+  IAssociative
+  (-assoc [coll k v]
+    (if (nil? k)
+      (if (and has-nil? (identical? v nil-val))
+        coll
+        (PersistentHashMap. meta (if has-nil? cnt (inc cnt)) root true v nil))
+      (let [added-leaf? (Box. false)
+            new-root    (-> (if (nil? root)
+                              (.-EMPTY BitmapIndexedNode)
+                              root)
+                            (.inode-assoc 0 (hash k) k v added-leaf?))]
+        (if (identical? new-root root)
+          coll
+          (PersistentHashMap. meta (if ^boolean (.-val added-leaf?) (inc cnt) cnt) new-root has-nil? nil-val nil)))))
+
+  (-contains-key? [coll k]
+    (cond (nil? k)    has-nil?
+          (nil? root) false
+          :else       (not (identical? (.inode-lookup root 0 (hash k) k lookup-sentinel)
+                                       lookup-sentinel))))
+
+  IFind
+  (-find [coll k]
+    (cond
+      (nil? k) (when has-nil? (MapEntry. nil nil-val nil))
+      (nil? root) nil
+      :else (.inode-find root 0 (hash k) k nil)))
+
+  IMap
+  (-dissoc [coll k]
+    (cond (nil? k)    (if has-nil?
+                        (PersistentHashMap. meta (dec cnt) root false nil nil)
+                        coll)
+          (nil? root) coll
+          :else
+          (let [new-root (.inode-without root 0 (hash k) k)]
+            (if (identical? new-root root)
+              coll
+              (PersistentHashMap. meta (dec cnt) new-root has-nil? nil-val nil)))))
+
+  IKVReduce
+  (-kv-reduce [coll f init]
+    (let [init (if has-nil? (f init nil nil-val) init)]
+      (cond
+        (reduced? init)          @init
+        (not (nil? root)) (unreduced (.kv-reduce root f init))
+        :else                    init)))
+
+  IFn
+  (-invoke [coll k]
+    (-lookup coll k))
+
+  (-invoke [coll k not-found]
+    (-lookup coll k not-found))
+
+  IEditableCollection
+  (-as-transient [coll]
+    (TransientHashMap. (js-obj) root cnt has-nil? nil-val)))
+
+(set! (.-EMPTY PersistentHashMap) (PersistentHashMap. nil 0 nil false nil empty-unordered-hash))
+
+(set! (.-fromArray PersistentHashMap)
+  (fn [arr ^boolean no-clone]
+    (let [arr (if no-clone arr (aclone arr))
+          len (alength arr)]
+      (loop [i 0 ret (transient (.-EMPTY PersistentHashMap))]
+        (if (< i len)
+          (recur (+ i 2)
+            (-assoc! ret (aget arr i) (aget arr (inc i))))
+          (-persistent! ret))))))
+
+(set! (.-fromArrays PersistentHashMap)
+  (fn [ks vs]
+    (let [len (alength ks)]
+      (loop [i 0 ^not-native out (transient (.-EMPTY PersistentHashMap))]
+        (if (< i len)
+          (recur (inc i) (-assoc! out (aget ks i) (aget vs i)))
+          (persistent! out))))))
+
+(set! (.-createWithCheck PersistentHashMap)
+  (fn [arr]
+    (let [len (alength arr)
+          ret (transient (.-EMPTY PersistentHashMap))]
+      (loop [i 0]
+        (when (< i len)
+          (-assoc! ret (aget arr i) (aget arr (inc i)))
+          (if (not= (-count ret) (inc (/ i 2)))
+            (throw (js/Error. (str "Duplicate key: " (aget arr i))))
+            (recur (+ i 2)))))
+      (-persistent! ret))))
+
+(es6-iterable PersistentHashMap)
+
+(deftype TransientHashMap [^:mutable ^boolean edit
+                           ^:mutable root
+                           ^:mutable count
+                           ^:mutable ^boolean has-nil?
+                           ^:mutable nil-val]
+  Object
+  (conj! [tcoll o]
+    (if edit
+      (cond
+        (map-entry? o)
+        (.assoc! tcoll (key o) (val o))
+
+        (vector? o)
+        (.assoc! tcoll (o 0) (o 1))
+
+        :else
+        (loop [es (seq o) tcoll tcoll]
+          (if-let [e (first es)]
+            (recur (next es)
+                   (.assoc! tcoll (key e) (val e)))
+            tcoll)))
+      (throw (js/Error. "conj! after persistent"))))
+
+  (assoc! [tcoll k v]
+    (if edit
+      (if (nil? k)
+        (do (if (identical? nil-val v)
+              nil
+              (set! nil-val v))
+            (if has-nil?
+              nil
+              (do (set! count (inc count))
+                  (set! has-nil? true)))
+            tcoll)
+        (let [added-leaf? (Box. false)
+              node        (-> (if (nil? root)
+                                (.-EMPTY BitmapIndexedNode)
+                                root)
+                              (.inode-assoc! edit 0 (hash k) k v added-leaf?))]
+          (if (identical? node root)
+            nil
+            (set! root node))
+          (if ^boolean (.-val added-leaf?)
+            (set! count (inc count)))
+          tcoll))
+      (throw (js/Error. "assoc! after persistent!"))))
+
+  (without! [tcoll k]
+    (if edit
+      (if (nil? k)
+        (if has-nil?
+          (do (set! has-nil? false)
+              (set! nil-val nil)
+              (set! count (dec count))
+              tcoll)
+          tcoll)
+        (if (nil? root)
+          tcoll
+          (let [removed-leaf? (Box. false)
+                node (.inode-without! root edit 0 (hash k) k removed-leaf?)]
+            (if (identical? node root)
+              nil
+              (set! root node))
+            (if ^boolean (.-val removed-leaf?)
+              (set! count (dec count)))
+            tcoll)))
+      (throw (js/Error. "dissoc! after persistent!"))))
+
+  (persistent! [tcoll]
+    (if edit
+      (do (set! edit nil)
+          (PersistentHashMap. nil count root has-nil? nil-val nil))
+      (throw (js/Error. "persistent! called twice"))))
+
+  ICounted
+  (-count [coll]
+    (if edit
+      count
+      (throw (js/Error. "count after persistent!"))))
+
+  ILookup
+  (-lookup [tcoll k]
+    (if (nil? k)
+      (if has-nil?
+        nil-val)
+      (if (nil? root)
+        nil
+        (.inode-lookup root 0 (hash k) k))))
+
+  (-lookup [tcoll k not-found]
+    (if (nil? k)
+      (if has-nil?
+        nil-val
+        not-found)
+      (if (nil? root)
+        not-found
+        (.inode-lookup root 0 (hash k) k not-found))))
+
+  ITransientCollection
+  (-conj! [tcoll val] (.conj! tcoll val))
+
+  (-persistent! [tcoll] (.persistent! tcoll))
+
+  ITransientAssociative
+  (-assoc! [tcoll key val] (.assoc! tcoll key val))
+
+  ITransientMap
+  (-dissoc! [tcoll key] (.without! tcoll key))
+
+  IFn
+  (-invoke [tcoll key]
+    (-lookup tcoll key))
+  (-invoke [tcoll key not-found]
+    (-lookup tcoll key not-found)))
+
+;;; PersistentTreeMap
+
+(defn- tree-map-seq-push [node stack ^boolean ascending?]
+  (loop [t node stack stack]
+    (if-not (nil? t)
+      (recur (if ascending? (.-left t) (.-right t))
+             (conj stack t))
+      stack)))
+
+(deftype PersistentTreeMapSeq [meta stack ^boolean ascending? cnt ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ISeqable
+  (-seq [this] this)
+
+  ISequential
+  ISeq
+  (-first [this] (peek stack))
+  (-rest [this]
+    (let [t (first stack)
+          next-stack (tree-map-seq-push (if ascending? (.-right t) (.-left t))
+                                        (next stack)
+                                        ascending?)]
+      (if-not (nil? next-stack)
+        (PersistentTreeMapSeq. nil next-stack ascending? (dec cnt) nil)
+        ())))
+  INext
+  (-next [this]
+    (let [t (first stack)
+          next-stack (tree-map-seq-push (if ascending? (.-right t) (.-left t))
+                                        (next stack)
+                                        ascending?)]
+      (when-not (nil? next-stack)
+        (PersistentTreeMapSeq. nil next-stack ascending? (dec cnt) nil))))
+
+  ICounted
+  (-count [coll]
+    (if (neg? cnt)
+      (inc (count (next coll)))
+      cnt))
+
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  ICollection
+  (-conj [coll o] (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) meta))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  IWithMeta
+  (-with-meta [coll meta]
+    (PersistentTreeMapSeq. meta stack ascending? cnt __hash))
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable PersistentTreeMapSeq)
+
+(defn- create-tree-map-seq [tree ascending? cnt]
+  (PersistentTreeMapSeq. nil (tree-map-seq-push tree nil ascending?) ascending? cnt nil))
+
+(declare RedNode BlackNode)
+
+(defn- balance-left [key val ins right]
+  (if (instance? RedNode ins)
+    (cond
+      (instance? RedNode (.-left ins))
+      (RedNode. (.-key ins) (.-val ins)
+              (.blacken (.-left ins))
+              (BlackNode. key val (.-right ins) right nil)
+              nil)
+
+      (instance? RedNode (.-right ins))
+      (RedNode. (.. ins -right -key) (.. ins -right -val)
+                (BlackNode. (.-key ins) (.-val ins)
+                            (.-left ins)
+                            (.. ins -right -left)
+                            nil)
+                (BlackNode. key val
+                            (.. ins -right -right)
+                            right
+                            nil)
+                nil)
+
+      :else
+      (BlackNode. key val ins right nil))
+    (BlackNode. key val ins right nil)))
+
+(defn- balance-right [key val left ins]
+  (if (instance? RedNode ins)
+    (cond
+      (instance? RedNode (.-right ins))
+      (RedNode. (.-key ins) (.-val ins)
+                (BlackNode. key val left (.-left ins) nil)
+                (.blacken (.-right ins))
+                nil)
+
+      (instance? RedNode (.-left ins))
+      (RedNode. (.. ins -left -key) (.. ins -left -val)
+                (BlackNode. key val left (.. ins -left -left) nil)
+                (BlackNode. (.-key ins) (.-val ins)
+                            (.. ins -left -right)
+                            (.-right ins)
+                            nil)
+                nil)
+
+      :else
+      (BlackNode. key val left ins nil))
+    (BlackNode. key val left ins nil)))
+
+(defn- balance-left-del [key val del right]
+  (cond
+    (instance? RedNode del)
+    (RedNode. key val (.blacken del) right nil)
+
+    (instance? BlackNode right)
+    (balance-right key val del (.redden right))
+
+    (and (instance? RedNode right) (instance? BlackNode (.-left right)))
+    (RedNode. (.. right -left -key) (.. right -left -val)
+              (BlackNode. key val del (.. right -left -left) nil)
+              (balance-right (.-key right) (.-val right)
+                             (.. right -left -right)
+                             (.redden (.-right right)))
+              nil)
+
+    :else
+    (throw (js/Error. "red-black tree invariant violation"))))
+
+(defn- balance-right-del [key val left del]
+  (cond
+    (instance? RedNode del)
+    (RedNode. key val left (.blacken del) nil)
+
+    (instance? BlackNode left)
+    (balance-left key val (.redden left) del)
+
+    (and (instance? RedNode left) (instance? BlackNode (.-right left)))
+    (RedNode. (.. left -right -key) (.. left -right -val)
+              (balance-left (.-key left) (.-val left)
+                            (.redden (.-left left))
+                            (.. left -right -left))
+              (BlackNode. key val (.. left -right -right) del nil)
+              nil)
+
+    :else
+    (throw (js/Error. "red-black tree invariant violation"))))
+
+(defn- tree-map-kv-reduce [node f init]
+  (let [init (if-not (nil? (.-left node))
+               (tree-map-kv-reduce (.-left node) f init)
+               init)]
+    (if (reduced? init)
+      init
+      (let [init (f init (.-key node) (.-val node))]
+        (if (reduced? init)
+          init
+          (if-not (nil? (.-right node))
+            (tree-map-kv-reduce (.-right node) f init)
+            init))))))
+
+(deftype BlackNode [key val left right ^:mutable __hash]
+  Object
+  (add-left [node ins]
+    (.balance-left ins node))
+
+  (add-right [node ins]
+    (.balance-right ins node))
+
+  (remove-left [node del]
+    (balance-left-del key val del right))
+
+  (remove-right [node del]
+    (balance-right-del key val left del))
+
+  (blacken [node] node)
+
+  (redden [node] (RedNode. key val left right nil))
+
+  (balance-left [node parent]
+    (BlackNode. (.-key parent) (.-val parent) node (.-right parent) nil))
+
+  (balance-right [node parent]
+    (BlackNode. (.-key parent) (.-val parent) (.-left parent) node nil))
+
+  (replace [node key val left right]
+    (BlackNode. key val left right nil))
+
+  (kv-reduce [node f init]
+    (tree-map-kv-reduce node f init))
+
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMapEntry
+  (-key [node] key)
+  (-val [node] val)
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IMeta
+  (-meta [node] nil)
+
+  IWithMeta
+  (-with-meta [node meta]
+    (-with-meta [key val] meta))
+
+  IStack
+  (-peek [node] val)
+
+  (-pop [node] [key])
+
+  ICollection
+  (-conj [node o] [key val o])
+
+  IEmptyableCollection
+  (-empty [node] nil)
+
+  ISequential
+  ISeqable
+  (-seq [node] (IndexedSeq. #js [key val] 0 nil))
+
+  IReversible
+  (-rseq [node] (IndexedSeq. #js [val key] 0 nil))
+
+  ICounted
+  (-count [node] 2)
+
+  IIndexed
+  (-nth [node n]
+    (cond (== n 0) key
+          (== n 1) val
+          :else    (throw (js/Error. "Index out of bounds"))))
+
+  (-nth [node n not-found]
+    (cond (== n 0) key
+          (== n 1) val
+          :else    not-found))
+
+  ILookup
+  (-lookup [node k] (-nth node k nil))
+  (-lookup [node k not-found] (-nth node k not-found))
+
+  IAssociative
+  (-assoc [node k v]
+    (assoc [key val] k v))
+  (-contains-key? [node k]
+    (or (== k 0) (== k 1)))
+
+  IFind
+  (-find [node k]
+    (case k
+      0 (MapEntry. 0 key nil)
+      1 (MapEntry. 1 val nil)
+      nil))
+
+  IVector
+  (-assoc-n [node n v]
+    (-assoc-n [key val] n v))
+
+  IReduce
+  (-reduce [node f]
+    (ci-reduce node f))
+
+  (-reduce [node f start]
+    (ci-reduce node f start))
+
+  IFn
+  (-invoke [node k]
+    (-nth node k))
+
+  (-invoke [node k not-found]
+    (-nth node k not-found)))
+
+(es6-iterable BlackNode)
+
+(deftype RedNode [key val left right ^:mutable __hash]
+  Object
+  (add-left [node ins]
+    (RedNode. key val ins right nil))
+
+  (add-right [node ins]
+    (RedNode. key val left ins nil))
+
+  (remove-left [node del]
+    (RedNode. key val del right nil))
+
+  (remove-right [node del]
+    (RedNode. key val left del nil))
+
+  (blacken [node]
+    (BlackNode. key val left right nil))
+
+  (redden [node]
+    (throw (js/Error. "red-black tree invariant violation")))
+
+  (balance-left [node parent]
+    (cond
+      (instance? RedNode left)
+      (RedNode. key val
+                (.blacken left)
+                (BlackNode. (.-key parent) (.-val parent) right (.-right parent) nil)
+                nil)
+
+      (instance? RedNode right)
+      (RedNode. (.-key right) (.-val right)
+                (BlackNode. key val left (.-left right) nil)
+                (BlackNode. (.-key parent) (.-val parent)
+                            (.-right right)
+                            (.-right parent)
+                            nil)
+                nil)
+
+      :else
+      (BlackNode. (.-key parent) (.-val parent) node (.-right parent) nil)))
+
+  (balance-right [node parent]
+    (cond
+      (instance? RedNode right)
+      (RedNode. key val
+                (BlackNode. (.-key parent) (.-val parent)
+                            (.-left parent)
+                            left
+                            nil)
+                (.blacken right)
+                nil)
+
+      (instance? RedNode left)
+      (RedNode. (.-key left) (.-val left)
+                (BlackNode. (.-key parent) (.-val parent)
+                            (.-left parent)
+                            (.-left left)
+                            nil)
+                (BlackNode. key val (.-right left) right nil)
+                nil)
+
+      :else
+      (BlackNode. (.-key parent) (.-val parent) (.-left parent) node nil)))
+
+  (replace [node key val left right]
+    (RedNode. key val left right nil))
+
+  (kv-reduce [node f init]
+    (tree-map-kv-reduce node f init))
+
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMapEntry
+  (-key [node] key)
+  (-val [node] val)
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-ordered-coll __hash))
+
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  IMeta
+  (-meta [node] nil)
+
+  IWithMeta
+  (-with-meta [node meta]
+    (-with-meta [key val] meta))
+
+  IStack
+  (-peek [node] val)
+
+  (-pop [node] [key])
+
+  ICollection
+  (-conj [node o] [key val o])
+
+  IEmptyableCollection
+  (-empty [node] nil)
+
+  ISequential
+  ISeqable
+  (-seq [node] (IndexedSeq. #js [key val] 0 nil))
+
+  IReversible
+  (-rseq [node] (IndexedSeq. #js [val key] 0 nil))
+
+  ICounted
+  (-count [node] 2)
+
+  IIndexed
+  (-nth [node n]
+    (cond (== n 0) key
+          (== n 1) val
+          :else    (throw (js/Error. "Index out of bounds"))))
+
+  (-nth [node n not-found]
+    (cond (== n 0) key
+          (== n 1) val
+          :else    not-found))
+
+  ILookup
+  (-lookup [node k] (-nth node k nil))
+  (-lookup [node k not-found] (-nth node k not-found))
+
+  IAssociative
+  (-assoc [node k v]
+    (assoc [key val] k v))
+  (-contains-key? [node k]
+    (or (== k 0) (== k 1)))
+
+  IFind
+  (-find [node k]
+    (case k
+      0 (MapEntry. 0 key nil)
+      1 (MapEntry. 1 val nil)
+      nil))
+
+  IVector
+  (-assoc-n [node n v]
+    (-assoc-n [key val] n v))
+
+  IReduce
+  (-reduce [node f]
+    (ci-reduce node f))
+
+  (-reduce [node f start]
+    (ci-reduce node f start))
+
+  IFn
+  (-invoke [node k]
+    (-nth node k))
+
+  (-invoke [node k not-found]
+    (-nth node k not-found)))
+
+(es6-iterable RedNode)
+
+(defn- tree-map-add [comp tree k v found]
+  (if (nil? tree)
+    (RedNode. k v nil nil nil)
+    (let [c (comp k (.-key tree))]
+      (cond
+        (zero? c)
+        (do (aset found 0 tree)
+            nil)
+
+        (neg? c)
+        (let [ins (tree-map-add comp (.-left tree) k v found)]
+          (if-not (nil? ins)
+            (.add-left tree ins)))
+
+        :else
+        (let [ins (tree-map-add comp (.-right tree) k v found)]
+          (if-not (nil? ins)
+            (.add-right tree ins)))))))
+
+(defn- tree-map-append [left right]
+  (cond
+    (nil? left)
+    right
+
+    (nil? right)
+    left
+
+    (instance? RedNode left)
+    (if (instance? RedNode right)
+      (let [app (tree-map-append (.-right left) (.-left right))]
+        (if (instance? RedNode app)
+          (RedNode. (.-key app) (.-val app)
+                    (RedNode. (.-key left) (.-val left)
+                              (.-left left)
+                              (.-left app)
+                              nil)
+                    (RedNode. (.-key right) (.-val right)
+                              (.-right app)
+                              (.-right right)
+                              nil)
+                    nil)
+          (RedNode. (.-key left) (.-val left)
+                    (.-left left)
+                    (RedNode. (.-key right) (.-val right) app (.-right right) nil)
+                    nil)))
+      (RedNode. (.-key left) (.-val left)
+                (.-left left)
+                (tree-map-append (.-right left) right)
+                nil))
+
+    (instance? RedNode right)
+    (RedNode. (.-key right) (.-val right)
+              (tree-map-append left (.-left right))
+              (.-right right)
+              nil)
+
+    :else
+    (let [app (tree-map-append (.-right left) (.-left right))]
+      (if (instance? RedNode app)
+        (RedNode. (.-key app) (.-val app)
+                  (BlackNode. (.-key left) (.-val left)
+                              (.-left left)
+                              (.-left app)
+                              nil)
+                  (BlackNode. (.-key right) (.-val right)
+                              (.-right app)
+                              (.-right right)
+                              nil)
+                  nil)
+        (balance-left-del (.-key left) (.-val left)
+                          (.-left left)
+                          (BlackNode. (.-key right) (.-val right)
+                                      app
+                                      (.-right right)
+                                      nil))))))
+
+(defn- tree-map-remove [comp tree k found]
+  (if-not (nil? tree)
+    (let [c (comp k (.-key tree))]
+      (cond
+        (zero? c)
+        (do (aset found 0 tree)
+            (tree-map-append (.-left tree) (.-right tree)))
+
+        (neg? c)
+        (let [del (tree-map-remove comp (.-left tree) k found)]
+          (if (or (not (nil? del)) (not (nil? (aget found 0))))
+            (if (instance? BlackNode (.-left tree))
+              (balance-left-del (.-key tree) (.-val tree) del (.-right tree))
+              (RedNode. (.-key tree) (.-val tree) del (.-right tree) nil))))
+
+        :else
+        (let [del (tree-map-remove comp (.-right tree) k found)]
+          (if (or (not (nil? del)) (not (nil? (aget found 0))))
+            (if (instance? BlackNode (.-right tree))
+              (balance-right-del (.-key tree) (.-val tree) (.-left tree) del)
+              (RedNode. (.-key tree) (.-val tree) (.-left tree) del nil))))))))
+
+(defn- tree-map-replace [comp tree k v]
+  (let [tk (.-key tree)
+        c  (comp k tk)]
+    (cond (zero? c) (.replace tree tk v (.-left tree) (.-right tree))
+          (neg? c)  (.replace tree tk (.-val tree) (tree-map-replace comp (.-left tree) k v) (.-right tree))
+          :else     (.replace tree tk (.-val tree) (.-left tree) (tree-map-replace comp (.-right tree) k v)))))
+
+(declare key)
+
+(deftype PersistentTreeMap [comp tree cnt meta ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+
+  ;; EXPERIMENTAL: subject to change
+  (keys [coll]
+    (es6-iterator (keys coll)))
+  (entries [coll]
+    (es6-entries-iterator (seq coll)))
+  (values [coll]
+    (es6-iterator (vals coll)))
+  (has [coll k]
+    (contains? coll k))
+  (get [coll k not-found]
+    (-lookup coll k not-found))
+  (forEach [coll f]
+    (doseq [[k v] coll]
+      (f v k)))
+
+  (entry-at [coll k]
+    (loop [t tree]
+      (if-not (nil? t)
+        (let [c (comp k (.-key t))]
+          (cond (zero? c) t
+                (neg? c)  (recur (.-left t))
+                :else     (recur (.-right t)))))))
+
+  ICloneable
+  (-clone [_] (PersistentTreeMap. comp tree cnt meta __hash))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentTreeMap. comp tree cnt meta __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ICollection
+  (-conj [coll entry]
+    (if (vector? entry)
+      (-assoc coll (-nth entry 0) (-nth entry 1))
+      (loop [ret coll es (seq entry)]
+        (if (nil? es)
+          ret
+          (let [e (first es)]
+            (if (vector? e)
+              (recur (-assoc ret (-nth e 0) (-nth e 1))
+                     (next es))
+              (throw (js/Error. "conj on a map takes map entries or seqables of map entries"))))))))
+
+  IEmptyableCollection
+  (-empty [coll] (PersistentTreeMap. comp nil 0 meta 0))
+
+  IEquiv
+  (-equiv [coll other] (equiv-map coll other))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-unordered-coll __hash))
+
+  ICounted
+  (-count [coll] cnt)
+
+  IKVReduce
+  (-kv-reduce [coll f init]
+    (if-not (nil? tree)
+      (unreduced (tree-map-kv-reduce tree f init))
+      init))
+
+  IFn
+  (-invoke [coll k]
+    (-lookup coll k))
+
+  (-invoke [coll k not-found]
+    (-lookup coll k not-found))
+
+  ISeqable
+  (-seq [coll]
+    (if (pos? cnt)
+      (create-tree-map-seq tree true cnt)))
+
+  IReversible
+  (-rseq [coll]
+    (if (pos? cnt)
+      (create-tree-map-seq tree false cnt)))
+
+  ILookup
+  (-lookup [coll k]
+    (-lookup coll k nil))
+
+  (-lookup [coll k not-found]
+    (let [n (.entry-at coll k)]
+      (if-not (nil? n)
+        (.-val n)
+        not-found)))
+
+  IAssociative
+  (-assoc [coll k v]
+    (let [found (array nil)
+          t     (tree-map-add comp tree k v found)]
+      (if (nil? t)
+        (let [found-node (nth found 0)]
+          (if (= v (.-val found-node))
+            coll
+            (PersistentTreeMap. comp (tree-map-replace comp tree k v) cnt meta nil)))
+        (PersistentTreeMap. comp (.blacken t) (inc cnt) meta nil))))
+
+  (-contains-key? [coll k]
+    (not (nil? (.entry-at coll k))))
+
+  IFind
+  (-find [coll k]
+    (.entry-at coll k))
+
+  IMap
+  (-dissoc [coll k]
+    (let [found (array nil)
+          t     (tree-map-remove comp tree k found)]
+      (if (nil? t)
+        (if (nil? (nth found 0))
+          coll
+          (PersistentTreeMap. comp nil 0 meta nil))
+        (PersistentTreeMap. comp (.blacken t) (dec cnt) meta nil))))
+
+  ISorted
+  (-sorted-seq [coll ascending?]
+    (if (pos? cnt)
+      (create-tree-map-seq tree ascending? cnt)))
+
+  (-sorted-seq-from [coll k ascending?]
+    (if (pos? cnt)
+      (loop [stack nil t tree]
+        (if-not (nil? t)
+          (let [c (comp k (.-key t))]
+            (cond
+              (zero? c)  (PersistentTreeMapSeq. nil (conj stack t) ascending? -1 nil)
+              ascending? (if (neg? c)
+                           (recur (conj stack t) (.-left t))
+                           (recur stack          (.-right t)))
+              :else      (if (pos? c)
+                           (recur (conj stack t) (.-right t))
+                           (recur stack          (.-left t)))))
+          (when-not (nil? stack)
+            (PersistentTreeMapSeq. nil stack ascending? -1 nil))))))
+
+  (-entry-key [coll entry] (key entry))
+
+  (-comparator [coll] comp))
+
+(set! (.-EMPTY PersistentTreeMap) (PersistentTreeMap. compare nil 0 nil empty-unordered-hash))
+
+(es6-iterable PersistentTreeMap)
+
+(defn hash-map
+  "keyval => key val
+  Returns a new hash map with supplied mappings."
+  [& keyvals]
+  (loop [in (seq keyvals), out (transient (.-EMPTY PersistentHashMap))]
+    (if in
+      (recur (nnext in) (assoc! out (first in) (second in)))
+      (persistent! out))))
+
+(defn array-map
+  "keyval => key val
+  Returns a new array map with supplied mappings."
+  [& keyvals]
+  (let [arr (if (and (instance? IndexedSeq keyvals) (zero? (.-i keyvals)))
+              (.-arr keyvals)
+              (into-array keyvals))]
+    (.createAsIfByAssoc PersistentArrayMap arr)))
+
+(defn obj-map
+  "keyval => key val
+  Returns a new object map with supplied mappings."
+  [& keyvals]
+  (let [ks  (array)
+        obj (js-obj)]
+    (loop [kvs (seq keyvals)]
+      (if kvs
+        (do (.push ks (first kvs))
+            (gobject/set obj (first kvs) (second kvs))
+            (recur (nnext kvs)))
+        (.fromObject ObjMap ks obj)))))
+
+(defn sorted-map
+  "keyval => key val
+  Returns a new sorted map with supplied mappings."
+  ([& keyvals]
+     (loop [in (seq keyvals) out (.-EMPTY PersistentTreeMap)]
+       (if in
+         (recur (nnext in) (assoc out (first in) (second in)))
+         out))))
+
+(defn sorted-map-by
+  "keyval => key val
+  Returns a new sorted map with supplied mappings, using the supplied comparator."
+  ([comparator & keyvals]
+     (loop [in (seq keyvals)
+            out (PersistentTreeMap. (fn->comparator comparator) nil 0 nil 0)]
+       (if in
+         (recur (nnext in) (assoc out (first in) (second in)))
+         out))))
+
+(deftype KeySeq [^not-native mseq _meta]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMeta
+  (-meta [coll] _meta)
+
+  IWithMeta
+  (-with-meta [coll new-meta] (KeySeq. mseq new-meta))
+
+  ISeqable
+  (-seq [coll] coll)
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  ICollection
+  (-conj [coll o]
+    (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) _meta))
+
+  IHash
+  (-hash [coll] (hash-ordered-coll coll))
+  
+  ISeq
+  (-first [coll]
+    (let [^not-native me (-first mseq)]
+      (-key me)))
+
+  (-rest [coll]
+    (let [nseq (if (satisfies? INext mseq)
+                 (-next mseq)
+                 (next mseq))]
+      (if-not (nil? nseq)
+        (KeySeq. nseq _meta)
+        ())))
+
+  INext
+  (-next [coll]
+    (let [nseq (if (satisfies? INext mseq)
+                 (-next mseq)
+                 (next mseq))]
+      (when-not (nil? nseq)
+        (KeySeq. nseq _meta))))
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable KeySeq)
+
+(defn keys
+  "Returns a sequence of the map's keys."
+  [hash-map]
+  (when-let [mseq (seq hash-map)]
+    (KeySeq. mseq nil)))
+
+(defn key
+  "Returns the key of the map entry."
+  [map-entry]
+  (-key map-entry))
+
+(deftype ValSeq [^not-native mseq _meta]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  IMeta
+  (-meta [coll] _meta)
+
+  IWithMeta
+  (-with-meta [coll new-meta] (ValSeq. mseq new-meta))
+
+  ISeqable
+  (-seq [coll] coll)
+
+  ISequential
+  IEquiv
+  (-equiv [coll other] (equiv-sequential coll other))
+
+  ICollection
+  (-conj [coll o]
+    (cons o coll))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY List) _meta))
+
+  IHash
+  (-hash [coll] (hash-ordered-coll coll))
+
+  ISeq
+  (-first [coll]
+    (let [^not-native me (-first mseq)]
+      (-val me)))
+
+  (-rest [coll]
+    (let [nseq (if (satisfies? INext mseq)
+                 (-next mseq)
+                 (next mseq))]
+      (if-not (nil? nseq)
+        (ValSeq. nseq _meta)
+        ())))
+
+  INext
+  (-next [coll]
+    (let [nseq (if (satisfies? INext mseq)
+                 (-next mseq)
+                 (next mseq))]
+      (when-not (nil? nseq)
+        (ValSeq. nseq _meta))))
+
+  IReduce
+  (-reduce [coll f] (seq-reduce f coll))
+  (-reduce [coll f start] (seq-reduce f start coll)))
+
+(es6-iterable ValSeq)
+
+(defn vals
+  "Returns a sequence of the map's values."
+  [hash-map]
+  (when-let [mseq (seq hash-map)]
+    (ValSeq. mseq nil)))
+
+(defn val
+  "Returns the value in the map entry."
+  [map-entry]
+  (-val map-entry))
+
+(defn merge
+  "Returns a map that consists of the rest of the maps conj-ed onto
+  the first.  If a key occurs in more than one map, the mapping from
+  the latter (left-to-right) will be the mapping in the result."
+  [& maps]
+  (when (some identity maps)
+    (reduce #(conj (or %1 {}) %2) maps)))
+
+(defn merge-with
+  "Returns a map that consists of the rest of the maps conj-ed onto
+  the first.  If a key occurs in more than one map, the mapping(s)
+  from the latter (left-to-right) will be combined with the mapping in
+  the result by calling (f val-in-result val-in-latter)."
+  [f & maps]
+  (when (some identity maps)
+    (let [merge-entry (fn [m e]
+                        (let [k (first e) v (second e)]
+                          (if (contains? m k)
+                            (assoc m k (f (get m k) v))
+                            (assoc m k v))))
+          merge2 (fn [m1 m2]
+                   (reduce merge-entry (or m1 {}) (seq m2)))]
+      (reduce merge2 maps))))
+
+(defn select-keys
+  "Returns a map containing only those entries in map whose key is in keys"
+  [map keyseq]
+    (loop [ret {} keys (seq keyseq)]
+      (if keys
+        (let [key   (first keys)
+              entry (get map key ::not-found)]
+          (recur
+           (if (not= entry ::not-found)
+             (assoc ret key entry)
+             ret)
+           (next keys)))
+        (-with-meta ret (meta map)))))
+
+;;; PersistentHashSet
+
+(declare TransientHashSet)
+
+(deftype HashSetIter [iter]
+  Object
+  (hasNext [_]
+    (.hasNext iter))
+  (next [_]
+    (if ^boolean (.hasNext iter)
+      (.-key (.next iter))
+      (throw (js/Error. "No such element"))))
+  (remove [_] (js/Error. "Unsupported operation")))
+
+(deftype PersistentHashSet [meta hash-map ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+
+  ;; EXPERIMENTAL: subject to change
+  (keys [coll]
+    (es6-iterator (seq coll)))
+  (entries [coll]
+    (es6-set-entries-iterator (seq coll)))
+  (values [coll]
+    (es6-iterator (seq coll)))
+  (has [coll k]
+    (contains? coll k))
+  (forEach [coll f]
+    (doseq [[k v] coll]
+      (f v k)))
+
+  ICloneable
+  (-clone [_] (PersistentHashSet. meta hash-map __hash))
+
+  IIterable
+  (-iterator [coll]
+    (HashSetIter. (-iterator hash-map)))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentHashSet. meta hash-map __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ICollection
+  (-conj [coll o]
+    (PersistentHashSet. meta (assoc hash-map o nil) nil))
+
+  IEmptyableCollection
+  (-empty [coll] (-with-meta (.-EMPTY PersistentHashSet) meta))
+
+  IEquiv
+  (-equiv [coll other]
+    (and
+     (set? other)
+     (== (count coll) (count other))
+     ^boolean
+     (try
+       (reduce-kv
+         #(or (contains? other %2) (reduced false))
+         true hash-map)
+       (catch js/Error ex
+         false))))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-unordered-coll __hash))
+
+  ISeqable
+  (-seq [coll] (keys hash-map))
+
+  ICounted
+  (-count [coll] (-count hash-map))
+
+  ILookup
+  (-lookup [coll v]
+    (-lookup coll v nil))
+  (-lookup [coll v not-found]
+    (if-let [entry (-find hash-map v)]
+      (key entry)
+      not-found))
+
+  ISet
+  (-disjoin [coll v]
+    (PersistentHashSet. meta (-dissoc hash-map v) nil))
+
+  IFn
+  (-invoke [coll k]
+    (-lookup coll k))
+  (-invoke [coll k not-found]
+    (-lookup coll k not-found))
+
+  IEditableCollection
+  (-as-transient [coll] (TransientHashSet. (-as-transient hash-map))))
+
+(set! (.-EMPTY PersistentHashSet)
+  (PersistentHashSet. nil (.-EMPTY PersistentArrayMap) empty-unordered-hash))
+
+(set! (.-fromArray PersistentHashSet)
+  (fn [items ^boolean no-clone]
+    (let [len (alength items)]
+      (if (<= len (.-HASHMAP-THRESHOLD PersistentArrayMap))
+        (let [arr (if no-clone items (aclone items))]
+          (loop [i 0
+                 out (transient (.-EMPTY PersistentArrayMap))]
+            (if (< i len)
+              (recur (inc i) (-assoc! out (aget items i) nil))
+              (PersistentHashSet. nil (-persistent! out) nil))))
+       (loop [i 0
+              out (transient (.-EMPTY PersistentHashSet))]
+         (if (< i len)
+           (recur (inc i) (-conj! out (aget items i)))
+           (-persistent! out)))))))
+
+(set! (.-createWithCheck PersistentHashSet)
+      (fn [items]
+        (let [len (alength items)
+              t (-as-transient (.-EMPTY PersistentHashSet))]
+          (dotimes [i len]
+            (-conj! t (aget items i))
+            (when-not (= (count t) (inc i))
+              (throw (js/Error. (str "Duplicate key: " (aget items i))))))
+          (-persistent! t))))
+
+(set! (.-createAsIfByAssoc PersistentHashSet)
+      (fn [items]
+        (let [len (alength items)
+              t (-as-transient (.-EMPTY PersistentHashSet))]
+          (dotimes [i len] (-conj! t (aget items i)))
+          (-persistent! t))))
+
+(es6-iterable PersistentHashSet)
+
+(deftype TransientHashSet [^:mutable transient-map]
+  ITransientCollection
+  (-conj! [tcoll o]
+    (set! transient-map (assoc! transient-map o nil))
+    tcoll)
+
+  (-persistent! [tcoll]
+    (PersistentHashSet. nil (persistent! transient-map) nil))
+
+  ITransientSet
+  (-disjoin! [tcoll v]
+    (set! transient-map (dissoc! transient-map v))
+    tcoll)
+
+  ICounted
+  (-count [tcoll] (count transient-map))
+
+  ILookup
+  (-lookup [tcoll v]
+    (-lookup tcoll v nil))
+
+  (-lookup [tcoll v not-found]
+    (if (identical? (-lookup transient-map v lookup-sentinel) lookup-sentinel)
+      not-found
+      v))
+
+  IFn
+  (-invoke [tcoll k]
+    (if (identical? (-lookup transient-map k lookup-sentinel) lookup-sentinel)
+      nil
+      k))
+
+  (-invoke [tcoll k not-found]
+    (if (identical? (-lookup transient-map k lookup-sentinel) lookup-sentinel)
+      not-found
+      k)))
+
+(deftype PersistentTreeSet [meta tree-map ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+
+  ;; EXPERIMENTAL: subject to change
+  (keys [coll]
+    (es6-iterator (seq coll)))
+  (entries [coll]
+    (es6-set-entries-iterator (seq coll)))
+  (values [coll]
+    (es6-iterator (seq coll)))
+  (has [coll k]
+    (contains? coll k))
+  (forEach [coll f]
+    (doseq [[k v] coll]
+      (f v k)))
+
+  ICloneable
+  (-clone [_] (PersistentTreeSet. meta tree-map __hash))
+
+  IWithMeta
+  (-with-meta [coll meta] (PersistentTreeSet. meta tree-map __hash))
+
+  IMeta
+  (-meta [coll] meta)
+
+  ICollection
+  (-conj [coll o]
+    (PersistentTreeSet. meta (assoc tree-map o nil) nil))
+
+  IEmptyableCollection
+  (-empty [coll] (PersistentTreeSet. meta (-empty tree-map) 0))
+
+  IEquiv
+  (-equiv [coll other]
+    (and
+     (set? other)
+     (== (count coll) (count other))
+     ^boolean
+     (try
+       (reduce-kv
+         #(or (contains? other %2) (reduced false))
+         true tree-map)
+       (catch js/Error ex
+         false))))
+
+  IHash
+  (-hash [coll] (caching-hash coll hash-unordered-coll __hash))
+
+  ISeqable
+  (-seq [coll] (keys tree-map))
+
+  ISorted
+  (-sorted-seq [coll ascending?]
+    (map key (-sorted-seq tree-map ascending?)))
+
+  (-sorted-seq-from [coll k ascending?]
+    (map key (-sorted-seq-from tree-map k ascending?)))
+
+  (-entry-key [coll entry] entry)
+
+  (-comparator [coll] (-comparator tree-map))
+
+  IReversible
+  (-rseq [coll]
+    (if (pos? (count tree-map))
+      (map key (rseq tree-map))))
+
+  ICounted
+  (-count [coll] (count tree-map))
+
+  ILookup
+  (-lookup [coll v]
+    (-lookup coll v nil))
+  (-lookup [coll v not-found]
+    (let [n (.entry-at tree-map v)]
+      (if-not (nil? n)
+        (.-key n)
+        not-found)))
+
+  ISet
+  (-disjoin [coll v]
+    (PersistentTreeSet. meta (dissoc tree-map v) nil))
+
+  IFn
+  (-invoke [coll k]
+    (-lookup coll k))
+  (-invoke [coll k not-found]
+    (-lookup coll k not-found)))
+
+(set! (.-EMPTY PersistentTreeSet)
+  (PersistentTreeSet. nil (.-EMPTY PersistentTreeMap) empty-unordered-hash))
+
+(es6-iterable PersistentTreeSet)
+
+(defn set-from-indexed-seq [iseq]
+  (let [arr (.-arr iseq)
+        ret (areduce arr i ^not-native res (-as-transient #{})
+              (-conj! res (aget arr i)))]
+    (-persistent! ^not-native ret)))
+
+(defn set
+  "Returns a set of the distinct elements of coll."
+  [coll]
+  (let [in (seq coll)]
+    (cond
+      (nil? in) #{}
+
+      (and (instance? IndexedSeq in) (zero? (.-i in)))
+      (.createAsIfByAssoc PersistentHashSet (.-arr in))
+
+      :else
+      (loop [^not-native in in
+             ^not-native out (-as-transient #{})]
+        (if-not (nil? in)
+          (recur (next in) (-conj! out (-first in)))
+          (persistent! out))))))
+
+(defn hash-set
+  "Returns a new hash set with supplied keys.  Any equal keys are
+  handled as if by repeated uses of conj."
+  ([] #{})
+  ([& keys] (set keys)))
+
+(defn sorted-set
+  "Returns a new sorted set with supplied keys."
+  ([& keys]
+   (reduce -conj (.-EMPTY PersistentTreeSet) keys)))
+
+(defn sorted-set-by
+  "Returns a new sorted set with supplied keys, using the supplied comparator."
+  ([comparator & keys]
+   (reduce -conj
+           (PersistentTreeSet. nil (sorted-map-by comparator) 0)
+           keys)))
+
+(defn replace
+  "Given a map of replacement pairs and a vector/collection, returns a
+  vector/seq with any elements = a key in smap replaced with the
+  corresponding val in smap.  Returns a transducer when no collection
+  is provided."
+  ([smap]
+     (map #(if-let [e (find smap %)] (val e) %)))
+  ([smap coll]
+     (if (vector? coll)
+       (let [n (count coll)]
+         (reduce (fn [v i]
+                   (if-let [e (find smap (nth v i))]
+                     (assoc v i (second e))
+                     v))
+           coll (take n (iterate inc 0))))
+       (map #(if-let [e (find smap %)] (second e) %) coll))))
+
+(defn distinct
+  "Returns a lazy sequence of the elements of coll with duplicates removed.
+  Returns a stateful transducer when no collection is provided."
+  ([]
+    (fn [rf]
+      (let [seen (volatile! #{})]
+        (fn
+          ([] (rf))
+          ([result] (rf result))
+          ([result input]
+            (if (contains? @seen input)
+              result
+              (do (vswap! seen conj input)
+                  (rf result input))))))))
+  ([coll]
+    (let [step (fn step [xs seen]
+                 (lazy-seq
+                   ((fn [[f :as xs] seen]
+                      (when-let [s (seq xs)]
+                        (if (contains? seen f)
+                          (recur (rest s) seen)
+                          (cons f (step (rest s) (conj seen f))))))
+                     xs seen)))]
+      (step coll #{}))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(defn butlast
+  "Return a seq of all but the last item in coll, in linear time"
+  [s]
+  (loop [ret [] s s]
+    (if (next s)
+      (recur (conj ret (first s)) (next s))
+      (seq ret))))
+
+(defn name
+  "Returns the name String of a string, symbol or keyword."
+  [x]
+  (if (implements? INamed x)
+    (-name ^not-native x)
+    (if (string? x)
+      x
+      (throw (js/Error. (str "Doesn't support name: " x))))))
+
+(defn zipmap
+  "Returns a map with the keys mapped to the corresponding vals."
+  [keys vals]
+    (loop [map (transient {})
+           ks (seq keys)
+           vs (seq vals)]
+      (if (and ks vs)
+        (recur (assoc! map (first ks) (first vs))
+               (next ks)
+               (next vs))
+        (persistent! map))))
+
+(defn max-key
+  "Returns the x for which (k x), a number, is greatest.
+  
+  If there are multiple such xs, the last one is returned."
+  ([k x] x)
+  ([k x y] (if (> (k x) (k y)) x y))
+  ([k x y & more]
+   (reduce #(max-key k %1 %2) (max-key k x y) more)))
+
+(defn min-key
+  "Returns the x for which (k x), a number, is least.
+
+  If there are multiple such xs, the last one is returned."
+  ([k x] x)
+  ([k x y] (if (< (k x) (k y)) x y))
+  ([k x y & more]
+     (reduce #(min-key k %1 %2) (min-key k x y) more)))
+
+(deftype ArrayList [^:mutable arr]
+  Object
+  (add [_ x] (.push arr x))
+  (size [_] (alength arr))
+  (clear [_] (set! arr (array)))
+  (isEmpty [_] (zero? (alength arr)))
+  (toArray [_] arr))
+
+(defn array-list []
+  (ArrayList. (array)))
+
+(defn partition-all
+  "Returns a lazy sequence of lists like partition, but may include
+  partitions with fewer than n items at the end.  Returns a stateful
+  transducer when no collection is provided."
+  ([n]
+   (fn [rf]
+     (let [a (array-list)]
+       (fn
+         ([] (rf))
+         ([result]
+            (let [result (if (.isEmpty a)
+                           result
+                           (let [v (vec (.toArray a))]
+                             ;;clear first!
+                             (.clear a)
+                             (unreduced (rf result v))))]
+              (rf result)))
+         ([result input]
+            (.add a input)
+            (if (== n (.size a))
+              (let [v (vec (.toArray a))]
+                (.clear a)
+                (rf result v))
+              result))))))
+  ([n coll]
+     (partition-all n n coll))
+  ([n step coll]
+     (lazy-seq
+      (when-let [s (seq coll)]
+        (cons (take n s) (partition-all n step (drop step s)))))))
+
+(defn take-while
+  "Returns a lazy sequence of successive items from coll while
+  (pred item) returns logical true. pred must be free of side-effects.
+  Returns a transducer when no collection is provided."
+  ([pred]
+     (fn [rf]
+       (fn
+         ([] (rf))
+         ([result] (rf result))
+         ([result input]
+            (if (pred input)
+              (rf result input)
+              (reduced result))))))
+  ([pred coll]
+     (lazy-seq
+       (when-let [s (seq coll)]
+         (when (pred (first s))
+           (cons (first s) (take-while pred (rest s))))))))
+
+(defn mk-bound-fn
+  [sc test key]
+  (fn [e]
+    (let [comp (-comparator sc)]
+      (test (comp (-entry-key sc e) key) 0))))
+
+(defn subseq
+  "sc must be a sorted collection, test(s) one of <, <=, > or
+  >=. Returns a seq of those entries with keys ek for
+  which (test (.. sc comparator (compare ek key)) 0) is true"
+  ([sc test key]
+     (let [include (mk-bound-fn sc test key)]
+       (if (#{> >=} test)
+         (when-let [[e :as s] (-sorted-seq-from sc key true)]
+           (if (include e) s (next s)))
+         (take-while include (-sorted-seq sc true)))))
+  ([sc start-test start-key end-test end-key]
+     (when-let [[e :as s] (-sorted-seq-from sc start-key true)]
+       (take-while (mk-bound-fn sc end-test end-key)
+                   (if ((mk-bound-fn sc start-test start-key) e) s (next s))))))
+
+(defn rsubseq
+  "sc must be a sorted collection, test(s) one of <, <=, > or
+  >=. Returns a reverse seq of those entries with keys ek for
+  which (test (.. sc comparator (compare ek key)) 0) is true"
+  ([sc test key]
+     (let [include (mk-bound-fn sc test key)]
+       (if (#{< <=} test)
+         (when-let [[e :as s] (-sorted-seq-from sc key false)]
+           (if (include e) s (next s)))
+         (take-while include (-sorted-seq sc false)))))
+  ([sc start-test start-key end-test end-key]
+     (when-let [[e :as s] (-sorted-seq-from sc end-key false)]
+       (take-while (mk-bound-fn sc start-test start-key)
+                   (if ((mk-bound-fn sc end-test end-key) e) s (next s))))))
+
+(deftype RangeIterator [^:mutable i end step]
+  Object
+  (hasNext [_]
+    (if (pos? step)
+      (< i end)
+      (> i end)))
+  (next [_]
+    (let [ret i]
+      (set! i (+ i step))
+      ret)))
+
+(deftype Range [meta start end step ^:mutable __hash]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+  (equiv [this other]
+    (-equiv this other))
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ICloneable
+  (-clone [_] (Range. meta start end step __hash))
+
+  IWithMeta
+  (-with-meta [rng meta] (Range. meta start end step __hash))
+
+  IMeta
+  (-meta [rng] meta)
+
+  ISeqable
+  (-seq [rng]
+    (cond
+      (pos? step) (when (< start end) rng)
+      (neg? step) (when (> start end) rng)
+      :else       (when-not (== start end) rng)))
+
+  ISeq
+  (-first [rng]
+    (when-not (nil? (-seq rng)) start))
+  (-rest [rng]
+    (if-not (nil? (-seq rng))
+      (Range. meta (+ start step) end step nil)
+      ()))
+
+  IIterable
+  (-iterator [_]
+    (RangeIterator. start end step))
+
+  INext
+  (-next [rng]
+    (if (pos? step)
+      (when (< (+ start step) end)
+        (Range. meta (+ start step) end step nil))
+      (when (> (+ start step) end)
+        (Range. meta (+ start step) end step nil))))
+
+  ICollection
+  (-conj [rng o] (cons o rng))
+
+  IEmptyableCollection
+  (-empty [rng] (-with-meta (.-EMPTY List) meta))
+
+  ISequential
+  IEquiv
+  (-equiv [rng other] (equiv-sequential rng other))
+
+  IHash
+  (-hash [rng] (caching-hash rng hash-ordered-coll __hash))
+
+  ICounted
+  (-count [rng]
+    (if-not (-seq rng)
+      0
+      (Math/ceil (/ (- end start) step))))
+
+  IIndexed
+  (-nth [rng n]
+    (if (and (<= 0 n) (< n (-count rng)))
+      (+ start (* n step))
+      (if (and (<= 0 n) (> start end) (zero? step))
+        start
+        (throw (js/Error. "Index out of bounds")))))
+  (-nth [rng n not-found]
+    (if (and (<= 0 n) (< n (-count rng)))
+      (+ start (* n step))
+      (if (and (<= 0 n) (> start end) (zero? step))
+        start
+        not-found)))
+
+  IReduce
+  (-reduce [rng f] (ci-reduce rng f))
+  (-reduce [rng f init]
+    (loop [i start ret init]
+      (if (if (pos? step) (< i end) (> i end))
+        (let [ret (f ret i)]
+          (if (reduced? ret)
+            @ret
+            (recur (+ i step) ret)))
+        ret))))
+
+(es6-iterable Range)
+
+(defn range
+  "Returns a lazy seq of nums from start (inclusive) to end
+   (exclusive), by step, where start defaults to 0, step to 1,
+   and end to infinity."
+  ([] (range 0 (.-MAX_VALUE js/Number) 1))
+  ([end] (range 0 end 1))
+  ([start end] (range start end 1))
+  ([start end step] (Range. nil start end step nil)))
+
+(defn take-nth
+  "Returns a lazy seq of every nth item in coll.  Returns a stateful
+  transducer when no collection is provided."
+  ([n]
+   {:pre [(number? n)]}
+     (fn [rf]
+       (let [ia (volatile! -1)]
+         (fn
+           ([] (rf))
+           ([result] (rf result))
+           ([result input]
+              (let [i (vswap! ia inc)]
+                (if (zero? (rem i n))
+                  (rf result input)
+                  result)))))))
+  ([n coll]
+   {:pre [(number? n)]}
+     (lazy-seq
+       (when-let [s (seq coll)]
+         (cons (first s) (take-nth n (drop n s)))))))
+
+(defn split-with
+  "Returns a vector of [(take-while pred coll) (drop-while pred coll)]"
+  [pred coll]
+  [(take-while pred coll) (drop-while pred coll)])
+
+(defn partition-by
+  "Applies f to each value in coll, splitting it each time f returns a
+   new value.  Returns a lazy seq of partitions.  Returns a stateful
+   transducer when no collection is provided."
+  ([f]
+     (fn [rf]
+       (let [a (array-list)
+             pa (volatile! ::none)]
+         (fn
+           ([] (rf))
+           ([result]
+              (let [result (if (.isEmpty a)
+                             result
+                             (let [v (vec (.toArray a))]
+                               ;;clear first!
+                               (.clear a)
+                               (unreduced (rf result v))))]
+                (rf result)))
+           ([result input]
+              (let [pval @pa
+                    val (f input)]
+                (vreset! pa val)
+                (if (or (keyword-identical? pval ::none)
+                        (= val pval))
+                  (do
+                    (.add a input)
+                    result)
+                  (let [v (vec (.toArray a))]
+                    (.clear a)
+                    (let [ret (rf result v)]
+                      (when-not (reduced? ret)
+                        (.add a input))
+                      ret)))))))))
+  ([f coll]
+     (lazy-seq
+       (when-let [s (seq coll)]
+         (let [fst (first s)
+               fv (f fst)
+               run (cons fst (take-while #(= fv (f %)) (next s)))]
+           (cons run (partition-by f (seq (drop (count run) s)))))))))
+
+(defn frequencies
+  "Returns a map from distinct items in coll to the number of times
+  they appear."
+  [coll]
+  (persistent!
+   (reduce (fn [counts x]
+             (assoc! counts x (inc (get counts x 0))))
+           (transient {}) coll)))
+
+(defn reductions
+  "Returns a lazy seq of the intermediate values of the reduction (as
+  per reduce) of coll by f, starting with init."
+  ([f coll]
+   (lazy-seq
+     (if-let [s (seq coll)]
+       (reductions f (first s) (rest s))
+       (list (f)))))
+  ([f init coll]
+   (if (reduced? init)
+     (list @init)
+     (cons init
+       (lazy-seq
+         (when-let [s (seq coll)]
+           (reductions f (f init (first s)) (rest s))))))))
+
+(defn juxt
+  "Takes a set of functions and returns a fn that is the juxtaposition
+  of those fns.  The returned fn takes a variable number of args, and
+  returns a vector containing the result of applying each fn to the
+  args (left-to-right).
+  ((juxt a b c) x) => [(a x) (b x) (c x)]"
+  ([f]
+     (fn
+       ([] (vector (f)))
+       ([x] (vector (f x)))
+       ([x y] (vector (f x y)))
+       ([x y z] (vector (f x y z)))
+       ([x y z & args] (vector (apply f x y z args)))))
+  ([f g]
+     (fn
+       ([] (vector (f) (g)))
+       ([x] (vector (f x) (g x)))
+       ([x y] (vector (f x y) (g x y)))
+       ([x y z] (vector (f x y z) (g x y z)))
+       ([x y z & args] (vector (apply f x y z args) (apply g x y z args)))))
+  ([f g h]
+     (fn
+       ([] (vector (f) (g) (h)))
+       ([x] (vector (f x) (g x) (h x)))
+       ([x y] (vector (f x y) (g x y) (h x y)))
+       ([x y z] (vector (f x y z) (g x y z) (h x y z)))
+       ([x y z & args] (vector (apply f x y z args) (apply g x y z args) (apply h x y z args)))))
+  ([f g h & fs]
+     (let [fs (list* f g h fs)]
+       (fn
+         ([] (reduce #(conj %1 (%2)) [] fs))
+         ([x] (reduce #(conj %1 (%2 x)) [] fs))
+         ([x y] (reduce #(conj %1 (%2 x y)) [] fs))
+         ([x y z] (reduce #(conj %1 (%2 x y z)) [] fs))
+         ([x y z & args] (reduce #(conj %1 (apply %2 x y z args)) [] fs))))))
+
+(defn dorun
+  "When lazy sequences are produced via functions that have side
+  effects, any effects other than those needed to produce the first
+  element in the seq do not occur until the seq is consumed. dorun can
+  be used to force any effects. Walks through the successive nexts of
+  the seq, does not retain the head and returns nil."
+  ([coll]
+   (when-let [s (seq coll)]
+     (recur (next s))))
+  ([n coll]
+   (when (and (seq coll) (pos? n))
+     (recur (dec n) (next coll)))))
+
+(defn doall
+  "When lazy sequences are produced via functions that have side
+  effects, any effects other than those needed to produce the first
+  element in the seq do not occur until the seq is consumed. doall can
+  be used to force any effects. Walks through the successive nexts of
+  the seq, retains the head and returns it, thus causing the entire
+  seq to reside in memory at one time."
+  ([coll]
+   (dorun coll)
+   coll)
+  ([n coll]
+   (dorun n coll)
+   coll))
+
+;;;;;;;;;;;;;;;;;;;;;;;;; Regular Expressions ;;;;;;;;;;
+
+(defn ^boolean regexp?
+  "Returns true if x is a JavaScript RegExp instance."
+  [x]
+  (instance? js/RegExp x))
+
+(defn re-matches
+  "Returns the result of (re-find re s) if re fully matches s."
+  [re s]
+  (if (string? s)
+    (let [matches (.exec re s)]
+      (when (= (first matches) s)
+        (if (== (count matches) 1)
+          (first matches)
+          (vec matches))))
+    (throw (js/TypeError. "re-matches must match against a string."))))
+
+
+(defn re-find
+  "Returns the first regex match, if any, of s to re, using
+  re.exec(s). Returns a vector, containing first the matching
+  substring, then any capturing groups if the regular expression contains
+  capturing groups."
+  [re s]
+  (if (string? s)
+    (let [matches (.exec re s)]
+      (when-not (nil? matches)
+        (if (== (count matches) 1)
+          (first matches)
+          (vec matches))))
+    (throw (js/TypeError. "re-find must match against a string."))))
+
+(defn re-seq
+  "Returns a lazy sequence of successive matches of re in s."
+  [re s]
+  (let [match-data (re-find re s)
+        match-idx (.search s re)
+        match-str (if (coll? match-data) (first match-data) match-data)
+        post-idx (+ match-idx (max 1 (count match-str)))
+        post-match (subs s post-idx)]
+    (when match-data (lazy-seq (cons match-data (when (<= post-idx (count s)) (re-seq re post-match)))))))
+
+(defn re-pattern
+  "Returns an instance of RegExp which has compiled the provided string."
+  [s]
+  (if (instance? js/RegExp s)
+    s
+    (let [[prefix flags] (re-find #"^\(\?([idmsux]*)\)" s)
+          pattern (subs s (count prefix))]
+      (js/RegExp. pattern (or flags "")))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Printing ;;;;;;;;;;;;;;;;
+
+(defn pr-sequential-writer [writer print-one begin sep end opts coll]
+  (binding [*print-level* (when-not (nil? *print-level*) (dec *print-level*))]
+    (if (and (not (nil? *print-level*)) (neg? *print-level*))
+      (-write writer "#")
+      (do
+        (-write writer begin)
+        (if (zero? (:print-length opts))
+          (when (seq coll)
+            (-write writer (or (:more-marker opts) "...")))
+          (do
+            (when (seq coll)
+              (print-one (first coll) writer opts))
+            (loop [coll (next coll) n (dec (:print-length opts))]
+              (if (and coll (or (nil? n) (not (zero? n))))
+                (do
+                  (-write writer sep)
+                  (print-one (first coll) writer opts)
+                  (recur (next coll) (dec n)))
+                (when (and (seq coll) (zero? n))
+                  (-write writer sep)
+                  (-write writer (or (:more-marker opts) "...")))))))
+        (-write writer end)))))
+
+(defn write-all [writer & ss]
+  (doseq [s ss]
+    (-write writer s)))
+
+(defn string-print [x]
+  (when (nil? *print-fn*)
+    (throw (js/Error. "No *print-fn* fn set for evaluation environment")))
+  (*print-fn* x)
+  nil)
+
+(defn flush [] ;stub
+  nil)
+
+(def ^:private char-escapes
+  (js-obj
+    "\"" "\\\""
+    "\\" "\\\\"
+    "\b" "\\b"
+    "\f" "\\f"
+    "\n" "\\n"
+    "\r" "\\r"
+    "\t" "\\t"))
+
+(defn ^:private quote-string
+  [s]
+  (str \"
+       (.replace s (js/RegExp "[\\\\\"\b\f\n\r\t]" "g")
+         (fn [match] (unchecked-get char-escapes match)))
+       \"))
+
+(declare print-map)
+
+(defn ^boolean print-meta? [opts obj]
+  (and (boolean (get opts :meta))
+       (implements? IMeta obj)
+       (not (nil? (meta obj)))))
+
+(defn- pr-writer-impl
+  [obj writer opts]
+  (cond
+    (nil? obj) (-write writer "nil")
+    :else
+    (do
+      (when (print-meta? opts obj)
+        (-write writer "^")
+        (pr-writer (meta obj) writer opts)
+        (-write writer " "))
+      (cond
+        ;; handle CLJS ctors
+        ^boolean (.-cljs$lang$type obj)
+        (.cljs$lang$ctorPrWriter obj obj writer opts)
+
+        ; Use the new, more efficient, IPrintWithWriter interface when possible.
+        (implements? IPrintWithWriter obj)
+        (-pr-writer ^not-native obj writer opts)
+
+        (or (true? obj) (false? obj))
+        (-write writer (str obj))
+
+        (number? obj)
+        (-write writer
+          (cond
+            ^boolean (js/isNaN obj) "##NaN"
+            (identical? obj js/Number.POSITIVE_INFINITY) "##Inf"
+            (identical? obj js/Number.NEGATIVE_INFINITY) "##-Inf"
+            :else (str obj)))
+
+        (object? obj)
+        (do
+          (-write writer "#js ")
+          (print-map
+            (map (fn [k]
+                   (MapEntry. (cond-> k (some? (re-matches #"[A-Za-z_\*\+\?!\-'][\w\*\+\?!\-']*" k)) keyword) (unchecked-get obj k) nil))
+              (js-keys obj))
+            pr-writer writer opts))
+
+        (array? obj)
+        (pr-sequential-writer writer pr-writer "#js [" " " "]" opts obj)
+
+        ^boolean (goog/isString obj)
+        (if (:readably opts)
+          (-write writer (quote-string obj))
+          (-write writer obj))
+
+        ^boolean (goog/isFunction obj)
+        (let [name (.-name obj)
+              name (if (or (nil? name) (gstring/isEmpty name))
+                     "Function"
+                     name)]
+          (write-all writer "#object[" name
+            (if *print-fn-bodies*
+              (str " \"" (str obj) "\"")
+              "")
+            "]"))
+
+        (instance? js/Date obj)
+        (let [normalize (fn [n len]
+                          (loop [ns (str n)]
+                            (if (< (count ns) len)
+                              (recur (str "0" ns))
+                              ns)))]
+          (write-all writer
+            "#inst \""
+            (str (.getUTCFullYear obj))             "-"
+            (normalize (inc (.getUTCMonth obj)) 2)  "-"
+            (normalize (.getUTCDate obj) 2)         "T"
+            (normalize (.getUTCHours obj) 2)        ":"
+            (normalize (.getUTCMinutes obj) 2)      ":"
+            (normalize (.getUTCSeconds obj) 2)      "."
+            (normalize (.getUTCMilliseconds obj) 3) "-"
+            "00:00\""))
+
+        (regexp? obj) (write-all writer "#\"" (.-source obj) "\"")
+
+        :else
+        (if (some-> obj .-constructor .-cljs$lang$ctorStr)
+          (write-all writer
+            "#object[" (.replace (.. obj -constructor -cljs$lang$ctorStr)
+                         (js/RegExp. "/" "g") ".") "]")
+          (let [name (some-> obj .-constructor .-name)
+                name (if (or (nil? name) (gstring/isEmpty name))
+                       "Object"
+                       name)]
+            (if (nil? (. obj -constructor))
+              (write-all writer "#object[" name "]")
+              (write-all writer "#object[" name " " (str obj) "]"))))))))
+
+(defn- pr-writer
+  "Prefer this to pr-seq, because it makes the printing function
+   configurable, allowing efficient implementations such as appending
+   to a StringBuffer."
+  [obj writer opts]
+  (if-let [alt-impl (:alt-impl opts)]
+    (alt-impl obj writer (assoc opts :fallback-impl pr-writer-impl))
+    (pr-writer-impl obj writer opts)))
+
+(defn pr-seq-writer [objs writer opts]
+  (pr-writer (first objs) writer opts)
+  (doseq [obj (next objs)]
+    (-write writer " ")
+    (pr-writer obj writer opts)))
+
+(defn- pr-sb-with-opts [objs opts]
+  (let [sb (StringBuffer.)
+        writer (StringBufferWriter. sb)]
+    (pr-seq-writer objs writer opts)
+    (-flush writer)
+    sb))
+
+(defn pr-str-with-opts
+  "Prints a sequence of objects to a string, observing all the
+  options given in opts"
+  [objs opts]
+  (if (empty? objs)
+    ""
+    (str (pr-sb-with-opts objs opts))))
+
+(defn prn-str-with-opts
+  "Same as pr-str-with-opts followed by (newline)"
+  [objs opts]
+  (if (empty? objs)
+    "\n"
+    (let [sb (pr-sb-with-opts objs opts)]
+      (.append sb \newline)
+      (str sb))))
+
+(defn- pr-with-opts
+  "Prints a sequence of objects using string-print, observing all
+  the options given in opts"
+  [objs opts]
+  (string-print (pr-str-with-opts objs opts)))
+
+(defn newline
+  "Prints a newline using *print-fn*"
+  ([] (newline nil))
+  ([opts]
+   (string-print "\n")
+   (when (get opts :flush-on-newline)
+     (flush))))
+
+(defn pr-str
+  "pr to a string, returning it. Fundamental entrypoint to IPrintWithWriter."
+  [& objs]
+  (pr-str-with-opts objs (pr-opts)))
+
+(defn prn-str
+  "Same as pr-str followed by (newline)"
+  [& objs]
+  (prn-str-with-opts objs (pr-opts)))
+
+(defn pr
+  "Prints the object(s) using string-print.  Prints the
+  object(s), separated by spaces if there is more than one.
+  By default, pr and prn print in a way that objects can be
+  read by the reader"
+  [& objs]
+  (pr-with-opts objs (pr-opts)))
+
+(def ^{:doc
+  "Prints the object(s) using string-print.
+  print and println produce output for human consumption."}
+  print
+  (fn cljs-core-print [& objs]
+    (pr-with-opts objs (assoc (pr-opts) :readably false))))
+
+(defn print-str
+  "print to a string, returning it"
+  [& objs]
+  (pr-str-with-opts objs (assoc (pr-opts) :readably false)))
+
+(defn println
+  "Same as print followed by (newline)"
+  [& objs]
+  (pr-with-opts objs (assoc (pr-opts) :readably false))
+  (when *print-newline*
+    (newline (pr-opts))))
+
+(defn println-str
+  "println to a string, returning it"
+  [& objs]
+  (prn-str-with-opts objs (assoc (pr-opts) :readably false)))
+
+(defn prn
+  "Same as pr followed by (newline)."
+  [& objs]
+  (pr-with-opts objs (pr-opts))
+  (when *print-newline*
+    (newline (pr-opts))))
+
+(defn- strip-ns
+  [named]
+  (if (symbol? named)
+    (symbol nil (name named))
+    (keyword nil (name named))))
+
+(defn- lift-ns
+  "Returns [lifted-ns lifted-map] or nil if m can't be lifted."
+  [m]
+  (when *print-namespace-maps*
+    (loop [ns nil
+           [[k v :as entry] & entries] (seq m)
+           lm (empty m)]
+      (if entry
+        (when (or (keyword? k) (symbol? k))
+          (if ns
+            (when (= ns (namespace k))
+              (recur ns entries (assoc lm (strip-ns k) v)))
+            (when-let [new-ns (namespace k)]
+              (recur new-ns entries (assoc lm (strip-ns k) v)))))
+        [ns lm]))))
+
+(defn print-prefix-map [prefix m print-one writer opts]
+  (pr-sequential-writer
+    writer
+    (fn [e w opts]
+      (do (print-one (key e) w opts)
+          (-write w \space)
+          (print-one (val e) w opts)))
+    (str prefix "{") ", " "}"
+    opts (seq m)))
+
+(defn print-map [m print-one writer opts]
+  (let [[ns lift-map] (when (map? m)
+                        (lift-ns m))]
+    (if ns
+      (print-prefix-map (str "#:" ns) lift-map print-one writer opts)
+      (print-prefix-map nil m print-one writer opts))))
+
+(extend-protocol IPrintWithWriter
+  LazySeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  TransformerIterator
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  IndexedSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  RSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  PersistentQueue
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "#queue [" " " "]" opts (seq coll)))
+
+  PersistentQueueSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  PersistentTreeMapSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  NodeSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  ArrayNodeSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  List
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  Cons
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  EmptyList
+  (-pr-writer [coll writer opts] (-write writer "()"))
+
+  PersistentVector
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "[" " " "]" opts coll))
+
+  ChunkedCons
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  ChunkedSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  Subvec
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "[" " " "]" opts coll))
+
+  BlackNode
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "[" " " "]" opts coll))
+
+  RedNode
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "[" " " "]" opts coll))
+
+  MapEntry
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "[" " " "]" opts coll))
+
+  ObjMap
+  (-pr-writer [coll writer opts]
+    (print-map coll pr-writer writer opts))
+
+  KeySeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  ValSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  PersistentArrayMapSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  PersistentArrayMap
+  (-pr-writer [coll writer opts]
+    (print-map coll pr-writer writer opts))
+
+  PersistentHashMap
+  (-pr-writer [coll writer opts]
+    (print-map coll pr-writer writer opts))
+
+  PersistentTreeMap
+  (-pr-writer [coll writer opts]
+    (print-map coll pr-writer writer opts))
+
+  PersistentHashSet
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "#{" " " "}" opts coll))
+
+  PersistentTreeSet
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "#{" " " "}" opts coll))
+
+  Range
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  Cycle
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  Repeat
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  Iterate
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  ES6IteratorSeq
+  (-pr-writer [coll writer opts] (pr-sequential-writer writer pr-writer "(" " " ")" opts coll))
+
+  Atom
+  (-pr-writer [a writer opts]
+    (-write writer "#object [cljs.core.Atom ")
+    (pr-writer {:val (.-state a)} writer opts)
+    (-write writer "]"))
+
+  Volatile
+  (-pr-writer [a writer opts]
+    (-write writer "#object [cljs.core.Volatile ")
+    (pr-writer {:val (.-state a)} writer opts)
+    (-write writer "]"))
+
+  Var
+  (-pr-writer [a writer opts]
+    (-write writer "#'")
+    (pr-writer (.-sym a) writer opts)))
+
+;; IComparable
+(extend-protocol IComparable
+  Symbol
+  (-compare [x y]
+    (if (symbol? y)
+      (compare-symbols x y)
+      (throw (js/Error. (str "Cannot compare " x " to " y)))))
+
+  Keyword
+  (-compare [x y]
+    (if (keyword? y)
+      (compare-keywords x y)
+      (throw (js/Error. (str "Cannot compare " x " to " y)))))
+
+  Subvec
+  (-compare [x y]
+    (if (vector? y)
+      (compare-indexed x y)
+      (throw (js/Error. (str "Cannot compare " x " to " y)))))
+  
+  PersistentVector
+  (-compare [x y]
+    (if (vector? y)
+      (compare-indexed x y)
+      (throw (js/Error. (str "Cannot compare " x " to " y)))))
+
+  MapEntry
+  (-compare [x y]
+    (if (vector? y)
+      (compare-indexed x y)
+      (throw (js/Error. (str "Cannot compare " x " to " y)))))
+
+  BlackNode
+  (-compare [x y]
+    (if (vector? y)
+      (compare-indexed x y)
+      (throw (js/Error. (str "Cannot compare " x " to " y)))))
+
+  RedNode
+  (-compare [x y]
+    (if (vector? y)
+      (compare-indexed x y)
+      (throw (js/Error. (str "Cannot compare " x " to " y))))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Reference Types ;;;;;;;;;;;;;;;;
+
+(defn alter-meta!
+  "Atomically sets the metadata for a namespace/var/ref/agent/atom to be:
+
+  (apply f its-current-meta args)
+
+  f must be free of side-effects"
+  [iref f & args]
+  (set! (.-meta iref) (apply f (.-meta iref) args)))
+
+(defn reset-meta!
+  "Atomically resets the metadata for an atom"
+  [iref m]
+  (set! (.-meta iref) m))
+
+(defn add-watch
+  "Adds a watch function to an atom reference. The watch fn must be a
+  fn of 4 args: a key, the reference, its old-state, its
+  new-state. Whenever the reference's state might have been changed,
+  any registered watches will have their functions called. The watch
+  fn will be called synchronously. Note that an atom's state
+  may have changed again prior to the fn call, so use old/new-state
+  rather than derefing the reference. Keys must be unique per
+  reference, and can be used to remove the watch with remove-watch,
+  but are otherwise considered opaque by the watch mechanism.  Bear in
+  mind that regardless of the result or action of the watch fns the
+  atom's value will change.  Example:
+
+      (def a (atom 0))
+      (add-watch a :inc (fn [k r o n] (assert (== 0 n))))
+      (swap! a inc)
+      ;; Assertion Error
+      (deref a)
+      ;=> 1"
+  [iref key f]
+  (-add-watch iref key f)
+  iref)
+
+(defn remove-watch
+  "Removes a watch (set by add-watch) from a reference"
+  [iref key]
+  (-remove-watch iref key)
+  iref)
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; gensym ;;;;;;;;;;;;;;;;
+;; Internal - do not use!
+(def
+  ^{:jsdoc ["@type {*}"]}
+  gensym_counter nil)
+
+(defn gensym
+  "Returns a new symbol with a unique name. If a prefix string is
+  supplied, the name is prefix# where # is some unique number. If
+  prefix is not supplied, the prefix is 'G__'."
+  ([] (gensym "G__"))
+  ([prefix-string]
+     (when (nil? gensym_counter)
+       (set! gensym_counter (atom 0)))
+     (symbol (str prefix-string (swap! gensym_counter inc)))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Delay ;;;;;;;;;;;;;;;;;;;;
+
+(deftype Delay [^:mutable f ^:mutable value]
+  IDeref
+  (-deref [_]
+    (when f
+      (set! value (f))
+      (set! f nil))
+    value)
+
+  IPending
+  (-realized? [x]
+    (not f)))
+
+(defn ^boolean delay?
+  "returns true if x is a Delay created with delay"
+  [x] (instance? Delay x))
+
+(defn force
+  "If x is a Delay, returns the (possibly cached) value of its expression, else returns x"
+  [x]
+  (if (delay? x)
+    (deref x)
+    x))
+
+(defn ^boolean realized?
+  "Returns true if a value has been produced for a delay or lazy sequence."
+  [x]
+  (-realized? x))
+
+(defn- preserving-reduced
+  [rf]
+  #(let [ret (rf %1 %2)]
+     (if (reduced? ret)
+       (reduced ret)
+       ret)))
+
+(defn cat
+  "A transducer which concatenates the contents of each input, which must be a
+  collection, into the reduction."
+  {:added "1.7"}
+  [rf]
+  (let [rf1 (preserving-reduced rf)]
+    (fn
+      ([] (rf))
+      ([result] (rf result))
+      ([result input]
+         (reduce rf1 result input)))))
+
+(defn halt-when
+  "Returns a transducer that ends transduction when pred returns true
+  for an input. When retf is supplied it must be a fn of 2 arguments -
+  it will be passed the (completed) result so far and the input that
+  triggered the predicate, and its return value (if it does not throw
+  an exception) will be the return value of the transducer. If retf
+  is not supplied, the input that triggered the predicate will be
+  returned. If the predicate never returns true the transduction is
+  unaffected."
+  {:added "1.9"}
+  ([pred] (halt-when pred nil))
+  ([pred retf]
+     (fn [rf]
+       (fn
+         ([] (rf))
+         ([result]
+            (if (and (map? result) (contains? result ::halt))
+              (::halt result)
+              (rf result)))
+         ([result input]
+            (if (pred input)
+              (reduced {::halt (if retf (retf (rf result) input) input)})
+              (rf result input)))))))
+
+(defn dedupe
+  "Returns a lazy sequence removing consecutive duplicates in coll.
+  Returns a transducer when no collection is provided."
+  ([]
+   (fn [rf]
+     (let [pa (volatile! ::none)]
+       (fn
+         ([] (rf))
+         ([result] (rf result))
+         ([result input]
+            (let [prior @pa]
+              (vreset! pa input)
+              (if (= prior input)
+                result
+                (rf result input))))))))
+  ([coll] (sequence (dedupe) coll)))
+
+(declare rand)
+
+(defn random-sample
+  "Returns items from coll with random probability of prob (0.0 -
+  1.0).  Returns a transducer when no collection is provided."
+  ([prob]
+     (filter (fn [_] (< (rand) prob))))
+  ([prob coll]
+     (filter (fn [_] (< (rand) prob)) coll)))
+
+(deftype Eduction [xform coll]
+  Object
+  (indexOf [coll x]
+    (-indexOf coll x 0))
+  (indexOf [coll x start]
+    (-indexOf coll x start))
+  (lastIndexOf [coll x]
+    (-lastIndexOf coll x (count coll)))
+  (lastIndexOf [coll x start]
+    (-lastIndexOf coll x start))
+
+  ISequential
+
+  IIterable
+  (-iterator [_]
+    (.create TransformerIterator xform (iter coll)))
+
+  ISeqable
+  (-seq [_] (seq (sequence xform coll)))
+
+  IReduce
+  (-reduce [_ f] (transduce xform (completing f) coll))
+  (-reduce [_ f init] (transduce xform (completing f) init coll))
+
+  IPrintWithWriter
+  (-pr-writer [coll writer opts]
+    (pr-sequential-writer writer pr-writer "(" " " ")" opts coll)))
+
+(es6-iterable Eduction)
+
+(defn eduction
+  "Returns a reducible/iterable application of the transducers
+  to the items in coll. Transducers are applied in order as if
+  combined with comp. Note that these applications will be
+  performed every time reduce/iterator is called."
+  {:arglists '([xform* coll])}
+  [& xforms]
+  (Eduction. (apply comp (butlast xforms)) (last xforms)))
+
+(defn run!
+  "Runs the supplied procedure (via reduce), for purposes of side
+  effects, on successive items in the collection. Returns nil"
+  [proc coll]
+  (reduce #(proc %2) nil coll)
+  nil)
+
+(defprotocol IEncodeJS
+  (-clj->js [x] "Recursively transforms clj values to JavaScript")
+  (-key->js [x] "Transforms map keys to valid JavaScript keys. Arbitrary keys are
+  encoded to their string representation via (pr-str x)"))
+
+(declare clj->js)
+
+(defn key->js
+  ([k] (key->js k clj->js))
+  ([k primitive-fn]
+   (cond
+     (satisfies? IEncodeJS k) (-clj->js k)
+     (or (string? k)
+         (number? k)
+         (keyword? k)
+         (symbol? k)) (primitive-fn k)
+     :default (pr-str k))))
+
+(defn clj->js
+  "Recursively transforms ClojureScript values to JavaScript.
+  sets/vectors/lists become Arrays, Keywords and Symbol become Strings,
+  Maps become Objects. Arbitrary keys are encoded to by `key->js`.
+  Options is a key-value pair, where the only valid key is
+  :keyword-fn, which should point to a single-argument function to be
+  called on keyword keys. Default to `name`."
+  [x & {:keys [keyword-fn]
+        :or   {keyword-fn name}
+        :as options}]
+  (letfn [(keyfn [k] (key->js k thisfn))
+          (thisfn [x] (cond
+                        (nil? x) nil
+                        (satisfies? IEncodeJS x) (-clj->js x)
+                        (keyword? x) (keyword-fn x)
+                        (symbol? x) (str x)
+                        (map? x) (let [m (js-obj)]
+                                   (doseq [[k v] x]
+                                     (gobject/set m (keyfn k) (thisfn v)))
+                                   m)
+                        (coll? x) (let [arr (array)]
+                                    (doseq [x (map thisfn x)]
+                                      (.push arr x))
+                                    arr)
+                        :else x))]
+    (thisfn x)))
+
+
+(defprotocol IEncodeClojure
+  (-js->clj [x options] "Transforms JavaScript values to Clojure"))
+
+(defn js->clj
+  "Recursively transforms JavaScript arrays into ClojureScript
+  vectors, and JavaScript objects into ClojureScript maps.  With
+  option ':keywordize-keys true' will convert object fields from
+  strings to keywords."
+  ([x] (js->clj x :keywordize-keys false))
+  ([x & opts]
+    (let [{:keys [keywordize-keys]} opts
+          keyfn (if keywordize-keys keyword str)
+          f (fn thisfn [x]
+              (cond
+                (satisfies? IEncodeClojure x)
+                (-js->clj x (apply array-map opts))
+
+                (seq? x)
+                (doall (map thisfn x))
+
+                (map-entry? x)
+                (MapEntry. (thisfn (key x)) (thisfn (val x)) nil)
+
+                (coll? x)
+                (into (empty x) (map thisfn x))
+
+                (array? x)
+                (vec (map thisfn x))
+
+                (identical? (type x) js/Object)
+                (into {} (for [k (js-keys x)]
+                           [(keyfn k) (thisfn (unchecked-get x k))]))
+
+                :else x))]
+      (f x))))
+
+(defn memoize
+  "Returns a memoized version of a referentially transparent function. The
+  memoized version of the function keeps a cache of the mapping from arguments
+  to results and, when calls with the same arguments are repeated often, has
+  higher performance at the expense of higher memory use."
+  [f]
+  (let [mem (atom {})]
+    (fn [& args]
+      (let [v (get @mem args lookup-sentinel)]
+        (if (identical? v lookup-sentinel)
+          (let [ret (apply f args)]
+            (swap! mem assoc args ret)
+            ret)
+          v)))))
+
+(defn trampoline
+  "trampoline can be used to convert algorithms requiring mutual
+  recursion without stack consumption. Calls f with supplied args, if
+  any. If f returns a fn, calls that fn with no arguments, and
+  continues to repeat, until the return value is not a fn, then
+  returns that non-fn value. Note that if you want to return a fn as a
+  final value, you must wrap it in some data structure and unpack it
+  after trampoline returns."
+  ([f]
+     (let [ret (f)]
+       (if (fn? ret)
+         (recur ret)
+         ret)))
+  ([f & args]
+     (trampoline #(apply f args))))
+
+(defn rand
+  "Returns a random floating point number between 0 (inclusive) and
+  n (default 1) (exclusive)."
+  ([] (rand 1))
+  ([n] (* (Math/random) n)))
+
+(defn rand-int
+  "Returns a random integer between 0 (inclusive) and n (exclusive)."
+  [n] (Math/floor (* (Math/random) n)))
+
+(defn rand-nth
+  "Return a random element of the (sequential) collection. Will have
+  the same performance characteristics as nth for the given
+  collection."
+  [coll]
+  (nth coll (rand-int (count coll))))
+
+(defn group-by
+  "Returns a map of the elements of coll keyed by the result of
+  f on each element. The value at each key will be a vector of the
+  corresponding elements, in the order they appeared in coll."
+  [f coll]
+  (persistent!
+    (reduce
+      (fn [ret x]
+        (let [k (f x)]
+          (assoc! ret k (conj (get ret k []) x))))
+      (transient {}) coll)))
+
+(defn make-hierarchy
+  "Creates a hierarchy object for use with derive, isa? etc."
+  [] {:parents {} :descendants {} :ancestors {}})
+
+(def
+  ^{:private true
+    :jsdoc ["@type {*}"]}
+  -global-hierarchy nil)
+
+(defn- get-global-hierarchy []
+  (when (nil? -global-hierarchy)
+    (set! -global-hierarchy (atom (make-hierarchy))))
+  -global-hierarchy)
+
+(defn- swap-global-hierarchy! [f & args]
+  (apply swap! (get-global-hierarchy) f args))
+
+(defn ^boolean isa?
+  "Returns true if (= child parent), or child is directly or indirectly derived from
+  parent, either via a JavaScript type inheritance relationship or a
+  relationship established via derive. h must be a hierarchy obtained
+  from make-hierarchy, if not supplied defaults to the global
+  hierarchy"
+  ([child parent] (isa? @(get-global-hierarchy) child parent))
+  ([h child parent]
+     (or (= child parent)
+         ;; (and (class? parent) (class? child)
+         ;;    (. ^Class parent isAssignableFrom child))
+         (contains? ((:ancestors h) child) parent)
+         ;;(and (class? child) (some #(contains? ((:ancestors h) %) parent) (supers child)))
+         (and (vector? parent) (vector? child)
+              (== (count parent) (count child))
+              (loop [ret true i 0]
+                (if (or (not ret) (== i (count parent)))
+                  ret
+                  (recur (isa? h (child i) (parent i)) (inc i))))))))
+
+(defn parents
+  "Returns the immediate parents of tag, either via a JavaScript type
+  inheritance relationship or a relationship established via derive. h
+  must be a hierarchy obtained from make-hierarchy, if not supplied
+  defaults to the global hierarchy"
+  ([tag] (parents @(get-global-hierarchy) tag))
+  ([h tag] (not-empty (get (:parents h) tag))))
+
+(defn ancestors
+  "Returns the immediate and indirect parents of tag, either via a JavaScript type
+  inheritance relationship or a relationship established via derive. h
+  must be a hierarchy obtained from make-hierarchy, if not supplied
+  defaults to the global hierarchy"
+  ([tag] (ancestors @(get-global-hierarchy) tag))
+  ([h tag] (not-empty (get (:ancestors h) tag))))
+
+(defn descendants
+  "Returns the immediate and indirect children of tag, through a
+  relationship established via derive. h must be a hierarchy obtained
+  from make-hierarchy, if not supplied defaults to the global
+  hierarchy. Note: does not work on JavaScript type inheritance
+  relationships."
+  ([tag] (descendants @(get-global-hierarchy) tag))
+  ([h tag] (not-empty (get (:descendants h) tag))))
+
+(defn derive
+  "Establishes a parent/child relationship between parent and
+  tag. Parent must be a namespace-qualified symbol or keyword and
+  child can be either a namespace-qualified symbol or keyword or a
+  class. h must be a hierarchy obtained from make-hierarchy, if not
+  supplied defaults to, and modifies, the global hierarchy."
+  ([tag parent]
+   (assert (namespace parent))
+   ;; (assert (or (class? tag) (and (instance? cljs.core.Named tag) (namespace tag))))
+   (swap-global-hierarchy! derive tag parent) nil)
+  ([h tag parent]
+   (assert (not= tag parent))
+   ;; (assert (or (class? tag) (instance? clojure.lang.Named tag)))
+   ;; (assert (instance? clojure.lang.INamed tag))
+   ;; (assert (instance? clojure.lang.INamed parent))
+   (let [tp (:parents h)
+         td (:descendants h)
+         ta (:ancestors h)
+         tf (fn [m source sources target targets]
+              (reduce (fn [ret k]
+                        (assoc ret k
+                               (reduce conj (get targets k #{}) (cons target (targets target)))))
+                      m (cons source (sources source))))]
+     (or
+      (when-not (contains? (tp tag) parent)
+        (when (contains? (ta tag) parent)
+          (throw (js/Error. (str tag "already has" parent "as ancestor"))))
+        (when (contains? (ta parent) tag)
+          (throw (js/Error. (str "Cyclic derivation:" parent "has" tag "as ancestor"))))
+        {:parents (assoc (:parents h) tag (conj (get tp tag #{}) parent))
+         :ancestors (tf (:ancestors h) tag td parent ta)
+         :descendants (tf (:descendants h) parent ta tag td)})
+      h))))
+
+(defn underive
+  "Removes a parent/child relationship between parent and
+  tag. h must be a hierarchy obtained from make-hierarchy, if not
+  supplied defaults to, and modifies, the global hierarchy."
+  ([tag parent]
+    (swap-global-hierarchy! underive tag parent)
+    nil)
+  ([h tag parent]
+    (let [parentMap (:parents h)
+          childsParents (if (parentMap tag)
+                          (disj (parentMap tag) parent) #{})
+          newParents (if (not-empty childsParents)
+                      (assoc parentMap tag childsParents)
+                      (dissoc parentMap tag))
+          deriv-seq (flatten (map #(cons (first %) (interpose (first %) (second %)))
+                                  (seq newParents)))]
+      (if (contains? (parentMap tag) parent)
+        (reduce #(apply derive %1 %2) (make-hierarchy)
+                (partition 2 deriv-seq))
+        h))))
+
+(defn- reset-cache
+  [method-cache method-table cached-hierarchy hierarchy]
+  (swap! method-cache (fn [_] (deref method-table)))
+  (swap! cached-hierarchy (fn [_] (deref hierarchy))))
+
+(defn- prefers*
+  [x y prefer-table]
+  (let [xprefs (@prefer-table x)]
+    (or
+     (when (and xprefs (xprefs y))
+       true)
+     (loop [ps (parents y)]
+       (when (pos? (count ps))
+         (when (prefers* x (first ps) prefer-table)
+           true)
+         (recur (rest ps))))
+     (loop [ps (parents x)]
+       (when (pos? (count ps))
+         (when (prefers* (first ps) y prefer-table)
+           true)
+         (recur (rest ps))))
+     false)))
+
+(defn- dominates
+  [x y prefer-table hierarchy]
+  (or (prefers* x y prefer-table) (isa? hierarchy x y)))
+
+(defn- find-and-cache-best-method
+  [name dispatch-val hierarchy method-table prefer-table method-cache cached-hierarchy default-dispatch-val]
+  (let [best-entry (reduce (fn [be [k _ :as e]]
+                             (if (isa? @hierarchy dispatch-val k)
+                               (let [be2 (if (or (nil? be) (dominates k (first be) prefer-table @hierarchy))
+                                           e
+                                           be)]
+                                 (when-not (dominates (first be2) k prefer-table @hierarchy)
+                                   (throw (js/Error.
+                                            (str "Multiple methods in multimethod '" name
+                                              "' match dispatch value: " dispatch-val " -> " k
+                                              " and " (first be2) ", and neither is preferred"))))
+                                 be2)
+                               be))
+                     nil @method-table)
+        best-entry (if-let [entry (and (nil? best-entry) (@method-table default-dispatch-val))]
+                     [default-dispatch-val entry]
+                     best-entry)]
+    (when best-entry
+      (if (= @cached-hierarchy @hierarchy)
+        (do
+          (swap! method-cache assoc dispatch-val (second best-entry))
+          (second best-entry))
+        (do
+          (reset-cache method-cache method-table cached-hierarchy hierarchy)
+          (find-and-cache-best-method name dispatch-val hierarchy method-table prefer-table
+            method-cache cached-hierarchy default-dispatch-val))))))
+
+(defprotocol IMultiFn
+  (-reset [mf])
+  (-add-method [mf dispatch-val method])
+  (-remove-method [mf dispatch-val])
+  (-prefer-method [mf dispatch-val dispatch-val-y])
+  (-get-method [mf dispatch-val])
+  (-methods [mf])
+  (-prefers [mf])
+  (-default-dispatch-val [mf])
+  (-dispatch-fn [mf]))
+
+(defn- throw-no-method-error [name dispatch-val]
+  (throw (js/Error. (str "No method in multimethod '" name "' for dispatch value: " dispatch-val))))
+
+(deftype MultiFn [name dispatch-fn default-dispatch-val hierarchy
+                  method-table prefer-table method-cache cached-hierarchy]
+  IFn
+  (-invoke [mf]
+    (let [dispatch-val (dispatch-fn)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn)))
+  (-invoke [mf a]
+    (let [dispatch-val (dispatch-fn a)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a)))
+  (-invoke [mf a b]
+    (let [dispatch-val (dispatch-fn a b)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b)))
+  (-invoke [mf a b c]
+    (let [dispatch-val (dispatch-fn a b c)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c)))
+  (-invoke [mf a b c d]
+    (let [dispatch-val (dispatch-fn a b c d)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d)))
+  (-invoke [mf a b c d e]
+    (let [dispatch-val (dispatch-fn a b c d e)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e)))
+  (-invoke [mf a b c d e f]
+    (let [dispatch-val (dispatch-fn a b c d e f)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f)))
+  (-invoke [mf a b c d e f g]
+    (let [dispatch-val (dispatch-fn a b c d e f g)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g)))
+  (-invoke [mf a b c d e f g h]
+    (let [dispatch-val (dispatch-fn a b c d e f g h)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h)))
+  (-invoke [mf a b c d e f g h i]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i)))
+  (-invoke [mf a b c d e f g h i j]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j)))
+  (-invoke [mf a b c d e f g h i j k]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k)))
+  (-invoke [mf a b c d e f g h i j k l]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l)))
+  (-invoke [mf a b c d e f g h i j k l m]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m)))
+  (-invoke [mf a b c d e f g h i j k l m n]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m n)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m n)))
+  (-invoke [mf a b c d e f g h i j k l m n o]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m n o)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m n o)))
+  (-invoke [mf a b c d e f g h i j k l m n o p]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m n o p)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m n o p)))
+  (-invoke [mf a b c d e f g h i j k l m n o p q]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m n o p q)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m n o p q)))
+  (-invoke [mf a b c d e f g h i j k l m n o p q r]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m n o p q r)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m n o p q r)))
+  (-invoke [mf a b c d e f g h i j k l m n o p q r s]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m n o p q r s)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m n o p q r s)))
+  (-invoke [mf a b c d e f g h i j k l m n o p q r s t]
+    (let [dispatch-val (dispatch-fn a b c d e f g h i j k l m n o p q r s t)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (target-fn a b c d e f g h i j k l m n o p q r s t)))
+  (-invoke [mf a b c d e f g h i j k l m n o p q r s t rest]
+    (let [dispatch-val (apply dispatch-fn a b c d e f g h i j k l m n o p q r s t rest)
+          target-fn (-get-method mf dispatch-val)]
+      (when-not target-fn
+        (throw-no-method-error name dispatch-val))
+      (apply target-fn a b c d e f g h i j k l m n o p q r s t rest)))
+
+  IMultiFn
+  (-reset [mf]
+    (swap! method-table (fn [mf] {}))
+    (swap! method-cache (fn [mf] {}))
+    (swap! prefer-table (fn [mf] {}))
+    (swap! cached-hierarchy (fn [mf] nil))
+    mf)
+
+  (-add-method [mf dispatch-val method]
+    (swap! method-table assoc dispatch-val method)
+    (reset-cache method-cache method-table cached-hierarchy hierarchy)
+    mf)
+
+  (-remove-method [mf dispatch-val]
+    (swap! method-table dissoc dispatch-val)
+    (reset-cache method-cache method-table cached-hierarchy hierarchy)
+    mf)
+
+  (-get-method [mf dispatch-val]
+    (when-not (= @cached-hierarchy @hierarchy)
+      (reset-cache method-cache method-table cached-hierarchy hierarchy))
+    (if-let [target-fn (@method-cache dispatch-val)]
+      target-fn
+      (find-and-cache-best-method name dispatch-val hierarchy method-table
+        prefer-table method-cache cached-hierarchy default-dispatch-val)))
+
+  (-prefer-method [mf dispatch-val-x dispatch-val-y]
+    (when (prefers* dispatch-val-x dispatch-val-y prefer-table)
+      (throw (js/Error. (str "Preference conflict in multimethod '" name "': " dispatch-val-y
+                   " is already preferred to " dispatch-val-x))))
+    (swap! prefer-table
+           (fn [old]
+             (assoc old dispatch-val-x
+                    (conj (get old dispatch-val-x #{})
+                          dispatch-val-y))))
+    (reset-cache method-cache method-table cached-hierarchy hierarchy))
+
+  (-methods [mf] @method-table)
+  (-prefers [mf] @prefer-table)
+  (-default-dispatch-val [mf] default-dispatch-val)
+  (-dispatch-fn [mf] dispatch-fn)
+
+  INamed
+  (-name [this] (-name name))
+  (-namespace [this] (-namespace name))
+
+  IHash
+  (-hash [this] (goog/getUid this)))
+
+(defn remove-all-methods
+  "Removes all of the methods of multimethod."
+ [multifn]
+ (-reset multifn))
+
+(defn remove-method
+  "Removes the method of multimethod associated with dispatch-value."
+ [multifn dispatch-val]
+ (-remove-method multifn dispatch-val))
+
+(defn prefer-method
+  "Causes the multimethod to prefer matches of dispatch-val-x over dispatch-val-y
+   when there is a conflict"
+  [multifn dispatch-val-x dispatch-val-y]
+  (-prefer-method multifn dispatch-val-x dispatch-val-y))
+
+(defn methods
+  "Given a multimethod, returns a map of dispatch values -> dispatch fns"
+  [multifn] (-methods multifn))
+
+(defn get-method
+  "Given a multimethod and a dispatch value, returns the dispatch fn
+  that would apply to that value, or nil if none apply and no default"
+  [multifn dispatch-val] (-get-method multifn dispatch-val))
+
+(defn prefers
+  "Given a multimethod, returns a map of preferred value -> set of other values"
+  [multifn] (-prefers multifn))
+
+(defn default-dispatch-val
+  "Given a multimethod, return it's default-dispatch-val."
+  [multifn] (-default-dispatch-val multifn))
+
+(defn dispatch-fn
+  "Given a multimethod, return it's dispatch-fn."
+  [multifn] (-dispatch-fn multifn))
+
+;; UUID
+(defprotocol IUUID "A marker protocol for UUIDs")
+
+(deftype UUID [uuid ^:mutable __hash]
+  IUUID
+
+  Object
+  (toString [_] uuid)
+  (equiv [this other]
+    (-equiv this other))
+
+  IEquiv
+  (-equiv [_ other]
+    (and (instance? UUID other) (identical? uuid (.-uuid other))))
+
+  IPrintWithWriter
+  (-pr-writer [_ writer _]
+    (-write writer (str "#uuid \"" uuid "\"")))
+
+  IHash
+  (-hash [this]
+    (when (nil? __hash)
+      (set! __hash (hash uuid)))
+    __hash)
+
+  IComparable
+  (-compare [_ other]
+    (garray/defaultCompare uuid (.-uuid other))))
+
+(defn uuid [s]
+  (assert (string? s))
+  (UUID. (.toLowerCase s) nil))
+
+(defn random-uuid []
+  (letfn [(hex [] (.toString (rand-int 16) 16))]
+    (let [rhex (.toString (bit-or 0x8 (bit-and 0x3 (rand-int 16))) 16)]
+      (uuid
+        (str (hex) (hex) (hex) (hex)
+             (hex) (hex) (hex) (hex) "-"
+             (hex) (hex) (hex) (hex) "-"
+             "4"   (hex) (hex) (hex) "-"
+             rhex  (hex) (hex) (hex) "-"
+             (hex) (hex) (hex) (hex)
+             (hex) (hex) (hex) (hex)
+             (hex) (hex) (hex) (hex))))))
+
+(defn ^boolean uuid?
+  [x] (implements? IUUID x))
+
+;;; ExceptionInfo
+
+(defn- pr-writer-ex-info [obj writer opts]
+  (-write writer "#error {:message ")
+  (pr-writer (.-message obj) writer opts)
+  (when (.-data obj)
+    (-write writer ", :data ")
+    (pr-writer (.-data obj) writer opts))
+  (when (.-cause obj)
+    (-write writer ", :cause ")
+    (pr-writer (.-cause obj) writer opts))
+  (-write writer "}"))
+
+(defn ^{:jsdoc ["@constructor"]}
+  ExceptionInfo [message data cause]
+  (let [e (js/Error. message)]
+    (this-as this
+      (set! (.-message this) message)
+      (set! (.-data this) data)
+      (set! (.-cause this) cause)
+      (do
+        (set! (.-name this) (.-name e))
+        ;; non-standard
+        (set! (.-description this) (.-description e))
+        (set! (.-number this) (.-number e))
+        (set! (.-fileName this) (.-fileName e))
+        (set! (.-lineNumber this) (.-lineNumber e))
+        (set! (.-columnNumber this) (.-columnNumber e))
+        (set! (.-stack this) (.-stack e)))
+      this)))
+
+(set! (.. ExceptionInfo -prototype -__proto__) js/Error.prototype)
+
+(extend-type ExceptionInfo
+  IPrintWithWriter
+  (-pr-writer [obj writer opts]
+    (pr-writer-ex-info obj writer opts)))
+
+(set! (.. ExceptionInfo -prototype -toString)
+  (fn []
+    (this-as this (pr-str* this))))
+
+(defn ex-info
+  "Create an instance of ExceptionInfo, an Error type that carries a
+  map of additional data."
+  ([msg data] (ex-info msg data nil))
+  ([msg data cause]
+    (ExceptionInfo. msg data cause)))
+
+(defn ex-data
+  "Returns exception data (a map) if ex is an ExceptionInfo.
+  Otherwise returns nil."
+  [ex]
+  (when (instance? ExceptionInfo ex)
+    (.-data ex)))
+
+(defn ex-message
+  "Returns the message attached to the given Error / ExceptionInfo object.
+  For non-Errors returns nil."
+  [ex]
+  (when (instance? js/Error ex)
+    (.-message ex)))
+
+(defn ex-cause
+  "Returns exception cause (an Error / ExceptionInfo) if ex is an
+  ExceptionInfo.
+  Otherwise returns nil."
+  [ex]
+  (when (instance? ExceptionInfo ex)
+    (.-cause ex)))
+
+(defn comparator
+  "Returns an JavaScript compatible comparator based upon pred."
+  [pred]
+  (fn [x y]
+    (cond (pred x y) -1 (pred y x) 1 :else 0)))
+
+(defn ^boolean special-symbol?
+  "Returns true if x names a special form"
+  [x]
+  (contains?
+    '#{if def fn* do let* loop* letfn* throw try catch finally
+       recur new set! ns deftype* defrecord* . js* & quote case* var ns*}
+    x))
+
+(defn test
+  "test [v] finds fn at key :test in var metadata and calls it,
+  presuming failure will throw exception"
+  [v]
+  (let [f (.-cljs$lang$test v)]
+    (if f
+      (do (f) :ok)
+      :no-test)))
+
+
+(deftype TaggedLiteral [tag form]
+  Object
+  (toString [coll]
+    (pr-str* coll))
+
+  IEquiv
+  (-equiv [this other]
+    (and (instance? TaggedLiteral other)
+         (= tag (.-tag other))
+         (= form (.-form other))))
+
+  IHash
+  (-hash [this]
+    (+ (* 31 (hash tag))
+       (hash form)))
+
+  ILookup
+  (-lookup [this v]
+    (-lookup this v nil))
+  (-lookup [this v not-found]
+    (case v
+      :tag tag
+      :form form
+      not-found))
+
+  IPrintWithWriter
+  (-pr-writer [o writer opts]
+    (-write writer (str "#" tag " "))
+    (pr-writer form writer opts)))
+
+(defn ^boolean tagged-literal?
+  "Return true if the value is the data representation of a tagged literal"
+  [value]
+  (instance? TaggedLiteral value))
+
+(defn tagged-literal
+  "Construct a data representation of a tagged literal from a
+  tag symbol and a form."
+  [tag form]
+  {:pre [(symbol? tag)]}
+  (TaggedLiteral. tag form))
+
+(def
+  ^{:private true
+    :jsdoc ["@type {*}"]}
+  js-reserved-arr
+  #js ["arguments" "abstract" "await" "boolean" "break" "byte" "case"
+       "catch" "char" "class" "const" "continue"
+       "debugger" "default" "delete" "do" "double"
+       "else" "enum" "export" "extends" "final"
+       "finally" "float" "for" "function" "goto" "if"
+       "implements" "import" "in" "instanceof" "int"
+       "interface" "let" "long" "native" "new"
+       "package" "private" "protected" "public"
+       "return" "short" "static" "super" "switch"
+       "synchronized" "this" "throw" "throws"
+       "transient" "try" "typeof" "var" "void"
+       "volatile" "while" "with" "yield" "methods"
+       "null" "constructor"])
+
+(def
+  ^{:jsdoc ["@type {null|Object}"]}
+  js-reserved nil)
+
+(defn- js-reserved? [x]
+  (when (nil? js-reserved)
+    (set! js-reserved
+      (reduce #(do (gobject/set %1 %2 true) %1)
+        #js {} js-reserved-arr)))
+  (.hasOwnProperty js-reserved x))
+
+(defn- demunge-pattern []
+  (when-not DEMUNGE_PATTERN
+    (set! DEMUNGE_PATTERN
+      (let [ks (sort (fn [a b] (- (. b -length) (. a -length)))
+                 (js-keys DEMUNGE_MAP))]
+        (loop [ks ks ret ""]
+          (if (seq ks)
+            (recur
+              (next ks)
+              (str
+                (cond-> ret
+                  (not (identical? ret "")) (str "|"))
+                (first ks)))
+            (str ret "|\\$"))))))
+  DEMUNGE_PATTERN)
+
+(defn- munge-str [name]
+  (let [sb (StringBuffer.)]
+    (loop [i 0]
+      (if (< i (. name -length))
+        (let [c (.charAt name i)
+              sub (gobject/get CHAR_MAP c)]
+          (if-not (nil? sub)
+            (.append sb sub)
+            (.append sb c))
+          (recur (inc i)))))
+    (.toString sb)))
+
+(defn munge [name]
+  (let [name' (munge-str (str name))
+        name' (cond
+                (identical? name' "..") "_DOT__DOT_"
+                (js-reserved? name') (str name' "$")
+                :else name')]
+    (if (symbol? name)
+      (symbol name')
+      name')))
+
+(defn- demunge-str [munged-name]
+  (let [r (js/RegExp. (demunge-pattern) "g")
+        munged-name (if (gstring/endsWith munged-name "$")
+                      (.substring munged-name 0 (dec (. munged-name -length)))
+                      munged-name)]
+    (loop [ret "" last-match-end 0]
+      (if-let [match (.exec r munged-name)]
+        (let [[x] match]
+          (recur
+            (str ret
+              (.substring munged-name last-match-end
+                (- (. r -lastIndex) (. x -length)))
+              (if (identical? x "$") "/" (gobject/get DEMUNGE_MAP x)))
+            (. r -lastIndex)))
+        (str ret
+          (.substring munged-name last-match-end (.-length munged-name)))))))
+
+(defn demunge [name]
+  ((if (symbol? name) symbol str)
+    (let [name' (str name)]
+      (if (identical? name' "_DOT__DOT_")
+        ".."
+        (demunge-str name')))))
+
+(defonce ^{:jsdoc ["@type {*}"] :private true}
+  tapset nil)
+
+(defn- maybe-init-tapset []
+  (when (nil? tapset)
+    (set! tapset (atom #{}))))
+
+(defn add-tap
+  "Adds f, a fn of one argument, to the tap set. This function will be called with
+  anything sent via tap>. Remember f in order to remove-tap"
+  [f]
+  (maybe-init-tapset)
+  (swap! tapset conj f)
+  nil)
+
+(defn remove-tap
+  "Remove f from the tap set."
+  [f]
+  (maybe-init-tapset)
+  (swap! tapset disj f)
+  nil)
+
+(defn ^boolean tap>
+  "Sends x to any taps. Returns the result of *exec-tap-fn*, a Boolean value."
+  [x]
+  (maybe-init-tapset)
+  (*exec-tap-fn*
+    (fn []
+      (doseq [tap @tapset]
+        (try
+          (tap x)
+          (catch js/Error ex))))))
+
+;; -----------------------------------------------------------------------------
+;; Bootstrap helpers - incompatible with advanced compilation
+
+(defn- ns-lookup
+  "Bootstrap only."
+  [ns-obj k]
+  (fn [] (gobject/get ns-obj k)))
+
+;; Bootstrap only
+(deftype Namespace [obj name]
+  Object
+  (findInternedVar [this sym]
+    (let [k (munge (str sym))]
+      (when ^boolean (gobject/containsKey obj k)
+        (let [var-sym (symbol (str name) (str sym))
+              var-meta {:ns this}]
+          (Var. (ns-lookup obj k) var-sym var-meta)))))
+  (getName [_] name)
+  (toString [_]
+    (str name))
+  IEquiv
+  (-equiv [_ other]
+    (if (instance? Namespace other)
+      (= name (.-name other))
+      false))
+  IHash
+  (-hash [_]
+    (hash name)))
+
+(def
+  ^{:doc "Bootstrap only." :jsdoc ["@type {*}"]}
+  NS_CACHE nil)
+
+(defn- find-ns-obj*
+  "Bootstrap only."
+  [ctxt xs]
+  (cond
+    (nil? ctxt) nil
+    (nil? xs) ctxt
+    :else (recur (gobject/get ctxt (first xs)) (next xs))))
+
+(defn find-ns-obj
+  "Bootstrap only."
+  [ns]
+  (let [munged-ns (munge (str ns))
+        segs (.split munged-ns ".")]
+    (case *target*
+      "nodejs"  (if ^boolean js/COMPILED
+                  ; Under simple optimizations on nodejs, namespaces will be in module
+                  ; rather than global scope and must be accessed by a direct call to eval.
+                  ; The first segment may refer to an undefined variable, so its evaluation
+                  ; may throw ReferenceError.
+                  (find-ns-obj*
+                    (try
+                      (let [ctxt (js/eval (first segs))]
+                        (when (and ctxt (object? ctxt))
+                          ctxt))
+                      (catch js/ReferenceError e
+                        nil))
+                    (next segs))
+                  (find-ns-obj* goog/global segs))
+      ("default" "webworker") (find-ns-obj* goog/global segs)
+      (throw (js/Error. (str "find-ns-obj not supported for target " *target*))))))
+
+(defn ns-interns*
+  "Returns a map of the intern mappings for the namespace.
+  Bootstrap only."
+  [sym]
+  (let [ns-obj (find-ns-obj sym)
+        ns     (Namespace. ns-obj sym)]
+    (letfn [(step [ret k]
+              (let [var-sym (symbol (demunge k))]
+                (assoc ret
+                  var-sym (Var. #(gobject/get ns-obj k)
+                            (symbol (str sym) (str var-sym)) {:ns ns}))))]
+      (reduce step {} (js-keys ns-obj)))))
+
+(defn create-ns
+  "Create a new namespace named by the symbol. Bootstrap only."
+  ([sym]
+   (create-ns sym (find-ns-obj sym)))
+  ([sym ns-obj]
+   (Namespace. ns-obj sym)))
+
+(defn find-ns
+  "Returns the namespace named by the symbol or nil if it doesn't exist.
+  Bootstrap only."
+  [ns]
+  (when (nil? NS_CACHE)
+    (set! NS_CACHE (atom {})))
+  (let [the-ns (get @NS_CACHE ns)]
+    (if-not (nil? the-ns)
+      the-ns
+      (let [ns-obj (find-ns-obj ns)]
+        (when-not (nil? ns-obj)
+          (let [new-ns (create-ns ns ns-obj)]
+            (swap! NS_CACHE assoc ns new-ns)
+            new-ns))))))
+
+(defn find-macros-ns
+  "Returns the macros namespace named by the symbol or nil if it doesn't exist.
+  Bootstrap only."
+  [ns]
+  (when (nil? NS_CACHE)
+    (set! NS_CACHE (atom {})))
+  (let [ns-str (str ns)
+        ns (if (not ^boolean (gstring/contains ns-str "$macros"))
+             (symbol (str ns-str "$macros"))
+             ns)
+        the-ns (get @NS_CACHE ns)]
+    (if-not (nil? the-ns)
+      the-ns
+      (let [ns-obj (find-ns-obj ns)]
+       (when-not (nil? ns-obj)
+         (let [new-ns (create-ns ns ns-obj)]
+           (swap! NS_CACHE assoc ns new-ns)
+           new-ns))))))
+
+(defn ns-name
+  "Returns the name of the namespace, a Namespace object.
+  Bootstrap only."
+  [ns-obj]
+  (.-name ns-obj))
+
+(defn uri?
+  "Returns true x is a goog.Uri instance."
+  {:added "1.9"}
+  [x]
+  (instance? goog.Uri x))
+
+(defn- maybe-enable-print! []
+  (cond
+    (exists? js/console)
+    (enable-console-print!)
+
+    (identical? *target* "nashorn")
+    (let [system (.type js/Java "java.lang.System")]
+      (set! *print-newline* false)
+      (set-print-fn!
+        (fn []
+          (let [xs (js-arguments)
+                s  (.join (garray/clone xs) "")]
+            (.println (.-out system) s))))
+      (set-print-err-fn!
+        (fn []
+          (let [xs (js-arguments)
+                s  (.join (garray/clone xs) "")]
+            (.println (.-error system) s)))))))
+
+(maybe-enable-print!)
+
+(defonce
+  ^{:doc "Runtime environments may provide a way to evaluate ClojureScript
+  forms. Whatever function *eval* is bound to will be passed any forms which
+  should be evaluated." :dynamic true}
+  *eval*
+  (fn [_]
+    (throw (js/Error. "cljs.core/*eval* not bound"))))
+
+(defn eval
+  "Evaluates the form data structure (not text!) and returns the result.
+  Delegates to cljs.core/*eval*. Intended for use in self-hosted ClojureScript,
+  which sets up an implementation of cljs.core/*eval* for that environment."
+  [form]
+  (*eval* form))
diff --git a/js/cljs/core.cljs.cache.json b/js/cljs/core.cljs.cache.json
new file mode 100644
index 0000000..8b89980
--- /dev/null
+++ b/js/cljs/core.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$console",["^ ","~$log",["^ ","~$apply",["^ "]],"~$error",["^ ","^5",["^ "]]],"~$ReferenceError",["^ "],"~$Error",["^ ","~$prototype",["^ ","~$name",["^ "],"~$description",["^ "],"~$number",["^ "],"~$fileName",["^ "],"~$lineNumber",["^ "],"~$columnNumber",["^ "],"~$stack",["^ "]]],"~$Object",["^ ","~$out",["^ ","~$println",["^ "]],"^6",["^ ","^C",["^ "]]],"~$isFinite",["^ "],"~$Symbol",["^ ","~$iterator",["^ "]],"~$Infinity",["^ "],"~$String",["^ ","~$fromCharCode",["^ "]],"~$eval",["^ "],"~$Array",["^ ","~$isArray",["^ "]],"~$parseInt",["^ "],"~$TypeError",["^ "],"~$isNaN",["^ "],"~$parseFloat",["^ "],"~$performance",["^ ","~$now",["^ "]],"~$process",["^ ","~$hrtime",["^ "]],"~$setTimeout",["^ "],"~$Number",["^ ","~$POSITIVE_INFINITY",["^ "],"~$NEGATIVE_INFINITY",["^ "],"~$MAX_VALUE",["^ "]],"~$RegExp",["^ ","^9",["^ ","~$exec",["^ "],"~$lastIndex",["^ "]]],"~$Date",["^ ","^9",["^ ","~$getTime",["^ "],"~$valueOf",["^ "]]],"~$Java",["^ ","~$type",["^ "]],"~$COMPILED",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$cljs.core","~:imports",["^ ","~$StringBuffer","~$goog.string.StringBuffer"],"~:requires",["^ ","~$gstring","~$goog.string","^1A","^1A","~$goog.Uri","^1B","~$garray","~$goog.array","~$goog.object","^1E","~$goog.math.Integer","^1F","^1=","^1>","~$gobject","^1E","^1D","^1D","~$goog.math.Long","^1H"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$->PersistentHashSet",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:protocols",["^19",["~$cljs.core/IEquiv","~$cljs.core/IHash","~$cljs.core/IFn","~$cljs.core/ICollection","~$cljs.core/IEditableCollection","~$cljs.core/Object","~$cljs.core/ISet","~$cljs.core/IEmptyableCollection","~$cljs.core/ICounted","~$cljs.core/ISeqable","~$cljs.core/IMeta","~$cljs.core/ICloneable","~$cljs.core/IIterable","~$cljs.core/IWithMeta","~$cljs.core/ILookup"]],"~:file","cljs/core.cljs","~:end-column",27,"~:column",10,"~:factory","~:positional","~:line",9042,"~:end-line",9042,"~:arglists",["~#list",["~$quote",["^2;",[["~$meta","~$hash-map","~$__hash"]]]]],"~:skip-protocol-flag",["^19",["^1P","^1Q","^1R","^1S","^1T","^1V","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^22"]],"~:doc","Positional factory function for cljs.core/PersistentHashSet."],"^1O",["^19",["^1P","^1Q","^1R","^1S","^1T","^1U","^1V","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^22"]],"^1:","~$cljs.core/->PersistentHashSet","~:variadic",false,"^23","cljs/core.cljs","^24",27,"~:method-params",["^2;",[["^2=","^2>","^2?"]]],"~:protocol-impl",null,"~:arglists-meta",["^2;",[null,null]],"^25",1,"^26","^27","^28",9042,"^29",9042,"~:max-fixed-arity",3,"~:fn-var",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^2>","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1R","^1S","^1T","^1V","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^22"]],"^2A","Positional factory function for cljs.core/PersistentHashSet."],"~$js->clj",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10564,"^25",7,"^29",10564,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$&","~$opts"]]]]],"^2A","Recursively transforms JavaScript arrays into ClojureScript\n  vectors, and JavaScript objects into ClojureScript maps.  With\n  option ':keywordize-keys true' will convert object fields from\n  strings to keywords.","~:top-fn",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$x"]]],"^2:",["^2;",[["~$x"],["~$x","~$&","^2J"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/js->clj","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$x"]]],"^2:",["^2;",[["~$x"],["~$x","~$&","^2J"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10564,"^29",10564,"^2G",1,"^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$&","^2J"]]],"^2A","Recursively transforms JavaScript arrays into ClojureScript\n  vectors, and JavaScript objects into ClojureScript maps.  With\n  option ':keywordize-keys true' will convert object fields from\n  strings to keywords."],"~$sort-by",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2428,"^25",7,"^29",2428,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$keyfn","~$coll"],["^2N","~$comp","^2O"]]]]],"^2A","Returns a sorted sequence of the items in coll, where the sort\n   order is determined by comparing (keyfn item).  Comp can be\n   boolean-valued comparison function, or a -/0/+ valued comparator.\n   Comp defaults to compare.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2N","^2O"],["^2N","^2P","^2O"]]],"^2:",["^2;",[["^2N","^2O"],["^2N","^2P","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/sort-by","^2C",false,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2N","^2O"],["^2N","^2P","^2O"]]],"^2:",["^2;",[["^2N","^2O"],["^2N","^2P","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2N","^2O"],["^2N","^2P","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2428,"^29",2428,"^2G",3,"^2H",true,"^2:",["^2;",[["^2N","^2O"],["^2N","^2P","^2O"]]],"^2A","Returns a sorted sequence of the items in coll, where the sort\n   order is determined by comparing (keyfn item).  Comp can be\n   boolean-valued comparison function, or a -/0/+ valued comparator.\n   Comp defaults to compare."],"~$ITransientAssociative",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",793,"^25",14,"^29",793,"^24",35,"^2A","Protocol for adding associativity to transient collections.","~:protocol-symbol",true,"~:jsdoc",["^2;",["@interface"]],"~:protocol-info",["^ ","~:methods",["^ ","~$-assoc!",[["~$tcoll","~$key","~$val"]]]]],"^2S",true,"^1:","~$cljs.core/ITransientAssociative","^23","cljs/core.cljs","^24",35,"^25",1,"^28",793,"^2U",["^ ","^2V",["^ ","^2W",[["^2X","^2Y","^2Z"]]]],"~:info",null,"^29",793,"~:tag","~$any","~:impls",["^19",["~$cljs.core/TransientVector","~$cljs.core/TransientHashMap","~$cljs.core/TransientArrayMap"]],"^2A","Protocol for adding associativity to transient collections.","^2T",["^2;",["@interface"]]],"~$chunk-first",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3596,"^25",7,"^29",3596,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"^1:","~$cljs.core/chunk-first","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3596,"^29",3596,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"~$print-meta?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9907,"^25",16,"^29",9907,"^24",27,"^31","~$boolean","^2:",["^2;",["^2<",["^2;",[["^2J","~$obj"]]]]]],"^1:","~$cljs.core/print-meta?","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^2J","^3;"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9907,"~:ret-tag","^3:","^29",9907,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2J","^3;"]]]]]],"~$m3-hash-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",929,"^25",15,"^29",929,"^24",26,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$in"]]]]]],"^1:","~$cljs.core/m3-hash-int","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["^3?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",929,"^3=","^<","^29",929,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3?"]]]]]],"~$pr-str*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",877,"^25",7,"^29",877,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^3;"]]]]],"^2A","Support so that collections can implement toString without\n   loading all the printing machinery."],"^1:","~$cljs.core/pr-str*","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^3;"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",877,"^29",877,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;"]]]]],"^2A","Support so that collections can implement toString without\n   loading all the printing machinery."],"~$eduction",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10499,"^25",7,"^29",10499,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$xform*","^2O"]]]]],"^2A","Returns a reducible/iterable application of the transducers\n  to the items in coll. Transducers are applied in order as if\n  combined with comp. Note that these applications will be\n  performed every time reduce/iterator is called.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["~$xforms"]]],"^2:",["^2;",[["~$&","^3E"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/eduction","^2C",true,"^23","cljs/core.cljs","^24",15,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^3E"]]],"^2:",["^2;",[["~$&","^3E"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^3E"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10499,"^29",10499,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^3E"]]],"^2A","Returns a reducible/iterable application of the transducers\n  to the items in coll. Transducers are applied in order as if\n  combined with comp. Note that these applications will be\n  performed every time reduce/iterator is called."],"~$tree-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5136,"^25",7,"^29",5136,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$branch?","~$children","~$root"]]]]],"^2A","Returns a lazy sequence of the nodes in a tree, via a depth-first walk.\n  branch? must be a fn of one arg that returns true if passed a node\n  that can have children (but may not).  children must be a fn of one\n  arg that returns a sequence of the children. Will only be called on\n  nodes for which branch? returns true. Root is the root node of the\n  tree."],"^1:","~$cljs.core/tree-seq","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^3H","^3I","^3J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5136,"^29",5136,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3H","^3I","^3J"]]]]],"^2A","Returns a lazy sequence of the nodes in a tree, via a depth-first walk.\n  branch? must be a fn of one arg that returns true if passed a node\n  that can have children (but may not).  children must be a fn of one\n  arg that returns a sequence of the children. Will only be called on\n  nodes for which branch? returns true. Root is the root node of the\n  tree."],"~$unchecked-remainder-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2755,"^25",7,"^29",2755,"^24",30,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]]],"^1:","~$cljs.core/unchecked-remainder-int","^2C",false,"^23","cljs/core.cljs","^24",30,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2755,"^29",2755,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]]],"~$uuid",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11094,"^25",7,"^29",11094,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"^1:","~$cljs.core/uuid","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11094,"^29",11094,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"~$seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1202,"^25",12,"^29",1202,"^24",15,"^31","^3P","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a seq on the collection. If the collection is\n  empty, returns nil.  (seq nil) returns nil. seq also works on\n  Strings."],"^1:","~$cljs.core/seq","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1202,"^3=","^3P","^29",1202,"^2G",1,"^31","^3P","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a seq on the collection. If the collection is\n  empty, returns nil.  (seq nil) returns nil. seq also works on\n  Strings."],"~$Volatile",["^ ","~:num-fields",1,"^1O",["^19",["~$cljs.core/IVolatile","~$cljs.core/IDeref"]],"^1:","~$cljs.core/Volatile","^23","cljs/core.cljs","^24",18,"~:type",true,"^25",10,"^28",4518,"~:record",false,"^29",4518,"^31","~$function","^2@",["^19",["^3U"]]],"~$reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2485,"^25",7,"^29",2485,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]]]],"^2A","f should be a function of 2 arguments. If val is not supplied,\n  returns the result of applying f to the first 2 items in coll, then\n  applying f to that result and the 3rd item, etc. If coll contains no\n  items, f must accept no arguments as well, and reduce returns the\n  result of calling f with no arguments.  If coll has only 1 item, it\n  is returned and f is not called.  If val is supplied, returns the\n  result of applying f to val and the first item in coll, then\n  applying f to that result and the 2nd item, etc. If coll contains no\n  items, returns val and f is not called.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/reduce","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2485,"^29",2485,"^2G",3,"^2H",true,"^2:",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2A","f should be a function of 2 arguments. If val is not supplied,\n  returns the result of applying f to the first 2 items in coll, then\n  applying f to that result and the 3rd item, etc. If coll contains no\n  items, f must accept no arguments as well, and reduce returns the\n  result of calling f with no arguments.  If coll has only 1 item, it\n  is returned and f is not called.  If val is supplied, returns the\n  result of applying f to val and the first item in coll, then\n  applying f to that result and the 2nd item, etc. If coll contains no\n  items, returns val and f is not called."],"~$IUUID",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",11066,"^25",14,"^29",11066,"^24",19,"^2A","A marker protocol for UUIDs","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ "]]],"^2S",true,"^1:","~$cljs.core/IUUID","^23","cljs/core.cljs","^24",19,"^25",1,"^28",11066,"^2U",["^ ","^2V",["^ "]],"^30",null,"^29",11066,"^31","^32","^33",["^19",["~$cljs.core/UUID"]],"^2A","A marker protocol for UUIDs","^2T",["^2;",["@interface"]]],"~$INIT",["^ ","^1:","~$cljs.core/INIT","^23","cljs/core.cljs","^28",3991,"^25",1,"^29",3991,"^24",10,"^1N",["^ ","^23","cljs/core.cljs","^28",3991,"^25",6,"^29",3991,"^24",10],"^31","~$object"],"~$find-ns",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11459,"^25",7,"^29",11459,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$ns"]]]]],"^2A","Returns the namespace named by the symbol or nil if it doesn't exist.\n  Bootstrap only."],"^1:","~$cljs.core/find-ns","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^47"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11459,"^29",11459,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^47"]]]]],"^2A","Returns the namespace named by the symbol or nil if it doesn't exist.\n  Bootstrap only."],"~$contains?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2317,"^25",16,"^29",2317,"^24",25,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["^2O","~$v"]]]]],"^2A","Returns true if key is present in the given collection, otherwise\n  returns false.  Note that for numerically indexed collections like\n  vectors and arrays, this tests if the numeric key is within the\n  range of indexes. 'contains?' operates constant or logarithmic time;\n  it will not perform a linear search for a value.  See also 'some'."],"^1:","~$cljs.core/contains?","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^2O","~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2317,"^3=","^3:","^29",2317,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$v"]]]]],"^2A","Returns true if key is present in the given collection, otherwise\n  returns false.  Note that for numerically indexed collections like\n  vectors and arrays, this tests if the numeric key is within the\n  range of indexes. 'contains?' operates constant or logarithmic time;\n  it will not perform a linear search for a value.  See also 'some'."],"~$every?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4178,"^25",16,"^29",4178,"^24",22,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$pred","^2O"]]]]],"^2A","Returns true if (pred x) is logical true for every x in coll, else\n  false."],"^1:","~$cljs.core/every?","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4178,"^3=","^3:","^29",4178,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns true if (pred x) is logical true for every x in coll, else\n  false."],"~$->ES6IteratorSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["~$cljs.core/ISeq","^1Y"]],"^23","cljs/core.cljs","^24",24,"^25",10,"^26","^27","^28",1293,"^29",1293,"^2:",["^2;",["^2<",["^2;",[["~$value","~$iter","~$_rest"]]]]],"^2@",["^19",["^4?","^1Y"]],"^2A","Positional factory function for cljs.core/ES6IteratorSeq."],"^1O",["^19",["^4?","^1Y"]],"^1:","~$cljs.core/->ES6IteratorSeq","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^4@","^4A","^4B"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",1293,"^29",1293,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4@","^4A","^4B"]]]]],"^2@",["^19",["^4?","^1Y"]],"^2A","Positional factory function for cljs.core/ES6IteratorSeq."],"~$Var",["^ ","^3S",3,"^1O",["^19",["^1P","^1Q","^1R","^1U","^1Z","~$cljs.core/Fn","^3U","^21"]],"^1:","~$cljs.core/Var","^23","cljs/core.cljs","^24",13,"^3W",true,"^25",10,"^28",1110,"^3X",false,"^29",1110,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1R","^1Z","^3U","^21"]]],"~$keep-indexed",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4540,"^25",7,"^29",4540,"^24",19,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","^2O"]]]]],"^2A","Returns a lazy sequence of the non-nil results of (f index item). Note,\n  this means false return values will be included.  f must be free of\n  side-effects.  Returns a stateful transducer when no collection is\n  provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/keep-indexed","^2C",false,"^23","cljs/core.cljs","^24",19,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4540,"^29",4540,"^2G",2,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2A","Returns a lazy sequence of the non-nil results of (f index item). Note,\n  this means false return values will be included.  f must be free of\n  side-effects.  Returns a stateful transducer when no collection is\n  provided."],"~$->PersistentQueueSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","~$cljs.core/INext","^1Y","^1Z","~$cljs.core/ISequential","^21"]],"^23","cljs/core.cljs","^24",28,"^25",10,"^26","^27","^28",6121,"^29",6121,"^2:",["^2;",["^2<",["^2;",[["^2=","~$front","~$rear","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21"]],"^2A","Positional factory function for cljs.core/PersistentQueueSeq."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21"]],"^1:","~$cljs.core/->PersistentQueueSeq","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["^2=","^4L","^4M","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6121,"^29",6121,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^4L","^4M","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21"]],"^2A","Positional factory function for cljs.core/PersistentQueueSeq."],"~$subs",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2951,"^25",7,"^29",2951,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$s","~$start"],["~$s","^4P","~$end"]]]]],"^2A","Returns the substring of s beginning at start inclusive, and ending\n  at end (defaults to length of string), exclusive.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$s","^4P"],["~$s","^4P","^4Q"]]],"^2:",["^2;",[["~$s","^4P"],["~$s","^4P","^4Q"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/subs","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$s","^4P"],["~$s","^4P","^4Q"]]],"^2:",["^2;",[["~$s","^4P"],["~$s","^4P","^4Q"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$s","^4P"],["~$s","^4P","^4Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2951,"^29",2951,"^2G",3,"^2H",true,"^2:",["^2;",[["~$s","^4P"],["~$s","^4P","^4Q"]]],"^2A","Returns the substring of s beginning at start inclusive, and ending\n  at end (defaults to length of string), exclusive."],"~$IFind",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",634,"^25",14,"^29",634,"^24",19,"^2A","Protocol for implementing entry finding in collections.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-find",[["^2O","~$k"]]]]],"^2S",true,"^1:","~$cljs.core/IFind","^23","cljs/core.cljs","^24",19,"^25",1,"^28",634,"^2U",["^ ","^2V",["^ ","^4T",[["^2O","~$k"]]]],"^30",null,"^29",634,"^31","^32","^33",["^19",["~$cljs.core/PersistentHashMap","~$cljs.core/ObjMap","~$cljs.core/PersistentArrayMap","~$cljs.core/BlackNode","~$cljs.core/MapEntry","~$cljs.core/Subvec","~$cljs.core/PersistentVector","~$cljs.core/PersistentTreeMap","~$cljs.core/RedNode"]],"^2A","Protocol for implementing entry finding in collections.","^2T",["^2;",["@interface"]]],"~$set",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9304,"^25",7,"^29",9304,"^24",10,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a set of the distinct elements of coll."],"^1:","~$cljs.core/set","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9304,"^29",9304,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a set of the distinct elements of coll."],"~$MODULE_URIS",["^ ","^1:","~$cljs.core/MODULE_URIS","^23","cljs/core.cljs","^28",39,"^25",1,"^29",39,"^24",17,"^1N",["^ ","^23","cljs/core.cljs","^28",39,"^25",6,"^29",39,"^24",17],"^31","~$clj-nil"],"~$compare-indexed",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2382,"^25",17,"^29",2382,"^24",32,"~:private",true,"^2:",["^2;",["^2<",["^2;",[["~$xs","~$ys"],["^5:","^5;","~$len","~$n"]]]]],"^2A","Compare indexed collection.","^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^5:","^5;"],["^5:","^5;","^5<","~$n"]]],"^2:",["^2;",[["^5:","^5;"],["^5:","^5;","^5<","~$n"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/compare-indexed","^2C",false,"^23","cljs/core.cljs","^24",32,"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^5:","^5;"],["^5:","^5;","^5<","~$n"]]],"^2:",["^2;",[["^5:","^5;"],["^5:","^5;","^5<","~$n"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^5:","^5;"],["^5:","^5;","^5<","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2382,"^29",2382,"^2G",4,"^2H",true,"^2:",["^2;",[["^5:","^5;"],["^5:","^5;","^5<","~$n"]]],"^2A","Compare indexed collection."],"~$take-last",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4758,"^25",7,"^29",4758,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$n","^2O"]]]]],"^2A","Returns a seq of the last n items in coll.  Depending on the type\n  of coll may be no better than linear time.  For vectors, see also subvec."],"^1:","~$cljs.core/take-last","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4758,"^29",4758,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","^2O"]]]]],"^2A","Returns a seq of the last n items in coll.  Depending on the type\n  of coll may be no better than linear time.  For vectors, see also subvec."],"~$IndexedSeq",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",1185,"^25",29,"^29",1185,"^24",39,"~:declared",true],"^3S",3,"^1O",["^19",["~$cljs.core/IIndexed","~$cljs.core/IReversible","^1P","^1Q","~$cljs.core/ASeq","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","~$cljs.core/IReduce"]],"^1:","~$cljs.core/IndexedSeq","^23","cljs/core.cljs","^24",20,"^3W",true,"^25",10,"^28",1568,"^3X",false,"^5A",true,"^29",1568,"^31","^3Y","^2@",["^19",["^5B","^5C","^1P","^1Q","^5D","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]]],"~$bit-set",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2866,"^25",7,"^29",2866,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Set bit at index n"],"^1:","~$cljs.core/bit-set","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2866,"^29",2866,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Set bit at index n"],"~$string-hash-cache-count",["^ ","^1:","~$cljs.core/string-hash-cache-count","^23","cljs/core.cljs","^28",956,"^25",1,"^29",956,"^24",29,"^1N",["^ ","^23","cljs/core.cljs","^28",956,"^25",6,"^29",956,"^24",29],"^31","^<"],"~$qualified-keyword?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3356,"^25",16,"^29",3356,"^24",34,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a keyword with a namespace"],"^1:","~$cljs.core/qualified-keyword?","^2C",false,"^23","cljs/core.cljs","^24",34,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3356,"^3=","^3:","^29",3356,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a keyword with a namespace"],"~$->Eduction",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U","^1Y","~$cljs.core/IPrintWithWriter","^20","^4K","^5E"]],"^23","cljs/core.cljs","^24",18,"^25",10,"^26","^27","^28",10469,"^29",10469,"^2:",["^2;",["^2<",["^2;",[["~$xform","^2O"]]]]],"^2@",["^19",["^1Y","^5N","^20","^4K","^5E"]],"^2A","Positional factory function for cljs.core/Eduction."],"^1O",["^19",["^1U","^1Y","^5N","^20","^4K","^5E"]],"^1:","~$cljs.core/->Eduction","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^5O","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",10469,"^29",10469,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^5O","^2O"]]]]],"^2@",["^19",["^1Y","^5N","^20","^4K","^5E"]],"^2A","Positional factory function for cljs.core/Eduction."],"~$tree-map-add",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8527,"^25",8,"^29",8527,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2P","~$tree","~$k","~$v","~$found"]]]]]],"^59",true,"^1:","~$cljs.core/tree-map-add","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^2P","^5R","~$k","~$v","^5S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8527,"^29",8527,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2P","^5R","~$k","~$v","^5S"]]]]]],"~$->ES6SetEntriesIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",31,"^25",10,"^26","^27","^28",6464,"^29",6464,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ES6SetEntriesIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->ES6SetEntriesIterator","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6464,"^29",6464,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ES6SetEntriesIterator."],"~$-with-meta",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",686,"^25",9,"^29",686,"^24",19,"^31","~$clj","~:protocol","^21","^2A","Returns a new object with value of o and metadata meta added to it.","^2:",["^2;",["^2<",["^2;",[["~$o","^2="]]]]]],"^5Y","^21","^1:","~$cljs.core/-with-meta","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$o","^2="]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",684,"^3=","^5X","^29",686,"^2G",2,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o","^2="]]]]],"^2A","Returns a new object with value of o and metadata meta added to it."],"~$reset-cache",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10774,"^25",8,"^29",10774,"^24",19,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$method-cache","~$method-table","~$cached-hierarchy","~$hierarchy"]]]]]],"^59",true,"^1:","~$cljs.core/reset-cache","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^60","^61","^62","^63"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10774,"^29",10774,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^60","^61","^62","^63"]]]]]],"~$->PersistentArrayMapIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",36,"^25",10,"^26","^27","^28",6724,"^29",6724,"^2:",["^2;",["^2<",["^2;",[["~$arr","~$i","~$cnt"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/PersistentArrayMapIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->PersistentArrayMapIterator","^2C",false,"^23","cljs/core.cljs","^24",36,"^2D",["^2;",[["^66","~$i","^67"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6724,"^29",6724,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^67"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/PersistentArrayMapIterator."],"~$PersistentArrayMapIterator",["^ ","^3S",3,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/PersistentArrayMapIterator","^23","cljs/core.cljs","^24",36,"^3W",true,"^25",10,"^28",6724,"^3X",false,"^29",6724,"^31","^3Y","^2@",null],"~$butlast",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9382,"^25",7,"^29",9382,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Return a seq of all but the last item in coll, in linear time"],"^1:","~$cljs.core/butlast","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9382,"^29",9382,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Return a seq of all but the last item in coll, in linear time"],"~$tail-off",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5309,"^25",8,"^29",5309,"^24",16,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$pv"]]]]]],"^59",true,"^1:","~$cljs.core/tail-off","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^6>"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5309,"^29",5309,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6>"]]]]]],"~$unchecked-subtract-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2765,"^25",15,"^29",2765,"^24",37,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","~$more"]]]]],"^2A","If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/unchecked-subtract-int","^2C",true,"^23","cljs/core.cljs","^24",37,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2765,"^3=","^<","^29",2765,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result."],"~$-iterator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",867,"^25",4,"^29",867,"^24",13,"^5Y","^20","^2A","Returns an iterator for coll.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^20","^1:","~$cljs.core/-iterator","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",865,"^29",867,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns an iterator for coll."],"~$*print-namespace-maps*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",138,"^25",3,"^29",138,"^24",25,"~:dynamic",true,"^2A","*print-namespace-maps* controls whether the printer will print\n  namespace map literal syntax.\n\n  Defaults to false, but the REPL binds it to true."],"^1:","~$cljs.core/*print-namespace-maps*","^23","cljs/core.cljs","^24",25,"^25",1,"^6F",true,"^28",132,"^29",138,"^31","^3:","^2A","*print-namespace-maps* controls whether the printer will print\n  namespace map literal syntax.\n\n  Defaults to false, but the REPL binds it to true."],"~$take-nth",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9643,"^25",7,"^29",9643,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$n"],["~$n","^2O"]]]]],"^2A","Returns a lazy seq of every nth item in coll.  Returns a stateful\n  transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/take-nth","^2C",false,"^23","cljs/core.cljs","^24",15,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9643,"^29",9643,"^2G",2,"^2H",true,"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2A","Returns a lazy seq of every nth item in coll.  Returns a stateful\n  transducer when no collection is provided."],"~$first",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1225,"^25",7,"^29",1225,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the first item in the collection. Calls seq on its\n  argument. If coll is nil, returns nil."],"^1:","~$cljs.core/first","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1225,"^29",1225,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the first item in the collection. Calls seq on its\n  argument. If coll is nil, returns nil."],"~$native-satisfies?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",280,"^25",16,"^29",280,"^24",33,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$p","~$x"]]]]],"^2A","Internal - do not use!"],"^1:","~$cljs.core/native-satisfies?","^2C",false,"^23","cljs/core.cljs","^24",33,"^2D",["^2;",[["~$p","~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",280,"^3=","^3:","^29",280,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$p","~$x"]]]]],"^2A","Internal - do not use!"],"~$seq?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2212,"^25",16,"^29",2212,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Return true if s satisfies ISeq"],"^1:","~$cljs.core/seq?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2212,"^3=","^3:","^29",2212,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Return true if s satisfies ISeq"],"~$-global-hierarchy",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",10664,"^25",3,"^29",10664,"^24",20,"^59",true,"^2T",["@type {*}"]],"^59",true,"^1:","~$cljs.core/-global-hierarchy","^23","cljs/core.cljs","^24",20,"^25",1,"^28",10661,"^29",10664,"^31","^57","^2T",["@type {*}"]],"~$UUID",["^ ","^3S",2,"^1O",["^19",["^1P","^1Q","^1U","^5N","~$cljs.core/IComparable","^41"]],"^1:","^42","^23","cljs/core.cljs","^24",14,"^3W",true,"^25",10,"^28",11068,"^3X",false,"^29",11068,"^31","^3Y","^2@",["^19",["^1P","^1Q","^5N","^6S"]]],"~$-sorted-seq-from",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",738,"^25",9,"^29",738,"^24",25,"^31","^5X","^5Y","~$cljs.core/ISorted","^2A","Returns a sorted seq from coll in either ascending or descending order.\n     If ascending is true, the result should contain all items which are > or >=\n     than k. If ascending is false, the result should contain all items which\n     are < or <= than k, e.g.\n     (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 true) => (3 4 5)\n     (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 false) => (3 2 1)","^2:",["^2;",["^2<",["^2;",[["^2O","~$k","~$ascending?"]]]]]],"^5Y","^6U","^1:","~$cljs.core/-sorted-seq-from","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^2O","~$k","^6V"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",733,"^3=","^5X","^29",738,"^2G",3,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$k","^6V"]]]]],"^2A","Returns a sorted seq from coll in either ascending or descending order.\n     If ascending is true, the result should contain all items which are > or >=\n     than k. If ascending is false, the result should contain all items which\n     are < or <= than k, e.g.\n     (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 true) => (3 4 5)\n     (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 false) => (3 2 1)"],"~$println-str",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10092,"^25",7,"^29",10092,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$&","~$objs"]]]]],"^2A","println to a string, returning it","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/println-str","^2C",true,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^6Y"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10092,"^29",10092,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^6Y"]]],"^2A","println to a string, returning it"],"~$inst-ms",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1384,"^25",7,"^29",1384,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$inst"]]]]],"^2A","Return the number of milliseconds since January 1, 1970, 00:00:00 GMT"],"^1:","~$cljs.core/inst-ms","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^70"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1384,"^29",1384,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^70"]]]]],"^2A","Return the number of milliseconds since January 1, 1970, 00:00:00 GMT"],"~$linear-traversal-nth",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1821,"^25",8,"^29",1821,"^24",28,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$n"],["^2O","~$n","~$not-found"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/linear-traversal-nth","^2C",false,"^23","cljs/core.cljs","^24",28,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1821,"^29",1821,"^2G",3,"^2H",true,"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]]],"~$iterate",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5032,"^25",7,"^29",5032,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$f","~$x"]]]]],"^2A","Returns a lazy sequence of x, (f x), (f (f x)) etc. f must be free of side-effects","~:added","1.0"],"^76","1.0","^1:","~$cljs.core/iterate","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$f","~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5032,"^29",5032,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f","~$x"]]]]],"^2A","Returns a lazy sequence of x, (f x), (f (f x)) etc. f must be free of side-effects"],"~$checked-aget'",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",480,"^25",8,"^29",480,"^24",21,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$array","~$idx"],["^79","^7:","~$&","~$idxs"]]]]],"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^79","^7:"]]],"^2:",["^2;",[["^79","^7:"],["^79","^7:","~$&","^7;"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/checked-aget'","^2C",true,"^23","cljs/core.cljs","^24",21,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^79","^7:"]]],"^2:",["^2;",[["^79","^7:"],["^79","^7:","~$&","^7;"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^79","^7:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",480,"^29",480,"^2G",2,"^2H",true,"^2:",["^2;",[["^79","^7:"],["^79","^7:","~$&","^7;"]]]],"~$-empty",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",577,"^25",4,"^29",577,"^24",10,"^5Y","^1W","^2A","Returns an empty collection of the same category as coll. Used\n     by cljs.core/empty.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^1W","^1:","~$cljs.core/-empty","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",575,"^29",577,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns an empty collection of the same category as coll. Used\n     by cljs.core/empty."],"~$newline",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10047,"^25",7,"^29",10047,"^24",14,"^2:",["^2;",["^2<",["^2;",[[],["^2J"]]]]],"^2A","Prints a newline using *print-fn*","^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^2J"]]],"^2:",["^2;",[[],["^2J"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/newline","^2C",false,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^2J"]]],"^2:",["^2;",[[],["^2J"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[[],["^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10047,"^29",10047,"^2G",1,"^2H",true,"^2:",["^2;",[[],["^2J"]]],"^2A","Prints a newline using *print-fn*"],"~$ILookup",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",619,"^25",14,"^29",619,"^24",21,"^2A","Protocol for looking up a value in a data structure.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-lookup",[["~$o","~$k"],["~$o","~$k","^73"]]]]],"^2S",true,"^1:","^22","^23","cljs/core.cljs","^24",21,"^25",1,"^28",619,"^2U",["^ ","^2V",["^ ","^7B",[["~$o","~$k"],["~$o","~$k","^73"]]]],"^30",null,"^29",619,"^31","^32","^33",["^19",["^4V","^4W","^34","^4X","^4Y","^4Z","^4[","^35","~$cljs.core/TaggedLiteral","^50","^36","~$cljs.core/TransientHashSet","~$cljs.core/PersistentHashSet","^51","~$cljs.core/PersistentTreeSet","^52"]],"^2A","Protocol for looking up a value in a data structure.","^2T",["^2;",["@interface"]]],"~$-chunked-rest",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",831,"^25",4,"^29",831,"^24",17,"^5Y","~$cljs.core/IChunkedSeq","^2A","Return a new collection of coll with the first chunk removed.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^7H","^1:","~$cljs.core/-chunked-rest","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",827,"^29",831,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Return a new collection of coll with the first chunk removed."],"~$write-all",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9875,"^25",7,"^29",9875,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$writer","~$&","~$ss"]]]]],"^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["^7K","^7L"]]],"^2:",["^2;",[["^7K","~$&","^7L"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/write-all","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["^7K","^7L"]]],"^2:",["^2;",[["^7K","~$&","^7L"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^7K","^7L"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",9875,"^29",9875,"^2G",1,"^2H",true,"^2:",["^2;",[["^7K","~$&","^7L"]]]],"~$fn?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1990,"^25",16,"^29",1990,"^24",19,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Return true if f is a JavaScript function or satisfies the Fn protocol."],"^1:","~$cljs.core/fn?","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1990,"^3=","^3:","^29",1990,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Return true if f is a JavaScript function or satisfies the Fn protocol."],"~$-prefer-method",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10833,"^25",4,"^29",10833,"^24",18,"^5Y","~$cljs.core/IMultiFn","^2A",null,"^2:",["^2;",["^2<",["^2;",[["~$mf","~$dispatch-val","~$dispatch-val-y"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-prefer-method","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^7R","^7S","^7T"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10833,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R","^7S","^7T"]]]]],"^2A",null],"~$-assoc",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",630,"^25",9,"^29",630,"^24",15,"^31","^5X","^5Y","~$cljs.core/IAssociative","^2A","Returns a new collection of coll with a mapping from key k to\n     value v added to it.","^2:",["^2;",["^2<",["^2;",[["^2O","~$k","~$v"]]]]]],"^5Y","^7W","^1:","~$cljs.core/-assoc","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2O","~$k","~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",625,"^3=","^5X","^29",630,"^2G",3,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$k","~$v"]]]]],"^2A","Returns a new collection of coll with a mapping from key k to\n     value v added to it."],"~$doall",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9784,"^25",7,"^29",9784,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^2O"],["~$n","^2O"]]]]],"^2A","When lazy sequences are produced via functions that have side\n  effects, any effects other than those needed to produce the first\n  element in the seq do not occur until the seq is consumed. doall can\n  be used to force any effects. Walks through the successive nexts of\n  the seq, retains the head and returns it, thus causing the entire\n  seq to reside in memory at one time.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^2O"],["~$n","^2O"]]],"^2:",["^2;",[["^2O"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/doall","^2C",false,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^2O"],["~$n","^2O"]]],"^2:",["^2;",[["^2O"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O"],["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9784,"^29",9784,"^2G",2,"^2H",true,"^2:",["^2;",[["^2O"],["~$n","^2O"]]],"^2A","When lazy sequences are produced via functions that have side\n  effects, any effects other than those needed to produce the first\n  element in the seq do not occur until the seq is consumed. doall can\n  be used to force any effects. Walks through the successive nexts of\n  the seq, retains the head and returns it, thus causing the entire\n  seq to reside in memory at one time."],"~$keyword-identical?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3307,"^25",16,"^29",3307,"^24",34,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Efficient test to determine that two keywords are identical."],"^1:","~$cljs.core/keyword-identical?","^2C",false,"^23","cljs/core.cljs","^24",34,"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3307,"^3=","^3:","^29",3307,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Efficient test to determine that two keywords are identical."],"~$*print-err-fn*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",84,"^25",3,"^29",84,"^24",17,"^2A","Each runtime environment provides a different way to print error output.\n  Whatever function *print-err-fn* is bound to will be passed any\n  Strings which should be printed.","^6F",true],"^1:","~$cljs.core/*print-err-fn*","^23","cljs/core.cljs","^24",17,"^25",1,"^6F",true,"^28",80,"^29",84,"^31","^57","^2A","Each runtime environment provides a different way to print error output.\n  Whatever function *print-err-fn* is bound to will be passed any\n  Strings which should be printed."],"~$pv-aset",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5303,"^25",8,"^29",5303,"^24",15,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$node","^7:","^2Z"]]]]]],"^59",true,"^1:","~$cljs.core/pv-aset","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^84","^7:","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5303,"^29",5303,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^84","^7:","^2Z"]]]]]],"~$prefers",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11053,"^25",7,"^29",11053,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$multifn"]]]]],"^2A","Given a multimethod, returns a map of preferred value -> set of other values"],"^1:","~$cljs.core/prefers","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^87"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11053,"^29",11053,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Given a multimethod, returns a map of preferred value -> set of other values"],"~$-js->clj",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10562,"^25",4,"^29",10562,"^24",12,"^5Y","~$cljs.core/IEncodeClojure","^2A","Transforms JavaScript values to Clojure","^2:",["^2;",["^2<",["^2;",[["~$x","~$options"]]]]]],"^5Y","^8:","^1:","~$cljs.core/-js->clj","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["~$x","^8;"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10561,"^29",10562,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","^8;"]]]]],"^2A","Transforms JavaScript values to Clojure"],"~$LazySeq",["^ ","^3S",4,"^1O",["^19",["^1P","^1Q","^1S","^1U","~$cljs.core/IPending","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/LazySeq","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",3384,"^3X",false,"^29",3384,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"~$dedupe",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10442,"^25",7,"^29",10442,"^24",13,"^2:",["^2;",["^2<",["^2;",[[],["^2O"]]]]],"^2A","Returns a lazy sequence removing consecutive duplicates in coll.\n  Returns a transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^2O"]]],"^2:",["^2;",[[],["^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/dedupe","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^2O"]]],"^2:",["^2;",[[],["^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[[],["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10442,"^29",10442,"^2G",1,"^2H",true,"^2:",["^2;",[[],["^2O"]]],"^2A","Returns a lazy sequence removing consecutive duplicates in coll.\n  Returns a transducer when no collection is provided."],"~$unchecked-editable-array-for",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5957,"^25",8,"^29",5957,"^24",36,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$tv","~$i"]]]]]],"^59",true,"^1:","~$cljs.core/unchecked-editable-array-for","^2C",false,"^23","cljs/core.cljs","^24",36,"^2D",["^2;",[["^8C","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5957,"^29",5957,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^8C","~$i"]]]]]],"~$->ES6Iterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",21,"^25",10,"^26","^27","^28",1277,"^29",1277,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ES6Iterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->ES6Iterator","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",1277,"^29",1277,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ES6Iterator."],"~$VectorNode",["^ ","^3S",2,"^1O",["^19",[]],"^1:","~$cljs.core/VectorNode","^23","cljs/core.cljs","^24",20,"^3W",true,"^25",10,"^28",5295,"^3X",false,"^29",5295,"^31","^3Y","^2@",null],"~$dissoc",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1976,"^25",7,"^29",1976,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","~$ks"]]]]],"^2A","dissoc[iate]. Returns a new map of the same (hashed/sorted) type,\n  that does not contain a mapping for key(s).","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2O"],["^2O","~$k"]]],"^2:",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","^8J"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/dissoc","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2O"],["^2O","~$k"]]],"^2:",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","^8J"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["^2O"],["^2O","~$k"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",1976,"^29",1976,"^2G",2,"^2H",true,"^2:",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","^8J"]]],"^2A","dissoc[iate]. Returns a new map of the same (hashed/sorted) type,\n  that does not contain a mapping for key(s)."],"~$atom",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4404,"^25",7,"^29",4404,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$&",["^ ","~:keys",["^2=","~$validator"]]]]]]],"^2A","Creates and returns an Atom with an initial value of x and zero or\n  more options (in any order):\n\n  :meta metadata-map\n\n  :validator validate-fn\n\n  If metadata-map is supplied, it will be come the metadata on the\n  atom. validate-fn must be nil or a side-effect-free fn of one\n  argument, which will be passed the intended new state on any state\n  change. If the new state is unacceptable, the validate-fn should\n  return false or throw an Error.  If either of these error conditions\n  occur, then the value of the atom will not change.","^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$x"]]],"^2:",["^2;",[["~$x"],["~$x","~$&",["^ ","^8M",["^2=","^8N"]]]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/atom","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$x"]]],"^2:",["^2;",[["~$x"],["~$x","~$&",["^ ","^8M",["^2=","^8N"]]]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4404,"^29",4404,"^2G",1,"^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$&",["^ ","^8M",["^2=","^8N"]]]]],"^2A","Creates and returns an Atom with an initial value of x and zero or\n  more options (in any order):\n\n  :meta metadata-map\n\n  :validator validate-fn\n\n  If metadata-map is supplied, it will be come the metadata on the\n  atom. validate-fn must be nil or a side-effect-free fn of one\n  argument, which will be passed the intended new state on any state\n  change. If the new state is unacceptable, the validate-fn should\n  return false or throw an Error.  If either of these error conditions\n  occur, then the value of the atom will not change."],"~$bit-shift-right",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2880,"^25",7,"^29",2880,"^24",22,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Bitwise shift right"],"^1:","~$cljs.core/bit-shift-right","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2880,"^29",2880,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Bitwise shift right"],"~$MapEntry",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",1959,"^25",47,"^29",1959,"^24",55,"^5A",true],"^3S",3,"^1O",["^19",["^5B","~$cljs.core/IVector","^5C","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","~$cljs.core/IStack","~$cljs.core/IMapEntry","^4K","^21","^7W","^22","^5E"]],"^1:","^4Z","^23","cljs/core.cljs","^24",18,"^3W",true,"^25",10,"^28",6555,"^3X",false,"^5A",true,"^29",6555,"^31","^3Y","^2@",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]]],"~$->t_cljs$core1500",["^ ","^1M",null,"^1N",["^ ","~:anonymous",true,"^1O",["^19",["^1U","^1Z","^21"]],"^2@",["^19",["^1Z","^21"]],"^26","^27","^2:",["^2;",["^2<",["^2;",[["~$meta1501"]]]]],"^2A","Positional factory function for cljs.core/t_cljs$core1500.","^23","cljs/core.cljs"],"^1O",["^19",["^1U","^1Z","^21"]],"^1:","~$cljs.core/->t_cljs$core1500","^2C",false,"^23","cljs/core.cljs","^2D",["^2;",[["^8X"]]],"^2E",null,"^2F",["^2;",[null,null]],"^8W",true,"^25",3,"^26","^27","^28",3961,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^8X"]]]]],"^2@",["^19",["^1Z","^21"]],"^2A","Positional factory function for cljs.core/t_cljs$core1500."],"~$*clojurescript-version*",["^ ","^1:","~$cljs.core/*clojurescript-version*","^23","cljs/core.cljs","^28",19,"^25",1,"^29",19,"^24",29,"^1N",["^ ","^23","cljs/core.cljs","^28",19,"^25",6,"^29",19,"^24",29],"^31","~$string"],"~$-first",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",603,"^25",4,"^29",603,"^24",10,"^5Y","^4?","^2A","Returns the first item in the collection coll. Used by cljs.core/first.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^4?","^1:","~$cljs.core/-first","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",601,"^29",603,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the first item in the collection coll. Used by cljs.core/first."],"~$peek",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2064,"^25",7,"^29",2064,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","For a list or queue, same as first, for a vector, same as, but much\n  more efficient than, last. If the collection is empty, returns nil."],"^1:","~$cljs.core/peek","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2064,"^29",2064,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","For a list or queue, same as first, for a vector, same as, but much\n  more efficient than, last. If the collection is empty, returns nil."],"~$IKVReduce",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",697,"^25",14,"^29",697,"^24",23,"^2A","Protocol for associative types that can reduce themselves\n  via a function of key and val. Called by cljs.core/reduce-kv.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-kv-reduce",[["^2O","~$f","~$init"]]]]],"^2S",true,"^1:","~$cljs.core/IKVReduce","^23","cljs/core.cljs","^24",23,"^25",1,"^28",697,"^2U",["^ ","^2V",["^ ","^96",[["^2O","~$f","^97"]]]],"^30",null,"^29",697,"^31","^32","^33",["^19",["^4V","^4W","^4X","^4[","^50","^51"]],"^2A","Protocol for associative types that can reduce themselves\n  via a function of key and val. Called by cljs.core/reduce-kv.","^2T",["^2;",["@interface"]]],"~$iter-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2462,"^25",8,"^29",2462,"^24",19,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$f"],["^2O","~$f","^97"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$f"],["^2O","~$f","^97"]]],"^2:",["^2;",[["^2O","~$f"],["^2O","~$f","^97"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/iter-reduce","^2C",false,"^23","cljs/core.cljs","^24",19,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$f"],["^2O","~$f","^97"]]],"^2:",["^2;",[["^2O","~$f"],["^2O","~$f","^97"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O","~$f"],["^2O","~$f","^97"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2462,"^29",2462,"^2G",3,"^2H",true,"^2:",["^2;",[["^2O","~$f"],["^2O","~$f","^97"]]]],"~$aget",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",496,"^25",7,"^29",496,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^79","^7:"],["^79","^7:","~$&","^7;"]]]]],"^2A","Returns the value at the index/indices. Works on JavaScript arrays.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^79","^7:"]]],"^2:",["^2;",[["^79","^7:"],["^79","^7:","~$&","^7;"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/aget","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^79","^7:"]]],"^2:",["^2;",[["^79","^7:"],["^79","^7:","~$&","^7;"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^79","^7:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",496,"^29",496,"^2G",2,"^2H",true,"^2:",["^2;",[["^79","^7:"],["^79","^7:","~$&","^7;"]]],"^2A","Returns the value at the index/indices. Works on JavaScript arrays."],"~$PersistentTreeMapSeq",["^ ","^3S",5,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/PersistentTreeMapSeq","^23","cljs/core.cljs","^24",30,"^3W",true,"^25",10,"^28",8066,"^3X",false,"^29",8066,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"~$-write",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",752,"^25",4,"^29",752,"^24",10,"^5Y","~$cljs.core/IWriter","^2A","Writes s with writer and returns the result.","^2:",["^2;",["^2<",["^2;",[["^7K","~$s"]]]]]],"^5Y","^9@","^1:","~$cljs.core/-write","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^7K","~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",750,"^29",752,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7K","~$s"]]]]],"^2A","Writes s with writer and returns the result."],"^4A",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4015,"^25",7,"^29",4015,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^1:","~$cljs.core/iter","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4015,"^29",4015,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"~$mk-bound-fn",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9490,"^25",7,"^29",9490,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$sc","~$test","^2Y"]]]]]],"^1:","~$cljs.core/mk-bound-fn","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^9D","^9E","^2Y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9490,"^29",9490,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^9D","^9E","^2Y"]]]]]],"~$last",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1761,"^25",7,"^29",1761,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Return the last item in coll, in linear time"],"^1:","~$cljs.core/last","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1761,"^29",1761,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Return the last item in coll, in linear time"],"~$-default-dispatch-val",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10837,"^25",4,"^29",10837,"^24",25,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-default-dispatch-val","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^7R"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10837,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]],"^2A",null],"~$pr",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10065,"^25",7,"^29",10065,"^24",9,"^2:",["^2;",["^2<",["^2;",[["~$&","^6Y"]]]]],"^2A","Prints the object(s) using string-print.  Prints the\n  object(s), separated by spaces if there is more than one.\n  By default, pr and prn print in a way that objects can be\n  read by the reader","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/pr","^2C",true,"^23","cljs/core.cljs","^24",9,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^6Y"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10065,"^29",10065,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^6Y"]]],"^2A","Prints the object(s) using string-print.  Prints the\n  object(s), separated by spaces if there is more than one.\n  By default, pr and prn print in a way that objects can be\n  read by the reader"],"~$tree-map-seq-push",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8059,"^25",8,"^29",8059,"^24",25,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^84","^@","^6V"]]]]]],"^59",true,"^1:","~$cljs.core/tree-map-seq-push","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^84","^@","^6V"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8059,"^29",8059,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^84","^@","^6V"]]]]]],"~$namespace",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3325,"^25",7,"^29",3325,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns the namespace String of a symbol or keyword, or nil if not present."],"^1:","~$cljs.core/namespace","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3325,"^29",3325,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns the namespace String of a symbol or keyword, or nil if not present."],"~$empty-unordered-hash",["^ ","^1:","~$cljs.core/empty-unordered-hash","^23","cljs/core.cljs","^28",1351,"^25",1,"^29",1351,"^24",36,"^59",true,"^1N",["^ ","^23","cljs/core.cljs","^28",1351,"^25",16,"^29",1351,"^24",36,"^59",true],"^31","^<"],"~$obj-map",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8806,"^25",7,"^29",8806,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$&","~$keyvals"]]]]],"^2A","keyval => key val\n  Returns a new object map with supplied mappings.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^9T"]]],"^2:",["^2;",[["~$&","^9T"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/obj-map","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^9T"]]],"^2:",["^2;",[["~$&","^9T"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^9T"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",8806,"^29",8806,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^9T"]]],"^2A","keyval => key val\n  Returns a new object map with supplied mappings."],"~$Reduced",["^ ","^3S",1,"^1O",["^19",["^3U"]],"^1:","~$cljs.core/Reduced","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",1417,"^3X",false,"^29",1417,"^31","^3Y","^2@",["^19",["^3U"]]],"~$-conj",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",583,"^25",9,"^29",583,"^24",14,"^31","^5X","^5Y","^1S","^2A","Returns a new collection of coll with o added to it. The new item\n     should be added to the most efficient place, e.g.\n     (conj [1 2 3 4] 5) => [1 2 3 4 5]\n     (conj '(2 3 4 5) 1) => '(1 2 3 4 5)","^2:",["^2;",["^2<",["^2;",[["^2O","~$o"]]]]]],"^5Y","^1S","^1:","~$cljs.core/-conj","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O","~$o"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",581,"^3=","^5X","^29",583,"^2G",2,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$o"]]]]],"^2A","Returns a new collection of coll with o added to it. The new item\n     should be added to the most efficient place, e.g.\n     (conj [1 2 3 4] 5) => [1 2 3 4 5]\n     (conj '(2 3 4 5) 1) => '(1 2 3 4 5)"],"~$NodeSeq",["^ ","^3S",5,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/NodeSeq","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",7610,"^3X",false,"^29",7610,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"~$=",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1258,"^25",16,"^29",1258,"^24",17,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Equality. Returns true if x equals y, false if not. Compares\n  numbers and collections in a type-independent manner.  Clojure's immutable data\n  structures define -equiv (and thus =) as a value, not an identity,\n  comparison.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/=","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",1258,"^3=","^3:","^29",1258,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Equality. Returns true if x equals y, false if not. Compares\n  numbers and collections in a type-independent manner.  Clojure's immutable data\n  structures define -equiv (and thus =) as a value, not an identity,\n  comparison."],"~$ITransientMap",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",799,"^25",14,"^29",799,"^24",27,"^2A","Protocol for adding mapping functionality to transient collections.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-dissoc!",[["^2X","^2Y"]]]]],"^2S",true,"^1:","~$cljs.core/ITransientMap","^23","cljs/core.cljs","^24",27,"^25",1,"^28",799,"^2U",["^ ","^2V",["^ ","^:2",[["^2X","^2Y"]]]],"^30",null,"^29",799,"^31","^32","^33",["^19",["^35","^36"]],"^2A","Protocol for adding mapping functionality to transient collections.","^2T",["^2;",["@interface"]]],"~$push-tail",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5325,"^25",8,"^29",5325,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6>","~$level","~$parent","~$tailnode"]]]]]],"^59",true,"^1:","~$cljs.core/push-tail","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^6>","^:5","^:6","^:7"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5325,"^29",5325,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6>","^:5","^:6","^:7"]]]]]],"~$take",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4701,"^25",7,"^29",4701,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$n"],["~$n","^2O"]]]]],"^2A","Returns a lazy sequence of the first n items in coll, or all items if\n  there are fewer than n.  Returns a stateful transducer when\n  no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/take","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4701,"^29",4701,"^2G",2,"^2H",true,"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2A","Returns a lazy sequence of the first n items in coll, or all items if\n  there are fewer than n.  Returns a stateful transducer when\n  no collection is provided."],"~$vector?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2145,"^25",16,"^29",2145,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies IVector"],"^1:","~$cljs.core/vector?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2145,"^3=","^3:","^29",2145,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies IVector"],"~$array-index-of-equiv?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6514,"^25",8,"^29",6514,"^24",29,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"^59",true,"^1:","~$cljs.core/array-index-of-equiv?","^2C",false,"^23","cljs/core.cljs","^24",29,"^2D",["^2;",[["^66","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6514,"^29",6514,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"~$bitmap-indexed-node-index",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7072,"^25",8,"^29",7072,"^24",33,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$bitmap","~$bit"]]]]]],"^59",true,"^1:","~$cljs.core/bitmap-indexed-node-index","^2C",false,"^23","cljs/core.cljs","^24",33,"^2D",["^2;",[["^:@","^:A"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7072,"^29",7072,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:@","^:A"]]]]]],"^3:",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2227,"^25",16,"^29",2227,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to boolean"],"^1:","~$cljs.core/boolean","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2227,"^3=","^3:","^29",2227,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to boolean"],"~$IChunk",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",822,"^25",14,"^29",822,"^24",20,"^2A","Protocol for accessing the items of a chunk.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-drop-first",[["^2O"]]]]],"^2S",true,"^1:","~$cljs.core/IChunk","^23","cljs/core.cljs","^24",20,"^25",1,"^28",822,"^2U",["^ ","^2V",["^ ","^:E",[["^2O"]]]],"^30",null,"^29",822,"^31","^32","^33",["^19",["~$cljs.core/ArrayChunk"]],"^2A","Protocol for accessing the items of a chunk.","^2T",["^2;",["@interface"]]],"~$bit-shift-left",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2876,"^25",7,"^29",2876,"^24",21,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Bitwise shift left"],"^1:","~$cljs.core/bit-shift-left","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2876,"^29",2876,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Bitwise shift left"],"~$random-uuid",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11098,"^25",7,"^29",11098,"^24",18,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"^1:","~$cljs.core/random-uuid","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11098,"^29",11098,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"~$any?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",275,"^25",16,"^29",275,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if given any argument."],"^1:","~$cljs.core/any?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",275,"^3=","^3:","^29",275,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if given any argument."],"~$rand-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10634,"^25",7,"^29",10634,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns a random integer between 0 (inclusive) and n (exclusive)."],"^1:","~$cljs.core/rand-int","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10634,"^29",10634,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns a random integer between 0 (inclusive) and n (exclusive)."],"~$aclone",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",426,"^25",7,"^29",426,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^66"]]]]],"^2A","Returns a javascript array, cloned from the passed in array"],"^1:","~$cljs.core/aclone","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",426,"^29",426,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66"]]]]],"^2A","Returns a javascript array, cloned from the passed in array"],"~$BlackNode",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",8138,"^25",18,"^29",8138,"^24",27,"^5A",true],"^3S",5,"^1O",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^1:","^4Y","^23","cljs/core.cljs","^24",19,"^3W",true,"^25",10,"^28",8238,"^3X",false,"^5A",true,"^29",8238,"^31","^3Y","^2@",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]]],"~$vreset!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4535,"^25",7,"^29",4535,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$vol","~$newval"]]]]],"^2A","Sets the value of volatile to newval without regard for the\n   current value. Returns newval."],"^1:","~$cljs.core/vreset!","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^:T","^:U"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4535,"^29",4535,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:T","^:U"]]]]],"^2A","Sets the value of volatile to newval without regard for the\n   current value. Returns newval."],"~$chunk",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3593,"^25",7,"^29",3593,"^24",12,"^2:",["^2;",["^2<",["^2;",[["~$b"]]]]]],"^1:","~$cljs.core/chunk","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["~$b"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3593,"^29",3593,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$b"]]]]]],"~$UNREALIZED-SEED",["^ ","^1:","~$cljs.core/UNREALIZED-SEED","^23","cljs/core.cljs","^28",4974,"^25",1,"^29",4974,"^24",31,"^59",true,"^1N",["^ ","^23","cljs/core.cljs","^28",4974,"^25",16,"^29",4974,"^24",31,"^59",true],"^31","^45"],"~$dec",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2658,"^25",7,"^29",2658,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one less than num."],"^1:","~$cljs.core/dec","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2658,"^29",2658,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one less than num."],"~$->TransformerIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",29,"^25",10,"^26","^27","^28",4097,"^29",4097,"^2:",["^2;",["^2<",["^2;",[["~$buffer","~$_next","~$completed","~$xf","~$sourceIter","~$multi"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/TransformerIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->TransformerIterator","^2C",false,"^23","cljs/core.cljs","^24",29,"^2D",["^2;",[["^;2","^;3","^;4","^;5","^;6","^;7"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4097,"^29",4097,"^2G",6,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^;2","^;3","^;4","^;5","^;6","^;7"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/TransformerIterator."],"~$APersistentVector",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",5430,"^25",14,"^29",5430,"^24",31,"^2A","Marker protocol","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ "]]],"^2S",true,"^1:","~$cljs.core/APersistentVector","^23","cljs/core.cljs","^24",31,"^25",1,"^28",5430,"^2U",["^ ","^2V",["^ "]],"^30",null,"^29",5430,"^31","^32","^33",["^19",["^50"]],"^2A","Marker protocol","^2T",["^2;",["@interface"]]],"~$map",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4654,"^25",7,"^29",4654,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","^2O"],["~$f","~$c1","~$c2"],["~$f","^;<","^;=","~$c3"],["~$f","^;<","^;=","^;>","~$&","~$colls"]]]]],"^2A","Returns a lazy sequence consisting of the result of applying f to\n  the set of first items of each coll, followed by applying f to the\n  set of second items in each coll, until any one of the colls is\n  exhausted.  Any remaining items in other colls are ignored. Function\n  f should accept number-of-colls arguments. Returns a transducer when\n  no collection is provided.","^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$f"],["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"],["~$f","^;<","^;=","^;>","~$&","^;?"]]],"^2F",["^2;",[null,null,null,null,null]]]],"^1:","~$cljs.core/map","^2C",true,"^23","cljs/core.cljs","^24",10,"^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$f"],["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"],["~$f","^;<","^;=","^;>","~$&","^;?"]]],"^2F",["^2;",[null,null,null,null,null]]],"^2D",["^2;",[["~$f"],["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null]],"^25",1,"^28",4654,"^29",4654,"^2G",4,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"],["~$f","^;<","^;=","^;>","~$&","^;?"]]],"^2A","Returns a lazy sequence consisting of the result of applying f to\n  the set of first items of each coll, followed by applying f to the\n  set of second items in each coll, until any one of the colls is\n  exhausted.  Any remaining items in other colls are ignored. Function\n  f should accept number-of-colls arguments. Returns a transducer when\n  no collection is provided."],"~$juxt",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9735,"^25",7,"^29",9735,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["~$f","~$g","~$h","~$&","~$fs"]]]]],"^2A","Takes a set of functions and returns a fn that is the juxtaposition\n  of those fns.  The returned fn takes a variable number of args, and\n  returns a vector containing the result of applying each fn to the\n  args (left-to-right).\n  ((juxt a b c) x) => [(a x) (b x) (c x)]","^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$f"],["~$f","~$g"],["~$f","~$g","~$h"]]],"^2:",["^2;",[["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["~$f","~$g","~$h","~$&","^;B"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/juxt","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$f"],["~$f","~$g"],["~$f","~$g","~$h"]]],"^2:",["^2;",[["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["~$f","~$g","~$h","~$&","^;B"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[["~$f"],["~$f","~$g"],["~$f","~$g","~$h"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",9735,"^29",9735,"^2G",3,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["~$f","~$g","~$h","~$&","^;B"]]],"^2A","Takes a set of functions and returns a fn that is the juxtaposition\n  of those fns.  The returned fn takes a variable number of args, and\n  returns a vector containing the result of applying each fn to the\n  args (left-to-right).\n  ((juxt a b c) x) => [(a x) (b x) (c x)]"],"~$->PersistentQueueIter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",29,"^25",10,"^26","^27","^28",6106,"^29",6106,"^2:",["^2;",["^2<",["^2;",[["~$fseq","~$riter"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/PersistentQueueIter."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->PersistentQueueIter","^2C",false,"^23","cljs/core.cljs","^24",29,"^2D",["^2;",[["^;E","^;F"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6106,"^29",6106,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^;E","^;F"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/PersistentQueueIter."],"~$<",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2610,"^25",16,"^29",2610,"^24",17,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns non-nil if nums are in monotonically increasing order,\n  otherwise false.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/<","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2610,"^3=","^3:","^29",2610,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns non-nil if nums are in monotonically increasing order,\n  otherwise false."],"~$*eval*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11530,"^25",3,"^29",11530,"^24",9,"^2A","Runtime environments may provide a way to evaluate ClojureScript\n  forms. Whatever function *eval* is bound to will be passed any forms which\n  should be evaluated.","^6F",true],"^1:","~$cljs.core/*eval*","^2C",false,"^23","cljs/core.cljs","^24",9,"^2D",["^2;",[["~$_"]]],"^2E",null,"^2F",["^2;",[]],"^25",1,"^6F",true,"^28",11526,"^29",11530,"^2G",1,"^2H",true,"^2:",null,"^2A","Runtime environments may provide a way to evaluate ClojureScript\n  forms. Whatever function *eval* is bound to will be passed any forms which\n  should be evaluated."],"~$inode-kv-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7089,"^25",8,"^29",7089,"^24",23,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$f","^97"]]]]]],"^59",true,"^1:","~$cljs.core/inode-kv-reduce","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^66","~$f","^97"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7089,"^29",7089,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$f","^97"]]]]]],"~$obj-map->hash-map",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6297,"^25",8,"^29",6297,"^24",25,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$m","~$k","~$v"]]]]]],"^59",true,"^1:","~$cljs.core/obj-map->hash-map","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["~$m","~$k","~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6297,"^29",6297,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$m","~$k","~$v"]]]]]],"^9E",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11199,"^25",7,"^29",11199,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$v"]]]]],"^2A","test [v] finds fn at key :test in var metadata and calls it,\n  presuming failure will throw exception"],"^1:","~$cljs.core/test","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11199,"^29",11199,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$v"]]]]],"^2A","test [v] finds fn at key :test in var metadata and calls it,\n  presuming failure will throw exception"],"~$rest",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1236,"^25",12,"^29",1236,"^24",16,"^31","^3P","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a possibly empty seq of the items after the first. Calls seq on its\n  argument."],"^1:","~$cljs.core/rest","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1236,"^3=","^3P","^29",1236,"^2G",1,"^31","^3P","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a possibly empty seq of the items after the first. Calls seq on its\n  argument."],"~$ex-data",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11163,"^25",7,"^29",11163,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$ex"]]]]],"^2A","Returns exception data (a map) if ex is an ExceptionInfo.\n  Otherwise returns nil."],"^1:","~$cljs.core/ex-data","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^;S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11163,"^29",11163,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^;S"]]]]],"^2A","Returns exception data (a map) if ex is an ExceptionInfo.\n  Otherwise returns nil."],"~$PersistentArrayMapSeq",["^ ","^3S",3,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/PersistentArrayMapSeq","^23","cljs/core.cljs","^24",31,"^3W",true,"^25",10,"^28",6655,"^3X",false,"^29",6655,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"^:E",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",824,"^25",4,"^29",824,"^24",15,"^5Y","^:F","^2A","Return a new chunk of coll with the first item removed.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^:F","^1:","~$cljs.core/-drop-first","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",822,"^29",824,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Return a new chunk of coll with the first item removed."],"~$isa?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10674,"^25",16,"^29",10674,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$child","^:6"],["~$h","^;Y","^:6"]]]]],"^2A","Returns true if (= child parent), or child is directly or indirectly derived from\n  parent, either via a JavaScript type inheritance relationship or a\n  relationship established via derive. h must be a hierarchy obtained\n  from make-hierarchy, if not supplied defaults to the global\n  hierarchy","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^;Y","^:6"],["~$h","^;Y","^:6"]]],"^2:",["^2;",[["^;Y","^:6"],["~$h","^;Y","^:6"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/isa?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^;Y","^:6"],["~$h","^;Y","^:6"]]],"^2:",["^2;",[["^;Y","^:6"],["~$h","^;Y","^:6"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^;Y","^:6"],["~$h","^;Y","^:6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10674,"^3=","^3:","^29",10674,"^2G",3,"^31","^3:","^2H",true,"^2:",["^2;",[["^;Y","^:6"],["~$h","^;Y","^:6"]]],"^2A","Returns true if (= child parent), or child is directly or indirectly derived from\n  parent, either via a JavaScript type inheritance relationship or a\n  relationship established via derive. h must be a hierarchy obtained\n  from make-hierarchy, if not supplied defaults to the global\n  hierarchy"],"~$boolean?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2203,"^25",16,"^29",2203,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a Boolean"],"^1:","~$cljs.core/boolean?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2203,"^3=","^3:","^29",2203,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a Boolean"],"~$-clone",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",567,"^25",9,"^29",567,"^24",15,"^31","^5X","^5Y","^1[","^2A","Creates a clone of value.","^2:",["^2;",["^2<",["^2;",[["^4@"]]]]]],"^5Y","^1[","^1:","~$cljs.core/-clone","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^4@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",565,"^3=","^5X","^29",567,"^2G",1,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4@"]]]]],"^2A","Creates a clone of value."],"~$munge",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11308,"^25",7,"^29",11308,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^:"]]]]]],"^1:","~$cljs.core/munge","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11308,"^29",11308,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:"]]]]]],"~$empty-ordered-hash",["^ ","^1:","~$cljs.core/empty-ordered-hash","^23","cljs/core.cljs","^28",1336,"^25",1,"^29",1336,"^24",34,"^59",true,"^1N",["^ ","^23","cljs/core.cljs","^28",1336,"^25",16,"^29",1336,"^24",34,"^59",true],"^31","^<"],"~$DEMUNGE_MAP",["^ ","^1:","~$cljs.core/DEMUNGE_MAP","^23","cljs/core.cljs","^28",362,"^25",1,"^29",363,"^24",14,"^2T",["@enum {string}"],"^1N",["^ ","^23","cljs/core.cljs","^28",363,"^25",3,"^29",363,"^24",14,"^2T",["@enum {string}"]],"^31","^45"],"~$ES6IteratorSeq",["^ ","^3S",3,"^1O",["^19",["^4?","^1Y"]],"^1:","~$cljs.core/ES6IteratorSeq","^23","cljs/core.cljs","^24",24,"^3W",true,"^25",10,"^28",1293,"^3X",false,"^29",1293,"^31","^3Y","^2@",["^19",["^4?","^1Y"]]],"~$->NeverEquiv",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1U"]],"^23","cljs/core.cljs","^24",20,"^25",10,"^26","^27","^28",6246,"^29",6246,"^2:",["^2;",["^2<",["^2;",[[]]]]],"^2@",["^19",["^1P"]],"^2A","Positional factory function for cljs.core/NeverEquiv."],"^1O",["^19",["^1P","^1U"]],"^1:","~$cljs.core/->NeverEquiv","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6246,"^29",6246,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]],"^2@",["^19",["^1P"]],"^2A","Positional factory function for cljs.core/NeverEquiv."],"~$re-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9831,"^25",7,"^29",9831,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$re","~$s"]]]]],"^2A","Returns a lazy sequence of successive matches of re in s."],"^1:","~$cljs.core/re-seq","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^<>","~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9831,"^29",9831,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^<>","~$s"]]]]],"^2A","Returns a lazy sequence of successive matches of re in s."],"~$char?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",270,"^25",16,"^29",270,"^24",21,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a JavaScript string of length one."],"^1:","~$cljs.core/char?","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",270,"^3=","^3:","^29",270,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a JavaScript string of length one."],"~$make-hierarchy",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10657,"^25",7,"^29",10657,"^24",21,"^2:",["^2;",["^2<",["^2;",[[]]]]],"^2A","Creates a hierarchy object for use with derive, isa? etc."],"^1:","~$cljs.core/make-hierarchy","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10657,"^29",10657,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]],"^2A","Creates a hierarchy object for use with derive, isa? etc."],"^E",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",952,"^25",15,"^29",952,"^24",21,"^5A",true],"^3S",5,"^1O",["^19",["^1P","^1Q","^1R","^1U","~$cljs.core/INamed","^1Z","^5N","^21"]],"^1:","~$cljs.core/Symbol","^23","cljs/core.cljs","^24",16,"^3W",true,"^25",10,"^28",1060,"^3X",false,"^5A",true,"^29",1060,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1R","^<D","^1Z","^5N","^21"]]],"~$PROTOCOL_SENTINEL",["^ ","^1:","~$cljs.core/PROTOCOL_SENTINEL","^23","cljs/core.cljs","^28",37,"^25",1,"^29",37,"^24",27,"^1N",["^ ","^23","cljs/core.cljs","^28",37,"^25",10,"^29",37,"^24",27],"^31","^45"],"~$tv-push-tail",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5931,"^25",8,"^29",5931,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^8C","^:5","^:6","~$tail-node"]]]]]],"^59",true,"^1:","~$cljs.core/tv-push-tail","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^8C","^:5","^:6","^<I"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5931,"^29",5931,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^8C","^:5","^:6","^<I"]]]]]],"~$-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",692,"^25",4,"^29",692,"^24",11,"^5Y","^5E","^2A","f should be a function of 2 arguments. If start is not supplied,\n     returns the result of applying f to the first 2 items in coll, then\n     applying f to that result and the 3rd item, etc.","^2:",["^2;",["^2<",["^2;",[["^2O","~$f"],["^2O","~$f","^4P"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$f"],["^2O","~$f","^4P"]]],"^2:",["^2;",[["^2O","~$f"],["^2O","~$f","^4P"]]],"^2F",["^2;",[null,null]]]],"^5Y","^5E","^1:","~$cljs.core/-reduce","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$f"],["^2O","~$f","^4P"]]],"^2:",["^2;",[["^2O","~$f"],["^2O","~$f","^4P"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O","~$f"],["^2O","~$f","^4P"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",689,"^29",692,"^2G",3,"^2H",true,"^2:",["^2;",[["^2O","~$f"],["^2O","~$f","^4P"]]],"^2A","f should be a function of 2 arguments. If start is not supplied,\n     returns the result of applying f to the first 2 items in coll, then\n     applying f to that result and the 3rd item, etc."],"~$-count",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",572,"^25",12,"^29",572,"^24",18,"^31","^<","^5Y","^1X","^2A","Calculates the count of coll in constant time. Used by cljs.core/count.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^1X","^1:","~$cljs.core/-count","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",570,"^3=","^<","^29",572,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Calculates the count of coll in constant time. Used by cljs.core/count."],"~$swap-vals!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4476,"^25",7,"^29",4476,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]]]],"^2A","Atomically swaps the value of atom to be:\n  (apply f current-value-of-atom args). Note that f may be called\n  multiple times, and thus should be free of side effects.\n  Returns [old new], the value of the atom before and after the swap.","^76","1.9","^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"]]],"^2:",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^76","1.9","^1:","~$cljs.core/swap-vals!","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"]]],"^2:",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",4476,"^29",4476,"^2G",4,"^2H",true,"^2:",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]],"^2A","Atomically swaps the value of atom to be:\n  (apply f current-value-of-atom args). Note that f may be called\n  multiple times, and thus should be free of side effects.\n  Returns [old new], the value of the atom before and after the swap."],"~$keep",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4341,"^25",7,"^29",4341,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","^2O"]]]]],"^2A","Returns a lazy sequence of the non-nil results of (f item). Note,\n  this means false return values will be included.  f must be free of\n  side-effects.  Returns a transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/keep","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4341,"^29",4341,"^2G",2,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2A","Returns a lazy sequence of the non-nil results of (f item). Note,\n  this means false return values will be included.  f must be free of\n  side-effects.  Returns a transducer when no collection is provided."],"~$char",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2678,"^25",7,"^29",2678,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to char"],"^1:","~$cljs.core/char","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2678,"^29",2678,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to char"],"~$mapcat",["^ ","^1M",null,"^1N",["^ ","^76","1.0","^23","cljs/core.cljs","^24",13,"~:static",true,"^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$f"]]],"^2:",["^2;",[["~$f"],["~$f","~$&","^;?"]]],"^2F",["^2;",[null,null]]],"^25",7,"^28",5089,"^29",5089,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","~$&","^;?"]]]]],"^2A","Returns the result of applying concat to the result of applying map\n  to f and colls.  Thus function f should return a collection. Returns\n  a transducer when no collections are provided"],"^76","1.0","^1:","~$cljs.core/mapcat","^2C",true,"^23","cljs/core.cljs","^24",13,"^<V",true,"^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$f"]]],"^2:",["^2;",[["~$f"],["~$f","~$&","^;?"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5089,"^29",5089,"^2G",1,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","~$&","^;?"]]],"^2A","Returns the result of applying concat to the result of applying map\n  to f and colls.  Thus function f should return a collection. Returns\n  a transducer when no collections are provided"],"~$unchecked-long",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2792,"^25",7,"^29",2792,"^24",21,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to long by stripping decimal places. Identical to `int'."],"^1:","~$cljs.core/unchecked-long","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2792,"^29",2792,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to long by stripping decimal places. Identical to `int'."],"~$m3-seed",["^ ","^1:","~$cljs.core/m3-seed","^23","cljs/core.cljs","^28",910,"^25",1,"^29",910,"^24",13,"^1N",["^ ","^23","cljs/core.cljs","^28",910,"^25",6,"^29",910,"^24",13],"^31","^<"],"~$some?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",254,"^25",16,"^29",254,"^24",21,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is not nil, false otherwise."],"^1:","~$cljs.core/some?","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",254,"^3=","^3:","^29",254,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is not nil, false otherwise."],"~$unchecked-negate",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2747,"^25",7,"^29",2747,"^24",23,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/unchecked-negate","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2747,"^29",2747,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$remove-tap",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11357,"^25",7,"^29",11357,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Remove f from the tap set."],"^1:","~$cljs.core/remove-tap","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11357,"^29",11357,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Remove f from the tap set."],"~$symbol-identical?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3316,"^25",16,"^29",3316,"^24",33,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Efficient test to determine that two symbols are identical."],"^1:","~$cljs.core/symbol-identical?","^2C",false,"^23","cljs/core.cljs","^24",33,"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3316,"^3=","^3:","^29",3316,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Efficient test to determine that two symbols are identical."],"~$*command-line-args*",["^ ","^1:","~$cljs.core/*command-line-args*","^23","cljs/core.cljs","^28",300,"^25",1,"^29",303,"^24",22,"^2A","A sequence of the supplied command line arguments, or nil if\n  none were supplied","^1N",["^ ","^23","cljs/core.cljs","^28",303,"^25",3,"^29",303,"^24",22,"^2A","A sequence of the supplied command line arguments, or nil if\n  none were supplied"],"^31","^57"],"~$reverse",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3170,"^25",7,"^29",3170,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a seq of the items in coll in reverse order. Not lazy."],"^1:","~$cljs.core/reverse","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3170,"^29",3170,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a seq of the items in coll in reverse order. Not lazy."],"~$inst?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1389,"^25",16,"^29",1389,"^24",21,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies Inst"],"^1:","~$cljs.core/inst?","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1389,"^3=","^3:","^29",1389,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies Inst"],"~$range",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9634,"^25",7,"^29",9634,"^24",12,"^2:",["^2;",["^2<",["^2;",[[],["^4Q"],["^4P","^4Q"],["^4P","^4Q","~$step"]]]]],"^2A","Returns a lazy seq of nums from start (inclusive) to end\n   (exclusive), by step, where start defaults to 0, step to 1,\n   and end to infinity.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[[],["^4Q"],["^4P","^4Q"],["^4P","^4Q","^=?"]]],"^2:",["^2;",[[],["^4Q"],["^4P","^4Q"],["^4P","^4Q","^=?"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/range","^2C",false,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[[],["^4Q"],["^4P","^4Q"],["^4P","^4Q","^=?"]]],"^2:",["^2;",[[],["^4Q"],["^4P","^4Q"],["^4P","^4Q","^=?"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["^4Q"],["^4P","^4Q"],["^4P","^4Q","^=?"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",9634,"^29",9634,"^2G",3,"^2H",true,"^2:",["^2;",[[],["^4Q"],["^4P","^4Q"],["^4P","^4Q","^=?"]]],"^2A","Returns a lazy seq of nums from start (inclusive) to end\n   (exclusive), by step, where start defaults to 0, step to 1,\n   and end to infinity."],"~$bit-count",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2892,"^25",7,"^29",2892,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$v"]]]]],"^2A","Counts the number of bits set in n"],"^1:","~$cljs.core/bit-count","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2892,"^29",2892,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$v"]]]]],"^2A","Counts the number of bits set in n"],"~$create-node",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7592,"^25",8,"^29",7592,"^24",19,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$shift","~$key1","~$val1","~$key2hash","~$key2","~$val2"],["~$edit","^=D","^=E","^=F","^=G","^=H","^=I"]]]]],"^2K",["^ ","^2C",false,"^2G",7,"^2D",["^2;",[["^=D","^=E","^=F","^=G","^=H","^=I"],["^=J","^=D","^=E","^=F","^=G","^=H","^=I"]]],"^2:",["^2;",[["^=D","^=E","^=F","^=G","^=H","^=I"],["^=J","^=D","^=E","^=F","^=G","^=H","^=I"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/create-node","^2C",false,"^23","cljs/core.cljs","^24",19,"^2K",["^ ","^2C",false,"^2G",7,"^2D",["^2;",[["^=D","^=E","^=F","^=G","^=H","^=I"],["^=J","^=D","^=E","^=F","^=G","^=H","^=I"]]],"^2:",["^2;",[["^=D","^=E","^=F","^=G","^=H","^=I"],["^=J","^=D","^=E","^=F","^=G","^=H","^=I"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^=D","^=E","^=F","^=G","^=H","^=I"],["^=J","^=D","^=E","^=F","^=G","^=H","^=I"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7592,"^29",7592,"^2G",7,"^2H",true,"^2:",["^2;",[["^=D","^=E","^=F","^=G","^=H","^=I"],["^=J","^=D","^=E","^=F","^=G","^=H","^=I"]]]],"~$sort",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2414,"^25",7,"^29",2414,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2O"],["^2P","^2O"]]]]],"^2A","Returns a sorted sequence of the items in coll. Comp can be\n   boolean-valued comparison function, or a -/0/+ valued comparator.\n   Comp defaults to compare.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^2O"],["^2P","^2O"]]],"^2:",["^2;",[["^2O"],["^2P","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/sort","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^2O"],["^2P","^2O"]]],"^2:",["^2;",[["^2O"],["^2P","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O"],["^2P","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2414,"^29",2414,"^2G",2,"^2H",true,"^2:",["^2;",[["^2O"],["^2P","^2O"]]],"^2A","Returns a sorted sequence of the items in coll. Comp can be\n   boolean-valued comparison function, or a -/0/+ valued comparator.\n   Comp defaults to compare."],"~$->MetaFn",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1R","^1Z","^4E","^21"]],"^23","cljs/core.cljs","^24",16,"^25",10,"^26","^27","^28",1995,"^29",1995,"^2:",["^2;",["^2<",["^2;",[["~$afn","^2="]]]]],"^2@",["^19",["^1R","^1Z","^21"]],"^2A","Positional factory function for cljs.core/MetaFn."],"^1O",["^19",["^1R","^1Z","^4E","^21"]],"^1:","~$cljs.core/->MetaFn","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^=O","^2="]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",1995,"^29",1995,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=O","^2="]]]]],"^2@",["^19",["^1R","^1Z","^21"]],"^2A","Positional factory function for cljs.core/MetaFn."],"~$unchecked-inc-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2730,"^25",7,"^29",2730,"^24",24,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/unchecked-inc-int","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2730,"^29",2730,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$-compare",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",818,"^25",12,"^29",818,"^24",20,"^31","^<","^5Y","^6S","^2A","Returns a negative number, zero, or a positive number when x is logically\n     'less than', 'equal to', or 'greater than' y.","^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]]],"^5Y","^6S","^1:","~$cljs.core/-compare","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",816,"^3=","^<","^29",818,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Returns a negative number, zero, or a positive number when x is logically\n     'less than', 'equal to', or 'greater than' y."],"~$map-indexed",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4313,"^25",7,"^29",4313,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","^2O"]]]]],"^2A","Returns a lazy sequence consisting of the result of applying f to 0\n  and the first item of coll, followed by applying f to 1 and the second\n  item in coll, etc, until coll is exhausted. Thus function f should\n  accept 2 arguments, index and item. Returns a stateful transducer when\n  no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/map-indexed","^2C",false,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4313,"^29",4313,"^2G",2,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2A","Returns a lazy sequence consisting of the result of applying f to 0\n  and the first item of coll, followed by applying f to 1 and the second\n  item in coll, etc, until coll is exhausted. Thus function f should\n  accept 2 arguments, index and item. Returns a stateful transducer when\n  no collection is provided."],"~$array-list",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9437,"^25",7,"^29",9437,"^24",17,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"^1:","~$cljs.core/array-list","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9437,"^29",9437,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"~$rand-nth",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10638,"^25",7,"^29",10638,"^24",15,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Return a random element of the (sequential) collection. Will have\n  the same performance characteristics as nth for the given\n  collection."],"^1:","~$cljs.core/rand-nth","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10638,"^29",10638,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Return a random element of the (sequential) collection. Will have\n  the same performance characteristics as nth for the given\n  collection."],"^2P",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4230,"^25",7,"^29",4230,"^24",11,"^2:",["^2;",["^2<",["^2;",[[],["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["~$f1","~$f2","~$f3","~$&","^;B"]]]]],"^2A","Takes a set of functions and returns a fn that is the composition\n  of those fns.  The returned fn takes a variable number of args,\n  applies the rightmost of fns to the args, the next\n  fn (right-to-left) to the result, etc.","^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[[],["~$f"],["~$f","~$g"],["~$f","~$g","~$h"]]],"^2:",["^2;",[[],["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["^=[","^>0","^>1","~$&","^;B"]]],"^2F",["^2;",[null,null,null,null,null]]]],"^1:","~$cljs.core/comp","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[[],["~$f"],["~$f","~$g"],["~$f","~$g","~$h"]]],"^2:",["^2;",[[],["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["^=[","^>0","^>1","~$&","^;B"]]],"^2F",["^2;",[null,null,null,null,null]]],"^2D",["^2;",[[],["~$f"],["~$f","~$g"],["~$f","~$g","~$h"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null]],"^25",1,"^28",4230,"^29",4230,"^2G",3,"^2H",true,"^2:",["^2;",[[],["~$f"],["~$f","~$g"],["~$f","~$g","~$h"],["^=[","^>0","^>1","~$&","^;B"]]],"^2A","Takes a set of functions and returns a fn that is the composition\n  of those fns.  The returned fn takes a variable number of args,\n  applies the rightmost of fns to the args, the next\n  fn (right-to-left) to the result, etc."],"~$array-chunk",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3505,"^25",7,"^29",3505,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^66"],["^66","~$off"],["^66","^>4","^4Q"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^66"],["^66","^>4"],["^66","^>4","^4Q"]]],"^2:",["^2;",[["^66"],["^66","^>4"],["^66","^>4","^4Q"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/array-chunk","^2C",false,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^66"],["^66","^>4"],["^66","^>4","^4Q"]]],"^2:",["^2;",[["^66"],["^66","^>4"],["^66","^>4","^4Q"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["^66"],["^66","^>4"],["^66","^>4","^4Q"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",3505,"^29",3505,"^2G",3,"^2H",true,"^2:",["^2;",[["^66"],["^66","^>4"],["^66","^>4","^4Q"]]]],"~$dispatch-fn",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11061,"^25",7,"^29",11061,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Given a multimethod, return it's dispatch-fn."],"^1:","~$cljs.core/dispatch-fn","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^87"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11061,"^29",11061,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Given a multimethod, return it's dispatch-fn."],"~$bit-shift-right-zero-fill",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2884,"^25",7,"^29",2884,"^24",32,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","DEPRECATED: Bitwise shift right with zero fill"],"^1:","~$cljs.core/bit-shift-right-zero-fill","^2C",false,"^23","cljs/core.cljs","^24",32,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2884,"^29",2884,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","DEPRECATED: Bitwise shift right with zero fill"],"~$js-reserved?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11273,"^25",8,"^29",11273,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^59",true,"^1:","~$cljs.core/js-reserved?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11273,"^29",11273,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$-as-transient",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",783,"^25",9,"^29",783,"^24",22,"^31","^5X","^5Y","^1T","^2A","Returns a new, transient version of the collection, in constant time.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^1T","^1:","~$cljs.core/-as-transient","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",781,"^3=","^5X","^29",783,"^2G",1,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a new, transient version of the collection, in constant time."],"~$dorun",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9771,"^25",7,"^29",9771,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^2O"],["~$n","^2O"]]]]],"^2A","When lazy sequences are produced via functions that have side\n  effects, any effects other than those needed to produce the first\n  element in the seq do not occur until the seq is consumed. dorun can\n  be used to force any effects. Walks through the successive nexts of\n  the seq, does not retain the head and returns nil.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^2O"],["~$n","^2O"]]],"^2:",["^2;",[["^2O"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/dorun","^2C",false,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^2O"],["~$n","^2O"]]],"^2:",["^2;",[["^2O"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O"],["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9771,"^29",9771,"^2G",2,"^2H",true,"^2:",["^2;",[["^2O"],["~$n","^2O"]]],"^2A","When lazy sequences are produced via functions that have side\n  effects, any effects other than those needed to produce the first\n  element in the seq do not occur until the seq is consumed. dorun can\n  be used to force any effects. Walks through the successive nexts of\n  the seq, does not retain the head and returns nil."],"~$pr-sequential-writer",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9852,"^25",7,"^29",9852,"^24",27,"^2:",["^2;",["^2<",["^2;",[["^7K","~$print-one","~$begin","~$sep","^4Q","^2J","^2O"]]]]]],"^1:","~$cljs.core/pr-sequential-writer","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^7K","^>A","^>B","^>C","^4Q","^2J","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9852,"^29",9852,"^2G",7,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7K","^>A","^>B","^>C","^4Q","^2J","^2O"]]]]]],"~$simple-symbol?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3344,"^25",16,"^29",3344,"^24",30,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a symbol without a namespace"],"^1:","~$cljs.core/simple-symbol?","^2C",false,"^23","cljs/core.cljs","^24",30,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3344,"^3=","^3:","^29",3344,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a symbol without a namespace"],"~$accumulating-seq-count",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1794,"^25",8,"^29",1794,"^24",30,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^59",true,"^1:","~$cljs.core/accumulating-seq-count","^2C",false,"^23","cljs/core.cljs","^24",30,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1794,"^29",1794,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"~$IIndexed",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",592,"^25",14,"^29",592,"^24",22,"^2A","Protocol for collections to provide indexed-based access to their items.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-nth",[["^2O","~$n"],["^2O","~$n","^73"]]]]],"^2S",true,"^1:","^5B","^23","cljs/core.cljs","^24",22,"^25",1,"^28",592,"^2U",["^ ","^2V",["^ ","^>J",[["^2O","~$n"],["^2O","~$n","^73"]]]],"^30",null,"^29",592,"^31","^32","^33",["^19",["^34","^5F","^4Y","^4Z","^4[","^50","^:G","~$cljs.core/Range","^52"]],"^2A","Protocol for collections to provide indexed-based access to their items.","^2T",["^2;",["@interface"]]],"~$disj",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2079,"^25",7,"^29",2079,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","^8J"]]]]],"^2A","disj[oin]. Returns a new set of the same (hashed/sorted) type, that\n  does not contain key(s).","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2O"],["^2O","~$k"]]],"^2:",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","^8J"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/disj","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2O"],["^2O","~$k"]]],"^2:",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","^8J"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["^2O"],["^2O","~$k"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2079,"^29",2079,"^2G",2,"^2H",true,"^2:",["^2;",[["^2O"],["^2O","~$k"],["^2O","~$k","~$&","^8J"]]],"^2A","disj[oin]. Returns a new set of the same (hashed/sorted) type, that\n  does not contain key(s)."],"~$MultiIterator",["^ ","^3S",1,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/MultiIterator","^23","cljs/core.cljs","^24",23,"^3W",true,"^25",10,"^28",4070,"^3X",false,"^29",4070,"^31","^3Y","^2@",null],"~$IPrintWithWriter",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",757,"^25",14,"^29",757,"^24",30,"^2A","The old IPrintable protocol's implementation consisted of building a giant\n   list of strings to concatenate.  This involved lots of concat calls,\n   intermediate vectors, and lazy-seqs, and was very slow in some older JS\n   engines.  IPrintWithWriter implements printing via the IWriter protocol, so it\n   be implemented efficiently in terms of e.g. a StringBuffer append.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-pr-writer",[["~$o","^7K","^2J"]]]]],"^2S",true,"^1:","^5N","^23","cljs/core.cljs","^24",30,"^25",1,"^28",757,"^2U",["^ ","^2V",["^ ","^>Q",[["~$o","^7K","^2J"]]]],"^30",null,"^29",757,"^31","^32","^33",["^19",["^4V","^4W","~$cljs.core/Cons","~$cljs.core/Eduction","^4X","^9[","~$cljs.core/PersistentQueue","^5F","^3V","~$cljs.core/Keyword","^4Y","^4Z","~$cljs.core/EmptyList","^8?","^4[","~$cljs.core/PersistentQueueSeq","~$cljs.core/ExceptionInfo","^4F","~$cljs.core/ArrayNodeSeq","~$cljs.core/ValSeq","^7C","~$cljs.core/Cycle","^<:","^;V","^50","~$cljs.core/List","~$cljs.core/Repeat","~$cljs.core/TransformerIterator","~$cljs.core/RSeq","~$cljs.core/Iterate","^7E","^51","~$cljs.core/KeySeq","~$cljs.core/ChunkedSeq","~$cljs.core/Atom","^7F","~$cljs.core/ChunkedCons","^<E","^42","^>K","^9>","^52"]],"^2A","The old IPrintable protocol's implementation consisted of building a giant\n   list of strings to concatenate.  This involved lots of concat calls,\n   intermediate vectors, and lazy-seqs, and was very slow in some older JS\n   engines.  IPrintWithWriter implements printing via the IWriter protocol, so it\n   be implemented efficiently in terms of e.g. a StringBuffer append.","^2T",["^2;",["@interface"]]],"~$->UUID",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1U","^5N","^6S","^41"]],"^23","cljs/core.cljs","^24",14,"^25",10,"^26","^27","^28",11068,"^29",11068,"^2:",["^2;",["^2<",["^2;",[["^3N","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^5N","^6S"]],"^2A","Positional factory function for cljs.core/UUID."],"^1O",["^19",["^1P","^1Q","^1U","^5N","^6S","^41"]],"^1:","~$cljs.core/->UUID","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^3N","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",11068,"^29",11068,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3N","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^5N","^6S"]],"^2A","Positional factory function for cljs.core/UUID."],"~$IVector",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",666,"^25",14,"^29",666,"^24",21,"^2A","Protocol for adding vector functionality to collections.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-assoc-n",[["^2O","~$n","^2Z"]]]]],"^2S",true,"^1:","^8S","^23","cljs/core.cljs","^24",21,"^25",1,"^28",666,"^2U",["^ ","^2V",["^ ","^?<",[["^2O","~$n","^2Z"]]]],"^30",null,"^29",666,"^31","^32","^33",["^19",["^4Y","^4Z","^4[","^50","^52"]],"^2A","Protocol for adding vector functionality to collections.","^2T",["^2;",["@interface"]]],"~$IIterable",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",865,"^25",14,"^29",865,"^24",23,"^2A","Protocol for iterating over a collection.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^6C",[["^2O"]]]]],"^2S",true,"^1:","^20","^23","cljs/core.cljs","^24",23,"^25",1,"^28",865,"^2U",["^ ","^2V",["^ ","^6C",[["^2O"]]]],"^30",null,"^29",865,"^31","^32","^33",["^19",["^4V","^>S","^4X","^>T","^5F","^4[","^50","~$cljs.core/ArrayNode","^7E","~$cljs.core/HashCollisionNode","^>K","~$cljs.core/BitmapIndexedNode"]],"^2A","Protocol for iterating over a collection.","^2T",["^2;",["@interface"]]],"~$->MultiIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",23,"^25",10,"^26","^27","^28",4070,"^29",4070,"^2:",["^2;",["^2<",["^2;",[["~$iters"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/MultiIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->MultiIterator","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^?B"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4070,"^29",4070,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^?B"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/MultiIterator."],"~$*2",["^ ","^1:","~$cljs.core/*2","^23","cljs/core.cljs","^28",203,"^25",1,"^29",205,"^24",5,"^2A","bound in a repl thread to the second most recent value printed","^1N",["^ ","^23","cljs/core.cljs","^28",205,"^25",3,"^29",205,"^24",5,"^2A","bound in a repl thread to the second most recent value printed"]],"^J",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11534,"^25",7,"^29",11534,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$form"]]]]],"^2A","Evaluates the form data structure (not text!) and returns the result.\n  Delegates to cljs.core/*eval*. Intended for use in self-hosted ClojureScript,\n  which sets up an implementation of cljs.core/*eval* for that environment."],"^1:","~$cljs.core/eval","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^?F"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11534,"^29",11534,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^?F"]]]]],"^2A","Evaluates the form data structure (not text!) and returns the result.\n  Delegates to cljs.core/*eval*. Intended for use in self-hosted ClojureScript,\n  which sets up an implementation of cljs.core/*eval* for that environment."],"~$Eduction",["^ ","^3S",2,"^1O",["^19",["^1U","^1Y","^5N","^20","^4K","^5E"]],"^1:","^>S","^23","cljs/core.cljs","^24",18,"^3W",true,"^25",10,"^28",10469,"^3X",false,"^29",10469,"^31","^3Y","^2@",["^19",["^1Y","^5N","^20","^4K","^5E"]]],"~$pv-clone-node",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5306,"^25",8,"^29",5306,"^24",21,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^84"]]]]]],"^59",true,"^1:","~$cljs.core/pv-clone-node","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^84"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5306,"^29",5306,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^84"]]]]]],"~$cons",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3251,"^25",7,"^29",3251,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$x","^2O"]]]]],"^2A","Returns a new seq where x is the first element and coll is the rest."],"^1:","~$cljs.core/cons","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$x","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3251,"^29",3251,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","^2O"]]]]],"^2A","Returns a new seq where x is the first element and coll is the rest."],"~$PersistentTreeSet",["^ ","^3S",3,"^1O",["^19",["^5C","^1P","^1Q","^1R","^1S","^1U","^1V","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^22"]],"^1:","^7F","^23","cljs/core.cljs","^24",27,"^3W",true,"^25",10,"^28",9200,"^3X",false,"^29",9200,"^31","^3Y","^2@",["^19",["^5C","^1P","^1Q","^1R","^1S","^1V","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^22"]]],"~$->HashSetIter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",21,"^25",10,"^26","^27","^28",9032,"^29",9032,"^2:",["^2;",["^2<",["^2;",[["^4A"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/HashSetIter."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->HashSetIter","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^4A"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",9032,"^29",9032,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4A"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/HashSetIter."],"~$ns-lookup",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11378,"^25",8,"^29",11378,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$ns-obj","~$k"]]]]],"^2A","Bootstrap only."],"^59",true,"^1:","~$cljs.core/ns-lookup","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^?Q","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11378,"^29",11378,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^?Q","~$k"]]]]],"^2A","Bootstrap only."],"~$floats",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2802,"^25",7,"^29",2802,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/floats","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2802,"^29",2802,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$TransientVector",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",5427,"^25",44,"^29",5427,"^24",59,"^5A",true],"^3S",4,"^1O",["^19",["^5B","^1R","^1X","~$cljs.core/ITransientCollection","~$cljs.core/ITransientVector","^2[","^22"]],"^1:","^34","^23","cljs/core.cljs","^24",25,"^3W",true,"^25",10,"^28",5973,"^3X",false,"^5A",true,"^29",5973,"^31","^3Y","^2@",["^19",["^5B","^1R","^1X","^?V","^?W","^2[","^22"]]],"~$pos?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2912,"^25",16,"^29",2912,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if num is greater than zero, else false"],"^1:","~$cljs.core/pos?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2912,"^3=","^3:","^29",2912,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if num is greater than zero, else false"],"~$fnil",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4288,"^25",7,"^29",4288,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$f","~$x"],["~$f","~$x","~$y"],["~$f","~$x","~$y","~$z"]]]]],"^2A","Takes a function f, and returns a function that calls f, replacing\n  a nil first argument to f with the supplied value x. Higher arity\n  versions can replace arguments in the second and third\n  positions (y, z). Note that the function f can take any number of\n  arguments, not just the one(s) being nil-patched.","^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["~$f","~$x"],["~$f","~$x","~$y"],["~$f","~$x","~$y","~$z"]]],"^2:",["^2;",[["~$f","~$x"],["~$f","~$x","~$y"],["~$f","~$x","~$y","~$z"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/fnil","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["~$f","~$x"],["~$f","~$x","~$y"],["~$f","~$x","~$y","~$z"]]],"^2:",["^2;",[["~$f","~$x"],["~$f","~$x","~$y"],["~$f","~$x","~$y","~$z"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$f","~$x"],["~$f","~$x","~$y"],["~$f","~$x","~$y","~$z"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",4288,"^29",4288,"^2G",4,"^2H",true,"^2:",["^2;",[["~$f","~$x"],["~$f","~$x","~$y"],["~$f","~$x","~$y","~$z"]]],"^2A","Takes a function f, and returns a function that calls f, replacing\n  a nil first argument to f with the supplied value x. Higher arity\n  versions can replace arguments in the second and third\n  positions (y, z). Note that the function f can take any number of\n  arguments, not just the one(s) being nil-patched."],"~$merge-with",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8998,"^25",7,"^29",8998,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$f","~$&","~$maps"]]]]],"^2A","Returns a map that consists of the rest of the maps conj-ed onto\n  the first.  If a key occurs in more than one map, the mapping(s)\n  from the latter (left-to-right) will be combined with the mapping in\n  the result by calling (f val-in-result val-in-latter).","^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["~$f","^@1"]]],"^2:",["^2;",[["~$f","~$&","^@1"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/merge-with","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["~$f","^@1"]]],"^2:",["^2;",[["~$f","~$&","^@1"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["~$f","^@1"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",8998,"^29",8998,"^2G",1,"^2H",true,"^2:",["^2;",[["~$f","~$&","^@1"]]],"^2A","Returns a map that consists of the rest of the maps conj-ed onto\n  the first.  If a key occurs in more than one map, the mapping(s)\n  from the latter (left-to-right) will be combined with the mapping in\n  the result by calling (f val-in-result val-in-latter)."],"~$nthrest",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1909,"^25",7,"^29",1909,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^2O","~$n"]]]]],"^2A","Returns the nth rest of coll, coll when n is 0."],"^1:","~$cljs.core/nthrest","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1909,"^29",1909,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$n"]]]]],"^2A","Returns the nth rest of coll, coll when n is 0."],"~$*warn-on-infer*",["^ ","^1:","~$cljs.core/*warn-on-infer*","^23","cljs/core.cljs","^28",33,"^25",1,"^29",33,"^24",21,"^1N",["^ ","^23","cljs/core.cljs","^28",33,"^25",6,"^29",33,"^24",21],"^31","^3:"],"^4T",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",636,"^25",4,"^29",636,"^24",9,"^5Y","^4U","^2A","Returns the map entry for key, or nil if key not present.","^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]]],"^5Y","^4U","^1:","~$cljs.core/-find","^2C",false,"^23","cljs/core.cljs","^24",9,"^2D",["^2;",[["^2O","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",634,"^29",636,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]],"^2A","Returns the map entry for key, or nil if key not present."],"~$sequential?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2121,"^25",16,"^29",2121,"^24",27,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll satisfies ISequential"],"^1:","~$cljs.core/sequential?","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2121,"^3=","^3:","^29",2121,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll satisfies ISequential"],"~$tree-map-replace",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8625,"^25",8,"^29",8625,"^24",24,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2P","^5R","~$k","~$v"]]]]]],"^59",true,"^1:","~$cljs.core/tree-map-replace","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^2P","^5R","~$k","~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8625,"^29",8625,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2P","^5R","~$k","~$v"]]]]]],"~$checked-aset'",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",488,"^25",8,"^29",488,"^24",21,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^79","^7:","^2Z"],["^79","^7:","~$idx2","~$&","~$idxv"]]]]],"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/checked-aset'","^2C",true,"^23","cljs/core.cljs","^24",21,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",488,"^29",488,"^2G",3,"^2H",true,"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]]],"~$m3-mix-H1",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",917,"^25",15,"^29",917,"^24",24,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$h1","~$k1"]]]]]],"^1:","~$cljs.core/m3-mix-H1","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^@A","^@B"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",917,"^3=","^<","^29",917,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^@A","^@B"]]]]]],"~$RecordIter",["^ ","^3S",5,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/RecordIter","^23","cljs/core.cljs","^24",20,"^3W",true,"^25",10,"^28",6438,"^3X",false,"^29",6438,"^31","^3Y","^2@",null],"~$->TransientArrayMap",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1R","^:3","^1X","^?V","^2[","^22"]],"^23","cljs/core.cljs","^24",27,"^25",10,"^26","^27","^28",6953,"^29",6953,"^2:",["^2;",["^2<",["^2;",[["~$editable?","^5<","^66"]]]]],"^2@",["^19",["^1R","^:3","^1X","^?V","^2[","^22"]],"^2A","Positional factory function for cljs.core/TransientArrayMap."],"^1O",["^19",["^1R","^:3","^1X","^?V","^2[","^22"]],"^1:","~$cljs.core/->TransientArrayMap","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^@G","^5<","^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6953,"^29",6953,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^@G","^5<","^66"]]]]],"^2@",["^19",["^1R","^:3","^1X","^?V","^2[","^22"]],"^2A","Positional factory function for cljs.core/TransientArrayMap."],"~$t_cljs$core10805",["^ ","^3S",1,"^1O",["^19",["^1U","^1Z","^21"]],"^1:","~$cljs.core/t_cljs$core10805","^23","cljs/core.cljs","^3W",true,"^8W",true,"^25",3,"^28",3961,"^3X",false,"^31","^3Y","^2@",["^19",["^1Z","^21"]]],"~$prim-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1656,"^25",7,"^29",1656,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$prim"],["^@L","~$i"]]]]],"^2A","Create seq from a primitive JavaScript Array-like.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^@L"],["^@L","~$i"]]],"^2:",["^2;",[["^@L"],["^@L","~$i"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/prim-seq","^2C",false,"^23","cljs/core.cljs","^24",15,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^@L"],["^@L","~$i"]]],"^2:",["^2;",[["^@L"],["^@L","~$i"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^@L"],["^@L","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1656,"^29",1656,"^2G",2,"^2H",true,"^2:",["^2;",[["^@L"],["^@L","~$i"]]],"^2A","Create seq from a primitive JavaScript Array-like."],"~$*print-level*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",163,"^25",3,"^29",163,"^24",16,"^6F",true,"^2A","*print-level* controls how many levels deep the printer will\n  print nested objects. If it is bound to logical false, there is no\n  limit. Otherwise, it must be bound to an integer indicating the maximum\n  level to print. Each argument to print is at level 0; if an argument is a\n  collection, its items are at level 1; and so on. If an object is a\n  collection and is at a level greater than or equal to the value bound to\n  *print-level*, the printer prints '#' to represent it. The root binding\n  is nil indicating no limit.","^2T",["@type {null|number}"]],"^1:","~$cljs.core/*print-level*","^23","cljs/core.cljs","^24",16,"^25",1,"^6F",true,"^28",152,"^29",163,"^31","^57","^2A","*print-level* controls how many levels deep the printer will\n  print nested objects. If it is bound to logical false, there is no\n  limit. Otherwise, it must be bound to an integer indicating the maximum\n  level to print. Each argument to print is at level 0; if an argument is a\n  collection, its items are at level 1; and so on. If an object is a\n  collection and is at a level greater than or equal to the value bound to\n  *print-level*, the printer prints '#' to represent it. The root binding\n  is nil indicating no limit.","^2T",["@type {null|number}"]],"~$shuffle",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2455,"^25",7,"^29",2455,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Return a random permutation of coll"],"^1:","~$cljs.core/shuffle","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2455,"^29",2455,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Return a random permutation of coll"],"~$ChunkedSeq",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",2149,"^25",22,"^29",2149,"^24",32,"^5A",true],"^3S",6,"^1O",["^19",["^1P","^1Q","^5D","^1S","~$cljs.core/IChunkedNext","^1U","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21","^5E"]],"^1:","^?6","^23","cljs/core.cljs","^24",20,"^3W",true,"^25",10,"^28",5667,"^3X",false,"^5A",true,"^29",5667,"^31","^3Y","^2@",["^19",["^1P","^1Q","^5D","^1S","^@S","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21","^5E"]]],"~$hash-keyword",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3259,"^25",7,"^29",3259,"^24",19,"^2:",["^2;",["^2<",["^2;",[["~$k"]]]]]],"^1:","~$cljs.core/hash-keyword","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3259,"^29",3259,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$k"]]]]]],"~$find",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2328,"^25",7,"^29",2328,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]],"^2A","Returns the map entry for key, or nil if key not present."],"^1:","~$cljs.core/find","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^2O","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2328,"^29",2328,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]],"^2A","Returns the map entry for key, or nil if key not present."],"~$alength",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",511,"^25",15,"^29",511,"^24",22,"^31","^<","^2:",["^2;",["^2<",["^2;",[["^79"]]]]],"^2A","Returns the length of the array. Works on arrays of all types."],"^1:","~$cljs.core/alength","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^79"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",511,"^3=","^<","^29",511,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^79"]]]]],"^2A","Returns the length of the array. Works on arrays of all types."],"~$bit-xor",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2828,"^25",7,"^29",2828,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Bitwise exclusive or","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/bit-xor","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2828,"^29",2828,"^2G",2,"^2H",true,"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Bitwise exclusive or"],"~$->IndexedSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5B","^5C","^1P","^1Q","^5D","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",20,"^25",10,"^26","^27","^28",1568,"^29",1568,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^2="]]]]],"^2@",["^19",["^5B","^5C","^1P","^1Q","^5D","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/IndexedSeq."],"^1O",["^19",["^5B","^5C","^1P","^1Q","^5D","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^1:","~$cljs.core/->IndexedSeq","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^66","~$i","^2="]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",1568,"^29",1568,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^2="]]]]],"^2@",["^19",["^5B","^5C","^1P","^1Q","^5D","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/IndexedSeq."],"~$->t_cljs$core10805",["^ ","^1M",null,"^1N",["^ ","^8W",true,"^1O",["^19",["^1U","^1Z","^21"]],"^2@",["^19",["^1Z","^21"]],"^26","^27","^2:",["^2;",["^2<",["^2;",[["~$meta10806"]]]]],"^2A","Positional factory function for cljs.core/t_cljs$core10805.","^23","cljs/core.cljs"],"^1O",["^19",["^1U","^1Z","^21"]],"^1:","~$cljs.core/->t_cljs$core10805","^2C",false,"^23","cljs/core.cljs","^2D",["^2;",[["^A3"]]],"^2E",null,"^2F",["^2;",[null,null]],"^8W",true,"^25",3,"^26","^27","^28",3961,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^A3"]]]]],"^2@",["^19",["^1Z","^21"]],"^2A","Positional factory function for cljs.core/t_cljs$core10805."],"~$ObjMap",["^ ","^3S",5,"^1O",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^21","^7W","~$cljs.core/IMap","^22"]],"^1:","^4W","^23","cljs/core.cljs","^24",16,"^3W",true,"^25",10,"^28",6321,"^3X",false,"^29",6321,"^31","^3Y","^2@",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^21","^7W","^A6","^22"]]],"~$unsigned-bit-shift-right",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2888,"^25",7,"^29",2888,"^24",31,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Bitwise shift right with zero fill"],"^1:","~$cljs.core/unsigned-bit-shift-right","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2888,"^29",2888,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Bitwise shift right with zero fill"],"~$ES6SetEntriesIterator",["^ ","^3S",1,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/ES6SetEntriesIterator","^23","cljs/core.cljs","^24",31,"^3W",true,"^25",10,"^28",6464,"^3X",false,"^29",6464,"^31","^3Y","^2@",null],"~$neg?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2921,"^25",16,"^29",2921,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if num is less than zero, else false"],"^1:","~$cljs.core/neg?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2921,"^3=","^3:","^29",2921,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if num is less than zero, else false"],"~$Cons",["^ ","^3S",4,"^1O",["^19",["~$cljs.core/IList","^1P","^1Q","^5D","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]],"^1:","^>R","^23","cljs/core.cljs","^24",14,"^3W",true,"^25",10,"^28",3194,"^3X",false,"^29",3194,"^31","^3Y","^2@",["^19",["^A>","^1P","^1Q","^5D","^1S","^1W","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]]],"~$-remove-method",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10832,"^25",4,"^29",10832,"^24",18,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R","^7S"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-remove-method","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^7R","^7S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10832,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R","^7S"]]]]],"^2A",null],"~$->StringIter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",20,"^25",10,"^26","^27","^28",3967,"^29",3967,"^2:",["^2;",["^2<",["^2;",[["~$s","~$i"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/StringIter."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->StringIter","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$s","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3967,"^29",3967,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s","~$i"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/StringIter."],"~$js-invoke",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",526,"^25",7,"^29",526,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^3;","~$s","~$&","~$args"]]]]],"^2A","Invoke JavaScript object method via string. Needed when the\n  string is not a valid unquoted property name.","^2K",["^ ","^2C",true,"^2G",2,"^2D",[["^2;",["^3;","~$s","^AD"]]],"^2:",["^2;",[["^3;","~$s","~$&","^AD"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/js-invoke","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",2,"^2D",[["^2;",["^3;","~$s","^AD"]]],"^2:",["^2;",[["^3;","~$s","~$&","^AD"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^3;","~$s","^AD"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",526,"^29",526,"^2G",2,"^2H",true,"^2:",["^2;",[["^3;","~$s","~$&","^AD"]]],"^2A","Invoke JavaScript object method via string. Needed when the\n  string is not a valid unquoted property name."],"~$->List",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^A>","^1P","^1Q","^5D","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",14,"^25",10,"^26","^27","^28",3017,"^29",3017,"^2:",["^2;",["^2<",["^2;",[["^2=","^6J","^;P","~$count","^2?"]]]]],"^2@",["^19",["^A>","^1P","^1Q","^5D","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/List."],"^1O",["^19",["^A>","^1P","^1Q","^5D","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^1:","~$cljs.core/->List","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2=","^6J","^;P","^AG","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3017,"^29",3017,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^6J","^;P","^AG","^2?"]]]]],"^2@",["^19",["^A>","^1P","^1Q","^5D","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/List."],"~$m3-mix-K1",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",914,"^25",15,"^29",914,"^24",24,"^31","^<","^2:",["^2;",["^2<",["^2;",[["^@B"]]]]]],"^1:","~$cljs.core/m3-mix-K1","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^@B"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",914,"^3=","^<","^29",914,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^@B"]]]]]],"~$Iterate",["^ ","^3S",5,"^1O",["^19",["^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","^?4","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",4976,"^3X",false,"^29",4976,"^31","^3Y","^2@",["^19",["^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"~$unchecked-float",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2693,"^25",15,"^29",2693,"^24",30,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/unchecked-float","^2C",false,"^23","cljs/core.cljs","^24",30,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2693,"^3=","^<","^29",2693,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$undefined?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2207,"^25",16,"^29",2207,"^24",26,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x identical to the JavaScript undefined value."],"^1:","~$cljs.core/undefined?","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2207,"^3=","^3:","^29",2207,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x identical to the JavaScript undefined value."],"~$IMeta",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",679,"^25",14,"^29",679,"^24",19,"^2A","Protocol for accessing the metadata of an object.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-meta",[["~$o"]]]]],"^2S",true,"^1:","^1Z","^23","cljs/core.cljs","^24",19,"^25",1,"^28",679,"^2U",["^ ","^2V",["^ ","^AQ",[["~$o"]]]],"^30",null,"^29",679,"^31","^32","^33",["^19",["^4V","^4W","^>R","^4X","^9[","^>T","^5F","^4Y","^4Z","^>V","^8?","^4[","^>W","^4F","^>Y","^>Z","^>[","^;V","^50","^?0","^?1","^?3","^?4","^7E","^3Y","^51","^?5","^?6","^?7","^7F","^?8","^<E","~$cljs.core/MetaFn","~$cljs.core/t_cljs$core1500","^>K","^9>","^52"]],"^2A","Protocol for accessing the metadata of an object.","^2T",["^2;",["@interface"]]],"~$reduced?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1426,"^25",16,"^29",1426,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$r"]]]]],"^2A","Returns true if x is the result of a call to reduced"],"^1:","~$cljs.core/reduced?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$r"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1426,"^3=","^3:","^29",1426,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$r"]]]]],"^2A","Returns true if x is the result of a call to reduced"],"~$apply-to",["^ ","^1M",null,"^1N",["^ ","^2:",["^2;",["^2<",["^2;",[["~$f","~$argc","^AD"]]]]],"^23","cljs/core.cljs"],"^1:","~$cljs.core/apply-to","^2C",false,"^23","cljs/core.cljs","^2D",["^2;",[["~$f","^AW","^AD"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3845,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f","^AW","^AD"]]]]]],"~$disj!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3830,"^25",7,"^29",3830,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^2X","^2Z"],["^2X","^2Z","~$&","~$vals"]]]]],"^2A","disj[oin]. Returns a transient set of the same (hashed/sorted) type, that\n  does not contain key(s).","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2X","^2Z"]]],"^2:",["^2;",[["^2X","^2Z"],["^2X","^2Z","~$&","^AZ"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/disj!","^2C",true,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2X","^2Z"]]],"^2:",["^2;",[["^2X","^2Z"],["^2X","^2Z","~$&","^AZ"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2X","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3830,"^29",3830,"^2G",2,"^2H",true,"^2:",["^2;",[["^2X","^2Z"],["^2X","^2Z","~$&","^AZ"]]],"^2A","disj[oin]. Returns a transient set of the same (hashed/sorted) type, that\n  does not contain key(s)."],"^7B",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",621,"^25",4,"^29",621,"^24",11,"^5Y","^22","^2A","Use k to look up a value in o. If not-found is supplied and k is not\n     a valid value that can be used for look up, not-found is returned.","^2:",["^2;",["^2<",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2:",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2F",["^2;",[null,null]]]],"^5Y","^22","^1:","~$cljs.core/-lookup","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2:",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",619,"^29",621,"^2G",3,"^2H",true,"^2:",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2A","Use k to look up a value in o. If not-found is supplied and k is not\n     a valid value that can be used for look up, not-found is returned."],"~$float?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2301,"^25",16,"^29",2301,"^24",22,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true for JavaScript numbers, false otherwise."],"^1:","~$cljs.core/float?","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2301,"^3=","^3:","^29",2301,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true for JavaScript numbers, false otherwise."],"~$ICloneable",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",565,"^25",14,"^29",565,"^24",24,"^2A","Protocol for cloning a value.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^<1",[["^4@"]]]]],"^2S",true,"^1:","^1[","^23","cljs/core.cljs","^24",24,"^25",1,"^28",565,"^2U",["^ ","^2V",["^ ","^<1",[["^4@"]]]],"^30",null,"^29",565,"^31","^32","^33",["^19",["^4V","^>R","^4X","^>T","^5F","^>V","^4[","^50","^?0","^?3","^7E","^51","^7F","^>K"]],"^2A","Protocol for cloning a value.","^2T",["^2;",["@interface"]]],"~$IEncodeClojure",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",10561,"^25",14,"^29",10561,"^24",28,"^2A",null,"^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^89",[["~$x","^8;"]]]]],"^2S",true,"^1:","^8:","^23","cljs/core.cljs","^24",28,"^25",1,"^28",10561,"^2U",["^ ","^2V",["^ ","^89",[["~$x","^8;"]]]],"^30",null,"^29",10561,"^31","^32","^33",["^19",[]],"^2A",null,"^2T",["^2;",["@interface"]]],"~$booleans",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2797,"^25",7,"^29",2797,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/booleans","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2797,"^29",2797,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$->ArrayList",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",19,"^25",10,"^26","^27","^28",9429,"^29",9429,"^2:",["^2;",["^2<",["^2;",[["^66"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ArrayList."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->ArrayList","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",9429,"^29",9429,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ArrayList."],"~$RSeq",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",1515,"^25",40,"^29",1515,"^24",44,"^5A",true],"^3S",3,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]],"^1:","^?3","^23","cljs/core.cljs","^24",14,"^3W",true,"^25",10,"^28",1673,"^3X",false,"^5A",true,"^29",1673,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]]],"~$mask",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7054,"^25",8,"^29",7054,"^24",12,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$hash","^=D"]]]]]],"^59",true,"^1:","~$cljs.core/mask","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^B;","^=D"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7054,"^29",7054,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^B;","^=D"]]]]]],"~$int-array",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3630,"^25",7,"^29",3630,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$size-or-seq"],["~$size","~$init-val-or-seq"]]]]],"^2A","Creates an array of ints. Does not coerce array, provided for compatibility\n  with Clojure.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/int-array","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3630,"^29",3630,"^2G",2,"^2H",true,"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2A","Creates an array of ints. Does not coerce array, provided for compatibility\n  with Clojure."],"~$find-and-cache-best-method",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10801,"^25",8,"^29",10801,"^24",34,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^:","^7S","^63","^61","~$prefer-table","^60","^62","~$default-dispatch-val"]]]]]],"^59",true,"^1:","~$cljs.core/find-and-cache-best-method","^2C",false,"^23","cljs/core.cljs","^24",34,"^2D",["^2;",[["^:","^7S","^63","^61","^BC","^60","^62","^BD"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10801,"^29",10801,"^2G",8,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:","^7S","^63","^61","^BC","^60","^62","^BD"]]]]]],"~$set?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2106,"^25",16,"^29",2106,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x satisfies ISet"],"^1:","~$cljs.core/set?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2106,"^3=","^3:","^29",2106,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x satisfies ISet"],"~$iterable?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1187,"^25",16,"^29",1187,"^24",25,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x implements IIterable protocol."],"^1:","~$cljs.core/iterable?","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1187,"^3=","^3:","^29",1187,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x implements IIterable protocol."],"~$cat",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10406,"^25",7,"^29",10406,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$rf"]]]]],"^2A","A transducer which concatenates the contents of each input, which must be a\n  collection, into the reduction.","^76","1.7"],"^76","1.7","^1:","~$cljs.core/cat","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^BK"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10406,"^29",10406,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^BK"]]]]],"^2A","A transducer which concatenates the contents of each input, which must be a\n  collection, into the reduction."],"~$->ES6EntriesIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",28,"^25",10,"^26","^27","^28",6451,"^29",6451,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ES6EntriesIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->ES6EntriesIterator","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6451,"^29",6451,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ES6EntriesIterator."],"~$divide",["^ ","^1:","~$cljs.core/divide","^23","cljs/core.cljs","^28",2601,"^25",1,"^29",2601,"^24",16,"^5A",true,"^1N",["^ ","^23","cljs/core.cljs","^28",2601,"^25",10,"^29",2601,"^24",16,"^5A",true]],"~$js-reserved-arr",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",11254,"^25",3,"^29",11254,"^24",18,"^59",true,"^2T",["@type {*}"]],"^59",true,"^1:","~$cljs.core/js-reserved-arr","^23","cljs/core.cljs","^24",18,"^25",1,"^28",11251,"^29",11254,"^31","^79","^2T",["@type {*}"]],"^>Q",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",763,"^25",4,"^29",763,"^24",14,"^5Y","^5N","^2A",null,"^2:",["^2;",["^2<",["^2;",[["~$o","^7K","^2J"]]]]]],"^5Y","^5N","^1:","~$cljs.core/-pr-writer","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$o","^7K","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",757,"^29",763,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o","^7K","^2J"]]]]],"^2A",null],"~$flush",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9885,"^25",7,"^29",9885,"^24",12,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"^1:","~$cljs.core/flush","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9885,"^29",9885,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"~$set-from-indexed-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9298,"^25",7,"^29",9298,"^24",27,"^2:",["^2;",["^2<",["^2;",[["~$iseq"]]]]]],"^1:","~$cljs.core/set-from-indexed-seq","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^BW"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9298,"^29",9298,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^BW"]]]]]],"~$maybe-init-tapset",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11345,"^25",8,"^29",11345,"^24",25,"^59",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"^59",true,"^1:","~$cljs.core/maybe-init-tapset","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11345,"^29",11345,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"~$take-while",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9471,"^25",7,"^29",9471,"^24",17,"^2:",["^2;",["^2<",["^2;",[["^4<"],["^4<","^2O"]]]]],"^2A","Returns a lazy sequence of successive items from coll while\n  (pred item) returns logical true. pred must be free of side-effects.\n  Returns a transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/take-while","^2C",false,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9471,"^29",9471,"^2G",2,"^2H",true,"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2A","Returns a lazy sequence of successive items from coll while\n  (pred item) returns logical true. pred must be free of side-effects.\n  Returns a transducer when no collection is provided."],"~$vary-meta",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3933,"^25",7,"^29",3933,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^3;","~$f"],["^3;","~$f","~$a"],["^3;","~$f","~$a","~$b"],["^3;","~$f","~$a","~$b","~$c"],["^3;","~$f","~$a","~$b","~$c","~$d"],["^3;","~$f","~$a","~$b","~$c","~$d","~$&","^AD"]]]]],"^2A","Returns an object of the same type and value as obj, with\n  (apply f (meta obj) args) as its metadata.","^2K",["^ ","^2C",true,"^2G",6,"^2D",["^2;",[["^3;","~$f"],["^3;","~$f","~$a"],["^3;","~$f","~$a","~$b"],["^3;","~$f","~$a","~$b","~$c"],["^3;","~$f","~$a","~$b","~$c","~$d"]]],"^2:",["^2;",[["^3;","~$f"],["^3;","~$f","~$a"],["^3;","~$f","~$a","~$b"],["^3;","~$f","~$a","~$b","~$c"],["^3;","~$f","~$a","~$b","~$c","~$d"],["^3;","~$f","~$a","~$b","~$c","~$d","~$&","^AD"]]],"^2F",["^2;",[null,null,null,null,null,null]]]],"^1:","~$cljs.core/vary-meta","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",6,"^2D",["^2;",[["^3;","~$f"],["^3;","~$f","~$a"],["^3;","~$f","~$a","~$b"],["^3;","~$f","~$a","~$b","~$c"],["^3;","~$f","~$a","~$b","~$c","~$d"]]],"^2:",["^2;",[["^3;","~$f"],["^3;","~$f","~$a"],["^3;","~$f","~$a","~$b"],["^3;","~$f","~$a","~$b","~$c"],["^3;","~$f","~$a","~$b","~$c","~$d"],["^3;","~$f","~$a","~$b","~$c","~$d","~$&","^AD"]]],"^2F",["^2;",[null,null,null,null,null,null]]],"^2D",["^2;",[["^3;","~$f"],["^3;","~$f","~$a"],["^3;","~$f","~$a","~$b"],["^3;","~$f","~$a","~$b","~$c"],["^3;","~$f","~$a","~$b","~$c","~$d"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null,null]],"^25",1,"^28",3933,"^29",3933,"^2G",6,"^2H",true,"^2:",["^2;",[["^3;","~$f"],["^3;","~$f","~$a"],["^3;","~$f","~$a","~$b"],["^3;","~$f","~$a","~$b","~$c"],["^3;","~$f","~$a","~$b","~$c","~$d"],["^3;","~$f","~$a","~$b","~$c","~$d","~$&","^AD"]]],"^2A","Returns an object of the same type and value as obj, with\n  (apply f (meta obj) args) as its metadata."],"~$INext",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",611,"^25",14,"^29",611,"^24",19,"^2A","Protocol for accessing the next items of a collection.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-next",[["^2O"]]]]],"^2S",true,"^1:","^4J","^23","cljs/core.cljs","^24",19,"^25",1,"^28",611,"^2U",["^ ","^2V",["^ ","^C4",[["^2O"]]]],"^30",null,"^29",611,"^31","^32","^33",["^19",["^>R","^9[","^5F","^>V","^8?","^>W","^>Y","^>Z","^>[","^;V","^?0","^?1","^?3","^?4","^?5","^?6","^?8","^>K","^9>"]],"^2A","Protocol for accessing the next items of a collection.","^2T",["^2;",["@interface"]]],"~$is_proto_",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",290,"^25",7,"^29",290,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/is_proto_","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",290,"^29",290,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$START",["^ ","^1:","~$cljs.core/START","^23","cljs/core.cljs","^28",3992,"^25",1,"^29",3992,"^24",11,"^1N",["^ ","^23","cljs/core.cljs","^28",3992,"^25",6,"^29",3992,"^24",11],"^31","^45"],"~$ICounted",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",570,"^25",14,"^29",570,"^24",22,"^2A","Protocol for adding the ability to count a collection in constant time.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^<M",[["^2O"]]]]],"^2S",true,"^1:","^1X","^23","cljs/core.cljs","^24",22,"^25",1,"^28",570,"^2U",["^ ","^2V",["^ ","^<M",[["^2O"]]]],"^30",null,"^29",570,"^31","^32","^33",["^19",[null,"^4V","^4W","^34","^4X","^>T","^5F","^4Y","^4Z","^>V","^4[","^35","~$cljs.core/ChunkBuffer","^;V","^50","^?0","^36","^?3","^7D","^7E","^51","^:G","^7F","^>K","^9>","^52"]],"^2A","Protocol for adding the ability to count a collection in constant time.","^2T",["^2;",["@interface"]]],"~$IMapEntry",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",644,"^25",14,"^29",644,"^24",23,"^2A","Protocol for examining a map entry.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-key",[["^2O"]],"~$-val",[["^2O"]]]]],"^2S",true,"^1:","^8U","^23","cljs/core.cljs","^24",23,"^25",1,"^28",644,"^2U",["^ ","^2V",["^ ","^C<",[["^2O"]],"^C=",[["^2O"]]]],"^30",null,"^29",644,"^31","^32","^33",["^19",["^4Y","^4Z","^52"]],"^2A","Protocol for examining a map entry.","^2T",["^2;",["@interface"]]],"~$pv-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5411,"^25",8,"^29",5411,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6>","~$f","^4P","^4Q"],["^6>","~$f","^97","^4P","^4Q"]]]]],"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^6>","~$f","^4P","^4Q"],["^6>","~$f","^97","^4P","^4Q"]]],"^2:",["^2;",[["^6>","~$f","^4P","^4Q"],["^6>","~$f","^97","^4P","^4Q"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/pv-reduce","^2C",false,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^6>","~$f","^4P","^4Q"],["^6>","~$f","^97","^4P","^4Q"]]],"^2:",["^2;",[["^6>","~$f","^4P","^4Q"],["^6>","~$f","^97","^4P","^4Q"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^6>","~$f","^4P","^4Q"],["^6>","~$f","^97","^4P","^4Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5411,"^29",5411,"^2G",5,"^2H",true,"^2:",["^2;",[["^6>","~$f","^4P","^4Q"],["^6>","~$f","^97","^4P","^4Q"]]]],"~$<=",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2622,"^25",16,"^29",2622,"^24",18,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns non-nil if nums are in monotonically non-decreasing order,\n  otherwise false.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/<=","^2C",true,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2622,"^3=","^3:","^29",2622,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns non-nil if nums are in monotonically non-decreasing order,\n  otherwise false."],"~$MODULE_INFOS",["^ ","^1:","~$cljs.core/MODULE_INFOS","^23","cljs/core.cljs","^28",40,"^25",1,"^29",40,"^24",18,"^1N",["^ ","^23","cljs/core.cljs","^28",40,"^25",6,"^29",40,"^24",18],"^31","^57"],"~$conj!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3789,"^25",7,"^29",3789,"^24",12,"^2:",["^2;",["^2<",["^2;",[[],["^2X"],["^2X","^2Z"],["^2X","^2Z","~$&","^AZ"]]]]],"^2A","Adds val to the transient collection, and return tcoll. The 'addition'\n  may happen at different 'places' depending on the concrete type.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["^2X"],["^2X","^2Z"]]],"^2:",["^2;",[[],["^2X"],["^2X","^2Z"],["^2X","^2Z","~$&","^AZ"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/conj!","^2C",true,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["^2X"],["^2X","^2Z"]]],"^2:",["^2;",[[],["^2X"],["^2X","^2Z"],["^2X","^2Z","~$&","^AZ"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["^2X"],["^2X","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",3789,"^29",3789,"^2G",2,"^2H",true,"^2:",["^2;",[[],["^2X"],["^2X","^2Z"],["^2X","^2Z","~$&","^AZ"]]],"^2A","Adds val to the transient collection, and return tcoll. The 'addition'\n  may happen at different 'places' depending on the concrete type."],"~$-pop",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",662,"^25",9,"^29",662,"^24",13,"^31","^5X","^5Y","^8T","^2A","Returns a new stack without the item on top of the stack. Is used\n     by cljs.core/pop.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^8T","^1:","~$cljs.core/-pop","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",656,"^3=","^5X","^29",662,"^2G",1,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a new stack without the item on top of the stack. Is used\n     by cljs.core/pop."],"~$array-index-of-identical?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6506,"^25",8,"^29",6506,"^24",33,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"^59",true,"^1:","~$cljs.core/array-index-of-identical?","^2C",false,"^23","cljs/core.cljs","^24",33,"^2D",["^2;",[["^66","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6506,"^29",6506,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"~$repeatedly",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4967,"^25",7,"^29",4967,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$n","~$f"]]]]],"^2A","Takes a function of no args, presumably with side effects, and\n  returns an infinite (or length n if supplied) lazy sequence of calls\n  to it","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$n","~$f"]]],"^2:",["^2;",[["~$f"],["~$n","~$f"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/repeatedly","^2C",false,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$n","~$f"]]],"^2:",["^2;",[["~$f"],["~$n","~$f"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f"],["~$n","~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4967,"^29",4967,"^2G",2,"^2H",true,"^2:",["^2;",[["~$f"],["~$n","~$f"]]],"^2A","Takes a function of no args, presumably with side effects, and\n  returns an infinite (or length n if supplied) lazy sequence of calls\n  to it"],"~$zipmap",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9399,"^25",7,"^29",9399,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$keys","^AZ"]]]]],"^2A","Returns a map with the keys mapped to the corresponding vals."],"^1:","~$cljs.core/zipmap","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^CM","^AZ"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9399,"^29",9399,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^CM","^AZ"]]]]],"^2A","Returns a map with the keys mapped to the corresponding vals."],"~$reset-vals!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4439,"^25",7,"^29",4439,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$a","~$new-value"]]]]],"^2A","Sets the value of atom to newval. Returns [old new], the value of the\n   atom before and after the reset.","^76","1.9"],"^76","1.9","^1:","~$cljs.core/reset-vals!","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["~$a","^CP"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4439,"^29",4439,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$a","^CP"]]]]],"^2A","Sets the value of atom to newval. Returns [old new], the value of the\n   atom before and after the reset."],"~$IStack",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",656,"^25",14,"^29",656,"^24",20,"^2A","Protocol for collections to provide access to their items as stacks. The top\n  of the stack should be accessed in the most efficient way for the different\n  data structures.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-peek",[["^2O"]],"^CF",[["^2O"]]]]],"^2S",true,"^1:","^8T","^23","cljs/core.cljs","^24",20,"^25",1,"^28",656,"^2U",["^ ","^2V",["^ ","^CS",[["^2O"]],"^CF",[["^2O"]]]],"^30",null,"^29",656,"^31","^32","^33",["^19",["^>T","^4Y","^4Z","^>V","^4[","^50","^?0","^52"]],"^2A","Protocol for collections to provide access to their items as stacks. The top\n  of the stack should be accessed in the most efficient way for the different\n  data structures.","^2T",["^2;",["@interface"]]],"~$-remove-watch",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",778,"^25",4,"^29",778,"^24",17,"^5Y","~$cljs.core/IWatchable","^2A","Removes watcher that corresponds to key from this.","^2:",["^2;",["^2<",["^2;",[["~$this","^2Y"]]]]]],"^5Y","^CU","^1:","~$cljs.core/-remove-watch","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^CV","^2Y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",771,"^29",778,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^CV","^2Y"]]]]],"^2A","Removes watcher that corresponds to key from this."],"~$IVolatile",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",859,"^25",14,"^29",859,"^24",23,"^2A","Protocol for adding volatile functionality.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-vreset!",[["~$o","^CP"]]]]],"^2S",true,"^1:","^3T","^23","cljs/core.cljs","^24",23,"^25",1,"^28",859,"^2U",["^ ","^2V",["^ ","^CY",[["~$o","^CP"]]]],"^30",null,"^29",859,"^31","^32","^33",["^19",["^3V"]],"^2A","Protocol for adding volatile functionality.","^2T",["^2;",["@interface"]]],"~$remove",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5128,"^25",7,"^29",5128,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^4<"],["^4<","^2O"]]]]],"^2A","Returns a lazy sequence of the items in coll for which\n  (pred item) returns logical false. pred must be free of side-effects.\n  Returns a transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/remove","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5128,"^29",5128,"^2G",2,"^2H",true,"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2A","Returns a lazy sequence of the items in coll for which\n  (pred item) returns logical false. pred must be free of side-effects.\n  Returns a transducer when no collection is provided."],"~$->BitmapIndexedNode",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U","^20"]],"^23","cljs/core.cljs","^24",27,"^25",10,"^26","^27","^28",7145,"^29",7145,"^2:",["^2;",["^2<",["^2;",[["^=J","^:@","^66"]]]]],"^2@",["^19",["^20"]],"^2A","Positional factory function for cljs.core/BitmapIndexedNode."],"^1O",["^19",["^1U","^20"]],"^1:","~$cljs.core/->BitmapIndexedNode","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^=J","^:@","^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7145,"^29",7145,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^:@","^66"]]]]],"^2@",["^19",["^20"]],"^2A","Positional factory function for cljs.core/BitmapIndexedNode."],"~$*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2594,"^25",15,"^29",2594,"^24",16,"^31","^<","^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the product of nums. (*) returns 1.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/*","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",2594,"^3=","^<","^29",2594,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns the product of nums. (*) returns 1."],"~$re-pattern",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9841,"^25",7,"^29",9841,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Returns an instance of RegExp which has compiled the provided string."],"^1:","~$cljs.core/re-pattern","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9841,"^29",9841,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]],"^2A","Returns an instance of RegExp which has compiled the provided string."],"~$min",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2669,"^25",15,"^29",2669,"^24",18,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the least of the nums.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/min","^2C",true,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2669,"^3=","^<","^29",2669,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns the least of the nums."],"~$array-index-of-nil?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6478,"^25",8,"^29",6478,"^24",27,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66"]]]]]],"^59",true,"^1:","~$cljs.core/array-index-of-nil?","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6478,"^29",6478,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66"]]]]]],"~$-persistent!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",790,"^25",9,"^29",790,"^24",21,"^31","^5X","^5Y","^?V","^2A","Creates a persistent data structure from tcoll and returns it.","^2:",["^2;",["^2<",["^2;",[["^2X"]]]]]],"^5Y","^?V","^1:","~$cljs.core/-persistent!","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^2X"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",786,"^3=","^5X","^29",790,"^2G",1,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2X"]]]]],"^2A","Creates a persistent data structure from tcoll and returns it."],"^>J",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",594,"^25",4,"^29",594,"^24",8,"^5Y","^5B","^2A","Returns the value at the index n in the collection coll.\n     Returns not-found if index n is out of bounds and not-found is supplied.","^2:",["^2;",["^2<",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2F",["^2;",[null,null]]]],"^5Y","^5B","^1:","~$cljs.core/-nth","^2C",false,"^23","cljs/core.cljs","^24",8,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",592,"^29",594,"^2G",3,"^2H",true,"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2A","Returns the value at the index n in the collection coll.\n     Returns not-found if index n is out of bounds and not-found is supplied."],"~$pop!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3824,"^25",7,"^29",3824,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2X"]]]]],"^2A","Removes the last item from a transient vector. If\n  the collection is empty, throws an exception. Returns tcoll"],"^1:","~$cljs.core/pop!","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^2X"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3824,"^29",3824,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2X"]]]]],"^2A","Removes the last item from a transient vector. If\n  the collection is empty, throws an exception. Returns tcoll"],"~$chunk-append",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3590,"^25",7,"^29",3590,"^24",19,"^2:",["^2;",["^2<",["^2;",[["~$b","~$x"]]]]]],"^1:","~$cljs.core/chunk-append","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$b","~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3590,"^29",3590,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$b","~$x"]]]]]],"~$*unchecked-arrays*",["^ ","^1:","~$cljs.core/*unchecked-arrays*","^23","cljs/core.cljs","^28",30,"^25",1,"^29",30,"^24",24,"^1N",["^ ","^23","cljs/core.cljs","^28",30,"^25",6,"^29",30,"^24",24],"^31","^3:"],"~$prn-str",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10060,"^25",7,"^29",10060,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$&","^6Y"]]]]],"^2A","Same as pr-str followed by (newline)","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/prn-str","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^6Y"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10060,"^29",10060,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^6Y"]]],"^2A","Same as pr-str followed by (newline)"],"~$IReversible",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",728,"^25",14,"^29",728,"^24",25,"^2A","Protocol for reversing a seq.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-rseq",[["^2O"]]]]],"^2S",true,"^1:","^5C","^23","cljs/core.cljs","^24",25,"^25",1,"^28",728,"^2U",["^ ","^2V",["^ ","^DE",[["^2O"]]]],"^30",null,"^29",728,"^31","^32","^33",["^19",["^5F","^4Y","^4Z","^4[","^50","^51","^7F","^52"]],"^2A","Protocol for reversing a seq.","^2T",["^2;",["@interface"]]],"~$reversible?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3159,"^25",16,"^29",3159,"^24",27,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns true if coll satisfies? IReversible."],"^1:","~$cljs.core/reversible?","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3159,"^3=","^3:","^29",3159,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns true if coll satisfies? IReversible."],"~$-realized?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",768,"^25",13,"^29",768,"^24",23,"^31","^3:","^5Y","^8>","^2A","Returns true if a value for x has been produced, false otherwise.","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^5Y","^8>","^1:","~$cljs.core/-realized?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",765,"^3=","^3:","^29",768,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if a value for x has been produced, false otherwise."],"~$-add-watch",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",775,"^25",4,"^29",775,"^24",14,"^5Y","^CU","^2A","Adds a watcher function f to this. Keys must be unique per reference,\n     and can be used to remove the watch with -remove-watch.","^2:",["^2;",["^2<",["^2;",[["^CV","^2Y","~$f"]]]]]],"^5Y","^CU","^1:","~$cljs.core/-add-watch","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^CV","^2Y","~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",771,"^29",775,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^CV","^2Y","~$f"]]]]],"^2A","Adds a watcher function f to this. Keys must be unique per reference,\n     and can be used to remove the watch with -remove-watch."],"~$-deref-with-timeout",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",677,"^25",4,"^29",677,"^24",23,"^5Y","~$cljs.core/IDerefWithTimeout","^2A",null,"^2:",["^2;",["^2<",["^2;",[["~$o","~$msec","~$timeout-val"]]]]]],"^5Y","^DM","^1:","~$cljs.core/-deref-with-timeout","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$o","^DN","^DO"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",676,"^29",677,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o","^DN","^DO"]]]]],"^2A",null],"~$conj",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1773,"^25",7,"^29",1773,"^24",11,"^2:",["^2;",["^2<",["^2;",[[],["^2O"],["^2O","~$x"],["^2O","~$x","~$&","^5:"]]]]],"^2A","conj[oin]. Returns a new collection with the xs\n  'added'. (conj nil item) returns (item).  The 'addition' may\n  happen at different 'places' depending on the concrete type.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["^2O"],["^2O","~$x"]]],"^2:",["^2;",[[],["^2O"],["^2O","~$x"],["^2O","~$x","~$&","^5:"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/conj","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["^2O"],["^2O","~$x"]]],"^2:",["^2;",[[],["^2O"],["^2O","~$x"],["^2O","~$x","~$&","^5:"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["^2O"],["^2O","~$x"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",1773,"^29",1773,"^2G",2,"^2H",true,"^2:",["^2;",[[],["^2O"],["^2O","~$x"],["^2O","~$x","~$&","^5:"]]],"^2A","conj[oin]. Returns a new collection with the xs\n  'added'. (conj nil item) returns (item).  The 'addition' may\n  happen at different 'places' depending on the concrete type."],"~$-sorted-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",736,"^25",9,"^29",736,"^24",20,"^31","^5X","^5Y","^6U","^2A","Returns a sorted seq from coll in either ascending or descending order.","^2:",["^2;",["^2<",["^2;",[["^2O","^6V"]]]]]],"^5Y","^6U","^1:","~$cljs.core/-sorted-seq","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^2O","^6V"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",733,"^3=","^5X","^29",736,"^2G",2,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","^6V"]]]]],"^2A","Returns a sorted seq from coll in either ascending or descending order."],"~$flatten1",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5075,"^25",8,"^29",5075,"^24",16,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^;?"]]]]],"^2A","Take a collection of collections, and return a lazy seq\n  of items from the inner collection"],"^59",true,"^1:","~$cljs.core/flatten1","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^;?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5075,"^29",5075,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^;?"]]]]],"^2A","Take a collection of collections, and return a lazy seq\n  of items from the inner collection"],"~$transduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2561,"^25",7,"^29",2561,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^5O","~$f","^2O"],["^5O","~$f","^97","^2O"]]]]],"^2A","reduce with a transformation of f (xf). If init is not\n  supplied, (f) will be called to produce it. f should be a reducing\n  step function that accepts both 1 and 2 arguments, if it accepts\n  only 2 you can add the arity-1 with 'completing'. Returns the result\n  of applying (the transformed) xf to init and the first item in coll,\n  then applying xf to that result and the 2nd item, etc. If coll\n  contains no items, returns init and f is not called. Note that\n  certain transforms may inject or skip items.","^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^5O","~$f","^2O"],["^5O","~$f","^97","^2O"]]],"^2:",["^2;",[["^5O","~$f","^2O"],["^5O","~$f","^97","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/transduce","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^5O","~$f","^2O"],["^5O","~$f","^97","^2O"]]],"^2:",["^2;",[["^5O","~$f","^2O"],["^5O","~$f","^97","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^5O","~$f","^2O"],["^5O","~$f","^97","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2561,"^29",2561,"^2G",4,"^2H",true,"^2:",["^2;",[["^5O","~$f","^2O"],["^5O","~$f","^97","^2O"]]],"^2A","reduce with a transformation of f (xf). If init is not\n  supplied, (f) will be called to produce it. f should be a reducing\n  step function that accepts both 1 and 2 arguments, if it accepts\n  only 2 you can add the arity-1 with 'completing'. Returns the result\n  of applying (the transformed) xf to init and the first item in coll,\n  then applying xf to that result and the 2nd item, etc. If coll\n  contains no items, returns init and f is not called. Note that\n  certain transforms may inject or skip items."],"~$-swap!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",856,"^25",4,"^29",856,"^24",10,"^5Y","~$cljs.core/ISwap","^2A","Swaps the value of o to be (apply f current-value-of-atom args).","^2:",["^2;",["^2<",["^2;",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]]]],"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]],"^2:",["^2;",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]],"^2F",["^2;",[null,null,null,null]]]],"^5Y","^DZ","^1:","~$cljs.core/-swap!","^2C",false,"^23","cljs/core.cljs","^24",10,"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]],"^2:",["^2;",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",854,"^29",856,"^2G",5,"^2H",true,"^2:",["^2;",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]],"^2A","Swaps the value of o to be (apply f current-value-of-atom args)."],"~$*print-length*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",150,"^25",3,"^29",150,"^24",17,"^6F",true,"^2A","*print-length* controls how many items of each collection the\n  printer will print. If it is bound to logical false, there is no\n  limit. Otherwise, it must be bound to an integer indicating the maximum\n  number of items of each collection to print. If a collection contains\n  more items, the printer will print items up to the limit followed by\n  '...' to represent the remaining items. The root binding is nil\n  indicating no limit.","^2T",["@type {null|number}"]],"^1:","~$cljs.core/*print-length*","^23","cljs/core.cljs","^24",17,"^25",1,"^6F",true,"^28",140,"^29",150,"^31","^57","^2A","*print-length* controls how many items of each collection the\n  printer will print. If it is bound to logical false, there is no\n  limit. Otherwise, it must be bound to an integer indicating the maximum\n  number of items of each collection to print. If a collection contains\n  more items, the printer will print items up to the limit followed by\n  '...' to represent the remaining items. The root binding is nil\n  indicating no limit.","^2T",["@type {null|number}"]],"~$js-delete",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2169,"^25",7,"^29",2169,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^3;","^2Y"]]]]],"^2A","Delete a property from a JavaScript object.\n  Returns true upon success, false otherwise."],"^1:","~$cljs.core/js-delete","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^3;","^2Y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2169,"^29",2169,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^2Y"]]]]],"^2A","Delete a property from a JavaScript object.\n  Returns true upon success, false otherwise."],"~$truth_",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",215,"^25",7,"^29",215,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Internal - do not use!"],"^1:","~$cljs.core/truth_","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",215,"^29",215,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Internal - do not use!"],"~$array-index-of",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6522,"^25",7,"^29",6522,"^24",21,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"^1:","~$cljs.core/array-index-of","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^66","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6522,"^29",6522,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"~$->MultiFn",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1Q","^1R","^7Q","^<D"]],"^23","cljs/core.cljs","^24",17,"^25",10,"^26","^27","^28",10843,"^29",10843,"^2:",["^2;",["^2<",["^2;",[["^:","^>6","^BD","^63","^61","^BC","^60","^62"]]]]],"^2@",["^19",["^1Q","^1R","^7Q","^<D"]],"^2A","Positional factory function for cljs.core/MultiFn."],"^1O",["^19",["^1Q","^1R","^7Q","^<D"]],"^1:","~$cljs.core/->MultiFn","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^:","^>6","^BD","^63","^61","^BC","^60","^62"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",10843,"^29",10843,"^2G",8,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:","^>6","^BD","^63","^61","^BC","^60","^62"]]]]],"^2@",["^19",["^1Q","^1R","^7Q","^<D"]],"^2A","Positional factory function for cljs.core/MultiFn."],"~$key->js",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10522,"^25",7,"^29",10522,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$k"],["~$k","~$primitive-fn"]]]]],"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$k"],["~$k","^E;"]]],"^2:",["^2;",[["~$k"],["~$k","^E;"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/key->js","^2C",false,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$k"],["~$k","^E;"]]],"^2:",["^2;",[["~$k"],["~$k","^E;"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$k"],["~$k","^E;"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10522,"^29",10522,"^2G",2,"^2H",true,"^2:",["^2;",[["~$k"],["~$k","^E;"]]]],"~$IEncodeJS",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",10515,"^25",14,"^29",10515,"^24",23,"^2A",null,"^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-clj->js",[["~$x"]],"~$-key->js",[["~$x"]]]]],"^2S",true,"^1:","~$cljs.core/IEncodeJS","^23","cljs/core.cljs","^24",23,"^25",1,"^28",10515,"^2U",["^ ","^2V",["^ ","^E>",[["~$x"]],"^E?",[["~$x"]]]],"^30",null,"^29",10515,"^31","^32","^33",["^19",[]],"^2A",null,"^2T",["^2;",["@interface"]]],"~$new-path",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5315,"^25",8,"^29",5315,"^24",16,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^:5","^84"]]]]]],"^59",true,"^1:","~$cljs.core/new-path","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^=J","^:5","^84"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5315,"^29",5315,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^:5","^84"]]]]]],"~$compare-and-set!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4491,"^25",7,"^29",4491,"^24",23,"^2:",["^2;",["^2<",["^2;",[["~$a","~$oldval","^:U"]]]]],"^2A","Atomically sets the value of atom to newval if and only if the\n  current value of the atom is equal to oldval. Returns true if\n  set happened, else false."],"^1:","~$cljs.core/compare-and-set!","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$a","^ED","^:U"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4491,"^29",4491,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$a","^ED","^:U"]]]]],"^2A","Atomically sets the value of atom to newval if and only if the\n  current value of the atom is equal to oldval. Returns true if\n  set happened, else false."],"~$array-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1664,"^25",7,"^29",1664,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^79"],["^79","~$i"]]]]],"^2A","Create a seq from a JavaScript array.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^79"],["^79","~$i"]]],"^2:",["^2;",[["^79"],["^79","~$i"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/array-seq","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^79"],["^79","~$i"]]],"^2:",["^2;",[["^79"],["^79","~$i"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^79"],["^79","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1664,"^29",1664,"^2G",2,"^2H",true,"^2:",["^2;",[["^79"],["^79","~$i"]]],"^2A","Create a seq from a JavaScript array."],"~$array-copy-downward",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2183,"^25",8,"^29",2183,"^24",27,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$from","~$i","~$to","~$j","^5<"]]]]]],"^59",true,"^1:","~$cljs.core/array-copy-downward","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^EI","~$i","^EJ","~$j","^5<"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2183,"^29",2183,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^EI","~$i","^EJ","~$j","^5<"]]]]]],"~$pack-array-node",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7347,"^25",8,"^29",7347,"^24",23,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$array-node","^=J","^7:"]]]]]],"^59",true,"^1:","~$cljs.core/pack-array-node","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^EM","^=J","^7:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7347,"^29",7347,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^EM","^=J","^7:"]]]]]],"~$interleave",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5037,"^25",7,"^29",5037,"^24",17,"^2:",["^2;",["^2<",["^2;",[[],["^;<"],["^;<","^;="],["^;<","^;=","~$&","^;?"]]]]],"^2A","Returns a lazy seq of the first item in each coll, then the second etc.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["^;<"],["^;<","^;="]]],"^2:",["^2;",[[],["^;<"],["^;<","^;="],["^;<","^;=","~$&","^;?"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/interleave","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["^;<"],["^;<","^;="]]],"^2:",["^2;",[[],["^;<"],["^;<","^;="],["^;<","^;=","~$&","^;?"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["^;<"],["^;<","^;="]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",5037,"^29",5037,"^2G",2,"^2H",true,"^2:",["^2;",[[],["^;<"],["^;<","^;="],["^;<","^;=","~$&","^;?"]]],"^2A","Returns a lazy seq of the first item in each coll, then the second etc."],"~$print-map",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10136,"^25",7,"^29",10136,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$m","^>A","^7K","^2J"]]]]]],"^1:","~$cljs.core/print-map","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$m","^>A","^7K","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10136,"^29",10136,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$m","^>A","^7K","^2J"]]]]]],"~$map?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2133,"^25",16,"^29",2133,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies IMap"],"^1:","~$cljs.core/map?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2133,"^3=","^3:","^29",2133,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies IMap"],"~$m3-C1",["^ ","^1:","~$cljs.core/m3-C1","^23","cljs/core.cljs","^28",911,"^25",1,"^29",911,"^24",11,"^1N",["^ ","^23","cljs/core.cljs","^28",911,"^25",6,"^29",911,"^24",11],"^31","^<"],"~$get",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1917,"^25",7,"^29",1917,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]]]],"^2A","Returns the value mapped to key, not-found or nil if key not present.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2:",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/get","^2C",false,"^23","cljs/core.cljs","^24",10,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2:",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1917,"^29",1917,"^2G",3,"^2H",true,"^2:",["^2;",[["~$o","~$k"],["~$o","~$k","^73"]]],"^2A","Returns the value mapped to key, not-found or nil if key not present."],"~$identity",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2546,"^25",7,"^29",2546,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns its argument."],"^1:","~$cljs.core/identity","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2546,"^29",2546,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns its argument."],"~$into",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5159,"^25",7,"^29",5159,"^24",11,"^2:",["^2;",["^2<",["^2;",[[],["^EJ"],["^EJ","^EI"],["^EJ","^5O","^EI"]]]]],"^2A","Returns a new coll consisting of to-coll with all of the items of\n  from-coll conjoined. A transducer may be supplied.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[[],["^EJ"],["^EJ","^EI"],["^EJ","^5O","^EI"]]],"^2:",["^2;",[[],["^EJ"],["^EJ","^EI"],["^EJ","^5O","^EI"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/into","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[[],["^EJ"],["^EJ","^EI"],["^EJ","^5O","^EI"]]],"^2:",["^2;",[[],["^EJ"],["^EJ","^EI"],["^EJ","^5O","^EI"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["^EJ"],["^EJ","^EI"],["^EJ","^5O","^EI"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",5159,"^29",5159,"^2G",3,"^2H",true,"^2:",["^2;",[[],["^EJ"],["^EJ","^EI"],["^EJ","^5O","^EI"]]],"^2A","Returns a new coll consisting of to-coll with all of the items of\n  from-coll conjoined. A transducer may be supplied."],"~$long",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2787,"^25",7,"^29",2787,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to long by stripping decimal places. Identical to `int'."],"^1:","~$cljs.core/long","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2787,"^29",2787,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to long by stripping decimal places. Identical to `int'."],"~$double",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2688,"^25",15,"^29",2688,"^24",21,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/double","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2688,"^3=","^<","^29",2688,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$volatile?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4531,"^25",16,"^29",4531,"^24",25,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a volatile."],"^1:","~$cljs.core/volatile?","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4531,"^3=","^3:","^29",4531,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a volatile."],"~$ChunkBuffer",["^ ","^3S",2,"^1O",["^19",["^1U","^1X"]],"^1:","^C:","^23","cljs/core.cljs","^24",21,"^3W",true,"^25",10,"^28",3464,"^3X",false,"^29",3464,"^31","^3Y","^2@",["^19",["^1X"]]],"~$HashSetIter",["^ ","^3S",1,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/HashSetIter","^23","cljs/core.cljs","^24",21,"^3W",true,"^25",10,"^28",9032,"^3X",false,"^29",9032,"^31","^3Y","^2@",null],"^C<",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",646,"^25",4,"^29",646,"^24",8,"^5Y","^8U","^2A","Returns the key of the map entry.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^8U","^1:","~$cljs.core/-key","^2C",false,"^23","cljs/core.cljs","^24",8,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",644,"^29",646,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the key of the map entry."],"~$nfirst",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1746,"^25",7,"^29",1746,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (next (first x))"],"^1:","~$cljs.core/nfirst","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1746,"^29",1746,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (next (first x))"],"~$StringBufferWriter",["^ ","^3S",1,"^1O",["^19",["^9@"]],"^1:","~$cljs.core/StringBufferWriter","^23","cljs/core.cljs","^24",28,"^3W",true,"^25",10,"^28",872,"^3X",false,"^29",872,"^31","^3Y","^2@",["^19",["^9@"]]],"^2=",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2057,"^25",7,"^29",2057,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$o"]]]]],"^2A","Returns the metadata of obj, returns nil if there is no metadata."],"^1:","~$cljs.core/meta","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$o"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2057,"^29",2057,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o"]]]]],"^2A","Returns the metadata of obj, returns nil if there is no metadata."],"~$tv-editable-tail",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5926,"^25",8,"^29",5926,"^24",24,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$tl"]]]]]],"^59",true,"^1:","~$cljs.core/tv-editable-tail","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^FA"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5926,"^29",5926,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^FA"]]]]]],"^96",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",700,"^25",4,"^29",700,"^24",14,"^5Y","^98","^2A","Reduces an associative collection and returns the result. f should be\n     a function that takes three arguments.","^2:",["^2;",["^2<",["^2;",[["^2O","~$f","^97"]]]]]],"^5Y","^98","^1:","~$cljs.core/-kv-reduce","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O","~$f","^97"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",697,"^29",700,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$f","^97"]]]]],"^2A","Reduces an associative collection and returns the result. f should be\n     a function that takes three arguments."],"~$IHash",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",709,"^25",14,"^29",709,"^24",19,"^2A","Protocol for adding hashing functionality to a type.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-hash",[["~$o"]]]]],"^2S",true,"^1:","^1Q","^23","cljs/core.cljs","^24",19,"^25",1,"^28",709,"^2U",["^ ","^2V",["^ ","^FE",[["~$o"]]]],"^30",null,"^29",709,"^31","^32","^33",["^19",["~$cljs.core/Namespace","^4V","~$cljs.core/MultiFn","^4W","^>R","^4X","^9[","^>T","^5F","^>U","^4Y","^4Z","^>V","^8?","^4[","^>W","^4F","^>Y","^>Z","^7C","~$default","^;V","^50","^?0","^?1","^?3","^7E","^51","^?5","^?6","^?7","^7F","^?8","^<E","^42","^>K","^9>","^52"]],"^2A","Protocol for adding hashing functionality to a type.","^2T",["^2;",["@interface"]]],"~$bit-and-not",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2846,"^25",7,"^29",2846,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Bitwise and with complement","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/bit-and-not","^2C",true,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2846,"^29",2846,"^2G",2,"^2H",true,"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Bitwise and with complement"],"~$var?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1178,"^25",16,"^29",1178,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$v"]]]]],"^2A","Returns true if v is of type cljs.core.Var"],"^1:","~$cljs.core/var?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1178,"^3=","^3:","^29",1178,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$v"]]]]],"^2A","Returns true if v is of type cljs.core.Var"],"~$-comparator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",747,"^25",4,"^29",747,"^24",15,"^5Y","^6U","^2A","Returns the comparator for coll.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^6U","^1:","~$cljs.core/-comparator","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",733,"^29",747,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the comparator for coll."],"~$unchecked-add-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2703,"^25",15,"^29",2703,"^24",32,"^31","^<","^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the sum of nums. (+) returns 0.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/unchecked-add-int","^2C",true,"^23","cljs/core.cljs","^24",32,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",2703,"^3=","^<","^29",2703,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns the sum of nums. (+) returns 0."],"~$hash-ordered-coll",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1325,"^25",15,"^29",1325,"^24",32,"^31","^<","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the hash code, consistent with =, for an external ordered\n   collection implementing Iterable.\n   See http://clojure.org/data_structures#hash for full algorithms."],"^1:","~$cljs.core/hash-ordered-coll","^2C",false,"^23","cljs/core.cljs","^24",32,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1325,"^3=","^<","^29",1325,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the hash code, consistent with =, for an external ordered\n   collection implementing Iterable.\n   See http://clojure.org/data_structures#hash for full algorithms."],"~$extend-object!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3005,"^25",8,"^29",3005,"^24",22,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^3;","~$fn-map"]]]]],"^2A","Takes a JavaScript object and a map of names to functions and\n  attaches said functions as methods on the object.  Any references to\n  JavaScript's implicit this (via the this-as macro) will resolve to the\n  object that the function is attached."],"^59",true,"^1:","~$cljs.core/extend-object!","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^3;","^FT"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3005,"^29",3005,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^FT"]]]]],"^2A","Takes a JavaScript object and a map of names to functions and\n  attaches said functions as methods on the object.  Any references to\n  JavaScript's implicit this (via the this-as macro) will resolve to the\n  object that the function is attached."],"~$do-assoc",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5368,"^25",8,"^29",5368,"^24",16,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6>","^:5","^84","~$i","^2Z"]]]]]],"^59",true,"^1:","~$cljs.core/do-assoc","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^6>","^:5","^84","~$i","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5368,"^29",5368,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6>","^:5","^84","~$i","^2Z"]]]]]],"~$reset-meta!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10319,"^25",7,"^29",10319,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$iref","~$m"]]]]],"^2A","Atomically resets the metadata for an atom"],"^1:","~$cljs.core/reset-meta!","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^FY","~$m"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10319,"^29",10319,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^FY","~$m"]]]]],"^2A","Atomically resets the metadata for an atom"],"~$->KeySeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",16,"^25",10,"^26","^27","^28",8838,"^29",8838,"^2:",["^2;",["^2<",["^2;",[["~$mseq","~$_meta"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/KeySeq."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->KeySeq","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^G0","^G1"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",8838,"^29",8838,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^G0","^G1"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/KeySeq."],"~$IEquiv",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",704,"^25",14,"^29",704,"^24",20,"^2A","Protocol for adding value comparison functionality to a type.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-equiv",[["~$o","~$other"]]]]],"^2S",true,"^1:","^1P","^23","cljs/core.cljs","^24",20,"^25",1,"^28",704,"^2U",["^ ","^2V",["^ ","^G4",[["~$o","^G5"]]]],"^30",null,"^29",704,"^31","^32","^33",["^19",["^FF","^4V","^4W","^>R","^4X","^9[","~$js/Date","^>T","^5F","^>U","^4Y","^4Z","^>V","^8?","^4[","^>W","^4F","^>Y","^>Z","^7C","^<","^FH","^;V","^50","^?0","^?1","^?3","^7E","^51","^?5","^?6","^?7","^7F","^?8","^<E","~$cljs.core/NeverEquiv","^42","^>K","^9>","^52"]],"^2A","Protocol for adding value comparison functionality to a type.","^2T",["^2;",["@interface"]]],"~$tree-map-kv-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8225,"^25",8,"^29",8225,"^24",26,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^84","~$f","^97"]]]]]],"^59",true,"^1:","~$cljs.core/tree-map-kv-reduce","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["^84","~$f","^97"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8225,"^29",8225,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^84","~$f","^97"]]]]]],"~$cycle",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4850,"^25",7,"^29",4850,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a lazy (infinite!) sequence of repetitions of the items in coll."],"^1:","~$cljs.core/cycle","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4850,"^29",4850,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a lazy (infinite!) sequence of repetitions of the items in coll."],"~$-deref",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",673,"^25",4,"^29",673,"^24",10,"^5Y","^3U","^2A","Returns the value of the reference o.","^2:",["^2;",["^2<",["^2;",[["~$o"]]]]]],"^5Y","^3U","^1:","~$cljs.core/-deref","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["~$o"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",671,"^29",673,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o"]]]]],"^2A","Returns the value of the reference o."],"~$pr-writer-ex-info",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11116,"^25",8,"^29",11116,"^24",25,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^7K","^2J"]]]]]],"^59",true,"^1:","~$cljs.core/pr-writer-ex-info","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^3;","^7K","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11116,"^29",11116,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^7K","^2J"]]]]]],"~$empty?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2093,"^25",16,"^29",2093,"^24",22,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns true if coll has no items - same as (not (seq coll)).\n  Please use the idiom (seq x) rather than (not (empty? x))"],"^1:","~$cljs.core/empty?","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2093,"^3=","^3:","^29",2093,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns true if coll has no items - same as (not (seq coll)).\n  Please use the idiom (seq x) rather than (not (empty? x))"],"~$TaggedLiteral",["^ ","^3S",2,"^1O",["^19",["^1P","^1Q","^1U","^5N","^22"]],"^1:","^7C","^23","cljs/core.cljs","^24",23,"^3W",true,"^25",10,"^28",11209,"^3X",false,"^29",11209,"^31","^3Y","^2@",["^19",["^1P","^1Q","^5N","^22"]]],"~$short",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2686,"^25",15,"^29",2686,"^24",20,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/short","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2686,"^3=","^<","^29",2686,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^E>",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10516,"^25",4,"^29",10516,"^24",12,"^5Y","^E@","^2A","Recursively transforms clj values to JavaScript","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^5Y","^E@","^1:","~$cljs.core/-clj->js","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10515,"^29",10516,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Recursively transforms clj values to JavaScript"],"~$-chunked-first",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",829,"^25",4,"^29",829,"^24",18,"^5Y","^7H","^2A","Returns the first chunk in coll.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^7H","^1:","~$cljs.core/-chunked-first","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",827,"^29",829,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the first chunk in coll."],"~$add-tap",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11349,"^25",7,"^29",11349,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Adds f, a fn of one argument, to the tap set. This function will be called with\n  anything sent via tap>. Remember f in order to remove-tap"],"^1:","~$cljs.core/add-tap","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11349,"^29",11349,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Adds f, a fn of one argument, to the tap set. This function will be called with\n  anything sent via tap>. Remember f in order to remove-tap"],"~$filterv",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5191,"^25",7,"^29",5191,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns a vector of the items in coll for which\n  (pred item) returns logical true. pred must be free of side-effects."],"^1:","~$cljs.core/filterv","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5191,"^29",5191,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns a vector of the items in coll for which\n  (pred item) returns logical true. pred must be free of side-effects."],"~$->TaggedLiteral",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1U","^5N","^22"]],"^23","cljs/core.cljs","^24",23,"^25",10,"^26","^27","^28",11209,"^29",11209,"^2:",["^2;",["^2<",["^2;",[["~$tag","^?F"]]]]],"^2@",["^19",["^1P","^1Q","^5N","^22"]],"^2A","Positional factory function for cljs.core/TaggedLiteral."],"^1O",["^19",["^1P","^1Q","^1U","^5N","^22"]],"^1:","~$cljs.core/->TaggedLiteral","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^GM","^?F"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",11209,"^29",11209,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^GM","^?F"]]]]],"^2@",["^19",["^1P","^1Q","^5N","^22"]],"^2A","Positional factory function for cljs.core/TaggedLiteral."],"~$tv-editable-root",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5923,"^25",8,"^29",5923,"^24",24,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^84"]]]]]],"^59",true,"^1:","~$cljs.core/tv-editable-root","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^84"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5923,"^29",5923,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^84"]]]]]],"^B;",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",987,"^25",7,"^29",987,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$o"]]]]],"^2A","Returns the hash code of its argument. Note this is the hash code\n   consistent with =."],"^1:","~$cljs.core/hash","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$o"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",987,"^29",987,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o"]]]]],"^2A","Returns the hash code of its argument. Note this is the hash code\n   consistent with =."],"~$quot",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2816,"^25",7,"^29",2816,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","quot[ient] of dividing numerator by denominator."],"^1:","~$cljs.core/quot","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$n","~$d"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2816,"^29",2816,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","quot[ient] of dividing numerator by denominator."],"~$ns-interns*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11439,"^25",7,"^29",11439,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$sym"]]]]],"^2A","Returns a map of the intern mappings for the namespace.\n  Bootstrap only."],"^1:","~$cljs.core/ns-interns*","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^GU"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11439,"^29",11439,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^GU"]]]]],"^2A","Returns a map of the intern mappings for the namespace.\n  Bootstrap only."],"~$unchecked-double",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2694,"^25",15,"^29",2694,"^24",31,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/unchecked-double","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2694,"^3=","^<","^29",2694,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$*target*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^24",11,"^25",3,"^6F",true,"^28",48,"^5A",true,"^29",48,"^31","^90","^2A","Var bound to the name value of the compiler build :target option.\n  For example, if the compiler build :target is :nodejs, *target* will be bound\n  to \"nodejs\". *target* is a Google Closure define and can be set by compiler\n  :closure-defines option."],"^1:","~$cljs.core/*target*","^23","cljs/core.cljs","^24",11,"^25",1,"^6F",true,"^28",42,"^5A",true,"^29",48,"^31","^90","^2A","Var bound to the name value of the compiler build :target option.\n  For example, if the compiler build :target is :nodejs, *target* will be bound\n  to \"nodejs\". *target* is a Google Closure define and can be set by compiler\n  :closure-defines option."],"~$->ChunkedCons",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^5D","^1S","^@S","^1U","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21"]],"^23","cljs/core.cljs","^24",21,"^25",10,"^26","^27","^28",3513,"^29",3513,"^2:",["^2;",["^2<",["^2;",[["^:W","^6A","^2=","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^5D","^1S","^@S","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21"]],"^2A","Positional factory function for cljs.core/ChunkedCons."],"^1O",["^19",["^1P","^1Q","^5D","^1S","^@S","^1U","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21"]],"^1:","~$cljs.core/->ChunkedCons","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^:W","^6A","^2=","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3513,"^29",3513,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:W","^6A","^2=","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^5D","^1S","^@S","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21"]],"^2A","Positional factory function for cljs.core/ChunkedCons."],"~$ranged-iterator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5404,"^25",7,"^29",5404,"^24",22,"^2:",["^2;",["^2<",["^2;",[["~$v","^4P","^4Q"]]]]]],"^1:","~$cljs.core/ranged-iterator","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$v","^4P","^4Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5404,"^29",5404,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$v","^4P","^4Q"]]]]]],"~$ITransientVector",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",804,"^25",14,"^29",804,"^24",30,"^2A","Protocol for adding vector functionality to transient collections.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-assoc-n!",[["^2X","~$n","^2Z"]],"~$-pop!",[["^2X"]]]]],"^2S",true,"^1:","^?W","^23","cljs/core.cljs","^24",30,"^25",1,"^28",804,"^2U",["^ ","^2V",["^ ","^H4",[["^2X","~$n","^2Z"]],"^H5",[["^2X"]]]],"^30",null,"^29",804,"^31","^32","^33",["^19",["^34"]],"^2A","Protocol for adding vector functionality to transient collections.","^2T",["^2;",["@interface"]]],"^2Y",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8909,"^25",7,"^29",8909,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$map-entry"]]]]],"^2A","Returns the key of the map entry."],"^1:","~$cljs.core/key","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^H6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8909,"^29",8909,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^H6"]]]]],"^2A","Returns the key of the map entry."],"~$longs",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2804,"^25",7,"^29",2804,"^24",12,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/longs","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2804,"^29",2804,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$not=",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3949,"^25",16,"^29",3949,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Same as (not (= obj1 obj2))","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/not=","^2C",true,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",3949,"^3=","^3:","^29",3949,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Same as (not (= obj1 obj2))"],"~$set-print-err-fn!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",90,"^25",7,"^29",90,"^24",24,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Set *print-err-fn* to f."],"^1:","~$cljs.core/set-print-err-fn!","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",90,"^29",90,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Set *print-err-fn* to f."],"~$string?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",265,"^25",16,"^29",265,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a JavaScript string."],"^1:","~$cljs.core/string?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",265,"^3=","^3:","^29",265,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a JavaScript string."],"~$uri?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11499,"^25",7,"^29",11499,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true x is a goog.Uri instance.","^76","1.9"],"^76","1.9","^1:","~$cljs.core/uri?","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11499,"^29",11499,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true x is a goog.Uri instance."],"~$es6-iterator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1286,"^25",7,"^29",1286,"^24",19,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","EXPERIMENTAL: Return a ES2015 compatible iterator for coll."],"^1:","~$cljs.core/es6-iterator","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1286,"^29",1286,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","EXPERIMENTAL: Return a ES2015 compatible iterator for coll."],"~$Delay",["^ ","^3S",2,"^1O",["^19",["^8>","^3U"]],"^1:","~$cljs.core/Delay","^23","cljs/core.cljs","^24",15,"^3W",true,"^25",10,"^28",10371,"^3X",false,"^29",10371,"^31","^3Y","^2@",["^19",["^8>","^3U"]]],"~$munge-str",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11296,"^25",8,"^29",11296,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^:"]]]]]],"^59",true,"^1:","~$cljs.core/munge-str","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11296,"^29",11296,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:"]]]]]],"~$pr-str-with-opts",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10024,"^25",7,"^29",10024,"^24",23,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]],"^2A","Prints a sequence of objects to a string, observing all the\n  options given in opts"],"^1:","~$cljs.core/pr-str-with-opts","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^6Y","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10024,"^29",10024,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]],"^2A","Prints a sequence of objects to a string, observing all the\n  options given in opts"],"~$->RecordIter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",20,"^25",10,"^26","^27","^28",6438,"^29",6438,"^2:",["^2;",["^2<",["^2;",[["~$i","~$record","~$base-count","~$fields","~$ext-map-iter"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/RecordIter."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->RecordIter","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$i","^HK","^HL","^HM","^HN"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6438,"^29",6438,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$i","^HK","^HL","^HM","^HN"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/RecordIter."],"~$m3-C2",["^ ","^1:","~$cljs.core/m3-C2","^23","cljs/core.cljs","^28",912,"^25",1,"^29",912,"^24",11,"^1N",["^ ","^23","cljs/core.cljs","^28",912,"^25",6,"^29",912,"^24",11],"^31","^<"],"~$->Symbol",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1R","^1U","^<D","^1Z","^5N","^21"]],"^23","cljs/core.cljs","^24",16,"^25",10,"^26","^27","^28",1060,"^29",1060,"^2:",["^2;",["^2<",["^2;",[["^47","^:","~$str","~$_hash","^G1"]]]]],"^2@",["^19",["^1P","^1Q","^1R","^<D","^1Z","^5N","^21"]],"^2A","Positional factory function for cljs.core/Symbol."],"^1O",["^19",["^1P","^1Q","^1R","^1U","^<D","^1Z","^5N","^21"]],"^1:","~$cljs.core/->Symbol","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^47","^:","^HS","^HT","^G1"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",1060,"^29",1060,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^47","^:","^HS","^HT","^G1"]]]]],"^2@",["^19",["^1P","^1Q","^1R","^<D","^1Z","^5N","^21"]],"^2A","Positional factory function for cljs.core/Symbol."],"~$*print-newline*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",106,"^25",3,"^29",106,"^24",18,"^6F",true,"^2A","When set to logical false will drop newlines from printing calls.\n  This is to work around the implicit newlines emitted by standard JavaScript\n  console objects."],"^1:","~$cljs.core/*print-newline*","^23","cljs/core.cljs","^24",18,"^25",1,"^6F",true,"^28",101,"^29",106,"^31","^3:","^2A","When set to logical false will drop newlines from printing calls.\n  This is to work around the implicit newlines emitted by standard JavaScript\n  console objects."],"~$unchecked-multiply-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2740,"^25",15,"^29",2740,"^24",37,"^31","^<","^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the product of nums. (*) returns 1.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/unchecked-multiply-int","^2C",true,"^23","cljs/core.cljs","^24",37,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",2740,"^3=","^<","^29",2740,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns the product of nums. (*) returns 1."],"~$tapset",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",11343,"^25",3,"^29",11343,"^24",9,"^2T",["@type {*}"],"^59",true],"^59",true,"^1:","~$cljs.core/tapset","^23","cljs/core.cljs","^24",9,"^25",1,"^28",11342,"^29",11343,"^31","^57","^2T",["@type {*}"]],"~$chunk-rest",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3599,"^25",7,"^29",3599,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"^1:","~$cljs.core/chunk-rest","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3599,"^29",3599,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"~$remove-all-methods",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11028,"^25",7,"^29",11028,"^24",25,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Removes all of the methods of multimethod."],"^1:","~$cljs.core/remove-all-methods","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^87"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11028,"^29",11028,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Removes all of the methods of multimethod."],"~$trampoline",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10612,"^25",7,"^29",10612,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","~$&","^AD"]]]]],"^2A","trampoline can be used to convert algorithms requiring mutual\n  recursion without stack consumption. Calls f with supplied args, if\n  any. If f returns a fn, calls that fn with no arguments, and\n  continues to repeat, until the return value is not a fn, then\n  returns that non-fn value. Note that if you want to return a fn as a\n  final value, you must wrap it in some data structure and unpack it\n  after trampoline returns.","^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$f"]]],"^2:",["^2;",[["~$f"],["~$f","~$&","^AD"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/trampoline","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[["~$f"]]],"^2:",["^2;",[["~$f"],["~$f","~$&","^AD"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10612,"^29",10612,"^2G",1,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","~$&","^AD"]]],"^2A","trampoline can be used to convert algorithms requiring mutual\n  recursion without stack consumption. Calls f with supplied args, if\n  any. If f returns a fn, calls that fn with no arguments, and\n  continues to repeat, until the return value is not a fn, then\n  returns that non-fn value. Note that if you want to return a fn as a\n  final value, you must wrap it in some data structure and unpack it\n  after trampoline returns."],"~$double?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2306,"^25",16,"^29",2306,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true for JavaScript numbers, false otherwise."],"^1:","~$cljs.core/double?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2306,"^3=","^3:","^29",2306,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true for JavaScript numbers, false otherwise."],"~$pr-opts",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",176,"^25",8,"^29",176,"^24",15,"^59",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"^59",true,"^1:","~$cljs.core/pr-opts","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",176,"^29",176,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"~$*1",["^ ","^1:","~$cljs.core/*1","^23","cljs/core.cljs","^28",199,"^25",1,"^29",201,"^24",5,"^2A","bound in a repl thread to the most recent value printed","^1N",["^ ","^23","cljs/core.cljs","^28",201,"^25",3,"^29",201,"^24",5,"^2A","bound in a repl thread to the most recent value printed"]],"~$vec",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5647,"^25",7,"^29",5647,"^24",10,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Creates a new vector containing the contents of coll. JavaScript arrays\n  will be aliased and should not be modified."],"^1:","~$cljs.core/vec","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5647,"^29",5647,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Creates a new vector containing the contents of coll. JavaScript arrays\n  will be aliased and should not be modified."],"~$->Cycle",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",15,"^25",10,"^26","^27","^28",4792,"^29",4792,"^2:",["^2;",["^2<",["^2;",[["^2=","~$all","~$prev","~$current","^;3"]]]]],"^2@",["^19",["^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Cycle."],"^1O",["^19",["^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->Cycle","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2=","^I?","^I@","^IA","^;3"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4792,"^29",4792,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^I?","^I@","^IA","^;3"]]]]],"^2@",["^19",["^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Cycle."],"~$*print-meta*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",122,"^25",3,"^29",122,"^24",15,"^6F",true,"^2A","If set to logical true, when printing an object, its metadata will also\n  be printed in a form that can be read back by the reader.\n\n  Defaults to false."],"^1:","~$cljs.core/*print-meta*","^23","cljs/core.cljs","^24",15,"^25",1,"^6F",true,"^28",116,"^29",122,"^31","^3:","^2A","If set to logical true, when printing an object, its metadata will also\n  be printed in a form that can be read back by the reader.\n\n  Defaults to false."],"~$-notify-watches",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",773,"^25",4,"^29",773,"^24",19,"^5Y","^CU","^2A","Calls all watchers with this, oldval and newval.","^2:",["^2;",["^2<",["^2;",[["^CV","^ED","^:U"]]]]]],"^5Y","^CU","^1:","~$cljs.core/-notify-watches","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^CV","^ED","^:U"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",771,"^29",773,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^CV","^ED","^:U"]]]]],"^2A","Calls all watchers with this, oldval and newval."],"~$MultiFn",["^ ","^3S",8,"^1O",["^19",["^1Q","^1R","^7Q","^<D"]],"^1:","^FG","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",10843,"^3X",false,"^29",10843,"^31","^3Y","^2@",["^19",["^1Q","^1R","^7Q","^<D"]]],"~$NONE",["^ ","^1:","~$cljs.core/NONE","^23","cljs/core.cljs","^28",4036,"^25",1,"^29",4036,"^24",20,"^59",true,"^1N",["^ ","^23","cljs/core.cljs","^28",4036,"^25",16,"^29",4036,"^24",20,"^59",true],"^31","^45"],"~$int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2777,"^25",7,"^29",2777,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to int by stripping decimal places."],"^1:","~$cljs.core/int","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2777,"^29",2777,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to int by stripping decimal places."],"~$->ValSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",16,"^25",10,"^26","^27","^28",8914,"^29",8914,"^2:",["^2;",["^2<",["^2;",[["^G0","^G1"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/ValSeq."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->ValSeq","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^G0","^G1"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",8914,"^29",8914,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^G0","^G1"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/ValSeq."],"~$map-entry?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6650,"^25",16,"^29",6650,"^24",26,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x satisfies IMapEntry"],"^1:","~$cljs.core/map-entry?","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6650,"^3=","^3:","^29",6650,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x satisfies IMapEntry"],"~$rand",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10628,"^25",7,"^29",10628,"^24",11,"^2:",["^2;",["^2<",["^2;",[[],["~$n"]]]]],"^2A","Returns a random floating point number between 0 (inclusive) and\n  n (default 1) (exclusive).","^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["~$n"]]],"^2:",["^2;",[[],["~$n"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/rand","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["~$n"]]],"^2:",["^2;",[[],["~$n"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[[],["~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10628,"^29",10628,"^2G",1,"^2H",true,"^2:",["^2;",[[],["~$n"]]],"^2A","Returns a random floating point number between 0 (inclusive) and\n  n (default 1) (exclusive)."],"~$second",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1736,"^25",7,"^29",1736,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (first (next x))"],"^1:","~$cljs.core/second","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1736,"^29",1736,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (first (next x))"],"~$find-ns-obj",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11416,"^25",7,"^29",11416,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^47"]]]]],"^2A","Bootstrap only."],"^1:","~$cljs.core/find-ns-obj","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^47"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11416,"^29",11416,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^47"]]]]],"^2A","Bootstrap only."],"~$IEditableCollection",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",781,"^25",14,"^29",781,"^24",33,"^2A","Protocol for collections which can transformed to transients.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^><",[["^2O"]]]]],"^2S",true,"^1:","^1T","^23","cljs/core.cljs","^24",33,"^25",1,"^28",781,"^2U",["^ ","^2V",["^ ","^><",[["^2O"]]]],"^30",null,"^29",781,"^31","^32","^33",["^19",["^4V","^4W","^4X","^50","^7E"]],"^2A","Protocol for collections which can transformed to transients.","^2T",["^2;",["@interface"]]],"~$hash-combine",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1023,"^25",7,"^29",1023,"^24",19,"^2:",["^2;",["^2<",["^2;",[["~$seed","^B;"]]]]]],"^1:","~$cljs.core/hash-combine","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^IX","^B;"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1023,"^29",1023,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^IX","^B;"]]]]]],"~$>",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2634,"^25",16,"^29",2634,"^24",17,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns non-nil if nums are in monotonically decreasing order,\n  otherwise false.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/>","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2634,"^3=","^3:","^29",2634,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns non-nil if nums are in monotonically decreasing order,\n  otherwise false."],"~$-name",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",841,"^25",12,"^29",841,"^24",17,"^31","^90","^5Y","^<D","^2A","Returns the name String of x.","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^5Y","^<D","^1:","~$cljs.core/-name","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",839,"^3=","^90","^29",841,"^2G",1,"^31","^90","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns the name String of x."],"~$replace",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9339,"^25",7,"^29",9339,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$smap"],["^J2","^2O"]]]]],"^2A","Given a map of replacement pairs and a vector/collection, returns a\n  vector/seq with any elements = a key in smap replaced with the\n  corresponding val in smap.  Returns a transducer when no collection\n  is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^J2"],["^J2","^2O"]]],"^2:",["^2;",[["^J2"],["^J2","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/replace","^2C",false,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^J2"],["^J2","^2O"]]],"^2:",["^2;",[["^J2"],["^J2","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^J2"],["^J2","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9339,"^29",9339,"^2G",2,"^2H",true,"^2:",["^2;",[["^J2"],["^J2","^2O"]]],"^2A","Given a map of replacement pairs and a vector/collection, returns a\n  vector/seq with any elements = a key in smap replaced with the\n  corresponding val in smap.  Returns a transducer when no collection\n  is provided."],"~$int?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2248,"^25",16,"^29",2248,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies integer? or is an instance of goog.math.Integer\n   or goog.math.Long."],"^1:","~$cljs.core/int?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2248,"^3=","^3:","^29",2248,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies integer? or is an instance of goog.math.Integer\n   or goog.math.Long."],"~$->Subvec",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]],"^23","cljs/core.cljs","^24",16,"^25",10,"^26","^27","^28",5759,"^29",5759,"^2:",["^2;",["^2<",["^2;",[["^2=","~$v","^4P","^4Q","^2?"]]]]],"^2@",["^19",["^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]],"^2A","Positional factory function for cljs.core/Subvec."],"^1O",["^19",["^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]],"^1:","~$cljs.core/->Subvec","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^2=","~$v","^4P","^4Q","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",5759,"^29",5759,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","~$v","^4P","^4Q","^2?"]]]]],"^2@",["^19",["^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]],"^2A","Positional factory function for cljs.core/Subvec."],"~$associative?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2113,"^25",16,"^29",2113,"^24",28,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements IAssociative"],"^1:","~$cljs.core/associative?","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2113,"^3=","^3:","^29",2113,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements IAssociative"],"~$unchecked-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2782,"^25",7,"^29",2782,"^24",20,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to int by stripping decimal places."],"^1:","~$cljs.core/unchecked-int","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2782,"^29",2782,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Coerce to int by stripping decimal places."],"~$js-keys",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2164,"^25",7,"^29",2164,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^3;"]]]]],"^2A","Return the JavaScript keys for an object."],"^1:","~$cljs.core/js-keys","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^3;"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2164,"^29",2164,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;"]]]]],"^2A","Return the JavaScript keys for an object."],"~$inst-ms*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1378,"^25",4,"^29",1378,"^24",12,"^5Y","~$cljs.core/Inst","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^70"]]]]]],"^5Y","^J?","^1:","~$cljs.core/inst-ms*","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^70"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1377,"^29",1378,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^70"]]]]],"^2A",null],"~$ES6EntriesIterator",["^ ","^3S",1,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/ES6EntriesIterator","^23","cljs/core.cljs","^24",28,"^3W",true,"^25",10,"^28",6451,"^3X",false,"^29",6451,"^31","^3Y","^2@",null],"~$keyword?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3302,"^25",16,"^29",3302,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a Keyword"],"^1:","~$cljs.core/keyword?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3302,"^3=","^3:","^29",3302,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a Keyword"],"~$array-iter",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3988,"^25",7,"^29",3988,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/array-iter","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3988,"^29",3988,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$force",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10387,"^25",7,"^29",10387,"^24",12,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","If x is a Delay, returns the (possibly cached) value of its expression, else returns x"],"^1:","~$cljs.core/force","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10387,"^29",10387,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","If x is a Delay, returns the (possibly cached) value of its expression, else returns x"],"~$group-by",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10645,"^25",7,"^29",10645,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$f","^2O"]]]]],"^2A","Returns a map of the elements of coll keyed by the result of\n  f on each element. The value at each key will be a vector of the\n  corresponding elements, in the order they appeared in coll."],"^1:","~$cljs.core/group-by","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$f","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10645,"^29",10645,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f","^2O"]]]]],"^2A","Returns a map of the elements of coll keyed by the result of\n  f on each element. The value at each key will be a vector of the\n  corresponding elements, in the order they appeared in coll."],"^DE",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",730,"^25",9,"^29",730,"^24",14,"^31","^5X","^5Y","^5C","^2A","Returns a seq of the items in coll in reversed order.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^5C","^1:","~$cljs.core/-rseq","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",728,"^3=","^5X","^29",730,"^2G",1,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a seq of the items in coll in reversed order."],"~$prn",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10097,"^25",7,"^29",10097,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$&","^6Y"]]]]],"^2A","Same as pr followed by (newline).","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/prn","^2C",true,"^23","cljs/core.cljs","^24",10,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^6Y"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10097,"^29",10097,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^6Y"]]],"^2A","Same as pr followed by (newline)."],"~$tv-pop-tail",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5943,"^25",8,"^29",5943,"^24",19,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^8C","^:5","^84"]]]]]],"^59",true,"^1:","~$cljs.core/tv-pop-tail","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^8C","^:5","^84"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5943,"^29",5943,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^8C","^:5","^84"]]]]]],"^BD",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11057,"^25",7,"^29",11057,"^24",27,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Given a multimethod, return it's default-dispatch-val."],"^1:","~$cljs.core/default-dispatch-val","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^87"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11057,"^29",11057,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Given a multimethod, return it's default-dispatch-val."],"~$->Atom",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^CU","~$cljs.core/IAtom","^1P","^1Q","^1U","^1Z","^3U"]],"^23","cljs/core.cljs","^24",14,"^25",10,"^26","^27","^28",4375,"^29",4375,"^2:",["^2;",["^2<",["^2;",[["~$state","^2=","^8N","~$watches"]]]]],"^2@",["^19",["^CU","^JR","^1P","^1Q","^1Z","^3U"]],"^2A","Positional factory function for cljs.core/Atom."],"^1O",["^19",["^CU","^JR","^1P","^1Q","^1U","^1Z","^3U"]],"^1:","~$cljs.core/->Atom","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^JS","^2=","^8N","^JT"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4375,"^29",4375,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^JS","^2=","^8N","^JT"]]]]],"^2@",["^19",["^CU","^JR","^1P","^1Q","^1Z","^3U"]],"^2A","Positional factory function for cljs.core/Atom."],"~$PersistentHashMap",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",1959,"^25",10,"^29",1959,"^24",27,"^5A",true],"^3S",6,"^1O",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22"]],"^1:","^4V","^23","cljs/core.cljs","^24",27,"^3W",true,"^25",10,"^28",7767,"^3X",false,"^5A",true,"^29",7767,"^31","^3Y","^2@",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22"]]],"~$unchecked-multiply",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2733,"^25",15,"^29",2733,"^24",33,"^31","^<","^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the product of nums. (*) returns 1.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/unchecked-multiply","^2C",true,"^23","cljs/core.cljs","^24",33,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",2733,"^3=","^<","^29",2733,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns the product of nums. (*) returns 1."],"~$ArrayNodeSeq",["^ ","^3S",5,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","^>Y","^23","cljs/core.cljs","^24",22,"^3W",true,"^25",10,"^28",7688,"^3X",false,"^29",7688,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"~$even?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4206,"^25",16,"^29",4206,"^24",21,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns true if n is even, throws an exception if n is not an integer"],"^1:","~$cljs.core/even?","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4206,"^3=","^3:","^29",4206,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns true if n is even, throws an exception if n is not an integer"],"~$es6-iterator-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1303,"^25",7,"^29",1303,"^24",23,"^2:",["^2;",["^2<",["^2;",[["^4A"]]]]],"^2A","EXPERIMENTAL: Given an ES2015 compatible iterator return a seq."],"^1:","~$cljs.core/es6-iterator-seq","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^4A"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1303,"^29",1303,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4A"]]]]],"^2A","EXPERIMENTAL: Given an ES2015 compatible iterator return a seq."],"~$unchecked-dec",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2710,"^25",7,"^29",2710,"^24",20,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one less than x, an int."],"^1:","~$cljs.core/unchecked-dec","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2710,"^29",2710,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one less than x, an int."],"~$Inst",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",1377,"^25",14,"^29",1377,"^24",18,"^2A",null,"^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^J>",[["^70"]]]]],"^2S",true,"^1:","^J?","^23","cljs/core.cljs","^24",18,"^25",1,"^28",1377,"^2U",["^ ","^2V",["^ ","^J>",[["^70"]]]],"^30",null,"^29",1377,"^31","^32","^33",["^19",["^G6"]],"^2A",null,"^2T",["^2;",["@interface"]]],"~$hash-collision-node-find-index",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7481,"^25",8,"^29",7481,"^24",38,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","^67","^2Y"]]]]]],"^59",true,"^1:","~$cljs.core/hash-collision-node-find-index","^2C",false,"^23","cljs/core.cljs","^24",38,"^2D",["^2;",[["^66","^67","^2Y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7481,"^29",7481,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","^67","^2Y"]]]]]],"~$persistent-array-map-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6718,"^25",7,"^29",6718,"^24",31,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^G1"]]]]]],"^1:","~$cljs.core/persistent-array-map-seq","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["^66","~$i","^G1"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6718,"^29",6718,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^G1"]]]]]],"~$RangeIterator",["^ ","^3S",3,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/RangeIterator","^23","cljs/core.cljs","^24",23,"^3W",true,"^25",10,"^28",9526,"^3X",false,"^29",9526,"^31","^3Y","^2@",null],"~$tagged-literal?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11239,"^25",16,"^29",11239,"^24",31,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["^4@"]]]]],"^2A","Return true if the value is the data representation of a tagged literal"],"^1:","~$cljs.core/tagged-literal?","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["^4@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11239,"^3=","^3:","^29",11239,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4@"]]]]],"^2A","Return true if the value is the data representation of a tagged literal"],"~$double-array",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3674,"^25",7,"^29",3674,"^24",19,"^2:",["^2;",["^2<",["^2;",[["^B>"],["^B?","^B@"]]]]],"^2A","Creates an array of doubles. Does not coerce array, provided for compatibility\n  with Clojure.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/double-array","^2C",false,"^23","cljs/core.cljs","^24",19,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3674,"^29",3674,"^2G",2,"^2H",true,"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2A","Creates an array of doubles. Does not coerce array, provided for compatibility\n  with Clojure."],"~$create-ns",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11452,"^25",7,"^29",11452,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^GU"],["^GU","^?Q"]]]]],"^2A","Create a new namespace named by the symbol. Bootstrap only.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^GU"],["^GU","^?Q"]]],"^2:",["^2;",[["^GU"],["^GU","^?Q"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/create-ns","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^GU"],["^GU","^?Q"]]],"^2:",["^2;",[["^GU"],["^GU","^?Q"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^GU"],["^GU","^?Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11452,"^29",11452,"^2G",2,"^2H",true,"^2:",["^2;",[["^GU"],["^GU","^?Q"]]],"^2A","Create a new namespace named by the symbol. Bootstrap only."],"~$->EmptyList",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^A>","^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",19,"^25",10,"^26","^27","^28",3091,"^29",3091,"^2:",["^2;",["^2<",["^2;",[["^2="]]]]],"^2@",["^19",["^A>","^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/EmptyList."],"^1O",["^19",["^A>","^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^1:","~$cljs.core/->EmptyList","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^2="]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3091,"^29",3091,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2="]]]]],"^2@",["^19",["^A>","^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/EmptyList."],"~$seq-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2439,"^25",8,"^29",2439,"^24",18,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/seq-reduce","^2C",false,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2439,"^29",2439,"^2G",3,"^2H",true,"^2:",["^2;",[["~$f","^2O"],["~$f","^2Z","^2O"]]]],"~$spread",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3730,"^25",7,"^29",3730,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$arglist"]]]]]],"^1:","~$cljs.core/spread","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^KF"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3730,"^29",3730,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^KF"]]]]]],"~$balance-left",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8140,"^25",8,"^29",8140,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","~$ins","~$right"]]]]]],"^59",true,"^1:","~$cljs.core/balance-left","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^2Y","^2Z","^KI","^KJ"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8140,"^29",8140,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^KI","^KJ"]]]]]],"~$rseq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3164,"^25",12,"^29",3164,"^24",16,"^31","^3P","^2:",["^2;",["^2<",["^2;",[["~$rev"]]]]],"^2A","Returns, in constant time, a seq of the items in rev (which\n  can be a vector or sorted-map), in reverse order. If rev is empty returns nil"],"^1:","~$cljs.core/rseq","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^KM"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3164,"^3=","^3P","^29",3164,"^2G",1,"^31","^3P","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^KM"]]]]],"^2A","Returns, in constant time, a seq of the items in rev (which\n  can be a vector or sorted-map), in reverse order. If rev is empty returns nil"],"~$ex-cause",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11177,"^25",7,"^29",11177,"^24",15,"^2:",["^2;",["^2<",["^2;",[["^;S"]]]]],"^2A","Returns exception cause (an Error / ExceptionInfo) if ex is an\n  ExceptionInfo.\n  Otherwise returns nil."],"^1:","~$cljs.core/ex-cause","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^;S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11177,"^29",11177,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^;S"]]]]],"^2A","Returns exception cause (an Error / ExceptionInfo) if ex is an\n  ExceptionInfo.\n  Otherwise returns nil."],"~$IReset",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",849,"^25",14,"^29",849,"^24",20,"^2A","Protocol for adding resetting functionality.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-reset!",[["~$o","^CP"]]]]],"^2S",true,"^1:","~$cljs.core/IReset","^23","cljs/core.cljs","^24",20,"^25",1,"^28",849,"^2U",["^ ","^2V",["^ ","^KR",[["~$o","^CP"]]]],"^30",null,"^29",849,"^31","^32","^33",["^19",[]],"^2A","Protocol for adding resetting functionality.","^2T",["^2;",["@interface"]]],"~$IEmptyableCollection",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",575,"^25",14,"^29",575,"^24",34,"^2A","Protocol for creating an empty collection.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^7=",[["^2O"]]]]],"^2S",true,"^1:","^1W","^23","cljs/core.cljs","^24",34,"^25",1,"^28",575,"^2U",["^ ","^2V",["^ ","^7=",[["^2O"]]]],"^30",null,"^29",575,"^31","^32","^33",["^19",["^4V","^4W","^>R","^4X","^9[","^>T","^5F","^4Y","^4Z","^>V","^8?","^4[","^>W","^>Y","^>Z","^>[","^;V","^50","^?0","^?1","^?3","^?4","^7E","^51","^?5","^?6","^7F","^?8","^>K","^9>","^52"]],"^2A","Protocol for creating an empty collection.","^2T",["^2;",["@interface"]]],"~$array-map-index-of",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6536,"^25",8,"^29",6536,"^24",26,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$m","~$k"]]]]]],"^59",true,"^1:","~$cljs.core/array-map-index-of","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["~$m","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6536,"^29",6536,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$m","~$k"]]]]]],"~$ex-message",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11170,"^25",7,"^29",11170,"^24",17,"^2:",["^2;",["^2<",["^2;",[["^;S"]]]]],"^2A","Returns the message attached to the given Error / ExceptionInfo object.\n  For non-Errors returns nil."],"^1:","~$cljs.core/ex-message","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^;S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11170,"^29",11170,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^;S"]]]]],"^2A","Returns the message attached to the given Error / ExceptionInfo object.\n  For non-Errors returns nil."],"~$->NodeIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",23,"^25",11,"^26","^27","^28",7107,"^29",7107,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","~$next-entry","~$next-iter"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/NodeIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->NodeIterator","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^66","~$i","^KZ","^K["]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",2,"^26","^27","^28",7107,"^29",7107,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^KZ","^K["]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/NodeIterator."],"~$*print-fn-bodies*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",169,"^25",3,"^29",169,"^24",20,"^6F",true,"^2A","*print-fns-bodies* controls whether functions print their source or\n    only their names."],"^1:","~$cljs.core/*print-fn-bodies*","^23","cljs/core.cljs","^24",20,"^25",1,"^6F",true,"^28",165,"^29",169,"^31","^3:","^2A","*print-fns-bodies* controls whether functions print their source or\n    only their names."],"~$string-print",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9879,"^25",7,"^29",9879,"^24",19,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/string-print","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9879,"^29",9879,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$float",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2687,"^25",15,"^29",2687,"^24",20,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/float","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2687,"^3=","^<","^29",2687,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$IRecord",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",725,"^25",14,"^29",725,"^24",21,"^2A","Marker interface indicating a record object","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ "]]],"^2S",true,"^1:","~$cljs.core/IRecord","^23","cljs/core.cljs","^24",21,"^25",1,"^28",725,"^2U",["^ ","^2V",["^ "]],"^30",null,"^29",725,"^31","^32","^33",["^19",[]],"^2A","Marker interface indicating a record object","^2T",["^2;",["@interface"]]],"~$pr-str",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10055,"^25",7,"^29",10055,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$&","^6Y"]]]]],"^2A","pr to a string, returning it. Fundamental entrypoint to IPrintWithWriter.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/pr-str","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^6Y"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10055,"^29",10055,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^6Y"]]],"^2A","pr to a string, returning it. Fundamental entrypoint to IPrintWithWriter."],"~$first-array-for-longvec",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5344,"^25",8,"^29",5344,"^24",31,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6>"]]]]]],"^59",true,"^1:","~$cljs.core/first-array-for-longvec","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["^6>"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5344,"^29",5344,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6>"]]]]]],"~$es6-set-entries-iterator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6473,"^25",7,"^29",6473,"^24",31,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^1:","~$cljs.core/es6-set-entries-iterator","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6473,"^29",6473,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"~$concat",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3739,"^25",7,"^29",3739,"^24",13,"^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","~$zs"]]]]],"^2A","Returns a lazy seq representing the concatenation of the elements in the supplied colls.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^L@"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/concat","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^L@"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",3739,"^29",3739,"^2G",2,"^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^L@"]]],"^2A","Returns a lazy seq representing the concatenation of the elements in the supplied colls."],"~$-methods",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10835,"^25",4,"^29",10835,"^24",12,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-methods","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^7R"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10835,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]],"^2A",null],"~$js-reserved",["^ ","^1:","~$cljs.core/js-reserved","^23","cljs/core.cljs","^28",11269,"^25",1,"^29",11271,"^24",14,"^2T",["@type {null|Object}"],"^1N",["^ ","^23","cljs/core.cljs","^28",11271,"^25",3,"^29",11271,"^24",14,"^2T",["@type {null|Object}"]],"^31","^57"],"~$IDerefWithTimeout",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",676,"^25",14,"^29",676,"^24",31,"^2A",null,"^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^DL",[["~$o","^DN","^DO"]]]]],"^2S",true,"^1:","^DM","^23","cljs/core.cljs","^24",31,"^25",1,"^28",676,"^2U",["^ ","^2V",["^ ","^DL",[["~$o","^DN","^DO"]]]],"^30",null,"^29",676,"^31","^32","^33",["^19",[]],"^2A",null,"^2T",["^2;",["@interface"]]],"~$symbol",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1094,"^25",7,"^29",1094,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^:"],["^47","^:"]]]]],"^2A","Returns a Symbol with the given namespace and name.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^:"],["^47","^:"]]],"^2:",["^2;",[["^:"],["^47","^:"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/symbol","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^:"],["^47","^:"]]],"^2:",["^2;",[["^:"],["^47","^:"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^:"],["^47","^:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1094,"^29",1094,"^2G",2,"^2H",true,"^2:",["^2;",[["^:"],["^47","^:"]]],"^2A","Returns a Symbol with the given namespace and name."],"~$to-array-2d",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3619,"^25",7,"^29",3619,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a (potentially-ragged) 2-dimensional array\n  containing the contents of coll."],"^1:","~$cljs.core/to-array-2d","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3619,"^29",3619,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a (potentially-ragged) 2-dimensional array\n  containing the contents of coll."],"~$Subvec",["^ ","^3S",5,"^1O",["^19",["^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]],"^1:","^4[","^23","cljs/core.cljs","^24",16,"^3W",true,"^25",10,"^28",5759,"^3X",false,"^29",5759,"^31","^3Y","^2@",["^19",["^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]]],"~$ExceptionInfo",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11128,"^25",3,"^29",11128,"^24",16,"^2T",["@constructor"],"^2:",["^2;",["^2<",["^2;",[["~$message","~$data","~$cause"]]]]]],"^1:","^>X","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^LM","^LN","^LO"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11127,"^29",11128,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^LM","^LN","^LO"]]]]],"^2T",["@constructor"]],"~$mod",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2811,"^25",7,"^29",2811,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","Modulus of num and div. Truncates toward negative infinity."],"^1:","~$cljs.core/mod","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["~$n","~$d"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2811,"^29",2811,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","Modulus of num and div. Truncates toward negative infinity."],"~$ISet",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",651,"^25",14,"^29",651,"^24",18,"^2A","Protocol for adding set functionality to a collection.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-disjoin",[["^2O","~$v"]]]]],"^2S",true,"^1:","^1V","^23","cljs/core.cljs","^24",18,"^25",1,"^28",651,"^2U",["^ ","^2V",["^ ","^LS",[["^2O","~$v"]]]],"^30",null,"^29",651,"^31","^32","^33",["^19",["^7E","^7F"]],"^2A","Protocol for adding set functionality to a collection.","^2T",["^2;",["@interface"]]],"~$pop",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2071,"^25",7,"^29",2071,"^24",10,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","For a list or queue, returns a new list/queue without the first\n  item, for a vector, returns a new vector without the last item.\n  Note - not the same as next/butlast."],"^1:","~$cljs.core/pop","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2071,"^29",2071,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","For a list or queue, returns a new list/queue without the first\n  item, for a vector, returns a new vector without the last item.\n  Note - not the same as next/butlast."],"~$IPending",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",765,"^25",14,"^29",765,"^24",22,"^2A","Protocol for types which can have a deferred realization. Currently only\n  implemented by Delay and LazySeq.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^DH",[["~$x"]]]]],"^2S",true,"^1:","^8>","^23","cljs/core.cljs","^24",22,"^25",1,"^28",765,"^2U",["^ ","^2V",["^ ","^DH",[["~$x"]]]],"^30",null,"^29",765,"^31","^32","^33",["^19",["^HE","^8?","^>[","^?1","^?4"]],"^2A","Protocol for types which can have a deferred realization. Currently only\n  implemented by Delay and LazySeq.","^2T",["^2;",["@interface"]]],"~$-entry-key",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",745,"^25",4,"^29",745,"^24",14,"^5Y","^6U","^2A","Returns the key for entry.","^2:",["^2;",["^2<",["^2;",[["^2O","~$entry"]]]]]],"^5Y","^6U","^1:","~$cljs.core/-entry-key","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O","^LX"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",733,"^29",745,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","^LX"]]]]],"^2A","Returns the key for entry."],"~$CHAR_MAP",["^ ","^1:","~$cljs.core/CHAR_MAP","^23","cljs/core.cljs","^28",335,"^25",1,"^29",336,"^24",11,"^2T",["@enum {string}"],"^1N",["^ ","^23","cljs/core.cljs","^28",336,"^25",3,"^29",336,"^24",11,"^2T",["@enum {string}"]],"^31","^45"],"~$pop-tail",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5378,"^25",8,"^29",5378,"^24",16,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6>","^:5","^84"]]]]]],"^59",true,"^1:","~$cljs.core/pop-tail","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^6>","^:5","^84"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5378,"^29",5378,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6>","^:5","^84"]]]]]],"~$dissoc!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3814,"^25",7,"^29",3814,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^2X","^2Y"],["^2X","^2Y","~$&","^8J"]]]]],"^2A","Returns a transient map that doesn't contain a mapping for key(s).","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2X","^2Y"]]],"^2:",["^2;",[["^2X","^2Y"],["^2X","^2Y","~$&","^8J"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/dissoc!","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["^2X","^2Y"]]],"^2:",["^2;",[["^2X","^2Y"],["^2X","^2Y","~$&","^8J"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2X","^2Y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3814,"^29",3814,"^2G",2,"^2H",true,"^2:",["^2;",[["^2X","^2Y"],["^2X","^2Y","~$&","^8J"]]],"^2A","Returns a transient map that doesn't contain a mapping for key(s)."],"~$reductions",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9719,"^25",7,"^29",9719,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$f","^2O"],["~$f","^97","^2O"]]]]],"^2A","Returns a lazy seq of the intermediate values of the reduction (as\n  per reduce) of coll by f, starting with init.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$f","^2O"],["~$f","^97","^2O"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^97","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/reductions","^2C",false,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$f","^2O"],["~$f","^97","^2O"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^97","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f","^2O"],["~$f","^97","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9719,"^29",9719,"^2G",3,"^2H",true,"^2:",["^2;",[["~$f","^2O"],["~$f","^97","^2O"]]],"^2A","Returns a lazy seq of the intermediate values of the reduction (as\n  per reduce) of coll by f, starting with init."],"~$indexed?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1521,"^25",16,"^29",1521,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements nth in constant time"],"^1:","~$cljs.core/indexed?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1521,"^3=","^3:","^29",1521,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements nth in constant time"],"~$-",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2587,"^25",15,"^29",2587,"^24",16,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/-","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2587,"^3=","^<","^29",2587,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result."],"~$Cycle",["^ ","^3S",5,"^1O",["^19",["^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","^>[","^23","cljs/core.cljs","^24",15,"^3W",true,"^25",10,"^28",4792,"^3X",false,"^29",4792,"^31","^3Y","^2@",["^19",["^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"^G4",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",706,"^25",13,"^29",706,"^24",19,"^31","^3:","^5Y","^1P","^2A","Returns true if o and other are equal, false otherwise.","^2:",["^2;",["^2<",["^2;",[["~$o","^G5"]]]]]],"^5Y","^1P","^1:","~$cljs.core/-equiv","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$o","^G5"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",704,"^3=","^3:","^29",706,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o","^G5"]]]]],"^2A","Returns true if o and other are equal, false otherwise."],"~$->RangeIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",23,"^25",10,"^26","^27","^28",9526,"^29",9526,"^2:",["^2;",["^2<",["^2;",[["~$i","^4Q","^=?"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/RangeIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->RangeIterator","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$i","^4Q","^=?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",9526,"^29",9526,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$i","^4Q","^=?"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/RangeIterator."],"~$->ArrayNode",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U","^20"]],"^23","cljs/core.cljs","^24",19,"^25",10,"^26","^27","^28",7380,"^29",7380,"^2:",["^2;",["^2<",["^2;",[["^=J","^67","^66"]]]]],"^2@",["^19",["^20"]],"^2A","Positional factory function for cljs.core/ArrayNode."],"^1O",["^19",["^1U","^20"]],"^1:","~$cljs.core/->ArrayNode","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^=J","^67","^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7380,"^29",7380,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^67","^66"]]]]],"^2@",["^19",["^20"]],"^2A","Positional factory function for cljs.core/ArrayNode."],"~$assoc!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3802,"^25",7,"^29",3802,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^2X","^2Y","^2Z"],["^2X","^2Y","^2Z","~$&","~$kvs"]]]]],"^2A","When applied to a transient map, adds mapping of key(s) to\n  val(s). When applied to a transient vector, sets the val at index.\n  Note - index must be <= (count vector). Returns coll.","^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^2X","^2Y","^2Z"]]],"^2:",["^2;",[["^2X","^2Y","^2Z"],["^2X","^2Y","^2Z","~$&","^M@"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/assoc!","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^2X","^2Y","^2Z"]]],"^2:",["^2;",[["^2X","^2Y","^2Z"],["^2X","^2Y","^2Z","~$&","^M@"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2X","^2Y","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3802,"^29",3802,"^2G",3,"^2H",true,"^2:",["^2;",[["^2X","^2Y","^2Z"],["^2X","^2Y","^2Z","~$&","^M@"]]],"^2A","When applied to a transient map, adds mapping of key(s) to\n  val(s). When applied to a transient vector, sets the val at index.\n  Note - index must be <= (count vector). Returns coll."],"~$hash-set",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9321,"^25",7,"^29",9321,"^24",15,"^2:",["^2;",["^2<",["^2;",[[],["~$&","^CM"]]]]],"^2A","Returns a new hash set with supplied keys.  Any equal keys are\n  handled as if by repeated uses of conj.","^2K",["^ ","^2C",true,"^2G",0,"^2D",["^2;",[[]]],"^2:",["^2;",[[],["~$&","^CM"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/hash-set","^2C",true,"^23","cljs/core.cljs","^24",15,"^2K",["^ ","^2C",true,"^2G",0,"^2D",["^2;",[[]]],"^2:",["^2;",[[],["~$&","^CM"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9321,"^29",9321,"^2G",0,"^2H",true,"^2:",["^2;",[[],["~$&","^CM"]]],"^2A","Returns a new hash set with supplied keys.  Any equal keys are\n  handled as if by repeated uses of conj."],"~$reduce-kv",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2534,"^25",7,"^29",2534,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$f","^97","^2O"]]]]],"^2A","Reduces an associative collection. f should be a function of 3\n  arguments. Returns the result of applying f to init, the first key\n  and the first value in coll, then applying f to that result and the\n  2nd key and value, etc. If coll contains no entries, returns init\n  and f is not called. Note that reduce-kv is supported on vectors,\n  where the keys will be the ordinals."],"^1:","~$cljs.core/reduce-kv","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$f","^97","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2534,"^29",2534,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f","^97","^2O"]]]]],"^2A","Reduces an associative collection. f should be a function of 3\n  arguments. Returns the result of applying f to init, the first key\n  and the first value in coll, then applying f to that result and the\n  2nd key and value, etc. If coll contains no entries, returns init\n  and f is not called. Note that reduce-kv is supported on vectors,\n  where the keys will be the ordinals."],"~$reset!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4423,"^25",7,"^29",4423,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$a","^CP"]]]]],"^2A","Sets the value of atom to newval without regard for the\n  current value. Returns new-value."],"^1:","~$cljs.core/reset!","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["~$a","^CP"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4423,"^29",4423,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$a","^CP"]]]]],"^2A","Sets the value of atom to newval without regard for the\n  current value. Returns new-value."],"^:",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9390,"^25",7,"^29",9390,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns the name String of a string, symbol or keyword."],"^1:","~$cljs.core/name","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9390,"^29",9390,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns the name String of a string, symbol or keyword."],"~$->RedNode",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^23","cljs/core.cljs","^24",17,"^25",10,"^26","^27","^28",8363,"^29",8363,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","~$left","^KJ","^2?"]]]]],"^2@",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^2A","Positional factory function for cljs.core/RedNode."],"^1O",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^1:","~$cljs.core/->RedNode","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2Y","^2Z","^MJ","^KJ","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",8363,"^29",8363,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^MJ","^KJ","^2?"]]]]],"^2@",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^2A","Positional factory function for cljs.core/RedNode."],"~$unchecked-array-for",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5352,"^25",8,"^29",5352,"^24",27,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6>","~$i"]]]]]],"^59",true,"^1:","~$cljs.core/unchecked-array-for","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^6>","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5352,"^29",5352,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6>","~$i"]]]]]],"~$Fn",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",534,"^25",14,"^29",534,"^24",16,"^2A","Marker protocol","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ "]]],"^2S",true,"^1:","^4E","^23","cljs/core.cljs","^24",16,"^25",1,"^28",534,"^2U",["^ ","^2V",["^ "]],"^30",null,"^29",534,"^31","^32","^33",["^19",["^4F","^3Y","^AR"]],"^2A","Marker protocol","^2T",["^2;",["@interface"]]],"~$ffirst",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1741,"^25",7,"^29",1741,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (first (first x))"],"^1:","~$cljs.core/ffirst","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1741,"^29",1741,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (first (first x))"],"~$->ArrayNodeIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",27,"^25",10,"^26","^27","^28",7360,"^29",7360,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^K["]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ArrayNodeIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->ArrayNodeIterator","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^66","~$i","^K["]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7360,"^29",7360,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","^K["]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ArrayNodeIterator."],"~$sorted-set",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9327,"^25",7,"^29",9327,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$&","^CM"]]]]],"^2A","Returns a new sorted set with supplied keys.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^CM"]]],"^2:",["^2;",[["~$&","^CM"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/sorted-set","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^CM"]]],"^2:",["^2;",[["~$&","^CM"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^CM"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",9327,"^29",9327,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^CM"]]],"^2A","Returns a new sorted set with supplied keys."],"~$pr-with-opts",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10041,"^25",8,"^29",10041,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]],"^2A","Prints a sequence of objects using string-print, observing all\n  the options given in opts"],"^59",true,"^1:","~$cljs.core/pr-with-opts","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^6Y","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10041,"^29",10041,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]],"^2A","Prints a sequence of objects using string-print, observing all\n  the options given in opts"],"~$PersistentTreeMap",["^ ","^3S",5,"^1O",["^19",["^5C","^98","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^7W","^A6","^22"]],"^1:","^51","^23","cljs/core.cljs","^24",27,"^3W",true,"^25",10,"^28",8634,"^3X",false,"^29",8634,"^31","^3Y","^2@",["^19",["^5C","^98","^1P","^1Q","^1R","^1S","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^7W","^A6","^22"]]],"~$strip-ns",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10104,"^25",8,"^29",10104,"^24",16,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$named"]]]]]],"^59",true,"^1:","~$cljs.core/strip-ns","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^MY"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10104,"^29",10104,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^MY"]]]]]],"~$->PersistentTreeMap",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5C","^98","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^7W","^A6","^22"]],"^23","cljs/core.cljs","^24",27,"^25",10,"^26","^27","^28",8634,"^29",8634,"^2:",["^2;",["^2<",["^2;",[["^2P","^5R","^67","^2=","^2?"]]]]],"^2@",["^19",["^5C","^98","^1P","^1Q","^1R","^1S","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^7W","^A6","^22"]],"^2A","Positional factory function for cljs.core/PersistentTreeMap."],"^1O",["^19",["^5C","^98","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^7W","^A6","^22"]],"^1:","~$cljs.core/->PersistentTreeMap","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^2P","^5R","^67","^2=","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",8634,"^29",8634,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2P","^5R","^67","^2=","^2?"]]]]],"^2@",["^19",["^5C","^98","^1P","^1Q","^1R","^1S","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^7W","^A6","^22"]],"^2A","Positional factory function for cljs.core/PersistentTreeMap."],"~$array-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1484,"^25",8,"^29",1484,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$f"],["^66","~$f","^2Z"],["^66","~$f","^2Z","^7:"]]]]],"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^66","~$f"],["^66","~$f","^2Z"],["^66","~$f","^2Z","^7:"]]],"^2:",["^2;",[["^66","~$f"],["^66","~$f","^2Z"],["^66","~$f","^2Z","^7:"]]],"^2F",["^2;",[null,null,null]]]],"^59",true,"^1:","~$cljs.core/array-reduce","^2C",false,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^66","~$f"],["^66","~$f","^2Z"],["^66","~$f","^2Z","^7:"]]],"^2:",["^2;",[["^66","~$f"],["^66","~$f","^2Z"],["^66","~$f","^2Z","^7:"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["^66","~$f"],["^66","~$f","^2Z"],["^66","~$f","^2Z","^7:"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",1484,"^29",1484,"^2G",4,"^2H",true,"^2:",["^2;",[["^66","~$f"],["^66","~$f","^2Z"],["^66","~$f","^2Z","^7:"]]]],"~$counted?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1517,"^25",16,"^29",1517,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements count in constant time"],"^1:","~$cljs.core/counted?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1517,"^3=","^3:","^29",1517,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements count in constant time"],"~$tagged-literal",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11244,"^25",7,"^29",11244,"^24",21,"^2:",["^2;",["^2<",["^2;",[["^GM","^?F"]]]]],"^2A","Construct a data representation of a tagged literal from a\n  tag symbol and a form."],"^1:","~$cljs.core/tagged-literal","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^GM","^?F"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11244,"^29",11244,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^GM","^?F"]]]]],"^2A","Construct a data representation of a tagged literal from a\n  tag symbol and a form."],"^C",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10085,"^25",7,"^29",10085,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$&","^6Y"]]]]],"^2A","Same as print followed by (newline)","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/println","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^6Y"]]],"^2:",["^2;",[["~$&","^6Y"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^6Y"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10085,"^29",10085,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^6Y"]]],"^2A","Same as print followed by (newline)"],"~$assoc-in",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5241,"^25",7,"^29",5241,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$m",["~$k","~$&","^8J"],"~$v"]]]]],"^2A","Associates a value in a nested associative structure, where ks is a\n  sequence of keys and v is the new value and returns a new nested structure.\n  If any levels do not exist, hash-maps will be created."],"^1:","~$cljs.core/assoc-in","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$m","~$p__1982","~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5241,"^29",5241,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$m",["~$k","~$&","^8J"],"~$v"]]]]],"^2A","Associates a value in a nested associative structure, where ks is a\n  sequence of keys and v is the new value and returns a new nested structure.\n  If any levels do not exist, hash-maps will be created."],"~$PersistentHashSet",["^ ","^3S",3,"^1O",["^19",["^1P","^1Q","^1R","^1S","^1T","^1U","^1V","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^22"]],"^1:","^7E","^23","cljs/core.cljs","^24",27,"^3W",true,"^25",10,"^28",9042,"^3X",false,"^29",9042,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1R","^1S","^1T","^1V","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^22"]]],"~$bit-test",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2871,"^25",16,"^29",2871,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Test bit at index n"],"^1:","~$cljs.core/bit-test","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2871,"^3=","^3:","^29",2871,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Test bit at index n"],"~$->Namespace",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1U"]],"^23","cljs/core.cljs","^24",19,"^25",10,"^26","^27","^28",11384,"^29",11384,"^2:",["^2;",["^2<",["^2;",[["^3;","^:"]]]]],"^2@",["^19",["^1P","^1Q"]],"^2A","Positional factory function for cljs.core/Namespace."],"^1O",["^19",["^1P","^1Q","^1U"]],"^1:","~$cljs.core/->Namespace","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^3;","^:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",11384,"^29",11384,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^:"]]]]],"^2@",["^19",["^1P","^1Q"]],"^2A","Positional factory function for cljs.core/Namespace."],"~$TransientHashMap",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",7033,"^25",10,"^29",7033,"^24",26,"^5A",true],"^3S",5,"^1O",["^19",["^1R","^:3","^1U","^1X","^?V","^2[","^22"]],"^1:","^35","^23","cljs/core.cljs","^24",26,"^3W",true,"^25",10,"^28",7942,"^3X",false,"^5A",true,"^29",7942,"^31","^3Y","^2@",["^19",["^1R","^:3","^1X","^?V","^2[","^22"]]],"~$->PersistentHashMap",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22"]],"^23","cljs/core.cljs","^24",27,"^25",10,"^26","^27","^28",7767,"^29",7767,"^2:",["^2;",["^2<",["^2;",[["^2=","^67","^3J","~$has-nil?","~$nil-val","^2?"]]]]],"^2@",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22"]],"^2A","Positional factory function for cljs.core/PersistentHashMap."],"^1O",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22"]],"^1:","~$cljs.core/->PersistentHashMap","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^2=","^67","^3J","^NB","^NC","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7767,"^29",7767,"^2G",6,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^67","^3J","^NB","^NC","^2?"]]]]],"^2@",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22"]],"^2A","Positional factory function for cljs.core/PersistentHashMap."],"~$array-extend-kv",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6539,"^25",8,"^29",6539,"^24",23,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k","~$v"]]]]]],"^59",true,"^1:","~$cljs.core/array-extend-kv","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^66","~$k","~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6539,"^29",6539,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k","~$v"]]]]]],"~$ISwap",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",854,"^25",14,"^29",854,"^24",19,"^2A","Protocol for adding swapping functionality.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^DY",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]]]],"^2S",true,"^1:","^DZ","^23","cljs/core.cljs","^24",19,"^25",1,"^28",854,"^2U",["^ ","^2V",["^ ","^DY",[["~$o","~$f"],["~$o","~$f","~$a"],["~$o","~$f","~$a","~$b"],["~$o","~$f","~$a","~$b","^5:"]]]],"^30",null,"^29",854,"^31","^32","^33",["^19",[]],"^2A","Protocol for adding swapping functionality.","^2T",["^2;",["@interface"]]],"~$ChunkedCons",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",2149,"^25",10,"^29",2149,"^24",21,"^5A",true],"^3S",4,"^1O",["^19",["^1P","^1Q","^5D","^1S","^@S","^1U","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21"]],"^1:","^?8","^23","cljs/core.cljs","^24",21,"^3W",true,"^25",10,"^28",3513,"^3X",false,"^5A",true,"^29",3513,"^31","^3Y","^2@",["^19",["^1P","^1Q","^5D","^1S","^@S","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21"]]],"~$memoize",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10597,"^25",7,"^29",10597,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Returns a memoized version of a referentially transparent function. The\n  memoized version of the function keeps a cache of the mapping from arguments\n  to results and, when calls with the same arguments are repeated often, has\n  higher performance at the expense of higher memory use."],"^1:","~$cljs.core/memoize","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10597,"^29",10597,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Returns a memoized version of a referentially transparent function. The\n  memoized version of the function keeps a cache of the mapping from arguments\n  to results and, when calls with the same arguments are repeated often, has\n  higher performance at the expense of higher memory use."],"~$alter-meta!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10310,"^25",7,"^29",10310,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^FY","~$f","~$&","^AD"]]]]],"^2A","Atomically sets the metadata for a namespace/var/ref/agent/atom to be:\n\n  (apply f its-current-meta args)\n\n  f must be free of side-effects","^2K",["^ ","^2C",true,"^2G",2,"^2D",[["^2;",["^FY","~$f","^AD"]]],"^2:",["^2;",[["^FY","~$f","~$&","^AD"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/alter-meta!","^2C",true,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",true,"^2G",2,"^2D",[["^2;",["^FY","~$f","^AD"]]],"^2:",["^2;",[["^FY","~$f","~$&","^AD"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^FY","~$f","^AD"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10310,"^29",10310,"^2G",2,"^2H",true,"^2:",["^2;",[["^FY","~$f","~$&","^AD"]]],"^2A","Atomically sets the metadata for a namespace/var/ref/agent/atom to be:\n\n  (apply f its-current-meta args)\n\n  f must be free of side-effects"],"~$->StringBufferWriter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^9@"]],"^23","cljs/core.cljs","^24",28,"^25",10,"^26","^27","^28",872,"^29",872,"^2:",["^2;",["^2<",["^2;",[["~$sb"]]]]],"^2@",["^19",["^9@"]],"^2A","Positional factory function for cljs.core/StringBufferWriter."],"^1O",["^19",["^9@"]],"^1:","~$cljs.core/->StringBufferWriter","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["^NN"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",872,"^29",872,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^NN"]]]]],"^2@",["^19",["^9@"]],"^2A","Positional factory function for cljs.core/StringBufferWriter."],"~$zero?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2916,"^25",16,"^29",2916,"^24",21,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if num is zero, else false"],"^1:","~$cljs.core/zero?","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2916,"^3=","^3:","^29",2916,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if num is zero, else false"],"~$tv-ensure-editable",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5918,"^25",8,"^29",5918,"^24",26,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^84"]]]]]],"^59",true,"^1:","~$cljs.core/tv-ensure-editable","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["^=J","^84"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5918,"^29",5918,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^84"]]]]]],"~$t_cljs$core1500",["^ ","^3S",1,"^1O",["^19",["^1U","^1Z","^21"]],"^1:","^AS","^23","cljs/core.cljs","^3W",true,"^8W",true,"^25",3,"^28",3961,"^3X",false,"^31","^3Y","^2@",["^19",["^1Z","^21"]]],"~$simple-keyword?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3352,"^25",16,"^29",3352,"^24",31,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a keyword without a namespace"],"^1:","~$cljs.core/simple-keyword?","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3352,"^3=","^3:","^29",3352,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a keyword without a namespace"],"~$-indexOf",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1525,"^25",8,"^29",1525,"^24",16,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$x"],["^2O","~$x","^4P"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$x"],["^2O","~$x","^4P"]]],"^2:",["^2;",[["^2O","~$x"],["^2O","~$x","^4P"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/-indexOf","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$x"],["^2O","~$x","^4P"]]],"^2:",["^2;",[["^2O","~$x"],["^2O","~$x","^4P"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O","~$x"],["^2O","~$x","^4P"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1525,"^29",1525,"^2G",3,"^2H",true,"^2:",["^2;",[["^2O","~$x"],["^2O","~$x","^4P"]]]],"~$*main-cli-fn*",["^ ","^1:","~$cljs.core/*main-cli-fn*","^23","cljs/core.cljs","^28",294,"^25",1,"^29",298,"^24",16,"^2A","When compiled for a command-line target, whatever function\n  *main-cli-fn* is set to will be called with the command-line\n  argv as arguments","^1N",["^ ","^23","cljs/core.cljs","^28",298,"^25",3,"^29",298,"^24",16,"^2A","When compiled for a command-line target, whatever function\n  *main-cli-fn* is set to will be called with the command-line\n  argv as arguments"],"^31","^57"],"^?<",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",668,"^25",9,"^29",668,"^24",17,"^31","^5X","^5Y","^8S","^2A","Returns a new vector with value val added at position n.","^2:",["^2;",["^2<",["^2;",[["^2O","~$n","^2Z"]]]]]],"^5Y","^8S","^1:","~$cljs.core/-assoc-n","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2O","~$n","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",666,"^3=","^5X","^29",668,"^2G",3,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$n","^2Z"]]]]],"^2A","Returns a new vector with value val added at position n."],"~$unchecked-dec-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2715,"^25",7,"^29",2715,"^24",24,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one less than x, an int."],"^1:","~$cljs.core/unchecked-dec-int","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2715,"^29",2715,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one less than x, an int."],"~$hash-imap",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2984,"^25",8,"^29",2984,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$m"]]]]]],"^59",true,"^1:","~$cljs.core/hash-imap","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$m"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2984,"^29",2984,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$m"]]]]]],"~$dominates",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10797,"^25",8,"^29",10797,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y","^BC","^63"]]]]]],"^59",true,"^1:","~$cljs.core/dominates","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$x","~$y","^BC","^63"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10797,"^29",10797,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y","^BC","^63"]]]]]],"~$persistent!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3782,"^25",7,"^29",3782,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^2X"]]]]],"^2A","Returns a new, persistent version of the transient collection, in\n  constant time. The transient collection cannot be used after this\n  call, any such use will throw an exception."],"^1:","~$cljs.core/persistent!","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^2X"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3782,"^29",3782,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2X"]]]]],"^2A","Returns a new, persistent version of the transient collection, in\n  constant time. The transient collection cannot be used after this\n  call, any such use will throw an exception."],"~$set-print-fn!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",86,"^25",7,"^29",86,"^24",20,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Set *print-fn* to f."],"^1:","~$cljs.core/set-print-fn!","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",86,"^29",86,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Set *print-fn* to f."],"~$nnext",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1756,"^25",7,"^29",1756,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (next (next x))"],"^1:","~$cljs.core/nnext","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1756,"^29",1756,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Same as (next (next x))"],"~$Box",["^ ","^3S",1,"^1O",["^19",[]],"^1:","~$cljs.core/Box","^23","cljs/core.cljs","^24",13,"^3W",true,"^25",10,"^28",7044,"^3X",false,"^29",7044,"^31","^3Y","^2@",null],"~$balance-right",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8165,"^25",8,"^29",8165,"^24",21,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^MJ","^KI"]]]]]],"^59",true,"^1:","~$cljs.core/balance-right","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^2Y","^2Z","^MJ","^KI"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8165,"^29",8165,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^MJ","^KI"]]]]]],"~$throw-no-method-error",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10840,"^25",8,"^29",10840,"^24",29,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^:","^7S"]]]]]],"^59",true,"^1:","~$cljs.core/throw-no-method-error","^2C",false,"^23","cljs/core.cljs","^24",29,"^2D",["^2;",[["^:","^7S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10840,"^29",10840,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^:","^7S"]]]]]],"~$demunge-str",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11318,"^25",8,"^29",11318,"^24",19,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$munged-name"]]]]]],"^59",true,"^1:","~$cljs.core/demunge-str","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^OC"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11318,"^29",11318,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^OC"]]]]]],"~$add-watch",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10324,"^25",7,"^29",10324,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^FY","^2Y","~$f"]]]]],"^2A","Adds a watch function to an atom reference. The watch fn must be a\n  fn of 4 args: a key, the reference, its old-state, its\n  new-state. Whenever the reference's state might have been changed,\n  any registered watches will have their functions called. The watch\n  fn will be called synchronously. Note that an atom's state\n  may have changed again prior to the fn call, so use old/new-state\n  rather than derefing the reference. Keys must be unique per\n  reference, and can be used to remove the watch with remove-watch,\n  but are otherwise considered opaque by the watch mechanism.  Bear in\n  mind that regardless of the result or action of the watch fns the\n  atom's value will change.  Example:\n\n      (def a (atom 0))\n      (add-watch a :inc (fn [k r o n] (assert (== 0 n))))\n      (swap! a inc)\n      ;; Assertion Error\n      (deref a)\n      ;=> 1"],"^1:","~$cljs.core/add-watch","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^FY","^2Y","~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10324,"^29",10324,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^FY","^2Y","~$f"]]]]],"^2A","Adds a watch function to an atom reference. The watch fn must be a\n  fn of 4 args: a key, the reference, its old-state, its\n  new-state. Whenever the reference's state might have been changed,\n  any registered watches will have their functions called. The watch\n  fn will be called synchronously. Note that an atom's state\n  may have changed again prior to the fn call, so use old/new-state\n  rather than derefing the reference. Keys must be unique per\n  reference, and can be used to remove the watch with remove-watch,\n  but are otherwise considered opaque by the watch mechanism.  Bear in\n  mind that regardless of the result or action of the watch fns the\n  atom's value will change.  Example:\n\n      (def a (atom 0))\n      (add-watch a :inc (fn [k r o n] (assert (== 0 n))))\n      (swap! a inc)\n      ;; Assertion Error\n      (deref a)\n      ;=> 1"],"~$not-every?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4187,"^25",16,"^29",4187,"^24",26,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns false if (pred x) is logical true for every x in\n  coll, else true."],"^1:","~$cljs.core/not-every?","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4187,"^3=","^3:","^29",4187,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns false if (pred x) is logical true for every x in\n  coll, else true."],"~$rem",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2822,"^25",7,"^29",2822,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","remainder of dividing numerator by denominator."],"^1:","~$cljs.core/rem","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["~$n","~$d"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2822,"^29",2822,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","remainder of dividing numerator by denominator."],"~$ifind?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2117,"^25",16,"^29",2117,"^24",22,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements IFind"],"^1:","~$cljs.core/ifind?","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2117,"^3=","^3:","^29",2117,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll implements IFind"],"~$pr-sb-with-opts",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10017,"^25",8,"^29",10017,"^24",23,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]]],"^59",true,"^1:","~$cljs.core/pr-sb-with-opts","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^6Y","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10017,"^29",10017,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]]],"~$->HashMapIter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",21,"^25",10,"^26","^27","^28",7755,"^29",7755,"^2:",["^2;",["^2<",["^2;",[["^NC","~$root-iter","~$seen"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/HashMapIter."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->HashMapIter","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^NC","^OP","^OQ"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7755,"^29",7755,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^NC","^OP","^OQ"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/HashMapIter."],"~$BitmapIndexedNode",["^ ","^3S",3,"^1O",["^19",["^1U","^20"]],"^1:","^?@","^23","cljs/core.cljs","^24",27,"^3W",true,"^25",10,"^28",7145,"^3X",false,"^29",7145,"^31","^3Y","^2@",["^19",["^20"]]],"~$->NodeSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",17,"^25",10,"^26","^27","^28",7610,"^29",7610,"^2:",["^2;",["^2<",["^2;",[["^2=","~$nodes","~$i","~$s","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/NodeSeq."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->NodeSeq","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2=","^OU","~$i","~$s","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7610,"^29",7610,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^OU","~$i","~$s","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/NodeSeq."],"~$some",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4192,"^25",7,"^29",4192,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns the first logical true value of (pred x) for any x in coll,\n  else nil.  One common idiom is to use a set as pred, for example\n  this will return :fred if :fred is in the sequence, otherwise nil:\n  (some #{:fred} coll)"],"^1:","~$cljs.core/some","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4192,"^29",4192,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns the first logical true value of (pred x) for any x in coll,\n  else nil.  One common idiom is to use a set as pred, for example\n  this will return :fred if :fred is in the sequence, otherwise nil:\n  (some #{:fred} coll)"],"~$INamed",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",839,"^25",14,"^29",839,"^24",20,"^2A","Protocol for adding a name.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^I[",[["~$x"]],"~$-namespace",[["~$x"]]]]],"^2S",true,"^1:","^<D","^23","cljs/core.cljs","^24",20,"^25",1,"^28",839,"^2U",["^ ","^2V",["^ ","^I[",[["~$x"]],"^OZ",[["~$x"]]]],"^30",null,"^29",839,"^31","^32","^33",["^19",["^FG","^>U","^<E"]],"^2A","Protocol for adding a name.","^2T",["^2;",["@interface"]]],"~$->Box",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",[]],"^23","cljs/core.cljs","^24",13,"^25",10,"^26","^27","^28",7044,"^29",7044,"^2:",["^2;",["^2<",["^2;",[["^2Z"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Box."],"^1O",["^19",[]],"^1:","~$cljs.core/->Box","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7044,"^29",7044,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Z"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Box."],"~$IReduce",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",689,"^25",14,"^29",689,"^24",21,"^2A","Protocol for seq types that can reduce themselves.\n  Called by cljs.core/reduce.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^<K",[["^2O","~$f"],["^2O","~$f","^4P"]]]]],"^2S",true,"^1:","^5E","^23","cljs/core.cljs","^24",21,"^25",1,"^28",689,"^2U",["^ ","^2V",["^ ","^<K",[["^2O","~$f"],["^2O","~$f","^4P"]]]],"^30",null,"^29",689,"^31","^32","^33",["^19",["^>R","^>S","^4X","^9[","^5F","^4Y","^4Z","^>V","^8?","^4[","^>Y","^>Z","^>[","^;V","^50","^?0","^?1","^?3","^?4","^?5","^?6","^:G","^>K","^9>","^52"]],"^2A","Protocol for seq types that can reduce themselves.\n  Called by cljs.core/reduce.","^2T",["^2;",["@interface"]]],"~$neg-int?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2272,"^25",16,"^29",2272,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies int? and is negative."],"^1:","~$cljs.core/neg-int?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2272,"^3=","^3:","^29",2272,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies int? and is negative."],"~$drop",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4728,"^25",7,"^29",4728,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$n"],["~$n","^2O"]]]]],"^2A","Returns a lazy sequence of all but the first n items in coll.\n  Returns a stateful transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/drop","^2C",false,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$n"],["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4728,"^29",4728,"^2G",2,"^2H",true,"^2:",["^2;",[["~$n"],["~$n","^2O"]]],"^2A","Returns a lazy sequence of all but the first n items in coll.\n  Returns a stateful transducer when no collection is provided."],"~$NodeIterator",["^ ","^3S",4,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/NodeIterator","^23","cljs/core.cljs","^24",23,"^3W",true,"^25",11,"^28",7107,"^3X",false,"^29",7107,"^31","^3Y","^2@",null],"~$js-obj",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2156,"^25",7,"^29",2156,"^24",13,"^2:",["^2;",["^2<",["^2;",[[],["~$&","^9T"]]]]],"^2A","Create JavaSript object from an even number arguments representing\n  interleaved keys and values.","^2K",["^ ","^2C",true,"^2G",0,"^2D",["^2;",[[]]],"^2:",["^2;",[[],["~$&","^9T"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/js-obj","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",0,"^2D",["^2;",[[]]],"^2:",["^2;",[[],["~$&","^9T"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2156,"^29",2156,"^2G",0,"^2H",true,"^2:",["^2;",[[],["~$&","^9T"]]],"^2A","Create JavaSript object from an even number arguments representing\n  interleaved keys and values."],"~$ITransientCollection",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",786,"^25",14,"^29",786,"^24",34,"^2A","Protocol for adding basic functionality to transient collections.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-conj!",[["^2X","^2Z"]],"^D9",[["^2X"]]]]],"^2S",true,"^1:","^?V","^23","cljs/core.cljs","^24",34,"^25",1,"^28",786,"^2U",["^ ","^2V",["^ ","^P;",[["^2X","^2Z"]],"^D9",[["^2X"]]]],"^30",null,"^29",786,"^31","^32","^33",["^19",["^34","^35","^36","^7D"]],"^2A","Protocol for adding basic functionality to transient collections.","^2T",["^2;",["@interface"]]],"~$Atom",["^ ","^3S",4,"^1O",["^19",["^CU","^JR","^1P","^1Q","^1U","^1Z","^3U"]],"^1:","^?7","^23","cljs/core.cljs","^24",14,"^3W",true,"^25",10,"^28",4375,"^3X",false,"^29",4375,"^31","^3Y","^2@",["^19",["^CU","^JR","^1P","^1Q","^1Z","^3U"]]],"~$nth",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1841,"^25",7,"^29",1841,"^24",10,"^2:",["^2;",["^2<",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]]]],"^2A","Returns the value at the index. get returns nil if index out of\n  bounds, nth throws an exception unless not-found is supplied.  nth\n  also works for strings, arrays, regex Matchers and Lists, and,\n  in O(n) time, for sequences.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/nth","^2C",false,"^23","cljs/core.cljs","^24",10,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1841,"^29",1841,"^2G",3,"^2H",true,"^2:",["^2;",[["^2O","~$n"],["^2O","~$n","^73"]]],"^2A","Returns the value at the index. get returns nil if index out of\n  bounds, nth throws an exception unless not-found is supplied.  nth\n  also works for strings, arrays, regex Matchers and Lists, and,\n  in O(n) time, for sequences."],"~$sorted?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2125,"^25",16,"^29",2125,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll satisfies ISorted"],"^1:","~$cljs.core/sorted?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2125,"^3=","^3:","^29",2125,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll satisfies ISorted"],"~$nil?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",229,"^25",16,"^29",229,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is nil, false otherwise."],"^1:","~$cljs.core/nil?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",229,"^3=","^3:","^29",229,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is nil, false otherwise."],"~$split-at",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4856,"^25",7,"^29",4856,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$n","^2O"]]]]],"^2A","Returns a vector of [(take n coll) (drop n coll)]"],"^1:","~$cljs.core/split-at","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4856,"^29",4856,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","^2O"]]]]],"^2A","Returns a vector of [(take n coll) (drop n coll)]"],"~$TransientHashSet",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",9030,"^25",10,"^29",9030,"^24",26,"^5A",true],"^3S",1,"^1O",["^19",["~$cljs.core/ITransientSet","^1R","^1X","^?V","^22"]],"^1:","^7D","^23","cljs/core.cljs","^24",26,"^3W",true,"^25",10,"^28",9163,"^3X",false,"^5A",true,"^29",9163,"^31","^3Y","^2@",["^19",["^PF","^1R","^1X","^?V","^22"]]],"~$*e",["^ ","^1:","~$cljs.core/*e","^23","cljs/core.cljs","^28",211,"^25",1,"^29",213,"^24",5,"^2A","bound in a repl thread to the most recent exception caught by the repl","^1N",["^ ","^23","cljs/core.cljs","^28",213,"^25",3,"^29",213,"^24",5,"^2A","bound in a repl thread to the most recent exception caught by the repl"]],"~$array-map-extend-kv",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6550,"^25",8,"^29",6550,"^24",27,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$m","~$k","~$v"]]]]]],"^59",true,"^1:","~$cljs.core/array-map-extend-kv","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["~$m","~$k","~$v"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6550,"^29",6550,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$m","~$k","~$v"]]]]]],"~$prn-str-with-opts",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10032,"^25",7,"^29",10032,"^24",24,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]],"^2A","Same as pr-str-with-opts followed by (newline)"],"^1:","~$cljs.core/prn-str-with-opts","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^6Y","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10032,"^29",10032,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6Y","^2J"]]]]],"^2A","Same as pr-str-with-opts followed by (newline)"],"~$not-native",["^ ","^1:","~$cljs.core/not-native","^23","cljs/core.cljs","^28",220,"^25",1,"^29",220,"^24",16,"^1N",["^ ","^23","cljs/core.cljs","^28",220,"^25",6,"^29",220,"^24",16],"^31","^57"],"~$random-sample",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10461,"^25",7,"^29",10461,"^24",20,"^2:",["^2;",["^2<",["^2;",[["~$prob"],["^PP","^2O"]]]]],"^2A","Returns items from coll with random probability of prob (0.0 -\n  1.0).  Returns a transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^PP"],["^PP","^2O"]]],"^2:",["^2;",[["^PP"],["^PP","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/random-sample","^2C",false,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^PP"],["^PP","^2O"]]],"^2:",["^2;",[["^PP"],["^PP","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^PP"],["^PP","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10461,"^29",10461,"^2G",2,"^2H",true,"^2:",["^2;",[["^PP"],["^PP","^2O"]]],"^2A","Returns items from coll with random probability of prob (0.0 -\n  1.0).  Returns a transducer when no collection is provided."],"~$select-keys",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9014,"^25",7,"^29",9014,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^;;","~$keyseq"]]]]],"^2A","Returns a map containing only those entries in map whose key is in keys"],"^1:","~$cljs.core/select-keys","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^;;","^PS"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9014,"^29",9014,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^;;","^PS"]]]]],"^2A","Returns a map containing only those entries in map whose key is in keys"],"~$bit-and",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2834,"^25",7,"^29",2834,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Bitwise and","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/bit-and","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2834,"^29",2834,"^2G",2,"^2H",true,"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Bitwise and"],"~$bounded-count",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3718,"^25",7,"^29",3718,"^24",20,"^2:",["^2;",["^2<",["^2;",[["~$n","^2O"]]]]],"^2A","If coll is counted? returns its count, else will count at most the first n\n   elements of coll using its seq","^76","1.9"],"^76","1.9","^1:","~$cljs.core/bounded-count","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$n","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3718,"^29",3718,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","^2O"]]]]],"^2A","If coll is counted? returns its count, else will count at most the first n\n   elements of coll using its seq"],"~$update",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5277,"^25",7,"^29",5277,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$m","~$k","~$f"],["~$m","~$k","~$f","~$x"],["~$m","~$k","~$f","~$x","~$y"],["~$m","~$k","~$f","~$x","~$y","~$z"],["~$m","~$k","~$f","~$x","~$y","~$z","~$&","^6A"]]]]],"^2A","'Updates' a value in an associative structure, where k is a\n  key and f is a function that will take the old value\n  and any supplied args and return the new value, and returns a new\n  structure.  If the key does not exist, nil is passed as the old value.","^2K",["^ ","^2C",true,"^2G",6,"^2D",["^2;",[["~$m","~$k","~$f"],["~$m","~$k","~$f","~$x"],["~$m","~$k","~$f","~$x","~$y"],["~$m","~$k","~$f","~$x","~$y","~$z"]]],"^2:",["^2;",[["~$m","~$k","~$f"],["~$m","~$k","~$f","~$x"],["~$m","~$k","~$f","~$x","~$y"],["~$m","~$k","~$f","~$x","~$y","~$z"],["~$m","~$k","~$f","~$x","~$y","~$z","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null,null]]]],"^1:","~$cljs.core/update","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",6,"^2D",["^2;",[["~$m","~$k","~$f"],["~$m","~$k","~$f","~$x"],["~$m","~$k","~$f","~$x","~$y"],["~$m","~$k","~$f","~$x","~$y","~$z"]]],"^2:",["^2;",[["~$m","~$k","~$f"],["~$m","~$k","~$f","~$x"],["~$m","~$k","~$f","~$x","~$y"],["~$m","~$k","~$f","~$x","~$y","~$z"],["~$m","~$k","~$f","~$x","~$y","~$z","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null,null]]],"^2D",["^2;",[["~$m","~$k","~$f"],["~$m","~$k","~$f","~$x"],["~$m","~$k","~$f","~$x","~$y"],["~$m","~$k","~$f","~$x","~$y","~$z"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null]],"^25",1,"^28",5277,"^29",5277,"^2G",6,"^2H",true,"^2:",["^2;",[["~$m","~$k","~$f"],["~$m","~$k","~$f","~$x"],["~$m","~$k","~$f","~$x","~$y"],["~$m","~$k","~$f","~$x","~$y","~$z"],["~$m","~$k","~$f","~$x","~$y","~$z","~$&","^6A"]]],"^2A","'Updates' a value in an associative structure, where k is a\n  key and f is a function that will take the old value\n  and any supplied args and return the new value, and returns a new\n  structure.  If the key does not exist, nil is passed as the old value."],"~$gensym_counter",["^ ","^1:","~$cljs.core/gensym_counter","^23","cljs/core.cljs","^28",10355,"^25",1,"^29",10357,"^24",17,"^2T",["@type {*}"],"^1N",["^ ","^23","cljs/core.cljs","^28",10357,"^25",3,"^29",10357,"^24",17,"^2T",["@type {*}"]],"^31","^57"],"~$find-macros-ns",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11474,"^25",7,"^29",11474,"^24",21,"^2:",["^2;",["^2<",["^2;",[["^47"]]]]],"^2A","Returns the macros namespace named by the symbol or nil if it doesn't exist.\n  Bootstrap only."],"^1:","~$cljs.core/find-macros-ns","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^47"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11474,"^29",11474,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^47"]]]]],"^2A","Returns the macros namespace named by the symbol or nil if it doesn't exist.\n  Bootstrap only."],"~$list*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3764,"^25",7,"^29",3764,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^AD"],["~$a","^AD"],["~$a","~$b","^AD"],["~$a","~$b","~$c","^AD"],["~$a","~$b","~$c","~$d","~$&","^6A"]]]]],"^2A","Creates a new list containing the items prepended to the rest, the\n  last of which will be treated as a sequence.","^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["^AD"],["~$a","^AD"],["~$a","~$b","^AD"],["~$a","~$b","~$c","^AD"]]],"^2:",["^2;",[["^AD"],["~$a","^AD"],["~$a","~$b","^AD"],["~$a","~$b","~$c","^AD"],["~$a","~$b","~$c","~$d","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null,null]]]],"^1:","~$cljs.core/list*","^2C",true,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["^AD"],["~$a","^AD"],["~$a","~$b","^AD"],["~$a","~$b","~$c","^AD"]]],"^2:",["^2;",[["^AD"],["~$a","^AD"],["~$a","~$b","^AD"],["~$a","~$b","~$c","^AD"],["~$a","~$b","~$c","~$d","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null,null]]],"^2D",["^2;",[["^AD"],["~$a","^AD"],["~$a","~$b","^AD"],["~$a","~$b","~$c","^AD"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null]],"^25",1,"^28",3764,"^29",3764,"^2G",4,"^2H",true,"^2:",["^2;",[["^AD"],["~$a","^AD"],["~$a","~$b","^AD"],["~$a","~$b","~$c","^AD"],["~$a","~$b","~$c","~$d","~$&","^6A"]]],"^2A","Creates a new list containing the items prepended to the rest, the\n  last of which will be treated as a sequence."],"~$array-index-of-keyword?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6486,"^25",8,"^29",6486,"^24",31,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"^59",true,"^1:","~$cljs.core/array-index-of-keyword?","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["^66","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6486,"^29",6486,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$k"]]]]]],"~$->Keyword",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1R","^1U","^<D","^5N"]],"^23","cljs/core.cljs","^24",17,"^25",10,"^26","^27","^28",3274,"^29",3274,"^2:",["^2;",["^2<",["^2;",[["^47","^:","~$fqn","^HT"]]]]],"^2@",["^19",["^1P","^1Q","^1R","^<D","^5N"]],"^2A","Positional factory function for cljs.core/Keyword."],"^1O",["^19",["^1P","^1Q","^1R","^1U","^<D","^5N"]],"^1:","~$cljs.core/->Keyword","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^47","^:","^Q8","^HT"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3274,"^29",3274,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^47","^:","^Q8","^HT"]]]]],"^2@",["^19",["^1P","^1Q","^1R","^<D","^5N"]],"^2A","Positional factory function for cljs.core/Keyword."],"~$update-in",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5250,"^25",7,"^29",5250,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$m",["~$k","~$&","^8J"],"~$f"],["~$m",["~$k","~$&","^8J"],"~$f","~$a"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c","~$&","^AD"]]]]],"^2A","'Updates' a value in a nested associative structure, where ks is a\n  sequence of keys and f is a function that will take the old value\n  and any supplied args and return the new value, and returns a new\n  nested structure.  If any levels do not exist, hash-maps will be\n  created.","^2K",["^ ","^2C",true,"^2G",6,"^2D",["^2;",[["~$m",["~$k","~$&","^8J"],"~$f"],["~$m",["~$k","~$&","^8J"],"~$f","~$a"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c"]]],"^2:",["^2;",[["~$m",["~$k","~$&","^8J"],"~$f"],["~$m",["~$k","~$&","^8J"],"~$f","~$a"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c","~$&","^AD"]]],"^2F",["^2;",[null,null,null,null,null]]]],"^1:","~$cljs.core/update-in","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",6,"^2D",["^2;",[["~$m",["~$k","~$&","^8J"],"~$f"],["~$m",["~$k","~$&","^8J"],"~$f","~$a"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c"]]],"^2:",["^2;",[["~$m",["~$k","~$&","^8J"],"~$f"],["~$m",["~$k","~$&","^8J"],"~$f","~$a"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c","~$&","^AD"]]],"^2F",["^2;",[null,null,null,null,null]]],"^2D",["^2;",[["~$m",["~$k","~$&","^8J"],"~$f"],["~$m",["~$k","~$&","^8J"],"~$f","~$a"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null]],"^25",1,"^28",5250,"^29",5250,"^2G",6,"^2H",true,"^2:",["^2;",[["~$m",["~$k","~$&","^8J"],"~$f"],["~$m",["~$k","~$&","^8J"],"~$f","~$a"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c"],["~$m",["~$k","~$&","^8J"],"~$f","~$a","~$b","~$c","~$&","^AD"]]],"^2A","'Updates' a value in a nested associative structure, where ks is a\n  sequence of keys and f is a function that will take the old value\n  and any supplied args and return the new value, and returns a new\n  nested structure.  If any levels do not exist, hash-maps will be\n  created."],"~$prefer-method",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11038,"^25",7,"^29",11038,"^24",20,"^2:",["^2;",["^2<",["^2;",[["^87","~$dispatch-val-x","^7T"]]]]],"^2A","Causes the multimethod to prefer matches of dispatch-val-x over dispatch-val-y\n   when there is a conflict"],"^1:","~$cljs.core/prefer-method","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^87","^Q=","^7T"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11038,"^29",11038,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87","^Q=","^7T"]]]]],"^2A","Causes the multimethod to prefer matches of dispatch-val-x over dispatch-val-y\n   when there is a conflict"],"~$hash-symbol",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1041,"^25",8,"^29",1041,"^24",19,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^GU"]]]]]],"^59",true,"^1:","~$cljs.core/hash-symbol","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^GU"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1041,"^29",1041,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^GU"]]]]]],"~$ensure-reduced",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1431,"^25",7,"^29",1431,"^24",21,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","If x is already reduced?, returns it, else returns (reduced x)"],"^1:","~$cljs.core/ensure-reduced","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1431,"^29",1431,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","If x is already reduced?, returns it, else returns (reduced x)"],"~$edit-and-set",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7078,"^25",8,"^29",7078,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$inode","^=J","~$i","~$a"],["^QD","^=J","~$i","~$a","~$j","~$b"]]]]],"^2K",["^ ","^2C",false,"^2G",6,"^2D",["^2;",[["^QD","^=J","~$i","~$a"],["^QD","^=J","~$i","~$a","~$j","~$b"]]],"^2:",["^2;",[["^QD","^=J","~$i","~$a"],["^QD","^=J","~$i","~$a","~$j","~$b"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/edit-and-set","^2C",false,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",false,"^2G",6,"^2D",["^2;",[["^QD","^=J","~$i","~$a"],["^QD","^=J","~$i","~$a","~$j","~$b"]]],"^2:",["^2;",[["^QD","^=J","~$i","~$a"],["^QD","^=J","~$i","~$a","~$j","~$b"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^QD","^=J","~$i","~$a"],["^QD","^=J","~$i","~$a","~$j","~$b"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7078,"^29",7078,"^2G",6,"^2H",true,"^2:",["^2;",[["^QD","^=J","~$i","~$a"],["^QD","^=J","~$i","~$a","~$j","~$b"]]]],"~$->PersistentArrayMap",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22","^5E"]],"^23","cljs/core.cljs","^24",28,"^25",10,"^26","^27","^28",6733,"^29",6733,"^2:",["^2;",["^2<",["^2;",[["^2=","^67","^66","^2?"]]]]],"^2@",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22","^5E"]],"^2A","Positional factory function for cljs.core/PersistentArrayMap."],"^1O",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22","^5E"]],"^1:","~$cljs.core/->PersistentArrayMap","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["^2=","^67","^66","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6733,"^29",6733,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^67","^66","^2?"]]]]],"^2@",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22","^5E"]],"^2A","Positional factory function for cljs.core/PersistentArrayMap."],"~$instance?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1030,"^25",16,"^29",1030,"^24",25,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$c","~$x"]]]]],"^2A","Evaluates x and tests if it is an instance of the type\n  c. Returns true or false"],"^1:","~$cljs.core/instance?","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["~$c","~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1030,"^3=","^3:","^29",1030,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$c","~$x"]]]]],"^2A","Evaluates x and tests if it is an instance of the type\n  c. Returns true or false"],"~$mix-collection-hash",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1313,"^25",15,"^29",1313,"^24",34,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$hash-basis","^AG"]]]]],"^2A","Mix final collection hash for ordered or unordered collections.\n   hash-basis is the combined collection hash, count is the number\n   of elements included in the basis. Note this is the hash code\n   consistent with =, different from .hashCode.\n   See http://clojure.org/data_structures#hash for full algorithms."],"^1:","~$cljs.core/mix-collection-hash","^2C",false,"^23","cljs/core.cljs","^24",34,"^2D",["^2;",[["^QK","^AG"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1313,"^3=","^<","^29",1313,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^QK","^AG"]]]]],"^2A","Mix final collection hash for ordered or unordered collections.\n   hash-basis is the combined collection hash, count is the number\n   of elements included in the basis. Note this is the hash code\n   consistent with =, different from .hashCode.\n   See http://clojure.org/data_structures#hash for full algorithms."],"~$re-find",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9817,"^25",7,"^29",9817,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^<>","~$s"]]]]],"^2A","Returns the first regex match, if any, of s to re, using\n  re.exec(s). Returns a vector, containing first the matching\n  substring, then any capturing groups if the regular expression contains\n  capturing groups."],"^1:","~$cljs.core/re-find","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^<>","~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9817,"^29",9817,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^<>","~$s"]]]]],"^2A","Returns the first regex match, if any, of s to re, using\n  re.exec(s). Returns a vector, containing first the matching\n  substring, then any capturing groups if the regular expression contains\n  capturing groups."],"~$run!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10508,"^25",7,"^29",10508,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$proc","^2O"]]]]],"^2A","Runs the supplied procedure (via reduce), for purposes of side\n  effects, on successive items in the collection. Returns nil"],"^1:","~$cljs.core/run!","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^QP","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10508,"^29",10508,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^QP","^2O"]]]]],"^2A","Runs the supplied procedure (via reduce), for purposes of side\n  effects, on successive items in the collection. Returns nil"],"~$char-escapes",["^ ","^1:","~$cljs.core/char-escapes","^23","cljs/core.cljs","^28",9888,"^25",1,"^29",9888,"^24",28,"^59",true,"^1N",["^ ","^23","cljs/core.cljs","^28",9888,"^25",16,"^29",9888,"^24",28,"^59",true],"^31","^45"],"~$ES6Iterator",["^ ","^3S",1,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/ES6Iterator","^23","cljs/core.cljs","^24",21,"^3W",true,"^25",10,"^28",1277,"^3X",false,"^29",1277,"^31","^3Y","^2@",null],"^2Z",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8985,"^25",7,"^29",8985,"^24",10,"^2:",["^2;",["^2<",["^2;",[["^H6"]]]]],"^2A","Returns the value in the map entry."],"^1:","~$cljs.core/val","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^H6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8985,"^29",8985,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^H6"]]]]],"^2A","Returns the value in the map entry."],"~$unchecked-add",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2696,"^25",15,"^29",2696,"^24",28,"^31","^<","^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the sum of nums. (+) returns 0.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/unchecked-add","^2C",true,"^23","cljs/core.cljs","^24",28,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",2696,"^3=","^<","^29",2696,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns the sum of nums. (+) returns 0."],"~$transformer-iterator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4136,"^25",7,"^29",4136,"^24",27,"^2:",["^2;",["^2<",["^2;",[["^5O","^;6","^;7"]]]]]],"^1:","~$cljs.core/transformer-iterator","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^5O","^;6","^;7"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4136,"^29",4136,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^5O","^;6","^;7"]]]]]],"~$not",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",246,"^25",16,"^29",246,"^24",19,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is logical false, false otherwise."],"^1:","~$cljs.core/not","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",246,"^3=","^3:","^29",246,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is logical false, false otherwise."],"~$->t_cljs$core9266",["^ ","^1M",null,"^1N",["^ ","^8W",true,"^1O",["^19",["^1U","^1Z","^21"]],"^2@",["^19",["^1Z","^21"]],"^26","^27","^2:",["^2;",["^2<",["^2;",[["~$meta9267"]]]]],"^2A","Positional factory function for cljs.core/t_cljs$core9266.","^23","cljs/core.cljs"],"^1O",["^19",["^1U","^1Z","^21"]],"^1:","~$cljs.core/->t_cljs$core9266","^2C",false,"^23","cljs/core.cljs","^2D",["^2;",[["^R2"]]],"^2E",null,"^2F",["^2;",[null,null]],"^8W",true,"^25",3,"^26","^27","^28",3961,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^R2"]]]]],"^2@",["^19",["^1Z","^21"]],"^2A","Positional factory function for cljs.core/t_cljs$core9266."],"^CY",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",861,"^25",4,"^29",861,"^24",12,"^5Y","^3T","^2A","Sets the value of volatile o to new-value without regard for the\n     current value. Returns new-value.","^2:",["^2;",["^2<",["^2;",[["~$o","^CP"]]]]]],"^5Y","^3T","^1:","~$cljs.core/-vreset!","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["~$o","^CP"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",859,"^29",861,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o","^CP"]]]]],"^2A","Sets the value of volatile o to new-value without regard for the\n     current value. Returns new-value."],"~$fn->comparator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2398,"^25",17,"^29",2398,"^24",31,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Given a fn that might be boolean valued or a comparator,\n   return a fn that is a comparator."],"^59",true,"^1:","~$cljs.core/fn->comparator","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2398,"^29",2398,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Given a fn that might be boolean valued or a comparator,\n   return a fn that is a comparator."],"~$with-meta",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2048,"^25",7,"^29",2048,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$o","^2="]]]]],"^2A","Returns an object of the same type and value as obj, with\n  map m as its metadata."],"^1:","~$cljs.core/with-meta","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$o","^2="]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2048,"^29",2048,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o","^2="]]]]],"^2A","Returns an object of the same type and value as obj, with\n  map m as its metadata."],"~$unreduced",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1436,"^25",7,"^29",1436,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","If x is reduced?, returns (deref x), else returns x"],"^1:","~$cljs.core/unreduced","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1436,"^29",1436,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","If x is reduced?, returns (deref x), else returns x"],"~$record?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2140,"^25",16,"^29",2140,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies IRecord"],"^1:","~$cljs.core/record?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2140,"^3=","^3:","^29",2140,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies IRecord"],"^15",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",305,"^25",7,"^29",305,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return x's constructor."],"^1:","~$cljs.core/type","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",305,"^29",305,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return x's constructor."],"~$identical?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",224,"^25",16,"^29",224,"^24",26,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Tests if 2 arguments are the same object"],"^1:","~$cljs.core/identical?","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",224,"^3=","^3:","^29",224,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Tests if 2 arguments are the same object"],"^OZ",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",843,"^25",12,"^29",843,"^24",22,"^31","^90","^5Y","^<D","^2A","Returns the namespace String of x.","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^5Y","^<D","^1:","~$cljs.core/-namespace","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",839,"^3=","^90","^29",843,"^2G",1,"^31","^90","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns the namespace String of x."],"~$unchecked-divide-int",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2720,"^25",15,"^29",2720,"^24",35,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","If no denominators are supplied, returns 1/numerator,\n  else returns numerator divided by all of the denominators.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/unchecked-divide-int","^2C",true,"^23","cljs/core.cljs","^24",35,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2720,"^3=","^<","^29",2720,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","If no denominators are supplied, returns 1/numerator,\n  else returns numerator divided by all of the denominators."],"~$ns-name",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11493,"^25",7,"^29",11493,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^?Q"]]]]],"^2A","Returns the name of the namespace, a Namespace object.\n  Bootstrap only."],"^1:","~$cljs.core/ns-name","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^?Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11493,"^29",11493,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^?Q"]]]]],"^2A","Returns the name of the namespace, a Namespace object.\n  Bootstrap only."],"~$swap-global-hierarchy!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10671,"^25",8,"^29",10671,"^24",30,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$f","~$&","^AD"]]]]],"^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["~$f","^AD"]]],"^2:",["^2;",[["~$f","~$&","^AD"]]],"^2F",["^2;",[null]]]],"^59",true,"^1:","~$cljs.core/swap-global-hierarchy!","^2C",true,"^23","cljs/core.cljs","^24",30,"^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["~$f","^AD"]]],"^2:",["^2;",[["~$f","~$&","^AD"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["~$f","^AD"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",10671,"^29",10671,"^2G",1,"^2H",true,"^2:",["^2;",[["~$f","~$&","^AD"]]]],"~$max-key",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9411,"^25",7,"^29",9411,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the x for which (k x), a number, is greatest.\n  \n  If there are multiple such xs, the last one is returned.","^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"]]],"^2:",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/max-key","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"]]],"^2:",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",9411,"^29",9411,"^2G",3,"^2H",true,"^2:",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]],"^2A","Returns the x for which (k x), a number, is greatest.\n  \n  If there are multiple such xs, the last one is returned."],"~$->PersistentTreeSet",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5C","^1P","^1Q","^1R","^1S","^1U","^1V","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^22"]],"^23","cljs/core.cljs","^24",27,"^25",10,"^26","^27","^28",9200,"^29",9200,"^2:",["^2;",["^2<",["^2;",[["^2=","~$tree-map","^2?"]]]]],"^2@",["^19",["^5C","^1P","^1Q","^1R","^1S","^1V","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^22"]],"^2A","Positional factory function for cljs.core/PersistentTreeSet."],"^1O",["^19",["^5C","^1P","^1Q","^1R","^1S","^1U","^1V","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^22"]],"^1:","~$cljs.core/->PersistentTreeSet","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^2=","^RJ","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",9200,"^29",9200,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^RJ","^2?"]]]]],"^2@",["^19",["^5C","^1P","^1Q","^1R","^1S","^1V","^1W","^1X","^6U","^1Y","^1Z","^1[","^21","^22"]],"^2A","Positional factory function for cljs.core/PersistentTreeSet."],"~$*out*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",59,"^25",3,"^29",59,"^24",8,"^6F",true,"^2T",["@type {*}"]],"^1:","~$cljs.core/*out*","^23","cljs/core.cljs","^24",8,"^25",1,"^6F",true,"^28",56,"^29",59,"^31","^57","^2T",["@type {*}"]],"~$->ChunkBuffer",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U","^1X"]],"^23","cljs/core.cljs","^24",21,"^25",10,"^26","^27","^28",3464,"^29",3464,"^2:",["^2;",["^2<",["^2;",[["~$buf","^4Q"]]]]],"^2@",["^19",["^1X"]],"^2A","Positional factory function for cljs.core/ChunkBuffer."],"^1O",["^19",["^1U","^1X"]],"^1:","~$cljs.core/->ChunkBuffer","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^RO","^4Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3464,"^29",3464,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^RO","^4Q"]]]]],"^2@",["^19",["^1X"]],"^2A","Positional factory function for cljs.core/ChunkBuffer."],"~$hash-string",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",976,"^25",7,"^29",976,"^24",18,"^2:",["^2;",["^2<",["^2;",[["~$k"]]]]]],"^1:","~$cljs.core/hash-string","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",976,"^29",976,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$k"]]]]]],"~$ValSeq",["^ ","^3S",2,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","^>Z","^23","cljs/core.cljs","^24",16,"^3W",true,"^25",10,"^28",8914,"^3X",false,"^29",8914,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"~$-prefers",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10836,"^25",4,"^29",10836,"^24",12,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-prefers","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^7R"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10836,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]],"^2A",null],"~$set-validator!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4500,"^25",7,"^29",4500,"^24",21,"^2:",["^2;",["^2<",["^2;",[["^FY","^2Z"]]]]],"^2A","Sets the validator-fn for an atom. validator-fn must be nil or a\n  side-effect-free fn of one argument, which will be passed the intended\n  new state on any state change. If the new state is unacceptable, the\n  validator-fn should return false or throw an Error. If the current state\n  is not acceptable to the new validator, an Error will be thrown and the\n  validator will not be changed."],"^1:","~$cljs.core/set-validator!","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^FY","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4500,"^29",4500,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^FY","^2Z"]]]]],"^2A","Sets the validator-fn for an atom. validator-fn must be nil or a\n  side-effect-free fn of one argument, which will be passed the intended\n  new state on any state change. If the new state is unacceptable, the\n  validator-fn should return false or throw an Error. If the current state\n  is not acceptable to the new validator, an Error will be thrown and the\n  validator will not be changed."],"~$ident?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3332,"^25",16,"^29",3332,"^24",22,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a symbol or keyword"],"^1:","~$cljs.core/ident?","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3332,"^3=","^3:","^29",3332,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a symbol or keyword"],"^AQ",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",681,"^25",16,"^29",681,"^24",21,"^31","~$clj-or-nil","^5Y","^1Z","^2A","Returns the metadata of object o.","^2:",["^2;",["^2<",["^2;",[["~$o"]]]]]],"^5Y","^1Z","^1:","~$cljs.core/-meta","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$o"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",679,"^3=","^RZ","^29",681,"^2G",1,"^31","^RZ","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o"]]]]],"^2A","Returns the metadata of object o."],"~$RedNode",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",8138,"^25",10,"^29",8138,"^24",17,"^5A",true],"^3S",5,"^1O",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^1:","^52","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",8363,"^3X",false,"^5A",true,"^29",8363,"^31","^3Y","^2@",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]]],"~$-dispatch-fn",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10838,"^25",4,"^29",10838,"^24",16,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-dispatch-fn","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^7R"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10838,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]],"^2A",null],"~$->IndexedSeqIterator",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",28,"^25",10,"^26","^27","^28",1559,"^29",1559,"^2:",["^2;",["^2<",["^2;",[["^66","~$i"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/IndexedSeqIterator."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->IndexedSeqIterator","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["^66","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",1559,"^29",1559,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/IndexedSeqIterator."],"~$-add-method",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10831,"^25",4,"^29",10831,"^24",15,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R","^7S","~$method"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-add-method","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^7R","^7S","^S6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10831,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R","^7S","^S6"]]]]],"^2A",null],"~$balance-left-del",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8187,"^25",8,"^29",8187,"^24",24,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","~$del","^KJ"]]]]]],"^59",true,"^1:","~$cljs.core/balance-left-del","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^2Y","^2Z","^S9","^KJ"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8187,"^29",8187,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^S9","^KJ"]]]]]],"~$swap!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4454,"^25",7,"^29",4454,"^24",12,"^2:",["^2;",["^2<",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]]]],"^2A","Atomically swaps the value of atom to be:\n  (apply f current-value-of-atom args). Note that f may be called\n  multiple times, and thus should be free of side effects.  Returns\n  the value that was swapped in.","^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"]]],"^2:",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/swap!","^2C",true,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"]]],"^2:",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",4454,"^29",4454,"^2G",4,"^2H",true,"^2:",["^2;",[["~$a","~$f"],["~$a","~$f","~$x"],["~$a","~$f","~$x","~$y"],["~$a","~$f","~$x","~$y","~$&","^6A"]]],"^2A","Atomically swaps the value of atom to be:\n  (apply f current-value-of-atom args). Note that f may be called\n  multiple times, and thus should be free of side effects.  Returns\n  the value that was swapped in."],"^AZ",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8979,"^25",7,"^29",8979,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2>"]]]]],"^2A","Returns a sequence of the map's values."],"^1:","~$cljs.core/vals","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^2>"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8979,"^29",8979,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2>"]]]]],"^2A","Returns a sequence of the map's values."],"~$Repeat",["^ ","^3S",5,"^1O",["^19",["^1P","^1Q","^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","^?1","^23","cljs/core.cljs","^24",16,"^3W",true,"^25",10,"^28",4861,"^3X",false,"^29",4861,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]]],"~$-chunked-next",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",836,"^25",4,"^29",836,"^24",17,"^5Y","^@S","^2A","Returns a new collection of coll without the first chunk.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^@S","^1:","~$cljs.core/-chunked-next","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",834,"^29",836,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a new collection of coll without the first chunk."],"~$Single",["^ ","^3S",1,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/Single","^23","cljs/core.cljs","^24",16,"^3W",true,"^25",10,"^28",4038,"^3X",false,"^29",4038,"^31","^3Y","^2@",null],"~$unchecked-subtract",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2758,"^25",15,"^29",2758,"^24",33,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/unchecked-subtract","^2C",true,"^23","cljs/core.cljs","^24",33,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2758,"^3=","^<","^29",2758,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result."],"~$tap>",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11364,"^25",16,"^29",11364,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Sends x to any taps. Returns the result of *exec-tap-fn*, a Boolean value."],"^1:","~$cljs.core/tap>","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11364,"^3=","^3:","^29",11364,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Sends x to any taps. Returns the result of *exec-tap-fn*, a Boolean value."],"~$remove-pair",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7066,"^25",8,"^29",7066,"^24",19,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i"]]]]]],"^59",true,"^1:","~$cljs.core/remove-pair","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^66","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7066,"^29",7066,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i"]]]]]],"~$IMap",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",638,"^25",14,"^29",638,"^24",18,"^2A","Protocol for adding mapping functionality to collections.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-dissoc",[["^2O","~$k"]]]]],"^2S",true,"^1:","^A6","^23","cljs/core.cljs","^24",18,"^25",1,"^28",638,"^2U",["^ ","^2V",["^ ","^SJ",[["^2O","~$k"]]]],"^30",null,"^29",638,"^31","^32","^33",["^19",["^4V","^4W","^4X","^51"]],"^2A","Protocol for adding mapping functionality to collections.","^2T",["^2;",["@interface"]]],"~$->SeqIter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",17,"^25",10,"^26","^27","^28",3994,"^29",3994,"^2:",["^2;",["^2<",["^2;",[["~$_seq","^;3"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/SeqIter."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->SeqIter","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^SL","^;3"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3994,"^29",3994,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^SL","^;3"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/SeqIter."],"~$sorted-set-by",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9332,"^25",7,"^29",9332,"^24",20,"^2:",["^2;",["^2<",["^2;",[["~$comparator","~$&","^CM"]]]]],"^2A","Returns a new sorted set with supplied keys, using the supplied comparator.","^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["^SO","^CM"]]],"^2:",["^2;",[["^SO","~$&","^CM"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/sorted-set-by","^2C",true,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",true,"^2G",1,"^2D",[["^2;",["^SO","^CM"]]],"^2:",["^2;",[["^SO","~$&","^CM"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^SO","^CM"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",9332,"^29",9332,"^2G",1,"^2H",true,"^2:",["^2;",[["^SO","~$&","^CM"]]],"^2A","Returns a new sorted set with supplied keys, using the supplied comparator."],"~$PersistentVector",["^ ","^3S",6,"^1O",["^19",["^;:","^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]],"^1:","^50","^23","cljs/core.cljs","^24",26,"^3W",true,"^25",10,"^28",5433,"^3X",false,"^29",5433,"^31","^3Y","^2@",["^19",["^5B","^8S","^5C","^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^1[","^8T","^20","^4K","^21","^7W","^22","^5E"]]],"~$cloneable?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1197,"^25",16,"^29",1197,"^24",26,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["^4@"]]]]],"^2A","Return true if x implements ICloneable protocol."],"^1:","~$cljs.core/cloneable?","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["^4@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1197,"^3=","^3:","^29",1197,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4@"]]]]],"^2A","Return true if x implements ICloneable protocol."],"~$qualified-ident?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3340,"^25",16,"^29",3340,"^24",32,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a symbol or keyword with a namespace"],"^1:","~$cljs.core/qualified-ident?","^2C",false,"^23","cljs/core.cljs","^24",32,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3340,"^3=","^3:","^29",3340,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is a symbol or keyword with a namespace"],"~$hash-string*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",959,"^25",7,"^29",959,"^24",19,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"^1:","~$cljs.core/hash-string*","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",959,"^29",959,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"~$key-test",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7048,"^25",16,"^29",7048,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["^2Y","^G5"]]]]]],"^1:","~$cljs.core/key-test","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["^2Y","^G5"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7048,"^3=","^3:","^29",7048,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^G5"]]]]]],"~$-reset",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10830,"^25",4,"^29",10830,"^24",10,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-reset","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["^7R"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10830,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R"]]]]],"^2A",null],"~$true?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2199,"^25",16,"^29",2199,"^24",21,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is the value true, false otherwise."],"^1:","~$cljs.core/true?","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2199,"^3=","^3:","^29",2199,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is the value true, false otherwise."],"~$find-ns-obj*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11408,"^25",8,"^29",11408,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$ctxt","^5:"]]]]],"^2A","Bootstrap only."],"^59",true,"^1:","~$cljs.core/find-ns-obj*","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^T3","^5:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11408,"^29",11408,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^T3","^5:"]]]]],"^2A","Bootstrap only."],"^79",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",435,"^25",14,"^29",435,"^24",19,"^31","^79","^2:",["^2;",["^2<",["^2;",[["~$var-args"]]]]],"^2A","Creates a new javascript array.\n@param {...*} var_args"],"^1:","~$cljs.core/array","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^T5"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",435,"^3=","^79","^29",435,"^2G",1,"^31","^79","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^T5"]]]]],"^2A","Creates a new javascript array.\n@param {...*} var_args"],"~$print",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10076,"^25",3,"^29",10076,"^24",8,"^2A","Prints the object(s) using string-print.\n  print and println produce output for human consumption."],"^1:","~$cljs.core/print","^2C",true,"^23","cljs/core.cljs","^24",8,"^2D",["^2;",[["^6Y"]]],"^2E",null,"^2F",["^2;",[]],"^25",1,"^28",10073,"^29",10076,"^2G",0,"^2H",true,"^2:",null,"^2A","Prints the object(s) using string-print.\n  print and println produce output for human consumption."],"^CS",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",660,"^25",4,"^29",660,"^24",9,"^5Y","^8T","^2A","Returns the item from the top of the stack. Is used by cljs.core/peek.","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^8T","^1:","~$cljs.core/-peek","^2C",false,"^23","cljs/core.cljs","^24",9,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",656,"^29",660,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns the item from the top of the stack. Is used by cljs.core/peek."],"~$ISeq",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",601,"^25",14,"^29",601,"^24",18,"^2A","Protocol for collections to provide access to their items as sequences.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^91",[["^2O"]],"~$-rest",[["^2O"]]]]],"^2S",true,"^1:","^4?","^23","cljs/core.cljs","^24",18,"^25",1,"^28",601,"^2U",["^ ","^2V",["^ ","^91",[["^2O"]],"^T;",[["^2O"]]]],"^30",null,"^29",601,"^31","^32","^33",["^19",["^>R","^9[","^>T","^5F","^>V","^8?","^>W","^>Y","^>Z","^>[","^<:","^;V","^?0","^?1","^?3","^?4","^?5","^?6","^?8","^>K","^9>"]],"^2A","Protocol for collections to provide access to their items as sequences.","^2T",["^2;",["@interface"]]],"~$empty",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1788,"^25",7,"^29",1788,"^24",12,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns an empty collection of the same category as coll, or nil"],"^1:","~$cljs.core/empty","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1788,"^29",1788,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns an empty collection of the same category as coll, or nil"],"~$remove-method",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11033,"^25",7,"^29",11033,"^24",20,"^2:",["^2;",["^2<",["^2;",[["^87","^7S"]]]]],"^2A","Removes the method of multimethod associated with dispatch-value."],"^1:","~$cljs.core/remove-method","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^87","^7S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11033,"^29",11033,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87","^7S"]]]]],"^2A","Removes the method of multimethod associated with dispatch-value."],"~$PersistentQueueSeq",["^ ","^3S",4,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21"]],"^1:","^>W","^23","cljs/core.cljs","^24",28,"^3W",true,"^25",10,"^28",6121,"^3X",false,"^29",6121,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21"]]],"~$balance-right-del",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8206,"^25",8,"^29",8206,"^24",25,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^MJ","^S9"]]]]]],"^59",true,"^1:","~$cljs.core/balance-right-del","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^2Y","^2Z","^MJ","^S9"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8206,"^29",8206,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^MJ","^S9"]]]]]],"~$volatile!",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4526,"^25",7,"^29",4526,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^2Z"]]]]],"^2A","Creates and returns a Volatile with an initial value of val."],"^1:","~$cljs.core/volatile!","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4526,"^29",4526,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Z"]]]]],"^2A","Creates and returns a Volatile with an initial value of val."],"~$/",["^ ","^1M",null,"^1N",["^ ","^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","If no denominators are supplied, returns 1/numerator,\n  else returns numerator divided by all of the denominators.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^23","cljs/core.cljs"],"^1:","~$cljs.core//","^2C",true,"^23","cljs/core.cljs","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2603,"^3=","^<","^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","If no denominators are supplied, returns 1/numerator,\n  else returns numerator divided by all of the denominators."],"~$bitpos",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7075,"^25",8,"^29",7075,"^24",14,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^B;","^=D"]]]]]],"^59",true,"^1:","~$cljs.core/bitpos","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^B;","^=D"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7075,"^29",7075,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^B;","^=D"]]]]]],"~$Many",["^ ","^3S",1,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/Many","^23","cljs/core.cljs","^24",14,"^3W",true,"^25",10,"^28",4024,"^3X",false,"^29",4024,"^31","^3Y","^2@",null],"~$bit-or",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2840,"^25",7,"^29",2840,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Bitwise or","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/bit-or","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x","~$y"]]],"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2840,"^29",2840,"^2G",2,"^2H",true,"^2:",["^2;",[["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Bitwise or"],"~$m3-fmix",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",920,"^25",15,"^29",920,"^24",22,"^31","^<","^2:",["^2;",["^2<",["^2;",[["^@A","^5<"]]]]]],"^1:","~$cljs.core/m3-fmix","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^@A","^5<"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",920,"^3=","^<","^29",920,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^@A","^5<"]]]]]],"~$vector",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5658,"^25",7,"^29",5658,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$&","^AD"]]]]],"^2A","Creates a new vector containing the args.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^AD"]]],"^2:",["^2;",[["~$&","^AD"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/vector","^2C",true,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^AD"]]],"^2:",["^2;",[["~$&","^AD"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^AD"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",5658,"^29",5658,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^AD"]]],"^2A","Creates a new vector containing the args."],"~$hash-coll",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2974,"^25",8,"^29",2974,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^59",true,"^1:","~$cljs.core/hash-coll","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2974,"^29",2974,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"~$clone-and-set",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7057,"^25",8,"^29",7057,"^24",21,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i","~$a"],["^66","~$i","~$a","~$j","~$b"]]]]],"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^66","~$i","~$a"],["^66","~$i","~$a","~$j","~$b"]]],"^2:",["^2;",[["^66","~$i","~$a"],["^66","~$i","~$a","~$j","~$b"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/clone-and-set","^2C",false,"^23","cljs/core.cljs","^24",21,"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^66","~$i","~$a"],["^66","~$i","~$a","~$j","~$b"]]],"^2:",["^2;",[["^66","~$i","~$a"],["^66","~$i","~$a","~$j","~$b"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^66","~$i","~$a"],["^66","~$i","~$a","~$j","~$b"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7057,"^29",7057,"^2G",5,"^2H",true,"^2:",["^2;",[["^66","~$i","~$a"],["^66","~$i","~$a","~$j","~$b"]]]],"~$array->transient-hash-map",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7035,"^25",8,"^29",7035,"^24",33,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^5<","^66"]]]]]],"^59",true,"^1:","~$cljs.core/array->transient-hash-map","^2C",false,"^23","cljs/core.cljs","^24",33,"^2D",["^2;",[["^5<","^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7035,"^29",7035,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^5<","^66"]]]]]],"~$>=",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2646,"^25",16,"^29",2646,"^24",18,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns non-nil if nums are in monotonically non-increasing order,\n  otherwise false.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/>=","^2C",true,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2646,"^3=","^3:","^29",2646,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns non-nil if nums are in monotonically non-increasing order,\n  otherwise false."],"~$->TransientHashSet",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^PF","^1R","^1X","^?V","^22"]],"^23","cljs/core.cljs","^24",26,"^25",10,"^26","^27","^28",9163,"^29",9163,"^2:",["^2;",["^2<",["^2;",[["~$transient-map"]]]]],"^2@",["^19",["^PF","^1R","^1X","^?V","^22"]],"^2A","Positional factory function for cljs.core/TransientHashSet."],"^1O",["^19",["^PF","^1R","^1X","^?V","^22"]],"^1:","~$cljs.core/->TransientHashSet","^2C",false,"^23","cljs/core.cljs","^24",26,"^2D",["^2;",[["^TY"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",9163,"^29",9163,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^TY"]]]]],"^2@",["^19",["^PF","^1R","^1X","^?V","^22"]],"^2A","Positional factory function for cljs.core/TransientHashSet."],"~$drop-last",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4753,"^25",7,"^29",4753,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$s"],["~$n","~$s"]]]]],"^2A","Return a lazy sequence of all but the last n (default 1) items in coll","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$s"],["~$n","~$s"]]],"^2:",["^2;",[["~$s"],["~$n","~$s"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/drop-last","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$s"],["~$n","~$s"]]],"^2:",["^2;",[["~$s"],["~$n","~$s"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$s"],["~$n","~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4753,"^29",4753,"^2G",2,"^2H",true,"^2:",["^2;",[["~$s"],["~$n","~$s"]]],"^2A","Return a lazy sequence of all but the last n (default 1) items in coll"],"~$->ArrayIter",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",19,"^25",10,"^26","^27","^28",3979,"^29",3979,"^2:",["^2;",["^2<",["^2;",[["^66","~$i"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ArrayIter."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->ArrayIter","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^66","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3979,"^29",3979,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","~$i"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/ArrayIter."],"~$object?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",258,"^25",16,"^29",258,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x's constructor is Object"],"^1:","~$cljs.core/object?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",258,"^3=","^3:","^29",258,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x's constructor is Object"],"~$->ArrayNodeSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",22,"^25",10,"^26","^27","^28",7688,"^29",7688,"^2:",["^2;",["^2<",["^2;",[["^2=","^OU","~$i","~$s","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/ArrayNodeSeq."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->ArrayNodeSeq","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^2=","^OU","~$i","~$s","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7688,"^29",7688,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^OU","~$i","~$s","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/ArrayNodeSeq."],"~$lift-ns",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10110,"^25",8,"^29",10110,"^24",15,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$m"]]]]],"^2A","Returns [lifted-ns lifted-map] or nil if m can't be lifted."],"^59",true,"^1:","~$cljs.core/lift-ns","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$m"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10110,"^29",10110,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$m"]]]]],"^2A","Returns [lifted-ns lifted-map] or nil if m can't be lifted."],"~$tree-map-append",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8546,"^25",8,"^29",8546,"^24",23,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^MJ","^KJ"]]]]]],"^59",true,"^1:","~$cljs.core/tree-map-append","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^MJ","^KJ"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8546,"^29",8546,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^MJ","^KJ"]]]]]],"~$not-empty",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3956,"^25",7,"^29",3956,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","If coll is empty, returns nil, else coll"],"^1:","~$cljs.core/not-empty","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3956,"^29",3956,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","If coll is empty, returns nil, else coll"],"~$distinct",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9356,"^25",7,"^29",9356,"^24",15,"^2:",["^2;",["^2<",["^2;",[[],["^2O"]]]]],"^2A","Returns a lazy sequence of the elements of coll with duplicates removed.\n  Returns a stateful transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^2O"]]],"^2:",["^2;",[[],["^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/distinct","^2C",false,"^23","cljs/core.cljs","^24",15,"^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^2O"]]],"^2:",["^2;",[[],["^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[[],["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9356,"^29",9356,"^2G",1,"^2H",true,"^2:",["^2;",[[],["^2O"]]],"^2A","Returns a lazy sequence of the elements of coll with duplicates removed.\n  Returns a stateful transducer when no collection is provided."],"~$partition",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5200,"^25",7,"^29",5200,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$n","^2O"],["~$n","^=?","^2O"],["~$n","^=?","~$pad","^2O"]]]]],"^2A","Returns a lazy sequence of lists of n items each, at offsets step\n  apart. If step is not supplied, defaults to n, i.e. the partitions\n  do not overlap. If a pad collection is supplied, use its elements as\n  necessary to complete last partition up to n items. In case there are\n  not enough padding elements, return a partition with less than n items.","^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["~$n","^2O"],["~$n","^=?","^2O"],["~$n","^=?","^U@","^2O"]]],"^2:",["^2;",[["~$n","^2O"],["~$n","^=?","^2O"],["~$n","^=?","^U@","^2O"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/partition","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["~$n","^2O"],["~$n","^=?","^2O"],["~$n","^=?","^U@","^2O"]]],"^2:",["^2;",[["~$n","^2O"],["~$n","^=?","^2O"],["~$n","^=?","^U@","^2O"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$n","^2O"],["~$n","^=?","^2O"],["~$n","^=?","^U@","^2O"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",5200,"^29",5200,"^2G",4,"^2H",true,"^2:",["^2;",[["~$n","^2O"],["~$n","^=?","^2O"],["~$n","^=?","^U@","^2O"]]],"^2A","Returns a lazy sequence of lists of n items each, at offsets step\n  apart. If step is not supplied, defaults to n, i.e. the partitions\n  do not overlap. If a pad collection is supplied, use its elements as\n  necessary to complete last partition up to n items. In case there are\n  not enough padding elements, return a partition with less than n items."],"~$IMultiFn",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",10829,"^25",14,"^29",10829,"^24",22,"^2A",null,"^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^7P",[["^7R","^7S","^7T"]],"^9I",[["^7R"]],"^A?",[["^7R","^7S"]],"^LB",[["^7R"]],"^RT",[["^7R"]],"^S1",[["^7R"]],"^S5",[["^7R","^7S","^S6"]],"^SZ",[["^7R"]],"~$-get-method",[["^7R","^7S"]]]]],"^2S",true,"^1:","^7Q","^23","cljs/core.cljs","^24",22,"^25",1,"^28",10829,"^2U",["^ ","^2V",["^ ","^7P",[["^7R","^7S","^7T"]],"^9I",[["^7R"]],"^A?",[["^7R","^7S"]],"^LB",[["^7R"]],"^RT",[["^7R"]],"^S1",[["^7R"]],"^S5",[["^7R","^7S","^S6"]],"^SZ",[["^7R"]],"^UC",[["^7R","^7S"]]]],"^30",null,"^29",10829,"^31","^32","^33",["^19",["^FG"]],"^2A",null,"^2T",["^2;",["@interface"]]],"~$->Many",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",14,"^25",10,"^26","^27","^28",4024,"^29",4024,"^2:",["^2;",["^2<",["^2;",[["^AZ"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Many."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->Many","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^AZ"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4024,"^29",4024,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^AZ"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Many."],"~$DEMUNGE_PATTERN",["^ ","^1:","~$cljs.core/DEMUNGE_PATTERN","^23","cljs/core.cljs","^28",389,"^25",1,"^29",389,"^24",21,"^1N",["^ ","^23","cljs/core.cljs","^28",389,"^25",6,"^29",389,"^24",21],"^31","^57"],"~$fix",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2772,"^25",16,"^29",2772,"^24",19,"^31","^<","^59",true,"^2:",["^2;",["^2<",["^2;",[["~$q"]]]]]],"^59",true,"^1:","~$cljs.core/fix","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["~$q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2772,"^3=","^<","^29",2772,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$q"]]]]]],"~$EmptyList",["^ ","^3S",1,"^1O",["^19",["^A>","^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]],"^1:","^>V","^23","cljs/core.cljs","^24",19,"^3W",true,"^25",10,"^28",3091,"^3X",false,"^29",3091,"^31","^3Y","^2@",["^19",["^A>","^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^8T","^4K","^21","^5E"]]],"~$HashMapIter",["^ ","^3S",3,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/HashMapIter","^23","cljs/core.cljs","^24",21,"^3W",true,"^25",10,"^28",7755,"^3X",false,"^29",7755,"^31","^3Y","^2@",null],"~$IAssociative",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",625,"^25",14,"^29",625,"^24",26,"^2A","Protocol for adding associativity to collections.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-contains-key?",[["^2O","~$k"]],"^7V",[["^2O","~$k","~$v"]]]]],"^2S",true,"^1:","^7W","^23","cljs/core.cljs","^24",26,"^25",1,"^28",625,"^2U",["^ ","^2V",["^ ","^UN",[["^2O","~$k"]],"^7V",[["^2O","~$k","~$v"]]]],"^30",null,"^29",625,"^31","^32","^33",["^19",["^4V","^4W","^4X","^4Y","^4Z","^4[","^50","^51","^52"]],"^2A","Protocol for adding associativity to collections.","^2T",["^2;",["@interface"]]],"~$->Single",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",16,"^25",10,"^26","^27","^28",4038,"^29",4038,"^2:",["^2;",["^2<",["^2;",[["^2Z"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Single."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->Single","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4038,"^29",4038,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Z"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Single."],"~$bit-flip",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2857,"^25",7,"^29",2857,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Flip bit at index n"],"^1:","~$cljs.core/bit-flip","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2857,"^29",2857,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Flip bit at index n"],"~$long-array",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3652,"^25",7,"^29",3652,"^24",17,"^2:",["^2;",["^2<",["^2;",[["^B>"],["^B?","^B@"]]]]],"^2A","Creates an array of longs. Does not coerce array, provided for compatibility\n  with Clojure.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/long-array","^2C",false,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3652,"^29",3652,"^2G",2,"^2H",true,"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2A","Creates an array of longs. Does not coerce array, provided for compatibility\n  with Clojure."],"~$descendants",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10710,"^25",7,"^29",10710,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^GM"],["~$h","^GM"]]]]],"^2A","Returns the immediate and indirect children of tag, through a\n  relationship established via derive. h must be a hierarchy obtained\n  from make-hierarchy, if not supplied defaults to the global\n  hierarchy. Note: does not work on JavaScript type inheritance\n  relationships.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^GM"],["~$h","^GM"]]],"^2:",["^2;",[["^GM"],["~$h","^GM"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/descendants","^2C",false,"^23","cljs/core.cljs","^24",18,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^GM"],["~$h","^GM"]]],"^2:",["^2;",[["^GM"],["~$h","^GM"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^GM"],["~$h","^GM"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10710,"^29",10710,"^2G",2,"^2H",true,"^2:",["^2;",[["^GM"],["~$h","^GM"]]],"^2A","Returns the immediate and indirect children of tag, through a\n  relationship established via derive. h must be a hierarchy obtained\n  from make-hierarchy, if not supplied defaults to the global\n  hierarchy. Note: does not work on JavaScript type inheritance\n  relationships."],"~$imul",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",899,"^25",17,"^29",899,"^24",21,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$a","~$b"]]]]]],"^1:","~$cljs.core/imul","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$a","~$b"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",3,"^28",899,"^3=","^<","^29",899,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$a","~$b"]]]]]],"~$->Delay",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^8>","^3U"]],"^23","cljs/core.cljs","^24",15,"^25",10,"^26","^27","^28",10371,"^29",10371,"^2:",["^2;",["^2<",["^2;",[["~$f","^4@"]]]]],"^2@",["^19",["^8>","^3U"]],"^2A","Positional factory function for cljs.core/Delay."],"^1O",["^19",["^8>","^3U"]],"^1:","~$cljs.core/->Delay","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["~$f","^4@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",10371,"^29",10371,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f","^4@"]]]]],"^2@",["^19",["^8>","^3U"]],"^2A","Positional factory function for cljs.core/Delay."],"~$array-for",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5363,"^25",8,"^29",5363,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^6>","~$i"]]]]]],"^59",true,"^1:","~$cljs.core/array-for","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^6>","~$i"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5363,"^29",5363,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6>","~$i"]]]]]],"~$merge",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8990,"^25",7,"^29",8990,"^24",12,"^2:",["^2;",["^2<",["^2;",[["~$&","^@1"]]]]],"^2A","Returns a map that consists of the rest of the maps conj-ed onto\n  the first.  If a key occurs in more than one map, the mapping from\n  the latter (left-to-right) will be the mapping in the result.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^@1"]]],"^2:",["^2;",[["~$&","^@1"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/merge","^2C",true,"^23","cljs/core.cljs","^24",12,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^@1"]]],"^2:",["^2;",[["~$&","^@1"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^@1"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",8990,"^29",8990,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^@1"]]],"^2A","Returns a map that consists of the rest of the maps conj-ed onto\n  the first.  If a key occurs in more than one map, the mapping from\n  the latter (left-to-right) will be the mapping in the result."],"~$ISeqable",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",714,"^25",14,"^29",714,"^24",22,"^2A","Protocol for adding the ability to a type to be transformed into a sequence.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-seq",[["~$o"]]]]],"^2S",true,"^1:","^1Y","^23","cljs/core.cljs","^24",22,"^25",1,"^28",714,"^2U",["^ ","^2V",["^ ","^V4",[["~$o"]]]],"^30",null,"^29",714,"^31","^32","^33",["^19",["^4V","^4W","^>R","^>S","^4X","^9[","^>T","^5F","^4Y","^4Z","^>V","^8?","^4[","^>W","^>Y","^>Z","^>[","^<:","^;V","^50","^?0","^?1","^?3","^?4","^7E","^51","^?5","^?6","^7F","^?8","^>K","^9>","^52"]],"^2A","Protocol for adding the ability to a type to be transformed into a sequence.","^2T",["^2;",["@interface"]]],"~$Empty",["^ ","^3S",0,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/Empty","^23","cljs/core.cljs","^24",15,"^3W",true,"^25",10,"^28",4057,"^3X",false,"^29",4057,"^31","^3Y","^2@",null],"~$js-mod",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2806,"^25",7,"^29",2806,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","Modulus of num and div with original javascript behavior. i.e. bug for negative numbers"],"^1:","~$cljs.core/js-mod","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["~$n","~$d"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2806,"^29",2806,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","~$d"]]]]],"^2A","Modulus of num and div with original javascript behavior. i.e. bug for negative numbers"],"~$integer?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2240,"^25",16,"^29",2240,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns true if n is a JavaScript number with no decimal part."],"^1:","~$cljs.core/integer?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2240,"^3=","^3:","^29",2240,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns true if n is a JavaScript number with no decimal part."],"~$MetaFn",["^ ","^3S",2,"^1O",["^19",["^1R","^1Z","^4E","^21"]],"^1:","^AR","^23","cljs/core.cljs","^24",16,"^3W",true,"^25",10,"^28",1995,"^3X",false,"^29",1995,"^31","^3Y","^2@",["^19",["^1R","^1Z","^21"]]],"~$NS_CACHE",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",11406,"^25",3,"^29",11406,"^24",11,"^2A","Bootstrap only.","^2T",["@type {*}"]],"^1:","~$cljs.core/NS_CACHE","^23","cljs/core.cljs","^24",11,"^25",1,"^28",11404,"^29",11406,"^31","^57","^2A","Bootstrap only.","^2T",["@type {*}"]],"~$mapv",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5175,"^25",7,"^29",5175,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"],["~$f","^;<","^;=","^;>","~$&","^;?"]]]]],"^2A","Returns a vector consisting of the result of applying f to the\n  set of first items of each coll, followed by applying f to the set\n  of second items in each coll, until any one of the colls is\n  exhausted.  Any remaining items in other colls are ignored. Function\n  f should accept number-of-colls arguments.","^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"],["~$f","^;<","^;=","^;>","~$&","^;?"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/mapv","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"]]],"^2:",["^2;",[["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"],["~$f","^;<","^;=","^;>","~$&","^;?"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",5175,"^29",5175,"^2G",4,"^2H",true,"^2:",["^2;",[["~$f","^2O"],["~$f","^;<","^;="],["~$f","^;<","^;=","^;>"],["~$f","^;<","^;=","^;>","~$&","^;?"]]],"^2A","Returns a vector consisting of the result of applying f to the\n  set of first items of each coll, followed by applying f to the set\n  of second items in each coll, until any one of the colls is\n  exhausted.  Any remaining items in other colls are ignored. Function\n  f should accept number-of-colls arguments."],"~$infinite?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2311,"^25",16,"^29",2311,"^24",25,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true for Infinity and -Infinity values."],"^1:","~$cljs.core/infinite?","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2311,"^3=","^3:","^29",2311,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true for Infinity and -Infinity values."],"~$partition-all",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9440,"^25",7,"^29",9440,"^24",20,"^2:",["^2;",["^2<",["^2;",[["~$n"],["~$n","^2O"],["~$n","^=?","^2O"]]]]],"^2A","Returns a lazy sequence of lists like partition, but may include\n  partitions with fewer than n items at the end.  Returns a stateful\n  transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$n"],["~$n","^2O"],["~$n","^=?","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"],["~$n","^=?","^2O"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/partition-all","^2C",false,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$n"],["~$n","^2O"],["~$n","^=?","^2O"]]],"^2:",["^2;",[["~$n"],["~$n","^2O"],["~$n","^=?","^2O"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$n"],["~$n","^2O"],["~$n","^=?","^2O"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",9440,"^29",9440,"^2G",3,"^2H",true,"^2:",["^2;",[["~$n"],["~$n","^2O"],["~$n","^=?","^2O"]]],"^2A","Returns a lazy sequence of lists like partition, but may include\n  partitions with fewer than n items at the end.  Returns a stateful\n  transducer when no collection is provided."],"~$partition-by",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9669,"^25",7,"^29",9669,"^24",19,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","^2O"]]]]],"^2A","Applies f to each value in coll, splitting it each time f returns a\n   new value.  Returns a lazy seq of partitions.  Returns a stateful\n   transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/partition-by","^2C",false,"^23","cljs/core.cljs","^24",19,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$f"],["~$f","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9669,"^29",9669,"^2G",2,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","^2O"]]],"^2A","Applies f to each value in coll, splitting it each time f returns a\n   new value.  Returns a lazy seq of partitions.  Returns a stateful\n   transducer when no collection is provided."],"~$ISequential",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",719,"^25",14,"^29",719,"^24",25,"^2A","Marker interface indicating a persistent collection of sequential items","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ "]]],"^2S",true,"^1:","^4K","^23","cljs/core.cljs","^24",25,"^25",1,"^28",719,"^2U",["^ ","^2V",["^ "]],"^30",null,"^29",719,"^31","^32","^33",["^19",["^>R","^>S","^9[","^>T","^5F","^4Y","^4Z","^>V","^8?","^4[","^>W","^>Y","^>Z","^>[","^;V","^50","^?0","^?1","^?3","^?4","^?5","^?6","^?8","^>K","^9>","^52"]],"^2A","Marker interface indicating a persistent collection of sequential items","^2T",["^2;",["@interface"]]],"~$->LazySeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",17,"^25",10,"^26","^27","^28",3384,"^29",3384,"^2:",["^2;",["^2<",["^2;",[["^2=","~$fn","~$s","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/LazySeq."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->LazySeq","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2=","^VH","~$s","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3384,"^29",3384,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^VH","~$s","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/LazySeq."],"~$equiv-map",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6255,"^25",16,"^29",6255,"^24",25,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Test map equivalence. Returns true if x equals y, otherwise returns false."],"^1:","~$cljs.core/equiv-map","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6255,"^3=","^3:","^29",6255,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$y"]]]]],"^2A","Test map equivalence. Returns true if x equals y, otherwise returns false."],"~$->Volatile",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^3T","^3U"]],"^23","cljs/core.cljs","^24",18,"^25",10,"^26","^27","^28",4518,"^29",4518,"^2:",["^2;",["^2<",["^2;",[["^JS"]]]]],"^2@",["^19",["^3U"]],"^2A","Positional factory function for cljs.core/Volatile."],"^1O",["^19",["^3T","^3U"]],"^1:","~$cljs.core/->Volatile","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^JS"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4518,"^29",4518,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^JS"]]]]],"^2@",["^19",["^3U"]],"^2A","Positional factory function for cljs.core/Volatile."],"~$object-array",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3696,"^25",7,"^29",3696,"^24",19,"^2:",["^2;",["^2<",["^2;",[["^B>"],["^B?","^B@"]]]]],"^2A","Creates an array of objects. Does not coerce array, provided for compatibility\n  with Clojure.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/object-array","^2C",false,"^23","cljs/core.cljs","^24",19,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^B>"],["^B?","^B@"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3696,"^29",3696,"^2G",2,"^2H",true,"^2:",["^2;",[["^B>"],["^B?","^B@"]]],"^2A","Creates an array of objects. Does not coerce array, provided for compatibility\n  with Clojure."],"~$Keyword",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",222,"^25",20,"^29",222,"^24",27,"^5A",true],"^3S",4,"^1O",["^19",["^1P","^1Q","^1R","^1U","^<D","^5N"]],"^1:","^>U","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",3274,"^3X",false,"^5A",true,"^29",3274,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1R","^<D","^5N"]]],"~$derive",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10719,"^25",7,"^29",10719,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]]]],"^2A","Establishes a parent/child relationship between parent and\n  tag. Parent must be a namespace-qualified symbol or keyword and\n  child can be either a namespace-qualified symbol or keyword or a\n  class. h must be a hierarchy obtained from make-hierarchy, if not\n  supplied defaults to, and modifies, the global hierarchy.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2:",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/derive","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2:",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10719,"^29",10719,"^2G",3,"^2H",true,"^2:",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2A","Establishes a parent/child relationship between parent and\n  tag. Parent must be a namespace-qualified symbol or keyword and\n  child can be either a namespace-qualified symbol or keyword or a\n  class. h must be a hierarchy obtained from make-hierarchy, if not\n  supplied defaults to, and modifies, the global hierarchy."],"~$seq-iter",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4012,"^25",7,"^29",4012,"^24",15,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^1:","~$cljs.core/seq-iter","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4012,"^29",4012,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"~$->Empty",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U"]],"^23","cljs/core.cljs","^24",15,"^25",10,"^26","^27","^28",4057,"^29",4057,"^2:",["^2;",["^2<",["^2;",[[]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Empty."],"^1O",["^19",["^1U"]],"^1:","~$cljs.core/->Empty","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4057,"^29",4057,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/Empty."],"~$IChunkedSeq",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",827,"^25",14,"^29",827,"^24",25,"^2A","Protocol for accessing a collection as sequential chunks.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^GF",[["^2O"]],"^7G",[["^2O"]]]]],"^2S",true,"^1:","^7H","^23","cljs/core.cljs","^24",25,"^25",1,"^28",827,"^2U",["^ ","^2V",["^ ","^GF",[["^2O"]],"^7G",[["^2O"]]]],"^30",null,"^29",827,"^31","^32","^33",["^19",["^?6","^?8"]],"^2A","Protocol for accessing a collection as sequential chunks.","^2T",["^2;",["@interface"]]],"~$special-symbol?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11191,"^25",16,"^29",11191,"^24",31,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x names a special form"],"^1:","~$cljs.core/special-symbol?","^2C",false,"^23","cljs/core.cljs","^24",31,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11191,"^3=","^3:","^29",11191,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x names a special form"],"~$compare-keywords",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3262,"^25",8,"^29",3262,"^24",24,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$a","~$b"]]]]]],"^59",true,"^1:","~$cljs.core/compare-keywords","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$a","~$b"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3262,"^29",3262,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$a","~$b"]]]]]],"~$ancestors",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10702,"^25",7,"^29",10702,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^GM"],["~$h","^GM"]]]]],"^2A","Returns the immediate and indirect parents of tag, either via a JavaScript type\n  inheritance relationship or a relationship established via derive. h\n  must be a hierarchy obtained from make-hierarchy, if not supplied\n  defaults to the global hierarchy","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^GM"],["~$h","^GM"]]],"^2:",["^2;",[["^GM"],["~$h","^GM"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/ancestors","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^GM"],["~$h","^GM"]]],"^2:",["^2;",[["^GM"],["~$h","^GM"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^GM"],["~$h","^GM"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10702,"^29",10702,"^2G",2,"^2H",true,"^2:",["^2;",[["^GM"],["~$h","^GM"]]],"^2A","Returns the immediate and indirect parents of tag, either via a JavaScript type\n  inheritance relationship or a relationship established via derive. h\n  must be a hierarchy obtained from make-hierarchy, if not supplied\n  defaults to the global hierarchy"],"~$subseq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9496,"^25",7,"^29",9496,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^9D","^9E","^2Y"],["^9D","~$start-test","~$start-key","~$end-test","~$end-key"]]]]],"^2A","sc must be a sorted collection, test(s) one of <, <=, > or\n  >=. Returns a seq of those entries with keys ek for\n  which (test (.. sc comparator (compare ek key)) 0) is true","^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2:",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/subseq","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2:",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9496,"^29",9496,"^2G",5,"^2H",true,"^2:",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2A","sc must be a sorted collection, test(s) one of <, <=, > or\n  >=. Returns a seq of those entries with keys ek for\n  which (test (.. sc comparator (compare ek key)) 0) is true"],"~$gensym",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10359,"^25",7,"^29",10359,"^24",13,"^2:",["^2;",["^2<",["^2;",[[],["~$prefix-string"]]]]],"^2A","Returns a new symbol with a unique name. If a prefix string is\n  supplied, the name is prefix# where # is some unique number. If\n  prefix is not supplied, the prefix is 'G__'.","^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^W9"]]],"^2:",["^2;",[[],["^W9"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/gensym","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",1,"^2D",["^2;",[[],["^W9"]]],"^2:",["^2;",[[],["^W9"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[[],["^W9"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10359,"^29",10359,"^2G",1,"^2H",true,"^2:",["^2;",[[],["^W9"]]],"^2A","Returns a new symbol with a unique name. If a prefix string is\n  supplied, the name is prefix# where # is some unique number. If\n  prefix is not supplied, the prefix is 'G__'."],"^C4",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",613,"^25",16,"^29",613,"^24",21,"^31","^RZ","^5Y","^4J","^2A","Returns a new collection of coll without the first item. In contrast to\n     rest, it should return nil if there are no more items, e.g.\n     (next []) => nil\n     (next nil) => nil","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^4J","^1:","~$cljs.core/-next","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",611,"^3=","^RZ","^29",613,"^2G",1,"^31","^RZ","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a new collection of coll without the first item. In contrast to\n     rest, it should return nil if there are no more items, e.g.\n     (next []) => nil\n     (next nil) => nil"],"~$->HashCollisionNode",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1U","^20"]],"^23","cljs/core.cljs","^24",27,"^25",10,"^26","^27","^28",7490,"^29",7490,"^2:",["^2;",["^2<",["^2;",[["^=J","~$collision-hash","^67","^66"]]]]],"^2@",["^19",["^20"]],"^2A","Positional factory function for cljs.core/HashCollisionNode."],"^1O",["^19",["^1U","^20"]],"^1:","~$cljs.core/->HashCollisionNode","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^=J","^W=","^67","^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",7490,"^29",7490,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^W=","^67","^66"]]]]],"^2@",["^19",["^20"]],"^2A","Positional factory function for cljs.core/HashCollisionNode."],"~$delay?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10383,"^25",16,"^29",10383,"^24",22,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","returns true if x is a Delay created with delay"],"^1:","~$cljs.core/delay?","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10383,"^3=","^3:","^29",10383,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","returns true if x is a Delay created with delay"],"~$create-inode-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7671,"^25",8,"^29",7671,"^24",24,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^OU"],["^OU","~$i","~$s"]]]]],"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^OU"],["^OU","~$i","~$s"]]],"^2:",["^2;",[["^OU"],["^OU","~$i","~$s"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/create-inode-seq","^2C",false,"^23","cljs/core.cljs","^24",24,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^OU"],["^OU","~$i","~$s"]]],"^2:",["^2;",[["^OU"],["^OU","~$i","~$s"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^OU"],["^OU","~$i","~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7671,"^29",7671,"^2G",3,"^2H",true,"^2:",["^2;",[["^OU"],["^OU","~$i","~$s"]]]],"~$flatten",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5151,"^25",7,"^29",5151,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Takes any nested combination of sequential things (lists, vectors,\n  etc.) and returns their contents as a single, flat sequence.\n  (flatten nil) returns nil."],"^1:","~$cljs.core/flatten","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5151,"^29",5151,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Takes any nested combination of sequential things (lists, vectors,\n  etc.) and returns their contents as a single, flat sequence.\n  (flatten nil) returns nil."],"^SJ",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",641,"^25",9,"^29",641,"^24",16,"^31","^5X","^5Y","^A6","^2A","Returns a new collection of coll without the mapping for key k.","^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]]],"^5Y","^A6","^1:","~$cljs.core/-dissoc","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^2O","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",638,"^3=","^5X","^29",641,"^2G",2,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]],"^2A","Returns a new collection of coll without the mapping for key k."],"~$doubles",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2803,"^25",7,"^29",2803,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/doubles","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2803,"^29",2803,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$halt-when",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10418,"^25",7,"^29",10418,"^24",16,"^2:",["^2;",["^2<",["^2;",[["^4<"],["^4<","~$retf"]]]]],"^2A","Returns a transducer that ends transduction when pred returns true\n  for an input. When retf is supplied it must be a fn of 2 arguments -\n  it will be passed the (completed) result so far and the input that\n  triggered the predicate, and its return value (if it does not throw\n  an exception) will be the return value of the transducer. If retf\n  is not supplied, the input that triggered the predicate will be\n  returned. If the predicate never returns true the transduction is\n  unaffected.","^76","1.9","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^WI"]]],"^2:",["^2;",[["^4<"],["^4<","^WI"]]],"^2F",["^2;",[null,null]]]],"^76","1.9","^1:","~$cljs.core/halt-when","^2C",false,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^WI"]]],"^2:",["^2;",[["^4<"],["^4<","^WI"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^4<"],["^4<","^WI"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10418,"^29",10418,"^2G",2,"^2H",true,"^2:",["^2;",[["^4<"],["^4<","^WI"]]],"^2A","Returns a transducer that ends transduction when pred returns true\n  for an input. When retf is supplied it must be a fn of 2 arguments -\n  it will be passed the (completed) result so far and the input that\n  triggered the predicate, and its return value (if it does not throw\n  an exception) will be the return value of the transducer. If retf\n  is not supplied, the input that triggered the predicate will be\n  returned. If the predicate never returns true the transduction is\n  unaffected."],"^UN",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",627,"^25",13,"^29",627,"^24",27,"^31","^3:","^5Y","^7W","^2A","Returns true if k is a key in coll.","^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]]],"^5Y","^7W","^1:","~$cljs.core/-contains-key?","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^2O","~$k"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",625,"^3=","^3:","^29",627,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O","~$k"]]]]],"^2A","Returns true if k is a key in coll."],"~$remove-watch",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10347,"^25",7,"^29",10347,"^24",19,"^2:",["^2;",["^2<",["^2;",[["^FY","^2Y"]]]]],"^2A","Removes a watch (set by add-watch) from a reference"],"^1:","~$cljs.core/remove-watch","^2C",false,"^23","cljs/core.cljs","^24",19,"^2D",["^2;",[["^FY","^2Y"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10347,"^29",10347,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^FY","^2Y"]]]]],"^2A","Removes a watch (set by add-watch) from a reference"],"~$ex-info",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11156,"^25",7,"^29",11156,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$msg","^LN"],["^WO","^LN","^LO"]]]]],"^2A","Create an instance of ExceptionInfo, an Error type that carries a\n  map of additional data.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^WO","^LN"],["^WO","^LN","^LO"]]],"^2:",["^2;",[["^WO","^LN"],["^WO","^LN","^LO"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/ex-info","^2C",false,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^WO","^LN"],["^WO","^LN","^LO"]]],"^2:",["^2;",[["^WO","^LN"],["^WO","^LN","^LO"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^WO","^LN"],["^WO","^LN","^LO"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11156,"^29",11156,"^2G",3,"^2H",true,"^2:",["^2;",[["^WO","^LN"],["^WO","^LN","^LO"]]],"^2A","Create an instance of ExceptionInfo, an Error type that carries a\n  map of additional data."],"~$ifn?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2235,"^25",16,"^29",2235,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Returns true if f returns true for fn? or satisfies IFn."],"^1:","~$cljs.core/ifn?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2235,"^3=","^3:","^29",2235,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Returns true if f returns true for fn? or satisfies IFn."],"~$IAtom",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",846,"^25",14,"^29",846,"^24",19,"^2A","Marker protocol indicating an atom.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ "]]],"^2S",true,"^1:","^JR","^23","cljs/core.cljs","^24",19,"^25",1,"^28",846,"^2U",["^ ","^2V",["^ "]],"^30",null,"^29",846,"^31","^32","^33",["^19",["^?7"]],"^2A","Marker protocol indicating an atom.","^2T",["^2;",["@interface"]]],"~$->PersistentQueue",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^1Y","^1Z","^1[","^8T","^20","^4K","^21"]],"^23","cljs/core.cljs","^24",25,"^25",10,"^26","^27","^28",6176,"^29",6176,"^2:",["^2;",["^2<",["^2;",[["^2=","^AG","^4L","^4M","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^1Y","^1Z","^1[","^8T","^20","^4K","^21"]],"^2A","Positional factory function for cljs.core/PersistentQueue."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^1Y","^1Z","^1[","^8T","^20","^4K","^21"]],"^1:","~$cljs.core/->PersistentQueue","^2C",false,"^23","cljs/core.cljs","^24",25,"^2D",["^2;",[["^2=","^AG","^4L","^4M","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6176,"^29",6176,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^AG","^4L","^4M","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^1Y","^1Z","^1[","^8T","^20","^4K","^21"]],"^2A","Positional factory function for cljs.core/PersistentQueue."],"~$nat-int?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2286,"^25",16,"^29",2286,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies int? and is a natural integer value."],"^1:","~$cljs.core/nat-int?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2286,"^3=","^3:","^29",2286,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies int? and is a natural integer value."],"~$IWatchable",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",771,"^25",14,"^29",771,"^24",24,"^2A","Protocol for types that can be watched. Currently only implemented by Atom.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^IE",[["^CV","^ED","^:U"]],"^DJ",[["^CV","^2Y","~$f"]],"^CT",[["^CV","^2Y"]]]]],"^2S",true,"^1:","^CU","^23","cljs/core.cljs","^24",24,"^25",1,"^28",771,"^2U",["^ ","^2V",["^ ","^IE",[["^CV","^ED","^:U"]],"^DJ",[["^CV","^2Y","~$f"]],"^CT",[["^CV","^2Y"]]]],"^30",null,"^29",771,"^31","^32","^33",["^19",["^?7"]],"^2A","Protocol for types that can be watched. Currently only implemented by Atom.","^2T",["^2;",["@interface"]]],"~$pv-fresh-node",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5297,"^25",8,"^29",5297,"^24",21,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^=J"]]]]]],"^59",true,"^1:","~$cljs.core/pv-fresh-node","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["^=J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5297,"^29",5297,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=J"]]]]]],"~$subvec",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5906,"^25",7,"^29",5906,"^24",13,"^2:",["^2;",["^2<",["^2;",[["~$v","^4P"],["~$v","^4P","^4Q"]]]]],"^2A","Returns a persistent vector of the items in vector from\n  start (inclusive) to end (exclusive).  If end is not supplied,\n  defaults to (count vector). This operation is O(1) and very fast, as\n  the resulting vector shares structure with the original and no\n  trimming is done.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$v","^4P"],["~$v","^4P","^4Q"]]],"^2:",["^2;",[["~$v","^4P"],["~$v","^4P","^4Q"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/subvec","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["~$v","^4P"],["~$v","^4P","^4Q"]]],"^2:",["^2;",[["~$v","^4P"],["~$v","^4P","^4Q"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["~$v","^4P"],["~$v","^4P","^4Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5906,"^29",5906,"^2G",3,"^2H",true,"^2:",["^2;",[["~$v","^4P"],["~$v","^4P","^4Q"]]],"^2A","Returns a persistent vector of the items in vector from\n  start (inclusive) to end (exclusive).  If end is not supplied,\n  defaults to (count vector). This operation is O(1) and very fast, as\n  the resulting vector shares structure with the original and no\n  trimming is done."],"^H5",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",808,"^25",9,"^29",808,"^24",14,"^31","^5X","^5Y","^?W","^2A","Returns tcoll with the last item removed from it.","^2:",["^2;",["^2<",["^2;",[["^2X"]]]]]],"^5Y","^?W","^1:","~$cljs.core/-pop!","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2X"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",804,"^3=","^5X","^29",808,"^2G",1,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2X"]]]]],"^2A","Returns tcoll with the last item removed from it."],"~$partial",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4259,"^25",7,"^29",4259,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$f"],["~$f","~$arg1"],["~$f","^X3","~$arg2"],["~$f","^X3","^X4","~$arg3"],["~$f","^X3","^X4","^X5","~$&","^6A"]]]]],"^2A","Takes a function f and fewer than the normal arguments to f, and\n  returns a fn that takes a variable number of additional args. When\n  called, the returned function calls f with args + additional args.","^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$f"],["~$f","^X3"],["~$f","^X3","^X4"],["~$f","^X3","^X4","^X5"]]],"^2:",["^2;",[["~$f"],["~$f","^X3"],["~$f","^X3","^X4"],["~$f","^X3","^X4","^X5"],["~$f","^X3","^X4","^X5","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null,null]]]],"^1:","~$cljs.core/partial","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",4,"^2D",["^2;",[["~$f"],["~$f","^X3"],["~$f","^X3","^X4"],["~$f","^X3","^X4","^X5"]]],"^2:",["^2;",[["~$f"],["~$f","^X3"],["~$f","^X3","^X4"],["~$f","^X3","^X4","^X5"],["~$f","^X3","^X4","^X5","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null,null]]],"^2D",["^2;",[["~$f"],["~$f","^X3"],["~$f","^X3","^X4"],["~$f","^X3","^X4","^X5"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null]],"^25",1,"^28",4259,"^29",4259,"^2G",4,"^2H",true,"^2:",["^2;",[["~$f"],["~$f","^X3"],["~$f","^X3","^X4"],["~$f","^X3","^X4","^X5"],["~$f","^X3","^X4","^X5","~$&","^6A"]]],"^2A","Takes a function f and fewer than the normal arguments to f, and\n  returns a fn that takes a variable number of additional args. When\n  called, the returned function calls f with args + additional args."],"~$chunked-seq?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2151,"^25",16,"^29",2151,"^24",28,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is satisfies IChunkedSeq."],"^1:","~$cljs.core/chunked-seq?","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2151,"^3=","^3:","^29",2151,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x is satisfies IChunkedSeq."],"~$replicate",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4962,"^25",7,"^29",4962,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$n","~$x"]]]]],"^2A","DEPRECATED: Use 'repeat' instead.\n  Returns a lazy seq of n xs."],"^1:","~$cljs.core/replicate","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$n","~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4962,"^29",4962,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n","~$x"]]]]],"^2A","DEPRECATED: Use 'repeat' instead.\n  Returns a lazy seq of n xs."],"~$PersistentQueue",["^ ","^3S",5,"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^1Y","^1Z","^1[","^8T","^20","^4K","^21"]],"^1:","^>T","^23","cljs/core.cljs","^24",25,"^3W",true,"^25",10,"^28",6176,"^3X",false,"^29",6176,"^31","^3Y","^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^1Y","^1Z","^1[","^8T","^20","^4K","^21"]]],"~$min-key",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9420,"^25",7,"^29",9420,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the x for which (k x), a number, is least.\n\n  If there are multiple such xs, the last one is returned.","^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"]]],"^2:",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/min-key","^2C",true,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"]]],"^2:",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",9420,"^29",9420,"^2G",3,"^2H",true,"^2:",["^2;",[["~$k","~$x"],["~$k","~$x","~$y"],["~$k","~$x","~$y","~$&","^6A"]]],"^2A","Returns the x for which (k x), a number, is least.\n\n  If there are multiple such xs, the last one is returned."],"~$hash-iset",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2994,"^25",8,"^29",2994,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"^59",true,"^1:","~$cljs.core/hash-iset","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2994,"^29",2994,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$s"]]]]]],"~$reduced",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1421,"^25",7,"^29",1421,"^24",14,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Wraps x in a way such that a reduce will terminate with the value x"],"^1:","~$cljs.core/reduced","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1421,"^29",1421,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Wraps x in a way such that a reduce will terminate with the value x"],"~$re-matches",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9805,"^25",7,"^29",9805,"^24",17,"^2:",["^2;",["^2<",["^2;",[["^<>","~$s"]]]]],"^2A","Returns the result of (re-find re s) if re fully matches s."],"^1:","~$cljs.core/re-matches","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^<>","~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9805,"^29",9805,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^<>","~$s"]]]]],"^2A","Returns the result of (re-find re s) if re fully matches s."],"~$pr-writer-impl",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9912,"^25",8,"^29",9912,"^24",22,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^7K","^2J"]]]]]],"^59",true,"^1:","~$cljs.core/pr-writer-impl","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["^3;","^7K","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9912,"^29",9912,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^7K","^2J"]]]]]],"~$array-map",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8797,"^25",7,"^29",8797,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$&","^9T"]]]]],"^2A","keyval => key val\n  Returns a new array map with supplied mappings.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^9T"]]],"^2:",["^2;",[["~$&","^9T"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/array-map","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^9T"]]],"^2:",["^2;",[["~$&","^9T"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^9T"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",8797,"^29",8797,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^9T"]]],"^2A","keyval => key val\n  Returns a new array map with supplied mappings."],"~$ITransientSet",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",811,"^25",14,"^29",811,"^24",27,"^2A","Protocol for adding set functionality to a transient collection.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-disjoin!",[["^2X","~$v"]]]]],"^2S",true,"^1:","^PF","^23","cljs/core.cljs","^24",27,"^25",1,"^28",811,"^2U",["^ ","^2V",["^ ","^XI",[["^2X","~$v"]]]],"^30",null,"^29",811,"^31","^32","^33",["^19",["^7D"]],"^2A","Protocol for adding set functionality to a transient collection.","^2T",["^2;",["@interface"]]],"~$ITER_SYMBOL",["^ ","^1:","~$cljs.core/ITER_SYMBOL","^23","cljs/core.cljs","^28",333,"^25",3,"^29",333,"^24",19,"^1N",["^ ","^23","cljs/core.cljs","^28",333,"^25",8,"^29",333,"^24",19],"^31","^90"],"~$unchecked-byte",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2690,"^25",15,"^29",2690,"^24",29,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/unchecked-byte","^2C",false,"^23","cljs/core.cljs","^24",29,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2690,"^3=","^<","^29",2690,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$checked-aset",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",466,"^25",8,"^29",466,"^24",20,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]]]],"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/checked-aset","^2C",true,"^23","cljs/core.cljs","^24",20,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",466,"^29",466,"^2G",3,"^2H",true,"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]]],"~$ArrayNode",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",7105,"^25",10,"^29",7105,"^24",19,"^5A",true],"^3S",3,"^1O",["^19",["^1U","^20"]],"^1:","^?>","^23","cljs/core.cljs","^24",19,"^3W",true,"^25",10,"^28",7380,"^3X",false,"^5A",true,"^29",7380,"^31","^3Y","^2@",["^19",["^20"]]],"~$->ChunkedSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^5D","^1S","^@S","^1U","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",20,"^25",10,"^26","^27","^28",5667,"^29",5667,"^2:",["^2;",["^2<",["^2;",[["^I<","^84","~$i","^>4","^2=","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^5D","^1S","^@S","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/ChunkedSeq."],"^1O",["^19",["^1P","^1Q","^5D","^1S","^@S","^1U","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21","^5E"]],"^1:","~$cljs.core/->ChunkedSeq","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^I<","^84","~$i","^>4","^2=","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",5667,"^29",5667,"^2G",6,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^I<","^84","~$i","^>4","^2=","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^5D","^1S","^@S","^1W","^4?","^4J","^1Y","^1Z","^7H","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/ChunkedSeq."],"~$every-pred",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4576,"^25",7,"^29",4576,"^24",17,"^2:",["^2;",["^2<",["^2;",[["~$p"],["~$p1","~$p2"],["^XT","^XU","~$p3"],["^XT","^XU","^XV","~$&","~$ps"]]]]],"^2A","Takes a set of predicates and returns a function f that returns true if all of its\n  composing predicates return a logical true value against all of its arguments, else it returns\n  false. Note that f is short-circuiting in that it will stop execution on the first\n  argument that triggers a logical false result against the original predicates.","^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$p"],["^XT","^XU"],["^XT","^XU","^XV"]]],"^2:",["^2;",[["~$p"],["^XT","^XU"],["^XT","^XU","^XV"],["^XT","^XU","^XV","~$&","^XW"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/every-pred","^2C",true,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["~$p"],["^XT","^XU"],["^XT","^XU","^XV"]]],"^2:",["^2;",[["~$p"],["^XT","^XU"],["^XT","^XU","^XV"],["^XT","^XU","^XV","~$&","^XW"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[["~$p"],["^XT","^XU"],["^XT","^XU","^XV"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",4576,"^29",4576,"^2G",3,"^2H",true,"^2:",["^2;",[["~$p"],["^XT","^XU"],["^XT","^XU","^XV"],["^XT","^XU","^XV","~$&","^XW"]]],"^2A","Takes a set of predicates and returns a function f that returns true if all of its\n  composing predicates return a logical true value against all of its arguments, else it returns\n  false. Note that f is short-circuiting in that it will stop execution on the first\n  argument that triggers a logical false result against the original predicates."],"^CM",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8903,"^25",7,"^29",8903,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^2>"]]]]],"^2A","Returns a sequence of the map's keys."],"^1:","~$cljs.core/keys","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["^2>"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8903,"^29",8903,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2>"]]]]],"^2A","Returns a sequence of the map's keys."],"~$missing-protocol",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",311,"^25",7,"^29",311,"^24",23,"^2:",["^2;",["^2<",["^2;",[["~$proto","^3;"]]]]]],"^1:","~$cljs.core/missing-protocol","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["^X[","^3;"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",311,"^29",311,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^X[","^3;"]]]]]],"~$load-file",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",326,"^25",7,"^29",326,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$file"]]]]]],"^1:","~$cljs.core/load-file","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^Y2"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",326,"^29",326,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^Y2"]]]]]],"~$PersistentArrayMap",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",1959,"^25",28,"^29",1959,"^24",46,"^5A",true],"^3S",4,"^1O",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1U","^4U","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22","^5E"]],"^1:","^4X","^23","cljs/core.cljs","^24",28,"^3W",true,"^25",10,"^28",6733,"^3X",false,"^5A",true,"^29",6733,"^31","^3Y","^2@",["^19",["^98","^1P","^1Q","^1R","^1S","^1T","^1W","^1X","^1Y","^1Z","^1[","^20","^21","^7W","^A6","^22","^5E"]]],"~$distinct?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2338,"^25",16,"^29",2338,"^24",25,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns true if no two of the arguments are =","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/distinct?","^2C",true,"^23","cljs/core.cljs","^24",25,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2338,"^3=","^3:","^29",2338,"^2G",2,"^31","^3:","^2H",true,"^2:",["^2;",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns true if no two of the arguments are ="],"~$pos-int?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2256,"^25",16,"^29",2256,"^24",24,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies int? and is positive."],"^1:","~$cljs.core/pos-int?","^2C",false,"^23","cljs/core.cljs","^24",24,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2256,"^3=","^3:","^29",2256,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Return true if x satisfies int? and is positive."],"~$never-equiv",["^ ","^1:","~$cljs.core/never-equiv","^23","cljs/core.cljs","^28",6253,"^25",1,"^29",6253,"^24",27,"^59",true,"^1N",["^ ","^23","cljs/core.cljs","^28",6253,"^25",16,"^29",6253,"^24",27,"^59",true],"^31","^G7"],"~$unchecked-short",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2692,"^25",15,"^29",2692,"^24",30,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/unchecked-short","^2C",false,"^23","cljs/core.cljs","^24",30,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2692,"^3=","^<","^29",2692,"^2G",1,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$->Range",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5B","^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",15,"^25",10,"^26","^27","^28",9537,"^29",9537,"^2:",["^2;",["^2<",["^2;",[["^2=","^4P","^4Q","^=?","^2?"]]]]],"^2@",["^19",["^5B","^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Range."],"^1O",["^19",["^5B","^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^1:","~$cljs.core/->Range","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^2=","^4P","^4Q","^=?","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",9537,"^29",9537,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^4P","^4Q","^=?","^2?"]]]]],"^2@",["^19",["^5B","^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Range."],"~$->MapEntry",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^23","cljs/core.cljs","^24",18,"^25",10,"^26","^27","^28",6555,"^29",6555,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^2?"]]]]],"^2@",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^2A","Positional factory function for cljs.core/MapEntry."],"^1O",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1U","^4U","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^1:","~$cljs.core/->MapEntry","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^2Y","^2Z","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",6555,"^29",6555,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Y","^2Z","^2?"]]]]],"^2@",["^19",["^5B","^8S","^5C","^1P","^1Q","^1R","^1S","^1W","^1X","^1Y","^1Z","^8T","^8U","^4K","^21","^7W","^22","^5E"]],"^2A","Positional factory function for cljs.core/MapEntry."],"~$apply-to-simple",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3849,"^25",8,"^29",3849,"^24",23,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$f","^AD"],["~$f","~$a0","^AD"],["~$f","^YB","~$a1","^AD"],["~$f","^YB","^YC","~$a2","^AD"],["~$f","^YB","^YC","^YD","~$a3","^AD"]]]]],"^2A","Internal. DO NOT USE!\n  Assumes args was already called with seq beforehand!","^2K",["^ ","^2C",false,"^2G",6,"^2D",["^2;",[["~$f","^AD"],["~$f","^YB","^AD"],["~$f","^YB","^YC","^AD"],["~$f","^YB","^YC","^YD","^AD"],["~$f","^YB","^YC","^YD","^YE","^AD"]]],"^2:",["^2;",[["~$f","^AD"],["~$f","^YB","^AD"],["~$f","^YB","^YC","^AD"],["~$f","^YB","^YC","^YD","^AD"],["~$f","^YB","^YC","^YD","^YE","^AD"]]],"^2F",["^2;",[null,null,null,null,null]]]],"^59",true,"^1:","~$cljs.core/apply-to-simple","^2C",false,"^23","cljs/core.cljs","^24",23,"^2K",["^ ","^2C",false,"^2G",6,"^2D",["^2;",[["~$f","^AD"],["~$f","^YB","^AD"],["~$f","^YB","^YC","^AD"],["~$f","^YB","^YC","^YD","^AD"],["~$f","^YB","^YC","^YD","^YE","^AD"]]],"^2:",["^2;",[["~$f","^AD"],["~$f","^YB","^AD"],["~$f","^YB","^YC","^AD"],["~$f","^YB","^YC","^YD","^AD"],["~$f","^YB","^YC","^YD","^YE","^AD"]]],"^2F",["^2;",[null,null,null,null,null]]],"^2D",["^2;",[["~$f","^AD"],["~$f","^YB","^AD"],["~$f","^YB","^YC","^AD"],["~$f","^YB","^YC","^YD","^AD"],["~$f","^YB","^YC","^YD","^YE","^AD"]]],"^2E",null,"^2F",["^2;",[null,null,null,null,null]],"^25",1,"^28",3849,"^29",3849,"^2G",6,"^2H",true,"^2:",["^2;",[["~$f","^AD"],["~$f","^YB","^AD"],["~$f","^YB","^YC","^AD"],["~$f","^YB","^YC","^YD","^AD"],["~$f","^YB","^YC","^YD","^YE","^AD"]]],"^2A","Internal. DO NOT USE!\n  Assumes args was already called with seq beforehand!"],"~$methods",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11044,"^25",7,"^29",11044,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Given a multimethod, returns a map of dispatch values -> dispatch fns"],"^1:","~$cljs.core/methods","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^87"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11044,"^29",11044,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87"]]]]],"^2A","Given a multimethod, returns a map of dispatch values -> dispatch fns"],"~$odd?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",4212,"^25",16,"^29",4212,"^24",20,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns true if n is odd, throws an exception if n is not an integer"],"^1:","~$cljs.core/odd?","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",4212,"^3=","^3:","^29",4212,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$n"]]]]],"^2A","Returns true if n is odd, throws an exception if n is not an integer"],"~$->ArrayChunk",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^5B","^1X","^:F","^5E"]],"^23","cljs/core.cljs","^24",20,"^25",10,"^26","^27","^28",3481,"^29",3481,"^2:",["^2;",["^2<",["^2;",[["^66","^>4","^4Q"]]]]],"^2@",["^19",["^5B","^1X","^5E"]],"^2A","Positional factory function for cljs.core/ArrayChunk."],"^1O",["^19",["^5B","^1X","^:F","^5E"]],"^1:","~$cljs.core/->ArrayChunk","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^66","^>4","^4Q"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3481,"^29",3481,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^66","^>4","^4Q"]]]]],"^2@",["^19",["^5B","^1X","^5E"]],"^2A","Positional factory function for cljs.core/ArrayChunk."],"~$ci-reduce",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1451,"^25",8,"^29",1451,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$cicoll","~$f"],["^YN","~$f","^2Z"],["^YN","~$f","^2Z","^7:"]]]]],"^2A","Accepts any collection which satisfies the ICount and IIndexed protocols and\nreduces them without incurring seq initialization","^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^YN","~$f"],["^YN","~$f","^2Z"],["^YN","~$f","^2Z","^7:"]]],"^2:",["^2;",[["^YN","~$f"],["^YN","~$f","^2Z"],["^YN","~$f","^2Z","^7:"]]],"^2F",["^2;",[null,null,null]]]],"^59",true,"^1:","~$cljs.core/ci-reduce","^2C",false,"^23","cljs/core.cljs","^24",17,"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^YN","~$f"],["^YN","~$f","^2Z"],["^YN","~$f","^2Z","^7:"]]],"^2:",["^2;",[["^YN","~$f"],["^YN","~$f","^2Z"],["^YN","~$f","^2Z","^7:"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[["^YN","~$f"],["^YN","~$f","^2Z"],["^YN","~$f","^2Z","^7:"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",1451,"^29",1451,"^2G",4,"^2H",true,"^2:",["^2;",[["^YN","~$f"],["^YN","~$f","^2Z"],["^YN","~$f","^2Z","^7:"]]],"^2A","Accepts any collection which satisfies the ICount and IIndexed protocols and\nreduces them without incurring seq initialization"],"~$*3",["^ ","^1:","~$cljs.core/*3","^23","cljs/core.cljs","^28",207,"^25",1,"^29",209,"^24",5,"^2A","bound in a repl thread to the third most recent value printed","^1N",["^ ","^23","cljs/core.cljs","^28",209,"^25",3,"^29",209,"^24",5,"^2A","bound in a repl thread to the third most recent value printed"]],"^UC",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10834,"^25",4,"^29",10834,"^24",15,"^5Y","^7Q","^2A",null,"^2:",["^2;",["^2<",["^2;",[["^7R","^7S"]]]]]],"^5Y","^7Q","^1:","~$cljs.core/-get-method","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[["^7R","^7S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10829,"^29",10834,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^7R","^7S"]]]]],"^2A",null],"~$->Var",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1R","^1U","^1Z","^4E","^3U","^21"]],"^23","cljs/core.cljs","^24",13,"^25",10,"^26","^27","^28",1110,"^29",1110,"^2:",["^2;",["^2<",["^2;",[["^2Z","^GU","^G1"]]]]],"^2@",["^19",["^1P","^1Q","^1R","^1Z","^3U","^21"]],"^2A","Positional factory function for cljs.core/Var."],"^1O",["^19",["^1P","^1Q","^1R","^1U","^1Z","^4E","^3U","^21"]],"^1:","~$cljs.core/->Var","^2C",false,"^23","cljs/core.cljs","^24",13,"^2D",["^2;",[["^2Z","^GU","^G1"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",1110,"^29",1110,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2Z","^GU","^G1"]]]]],"^2@",["^19",["^1P","^1Q","^1R","^1Z","^3U","^21"]],"^2A","Positional factory function for cljs.core/Var."],"~$frequencies",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9710,"^25",7,"^29",9710,"^24",18,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a map from distinct items in coll to the number of times\n  they appear."],"^1:","~$cljs.core/frequencies","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9710,"^29",9710,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a map from distinct items in coll to the number of times\n  they appear."],"~$reduceable?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2129,"^25",16,"^29",2129,"^24",27,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll satisfies IReduce"],"^1:","~$cljs.core/reduceable?","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2129,"^3=","^3:","^29",2129,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if coll satisfies IReduce"],"~$string-hash-cache",["^ ","^1:","~$cljs.core/string-hash-cache","^23","cljs/core.cljs","^28",955,"^25",1,"^29",955,"^24",23,"^1N",["^ ","^23","cljs/core.cljs","^28",955,"^25",6,"^29",955,"^24",23],"^31","^45"],"~$->Iterate",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",17,"^25",10,"^26","^27","^28",4976,"^29",4976,"^2:",["^2;",["^2<",["^2;",[["^2=","~$f","~$prev-seed","^IX","~$next"]]]]],"^2@",["^19",["^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Iterate."],"^1O",["^19",["^1S","^1U","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->Iterate","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^2=","~$f","^Z0","^IX","^Z1"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",4976,"^29",4976,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","~$f","^Z0","^IX","^Z1"]]]]],"^2@",["^19",["^1S","^8>","^1W","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Iterate."],"~$rsubseq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9511,"^25",7,"^29",9511,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]]]],"^2A","sc must be a sorted collection, test(s) one of <, <=, > or\n  >=. Returns a reverse seq of those entries with keys ek for\n  which (test (.. sc comparator (compare ek key)) 0) is true","^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2:",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/rsubseq","^2C",false,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",false,"^2G",5,"^2D",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2:",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9511,"^29",9511,"^2G",5,"^2H",true,"^2:",["^2;",[["^9D","^9E","^2Y"],["^9D","^W3","^W4","^W5","^W6"]]],"^2A","sc must be a sorted collection, test(s) one of <, <=, > or\n  >=. Returns a reverse seq of those entries with keys ek for\n  which (test (.. sc comparator (compare ek key)) 0) is true"],"~$inc",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1411,"^25",7,"^29",1411,"^24",10,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one greater than num."],"^1:","~$cljs.core/inc","^2C",false,"^23","cljs/core.cljs","^24",10,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1411,"^29",1411,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns a number one greater than num."],"~$type->str",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",320,"^25",7,"^29",320,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$ty"]]]]]],"^1:","~$cljs.core/type->str","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^Z8"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",320,"^29",320,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^Z8"]]]]]],"~$obj-clone",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6311,"^25",8,"^29",6311,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^8J"]]]]]],"^59",true,"^1:","~$cljs.core/obj-clone","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^3;","^8J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6311,"^29",6311,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^8J"]]]]]],"~$get-method",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11048,"^25",7,"^29",11048,"^24",17,"^2:",["^2;",["^2<",["^2;",[["^87","^7S"]]]]],"^2A","Given a multimethod and a dispatch value, returns the dispatch fn\n  that would apply to that value, or nil if none apply and no default"],"^1:","~$cljs.core/get-method","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^87","^7S"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11048,"^29",11048,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^87","^7S"]]]]],"^2A","Given a multimethod and a dispatch value, returns the dispatch fn\n  that would apply to that value, or nil if none apply and no default"],"~$uuid?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",11111,"^25",16,"^29",11111,"^24",21,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/uuid?","^2C",false,"^23","cljs/core.cljs","^24",21,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",11111,"^3=","^3:","^29",11111,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"~$vector-index-out-of-bounds",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5341,"^25",8,"^29",5341,"^24",34,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$i","^67"]]]]]],"^59",true,"^1:","~$cljs.core/vector-index-out-of-bounds","^2C",false,"^23","cljs/core.cljs","^24",34,"^2D",["^2;",[["~$i","^67"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5341,"^29",5341,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$i","^67"]]]]]],"~$es6-entries-iterator",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6460,"^25",7,"^29",6460,"^24",27,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^1:","~$cljs.core/es6-entries-iterator","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6460,"^29",6460,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"~$bit-clear",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2852,"^25",7,"^29",2852,"^24",16,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Clear bit at index n"],"^1:","~$cljs.core/bit-clear","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2852,"^29",2852,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]],"^2A","Clear bit at index n"],"~$Range",["^ ","^3S",5,"^1O",["^19",["^5B","^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]],"^1:","^>K","^23","cljs/core.cljs","^24",15,"^3W",true,"^25",10,"^28",9537,"^3X",false,"^29",9537,"^31","^3Y","^2@",["^19",["^5B","^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^1[","^20","^4K","^21","^5E"]]],"~$filter",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",5099,"^25",7,"^29",5099,"^24",13,"^2:",["^2;",["^2<",["^2;",[["^4<"],["^4<","^2O"]]]]],"^2A","Returns a lazy sequence of the items in coll for which\n  (pred item) returns logical true. pred must be free of side-effects.\n  Returns a transducer when no collection is provided.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/filter","^2C",false,"^23","cljs/core.cljs","^24",13,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^4<"],["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",5099,"^29",5099,"^2G",2,"^2H",true,"^2:",["^2;",[["^4<"],["^4<","^2O"]]],"^2A","Returns a lazy sequence of the items in coll for which\n  (pred item) returns logical true. pred must be free of side-effects.\n  Returns a transducer when no collection is provided."],"~$->PersistentTreeMapSeq",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",30,"^25",10,"^26","^27","^28",8066,"^29",8066,"^2:",["^2;",["^2<",["^2;",[["^2=","^@","^6V","^67","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/PersistentTreeMapSeq."],"^1O",["^19",["^1P","^1Q","^1S","^1U","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^1:","~$cljs.core/->PersistentTreeMapSeq","^2C",false,"^23","cljs/core.cljs","^24",30,"^2D",["^2;",[["^2=","^@","^6V","^67","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",8066,"^29",8066,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^@","^6V","^67","^2?"]]]]],"^2@",["^19",["^1P","^1Q","^1S","^1W","^1X","^4?","^4J","^1Y","^1Z","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/PersistentTreeMapSeq."],"~$create-array-node-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",7741,"^25",8,"^29",7741,"^24",29,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^OU"],["^2=","^OU","~$i","~$s"]]]]],"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^OU"],["^2=","^OU","~$i","~$s"]]],"^2:",["^2;",[["^OU"],["^2=","^OU","~$i","~$s"]]],"^2F",["^2;",[null,null]]]],"^59",true,"^1:","~$cljs.core/create-array-node-seq","^2C",false,"^23","cljs/core.cljs","^24",29,"^2K",["^ ","^2C",false,"^2G",4,"^2D",["^2;",[["^OU"],["^2=","^OU","~$i","~$s"]]],"^2:",["^2;",[["^OU"],["^2=","^OU","~$i","~$s"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^OU"],["^2=","^OU","~$i","~$s"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",7741,"^29",7741,"^2G",4,"^2H",true,"^2:",["^2;",[["^OU"],["^2=","^OU","~$i","~$s"]]]],"^H4",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",806,"^25",9,"^29",806,"^24",18,"^31","^5X","^5Y","^?W","^2A","Returns tcoll with value val added at position n.","^2:",["^2;",["^2<",["^2;",[["^2X","~$n","^2Z"]]]]]],"^5Y","^?W","^1:","~$cljs.core/-assoc-n!","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^2X","~$n","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",804,"^3=","^5X","^29",806,"^2G",3,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2X","~$n","^2Z"]]]]],"^2A","Returns tcoll with value val added at position n."],"~$IWithMeta",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",684,"^25",14,"^29",684,"^24",23,"^2A","Protocol for adding metadata to an object.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^5W",[["~$o","^2="]]]]],"^2S",true,"^1:","^21","^23","cljs/core.cljs","^24",23,"^25",1,"^28",684,"^2U",["^ ","^2V",["^ ","^5W",[["~$o","^2="]]]],"^30",null,"^29",684,"^31","^32","^33",["^19",["^4V","^4W","^>R","^4X","^9[","^>T","^5F","^4Y","^4Z","^>V","^8?","^4[","^>W","^4F","^>Y","^>Z","^>[","^;V","^50","^?0","^?1","^?3","^?4","^7E","^51","^?5","^?6","^7F","^?8","^<E","^AR","^AS","^>K","^9>","^52"]],"^2A","Protocol for adding metadata to an object.","^2T",["^2;",["@interface"]]],"~$list",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3177,"^25",7,"^29",3177,"^24",11,"^2:",["^2;",["^2<",["^2;",[["~$&","^5:"]]]]],"^2A","Creates a new list containing the items.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^5:"]]],"^2:",["^2;",[["~$&","^5:"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/list","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^5:"]]],"^2:",["^2;",[["~$&","^5:"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^5:"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",3177,"^29",3177,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^5:"]]],"^2A","Creates a new list containing the items."],"~$+",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2579,"^25",15,"^29",2579,"^24",16,"^31","^<","^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]]]],"^2A","Returns the sum of nums. (+) returns 0.","^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]]],"^1:","~$cljs.core/+","^2C",true,"^23","cljs/core.cljs","^24",16,"^2K",["^ ","^2C",true,"^2G",2,"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2F",["^2;",[null,null,null,null]]],"^2D",["^2;",[[],["~$x"],["~$x","~$y"]]],"^2E",null,"^2F",["^2;",[null,null,null,null]],"^25",1,"^28",2579,"^3=","^<","^29",2579,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^6A"]]],"^2A","Returns the sum of nums. (+) returns 0."],"~$IndexedSeqIterator",["^ ","^3S",2,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/IndexedSeqIterator","^23","cljs/core.cljs","^24",28,"^3W",true,"^25",10,"^28",1559,"^3X",false,"^29",1559,"^31","^3Y","^2@",null],"~$split-with",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9664,"^25",7,"^29",9664,"^24",17,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns a vector of [(take-while pred coll) (drop-while pred coll)]"],"^1:","~$cljs.core/split-with","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^4<","^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9664,"^29",9664,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^4<","^2O"]]]]],"^2A","Returns a vector of [(take-while pred coll) (drop-while pred coll)]"],"~$->VectorNode",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",[]],"^23","cljs/core.cljs","^24",20,"^25",10,"^26","^27","^28",5295,"^29",5295,"^2:",["^2;",["^2<",["^2;",[["^=J","^66"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/VectorNode."],"^1O",["^19",[]],"^1:","~$cljs.core/->VectorNode","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^=J","^66"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",5295,"^29",5295,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^=J","^66"]]]]],"^2@",null,"^2A","Positional factory function for cljs.core/VectorNode."],"~$aset",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",503,"^25",7,"^29",503,"^24",11,"^2:",["^2;",["^2<",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]]]],"^2A","Sets the value at the index/indices. Works on JavaScript arrays.\n  Returns val.","^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/aset","^2C",true,"^23","cljs/core.cljs","^24",11,"^2K",["^ ","^2C",true,"^2G",3,"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^79","^7:","^2Z"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",503,"^29",503,"^2G",3,"^2H",true,"^2:",["^2;",[["^79","^7:","^2Z"],["^79","^7:","^@=","~$&","^@>"]]],"^2A","Sets the value at the index/indices. Works on JavaScript arrays.\n  Returns val."],"~$int-rotate-left",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",890,"^25",15,"^29",890,"^24",30,"^31","^<","^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]]],"^1:","~$cljs.core/int-rotate-left","^2C",false,"^23","cljs/core.cljs","^24",30,"^2D",["^2;",[["~$x","~$n"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",890,"^3=","^<","^29",890,"^2G",2,"^31","^<","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x","~$n"]]]]]],"~$keyword",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3360,"^25",7,"^29",3360,"^24",14,"^2:",["^2;",["^2<",["^2;",[["^:"],["^47","^:"]]]]],"^2A","Returns a Keyword with the given namespace and name.  Do not use :\n  in the keyword strings, it will be added automatically.","^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^:"],["^47","^:"]]],"^2:",["^2;",[["^:"],["^47","^:"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/keyword","^2C",false,"^23","cljs/core.cljs","^24",14,"^2K",["^ ","^2C",false,"^2G",2,"^2D",["^2;",[["^:"],["^47","^:"]]],"^2:",["^2;",[["^:"],["^47","^:"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^:"],["^47","^:"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3360,"^29",3360,"^2G",2,"^2H",true,"^2:",["^2;",[["^:"],["^47","^:"]]],"^2A","Returns a Keyword with the given namespace and name.  Do not use :\n  in the keyword strings, it will be added automatically."],"~$->Cons",["^ ","^1M",null,"^1N",["^ ","^1O",["^19",["^A>","^1P","^1Q","^5D","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]],"^23","cljs/core.cljs","^24",14,"^25",10,"^26","^27","^28",3194,"^29",3194,"^2:",["^2;",["^2<",["^2;",[["^2=","^6J","^;P","^2?"]]]]],"^2@",["^19",["^A>","^1P","^1Q","^5D","^1S","^1W","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Cons."],"^1O",["^19",["^A>","^1P","^1Q","^5D","^1S","^1U","^1W","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]],"^1:","~$cljs.core/->Cons","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2=","^6J","^;P","^2?"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^26","^27","^28",3194,"^29",3194,"^2G",4,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2=","^6J","^;P","^2?"]]]]],"^2@",["^19",["^A>","^1P","^1Q","^5D","^1S","^1W","^4?","^4J","^1Y","^1Z","^1[","^4K","^21","^5E"]],"^2A","Positional factory function for cljs.core/Cons."],"~$*ns*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",54,"^25",3,"^29",54,"^24",7,"^6F",true,"^2A","Var bound to the current namespace. Only used for bootstrapping.","^2T",["@type {*}"]],"^1:","~$cljs.core/*ns*","^23","cljs/core.cljs","^24",7,"^25",1,"^6F",true,"^28",50,"^29",54,"^31","^57","^2A","Var bound to the current namespace. Only used for bootstrapping.","^2T",["@type {*}"]],"~$*assert*",["^ ","^1:","~$cljs.core/*assert*","^23","cljs/core.cljs","^28",61,"^25",1,"^29",63,"^24",11,"^6F",true,"^1N",["^ ","^23","cljs/core.cljs","^28",63,"^25",3,"^29",63,"^24",11,"^6F",true],"^31","^3:"],"~$create-tree-map-seq",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8135,"^25",8,"^29",8135,"^24",27,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^5R","^6V","^67"]]]]]],"^59",true,"^1:","~$cljs.core/create-tree-map-seq","^2C",false,"^23","cljs/core.cljs","^24",27,"^2D",["^2;",[["^5R","^6V","^67"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",8135,"^29",8135,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^5R","^6V","^67"]]]]]],"~$ICollection",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",581,"^25",14,"^29",581,"^24",25,"^2A","Protocol for adding to a collection.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","^9X",[["^2O","~$o"]]]]],"^2S",true,"^1:","^1S","^23","cljs/core.cljs","^24",25,"^25",1,"^28",581,"^2U",["^ ","^2V",["^ ","^9X",[["^2O","~$o"]]]],"^30",null,"^29",581,"^31","^32","^33",["^19",["^4V","^4W","^>R","^4X","^9[","^>T","^5F","^4Y","^4Z","^>V","^8?","^4[","^>W","^>Y","^>Z","^>[","^;V","^50","^?0","^?1","^?3","^?4","^7E","^51","^?5","^?6","^7F","^?8","^>K","^9>","^52"]],"^2A","Protocol for adding to a collection.","^2T",["^2;",["@interface"]]],"~$chars",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2799,"^25",7,"^29",2799,"^24",12,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^1:","~$cljs.core/chars","^2C",false,"^23","cljs/core.cljs","^24",12,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2799,"^29",2799,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]]],"^HS",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2937,"^25",7,"^29",2937,"^24",10,"^2:",["^2;",["^2<",["^2;",[[],["~$x"],["~$x","~$&","^5;"]]]]],"^2A","With no args, returns the empty string. With one arg x, returns\n  x.toString().  (str nil) returns the empty string. With more than\n  one arg, returns the concatenation of the str values of the args.","^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[[],["~$x"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$&","^5;"]]],"^2F",["^2;",[null,null,null]]]],"^1:","~$cljs.core/str","^2C",true,"^23","cljs/core.cljs","^24",10,"^2K",["^ ","^2C",true,"^2G",1,"^2D",["^2;",[[],["~$x"]]],"^2:",["^2;",[[],["~$x"],["~$x","~$&","^5;"]]],"^2F",["^2;",[null,null,null]]],"^2D",["^2;",[[],["~$x"]]],"^2E",null,"^2F",["^2;",[null,null,null]],"^25",1,"^28",2937,"^29",2937,"^2G",1,"^2H",true,"^2:",["^2;",[[],["~$x"],["~$x","~$&","^5;"]]],"^2A","With no args, returns the empty string. With one arg x, returns\n  x.toString().  (str nil) returns the empty string. With more than\n  one arg, returns the concatenation of the str values of the args."],"^Z1",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",1249,"^25",12,"^29",1249,"^24",16,"^31","^3P","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a seq of the items after the first. Calls seq on its\n  argument.  If there are no more items, returns nil"],"^1:","~$cljs.core/next","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",1249,"^3=","^3P","^29",1249,"^2G",1,"^31","^3P","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a seq of the items after the first. Calls seq on its\n  argument.  If there are no more items, returns nil"],"~$ASeq",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",598,"^25",14,"^29",598,"^24",18,"^2A","Marker protocol indicating an array sequence.","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ "]]],"^2S",true,"^1:","^5D","^23","cljs/core.cljs","^24",18,"^25",1,"^28",598,"^2U",["^ ","^2V",["^ "]],"^30",null,"^29",598,"^31","^32","^33",["^19",["^>R","^5F","^?0","^?6","^?8"]],"^2A","Marker protocol indicating an array sequence.","^2T",["^2;",["@interface"]]],"~$pr-seq-writer",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10011,"^25",7,"^29",10011,"^24",20,"^2:",["^2;",["^2<",["^2;",[["^6Y","^7K","^2J"]]]]]],"^1:","~$cljs.core/pr-seq-writer","^2C",false,"^23","cljs/core.cljs","^24",20,"^2D",["^2;",[["^6Y","^7K","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10011,"^29",10011,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^6Y","^7K","^2J"]]]]]],"~$SeqIter",["^ ","^3S",2,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/SeqIter","^23","cljs/core.cljs","^24",17,"^3W",true,"^25",10,"^28",3994,"^3X",false,"^29",3994,"^31","^3Y","^2@",null],"~$IFn",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",537,"^25",14,"^29",537,"^24",17,"^2A","Protocol for adding the ability to invoke an object as a function.\n  For example, a vector can also be used to look up a value:\n  ([1 2 3 4] 1) => 2","^2S",true,"^2T",["^2;",["@interface"]],"^2U",["^ ","^2V",["^ ","~$-invoke",[["^CV"],["^CV","~$a"],["^CV","~$a","~$b"],["^CV","~$a","~$b","~$c"],["^CV","~$a","~$b","~$c","~$d"],["^CV","~$a","~$b","~$c","~$d","~$e"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^;P"]]]]],"^2S",true,"^1:","^1R","^23","cljs/core.cljs","^24",17,"^25",1,"^28",537,"^2U",["^ ","^2V",["^ ","^[E",[["^CV"],["^CV","~$a"],["^CV","~$a","~$b"],["^CV","~$a","~$b","~$c"],["^CV","~$a","~$b","~$c","~$d"],["^CV","~$a","~$b","~$c","~$d","~$e"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^CV","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^;P"]]]],"^30",null,"^29",537,"^31","^32","^33",["^19",["^4V","^FG","^4W","^34","^4X","^>U","^4Y","^4Z","^4[","^4F","^35","^50","^36","^7D","^7E","^51","^7F","^<E","^AR","^52"]],"^2A","Protocol for adding the ability to invoke an object as a function.\n  For example, a vector can also be used to look up a value:\n  ([1 2 3 4] 1) => 2","^2T",["^2;",["@interface"]]],"~$regexp?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",9800,"^25",16,"^29",9800,"^24",23,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a JavaScript RegExp instance."],"^1:","~$cljs.core/regexp?","^2C",false,"^23","cljs/core.cljs","^24",23,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",9800,"^3=","^3:","^29",9800,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is a JavaScript RegExp instance."],"^2>",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",8788,"^25",7,"^29",8788,"^24",15,"^2:",["^2;",["^2<",["^2;",[["~$&","^9T"]]]]],"^2A","keyval => key val\n  Returns a new hash map with supplied mappings.","^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^9T"]]],"^2:",["^2;",[["~$&","^9T"]]],"^2F",["^2;",[null]]]],"^1:","~$cljs.core/hash-map","^2C",true,"^23","cljs/core.cljs","^24",15,"^2K",["^ ","^2C",true,"^2G",0,"^2D",[["^2;",["^9T"]]],"^2:",["^2;",[["~$&","^9T"]]],"^2F",["^2;",[null]]],"^2D",[["^2;",["^9T"]]],"^2E",null,"^2F",["^2;",[null]],"^25",1,"^28",8788,"^29",8788,"^2G",0,"^2H",true,"^2:",["^2;",[["~$&","^9T"]]],"^2A","keyval => key val\n  Returns a new hash map with supplied mappings."],"~$*exec-tap-fn*",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",73,"^25",3,"^29",73,"^24",16,"^2A","Arranges to have tap functions executed via the supplied f, a\n  function of no arguments. Returns true if successful, false otherwise.","^6F",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]]],"^1:","~$cljs.core/*exec-tap-fn*","^2C",false,"^23","cljs/core.cljs","^24",16,"^2D",["^2;",[["~$f"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^6F",true,"^28",71,"^29",73,"^2G",1,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$f"]]]]],"^2A","Arranges to have tap functions executed via the supplied f, a\n  function of no arguments. Returns true if successful, false otherwise."],"~$underive",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10753,"^25",7,"^29",10753,"^24",15,"^2:",["^2;",["^2<",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]]]],"^2A","Removes a parent/child relationship between parent and\n  tag. h must be a hierarchy obtained from make-hierarchy, if not\n  supplied defaults to, and modifies, the global hierarchy.","^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2:",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2F",["^2;",[null,null]]]],"^1:","~$cljs.core/underive","^2C",false,"^23","cljs/core.cljs","^24",15,"^2K",["^ ","^2C",false,"^2G",3,"^2D",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2:",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2F",["^2;",[null,null]]],"^2D",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10753,"^29",10753,"^2G",3,"^2H",true,"^2:",["^2;",[["^GM","^:6"],["~$h","^GM","^:6"]]],"^2A","Removes a parent/child relationship between parent and\n  tag. h must be a hierarchy obtained from make-hierarchy, if not\n  supplied defaults to, and modifies, the global hierarchy."],"~$array-copy",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2175,"^25",8,"^29",2175,"^24",18,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^EI","~$i","^EJ","~$j","^5<"]]]]]],"^59",true,"^1:","~$cljs.core/array-copy","^2C",false,"^23","cljs/core.cljs","^24",18,"^2D",["^2;",[["^EI","~$i","^EJ","~$j","^5<"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2175,"^29",2175,"^2G",5,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^EI","~$i","^EJ","~$j","^5<"]]]]]],"~$obj-map-compare-keys",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",6289,"^25",8,"^29",6289,"^24",28,"^59",true,"^2:",["^2;",["^2<",["^2;",[["~$a","~$b"]]]]]],"^59",true,"^1:","~$cljs.core/obj-map-compare-keys","^2C",false,"^23","cljs/core.cljs","^24",28,"^2D",["^2;",[["~$a","~$b"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",6289,"^29",6289,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$a","~$b"]]]]]],"^KR",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",851,"^25",4,"^29",851,"^24",11,"^5Y","^KS","^2A","Sets the value of o to new-value.","^2:",["^2;",["^2<",["^2;",[["~$o","^CP"]]]]]],"^5Y","^KS","^1:","~$cljs.core/-reset!","^2C",false,"^23","cljs/core.cljs","^24",11,"^2D",["^2;",[["~$o","^CP"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",849,"^29",851,"^2G",2,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$o","^CP"]]]]],"^2A","Sets the value of o to new-value."],"^T;",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",605,"^25",9,"^29",605,"^24",14,"^31","^5X","^5Y","^4?","^2A","Returns a new collection of coll without the first item. It should\n     always return a seq, e.g.\n     (rest []) => ()\n     (rest nil) => ()","^2:",["^2;",["^2<",["^2;",[["^2O"]]]]]],"^5Y","^4?","^1:","~$cljs.core/-rest","^2C",false,"^23","cljs/core.cljs","^24",14,"^2D",["^2;",[["^2O"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",601,"^3=","^5X","^29",605,"^2G",1,"^31","^5X","^2H",true,"^2:",["^2;",["^2<",["^2;",[["^2O"]]]]],"^2A","Returns a new collection of coll without the first item. It should\n     always return a seq, e.g.\n     (rest []) => ()\n     (rest nil) => ()"],"~$nil-iter",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",3960,"^25",7,"^29",3960,"^24",15,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"^1:","~$cljs.core/nil-iter","^2C",false,"^23","cljs/core.cljs","^24",15,"^2D",["^2;",[[]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",3960,"^29",3960,"^2G",0,"^2H",true,"^2:",["^2;",["^2<",["^2;",[[]]]]]],"~$pr-writer",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",10002,"^25",8,"^29",10002,"^24",17,"^59",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^7K","^2J"]]]]],"^2A","Prefer this to pr-seq, because it makes the printing function\n   configurable, allowing efficient implementations such as appending\n   to a StringBuffer."],"^59",true,"^1:","~$cljs.core/pr-writer","^2C",false,"^23","cljs/core.cljs","^24",17,"^2D",["^2;",[["^3;","^7K","^2J"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",10002,"^29",10002,"^2G",3,"^2H",true,"^2:",["^2;",["^2<",["^2;",[["^3;","^7K","^2J"]]]]],"^2A","Prefer this to pr-seq, because it makes the printing function\n   configurable, allowing efficient implementations such as appending\n   to a StringBuffer."],"~$false?",["^ ","^1M",null,"^1N",["^ ","^23","cljs/core.cljs","^28",2195,"^25",16,"^29",2195,"^24",22,"^31","^3:","^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is the value false, false otherwise."],"^1:","~$cljs.core/false?","^2C",false,"^23","cljs/core.cljs","^24",22,"^2D",["^2;",[["~$x"]]],"^2E",null,"^2F",["^2;",[null,null]],"^25",1,"^28",2195,"^3=","^3:","^29",2195,"^2G",1,"^31","^3:","^2H",true,"^2:",["^2;",["^2<",["^2;",[["~$x"]]]]],"^2A","Returns true if x is the value false, false otherwise."],"~$RangedIterator",["^ ","^3S",6,"^1O",["^19",["^1U"]],"^1:","~$cljs.core/RangedIterator","^23","cljs/core.cljs","^24",24,"^3W",true,"^25",10,"^28",5392,"^3X",false,"^29",5392,"^31","^3Y","^2@",null],"~$*print-readably*",["^ ","^1N",["^ ","^23","cljs/core.cljs","^28",114,"^25",3,"^29",114,"^24",19,"^6F",true,"^2A","When set to logical false, strings and characters will be printed with\n  non-alphanumeric characters converted to the appropriate escape sequences.\n\n  Defaults to true"],"^1:","~$cljs.core/*print-readably*","~:file","cljs/core.cljs","~:end-column",19,"~:column",1,"~:dynamic",true,"~:line",108,"~:end-line",114,"~:tag","~$boolean","~:doc","When set to logical false, strings and characters will be printed with\n  non-alphanumeric characters converted to the appropriate escape sequences.\n\n  Defaults to true"],"~$ints",["^ ","~:protocol-inline",null,"~:meta",["^ ","^1","cljs/core.cljs","^5",2801,"^3",7,"^6",2801,"^2",11,"~:arglists",["~#list",["~$quote",["^>",[["~$x"]]]]]],"~:name","~$cljs.core/ints","~:variadic",false,"^1","cljs/core.cljs","^2",11,"~:method-params",["^>",[["~$x"]]],"~:protocol-impl",null,"~:arglists-meta",["^>",[null,null]],"^3",1,"^5",2801,"^6",2801,"~:max-fixed-arity",1,"~:fn-var",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$some-fn",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4615,"^3",7,"^6",4615,"^2",14,"^=",["^>",["^?",["^>",[["~$p"],["~$p1","~$p2"],["^I","^J","~$p3"],["^I","^J","^K","~$&","~$ps"]]]]],"^9","Takes a set of predicates and returns a function f that returns the first logical true value\n  returned by one of its composing predicates against any of its arguments, else it returns\n  logical false. Note that f is short-circuiting in that it will stop execution on the first\n  argument that triggers a logical true result against the original predicates.","~:top-fn",["^ ","^B",true,"^F",3,"^C",["^>",[["~$p"],["^I","^J"],["^I","^J","^K"]]],"^=",["^>",[["~$p"],["^I","^J"],["^I","^J","^K"],["^I","^J","^K","~$&","^L"]]],"^E",["^>",[null,null,null,null]]]],"^@","~$cljs.core/some-fn","^B",true,"^1","cljs/core.cljs","^2",14,"^M",["^ ","^B",true,"^F",3,"^C",["^>",[["~$p"],["^I","^J"],["^I","^J","^K"]]],"^=",["^>",[["~$p"],["^I","^J"],["^I","^J","^K"],["^I","^J","^K","~$&","^L"]]],"^E",["^>",[null,null,null,null]]],"^C",["^>",[["~$p"],["^I","^J"],["^I","^J","^K"]]],"^D",null,"^E",["^>",[null,null,null,null]],"^3",1,"^5",4615,"^6",4615,"^F",3,"^G",true,"^=",["^>",[["~$p"],["^I","^J"],["^I","^J","^K"],["^I","^J","^K","~$&","^L"]]],"^9","Takes a set of predicates and returns a function f that returns the first logical true value\n  returned by one of its composing predicates against any of its arguments, else it returns\n  logical false. Note that f is short-circuiting in that it will stop execution on the first\n  argument that triggers a logical true result against the original predicates."],"~$demunge-pattern",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",11280,"^3",8,"^6",11280,"^2",23,"~:private",true,"^=",["^>",["^?",["^>",[[]]]]]],"^P",true,"^@","~$cljs.core/demunge-pattern","^B",false,"^1","cljs/core.cljs","^2",23,"^C",["^>",[[]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",11280,"^6",11280,"^F",0,"^G",true,"^=",["^>",["^?",["^>",[[]]]]]],"~$maybe-enable-print!",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",11505,"^3",8,"^6",11505,"^2",27,"^P",true,"^=",["^>",["^?",["^>",[[]]]]]],"^P",true,"^@","~$cljs.core/maybe-enable-print!","^B",false,"^1","cljs/core.cljs","^2",27,"^C",["^>",[[]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",11505,"^6",11505,"^F",0,"^G",true,"^=",["^>",["^?",["^>",[[]]]]]],"~$*flush-on-newline*",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",99,"^3",3,"^6",99,"^2",21,"^4",true,"^9","When set to true, output will be flushed whenever a newline is printed.\n\n  Defaults to true."],"^@","~$cljs.core/*flush-on-newline*","^1","cljs/core.cljs","^2",21,"^3",1,"^4",true,"^5",94,"^6",99,"^7","^8","^9","When set to true, output will be flushed whenever a newline is printed.\n\n  Defaults to true."],"~$to-array",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3609,"^3",7,"^6",3609,"^2",15,"^=",["^>",["^?",["^>",[["~$s"]]]]],"^9","Naive impl of to-array as a start."],"^@","~$cljs.core/to-array","^B",false,"^1","cljs/core.cljs","^2",15,"^C",["^>",[["~$s"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3609,"^6",3609,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$s"]]]]],"^9","Naive impl of to-array as a start."],"~$build-subvec",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",5892,"^3",8,"^6",5892,"^2",20,"^P",true,"^=",["^>",["^?",["^>",[["~$meta","~$v","~$start","~$end","~$__hash"]]]]]],"^P",true,"^@","~$cljs.core/build-subvec","^B",false,"^1","cljs/core.cljs","^2",20,"^C",["^>",[["^Y","~$v","^Z","^[","^10"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",5892,"^6",5892,"^F",5,"^G",true,"^=",["^>",["^?",["^>",[["^Y","~$v","^Z","^[","^10"]]]]]],"~$maybe-warn",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",447,"^3",8,"^6",447,"^2",18,"^P",true,"^=",["^>",["^?",["^>",[["~$e"]]]]]],"^P",true,"^@","~$cljs.core/maybe-warn","^B",false,"^1","cljs/core.cljs","^2",18,"^C",["^>",[["~$e"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",447,"^6",447,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$e"]]]]]],"~$Namespace",["^ ","~:num-fields",2,"~:protocols",["~#set",["~$cljs.core/IEquiv","~$cljs.core/IHash","~$cljs.core/Object"]],"^@","~$cljs.core/Namespace","^1","cljs/core.cljs","^2",19,"~:type",true,"^3",10,"^5",11384,"~:record",false,"^6",11384,"^7","~$function","~:skip-protocol-flag",["^17",["^18","^19"]]],"~$list?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3084,"^3",16,"^6",3084,"^2",21,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x implements IList"],"^@","~$cljs.core/list?","^B",false,"^1","cljs/core.cljs","^2",21,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3084,"~:ret-tag","^8","^6",3084,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x implements IList"],"~$tree-map-remove",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",8603,"^3",8,"^6",8603,"^2",23,"^P",true,"^=",["^>",["^?",["^>",[["~$comp","~$tree","~$k","~$found"]]]]]],"^P",true,"^@","~$cljs.core/tree-map-remove","^B",false,"^1","cljs/core.cljs","^2",23,"^C",["^>",[["^1D","^1E","~$k","^1F"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",8603,"^6",8603,"^F",4,"^G",true,"^=",["^>",["^?",["^>",[["^1D","^1E","~$k","^1F"]]]]]],"~$PersistentQueueIter",["^ ","^15",2,"^16",["^17",["^1:"]],"^@","~$cljs.core/PersistentQueueIter","^1","cljs/core.cljs","^2",29,"^1<",true,"^3",10,"^5",6106,"^1=",false,"^6",6106,"^7","^1>","^1?",null],"~$HashCollisionNode",["^ ","^15",4,"^16",["^17",["^1:","~$cljs.core/IIterable"]],"^@","~$cljs.core/HashCollisionNode","^1","cljs/core.cljs","^2",27,"^1<",true,"^3",10,"^5",7490,"^1=",false,"^6",7490,"^7","^1>","^1?",["^17",["^1K"]]],"~$array?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",234,"^3",16,"^6",234,"^2",22,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x is a JavaScript array."],"^@","~$cljs.core/array?","^B",false,"^1","cljs/core.cljs","^2",22,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",234,"^1B","^8","^6",234,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x is a JavaScript array."],"~$prefers*",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10779,"^3",8,"^6",10779,"^2",16,"^P",true,"^=",["^>",["^?",["^>",[["~$x","~$y","~$prefer-table"]]]]]],"^P",true,"^@","~$cljs.core/prefers*","^B",false,"^1","cljs/core.cljs","^2",16,"^C",["^>",[["~$x","~$y","^1P"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",10779,"^6",10779,"^F",3,"^G",true,"^=",["^>",["^?",["^>",[["~$x","~$y","^1P"]]]]]],"~$simple-ident?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3336,"^3",16,"^6",3336,"^2",29,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Return true if x is a symbol or keyword without a namespace"],"^@","~$cljs.core/simple-ident?","^B",false,"^1","cljs/core.cljs","^2",29,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3336,"^1B","^8","^6",3336,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Return true if x is a symbol or keyword without a namespace"],"~$clone",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1192,"^3",7,"^6",1192,"^2",12,"^=",["^>",["^?",["^>",[["~$value"]]]]],"^9","Clone the supplied value which must implement ICloneable."],"^@","~$cljs.core/clone","^B",false,"^1","cljs/core.cljs","^2",12,"^C",["^>",[["^1U"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1192,"^6",1192,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^1U"]]]]],"^9","Clone the supplied value which must implement ICloneable."],"~$scan-array",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",6275,"^3",8,"^6",6275,"^2",18,"^P",true,"^=",["^>",["^?",["^>",[["~$incr","~$k","~$array"]]]]]],"^P",true,"^@","~$cljs.core/scan-array","^B",false,"^1","cljs/core.cljs","^2",18,"^C",["^>",[["^1X","~$k","^1Y"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",6275,"^6",6275,"^F",3,"^G",true,"^=",["^>",["^?",["^>",[["^1X","~$k","^1Y"]]]]]],"~$demunge",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",11335,"^3",7,"^6",11335,"^2",14,"^=",["^>",["^?",["^>",[["~$name"]]]]]],"^@","~$cljs.core/demunge","^B",false,"^1","cljs/core.cljs","^2",14,"^C",["^>",[["^20"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",11335,"^6",11335,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^20"]]]]]],"~$bit-not",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2862,"^3",7,"^6",2862,"^2",14,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Bitwise complement"],"^@","~$cljs.core/bit-not","^B",false,"^1","cljs/core.cljs","^2",14,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2862,"^6",2862,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Bitwise complement"],"~$quote-string",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",9898,"^3",17,"^6",9898,"^2",29,"^P",true,"^=",["^>",["^?",["^>",[["~$s"]]]]]],"^P",true,"^@","~$cljs.core/quote-string","^B",false,"^1","cljs/core.cljs","^2",29,"^C",["^>",[["~$s"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",9898,"^6",9898,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$s"]]]]]],"~$byte",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2676,"^3",15,"^6",2676,"^2",19,"^7","~$number","^=",["^>",["^?",["^>",[["~$x"]]]]]],"^@","~$cljs.core/byte","^B",false,"^1","cljs/core.cljs","^2",19,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2676,"^1B","^27","^6",2676,"^F",1,"^7","^27","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$max",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2662,"^3",15,"^6",2662,"^2",18,"^7","^27","^=",["^>",["^?",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","~$more"]]]]],"^9","Returns the greatest of the nums.","^M",["^ ","^B",true,"^F",2,"^C",["^>",[["~$x"],["~$x","~$y"]]],"^=",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^2:"]]],"^E",["^>",[null,null,null]]]],"^@","~$cljs.core/max","^B",true,"^1","cljs/core.cljs","^2",18,"^M",["^ ","^B",true,"^F",2,"^C",["^>",[["~$x"],["~$x","~$y"]]],"^=",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^2:"]]],"^E",["^>",[null,null,null]]],"^C",["^>",[["~$x"],["~$x","~$y"]]],"^D",null,"^E",["^>",[null,null,null]],"^3",1,"^5",2662,"^1B","^27","^6",2662,"^F",2,"^7","^27","^G",true,"^=",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^2:"]]],"^9","Returns the greatest of the nums."],"~$->Repeat",["^ ","^;",null,"^<",["^ ","^16",["^17",["^18","^19","~$cljs.core/ICollection","^1:","~$cljs.core/IPending","~$cljs.core/IEmptyableCollection","~$cljs.core/ISeq","~$cljs.core/INext","~$cljs.core/ISeqable","~$cljs.core/IMeta","~$cljs.core/ISequential","~$cljs.core/IWithMeta","~$cljs.core/IReduce"]],"^1","cljs/core.cljs","^2",16,"^3",10,"~:factory","~:positional","^5",4861,"^6",4861,"^=",["^>",["^?",["^>",[["^Y","~$count","~$val","~$next","^10"]]]]],"^1?",["^17",["^18","^19","^2=","^2>","^2?","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^9","Positional factory function for cljs.core/Repeat."],"^16",["^17",["^18","^19","^2=","^1:","^2>","^2?","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^@","~$cljs.core/->Repeat","^B",false,"^1","cljs/core.cljs","^2",16,"^C",["^>",[["^Y","^2I","^2J","^2K","^10"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",4861,"^6",4861,"^F",5,"^G",true,"^=",["^>",["^?",["^>",[["^Y","^2I","^2J","^2K","^10"]]]]],"^1?",["^17",["^18","^19","^2=","^2>","^2?","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^9","Positional factory function for cljs.core/Repeat."],"~$IComparable",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",816,"^3",14,"^6",816,"^2",25,"^9","Protocol for values that can be compared.","~:protocol-symbol",true,"~:jsdoc",["^>",["@interface"]],"~:protocol-info",["^ ","~:methods",["^ ","~$-compare",[["~$x","~$y"]]]]],"^2N",true,"^@","~$cljs.core/IComparable","^1","cljs/core.cljs","^2",25,"^3",1,"^5",816,"^2P",["^ ","^2Q",["^ ","^2R",[["~$x","~$y"]]]],"~:info",null,"^6",816,"^7","~$any","~:impls",["^17",["~$js/Date","~$cljs.core/Keyword","~$cljs.core/BlackNode","~$cljs.core/MapEntry","~$cljs.core/Subvec","~$cljs.core/PersistentVector","~$cljs.core/Symbol","~$cljs.core/UUID","~$cljs.core/RedNode"]],"^9","Protocol for values that can be compared.","^2O",["^>",["@interface"]]],"~$==",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2899,"^3",16,"^6",2899,"^2",18,"^7","^8","^=",["^>",["^?",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^2:"]]]]],"^9","Returns non-nil if nums all have the equivalent\n  value, otherwise false. Behavior on non nums is\n  undefined.","^M",["^ ","^B",true,"^F",2,"^C",["^>",[["~$x"],["~$x","~$y"]]],"^=",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^2:"]]],"^E",["^>",[null,null,null]]]],"^@","~$cljs.core/==","^B",true,"^1","cljs/core.cljs","^2",18,"^M",["^ ","^B",true,"^F",2,"^C",["^>",[["~$x"],["~$x","~$y"]]],"^=",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^2:"]]],"^E",["^>",[null,null,null]]],"^C",["^>",[["~$x"],["~$x","~$y"]]],"^D",null,"^E",["^>",[null,null,null]],"^3",1,"^5",2899,"^1B","^8","^6",2899,"^F",2,"^7","^8","^G",true,"^=",["^>",[["~$x"],["~$x","~$y"],["~$x","~$y","~$&","^2:"]]],"^9","Returns non-nil if nums all have the equivalent\n  value, otherwise false. Behavior on non nums is\n  undefined."],"~$parents",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10694,"^3",7,"^6",10694,"^2",14,"^=",["^>",["^?",["^>",[["~$tag"],["~$h","^37"]]]]],"^9","Returns the immediate parents of tag, either via a JavaScript type\n  inheritance relationship or a relationship established via derive. h\n  must be a hierarchy obtained from make-hierarchy, if not supplied\n  defaults to the global hierarchy","^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^37"],["~$h","^37"]]],"^=",["^>",[["^37"],["~$h","^37"]]],"^E",["^>",[null,null]]]],"^@","~$cljs.core/parents","^B",false,"^1","cljs/core.cljs","^2",14,"^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^37"],["~$h","^37"]]],"^=",["^>",[["^37"],["~$h","^37"]]],"^E",["^>",[null,null]]],"^C",["^>",[["^37"],["~$h","^37"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",10694,"^6",10694,"^F",2,"^G",true,"^=",["^>",[["^37"],["~$h","^37"]]],"^9","Returns the immediate parents of tag, either via a JavaScript type\n  inheritance relationship or a relationship established via derive. h\n  must be a hierarchy obtained from make-hierarchy, if not supplied\n  defaults to the global hierarchy"],"^2I",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1800,"^3",7,"^6",1800,"^2",12,"^=",["^>",["^?",["^>",[["~$coll"]]]]],"^9","Returns the number of items in the collection. (count nil) returns\n  0.  Also works on strings, arrays, and Maps"],"^@","~$cljs.core/count","^B",false,"^1","cljs/core.cljs","^2",12,"^C",["^>",[["^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1800,"^6",1800,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Returns the number of items in the collection. (count nil) returns\n  0.  Also works on strings, arrays, and Maps"],"~$-disjoin!",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",813,"^3",9,"^6",813,"^2",18,"^7","~$clj","~:protocol","~$cljs.core/ITransientSet","^9","Returns tcoll without v.","^=",["^>",["^?",["^>",[["~$tcoll","~$v"]]]]]],"^3=","^3>","^@","~$cljs.core/-disjoin!","^B",false,"^1","cljs/core.cljs","^2",18,"^C",["^>",[["^3?","~$v"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",811,"^1B","^3<","^6",813,"^F",2,"^7","^3<","^G",true,"^=",["^>",["^?",["^>",[["^3?","~$v"]]]]],"^9","Returns tcoll without v."],"~$*loaded-libs*",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",174,"^3",3,"^6",174,"^2",16,"^4",true,"^2O",["@type {*}"]],"^@","~$cljs.core/*loaded-libs*","^1","cljs/core.cljs","^2",16,"^3",1,"^4",true,"^5",171,"^6",174,"^7","~$clj-nil","^2O",["@type {*}"]],"~$EMPTY",["^ ","^@","~$cljs.core/EMPTY","^1","cljs/core.cljs","^5",4068,"^3",1,"^6",4068,"^2",21,"^P",true,"^<",["^ ","^1","cljs/core.cljs","^5",4068,"^3",16,"^6",4068,"^2",21,"^P",true],"^7","~$cljs.core/Empty"],"~$->TransientHashMap",["^ ","^;",null,"^<",["^ ","^16",["^17",["~$cljs.core/IFn","~$cljs.core/ITransientMap","^1:","~$cljs.core/ICounted","~$cljs.core/ITransientCollection","~$cljs.core/ITransientAssociative","~$cljs.core/ILookup"]],"^1","cljs/core.cljs","^2",26,"^3",10,"^2G","^2H","^5",7942,"^6",7942,"^=",["^>",["^?",["^>",[["~$edit","~$root","^2I","~$has-nil?","~$nil-val"]]]]],"^1?",["^17",["^3H","^3I","^3J","^3K","^3L","^3M"]],"^9","Positional factory function for cljs.core/TransientHashMap."],"^16",["^17",["^3H","^3I","^1:","^3J","^3K","^3L","^3M"]],"^@","~$cljs.core/->TransientHashMap","^B",false,"^1","cljs/core.cljs","^2",26,"^C",["^>",[["^3N","^3O","^2I","^3P","^3Q"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",7942,"^6",7942,"^F",5,"^G",true,"^=",["^>",["^?",["^>",[["^3N","^3O","^2I","^3P","^3Q"]]]]],"^1?",["^17",["^3H","^3I","^3J","^3K","^3L","^3M"]],"^9","Positional factory function for cljs.core/TransientHashMap."],"~$array-index-of-symbol?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",6496,"^3",8,"^6",6496,"^2",30,"^P",true,"^=",["^>",["^?",["^>",[["~$arr","~$k"]]]]]],"^P",true,"^@","~$cljs.core/array-index-of-symbol?","^B",false,"^1","cljs/core.cljs","^2",30,"^C",["^>",[["^3T","~$k"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",6496,"^6",6496,"^F",2,"^G",true,"^=",["^>",["^?",["^>",[["^3T","~$k"]]]]]],"~$ArrayChunk",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",3462,"^3",10,"^6",3462,"^2",20,"~:declared",true],"^15",3,"^16",["^17",["~$cljs.core/IIndexed","^3J","~$cljs.core/IChunk","^2F"]],"^@","~$cljs.core/ArrayChunk","^1","cljs/core.cljs","^2",20,"^1<",true,"^3",10,"^5",3481,"^1=",false,"^3W",true,"^6",3481,"^7","^1>","^1?",["^17",["^3X","^3J","^2F"]]],"~$sorted-map-by",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",8828,"^3",7,"^6",8828,"^2",20,"^=",["^>",["^?",["^>",[["~$comparator","~$&","~$keyvals"]]]]],"^9","keyval => key val\n  Returns a new sorted map with supplied mappings, using the supplied comparator.","^M",["^ ","^B",true,"^F",1,"^C",[["^>",["^40","^41"]]],"^=",["^>",[["^40","~$&","^41"]]],"^E",["^>",[null]]]],"^@","~$cljs.core/sorted-map-by","^B",true,"^1","cljs/core.cljs","^2",20,"^M",["^ ","^B",true,"^F",1,"^C",[["^>",["^40","^41"]]],"^=",["^>",[["^40","~$&","^41"]]],"^E",["^>",[null]]],"^C",[["^>",["^40","^41"]]],"^D",null,"^E",["^>",[null]],"^3",1,"^5",8828,"^6",8828,"^F",1,"^G",true,"^=",["^>",[["^40","~$&","^41"]]],"^9","keyval => key val\n  Returns a new sorted map with supplied mappings, using the supplied comparator."],"~$apply",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3883,"^3",7,"^6",3883,"^2",12,"^=",["^>",["^?",["^>",[["~$f","~$args"],["~$f","~$x","^44"],["~$f","~$x","~$y","^44"],["~$f","~$x","~$y","~$z","^44"],["~$f","~$a","~$b","~$c","~$d","~$&","^44"]]]]],"^9","Applies fn f to the argument list formed by prepending intervening arguments to args.","^M",["^ ","^B",true,"^F",5,"^C",["^>",[["~$f","^44"],["~$f","~$x","^44"],["~$f","~$x","~$y","^44"],["~$f","~$x","~$y","~$z","^44"]]],"^=",["^>",[["~$f","^44"],["~$f","~$x","^44"],["~$f","~$x","~$y","^44"],["~$f","~$x","~$y","~$z","^44"],["~$f","~$a","~$b","~$c","~$d","~$&","^44"]]],"^E",["^>",[null,null,null,null,null]]]],"^@","~$cljs.core/apply","^B",true,"^1","cljs/core.cljs","^2",12,"^M",["^ ","^B",true,"^F",5,"^C",["^>",[["~$f","^44"],["~$f","~$x","^44"],["~$f","~$x","~$y","^44"],["~$f","~$x","~$y","~$z","^44"]]],"^=",["^>",[["~$f","^44"],["~$f","~$x","^44"],["~$f","~$x","~$y","^44"],["~$f","~$x","~$y","~$z","^44"],["~$f","~$a","~$b","~$c","~$d","~$&","^44"]]],"^E",["^>",[null,null,null,null,null]]],"^C",["^>",[["~$f","^44"],["~$f","~$x","^44"],["~$f","~$x","~$y","^44"],["~$f","~$x","~$y","~$z","^44"]]],"^D",null,"^E",["^>",[null,null,null,null,null]],"^3",1,"^5",3883,"^6",3883,"^F",5,"^G",true,"^=",["^>",[["~$f","^44"],["~$f","~$x","^44"],["~$f","~$x","~$y","^44"],["~$f","~$x","~$y","~$z","^44"],["~$f","~$a","~$b","~$c","~$d","~$&","^44"]]],"^9","Applies fn f to the argument list formed by prepending intervening arguments to args."],"~$get-global-hierarchy",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10666,"^3",8,"^6",10666,"^2",28,"^P",true,"^=",["^>",["^?",["^>",[[]]]]]],"^P",true,"^@","~$cljs.core/get-global-hierarchy","^B",false,"^1","cljs/core.cljs","^2",28,"^C",["^>",[[]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",10666,"^6",10666,"^F",0,"^G",true,"^=",["^>",["^?",["^>",[[]]]]]],"~$add-to-string-hash-cache",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",970,"^3",7,"^6",970,"^2",31,"^=",["^>",["^?",["^>",[["~$k"]]]]]],"^@","~$cljs.core/add-to-string-hash-cache","^B",false,"^1","cljs/core.cljs","^2",31,"^C",["^>",[["~$k"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",970,"^6",970,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$k"]]]]]],"~$clj->js",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10533,"^3",7,"^6",10533,"^2",14,"^=",["^>",["^?",["^>",[["~$x","~$&",["^ ","~:keys",["~$keyword-fn"],"~:or",["^ ","^4<","^20"],"~:as","~$options"]]]]]],"^9","Recursively transforms ClojureScript values to JavaScript.\n  sets/vectors/lists become Arrays, Keywords and Symbol become Strings,\n  Maps become Objects. Arbitrary keys are encoded to by `key->js`.\n  Options is a key-value pair, where the only valid key is\n  :keyword-fn, which should point to a single-argument function to be\n  called on keyword keys. Default to `name`.","^M",["^ ","^B",true,"^F",1,"^C",[["^>",["~$x",["^ ","^4;",["^4<"],"^4=",["^ ","^4<","^20"],"^4>","^4?"]]]],"^=",["^>",[["~$x","~$&",["^ ","^4;",["^4<"],"^4=",["^ ","^4<","^20"],"^4>","^4?"]]]],"^E",["^>",[null]]]],"^@","~$cljs.core/clj->js","^B",true,"^1","cljs/core.cljs","^2",14,"^M",["^ ","^B",true,"^F",1,"^C",[["^>",["~$x",["^ ","^4;",["^4<"],"^4=",["^ ","^4<","^20"],"^4>","^4?"]]]],"^=",["^>",[["~$x","~$&",["^ ","^4;",["^4<"],"^4=",["^ ","^4<","^20"],"^4>","^4?"]]]],"^E",["^>",[null]]],"^C",[["^>",["~$x",["^ ","^4;",["^4<"],"^4=",["^ ","^4<","^20"],"^4>","^4?"]]]],"^D",null,"^E",["^>",[null]],"^3",1,"^5",10533,"^6",10533,"^F",1,"^G",true,"^=",["^>",[["~$x","~$&",["^ ","^4;",["^4<"],"^4=",["^ ","^4<","^20"],"^4>","^4?"]]]],"^9","Recursively transforms ClojureScript values to JavaScript.\n  sets/vectors/lists become Arrays, Keywords and Symbol become Strings,\n  Maps become Objects. Arbitrary keys are encoded to by `key->js`.\n  Options is a key-value pair, where the only valid key is\n  :keyword-fn, which should point to a single-argument function to be\n  called on keyword keys. Default to `name`."],"~$TransientArrayMap",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",6553,"^3",10,"^6",6553,"^2",27,"^3W",true],"^15",3,"^16",["^17",["^3H","^3I","^3J","^3K","^3L","^3M"]],"^@","~$cljs.core/TransientArrayMap","^1","cljs/core.cljs","^2",27,"^1<",true,"^3",10,"^5",6953,"^1=",false,"^3W",true,"^6",6953,"^7","^1>","^1?",["^17",["^3H","^3I","^3J","^3K","^3L","^3M"]]],"~$->TransientVector",["^ ","^;",null,"^<",["^ ","^16",["^17",["^3X","^3H","^3J","^3K","~$cljs.core/ITransientVector","^3L","^3M"]],"^1","cljs/core.cljs","^2",25,"^3",10,"^2G","^2H","^5",5973,"^6",5973,"^=",["^>",["^?",["^>",[["~$cnt","~$shift","^3O","~$tail"]]]]],"^1?",["^17",["^3X","^3H","^3J","^3K","^4D","^3L","^3M"]],"^9","Positional factory function for cljs.core/TransientVector."],"^16",["^17",["^3X","^3H","^3J","^3K","^4D","^3L","^3M"]],"^@","~$cljs.core/->TransientVector","^B",false,"^1","cljs/core.cljs","^2",25,"^C",["^>",[["^4E","^4F","^3O","^4G"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",5973,"^6",5973,"^F",4,"^G",true,"^=",["^>",["^?",["^>",[["^4E","^4F","^3O","^4G"]]]]],"^1?",["^17",["^3X","^3H","^3J","^3K","^4D","^3L","^3M"]],"^9","Positional factory function for cljs.core/TransientVector."],"~$IChunkedNext",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",834,"^3",14,"^6",834,"^2",26,"^9","Protocol for accessing the chunks of a collection.","^2N",true,"^2O",["^>",["@interface"]],"^2P",["^ ","^2Q",["^ ","~$-chunked-next",[["^39"]]]]],"^2N",true,"^@","~$cljs.core/IChunkedNext","^1","cljs/core.cljs","^2",26,"^3",1,"^5",834,"^2P",["^ ","^2Q",["^ ","^4J",[["^39"]]]],"^2T",null,"^6",834,"^7","^2U","^2V",["^17",["~$cljs.core/ChunkedSeq","~$cljs.core/ChunkedCons"]],"^9","Protocol for accessing the chunks of a collection.","^2O",["^>",["@interface"]]],"~$interpose",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",5053,"^3",7,"^6",5053,"^2",16,"^=",["^>",["^?",["^>",[["~$sep"],["^4O","^39"]]]]],"^9","Returns a lazy seq of the elements of coll separated by sep.\n  Returns a stateful transducer when no collection is provided.","^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^4O"],["^4O","^39"]]],"^=",["^>",[["^4O"],["^4O","^39"]]],"^E",["^>",[null,null]]]],"^@","~$cljs.core/interpose","^B",false,"^1","cljs/core.cljs","^2",16,"^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^4O"],["^4O","^39"]]],"^=",["^>",[["^4O"],["^4O","^39"]]],"^E",["^>",[null,null]]],"^C",["^>",[["^4O"],["^4O","^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",5053,"^6",5053,"^F",2,"^G",true,"^=",["^>",[["^4O"],["^4O","^39"]]],"^9","Returns a lazy seq of the elements of coll separated by sep.\n  Returns a stateful transducer when no collection is provided."],"~$TransformerIterator",["^ ","^15",6,"^16",["^17",["^1:"]],"^@","~$cljs.core/TransformerIterator","^1","cljs/core.cljs","^2",29,"^1<",true,"^3",10,"^5",4097,"^1=",false,"^6",4097,"^7","^1>","^1?",null],"~$->BlackNode",["^ ","^;",null,"^<",["^ ","^16",["^17",["^3X","~$cljs.core/IVector","~$cljs.core/IReversible","^18","^19","^3H","^2=","^1:","~$cljs.core/IFind","^2?","^3J","^2B","^2C","~$cljs.core/IStack","~$cljs.core/IMapEntry","^2D","^2E","~$cljs.core/IAssociative","^3M","^2F"]],"^1","cljs/core.cljs","^2",19,"^3",10,"^2G","^2H","^5",8238,"^6",8238,"^=",["^>",["^?",["^>",[["~$key","^2J","~$left","~$right","^10"]]]]],"^1?",["^17",["^3X","^4T","^4U","^18","^19","^3H","^2=","^2?","^3J","^2B","^2C","^4W","^4X","^2D","^2E","^4Y","^3M","^2F"]],"^9","Positional factory function for cljs.core/BlackNode."],"^16",["^17",["^3X","^4T","^4U","^18","^19","^3H","^2=","^1:","^4V","^2?","^3J","^2B","^2C","^4W","^4X","^2D","^2E","^4Y","^3M","^2F"]],"^@","~$cljs.core/->BlackNode","^B",false,"^1","cljs/core.cljs","^2",19,"^C",["^>",[["^4Z","^2J","^4[","^50","^10"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",8238,"^6",8238,"^F",5,"^G",true,"^=",["^>",["^?",["^>",[["^4Z","^2J","^4[","^50","^10"]]]]],"^1?",["^17",["^3X","^4T","^4U","^18","^19","^3H","^2=","^2?","^3J","^2B","^2C","^4W","^4X","^2D","^2E","^4Y","^3M","^2F"]],"^9","Positional factory function for cljs.core/BlackNode."],"~$deref",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1443,"^3",7,"^6",1443,"^2",12,"^=",["^>",["^?",["^>",[["~$o"]]]]],"^9","Also reader macro: @var/@atom/@delay. Returns the\n   most-recently-committed value of ref. When applied to a var\n   or atom, returns its current state. When applied to a delay, forces\n   it if not already forced. See also - realized?."],"^@","~$cljs.core/deref","^B",false,"^1","cljs/core.cljs","^2",12,"^C",["^>",[["~$o"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1443,"^6",1443,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$o"]]]]],"^9","Also reader macro: @var/@atom/@delay. Returns the\n   most-recently-committed value of ref. When applied to a var\n   or atom, returns its current state. When applied to a delay, forces\n   it if not already forced. See also - realized?."],"~$pv-aget",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",5300,"^3",8,"^6",5300,"^2",15,"^P",true,"^=",["^>",["^?",["^>",[["~$node","~$idx"]]]]]],"^P",true,"^@","~$cljs.core/pv-aget","^B",false,"^1","cljs/core.cljs","^2",15,"^C",["^>",[["^55","^56"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",5300,"^6",5300,"^F",2,"^G",true,"^=",["^>",["^?",["^>",[["^55","^56"]]]]]],"~$assoc",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1961,"^3",7,"^6",1961,"^2",12,"^=",["^>",["^?",["^>",[["^39","~$k","~$v"],["^39","~$k","~$v","~$&","~$kvs"]]]]],"^9","assoc[iate]. When applied to a map, returns a new map of the\n   same (hashed/sorted) type, that contains the mapping of key(s) to\n   val(s). When applied to a vector, returns a new vector that\n   contains val at index.","^M",["^ ","^B",true,"^F",3,"^C",["^>",[["^39","~$k","~$v"]]],"^=",["^>",[["^39","~$k","~$v"],["^39","~$k","~$v","~$&","^59"]]],"^E",["^>",[null,null]]]],"^@","~$cljs.core/assoc","^B",true,"^1","cljs/core.cljs","^2",12,"^M",["^ ","^B",true,"^F",3,"^C",["^>",[["^39","~$k","~$v"]]],"^=",["^>",[["^39","~$k","~$v"],["^39","~$k","~$v","~$&","^59"]]],"^E",["^>",[null,null]]],"^C",["^>",[["^39","~$k","~$v"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1961,"^6",1961,"^F",3,"^G",true,"^=",["^>",[["^39","~$k","~$v"],["^39","~$k","~$v","~$&","^59"]]],"^9","assoc[iate]. When applied to a map, returns a new map of the\n   same (hashed/sorted) type, that contains the mapping of key(s) to\n   val(s). When applied to a vector, returns a new vector that\n   contains val at index."],"~$transient",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3777,"^3",7,"^6",3777,"^2",16,"^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Returns a new, transient version of the collection, in constant time."],"^@","~$cljs.core/transient","^B",false,"^1","cljs/core.cljs","^2",16,"^C",["^>",[["^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3777,"^6",3777,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Returns a new, transient version of the collection, in constant time."],"~$-disjoin",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",653,"^3",9,"^6",653,"^2",17,"^7","^3<","^3=","~$cljs.core/ISet","^9","Returns a new collection of coll that does not contain v.","^=",["^>",["^?",["^>",[["^39","~$v"]]]]]],"^3=","^5>","^@","~$cljs.core/-disjoin","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["^39","~$v"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",651,"^1B","^3<","^6",653,"^F",2,"^7","^3<","^G",true,"^=",["^>",["^?",["^>",[["^39","~$v"]]]]],"^9","Returns a new collection of coll that does not contain v."],"~$chunk-cons",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3585,"^3",7,"^6",3585,"^2",17,"^=",["^>",["^?",["^>",[["~$chunk","~$rest"]]]]]],"^@","~$cljs.core/chunk-cons","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["^5A","^5B"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3585,"^6",3585,"^F",2,"^G",true,"^=",["^>",["^?",["^>",[["^5A","^5B"]]]]]],"~$ArrayIter",["^ ","^15",2,"^16",["^17",["^1:"]],"^@","~$cljs.core/ArrayIter","^1","cljs/core.cljs","^2",19,"^1<",true,"^3",10,"^5",3979,"^1=",false,"^6",3979,"^7","^1>","^1?",null],"^40",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",11185,"^3",7,"^6",11185,"^2",17,"^=",["^>",["^?",["^>",[["~$pred"]]]]],"^9","Returns an JavaScript compatible comparator based upon pred."],"^@","~$cljs.core/comparator","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["^5F"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",11185,"^6",11185,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^5F"]]]]],"^9","Returns an JavaScript compatible comparator based upon pred."],"~$print-prefix-map",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10126,"^3",7,"^6",10126,"^2",23,"^=",["^>",["^?",["^>",[["~$prefix","~$m","~$print-one","~$writer","~$opts"]]]]]],"^@","~$cljs.core/print-prefix-map","^B",false,"^1","cljs/core.cljs","^2",23,"^C",["^>",[["^5I","~$m","^5J","^5K","^5L"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",10126,"^6",10126,"^F",5,"^G",true,"^=",["^>",["^?",["^>",[["^5I","~$m","^5J","^5K","^5L"]]]]]],"~$sorted-map",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",8819,"^3",7,"^6",8819,"^2",17,"^=",["^>",["^?",["^>",[["~$&","^41"]]]]],"^9","keyval => key val\n  Returns a new sorted map with supplied mappings.","^M",["^ ","^B",true,"^F",0,"^C",[["^>",["^41"]]],"^=",["^>",[["~$&","^41"]]],"^E",["^>",[null]]]],"^@","~$cljs.core/sorted-map","^B",true,"^1","cljs/core.cljs","^2",17,"^M",["^ ","^B",true,"^F",0,"^C",[["^>",["^41"]]],"^=",["^>",[["~$&","^41"]]],"^E",["^>",[null]]],"^C",[["^>",["^41"]]],"^D",null,"^E",["^>",[null]],"^3",1,"^5",8819,"^6",8819,"^F",0,"^G",true,"^=",["^>",[["~$&","^41"]]],"^9","keyval => key val\n  Returns a new sorted map with supplied mappings."],"~$drop-while",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4767,"^3",7,"^6",4767,"^2",17,"^=",["^>",["^?",["^>",[["^5F"],["^5F","^39"]]]]],"^9","Returns a lazy sequence of the items in coll starting from the\n  first item for which (pred item) returns logical false.  Returns a\n  stateful transducer when no collection is provided.","^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^5F"],["^5F","^39"]]],"^=",["^>",[["^5F"],["^5F","^39"]]],"^E",["^>",[null,null]]]],"^@","~$cljs.core/drop-while","^B",false,"^1","cljs/core.cljs","^2",17,"^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^5F"],["^5F","^39"]]],"^=",["^>",[["^5F"],["^5F","^39"]]],"^E",["^>",[null,null]]],"^C",["^>",[["^5F"],["^5F","^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",4767,"^6",4767,"^F",2,"^G",true,"^=",["^>",[["^5F"],["^5F","^39"]]],"^9","Returns a lazy sequence of the items in coll starting from the\n  first item for which (pred item) returns logical false.  Returns a\n  stateful transducer when no collection is provided."],"~$IWriter",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",750,"^3",14,"^6",750,"^2",21,"^9","Protocol for writing. Currently only implemented by StringBufferWriter.","^2N",true,"^2O",["^>",["@interface"]],"^2P",["^ ","^2Q",["^ ","~$-write",[["^5K","~$s"]],"~$-flush",[["^5K"]]]]],"^2N",true,"^@","~$cljs.core/IWriter","^1","cljs/core.cljs","^2",21,"^3",1,"^5",750,"^2P",["^ ","^2Q",["^ ","^5S",[["^5K","~$s"]],"^5T",[["^5K"]]]],"^2T",null,"^6",750,"^7","^2U","^2V",["^17",["~$cljs.core/StringBufferWriter"]],"^9","Protocol for writing. Currently only implemented by StringBufferWriter.","^2O",["^>",["@interface"]]],"~$KeySeq",["^ ","^15",2,"^16",["^17",["^18","^19","^2=","^1:","^2?","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^@","~$cljs.core/KeySeq","^1","cljs/core.cljs","^2",16,"^1<",true,"^3",10,"^5",8838,"^1=",false,"^6",8838,"^7","^1>","^1?",["^17",["^18","^19","^2=","^2?","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]]],"~$realized?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10394,"^3",16,"^6",10394,"^2",25,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if a value has been produced for a delay or lazy sequence."],"^@","~$cljs.core/realized?","^B",false,"^1","cljs/core.cljs","^2",25,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",10394,"^1B","^8","^6",10394,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if a value has been produced for a delay or lazy sequence."],"~$*print-fn*",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",69,"^3",3,"^6",69,"^2",13,"^9","Each runtime environment provides a different way to print output.\n  Whatever function *print-fn* is bound to will be passed any\n  Strings which should be printed.","^4",true],"^@","~$cljs.core/*print-fn*","^1","cljs/core.cljs","^2",13,"^3",1,"^4",true,"^5",65,"^6",69,"^7","^3C","^9","Each runtime environment provides a different way to print output.\n  Whatever function *print-fn* is bound to will be passed any\n  Strings which should be printed."],"~$compare",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2356,"^3",15,"^6",2356,"^2",22,"^7","^27","^=",["^>",["^?",["^>",[["~$x","~$y"]]]]],"^9","Comparator. Returns a negative number, zero, or a positive number\n  when x is logically 'less than', 'equal to', or 'greater than'\n  y. Uses IComparable if available and google.array.defaultCompare for objects\n of the same type and special-cases nil to be less than any other object."],"^@","~$cljs.core/compare","^B",false,"^1","cljs/core.cljs","^2",22,"^C",["^>",[["~$x","~$y"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2356,"^1B","^27","^6",2356,"^F",2,"^7","^27","^G",true,"^=",["^>",["^?",["^>",[["~$x","~$y"]]]]],"^9","Comparator. Returns a negative number, zero, or a positive number\n  when x is logically 'less than', 'equal to', or 'greater than'\n  y. Uses IComparable if available and google.array.defaultCompare for objects\n of the same type and special-cases nil to be less than any other object."],"~$complement",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4216,"^3",7,"^6",4216,"^2",17,"^=",["^>",["^?",["^>",[["~$f"]]]]],"^9","Takes a fn f and returns a fn that takes the same arguments as f,\n  has the same effects, if any, and returns the opposite truth value."],"^@","~$cljs.core/complement","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["~$f"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",4216,"^6",4216,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$f"]]]]],"^9","Takes a fn f and returns a fn that takes the same arguments as f,\n  has the same effects, if any, and returns the opposite truth value."],"~$lookup-sentinel",["^ ","^@","~$cljs.core/lookup-sentinel","^1","cljs/core.cljs","^5",2193,"^3",1,"^6",2193,"^2",31,"^P",true,"^<",["^ ","^1","cljs/core.cljs","^5",2193,"^3",16,"^6",2193,"^2",31,"^P",true],"^7","~$object"],"~$-assoc!",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",795,"^3",9,"^6",795,"^2",16,"^7","^3<","^3=","^3L","^9","Returns a new transient collection of tcoll with a mapping from key to\n     val added to it.","^=",["^>",["^?",["^>",[["^3?","^4Z","^2J"]]]]]],"^3=","^3L","^@","~$cljs.core/-assoc!","^B",false,"^1","cljs/core.cljs","^2",16,"^C",["^>",[["^3?","^4Z","^2J"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",793,"^1B","^3<","^6",795,"^F",3,"^7","^3<","^G",true,"^=",["^>",["^?",["^>",[["^3?","^4Z","^2J"]]]]],"^9","Returns a new transient collection of tcoll with a mapping from key to\n     val added to it."],"~$*print-dup*",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",130,"^3",3,"^6",130,"^2",14,"^4",true,"^9","When set to logical true, objects will be printed in a way that preserves\n  their type when read in later.\n\n  Defaults to false."],"^@","~$cljs.core/*print-dup*","^1","cljs/core.cljs","^2",14,"^3",1,"^4",true,"^5",124,"^6",130,"^7","^8","^9","When set to logical true, objects will be printed in a way that preserves\n  their type when read in later.\n\n  Defaults to false."],"~$string-iter",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3976,"^3",7,"^6",3976,"^2",18,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"^@","~$cljs.core/string-iter","^B",false,"^1","cljs/core.cljs","^2",18,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3976,"^6",3976,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$-key->js",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10517,"^3",4,"^6",10517,"^2",12,"^3=","~$cljs.core/IEncodeJS","^9","Transforms map keys to valid JavaScript keys. Arbitrary keys are\n  encoded to their string representation via (pr-str x)","^=",["^>",["^?",["^>",[["~$x"]]]]]],"^3=","^6?","^@","~$cljs.core/-key->js","^B",false,"^1","cljs/core.cljs","^2",12,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",10515,"^6",10517,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Transforms map keys to valid JavaScript keys. Arbitrary keys are\n  encoded to their string representation via (pr-str x)"],"~$IDeref",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",671,"^3",14,"^6",671,"^2",20,"^9","Protocol for adding dereference functionality to a reference.","^2N",true,"^2O",["^>",["@interface"]],"^2P",["^ ","^2Q",["^ ","~$-deref",[["~$o"]]]]],"^2N",true,"^@","~$cljs.core/IDeref","^1","cljs/core.cljs","^2",20,"^3",1,"^5",671,"^2P",["^ ","^2Q",["^ ","^6B",[["~$o"]]]],"^2T",null,"^6",671,"^7","^2U","^2V",["^17",["~$cljs.core/Reduced","~$cljs.core/Volatile","~$cljs.core/Delay","~$cljs.core/Var","~$cljs.core/Atom"]],"^9","Protocol for adding dereference functionality to a reference.","^2O",["^>",["@interface"]]],"~$sequence",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4156,"^3",7,"^6",4156,"^2",15,"^=",["^>",["^?",["^>",[["^39"],["~$xform","^39"],["^6J","^39","~$&","~$colls"]]]]],"^9","Coerces coll to a (possibly empty) sequence, if it is not already\n  one. Will not force a lazy seq. (sequence nil) yields (), When a\n  transducer is supplied, returns a lazy sequence of applications of\n  the transform to the items in coll(s), i.e. to the set of first\n  items of each coll, followed by the set of second\n  items in each coll, until any one of the colls is exhausted.  Any\n  remaining items in other colls are ignored. The transform should accept\n  number-of-colls arguments","^M",["^ ","^B",true,"^F",2,"^C",["^>",[["^39"],["^6J","^39"]]],"^=",["^>",[["^39"],["^6J","^39"],["^6J","^39","~$&","^6K"]]],"^E",["^>",[null,null,null]]]],"^@","~$cljs.core/sequence","^B",true,"^1","cljs/core.cljs","^2",15,"^M",["^ ","^B",true,"^F",2,"^C",["^>",[["^39"],["^6J","^39"]]],"^=",["^>",[["^39"],["^6J","^39"],["^6J","^39","~$&","^6K"]]],"^E",["^>",[null,null,null]]],"^C",["^>",[["^39"],["^6J","^39"]]],"^D",null,"^E",["^>",[null,null,null]],"^3",1,"^5",4156,"^6",4156,"^F",2,"^G",true,"^=",["^>",[["^39"],["^6J","^39"],["^6J","^39","~$&","^6K"]]],"^9","Coerces coll to a (possibly empty) sequence, if it is not already\n  one. Will not force a lazy seq. (sequence nil) yields (), When a\n  transducer is supplied, returns a lazy sequence of applications of\n  the transform to the items in coll(s), i.e. to the set of first\n  items of each coll, followed by the set of second\n  items in each coll, until any one of the colls is exhausted.  Any\n  remaining items in other colls are ignored. The transform should accept\n  number-of-colls arguments"],"~$constantly",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4226,"^3",7,"^6",4226,"^2",17,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns a function that takes any number of arguments and returns x."],"^@","~$cljs.core/constantly","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",4226,"^6",4226,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns a function that takes any number of arguments and returns x."],"~$->RangedIterator",["^ ","^;",null,"^<",["^ ","^16",["^17",["^1:"]],"^1","cljs/core.cljs","^2",24,"^3",10,"^2G","^2H","^5",5392,"^6",5392,"^=",["^>",["^?",["^>",[["~$i","~$base","^3T","~$v","^Z","^["]]]]],"^1?",null,"^9","Positional factory function for cljs.core/RangedIterator."],"^16",["^17",["^1:"]],"^@","~$cljs.core/->RangedIterator","^B",false,"^1","cljs/core.cljs","^2",24,"^C",["^>",[["~$i","^6P","^3T","~$v","^Z","^["]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",5392,"^6",5392,"^F",6,"^G",true,"^=",["^>",["^?",["^>",[["~$i","^6P","^3T","~$v","^Z","^["]]]]],"^1?",null,"^9","Positional factory function for cljs.core/RangedIterator."],"~$chunked-seq",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",5751,"^3",7,"^6",5751,"^2",18,"^=",["^>",["^?",["^>",[["~$vec","~$i","~$off"],["^6S","^55","~$i","^6T"],["^6S","^55","~$i","^6T","^Y"]]]]],"^M",["^ ","^B",false,"^F",5,"^C",["^>",[["^6S","~$i","^6T"],["^6S","^55","~$i","^6T"],["^6S","^55","~$i","^6T","^Y"]]],"^=",["^>",[["^6S","~$i","^6T"],["^6S","^55","~$i","^6T"],["^6S","^55","~$i","^6T","^Y"]]],"^E",["^>",[null,null,null]]]],"^@","~$cljs.core/chunked-seq","^B",false,"^1","cljs/core.cljs","^2",18,"^M",["^ ","^B",false,"^F",5,"^C",["^>",[["^6S","~$i","^6T"],["^6S","^55","~$i","^6T"],["^6S","^55","~$i","^6T","^Y"]]],"^=",["^>",[["^6S","~$i","^6T"],["^6S","^55","~$i","^6T"],["^6S","^55","~$i","^6T","^Y"]]],"^E",["^>",[null,null,null]]],"^C",["^>",[["^6S","~$i","^6T"],["^6S","^55","~$i","^6T"],["^6S","^55","~$i","^6T","^Y"]]],"^D",null,"^E",["^>",[null,null,null]],"^3",1,"^5",5751,"^6",5751,"^F",5,"^G",true,"^=",["^>",[["^6S","~$i","^6T"],["^6S","^55","~$i","^6T"],["^6S","^55","~$i","^6T","^Y"]]]],"~$ISorted",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",733,"^3",14,"^6",733,"^2",21,"^9","Protocol for a collection which can represent their items\n  in a sorted manner. ","^2N",true,"^2O",["^>",["@interface"]],"^2P",["^ ","^2Q",["^ ","~$-sorted-seq",[["^39","~$ascending?"]],"~$-sorted-seq-from",[["^39","~$k","^6X"]],"~$-entry-key",[["^39","~$entry"]],"~$-comparator",[["^39"]]]]],"^2N",true,"^@","~$cljs.core/ISorted","^1","cljs/core.cljs","^2",21,"^3",1,"^5",733,"^2P",["^ ","^2Q",["^ ","^6W",[["^39","^6X"]],"^6Y",[["^39","~$k","^6X"]],"^6Z",[["^39","^6["]],"^70",[["^39"]]]],"^2T",null,"^6",733,"^7","^2U","^2V",["^17",["~$cljs.core/PersistentTreeMap","~$cljs.core/PersistentTreeSet"]],"^9","Protocol for a collection which can represent their items\n  in a sorted manner. ","^2O",["^>",["@interface"]]],"~$make-array",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",410,"^3",14,"^6",410,"^2",24,"^7","^1Y","^=",["^>",["^?",["^>",[["~$size"],["~$type","^75"],["^76","^75","~$&","~$more-sizes"]]]]],"^9","Construct a JavaScript array of the specified dimensions. Accepts ignored\n  type argument for compatibility with Clojure. Note that there is no efficient\n  way to allocate multi-dimensional arrays in JavaScript; as such, this function\n  will run in polynomial time when called with 3 or more arguments.","^M",["^ ","^B",true,"^F",2,"^C",["^>",[["^75"],["^76","^75"]]],"^=",["^>",[["^75"],["^76","^75"],["^76","^75","~$&","^77"]]],"^E",["^>",[null,null,null]]]],"^@","~$cljs.core/make-array","^B",true,"^1","cljs/core.cljs","^2",24,"^M",["^ ","^B",true,"^F",2,"^C",["^>",[["^75"],["^76","^75"]]],"^=",["^>",[["^75"],["^76","^75"],["^76","^75","~$&","^77"]]],"^E",["^>",[null,null,null]]],"^C",["^>",[["^75"],["^76","^75"]]],"^D",null,"^E",["^>",[null,null,null]],"^3",1,"^5",410,"^1B","^1Y","^6",410,"^F",2,"^7","^1Y","^G",true,"^=",["^>",[["^75"],["^76","^75"],["^76","^75","~$&","^77"]]],"^9","Construct a JavaScript array of the specified dimensions. Accepts ignored\n  type argument for compatibility with Clojure. Note that there is no efficient\n  way to allocate multi-dimensional arrays in JavaScript; as such, this function\n  will run in polynomial time when called with 3 or more arguments."],"~$checked-aget",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",452,"^3",8,"^6",452,"^2",20,"^P",true,"^=",["^>",["^?",["^>",[["^1Y","^56"],["^1Y","^56","~$&","~$idxs"]]]]],"^M",["^ ","^B",true,"^F",2,"^C",["^>",[["^1Y","^56"]]],"^=",["^>",[["^1Y","^56"],["^1Y","^56","~$&","^7:"]]],"^E",["^>",[null,null]]]],"^P",true,"^@","~$cljs.core/checked-aget","^B",true,"^1","cljs/core.cljs","^2",20,"^M",["^ ","^B",true,"^F",2,"^C",["^>",[["^1Y","^56"]]],"^=",["^>",[["^1Y","^56"],["^1Y","^56","~$&","^7:"]]],"^E",["^>",[null,null]]],"^C",["^>",[["^1Y","^56"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",452,"^6",452,"^F",2,"^G",true,"^=",["^>",[["^1Y","^56"],["^1Y","^56","~$&","^7:"]]]],"~$shorts",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2800,"^3",7,"^6",2800,"^2",13,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"^@","~$cljs.core/shorts","^B",false,"^1","cljs/core.cljs","^2",13,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2800,"^6",2800,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$*unchecked-if*",["^ ","^@","~$cljs.core/*unchecked-if*","^1","cljs/core.cljs","^5",26,"^3",1,"^6",26,"^2",20,"^<",["^ ","^1","cljs/core.cljs","^5",26,"^3",6,"^6",26,"^2",20],"^7","^8"],"~$->RSeq",["^ ","^;",null,"^<",["^ ","^16",["^17",["^18","^19","^2=","^1:","^2?","^3J","^2@","^2A","^2B","^2C","~$cljs.core/ICloneable","^2D","^2E","^2F"]],"^1","cljs/core.cljs","^2",14,"^3",10,"^2G","^2H","^5",1673,"^6",1673,"^=",["^>",["^?",["^>",[["~$ci","~$i","^Y"]]]]],"^1?",["^17",["^18","^19","^2=","^2?","^3J","^2@","^2A","^2B","^2C","^7A","^2D","^2E","^2F"]],"^9","Positional factory function for cljs.core/RSeq."],"^16",["^17",["^18","^19","^2=","^1:","^2?","^3J","^2@","^2A","^2B","^2C","^7A","^2D","^2E","^2F"]],"^@","~$cljs.core/->RSeq","^B",false,"^1","cljs/core.cljs","^2",14,"^C",["^>",[["^7B","~$i","^Y"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",1673,"^6",1673,"^F",3,"^G",true,"^=",["^>",["^?",["^>",[["^7B","~$i","^Y"]]]]],"^1?",["^17",["^18","^19","^2=","^2?","^3J","^2@","^2A","^2B","^2C","^7A","^2D","^2E","^2F"]],"^9","Positional factory function for cljs.core/RSeq."],"~$enable-console-print!",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",185,"^3",7,"^6",185,"^2",28,"^=",["^>",["^?",["^>",[[]]]]],"^9","Set *print-fn* to console.log"],"^@","~$cljs.core/enable-console-print!","^B",false,"^1","cljs/core.cljs","^2",28,"^C",["^>",[[]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",185,"^6",185,"^F",0,"^G",true,"^=",["^>",["^?",["^>",[[]]]]],"^9","Set *print-fn* to console.log"],"^5T",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",754,"^3",4,"^6",754,"^2",10,"^3=","^5U","^9","Flush writer.","^=",["^>",["^?",["^>",[["^5K"]]]]]],"^3=","^5U","^@","~$cljs.core/-flush","^B",false,"^1","cljs/core.cljs","^2",10,"^C",["^>",[["^5K"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",750,"^6",754,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^5K"]]]]],"^9","Flush writer."],"~$-lastIndexOf",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1542,"^3",8,"^6",1542,"^2",20,"^P",true,"^=",["^>",["^?",["^>",[["^39","~$x"],["^39","~$x","^Z"]]]]],"^M",["^ ","^B",false,"^F",3,"^C",["^>",[["^39","~$x"],["^39","~$x","^Z"]]],"^=",["^>",[["^39","~$x"],["^39","~$x","^Z"]]],"^E",["^>",[null,null]]]],"^P",true,"^@","~$cljs.core/-lastIndexOf","^B",false,"^1","cljs/core.cljs","^2",20,"^M",["^ ","^B",false,"^F",3,"^C",["^>",[["^39","~$x"],["^39","~$x","^Z"]]],"^=",["^>",[["^39","~$x"],["^39","~$x","^Z"]]],"^E",["^>",[null,null]]],"^C",["^>",[["^39","~$x"],["^39","~$x","^Z"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1542,"^6",1542,"^F",3,"^G",true,"^=",["^>",[["^39","~$x"],["^39","~$x","^Z"]]]],"~$completing",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2550,"^3",7,"^6",2550,"^2",17,"^=",["^>",["^?",["^>",[["~$f"],["~$f","~$cf"]]]]],"^9","Takes a reducing function f of 2 args and returns a fn suitable for\n  transduce by adding an arity-1 signature that calls cf (default -\n  identity) on the result argument.","^M",["^ ","^B",false,"^F",2,"^C",["^>",[["~$f"],["~$f","^7J"]]],"^=",["^>",[["~$f"],["~$f","^7J"]]],"^E",["^>",[null,null]]]],"^@","~$cljs.core/completing","^B",false,"^1","cljs/core.cljs","^2",17,"^M",["^ ","^B",false,"^F",2,"^C",["^>",[["~$f"],["~$f","^7J"]]],"^=",["^>",[["~$f"],["~$f","^7J"]]],"^E",["^>",[null,null]]],"^C",["^>",[["~$f"],["~$f","^7J"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2550,"^6",2550,"^F",2,"^G",true,"^=",["^>",[["~$f"],["~$f","^7J"]]],"^9","Takes a reducing function f of 2 args and returns a fn suitable for\n  transduce by adding an arity-1 signature that calls cf (default -\n  identity) on the result argument."],"~$unchecked-negate-int",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2750,"^3",7,"^6",2750,"^2",27,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"^@","~$cljs.core/unchecked-negate-int","^B",false,"^1","cljs/core.cljs","^2",27,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2750,"^6",2750,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$->PersistentVector",["^ ","^;",null,"^<",["^ ","^16",["^17",["~$cljs.core/APersistentVector","^3X","^4T","^4U","~$cljs.core/IKVReduce","^18","^19","^3H","^2=","~$cljs.core/IEditableCollection","^1:","^4V","^2?","^3J","^2B","^2C","^7A","^4W","^1K","^2D","^2E","^4Y","^3M","^2F"]],"^1","cljs/core.cljs","^2",26,"^3",10,"^2G","^2H","^5",5433,"^6",5433,"^=",["^>",["^?",["^>",[["^Y","^4E","^4F","^3O","^4G","^10"]]]]],"^1?",["^17",["^3X","^4T","^4U","^7P","^18","^19","^3H","^2=","^7Q","^2?","^3J","^2B","^2C","^7A","^4W","^1K","^2D","^2E","^4Y","^3M","^2F"]],"^9","Positional factory function for cljs.core/PersistentVector."],"^16",["^17",["^7O","^3X","^4T","^4U","^7P","^18","^19","^3H","^2=","^7Q","^1:","^4V","^2?","^3J","^2B","^2C","^7A","^4W","^1K","^2D","^2E","^4Y","^3M","^2F"]],"^@","~$cljs.core/->PersistentVector","^B",false,"^1","cljs/core.cljs","^2",26,"^C",["^>",[["^Y","^4E","^4F","^3O","^4G","^10"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",5433,"^6",5433,"^F",6,"^G",true,"^=",["^>",["^?",["^>",[["^Y","^4E","^4F","^3O","^4G","^10"]]]]],"^1?",["^17",["^3X","^4T","^4U","^7P","^18","^19","^3H","^2=","^7Q","^2?","^3J","^2B","^2C","^7A","^4W","^1K","^2D","^2E","^4Y","^3M","^2F"]],"^9","Positional factory function for cljs.core/PersistentVector."],"~$equiv-sequential",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2959,"^3",8,"^6",2959,"^2",24,"^P",true,"^=",["^>",["^?",["^>",[["~$x","~$y"]]]]],"^9","Assumes x is sequential. Returns true if x equals y, otherwise\n  returns false."],"^P",true,"^@","~$cljs.core/equiv-sequential","^B",false,"^1","cljs/core.cljs","^2",24,"^C",["^>",[["~$x","~$y"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2959,"^6",2959,"^F",2,"^G",true,"^=",["^>",["^?",["^>",[["~$x","~$y"]]]]],"^9","Assumes x is sequential. Returns true if x equals y, otherwise\n  returns false."],"~$hash-unordered-coll",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1339,"^3",15,"^6",1339,"^2",34,"^7","^27","^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Returns the hash code, consistent with =, for an external unordered\n   collection implementing Iterable. For maps, the iterator should\n   return map entries whose hash is computed as\n     (hash-ordered-coll [k v]).\n   See http://clojure.org/data_structures#hash for full algorithms."],"^@","~$cljs.core/hash-unordered-coll","^B",false,"^1","cljs/core.cljs","^2",34,"^C",["^>",[["^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1339,"^1B","^27","^6",1339,"^F",1,"^7","^27","^G",true,"^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Returns the hash code, consistent with =, for an external unordered\n   collection implementing Iterable. For maps, the iterator should\n   return map entries whose hash is computed as\n     (hash-ordered-coll [k v]).\n   See http://clojure.org/data_structures#hash for full algorithms."],"~$repeat",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4955,"^3",7,"^6",4955,"^2",13,"^=",["^>",["^?",["^>",[["~$x"],["~$n","~$x"]]]]],"^9","Returns a lazy (infinite!, or length n if supplied) sequence of xs.","^M",["^ ","^B",false,"^F",2,"^C",["^>",[["~$x"],["~$n","~$x"]]],"^=",["^>",[["~$x"],["~$n","~$x"]]],"^E",["^>",[null,null]]]],"^@","~$cljs.core/repeat","^B",false,"^1","cljs/core.cljs","^2",13,"^M",["^ ","^B",false,"^F",2,"^C",["^>",[["~$x"],["~$n","~$x"]]],"^=",["^>",[["~$x"],["~$n","~$x"]]],"^E",["^>",[null,null]]],"^C",["^>",[["~$x"],["~$n","~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",4955,"^6",4955,"^F",2,"^G",true,"^=",["^>",[["~$x"],["~$n","~$x"]]],"^9","Returns a lazy (infinite!, or length n if supplied) sequence of xs."],"~$unchecked-inc",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2727,"^3",7,"^6",2727,"^2",20,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"^@","~$cljs.core/unchecked-inc","^B",false,"^1","cljs/core.cljs","^2",20,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2727,"^6",2727,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$nthnext",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2927,"^3",7,"^6",2927,"^2",14,"^=",["^>",["^?",["^>",[["^39","~$n"]]]]],"^9","Returns the nth next of coll, (seq coll) when n is 0."],"^@","~$cljs.core/nthnext","^B",false,"^1","cljs/core.cljs","^2",14,"^C",["^>",[["^39","~$n"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2927,"^6",2927,"^F",2,"^G",true,"^=",["^>",["^?",["^>",[["^39","~$n"]]]]],"^9","Returns the nth next of coll, (seq coll) when n is 0."],"~$preserving-reduced",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10399,"^3",8,"^6",10399,"^2",26,"^P",true,"^=",["^>",["^?",["^>",[["~$rf"]]]]]],"^P",true,"^@","~$cljs.core/preserving-reduced","^B",false,"^1","cljs/core.cljs","^2",26,"^C",["^>",[["^82"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",10399,"^6",10399,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^82"]]]]]],"~$get-validator",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4513,"^3",7,"^6",4513,"^2",20,"^=",["^>",["^?",["^>",[["~$iref"]]]]],"^9","Gets the validator-fn for a var/ref/agent/atom."],"^@","~$cljs.core/get-validator","^B",false,"^1","cljs/core.cljs","^2",20,"^C",["^>",[["^85"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",4513,"^6",4513,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^85"]]]]],"^9","Gets the validator-fn for a var/ref/agent/atom."],"~$StringIter",["^ ","^15",2,"^16",["^17",["^1:"]],"^@","~$cljs.core/StringIter","^1","cljs/core.cljs","^2",20,"^1<",true,"^3",10,"^5",3967,"^1=",false,"^6",3967,"^7","^1>","^1?",null],"~$number?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",241,"^3",16,"^6",241,"^2",23,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x is a JavaScript number."],"^@","~$cljs.core/number?","^B",false,"^1","cljs/core.cljs","^2",23,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",241,"^1B","^8","^6",241,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x is a JavaScript number."],"~$-conj!",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",788,"^3",9,"^6",788,"^2",15,"^7","^3<","^3=","^3K","^9","Adds value val to tcoll and returns tcoll.","^=",["^>",["^?",["^>",[["^3?","^2J"]]]]]],"^3=","^3K","^@","~$cljs.core/-conj!","^B",false,"^1","cljs/core.cljs","^2",15,"^C",["^>",[["^3?","^2J"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",786,"^1B","^3<","^6",788,"^F",2,"^7","^3<","^G",true,"^=",["^>",["^?",["^>",[["^3?","^2J"]]]]],"^9","Adds value val to tcoll and returns tcoll."],"~$->PersistentArrayMapSeq",["^ ","^;",null,"^<",["^ ","^16",["^17",["^18","^19","^2=","^1:","^2?","^3J","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^1","cljs/core.cljs","^2",31,"^3",10,"^2G","^2H","^5",6655,"^6",6655,"^=",["^>",["^?",["^>",[["^3T","~$i","~$_meta"]]]]],"^1?",["^17",["^18","^19","^2=","^2?","^3J","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^9","Positional factory function for cljs.core/PersistentArrayMapSeq."],"^16",["^17",["^18","^19","^2=","^1:","^2?","^3J","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^@","~$cljs.core/->PersistentArrayMapSeq","^B",false,"^1","cljs/core.cljs","^2",31,"^C",["^>",[["^3T","~$i","^8>"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",6655,"^6",6655,"^F",3,"^G",true,"^=",["^>",["^?",["^>",[["^3T","~$i","^8>"]]]]],"^1?",["^17",["^18","^19","^2=","^2?","^3J","^2@","^2A","^2B","^2C","^2D","^2E","^2F"]],"^9","Positional factory function for cljs.core/PersistentArrayMapSeq."],"~$chunk-next",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3602,"^3",7,"^6",3602,"^2",17,"^=",["^>",["^?",["^>",[["~$s"]]]]]],"^@","~$cljs.core/chunk-next","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["~$s"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3602,"^6",3602,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$s"]]]]]],"~$ArrayList",["^ ","^15",1,"^16",["^17",["^1:"]],"^@","~$cljs.core/ArrayList","^1","cljs/core.cljs","^2",19,"^1<",true,"^3",10,"^5",9429,"^1=",false,"^6",9429,"^7","^1>","^1?",null],"~$print-str",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",10080,"^3",7,"^6",10080,"^2",16,"^=",["^>",["^?",["^>",[["~$&","~$objs"]]]]],"^9","print to a string, returning it","^M",["^ ","^B",true,"^F",0,"^C",[["^>",["^8E"]]],"^=",["^>",[["~$&","^8E"]]],"^E",["^>",[null]]]],"^@","~$cljs.core/print-str","^B",true,"^1","cljs/core.cljs","^2",16,"^M",["^ ","^B",true,"^F",0,"^C",[["^>",["^8E"]]],"^=",["^>",[["~$&","^8E"]]],"^E",["^>",[null]]],"^C",[["^>",["^8E"]]],"^D",null,"^E",["^>",[null]],"^3",1,"^5",10080,"^6",10080,"^F",0,"^G",true,"^=",["^>",[["~$&","^8E"]]],"^9","print to a string, returning it"],"~$not-any?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4201,"^3",16,"^6",4201,"^2",24,"^7","^8","^=",["^>",["^?",["^>",[["^5F","^39"]]]]],"^9","Returns false if (pred x) is logical true for any x in coll,\n  else true."],"^@","~$cljs.core/not-any?","^B",false,"^1","cljs/core.cljs","^2",24,"^C",["^>",[["^5F","^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",4201,"^1B","^8","^6",4201,"^F",2,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["^5F","^39"]]]]],"^9","Returns false if (pred x) is logical true for any x in coll,\n  else true."],"~$into-array",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",518,"^3",14,"^6",518,"^2",24,"^7","^1Y","^=",["^>",["^?",["^>",[["~$aseq"],["^76","^8J"]]]]],"^9","Returns an array with components set to the values in aseq. Optional type\n  argument accepted for compatibility with Clojure.","^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^8J"],["^76","^8J"]]],"^=",["^>",[["^8J"],["^76","^8J"]]],"^E",["^>",[null,null]]]],"^@","~$cljs.core/into-array","^B",false,"^1","cljs/core.cljs","^2",24,"^M",["^ ","^B",false,"^F",2,"^C",["^>",[["^8J"],["^76","^8J"]]],"^=",["^>",[["^8J"],["^76","^8J"]]],"^E",["^>",[null,null]]],"^C",["^>",[["^8J"],["^76","^8J"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",518,"^1B","^1Y","^6",518,"^F",2,"^7","^1Y","^G",true,"^=",["^>",[["^8J"],["^76","^8J"]]],"^9","Returns an array with components set to the values in aseq. Optional type\n  argument accepted for compatibility with Clojure."],"~$-hash",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",711,"^3",4,"^6",711,"^2",9,"^3=","^19","^9","Returns the hash code of o.","^=",["^>",["^?",["^>",[["~$o"]]]]]],"^3=","^19","^@","~$cljs.core/-hash","^B",false,"^1","cljs/core.cljs","^2",9,"^C",["^>",[["~$o"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",709,"^6",711,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$o"]]]]],"^9","Returns the hash code of o."],"~$qualified-symbol?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3348,"^3",16,"^6",3348,"^2",33,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Return true if x is a symbol with a namespace"],"^@","~$cljs.core/qualified-symbol?","^B",false,"^1","cljs/core.cljs","^2",33,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3348,"^1B","^8","^6",3348,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Return true if x is a symbol with a namespace"],"~$-dissoc!",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",801,"^3",9,"^6",801,"^2",17,"^7","^3<","^3=","^3I","^9","Returns a new transient collection of tcoll without the mapping for key.","^=",["^>",["^?",["^>",[["^3?","^4Z"]]]]]],"^3=","^3I","^@","~$cljs.core/-dissoc!","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["^3?","^4Z"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",799,"^1B","^3<","^6",801,"^F",2,"^7","^3<","^G",true,"^=",["^>",["^?",["^>",[["^3?","^4Z"]]]]],"^9","Returns a new transient collection of tcoll without the mapping for key."],"~$->Reduced",["^ ","^;",null,"^<",["^ ","^16",["^17",["^6C"]],"^1","cljs/core.cljs","^2",17,"^3",10,"^2G","^2H","^5",1417,"^6",1417,"^=",["^>",["^?",["^>",[["^2J"]]]]],"^1?",["^17",["^6C"]],"^9","Positional factory function for cljs.core/Reduced."],"^16",["^17",["^6C"]],"^@","~$cljs.core/->Reduced","^B",false,"^1","cljs/core.cljs","^2",17,"^C",["^>",[["^2J"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",1417,"^6",1417,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^2J"]]]]],"^1?",["^17",["^6C"]],"^9","Positional factory function for cljs.core/Reduced."],"~$chunk-buffer",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",3478,"^3",7,"^6",3478,"^2",19,"^=",["^>",["^?",["^>",[["~$capacity"]]]]]],"^@","~$cljs.core/chunk-buffer","^B",false,"^1","cljs/core.cljs","^2",19,"^C",["^>",[["^8U"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",3478,"^6",3478,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^8U"]]]]]],"~$seqable?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2219,"^3",16,"^6",2219,"^2",24,"^7","^8","^=",["^>",["^?",["^>",[["~$s"]]]]],"^9","Return true if the seq function is supported for s"],"^@","~$cljs.core/seqable?","^B",false,"^1","cljs/core.cljs","^2",24,"^C",["^>",[["~$s"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2219,"^1B","^8","^6",2219,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$s"]]]]],"^9","Return true if the seq function is supported for s"],"~$symbol?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1036,"^3",16,"^6",1036,"^2",23,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Return true if x is a Symbol"],"^@","~$cljs.core/symbol?","^B",false,"^1","cljs/core.cljs","^2",23,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1036,"^1B","^8","^6",1036,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Return true if x is a Symbol"],"~$m3-hash-unencoded-chars",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",936,"^3",15,"^6",936,"^2",38,"^7","^27","^=",["^>",["^?",["^>",[["~$in"]]]]]],"^@","~$cljs.core/m3-hash-unencoded-chars","^B",false,"^1","cljs/core.cljs","^2",38,"^C",["^>",[["^90"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",936,"^1B","^27","^6",936,"^F",1,"^7","^27","^G",true,"^=",["^>",["^?",["^>",[["^90"]]]]]],"~$unchecked-char",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2691,"^3",15,"^6",2691,"^2",29,"^7","^27","^=",["^>",["^?",["^>",[["~$x"]]]]]],"^@","~$cljs.core/unchecked-char","^B",false,"^1","cljs/core.cljs","^2",29,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2691,"^1B","^27","^6",2691,"^F",1,"^7","^27","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$system-time",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",391,"^3",7,"^6",391,"^2",18,"^=",["^>",["^?",["^>",[[]]]]],"^9","Returns highest resolution time offered by host in milliseconds."],"^@","~$cljs.core/system-time","^B",false,"^1","cljs/core.cljs","^2",18,"^C",["^>",[[]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",391,"^6",391,"^F",0,"^G",true,"^=",["^>",["^?",["^>",[[]]]]],"^9","Returns highest resolution time offered by host in milliseconds."],"~$NeverEquiv",["^ ","^15",0,"^16",["^17",["^18","^1:"]],"^@","~$cljs.core/NeverEquiv","^1","cljs/core.cljs","^2",20,"^1<",true,"^3",10,"^5",6246,"^1=",false,"^6",6246,"^7","^1>","^1?",["^17",["^18"]]],"~$chunkIteratorSeq",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",4086,"^3",8,"^6",4086,"^2",24,"^P",true,"^=",["^>",["^?",["^>",[["~$iter"]]]]]],"^P",true,"^@","~$cljs.core/chunkIteratorSeq","^B",false,"^1","cljs/core.cljs","^2",24,"^C",["^>",[["^99"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",4086,"^6",4086,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^99"]]]]]],"~$-invoke",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",541,"^3",4,"^6",541,"^2",11,"^3=","^3H","^9",null,"^=",["^>",["^?",["^>",[["~$this"],["^9<","~$a"],["^9<","~$a","~$b"],["^9<","~$a","~$b","~$c"],["^9<","~$a","~$b","~$c","~$d"],["^9<","~$a","~$b","~$c","~$d","~$e"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^5B"]]]]],"^M",["^ ","^B",false,"^F",22,"^C",["^>",[["^9<"],["^9<","~$a"],["^9<","~$a","~$b"],["^9<","~$a","~$b","~$c"],["^9<","~$a","~$b","~$c","~$d"],["^9<","~$a","~$b","~$c","~$d","~$e"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^5B"]]],"^=",["^>",[["^9<"],["^9<","~$a"],["^9<","~$a","~$b"],["^9<","~$a","~$b","~$c"],["^9<","~$a","~$b","~$c","~$d"],["^9<","~$a","~$b","~$c","~$d","~$e"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^5B"]]],"^E",["^>",[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]]]],"^3=","^3H","^@","~$cljs.core/-invoke","^B",false,"^1","cljs/core.cljs","^2",11,"^M",["^ ","^B",false,"^F",22,"^C",["^>",[["^9<"],["^9<","~$a"],["^9<","~$a","~$b"],["^9<","~$a","~$b","~$c"],["^9<","~$a","~$b","~$c","~$d"],["^9<","~$a","~$b","~$c","~$d","~$e"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^5B"]]],"^=",["^>",[["^9<"],["^9<","~$a"],["^9<","~$a","~$b"],["^9<","~$a","~$b","~$c"],["^9<","~$a","~$b","~$c","~$d"],["^9<","~$a","~$b","~$c","~$d","~$e"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^5B"]]],"^E",["^>",[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]]],"^C",["^>",[["^9<"],["^9<","~$a"],["^9<","~$a","~$b"],["^9<","~$a","~$b","~$c"],["^9<","~$a","~$b","~$c","~$d"],["^9<","~$a","~$b","~$c","~$d","~$e"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^5B"]]],"^D",null,"^E",["^>",[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]],"^3",1,"^5",537,"^6",541,"^F",22,"^G",true,"^=",["^>",[["^9<"],["^9<","~$a"],["^9<","~$a","~$b"],["^9<","~$a","~$b","~$c"],["^9<","~$a","~$b","~$c","~$d"],["^9<","~$a","~$b","~$c","~$d","~$e"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t"],["^9<","~$a","~$b","~$c","~$d","~$e","~$f","~$g","~$h","~$i","~$j","~$k","~$l","~$m","~$n","~$o","~$p","~$q","~$r","~$s","~$t","^5B"]]],"^9",null],"~$coll?",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2099,"^3",16,"^6",2099,"^2",21,"^7","^8","^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x satisfies ICollection"],"^@","~$cljs.core/coll?","^B",false,"^1","cljs/core.cljs","^2",21,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2099,"^1B","^8","^6",2099,"^F",1,"^7","^8","^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]],"^9","Returns true if x satisfies ICollection"],"~$get-in",["^ ","^;",null,"^<",["^ ","~:added","1.2","^1","cljs/core.cljs","^2",13,"~:static",true,"^M",["^ ","^B",false,"^F",3,"^C",["^>",[["~$m","~$ks"],["~$m","^9C","~$not-found"]]],"^=",["^>",[["~$m","^9C"],["~$m","^9C","^9D"]]],"^E",["^>",[null,null]]],"^3",7,"^5",5222,"^6",5222,"^=",["^>",["^?",["^>",[["~$m","^9C"],["~$m","^9C","^9D"]]]]],"^9","Returns the value in a nested associative structure,\n  where ks is a sequence of keys. Returns nil if the key is not present,\n  or the not-found value if supplied."],"^9A","1.2","^@","~$cljs.core/get-in","^B",false,"^1","cljs/core.cljs","^2",13,"^9B",true,"^M",["^ ","^B",false,"^F",3,"^C",["^>",[["~$m","^9C"],["~$m","^9C","^9D"]]],"^=",["^>",[["~$m","^9C"],["~$m","^9C","^9D"]]],"^E",["^>",[null,null]]],"^C",["^>",[["~$m","^9C"],["~$m","^9C","^9D"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",5222,"^6",5222,"^F",3,"^G",true,"^=",["^>",[["~$m","^9C"],["~$m","^9C","^9D"]]],"^9","Returns the value in a nested associative structure,\n  where ks is a sequence of keys. Returns nil if the key is not present,\n  or the not-found value if supplied."],"~$fnext",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1751,"^3",7,"^6",1751,"^2",12,"^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Same as (first (next x))"],"^@","~$cljs.core/fnext","^B",false,"^1","cljs/core.cljs","^2",12,"^C",["^>",[["^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1751,"^6",1751,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Same as (first (next x))"],"~$IList",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",722,"^3",14,"^6",722,"^2",19,"^9","Marker interface indicating a persistent list","^2N",true,"^2O",["^>",["@interface"]],"^2P",["^ ","^2Q",["^ "]]],"^2N",true,"^@","~$cljs.core/IList","^1","cljs/core.cljs","^2",19,"^3",1,"^5",722,"^2P",["^ ","^2Q",["^ "]],"^2T",null,"^6",722,"^7","^2U","^2V",["^17",["~$cljs.core/Cons","~$cljs.core/EmptyList","~$cljs.core/List"]],"^9","Marker interface indicating a persistent list","^2O",["^>",["@interface"]]],"~$ArrayNodeIterator",["^ ","^15",3,"^16",["^17",["^1:"]],"^@","~$cljs.core/ArrayNodeIterator","^1","cljs/core.cljs","^2",27,"^1<",true,"^3",10,"^5",7360,"^1=",false,"^6",7360,"^7","^1>","^1?",null],"~$List",["^ ","^<",["^ ","^1","cljs/core.cljs","^5",1515,"^3",45,"^6",1515,"^2",49,"^3W",true],"^15",5,"^16",["^17",["^9I","^18","^19","~$cljs.core/ASeq","^2=","^1:","^2?","^3J","^2@","^2A","^2B","^2C","^7A","^4W","^2D","^2E","^2F"]],"^@","^9L","^1","cljs/core.cljs","^2",14,"^1<",true,"^3",10,"^5",3017,"^1=",false,"^3W",true,"^6",3017,"^7","^1>","^1?",["^17",["^9I","^18","^19","^9P","^2=","^2?","^3J","^2@","^2A","^2B","^2C","^7A","^4W","^2D","^2E","^2F"]]],"~$-val",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",648,"^3",4,"^6",648,"^2",8,"^3=","^4X","^9","Returns the value of the map entry.","^=",["^>",["^?",["^>",[["^39"]]]]]],"^3=","^4X","^@","~$cljs.core/-val","^B",false,"^1","cljs/core.cljs","^2",8,"^C",["^>",[["^39"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",644,"^6",648,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["^39"]]]]],"^9","Returns the value of the map entry."],"~$bytes",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",2798,"^3",7,"^6",2798,"^2",12,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"^@","~$cljs.core/bytes","^B",false,"^1","cljs/core.cljs","^2",12,"^C",["^>",[["~$x"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",2798,"^6",2798,"^F",1,"^G",true,"^=",["^>",["^?",["^>",[["~$x"]]]]]],"~$->ObjMap",["^ ","^;",null,"^<",["^ ","^16",["^17",["^7P","^18","^19","^3H","^2=","^7Q","^1:","^4V","^2?","^3J","^2B","^2C","^2E","^4Y","~$cljs.core/IMap","^3M"]],"^1","cljs/core.cljs","^2",16,"^3",10,"^2G","^2H","^5",6321,"^6",6321,"^=",["^>",["^?",["^>",[["^Y","~$keys","~$strobj","~$update-count","^10"]]]]],"^1?",["^17",["^7P","^18","^19","^3H","^2=","^7Q","^2?","^3J","^2B","^2C","^2E","^4Y","^9V","^3M"]],"^9","Positional factory function for cljs.core/ObjMap."],"^16",["^17",["^7P","^18","^19","^3H","^2=","^7Q","^1:","^4V","^2?","^3J","^2B","^2C","^2E","^4Y","^9V","^3M"]],"^@","~$cljs.core/->ObjMap","^B",false,"^1","cljs/core.cljs","^2",16,"^C",["^>",[["^Y","^9W","^9X","^9Y","^10"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^2G","^2H","^5",6321,"^6",6321,"^F",5,"^G",true,"^=",["^>",["^?",["^>",[["^Y","^9W","^9X","^9Y","^10"]]]]],"^1?",["^17",["^7P","^18","^19","^3H","^2=","^7Q","^2?","^3J","^2B","^2C","^2E","^4Y","^9V","^3M"]],"^9","Positional factory function for cljs.core/ObjMap."],"~$compare-symbols",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",1046,"^3",8,"^6",1046,"^2",23,"^P",true,"^=",["^>",["^?",["^>",[["~$a","~$b"]]]]]],"^P",true,"^@","~$cljs.core/compare-symbols","^B",false,"^1","cljs/core.cljs","^2",23,"^C",["^>",[["~$a","~$b"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",1046,"^6",1046,"^F",2,"^G",true,"^=",["^>",["^?",["^>",[["~$a","~$b"]]]]]],"~$t_cljs$core9266",["^ ","^15",1,"^16",["^17",["^1:","^2C","^2E"]],"^@","~$cljs.core/t_cljs$core9266","^1","cljs/core.cljs","^1<",true,"~:anonymous",true,"^3",3,"^5",3961,"^1=",false,"^7","^1>","^1?",["^17",["^2C","^2E"]]],"~$-seq",["^ ","^;",null,"^<",["^ ","^1","cljs/core.cljs","^5",716,"^3",16,"^6",716,"^2",20,"^7","~$clj-or-nil","^3=","^2B","^9","Returns a seq of o, or nil if o is empty.","^=",["^>",["^?",["^>",[["~$o"]]]]]],"^3=","^2B","^@","~$cljs.core/-seq","^B",false,"^1","cljs/core.cljs","^2",20,"^C",["^>",[["~$o"]]],"^D",null,"^E",["^>",[null,null]],"^3",1,"^5",714,"^1B","^:5","^6",716,"^F",1,"^7","^:5","^G",true,"^=",["^>",["^?",["^>",[["~$o"]]]]],"^9","Returns a seq of o, or nil if o is empty."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^17",["~$form","^37","~$&","~$uuid","~$case*","^[","~$defrecord*","^6P","~$obj","~$fqn","~$first","~$try","^3P","~$rear","~$hierarchy","^99","~$step","^8","^9Y","~$method-table","^5A","~$i","^5B","^<","~:dup","^1D","~$dispatch-fn","~$buffer","~:else","^4[","~$ns*","~:cljs.core/none","^4F","~$iters","^6J","~:validator","~$finally","~:default","^1P","~$loop*","~$watches","~:ns","~$bitmap","~$_seq","^3Q","~$v","~$riter","^10","^Y","^8>","~$afn","^1E","~$fn","~$front","~$buf","~$next-entry","~:val","^4Z","~$_next","~$root-iter","~$do","^6S","~:fallback-impl","~:keyword-fn","~:flush-on-newline","~$default-dispatch-val","~:no-test","~$validator","~$letfn*","~$if","^3T","~$new","~:descendants","~$ns","~$completed","~:ancestors","^1U","^20","~:readably","~$meta9267","~:more-marker","~$fields","~$method-cache","^3N","~$editable?","~$base-count","~$collision-hash","~$deftype*","~$let*","^Z","~$sourceIter","^39","~$not-native","~$js*","^9X","~$_rest","~$fn*","^2J","^6X","~$recur","~$xf","^7B","~:print-length","~$state","~:ok","~$vals","~$meta1501","~$all","~:cljs.core/halt","~$cached-hierarchy","~$s","~:parents","^4E","^55","~$sym","~$sb","~$seed","~$prev-seed","~$_hash","^9W","~$set!","^7","~$tree-map","~$.","~$var","~:mutable","^?","^3O","~$multi","~$str","^2K","~$nodes","~$seen","~$hash-map","~$catch","~:alt-impl","~$ext-map-iter","^4G","~$record","~$meta10806","~$mseq","^2I","~:keywordize-keys","~$current","^6T","~$stack","~$transient-map","~$prev","~$len","^50","~$throw","~$fseq","~:cljs.core/not-found","^2:","~$def","~$f","~$next-iter"]],"~:order",["^;6","^;A","^<","^:G","^;R","^:J","^<0","^:P","^;>","^20","^<9","^<3","^<7","^8>","^2J","^;[","~$s","^1U","^99","^;N","^3T","~$i","^Y","^7B","^:W","^:A","^5B","^2I","^10","^:@","^:X","^:Z","^[","^6T","^5A","^2:","^;B","^:U","^;1","^;U","^:M","^:I","^;?","^;Q","^;K","^<8","^;S","^;9","^:R","^:N","^;W","^<G","^<D","^2K","~$f","^<2","^<1","^3N","^6P","~$v","^Z","^4E","^4F","^3O","^4G","^6S","^55","^<J","^:V","^:Y","^:C","^9W","^9X","^9Y","^<@","^;G","^;D","^<?","^4Z","^;F","^<H","^:[","^<M","^:T","^;H","^<:","^3Q","^;2","^<;","^3P","^7","^8","^<E","^6X","^4[","^50","^1D","^1E","^<B","^;L","^<K","^<<","^<F","^<5","^:E","^:L","^;C","^<>","^;4","^;0","^;X","^6J","^39","^;5","^<C","^;Z","^;=","^;@","^:H","^;7","^:D","^:F","^1P","^;E","^;Y","^:<","~$&","^:=","^:>","^:B","^:K","^:O","^:Q","^;3","^;:","^;;","^;<","^;I","^;J","^;M","^;O","^;P","^<4","~$.","^<6","^?","^<=","^<I","^<L","^;T","^;8","^37","^:;","^:S","^:?","^<A","^;V"]],"^9",null]
\ No newline at end of file
diff --git a/js/cljs/core.js b/js/cljs/core.js
new file mode 100644
index 0000000..d303fe2
--- /dev/null
+++ b/js/cljs/core.js
@@ -0,0 +1,37629 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('cljs.core');
+goog.require('goog.math.Long');
+goog.require('goog.math.Integer');
+goog.require('goog.string');
+goog.require('goog.object');
+goog.require('goog.array');
+goog.require('goog.Uri');
+goog.require('goog.string.StringBuffer');
+cljs.core._STAR_clojurescript_version_STAR_ = "1.10.329";
+cljs.core._STAR_unchecked_if_STAR_ = false;
+cljs.core._STAR_unchecked_arrays_STAR_ = false;
+cljs.core._STAR_warn_on_infer_STAR_ = false;
+cljs.core._STAR_unchecked_arrays_STAR_ = true;
+if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core.PROTOCOL_SENTINEL !== 'undefined')){
+} else {
+cljs.core.PROTOCOL_SENTINEL = ({});
+}
+cljs.core.MODULE_URIS = null;
+cljs.core.MODULE_INFOS = null;
+
+/** @define {string} */
+goog.define("cljs.core._STAR_target_STAR_","default");
+/**
+ * Var bound to the current namespace. Only used for bootstrapping.
+ * @type {*}
+ */
+cljs.core._STAR_ns_STAR_ = null;
+/**
+ * @type {*}
+ */
+cljs.core._STAR_out_STAR_ = null;
+cljs.core._STAR_assert_STAR_ = true;
+if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_print_fn_STAR_ !== 'undefined')){
+} else {
+/**
+ * Each runtime environment provides a different way to print output.
+ *   Whatever function *print-fn* is bound to will be passed any
+ *   Strings which should be printed.
+ */
+cljs.core._STAR_print_fn_STAR_ = null;
+}
+/**
+ * Arranges to have tap functions executed via the supplied f, a
+ *   function of no arguments. Returns true if successful, false otherwise.
+ */
+cljs.core._STAR_exec_tap_fn_STAR_ = (function cljs$core$_STAR_exec_tap_fn_STAR_(f){
+var and__3925__auto__ = (typeof setTimeout !== 'undefined');
+if(and__3925__auto__){
+var and__3925__auto____$1 = setTimeout(f,(0));
+if(cljs.core.truth_(and__3925__auto____$1)){
+return true;
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+});
+if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_print_err_fn_STAR_ !== 'undefined')){
+} else {
+/**
+ * Each runtime environment provides a different way to print error output.
+ *   Whatever function *print-err-fn* is bound to will be passed any
+ *   Strings which should be printed.
+ */
+cljs.core._STAR_print_err_fn_STAR_ = null;
+}
+/**
+ * Set *print-fn* to f.
+ */
+cljs.core.set_print_fn_BANG_ = (function cljs$core$set_print_fn_BANG_(f){
+return cljs.core._STAR_print_fn_STAR_ = f;
+});
+/**
+ * Set *print-err-fn* to f.
+ */
+cljs.core.set_print_err_fn_BANG_ = (function cljs$core$set_print_err_fn_BANG_(f){
+return cljs.core._STAR_print_err_fn_STAR_ = f;
+});
+/**
+ * When set to true, output will be flushed whenever a newline is printed.
+ * 
+ *   Defaults to true.
+ */
+cljs.core._STAR_flush_on_newline_STAR_ = true;
+/**
+ * When set to logical false will drop newlines from printing calls.
+ *   This is to work around the implicit newlines emitted by standard JavaScript
+ *   console objects.
+ */
+cljs.core._STAR_print_newline_STAR_ = true;
+/**
+ * When set to logical false, strings and characters will be printed with
+ *   non-alphanumeric characters converted to the appropriate escape sequences.
+ * 
+ *   Defaults to true
+ */
+cljs.core._STAR_print_readably_STAR_ = true;
+/**
+ * If set to logical true, when printing an object, its metadata will also
+ *   be printed in a form that can be read back by the reader.
+ * 
+ *   Defaults to false.
+ */
+cljs.core._STAR_print_meta_STAR_ = false;
+/**
+ * When set to logical true, objects will be printed in a way that preserves
+ *   their type when read in later.
+ * 
+ *   Defaults to false.
+ */
+cljs.core._STAR_print_dup_STAR_ = false;
+/**
+ * *print-namespace-maps* controls whether the printer will print
+ *   namespace map literal syntax.
+ * 
+ *   Defaults to false, but the REPL binds it to true.
+ */
+cljs.core._STAR_print_namespace_maps_STAR_ = false;
+/**
+ * *print-length* controls how many items of each collection the
+ *   printer will print. If it is bound to logical false, there is no
+ *   limit. Otherwise, it must be bound to an integer indicating the maximum
+ *   number of items of each collection to print. If a collection contains
+ *   more items, the printer will print items up to the limit followed by
+ *   '...' to represent the remaining items. The root binding is nil
+ *   indicating no limit.
+ * @type {null|number}
+ */
+cljs.core._STAR_print_length_STAR_ = null;
+/**
+ * *print-level* controls how many levels deep the printer will
+ *   print nested objects. If it is bound to logical false, there is no
+ *   limit. Otherwise, it must be bound to an integer indicating the maximum
+ *   level to print. Each argument to print is at level 0; if an argument is a
+ *   collection, its items are at level 1; and so on. If an object is a
+ *   collection and is at a level greater than or equal to the value bound to
+ *   *print-level*, the printer prints '#' to represent it. The root binding
+ *   is nil indicating no limit.
+ * @type {null|number}
+ */
+cljs.core._STAR_print_level_STAR_ = null;
+/**
+ * *print-fns-bodies* controls whether functions print their source or
+ *  only their names.
+ */
+cljs.core._STAR_print_fn_bodies_STAR_ = false;
+if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_loaded_libs_STAR_ !== 'undefined')){
+} else {
+/**
+ * @type {*}
+ */
+cljs.core._STAR_loaded_libs_STAR_ = null;
+}
+cljs.core.pr_opts = (function cljs$core$pr_opts(){
+return new cljs.core.PersistentArrayMap(null, 5, [cljs.core.cst$kw$flush_DASH_on_DASH_newline,cljs.core._STAR_flush_on_newline_STAR_,cljs.core.cst$kw$readably,cljs.core._STAR_print_readably_STAR_,cljs.core.cst$kw$meta,cljs.core._STAR_print_meta_STAR_,cljs.core.cst$kw$dup,cljs.core._STAR_print_dup_STAR_,cljs.core.cst$kw$print_DASH_length,cljs.core._STAR_print_length_STAR_], null);
+});
+/**
+ * Set *print-fn* to console.log
+ */
+cljs.core.enable_console_print_BANG_ = (function cljs$core$enable_console_print_BANG_(){
+cljs.core._STAR_print_newline_STAR_ = false;
+
+cljs.core.set_print_fn_BANG_((function (){
+var xs = arguments;
+return console.log.apply(console,goog.array.clone(xs));
+}));
+
+cljs.core.set_print_err_fn_BANG_((function (){
+var xs = arguments;
+return console.error.apply(console,goog.array.clone(xs));
+}));
+
+return null;
+});
+/**
+ * Internal - do not use!
+ */
+cljs.core.truth_ = (function cljs$core$truth_(x){
+return (x != null && x !== false);
+});
+cljs.core.not_native = null;
+
+/**
+ * Tests if 2 arguments are the same object
+ */
+cljs.core.identical_QMARK_ = (function cljs$core$identical_QMARK_(x,y){
+return (x === y);
+});
+/**
+ * Returns true if x is nil, false otherwise.
+ */
+cljs.core.nil_QMARK_ = (function cljs$core$nil_QMARK_(x){
+return (x == null);
+});
+/**
+ * Returns true if x is a JavaScript array.
+ */
+cljs.core.array_QMARK_ = (function cljs$core$array_QMARK_(x){
+if((cljs.core._STAR_target_STAR_ === "nodejs")){
+return Array.isArray(x);
+} else {
+return (x instanceof Array);
+}
+});
+/**
+ * Returns true if x is a JavaScript number.
+ */
+cljs.core.number_QMARK_ = (function cljs$core$number_QMARK_(x){
+return typeof x === 'number';
+});
+/**
+ * Returns true if x is logical false, false otherwise.
+ */
+cljs.core.not = (function cljs$core$not(x){
+if((x == null)){
+return true;
+} else {
+if(x === false){
+return true;
+} else {
+return false;
+
+}
+}
+});
+/**
+ * Returns true if x is not nil, false otherwise.
+ */
+cljs.core.some_QMARK_ = (function cljs$core$some_QMARK_(x){
+return !((x == null));
+});
+/**
+ * Returns true if x's constructor is Object
+ */
+cljs.core.object_QMARK_ = (function cljs$core$object_QMARK_(x){
+if(!((x == null))){
+return (x.constructor === Object);
+} else {
+return false;
+}
+});
+/**
+ * Returns true if x is a JavaScript string.
+ */
+cljs.core.string_QMARK_ = (function cljs$core$string_QMARK_(x){
+return goog.isString(x);
+});
+/**
+ * Returns true if x is a JavaScript string of length one.
+ */
+cljs.core.char_QMARK_ = (function cljs$core$char_QMARK_(x){
+return ((typeof x === 'string') && (((1) === x.length)));
+});
+/**
+ * Returns true if given any argument.
+ */
+cljs.core.any_QMARK_ = (function cljs$core$any_QMARK_(x){
+return true;
+});
+/**
+ * Internal - do not use!
+ */
+cljs.core.native_satisfies_QMARK_ = (function cljs$core$native_satisfies_QMARK_(p,x){
+var x__$1 = (((x == null))?null:x);
+if((p[goog.typeOf(x__$1)])){
+return true;
+} else {
+if((p["_"])){
+return true;
+} else {
+return false;
+
+}
+}
+});
+cljs.core.is_proto_ = (function cljs$core$is_proto_(x){
+return (x.constructor.prototype === x);
+});
+/**
+ * When compiled for a command-line target, whatever function
+ *   *main-cli-fn* is set to will be called with the command-line
+ *   argv as arguments
+ */
+cljs.core._STAR_main_cli_fn_STAR_ = null;
+/**
+ * A sequence of the supplied command line arguments, or nil if
+ *   none were supplied
+ */
+cljs.core._STAR_command_line_args_STAR_ = null;
+/**
+ * Return x's constructor.
+ */
+cljs.core.type = (function cljs$core$type(x){
+if((x == null)){
+return null;
+} else {
+return x.constructor;
+}
+});
+cljs.core.missing_protocol = (function cljs$core$missing_protocol(proto,obj){
+var ty = cljs.core.type(obj);
+var ty__$1 = (cljs.core.truth_((function (){var and__3925__auto__ = ty;
+if(cljs.core.truth_(and__3925__auto__)){
+return ty.cljs$lang$type;
+} else {
+return and__3925__auto__;
+}
+})())?ty.cljs$lang$ctorStr:goog.typeOf(obj));
+return (new Error(["No protocol method ",proto," defined for type ",ty__$1,": ",obj].join("")));
+});
+cljs.core.type__GT_str = (function cljs$core$type__GT_str(ty){
+var temp__5455__auto__ = ty.cljs$lang$ctorStr;
+if(cljs.core.truth_(temp__5455__auto__)){
+var s = temp__5455__auto__;
+return s;
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ty)].join('');
+}
+});
+cljs.core.load_file = (function cljs$core$load_file(file){
+if(cljs.core.truth_(COMPILED)){
+return null;
+} else {
+return goog.nodeGlobalRequire(file);
+}
+});
+if((((typeof Symbol !== 'undefined')) && ((goog.typeOf(Symbol) === "function")))){
+cljs.core.ITER_SYMBOL = Symbol.iterator;
+} else {
+cljs.core.ITER_SYMBOL = "@@iterator";
+}
+/**
+ * @enum {string}
+ */
+cljs.core.CHAR_MAP = ({"]": "_RBRACK_", "'": "_SINGLEQUOTE_", "=": "_EQ_", "\"": "_DOUBLEQUOTE_", "!": "_BANG_", "*": "_STAR_", "%": "_PERCENT_", "|": "_BAR_", "~": "_TILDE_", "/": "_SLASH_", "\\": "_BSLASH_", "-": "_", "?": "_QMARK_", "&": "_AMPERSAND_", ":": "_COLON_", "<": "_LT_", "{": "_LBRACE_", "}": "_RBRACE_", "[": "_LBRACK_", "#": "_SHARP_", "^": "_CARET_", "+": "_PLUS_", "@": "_CIRCA_", ">": "_GT_"});
+/**
+ * @enum {string}
+ */
+cljs.core.DEMUNGE_MAP = ({"_RBRACE_": "}", "_COLON_": ":", "_BANG_": "!", "_QMARK_": "?", "_BSLASH_": "\\\\", "_SLASH_": "/", "_PERCENT_": "%", "_PLUS_": "+", "_SHARP_": "#", "_LBRACE_": "{", "_BAR_": "|", "_LBRACK_": "[", "_EQ_": "=", "_": "-", "_TILDE_": "~", "_RBRACK_": "]", "_GT_": ">", "_SINGLEQUOTE_": "'", "_CIRCA_": "@", "_AMPERSAND_": "&", "_DOUBLEQUOTE_": "\\\"", "_CARET_": "^", "_LT_": "<", "_STAR_": "*"});
+cljs.core.DEMUNGE_PATTERN = null;
+/**
+ * Returns highest resolution time offered by host in milliseconds.
+ */
+cljs.core.system_time = (function cljs$core$system_time(){
+if((((typeof performance !== 'undefined')) && (!((performance.now == null))))){
+return performance.now();
+} else {
+if((((typeof process !== 'undefined')) && (!((process.hrtime == null))))){
+var t = process.hrtime();
+return ((((t[(0)]) * 1.0E9) + (t[(1)])) / 1000000.0);
+} else {
+return (new Date()).getTime();
+
+}
+}
+});
+/**
+ * Construct a JavaScript array of the specified dimensions. Accepts ignored
+ *   type argument for compatibility with Clojure. Note that there is no efficient
+ *   way to allocate multi-dimensional arrays in JavaScript; as such, this function
+ *   will run in polynomial time when called with 3 or more arguments.
+ */
+cljs.core.make_array = (function cljs$core$make_array(var_args){
+var G__534 = arguments.length;
+switch (G__534) {
+case 1:
+return cljs.core.make_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.make_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___536 = arguments.length;
+var i__4519__auto___537 = (0);
+while(true){
+if((i__4519__auto___537 < len__4518__auto___536)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___537]));
+
+var G__538 = (i__4519__auto___537 + (1));
+i__4519__auto___537 = G__538;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.make_array.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.make_array.cljs$core$IFn$_invoke$arity$1 = (function (size){
+return (new Array(size));
+});
+
+cljs.core.make_array.cljs$core$IFn$_invoke$arity$2 = (function (type,size){
+return (new Array(size));
+});
+
+cljs.core.make_array.cljs$core$IFn$_invoke$arity$variadic = (function (type,size,more_sizes){
+var dims = more_sizes;
+var dimarray = (new Array(size));
+var n__4395__auto___539 = dimarray.length;
+var i_540 = (0);
+while(true){
+if((i_540 < n__4395__auto___539)){
+(dimarray[i_540] = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.make_array,null,dims));
+
+var G__541 = (i_540 + (1));
+i_540 = G__541;
+continue;
+} else {
+}
+break;
+}
+
+return dimarray;
+});
+
+/** @this {Function} */
+cljs.core.make_array.cljs$lang$applyTo = (function (seq531){
+var G__532 = cljs.core.first(seq531);
+var seq531__$1 = cljs.core.next(seq531);
+var G__533 = cljs.core.first(seq531__$1);
+var seq531__$2 = cljs.core.next(seq531__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__532,G__533,seq531__$2);
+});
+
+cljs.core.make_array.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns a javascript array, cloned from the passed in array
+ */
+cljs.core.aclone = (function cljs$core$aclone(arr){
+var len = arr.length;
+var new_arr = (new Array(len));
+var n__4395__auto___542 = len;
+var i_543 = (0);
+while(true){
+if((i_543 < n__4395__auto___542)){
+(new_arr[i_543] = (arr[i_543]));
+
+var G__544 = (i_543 + (1));
+i_543 = G__544;
+continue;
+} else {
+}
+break;
+}
+
+return new_arr;
+});
+/**
+ * Creates a new javascript array.
+ * @param {...*} var_args
+ */
+cljs.core.array = (function cljs$core$array(var_args){
+var a = (new Array(arguments.length));
+var i = (0);
+while(true){
+if((i < a.length)){
+(a[i] = (arguments[i]));
+
+var G__545 = (i + (1));
+i = G__545;
+continue;
+} else {
+return a;
+}
+break;
+}
+});
+cljs.core.maybe_warn = (function cljs$core$maybe_warn(e){
+if(cljs.core.truth_(cljs.core._STAR_print_err_fn_STAR_)){
+return (cljs.core._STAR_print_err_fn_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_print_err_fn_STAR_.cljs$core$IFn$_invoke$arity$1(e) : cljs.core._STAR_print_err_fn_STAR_.call(null,e));
+} else {
+return null;
+}
+});
+cljs.core.checked_aget = (function cljs$core$checked_aget(var_args){
+var G__550 = arguments.length;
+switch (G__550) {
+case 2:
+return cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___553 = arguments.length;
+var i__4519__auto___554 = (0);
+while(true){
+if((i__4519__auto___554 < len__4518__auto___553)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___554]));
+
+var G__555 = (i__4519__auto___554 + (1));
+i__4519__auto___554 = G__555;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2 = (function (array,idx){
+try{if(cljs.core.truth_((function (){var or__3936__auto__ = cljs.core.array_QMARK_(array);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return goog.isArrayLike(array);
+}
+})())){
+} else {
+throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
+}
+
+if(typeof idx === 'number'){
+} else {
+throw (new Error("Assert failed: (number? idx)"));
+}
+
+if(!((idx < (0)))){
+} else {
+throw (new Error("Assert failed: (not (neg? idx))"));
+}
+
+if((idx < array.length)){
+} else {
+throw (new Error("Assert failed: (< idx (alength array))"));
+}
+}catch (e551){var e_556 = e551;
+cljs.core.maybe_warn(e_556);
+}
+return (array[idx]);
+});
+
+cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idxs){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.checked_aget,cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2(array,idx),idxs);
+});
+
+/** @this {Function} */
+cljs.core.checked_aget.cljs$lang$applyTo = (function (seq547){
+var G__548 = cljs.core.first(seq547);
+var seq547__$1 = cljs.core.next(seq547);
+var G__549 = cljs.core.first(seq547__$1);
+var seq547__$2 = cljs.core.next(seq547__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__548,G__549,seq547__$2);
+});
+
+cljs.core.checked_aget.cljs$lang$maxFixedArity = (2);
+
+cljs.core.checked_aset = (function cljs$core$checked_aset(var_args){
+var G__562 = arguments.length;
+switch (G__562) {
+case 3:
+return cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___565 = arguments.length;
+var i__4519__auto___566 = (0);
+while(true){
+if((i__4519__auto___566 < len__4518__auto___565)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___566]));
+
+var G__567 = (i__4519__auto___566 + (1));
+i__4519__auto___566 = G__567;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$3 = (function (array,idx,val){
+try{if(cljs.core.truth_((function (){var or__3936__auto__ = cljs.core.array_QMARK_(array);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return goog.isArrayLike(array);
+}
+})())){
+} else {
+throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
+}
+
+if(typeof idx === 'number'){
+} else {
+throw (new Error("Assert failed: (number? idx)"));
+}
+
+if(!((idx < (0)))){
+} else {
+throw (new Error("Assert failed: (not (neg? idx))"));
+}
+
+if((idx < array.length)){
+} else {
+throw (new Error("Assert failed: (< idx (alength array))"));
+}
+}catch (e563){var e_568 = e563;
+cljs.core.maybe_warn(e_568);
+}
+return (array[idx] = val);
+});
+
+cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idx2,idxv){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.checked_aset,cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2(array,idx),idx2,idxv);
+});
+
+/** @this {Function} */
+cljs.core.checked_aset.cljs$lang$applyTo = (function (seq558){
+var G__559 = cljs.core.first(seq558);
+var seq558__$1 = cljs.core.next(seq558);
+var G__560 = cljs.core.first(seq558__$1);
+var seq558__$2 = cljs.core.next(seq558__$1);
+var G__561 = cljs.core.first(seq558__$2);
+var seq558__$3 = cljs.core.next(seq558__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__559,G__560,G__561,seq558__$3);
+});
+
+cljs.core.checked_aset.cljs$lang$maxFixedArity = (3);
+
+cljs.core.checked_aget_SINGLEQUOTE_ = (function cljs$core$checked_aget_SINGLEQUOTE_(var_args){
+var G__573 = arguments.length;
+switch (G__573) {
+case 2:
+return cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___575 = arguments.length;
+var i__4519__auto___576 = (0);
+while(true){
+if((i__4519__auto___576 < len__4518__auto___575)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___576]));
+
+var G__577 = (i__4519__auto___576 + (1));
+i__4519__auto___576 = G__577;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2 = (function (array,idx){
+if(cljs.core.truth_((function (){var or__3936__auto__ = cljs.core.array_QMARK_(array);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return goog.isArrayLike(array);
+}
+})())){
+} else {
+throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
+}
+
+if(typeof idx === 'number'){
+} else {
+throw (new Error("Assert failed: (number? idx)"));
+}
+
+if(!((idx < (0)))){
+} else {
+throw (new Error("Assert failed: (not (neg? idx))"));
+}
+
+if((idx < array.length)){
+} else {
+throw (new Error("Assert failed: (< idx (alength array))"));
+}
+
+return (array[idx]);
+});
+
+cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idxs){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.checked_aget_SINGLEQUOTE_,cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2(array,idx),idxs);
+});
+
+/** @this {Function} */
+cljs.core.checked_aget_SINGLEQUOTE_.cljs$lang$applyTo = (function (seq570){
+var G__571 = cljs.core.first(seq570);
+var seq570__$1 = cljs.core.next(seq570);
+var G__572 = cljs.core.first(seq570__$1);
+var seq570__$2 = cljs.core.next(seq570__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__571,G__572,seq570__$2);
+});
+
+cljs.core.checked_aget_SINGLEQUOTE_.cljs$lang$maxFixedArity = (2);
+
+cljs.core.checked_aset_SINGLEQUOTE_ = (function cljs$core$checked_aset_SINGLEQUOTE_(var_args){
+var G__583 = arguments.length;
+switch (G__583) {
+case 3:
+return cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___585 = arguments.length;
+var i__4519__auto___586 = (0);
+while(true){
+if((i__4519__auto___586 < len__4518__auto___585)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___586]));
+
+var G__587 = (i__4519__auto___586 + (1));
+i__4519__auto___586 = G__587;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$3 = (function (array,idx,val){
+if(cljs.core.truth_((function (){var or__3936__auto__ = cljs.core.array_QMARK_(array);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return goog.isArrayLike(array);
+}
+})())){
+} else {
+throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
+}
+
+if(typeof idx === 'number'){
+} else {
+throw (new Error("Assert failed: (number? idx)"));
+}
+
+if(!((idx < (0)))){
+} else {
+throw (new Error("Assert failed: (not (neg? idx))"));
+}
+
+if((idx < array.length)){
+} else {
+throw (new Error("Assert failed: (< idx (alength array))"));
+}
+
+return (array[idx] = val);
+});
+
+cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idx2,idxv){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.checked_aset_SINGLEQUOTE_,cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2(array,idx),idx2,idxv);
+});
+
+/** @this {Function} */
+cljs.core.checked_aset_SINGLEQUOTE_.cljs$lang$applyTo = (function (seq579){
+var G__580 = cljs.core.first(seq579);
+var seq579__$1 = cljs.core.next(seq579);
+var G__581 = cljs.core.first(seq579__$1);
+var seq579__$2 = cljs.core.next(seq579__$1);
+var G__582 = cljs.core.first(seq579__$2);
+var seq579__$3 = cljs.core.next(seq579__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__580,G__581,G__582,seq579__$3);
+});
+
+cljs.core.checked_aset_SINGLEQUOTE_.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Returns the value at the index/indices. Works on JavaScript arrays.
+ */
+cljs.core.aget = (function cljs$core$aget(var_args){
+var G__592 = arguments.length;
+switch (G__592) {
+case 2:
+return cljs.core.aget.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___594 = arguments.length;
+var i__4519__auto___595 = (0);
+while(true){
+if((i__4519__auto___595 < len__4518__auto___594)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___595]));
+
+var G__596 = (i__4519__auto___595 + (1));
+i__4519__auto___595 = G__596;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.aget.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.aget.cljs$core$IFn$_invoke$arity$2 = (function (array,idx){
+return (array[idx]);
+});
+
+cljs.core.aget.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idxs){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.aget,(array[idx]),idxs);
+});
+
+/** @this {Function} */
+cljs.core.aget.cljs$lang$applyTo = (function (seq589){
+var G__590 = cljs.core.first(seq589);
+var seq589__$1 = cljs.core.next(seq589);
+var G__591 = cljs.core.first(seq589__$1);
+var seq589__$2 = cljs.core.next(seq589__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__590,G__591,seq589__$2);
+});
+
+cljs.core.aget.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Sets the value at the index/indices. Works on JavaScript arrays.
+ *   Returns val.
+ */
+cljs.core.aset = (function cljs$core$aset(var_args){
+var G__602 = arguments.length;
+switch (G__602) {
+case 3:
+return cljs.core.aset.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___604 = arguments.length;
+var i__4519__auto___605 = (0);
+while(true){
+if((i__4519__auto___605 < len__4518__auto___604)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___605]));
+
+var G__606 = (i__4519__auto___605 + (1));
+i__4519__auto___605 = G__606;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.aset.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.aset.cljs$core$IFn$_invoke$arity$3 = (function (array,idx,val){
+return (array[idx] = val);
+});
+
+cljs.core.aset.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idx2,idxv){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.aset,(array[idx]),idx2,idxv);
+});
+
+/** @this {Function} */
+cljs.core.aset.cljs$lang$applyTo = (function (seq598){
+var G__599 = cljs.core.first(seq598);
+var seq598__$1 = cljs.core.next(seq598);
+var G__600 = cljs.core.first(seq598__$1);
+var seq598__$2 = cljs.core.next(seq598__$1);
+var G__601 = cljs.core.first(seq598__$2);
+var seq598__$3 = cljs.core.next(seq598__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__599,G__600,G__601,seq598__$3);
+});
+
+cljs.core.aset.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Returns the length of the array. Works on arrays of all types.
+ */
+cljs.core.alength = (function cljs$core$alength(array){
+return array.length;
+});
+/**
+ * Returns an array with components set to the values in aseq. Optional type
+ *   argument accepted for compatibility with Clojure.
+ */
+cljs.core.into_array = (function cljs$core$into_array(var_args){
+var G__608 = arguments.length;
+switch (G__608) {
+case 1:
+return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.into_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.into_array.cljs$core$IFn$_invoke$arity$1 = (function (aseq){
+return cljs.core.into_array.cljs$core$IFn$_invoke$arity$2(null,aseq);
+});
+
+cljs.core.into_array.cljs$core$IFn$_invoke$arity$2 = (function (type,aseq){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (a,x){
+a.push(x);
+
+return a;
+}),[],aseq);
+});
+
+cljs.core.into_array.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Invoke JavaScript object method via string. Needed when the
+ *   string is not a valid unquoted property name.
+ */
+cljs.core.js_invoke = (function cljs$core$js_invoke(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___613 = arguments.length;
+var i__4519__auto___614 = (0);
+while(true){
+if((i__4519__auto___614 < len__4518__auto___613)){
+args__4521__auto__.push((arguments[i__4519__auto___614]));
+
+var G__615 = (i__4519__auto___614 + (1));
+i__4519__auto___614 = G__615;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((2) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((2)),(0),null)):null);
+return cljs.core.js_invoke.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4522__auto__);
+});
+
+cljs.core.js_invoke.cljs$core$IFn$_invoke$arity$variadic = (function (obj,s,args){
+return (obj[s]).apply(obj,cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(args));
+});
+
+cljs.core.js_invoke.cljs$lang$maxFixedArity = (2);
+
+/** @this {Function} */
+cljs.core.js_invoke.cljs$lang$applyTo = (function (seq610){
+var G__611 = cljs.core.first(seq610);
+var seq610__$1 = cljs.core.next(seq610);
+var G__612 = cljs.core.first(seq610__$1);
+var seq610__$2 = cljs.core.next(seq610__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__611,G__612,seq610__$2);
+});
+
+
+/**
+ * Marker protocol
+ * @interface
+ */
+cljs.core.Fn = function(){};
+
+
+/**
+ * Protocol for adding the ability to invoke an object as a function.
+ *   For example, a vector can also be used to look up a value:
+ *   ([1 2 3 4] 1) => 2
+ * @interface
+ */
+cljs.core.IFn = function(){};
+
+cljs.core._invoke = (function cljs$core$_invoke(var_args){
+var G__617 = arguments.length;
+switch (G__617) {
+case 1:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+case 6:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+case 7:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$7((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]));
+
+break;
+case 8:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$8((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]));
+
+break;
+case 9:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$9((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]));
+
+break;
+case 10:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$10((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]));
+
+break;
+case 11:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$11((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]));
+
+break;
+case 12:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$12((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]));
+
+break;
+case 13:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$13((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]));
+
+break;
+case 14:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$14((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]));
+
+break;
+case 15:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$15((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]));
+
+break;
+case 16:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$16((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]));
+
+break;
+case 17:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$17((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]));
+
+break;
+case 18:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$18((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]));
+
+break;
+case 19:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$19((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]));
+
+break;
+case 20:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$20((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]),(arguments[(19)]));
+
+break;
+case 21:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$21((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]),(arguments[(19)]),(arguments[(20)]));
+
+break;
+case 22:
+return cljs.core._invoke.cljs$core$IFn$_invoke$arity$22((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]),(arguments[(19)]),(arguments[(20)]),(arguments[(21)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$1 = (function (this$){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$1 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$2 = (function (this$,a){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$2 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$2(this$,a);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,a) : m__4231__auto__.call(null,this$,a));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,a) : m__4231__auto____$1.call(null,this$,a));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$3 = (function (this$,a,b){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$3 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$3(this$,a,b);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(this$,a,b) : m__4231__auto__.call(null,this$,a,b));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,a,b) : m__4231__auto____$1.call(null,this$,a,b));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$4 = (function (this$,a,b,c){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$4 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$4(this$,a,b,c);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$4 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$4(this$,a,b,c) : m__4231__auto__.call(null,this$,a,b,c));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$4 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$4(this$,a,b,c) : m__4231__auto____$1.call(null,this$,a,b,c));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$5 = (function (this$,a,b,c,d){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$5 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$5(this$,a,b,c,d);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$5 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$5(this$,a,b,c,d) : m__4231__auto__.call(null,this$,a,b,c,d));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$5 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$5(this$,a,b,c,d) : m__4231__auto____$1.call(null,this$,a,b,c,d));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$6 = (function (this$,a,b,c,d,e){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$6 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$6(this$,a,b,c,d,e);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$6 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$6(this$,a,b,c,d,e) : m__4231__auto__.call(null,this$,a,b,c,d,e));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$6 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$6(this$,a,b,c,d,e) : m__4231__auto____$1.call(null,this$,a,b,c,d,e));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$7 = (function (this$,a,b,c,d,e,f){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$7 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$7(this$,a,b,c,d,e,f);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$7 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$7(this$,a,b,c,d,e,f) : m__4231__auto__.call(null,this$,a,b,c,d,e,f));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$7 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$7(this$,a,b,c,d,e,f) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$8 = (function (this$,a,b,c,d,e,f,g){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$8 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$8(this$,a,b,c,d,e,f,g);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$8 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$8(this$,a,b,c,d,e,f,g) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$8 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$8(this$,a,b,c,d,e,f,g) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$9 = (function (this$,a,b,c,d,e,f,g,h){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$9 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$9(this$,a,b,c,d,e,f,g,h);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$9 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$9(this$,a,b,c,d,e,f,g,h) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$9 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$9(this$,a,b,c,d,e,f,g,h) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$10 = (function (this$,a,b,c,d,e,f,g,h,i){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$10 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$10(this$,a,b,c,d,e,f,g,h,i);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$10 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$10(this$,a,b,c,d,e,f,g,h,i) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$10 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$10(this$,a,b,c,d,e,f,g,h,i) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$11 = (function (this$,a,b,c,d,e,f,g,h,i,j){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$11 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$11(this$,a,b,c,d,e,f,g,h,i,j);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$11 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$11(this$,a,b,c,d,e,f,g,h,i,j) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$11 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$11(this$,a,b,c,d,e,f,g,h,i,j) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$12 = (function (this$,a,b,c,d,e,f,g,h,i,j,k){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$12 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$12(this$,a,b,c,d,e,f,g,h,i,j,k);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$12 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$12(this$,a,b,c,d,e,f,g,h,i,j,k) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$12 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$12(this$,a,b,c,d,e,f,g,h,i,j,k) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$13 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$13 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$13(this$,a,b,c,d,e,f,g,h,i,j,k,l);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$13 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$13(this$,a,b,c,d,e,f,g,h,i,j,k,l) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$13 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$13(this$,a,b,c,d,e,f,g,h,i,j,k,l) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$14 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$14 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$14(this$,a,b,c,d,e,f,g,h,i,j,k,l,m);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$14 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$14(this$,a,b,c,d,e,f,g,h,i,j,k,l,m) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$14 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$14(this$,a,b,c,d,e,f,g,h,i,j,k,l,m) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$15 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$15 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$15(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$15 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$15(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$15 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$15(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$16 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$16 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$16(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$16 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$16(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$16 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$16(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$17 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$17 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$17(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$17 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$17(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$17 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$17(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$18 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$18 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$18(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$18 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$18(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$18 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$18(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$19 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$19 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$19(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$19 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$19(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$19 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$19(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$20 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$20 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$20(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$20 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$20(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$20 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$20(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$21 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$21 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$21(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$21 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$21(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$21 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$21(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$core$IFn$_invoke$arity$22 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+if(((!((this$ == null))) && (!((this$.cljs$core$IFn$_invoke$arity$22 == null))))){
+return this$.cljs$core$IFn$_invoke$arity$22(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._invoke[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$22 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$22(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest) : m__4231__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest));
+} else {
+var m__4231__auto____$1 = (cljs.core._invoke["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$22 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$22(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest) : m__4231__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest));
+} else {
+throw cljs.core.missing_protocol("IFn.-invoke",this$);
+}
+}
+}
+});
+
+cljs.core._invoke.cljs$lang$maxFixedArity = 22;
+
+
+
+/**
+ * Protocol for cloning a value.
+ * @interface
+ */
+cljs.core.ICloneable = function(){};
+
+/**
+ * Creates a clone of value.
+ */
+cljs.core._clone = (function cljs$core$_clone(value){
+if(((!((value == null))) && (!((value.cljs$core$ICloneable$_clone$arity$1 == null))))){
+return value.cljs$core$ICloneable$_clone$arity$1(value);
+} else {
+var x__4230__auto__ = (((value == null))?null:value);
+var m__4231__auto__ = (cljs.core._clone[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(value) : m__4231__auto__.call(null,value));
+} else {
+var m__4231__auto____$1 = (cljs.core._clone["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(value) : m__4231__auto____$1.call(null,value));
+} else {
+throw cljs.core.missing_protocol("ICloneable.-clone",value);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding the ability to count a collection in constant time.
+ * @interface
+ */
+cljs.core.ICounted = function(){};
+
+/**
+ * Calculates the count of coll in constant time. Used by cljs.core/count.
+ */
+cljs.core._count = (function cljs$core$_count(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$ICounted$_count$arity$1 == null))))){
+return coll.cljs$core$ICounted$_count$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._count[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._count["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("ICounted.-count",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for creating an empty collection.
+ * @interface
+ */
+cljs.core.IEmptyableCollection = function(){};
+
+/**
+ * Returns an empty collection of the same category as coll. Used
+ *   by cljs.core/empty.
+ */
+cljs.core._empty = (function cljs$core$_empty(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IEmptyableCollection$_empty$arity$1 == null))))){
+return coll.cljs$core$IEmptyableCollection$_empty$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._empty[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._empty["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IEmptyableCollection.-empty",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding to a collection.
+ * @interface
+ */
+cljs.core.ICollection = function(){};
+
+/**
+ * Returns a new collection of coll with o added to it. The new item
+ *   should be added to the most efficient place, e.g.
+ *   (conj [1 2 3 4] 5) => [1 2 3 4 5]
+ *   (conj '(2 3 4 5) 1) => '(1 2 3 4 5)
+ */
+cljs.core._conj = (function cljs$core$_conj(coll,o){
+if(((!((coll == null))) && (!((coll.cljs$core$ICollection$_conj$arity$2 == null))))){
+return coll.cljs$core$ICollection$_conj$arity$2(coll,o);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._conj[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,o) : m__4231__auto__.call(null,coll,o));
+} else {
+var m__4231__auto____$1 = (cljs.core._conj["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,o) : m__4231__auto____$1.call(null,coll,o));
+} else {
+throw cljs.core.missing_protocol("ICollection.-conj",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for collections to provide indexed-based access to their items.
+ * @interface
+ */
+cljs.core.IIndexed = function(){};
+
+/**
+ * Returns the value at the index n in the collection coll.
+ *   Returns not-found if index n is out of bounds and not-found is supplied.
+ */
+cljs.core._nth = (function cljs$core$_nth(var_args){
+var G__620 = arguments.length;
+switch (G__620) {
+case 2:
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core._nth.cljs$core$IFn$_invoke$arity$2 = (function (coll,n){
+if(((!((coll == null))) && (!((coll.cljs$core$IIndexed$_nth$arity$2 == null))))){
+return coll.cljs$core$IIndexed$_nth$arity$2(coll,n);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._nth[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,n) : m__4231__auto__.call(null,coll,n));
+} else {
+var m__4231__auto____$1 = (cljs.core._nth["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,n) : m__4231__auto____$1.call(null,coll,n));
+} else {
+throw cljs.core.missing_protocol("IIndexed.-nth",coll);
+}
+}
+}
+});
+
+cljs.core._nth.cljs$core$IFn$_invoke$arity$3 = (function (coll,n,not_found){
+if(((!((coll == null))) && (!((coll.cljs$core$IIndexed$_nth$arity$3 == null))))){
+return coll.cljs$core$IIndexed$_nth$arity$3(coll,n,not_found);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._nth[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(coll,n,not_found) : m__4231__auto__.call(null,coll,n,not_found));
+} else {
+var m__4231__auto____$1 = (cljs.core._nth["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,n,not_found) : m__4231__auto____$1.call(null,coll,n,not_found));
+} else {
+throw cljs.core.missing_protocol("IIndexed.-nth",coll);
+}
+}
+}
+});
+
+cljs.core._nth.cljs$lang$maxFixedArity = 3;
+
+
+
+/**
+ * Marker protocol indicating an array sequence.
+ * @interface
+ */
+cljs.core.ASeq = function(){};
+
+
+/**
+ * Protocol for collections to provide access to their items as sequences.
+ * @interface
+ */
+cljs.core.ISeq = function(){};
+
+/**
+ * Returns the first item in the collection coll. Used by cljs.core/first.
+ */
+cljs.core._first = (function cljs$core$_first(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$ISeq$_first$arity$1 == null))))){
+return coll.cljs$core$ISeq$_first$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._first[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._first["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("ISeq.-first",coll);
+}
+}
+}
+});
+
+/**
+ * Returns a new collection of coll without the first item. It should
+ *   always return a seq, e.g.
+ *   (rest []) => ()
+ *   (rest nil) => ()
+ */
+cljs.core._rest = (function cljs$core$_rest(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$ISeq$_rest$arity$1 == null))))){
+return coll.cljs$core$ISeq$_rest$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._rest[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._rest["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("ISeq.-rest",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for accessing the next items of a collection.
+ * @interface
+ */
+cljs.core.INext = function(){};
+
+/**
+ * Returns a new collection of coll without the first item. In contrast to
+ *   rest, it should return nil if there are no more items, e.g.
+ *   (next []) => nil
+ *   (next nil) => nil
+ */
+cljs.core._next = (function cljs$core$_next(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$INext$_next$arity$1 == null))))){
+return coll.cljs$core$INext$_next$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._next[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._next["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("INext.-next",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for looking up a value in a data structure.
+ * @interface
+ */
+cljs.core.ILookup = function(){};
+
+/**
+ * Use k to look up a value in o. If not-found is supplied and k is not
+ *   a valid value that can be used for look up, not-found is returned.
+ */
+cljs.core._lookup = (function cljs$core$_lookup(var_args){
+var G__623 = arguments.length;
+switch (G__623) {
+case 2:
+return cljs.core._lookup.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core._lookup.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core._lookup.cljs$core$IFn$_invoke$arity$2 = (function (o,k){
+if(((!((o == null))) && (!((o.cljs$core$ILookup$_lookup$arity$2 == null))))){
+return o.cljs$core$ILookup$_lookup$arity$2(o,k);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._lookup[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(o,k) : m__4231__auto__.call(null,o,k));
+} else {
+var m__4231__auto____$1 = (cljs.core._lookup["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(o,k) : m__4231__auto____$1.call(null,o,k));
+} else {
+throw cljs.core.missing_protocol("ILookup.-lookup",o);
+}
+}
+}
+});
+
+cljs.core._lookup.cljs$core$IFn$_invoke$arity$3 = (function (o,k,not_found){
+if(((!((o == null))) && (!((o.cljs$core$ILookup$_lookup$arity$3 == null))))){
+return o.cljs$core$ILookup$_lookup$arity$3(o,k,not_found);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._lookup[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(o,k,not_found) : m__4231__auto__.call(null,o,k,not_found));
+} else {
+var m__4231__auto____$1 = (cljs.core._lookup["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(o,k,not_found) : m__4231__auto____$1.call(null,o,k,not_found));
+} else {
+throw cljs.core.missing_protocol("ILookup.-lookup",o);
+}
+}
+}
+});
+
+cljs.core._lookup.cljs$lang$maxFixedArity = 3;
+
+
+
+/**
+ * Protocol for adding associativity to collections.
+ * @interface
+ */
+cljs.core.IAssociative = function(){};
+
+/**
+ * Returns true if k is a key in coll.
+ */
+cljs.core._contains_key_QMARK_ = (function cljs$core$_contains_key_QMARK_(coll,k){
+if(((!((coll == null))) && (!((coll.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 == null))))){
+return coll.cljs$core$IAssociative$_contains_key_QMARK_$arity$2(coll,k);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._contains_key_QMARK_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4231__auto__.call(null,coll,k));
+} else {
+var m__4231__auto____$1 = (cljs.core._contains_key_QMARK_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4231__auto____$1.call(null,coll,k));
+} else {
+throw cljs.core.missing_protocol("IAssociative.-contains-key?",coll);
+}
+}
+}
+});
+
+/**
+ * Returns a new collection of coll with a mapping from key k to
+ *   value v added to it.
+ */
+cljs.core._assoc = (function cljs$core$_assoc(coll,k,v){
+if(((!((coll == null))) && (!((coll.cljs$core$IAssociative$_assoc$arity$3 == null))))){
+return coll.cljs$core$IAssociative$_assoc$arity$3(coll,k,v);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._assoc[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(coll,k,v) : m__4231__auto__.call(null,coll,k,v));
+} else {
+var m__4231__auto____$1 = (cljs.core._assoc["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,k,v) : m__4231__auto____$1.call(null,coll,k,v));
+} else {
+throw cljs.core.missing_protocol("IAssociative.-assoc",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for implementing entry finding in collections.
+ * @interface
+ */
+cljs.core.IFind = function(){};
+
+/**
+ * Returns the map entry for key, or nil if key not present.
+ */
+cljs.core._find = (function cljs$core$_find(coll,k){
+if(((!((coll == null))) && (!((coll.cljs$core$IFind$_find$arity$2 == null))))){
+return coll.cljs$core$IFind$_find$arity$2(coll,k);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._find[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4231__auto__.call(null,coll,k));
+} else {
+var m__4231__auto____$1 = (cljs.core._find["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4231__auto____$1.call(null,coll,k));
+} else {
+throw cljs.core.missing_protocol("IFind.-find",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding mapping functionality to collections.
+ * @interface
+ */
+cljs.core.IMap = function(){};
+
+/**
+ * Returns a new collection of coll without the mapping for key k.
+ */
+cljs.core._dissoc = (function cljs$core$_dissoc(coll,k){
+if(((!((coll == null))) && (!((coll.cljs$core$IMap$_dissoc$arity$2 == null))))){
+return coll.cljs$core$IMap$_dissoc$arity$2(coll,k);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._dissoc[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4231__auto__.call(null,coll,k));
+} else {
+var m__4231__auto____$1 = (cljs.core._dissoc["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4231__auto____$1.call(null,coll,k));
+} else {
+throw cljs.core.missing_protocol("IMap.-dissoc",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for examining a map entry.
+ * @interface
+ */
+cljs.core.IMapEntry = function(){};
+
+/**
+ * Returns the key of the map entry.
+ */
+cljs.core._key = (function cljs$core$_key(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IMapEntry$_key$arity$1 == null))))){
+return coll.cljs$core$IMapEntry$_key$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._key[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._key["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IMapEntry.-key",coll);
+}
+}
+}
+});
+
+/**
+ * Returns the value of the map entry.
+ */
+cljs.core._val = (function cljs$core$_val(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IMapEntry$_val$arity$1 == null))))){
+return coll.cljs$core$IMapEntry$_val$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._val[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._val["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IMapEntry.-val",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding set functionality to a collection.
+ * @interface
+ */
+cljs.core.ISet = function(){};
+
+/**
+ * Returns a new collection of coll that does not contain v.
+ */
+cljs.core._disjoin = (function cljs$core$_disjoin(coll,v){
+if(((!((coll == null))) && (!((coll.cljs$core$ISet$_disjoin$arity$2 == null))))){
+return coll.cljs$core$ISet$_disjoin$arity$2(coll,v);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._disjoin[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,v) : m__4231__auto__.call(null,coll,v));
+} else {
+var m__4231__auto____$1 = (cljs.core._disjoin["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,v) : m__4231__auto____$1.call(null,coll,v));
+} else {
+throw cljs.core.missing_protocol("ISet.-disjoin",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for collections to provide access to their items as stacks. The top
+ *   of the stack should be accessed in the most efficient way for the different
+ *   data structures.
+ * @interface
+ */
+cljs.core.IStack = function(){};
+
+/**
+ * Returns the item from the top of the stack. Is used by cljs.core/peek.
+ */
+cljs.core._peek = (function cljs$core$_peek(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IStack$_peek$arity$1 == null))))){
+return coll.cljs$core$IStack$_peek$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._peek[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._peek["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IStack.-peek",coll);
+}
+}
+}
+});
+
+/**
+ * Returns a new stack without the item on top of the stack. Is used
+ *   by cljs.core/pop.
+ */
+cljs.core._pop = (function cljs$core$_pop(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IStack$_pop$arity$1 == null))))){
+return coll.cljs$core$IStack$_pop$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._pop[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._pop["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IStack.-pop",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding vector functionality to collections.
+ * @interface
+ */
+cljs.core.IVector = function(){};
+
+/**
+ * Returns a new vector with value val added at position n.
+ */
+cljs.core._assoc_n = (function cljs$core$_assoc_n(coll,n,val){
+if(((!((coll == null))) && (!((coll.cljs$core$IVector$_assoc_n$arity$3 == null))))){
+return coll.cljs$core$IVector$_assoc_n$arity$3(coll,n,val);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._assoc_n[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(coll,n,val) : m__4231__auto__.call(null,coll,n,val));
+} else {
+var m__4231__auto____$1 = (cljs.core._assoc_n["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,n,val) : m__4231__auto____$1.call(null,coll,n,val));
+} else {
+throw cljs.core.missing_protocol("IVector.-assoc-n",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding dereference functionality to a reference.
+ * @interface
+ */
+cljs.core.IDeref = function(){};
+
+/**
+ * Returns the value of the reference o.
+ */
+cljs.core._deref = (function cljs$core$_deref(o){
+if(((!((o == null))) && (!((o.cljs$core$IDeref$_deref$arity$1 == null))))){
+return o.cljs$core$IDeref$_deref$arity$1(o);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._deref[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto__.call(null,o));
+} else {
+var m__4231__auto____$1 = (cljs.core._deref["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto____$1.call(null,o));
+} else {
+throw cljs.core.missing_protocol("IDeref.-deref",o);
+}
+}
+}
+});
+
+
+/**
+ * @interface
+ */
+cljs.core.IDerefWithTimeout = function(){};
+
+cljs.core._deref_with_timeout = (function cljs$core$_deref_with_timeout(o,msec,timeout_val){
+if(((!((o == null))) && (!((o.cljs$core$IDerefWithTimeout$_deref_with_timeout$arity$3 == null))))){
+return o.cljs$core$IDerefWithTimeout$_deref_with_timeout$arity$3(o,msec,timeout_val);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._deref_with_timeout[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(o,msec,timeout_val) : m__4231__auto__.call(null,o,msec,timeout_val));
+} else {
+var m__4231__auto____$1 = (cljs.core._deref_with_timeout["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(o,msec,timeout_val) : m__4231__auto____$1.call(null,o,msec,timeout_val));
+} else {
+throw cljs.core.missing_protocol("IDerefWithTimeout.-deref-with-timeout",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for accessing the metadata of an object.
+ * @interface
+ */
+cljs.core.IMeta = function(){};
+
+/**
+ * Returns the metadata of object o.
+ */
+cljs.core._meta = (function cljs$core$_meta(o){
+if(((!((o == null))) && (!((o.cljs$core$IMeta$_meta$arity$1 == null))))){
+return o.cljs$core$IMeta$_meta$arity$1(o);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._meta[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto__.call(null,o));
+} else {
+var m__4231__auto____$1 = (cljs.core._meta["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto____$1.call(null,o));
+} else {
+throw cljs.core.missing_protocol("IMeta.-meta",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding metadata to an object.
+ * @interface
+ */
+cljs.core.IWithMeta = function(){};
+
+/**
+ * Returns a new object with value of o and metadata meta added to it.
+ */
+cljs.core._with_meta = (function cljs$core$_with_meta(o,meta){
+if(((!((o == null))) && (!((o.cljs$core$IWithMeta$_with_meta$arity$2 == null))))){
+return o.cljs$core$IWithMeta$_with_meta$arity$2(o,meta);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._with_meta[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(o,meta) : m__4231__auto__.call(null,o,meta));
+} else {
+var m__4231__auto____$1 = (cljs.core._with_meta["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(o,meta) : m__4231__auto____$1.call(null,o,meta));
+} else {
+throw cljs.core.missing_protocol("IWithMeta.-with-meta",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for seq types that can reduce themselves.
+ *   Called by cljs.core/reduce.
+ * @interface
+ */
+cljs.core.IReduce = function(){};
+
+/**
+ * f should be a function of 2 arguments. If start is not supplied,
+ *   returns the result of applying f to the first 2 items in coll, then
+ *   applying f to that result and the 3rd item, etc.
+ */
+cljs.core._reduce = (function cljs$core$_reduce(var_args){
+var G__626 = arguments.length;
+switch (G__626) {
+case 2:
+return cljs.core._reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core._reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core._reduce.cljs$core$IFn$_invoke$arity$2 = (function (coll,f){
+if(((!((coll == null))) && (!((coll.cljs$core$IReduce$_reduce$arity$2 == null))))){
+return coll.cljs$core$IReduce$_reduce$arity$2(coll,f);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._reduce[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,f) : m__4231__auto__.call(null,coll,f));
+} else {
+var m__4231__auto____$1 = (cljs.core._reduce["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,f) : m__4231__auto____$1.call(null,coll,f));
+} else {
+throw cljs.core.missing_protocol("IReduce.-reduce",coll);
+}
+}
+}
+});
+
+cljs.core._reduce.cljs$core$IFn$_invoke$arity$3 = (function (coll,f,start){
+if(((!((coll == null))) && (!((coll.cljs$core$IReduce$_reduce$arity$3 == null))))){
+return coll.cljs$core$IReduce$_reduce$arity$3(coll,f,start);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._reduce[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(coll,f,start) : m__4231__auto__.call(null,coll,f,start));
+} else {
+var m__4231__auto____$1 = (cljs.core._reduce["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,f,start) : m__4231__auto____$1.call(null,coll,f,start));
+} else {
+throw cljs.core.missing_protocol("IReduce.-reduce",coll);
+}
+}
+}
+});
+
+cljs.core._reduce.cljs$lang$maxFixedArity = 3;
+
+
+
+/**
+ * Protocol for associative types that can reduce themselves
+ *   via a function of key and val. Called by cljs.core/reduce-kv.
+ * @interface
+ */
+cljs.core.IKVReduce = function(){};
+
+/**
+ * Reduces an associative collection and returns the result. f should be
+ *   a function that takes three arguments.
+ */
+cljs.core._kv_reduce = (function cljs$core$_kv_reduce(coll,f,init){
+if(((!((coll == null))) && (!((coll.cljs$core$IKVReduce$_kv_reduce$arity$3 == null))))){
+return coll.cljs$core$IKVReduce$_kv_reduce$arity$3(coll,f,init);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._kv_reduce[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(coll,f,init) : m__4231__auto__.call(null,coll,f,init));
+} else {
+var m__4231__auto____$1 = (cljs.core._kv_reduce["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,f,init) : m__4231__auto____$1.call(null,coll,f,init));
+} else {
+throw cljs.core.missing_protocol("IKVReduce.-kv-reduce",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding value comparison functionality to a type.
+ * @interface
+ */
+cljs.core.IEquiv = function(){};
+
+/**
+ * Returns true if o and other are equal, false otherwise.
+ */
+cljs.core._equiv = (function cljs$core$_equiv(o,other){
+if(((!((o == null))) && (!((o.cljs$core$IEquiv$_equiv$arity$2 == null))))){
+return o.cljs$core$IEquiv$_equiv$arity$2(o,other);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._equiv[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(o,other) : m__4231__auto__.call(null,o,other));
+} else {
+var m__4231__auto____$1 = (cljs.core._equiv["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(o,other) : m__4231__auto____$1.call(null,o,other));
+} else {
+throw cljs.core.missing_protocol("IEquiv.-equiv",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding hashing functionality to a type.
+ * @interface
+ */
+cljs.core.IHash = function(){};
+
+/**
+ * Returns the hash code of o.
+ */
+cljs.core._hash = (function cljs$core$_hash(o){
+if(((!((o == null))) && (!((o.cljs$core$IHash$_hash$arity$1 == null))))){
+return o.cljs$core$IHash$_hash$arity$1(o);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._hash[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto__.call(null,o));
+} else {
+var m__4231__auto____$1 = (cljs.core._hash["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto____$1.call(null,o));
+} else {
+throw cljs.core.missing_protocol("IHash.-hash",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding the ability to a type to be transformed into a sequence.
+ * @interface
+ */
+cljs.core.ISeqable = function(){};
+
+/**
+ * Returns a seq of o, or nil if o is empty.
+ */
+cljs.core._seq = (function cljs$core$_seq(o){
+if(((!((o == null))) && (!((o.cljs$core$ISeqable$_seq$arity$1 == null))))){
+return o.cljs$core$ISeqable$_seq$arity$1(o);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._seq[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto__.call(null,o));
+} else {
+var m__4231__auto____$1 = (cljs.core._seq["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4231__auto____$1.call(null,o));
+} else {
+throw cljs.core.missing_protocol("ISeqable.-seq",o);
+}
+}
+}
+});
+
+
+/**
+ * Marker interface indicating a persistent collection of sequential items
+ * @interface
+ */
+cljs.core.ISequential = function(){};
+
+
+/**
+ * Marker interface indicating a persistent list
+ * @interface
+ */
+cljs.core.IList = function(){};
+
+
+/**
+ * Marker interface indicating a record object
+ * @interface
+ */
+cljs.core.IRecord = function(){};
+
+
+/**
+ * Protocol for reversing a seq.
+ * @interface
+ */
+cljs.core.IReversible = function(){};
+
+/**
+ * Returns a seq of the items in coll in reversed order.
+ */
+cljs.core._rseq = (function cljs$core$_rseq(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IReversible$_rseq$arity$1 == null))))){
+return coll.cljs$core$IReversible$_rseq$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._rseq[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._rseq["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IReversible.-rseq",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for a collection which can represent their items
+ *   in a sorted manner. 
+ * @interface
+ */
+cljs.core.ISorted = function(){};
+
+/**
+ * Returns a sorted seq from coll in either ascending or descending order.
+ */
+cljs.core._sorted_seq = (function cljs$core$_sorted_seq(coll,ascending_QMARK_){
+if(((!((coll == null))) && (!((coll.cljs$core$ISorted$_sorted_seq$arity$2 == null))))){
+return coll.cljs$core$ISorted$_sorted_seq$arity$2(coll,ascending_QMARK_);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._sorted_seq[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,ascending_QMARK_) : m__4231__auto__.call(null,coll,ascending_QMARK_));
+} else {
+var m__4231__auto____$1 = (cljs.core._sorted_seq["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,ascending_QMARK_) : m__4231__auto____$1.call(null,coll,ascending_QMARK_));
+} else {
+throw cljs.core.missing_protocol("ISorted.-sorted-seq",coll);
+}
+}
+}
+});
+
+/**
+ * Returns a sorted seq from coll in either ascending or descending order.
+ *   If ascending is true, the result should contain all items which are > or >=
+ *   than k. If ascending is false, the result should contain all items which
+ *   are < or <= than k, e.g.
+ *   (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 true) => (3 4 5)
+ *   (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 false) => (3 2 1)
+ */
+cljs.core._sorted_seq_from = (function cljs$core$_sorted_seq_from(coll,k,ascending_QMARK_){
+if(((!((coll == null))) && (!((coll.cljs$core$ISorted$_sorted_seq_from$arity$3 == null))))){
+return coll.cljs$core$ISorted$_sorted_seq_from$arity$3(coll,k,ascending_QMARK_);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._sorted_seq_from[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(coll,k,ascending_QMARK_) : m__4231__auto__.call(null,coll,k,ascending_QMARK_));
+} else {
+var m__4231__auto____$1 = (cljs.core._sorted_seq_from["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,k,ascending_QMARK_) : m__4231__auto____$1.call(null,coll,k,ascending_QMARK_));
+} else {
+throw cljs.core.missing_protocol("ISorted.-sorted-seq-from",coll);
+}
+}
+}
+});
+
+/**
+ * Returns the key for entry.
+ */
+cljs.core._entry_key = (function cljs$core$_entry_key(coll,entry){
+if(((!((coll == null))) && (!((coll.cljs$core$ISorted$_entry_key$arity$2 == null))))){
+return coll.cljs$core$ISorted$_entry_key$arity$2(coll,entry);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._entry_key[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(coll,entry) : m__4231__auto__.call(null,coll,entry));
+} else {
+var m__4231__auto____$1 = (cljs.core._entry_key["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,entry) : m__4231__auto____$1.call(null,coll,entry));
+} else {
+throw cljs.core.missing_protocol("ISorted.-entry-key",coll);
+}
+}
+}
+});
+
+/**
+ * Returns the comparator for coll.
+ */
+cljs.core._comparator = (function cljs$core$_comparator(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$ISorted$_comparator$arity$1 == null))))){
+return coll.cljs$core$ISorted$_comparator$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._comparator[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._comparator["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("ISorted.-comparator",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for writing. Currently only implemented by StringBufferWriter.
+ * @interface
+ */
+cljs.core.IWriter = function(){};
+
+/**
+ * Writes s with writer and returns the result.
+ */
+cljs.core._write = (function cljs$core$_write(writer,s){
+if(((!((writer == null))) && (!((writer.cljs$core$IWriter$_write$arity$2 == null))))){
+return writer.cljs$core$IWriter$_write$arity$2(writer,s);
+} else {
+var x__4230__auto__ = (((writer == null))?null:writer);
+var m__4231__auto__ = (cljs.core._write[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(writer,s) : m__4231__auto__.call(null,writer,s));
+} else {
+var m__4231__auto____$1 = (cljs.core._write["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(writer,s) : m__4231__auto____$1.call(null,writer,s));
+} else {
+throw cljs.core.missing_protocol("IWriter.-write",writer);
+}
+}
+}
+});
+
+/**
+ * Flush writer.
+ */
+cljs.core._flush = (function cljs$core$_flush(writer){
+if(((!((writer == null))) && (!((writer.cljs$core$IWriter$_flush$arity$1 == null))))){
+return writer.cljs$core$IWriter$_flush$arity$1(writer);
+} else {
+var x__4230__auto__ = (((writer == null))?null:writer);
+var m__4231__auto__ = (cljs.core._flush[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(writer) : m__4231__auto__.call(null,writer));
+} else {
+var m__4231__auto____$1 = (cljs.core._flush["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(writer) : m__4231__auto____$1.call(null,writer));
+} else {
+throw cljs.core.missing_protocol("IWriter.-flush",writer);
+}
+}
+}
+});
+
+
+/**
+ * The old IPrintable protocol's implementation consisted of building a giant
+ * list of strings to concatenate.  This involved lots of concat calls,
+ * intermediate vectors, and lazy-seqs, and was very slow in some older JS
+ * engines.  IPrintWithWriter implements printing via the IWriter protocol, so it
+ * be implemented efficiently in terms of e.g. a StringBuffer append.
+ * @interface
+ */
+cljs.core.IPrintWithWriter = function(){};
+
+cljs.core._pr_writer = (function cljs$core$_pr_writer(o,writer,opts){
+if(((!((o == null))) && (!((o.cljs$core$IPrintWithWriter$_pr_writer$arity$3 == null))))){
+return o.cljs$core$IPrintWithWriter$_pr_writer$arity$3(o,writer,opts);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._pr_writer[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(o,writer,opts) : m__4231__auto__.call(null,o,writer,opts));
+} else {
+var m__4231__auto____$1 = (cljs.core._pr_writer["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(o,writer,opts) : m__4231__auto____$1.call(null,o,writer,opts));
+} else {
+throw cljs.core.missing_protocol("IPrintWithWriter.-pr-writer",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for types which can have a deferred realization. Currently only
+ *   implemented by Delay and LazySeq.
+ * @interface
+ */
+cljs.core.IPending = function(){};
+
+/**
+ * Returns true if a value for x has been produced, false otherwise.
+ */
+cljs.core._realized_QMARK_ = (function cljs$core$_realized_QMARK_(x){
+if(((!((x == null))) && (!((x.cljs$core$IPending$_realized_QMARK_$arity$1 == null))))){
+return x.cljs$core$IPending$_realized_QMARK_$arity$1(x);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (cljs.core._realized_QMARK_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto__.call(null,x));
+} else {
+var m__4231__auto____$1 = (cljs.core._realized_QMARK_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto____$1.call(null,x));
+} else {
+throw cljs.core.missing_protocol("IPending.-realized?",x);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for types that can be watched. Currently only implemented by Atom.
+ * @interface
+ */
+cljs.core.IWatchable = function(){};
+
+/**
+ * Calls all watchers with this, oldval and newval.
+ */
+cljs.core._notify_watches = (function cljs$core$_notify_watches(this$,oldval,newval){
+if(((!((this$ == null))) && (!((this$.cljs$core$IWatchable$_notify_watches$arity$3 == null))))){
+return this$.cljs$core$IWatchable$_notify_watches$arity$3(this$,oldval,newval);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._notify_watches[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(this$,oldval,newval) : m__4231__auto__.call(null,this$,oldval,newval));
+} else {
+var m__4231__auto____$1 = (cljs.core._notify_watches["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,oldval,newval) : m__4231__auto____$1.call(null,this$,oldval,newval));
+} else {
+throw cljs.core.missing_protocol("IWatchable.-notify-watches",this$);
+}
+}
+}
+});
+
+/**
+ * Adds a watcher function f to this. Keys must be unique per reference,
+ *   and can be used to remove the watch with -remove-watch.
+ */
+cljs.core._add_watch = (function cljs$core$_add_watch(this$,key,f){
+if(((!((this$ == null))) && (!((this$.cljs$core$IWatchable$_add_watch$arity$3 == null))))){
+return this$.cljs$core$IWatchable$_add_watch$arity$3(this$,key,f);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._add_watch[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(this$,key,f) : m__4231__auto__.call(null,this$,key,f));
+} else {
+var m__4231__auto____$1 = (cljs.core._add_watch["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,key,f) : m__4231__auto____$1.call(null,this$,key,f));
+} else {
+throw cljs.core.missing_protocol("IWatchable.-add-watch",this$);
+}
+}
+}
+});
+
+/**
+ * Removes watcher that corresponds to key from this.
+ */
+cljs.core._remove_watch = (function cljs$core$_remove_watch(this$,key){
+if(((!((this$ == null))) && (!((this$.cljs$core$IWatchable$_remove_watch$arity$2 == null))))){
+return this$.cljs$core$IWatchable$_remove_watch$arity$2(this$,key);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (cljs.core._remove_watch[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,key) : m__4231__auto__.call(null,this$,key));
+} else {
+var m__4231__auto____$1 = (cljs.core._remove_watch["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,key) : m__4231__auto____$1.call(null,this$,key));
+} else {
+throw cljs.core.missing_protocol("IWatchable.-remove-watch",this$);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for collections which can transformed to transients.
+ * @interface
+ */
+cljs.core.IEditableCollection = function(){};
+
+/**
+ * Returns a new, transient version of the collection, in constant time.
+ */
+cljs.core._as_transient = (function cljs$core$_as_transient(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IEditableCollection$_as_transient$arity$1 == null))))){
+return coll.cljs$core$IEditableCollection$_as_transient$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._as_transient[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._as_transient["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IEditableCollection.-as-transient",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding basic functionality to transient collections.
+ * @interface
+ */
+cljs.core.ITransientCollection = function(){};
+
+/**
+ * Adds value val to tcoll and returns tcoll.
+ */
+cljs.core._conj_BANG_ = (function cljs$core$_conj_BANG_(tcoll,val){
+if(((!((tcoll == null))) && (!((tcoll.cljs$core$ITransientCollection$_conj_BANG_$arity$2 == null))))){
+return tcoll.cljs$core$ITransientCollection$_conj_BANG_$arity$2(tcoll,val);
+} else {
+var x__4230__auto__ = (((tcoll == null))?null:tcoll);
+var m__4231__auto__ = (cljs.core._conj_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(tcoll,val) : m__4231__auto__.call(null,tcoll,val));
+} else {
+var m__4231__auto____$1 = (cljs.core._conj_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(tcoll,val) : m__4231__auto____$1.call(null,tcoll,val));
+} else {
+throw cljs.core.missing_protocol("ITransientCollection.-conj!",tcoll);
+}
+}
+}
+});
+
+/**
+ * Creates a persistent data structure from tcoll and returns it.
+ */
+cljs.core._persistent_BANG_ = (function cljs$core$_persistent_BANG_(tcoll){
+if(((!((tcoll == null))) && (!((tcoll.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 == null))))){
+return tcoll.cljs$core$ITransientCollection$_persistent_BANG_$arity$1(tcoll);
+} else {
+var x__4230__auto__ = (((tcoll == null))?null:tcoll);
+var m__4231__auto__ = (cljs.core._persistent_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4231__auto__.call(null,tcoll));
+} else {
+var m__4231__auto____$1 = (cljs.core._persistent_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4231__auto____$1.call(null,tcoll));
+} else {
+throw cljs.core.missing_protocol("ITransientCollection.-persistent!",tcoll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding associativity to transient collections.
+ * @interface
+ */
+cljs.core.ITransientAssociative = function(){};
+
+/**
+ * Returns a new transient collection of tcoll with a mapping from key to
+ *   val added to it.
+ */
+cljs.core._assoc_BANG_ = (function cljs$core$_assoc_BANG_(tcoll,key,val){
+if(((!((tcoll == null))) && (!((tcoll.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 == null))))){
+return tcoll.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(tcoll,key,val);
+} else {
+var x__4230__auto__ = (((tcoll == null))?null:tcoll);
+var m__4231__auto__ = (cljs.core._assoc_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(tcoll,key,val) : m__4231__auto__.call(null,tcoll,key,val));
+} else {
+var m__4231__auto____$1 = (cljs.core._assoc_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(tcoll,key,val) : m__4231__auto____$1.call(null,tcoll,key,val));
+} else {
+throw cljs.core.missing_protocol("ITransientAssociative.-assoc!",tcoll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding mapping functionality to transient collections.
+ * @interface
+ */
+cljs.core.ITransientMap = function(){};
+
+/**
+ * Returns a new transient collection of tcoll without the mapping for key.
+ */
+cljs.core._dissoc_BANG_ = (function cljs$core$_dissoc_BANG_(tcoll,key){
+if(((!((tcoll == null))) && (!((tcoll.cljs$core$ITransientMap$_dissoc_BANG_$arity$2 == null))))){
+return tcoll.cljs$core$ITransientMap$_dissoc_BANG_$arity$2(tcoll,key);
+} else {
+var x__4230__auto__ = (((tcoll == null))?null:tcoll);
+var m__4231__auto__ = (cljs.core._dissoc_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(tcoll,key) : m__4231__auto__.call(null,tcoll,key));
+} else {
+var m__4231__auto____$1 = (cljs.core._dissoc_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(tcoll,key) : m__4231__auto____$1.call(null,tcoll,key));
+} else {
+throw cljs.core.missing_protocol("ITransientMap.-dissoc!",tcoll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding vector functionality to transient collections.
+ * @interface
+ */
+cljs.core.ITransientVector = function(){};
+
+/**
+ * Returns tcoll with value val added at position n.
+ */
+cljs.core._assoc_n_BANG_ = (function cljs$core$_assoc_n_BANG_(tcoll,n,val){
+if(((!((tcoll == null))) && (!((tcoll.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3 == null))))){
+return tcoll.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3(tcoll,n,val);
+} else {
+var x__4230__auto__ = (((tcoll == null))?null:tcoll);
+var m__4231__auto__ = (cljs.core._assoc_n_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(tcoll,n,val) : m__4231__auto__.call(null,tcoll,n,val));
+} else {
+var m__4231__auto____$1 = (cljs.core._assoc_n_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(tcoll,n,val) : m__4231__auto____$1.call(null,tcoll,n,val));
+} else {
+throw cljs.core.missing_protocol("ITransientVector.-assoc-n!",tcoll);
+}
+}
+}
+});
+
+/**
+ * Returns tcoll with the last item removed from it.
+ */
+cljs.core._pop_BANG_ = (function cljs$core$_pop_BANG_(tcoll){
+if(((!((tcoll == null))) && (!((tcoll.cljs$core$ITransientVector$_pop_BANG_$arity$1 == null))))){
+return tcoll.cljs$core$ITransientVector$_pop_BANG_$arity$1(tcoll);
+} else {
+var x__4230__auto__ = (((tcoll == null))?null:tcoll);
+var m__4231__auto__ = (cljs.core._pop_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4231__auto__.call(null,tcoll));
+} else {
+var m__4231__auto____$1 = (cljs.core._pop_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4231__auto____$1.call(null,tcoll));
+} else {
+throw cljs.core.missing_protocol("ITransientVector.-pop!",tcoll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding set functionality to a transient collection.
+ * @interface
+ */
+cljs.core.ITransientSet = function(){};
+
+/**
+ * Returns tcoll without v.
+ */
+cljs.core._disjoin_BANG_ = (function cljs$core$_disjoin_BANG_(tcoll,v){
+if(((!((tcoll == null))) && (!((tcoll.cljs$core$ITransientSet$_disjoin_BANG_$arity$2 == null))))){
+return tcoll.cljs$core$ITransientSet$_disjoin_BANG_$arity$2(tcoll,v);
+} else {
+var x__4230__auto__ = (((tcoll == null))?null:tcoll);
+var m__4231__auto__ = (cljs.core._disjoin_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(tcoll,v) : m__4231__auto__.call(null,tcoll,v));
+} else {
+var m__4231__auto____$1 = (cljs.core._disjoin_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(tcoll,v) : m__4231__auto____$1.call(null,tcoll,v));
+} else {
+throw cljs.core.missing_protocol("ITransientSet.-disjoin!",tcoll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for values that can be compared.
+ * @interface
+ */
+cljs.core.IComparable = function(){};
+
+/**
+ * Returns a negative number, zero, or a positive number when x is logically
+ *   'less than', 'equal to', or 'greater than' y.
+ */
+cljs.core._compare = (function cljs$core$_compare(x,y){
+if(((!((x == null))) && (!((x.cljs$core$IComparable$_compare$arity$2 == null))))){
+return x.cljs$core$IComparable$_compare$arity$2(x,y);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (cljs.core._compare[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(x,y) : m__4231__auto__.call(null,x,y));
+} else {
+var m__4231__auto____$1 = (cljs.core._compare["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(x,y) : m__4231__auto____$1.call(null,x,y));
+} else {
+throw cljs.core.missing_protocol("IComparable.-compare",x);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for accessing the items of a chunk.
+ * @interface
+ */
+cljs.core.IChunk = function(){};
+
+/**
+ * Return a new chunk of coll with the first item removed.
+ */
+cljs.core._drop_first = (function cljs$core$_drop_first(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IChunk$_drop_first$arity$1 == null))))){
+return coll.cljs$core$IChunk$_drop_first$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._drop_first[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._drop_first["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IChunk.-drop-first",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for accessing a collection as sequential chunks.
+ * @interface
+ */
+cljs.core.IChunkedSeq = function(){};
+
+/**
+ * Returns the first chunk in coll.
+ */
+cljs.core._chunked_first = (function cljs$core$_chunked_first(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IChunkedSeq$_chunked_first$arity$1 == null))))){
+return coll.cljs$core$IChunkedSeq$_chunked_first$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._chunked_first[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._chunked_first["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IChunkedSeq.-chunked-first",coll);
+}
+}
+}
+});
+
+/**
+ * Return a new collection of coll with the first chunk removed.
+ */
+cljs.core._chunked_rest = (function cljs$core$_chunked_rest(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IChunkedSeq$_chunked_rest$arity$1 == null))))){
+return coll.cljs$core$IChunkedSeq$_chunked_rest$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._chunked_rest[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._chunked_rest["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IChunkedSeq.-chunked-rest",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for accessing the chunks of a collection.
+ * @interface
+ */
+cljs.core.IChunkedNext = function(){};
+
+/**
+ * Returns a new collection of coll without the first chunk.
+ */
+cljs.core._chunked_next = (function cljs$core$_chunked_next(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IChunkedNext$_chunked_next$arity$1 == null))))){
+return coll.cljs$core$IChunkedNext$_chunked_next$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._chunked_next[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._chunked_next["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IChunkedNext.-chunked-next",coll);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding a name.
+ * @interface
+ */
+cljs.core.INamed = function(){};
+
+/**
+ * Returns the name String of x.
+ */
+cljs.core._name = (function cljs$core$_name(x){
+if(((!((x == null))) && (!((x.cljs$core$INamed$_name$arity$1 == null))))){
+return x.cljs$core$INamed$_name$arity$1(x);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (cljs.core._name[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto__.call(null,x));
+} else {
+var m__4231__auto____$1 = (cljs.core._name["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto____$1.call(null,x));
+} else {
+throw cljs.core.missing_protocol("INamed.-name",x);
+}
+}
+}
+});
+
+/**
+ * Returns the namespace String of x.
+ */
+cljs.core._namespace = (function cljs$core$_namespace(x){
+if(((!((x == null))) && (!((x.cljs$core$INamed$_namespace$arity$1 == null))))){
+return x.cljs$core$INamed$_namespace$arity$1(x);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (cljs.core._namespace[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto__.call(null,x));
+} else {
+var m__4231__auto____$1 = (cljs.core._namespace["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto____$1.call(null,x));
+} else {
+throw cljs.core.missing_protocol("INamed.-namespace",x);
+}
+}
+}
+});
+
+
+/**
+ * Marker protocol indicating an atom.
+ * @interface
+ */
+cljs.core.IAtom = function(){};
+
+
+/**
+ * Protocol for adding resetting functionality.
+ * @interface
+ */
+cljs.core.IReset = function(){};
+
+/**
+ * Sets the value of o to new-value.
+ */
+cljs.core._reset_BANG_ = (function cljs$core$_reset_BANG_(o,new_value){
+if(((!((o == null))) && (!((o.cljs$core$IReset$_reset_BANG_$arity$2 == null))))){
+return o.cljs$core$IReset$_reset_BANG_$arity$2(o,new_value);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._reset_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4231__auto__.call(null,o,new_value));
+} else {
+var m__4231__auto____$1 = (cljs.core._reset_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4231__auto____$1.call(null,o,new_value));
+} else {
+throw cljs.core.missing_protocol("IReset.-reset!",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for adding swapping functionality.
+ * @interface
+ */
+cljs.core.ISwap = function(){};
+
+/**
+ * Swaps the value of o to be (apply f current-value-of-atom args).
+ */
+cljs.core._swap_BANG_ = (function cljs$core$_swap_BANG_(var_args){
+var G__629 = arguments.length;
+switch (G__629) {
+case 2:
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (o,f){
+if(((!((o == null))) && (!((o.cljs$core$ISwap$_swap_BANG_$arity$2 == null))))){
+return o.cljs$core$ISwap$_swap_BANG_$arity$2(o,f);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(o,f) : m__4231__auto__.call(null,o,f));
+} else {
+var m__4231__auto____$1 = (cljs.core._swap_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(o,f) : m__4231__auto____$1.call(null,o,f));
+} else {
+throw cljs.core.missing_protocol("ISwap.-swap!",o);
+}
+}
+}
+});
+
+cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (o,f,a){
+if(((!((o == null))) && (!((o.cljs$core$ISwap$_swap_BANG_$arity$3 == null))))){
+return o.cljs$core$ISwap$_swap_BANG_$arity$3(o,f,a);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(o,f,a) : m__4231__auto__.call(null,o,f,a));
+} else {
+var m__4231__auto____$1 = (cljs.core._swap_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(o,f,a) : m__4231__auto____$1.call(null,o,f,a));
+} else {
+throw cljs.core.missing_protocol("ISwap.-swap!",o);
+}
+}
+}
+});
+
+cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$4 = (function (o,f,a,b){
+if(((!((o == null))) && (!((o.cljs$core$ISwap$_swap_BANG_$arity$4 == null))))){
+return o.cljs$core$ISwap$_swap_BANG_$arity$4(o,f,a,b);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$4 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$4(o,f,a,b) : m__4231__auto__.call(null,o,f,a,b));
+} else {
+var m__4231__auto____$1 = (cljs.core._swap_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$4 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$4(o,f,a,b) : m__4231__auto____$1.call(null,o,f,a,b));
+} else {
+throw cljs.core.missing_protocol("ISwap.-swap!",o);
+}
+}
+}
+});
+
+cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$5 = (function (o,f,a,b,xs){
+if(((!((o == null))) && (!((o.cljs$core$ISwap$_swap_BANG_$arity$5 == null))))){
+return o.cljs$core$ISwap$_swap_BANG_$arity$5(o,f,a,b,xs);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$5 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$5(o,f,a,b,xs) : m__4231__auto__.call(null,o,f,a,b,xs));
+} else {
+var m__4231__auto____$1 = (cljs.core._swap_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$5 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$5(o,f,a,b,xs) : m__4231__auto____$1.call(null,o,f,a,b,xs));
+} else {
+throw cljs.core.missing_protocol("ISwap.-swap!",o);
+}
+}
+}
+});
+
+cljs.core._swap_BANG_.cljs$lang$maxFixedArity = 5;
+
+
+
+/**
+ * Protocol for adding volatile functionality.
+ * @interface
+ */
+cljs.core.IVolatile = function(){};
+
+/**
+ * Sets the value of volatile o to new-value without regard for the
+ *   current value. Returns new-value.
+ */
+cljs.core._vreset_BANG_ = (function cljs$core$_vreset_BANG_(o,new_value){
+if(((!((o == null))) && (!((o.cljs$core$IVolatile$_vreset_BANG_$arity$2 == null))))){
+return o.cljs$core$IVolatile$_vreset_BANG_$arity$2(o,new_value);
+} else {
+var x__4230__auto__ = (((o == null))?null:o);
+var m__4231__auto__ = (cljs.core._vreset_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4231__auto__.call(null,o,new_value));
+} else {
+var m__4231__auto____$1 = (cljs.core._vreset_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4231__auto____$1.call(null,o,new_value));
+} else {
+throw cljs.core.missing_protocol("IVolatile.-vreset!",o);
+}
+}
+}
+});
+
+
+/**
+ * Protocol for iterating over a collection.
+ * @interface
+ */
+cljs.core.IIterable = function(){};
+
+/**
+ * Returns an iterator for coll.
+ */
+cljs.core._iterator = (function cljs$core$_iterator(coll){
+if(((!((coll == null))) && (!((coll.cljs$core$IIterable$_iterator$arity$1 == null))))){
+return coll.cljs$core$IIterable$_iterator$arity$1(coll);
+} else {
+var x__4230__auto__ = (((coll == null))?null:coll);
+var m__4231__auto__ = (cljs.core._iterator[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto__.call(null,coll));
+} else {
+var m__4231__auto____$1 = (cljs.core._iterator["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4231__auto____$1.call(null,coll));
+} else {
+throw cljs.core.missing_protocol("IIterable.-iterator",coll);
+}
+}
+}
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IWriter}
+*/
+cljs.core.StringBufferWriter = (function (sb){
+this.sb = sb;
+this.cljs$lang$protocol_mask$partition0$ = 1073741824;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.StringBufferWriter.prototype.cljs$core$IWriter$_write$arity$2 = (function (_,s){
+var self__ = this;
+var ___$1 = this;
+return self__.sb.append(s);
+});
+
+cljs.core.StringBufferWriter.prototype.cljs$core$IWriter$_flush$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return null;
+});
+
+cljs.core.StringBufferWriter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$sb], null);
+});
+
+cljs.core.StringBufferWriter.cljs$lang$type = true;
+
+cljs.core.StringBufferWriter.cljs$lang$ctorStr = "cljs.core/StringBufferWriter";
+
+cljs.core.StringBufferWriter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/StringBufferWriter");
+});
+
+/**
+ * Positional factory function for cljs.core/StringBufferWriter.
+ */
+cljs.core.__GT_StringBufferWriter = (function cljs$core$__GT_StringBufferWriter(sb){
+return (new cljs.core.StringBufferWriter(sb));
+});
+
+/**
+ * Support so that collections can implement toString without
+ * loading all the printing machinery.
+ */
+cljs.core.pr_str_STAR_ = (function cljs$core$pr_str_STAR_(obj){
+var sb = (new goog.string.StringBuffer());
+var writer = (new cljs.core.StringBufferWriter(sb));
+obj.cljs$core$IPrintWithWriter$_pr_writer$arity$3(null,writer,cljs.core.pr_opts());
+
+writer.cljs$core$IWriter$_flush$arity$1(null);
+
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(sb)].join('');
+});
+cljs.core.int_rotate_left = (function cljs$core$int_rotate_left(x,n){
+return ((x << n) | (x >>> (- n)));
+});
+if((((typeof Math !== 'undefined') && (typeof Math.imul !== 'undefined')) && (!((Math.imul((4294967295),(5)) === (0)))))){
+cljs.core.imul = (function cljs$core$imul(a,b){
+return Math.imul(a,b);
+});
+} else {
+cljs.core.imul = (function cljs$core$imul(a,b){
+var ah = ((a >>> (16)) & (65535));
+var al = (a & (65535));
+var bh = ((b >>> (16)) & (65535));
+var bl = (b & (65535));
+return (((al * bl) + ((((ah * bl) + (al * bh)) << (16)) >>> (0))) | (0));
+});
+}
+cljs.core.m3_seed = (0);
+cljs.core.m3_C1 = ((3432918353) | (0));
+cljs.core.m3_C2 = ((461845907) | (0));
+cljs.core.m3_mix_K1 = (function cljs$core$m3_mix_K1(k1){
+return cljs.core.imul(cljs.core.int_rotate_left(cljs.core.imul((k1 | (0)),cljs.core.m3_C1),(15)),cljs.core.m3_C2);
+});
+cljs.core.m3_mix_H1 = (function cljs$core$m3_mix_H1(h1,k1){
+return ((cljs.core.imul(cljs.core.int_rotate_left(((h1 | (0)) ^ (k1 | (0))),(13)),(5)) + ((3864292196) | (0))) | (0));
+});
+cljs.core.m3_fmix = (function cljs$core$m3_fmix(h1,len){
+var h1__$1 = (h1 | (0));
+var h1__$2 = (h1__$1 ^ len);
+var h1__$3 = (h1__$2 ^ (h1__$2 >>> (16)));
+var h1__$4 = cljs.core.imul(h1__$3,((2246822507) | (0)));
+var h1__$5 = (h1__$4 ^ (h1__$4 >>> (13)));
+var h1__$6 = cljs.core.imul(h1__$5,((3266489909) | (0)));
+return (h1__$6 ^ (h1__$6 >>> (16)));
+});
+cljs.core.m3_hash_int = (function cljs$core$m3_hash_int(in$){
+if((in$ === (0))){
+return in$;
+} else {
+var k1 = cljs.core.m3_mix_K1(in$);
+var h1 = cljs.core.m3_mix_H1(cljs.core.m3_seed,k1);
+return cljs.core.m3_fmix(h1,(4));
+}
+});
+cljs.core.m3_hash_unencoded_chars = (function cljs$core$m3_hash_unencoded_chars(in$){
+var h1 = (function (){var i = (1);
+var h1 = cljs.core.m3_seed;
+while(true){
+if((i < in$.length)){
+var G__631 = (i + (2));
+var G__632 = cljs.core.m3_mix_H1(h1,cljs.core.m3_mix_K1((in$.charCodeAt((i - (1))) | (in$.charCodeAt(i) << (16)))));
+i = G__631;
+h1 = G__632;
+continue;
+} else {
+return h1;
+}
+break;
+}
+})();
+var h1__$1 = ((((in$.length & (1)) === (1)))?(h1 ^ cljs.core.m3_mix_K1(in$.charCodeAt((in$.length - (1))))):h1);
+return cljs.core.m3_fmix(h1__$1,cljs.core.imul((2),in$.length));
+});
+
+
+
+cljs.core.string_hash_cache = {};
+cljs.core.string_hash_cache_count = (0);
+cljs.core.hash_string_STAR_ = (function cljs$core$hash_string_STAR_(s){
+if(!((s == null))){
+var len = s.length;
+if((len > (0))){
+var i = (0);
+var hash = (0);
+while(true){
+if((i < len)){
+var G__635 = (i + (1));
+var G__636 = (cljs.core.imul((31),hash) + s.charCodeAt(i));
+i = G__635;
+hash = G__636;
+continue;
+} else {
+return hash;
+}
+break;
+}
+} else {
+return (0);
+}
+} else {
+return (0);
+}
+});
+cljs.core.add_to_string_hash_cache = (function cljs$core$add_to_string_hash_cache(k){
+var h = cljs.core.hash_string_STAR_(k);
+goog.object.set(cljs.core.string_hash_cache,k,h);
+
+cljs.core.string_hash_cache_count = (cljs.core.string_hash_cache_count + (1));
+
+return h;
+});
+cljs.core.hash_string = (function cljs$core$hash_string(k){
+if((cljs.core.string_hash_cache_count > (255))){
+cljs.core.string_hash_cache = {};
+
+cljs.core.string_hash_cache_count = (0);
+} else {
+}
+
+if((k == null)){
+return (0);
+} else {
+var h = (cljs.core.string_hash_cache[k]);
+if(typeof h === 'number'){
+return h;
+} else {
+return cljs.core.add_to_string_hash_cache(k);
+}
+}
+});
+/**
+ * Returns the hash code of its argument. Note this is the hash code
+ * consistent with =.
+ */
+cljs.core.hash = (function cljs$core$hash(o){
+if(((!((o == null)))?(((((o.cljs$lang$protocol_mask$partition0$ & (4194304))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IHash$))))?true:false):false)){
+return (o.cljs$core$IHash$_hash$arity$1(null) ^ (0));
+} else {
+if(typeof o === 'number'){
+if(cljs.core.truth_(isFinite(o))){
+return (Math.floor(o) % (2147483647));
+} else {
+var G__640 = o;
+switch (G__640) {
+case Infinity:
+return (2146435072);
+
+break;
+case -Infinity:
+return (-1048576);
+
+break;
+default:
+return (2146959360);
+
+}
+}
+} else {
+if(o === true){
+return (1231);
+} else {
+if(o === false){
+return (1237);
+} else {
+if(typeof o === 'string'){
+return cljs.core.m3_hash_int(cljs.core.hash_string(o));
+} else {
+if((o instanceof Date)){
+return (o.valueOf() ^ (0));
+} else {
+if((o == null)){
+return (0);
+} else {
+return (cljs.core._hash(o) ^ (0));
+
+}
+}
+}
+}
+}
+}
+}
+});
+cljs.core.hash_combine = (function cljs$core$hash_combine(seed,hash){
+return (seed ^ (((hash + (2654435769)) + (seed << (6))) + (seed >> (2))));
+});
+/**
+ * Evaluates x and tests if it is an instance of the type
+ *   c. Returns true or false
+ */
+cljs.core.instance_QMARK_ = (function cljs$core$instance_QMARK_(c,x){
+return (x instanceof c);
+});
+/**
+ * Return true if x is a Symbol
+ */
+cljs.core.symbol_QMARK_ = (function cljs$core$symbol_QMARK_(x){
+return (x instanceof cljs.core.Symbol);
+});
+cljs.core.hash_symbol = (function cljs$core$hash_symbol(sym){
+return cljs.core.hash_combine(cljs.core.m3_hash_unencoded_chars(sym.name),cljs.core.hash_string(sym.ns));
+});
+cljs.core.compare_symbols = (function cljs$core$compare_symbols(a,b){
+if((a.str === b.str)){
+return (0);
+} else {
+if(cljs.core.truth_((function (){var and__3925__auto__ = cljs.core.not(a.ns);
+if(and__3925__auto__){
+return b.ns;
+} else {
+return and__3925__auto__;
+}
+})())){
+return (-1);
+} else {
+if(cljs.core.truth_(a.ns)){
+if(cljs.core.not(b.ns)){
+return (1);
+} else {
+var nsc = (function (){var G__642 = a.ns;
+var G__643 = b.ns;
+return goog.array.defaultCompare(G__642,G__643);
+})();
+if(((0) === nsc)){
+var G__644 = a.name;
+var G__645 = b.name;
+return goog.array.defaultCompare(G__644,G__645);
+} else {
+return nsc;
+}
+}
+} else {
+var G__646 = a.name;
+var G__647 = b.name;
+return goog.array.defaultCompare(G__646,G__647);
+
+}
+}
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.INamed}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {cljs.core.IWithMeta}
+*/
+cljs.core.Symbol = (function (ns,name,str,_hash,_meta){
+this.ns = ns;
+this.name = name;
+this.str = str;
+this._hash = _hash;
+this._meta = _meta;
+this.cljs$lang$protocol_mask$partition0$ = 2154168321;
+this.cljs$lang$protocol_mask$partition1$ = 4096;
+});
+cljs.core.Symbol.prototype.toString = (function (){
+var self__ = this;
+var _ = this;
+return self__.str;
+});
+
+cljs.core.Symbol.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.Symbol.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+if((other instanceof cljs.core.Symbol)){
+return (self__.str === other.str);
+} else {
+return false;
+}
+});
+
+cljs.core.Symbol.prototype.call = (function() {
+var G__649 = null;
+var G__649__2 = (function (self__,coll){
+var self__ = this;
+var self____$1 = this;
+var sym = self____$1;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,sym);
+});
+var G__649__3 = (function (self__,coll,not_found){
+var self__ = this;
+var self____$1 = this;
+var sym = self____$1;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,sym,not_found);
+});
+G__649 = function(self__,coll,not_found){
+switch(arguments.length){
+case 2:
+return G__649__2.call(this,self__,coll);
+case 3:
+return G__649__3.call(this,self__,coll,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__649.cljs$core$IFn$_invoke$arity$2 = G__649__2;
+G__649.cljs$core$IFn$_invoke$arity$3 = G__649__3;
+return G__649;
+})()
+;
+
+cljs.core.Symbol.prototype.apply = (function (self__,args648){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args648)));
+});
+
+cljs.core.Symbol.prototype.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+var self__ = this;
+var sym = this;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,sym);
+});
+
+cljs.core.Symbol.prototype.cljs$core$IFn$_invoke$arity$2 = (function (coll,not_found){
+var self__ = this;
+var sym = this;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,sym,not_found);
+});
+
+cljs.core.Symbol.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__._meta;
+});
+
+cljs.core.Symbol.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_,new_meta){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.Symbol(self__.ns,self__.name,self__.str,self__._hash,new_meta));
+});
+
+cljs.core.Symbol.prototype.cljs$core$IHash$_hash$arity$1 = (function (sym){
+var self__ = this;
+var sym__$1 = this;
+var h__4048__auto__ = self__._hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_symbol(sym__$1);
+self__._hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.Symbol.prototype.cljs$core$INamed$_name$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.name;
+});
+
+cljs.core.Symbol.prototype.cljs$core$INamed$_namespace$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.ns;
+});
+
+cljs.core.Symbol.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (o,writer,_){
+var self__ = this;
+var o__$1 = this;
+return cljs.core._write(writer,self__.str);
+});
+
+cljs.core.Symbol.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$ns,cljs.core.cst$sym$name,cljs.core.cst$sym$str,cljs.core.with_meta(cljs.core.cst$sym$_hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$_meta], null);
+});
+
+cljs.core.Symbol.cljs$lang$type = true;
+
+cljs.core.Symbol.cljs$lang$ctorStr = "cljs.core/Symbol";
+
+cljs.core.Symbol.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Symbol");
+});
+
+/**
+ * Positional factory function for cljs.core/Symbol.
+ */
+cljs.core.__GT_Symbol = (function cljs$core$__GT_Symbol(ns,name,str,_hash,_meta){
+return (new cljs.core.Symbol(ns,name,str,_hash,_meta));
+});
+
+/**
+ * Returns a Symbol with the given namespace and name.
+ */
+cljs.core.symbol = (function cljs$core$symbol(var_args){
+var G__651 = arguments.length;
+switch (G__651) {
+case 1:
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.symbol.cljs$core$IFn$_invoke$arity$1 = (function (name){
+if((name instanceof cljs.core.Symbol)){
+return name;
+} else {
+var idx = name.indexOf("/");
+if((idx < (1))){
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(null,name);
+} else {
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(name.substring((0),idx),name.substring((idx + (1)),name.length));
+}
+}
+});
+
+cljs.core.symbol.cljs$core$IFn$_invoke$arity$2 = (function (ns,name){
+var sym_str = ((!((ns == null)))?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns),"/",cljs.core.str.cljs$core$IFn$_invoke$arity$1(name)].join(''):name);
+return (new cljs.core.Symbol(ns,name,sym_str,null,null));
+});
+
+cljs.core.symbol.cljs$lang$maxFixedArity = 2;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.Fn}
+ * @implements {cljs.core.IDeref}
+ * @implements {cljs.core.IWithMeta}
+*/
+cljs.core.Var = (function (val,sym,_meta){
+this.val = val;
+this.sym = sym;
+this._meta = _meta;
+this.cljs$lang$protocol_mask$partition0$ = 6717441;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.Var.prototype.isMacro = (function (){
+var self__ = this;
+var _ = this;
+return (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null)).cljs$lang$macro;
+});
+
+cljs.core.Var.prototype.toString = (function (){
+var self__ = this;
+var _ = this;
+return ["#'",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.sym)].join('');
+});
+
+cljs.core.Var.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+});
+
+cljs.core.Var.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__._meta;
+});
+
+cljs.core.Var.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_,new_meta){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.Var(self__.val,self__.sym,new_meta));
+});
+
+cljs.core.Var.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (this$,other){
+var self__ = this;
+var this$__$1 = this;
+if((other instanceof cljs.core.Var)){
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(this$__$1.sym,other.sym);
+} else {
+return false;
+}
+});
+
+cljs.core.Var.prototype.cljs$core$IHash$_hash$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.hash_symbol(self__.sym);
+});
+
+cljs.core.Var.prototype.cljs$core$Fn$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Var.prototype.call = (function() {
+var G__696 = null;
+var G__696__1 = (function (self__){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__654 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__654.cljs$core$IFn$_invoke$arity$0 ? fexpr__654.cljs$core$IFn$_invoke$arity$0() : fexpr__654.call(null));
+});
+var G__696__2 = (function (self__,a){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__655 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__655.cljs$core$IFn$_invoke$arity$1 ? fexpr__655.cljs$core$IFn$_invoke$arity$1(a) : fexpr__655.call(null,a));
+});
+var G__696__3 = (function (self__,a,b){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__656 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__656.cljs$core$IFn$_invoke$arity$2 ? fexpr__656.cljs$core$IFn$_invoke$arity$2(a,b) : fexpr__656.call(null,a,b));
+});
+var G__696__4 = (function (self__,a,b,c){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__657 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__657.cljs$core$IFn$_invoke$arity$3 ? fexpr__657.cljs$core$IFn$_invoke$arity$3(a,b,c) : fexpr__657.call(null,a,b,c));
+});
+var G__696__5 = (function (self__,a,b,c,d){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__658 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__658.cljs$core$IFn$_invoke$arity$4 ? fexpr__658.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : fexpr__658.call(null,a,b,c,d));
+});
+var G__696__6 = (function (self__,a,b,c,d,e){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__659 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__659.cljs$core$IFn$_invoke$arity$5 ? fexpr__659.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : fexpr__659.call(null,a,b,c,d,e));
+});
+var G__696__7 = (function (self__,a,b,c,d,e,f){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__660 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__660.cljs$core$IFn$_invoke$arity$6 ? fexpr__660.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : fexpr__660.call(null,a,b,c,d,e,f));
+});
+var G__696__8 = (function (self__,a,b,c,d,e,f,g){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__661 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__661.cljs$core$IFn$_invoke$arity$7 ? fexpr__661.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : fexpr__661.call(null,a,b,c,d,e,f,g));
+});
+var G__696__9 = (function (self__,a,b,c,d,e,f,g,h){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__662 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__662.cljs$core$IFn$_invoke$arity$8 ? fexpr__662.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : fexpr__662.call(null,a,b,c,d,e,f,g,h));
+});
+var G__696__10 = (function (self__,a,b,c,d,e,f,g,h,i){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__663 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__663.cljs$core$IFn$_invoke$arity$9 ? fexpr__663.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : fexpr__663.call(null,a,b,c,d,e,f,g,h,i));
+});
+var G__696__11 = (function (self__,a,b,c,d,e,f,g,h,i,j){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__664 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__664.cljs$core$IFn$_invoke$arity$10 ? fexpr__664.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : fexpr__664.call(null,a,b,c,d,e,f,g,h,i,j));
+});
+var G__696__12 = (function (self__,a,b,c,d,e,f,g,h,i,j,k){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__665 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__665.cljs$core$IFn$_invoke$arity$11 ? fexpr__665.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : fexpr__665.call(null,a,b,c,d,e,f,g,h,i,j,k));
+});
+var G__696__13 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__666 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__666.cljs$core$IFn$_invoke$arity$12 ? fexpr__666.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : fexpr__666.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+});
+var G__696__14 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__667 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__667.cljs$core$IFn$_invoke$arity$13 ? fexpr__667.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : fexpr__667.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+});
+var G__696__15 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__668 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__668.cljs$core$IFn$_invoke$arity$14 ? fexpr__668.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : fexpr__668.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+});
+var G__696__16 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__669 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__669.cljs$core$IFn$_invoke$arity$15 ? fexpr__669.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : fexpr__669.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+});
+var G__696__17 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__670 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__670.cljs$core$IFn$_invoke$arity$16 ? fexpr__670.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : fexpr__670.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+});
+var G__696__18 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__671 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__671.cljs$core$IFn$_invoke$arity$17 ? fexpr__671.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : fexpr__671.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+});
+var G__696__19 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__672 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__672.cljs$core$IFn$_invoke$arity$18 ? fexpr__672.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : fexpr__672.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+var G__696__20 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__673 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__673.cljs$core$IFn$_invoke$arity$19 ? fexpr__673.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : fexpr__673.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+var G__696__21 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+var fexpr__674 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__674.cljs$core$IFn$_invoke$arity$20 ? fexpr__674.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : fexpr__674.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+var G__696__22 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic((self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null)),a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+G__696 = function(self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+switch(arguments.length){
+case 1:
+return G__696__1.call(this,self__);
+case 2:
+return G__696__2.call(this,self__,a);
+case 3:
+return G__696__3.call(this,self__,a,b);
+case 4:
+return G__696__4.call(this,self__,a,b,c);
+case 5:
+return G__696__5.call(this,self__,a,b,c,d);
+case 6:
+return G__696__6.call(this,self__,a,b,c,d,e);
+case 7:
+return G__696__7.call(this,self__,a,b,c,d,e,f);
+case 8:
+return G__696__8.call(this,self__,a,b,c,d,e,f,g);
+case 9:
+return G__696__9.call(this,self__,a,b,c,d,e,f,g,h);
+case 10:
+return G__696__10.call(this,self__,a,b,c,d,e,f,g,h,i);
+case 11:
+return G__696__11.call(this,self__,a,b,c,d,e,f,g,h,i,j);
+case 12:
+return G__696__12.call(this,self__,a,b,c,d,e,f,g,h,i,j,k);
+case 13:
+return G__696__13.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l);
+case 14:
+return G__696__14.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m);
+case 15:
+return G__696__15.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
+case 16:
+return G__696__16.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
+case 17:
+return G__696__17.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
+case 18:
+return G__696__18.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
+case 19:
+return G__696__19.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
+case 20:
+return G__696__20.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
+case 21:
+return G__696__21.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
+case 22:
+return G__696__22.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__696.cljs$core$IFn$_invoke$arity$1 = G__696__1;
+G__696.cljs$core$IFn$_invoke$arity$2 = G__696__2;
+G__696.cljs$core$IFn$_invoke$arity$3 = G__696__3;
+G__696.cljs$core$IFn$_invoke$arity$4 = G__696__4;
+G__696.cljs$core$IFn$_invoke$arity$5 = G__696__5;
+G__696.cljs$core$IFn$_invoke$arity$6 = G__696__6;
+G__696.cljs$core$IFn$_invoke$arity$7 = G__696__7;
+G__696.cljs$core$IFn$_invoke$arity$8 = G__696__8;
+G__696.cljs$core$IFn$_invoke$arity$9 = G__696__9;
+G__696.cljs$core$IFn$_invoke$arity$10 = G__696__10;
+G__696.cljs$core$IFn$_invoke$arity$11 = G__696__11;
+G__696.cljs$core$IFn$_invoke$arity$12 = G__696__12;
+G__696.cljs$core$IFn$_invoke$arity$13 = G__696__13;
+G__696.cljs$core$IFn$_invoke$arity$14 = G__696__14;
+G__696.cljs$core$IFn$_invoke$arity$15 = G__696__15;
+G__696.cljs$core$IFn$_invoke$arity$16 = G__696__16;
+G__696.cljs$core$IFn$_invoke$arity$17 = G__696__17;
+G__696.cljs$core$IFn$_invoke$arity$18 = G__696__18;
+G__696.cljs$core$IFn$_invoke$arity$19 = G__696__19;
+G__696.cljs$core$IFn$_invoke$arity$20 = G__696__20;
+G__696.cljs$core$IFn$_invoke$arity$21 = G__696__21;
+G__696.cljs$core$IFn$_invoke$arity$22 = G__696__22;
+return G__696;
+})()
+;
+
+cljs.core.Var.prototype.apply = (function (self__,args653){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args653)));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$0 = (function (){
+var self__ = this;
+var _ = this;
+var fexpr__675 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__675.cljs$core$IFn$_invoke$arity$0 ? fexpr__675.cljs$core$IFn$_invoke$arity$0() : fexpr__675.call(null));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$1 = (function (a){
+var self__ = this;
+var _ = this;
+var fexpr__676 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__676.cljs$core$IFn$_invoke$arity$1 ? fexpr__676.cljs$core$IFn$_invoke$arity$1(a) : fexpr__676.call(null,a));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
+var self__ = this;
+var _ = this;
+var fexpr__677 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__677.cljs$core$IFn$_invoke$arity$2 ? fexpr__677.cljs$core$IFn$_invoke$arity$2(a,b) : fexpr__677.call(null,a,b));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$3 = (function (a,b,c){
+var self__ = this;
+var _ = this;
+var fexpr__678 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__678.cljs$core$IFn$_invoke$arity$3 ? fexpr__678.cljs$core$IFn$_invoke$arity$3(a,b,c) : fexpr__678.call(null,a,b,c));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,d){
+var self__ = this;
+var _ = this;
+var fexpr__679 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__679.cljs$core$IFn$_invoke$arity$4 ? fexpr__679.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : fexpr__679.call(null,a,b,c,d));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$5 = (function (a,b,c,d,e){
+var self__ = this;
+var _ = this;
+var fexpr__680 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__680.cljs$core$IFn$_invoke$arity$5 ? fexpr__680.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : fexpr__680.call(null,a,b,c,d,e));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$6 = (function (a,b,c,d,e,f){
+var self__ = this;
+var _ = this;
+var fexpr__681 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__681.cljs$core$IFn$_invoke$arity$6 ? fexpr__681.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : fexpr__681.call(null,a,b,c,d,e,f));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$7 = (function (a,b,c,d,e,f,g){
+var self__ = this;
+var _ = this;
+var fexpr__682 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__682.cljs$core$IFn$_invoke$arity$7 ? fexpr__682.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : fexpr__682.call(null,a,b,c,d,e,f,g));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$8 = (function (a,b,c,d,e,f,g,h){
+var self__ = this;
+var _ = this;
+var fexpr__683 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__683.cljs$core$IFn$_invoke$arity$8 ? fexpr__683.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : fexpr__683.call(null,a,b,c,d,e,f,g,h));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$9 = (function (a,b,c,d,e,f,g,h,i){
+var self__ = this;
+var _ = this;
+var fexpr__684 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__684.cljs$core$IFn$_invoke$arity$9 ? fexpr__684.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : fexpr__684.call(null,a,b,c,d,e,f,g,h,i));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$10 = (function (a,b,c,d,e,f,g,h,i,j){
+var self__ = this;
+var _ = this;
+var fexpr__685 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__685.cljs$core$IFn$_invoke$arity$10 ? fexpr__685.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : fexpr__685.call(null,a,b,c,d,e,f,g,h,i,j));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$11 = (function (a,b,c,d,e,f,g,h,i,j,k){
+var self__ = this;
+var _ = this;
+var fexpr__686 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__686.cljs$core$IFn$_invoke$arity$11 ? fexpr__686.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : fexpr__686.call(null,a,b,c,d,e,f,g,h,i,j,k));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$12 = (function (a,b,c,d,e,f,g,h,i,j,k,l){
+var self__ = this;
+var _ = this;
+var fexpr__687 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__687.cljs$core$IFn$_invoke$arity$12 ? fexpr__687.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : fexpr__687.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$13 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m){
+var self__ = this;
+var _ = this;
+var fexpr__688 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__688.cljs$core$IFn$_invoke$arity$13 ? fexpr__688.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : fexpr__688.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$14 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n){
+var self__ = this;
+var _ = this;
+var fexpr__689 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__689.cljs$core$IFn$_invoke$arity$14 ? fexpr__689.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : fexpr__689.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$15 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var _ = this;
+var fexpr__690 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__690.cljs$core$IFn$_invoke$arity$15 ? fexpr__690.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : fexpr__690.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$16 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var _ = this;
+var fexpr__691 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__691.cljs$core$IFn$_invoke$arity$16 ? fexpr__691.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : fexpr__691.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$17 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var _ = this;
+var fexpr__692 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__692.cljs$core$IFn$_invoke$arity$17 ? fexpr__692.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : fexpr__692.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$18 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var _ = this;
+var fexpr__693 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__693.cljs$core$IFn$_invoke$arity$18 ? fexpr__693.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : fexpr__693.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$19 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var _ = this;
+var fexpr__694 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__694.cljs$core$IFn$_invoke$arity$19 ? fexpr__694.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : fexpr__694.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$20 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var _ = this;
+var fexpr__695 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
+return (fexpr__695.cljs$core$IFn$_invoke$arity$20 ? fexpr__695.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : fexpr__695.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+
+cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$21 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var _ = this;
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic((self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null)),a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+
+cljs.core.Var.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$val,cljs.core.cst$sym$sym,cljs.core.cst$sym$_meta], null);
+});
+
+cljs.core.Var.cljs$lang$type = true;
+
+cljs.core.Var.cljs$lang$ctorStr = "cljs.core/Var";
+
+cljs.core.Var.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Var");
+});
+
+/**
+ * Positional factory function for cljs.core/Var.
+ */
+cljs.core.__GT_Var = (function cljs$core$__GT_Var(val,sym,_meta){
+return (new cljs.core.Var(val,sym,_meta));
+});
+
+/**
+ * Returns true if v is of type cljs.core.Var
+ */
+cljs.core.var_QMARK_ = (function cljs$core$var_QMARK_(v){
+return (v instanceof cljs.core.Var);
+});
+
+
+/**
+ * Return true if x implements IIterable protocol.
+ */
+cljs.core.iterable_QMARK_ = (function cljs$core$iterable_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition1$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IIterable$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition1$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IIterable,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IIterable,x);
+}
+});
+/**
+ * Clone the supplied value which must implement ICloneable.
+ */
+cljs.core.clone = (function cljs$core$clone(value){
+return cljs.core._clone(value);
+});
+/**
+ * Return true if x implements ICloneable protocol.
+ */
+cljs.core.cloneable_QMARK_ = (function cljs$core$cloneable_QMARK_(value){
+if(!((value == null))){
+if((((value.cljs$lang$protocol_mask$partition1$ & (8192))) || ((cljs.core.PROTOCOL_SENTINEL === value.cljs$core$ICloneable$)))){
+return true;
+} else {
+if((!value.cljs$lang$protocol_mask$partition1$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.ICloneable,value);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.ICloneable,value);
+}
+});
+/**
+ * Returns a seq on the collection. If the collection is
+ *   empty, returns nil.  (seq nil) returns nil. seq also works on
+ *   Strings.
+ */
+cljs.core.seq = (function cljs$core$seq(coll){
+if((coll == null)){
+return null;
+} else {
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (8388608))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeqable$))))?true:false):false)){
+return coll.cljs$core$ISeqable$_seq$arity$1(null);
+} else {
+if(cljs.core.array_QMARK_(coll)){
+if((coll.length === (0))){
+return null;
+} else {
+return (new cljs.core.IndexedSeq(coll,(0),null));
+}
+} else {
+if(typeof coll === 'string'){
+if((coll.length === (0))){
+return null;
+} else {
+return (new cljs.core.IndexedSeq(coll,(0),null));
+}
+} else {
+if(cljs.core.native_satisfies_QMARK_(cljs.core.ISeqable,coll)){
+return cljs.core._seq(coll);
+} else {
+throw (new Error([cljs.core.str.cljs$core$IFn$_invoke$arity$1(coll)," is not ISeqable"].join('')));
+
+}
+}
+}
+}
+}
+});
+/**
+ * Returns the first item in the collection. Calls seq on its
+ *   argument. If coll is nil, returns nil.
+ */
+cljs.core.first = (function cljs$core$first(coll){
+if((coll == null)){
+return null;
+} else {
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false)){
+return coll.cljs$core$ISeq$_first$arity$1(null);
+} else {
+var s = cljs.core.seq(coll);
+if((s == null)){
+return null;
+} else {
+return cljs.core._first(s);
+}
+}
+}
+});
+/**
+ * Returns a possibly empty seq of the items after the first. Calls seq on its
+ *   argument.
+ */
+cljs.core.rest = (function cljs$core$rest(coll){
+if(!((coll == null))){
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false)){
+return coll.cljs$core$ISeq$_rest$arity$1(null);
+} else {
+var s = cljs.core.seq(coll);
+if(s){
+return s.cljs$core$ISeq$_rest$arity$1(null);
+} else {
+return cljs.core.List.EMPTY;
+}
+}
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+/**
+ * Returns a seq of the items after the first. Calls seq on its
+ *   argument.  If there are no more items, returns nil
+ */
+cljs.core.next = (function cljs$core$next(coll){
+if((coll == null)){
+return null;
+} else {
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$INext$))))?true:false):false)){
+return coll.cljs$core$INext$_next$arity$1(null);
+} else {
+return cljs.core.seq(cljs.core.rest(coll));
+}
+}
+});
+/**
+ * Equality. Returns true if x equals y, false if not. Compares
+ *   numbers and collections in a type-independent manner.  Clojure's immutable data
+ *   structures define -equiv (and thus =) as a value, not an identity,
+ *   comparison.
+ */
+cljs.core._EQ_ = (function cljs$core$_EQ_(var_args){
+var G__707 = arguments.length;
+switch (G__707) {
+case 1:
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___709 = arguments.length;
+var i__4519__auto___710 = (0);
+while(true){
+if((i__4519__auto___710 < len__4518__auto___709)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___710]));
+
+var G__711 = (i__4519__auto___710 + (1));
+i__4519__auto___710 = G__711;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return true;
+});
+
+cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+if((x == null)){
+return (y == null);
+} else {
+return (((x === y)) || (cljs.core._equiv(x,y)));
+}
+});
+
+cljs.core._EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+while(true){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y)){
+if(cljs.core.next(more)){
+var G__712 = y;
+var G__713 = cljs.core.first(more);
+var G__714 = cljs.core.next(more);
+x = G__712;
+y = G__713;
+more = G__714;
+continue;
+} else {
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(y,cljs.core.first(more));
+}
+} else {
+return false;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core._EQ_.cljs$lang$applyTo = (function (seq704){
+var G__705 = cljs.core.first(seq704);
+var seq704__$1 = cljs.core.next(seq704);
+var G__706 = cljs.core.first(seq704__$1);
+var seq704__$2 = cljs.core.next(seq704__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__705,G__706,seq704__$2);
+});
+
+cljs.core._EQ_.cljs$lang$maxFixedArity = (2);
+
+
+/**
+* @constructor
+*/
+cljs.core.ES6Iterator = (function (s){
+this.s = s;
+});
+cljs.core.ES6Iterator.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+if(!((self__.s == null))){
+var x = cljs.core.first(self__.s);
+self__.s = cljs.core.next(self__.s);
+
+return ({"value": x, "done": false});
+} else {
+return ({"value": null, "done": true});
+}
+});
+
+cljs.core.ES6Iterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ES6Iterator.cljs$lang$type = true;
+
+cljs.core.ES6Iterator.cljs$lang$ctorStr = "cljs.core/ES6Iterator";
+
+cljs.core.ES6Iterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ES6Iterator");
+});
+
+/**
+ * Positional factory function for cljs.core/ES6Iterator.
+ */
+cljs.core.__GT_ES6Iterator = (function cljs$core$__GT_ES6Iterator(s){
+return (new cljs.core.ES6Iterator(s));
+});
+
+/**
+ * EXPERIMENTAL: Return a ES2015 compatible iterator for coll.
+ */
+cljs.core.es6_iterator = (function cljs$core$es6_iterator(coll){
+return (new cljs.core.ES6Iterator(cljs.core.seq(coll)));
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.ISeqable}
+*/
+cljs.core.ES6IteratorSeq = (function (value,iter,_rest){
+this.value = value;
+this.iter = iter;
+this._rest = _rest;
+this.cljs$lang$protocol_mask$partition0$ = 8388672;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.ES6IteratorSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return this$__$1;
+});
+
+cljs.core.ES6IteratorSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.value;
+});
+
+cljs.core.ES6IteratorSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+if((self__._rest == null)){
+self__._rest = cljs.core.es6_iterator_seq(self__.iter);
+} else {
+}
+
+return self__._rest;
+});
+
+cljs.core.ES6IteratorSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$value,cljs.core.cst$sym$iter,cljs.core.with_meta(cljs.core.cst$sym$_rest,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ES6IteratorSeq.cljs$lang$type = true;
+
+cljs.core.ES6IteratorSeq.cljs$lang$ctorStr = "cljs.core/ES6IteratorSeq";
+
+cljs.core.ES6IteratorSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ES6IteratorSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/ES6IteratorSeq.
+ */
+cljs.core.__GT_ES6IteratorSeq = (function cljs$core$__GT_ES6IteratorSeq(value,iter,_rest){
+return (new cljs.core.ES6IteratorSeq(value,iter,_rest));
+});
+
+/**
+ * EXPERIMENTAL: Given an ES2015 compatible iterator return a seq.
+ */
+cljs.core.es6_iterator_seq = (function cljs$core$es6_iterator_seq(iter){
+var v = iter.next();
+if(cljs.core.truth_(v.done)){
+return cljs.core.List.EMPTY;
+} else {
+return (new cljs.core.ES6IteratorSeq(v.value,iter,null));
+}
+});
+/**
+ * Mix final collection hash for ordered or unordered collections.
+ * hash-basis is the combined collection hash, count is the number
+ * of elements included in the basis. Note this is the hash code
+ * consistent with =, different from .hashCode.
+ * See http://clojure.org/data_structures#hash for full algorithms.
+ */
+cljs.core.mix_collection_hash = (function cljs$core$mix_collection_hash(hash_basis,count){
+var h1 = cljs.core.m3_seed;
+var k1 = cljs.core.m3_mix_K1(hash_basis);
+var h1__$1 = cljs.core.m3_mix_H1(h1,k1);
+return cljs.core.m3_fmix(h1__$1,count);
+});
+/**
+ * Returns the hash code, consistent with =, for an external ordered
+ * collection implementing Iterable.
+ * See http://clojure.org/data_structures#hash for full algorithms.
+ */
+cljs.core.hash_ordered_coll = (function cljs$core$hash_ordered_coll(coll){
+var n = (0);
+var hash_code = (1);
+var coll__$1 = cljs.core.seq(coll);
+while(true){
+if(!((coll__$1 == null))){
+var G__715 = (n + (1));
+var G__716 = ((cljs.core.imul((31),hash_code) + cljs.core.hash(cljs.core.first(coll__$1))) | (0));
+var G__717 = cljs.core.next(coll__$1);
+n = G__715;
+hash_code = G__716;
+coll__$1 = G__717;
+continue;
+} else {
+return cljs.core.mix_collection_hash(hash_code,n);
+}
+break;
+}
+});
+cljs.core.empty_ordered_hash = cljs.core.mix_collection_hash((1),(0));
+/**
+ * Returns the hash code, consistent with =, for an external unordered
+ * collection implementing Iterable. For maps, the iterator should
+ * return map entries whose hash is computed as
+ *   (hash-ordered-coll [k v]).
+ * See http://clojure.org/data_structures#hash for full algorithms.
+ */
+cljs.core.hash_unordered_coll = (function cljs$core$hash_unordered_coll(coll){
+var n = (0);
+var hash_code = (0);
+var coll__$1 = cljs.core.seq(coll);
+while(true){
+if(!((coll__$1 == null))){
+var G__718 = (n + (1));
+var G__719 = ((hash_code + cljs.core.hash(cljs.core.first(coll__$1))) | (0));
+var G__720 = cljs.core.next(coll__$1);
+n = G__718;
+hash_code = G__719;
+coll__$1 = G__720;
+continue;
+} else {
+return cljs.core.mix_collection_hash(hash_code,n);
+}
+break;
+}
+});
+cljs.core.empty_unordered_hash = cljs.core.mix_collection_hash((0),(0));
+
+
+goog.object.set(cljs.core.ICounted,"null",true);
+
+var G__721_724 = cljs.core._count;
+var G__722_725 = "null";
+var G__723_726 = ((function (G__721_724,G__722_725){
+return (function (_){
+return (0);
+});})(G__721_724,G__722_725))
+;
+goog.object.set(G__721_724,G__722_725,G__723_726);
+Date.prototype.cljs$core$IEquiv$ = cljs.core.PROTOCOL_SENTINEL;
+
+Date.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
+var o__$1 = this;
+return (((other instanceof Date)) && ((o__$1.valueOf() === other.valueOf())));
+});
+
+Date.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+Date.prototype.cljs$core$IComparable$_compare$arity$2 = (function (this$,other){
+var this$__$1 = this;
+if((other instanceof Date)){
+var G__727 = this$__$1.valueOf();
+var G__728 = other.valueOf();
+return goog.array.defaultCompare(G__727,G__728);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(this$__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(other)].join('')));
+}
+});
+
+/**
+ * @interface
+ */
+cljs.core.Inst = function(){};
+
+cljs.core.inst_ms_STAR_ = (function cljs$core$inst_ms_STAR_(inst){
+if(((!((inst == null))) && (!((inst.cljs$core$Inst$inst_ms_STAR_$arity$1 == null))))){
+return inst.cljs$core$Inst$inst_ms_STAR_$arity$1(inst);
+} else {
+var x__4230__auto__ = (((inst == null))?null:inst);
+var m__4231__auto__ = (cljs.core.inst_ms_STAR_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(inst) : m__4231__auto__.call(null,inst));
+} else {
+var m__4231__auto____$1 = (cljs.core.inst_ms_STAR_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(inst) : m__4231__auto____$1.call(null,inst));
+} else {
+throw cljs.core.missing_protocol("Inst.inst-ms*",inst);
+}
+}
+}
+});
+
+Date.prototype.cljs$core$Inst$ = cljs.core.PROTOCOL_SENTINEL;
+
+Date.prototype.cljs$core$Inst$inst_ms_STAR_$arity$1 = (function (inst){
+var inst__$1 = this;
+return inst__$1.getTime();
+});
+/**
+ * Return the number of milliseconds since January 1, 1970, 00:00:00 GMT
+ */
+cljs.core.inst_ms = (function cljs$core$inst_ms(inst){
+return cljs.core.inst_ms_STAR_(inst);
+});
+/**
+ * Return true if x satisfies Inst
+ */
+cljs.core.inst_QMARK_ = (function cljs$core$inst_QMARK_(x){
+if(!((x == null))){
+if(((false) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$Inst$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.Inst,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.Inst,x);
+}
+});
+goog.object.set(cljs.core.IEquiv,"number",true);
+
+var G__730_733 = cljs.core._equiv;
+var G__731_734 = "number";
+var G__732_735 = ((function (G__730_733,G__731_734){
+return (function (x,o){
+return (x === o);
+});})(G__730_733,G__731_734))
+;
+goog.object.set(G__730_733,G__731_734,G__732_735);
+goog.object.set(cljs.core.Fn,"function",true);
+
+goog.object.set(cljs.core.IMeta,"function",true);
+
+var G__736_739 = cljs.core._meta;
+var G__737_740 = "function";
+var G__738_741 = ((function (G__736_739,G__737_740){
+return (function (_){
+return null;
+});})(G__736_739,G__737_740))
+;
+goog.object.set(G__736_739,G__737_740,G__738_741);
+goog.object.set(cljs.core.IHash,"_",true);
+
+var G__742_745 = cljs.core._hash;
+var G__743_746 = "_";
+var G__744_747 = ((function (G__742_745,G__743_746){
+return (function (o){
+return goog.getUid(o);
+});})(G__742_745,G__743_746))
+;
+goog.object.set(G__742_745,G__743_746,G__744_747);
+/**
+ * Returns a number one greater than num.
+ */
+cljs.core.inc = (function cljs$core$inc(x){
+return (x + (1));
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IDeref}
+*/
+cljs.core.Reduced = (function (val){
+this.val = val;
+this.cljs$lang$protocol_mask$partition0$ = 32768;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.Reduced.prototype.cljs$core$IDeref$_deref$arity$1 = (function (o){
+var self__ = this;
+var o__$1 = this;
+return self__.val;
+});
+
+cljs.core.Reduced.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$val], null);
+});
+
+cljs.core.Reduced.cljs$lang$type = true;
+
+cljs.core.Reduced.cljs$lang$ctorStr = "cljs.core/Reduced";
+
+cljs.core.Reduced.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Reduced");
+});
+
+/**
+ * Positional factory function for cljs.core/Reduced.
+ */
+cljs.core.__GT_Reduced = (function cljs$core$__GT_Reduced(val){
+return (new cljs.core.Reduced(val));
+});
+
+/**
+ * Wraps x in a way such that a reduce will terminate with the value x
+ */
+cljs.core.reduced = (function cljs$core$reduced(x){
+return (new cljs.core.Reduced(x));
+});
+/**
+ * Returns true if x is the result of a call to reduced
+ */
+cljs.core.reduced_QMARK_ = (function cljs$core$reduced_QMARK_(r){
+return (r instanceof cljs.core.Reduced);
+});
+/**
+ * If x is already reduced?, returns it, else returns (reduced x)
+ */
+cljs.core.ensure_reduced = (function cljs$core$ensure_reduced(x){
+if(cljs.core.reduced_QMARK_(x)){
+return x;
+} else {
+return cljs.core.reduced(x);
+}
+});
+/**
+ * If x is reduced?, returns (deref x), else returns x
+ */
+cljs.core.unreduced = (function cljs$core$unreduced(x){
+if(cljs.core.reduced_QMARK_(x)){
+return cljs.core.deref(x);
+} else {
+return x;
+}
+});
+/**
+ * Also reader macro: @var/@atom/@delay. Returns the
+ * most-recently-committed value of ref. When applied to a var
+ * or atom, returns its current state. When applied to a delay, forces
+ * it if not already forced. See also - realized?.
+ */
+cljs.core.deref = (function cljs$core$deref(o){
+return cljs.core._deref(o);
+});
+/**
+ * Accepts any collection which satisfies the ICount and IIndexed protocols and
+ * reduces them without incurring seq initialization
+ */
+cljs.core.ci_reduce = (function cljs$core$ci_reduce(var_args){
+var G__749 = arguments.length;
+switch (G__749) {
+case 2:
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2 = (function (cicoll,f){
+var cnt = cljs.core._count(cicoll);
+if((cnt === (0))){
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+} else {
+var val = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,(0));
+var n = (1);
+while(true){
+if((n < cnt)){
+var nval = (function (){var G__750 = val;
+var G__751 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,n);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__750,G__751) : f.call(null,G__750,G__751));
+})();
+if(cljs.core.reduced_QMARK_(nval)){
+return cljs.core.deref(nval);
+} else {
+var G__757 = nval;
+var G__758 = (n + (1));
+val = G__757;
+n = G__758;
+continue;
+}
+} else {
+return val;
+}
+break;
+}
+}
+});
+
+cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3 = (function (cicoll,f,val){
+var cnt = cljs.core._count(cicoll);
+var val__$1 = val;
+var n = (0);
+while(true){
+if((n < cnt)){
+var nval = (function (){var G__752 = val__$1;
+var G__753 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,n);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__752,G__753) : f.call(null,G__752,G__753));
+})();
+if(cljs.core.reduced_QMARK_(nval)){
+return cljs.core.deref(nval);
+} else {
+var G__759 = nval;
+var G__760 = (n + (1));
+val__$1 = G__759;
+n = G__760;
+continue;
+}
+} else {
+return val__$1;
+}
+break;
+}
+});
+
+cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$4 = (function (cicoll,f,val,idx){
+var cnt = cljs.core._count(cicoll);
+var val__$1 = val;
+var n = idx;
+while(true){
+if((n < cnt)){
+var nval = (function (){var G__754 = val__$1;
+var G__755 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,n);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__754,G__755) : f.call(null,G__754,G__755));
+})();
+if(cljs.core.reduced_QMARK_(nval)){
+return cljs.core.deref(nval);
+} else {
+var G__761 = nval;
+var G__762 = (n + (1));
+val__$1 = G__761;
+n = G__762;
+continue;
+}
+} else {
+return val__$1;
+}
+break;
+}
+});
+
+cljs.core.ci_reduce.cljs$lang$maxFixedArity = 4;
+
+cljs.core.array_reduce = (function cljs$core$array_reduce(var_args){
+var G__764 = arguments.length;
+switch (G__764) {
+case 2:
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2 = (function (arr,f){
+var cnt = arr.length;
+if((arr.length === (0))){
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+} else {
+var val = (arr[(0)]);
+var n = (1);
+while(true){
+if((n < cnt)){
+var nval = (function (){var G__765 = val;
+var G__766 = (arr[n]);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__765,G__766) : f.call(null,G__765,G__766));
+})();
+if(cljs.core.reduced_QMARK_(nval)){
+return cljs.core.deref(nval);
+} else {
+var G__772 = nval;
+var G__773 = (n + (1));
+val = G__772;
+n = G__773;
+continue;
+}
+} else {
+return val;
+}
+break;
+}
+}
+});
+
+cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3 = (function (arr,f,val){
+var cnt = arr.length;
+var val__$1 = val;
+var n = (0);
+while(true){
+if((n < cnt)){
+var nval = (function (){var G__767 = val__$1;
+var G__768 = (arr[n]);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__767,G__768) : f.call(null,G__767,G__768));
+})();
+if(cljs.core.reduced_QMARK_(nval)){
+return cljs.core.deref(nval);
+} else {
+var G__774 = nval;
+var G__775 = (n + (1));
+val__$1 = G__774;
+n = G__775;
+continue;
+}
+} else {
+return val__$1;
+}
+break;
+}
+});
+
+cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4 = (function (arr,f,val,idx){
+var cnt = arr.length;
+var val__$1 = val;
+var n = idx;
+while(true){
+if((n < cnt)){
+var nval = (function (){var G__769 = val__$1;
+var G__770 = (arr[n]);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__769,G__770) : f.call(null,G__769,G__770));
+})();
+if(cljs.core.reduced_QMARK_(nval)){
+return cljs.core.deref(nval);
+} else {
+var G__776 = nval;
+var G__777 = (n + (1));
+val__$1 = G__776;
+n = G__777;
+continue;
+}
+} else {
+return val__$1;
+}
+break;
+}
+});
+
+cljs.core.array_reduce.cljs$lang$maxFixedArity = 4;
+
+
+
+
+
+
+
+/**
+ * Returns true if coll implements count in constant time
+ */
+cljs.core.counted_QMARK_ = (function cljs$core$counted_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (2))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ICounted$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.ICounted,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.ICounted,x);
+}
+});
+/**
+ * Returns true if coll implements nth in constant time
+ */
+cljs.core.indexed_QMARK_ = (function cljs$core$indexed_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (16))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IIndexed$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,x);
+}
+});
+cljs.core._indexOf = (function cljs$core$_indexOf(var_args){
+var G__781 = arguments.length;
+switch (G__781) {
+case 2:
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core._indexOf.cljs$core$IFn$_invoke$arity$2 = (function (coll,x){
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+
+cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3 = (function (coll,x,start){
+var len = cljs.core.count(coll);
+if((start >= len)){
+return (-1);
+} else {
+var idx = (((start > (0)))?start:(((start < (0)))?(function (){var x__4024__auto__ = (0);
+var y__4025__auto__ = (start + len);
+return ((x__4024__auto__ > y__4025__auto__) ? x__4024__auto__ : y__4025__auto__);
+})():start
+));
+while(true){
+if((idx < len)){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(coll,idx),x)){
+return idx;
+} else {
+var G__783 = (idx + (1));
+idx = G__783;
+continue;
+}
+} else {
+return (-1);
+}
+break;
+}
+}
+});
+
+cljs.core._indexOf.cljs$lang$maxFixedArity = 3;
+
+cljs.core._lastIndexOf = (function cljs$core$_lastIndexOf(var_args){
+var G__785 = arguments.length;
+switch (G__785) {
+case 2:
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$2 = (function (coll,x){
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+
+cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3 = (function (coll,x,start){
+var len = cljs.core.count(coll);
+if((len === (0))){
+return (-1);
+} else {
+var idx = (((start > (0)))?(function (){var x__4027__auto__ = (len - (1));
+var y__4028__auto__ = start;
+return ((x__4027__auto__ < y__4028__auto__) ? x__4027__auto__ : y__4028__auto__);
+})():(((start < (0)))?(len + start):start
+));
+while(true){
+if((idx >= (0))){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(coll,idx),x)){
+return idx;
+} else {
+var G__787 = (idx - (1));
+idx = G__787;
+continue;
+}
+} else {
+return (-1);
+}
+break;
+}
+}
+});
+
+cljs.core._lastIndexOf.cljs$lang$maxFixedArity = 3;
+
+
+/**
+* @constructor
+*/
+cljs.core.IndexedSeqIterator = (function (arr,i){
+this.arr = arr;
+this.i = i;
+});
+cljs.core.IndexedSeqIterator.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+return (self__.i < self__.arr.length);
+});
+
+cljs.core.IndexedSeqIterator.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+var ret = (self__.arr[self__.i]);
+self__.i = (self__.i + (1));
+
+return ret;
+});
+
+cljs.core.IndexedSeqIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.IndexedSeqIterator.cljs$lang$type = true;
+
+cljs.core.IndexedSeqIterator.cljs$lang$ctorStr = "cljs.core/IndexedSeqIterator";
+
+cljs.core.IndexedSeqIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/IndexedSeqIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/IndexedSeqIterator.
+ */
+cljs.core.__GT_IndexedSeqIterator = (function cljs$core$__GT_IndexedSeqIterator(arr,i){
+return (new cljs.core.IndexedSeqIterator(arr,i));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ASeq}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.IndexedSeq = (function (arr,i,meta){
+this.arr = arr;
+this.i = i;
+this.meta = meta;
+this.cljs$lang$protocol_mask$partition0$ = 166592766;
+this.cljs$lang$protocol_mask$partition1$ = 139264;
+});
+cljs.core.IndexedSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.IndexedSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.IndexedSeq.prototype.indexOf = (function() {
+var G__788 = null;
+var G__788__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__788__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__788 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__788__1.call(this,x);
+case 2:
+return G__788__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__788.cljs$core$IFn$_invoke$arity$1 = G__788__1;
+G__788.cljs$core$IFn$_invoke$arity$2 = G__788__2;
+return G__788;
+})()
+;
+
+cljs.core.IndexedSeq.prototype.lastIndexOf = (function() {
+var G__789 = null;
+var G__789__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__789__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__789 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__789__1.call(this,x);
+case 2:
+return G__789__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__789.cljs$core$IFn$_invoke$arity$1 = G__789__1;
+G__789.cljs$core$IFn$_invoke$arity$2 = G__789__2;
+return G__789;
+})()
+;
+
+cljs.core.IndexedSeq.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
+var self__ = this;
+var coll__$1 = this;
+var i__$1 = (n + self__.i);
+if(((((0) <= i__$1)) && ((i__$1 < self__.arr.length)))){
+return (self__.arr[i__$1]);
+} else {
+throw (new Error("Index out of bounds"));
+}
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
+var self__ = this;
+var coll__$1 = this;
+var i__$1 = (n + self__.i);
+if(((((0) <= i__$1)) && ((i__$1 < self__.arr.length)))){
+return (self__.arr[i__$1]);
+} else {
+return not_found;
+}
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.IndexedSeqIterator(self__.arr,self__.i));
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.IndexedSeq(self__.arr,self__.i,self__.meta));
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$INext$_next$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+if(((self__.i + (1)) < self__.arr.length)){
+return (new cljs.core.IndexedSeq(self__.arr,(self__.i + (1)),null));
+} else {
+return null;
+}
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+var x__4024__auto__ = (0);
+var y__4025__auto__ = (self__.arr.length - self__.i);
+return ((x__4024__auto__ > y__4025__auto__) ? x__4024__auto__ : y__4025__auto__);
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var c = coll__$1.cljs$core$ICounted$_count$arity$1(null);
+if((c > (0))){
+return (new cljs.core.RSeq(coll__$1,(c - (1)),null));
+} else {
+return null;
+}
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.hash_ordered_coll(coll__$1);
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.List.EMPTY;
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,(self__.arr[self__.i]),(self__.i + (1)));
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,start,self__.i);
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (self__.arr[self__.i]);
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+if(((self__.i + (1)) < self__.arr.length)){
+return (new cljs.core.IndexedSeq(self__.arr,(self__.i + (1)),null));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+if((self__.i < self__.arr.length)){
+return this$__$1;
+} else {
+return null;
+}
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.IndexedSeq(self__.arr,self__.i,new_meta));
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.IndexedSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.cst$sym$i,cljs.core.cst$sym$meta], null);
+});
+
+cljs.core.IndexedSeq.cljs$lang$type = true;
+
+cljs.core.IndexedSeq.cljs$lang$ctorStr = "cljs.core/IndexedSeq";
+
+cljs.core.IndexedSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/IndexedSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/IndexedSeq.
+ */
+cljs.core.__GT_IndexedSeq = (function cljs$core$__GT_IndexedSeq(arr,i,meta){
+return (new cljs.core.IndexedSeq(arr,i,meta));
+});
+
+var G__790_793 = cljs.core.IndexedSeq.prototype;
+var G__791_794 = cljs.core.ITER_SYMBOL;
+var G__792_795 = ((function (G__790_793,G__791_794){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__790_793,G__791_794))
+;
+goog.object.set(G__790_793,G__791_794,G__792_795);
+/**
+ * Create seq from a primitive JavaScript Array-like.
+ */
+cljs.core.prim_seq = (function cljs$core$prim_seq(var_args){
+var G__797 = arguments.length;
+switch (G__797) {
+case 1:
+return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$1 = (function (prim){
+return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(prim,(0));
+});
+
+cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2 = (function (prim,i){
+if((i < prim.length)){
+return (new cljs.core.IndexedSeq(prim,i,null));
+} else {
+return null;
+}
+});
+
+cljs.core.prim_seq.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Create a seq from a JavaScript array.
+ */
+cljs.core.array_seq = (function cljs$core$array_seq(var_args){
+var G__800 = arguments.length;
+switch (G__800) {
+case 1:
+return cljs.core.array_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.array_seq.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.array_seq.cljs$core$IFn$_invoke$arity$1 = (function (array){
+return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(array,(0));
+});
+
+cljs.core.array_seq.cljs$core$IFn$_invoke$arity$2 = (function (array,i){
+return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(array,i);
+});
+
+cljs.core.array_seq.cljs$lang$maxFixedArity = 2;
+
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.RSeq = (function (ci,i,meta){
+this.ci = ci;
+this.i = i;
+this.meta = meta;
+this.cljs$lang$protocol_mask$partition0$ = 32374990;
+this.cljs$lang$protocol_mask$partition1$ = 8192;
+});
+cljs.core.RSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.RSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.RSeq.prototype.indexOf = (function() {
+var G__802 = null;
+var G__802__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__802__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__802 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__802__1.call(this,x);
+case 2:
+return G__802__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__802.cljs$core$IFn$_invoke$arity$1 = G__802__1;
+G__802.cljs$core$IFn$_invoke$arity$2 = G__802__2;
+return G__802;
+})()
+;
+
+cljs.core.RSeq.prototype.lastIndexOf = (function() {
+var G__803 = null;
+var G__803__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__803__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__803 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__803__1.call(this,x);
+case 2:
+return G__803__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__803.cljs$core$IFn$_invoke$arity$1 = G__803__1;
+G__803.cljs$core$IFn$_invoke$arity$2 = G__803__2;
+return G__803;
+})()
+;
+
+cljs.core.RSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.RSeq.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.RSeq(self__.ci,self__.i,self__.meta));
+});
+
+cljs.core.RSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.i > (0))){
+return (new cljs.core.RSeq(self__.ci,(self__.i - (1)),null));
+} else {
+return null;
+}
+});
+
+cljs.core.RSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (self__.i + (1));
+});
+
+cljs.core.RSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.hash_ordered_coll(coll__$1);
+});
+
+cljs.core.RSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.RSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.RSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (col,f){
+var self__ = this;
+var col__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,col__$1);
+});
+
+cljs.core.RSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (col,f,start){
+var self__ = this;
+var col__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,col__$1);
+});
+
+cljs.core.RSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.ci,self__.i);
+});
+
+cljs.core.RSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.i > (0))){
+return (new cljs.core.RSeq(self__.ci,(self__.i - (1)),null));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.RSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.RSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.RSeq(self__.ci,self__.i,new_meta));
+});
+
+cljs.core.RSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.RSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$ci,cljs.core.cst$sym$i,cljs.core.cst$sym$meta], null);
+});
+
+cljs.core.RSeq.cljs$lang$type = true;
+
+cljs.core.RSeq.cljs$lang$ctorStr = "cljs.core/RSeq";
+
+cljs.core.RSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/RSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/RSeq.
+ */
+cljs.core.__GT_RSeq = (function cljs$core$__GT_RSeq(ci,i,meta){
+return (new cljs.core.RSeq(ci,i,meta));
+});
+
+var G__804_807 = cljs.core.RSeq.prototype;
+var G__805_808 = cljs.core.ITER_SYMBOL;
+var G__806_809 = ((function (G__804_807,G__805_808){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__804_807,G__805_808))
+;
+goog.object.set(G__804_807,G__805_808,G__806_809);
+/**
+ * Same as (first (next x))
+ */
+cljs.core.second = (function cljs$core$second(coll){
+return cljs.core.first(cljs.core.next(coll));
+});
+/**
+ * Same as (first (first x))
+ */
+cljs.core.ffirst = (function cljs$core$ffirst(coll){
+return cljs.core.first(cljs.core.first(coll));
+});
+/**
+ * Same as (next (first x))
+ */
+cljs.core.nfirst = (function cljs$core$nfirst(coll){
+return cljs.core.next(cljs.core.first(coll));
+});
+/**
+ * Same as (first (next x))
+ */
+cljs.core.fnext = (function cljs$core$fnext(coll){
+return cljs.core.first(cljs.core.next(coll));
+});
+/**
+ * Same as (next (next x))
+ */
+cljs.core.nnext = (function cljs$core$nnext(coll){
+return cljs.core.next(cljs.core.next(coll));
+});
+/**
+ * Return the last item in coll, in linear time
+ */
+cljs.core.last = (function cljs$core$last(s){
+while(true){
+var sn = cljs.core.next(s);
+if(!((sn == null))){
+var G__810 = sn;
+s = G__810;
+continue;
+} else {
+return cljs.core.first(s);
+}
+break;
+}
+});
+goog.object.set(cljs.core.IEquiv,"_",true);
+
+var G__811_814 = cljs.core._equiv;
+var G__812_815 = "_";
+var G__813_816 = ((function (G__811_814,G__812_815){
+return (function (x,o){
+return (x === o);
+});})(G__811_814,G__812_815))
+;
+goog.object.set(G__811_814,G__812_815,G__813_816);
+/**
+ * conj[oin]. Returns a new collection with the xs
+ *   'added'. (conj nil item) returns (item).  The 'addition' may
+ *   happen at different 'places' depending on the concrete type.
+ */
+cljs.core.conj = (function cljs$core$conj(var_args){
+var G__821 = arguments.length;
+switch (G__821) {
+case 0:
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___823 = arguments.length;
+var i__4519__auto___824 = (0);
+while(true){
+if((i__4519__auto___824 < len__4518__auto___823)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___824]));
+
+var G__825 = (i__4519__auto___824 + (1));
+i__4519__auto___824 = G__825;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.conj.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.PersistentVector.EMPTY;
+});
+
+cljs.core.conj.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+return coll;
+});
+
+cljs.core.conj.cljs$core$IFn$_invoke$arity$2 = (function (coll,x){
+if(!((coll == null))){
+return cljs.core._conj(coll,x);
+} else {
+return (new cljs.core.List(null,x,null,(1),null));
+}
+});
+
+cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic = (function (coll,x,xs){
+while(true){
+if(cljs.core.truth_(xs)){
+var G__826 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(coll,x);
+var G__827 = cljs.core.first(xs);
+var G__828 = cljs.core.next(xs);
+coll = G__826;
+x = G__827;
+xs = G__828;
+continue;
+} else {
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(coll,x);
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.conj.cljs$lang$applyTo = (function (seq818){
+var G__819 = cljs.core.first(seq818);
+var seq818__$1 = cljs.core.next(seq818);
+var G__820 = cljs.core.first(seq818__$1);
+var seq818__$2 = cljs.core.next(seq818__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__819,G__820,seq818__$2);
+});
+
+cljs.core.conj.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns an empty collection of the same category as coll, or nil
+ */
+cljs.core.empty = (function cljs$core$empty(coll){
+if((coll == null)){
+return null;
+} else {
+return cljs.core._empty(coll);
+}
+});
+cljs.core.accumulating_seq_count = (function cljs$core$accumulating_seq_count(coll){
+var s = cljs.core.seq(coll);
+var acc = (0);
+while(true){
+if(cljs.core.counted_QMARK_(s)){
+return (acc + cljs.core._count(s));
+} else {
+var G__829 = cljs.core.next(s);
+var G__830 = (acc + (1));
+s = G__829;
+acc = G__830;
+continue;
+}
+break;
+}
+});
+/**
+ * Returns the number of items in the collection. (count nil) returns
+ *   0.  Also works on strings, arrays, and Maps
+ */
+cljs.core.count = (function cljs$core$count(coll){
+if(!((coll == null))){
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (2))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ICounted$))))?true:false):false)){
+return coll.cljs$core$ICounted$_count$arity$1(null);
+} else {
+if(cljs.core.array_QMARK_(coll)){
+return coll.length;
+} else {
+if(typeof coll === 'string'){
+return coll.length;
+} else {
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (8388608))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeqable$))))?true:false):false)){
+return cljs.core.accumulating_seq_count(coll);
+} else {
+return cljs.core._count(coll);
+
+}
+}
+}
+}
+} else {
+return (0);
+}
+});
+cljs.core.linear_traversal_nth = (function cljs$core$linear_traversal_nth(var_args){
+var G__834 = arguments.length;
+switch (G__834) {
+case 2:
+return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$2 = (function (coll,n){
+while(true){
+if((coll == null)){
+throw (new Error("Index out of bounds"));
+} else {
+if((n === (0))){
+if(cljs.core.seq(coll)){
+return cljs.core.first(coll);
+} else {
+throw (new Error("Index out of bounds"));
+}
+} else {
+if(cljs.core.indexed_QMARK_(coll)){
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(coll,n);
+} else {
+if(cljs.core.seq(coll)){
+var G__836 = cljs.core.next(coll);
+var G__837 = (n - (1));
+coll = G__836;
+n = G__837;
+continue;
+} else {
+throw (new Error("Index out of bounds"));
+
+}
+}
+}
+}
+break;
+}
+});
+
+cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$3 = (function (coll,n,not_found){
+while(true){
+if((coll == null)){
+return not_found;
+} else {
+if((n === (0))){
+if(cljs.core.seq(coll)){
+return cljs.core.first(coll);
+} else {
+return not_found;
+}
+} else {
+if(cljs.core.indexed_QMARK_(coll)){
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$3(coll,n,not_found);
+} else {
+if(cljs.core.seq(coll)){
+var G__838 = cljs.core.next(coll);
+var G__839 = (n - (1));
+var G__840 = not_found;
+coll = G__838;
+n = G__839;
+not_found = G__840;
+continue;
+} else {
+return not_found;
+
+}
+}
+}
+}
+break;
+}
+});
+
+cljs.core.linear_traversal_nth.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Returns the value at the index. get returns nil if index out of
+ *   bounds, nth throws an exception unless not-found is supplied.  nth
+ *   also works for strings, arrays, regex Matchers and Lists, and,
+ *   in O(n) time, for sequences.
+ */
+cljs.core.nth = (function cljs$core$nth(var_args){
+var G__842 = arguments.length;
+switch (G__842) {
+case 2:
+return cljs.core.nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.nth.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.nth.cljs$core$IFn$_invoke$arity$2 = (function (coll,n){
+if(!(typeof n === 'number')){
+throw (new Error("Index argument to nth must be a number"));
+} else {
+if((coll == null)){
+return coll;
+} else {
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (16))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IIndexed$))))?true:false):false)){
+return coll.cljs$core$IIndexed$_nth$arity$2(null,n);
+} else {
+if(cljs.core.array_QMARK_(coll)){
+if((((n >= (0))) && ((n < coll.length)))){
+return (coll[n]);
+} else {
+throw (new Error("Index out of bounds"));
+}
+} else {
+if(typeof coll === 'string'){
+if((((n >= (0))) && ((n < coll.length)))){
+return coll.charAt(n);
+} else {
+throw (new Error("Index out of bounds"));
+}
+} else {
+if((function (){var or__3936__auto__ = ((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+if(!((coll == null))){
+if((((coll.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISequential$)))){
+return true;
+} else {
+return false;
+}
+} else {
+return false;
+}
+}
+})()){
+return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$2(coll,n);
+} else {
+if(cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,coll)){
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(coll,n);
+} else {
+throw (new Error(["nth not supported on this type ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.type__GT_str(cljs.core.type(coll)))].join('')));
+
+}
+}
+}
+}
+}
+}
+}
+});
+
+cljs.core.nth.cljs$core$IFn$_invoke$arity$3 = (function (coll,n,not_found){
+if(!(typeof n === 'number')){
+throw (new Error("Index argument to nth must be a number."));
+} else {
+if((coll == null)){
+return not_found;
+} else {
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (16))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IIndexed$))))?true:false):false)){
+return coll.cljs$core$IIndexed$_nth$arity$3(null,n,not_found);
+} else {
+if(cljs.core.array_QMARK_(coll)){
+if((((n >= (0))) && ((n < coll.length)))){
+return (coll[n]);
+} else {
+return not_found;
+}
+} else {
+if(typeof coll === 'string'){
+if((((n >= (0))) && ((n < coll.length)))){
+return coll.charAt(n);
+} else {
+return not_found;
+}
+} else {
+if((function (){var or__3936__auto__ = ((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+if(!((coll == null))){
+if((((coll.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISequential$)))){
+return true;
+} else {
+return false;
+}
+} else {
+return false;
+}
+}
+})()){
+return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$3(coll,n,not_found);
+} else {
+if(cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,coll)){
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$3(coll,n,not_found);
+} else {
+throw (new Error(["nth not supported on this type ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.type__GT_str(cljs.core.type(coll)))].join('')));
+
+}
+}
+}
+}
+}
+}
+}
+});
+
+cljs.core.nth.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Returns the nth rest of coll, coll when n is 0.
+ */
+cljs.core.nthrest = (function cljs$core$nthrest(coll,n){
+var n__$1 = n;
+var xs = coll;
+while(true){
+var temp__5455__auto__ = (((n__$1 > (0))) && (cljs.core.seq(xs)));
+if(temp__5455__auto__){
+var xs__$1 = temp__5455__auto__;
+var G__852 = (n__$1 - (1));
+var G__853 = cljs.core.rest(xs__$1);
+n__$1 = G__852;
+xs = G__853;
+continue;
+} else {
+return xs;
+}
+break;
+}
+});
+/**
+ * Returns the value mapped to key, not-found or nil if key not present.
+ */
+cljs.core.get = (function cljs$core$get(var_args){
+var G__855 = arguments.length;
+switch (G__855) {
+case 2:
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.get.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.get.cljs$core$IFn$_invoke$arity$2 = (function (o,k){
+if((o == null)){
+return null;
+} else {
+if(((!((o == null)))?(((((o.cljs$lang$protocol_mask$partition0$ & (256))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$ILookup$))))?true:false):false)){
+return o.cljs$core$ILookup$_lookup$arity$2(null,k);
+} else {
+if(cljs.core.array_QMARK_(o)){
+if(((!((k == null))) && ((k < o.length)))){
+return (o[(k | (0))]);
+} else {
+return null;
+}
+} else {
+if(typeof o === 'string'){
+if(((!((k == null))) && ((k < o.length)))){
+return o.charAt((k | (0)));
+} else {
+return null;
+}
+} else {
+if(cljs.core.native_satisfies_QMARK_(cljs.core.ILookup,o)){
+return cljs.core._lookup.cljs$core$IFn$_invoke$arity$2(o,k);
+} else {
+return null;
+
+}
+}
+}
+}
+}
+});
+
+cljs.core.get.cljs$core$IFn$_invoke$arity$3 = (function (o,k,not_found){
+if(!((o == null))){
+if(((!((o == null)))?(((((o.cljs$lang$protocol_mask$partition0$ & (256))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$ILookup$))))?true:false):false)){
+return o.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+} else {
+if(cljs.core.array_QMARK_(o)){
+if(((!((k == null))) && ((k >= (0))) && ((k < o.length)))){
+return (o[(k | (0))]);
+} else {
+return not_found;
+}
+} else {
+if(typeof o === 'string'){
+if(((!((k == null))) && ((k >= (0))) && ((k < o.length)))){
+return o.charAt((k | (0)));
+} else {
+return not_found;
+}
+} else {
+if(cljs.core.native_satisfies_QMARK_(cljs.core.ILookup,o)){
+return cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(o,k,not_found);
+} else {
+return not_found;
+
+}
+}
+}
+}
+} else {
+return not_found;
+}
+});
+
+cljs.core.get.cljs$lang$maxFixedArity = 3;
+
+
+
+/**
+ * assoc[iate]. When applied to a map, returns a new map of the
+ * same (hashed/sorted) type, that contains the mapping of key(s) to
+ * val(s). When applied to a vector, returns a new vector that
+ * contains val at index.
+ */
+cljs.core.assoc = (function cljs$core$assoc(var_args){
+var G__864 = arguments.length;
+switch (G__864) {
+case 3:
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___866 = arguments.length;
+var i__4519__auto___867 = (0);
+while(true){
+if((i__4519__auto___867 < len__4518__auto___866)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___867]));
+
+var G__868 = (i__4519__auto___867 + (1));
+i__4519__auto___867 = G__868;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.assoc.cljs$core$IFn$_invoke$arity$3 = (function (coll,k,v){
+if(!((coll == null))){
+return cljs.core._assoc(coll,k,v);
+} else {
+return cljs.core.PersistentArrayMap.createAsIfByAssoc([k,v]);
+}
+});
+
+cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic = (function (coll,k,v,kvs){
+while(true){
+var ret = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(coll,k,v);
+if(cljs.core.truth_(kvs)){
+var G__869 = ret;
+var G__870 = cljs.core.first(kvs);
+var G__871 = cljs.core.second(kvs);
+var G__872 = cljs.core.nnext(kvs);
+coll = G__869;
+k = G__870;
+v = G__871;
+kvs = G__872;
+continue;
+} else {
+return ret;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.assoc.cljs$lang$applyTo = (function (seq860){
+var G__861 = cljs.core.first(seq860);
+var seq860__$1 = cljs.core.next(seq860);
+var G__862 = cljs.core.first(seq860__$1);
+var seq860__$2 = cljs.core.next(seq860__$1);
+var G__863 = cljs.core.first(seq860__$2);
+var seq860__$3 = cljs.core.next(seq860__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__861,G__862,G__863,seq860__$3);
+});
+
+cljs.core.assoc.cljs$lang$maxFixedArity = (3);
+
+/**
+ * dissoc[iate]. Returns a new map of the same (hashed/sorted) type,
+ *   that does not contain a mapping for key(s).
+ */
+cljs.core.dissoc = (function cljs$core$dissoc(var_args){
+var G__877 = arguments.length;
+switch (G__877) {
+case 1:
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___879 = arguments.length;
+var i__4519__auto___880 = (0);
+while(true){
+if((i__4519__auto___880 < len__4518__auto___879)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___880]));
+
+var G__881 = (i__4519__auto___880 + (1));
+i__4519__auto___880 = G__881;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.dissoc.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+return coll;
+});
+
+cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2 = (function (coll,k){
+if((coll == null)){
+return null;
+} else {
+return cljs.core._dissoc(coll,k);
+}
+});
+
+cljs.core.dissoc.cljs$core$IFn$_invoke$arity$variadic = (function (coll,k,ks){
+while(true){
+if((coll == null)){
+return null;
+} else {
+var ret = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(coll,k);
+if(cljs.core.truth_(ks)){
+var G__882 = ret;
+var G__883 = cljs.core.first(ks);
+var G__884 = cljs.core.next(ks);
+coll = G__882;
+k = G__883;
+ks = G__884;
+continue;
+} else {
+return ret;
+}
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.dissoc.cljs$lang$applyTo = (function (seq874){
+var G__875 = cljs.core.first(seq874);
+var seq874__$1 = cljs.core.next(seq874);
+var G__876 = cljs.core.first(seq874__$1);
+var seq874__$2 = cljs.core.next(seq874__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__875,G__876,seq874__$2);
+});
+
+cljs.core.dissoc.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Return true if f is a JavaScript function or satisfies the Fn protocol.
+ */
+cljs.core.fn_QMARK_ = (function cljs$core$fn_QMARK_(f){
+var or__3936__auto__ = goog.isFunction(f);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+if(!((f == null))){
+if(((false) || ((cljs.core.PROTOCOL_SENTINEL === f.cljs$core$Fn$)))){
+return true;
+} else {
+if((!f.cljs$lang$protocol_mask$partition$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.Fn,f);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.Fn,f);
+}
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.Fn}
+ * @implements {cljs.core.IWithMeta}
+*/
+cljs.core.MetaFn = (function (afn,meta){
+this.afn = afn;
+this.meta = meta;
+this.cljs$lang$protocol_mask$partition0$ = 393217;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.MetaFn.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.meta;
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_,new_meta){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.MetaFn(self__.afn,new_meta));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$Fn$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.MetaFn.prototype.call = (function() {
+var G__888 = null;
+var G__888__1 = (function (self__){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$0 ? self__.afn.cljs$core$IFn$_invoke$arity$0() : self__.afn.call(null));
+});
+var G__888__2 = (function (self__,a){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$1 ? self__.afn.cljs$core$IFn$_invoke$arity$1(a) : self__.afn.call(null,a));
+});
+var G__888__3 = (function (self__,a,b){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$2 ? self__.afn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.afn.call(null,a,b));
+});
+var G__888__4 = (function (self__,a,b,c){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$3 ? self__.afn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.afn.call(null,a,b,c));
+});
+var G__888__5 = (function (self__,a,b,c,d){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$4 ? self__.afn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.afn.call(null,a,b,c,d));
+});
+var G__888__6 = (function (self__,a,b,c,d,e){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$5 ? self__.afn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.afn.call(null,a,b,c,d,e));
+});
+var G__888__7 = (function (self__,a,b,c,d,e,f){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$6 ? self__.afn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.afn.call(null,a,b,c,d,e,f));
+});
+var G__888__8 = (function (self__,a,b,c,d,e,f,g){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$7 ? self__.afn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.afn.call(null,a,b,c,d,e,f,g));
+});
+var G__888__9 = (function (self__,a,b,c,d,e,f,g,h){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$8 ? self__.afn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.afn.call(null,a,b,c,d,e,f,g,h));
+});
+var G__888__10 = (function (self__,a,b,c,d,e,f,g,h,i){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$9 ? self__.afn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.afn.call(null,a,b,c,d,e,f,g,h,i));
+});
+var G__888__11 = (function (self__,a,b,c,d,e,f,g,h,i,j){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$10 ? self__.afn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j));
+});
+var G__888__12 = (function (self__,a,b,c,d,e,f,g,h,i,j,k){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$11 ? self__.afn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k));
+});
+var G__888__13 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$12 ? self__.afn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+});
+var G__888__14 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$13 ? self__.afn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+});
+var G__888__15 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$14 ? self__.afn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+});
+var G__888__16 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$15 ? self__.afn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+});
+var G__888__17 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$16 ? self__.afn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+});
+var G__888__18 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$17 ? self__.afn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+});
+var G__888__19 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$18 ? self__.afn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+var G__888__20 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$19 ? self__.afn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+var G__888__21 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.afn.cljs$core$IFn$_invoke$arity$20 ? self__.afn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+var G__888__22 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.afn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+G__888 = function(self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+switch(arguments.length){
+case 1:
+return G__888__1.call(this,self__);
+case 2:
+return G__888__2.call(this,self__,a);
+case 3:
+return G__888__3.call(this,self__,a,b);
+case 4:
+return G__888__4.call(this,self__,a,b,c);
+case 5:
+return G__888__5.call(this,self__,a,b,c,d);
+case 6:
+return G__888__6.call(this,self__,a,b,c,d,e);
+case 7:
+return G__888__7.call(this,self__,a,b,c,d,e,f);
+case 8:
+return G__888__8.call(this,self__,a,b,c,d,e,f,g);
+case 9:
+return G__888__9.call(this,self__,a,b,c,d,e,f,g,h);
+case 10:
+return G__888__10.call(this,self__,a,b,c,d,e,f,g,h,i);
+case 11:
+return G__888__11.call(this,self__,a,b,c,d,e,f,g,h,i,j);
+case 12:
+return G__888__12.call(this,self__,a,b,c,d,e,f,g,h,i,j,k);
+case 13:
+return G__888__13.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l);
+case 14:
+return G__888__14.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m);
+case 15:
+return G__888__15.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
+case 16:
+return G__888__16.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
+case 17:
+return G__888__17.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
+case 18:
+return G__888__18.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
+case 19:
+return G__888__19.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
+case 20:
+return G__888__20.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
+case 21:
+return G__888__21.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
+case 22:
+return G__888__22.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__888.cljs$core$IFn$_invoke$arity$1 = G__888__1;
+G__888.cljs$core$IFn$_invoke$arity$2 = G__888__2;
+G__888.cljs$core$IFn$_invoke$arity$3 = G__888__3;
+G__888.cljs$core$IFn$_invoke$arity$4 = G__888__4;
+G__888.cljs$core$IFn$_invoke$arity$5 = G__888__5;
+G__888.cljs$core$IFn$_invoke$arity$6 = G__888__6;
+G__888.cljs$core$IFn$_invoke$arity$7 = G__888__7;
+G__888.cljs$core$IFn$_invoke$arity$8 = G__888__8;
+G__888.cljs$core$IFn$_invoke$arity$9 = G__888__9;
+G__888.cljs$core$IFn$_invoke$arity$10 = G__888__10;
+G__888.cljs$core$IFn$_invoke$arity$11 = G__888__11;
+G__888.cljs$core$IFn$_invoke$arity$12 = G__888__12;
+G__888.cljs$core$IFn$_invoke$arity$13 = G__888__13;
+G__888.cljs$core$IFn$_invoke$arity$14 = G__888__14;
+G__888.cljs$core$IFn$_invoke$arity$15 = G__888__15;
+G__888.cljs$core$IFn$_invoke$arity$16 = G__888__16;
+G__888.cljs$core$IFn$_invoke$arity$17 = G__888__17;
+G__888.cljs$core$IFn$_invoke$arity$18 = G__888__18;
+G__888.cljs$core$IFn$_invoke$arity$19 = G__888__19;
+G__888.cljs$core$IFn$_invoke$arity$20 = G__888__20;
+G__888.cljs$core$IFn$_invoke$arity$21 = G__888__21;
+G__888.cljs$core$IFn$_invoke$arity$22 = G__888__22;
+return G__888;
+})()
+;
+
+cljs.core.MetaFn.prototype.apply = (function (self__,args887){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args887)));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$0 = (function (){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$0 ? self__.afn.cljs$core$IFn$_invoke$arity$0() : self__.afn.call(null));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$1 = (function (a){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$1 ? self__.afn.cljs$core$IFn$_invoke$arity$1(a) : self__.afn.call(null,a));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$2 ? self__.afn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.afn.call(null,a,b));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$3 = (function (a,b,c){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$3 ? self__.afn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.afn.call(null,a,b,c));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,d){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$4 ? self__.afn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.afn.call(null,a,b,c,d));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$5 = (function (a,b,c,d,e){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$5 ? self__.afn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.afn.call(null,a,b,c,d,e));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$6 = (function (a,b,c,d,e,f){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$6 ? self__.afn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.afn.call(null,a,b,c,d,e,f));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$7 = (function (a,b,c,d,e,f,g){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$7 ? self__.afn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.afn.call(null,a,b,c,d,e,f,g));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$8 = (function (a,b,c,d,e,f,g,h){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$8 ? self__.afn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.afn.call(null,a,b,c,d,e,f,g,h));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$9 = (function (a,b,c,d,e,f,g,h,i){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$9 ? self__.afn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.afn.call(null,a,b,c,d,e,f,g,h,i));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$10 = (function (a,b,c,d,e,f,g,h,i,j){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$10 ? self__.afn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$11 = (function (a,b,c,d,e,f,g,h,i,j,k){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$11 ? self__.afn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$12 = (function (a,b,c,d,e,f,g,h,i,j,k,l){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$12 ? self__.afn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$13 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$13 ? self__.afn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$14 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$14 ? self__.afn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$15 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$15 ? self__.afn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$16 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$16 ? self__.afn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$17 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$17 ? self__.afn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$18 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$18 ? self__.afn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$19 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$19 ? self__.afn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$20 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var _ = this;
+return (self__.afn.cljs$core$IFn$_invoke$arity$20 ? self__.afn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+
+cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$21 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var _ = this;
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.afn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+
+cljs.core.MetaFn.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$afn,cljs.core.cst$sym$meta], null);
+});
+
+cljs.core.MetaFn.cljs$lang$type = true;
+
+cljs.core.MetaFn.cljs$lang$ctorStr = "cljs.core/MetaFn";
+
+cljs.core.MetaFn.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/MetaFn");
+});
+
+/**
+ * Positional factory function for cljs.core/MetaFn.
+ */
+cljs.core.__GT_MetaFn = (function cljs$core$__GT_MetaFn(afn,meta){
+return (new cljs.core.MetaFn(afn,meta));
+});
+
+/**
+ * Returns an object of the same type and value as obj, with
+ *   map m as its metadata.
+ */
+cljs.core.with_meta = (function cljs$core$with_meta(o,meta){
+if(goog.isFunction(o)){
+return (new cljs.core.MetaFn(o,meta));
+} else {
+if((o == null)){
+return null;
+} else {
+return cljs.core._with_meta(o,meta);
+}
+}
+});
+/**
+ * Returns the metadata of obj, returns nil if there is no metadata.
+ */
+cljs.core.meta = (function cljs$core$meta(o){
+if((function (){var and__3925__auto__ = !((o == null));
+if(and__3925__auto__){
+if(!((o == null))){
+if((((o.cljs$lang$protocol_mask$partition0$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IMeta$)))){
+return true;
+} else {
+if((!o.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IMeta,o);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IMeta,o);
+}
+} else {
+return and__3925__auto__;
+}
+})()){
+return cljs.core._meta(o);
+} else {
+return null;
+}
+});
+/**
+ * For a list or queue, same as first, for a vector, same as, but much
+ *   more efficient than, last. If the collection is empty, returns nil.
+ */
+cljs.core.peek = (function cljs$core$peek(coll){
+if((coll == null)){
+return null;
+} else {
+return cljs.core._peek(coll);
+}
+});
+/**
+ * For a list or queue, returns a new list/queue without the first
+ *   item, for a vector, returns a new vector without the last item.
+ *   Note - not the same as next/butlast.
+ */
+cljs.core.pop = (function cljs$core$pop(coll){
+if((coll == null)){
+return null;
+} else {
+return cljs.core._pop(coll);
+}
+});
+/**
+ * disj[oin]. Returns a new set of the same (hashed/sorted) type, that
+ *   does not contain key(s).
+ */
+cljs.core.disj = (function cljs$core$disj(var_args){
+var G__895 = arguments.length;
+switch (G__895) {
+case 1:
+return cljs.core.disj.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.disj.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___897 = arguments.length;
+var i__4519__auto___898 = (0);
+while(true){
+if((i__4519__auto___898 < len__4518__auto___897)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___898]));
+
+var G__899 = (i__4519__auto___898 + (1));
+i__4519__auto___898 = G__899;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.disj.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.disj.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+return coll;
+});
+
+cljs.core.disj.cljs$core$IFn$_invoke$arity$2 = (function (coll,k){
+if((coll == null)){
+return null;
+} else {
+return cljs.core._disjoin(coll,k);
+}
+});
+
+cljs.core.disj.cljs$core$IFn$_invoke$arity$variadic = (function (coll,k,ks){
+while(true){
+if((coll == null)){
+return null;
+} else {
+var ret = cljs.core.disj.cljs$core$IFn$_invoke$arity$2(coll,k);
+if(cljs.core.truth_(ks)){
+var G__900 = ret;
+var G__901 = cljs.core.first(ks);
+var G__902 = cljs.core.next(ks);
+coll = G__900;
+k = G__901;
+ks = G__902;
+continue;
+} else {
+return ret;
+}
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.disj.cljs$lang$applyTo = (function (seq892){
+var G__893 = cljs.core.first(seq892);
+var seq892__$1 = cljs.core.next(seq892);
+var G__894 = cljs.core.first(seq892__$1);
+var seq892__$2 = cljs.core.next(seq892__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__893,G__894,seq892__$2);
+});
+
+cljs.core.disj.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns true if coll has no items - same as (not (seq coll)).
+ *   Please use the idiom (seq x) rather than (not (empty? x))
+ */
+cljs.core.empty_QMARK_ = (function cljs$core$empty_QMARK_(coll){
+return (((coll == null)) || (cljs.core.not(cljs.core.seq(coll))));
+});
+/**
+ * Returns true if x satisfies ICollection
+ */
+cljs.core.coll_QMARK_ = (function cljs$core$coll_QMARK_(x){
+if((x == null)){
+return false;
+} else {
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (8))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ICollection$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.ICollection,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.ICollection,x);
+}
+}
+});
+/**
+ * Returns true if x satisfies ISet
+ */
+cljs.core.set_QMARK_ = (function cljs$core$set_QMARK_(x){
+if((x == null)){
+return false;
+} else {
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISet$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x);
+}
+}
+});
+/**
+ * Returns true if coll implements IAssociative
+ */
+cljs.core.associative_QMARK_ = (function cljs$core$associative_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (512))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IAssociative$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IAssociative,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IAssociative,x);
+}
+});
+/**
+ * Returns true if coll implements IFind
+ */
+cljs.core.ifind_QMARK_ = (function cljs$core$ifind_QMARK_(x){
+if(!((x == null))){
+if(((false) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IFind$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IFind,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IFind,x);
+}
+});
+/**
+ * Returns true if coll satisfies ISequential
+ */
+cljs.core.sequential_QMARK_ = (function cljs$core$sequential_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISequential$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x);
+}
+});
+/**
+ * Returns true if coll satisfies ISorted
+ */
+cljs.core.sorted_QMARK_ = (function cljs$core$sorted_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (268435456))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISorted$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISorted,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISorted,x);
+}
+});
+/**
+ * Returns true if coll satisfies IReduce
+ */
+cljs.core.reduceable_QMARK_ = (function cljs$core$reduceable_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (524288))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IReduce$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,x);
+}
+});
+/**
+ * Return true if x satisfies IMap
+ */
+cljs.core.map_QMARK_ = (function cljs$core$map_QMARK_(x){
+if((x == null)){
+return false;
+} else {
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (1024))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IMap$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x);
+}
+}
+});
+/**
+ * Return true if x satisfies IRecord
+ */
+cljs.core.record_QMARK_ = (function cljs$core$record_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (67108864))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IRecord$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IRecord,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IRecord,x);
+}
+});
+/**
+ * Return true if x satisfies IVector
+ */
+cljs.core.vector_QMARK_ = (function cljs$core$vector_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (16384))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IVector$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IVector,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IVector,x);
+}
+});
+
+/**
+ * Return true if x is satisfies IChunkedSeq.
+ */
+cljs.core.chunked_seq_QMARK_ = (function cljs$core$chunked_seq_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition1$ & (512))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IChunkedSeq$)))){
+return true;
+} else {
+return false;
+}
+} else {
+return false;
+}
+});
+/**
+ * Create JavaSript object from an even number arguments representing
+ *   interleaved keys and values.
+ */
+cljs.core.js_obj = (function cljs$core$js_obj(var_args){
+var G__916 = arguments.length;
+switch (G__916) {
+case 0:
+return cljs.core.js_obj.cljs$core$IFn$_invoke$arity$0();
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___920 = arguments.length;
+var i__4519__auto___921 = (0);
+while(true){
+if((i__4519__auto___921 < len__4518__auto___920)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___921]));
+
+var G__922 = (i__4519__auto___921 + (1));
+i__4519__auto___921 = G__922;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((0)),(0),null));
+return cljs.core.js_obj.cljs$core$IFn$_invoke$arity$variadic(argseq__4534__auto__);
+
+}
+});
+
+cljs.core.js_obj.cljs$core$IFn$_invoke$arity$0 = (function (){
+return {};
+});
+
+cljs.core.js_obj.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(goog.object.create,keyvals);
+});
+
+/** @this {Function} */
+cljs.core.js_obj.cljs$lang$applyTo = (function (seq915){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq915));
+});
+
+cljs.core.js_obj.cljs$lang$maxFixedArity = (0);
+
+/**
+ * Return the JavaScript keys for an object.
+ */
+cljs.core.js_keys = (function cljs$core$js_keys(obj){
+return goog.object.getKeys(obj);
+});
+/**
+ * Delete a property from a JavaScript object.
+ *   Returns true upon success, false otherwise.
+ */
+cljs.core.js_delete = (function cljs$core$js_delete(obj,key){
+return delete obj[key];
+});
+cljs.core.array_copy = (function cljs$core$array_copy(from,i,to,j,len){
+var i__$1 = i;
+var j__$1 = j;
+var len__$1 = len;
+while(true){
+if((len__$1 === (0))){
+return to;
+} else {
+(to[j__$1] = (from[i__$1]));
+
+var G__923 = (i__$1 + (1));
+var G__924 = (j__$1 + (1));
+var G__925 = (len__$1 - (1));
+i__$1 = G__923;
+j__$1 = G__924;
+len__$1 = G__925;
+continue;
+}
+break;
+}
+});
+cljs.core.array_copy_downward = (function cljs$core$array_copy_downward(from,i,to,j,len){
+var i__$1 = (i + (len - (1)));
+var j__$1 = (j + (len - (1)));
+var len__$1 = len;
+while(true){
+if((len__$1 === (0))){
+return to;
+} else {
+(to[j__$1] = (from[i__$1]));
+
+var G__926 = (i__$1 - (1));
+var G__927 = (j__$1 - (1));
+var G__928 = (len__$1 - (1));
+i__$1 = G__926;
+j__$1 = G__927;
+len__$1 = G__928;
+continue;
+}
+break;
+}
+});
+cljs.core.lookup_sentinel = {};
+/**
+ * Returns true if x is the value false, false otherwise.
+ */
+cljs.core.false_QMARK_ = (function cljs$core$false_QMARK_(x){
+return x === false;
+});
+/**
+ * Returns true if x is the value true, false otherwise.
+ */
+cljs.core.true_QMARK_ = (function cljs$core$true_QMARK_(x){
+return x === true;
+});
+/**
+ * Return true if x is a Boolean
+ */
+cljs.core.boolean_QMARK_ = (function cljs$core$boolean_QMARK_(x){
+return ((x === true) || (x === false));
+});
+/**
+ * Returns true if x identical to the JavaScript undefined value.
+ */
+cljs.core.undefined_QMARK_ = (function cljs$core$undefined_QMARK_(x){
+return (void 0 === x);
+});
+/**
+ * Return true if s satisfies ISeq
+ */
+cljs.core.seq_QMARK_ = (function cljs$core$seq_QMARK_(s){
+if((s == null)){
+return false;
+} else {
+if(!((s == null))){
+if((((s.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === s.cljs$core$ISeq$)))){
+return true;
+} else {
+if((!s.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISeq,s);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.ISeq,s);
+}
+}
+});
+/**
+ * Return true if the seq function is supported for s
+ */
+cljs.core.seqable_QMARK_ = (function cljs$core$seqable_QMARK_(s){
+var or__3936__auto__ = ((!((s == null)))?(((((s.cljs$lang$protocol_mask$partition0$ & (8388608))) || ((cljs.core.PROTOCOL_SENTINEL === s.cljs$core$ISeqable$))))?true:(((!s.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.ISeqable,s):false)):cljs.core.native_satisfies_QMARK_(cljs.core.ISeqable,s));
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return ((cljs.core.array_QMARK_(s)) || (typeof s === 'string'));
+}
+});
+/**
+ * Coerce to boolean
+ */
+cljs.core.boolean$ = (function cljs$core$boolean(x){
+if((x == null)){
+return false;
+} else {
+if(x === false){
+return false;
+} else {
+return true;
+
+}
+}
+});
+/**
+ * Returns true if f returns true for fn? or satisfies IFn.
+ */
+cljs.core.ifn_QMARK_ = (function cljs$core$ifn_QMARK_(f){
+var or__3936__auto__ = cljs.core.fn_QMARK_(f);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+if(!((f == null))){
+if((((f.cljs$lang$protocol_mask$partition0$ & (1))) || ((cljs.core.PROTOCOL_SENTINEL === f.cljs$core$IFn$)))){
+return true;
+} else {
+if((!f.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IFn,f);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IFn,f);
+}
+}
+});
+/**
+ * Returns true if n is a JavaScript number with no decimal part.
+ */
+cljs.core.integer_QMARK_ = (function cljs$core$integer_QMARK_(n){
+return ((typeof n === 'number') && (!(isNaN(n))) && (!((n === Infinity))) && ((parseFloat(n) === parseInt(n,(10)))));
+});
+/**
+ * Return true if x satisfies integer? or is an instance of goog.math.Integer
+ * or goog.math.Long.
+ */
+cljs.core.int_QMARK_ = (function cljs$core$int_QMARK_(x){
+return ((cljs.core.integer_QMARK_(x)) || ((x instanceof goog.math.Integer)) || ((x instanceof goog.math.Long)));
+});
+/**
+ * Return true if x satisfies int? and is positive.
+ */
+cljs.core.pos_int_QMARK_ = (function cljs$core$pos_int_QMARK_(x){
+if(cljs.core.integer_QMARK_(x)){
+return (x > (0));
+} else {
+if((x instanceof goog.math.Integer)){
+return ((cljs.core.not(x.isNegative())) && (cljs.core.not(x.isZero())));
+} else {
+if((x instanceof goog.math.Long)){
+return ((cljs.core.not(x.isNegative())) && (cljs.core.not(x.isZero())));
+} else {
+return false;
+
+}
+}
+}
+});
+/**
+ * Return true if x satisfies int? and is negative.
+ */
+cljs.core.neg_int_QMARK_ = (function cljs$core$neg_int_QMARK_(x){
+if(cljs.core.integer_QMARK_(x)){
+return (x < (0));
+} else {
+if((x instanceof goog.math.Integer)){
+return x.isNegative();
+} else {
+if((x instanceof goog.math.Long)){
+return x.isNegative();
+} else {
+return false;
+
+}
+}
+}
+});
+/**
+ * Return true if x satisfies int? and is a natural integer value.
+ */
+cljs.core.nat_int_QMARK_ = (function cljs$core$nat_int_QMARK_(x){
+if(cljs.core.integer_QMARK_(x)){
+return !((x < (0)));
+} else {
+if((x instanceof goog.math.Integer)){
+return cljs.core.not(x.isNegative());
+} else {
+if((x instanceof goog.math.Long)){
+return cljs.core.not(x.isNegative());
+} else {
+return false;
+
+}
+}
+}
+});
+/**
+ * Returns true for JavaScript numbers, false otherwise.
+ */
+cljs.core.float_QMARK_ = (function cljs$core$float_QMARK_(x){
+return typeof x === 'number';
+});
+/**
+ * Returns true for JavaScript numbers, false otherwise.
+ */
+cljs.core.double_QMARK_ = (function cljs$core$double_QMARK_(x){
+return typeof x === 'number';
+});
+/**
+ * Returns true for Infinity and -Infinity values.
+ */
+cljs.core.infinite_QMARK_ = (function cljs$core$infinite_QMARK_(x){
+return (((x === Number.POSITIVE_INFINITY)) || ((x === Number.NEGATIVE_INFINITY)));
+});
+/**
+ * Returns true if key is present in the given collection, otherwise
+ *   returns false.  Note that for numerically indexed collections like
+ *   vectors and arrays, this tests if the numeric key is within the
+ *   range of indexes. 'contains?' operates constant or logarithmic time;
+ *   it will not perform a linear search for a value.  See also 'some'.
+ */
+cljs.core.contains_QMARK_ = (function cljs$core$contains_QMARK_(coll,v){
+if((cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,v,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
+return false;
+} else {
+return true;
+}
+});
+/**
+ * Returns the map entry for key, or nil if key not present.
+ */
+cljs.core.find = (function cljs$core$find(coll,k){
+if(cljs.core.ifind_QMARK_(coll)){
+return cljs.core._find(coll,k);
+} else {
+if(((!((coll == null))) && (cljs.core.associative_QMARK_(coll)) && (cljs.core.contains_QMARK_(coll,k)))){
+return (new cljs.core.MapEntry(k,cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,k),null));
+} else {
+return null;
+}
+}
+});
+/**
+ * Returns true if no two of the arguments are =
+ */
+cljs.core.distinct_QMARK_ = (function cljs$core$distinct_QMARK_(var_args){
+var G__940 = arguments.length;
+switch (G__940) {
+case 1:
+return cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___942 = arguments.length;
+var i__4519__auto___943 = (0);
+while(true){
+if((i__4519__auto___943 < len__4518__auto___942)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___943]));
+
+var G__944 = (i__4519__auto___943 + (1));
+i__4519__auto___943 = G__944;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return true;
+});
+
+cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return !(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y));
+});
+
+cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+if(!(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y))){
+var s = cljs.core.PersistentHashSet.createAsIfByAssoc([x,y]);
+var xs = more;
+while(true){
+var x__$1 = cljs.core.first(xs);
+var etc = cljs.core.next(xs);
+if(cljs.core.truth_(xs)){
+if(cljs.core.contains_QMARK_(s,x__$1)){
+return false;
+} else {
+var G__945 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(s,x__$1);
+var G__946 = etc;
+s = G__945;
+xs = G__946;
+continue;
+}
+} else {
+return true;
+}
+break;
+}
+} else {
+return false;
+}
+});
+
+/** @this {Function} */
+cljs.core.distinct_QMARK_.cljs$lang$applyTo = (function (seq937){
+var G__938 = cljs.core.first(seq937);
+var seq937__$1 = cljs.core.next(seq937);
+var G__939 = cljs.core.first(seq937__$1);
+var seq937__$2 = cljs.core.next(seq937__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__938,G__939,seq937__$2);
+});
+
+cljs.core.distinct_QMARK_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Comparator. Returns a negative number, zero, or a positive number
+ *   when x is logically 'less than', 'equal to', or 'greater than'
+ *   y. Uses IComparable if available and google.array.defaultCompare for objects
+ *  of the same type and special-cases nil to be less than any other object.
+ */
+cljs.core.compare = (function cljs$core$compare(x,y){
+if((x === y)){
+return (0);
+} else {
+if((x == null)){
+return (-1);
+} else {
+if((y == null)){
+return (1);
+} else {
+if(typeof x === 'number'){
+if(typeof y === 'number'){
+return goog.array.defaultCompare(x,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+} else {
+if(((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition1$ & (2048))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IComparable$))))?true:(((!x.cljs$lang$protocol_mask$partition1$))?cljs.core.native_satisfies_QMARK_(cljs.core.IComparable,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IComparable,x))){
+return cljs.core._compare(x,y);
+} else {
+if(((((typeof x === 'string') || (cljs.core.array_QMARK_(x)) || (x === true) || (x === false))) && ((cljs.core.type(x) === cljs.core.type(y))))){
+return goog.array.defaultCompare(x,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+
+}
+}
+}
+}
+}
+});
+/**
+ * Compare indexed collection.
+ */
+cljs.core.compare_indexed = (function cljs$core$compare_indexed(var_args){
+var G__949 = arguments.length;
+switch (G__949) {
+case 2:
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 4:
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2 = (function (xs,ys){
+var xl = cljs.core.count(xs);
+var yl = cljs.core.count(ys);
+if((xl < yl)){
+return (-1);
+} else {
+if((xl > yl)){
+return (1);
+} else {
+if((xl === (0))){
+return (0);
+} else {
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$4(xs,ys,xl,(0));
+
+}
+}
+}
+});
+
+cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$4 = (function (xs,ys,len,n){
+while(true){
+var d = cljs.core.compare(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(xs,n),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(ys,n));
+if((((d === (0))) && (((n + (1)) < len)))){
+var G__951 = xs;
+var G__952 = ys;
+var G__953 = len;
+var G__954 = (n + (1));
+xs = G__951;
+ys = G__952;
+len = G__953;
+n = G__954;
+continue;
+} else {
+return d;
+}
+break;
+}
+});
+
+cljs.core.compare_indexed.cljs$lang$maxFixedArity = 4;
+
+/**
+ * Given a fn that might be boolean valued or a comparator,
+ * return a fn that is a comparator.
+ */
+cljs.core.fn__GT_comparator = (function cljs$core$fn__GT_comparator(f){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(f,cljs.core.compare)){
+return cljs.core.compare;
+} else {
+return (function (x,y){
+var r = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y));
+if(typeof r === 'number'){
+return r;
+} else {
+if(cljs.core.truth_(r)){
+return (-1);
+} else {
+if(cljs.core.truth_((f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(y,x) : f.call(null,y,x)))){
+return (1);
+} else {
+return (0);
+}
+}
+}
+});
+}
+});
+/**
+ * Returns a sorted sequence of the items in coll. Comp can be
+ * boolean-valued comparison function, or a -/0/+ valued comparator.
+ * Comp defaults to compare.
+ */
+cljs.core.sort = (function cljs$core$sort(var_args){
+var G__956 = arguments.length;
+switch (G__956) {
+case 1:
+return cljs.core.sort.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.sort.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.sort.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+return cljs.core.sort.cljs$core$IFn$_invoke$arity$2(cljs.core.compare,coll);
+});
+
+cljs.core.sort.cljs$core$IFn$_invoke$arity$2 = (function (comp,coll){
+if(cljs.core.seq(coll)){
+var a = cljs.core.to_array(coll);
+var G__957_960 = a;
+var G__958_961 = cljs.core.fn__GT_comparator(comp);
+goog.array.stableSort(G__957_960,G__958_961);
+
+return cljs.core.seq(a);
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.sort.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a sorted sequence of the items in coll, where the sort
+ * order is determined by comparing (keyfn item).  Comp can be
+ * boolean-valued comparison function, or a -/0/+ valued comparator.
+ * Comp defaults to compare.
+ */
+cljs.core.sort_by = (function cljs$core$sort_by(var_args){
+var G__963 = arguments.length;
+switch (G__963) {
+case 2:
+return cljs.core.sort_by.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.sort_by.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.sort_by.cljs$core$IFn$_invoke$arity$2 = (function (keyfn,coll){
+return cljs.core.sort_by.cljs$core$IFn$_invoke$arity$3(keyfn,cljs.core.compare,coll);
+});
+
+cljs.core.sort_by.cljs$core$IFn$_invoke$arity$3 = (function (keyfn,comp,coll){
+return cljs.core.sort.cljs$core$IFn$_invoke$arity$2((function (x,y){
+var G__965 = (keyfn.cljs$core$IFn$_invoke$arity$1 ? keyfn.cljs$core$IFn$_invoke$arity$1(x) : keyfn.call(null,x));
+var G__966 = (keyfn.cljs$core$IFn$_invoke$arity$1 ? keyfn.cljs$core$IFn$_invoke$arity$1(y) : keyfn.call(null,y));
+var fexpr__964 = cljs.core.fn__GT_comparator(comp);
+return (fexpr__964.cljs$core$IFn$_invoke$arity$2 ? fexpr__964.cljs$core$IFn$_invoke$arity$2(G__965,G__966) : fexpr__964.call(null,G__965,G__966));
+}),coll);
+});
+
+cljs.core.sort_by.cljs$lang$maxFixedArity = 3;
+
+cljs.core.seq_reduce = (function cljs$core$seq_reduce(var_args){
+var G__969 = arguments.length;
+switch (G__969) {
+case 2:
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+var temp__5455__auto__ = cljs.core.seq(coll);
+if(temp__5455__auto__){
+var s = temp__5455__auto__;
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(f,cljs.core.first(s),cljs.core.next(s));
+} else {
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+}
+});
+
+cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3 = (function (f,val,coll){
+var val__$1 = val;
+var coll__$1 = cljs.core.seq(coll);
+while(true){
+if(coll__$1){
+var nval = (function (){var G__970 = val__$1;
+var G__971 = cljs.core.first(coll__$1);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__970,G__971) : f.call(null,G__970,G__971));
+})();
+if(cljs.core.reduced_QMARK_(nval)){
+return cljs.core.deref(nval);
+} else {
+var G__973 = nval;
+var G__974 = cljs.core.next(coll__$1);
+val__$1 = G__973;
+coll__$1 = G__974;
+continue;
+}
+} else {
+return val__$1;
+}
+break;
+}
+});
+
+cljs.core.seq_reduce.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Return a random permutation of coll
+ */
+cljs.core.shuffle = (function cljs$core$shuffle(coll){
+var a = cljs.core.to_array(coll);
+goog.array.shuffle(a);
+
+return cljs.core.vec(a);
+});
+cljs.core.iter_reduce = (function cljs$core$iter_reduce(var_args){
+var G__976 = arguments.length;
+switch (G__976) {
+case 2:
+return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2 = (function (coll,f){
+var iter = cljs.core._iterator(coll);
+if(cljs.core.truth_(iter.hasNext())){
+var init = iter.next();
+var acc = init;
+while(true){
+if(iter.hasNext()){
+var nacc = (function (){var G__977 = acc;
+var G__978 = iter.next();
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__977,G__978) : f.call(null,G__977,G__978));
+})();
+if(cljs.core.reduced_QMARK_(nacc)){
+return cljs.core.deref(nacc);
+} else {
+var G__982 = nacc;
+acc = G__982;
+continue;
+}
+} else {
+return acc;
+}
+break;
+}
+} else {
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+}
+});
+
+cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3 = (function (coll,f,init){
+var iter = cljs.core._iterator(coll);
+var acc = init;
+while(true){
+if(iter.hasNext()){
+var nacc = (function (){var G__979 = acc;
+var G__980 = iter.next();
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__979,G__980) : f.call(null,G__979,G__980));
+})();
+if(cljs.core.reduced_QMARK_(nacc)){
+return cljs.core.deref(nacc);
+} else {
+var G__983 = nacc;
+acc = G__983;
+continue;
+}
+} else {
+return acc;
+}
+break;
+}
+});
+
+cljs.core.iter_reduce.cljs$lang$maxFixedArity = 3;
+
+/**
+ * f should be a function of 2 arguments. If val is not supplied,
+ *   returns the result of applying f to the first 2 items in coll, then
+ *   applying f to that result and the 3rd item, etc. If coll contains no
+ *   items, f must accept no arguments as well, and reduce returns the
+ *   result of calling f with no arguments.  If coll has only 1 item, it
+ *   is returned and f is not called.  If val is supplied, returns the
+ *   result of applying f to val and the first item in coll, then
+ *   applying f to that result and the 2nd item, etc. If coll contains no
+ *   items, returns val and f is not called.
+ */
+cljs.core.reduce = (function cljs$core$reduce(var_args){
+var G__985 = arguments.length;
+switch (G__985) {
+case 2:
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.reduce.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (524288))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IReduce$))))?true:false):false)){
+return coll.cljs$core$IReduce$_reduce$arity$2(null,f);
+} else {
+if(cljs.core.array_QMARK_(coll)){
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
+} else {
+if(typeof coll === 'string'){
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
+} else {
+if(cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,coll)){
+return cljs.core._reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
+} else {
+if(cljs.core.iterable_QMARK_(coll)){
+return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
+} else {
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll);
+
+}
+}
+}
+}
+}
+});
+
+cljs.core.reduce.cljs$core$IFn$_invoke$arity$3 = (function (f,val,coll){
+if(((!((coll == null)))?(((((coll.cljs$lang$protocol_mask$partition0$ & (524288))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IReduce$))))?true:false):false)){
+return coll.cljs$core$IReduce$_reduce$arity$3(null,f,val);
+} else {
+if(cljs.core.array_QMARK_(coll)){
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
+} else {
+if(typeof coll === 'string'){
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
+} else {
+if(cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,coll)){
+return cljs.core._reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
+} else {
+if(cljs.core.iterable_QMARK_(coll)){
+return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
+} else {
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,val,coll);
+
+}
+}
+}
+}
+}
+});
+
+cljs.core.reduce.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Reduces an associative collection. f should be a function of 3
+ *   arguments. Returns the result of applying f to init, the first key
+ *   and the first value in coll, then applying f to that result and the
+ *   2nd key and value, etc. If coll contains no entries, returns init
+ *   and f is not called. Note that reduce-kv is supported on vectors,
+ *   where the keys will be the ordinals.
+ */
+cljs.core.reduce_kv = (function cljs$core$reduce_kv(f,init,coll){
+if(!((coll == null))){
+return cljs.core._kv_reduce(coll,f,init);
+} else {
+return init;
+}
+});
+/**
+ * Returns its argument.
+ */
+cljs.core.identity = (function cljs$core$identity(x){
+return x;
+});
+/**
+ * Takes a reducing function f of 2 args and returns a fn suitable for
+ *   transduce by adding an arity-1 signature that calls cf (default -
+ *   identity) on the result argument.
+ */
+cljs.core.completing = (function cljs$core$completing(var_args){
+var G__990 = arguments.length;
+switch (G__990) {
+case 1:
+return cljs.core.completing.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.completing.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.completing.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return cljs.core.completing.cljs$core$IFn$_invoke$arity$2(f,cljs.core.identity);
+});
+
+cljs.core.completing.cljs$core$IFn$_invoke$arity$2 = (function (f,cf){
+return (function() {
+var G__992 = null;
+var G__992__0 = (function (){
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+});
+var G__992__1 = (function (x){
+return (cf.cljs$core$IFn$_invoke$arity$1 ? cf.cljs$core$IFn$_invoke$arity$1(x) : cf.call(null,x));
+});
+var G__992__2 = (function (x,y){
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y));
+});
+G__992 = function(x,y){
+switch(arguments.length){
+case 0:
+return G__992__0.call(this);
+case 1:
+return G__992__1.call(this,x);
+case 2:
+return G__992__2.call(this,x,y);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__992.cljs$core$IFn$_invoke$arity$0 = G__992__0;
+G__992.cljs$core$IFn$_invoke$arity$1 = G__992__1;
+G__992.cljs$core$IFn$_invoke$arity$2 = G__992__2;
+return G__992;
+})()
+});
+
+cljs.core.completing.cljs$lang$maxFixedArity = 2;
+
+/**
+ * reduce with a transformation of f (xf). If init is not
+ *   supplied, (f) will be called to produce it. f should be a reducing
+ *   step function that accepts both 1 and 2 arguments, if it accepts
+ *   only 2 you can add the arity-1 with 'completing'. Returns the result
+ *   of applying (the transformed) xf to init and the first item in coll,
+ *   then applying xf to that result and the 2nd item, etc. If coll
+ *   contains no items, returns init and f is not called. Note that
+ *   certain transforms may inject or skip items.
+ */
+cljs.core.transduce = (function cljs$core$transduce(var_args){
+var G__994 = arguments.length;
+switch (G__994) {
+case 3:
+return cljs.core.transduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.transduce.cljs$core$IFn$_invoke$arity$3 = (function (xform,f,coll){
+return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(xform,f,(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),coll);
+});
+
+cljs.core.transduce.cljs$core$IFn$_invoke$arity$4 = (function (xform,f,init,coll){
+var f__$1 = (xform.cljs$core$IFn$_invoke$arity$1 ? xform.cljs$core$IFn$_invoke$arity$1(f) : xform.call(null,f));
+var ret = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(f__$1,init,coll);
+return (f__$1.cljs$core$IFn$_invoke$arity$1 ? f__$1.cljs$core$IFn$_invoke$arity$1(ret) : f__$1.call(null,ret));
+});
+
+cljs.core.transduce.cljs$lang$maxFixedArity = 4;
+
+/**
+ * Returns the sum of nums. (+) returns 0.
+ */
+cljs.core._PLUS_ = (function cljs$core$_PLUS_(var_args){
+var G__1000 = arguments.length;
+switch (G__1000) {
+case 0:
+return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1002 = arguments.length;
+var i__4519__auto___1003 = (0);
+while(true){
+if((i__4519__auto___1003 < len__4518__auto___1002)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1003]));
+
+var G__1004 = (i__4519__auto___1003 + (1));
+i__4519__auto___1003 = G__1004;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (0);
+});
+
+cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x + y);
+});
+
+cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._PLUS_,(x + y),more);
+});
+
+/** @this {Function} */
+cljs.core._PLUS_.cljs$lang$applyTo = (function (seq997){
+var G__998 = cljs.core.first(seq997);
+var seq997__$1 = cljs.core.next(seq997);
+var G__999 = cljs.core.first(seq997__$1);
+var seq997__$2 = cljs.core.next(seq997__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__998,G__999,seq997__$2);
+});
+
+cljs.core._PLUS_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * If no ys are supplied, returns the negation of x, else subtracts
+ *   the ys from x and returns the result.
+ */
+cljs.core._ = (function cljs$core$_(var_args){
+var G__1009 = arguments.length;
+switch (G__1009) {
+case 1:
+return cljs.core._.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1011 = arguments.length;
+var i__4519__auto___1012 = (0);
+while(true){
+if((i__4519__auto___1012 < len__4518__auto___1011)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1012]));
+
+var G__1013 = (i__4519__auto___1012 + (1));
+i__4519__auto___1012 = G__1013;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return (- x);
+});
+
+cljs.core._.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x - y);
+});
+
+cljs.core._.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._,(x - y),more);
+});
+
+/** @this {Function} */
+cljs.core._.cljs$lang$applyTo = (function (seq1006){
+var G__1007 = cljs.core.first(seq1006);
+var seq1006__$1 = cljs.core.next(seq1006);
+var G__1008 = cljs.core.first(seq1006__$1);
+var seq1006__$2 = cljs.core.next(seq1006__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1007,G__1008,seq1006__$2);
+});
+
+cljs.core._.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns the product of nums. (*) returns 1.
+ */
+cljs.core._STAR_ = (function cljs$core$_STAR_(var_args){
+var G__1018 = arguments.length;
+switch (G__1018) {
+case 0:
+return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1020 = arguments.length;
+var i__4519__auto___1021 = (0);
+while(true){
+if((i__4519__auto___1021 < len__4518__auto___1020)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1021]));
+
+var G__1022 = (i__4519__auto___1021 + (1));
+i__4519__auto___1021 = G__1022;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._STAR_.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (1);
+});
+
+cljs.core._STAR_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core._STAR_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x * y);
+});
+
+cljs.core._STAR_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._STAR_,(x * y),more);
+});
+
+/** @this {Function} */
+cljs.core._STAR_.cljs$lang$applyTo = (function (seq1015){
+var G__1016 = cljs.core.first(seq1015);
+var seq1015__$1 = cljs.core.next(seq1015);
+var G__1017 = cljs.core.first(seq1015__$1);
+var seq1015__$2 = cljs.core.next(seq1015__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1016,G__1017,seq1015__$2);
+});
+
+cljs.core._STAR_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * If no denominators are supplied, returns 1/numerator,
+ *   else returns numerator divided by all of the denominators.
+ */
+cljs.core._SLASH_ = (function cljs$core$_SLASH_(var_args){
+var G__1027 = arguments.length;
+switch (G__1027) {
+case 1:
+return cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1029 = arguments.length;
+var i__4519__auto___1030 = (0);
+while(true){
+if((i__4519__auto___1030 < len__4518__auto___1029)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1030]));
+
+var G__1031 = (i__4519__auto___1030 + (1));
+i__4519__auto___1030 = G__1031;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return ((1) / x);
+});
+
+cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x / y);
+});
+
+cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._SLASH_,(x / y),more);
+});
+
+/** @this {Function} */
+cljs.core._SLASH_.cljs$lang$applyTo = (function (seq1024){
+var G__1025 = cljs.core.first(seq1024);
+var seq1024__$1 = cljs.core.next(seq1024);
+var G__1026 = cljs.core.first(seq1024__$1);
+var seq1024__$2 = cljs.core.next(seq1024__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1025,G__1026,seq1024__$2);
+});
+
+cljs.core._SLASH_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns non-nil if nums are in monotonically increasing order,
+ *   otherwise false.
+ */
+cljs.core._LT_ = (function cljs$core$_LT_(var_args){
+var G__1036 = arguments.length;
+switch (G__1036) {
+case 1:
+return cljs.core._LT_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._LT_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1038 = arguments.length;
+var i__4519__auto___1039 = (0);
+while(true){
+if((i__4519__auto___1039 < len__4518__auto___1038)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1039]));
+
+var G__1040 = (i__4519__auto___1039 + (1));
+i__4519__auto___1039 = G__1040;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._LT_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._LT_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return true;
+});
+
+cljs.core._LT_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x < y);
+});
+
+cljs.core._LT_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+while(true){
+if((x < y)){
+if(cljs.core.next(more)){
+var G__1041 = y;
+var G__1042 = cljs.core.first(more);
+var G__1043 = cljs.core.next(more);
+x = G__1041;
+y = G__1042;
+more = G__1043;
+continue;
+} else {
+return (y < cljs.core.first(more));
+}
+} else {
+return false;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core._LT_.cljs$lang$applyTo = (function (seq1033){
+var G__1034 = cljs.core.first(seq1033);
+var seq1033__$1 = cljs.core.next(seq1033);
+var G__1035 = cljs.core.first(seq1033__$1);
+var seq1033__$2 = cljs.core.next(seq1033__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1034,G__1035,seq1033__$2);
+});
+
+cljs.core._LT_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns non-nil if nums are in monotonically non-decreasing order,
+ *   otherwise false.
+ */
+cljs.core._LT__EQ_ = (function cljs$core$_LT__EQ_(var_args){
+var G__1048 = arguments.length;
+switch (G__1048) {
+case 1:
+return cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1050 = arguments.length;
+var i__4519__auto___1051 = (0);
+while(true){
+if((i__4519__auto___1051 < len__4518__auto___1050)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1051]));
+
+var G__1052 = (i__4519__auto___1051 + (1));
+i__4519__auto___1051 = G__1052;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return true;
+});
+
+cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x <= y);
+});
+
+cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+while(true){
+if((x <= y)){
+if(cljs.core.next(more)){
+var G__1053 = y;
+var G__1054 = cljs.core.first(more);
+var G__1055 = cljs.core.next(more);
+x = G__1053;
+y = G__1054;
+more = G__1055;
+continue;
+} else {
+return (y <= cljs.core.first(more));
+}
+} else {
+return false;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core._LT__EQ_.cljs$lang$applyTo = (function (seq1045){
+var G__1046 = cljs.core.first(seq1045);
+var seq1045__$1 = cljs.core.next(seq1045);
+var G__1047 = cljs.core.first(seq1045__$1);
+var seq1045__$2 = cljs.core.next(seq1045__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1046,G__1047,seq1045__$2);
+});
+
+cljs.core._LT__EQ_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns non-nil if nums are in monotonically decreasing order,
+ *   otherwise false.
+ */
+cljs.core._GT_ = (function cljs$core$_GT_(var_args){
+var G__1060 = arguments.length;
+switch (G__1060) {
+case 1:
+return cljs.core._GT_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._GT_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1062 = arguments.length;
+var i__4519__auto___1063 = (0);
+while(true){
+if((i__4519__auto___1063 < len__4518__auto___1062)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1063]));
+
+var G__1064 = (i__4519__auto___1063 + (1));
+i__4519__auto___1063 = G__1064;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._GT_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._GT_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return true;
+});
+
+cljs.core._GT_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x > y);
+});
+
+cljs.core._GT_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+while(true){
+if((x > y)){
+if(cljs.core.next(more)){
+var G__1065 = y;
+var G__1066 = cljs.core.first(more);
+var G__1067 = cljs.core.next(more);
+x = G__1065;
+y = G__1066;
+more = G__1067;
+continue;
+} else {
+return (y > cljs.core.first(more));
+}
+} else {
+return false;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core._GT_.cljs$lang$applyTo = (function (seq1057){
+var G__1058 = cljs.core.first(seq1057);
+var seq1057__$1 = cljs.core.next(seq1057);
+var G__1059 = cljs.core.first(seq1057__$1);
+var seq1057__$2 = cljs.core.next(seq1057__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1058,G__1059,seq1057__$2);
+});
+
+cljs.core._GT_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns non-nil if nums are in monotonically non-increasing order,
+ *   otherwise false.
+ */
+cljs.core._GT__EQ_ = (function cljs$core$_GT__EQ_(var_args){
+var G__1072 = arguments.length;
+switch (G__1072) {
+case 1:
+return cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1074 = arguments.length;
+var i__4519__auto___1075 = (0);
+while(true){
+if((i__4519__auto___1075 < len__4518__auto___1074)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1075]));
+
+var G__1076 = (i__4519__auto___1075 + (1));
+i__4519__auto___1075 = G__1076;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return true;
+});
+
+cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x >= y);
+});
+
+cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+while(true){
+if((x >= y)){
+if(cljs.core.next(more)){
+var G__1077 = y;
+var G__1078 = cljs.core.first(more);
+var G__1079 = cljs.core.next(more);
+x = G__1077;
+y = G__1078;
+more = G__1079;
+continue;
+} else {
+return (y >= cljs.core.first(more));
+}
+} else {
+return false;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core._GT__EQ_.cljs$lang$applyTo = (function (seq1069){
+var G__1070 = cljs.core.first(seq1069);
+var seq1069__$1 = cljs.core.next(seq1069);
+var G__1071 = cljs.core.first(seq1069__$1);
+var seq1069__$2 = cljs.core.next(seq1069__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1070,G__1071,seq1069__$2);
+});
+
+cljs.core._GT__EQ_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns a number one less than num.
+ */
+cljs.core.dec = (function cljs$core$dec(x){
+return (x - (1));
+});
+/**
+ * Returns the greatest of the nums.
+ */
+cljs.core.max = (function cljs$core$max(var_args){
+var G__1084 = arguments.length;
+switch (G__1084) {
+case 1:
+return cljs.core.max.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.max.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1086 = arguments.length;
+var i__4519__auto___1087 = (0);
+while(true){
+if((i__4519__auto___1087 < len__4518__auto___1086)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1087]));
+
+var G__1088 = (i__4519__auto___1087 + (1));
+i__4519__auto___1087 = G__1088;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.max.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.max.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core.max.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+var x__4024__auto__ = x;
+var y__4025__auto__ = y;
+return ((x__4024__auto__ > y__4025__auto__) ? x__4024__auto__ : y__4025__auto__);
+});
+
+cljs.core.max.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.max,(function (){var x__4024__auto__ = x;
+var y__4025__auto__ = y;
+return ((x__4024__auto__ > y__4025__auto__) ? x__4024__auto__ : y__4025__auto__);
+})(),more);
+});
+
+/** @this {Function} */
+cljs.core.max.cljs$lang$applyTo = (function (seq1081){
+var G__1082 = cljs.core.first(seq1081);
+var seq1081__$1 = cljs.core.next(seq1081);
+var G__1083 = cljs.core.first(seq1081__$1);
+var seq1081__$2 = cljs.core.next(seq1081__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1082,G__1083,seq1081__$2);
+});
+
+cljs.core.max.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns the least of the nums.
+ */
+cljs.core.min = (function cljs$core$min(var_args){
+var G__1093 = arguments.length;
+switch (G__1093) {
+case 1:
+return cljs.core.min.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.min.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1095 = arguments.length;
+var i__4519__auto___1096 = (0);
+while(true){
+if((i__4519__auto___1096 < len__4518__auto___1095)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1096]));
+
+var G__1097 = (i__4519__auto___1096 + (1));
+i__4519__auto___1096 = G__1097;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.min.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.min.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core.min.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+var x__4027__auto__ = x;
+var y__4028__auto__ = y;
+return ((x__4027__auto__ < y__4028__auto__) ? x__4027__auto__ : y__4028__auto__);
+});
+
+cljs.core.min.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.min,(function (){var x__4027__auto__ = x;
+var y__4028__auto__ = y;
+return ((x__4027__auto__ < y__4028__auto__) ? x__4027__auto__ : y__4028__auto__);
+})(),more);
+});
+
+/** @this {Function} */
+cljs.core.min.cljs$lang$applyTo = (function (seq1090){
+var G__1091 = cljs.core.first(seq1090);
+var seq1090__$1 = cljs.core.next(seq1090);
+var G__1092 = cljs.core.first(seq1090__$1);
+var seq1090__$2 = cljs.core.next(seq1090__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1091,G__1092,seq1090__$2);
+});
+
+cljs.core.min.cljs$lang$maxFixedArity = (2);
+
+cljs.core.byte$ = (function cljs$core$byte(x){
+return x;
+});
+/**
+ * Coerce to char
+ */
+cljs.core.char$ = (function cljs$core$char(x){
+if(typeof x === 'number'){
+return String.fromCharCode(x);
+} else {
+if(((typeof x === 'string') && ((x.length === (1))))){
+return x;
+} else {
+throw (new Error("Argument to char must be a character or number"));
+
+}
+}
+});
+cljs.core.short$ = (function cljs$core$short(x){
+return x;
+});
+cljs.core.float$ = (function cljs$core$float(x){
+return x;
+});
+cljs.core.double$ = (function cljs$core$double(x){
+return x;
+});
+cljs.core.unchecked_byte = (function cljs$core$unchecked_byte(x){
+return x;
+});
+cljs.core.unchecked_char = (function cljs$core$unchecked_char(x){
+return x;
+});
+cljs.core.unchecked_short = (function cljs$core$unchecked_short(x){
+return x;
+});
+cljs.core.unchecked_float = (function cljs$core$unchecked_float(x){
+return x;
+});
+cljs.core.unchecked_double = (function cljs$core$unchecked_double(x){
+return x;
+});
+/**
+ * Returns the sum of nums. (+) returns 0.
+ */
+cljs.core.unchecked_add = (function cljs$core$unchecked_add(var_args){
+var G__1102 = arguments.length;
+switch (G__1102) {
+case 0:
+return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1104 = arguments.length;
+var i__4519__auto___1105 = (0);
+while(true){
+if((i__4519__auto___1105 < len__4518__auto___1104)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1105]));
+
+var G__1106 = (i__4519__auto___1105 + (1));
+i__4519__auto___1105 = G__1106;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (0);
+});
+
+cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x + y);
+});
+
+cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_add,(x + y),more);
+});
+
+/** @this {Function} */
+cljs.core.unchecked_add.cljs$lang$applyTo = (function (seq1099){
+var G__1100 = cljs.core.first(seq1099);
+var seq1099__$1 = cljs.core.next(seq1099);
+var G__1101 = cljs.core.first(seq1099__$1);
+var seq1099__$2 = cljs.core.next(seq1099__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1100,G__1101,seq1099__$2);
+});
+
+cljs.core.unchecked_add.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns the sum of nums. (+) returns 0.
+ */
+cljs.core.unchecked_add_int = (function cljs$core$unchecked_add_int(var_args){
+var G__1111 = arguments.length;
+switch (G__1111) {
+case 0:
+return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1113 = arguments.length;
+var i__4519__auto___1114 = (0);
+while(true){
+if((i__4519__auto___1114 < len__4518__auto___1113)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1114]));
+
+var G__1115 = (i__4519__auto___1114 + (1));
+i__4519__auto___1114 = G__1115;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (0);
+});
+
+cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x + y);
+});
+
+cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_add_int,(x + y),more);
+});
+
+/** @this {Function} */
+cljs.core.unchecked_add_int.cljs$lang$applyTo = (function (seq1108){
+var G__1109 = cljs.core.first(seq1108);
+var seq1108__$1 = cljs.core.next(seq1108);
+var G__1110 = cljs.core.first(seq1108__$1);
+var seq1108__$2 = cljs.core.next(seq1108__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1109,G__1110,seq1108__$2);
+});
+
+cljs.core.unchecked_add_int.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns a number one less than x, an int.
+ */
+cljs.core.unchecked_dec = (function cljs$core$unchecked_dec(x){
+return (x - (1));
+});
+/**
+ * Returns a number one less than x, an int.
+ */
+cljs.core.unchecked_dec_int = (function cljs$core$unchecked_dec_int(x){
+return (x - (1));
+});
+/**
+ * If no denominators are supplied, returns 1/numerator,
+ *   else returns numerator divided by all of the denominators.
+ */
+cljs.core.unchecked_divide_int = (function cljs$core$unchecked_divide_int(var_args){
+var G__1120 = arguments.length;
+switch (G__1120) {
+case 1:
+return cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1122 = arguments.length;
+var i__4519__auto___1123 = (0);
+while(true){
+if((i__4519__auto___1123 < len__4518__auto___1122)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1123]));
+
+var G__1124 = (i__4519__auto___1123 + (1));
+i__4519__auto___1123 = G__1124;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return ((1) / x);
+});
+
+cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x / y);
+});
+
+cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_divide_int,(x / y),more);
+});
+
+/** @this {Function} */
+cljs.core.unchecked_divide_int.cljs$lang$applyTo = (function (seq1117){
+var G__1118 = cljs.core.first(seq1117);
+var seq1117__$1 = cljs.core.next(seq1117);
+var G__1119 = cljs.core.first(seq1117__$1);
+var seq1117__$2 = cljs.core.next(seq1117__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1118,G__1119,seq1117__$2);
+});
+
+cljs.core.unchecked_divide_int.cljs$lang$maxFixedArity = (2);
+
+cljs.core.unchecked_inc = (function cljs$core$unchecked_inc(x){
+return (x + (1));
+});
+cljs.core.unchecked_inc_int = (function cljs$core$unchecked_inc_int(x){
+return (x + (1));
+});
+/**
+ * Returns the product of nums. (*) returns 1.
+ */
+cljs.core.unchecked_multiply = (function cljs$core$unchecked_multiply(var_args){
+var G__1129 = arguments.length;
+switch (G__1129) {
+case 0:
+return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1131 = arguments.length;
+var i__4519__auto___1132 = (0);
+while(true){
+if((i__4519__auto___1132 < len__4518__auto___1131)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1132]));
+
+var G__1133 = (i__4519__auto___1132 + (1));
+i__4519__auto___1132 = G__1133;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (1);
+});
+
+cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x * y);
+});
+
+cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_multiply,(x * y),more);
+});
+
+/** @this {Function} */
+cljs.core.unchecked_multiply.cljs$lang$applyTo = (function (seq1126){
+var G__1127 = cljs.core.first(seq1126);
+var seq1126__$1 = cljs.core.next(seq1126);
+var G__1128 = cljs.core.first(seq1126__$1);
+var seq1126__$2 = cljs.core.next(seq1126__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1127,G__1128,seq1126__$2);
+});
+
+cljs.core.unchecked_multiply.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns the product of nums. (*) returns 1.
+ */
+cljs.core.unchecked_multiply_int = (function cljs$core$unchecked_multiply_int(var_args){
+var G__1138 = arguments.length;
+switch (G__1138) {
+case 0:
+return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1140 = arguments.length;
+var i__4519__auto___1141 = (0);
+while(true){
+if((i__4519__auto___1141 < len__4518__auto___1140)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1141]));
+
+var G__1142 = (i__4519__auto___1141 + (1));
+i__4519__auto___1141 = G__1142;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (1);
+});
+
+cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return x;
+});
+
+cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x * y);
+});
+
+cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_multiply_int,(x * y),more);
+});
+
+/** @this {Function} */
+cljs.core.unchecked_multiply_int.cljs$lang$applyTo = (function (seq1135){
+var G__1136 = cljs.core.first(seq1135);
+var seq1135__$1 = cljs.core.next(seq1135);
+var G__1137 = cljs.core.first(seq1135__$1);
+var seq1135__$2 = cljs.core.next(seq1135__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1136,G__1137,seq1135__$2);
+});
+
+cljs.core.unchecked_multiply_int.cljs$lang$maxFixedArity = (2);
+
+cljs.core.unchecked_negate = (function cljs$core$unchecked_negate(x){
+return (- x);
+});
+cljs.core.unchecked_negate_int = (function cljs$core$unchecked_negate_int(x){
+return (- x);
+});
+cljs.core.unchecked_remainder_int = (function cljs$core$unchecked_remainder_int(x,n){
+return cljs.core.mod(x,n);
+});
+/**
+ * If no ys are supplied, returns the negation of x, else subtracts
+ *   the ys from x and returns the result.
+ */
+cljs.core.unchecked_subtract = (function cljs$core$unchecked_subtract(var_args){
+var G__1147 = arguments.length;
+switch (G__1147) {
+case 1:
+return cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1149 = arguments.length;
+var i__4519__auto___1150 = (0);
+while(true){
+if((i__4519__auto___1150 < len__4518__auto___1149)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1150]));
+
+var G__1151 = (i__4519__auto___1150 + (1));
+i__4519__auto___1150 = G__1151;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return (- x);
+});
+
+cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x - y);
+});
+
+cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_subtract,(x - y),more);
+});
+
+/** @this {Function} */
+cljs.core.unchecked_subtract.cljs$lang$applyTo = (function (seq1144){
+var G__1145 = cljs.core.first(seq1144);
+var seq1144__$1 = cljs.core.next(seq1144);
+var G__1146 = cljs.core.first(seq1144__$1);
+var seq1144__$2 = cljs.core.next(seq1144__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1145,G__1146,seq1144__$2);
+});
+
+cljs.core.unchecked_subtract.cljs$lang$maxFixedArity = (2);
+
+/**
+ * If no ys are supplied, returns the negation of x, else subtracts
+ *   the ys from x and returns the result.
+ */
+cljs.core.unchecked_subtract_int = (function cljs$core$unchecked_subtract_int(var_args){
+var G__1156 = arguments.length;
+switch (G__1156) {
+case 1:
+return cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1158 = arguments.length;
+var i__4519__auto___1159 = (0);
+while(true){
+if((i__4519__auto___1159 < len__4518__auto___1158)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1159]));
+
+var G__1160 = (i__4519__auto___1159 + (1));
+i__4519__auto___1159 = G__1160;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return (- x);
+});
+
+cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x - y);
+});
+
+cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_subtract_int,(x - y),more);
+});
+
+/** @this {Function} */
+cljs.core.unchecked_subtract_int.cljs$lang$applyTo = (function (seq1153){
+var G__1154 = cljs.core.first(seq1153);
+var seq1153__$1 = cljs.core.next(seq1153);
+var G__1155 = cljs.core.first(seq1153__$1);
+var seq1153__$2 = cljs.core.next(seq1153__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1154,G__1155,seq1153__$2);
+});
+
+cljs.core.unchecked_subtract_int.cljs$lang$maxFixedArity = (2);
+
+cljs.core.fix = (function cljs$core$fix(q){
+if((q >= (0))){
+return Math.floor(q);
+} else {
+return Math.ceil(q);
+}
+});
+/**
+ * Coerce to int by stripping decimal places.
+ */
+cljs.core.int$ = (function cljs$core$int(x){
+return (x | (0));
+});
+/**
+ * Coerce to int by stripping decimal places.
+ */
+cljs.core.unchecked_int = (function cljs$core$unchecked_int(x){
+return cljs.core.fix(x);
+});
+/**
+ * Coerce to long by stripping decimal places. Identical to `int'.
+ */
+cljs.core.long$ = (function cljs$core$long(x){
+return cljs.core.fix(x);
+});
+/**
+ * Coerce to long by stripping decimal places. Identical to `int'.
+ */
+cljs.core.unchecked_long = (function cljs$core$unchecked_long(x){
+return cljs.core.fix(x);
+});
+cljs.core.booleans = (function cljs$core$booleans(x){
+return x;
+});
+cljs.core.bytes = (function cljs$core$bytes(x){
+return x;
+});
+cljs.core.chars = (function cljs$core$chars(x){
+return x;
+});
+cljs.core.shorts = (function cljs$core$shorts(x){
+return x;
+});
+cljs.core.ints = (function cljs$core$ints(x){
+return x;
+});
+cljs.core.floats = (function cljs$core$floats(x){
+return x;
+});
+cljs.core.doubles = (function cljs$core$doubles(x){
+return x;
+});
+cljs.core.longs = (function cljs$core$longs(x){
+return x;
+});
+/**
+ * Modulus of num and div with original javascript behavior. i.e. bug for negative numbers
+ */
+cljs.core.js_mod = (function cljs$core$js_mod(n,d){
+return (n % d);
+});
+/**
+ * Modulus of num and div. Truncates toward negative infinity.
+ */
+cljs.core.mod = (function cljs$core$mod(n,d){
+return (((n % d) + d) % d);
+});
+/**
+ * quot[ient] of dividing numerator by denominator.
+ */
+cljs.core.quot = (function cljs$core$quot(n,d){
+var rem = (n % d);
+return cljs.core.fix(((n - rem) / d));
+});
+/**
+ * remainder of dividing numerator by denominator.
+ */
+cljs.core.rem = (function cljs$core$rem(n,d){
+var q = cljs.core.quot(n,d);
+return (n - (d * q));
+});
+/**
+ * Bitwise exclusive or
+ */
+cljs.core.bit_xor = (function cljs$core$bit_xor(var_args){
+var G__1165 = arguments.length;
+switch (G__1165) {
+case 2:
+return cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1167 = arguments.length;
+var i__4519__auto___1168 = (0);
+while(true){
+if((i__4519__auto___1168 < len__4518__auto___1167)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1168]));
+
+var G__1169 = (i__4519__auto___1168 + (1));
+i__4519__auto___1168 = G__1169;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x ^ y);
+});
+
+cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_xor,(x ^ y),more);
+});
+
+/** @this {Function} */
+cljs.core.bit_xor.cljs$lang$applyTo = (function (seq1162){
+var G__1163 = cljs.core.first(seq1162);
+var seq1162__$1 = cljs.core.next(seq1162);
+var G__1164 = cljs.core.first(seq1162__$1);
+var seq1162__$2 = cljs.core.next(seq1162__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1163,G__1164,seq1162__$2);
+});
+
+cljs.core.bit_xor.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Bitwise and
+ */
+cljs.core.bit_and = (function cljs$core$bit_and(var_args){
+var G__1174 = arguments.length;
+switch (G__1174) {
+case 2:
+return cljs.core.bit_and.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1176 = arguments.length;
+var i__4519__auto___1177 = (0);
+while(true){
+if((i__4519__auto___1177 < len__4518__auto___1176)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1177]));
+
+var G__1178 = (i__4519__auto___1177 + (1));
+i__4519__auto___1177 = G__1178;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.bit_and.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.bit_and.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x & y);
+});
+
+cljs.core.bit_and.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_and,(x & y),more);
+});
+
+/** @this {Function} */
+cljs.core.bit_and.cljs$lang$applyTo = (function (seq1171){
+var G__1172 = cljs.core.first(seq1171);
+var seq1171__$1 = cljs.core.next(seq1171);
+var G__1173 = cljs.core.first(seq1171__$1);
+var seq1171__$2 = cljs.core.next(seq1171__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1172,G__1173,seq1171__$2);
+});
+
+cljs.core.bit_and.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Bitwise or
+ */
+cljs.core.bit_or = (function cljs$core$bit_or(var_args){
+var G__1183 = arguments.length;
+switch (G__1183) {
+case 2:
+return cljs.core.bit_or.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1185 = arguments.length;
+var i__4519__auto___1186 = (0);
+while(true){
+if((i__4519__auto___1186 < len__4518__auto___1185)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1186]));
+
+var G__1187 = (i__4519__auto___1186 + (1));
+i__4519__auto___1186 = G__1187;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.bit_or.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.bit_or.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x | y);
+});
+
+cljs.core.bit_or.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_or,(x | y),more);
+});
+
+/** @this {Function} */
+cljs.core.bit_or.cljs$lang$applyTo = (function (seq1180){
+var G__1181 = cljs.core.first(seq1180);
+var seq1180__$1 = cljs.core.next(seq1180);
+var G__1182 = cljs.core.first(seq1180__$1);
+var seq1180__$2 = cljs.core.next(seq1180__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1181,G__1182,seq1180__$2);
+});
+
+cljs.core.bit_or.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Bitwise and with complement
+ */
+cljs.core.bit_and_not = (function cljs$core$bit_and_not(var_args){
+var G__1192 = arguments.length;
+switch (G__1192) {
+case 2:
+return cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1194 = arguments.length;
+var i__4519__auto___1195 = (0);
+while(true){
+if((i__4519__auto___1195 < len__4518__auto___1194)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1195]));
+
+var G__1196 = (i__4519__auto___1195 + (1));
+i__4519__auto___1195 = G__1196;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (x & ~y);
+});
+
+cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_and_not,(x & ~y),more);
+});
+
+/** @this {Function} */
+cljs.core.bit_and_not.cljs$lang$applyTo = (function (seq1189){
+var G__1190 = cljs.core.first(seq1189);
+var seq1189__$1 = cljs.core.next(seq1189);
+var G__1191 = cljs.core.first(seq1189__$1);
+var seq1189__$2 = cljs.core.next(seq1189__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1190,G__1191,seq1189__$2);
+});
+
+cljs.core.bit_and_not.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Clear bit at index n
+ */
+cljs.core.bit_clear = (function cljs$core$bit_clear(x,n){
+return (x & ~(1 << n));
+});
+/**
+ * Flip bit at index n
+ */
+cljs.core.bit_flip = (function cljs$core$bit_flip(x,n){
+return (x ^ (1 << n));
+});
+/**
+ * Bitwise complement
+ */
+cljs.core.bit_not = (function cljs$core$bit_not(x){
+return (~ x);
+});
+/**
+ * Set bit at index n
+ */
+cljs.core.bit_set = (function cljs$core$bit_set(x,n){
+return (x | (1 << n));
+});
+/**
+ * Test bit at index n
+ */
+cljs.core.bit_test = (function cljs$core$bit_test(x,n){
+return ((x & (1 << n)) != 0);
+});
+/**
+ * Bitwise shift left
+ */
+cljs.core.bit_shift_left = (function cljs$core$bit_shift_left(x,n){
+return (x << n);
+});
+/**
+ * Bitwise shift right
+ */
+cljs.core.bit_shift_right = (function cljs$core$bit_shift_right(x,n){
+return (x >> n);
+});
+/**
+ * DEPRECATED: Bitwise shift right with zero fill
+ */
+cljs.core.bit_shift_right_zero_fill = (function cljs$core$bit_shift_right_zero_fill(x,n){
+return (x >>> n);
+});
+/**
+ * Bitwise shift right with zero fill
+ */
+cljs.core.unsigned_bit_shift_right = (function cljs$core$unsigned_bit_shift_right(x,n){
+return (x >>> n);
+});
+/**
+ * Counts the number of bits set in n
+ */
+cljs.core.bit_count = (function cljs$core$bit_count(v){
+var v__$1 = (v - ((v >> (1)) & (1431655765)));
+var v__$2 = ((v__$1 & (858993459)) + ((v__$1 >> (2)) & (858993459)));
+return ((((v__$2 + (v__$2 >> (4))) & (252645135)) * (16843009)) >> (24));
+});
+/**
+ * Returns non-nil if nums all have the equivalent
+ *   value, otherwise false. Behavior on non nums is
+ *   undefined.
+ */
+cljs.core._EQ__EQ_ = (function cljs$core$_EQ__EQ_(var_args){
+var G__1201 = arguments.length;
+switch (G__1201) {
+case 1:
+return cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1203 = arguments.length;
+var i__4519__auto___1204 = (0);
+while(true){
+if((i__4519__auto___1204 < len__4518__auto___1203)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1204]));
+
+var G__1205 = (i__4519__auto___1204 + (1));
+i__4519__auto___1204 = G__1205;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return true;
+});
+
+cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return cljs.core._equiv(x,y);
+});
+
+cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+while(true){
+if((x === y)){
+if(cljs.core.next(more)){
+var G__1206 = y;
+var G__1207 = cljs.core.first(more);
+var G__1208 = cljs.core.next(more);
+x = G__1206;
+y = G__1207;
+more = G__1208;
+continue;
+} else {
+return (y === cljs.core.first(more));
+}
+} else {
+return false;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core._EQ__EQ_.cljs$lang$applyTo = (function (seq1198){
+var G__1199 = cljs.core.first(seq1198);
+var seq1198__$1 = cljs.core.next(seq1198);
+var G__1200 = cljs.core.first(seq1198__$1);
+var seq1198__$2 = cljs.core.next(seq1198__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1199,G__1200,seq1198__$2);
+});
+
+cljs.core._EQ__EQ_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns true if num is greater than zero, else false
+ */
+cljs.core.pos_QMARK_ = (function cljs$core$pos_QMARK_(x){
+return (x > (0));
+});
+/**
+ * Returns true if num is zero, else false
+ */
+cljs.core.zero_QMARK_ = (function cljs$core$zero_QMARK_(x){
+return (x === (0));
+});
+/**
+ * Returns true if num is less than zero, else false
+ */
+cljs.core.neg_QMARK_ = (function cljs$core$neg_QMARK_(x){
+return (x < (0));
+});
+/**
+ * Returns the nth next of coll, (seq coll) when n is 0.
+ */
+cljs.core.nthnext = (function cljs$core$nthnext(coll,n){
+var n__$1 = n;
+var xs = cljs.core.seq(coll);
+while(true){
+if(((xs) && ((n__$1 > (0))))){
+var G__1209 = (n__$1 - (1));
+var G__1210 = cljs.core.next(xs);
+n__$1 = G__1209;
+xs = G__1210;
+continue;
+} else {
+return xs;
+}
+break;
+}
+});
+/**
+ * With no args, returns the empty string. With one arg x, returns
+ *   x.toString().  (str nil) returns the empty string. With more than
+ *   one arg, returns the concatenation of the str values of the args.
+ */
+cljs.core.str = (function cljs$core$str(var_args){
+var G__1214 = arguments.length;
+switch (G__1214) {
+case 0:
+return cljs.core.str.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.str.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1216 = arguments.length;
+var i__4519__auto___1217 = (0);
+while(true){
+if((i__4519__auto___1217 < len__4518__auto___1216)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1217]));
+
+var G__1218 = (i__4519__auto___1217 + (1));
+i__4519__auto___1217 = G__1218;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((1)),(0),null));
+return cljs.core.str.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.str.cljs$core$IFn$_invoke$arity$0 = (function (){
+return "";
+});
+
+cljs.core.str.cljs$core$IFn$_invoke$arity$1 = (function (x){
+if((x == null)){
+return "";
+} else {
+return [x].join("");
+}
+});
+
+cljs.core.str.cljs$core$IFn$_invoke$arity$variadic = (function (x,ys){
+var sb = (new goog.string.StringBuffer([cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)].join('')));
+var more = ys;
+while(true){
+if(cljs.core.truth_(more)){
+var G__1219 = sb.append([cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(more))].join(''));
+var G__1220 = cljs.core.next(more);
+sb = G__1219;
+more = G__1220;
+continue;
+} else {
+return sb.toString();
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.str.cljs$lang$applyTo = (function (seq1212){
+var G__1213 = cljs.core.first(seq1212);
+var seq1212__$1 = cljs.core.next(seq1212);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1213,seq1212__$1);
+});
+
+cljs.core.str.cljs$lang$maxFixedArity = (1);
+
+/**
+ * Returns the substring of s beginning at start inclusive, and ending
+ *   at end (defaults to length of string), exclusive.
+ */
+cljs.core.subs = (function cljs$core$subs(var_args){
+var G__1222 = arguments.length;
+switch (G__1222) {
+case 2:
+return cljs.core.subs.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.subs.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.subs.cljs$core$IFn$_invoke$arity$2 = (function (s,start){
+return s.substring(start);
+});
+
+cljs.core.subs.cljs$core$IFn$_invoke$arity$3 = (function (s,start,end){
+return s.substring(start,end);
+});
+
+cljs.core.subs.cljs$lang$maxFixedArity = 3;
+
+
+/**
+ * Assumes x is sequential. Returns true if x equals y, otherwise
+ *   returns false.
+ */
+cljs.core.equiv_sequential = (function cljs$core$equiv_sequential(x,y){
+return cljs.core.boolean$(((cljs.core.sequential_QMARK_(y))?((((cljs.core.counted_QMARK_(x)) && (cljs.core.counted_QMARK_(y)) && (!((cljs.core.count(x) === cljs.core.count(y))))))?false:(function (){var xs = cljs.core.seq(x);
+var ys = cljs.core.seq(y);
+while(true){
+if((xs == null)){
+return (ys == null);
+} else {
+if((ys == null)){
+return false;
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.first(xs),cljs.core.first(ys))){
+var G__1224 = cljs.core.next(xs);
+var G__1225 = cljs.core.next(ys);
+xs = G__1224;
+ys = G__1225;
+continue;
+} else {
+return false;
+
+}
+}
+}
+break;
+}
+})()):null));
+});
+cljs.core.hash_coll = (function cljs$core$hash_coll(coll){
+if(cljs.core.seq(coll)){
+var res = cljs.core.hash(cljs.core.first(coll));
+var s = cljs.core.next(coll);
+while(true){
+if((s == null)){
+return res;
+} else {
+var G__1226 = cljs.core.hash_combine(res,cljs.core.hash(cljs.core.first(s)));
+var G__1227 = cljs.core.next(s);
+res = G__1226;
+s = G__1227;
+continue;
+}
+break;
+}
+} else {
+return (0);
+}
+});
+
+cljs.core.hash_imap = (function cljs$core$hash_imap(m){
+var h = (0);
+var s = cljs.core.seq(m);
+while(true){
+if(s){
+var e = cljs.core.first(s);
+var G__1228 = ((h + (cljs.core.hash(cljs.core.key(e)) ^ cljs.core.hash(cljs.core.val(e)))) % (4503599627370496));
+var G__1229 = cljs.core.next(s);
+h = G__1228;
+s = G__1229;
+continue;
+} else {
+return h;
+}
+break;
+}
+});
+cljs.core.hash_iset = (function cljs$core$hash_iset(s){
+var h = (0);
+var s__$1 = cljs.core.seq(s);
+while(true){
+if(s__$1){
+var e = cljs.core.first(s__$1);
+var G__1230 = ((h + cljs.core.hash(e)) % (4503599627370496));
+var G__1231 = cljs.core.next(s__$1);
+h = G__1230;
+s__$1 = G__1231;
+continue;
+} else {
+return h;
+}
+break;
+}
+});
+
+
+/**
+ * Takes a JavaScript object and a map of names to functions and
+ *   attaches said functions as methods on the object.  Any references to
+ *   JavaScript's implicit this (via the this-as macro) will resolve to the
+ *   object that the function is attached.
+ */
+cljs.core.extend_object_BANG_ = (function cljs$core$extend_object_BANG_(obj,fn_map){
+var seq__1232_1242 = cljs.core.seq(fn_map);
+var chunk__1233_1243 = null;
+var count__1234_1244 = (0);
+var i__1235_1245 = (0);
+while(true){
+if((i__1235_1245 < count__1234_1244)){
+var vec__1236_1246 = chunk__1233_1243.cljs$core$IIndexed$_nth$arity$2(null,i__1235_1245);
+var key_name_1247 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1236_1246,(0),null);
+var f_1248 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1236_1246,(1),null);
+var str_name_1249 = cljs.core.name(key_name_1247);
+goog.object.set(obj,str_name_1249,f_1248);
+
+
+var G__1250 = seq__1232_1242;
+var G__1251 = chunk__1233_1243;
+var G__1252 = count__1234_1244;
+var G__1253 = (i__1235_1245 + (1));
+seq__1232_1242 = G__1250;
+chunk__1233_1243 = G__1251;
+count__1234_1244 = G__1252;
+i__1235_1245 = G__1253;
+continue;
+} else {
+var temp__5457__auto___1254 = cljs.core.seq(seq__1232_1242);
+if(temp__5457__auto___1254){
+var seq__1232_1255__$1 = temp__5457__auto___1254;
+if(cljs.core.chunked_seq_QMARK_(seq__1232_1255__$1)){
+var c__4338__auto___1256 = cljs.core.chunk_first(seq__1232_1255__$1);
+var G__1257 = cljs.core.chunk_rest(seq__1232_1255__$1);
+var G__1258 = c__4338__auto___1256;
+var G__1259 = cljs.core.count(c__4338__auto___1256);
+var G__1260 = (0);
+seq__1232_1242 = G__1257;
+chunk__1233_1243 = G__1258;
+count__1234_1244 = G__1259;
+i__1235_1245 = G__1260;
+continue;
+} else {
+var vec__1239_1261 = cljs.core.first(seq__1232_1255__$1);
+var key_name_1262 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1239_1261,(0),null);
+var f_1263 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1239_1261,(1),null);
+var str_name_1264 = cljs.core.name(key_name_1262);
+goog.object.set(obj,str_name_1264,f_1263);
+
+
+var G__1265 = cljs.core.next(seq__1232_1255__$1);
+var G__1266 = null;
+var G__1267 = (0);
+var G__1268 = (0);
+seq__1232_1242 = G__1265;
+chunk__1233_1243 = G__1266;
+count__1234_1244 = G__1267;
+i__1235_1245 = G__1268;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+return obj;
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IList}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ASeq}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.List = (function (meta,first,rest,count,__hash){
+this.meta = meta;
+this.first = first;
+this.rest = rest;
+this.count = count;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 65937646;
+this.cljs$lang$protocol_mask$partition1$ = 8192;
+});
+cljs.core.List.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.List.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.List.prototype.indexOf = (function() {
+var G__1269 = null;
+var G__1269__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__1269__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1269 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1269__1.call(this,x);
+case 2:
+return G__1269__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1269.cljs$core$IFn$_invoke$arity$1 = G__1269__1;
+G__1269.cljs$core$IFn$_invoke$arity$2 = G__1269__2;
+return G__1269;
+})()
+;
+
+cljs.core.List.prototype.lastIndexOf = (function() {
+var G__1270 = null;
+var G__1270__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,self__.count);
+});
+var G__1270__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1270 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1270__1.call(this,x);
+case 2:
+return G__1270__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1270.cljs$core$IFn$_invoke$arity$1 = G__1270__1;
+G__1270.cljs$core$IFn$_invoke$arity$2 = G__1270__2;
+return G__1270;
+})()
+;
+
+cljs.core.List.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.List.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.List(self__.meta,self__.first,self__.rest,self__.count,self__.__hash));
+});
+
+cljs.core.List.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.count === (1))){
+return null;
+} else {
+return self__.rest;
+}
+});
+
+cljs.core.List.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.count;
+});
+
+cljs.core.List.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.first;
+});
+
+cljs.core.List.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ISeq$_rest$arity$1(null);
+});
+
+cljs.core.List.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.List.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.List.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.List.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.List.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.List.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.first;
+});
+
+cljs.core.List.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.count === (1))){
+return cljs.core.List.EMPTY;
+} else {
+return self__.rest;
+}
+});
+
+cljs.core.List.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.List.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.List(meta__$1,self__.first,self__.rest,self__.count,self__.__hash));
+});
+
+cljs.core.List.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.List(self__.meta,o,coll__$1,(self__.count + (1)),null));
+});
+
+cljs.core.List.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$first,cljs.core.cst$sym$rest,cljs.core.cst$sym$count,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.List.cljs$lang$type = true;
+
+cljs.core.List.cljs$lang$ctorStr = "cljs.core/List";
+
+cljs.core.List.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/List");
+});
+
+/**
+ * Positional factory function for cljs.core/List.
+ */
+cljs.core.__GT_List = (function cljs$core$__GT_List(meta,first,rest,count,__hash){
+return (new cljs.core.List(meta,first,rest,count,__hash));
+});
+
+/**
+ * Returns true if x implements IList
+ */
+cljs.core.list_QMARK_ = (function cljs$core$list_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (33554432))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IList$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IList,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IList,x);
+}
+});
+var G__1272_1275 = cljs.core.List.prototype;
+var G__1273_1276 = cljs.core.ITER_SYMBOL;
+var G__1274_1277 = ((function (G__1272_1275,G__1273_1276){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__1272_1275,G__1273_1276))
+;
+goog.object.set(G__1272_1275,G__1273_1276,G__1274_1277);
+
+/**
+* @constructor
+ * @implements {cljs.core.IList}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.EmptyList = (function (meta){
+this.meta = meta;
+this.cljs$lang$protocol_mask$partition0$ = 65937614;
+this.cljs$lang$protocol_mask$partition1$ = 8192;
+});
+cljs.core.EmptyList.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.EmptyList.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.EmptyList.prototype.indexOf = (function() {
+var G__1278 = null;
+var G__1278__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__1278__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1278 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1278__1.call(this,x);
+case 2:
+return G__1278__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1278.cljs$core$IFn$_invoke$arity$1 = G__1278__1;
+G__1278.cljs$core$IFn$_invoke$arity$2 = G__1278__2;
+return G__1278;
+})()
+;
+
+cljs.core.EmptyList.prototype.lastIndexOf = (function() {
+var G__1279 = null;
+var G__1279__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__1279__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1279 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1279__1.call(this,x);
+case 2:
+return G__1279__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1279.cljs$core$IFn$_invoke$arity$1 = G__1279__1;
+G__1279.cljs$core$IFn$_invoke$arity$2 = G__1279__2;
+return G__1279;
+})()
+;
+
+cljs.core.EmptyList.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.EmptyList(self__.meta));
+});
+
+cljs.core.EmptyList.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return null;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (0);
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return null;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+throw (new Error("Can't pop empty list"));
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.empty_ordered_hash;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+if(((cljs.core.list_QMARK_(other)) || (cljs.core.sequential_QMARK_(other)))){
+return (cljs.core.seq(other) == null);
+} else {
+return false;
+}
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.EmptyList.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return null;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.List.EMPTY;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return null;
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.EmptyList(meta__$1));
+});
+
+cljs.core.EmptyList.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.List(self__.meta,o,null,(1),null));
+});
+
+cljs.core.EmptyList.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta], null);
+});
+
+cljs.core.EmptyList.cljs$lang$type = true;
+
+cljs.core.EmptyList.cljs$lang$ctorStr = "cljs.core/EmptyList";
+
+cljs.core.EmptyList.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/EmptyList");
+});
+
+/**
+ * Positional factory function for cljs.core/EmptyList.
+ */
+cljs.core.__GT_EmptyList = (function cljs$core$__GT_EmptyList(meta){
+return (new cljs.core.EmptyList(meta));
+});
+
+cljs.core.List.EMPTY = (new cljs.core.EmptyList(null));
+var G__1280_1283 = cljs.core.EmptyList.prototype;
+var G__1281_1284 = cljs.core.ITER_SYMBOL;
+var G__1282_1285 = ((function (G__1280_1283,G__1281_1284){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__1280_1283,G__1281_1284))
+;
+goog.object.set(G__1280_1283,G__1281_1284,G__1282_1285);
+/**
+ * Returns true if coll satisfies? IReversible.
+ */
+cljs.core.reversible_QMARK_ = (function cljs$core$reversible_QMARK_(coll){
+if(!((coll == null))){
+if((((coll.cljs$lang$protocol_mask$partition0$ & (134217728))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IReversible$)))){
+return true;
+} else {
+if((!coll.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IReversible,coll);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IReversible,coll);
+}
+});
+/**
+ * Returns, in constant time, a seq of the items in rev (which
+ *   can be a vector or sorted-map), in reverse order. If rev is empty returns nil
+ */
+cljs.core.rseq = (function cljs$core$rseq(rev){
+return cljs.core._rseq(rev);
+});
+/**
+ * Returns a seq of the items in coll in reverse order. Not lazy.
+ */
+cljs.core.reverse = (function cljs$core$reverse(coll){
+if(cljs.core.reversible_QMARK_(coll)){
+var or__3936__auto__ = cljs.core.rseq(coll);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return cljs.core.List.EMPTY;
+}
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,cljs.core.List.EMPTY,coll);
+}
+});
+/**
+ * Creates a new list containing the items.
+ */
+cljs.core.list = (function cljs$core$list(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___1288 = arguments.length;
+var i__4519__auto___1289 = (0);
+while(true){
+if((i__4519__auto___1289 < len__4518__auto___1288)){
+args__4521__auto__.push((arguments[i__4519__auto___1289]));
+
+var G__1290 = (i__4519__auto___1289 + (1));
+i__4519__auto___1289 = G__1290;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.list.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.list.cljs$core$IFn$_invoke$arity$variadic = (function (xs){
+var arr = (((((xs instanceof cljs.core.IndexedSeq)) && ((xs.i === (0)))))?xs.arr:(function (){var arr = [];
+var xs__$1 = xs;
+while(true){
+if(!((xs__$1 == null))){
+arr.push(xs__$1.cljs$core$ISeq$_first$arity$1(null));
+
+var G__1291 = xs__$1.cljs$core$INext$_next$arity$1(null);
+xs__$1 = G__1291;
+continue;
+} else {
+return arr;
+}
+break;
+}
+})());
+var i = arr.length;
+var r = cljs.core.List.EMPTY;
+while(true){
+if((i > (0))){
+var G__1292 = (i - (1));
+var G__1293 = r.cljs$core$ICollection$_conj$arity$2(null,(arr[(i - (1))]));
+i = G__1292;
+r = G__1293;
+continue;
+} else {
+return r;
+}
+break;
+}
+});
+
+cljs.core.list.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.list.cljs$lang$applyTo = (function (seq1287){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq1287));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IList}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ASeq}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.Cons = (function (meta,first,rest,__hash){
+this.meta = meta;
+this.first = first;
+this.rest = rest;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 65929452;
+this.cljs$lang$protocol_mask$partition1$ = 8192;
+});
+cljs.core.Cons.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.Cons.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.Cons.prototype.indexOf = (function() {
+var G__1294 = null;
+var G__1294__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__1294__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1294 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1294__1.call(this,x);
+case 2:
+return G__1294__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1294.cljs$core$IFn$_invoke$arity$1 = G__1294__1;
+G__1294.cljs$core$IFn$_invoke$arity$2 = G__1294__2;
+return G__1294;
+})()
+;
+
+cljs.core.Cons.prototype.lastIndexOf = (function() {
+var G__1295 = null;
+var G__1295__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__1295__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1295 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1295__1.call(this,x);
+case 2:
+return G__1295__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1295.cljs$core$IFn$_invoke$arity$1 = G__1295__1;
+G__1295.cljs$core$IFn$_invoke$arity$2 = G__1295__2;
+return G__1295;
+})()
+;
+
+cljs.core.Cons.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.Cons.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.Cons(self__.meta,self__.first,self__.rest,self__.__hash));
+});
+
+cljs.core.Cons.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.rest == null)){
+return null;
+} else {
+return cljs.core.seq(self__.rest);
+}
+});
+
+cljs.core.Cons.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.Cons.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.Cons.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.Cons.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.Cons.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.Cons.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.first;
+});
+
+cljs.core.Cons.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.rest == null)){
+return cljs.core.List.EMPTY;
+} else {
+return self__.rest;
+}
+});
+
+cljs.core.Cons.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.Cons.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.Cons(meta__$1,self__.first,self__.rest,self__.__hash));
+});
+
+cljs.core.Cons.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.Cons(null,o,coll__$1,null));
+});
+
+cljs.core.Cons.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$first,cljs.core.cst$sym$rest,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Cons.cljs$lang$type = true;
+
+cljs.core.Cons.cljs$lang$ctorStr = "cljs.core/Cons";
+
+cljs.core.Cons.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Cons");
+});
+
+/**
+ * Positional factory function for cljs.core/Cons.
+ */
+cljs.core.__GT_Cons = (function cljs$core$__GT_Cons(meta,first,rest,__hash){
+return (new cljs.core.Cons(meta,first,rest,__hash));
+});
+
+var G__1296_1299 = cljs.core.Cons.prototype;
+var G__1297_1300 = cljs.core.ITER_SYMBOL;
+var G__1298_1301 = ((function (G__1296_1299,G__1297_1300){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__1296_1299,G__1297_1300))
+;
+goog.object.set(G__1296_1299,G__1297_1300,G__1298_1301);
+/**
+ * Returns a new seq where x is the first element and coll is the rest.
+ */
+cljs.core.cons = (function cljs$core$cons(x,coll){
+if((function (){var or__3936__auto__ = (coll == null);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+if(!((coll == null))){
+if((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$)))){
+return true;
+} else {
+return false;
+}
+} else {
+return false;
+}
+}
+})()){
+return (new cljs.core.Cons(null,x,coll,null));
+} else {
+return (new cljs.core.Cons(null,x,cljs.core.seq(coll),null));
+}
+});
+cljs.core.hash_keyword = (function cljs$core$hash_keyword(k){
+return ((cljs.core.hash_symbol(k) + (2654435769)) | (0));
+});
+cljs.core.compare_keywords = (function cljs$core$compare_keywords(a,b){
+if((a.fqn === b.fqn)){
+return (0);
+} else {
+if(cljs.core.truth_((function (){var and__3925__auto__ = cljs.core.not(a.ns);
+if(and__3925__auto__){
+return b.ns;
+} else {
+return and__3925__auto__;
+}
+})())){
+return (-1);
+} else {
+if(cljs.core.truth_(a.ns)){
+if(cljs.core.not(b.ns)){
+return (1);
+} else {
+var nsc = (function (){var G__1304 = a.ns;
+var G__1305 = b.ns;
+return goog.array.defaultCompare(G__1304,G__1305);
+})();
+if(((0) === nsc)){
+var G__1306 = a.name;
+var G__1307 = b.name;
+return goog.array.defaultCompare(G__1306,G__1307);
+} else {
+return nsc;
+}
+}
+} else {
+var G__1308 = a.name;
+var G__1309 = b.name;
+return goog.array.defaultCompare(G__1308,G__1309);
+
+}
+}
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.INamed}
+ * @implements {cljs.core.IPrintWithWriter}
+*/
+cljs.core.Keyword = (function (ns,name,fqn,_hash){
+this.ns = ns;
+this.name = name;
+this.fqn = fqn;
+this._hash = _hash;
+this.cljs$lang$protocol_mask$partition0$ = 2153775105;
+this.cljs$lang$protocol_mask$partition1$ = 4096;
+});
+cljs.core.Keyword.prototype.toString = (function (){
+var self__ = this;
+var _ = this;
+return [":",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.fqn)].join('');
+});
+
+cljs.core.Keyword.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.Keyword.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+if((other instanceof cljs.core.Keyword)){
+return (self__.fqn === other.fqn);
+} else {
+return false;
+}
+});
+
+cljs.core.Keyword.prototype.call = (function() {
+var G__1311 = null;
+var G__1311__2 = (function (self__,coll){
+var self__ = this;
+var self____$1 = this;
+var kw = self____$1;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,kw);
+});
+var G__1311__3 = (function (self__,coll,not_found){
+var self__ = this;
+var self____$1 = this;
+var kw = self____$1;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,kw,not_found);
+});
+G__1311 = function(self__,coll,not_found){
+switch(arguments.length){
+case 2:
+return G__1311__2.call(this,self__,coll);
+case 3:
+return G__1311__3.call(this,self__,coll,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__1311.cljs$core$IFn$_invoke$arity$2 = G__1311__2;
+G__1311.cljs$core$IFn$_invoke$arity$3 = G__1311__3;
+return G__1311;
+})()
+;
+
+cljs.core.Keyword.prototype.apply = (function (self__,args1310){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args1310)));
+});
+
+cljs.core.Keyword.prototype.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+var self__ = this;
+var kw = this;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,kw);
+});
+
+cljs.core.Keyword.prototype.cljs$core$IFn$_invoke$arity$2 = (function (coll,not_found){
+var self__ = this;
+var kw = this;
+return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,kw,not_found);
+});
+
+cljs.core.Keyword.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var h__4048__auto__ = self__._hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_keyword(this$__$1);
+self__._hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.Keyword.prototype.cljs$core$INamed$_name$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.name;
+});
+
+cljs.core.Keyword.prototype.cljs$core$INamed$_namespace$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.ns;
+});
+
+cljs.core.Keyword.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (o,writer,_){
+var self__ = this;
+var o__$1 = this;
+return cljs.core._write(writer,[":",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.fqn)].join(''));
+});
+
+cljs.core.Keyword.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$ns,cljs.core.cst$sym$name,cljs.core.cst$sym$fqn,cljs.core.with_meta(cljs.core.cst$sym$_hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Keyword.cljs$lang$type = true;
+
+cljs.core.Keyword.cljs$lang$ctorStr = "cljs.core/Keyword";
+
+cljs.core.Keyword.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Keyword");
+});
+
+/**
+ * Positional factory function for cljs.core/Keyword.
+ */
+cljs.core.__GT_Keyword = (function cljs$core$__GT_Keyword(ns,name,fqn,_hash){
+return (new cljs.core.Keyword(ns,name,fqn,_hash));
+});
+
+/**
+ * Return true if x is a Keyword
+ */
+cljs.core.keyword_QMARK_ = (function cljs$core$keyword_QMARK_(x){
+return (x instanceof cljs.core.Keyword);
+});
+/**
+ * Efficient test to determine that two keywords are identical.
+ */
+cljs.core.keyword_identical_QMARK_ = (function cljs$core$keyword_identical_QMARK_(x,y){
+if((x === y)){
+return true;
+} else {
+if((((x instanceof cljs.core.Keyword)) && ((y instanceof cljs.core.Keyword)))){
+return (x.fqn === y.fqn);
+} else {
+return false;
+}
+}
+});
+/**
+ * Efficient test to determine that two symbols are identical.
+ */
+cljs.core.symbol_identical_QMARK_ = (function cljs$core$symbol_identical_QMARK_(x,y){
+if((x === y)){
+return true;
+} else {
+if((((x instanceof cljs.core.Symbol)) && ((y instanceof cljs.core.Symbol)))){
+return (x.str === y.str);
+} else {
+return false;
+}
+}
+});
+/**
+ * Returns the namespace String of a symbol or keyword, or nil if not present.
+ */
+cljs.core.namespace = (function cljs$core$namespace(x){
+if(((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition1$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$INamed$))))?true:false):false)){
+return x.cljs$core$INamed$_namespace$arity$1(null);
+} else {
+throw (new Error(["Doesn't support namespace: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)].join('')));
+}
+});
+/**
+ * Return true if x is a symbol or keyword
+ */
+cljs.core.ident_QMARK_ = (function cljs$core$ident_QMARK_(x){
+return (((x instanceof cljs.core.Keyword)) || ((x instanceof cljs.core.Symbol)));
+});
+/**
+ * Return true if x is a symbol or keyword without a namespace
+ */
+cljs.core.simple_ident_QMARK_ = (function cljs$core$simple_ident_QMARK_(x){
+return ((cljs.core.ident_QMARK_(x)) && ((cljs.core.namespace(x) == null)));
+});
+/**
+ * Return true if x is a symbol or keyword with a namespace
+ */
+cljs.core.qualified_ident_QMARK_ = (function cljs$core$qualified_ident_QMARK_(x){
+return cljs.core.boolean$((function (){var and__3925__auto__ = cljs.core.ident_QMARK_(x);
+if(and__3925__auto__){
+var and__3925__auto____$1 = cljs.core.namespace(x);
+if(cljs.core.truth_(and__3925__auto____$1)){
+return true;
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+/**
+ * Return true if x is a symbol without a namespace
+ */
+cljs.core.simple_symbol_QMARK_ = (function cljs$core$simple_symbol_QMARK_(x){
+return (((x instanceof cljs.core.Symbol)) && ((cljs.core.namespace(x) == null)));
+});
+/**
+ * Return true if x is a symbol with a namespace
+ */
+cljs.core.qualified_symbol_QMARK_ = (function cljs$core$qualified_symbol_QMARK_(x){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (x instanceof cljs.core.Symbol);
+if(and__3925__auto__){
+var and__3925__auto____$1 = cljs.core.namespace(x);
+if(cljs.core.truth_(and__3925__auto____$1)){
+return true;
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+/**
+ * Return true if x is a keyword without a namespace
+ */
+cljs.core.simple_keyword_QMARK_ = (function cljs$core$simple_keyword_QMARK_(x){
+return (((x instanceof cljs.core.Keyword)) && ((cljs.core.namespace(x) == null)));
+});
+/**
+ * Return true if x is a keyword with a namespace
+ */
+cljs.core.qualified_keyword_QMARK_ = (function cljs$core$qualified_keyword_QMARK_(x){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (x instanceof cljs.core.Keyword);
+if(and__3925__auto__){
+var and__3925__auto____$1 = cljs.core.namespace(x);
+if(cljs.core.truth_(and__3925__auto____$1)){
+return true;
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+/**
+ * Returns a Keyword with the given namespace and name.  Do not use :
+ *   in the keyword strings, it will be added automatically.
+ */
+cljs.core.keyword = (function cljs$core$keyword(var_args){
+var G__1314 = arguments.length;
+switch (G__1314) {
+case 1:
+return cljs.core.keyword.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.keyword.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.keyword.cljs$core$IFn$_invoke$arity$1 = (function (name){
+if((name instanceof cljs.core.Keyword)){
+return name;
+} else {
+if((name instanceof cljs.core.Symbol)){
+return (new cljs.core.Keyword(cljs.core.namespace(name),cljs.core.name(name),name.str,null));
+} else {
+if(typeof name === 'string'){
+var parts = name.split("/");
+if((parts.length === (2))){
+return (new cljs.core.Keyword((parts[(0)]),(parts[(1)]),name,null));
+} else {
+return (new cljs.core.Keyword(null,(parts[(0)]),name,null));
+}
+} else {
+return null;
+}
+}
+}
+});
+
+cljs.core.keyword.cljs$core$IFn$_invoke$arity$2 = (function (ns,name){
+var ns__$1 = (((ns instanceof cljs.core.Keyword))?cljs.core.name(ns):(((ns instanceof cljs.core.Symbol))?cljs.core.name(ns):ns
+));
+var name__$1 = (((name instanceof cljs.core.Keyword))?cljs.core.name(name):(((name instanceof cljs.core.Symbol))?cljs.core.name(name):name
+));
+return (new cljs.core.Keyword(ns__$1,name__$1,[cljs.core.str.cljs$core$IFn$_invoke$arity$1((cljs.core.truth_(ns__$1)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns__$1),"/"].join(''):null)),cljs.core.str.cljs$core$IFn$_invoke$arity$1(name__$1)].join(''),null));
+});
+
+cljs.core.keyword.cljs$lang$maxFixedArity = 2;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IPending}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.LazySeq = (function (meta,fn,s,__hash){
+this.meta = meta;
+this.fn = fn;
+this.s = s;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 32374988;
+this.cljs$lang$protocol_mask$partition1$ = 1;
+});
+cljs.core.LazySeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.LazySeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.LazySeq.prototype.sval = (function (){
+var self__ = this;
+var coll = this;
+if((self__.fn == null)){
+return self__.s;
+} else {
+self__.s = (self__.fn.cljs$core$IFn$_invoke$arity$0 ? self__.fn.cljs$core$IFn$_invoke$arity$0() : self__.fn.call(null));
+
+self__.fn = null;
+
+return self__.s;
+}
+});
+
+cljs.core.LazySeq.prototype.indexOf = (function() {
+var G__1316 = null;
+var G__1316__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__1316__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1316 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1316__1.call(this,x);
+case 2:
+return G__1316__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1316.cljs$core$IFn$_invoke$arity$1 = G__1316__1;
+G__1316.cljs$core$IFn$_invoke$arity$2 = G__1316__2;
+return G__1316;
+})()
+;
+
+cljs.core.LazySeq.prototype.lastIndexOf = (function() {
+var G__1317 = null;
+var G__1317__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__1317__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1317 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1317__1.call(this,x);
+case 2:
+return G__1317__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1317.cljs$core$IFn$_invoke$arity$1 = G__1317__1;
+G__1317.cljs$core$IFn$_invoke$arity$2 = G__1317__2;
+return G__1317;
+})()
+;
+
+cljs.core.LazySeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.LazySeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
+
+if((self__.s == null)){
+return null;
+} else {
+return cljs.core.next(self__.s);
+}
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.not(self__.fn);
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.LazySeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
+
+if((self__.s == null)){
+return null;
+} else {
+return cljs.core.first(self__.s);
+}
+});
+
+cljs.core.LazySeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
+
+if(!((self__.s == null))){
+return cljs.core.rest(self__.s);
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.LazySeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+coll__$1.sval();
+
+if((self__.s == null)){
+return null;
+} else {
+var ls = self__.s;
+while(true){
+if((ls instanceof cljs.core.LazySeq)){
+var G__1318 = ls.sval();
+ls = G__1318;
+continue;
+} else {
+self__.s = ls;
+
+return cljs.core.seq(self__.s);
+}
+break;
+}
+}
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.LazySeq(meta__$1,((function (coll__$1){
+return (function (){
+return coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
+});})(coll__$1))
+,null,self__.__hash));
+});
+
+cljs.core.LazySeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.LazySeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$fn,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.LazySeq.cljs$lang$type = true;
+
+cljs.core.LazySeq.cljs$lang$ctorStr = "cljs.core/LazySeq";
+
+cljs.core.LazySeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/LazySeq");
+});
+
+/**
+ * Positional factory function for cljs.core/LazySeq.
+ */
+cljs.core.__GT_LazySeq = (function cljs$core$__GT_LazySeq(meta,fn,s,__hash){
+return (new cljs.core.LazySeq(meta,fn,s,__hash));
+});
+
+var G__1319_1322 = cljs.core.LazySeq.prototype;
+var G__1320_1323 = cljs.core.ITER_SYMBOL;
+var G__1321_1324 = ((function (G__1319_1322,G__1320_1323){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__1319_1322,G__1320_1323))
+;
+goog.object.set(G__1319_1322,G__1320_1323,G__1321_1324);
+
+/**
+* @constructor
+ * @implements {cljs.core.ICounted}
+*/
+cljs.core.ChunkBuffer = (function (buf,end){
+this.buf = buf;
+this.end = end;
+this.cljs$lang$protocol_mask$partition0$ = 2;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.ChunkBuffer.prototype.add = (function (o){
+var self__ = this;
+var _ = this;
+(self__.buf[self__.end] = o);
+
+return self__.end = (self__.end + (1));
+});
+
+cljs.core.ChunkBuffer.prototype.chunk = (function (){
+var self__ = this;
+var _ = this;
+var ret = (new cljs.core.ArrayChunk(self__.buf,(0),self__.end));
+self__.buf = null;
+
+return ret;
+});
+
+cljs.core.ChunkBuffer.prototype.cljs$core$ICounted$_count$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.end;
+});
+
+cljs.core.ChunkBuffer.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$buf,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$end,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ChunkBuffer.cljs$lang$type = true;
+
+cljs.core.ChunkBuffer.cljs$lang$ctorStr = "cljs.core/ChunkBuffer";
+
+cljs.core.ChunkBuffer.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ChunkBuffer");
+});
+
+/**
+ * Positional factory function for cljs.core/ChunkBuffer.
+ */
+cljs.core.__GT_ChunkBuffer = (function cljs$core$__GT_ChunkBuffer(buf,end){
+return (new cljs.core.ChunkBuffer(buf,end));
+});
+
+cljs.core.chunk_buffer = (function cljs$core$chunk_buffer(capacity){
+return (new cljs.core.ChunkBuffer((new Array(capacity)),(0)));
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.IChunk}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.ArrayChunk = (function (arr,off,end){
+this.arr = arr;
+this.off = off;
+this.end = end;
+this.cljs$lang$protocol_mask$partition0$ = 524306;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.ArrayChunk.prototype.cljs$core$ICounted$_count$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (self__.end - self__.off);
+});
+
+cljs.core.ArrayChunk.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,i){
+var self__ = this;
+var coll__$1 = this;
+return (self__.arr[(self__.off + i)]);
+});
+
+cljs.core.ArrayChunk.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,i,not_found){
+var self__ = this;
+var coll__$1 = this;
+if((((i >= (0))) && ((i < (self__.end - self__.off))))){
+return (self__.arr[(self__.off + i)]);
+} else {
+return not_found;
+}
+});
+
+cljs.core.ArrayChunk.prototype.cljs$core$IChunk$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ArrayChunk.prototype.cljs$core$IChunk$_drop_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.off === self__.end)){
+throw (new Error("-drop-first of empty chunk"));
+} else {
+return (new cljs.core.ArrayChunk(self__.arr,(self__.off + (1)),self__.end));
+}
+});
+
+cljs.core.ArrayChunk.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,(self__.arr[self__.off]),(self__.off + (1)));
+});
+
+cljs.core.ArrayChunk.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,start,self__.off);
+});
+
+cljs.core.ArrayChunk.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.cst$sym$off,cljs.core.cst$sym$end], null);
+});
+
+cljs.core.ArrayChunk.cljs$lang$type = true;
+
+cljs.core.ArrayChunk.cljs$lang$ctorStr = "cljs.core/ArrayChunk";
+
+cljs.core.ArrayChunk.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ArrayChunk");
+});
+
+/**
+ * Positional factory function for cljs.core/ArrayChunk.
+ */
+cljs.core.__GT_ArrayChunk = (function cljs$core$__GT_ArrayChunk(arr,off,end){
+return (new cljs.core.ArrayChunk(arr,off,end));
+});
+
+cljs.core.array_chunk = (function cljs$core$array_chunk(var_args){
+var G__1326 = arguments.length;
+switch (G__1326) {
+case 1:
+return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$1 = (function (arr){
+return (new cljs.core.ArrayChunk(arr,(0),arr.length));
+});
+
+cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$2 = (function (arr,off){
+return (new cljs.core.ArrayChunk(arr,off,arr.length));
+});
+
+cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$3 = (function (arr,off,end){
+return (new cljs.core.ArrayChunk(arr,off,end));
+});
+
+cljs.core.array_chunk.cljs$lang$maxFixedArity = 3;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ASeq}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IChunkedNext}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IChunkedSeq}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+*/
+cljs.core.ChunkedCons = (function (chunk,more,meta,__hash){
+this.chunk = chunk;
+this.more = more;
+this.meta = meta;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 31850732;
+this.cljs$lang$protocol_mask$partition1$ = 1536;
+});
+cljs.core.ChunkedCons.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.ChunkedCons.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.ChunkedCons.prototype.indexOf = (function() {
+var G__1328 = null;
+var G__1328__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__1328__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1328 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1328__1.call(this,x);
+case 2:
+return G__1328__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1328.cljs$core$IFn$_invoke$arity$1 = G__1328__1;
+G__1328.cljs$core$IFn$_invoke$arity$2 = G__1328__2;
+return G__1328;
+})()
+;
+
+cljs.core.ChunkedCons.prototype.lastIndexOf = (function() {
+var G__1329 = null;
+var G__1329__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__1329__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1329 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1329__1.call(this,x);
+case 2:
+return G__1329__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1329.cljs$core$IFn$_invoke$arity$1 = G__1329__1;
+G__1329.cljs$core$IFn$_invoke$arity$2 = G__1329__2;
+return G__1329;
+})()
+;
+
+cljs.core.ChunkedCons.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((cljs.core._count(self__.chunk) > (1))){
+return (new cljs.core.ChunkedCons(cljs.core._drop_first(self__.chunk),self__.more,self__.meta,null));
+} else {
+var more__$1 = cljs.core._seq(self__.more);
+if((more__$1 == null)){
+return null;
+} else {
+return more__$1;
+}
+}
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.chunk,(0));
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((cljs.core._count(self__.chunk) > (1))){
+return (new cljs.core.ChunkedCons(cljs.core._drop_first(self__.chunk),self__.more,self__.meta,null));
+} else {
+if((self__.more == null)){
+return cljs.core.List.EMPTY;
+} else {
+return self__.more;
+}
+}
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IChunkedSeq$_chunked_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.chunk;
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IChunkedSeq$_chunked_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.more == null)){
+return cljs.core.List.EMPTY;
+} else {
+return self__.more;
+}
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,m){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.ChunkedCons(self__.chunk,self__.more,m,self__.__hash));
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$ICollection$_conj$arity$2 = (function (this$,o){
+var self__ = this;
+var this$__$1 = this;
+return cljs.core.cons(o,this$__$1);
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IChunkedNext$_chunked_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.more == null)){
+return null;
+} else {
+return self__.more;
+}
+});
+
+cljs.core.ChunkedCons.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$chunk,cljs.core.cst$sym$more,cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ChunkedCons.cljs$lang$type = true;
+
+cljs.core.ChunkedCons.cljs$lang$ctorStr = "cljs.core/ChunkedCons";
+
+cljs.core.ChunkedCons.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ChunkedCons");
+});
+
+/**
+ * Positional factory function for cljs.core/ChunkedCons.
+ */
+cljs.core.__GT_ChunkedCons = (function cljs$core$__GT_ChunkedCons(chunk,more,meta,__hash){
+return (new cljs.core.ChunkedCons(chunk,more,meta,__hash));
+});
+
+var G__1330_1333 = cljs.core.ChunkedCons.prototype;
+var G__1331_1334 = cljs.core.ITER_SYMBOL;
+var G__1332_1335 = ((function (G__1330_1333,G__1331_1334){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__1330_1333,G__1331_1334))
+;
+goog.object.set(G__1330_1333,G__1331_1334,G__1332_1335);
+cljs.core.chunk_cons = (function cljs$core$chunk_cons(chunk,rest){
+if((cljs.core._count(chunk) === (0))){
+return rest;
+} else {
+return (new cljs.core.ChunkedCons(chunk,rest,null,null));
+}
+});
+cljs.core.chunk_append = (function cljs$core$chunk_append(b,x){
+return b.add(x);
+});
+cljs.core.chunk = (function cljs$core$chunk(b){
+return b.chunk();
+});
+cljs.core.chunk_first = (function cljs$core$chunk_first(s){
+return cljs.core._chunked_first(s);
+});
+cljs.core.chunk_rest = (function cljs$core$chunk_rest(s){
+return cljs.core._chunked_rest(s);
+});
+cljs.core.chunk_next = (function cljs$core$chunk_next(s){
+if(((!((s == null)))?(((((s.cljs$lang$protocol_mask$partition1$ & (1024))) || ((cljs.core.PROTOCOL_SENTINEL === s.cljs$core$IChunkedNext$))))?true:false):false)){
+return cljs.core._chunked_next(s);
+} else {
+return cljs.core.seq(cljs.core._chunked_rest(s));
+}
+});
+/**
+ * Naive impl of to-array as a start.
+ */
+cljs.core.to_array = (function cljs$core$to_array(s){
+var ary = [];
+var s__$1 = cljs.core.seq(s);
+while(true){
+if(!((s__$1 == null))){
+ary.push(cljs.core.first(s__$1));
+
+var G__1337 = cljs.core.next(s__$1);
+s__$1 = G__1337;
+continue;
+} else {
+return ary;
+}
+break;
+}
+});
+/**
+ * Returns a (potentially-ragged) 2-dimensional array
+ *   containing the contents of coll.
+ */
+cljs.core.to_array_2d = (function cljs$core$to_array_2d(coll){
+var ret = (new Array(cljs.core.count(coll)));
+var i_1338 = (0);
+var xs_1339 = cljs.core.seq(coll);
+while(true){
+if((xs_1339 == null)){
+} else {
+(ret[i_1338] = cljs.core.to_array(cljs.core.first(xs_1339)));
+
+var G__1340 = (i_1338 + (1));
+var G__1341 = cljs.core.next(xs_1339);
+i_1338 = G__1340;
+xs_1339 = G__1341;
+continue;
+}
+break;
+}
+
+return ret;
+});
+/**
+ * Creates an array of ints. Does not coerce array, provided for compatibility
+ *   with Clojure.
+ */
+cljs.core.int_array = (function cljs$core$int_array(var_args){
+var G__1343 = arguments.length;
+switch (G__1343) {
+case 1:
+return cljs.core.int_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.int_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.int_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
+if(typeof size_or_seq === 'number'){
+return cljs.core.int_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
+} else {
+return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
+}
+});
+
+cljs.core.int_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
+var a = (new Array(size));
+if(cljs.core.seq_QMARK_(init_val_or_seq)){
+var s = cljs.core.seq(init_val_or_seq);
+var i = (0);
+var s__$1 = s;
+while(true){
+if(((s__$1) && ((i < size)))){
+(a[i] = cljs.core.first(s__$1));
+
+var G__1345 = (i + (1));
+var G__1346 = cljs.core.next(s__$1);
+i = G__1345;
+s__$1 = G__1346;
+continue;
+} else {
+return a;
+}
+break;
+}
+} else {
+var n__4395__auto___1347 = size;
+var i_1348 = (0);
+while(true){
+if((i_1348 < n__4395__auto___1347)){
+(a[i_1348] = init_val_or_seq);
+
+var G__1349 = (i_1348 + (1));
+i_1348 = G__1349;
+continue;
+} else {
+}
+break;
+}
+
+return a;
+}
+});
+
+cljs.core.int_array.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Creates an array of longs. Does not coerce array, provided for compatibility
+ *   with Clojure.
+ */
+cljs.core.long_array = (function cljs$core$long_array(var_args){
+var G__1351 = arguments.length;
+switch (G__1351) {
+case 1:
+return cljs.core.long_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.long_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.long_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
+if(typeof size_or_seq === 'number'){
+return cljs.core.long_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
+} else {
+return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
+}
+});
+
+cljs.core.long_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
+var a = (new Array(size));
+if(cljs.core.seq_QMARK_(init_val_or_seq)){
+var s = cljs.core.seq(init_val_or_seq);
+var i = (0);
+var s__$1 = s;
+while(true){
+if(((s__$1) && ((i < size)))){
+(a[i] = cljs.core.first(s__$1));
+
+var G__1353 = (i + (1));
+var G__1354 = cljs.core.next(s__$1);
+i = G__1353;
+s__$1 = G__1354;
+continue;
+} else {
+return a;
+}
+break;
+}
+} else {
+var n__4395__auto___1355 = size;
+var i_1356 = (0);
+while(true){
+if((i_1356 < n__4395__auto___1355)){
+(a[i_1356] = init_val_or_seq);
+
+var G__1357 = (i_1356 + (1));
+i_1356 = G__1357;
+continue;
+} else {
+}
+break;
+}
+
+return a;
+}
+});
+
+cljs.core.long_array.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Creates an array of doubles. Does not coerce array, provided for compatibility
+ *   with Clojure.
+ */
+cljs.core.double_array = (function cljs$core$double_array(var_args){
+var G__1359 = arguments.length;
+switch (G__1359) {
+case 1:
+return cljs.core.double_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.double_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.double_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
+if(typeof size_or_seq === 'number'){
+return cljs.core.double_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
+} else {
+return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
+}
+});
+
+cljs.core.double_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
+var a = (new Array(size));
+if(cljs.core.seq_QMARK_(init_val_or_seq)){
+var s = cljs.core.seq(init_val_or_seq);
+var i = (0);
+var s__$1 = s;
+while(true){
+if(((s__$1) && ((i < size)))){
+(a[i] = cljs.core.first(s__$1));
+
+var G__1361 = (i + (1));
+var G__1362 = cljs.core.next(s__$1);
+i = G__1361;
+s__$1 = G__1362;
+continue;
+} else {
+return a;
+}
+break;
+}
+} else {
+var n__4395__auto___1363 = size;
+var i_1364 = (0);
+while(true){
+if((i_1364 < n__4395__auto___1363)){
+(a[i_1364] = init_val_or_seq);
+
+var G__1365 = (i_1364 + (1));
+i_1364 = G__1365;
+continue;
+} else {
+}
+break;
+}
+
+return a;
+}
+});
+
+cljs.core.double_array.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Creates an array of objects. Does not coerce array, provided for compatibility
+ *   with Clojure.
+ */
+cljs.core.object_array = (function cljs$core$object_array(var_args){
+var G__1367 = arguments.length;
+switch (G__1367) {
+case 1:
+return cljs.core.object_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.object_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.object_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
+if(typeof size_or_seq === 'number'){
+return cljs.core.object_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
+} else {
+return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
+}
+});
+
+cljs.core.object_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
+var a = (new Array(size));
+if(cljs.core.seq_QMARK_(init_val_or_seq)){
+var s = cljs.core.seq(init_val_or_seq);
+var i = (0);
+var s__$1 = s;
+while(true){
+if(((s__$1) && ((i < size)))){
+(a[i] = cljs.core.first(s__$1));
+
+var G__1369 = (i + (1));
+var G__1370 = cljs.core.next(s__$1);
+i = G__1369;
+s__$1 = G__1370;
+continue;
+} else {
+return a;
+}
+break;
+}
+} else {
+var n__4395__auto___1371 = size;
+var i_1372 = (0);
+while(true){
+if((i_1372 < n__4395__auto___1371)){
+(a[i_1372] = init_val_or_seq);
+
+var G__1373 = (i_1372 + (1));
+i_1372 = G__1373;
+continue;
+} else {
+}
+break;
+}
+
+return a;
+}
+});
+
+cljs.core.object_array.cljs$lang$maxFixedArity = 2;
+
+/**
+ * If coll is counted? returns its count, else will count at most the first n
+ * elements of coll using its seq
+ */
+cljs.core.bounded_count = (function cljs$core$bounded_count(n,coll){
+if(cljs.core.counted_QMARK_(coll)){
+return cljs.core.count(coll);
+} else {
+var i = (0);
+var s = cljs.core.seq(coll);
+while(true){
+if(((!((s == null))) && ((i < n)))){
+var G__1374 = (i + (1));
+var G__1375 = cljs.core.next(s);
+i = G__1374;
+s = G__1375;
+continue;
+} else {
+return i;
+}
+break;
+}
+}
+});
+cljs.core.spread = (function cljs$core$spread(arglist){
+if((arglist == null)){
+return null;
+} else {
+var n = cljs.core.next(arglist);
+if((n == null)){
+return cljs.core.seq(cljs.core.first(arglist));
+} else {
+return cljs.core.cons(cljs.core.first(arglist),(cljs.core.spread.cljs$core$IFn$_invoke$arity$1 ? cljs.core.spread.cljs$core$IFn$_invoke$arity$1(n) : cljs.core.spread.call(null,n)));
+}
+}
+});
+/**
+ * Returns a lazy seq representing the concatenation of the elements in the supplied colls.
+ */
+cljs.core.concat = (function cljs$core$concat(var_args){
+var G__1380 = arguments.length;
+switch (G__1380) {
+case 0:
+return cljs.core.concat.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.concat.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.concat.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1382 = arguments.length;
+var i__4519__auto___1383 = (0);
+while(true){
+if((i__4519__auto___1383 < len__4518__auto___1382)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1383]));
+
+var G__1384 = (i__4519__auto___1383 + (1));
+i__4519__auto___1383 = G__1384;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.concat.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (new cljs.core.LazySeq(null,(function (){
+return null;
+}),null,null));
+});
+
+cljs.core.concat.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return (new cljs.core.LazySeq(null,(function (){
+return x;
+}),null,null));
+});
+
+cljs.core.concat.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return (new cljs.core.LazySeq(null,(function (){
+var s = cljs.core.seq(x);
+if(s){
+if(cljs.core.chunked_seq_QMARK_(s)){
+return cljs.core.chunk_cons(cljs.core.chunk_first(s),cljs.core.concat.cljs$core$IFn$_invoke$arity$2(cljs.core.chunk_rest(s),y));
+} else {
+return cljs.core.cons(cljs.core.first(s),cljs.core.concat.cljs$core$IFn$_invoke$arity$2(cljs.core.rest(s),y));
+}
+} else {
+return y;
+}
+}),null,null));
+});
+
+cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,zs){
+var cat = (function cljs$core$cat(xys,zs__$1){
+return (new cljs.core.LazySeq(null,(function (){
+var xys__$1 = cljs.core.seq(xys);
+if(xys__$1){
+if(cljs.core.chunked_seq_QMARK_(xys__$1)){
+return cljs.core.chunk_cons(cljs.core.chunk_first(xys__$1),cljs$core$cat(cljs.core.chunk_rest(xys__$1),zs__$1));
+} else {
+return cljs.core.cons(cljs.core.first(xys__$1),cljs$core$cat(cljs.core.rest(xys__$1),zs__$1));
+}
+} else {
+if(cljs.core.truth_(zs__$1)){
+return cljs$core$cat(cljs.core.first(zs__$1),cljs.core.next(zs__$1));
+} else {
+return null;
+}
+}
+}),null,null));
+});
+return cat(cljs.core.concat.cljs$core$IFn$_invoke$arity$2(x,y),zs);
+});
+
+/** @this {Function} */
+cljs.core.concat.cljs$lang$applyTo = (function (seq1377){
+var G__1378 = cljs.core.first(seq1377);
+var seq1377__$1 = cljs.core.next(seq1377);
+var G__1379 = cljs.core.first(seq1377__$1);
+var seq1377__$2 = cljs.core.next(seq1377__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1378,G__1379,seq1377__$2);
+});
+
+cljs.core.concat.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Creates a new list containing the items prepended to the rest, the
+ *   last of which will be treated as a sequence.
+ */
+cljs.core.list_STAR_ = (function cljs$core$list_STAR_(var_args){
+var G__1391 = arguments.length;
+switch (G__1391) {
+case 1:
+return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1393 = arguments.length;
+var i__4519__auto___1394 = (0);
+while(true){
+if((i__4519__auto___1394 < len__4518__auto___1393)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1394]));
+
+var G__1395 = (i__4519__auto___1394 + (1));
+i__4519__auto___1394 = G__1395;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((4)),(0),null));
+return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$1 = (function (args){
+return cljs.core.seq(args);
+});
+
+cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$2 = (function (a,args){
+return cljs.core.cons(a,args);
+});
+
+cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$3 = (function (a,b,args){
+return cljs.core.cons(a,cljs.core.cons(b,args));
+});
+
+cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,args){
+return cljs.core.cons(a,cljs.core.cons(b,cljs.core.cons(c,args)));
+});
+
+cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$variadic = (function (a,b,c,d,more){
+return cljs.core.cons(a,cljs.core.cons(b,cljs.core.cons(c,cljs.core.cons(d,cljs.core.spread(more)))));
+});
+
+/** @this {Function} */
+cljs.core.list_STAR_.cljs$lang$applyTo = (function (seq1386){
+var G__1387 = cljs.core.first(seq1386);
+var seq1386__$1 = cljs.core.next(seq1386);
+var G__1388 = cljs.core.first(seq1386__$1);
+var seq1386__$2 = cljs.core.next(seq1386__$1);
+var G__1389 = cljs.core.first(seq1386__$2);
+var seq1386__$3 = cljs.core.next(seq1386__$2);
+var G__1390 = cljs.core.first(seq1386__$3);
+var seq1386__$4 = cljs.core.next(seq1386__$3);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1387,G__1388,G__1389,G__1390,seq1386__$4);
+});
+
+cljs.core.list_STAR_.cljs$lang$maxFixedArity = (4);
+
+/**
+ * Returns a new, transient version of the collection, in constant time.
+ */
+cljs.core.transient$ = (function cljs$core$transient(coll){
+return cljs.core._as_transient(coll);
+});
+/**
+ * Returns a new, persistent version of the transient collection, in
+ *   constant time. The transient collection cannot be used after this
+ *   call, any such use will throw an exception.
+ */
+cljs.core.persistent_BANG_ = (function cljs$core$persistent_BANG_(tcoll){
+return cljs.core._persistent_BANG_(tcoll);
+});
+/**
+ * Adds val to the transient collection, and return tcoll. The 'addition'
+ *   may happen at different 'places' depending on the concrete type.
+ */
+cljs.core.conj_BANG_ = (function cljs$core$conj_BANG_(var_args){
+var G__1400 = arguments.length;
+switch (G__1400) {
+case 0:
+return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1402 = arguments.length;
+var i__4519__auto___1403 = (0);
+while(true){
+if((i__4519__auto___1403 < len__4518__auto___1402)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1403]));
+
+var G__1404 = (i__4519__auto___1403 + (1));
+i__4519__auto___1403 = G__1404;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.transient$(cljs.core.PersistentVector.EMPTY);
+});
+
+cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$1 = (function (tcoll){
+return tcoll;
+});
+
+cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (tcoll,val){
+return cljs.core._conj_BANG_(tcoll,val);
+});
+
+cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,val,vals){
+while(true){
+var ntcoll = cljs.core._conj_BANG_(tcoll,val);
+if(cljs.core.truth_(vals)){
+var G__1405 = ntcoll;
+var G__1406 = cljs.core.first(vals);
+var G__1407 = cljs.core.next(vals);
+tcoll = G__1405;
+val = G__1406;
+vals = G__1407;
+continue;
+} else {
+return ntcoll;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.conj_BANG_.cljs$lang$applyTo = (function (seq1397){
+var G__1398 = cljs.core.first(seq1397);
+var seq1397__$1 = cljs.core.next(seq1397);
+var G__1399 = cljs.core.first(seq1397__$1);
+var seq1397__$2 = cljs.core.next(seq1397__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1398,G__1399,seq1397__$2);
+});
+
+cljs.core.conj_BANG_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * When applied to a transient map, adds mapping of key(s) to
+ *   val(s). When applied to a transient vector, sets the val at index.
+ *   Note - index must be <= (count vector). Returns coll.
+ */
+cljs.core.assoc_BANG_ = (function cljs$core$assoc_BANG_(var_args){
+var G__1413 = arguments.length;
+switch (G__1413) {
+case 3:
+return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1415 = arguments.length;
+var i__4519__auto___1416 = (0);
+while(true){
+if((i__4519__auto___1416 < len__4518__auto___1415)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1416]));
+
+var G__1417 = (i__4519__auto___1416 + (1));
+i__4519__auto___1416 = G__1417;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (tcoll,key,val){
+return cljs.core._assoc_BANG_(tcoll,key,val);
+});
+
+cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,key,val,kvs){
+while(true){
+var ntcoll = cljs.core._assoc_BANG_(tcoll,key,val);
+if(cljs.core.truth_(kvs)){
+var G__1418 = ntcoll;
+var G__1419 = cljs.core.first(kvs);
+var G__1420 = cljs.core.second(kvs);
+var G__1421 = cljs.core.nnext(kvs);
+tcoll = G__1418;
+key = G__1419;
+val = G__1420;
+kvs = G__1421;
+continue;
+} else {
+return ntcoll;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.assoc_BANG_.cljs$lang$applyTo = (function (seq1409){
+var G__1410 = cljs.core.first(seq1409);
+var seq1409__$1 = cljs.core.next(seq1409);
+var G__1411 = cljs.core.first(seq1409__$1);
+var seq1409__$2 = cljs.core.next(seq1409__$1);
+var G__1412 = cljs.core.first(seq1409__$2);
+var seq1409__$3 = cljs.core.next(seq1409__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1410,G__1411,G__1412,seq1409__$3);
+});
+
+cljs.core.assoc_BANG_.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Returns a transient map that doesn't contain a mapping for key(s).
+ */
+cljs.core.dissoc_BANG_ = (function cljs$core$dissoc_BANG_(var_args){
+var G__1426 = arguments.length;
+switch (G__1426) {
+case 2:
+return cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1428 = arguments.length;
+var i__4519__auto___1429 = (0);
+while(true){
+if((i__4519__auto___1429 < len__4518__auto___1428)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1429]));
+
+var G__1430 = (i__4519__auto___1429 + (1));
+i__4519__auto___1429 = G__1430;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (tcoll,key){
+return cljs.core._dissoc_BANG_(tcoll,key);
+});
+
+cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,key,ks){
+while(true){
+var ntcoll = cljs.core._dissoc_BANG_(tcoll,key);
+if(cljs.core.truth_(ks)){
+var G__1431 = ntcoll;
+var G__1432 = cljs.core.first(ks);
+var G__1433 = cljs.core.next(ks);
+tcoll = G__1431;
+key = G__1432;
+ks = G__1433;
+continue;
+} else {
+return ntcoll;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.dissoc_BANG_.cljs$lang$applyTo = (function (seq1423){
+var G__1424 = cljs.core.first(seq1423);
+var seq1423__$1 = cljs.core.next(seq1423);
+var G__1425 = cljs.core.first(seq1423__$1);
+var seq1423__$2 = cljs.core.next(seq1423__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1424,G__1425,seq1423__$2);
+});
+
+cljs.core.dissoc_BANG_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Removes the last item from a transient vector. If
+ *   the collection is empty, throws an exception. Returns tcoll
+ */
+cljs.core.pop_BANG_ = (function cljs$core$pop_BANG_(tcoll){
+return cljs.core._pop_BANG_(tcoll);
+});
+/**
+ * disj[oin]. Returns a transient set of the same (hashed/sorted) type, that
+ *   does not contain key(s).
+ */
+cljs.core.disj_BANG_ = (function cljs$core$disj_BANG_(var_args){
+var G__1438 = arguments.length;
+switch (G__1438) {
+case 2:
+return cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1440 = arguments.length;
+var i__4519__auto___1441 = (0);
+while(true){
+if((i__4519__auto___1441 < len__4518__auto___1440)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1441]));
+
+var G__1442 = (i__4519__auto___1441 + (1));
+i__4519__auto___1441 = G__1442;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (tcoll,val){
+return cljs.core._disjoin_BANG_(tcoll,val);
+});
+
+cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,val,vals){
+while(true){
+var ntcoll = cljs.core._disjoin_BANG_(tcoll,val);
+if(cljs.core.truth_(vals)){
+var G__1443 = ntcoll;
+var G__1444 = cljs.core.first(vals);
+var G__1445 = cljs.core.next(vals);
+tcoll = G__1443;
+val = G__1444;
+vals = G__1445;
+continue;
+} else {
+return ntcoll;
+}
+break;
+}
+});
+
+/** @this {Function} */
+cljs.core.disj_BANG_.cljs$lang$applyTo = (function (seq1435){
+var G__1436 = cljs.core.first(seq1435);
+var seq1435__$1 = cljs.core.next(seq1435);
+var G__1437 = cljs.core.first(seq1435__$1);
+var seq1435__$2 = cljs.core.next(seq1435__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1436,G__1437,seq1435__$2);
+});
+
+cljs.core.disj_BANG_.cljs$lang$maxFixedArity = (2);
+
+
+cljs.core.apply_to = (function cljs$core$apply_to(f,argc,args){
+var args__$1 = cljs.core.seq(args);
+if((argc === (0))){
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+} else {
+var a151 = cljs.core._first(args__$1);
+var args__$2 = cljs.core._rest(args__$1);
+if((argc === (1))){
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(a151) : f.call(null,a151));
+} else {
+var b152 = cljs.core._first(args__$2);
+var args__$3 = cljs.core._rest(args__$2);
+if((argc === (2))){
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(a151,b152) : f.call(null,a151,b152));
+} else {
+var c153 = cljs.core._first(args__$3);
+var args__$4 = cljs.core._rest(args__$3);
+if((argc === (3))){
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(a151,b152,c153) : f.call(null,a151,b152,c153));
+} else {
+var d154 = cljs.core._first(args__$4);
+var args__$5 = cljs.core._rest(args__$4);
+if((argc === (4))){
+return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(a151,b152,c153,d154) : f.call(null,a151,b152,c153,d154));
+} else {
+var e155 = cljs.core._first(args__$5);
+var args__$6 = cljs.core._rest(args__$5);
+if((argc === (5))){
+return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(a151,b152,c153,d154,e155) : f.call(null,a151,b152,c153,d154,e155));
+} else {
+var f156 = cljs.core._first(args__$6);
+var args__$7 = cljs.core._rest(args__$6);
+if((argc === (6))){
+return (f.cljs$core$IFn$_invoke$arity$6 ? f.cljs$core$IFn$_invoke$arity$6(a151,b152,c153,d154,e155,f156) : f.call(null,a151,b152,c153,d154,e155,f156));
+} else {
+var g157 = cljs.core._first(args__$7);
+var args__$8 = cljs.core._rest(args__$7);
+if((argc === (7))){
+return (f.cljs$core$IFn$_invoke$arity$7 ? f.cljs$core$IFn$_invoke$arity$7(a151,b152,c153,d154,e155,f156,g157) : f.call(null,a151,b152,c153,d154,e155,f156,g157));
+} else {
+var h158 = cljs.core._first(args__$8);
+var args__$9 = cljs.core._rest(args__$8);
+if((argc === (8))){
+return (f.cljs$core$IFn$_invoke$arity$8 ? f.cljs$core$IFn$_invoke$arity$8(a151,b152,c153,d154,e155,f156,g157,h158) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158));
+} else {
+var i159 = cljs.core._first(args__$9);
+var args__$10 = cljs.core._rest(args__$9);
+if((argc === (9))){
+return (f.cljs$core$IFn$_invoke$arity$9 ? f.cljs$core$IFn$_invoke$arity$9(a151,b152,c153,d154,e155,f156,g157,h158,i159) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159));
+} else {
+var j160 = cljs.core._first(args__$10);
+var args__$11 = cljs.core._rest(args__$10);
+if((argc === (10))){
+return (f.cljs$core$IFn$_invoke$arity$10 ? f.cljs$core$IFn$_invoke$arity$10(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160));
+} else {
+var k161 = cljs.core._first(args__$11);
+var args__$12 = cljs.core._rest(args__$11);
+if((argc === (11))){
+return (f.cljs$core$IFn$_invoke$arity$11 ? f.cljs$core$IFn$_invoke$arity$11(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161));
+} else {
+var l162 = cljs.core._first(args__$12);
+var args__$13 = cljs.core._rest(args__$12);
+if((argc === (12))){
+return (f.cljs$core$IFn$_invoke$arity$12 ? f.cljs$core$IFn$_invoke$arity$12(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162));
+} else {
+var m163 = cljs.core._first(args__$13);
+var args__$14 = cljs.core._rest(args__$13);
+if((argc === (13))){
+return (f.cljs$core$IFn$_invoke$arity$13 ? f.cljs$core$IFn$_invoke$arity$13(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163));
+} else {
+var n164 = cljs.core._first(args__$14);
+var args__$15 = cljs.core._rest(args__$14);
+if((argc === (14))){
+return (f.cljs$core$IFn$_invoke$arity$14 ? f.cljs$core$IFn$_invoke$arity$14(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164));
+} else {
+var o165 = cljs.core._first(args__$15);
+var args__$16 = cljs.core._rest(args__$15);
+if((argc === (15))){
+return (f.cljs$core$IFn$_invoke$arity$15 ? f.cljs$core$IFn$_invoke$arity$15(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165));
+} else {
+var p166 = cljs.core._first(args__$16);
+var args__$17 = cljs.core._rest(args__$16);
+if((argc === (16))){
+return (f.cljs$core$IFn$_invoke$arity$16 ? f.cljs$core$IFn$_invoke$arity$16(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166));
+} else {
+var q167 = cljs.core._first(args__$17);
+var args__$18 = cljs.core._rest(args__$17);
+if((argc === (17))){
+return (f.cljs$core$IFn$_invoke$arity$17 ? f.cljs$core$IFn$_invoke$arity$17(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167));
+} else {
+var r168 = cljs.core._first(args__$18);
+var args__$19 = cljs.core._rest(args__$18);
+if((argc === (18))){
+return (f.cljs$core$IFn$_invoke$arity$18 ? f.cljs$core$IFn$_invoke$arity$18(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168));
+} else {
+var s169 = cljs.core._first(args__$19);
+var args__$20 = cljs.core._rest(args__$19);
+if((argc === (19))){
+return (f.cljs$core$IFn$_invoke$arity$19 ? f.cljs$core$IFn$_invoke$arity$19(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169));
+} else {
+var t170 = cljs.core._first(args__$20);
+var args__$21 = cljs.core._rest(args__$20);
+if((argc === (20))){
+return (f.cljs$core$IFn$_invoke$arity$20 ? f.cljs$core$IFn$_invoke$arity$20(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169,t170) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169,t170));
+} else {
+throw (new Error("Only up to 20 arguments supported on functions"));
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+});
+
+/**
+ * Internal. DO NOT USE!
+ *   Assumes args was already called with seq beforehand!
+ */
+cljs.core.apply_to_simple = (function cljs$core$apply_to_simple(var_args){
+var G__1447 = arguments.length;
+switch (G__1447) {
+case 2:
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+case 6:
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$2 = (function (f,args){
+if((args == null)){
+if(f.cljs$core$IFn$_invoke$arity$0){
+return f.cljs$core$IFn$_invoke$arity$0();
+} else {
+return f.call(f);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3(f,cljs.core._first(args),cljs.core.next(args));
+}
+});
+
+cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3 = (function (f,a0,args){
+if((args == null)){
+if(f.cljs$core$IFn$_invoke$arity$1){
+return f.cljs$core$IFn$_invoke$arity$1(a0);
+} else {
+return f.call(f,a0);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4(f,a0,cljs.core._first(args),cljs.core.next(args));
+}
+});
+
+cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4 = (function (f,a0,a1,args){
+if((args == null)){
+if(f.cljs$core$IFn$_invoke$arity$2){
+return f.cljs$core$IFn$_invoke$arity$2(a0,a1);
+} else {
+return f.call(f,a0,a1);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5(f,a0,a1,cljs.core._first(args),cljs.core.next(args));
+}
+});
+
+cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5 = (function (f,a0,a1,a2,args){
+if((args == null)){
+if(f.cljs$core$IFn$_invoke$arity$3){
+return f.cljs$core$IFn$_invoke$arity$3(a0,a1,a2);
+} else {
+return f.call(f,a0,a1,a2);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6(f,a0,a1,a2,cljs.core._first(args),cljs.core.next(args));
+}
+});
+
+cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6 = (function (f,a0,a1,a2,a3,args){
+if((args == null)){
+if(f.cljs$core$IFn$_invoke$arity$4){
+return f.cljs$core$IFn$_invoke$arity$4(a0,a1,a2,a3);
+} else {
+return f.call(f,a0,a1,a2,a3);
+}
+} else {
+var a4 = cljs.core._first(args);
+var next_4 = cljs.core.next(args);
+if((next_4 == null)){
+if(f.cljs$core$IFn$_invoke$arity$5){
+return f.cljs$core$IFn$_invoke$arity$5(a0,a1,a2,a3,a4);
+} else {
+return f.call(f,a0,a1,a2,a3,a4);
+}
+} else {
+var a5 = cljs.core._first(next_4);
+var next_5 = cljs.core.next(next_4);
+if((next_5 == null)){
+if(f.cljs$core$IFn$_invoke$arity$6){
+return f.cljs$core$IFn$_invoke$arity$6(a0,a1,a2,a3,a4,a5);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5);
+}
+} else {
+var a6 = cljs.core._first(next_5);
+var next_6 = cljs.core.next(next_5);
+if((next_6 == null)){
+if(f.cljs$core$IFn$_invoke$arity$7){
+return f.cljs$core$IFn$_invoke$arity$7(a0,a1,a2,a3,a4,a5,a6);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6);
+}
+} else {
+var a7 = cljs.core._first(next_6);
+var next_7 = cljs.core.next(next_6);
+if((next_7 == null)){
+if(f.cljs$core$IFn$_invoke$arity$8){
+return f.cljs$core$IFn$_invoke$arity$8(a0,a1,a2,a3,a4,a5,a6,a7);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7);
+}
+} else {
+var a8 = cljs.core._first(next_7);
+var next_8 = cljs.core.next(next_7);
+if((next_8 == null)){
+if(f.cljs$core$IFn$_invoke$arity$9){
+return f.cljs$core$IFn$_invoke$arity$9(a0,a1,a2,a3,a4,a5,a6,a7,a8);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8);
+}
+} else {
+var a9 = cljs.core._first(next_8);
+var next_9 = cljs.core.next(next_8);
+if((next_9 == null)){
+if(f.cljs$core$IFn$_invoke$arity$10){
+return f.cljs$core$IFn$_invoke$arity$10(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9);
+}
+} else {
+var a10 = cljs.core._first(next_9);
+var next_10 = cljs.core.next(next_9);
+if((next_10 == null)){
+if(f.cljs$core$IFn$_invoke$arity$11){
+return f.cljs$core$IFn$_invoke$arity$11(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10);
+}
+} else {
+var a11 = cljs.core._first(next_10);
+var next_11 = cljs.core.next(next_10);
+if((next_11 == null)){
+if(f.cljs$core$IFn$_invoke$arity$12){
+return f.cljs$core$IFn$_invoke$arity$12(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11);
+}
+} else {
+var a12 = cljs.core._first(next_11);
+var next_12 = cljs.core.next(next_11);
+if((next_12 == null)){
+if(f.cljs$core$IFn$_invoke$arity$13){
+return f.cljs$core$IFn$_invoke$arity$13(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12);
+}
+} else {
+var a13 = cljs.core._first(next_12);
+var next_13 = cljs.core.next(next_12);
+if((next_13 == null)){
+if(f.cljs$core$IFn$_invoke$arity$14){
+return f.cljs$core$IFn$_invoke$arity$14(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13);
+}
+} else {
+var a14 = cljs.core._first(next_13);
+var next_14 = cljs.core.next(next_13);
+if((next_14 == null)){
+if(f.cljs$core$IFn$_invoke$arity$15){
+return f.cljs$core$IFn$_invoke$arity$15(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14);
+}
+} else {
+var a15 = cljs.core._first(next_14);
+var next_15 = cljs.core.next(next_14);
+if((next_15 == null)){
+if(f.cljs$core$IFn$_invoke$arity$16){
+return f.cljs$core$IFn$_invoke$arity$16(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15);
+}
+} else {
+var a16 = cljs.core._first(next_15);
+var next_16 = cljs.core.next(next_15);
+if((next_16 == null)){
+if(f.cljs$core$IFn$_invoke$arity$17){
+return f.cljs$core$IFn$_invoke$arity$17(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16);
+}
+} else {
+var a17 = cljs.core._first(next_16);
+var next_17 = cljs.core.next(next_16);
+if((next_17 == null)){
+if(f.cljs$core$IFn$_invoke$arity$18){
+return f.cljs$core$IFn$_invoke$arity$18(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17);
+}
+} else {
+var a18 = cljs.core._first(next_17);
+var next_18 = cljs.core.next(next_17);
+if((next_18 == null)){
+if(f.cljs$core$IFn$_invoke$arity$19){
+return f.cljs$core$IFn$_invoke$arity$19(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18);
+}
+} else {
+var a19 = cljs.core._first(next_18);
+var next_19 = cljs.core.next(next_18);
+if((next_19 == null)){
+if(f.cljs$core$IFn$_invoke$arity$20){
+return f.cljs$core$IFn$_invoke$arity$20(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18,a19);
+} else {
+return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18,a19);
+}
+} else {
+var arr__4443__auto__ = [a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18,a19];
+var s__4444__auto___1449 = next_19;
+while(true){
+if(s__4444__auto___1449){
+arr__4443__auto__.push(cljs.core._first(s__4444__auto___1449));
+
+var G__1450 = cljs.core.next(s__4444__auto___1449);
+s__4444__auto___1449 = G__1450;
+continue;
+} else {
+}
+break;
+}
+
+return f.apply(f,arr__4443__auto__);
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+});
+
+cljs.core.apply_to_simple.cljs$lang$maxFixedArity = 6;
+
+/**
+ * Applies fn f to the argument list formed by prepending intervening arguments to args.
+ */
+cljs.core.apply = (function cljs$core$apply(var_args){
+var G__1458 = arguments.length;
+switch (G__1458) {
+case 2:
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1460 = arguments.length;
+var i__4519__auto___1461 = (0);
+while(true){
+if((i__4519__auto___1461 < len__4518__auto___1460)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1461]));
+
+var G__1462 = (i__4519__auto___1461 + (1));
+i__4519__auto___1461 = G__1462;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((5)),(0),null));
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.apply.cljs$core$IFn$_invoke$arity$2 = (function (f,args){
+if(f.cljs$lang$applyTo){
+var fixed_arity = f.cljs$lang$maxFixedArity;
+var bc = cljs.core.bounded_count((fixed_arity + (1)),args);
+if((bc <= fixed_arity)){
+return cljs.core.apply_to(f,bc,args);
+} else {
+return f.cljs$lang$applyTo(args);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$2(f,cljs.core.seq(args));
+}
+});
+
+cljs.core.apply.cljs$core$IFn$_invoke$arity$3 = (function (f,x,args){
+if(f.cljs$lang$applyTo){
+var arglist = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$2(x,args);
+var fixed_arity = f.cljs$lang$maxFixedArity;
+var bc = (cljs.core.bounded_count(fixed_arity,args) + (1));
+if((bc <= fixed_arity)){
+return cljs.core.apply_to(f,bc,arglist);
+} else {
+return f.cljs$lang$applyTo(arglist);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3(f,x,cljs.core.seq(args));
+}
+});
+
+cljs.core.apply.cljs$core$IFn$_invoke$arity$4 = (function (f,x,y,args){
+if(f.cljs$lang$applyTo){
+var arglist = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$3(x,y,args);
+var fixed_arity = f.cljs$lang$maxFixedArity;
+var bc = ((2) + cljs.core.bounded_count((fixed_arity - (1)),args));
+if((bc <= fixed_arity)){
+return cljs.core.apply_to(f,bc,arglist);
+} else {
+return f.cljs$lang$applyTo(arglist);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4(f,x,y,cljs.core.seq(args));
+}
+});
+
+cljs.core.apply.cljs$core$IFn$_invoke$arity$5 = (function (f,x,y,z,args){
+if(f.cljs$lang$applyTo){
+var arglist = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(x,y,z,args);
+var fixed_arity = f.cljs$lang$maxFixedArity;
+var bc = ((3) + cljs.core.bounded_count((fixed_arity - (2)),args));
+if((bc <= fixed_arity)){
+return cljs.core.apply_to(f,bc,arglist);
+} else {
+return f.cljs$lang$applyTo(arglist);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5(f,x,y,z,cljs.core.seq(args));
+}
+});
+
+cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic = (function (f,a,b,c,d,args){
+if(f.cljs$lang$applyTo){
+var spread_args = cljs.core.spread(args);
+var arglist = cljs.core.cons(a,cljs.core.cons(b,cljs.core.cons(c,cljs.core.cons(d,spread_args))));
+var fixed_arity = f.cljs$lang$maxFixedArity;
+var bc = ((4) + cljs.core.bounded_count((fixed_arity - (3)),spread_args));
+if((bc <= fixed_arity)){
+return cljs.core.apply_to(f,bc,arglist);
+} else {
+return f.cljs$lang$applyTo(arglist);
+}
+} else {
+return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6(f,a,b,c,d,cljs.core.spread(args));
+}
+});
+
+/** @this {Function} */
+cljs.core.apply.cljs$lang$applyTo = (function (seq1452){
+var G__1453 = cljs.core.first(seq1452);
+var seq1452__$1 = cljs.core.next(seq1452);
+var G__1454 = cljs.core.first(seq1452__$1);
+var seq1452__$2 = cljs.core.next(seq1452__$1);
+var G__1455 = cljs.core.first(seq1452__$2);
+var seq1452__$3 = cljs.core.next(seq1452__$2);
+var G__1456 = cljs.core.first(seq1452__$3);
+var seq1452__$4 = cljs.core.next(seq1452__$3);
+var G__1457 = cljs.core.first(seq1452__$4);
+var seq1452__$5 = cljs.core.next(seq1452__$4);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1453,G__1454,G__1455,G__1456,G__1457,seq1452__$5);
+});
+
+cljs.core.apply.cljs$lang$maxFixedArity = (5);
+
+/**
+ * Returns an object of the same type and value as obj, with
+ *   (apply f (meta obj) args) as its metadata.
+ */
+cljs.core.vary_meta = (function cljs$core$vary_meta(var_args){
+var G__1471 = arguments.length;
+switch (G__1471) {
+case 2:
+return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+case 6:
+return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1488 = arguments.length;
+var i__4519__auto___1489 = (0);
+while(true){
+if((i__4519__auto___1489 < len__4518__auto___1488)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1489]));
+
+var G__1490 = (i__4519__auto___1489 + (1));
+i__4519__auto___1489 = G__1490;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((6)),(0),null));
+return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$2 = (function (obj,f){
+return cljs.core.with_meta(obj,(function (){var G__1472 = cljs.core.meta(obj);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1472) : f.call(null,G__1472));
+})());
+});
+
+cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$3 = (function (obj,f,a){
+return cljs.core.with_meta(obj,(function (){var G__1473 = cljs.core.meta(obj);
+var G__1474 = a;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1473,G__1474) : f.call(null,G__1473,G__1474));
+})());
+});
+
+cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$4 = (function (obj,f,a,b){
+return cljs.core.with_meta(obj,(function (){var G__1475 = cljs.core.meta(obj);
+var G__1476 = a;
+var G__1477 = b;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1475,G__1476,G__1477) : f.call(null,G__1475,G__1476,G__1477));
+})());
+});
+
+cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$5 = (function (obj,f,a,b,c){
+return cljs.core.with_meta(obj,(function (){var G__1478 = cljs.core.meta(obj);
+var G__1479 = a;
+var G__1480 = b;
+var G__1481 = c;
+return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(G__1478,G__1479,G__1480,G__1481) : f.call(null,G__1478,G__1479,G__1480,G__1481));
+})());
+});
+
+cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$6 = (function (obj,f,a,b,c,d){
+return cljs.core.with_meta(obj,(function (){var G__1482 = cljs.core.meta(obj);
+var G__1483 = a;
+var G__1484 = b;
+var G__1485 = c;
+var G__1486 = d;
+return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(G__1482,G__1483,G__1484,G__1485,G__1486) : f.call(null,G__1482,G__1483,G__1484,G__1485,G__1486));
+})());
+});
+
+cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$variadic = (function (obj,f,a,b,c,d,args){
+return cljs.core.with_meta(obj,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,cljs.core.meta(obj),a,b,c,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([d,args], 0)));
+});
+
+/** @this {Function} */
+cljs.core.vary_meta.cljs$lang$applyTo = (function (seq1464){
+var G__1465 = cljs.core.first(seq1464);
+var seq1464__$1 = cljs.core.next(seq1464);
+var G__1466 = cljs.core.first(seq1464__$1);
+var seq1464__$2 = cljs.core.next(seq1464__$1);
+var G__1467 = cljs.core.first(seq1464__$2);
+var seq1464__$3 = cljs.core.next(seq1464__$2);
+var G__1468 = cljs.core.first(seq1464__$3);
+var seq1464__$4 = cljs.core.next(seq1464__$3);
+var G__1469 = cljs.core.first(seq1464__$4);
+var seq1464__$5 = cljs.core.next(seq1464__$4);
+var G__1470 = cljs.core.first(seq1464__$5);
+var seq1464__$6 = cljs.core.next(seq1464__$5);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1465,G__1466,G__1467,G__1468,G__1469,G__1470,seq1464__$6);
+});
+
+cljs.core.vary_meta.cljs$lang$maxFixedArity = (6);
+
+/**
+ * Same as (not (= obj1 obj2))
+ */
+cljs.core.not_EQ_ = (function cljs$core$not_EQ_(var_args){
+var G__1495 = arguments.length;
+switch (G__1495) {
+case 1:
+return cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1497 = arguments.length;
+var i__4519__auto___1498 = (0);
+while(true){
+if((i__4519__auto___1498 < len__4518__auto___1497)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1498]));
+
+var G__1499 = (i__4519__auto___1498 + (1));
+i__4519__auto___1498 = G__1499;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return false;
+});
+
+cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
+return !(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y));
+});
+
+cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
+return cljs.core.not(cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core._EQ_,x,y,more));
+});
+
+/** @this {Function} */
+cljs.core.not_EQ_.cljs$lang$applyTo = (function (seq1492){
+var G__1493 = cljs.core.first(seq1492);
+var seq1492__$1 = cljs.core.next(seq1492);
+var G__1494 = cljs.core.first(seq1492__$1);
+var seq1492__$2 = cljs.core.next(seq1492__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1493,G__1494,seq1492__$2);
+});
+
+cljs.core.not_EQ_.cljs$lang$maxFixedArity = (2);
+
+/**
+ * If coll is empty, returns nil, else coll
+ */
+cljs.core.not_empty = (function cljs$core$not_empty(coll){
+if(cljs.core.seq(coll)){
+return coll;
+} else {
+return null;
+}
+});
+cljs.core.nil_iter = (function cljs$core$nil_iter(){
+if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core.t_cljs$core1500 !== 'undefined')){
+} else {
+
+/**
+* @constructor
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IWithMeta}
+*/
+cljs.core.t_cljs$core1500 = (function (meta1501){
+this.meta1501 = meta1501;
+this.cljs$lang$protocol_mask$partition0$ = 393216;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.t_cljs$core1500.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_1502,meta1501__$1){
+var self__ = this;
+var _1502__$1 = this;
+return (new cljs.core.t_cljs$core1500(meta1501__$1));
+});
+
+cljs.core.t_cljs$core1500.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_1502){
+var self__ = this;
+var _1502__$1 = this;
+return self__.meta1501;
+});
+
+cljs.core.t_cljs$core1500.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+return false;
+});
+
+cljs.core.t_cljs$core1500.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("No such element"));
+});
+
+cljs.core.t_cljs$core1500.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.t_cljs$core1500.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta1501], null);
+});
+
+cljs.core.t_cljs$core1500.cljs$lang$type = true;
+
+cljs.core.t_cljs$core1500.cljs$lang$ctorStr = "cljs.core/t_cljs$core1500";
+
+cljs.core.t_cljs$core1500.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/t_cljs$core1500");
+});
+
+/**
+ * Positional factory function for cljs.core/t_cljs$core1500.
+ */
+cljs.core.__GT_t_cljs$core1500 = (function cljs$core$nil_iter_$___GT_t_cljs$core1500(meta1501){
+return (new cljs.core.t_cljs$core1500(meta1501));
+});
+
+}
+
+return (new cljs.core.t_cljs$core1500(cljs.core.PersistentArrayMap.EMPTY));
+});
+
+/**
+* @constructor
+*/
+cljs.core.StringIter = (function (s,i){
+this.s = s;
+this.i = i;
+});
+cljs.core.StringIter.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+return (self__.i < self__.s.length);
+});
+
+cljs.core.StringIter.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+var ret = self__.s.charAt(self__.i);
+self__.i = (self__.i + (1));
+
+return ret;
+});
+
+cljs.core.StringIter.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.StringIter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$s,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.StringIter.cljs$lang$type = true;
+
+cljs.core.StringIter.cljs$lang$ctorStr = "cljs.core/StringIter";
+
+cljs.core.StringIter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/StringIter");
+});
+
+/**
+ * Positional factory function for cljs.core/StringIter.
+ */
+cljs.core.__GT_StringIter = (function cljs$core$__GT_StringIter(s,i){
+return (new cljs.core.StringIter(s,i));
+});
+
+cljs.core.string_iter = (function cljs$core$string_iter(x){
+return (new cljs.core.StringIter(x,(0)));
+});
+
+/**
+* @constructor
+*/
+cljs.core.ArrayIter = (function (arr,i){
+this.arr = arr;
+this.i = i;
+});
+cljs.core.ArrayIter.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+return (self__.i < self__.arr.length);
+});
+
+cljs.core.ArrayIter.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+var ret = (self__.arr[self__.i]);
+self__.i = (self__.i + (1));
+
+return ret;
+});
+
+cljs.core.ArrayIter.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.ArrayIter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ArrayIter.cljs$lang$type = true;
+
+cljs.core.ArrayIter.cljs$lang$ctorStr = "cljs.core/ArrayIter";
+
+cljs.core.ArrayIter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ArrayIter");
+});
+
+/**
+ * Positional factory function for cljs.core/ArrayIter.
+ */
+cljs.core.__GT_ArrayIter = (function cljs$core$__GT_ArrayIter(arr,i){
+return (new cljs.core.ArrayIter(arr,i));
+});
+
+cljs.core.array_iter = (function cljs$core$array_iter(x){
+return (new cljs.core.ArrayIter(x,(0)));
+});
+cljs.core.INIT = ({});
+cljs.core.START = ({});
+
+/**
+* @constructor
+*/
+cljs.core.SeqIter = (function (_seq,_next){
+this._seq = _seq;
+this._next = _next;
+});
+cljs.core.SeqIter.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+if((self__._seq === cljs.core.INIT)){
+self__._seq = cljs.core.START;
+
+self__._next = cljs.core.seq(self__._next);
+} else {
+if((self__._seq === self__._next)){
+self__._next = cljs.core.next(self__._seq);
+} else {
+}
+}
+
+return !((self__._next == null));
+});
+
+cljs.core.SeqIter.prototype.next = (function (){
+var self__ = this;
+var this$ = this;
+if(!(this$.hasNext())){
+throw (new Error("No such element"));
+} else {
+self__._seq = self__._next;
+
+return cljs.core.first(self__._next);
+}
+});
+
+cljs.core.SeqIter.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.SeqIter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$_seq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$_next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.SeqIter.cljs$lang$type = true;
+
+cljs.core.SeqIter.cljs$lang$ctorStr = "cljs.core/SeqIter";
+
+cljs.core.SeqIter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/SeqIter");
+});
+
+/**
+ * Positional factory function for cljs.core/SeqIter.
+ */
+cljs.core.__GT_SeqIter = (function cljs$core$__GT_SeqIter(_seq,_next){
+return (new cljs.core.SeqIter(_seq,_next));
+});
+
+cljs.core.seq_iter = (function cljs$core$seq_iter(coll){
+return (new cljs.core.SeqIter(cljs.core.INIT,coll));
+});
+cljs.core.iter = (function cljs$core$iter(coll){
+if(cljs.core.iterable_QMARK_(coll)){
+return cljs.core._iterator(coll);
+} else {
+if((coll == null)){
+return cljs.core.nil_iter();
+} else {
+if(typeof coll === 'string'){
+return cljs.core.string_iter(coll);
+} else {
+if(cljs.core.array_QMARK_(coll)){
+return cljs.core.array_iter(coll);
+} else {
+if(cljs.core.seqable_QMARK_(coll)){
+return cljs.core.seq_iter(coll);
+} else {
+throw (new Error(["Cannot create iterator from ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(coll)].join('')));
+
+}
+}
+}
+}
+}
+});
+
+/**
+* @constructor
+*/
+cljs.core.Many = (function (vals){
+this.vals = vals;
+});
+cljs.core.Many.prototype.add = (function (o){
+var self__ = this;
+var this$ = this;
+self__.vals.push(o);
+
+return this$;
+});
+
+cljs.core.Many.prototype.remove = (function (){
+var self__ = this;
+var this$ = this;
+return self__.vals.shift();
+});
+
+cljs.core.Many.prototype.isEmpty = (function (){
+var self__ = this;
+var this$ = this;
+return (self__.vals.length === (0));
+});
+
+cljs.core.Many.prototype.toString = (function (){
+var self__ = this;
+var this$ = this;
+return ["Many: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.vals)].join('');
+});
+
+cljs.core.Many.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$vals], null);
+});
+
+cljs.core.Many.cljs$lang$type = true;
+
+cljs.core.Many.cljs$lang$ctorStr = "cljs.core/Many";
+
+cljs.core.Many.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Many");
+});
+
+/**
+ * Positional factory function for cljs.core/Many.
+ */
+cljs.core.__GT_Many = (function cljs$core$__GT_Many(vals){
+return (new cljs.core.Many(vals));
+});
+
+cljs.core.NONE = ({});
+
+/**
+* @constructor
+*/
+cljs.core.Single = (function (val){
+this.val = val;
+});
+cljs.core.Single.prototype.add = (function (o){
+var self__ = this;
+var this$ = this;
+if((self__.val === cljs.core.NONE)){
+self__.val = o;
+
+return this$;
+} else {
+return (new cljs.core.Many([self__.val,o]));
+}
+});
+
+cljs.core.Single.prototype.remove = (function (){
+var self__ = this;
+var this$ = this;
+if((self__.val === cljs.core.NONE)){
+throw (new Error(["Removing object from empty buffer"].join('')));
+} else {
+var ret = self__.val;
+self__.val = cljs.core.NONE;
+
+return ret;
+}
+});
+
+cljs.core.Single.prototype.isEmpty = (function (){
+var self__ = this;
+var this$ = this;
+return (self__.val === cljs.core.NONE);
+});
+
+cljs.core.Single.prototype.toString = (function (){
+var self__ = this;
+var this$ = this;
+return ["Single: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.val)].join('');
+});
+
+cljs.core.Single.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$val,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Single.cljs$lang$type = true;
+
+cljs.core.Single.cljs$lang$ctorStr = "cljs.core/Single";
+
+cljs.core.Single.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Single");
+});
+
+/**
+ * Positional factory function for cljs.core/Single.
+ */
+cljs.core.__GT_Single = (function cljs$core$__GT_Single(val){
+return (new cljs.core.Single(val));
+});
+
+
+/**
+* @constructor
+*/
+cljs.core.Empty = (function (){
+});
+cljs.core.Empty.prototype.add = (function (o){
+var self__ = this;
+var this$ = this;
+return (new cljs.core.Single(o));
+});
+
+cljs.core.Empty.prototype.remove = (function (){
+var self__ = this;
+var this$ = this;
+throw (new Error(["Removing object from empty buffer"].join('')));
+});
+
+cljs.core.Empty.prototype.isEmpty = (function (){
+var self__ = this;
+var this$ = this;
+return true;
+});
+
+cljs.core.Empty.prototype.toString = (function (){
+var self__ = this;
+var this$ = this;
+return "Empty";
+});
+
+cljs.core.Empty.getBasis = (function (){
+return cljs.core.PersistentVector.EMPTY;
+});
+
+cljs.core.Empty.cljs$lang$type = true;
+
+cljs.core.Empty.cljs$lang$ctorStr = "cljs.core/Empty";
+
+cljs.core.Empty.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Empty");
+});
+
+/**
+ * Positional factory function for cljs.core/Empty.
+ */
+cljs.core.__GT_Empty = (function cljs$core$__GT_Empty(){
+return (new cljs.core.Empty());
+});
+
+cljs.core.EMPTY = (new cljs.core.Empty());
+
+/**
+* @constructor
+*/
+cljs.core.MultiIterator = (function (iters){
+this.iters = iters;
+});
+cljs.core.MultiIterator.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+var iters__$1 = cljs.core.seq(self__.iters);
+while(true){
+if(!((iters__$1 == null))){
+var iter = cljs.core.first(iters__$1);
+if(!(iter.hasNext())){
+return false;
+} else {
+var G__1503 = cljs.core.next(iters__$1);
+iters__$1 = G__1503;
+continue;
+}
+} else {
+return true;
+}
+break;
+}
+});
+
+cljs.core.MultiIterator.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+var nexts = [];
+var n__4395__auto___1504 = self__.iters.length;
+var i_1505 = (0);
+while(true){
+if((i_1505 < n__4395__auto___1504)){
+(nexts[i_1505] = (self__.iters[i_1505]).next());
+
+var G__1506 = (i_1505 + (1));
+i_1505 = G__1506;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(nexts,(0));
+});
+
+cljs.core.MultiIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$iters], null);
+});
+
+cljs.core.MultiIterator.cljs$lang$type = true;
+
+cljs.core.MultiIterator.cljs$lang$ctorStr = "cljs.core/MultiIterator";
+
+cljs.core.MultiIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/MultiIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/MultiIterator.
+ */
+cljs.core.__GT_MultiIterator = (function cljs$core$__GT_MultiIterator(iters){
+return (new cljs.core.MultiIterator(iters));
+});
+
+cljs.core.chunkIteratorSeq = (function cljs$core$chunkIteratorSeq(iter){
+return (new cljs.core.LazySeq(null,(function (){
+if(iter.hasNext()){
+var arr = [];
+var n = (0);
+while(true){
+if(cljs.core.truth_((function (){var and__3925__auto__ = iter.hasNext();
+if(cljs.core.truth_(and__3925__auto__)){
+return (n < (32));
+} else {
+return and__3925__auto__;
+}
+})())){
+(arr[n] = iter.next());
+
+var G__1507 = (n + (1));
+n = G__1507;
+continue;
+} else {
+return cljs.core.chunk_cons(cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$3(arr,(0),n),(cljs.core.chunkIteratorSeq.cljs$core$IFn$_invoke$arity$1 ? cljs.core.chunkIteratorSeq.cljs$core$IFn$_invoke$arity$1(iter) : cljs.core.chunkIteratorSeq.call(null,iter)));
+}
+break;
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+/**
+* @constructor
+*/
+cljs.core.TransformerIterator = (function (buffer,_next,completed,xf,sourceIter,multi){
+this.buffer = buffer;
+this._next = _next;
+this.completed = completed;
+this.xf = xf;
+this.sourceIter = sourceIter;
+this.multi = multi;
+});
+cljs.core.TransformerIterator.prototype.step = (function (){
+var self__ = this;
+var this$ = this;
+if(!((self__._next === cljs.core.NONE))){
+return true;
+} else {
+while(true){
+if((self__._next === cljs.core.NONE)){
+if(self__.buffer.isEmpty()){
+if(self__.completed){
+return false;
+} else {
+if(self__.sourceIter.hasNext()){
+var iter = ((self__.multi)?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(self__.xf,cljs.core.cons(null,self__.sourceIter.next())):(function (){var G__1508 = null;
+var G__1509 = self__.sourceIter.next();
+return (self__.xf.cljs$core$IFn$_invoke$arity$2 ? self__.xf.cljs$core$IFn$_invoke$arity$2(G__1508,G__1509) : self__.xf.call(null,G__1508,G__1509));
+})());
+if(cljs.core.reduced_QMARK_(iter)){
+(self__.xf.cljs$core$IFn$_invoke$arity$1 ? self__.xf.cljs$core$IFn$_invoke$arity$1(null) : self__.xf.call(null,null));
+
+self__.completed = true;
+} else {
+}
+
+continue;
+} else {
+(self__.xf.cljs$core$IFn$_invoke$arity$1 ? self__.xf.cljs$core$IFn$_invoke$arity$1(null) : self__.xf.call(null,null));
+
+self__.completed = true;
+
+continue;
+}
+}
+} else {
+self__._next = self__.buffer.remove();
+
+continue;
+}
+} else {
+return true;
+}
+break;
+}
+}
+});
+
+cljs.core.TransformerIterator.prototype.hasNext = (function (){
+var self__ = this;
+var this$ = this;
+return this$.step();
+});
+
+cljs.core.TransformerIterator.prototype.next = (function (){
+var self__ = this;
+var this$ = this;
+if(this$.hasNext()){
+var ret = self__._next;
+self__._next = cljs.core.NONE;
+
+return ret;
+} else {
+throw (new Error("No such element"));
+}
+});
+
+cljs.core.TransformerIterator.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.TransformerIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$buffer,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$_next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$completed,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$xf,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$sourceIter,cljs.core.cst$sym$multi], null);
+});
+
+cljs.core.TransformerIterator.cljs$lang$type = true;
+
+cljs.core.TransformerIterator.cljs$lang$ctorStr = "cljs.core/TransformerIterator";
+
+cljs.core.TransformerIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/TransformerIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/TransformerIterator.
+ */
+cljs.core.__GT_TransformerIterator = (function cljs$core$__GT_TransformerIterator(buffer,_next,completed,xf,sourceIter,multi){
+return (new cljs.core.TransformerIterator(buffer,_next,completed,xf,sourceIter,multi));
+});
+
+var G__1510_1513 = cljs.core.TransformerIterator.prototype;
+var G__1511_1514 = cljs.core.ITER_SYMBOL;
+var G__1512_1515 = ((function (G__1510_1513,G__1511_1514){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__1510_1513,G__1511_1514))
+;
+goog.object.set(G__1510_1513,G__1511_1514,G__1512_1515);
+cljs.core.transformer_iterator = (function cljs$core$transformer_iterator(xform,sourceIter,multi){
+var iterator = (new cljs.core.TransformerIterator(cljs.core.EMPTY,cljs.core.NONE,false,null,sourceIter,multi));
+iterator.xf = (function (){var G__1516 = ((function (iterator){
+return (function() {
+var G__1517 = null;
+var G__1517__0 = (function (){
+return null;
+});
+var G__1517__1 = (function (acc){
+return acc;
+});
+var G__1517__2 = (function (acc,o){
+iterator.buffer = iterator.buffer.add(o);
+
+return acc;
+});
+G__1517 = function(acc,o){
+switch(arguments.length){
+case 0:
+return G__1517__0.call(this);
+case 1:
+return G__1517__1.call(this,acc);
+case 2:
+return G__1517__2.call(this,acc,o);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1517.cljs$core$IFn$_invoke$arity$0 = G__1517__0;
+G__1517.cljs$core$IFn$_invoke$arity$1 = G__1517__1;
+G__1517.cljs$core$IFn$_invoke$arity$2 = G__1517__2;
+return G__1517;
+})()
+;})(iterator))
+;
+return (xform.cljs$core$IFn$_invoke$arity$1 ? xform.cljs$core$IFn$_invoke$arity$1(G__1516) : xform.call(null,G__1516));
+})();
+
+return iterator;
+});
+cljs.core.TransformerIterator.create = (function (xform,source){
+return cljs.core.transformer_iterator(xform,source,false);
+});
+cljs.core.TransformerIterator.createMulti = (function (xform,sources){
+return cljs.core.transformer_iterator(xform,(new cljs.core.MultiIterator(cljs.core.to_array(sources))),true);
+});
+/**
+ * Coerces coll to a (possibly empty) sequence, if it is not already
+ *   one. Will not force a lazy seq. (sequence nil) yields (), When a
+ *   transducer is supplied, returns a lazy sequence of applications of
+ *   the transform to the items in coll(s), i.e. to the set of first
+ *   items of each coll, followed by the set of second
+ *   items in each coll, until any one of the colls is exhausted.  Any
+ *   remaining items in other colls are ignored. The transform should accept
+ *   number-of-colls arguments
+ */
+cljs.core.sequence = (function cljs$core$sequence(var_args){
+var G__1522 = arguments.length;
+switch (G__1522) {
+case 1:
+return cljs.core.sequence.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.sequence.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1524 = arguments.length;
+var i__4519__auto___1525 = (0);
+while(true){
+if((i__4519__auto___1525 < len__4518__auto___1524)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1525]));
+
+var G__1526 = (i__4519__auto___1525 + (1));
+i__4519__auto___1525 = G__1526;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.sequence.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.sequence.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+if(cljs.core.seq_QMARK_(coll)){
+return coll;
+} else {
+var or__3936__auto__ = cljs.core.seq(coll);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return cljs.core.List.EMPTY;
+}
+}
+});
+
+cljs.core.sequence.cljs$core$IFn$_invoke$arity$2 = (function (xform,coll){
+var or__3936__auto__ = cljs.core.chunkIteratorSeq(cljs.core.TransformerIterator.create(xform,cljs.core.iter(coll)));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.sequence.cljs$core$IFn$_invoke$arity$variadic = (function (xform,coll,colls){
+var or__3936__auto__ = cljs.core.chunkIteratorSeq(cljs.core.TransformerIterator.createMulti(xform,cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.iter,cljs.core.cons(coll,colls))));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+/** @this {Function} */
+cljs.core.sequence.cljs$lang$applyTo = (function (seq1519){
+var G__1520 = cljs.core.first(seq1519);
+var seq1519__$1 = cljs.core.next(seq1519);
+var G__1521 = cljs.core.first(seq1519__$1);
+var seq1519__$2 = cljs.core.next(seq1519__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1520,G__1521,seq1519__$2);
+});
+
+cljs.core.sequence.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns true if (pred x) is logical true for every x in coll, else
+ *   false.
+ */
+cljs.core.every_QMARK_ = (function cljs$core$every_QMARK_(pred,coll){
+while(true){
+if((cljs.core.seq(coll) == null)){
+return true;
+} else {
+if(cljs.core.truth_((function (){var G__1527 = cljs.core.first(coll);
+return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__1527) : pred.call(null,G__1527));
+})())){
+var G__1528 = pred;
+var G__1529 = cljs.core.next(coll);
+pred = G__1528;
+coll = G__1529;
+continue;
+} else {
+return false;
+
+}
+}
+break;
+}
+});
+/**
+ * Returns false if (pred x) is logical true for every x in
+ *   coll, else true.
+ */
+cljs.core.not_every_QMARK_ = (function cljs$core$not_every_QMARK_(pred,coll){
+return !(cljs.core.every_QMARK_(pred,coll));
+});
+/**
+ * Returns the first logical true value of (pred x) for any x in coll,
+ *   else nil.  One common idiom is to use a set as pred, for example
+ *   this will return :fred if :fred is in the sequence, otherwise nil:
+ *   (some #{:fred} coll)
+ */
+cljs.core.some = (function cljs$core$some(pred,coll){
+while(true){
+if(cljs.core.seq(coll)){
+var or__3936__auto__ = (function (){var G__1531 = cljs.core.first(coll);
+return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__1531) : pred.call(null,G__1531));
+})();
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var G__1532 = pred;
+var G__1533 = cljs.core.next(coll);
+pred = G__1532;
+coll = G__1533;
+continue;
+}
+} else {
+return null;
+}
+break;
+}
+});
+/**
+ * Returns false if (pred x) is logical true for any x in coll,
+ *   else true.
+ */
+cljs.core.not_any_QMARK_ = (function cljs$core$not_any_QMARK_(pred,coll){
+return cljs.core.not(cljs.core.some(pred,coll));
+});
+/**
+ * Returns true if n is even, throws an exception if n is not an integer
+ */
+cljs.core.even_QMARK_ = (function cljs$core$even_QMARK_(n){
+if(cljs.core.integer_QMARK_(n)){
+return ((n & (1)) === (0));
+} else {
+throw (new Error(["Argument must be an integer: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)].join('')));
+}
+});
+/**
+ * Returns true if n is odd, throws an exception if n is not an integer
+ */
+cljs.core.odd_QMARK_ = (function cljs$core$odd_QMARK_(n){
+return !(cljs.core.even_QMARK_(n));
+});
+/**
+ * Takes a fn f and returns a fn that takes the same arguments as f,
+ *   has the same effects, if any, and returns the opposite truth value.
+ */
+cljs.core.complement = (function cljs$core$complement(f){
+return (function() {
+var G__1534 = null;
+var G__1534__0 = (function (){
+return cljs.core.not((f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)));
+});
+var G__1534__1 = (function (x){
+return cljs.core.not((f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x)));
+});
+var G__1534__2 = (function (x,y){
+return cljs.core.not((f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y)));
+});
+var G__1534__3 = (function() { 
+var G__1535__delegate = function (x,y,zs){
+return cljs.core.not(cljs.core.apply.cljs$core$IFn$_invoke$arity$4(f,x,y,zs));
+};
+var G__1535 = function (x,y,var_args){
+var zs = null;
+if (arguments.length > 2) {
+var G__1536__i = 0, G__1536__a = new Array(arguments.length -  2);
+while (G__1536__i < G__1536__a.length) {G__1536__a[G__1536__i] = arguments[G__1536__i + 2]; ++G__1536__i;}
+  zs = new cljs.core.IndexedSeq(G__1536__a,0,null);
+} 
+return G__1535__delegate.call(this,x,y,zs);};
+G__1535.cljs$lang$maxFixedArity = 2;
+G__1535.cljs$lang$applyTo = (function (arglist__1537){
+var x = cljs.core.first(arglist__1537);
+arglist__1537 = cljs.core.next(arglist__1537);
+var y = cljs.core.first(arglist__1537);
+var zs = cljs.core.rest(arglist__1537);
+return G__1535__delegate(x,y,zs);
+});
+G__1535.cljs$core$IFn$_invoke$arity$variadic = G__1535__delegate;
+return G__1535;
+})()
+;
+G__1534 = function(x,y,var_args){
+var zs = var_args;
+switch(arguments.length){
+case 0:
+return G__1534__0.call(this);
+case 1:
+return G__1534__1.call(this,x);
+case 2:
+return G__1534__2.call(this,x,y);
+default:
+var G__1538 = null;
+if (arguments.length > 2) {
+var G__1539__i = 0, G__1539__a = new Array(arguments.length -  2);
+while (G__1539__i < G__1539__a.length) {G__1539__a[G__1539__i] = arguments[G__1539__i + 2]; ++G__1539__i;}
+G__1538 = new cljs.core.IndexedSeq(G__1539__a,0,null);
+}
+return G__1534__3.cljs$core$IFn$_invoke$arity$variadic(x,y, G__1538);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1534.cljs$lang$maxFixedArity = 2;
+G__1534.cljs$lang$applyTo = G__1534__3.cljs$lang$applyTo;
+G__1534.cljs$core$IFn$_invoke$arity$0 = G__1534__0;
+G__1534.cljs$core$IFn$_invoke$arity$1 = G__1534__1;
+G__1534.cljs$core$IFn$_invoke$arity$2 = G__1534__2;
+G__1534.cljs$core$IFn$_invoke$arity$variadic = G__1534__3.cljs$core$IFn$_invoke$arity$variadic;
+return G__1534;
+})()
+});
+/**
+ * Returns a function that takes any number of arguments and returns x.
+ */
+cljs.core.constantly = (function cljs$core$constantly(x){
+return (function() { 
+var G__1540__delegate = function (args){
+return x;
+};
+var G__1540 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__1541__i = 0, G__1541__a = new Array(arguments.length -  0);
+while (G__1541__i < G__1541__a.length) {G__1541__a[G__1541__i] = arguments[G__1541__i + 0]; ++G__1541__i;}
+  args = new cljs.core.IndexedSeq(G__1541__a,0,null);
+} 
+return G__1540__delegate.call(this,args);};
+G__1540.cljs$lang$maxFixedArity = 0;
+G__1540.cljs$lang$applyTo = (function (arglist__1542){
+var args = cljs.core.seq(arglist__1542);
+return G__1540__delegate(args);
+});
+G__1540.cljs$core$IFn$_invoke$arity$variadic = G__1540__delegate;
+return G__1540;
+})()
+;
+});
+/**
+ * Takes a set of functions and returns a fn that is the composition
+ *   of those fns.  The returned fn takes a variable number of args,
+ *   applies the rightmost of fns to the args, the next
+ *   fn (right-to-left) to the result, etc.
+ */
+cljs.core.comp = (function cljs$core$comp(var_args){
+var G__1548 = arguments.length;
+switch (G__1548) {
+case 0:
+return cljs.core.comp.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.comp.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.comp.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.comp.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1566 = arguments.length;
+var i__4519__auto___1567 = (0);
+while(true){
+if((i__4519__auto___1567 < len__4518__auto___1566)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1567]));
+
+var G__1568 = (i__4519__auto___1567 + (1));
+i__4519__auto___1567 = G__1568;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.comp.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.comp.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.identity;
+});
+
+cljs.core.comp.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return f;
+});
+
+cljs.core.comp.cljs$core$IFn$_invoke$arity$2 = (function (f,g){
+return (function() {
+var G__1569 = null;
+var G__1569__0 = (function (){
+var G__1549 = (g.cljs$core$IFn$_invoke$arity$0 ? g.cljs$core$IFn$_invoke$arity$0() : g.call(null));
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1549) : f.call(null,G__1549));
+});
+var G__1569__1 = (function (x){
+var G__1550 = (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(x) : g.call(null,x));
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1550) : f.call(null,G__1550));
+});
+var G__1569__2 = (function (x,y){
+var G__1551 = (g.cljs$core$IFn$_invoke$arity$2 ? g.cljs$core$IFn$_invoke$arity$2(x,y) : g.call(null,x,y));
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1551) : f.call(null,G__1551));
+});
+var G__1569__3 = (function (x,y,z){
+var G__1552 = (g.cljs$core$IFn$_invoke$arity$3 ? g.cljs$core$IFn$_invoke$arity$3(x,y,z) : g.call(null,x,y,z));
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1552) : f.call(null,G__1552));
+});
+var G__1569__4 = (function() { 
+var G__1570__delegate = function (x,y,z,args){
+var G__1553 = cljs.core.apply.cljs$core$IFn$_invoke$arity$5(g,x,y,z,args);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1553) : f.call(null,G__1553));
+};
+var G__1570 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1571__i = 0, G__1571__a = new Array(arguments.length -  3);
+while (G__1571__i < G__1571__a.length) {G__1571__a[G__1571__i] = arguments[G__1571__i + 3]; ++G__1571__i;}
+  args = new cljs.core.IndexedSeq(G__1571__a,0,null);
+} 
+return G__1570__delegate.call(this,x,y,z,args);};
+G__1570.cljs$lang$maxFixedArity = 3;
+G__1570.cljs$lang$applyTo = (function (arglist__1572){
+var x = cljs.core.first(arglist__1572);
+arglist__1572 = cljs.core.next(arglist__1572);
+var y = cljs.core.first(arglist__1572);
+arglist__1572 = cljs.core.next(arglist__1572);
+var z = cljs.core.first(arglist__1572);
+var args = cljs.core.rest(arglist__1572);
+return G__1570__delegate(x,y,z,args);
+});
+G__1570.cljs$core$IFn$_invoke$arity$variadic = G__1570__delegate;
+return G__1570;
+})()
+;
+G__1569 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__1569__0.call(this);
+case 1:
+return G__1569__1.call(this,x);
+case 2:
+return G__1569__2.call(this,x,y);
+case 3:
+return G__1569__3.call(this,x,y,z);
+default:
+var G__1573 = null;
+if (arguments.length > 3) {
+var G__1574__i = 0, G__1574__a = new Array(arguments.length -  3);
+while (G__1574__i < G__1574__a.length) {G__1574__a[G__1574__i] = arguments[G__1574__i + 3]; ++G__1574__i;}
+G__1573 = new cljs.core.IndexedSeq(G__1574__a,0,null);
+}
+return G__1569__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1573);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1569.cljs$lang$maxFixedArity = 3;
+G__1569.cljs$lang$applyTo = G__1569__4.cljs$lang$applyTo;
+G__1569.cljs$core$IFn$_invoke$arity$0 = G__1569__0;
+G__1569.cljs$core$IFn$_invoke$arity$1 = G__1569__1;
+G__1569.cljs$core$IFn$_invoke$arity$2 = G__1569__2;
+G__1569.cljs$core$IFn$_invoke$arity$3 = G__1569__3;
+G__1569.cljs$core$IFn$_invoke$arity$variadic = G__1569__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1569;
+})()
+});
+
+cljs.core.comp.cljs$core$IFn$_invoke$arity$3 = (function (f,g,h){
+return (function() {
+var G__1575 = null;
+var G__1575__0 = (function (){
+var G__1554 = (function (){var G__1555 = (h.cljs$core$IFn$_invoke$arity$0 ? h.cljs$core$IFn$_invoke$arity$0() : h.call(null));
+return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1555) : g.call(null,G__1555));
+})();
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1554) : f.call(null,G__1554));
+});
+var G__1575__1 = (function (x){
+var G__1556 = (function (){var G__1557 = (h.cljs$core$IFn$_invoke$arity$1 ? h.cljs$core$IFn$_invoke$arity$1(x) : h.call(null,x));
+return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1557) : g.call(null,G__1557));
+})();
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1556) : f.call(null,G__1556));
+});
+var G__1575__2 = (function (x,y){
+var G__1558 = (function (){var G__1559 = (h.cljs$core$IFn$_invoke$arity$2 ? h.cljs$core$IFn$_invoke$arity$2(x,y) : h.call(null,x,y));
+return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1559) : g.call(null,G__1559));
+})();
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1558) : f.call(null,G__1558));
+});
+var G__1575__3 = (function (x,y,z){
+var G__1560 = (function (){var G__1561 = (h.cljs$core$IFn$_invoke$arity$3 ? h.cljs$core$IFn$_invoke$arity$3(x,y,z) : h.call(null,x,y,z));
+return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1561) : g.call(null,G__1561));
+})();
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1560) : f.call(null,G__1560));
+});
+var G__1575__4 = (function() { 
+var G__1576__delegate = function (x,y,z,args){
+var G__1562 = (function (){var G__1563 = cljs.core.apply.cljs$core$IFn$_invoke$arity$5(h,x,y,z,args);
+return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1563) : g.call(null,G__1563));
+})();
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1562) : f.call(null,G__1562));
+};
+var G__1576 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1577__i = 0, G__1577__a = new Array(arguments.length -  3);
+while (G__1577__i < G__1577__a.length) {G__1577__a[G__1577__i] = arguments[G__1577__i + 3]; ++G__1577__i;}
+  args = new cljs.core.IndexedSeq(G__1577__a,0,null);
+} 
+return G__1576__delegate.call(this,x,y,z,args);};
+G__1576.cljs$lang$maxFixedArity = 3;
+G__1576.cljs$lang$applyTo = (function (arglist__1578){
+var x = cljs.core.first(arglist__1578);
+arglist__1578 = cljs.core.next(arglist__1578);
+var y = cljs.core.first(arglist__1578);
+arglist__1578 = cljs.core.next(arglist__1578);
+var z = cljs.core.first(arglist__1578);
+var args = cljs.core.rest(arglist__1578);
+return G__1576__delegate(x,y,z,args);
+});
+G__1576.cljs$core$IFn$_invoke$arity$variadic = G__1576__delegate;
+return G__1576;
+})()
+;
+G__1575 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__1575__0.call(this);
+case 1:
+return G__1575__1.call(this,x);
+case 2:
+return G__1575__2.call(this,x,y);
+case 3:
+return G__1575__3.call(this,x,y,z);
+default:
+var G__1579 = null;
+if (arguments.length > 3) {
+var G__1580__i = 0, G__1580__a = new Array(arguments.length -  3);
+while (G__1580__i < G__1580__a.length) {G__1580__a[G__1580__i] = arguments[G__1580__i + 3]; ++G__1580__i;}
+G__1579 = new cljs.core.IndexedSeq(G__1580__a,0,null);
+}
+return G__1575__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1579);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1575.cljs$lang$maxFixedArity = 3;
+G__1575.cljs$lang$applyTo = G__1575__4.cljs$lang$applyTo;
+G__1575.cljs$core$IFn$_invoke$arity$0 = G__1575__0;
+G__1575.cljs$core$IFn$_invoke$arity$1 = G__1575__1;
+G__1575.cljs$core$IFn$_invoke$arity$2 = G__1575__2;
+G__1575.cljs$core$IFn$_invoke$arity$3 = G__1575__3;
+G__1575.cljs$core$IFn$_invoke$arity$variadic = G__1575__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1575;
+})()
+});
+
+cljs.core.comp.cljs$core$IFn$_invoke$arity$variadic = (function (f1,f2,f3,fs){
+var fs__$1 = cljs.core.reverse(cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(f1,f2,f3,fs));
+return ((function (fs__$1){
+return (function() { 
+var G__1581__delegate = function (args){
+var ret = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.first(fs__$1),args);
+var fs__$2 = cljs.core.next(fs__$1);
+while(true){
+if(fs__$2){
+var G__1582 = (function (){var fexpr__1564 = cljs.core.first(fs__$2);
+return (fexpr__1564.cljs$core$IFn$_invoke$arity$1 ? fexpr__1564.cljs$core$IFn$_invoke$arity$1(ret) : fexpr__1564.call(null,ret));
+})();
+var G__1583 = cljs.core.next(fs__$2);
+ret = G__1582;
+fs__$2 = G__1583;
+continue;
+} else {
+return ret;
+}
+break;
+}
+};
+var G__1581 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__1584__i = 0, G__1584__a = new Array(arguments.length -  0);
+while (G__1584__i < G__1584__a.length) {G__1584__a[G__1584__i] = arguments[G__1584__i + 0]; ++G__1584__i;}
+  args = new cljs.core.IndexedSeq(G__1584__a,0,null);
+} 
+return G__1581__delegate.call(this,args);};
+G__1581.cljs$lang$maxFixedArity = 0;
+G__1581.cljs$lang$applyTo = (function (arglist__1585){
+var args = cljs.core.seq(arglist__1585);
+return G__1581__delegate(args);
+});
+G__1581.cljs$core$IFn$_invoke$arity$variadic = G__1581__delegate;
+return G__1581;
+})()
+;
+;})(fs__$1))
+});
+
+/** @this {Function} */
+cljs.core.comp.cljs$lang$applyTo = (function (seq1544){
+var G__1545 = cljs.core.first(seq1544);
+var seq1544__$1 = cljs.core.next(seq1544);
+var G__1546 = cljs.core.first(seq1544__$1);
+var seq1544__$2 = cljs.core.next(seq1544__$1);
+var G__1547 = cljs.core.first(seq1544__$2);
+var seq1544__$3 = cljs.core.next(seq1544__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1545,G__1546,G__1547,seq1544__$3);
+});
+
+cljs.core.comp.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Takes a function f and fewer than the normal arguments to f, and
+ *   returns a fn that takes a variable number of additional args. When
+ *   called, the returned function calls f with args + additional args.
+ */
+cljs.core.partial = (function cljs$core$partial(var_args){
+var G__1592 = arguments.length;
+switch (G__1592) {
+case 1:
+return cljs.core.partial.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.partial.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.partial.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.partial.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1594 = arguments.length;
+var i__4519__auto___1595 = (0);
+while(true){
+if((i__4519__auto___1595 < len__4518__auto___1594)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1595]));
+
+var G__1596 = (i__4519__auto___1595 + (1));
+i__4519__auto___1595 = G__1596;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((4)),(0),null));
+return cljs.core.partial.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.partial.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return f;
+});
+
+cljs.core.partial.cljs$core$IFn$_invoke$arity$2 = (function (f,arg1){
+return (function() {
+var G__1597 = null;
+var G__1597__0 = (function (){
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(arg1) : f.call(null,arg1));
+});
+var G__1597__1 = (function (x){
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(arg1,x) : f.call(null,arg1,x));
+});
+var G__1597__2 = (function (x,y){
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(arg1,x,y) : f.call(null,arg1,x,y));
+});
+var G__1597__3 = (function (x,y,z){
+return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(arg1,x,y,z) : f.call(null,arg1,x,y,z));
+});
+var G__1597__4 = (function() { 
+var G__1598__delegate = function (x,y,z,args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,arg1,x,y,z,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([args], 0));
+};
+var G__1598 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1599__i = 0, G__1599__a = new Array(arguments.length -  3);
+while (G__1599__i < G__1599__a.length) {G__1599__a[G__1599__i] = arguments[G__1599__i + 3]; ++G__1599__i;}
+  args = new cljs.core.IndexedSeq(G__1599__a,0,null);
+} 
+return G__1598__delegate.call(this,x,y,z,args);};
+G__1598.cljs$lang$maxFixedArity = 3;
+G__1598.cljs$lang$applyTo = (function (arglist__1600){
+var x = cljs.core.first(arglist__1600);
+arglist__1600 = cljs.core.next(arglist__1600);
+var y = cljs.core.first(arglist__1600);
+arglist__1600 = cljs.core.next(arglist__1600);
+var z = cljs.core.first(arglist__1600);
+var args = cljs.core.rest(arglist__1600);
+return G__1598__delegate(x,y,z,args);
+});
+G__1598.cljs$core$IFn$_invoke$arity$variadic = G__1598__delegate;
+return G__1598;
+})()
+;
+G__1597 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__1597__0.call(this);
+case 1:
+return G__1597__1.call(this,x);
+case 2:
+return G__1597__2.call(this,x,y);
+case 3:
+return G__1597__3.call(this,x,y,z);
+default:
+var G__1601 = null;
+if (arguments.length > 3) {
+var G__1602__i = 0, G__1602__a = new Array(arguments.length -  3);
+while (G__1602__i < G__1602__a.length) {G__1602__a[G__1602__i] = arguments[G__1602__i + 3]; ++G__1602__i;}
+G__1601 = new cljs.core.IndexedSeq(G__1602__a,0,null);
+}
+return G__1597__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1601);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1597.cljs$lang$maxFixedArity = 3;
+G__1597.cljs$lang$applyTo = G__1597__4.cljs$lang$applyTo;
+G__1597.cljs$core$IFn$_invoke$arity$0 = G__1597__0;
+G__1597.cljs$core$IFn$_invoke$arity$1 = G__1597__1;
+G__1597.cljs$core$IFn$_invoke$arity$2 = G__1597__2;
+G__1597.cljs$core$IFn$_invoke$arity$3 = G__1597__3;
+G__1597.cljs$core$IFn$_invoke$arity$variadic = G__1597__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1597;
+})()
+});
+
+cljs.core.partial.cljs$core$IFn$_invoke$arity$3 = (function (f,arg1,arg2){
+return (function() {
+var G__1603 = null;
+var G__1603__0 = (function (){
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(arg1,arg2) : f.call(null,arg1,arg2));
+});
+var G__1603__1 = (function (x){
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(arg1,arg2,x) : f.call(null,arg1,arg2,x));
+});
+var G__1603__2 = (function (x,y){
+return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(arg1,arg2,x,y) : f.call(null,arg1,arg2,x,y));
+});
+var G__1603__3 = (function (x,y,z){
+return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(arg1,arg2,x,y,z) : f.call(null,arg1,arg2,x,y,z));
+});
+var G__1603__4 = (function() { 
+var G__1604__delegate = function (x,y,z,args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,arg1,arg2,x,y,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([z,args], 0));
+};
+var G__1604 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1605__i = 0, G__1605__a = new Array(arguments.length -  3);
+while (G__1605__i < G__1605__a.length) {G__1605__a[G__1605__i] = arguments[G__1605__i + 3]; ++G__1605__i;}
+  args = new cljs.core.IndexedSeq(G__1605__a,0,null);
+} 
+return G__1604__delegate.call(this,x,y,z,args);};
+G__1604.cljs$lang$maxFixedArity = 3;
+G__1604.cljs$lang$applyTo = (function (arglist__1606){
+var x = cljs.core.first(arglist__1606);
+arglist__1606 = cljs.core.next(arglist__1606);
+var y = cljs.core.first(arglist__1606);
+arglist__1606 = cljs.core.next(arglist__1606);
+var z = cljs.core.first(arglist__1606);
+var args = cljs.core.rest(arglist__1606);
+return G__1604__delegate(x,y,z,args);
+});
+G__1604.cljs$core$IFn$_invoke$arity$variadic = G__1604__delegate;
+return G__1604;
+})()
+;
+G__1603 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__1603__0.call(this);
+case 1:
+return G__1603__1.call(this,x);
+case 2:
+return G__1603__2.call(this,x,y);
+case 3:
+return G__1603__3.call(this,x,y,z);
+default:
+var G__1607 = null;
+if (arguments.length > 3) {
+var G__1608__i = 0, G__1608__a = new Array(arguments.length -  3);
+while (G__1608__i < G__1608__a.length) {G__1608__a[G__1608__i] = arguments[G__1608__i + 3]; ++G__1608__i;}
+G__1607 = new cljs.core.IndexedSeq(G__1608__a,0,null);
+}
+return G__1603__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1607);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1603.cljs$lang$maxFixedArity = 3;
+G__1603.cljs$lang$applyTo = G__1603__4.cljs$lang$applyTo;
+G__1603.cljs$core$IFn$_invoke$arity$0 = G__1603__0;
+G__1603.cljs$core$IFn$_invoke$arity$1 = G__1603__1;
+G__1603.cljs$core$IFn$_invoke$arity$2 = G__1603__2;
+G__1603.cljs$core$IFn$_invoke$arity$3 = G__1603__3;
+G__1603.cljs$core$IFn$_invoke$arity$variadic = G__1603__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1603;
+})()
+});
+
+cljs.core.partial.cljs$core$IFn$_invoke$arity$4 = (function (f,arg1,arg2,arg3){
+return (function() {
+var G__1609 = null;
+var G__1609__0 = (function (){
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(arg1,arg2,arg3) : f.call(null,arg1,arg2,arg3));
+});
+var G__1609__1 = (function (x){
+return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(arg1,arg2,arg3,x) : f.call(null,arg1,arg2,arg3,x));
+});
+var G__1609__2 = (function (x,y){
+return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(arg1,arg2,arg3,x,y) : f.call(null,arg1,arg2,arg3,x,y));
+});
+var G__1609__3 = (function (x,y,z){
+return (f.cljs$core$IFn$_invoke$arity$6 ? f.cljs$core$IFn$_invoke$arity$6(arg1,arg2,arg3,x,y,z) : f.call(null,arg1,arg2,arg3,x,y,z));
+});
+var G__1609__4 = (function() { 
+var G__1610__delegate = function (x,y,z,args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,arg1,arg2,arg3,x,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([y,z,args], 0));
+};
+var G__1610 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1611__i = 0, G__1611__a = new Array(arguments.length -  3);
+while (G__1611__i < G__1611__a.length) {G__1611__a[G__1611__i] = arguments[G__1611__i + 3]; ++G__1611__i;}
+  args = new cljs.core.IndexedSeq(G__1611__a,0,null);
+} 
+return G__1610__delegate.call(this,x,y,z,args);};
+G__1610.cljs$lang$maxFixedArity = 3;
+G__1610.cljs$lang$applyTo = (function (arglist__1612){
+var x = cljs.core.first(arglist__1612);
+arglist__1612 = cljs.core.next(arglist__1612);
+var y = cljs.core.first(arglist__1612);
+arglist__1612 = cljs.core.next(arglist__1612);
+var z = cljs.core.first(arglist__1612);
+var args = cljs.core.rest(arglist__1612);
+return G__1610__delegate(x,y,z,args);
+});
+G__1610.cljs$core$IFn$_invoke$arity$variadic = G__1610__delegate;
+return G__1610;
+})()
+;
+G__1609 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__1609__0.call(this);
+case 1:
+return G__1609__1.call(this,x);
+case 2:
+return G__1609__2.call(this,x,y);
+case 3:
+return G__1609__3.call(this,x,y,z);
+default:
+var G__1613 = null;
+if (arguments.length > 3) {
+var G__1614__i = 0, G__1614__a = new Array(arguments.length -  3);
+while (G__1614__i < G__1614__a.length) {G__1614__a[G__1614__i] = arguments[G__1614__i + 3]; ++G__1614__i;}
+G__1613 = new cljs.core.IndexedSeq(G__1614__a,0,null);
+}
+return G__1609__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1613);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1609.cljs$lang$maxFixedArity = 3;
+G__1609.cljs$lang$applyTo = G__1609__4.cljs$lang$applyTo;
+G__1609.cljs$core$IFn$_invoke$arity$0 = G__1609__0;
+G__1609.cljs$core$IFn$_invoke$arity$1 = G__1609__1;
+G__1609.cljs$core$IFn$_invoke$arity$2 = G__1609__2;
+G__1609.cljs$core$IFn$_invoke$arity$3 = G__1609__3;
+G__1609.cljs$core$IFn$_invoke$arity$variadic = G__1609__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1609;
+})()
+});
+
+cljs.core.partial.cljs$core$IFn$_invoke$arity$variadic = (function (f,arg1,arg2,arg3,more){
+return (function() { 
+var G__1615__delegate = function (args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,arg1,arg2,arg3,cljs.core.concat.cljs$core$IFn$_invoke$arity$2(more,args));
+};
+var G__1615 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__1616__i = 0, G__1616__a = new Array(arguments.length -  0);
+while (G__1616__i < G__1616__a.length) {G__1616__a[G__1616__i] = arguments[G__1616__i + 0]; ++G__1616__i;}
+  args = new cljs.core.IndexedSeq(G__1616__a,0,null);
+} 
+return G__1615__delegate.call(this,args);};
+G__1615.cljs$lang$maxFixedArity = 0;
+G__1615.cljs$lang$applyTo = (function (arglist__1617){
+var args = cljs.core.seq(arglist__1617);
+return G__1615__delegate(args);
+});
+G__1615.cljs$core$IFn$_invoke$arity$variadic = G__1615__delegate;
+return G__1615;
+})()
+;
+});
+
+/** @this {Function} */
+cljs.core.partial.cljs$lang$applyTo = (function (seq1587){
+var G__1588 = cljs.core.first(seq1587);
+var seq1587__$1 = cljs.core.next(seq1587);
+var G__1589 = cljs.core.first(seq1587__$1);
+var seq1587__$2 = cljs.core.next(seq1587__$1);
+var G__1590 = cljs.core.first(seq1587__$2);
+var seq1587__$3 = cljs.core.next(seq1587__$2);
+var G__1591 = cljs.core.first(seq1587__$3);
+var seq1587__$4 = cljs.core.next(seq1587__$3);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1588,G__1589,G__1590,G__1591,seq1587__$4);
+});
+
+cljs.core.partial.cljs$lang$maxFixedArity = (4);
+
+/**
+ * Takes a function f, and returns a function that calls f, replacing
+ *   a nil first argument to f with the supplied value x. Higher arity
+ *   versions can replace arguments in the second and third
+ *   positions (y, z). Note that the function f can take any number of
+ *   arguments, not just the one(s) being nil-patched.
+ */
+cljs.core.fnil = (function cljs$core$fnil(var_args){
+var G__1619 = arguments.length;
+switch (G__1619) {
+case 2:
+return cljs.core.fnil.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.fnil.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.fnil.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.fnil.cljs$core$IFn$_invoke$arity$2 = (function (f,x){
+return (function() {
+var G__1637 = null;
+var G__1637__1 = (function (a){
+var G__1620 = (((a == null))?x:a);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1620) : f.call(null,G__1620));
+});
+var G__1637__2 = (function (a,b){
+var G__1621 = (((a == null))?x:a);
+var G__1622 = b;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1621,G__1622) : f.call(null,G__1621,G__1622));
+});
+var G__1637__3 = (function (a,b,c){
+var G__1623 = (((a == null))?x:a);
+var G__1624 = b;
+var G__1625 = c;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1623,G__1624,G__1625) : f.call(null,G__1623,G__1624,G__1625));
+});
+var G__1637__4 = (function() { 
+var G__1638__delegate = function (a,b,c,ds){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,(((a == null))?x:a),b,c,ds);
+};
+var G__1638 = function (a,b,c,var_args){
+var ds = null;
+if (arguments.length > 3) {
+var G__1639__i = 0, G__1639__a = new Array(arguments.length -  3);
+while (G__1639__i < G__1639__a.length) {G__1639__a[G__1639__i] = arguments[G__1639__i + 3]; ++G__1639__i;}
+  ds = new cljs.core.IndexedSeq(G__1639__a,0,null);
+} 
+return G__1638__delegate.call(this,a,b,c,ds);};
+G__1638.cljs$lang$maxFixedArity = 3;
+G__1638.cljs$lang$applyTo = (function (arglist__1640){
+var a = cljs.core.first(arglist__1640);
+arglist__1640 = cljs.core.next(arglist__1640);
+var b = cljs.core.first(arglist__1640);
+arglist__1640 = cljs.core.next(arglist__1640);
+var c = cljs.core.first(arglist__1640);
+var ds = cljs.core.rest(arglist__1640);
+return G__1638__delegate(a,b,c,ds);
+});
+G__1638.cljs$core$IFn$_invoke$arity$variadic = G__1638__delegate;
+return G__1638;
+})()
+;
+G__1637 = function(a,b,c,var_args){
+var ds = var_args;
+switch(arguments.length){
+case 1:
+return G__1637__1.call(this,a);
+case 2:
+return G__1637__2.call(this,a,b);
+case 3:
+return G__1637__3.call(this,a,b,c);
+default:
+var G__1641 = null;
+if (arguments.length > 3) {
+var G__1642__i = 0, G__1642__a = new Array(arguments.length -  3);
+while (G__1642__i < G__1642__a.length) {G__1642__a[G__1642__i] = arguments[G__1642__i + 3]; ++G__1642__i;}
+G__1641 = new cljs.core.IndexedSeq(G__1642__a,0,null);
+}
+return G__1637__4.cljs$core$IFn$_invoke$arity$variadic(a,b,c, G__1641);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1637.cljs$lang$maxFixedArity = 3;
+G__1637.cljs$lang$applyTo = G__1637__4.cljs$lang$applyTo;
+G__1637.cljs$core$IFn$_invoke$arity$1 = G__1637__1;
+G__1637.cljs$core$IFn$_invoke$arity$2 = G__1637__2;
+G__1637.cljs$core$IFn$_invoke$arity$3 = G__1637__3;
+G__1637.cljs$core$IFn$_invoke$arity$variadic = G__1637__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1637;
+})()
+});
+
+cljs.core.fnil.cljs$core$IFn$_invoke$arity$3 = (function (f,x,y){
+return (function() {
+var G__1643 = null;
+var G__1643__2 = (function (a,b){
+var G__1626 = (((a == null))?x:a);
+var G__1627 = (((b == null))?y:b);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1626,G__1627) : f.call(null,G__1626,G__1627));
+});
+var G__1643__3 = (function (a,b,c){
+var G__1628 = (((a == null))?x:a);
+var G__1629 = (((b == null))?y:b);
+var G__1630 = c;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1628,G__1629,G__1630) : f.call(null,G__1628,G__1629,G__1630));
+});
+var G__1643__4 = (function() { 
+var G__1644__delegate = function (a,b,c,ds){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,(((a == null))?x:a),(((b == null))?y:b),c,ds);
+};
+var G__1644 = function (a,b,c,var_args){
+var ds = null;
+if (arguments.length > 3) {
+var G__1645__i = 0, G__1645__a = new Array(arguments.length -  3);
+while (G__1645__i < G__1645__a.length) {G__1645__a[G__1645__i] = arguments[G__1645__i + 3]; ++G__1645__i;}
+  ds = new cljs.core.IndexedSeq(G__1645__a,0,null);
+} 
+return G__1644__delegate.call(this,a,b,c,ds);};
+G__1644.cljs$lang$maxFixedArity = 3;
+G__1644.cljs$lang$applyTo = (function (arglist__1646){
+var a = cljs.core.first(arglist__1646);
+arglist__1646 = cljs.core.next(arglist__1646);
+var b = cljs.core.first(arglist__1646);
+arglist__1646 = cljs.core.next(arglist__1646);
+var c = cljs.core.first(arglist__1646);
+var ds = cljs.core.rest(arglist__1646);
+return G__1644__delegate(a,b,c,ds);
+});
+G__1644.cljs$core$IFn$_invoke$arity$variadic = G__1644__delegate;
+return G__1644;
+})()
+;
+G__1643 = function(a,b,c,var_args){
+var ds = var_args;
+switch(arguments.length){
+case 2:
+return G__1643__2.call(this,a,b);
+case 3:
+return G__1643__3.call(this,a,b,c);
+default:
+var G__1647 = null;
+if (arguments.length > 3) {
+var G__1648__i = 0, G__1648__a = new Array(arguments.length -  3);
+while (G__1648__i < G__1648__a.length) {G__1648__a[G__1648__i] = arguments[G__1648__i + 3]; ++G__1648__i;}
+G__1647 = new cljs.core.IndexedSeq(G__1648__a,0,null);
+}
+return G__1643__4.cljs$core$IFn$_invoke$arity$variadic(a,b,c, G__1647);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1643.cljs$lang$maxFixedArity = 3;
+G__1643.cljs$lang$applyTo = G__1643__4.cljs$lang$applyTo;
+G__1643.cljs$core$IFn$_invoke$arity$2 = G__1643__2;
+G__1643.cljs$core$IFn$_invoke$arity$3 = G__1643__3;
+G__1643.cljs$core$IFn$_invoke$arity$variadic = G__1643__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1643;
+})()
+});
+
+cljs.core.fnil.cljs$core$IFn$_invoke$arity$4 = (function (f,x,y,z){
+return (function() {
+var G__1649 = null;
+var G__1649__2 = (function (a,b){
+var G__1631 = (((a == null))?x:a);
+var G__1632 = (((b == null))?y:b);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1631,G__1632) : f.call(null,G__1631,G__1632));
+});
+var G__1649__3 = (function (a,b,c){
+var G__1633 = (((a == null))?x:a);
+var G__1634 = (((b == null))?y:b);
+var G__1635 = (((c == null))?z:c);
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1633,G__1634,G__1635) : f.call(null,G__1633,G__1634,G__1635));
+});
+var G__1649__4 = (function() { 
+var G__1650__delegate = function (a,b,c,ds){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,(((a == null))?x:a),(((b == null))?y:b),(((c == null))?z:c),ds);
+};
+var G__1650 = function (a,b,c,var_args){
+var ds = null;
+if (arguments.length > 3) {
+var G__1651__i = 0, G__1651__a = new Array(arguments.length -  3);
+while (G__1651__i < G__1651__a.length) {G__1651__a[G__1651__i] = arguments[G__1651__i + 3]; ++G__1651__i;}
+  ds = new cljs.core.IndexedSeq(G__1651__a,0,null);
+} 
+return G__1650__delegate.call(this,a,b,c,ds);};
+G__1650.cljs$lang$maxFixedArity = 3;
+G__1650.cljs$lang$applyTo = (function (arglist__1652){
+var a = cljs.core.first(arglist__1652);
+arglist__1652 = cljs.core.next(arglist__1652);
+var b = cljs.core.first(arglist__1652);
+arglist__1652 = cljs.core.next(arglist__1652);
+var c = cljs.core.first(arglist__1652);
+var ds = cljs.core.rest(arglist__1652);
+return G__1650__delegate(a,b,c,ds);
+});
+G__1650.cljs$core$IFn$_invoke$arity$variadic = G__1650__delegate;
+return G__1650;
+})()
+;
+G__1649 = function(a,b,c,var_args){
+var ds = var_args;
+switch(arguments.length){
+case 2:
+return G__1649__2.call(this,a,b);
+case 3:
+return G__1649__3.call(this,a,b,c);
+default:
+var G__1653 = null;
+if (arguments.length > 3) {
+var G__1654__i = 0, G__1654__a = new Array(arguments.length -  3);
+while (G__1654__i < G__1654__a.length) {G__1654__a[G__1654__i] = arguments[G__1654__i + 3]; ++G__1654__i;}
+G__1653 = new cljs.core.IndexedSeq(G__1654__a,0,null);
+}
+return G__1649__4.cljs$core$IFn$_invoke$arity$variadic(a,b,c, G__1653);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1649.cljs$lang$maxFixedArity = 3;
+G__1649.cljs$lang$applyTo = G__1649__4.cljs$lang$applyTo;
+G__1649.cljs$core$IFn$_invoke$arity$2 = G__1649__2;
+G__1649.cljs$core$IFn$_invoke$arity$3 = G__1649__3;
+G__1649.cljs$core$IFn$_invoke$arity$variadic = G__1649__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__1649;
+})()
+});
+
+cljs.core.fnil.cljs$lang$maxFixedArity = 4;
+
+/**
+ * Returns a lazy sequence consisting of the result of applying f to 0
+ *   and the first item of coll, followed by applying f to 1 and the second
+ *   item in coll, etc, until coll is exhausted. Thus function f should
+ *   accept 2 arguments, index and item. Returns a stateful transducer when
+ *   no collection is provided.
+ */
+cljs.core.map_indexed = (function cljs$core$map_indexed(var_args){
+var G__1656 = arguments.length;
+switch (G__1656) {
+case 1:
+return cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return (function (rf){
+var i = cljs.core.volatile_BANG_((-1));
+return ((function (i){
+return (function() {
+var G__1670 = null;
+var G__1670__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1670__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1670__2 = (function (result,input){
+var G__1657 = result;
+var G__1658 = (function (){var G__1659 = cljs.core._vreset_BANG_(i,(cljs.core._deref(i) + (1)));
+var G__1660 = input;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1659,G__1660) : f.call(null,G__1659,G__1660));
+})();
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(G__1657,G__1658) : rf.call(null,G__1657,G__1658));
+});
+G__1670 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1670__0.call(this);
+case 1:
+return G__1670__1.call(this,result);
+case 2:
+return G__1670__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1670.cljs$core$IFn$_invoke$arity$0 = G__1670__0;
+G__1670.cljs$core$IFn$_invoke$arity$1 = G__1670__1;
+G__1670.cljs$core$IFn$_invoke$arity$2 = G__1670__2;
+return G__1670;
+})()
+;})(i))
+});
+});
+
+cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+var mapi = (function cljs$core$mapi(idx,coll__$1){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll__$1);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s)){
+var c = cljs.core.chunk_first(s);
+var size = cljs.core.count(c);
+var b = cljs.core.chunk_buffer(size);
+var n__4395__auto___1671 = size;
+var i_1672 = (0);
+while(true){
+if((i_1672 < n__4395__auto___1671)){
+cljs.core.chunk_append(b,(function (){var G__1665 = (idx + i_1672);
+var G__1666 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1672);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1665,G__1666) : f.call(null,G__1665,G__1666));
+})());
+
+var G__1673 = (i_1672 + (1));
+i_1672 = G__1673;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core.chunk_cons(cljs.core.chunk(b),cljs$core$mapi((idx + size),cljs.core.chunk_rest(s)));
+} else {
+return cljs.core.cons((function (){var G__1667 = idx;
+var G__1668 = cljs.core.first(s);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1667,G__1668) : f.call(null,G__1667,G__1668));
+})(),cljs$core$mapi((idx + (1)),cljs.core.rest(s)));
+}
+} else {
+return null;
+}
+}),null,null));
+});
+return mapi((0),coll);
+});
+
+cljs.core.map_indexed.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a lazy sequence of the non-nil results of (f item). Note,
+ *   this means false return values will be included.  f must be free of
+ *   side-effects.  Returns a transducer when no collection is provided.
+ */
+cljs.core.keep = (function cljs$core$keep(var_args){
+var G__1675 = arguments.length;
+switch (G__1675) {
+case 1:
+return cljs.core.keep.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.keep.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.keep.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return (function (rf){
+return (function() {
+var G__1679 = null;
+var G__1679__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1679__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1679__2 = (function (result,input){
+var v = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(input) : f.call(null,input));
+if((v == null)){
+return result;
+} else {
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
+}
+});
+G__1679 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1679__0.call(this);
+case 1:
+return G__1679__1.call(this,result);
+case 2:
+return G__1679__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1679.cljs$core$IFn$_invoke$arity$0 = G__1679__0;
+G__1679.cljs$core$IFn$_invoke$arity$1 = G__1679__1;
+G__1679.cljs$core$IFn$_invoke$arity$2 = G__1679__2;
+return G__1679;
+})()
+});
+});
+
+cljs.core.keep.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s)){
+var c = cljs.core.chunk_first(s);
+var size = cljs.core.count(c);
+var b = cljs.core.chunk_buffer(size);
+var n__4395__auto___1680 = size;
+var i_1681 = (0);
+while(true){
+if((i_1681 < n__4395__auto___1680)){
+var x_1682 = (function (){var G__1676 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1681);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1676) : f.call(null,G__1676));
+})();
+if((x_1682 == null)){
+} else {
+cljs.core.chunk_append(b,x_1682);
+}
+
+var G__1683 = (i_1681 + (1));
+i_1681 = G__1683;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core.chunk_cons(cljs.core.chunk(b),cljs.core.keep.cljs$core$IFn$_invoke$arity$2(f,cljs.core.chunk_rest(s)));
+} else {
+var x = (function (){var G__1677 = cljs.core.first(s);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1677) : f.call(null,G__1677));
+})();
+if((x == null)){
+return cljs.core.keep.cljs$core$IFn$_invoke$arity$2(f,cljs.core.rest(s));
+} else {
+return cljs.core.cons(x,cljs.core.keep.cljs$core$IFn$_invoke$arity$2(f,cljs.core.rest(s)));
+}
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.keep.cljs$lang$maxFixedArity = 2;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IWatchable}
+ * @implements {cljs.core.IAtom}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IDeref}
+*/
+cljs.core.Atom = (function (state,meta,validator,watches){
+this.state = state;
+this.meta = meta;
+this.validator = validator;
+this.watches = watches;
+this.cljs$lang$protocol_mask$partition1$ = 16386;
+this.cljs$lang$protocol_mask$partition0$ = 6455296;
+});
+cljs.core.Atom.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.Atom.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
+var self__ = this;
+var o__$1 = this;
+return (o__$1 === other);
+});
+
+cljs.core.Atom.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.state;
+});
+
+cljs.core.Atom.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.meta;
+});
+
+cljs.core.Atom.prototype.cljs$core$IWatchable$_notify_watches$arity$3 = (function (this$,oldval,newval){
+var self__ = this;
+var this$__$1 = this;
+var seq__1684 = cljs.core.seq(self__.watches);
+var chunk__1685 = null;
+var count__1686 = (0);
+var i__1687 = (0);
+while(true){
+if((i__1687 < count__1686)){
+var vec__1688 = chunk__1685.cljs$core$IIndexed$_nth$arity$2(null,i__1687);
+var key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1688,(0),null);
+var f = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1688,(1),null);
+(f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(key,this$__$1,oldval,newval) : f.call(null,key,this$__$1,oldval,newval));
+
+
+var G__1694 = seq__1684;
+var G__1695 = chunk__1685;
+var G__1696 = count__1686;
+var G__1697 = (i__1687 + (1));
+seq__1684 = G__1694;
+chunk__1685 = G__1695;
+count__1686 = G__1696;
+i__1687 = G__1697;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__1684);
+if(temp__5457__auto__){
+var seq__1684__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__1684__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__1684__$1);
+var G__1698 = cljs.core.chunk_rest(seq__1684__$1);
+var G__1699 = c__4338__auto__;
+var G__1700 = cljs.core.count(c__4338__auto__);
+var G__1701 = (0);
+seq__1684 = G__1698;
+chunk__1685 = G__1699;
+count__1686 = G__1700;
+i__1687 = G__1701;
+continue;
+} else {
+var vec__1691 = cljs.core.first(seq__1684__$1);
+var key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1691,(0),null);
+var f = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1691,(1),null);
+(f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(key,this$__$1,oldval,newval) : f.call(null,key,this$__$1,oldval,newval));
+
+
+var G__1702 = cljs.core.next(seq__1684__$1);
+var G__1703 = null;
+var G__1704 = (0);
+var G__1705 = (0);
+seq__1684 = G__1702;
+chunk__1685 = G__1703;
+count__1686 = G__1704;
+i__1687 = G__1705;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+cljs.core.Atom.prototype.cljs$core$IWatchable$_add_watch$arity$3 = (function (this$,key,f){
+var self__ = this;
+var this$__$1 = this;
+this$__$1.watches = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.watches,key,f);
+
+return this$__$1;
+});
+
+cljs.core.Atom.prototype.cljs$core$IWatchable$_remove_watch$arity$2 = (function (this$,key){
+var self__ = this;
+var this$__$1 = this;
+return this$__$1.watches = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(self__.watches,key);
+});
+
+cljs.core.Atom.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return goog.getUid(this$__$1);
+});
+
+cljs.core.Atom.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$state,cljs.core.cst$sym$meta,cljs.core.cst$sym$validator,cljs.core.cst$sym$watches], null);
+});
+
+cljs.core.Atom.cljs$lang$type = true;
+
+cljs.core.Atom.cljs$lang$ctorStr = "cljs.core/Atom";
+
+cljs.core.Atom.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Atom");
+});
+
+/**
+ * Positional factory function for cljs.core/Atom.
+ */
+cljs.core.__GT_Atom = (function cljs$core$__GT_Atom(state,meta,validator,watches){
+return (new cljs.core.Atom(state,meta,validator,watches));
+});
+
+/**
+ * Creates and returns an Atom with an initial value of x and zero or
+ *   more options (in any order):
+ * 
+ *   :meta metadata-map
+ * 
+ *   :validator validate-fn
+ * 
+ *   If metadata-map is supplied, it will be come the metadata on the
+ *   atom. validate-fn must be nil or a side-effect-free fn of one
+ *   argument, which will be passed the intended new state on any state
+ *   change. If the new state is unacceptable, the validate-fn should
+ *   return false or throw an Error.  If either of these error conditions
+ *   occur, then the value of the atom will not change.
+ */
+cljs.core.atom = (function cljs$core$atom(var_args){
+var G__1709 = arguments.length;
+switch (G__1709) {
+case 1:
+return cljs.core.atom.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1714 = arguments.length;
+var i__4519__auto___1715 = (0);
+while(true){
+if((i__4519__auto___1715 < len__4518__auto___1714)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1715]));
+
+var G__1716 = (i__4519__auto___1715 + (1));
+i__4519__auto___1715 = G__1716;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((1)),(0),null));
+return cljs.core.atom.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.atom.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return (new cljs.core.Atom(x,null,null,null));
+});
+
+cljs.core.atom.cljs$core$IFn$_invoke$arity$variadic = (function (x,p__1710){
+var map__1711 = p__1710;
+var map__1711__$1 = ((((!((map__1711 == null)))?(((((map__1711.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1711.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1711):map__1711);
+var meta = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1711__$1,cljs.core.cst$kw$meta);
+var validator = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1711__$1,cljs.core.cst$kw$validator);
+return (new cljs.core.Atom(x,meta,validator,null));
+});
+
+/** @this {Function} */
+cljs.core.atom.cljs$lang$applyTo = (function (seq1707){
+var G__1708 = cljs.core.first(seq1707);
+var seq1707__$1 = cljs.core.next(seq1707);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1708,seq1707__$1);
+});
+
+cljs.core.atom.cljs$lang$maxFixedArity = (1);
+
+/**
+ * Sets the value of atom to newval without regard for the
+ *   current value. Returns new-value.
+ */
+cljs.core.reset_BANG_ = (function cljs$core$reset_BANG_(a,new_value){
+if((a instanceof cljs.core.Atom)){
+var validate = a.validator;
+if((validate == null)){
+} else {
+if(cljs.core.truth_((validate.cljs$core$IFn$_invoke$arity$1 ? validate.cljs$core$IFn$_invoke$arity$1(new_value) : validate.call(null,new_value)))){
+} else {
+throw (new Error("Validator rejected reference state"));
+}
+}
+
+var old_value = a.state;
+a.state = new_value;
+
+if((a.watches == null)){
+} else {
+cljs.core._notify_watches(a,old_value,new_value);
+}
+
+return new_value;
+} else {
+return cljs.core._reset_BANG_(a,new_value);
+}
+});
+/**
+ * Sets the value of atom to newval. Returns [old new], the value of the
+ * atom before and after the reset.
+ */
+cljs.core.reset_vals_BANG_ = (function cljs$core$reset_vals_BANG_(a,new_value){
+var validate = a.validator;
+if((validate == null)){
+} else {
+if(cljs.core.truth_((validate.cljs$core$IFn$_invoke$arity$1 ? validate.cljs$core$IFn$_invoke$arity$1(new_value) : validate.call(null,new_value)))){
+} else {
+throw (new Error("Validator rejected reference state"));
+}
+}
+
+var old_value = a.state;
+a.state = new_value;
+
+if((a.watches == null)){
+} else {
+cljs.core._notify_watches(a,old_value,new_value);
+}
+
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [old_value,new_value], null);
+});
+/**
+ * Atomically swaps the value of atom to be:
+ *   (apply f current-value-of-atom args). Note that f may be called
+ *   multiple times, and thus should be free of side effects.  Returns
+ *   the value that was swapped in.
+ */
+cljs.core.swap_BANG_ = (function cljs$core$swap_BANG_(var_args){
+var G__1723 = arguments.length;
+switch (G__1723) {
+case 2:
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1731 = arguments.length;
+var i__4519__auto___1732 = (0);
+while(true){
+if((i__4519__auto___1732 < len__4518__auto___1731)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1732]));
+
+var G__1733 = (i__4519__auto___1732 + (1));
+i__4519__auto___1732 = G__1733;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((4)),(0),null));
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (a,f){
+if((a instanceof cljs.core.Atom)){
+return cljs.core.reset_BANG_(a,(function (){var G__1724 = a.state;
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1724) : f.call(null,G__1724));
+})());
+} else {
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$2(a,f);
+}
+});
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (a,f,x){
+if((a instanceof cljs.core.Atom)){
+return cljs.core.reset_BANG_(a,(function (){var G__1725 = a.state;
+var G__1726 = x;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1725,G__1726) : f.call(null,G__1725,G__1726));
+})());
+} else {
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$3(a,f,x);
+}
+});
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4 = (function (a,f,x,y){
+if((a instanceof cljs.core.Atom)){
+return cljs.core.reset_BANG_(a,(function (){var G__1727 = a.state;
+var G__1728 = x;
+var G__1729 = y;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1727,G__1728,G__1729) : f.call(null,G__1727,G__1728,G__1729));
+})());
+} else {
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$4(a,f,x,y);
+}
+});
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (a,f,x,y,more){
+if((a instanceof cljs.core.Atom)){
+return cljs.core.reset_BANG_(a,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,a.state,x,y,more));
+} else {
+return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$5(a,f,x,y,more);
+}
+});
+
+/** @this {Function} */
+cljs.core.swap_BANG_.cljs$lang$applyTo = (function (seq1718){
+var G__1719 = cljs.core.first(seq1718);
+var seq1718__$1 = cljs.core.next(seq1718);
+var G__1720 = cljs.core.first(seq1718__$1);
+var seq1718__$2 = cljs.core.next(seq1718__$1);
+var G__1721 = cljs.core.first(seq1718__$2);
+var seq1718__$3 = cljs.core.next(seq1718__$2);
+var G__1722 = cljs.core.first(seq1718__$3);
+var seq1718__$4 = cljs.core.next(seq1718__$3);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1719,G__1720,G__1721,G__1722,seq1718__$4);
+});
+
+cljs.core.swap_BANG_.cljs$lang$maxFixedArity = (4);
+
+/**
+ * Atomically swaps the value of atom to be:
+ *   (apply f current-value-of-atom args). Note that f may be called
+ *   multiple times, and thus should be free of side effects.
+ *   Returns [old new], the value of the atom before and after the swap.
+ */
+cljs.core.swap_vals_BANG_ = (function cljs$core$swap_vals_BANG_(var_args){
+var G__1740 = arguments.length;
+switch (G__1740) {
+case 2:
+return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1748 = arguments.length;
+var i__4519__auto___1749 = (0);
+while(true){
+if((i__4519__auto___1749 < len__4518__auto___1748)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1749]));
+
+var G__1750 = (i__4519__auto___1749 + (1));
+i__4519__auto___1749 = G__1750;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((4)),(0),null));
+return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (a,f){
+return cljs.core.reset_vals_BANG_(a,(function (){var G__1741 = a.state;
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1741) : f.call(null,G__1741));
+})());
+});
+
+cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (a,f,x){
+return cljs.core.reset_vals_BANG_(a,(function (){var G__1742 = a.state;
+var G__1743 = x;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1742,G__1743) : f.call(null,G__1742,G__1743));
+})());
+});
+
+cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$4 = (function (a,f,x,y){
+return cljs.core.reset_vals_BANG_(a,(function (){var G__1744 = a.state;
+var G__1745 = x;
+var G__1746 = y;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1744,G__1745,G__1746) : f.call(null,G__1744,G__1745,G__1746));
+})());
+});
+
+cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (a,f,x,y,more){
+return cljs.core.reset_vals_BANG_(a,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,a.state,x,y,more));
+});
+
+/** @this {Function} */
+cljs.core.swap_vals_BANG_.cljs$lang$applyTo = (function (seq1735){
+var G__1736 = cljs.core.first(seq1735);
+var seq1735__$1 = cljs.core.next(seq1735);
+var G__1737 = cljs.core.first(seq1735__$1);
+var seq1735__$2 = cljs.core.next(seq1735__$1);
+var G__1738 = cljs.core.first(seq1735__$2);
+var seq1735__$3 = cljs.core.next(seq1735__$2);
+var G__1739 = cljs.core.first(seq1735__$3);
+var seq1735__$4 = cljs.core.next(seq1735__$3);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1736,G__1737,G__1738,G__1739,seq1735__$4);
+});
+
+cljs.core.swap_vals_BANG_.cljs$lang$maxFixedArity = (4);
+
+/**
+ * Atomically sets the value of atom to newval if and only if the
+ *   current value of the atom is equal to oldval. Returns true if
+ *   set happened, else false.
+ */
+cljs.core.compare_and_set_BANG_ = (function cljs$core$compare_and_set_BANG_(a,oldval,newval){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(a.cljs$core$IDeref$_deref$arity$1(null),oldval)){
+cljs.core.reset_BANG_(a,newval);
+
+return true;
+} else {
+return false;
+}
+});
+/**
+ * Sets the validator-fn for an atom. validator-fn must be nil or a
+ *   side-effect-free fn of one argument, which will be passed the intended
+ *   new state on any state change. If the new state is unacceptable, the
+ *   validator-fn should return false or throw an Error. If the current state
+ *   is not acceptable to the new validator, an Error will be thrown and the
+ *   validator will not be changed.
+ */
+cljs.core.set_validator_BANG_ = (function cljs$core$set_validator_BANG_(iref,val){
+if(((!((val == null))) && (cljs.core.not((function (){var G__1752 = cljs.core._deref(iref);
+return (val.cljs$core$IFn$_invoke$arity$1 ? val.cljs$core$IFn$_invoke$arity$1(G__1752) : val.call(null,G__1752));
+})())))){
+throw (new Error("Validator rejected reference state"));
+} else {
+}
+
+return iref.validator = val;
+});
+/**
+ * Gets the validator-fn for a var/ref/agent/atom.
+ */
+cljs.core.get_validator = (function cljs$core$get_validator(iref){
+return iref.validator;
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IVolatile}
+ * @implements {cljs.core.IDeref}
+*/
+cljs.core.Volatile = (function (state){
+this.state = state;
+this.cljs$lang$protocol_mask$partition0$ = 32768;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.Volatile.prototype.cljs$core$IVolatile$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Volatile.prototype.cljs$core$IVolatile$_vreset_BANG_$arity$2 = (function (_,new_state){
+var self__ = this;
+var ___$1 = this;
+return self__.state = new_state;
+});
+
+cljs.core.Volatile.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.state;
+});
+
+cljs.core.Volatile.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$state,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Volatile.cljs$lang$type = true;
+
+cljs.core.Volatile.cljs$lang$ctorStr = "cljs.core/Volatile";
+
+cljs.core.Volatile.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Volatile");
+});
+
+/**
+ * Positional factory function for cljs.core/Volatile.
+ */
+cljs.core.__GT_Volatile = (function cljs$core$__GT_Volatile(state){
+return (new cljs.core.Volatile(state));
+});
+
+/**
+ * Creates and returns a Volatile with an initial value of val.
+ */
+cljs.core.volatile_BANG_ = (function cljs$core$volatile_BANG_(val){
+return (new cljs.core.Volatile(val));
+});
+/**
+ * Returns true if x is a volatile.
+ */
+cljs.core.volatile_QMARK_ = (function cljs$core$volatile_QMARK_(x){
+return (x instanceof cljs.core.Volatile);
+});
+/**
+ * Sets the value of volatile to newval without regard for the
+ * current value. Returns newval.
+ */
+cljs.core.vreset_BANG_ = (function cljs$core$vreset_BANG_(vol,newval){
+return cljs.core._vreset_BANG_(vol,newval);
+});
+/**
+ * Returns a lazy sequence of the non-nil results of (f index item). Note,
+ *   this means false return values will be included.  f must be free of
+ *   side-effects.  Returns a stateful transducer when no collection is
+ *   provided.
+ */
+cljs.core.keep_indexed = (function cljs$core$keep_indexed(var_args){
+var G__1754 = arguments.length;
+switch (G__1754) {
+case 1:
+return cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return (function (rf){
+var ia = cljs.core.volatile_BANG_((-1));
+return ((function (ia){
+return (function() {
+var G__1764 = null;
+var G__1764__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1764__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1764__2 = (function (result,input){
+var i = cljs.core._vreset_BANG_(ia,(cljs.core._deref(ia) + (1)));
+var v = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(i,input) : f.call(null,i,input));
+if((v == null)){
+return result;
+} else {
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
+}
+});
+G__1764 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1764__0.call(this);
+case 1:
+return G__1764__1.call(this,result);
+case 2:
+return G__1764__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1764.cljs$core$IFn$_invoke$arity$0 = G__1764__0;
+G__1764.cljs$core$IFn$_invoke$arity$1 = G__1764__1;
+G__1764.cljs$core$IFn$_invoke$arity$2 = G__1764__2;
+return G__1764;
+})()
+;})(ia))
+});
+});
+
+cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+var keepi = (function cljs$core$keepi(idx,coll__$1){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll__$1);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s)){
+var c = cljs.core.chunk_first(s);
+var size = cljs.core.count(c);
+var b = cljs.core.chunk_buffer(size);
+var n__4395__auto___1765 = size;
+var i_1766 = (0);
+while(true){
+if((i_1766 < n__4395__auto___1765)){
+var x_1767 = (function (){var G__1759 = (idx + i_1766);
+var G__1760 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1766);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1759,G__1760) : f.call(null,G__1759,G__1760));
+})();
+if((x_1767 == null)){
+} else {
+cljs.core.chunk_append(b,x_1767);
+}
+
+var G__1768 = (i_1766 + (1));
+i_1766 = G__1768;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core.chunk_cons(cljs.core.chunk(b),cljs$core$keepi((idx + size),cljs.core.chunk_rest(s)));
+} else {
+var x = (function (){var G__1761 = idx;
+var G__1762 = cljs.core.first(s);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1761,G__1762) : f.call(null,G__1761,G__1762));
+})();
+if((x == null)){
+return cljs$core$keepi((idx + (1)),cljs.core.rest(s));
+} else {
+return cljs.core.cons(x,cljs$core$keepi((idx + (1)),cljs.core.rest(s)));
+}
+}
+} else {
+return null;
+}
+}),null,null));
+});
+return keepi((0),coll);
+});
+
+cljs.core.keep_indexed.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Takes a set of predicates and returns a function f that returns true if all of its
+ *   composing predicates return a logical true value against all of its arguments, else it returns
+ *   false. Note that f is short-circuiting in that it will stop execution on the first
+ *   argument that triggers a logical false result against the original predicates.
+ */
+cljs.core.every_pred = (function cljs$core$every_pred(var_args){
+var G__1780 = arguments.length;
+switch (G__1780) {
+case 1:
+return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1782 = arguments.length;
+var i__4519__auto___1783 = (0);
+while(true){
+if((i__4519__auto___1783 < len__4518__auto___1782)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1783]));
+
+var G__1784 = (i__4519__auto___1783 + (1));
+i__4519__auto___1783 = G__1784;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.every_pred.cljs$core$IFn$_invoke$arity$1 = (function (p){
+return (function() {
+var cljs$core$ep1 = null;
+var cljs$core$ep1__0 = (function (){
+return true;
+});
+var cljs$core$ep1__1 = (function (x){
+return cljs.core.boolean$((p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x)));
+});
+var cljs$core$ep1__2 = (function (x,y){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep1__3 = (function (x,y,z){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+var and__3925__auto____$1 = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$1)){
+return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(z) : p.call(null,z));
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep1__4 = (function() { 
+var G__1785__delegate = function (x,y,z,args){
+return cljs.core.boolean$((function (){var and__3925__auto__ = cljs$core$ep1.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(and__3925__auto__)){
+return cljs.core.every_QMARK_(p,args);
+} else {
+return and__3925__auto__;
+}
+})());
+};
+var G__1785 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1786__i = 0, G__1786__a = new Array(arguments.length -  3);
+while (G__1786__i < G__1786__a.length) {G__1786__a[G__1786__i] = arguments[G__1786__i + 3]; ++G__1786__i;}
+  args = new cljs.core.IndexedSeq(G__1786__a,0,null);
+} 
+return G__1785__delegate.call(this,x,y,z,args);};
+G__1785.cljs$lang$maxFixedArity = 3;
+G__1785.cljs$lang$applyTo = (function (arglist__1787){
+var x = cljs.core.first(arglist__1787);
+arglist__1787 = cljs.core.next(arglist__1787);
+var y = cljs.core.first(arglist__1787);
+arglist__1787 = cljs.core.next(arglist__1787);
+var z = cljs.core.first(arglist__1787);
+var args = cljs.core.rest(arglist__1787);
+return G__1785__delegate(x,y,z,args);
+});
+G__1785.cljs$core$IFn$_invoke$arity$variadic = G__1785__delegate;
+return G__1785;
+})()
+;
+cljs$core$ep1 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$ep1__0.call(this);
+case 1:
+return cljs$core$ep1__1.call(this,x);
+case 2:
+return cljs$core$ep1__2.call(this,x,y);
+case 3:
+return cljs$core$ep1__3.call(this,x,y,z);
+default:
+var G__1788 = null;
+if (arguments.length > 3) {
+var G__1789__i = 0, G__1789__a = new Array(arguments.length -  3);
+while (G__1789__i < G__1789__a.length) {G__1789__a[G__1789__i] = arguments[G__1789__i + 3]; ++G__1789__i;}
+G__1788 = new cljs.core.IndexedSeq(G__1789__a,0,null);
+}
+return cljs$core$ep1__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1788);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$ep1.cljs$lang$maxFixedArity = 3;
+cljs$core$ep1.cljs$lang$applyTo = cljs$core$ep1__4.cljs$lang$applyTo;
+cljs$core$ep1.cljs$core$IFn$_invoke$arity$0 = cljs$core$ep1__0;
+cljs$core$ep1.cljs$core$IFn$_invoke$arity$1 = cljs$core$ep1__1;
+cljs$core$ep1.cljs$core$IFn$_invoke$arity$2 = cljs$core$ep1__2;
+cljs$core$ep1.cljs$core$IFn$_invoke$arity$3 = cljs$core$ep1__3;
+cljs$core$ep1.cljs$core$IFn$_invoke$arity$variadic = cljs$core$ep1__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$ep1;
+})()
+});
+
+cljs.core.every_pred.cljs$core$IFn$_invoke$arity$2 = (function (p1,p2){
+return (function() {
+var cljs$core$ep2 = null;
+var cljs$core$ep2__0 = (function (){
+return true;
+});
+var cljs$core$ep2__1 = (function (x){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep2__2 = (function (x,y){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+var and__3925__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$1)){
+var and__3925__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(and__3925__auto____$2)){
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+} else {
+return and__3925__auto____$2;
+}
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep2__3 = (function (x,y,z){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+var and__3925__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$1)){
+var and__3925__auto____$2 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
+if(cljs.core.truth_(and__3925__auto____$2)){
+var and__3925__auto____$3 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(and__3925__auto____$3)){
+var and__3925__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$4)){
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
+} else {
+return and__3925__auto____$4;
+}
+} else {
+return and__3925__auto____$3;
+}
+} else {
+return and__3925__auto____$2;
+}
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep2__4 = (function() { 
+var G__1790__delegate = function (x,y,z,args){
+return cljs.core.boolean$((function (){var and__3925__auto__ = cljs$core$ep2.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(and__3925__auto__)){
+return cljs.core.every_QMARK_(((function (and__3925__auto__){
+return (function (p1__1769_SHARP_){
+var and__3925__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1769_SHARP_) : p1.call(null,p1__1769_SHARP_));
+if(cljs.core.truth_(and__3925__auto____$1)){
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1769_SHARP_) : p2.call(null,p1__1769_SHARP_));
+} else {
+return and__3925__auto____$1;
+}
+});})(and__3925__auto__))
+,args);
+} else {
+return and__3925__auto__;
+}
+})());
+};
+var G__1790 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1791__i = 0, G__1791__a = new Array(arguments.length -  3);
+while (G__1791__i < G__1791__a.length) {G__1791__a[G__1791__i] = arguments[G__1791__i + 3]; ++G__1791__i;}
+  args = new cljs.core.IndexedSeq(G__1791__a,0,null);
+} 
+return G__1790__delegate.call(this,x,y,z,args);};
+G__1790.cljs$lang$maxFixedArity = 3;
+G__1790.cljs$lang$applyTo = (function (arglist__1792){
+var x = cljs.core.first(arglist__1792);
+arglist__1792 = cljs.core.next(arglist__1792);
+var y = cljs.core.first(arglist__1792);
+arglist__1792 = cljs.core.next(arglist__1792);
+var z = cljs.core.first(arglist__1792);
+var args = cljs.core.rest(arglist__1792);
+return G__1790__delegate(x,y,z,args);
+});
+G__1790.cljs$core$IFn$_invoke$arity$variadic = G__1790__delegate;
+return G__1790;
+})()
+;
+cljs$core$ep2 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$ep2__0.call(this);
+case 1:
+return cljs$core$ep2__1.call(this,x);
+case 2:
+return cljs$core$ep2__2.call(this,x,y);
+case 3:
+return cljs$core$ep2__3.call(this,x,y,z);
+default:
+var G__1793 = null;
+if (arguments.length > 3) {
+var G__1794__i = 0, G__1794__a = new Array(arguments.length -  3);
+while (G__1794__i < G__1794__a.length) {G__1794__a[G__1794__i] = arguments[G__1794__i + 3]; ++G__1794__i;}
+G__1793 = new cljs.core.IndexedSeq(G__1794__a,0,null);
+}
+return cljs$core$ep2__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1793);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$ep2.cljs$lang$maxFixedArity = 3;
+cljs$core$ep2.cljs$lang$applyTo = cljs$core$ep2__4.cljs$lang$applyTo;
+cljs$core$ep2.cljs$core$IFn$_invoke$arity$0 = cljs$core$ep2__0;
+cljs$core$ep2.cljs$core$IFn$_invoke$arity$1 = cljs$core$ep2__1;
+cljs$core$ep2.cljs$core$IFn$_invoke$arity$2 = cljs$core$ep2__2;
+cljs$core$ep2.cljs$core$IFn$_invoke$arity$3 = cljs$core$ep2__3;
+cljs$core$ep2.cljs$core$IFn$_invoke$arity$variadic = cljs$core$ep2__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$ep2;
+})()
+});
+
+cljs.core.every_pred.cljs$core$IFn$_invoke$arity$3 = (function (p1,p2,p3){
+return (function() {
+var cljs$core$ep3 = null;
+var cljs$core$ep3__0 = (function (){
+return true;
+});
+var cljs$core$ep3__1 = (function (x){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+var and__3925__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(and__3925__auto____$1)){
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep3__2 = (function (x,y){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+var and__3925__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(and__3925__auto____$1)){
+var and__3925__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
+if(cljs.core.truth_(and__3925__auto____$2)){
+var and__3925__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$3)){
+var and__3925__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$4)){
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
+} else {
+return and__3925__auto____$4;
+}
+} else {
+return and__3925__auto____$3;
+}
+} else {
+return and__3925__auto____$2;
+}
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep3__3 = (function (x,y,z){
+return cljs.core.boolean$((function (){var and__3925__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+var and__3925__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(and__3925__auto____$1)){
+var and__3925__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
+if(cljs.core.truth_(and__3925__auto____$2)){
+var and__3925__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$3)){
+var and__3925__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$4)){
+var and__3925__auto____$5 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$5)){
+var and__3925__auto____$6 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
+if(cljs.core.truth_(and__3925__auto____$6)){
+var and__3925__auto____$7 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
+if(cljs.core.truth_(and__3925__auto____$7)){
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(z) : p3.call(null,z));
+} else {
+return and__3925__auto____$7;
+}
+} else {
+return and__3925__auto____$6;
+}
+} else {
+return and__3925__auto____$5;
+}
+} else {
+return and__3925__auto____$4;
+}
+} else {
+return and__3925__auto____$3;
+}
+} else {
+return and__3925__auto____$2;
+}
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})());
+});
+var cljs$core$ep3__4 = (function() { 
+var G__1795__delegate = function (x,y,z,args){
+return cljs.core.boolean$((function (){var and__3925__auto__ = cljs$core$ep3.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(and__3925__auto__)){
+return cljs.core.every_QMARK_(((function (and__3925__auto__){
+return (function (p1__1770_SHARP_){
+var and__3925__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1770_SHARP_) : p1.call(null,p1__1770_SHARP_));
+if(cljs.core.truth_(and__3925__auto____$1)){
+var and__3925__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1770_SHARP_) : p2.call(null,p1__1770_SHARP_));
+if(cljs.core.truth_(and__3925__auto____$2)){
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(p1__1770_SHARP_) : p3.call(null,p1__1770_SHARP_));
+} else {
+return and__3925__auto____$2;
+}
+} else {
+return and__3925__auto____$1;
+}
+});})(and__3925__auto__))
+,args);
+} else {
+return and__3925__auto__;
+}
+})());
+};
+var G__1795 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1796__i = 0, G__1796__a = new Array(arguments.length -  3);
+while (G__1796__i < G__1796__a.length) {G__1796__a[G__1796__i] = arguments[G__1796__i + 3]; ++G__1796__i;}
+  args = new cljs.core.IndexedSeq(G__1796__a,0,null);
+} 
+return G__1795__delegate.call(this,x,y,z,args);};
+G__1795.cljs$lang$maxFixedArity = 3;
+G__1795.cljs$lang$applyTo = (function (arglist__1797){
+var x = cljs.core.first(arglist__1797);
+arglist__1797 = cljs.core.next(arglist__1797);
+var y = cljs.core.first(arglist__1797);
+arglist__1797 = cljs.core.next(arglist__1797);
+var z = cljs.core.first(arglist__1797);
+var args = cljs.core.rest(arglist__1797);
+return G__1795__delegate(x,y,z,args);
+});
+G__1795.cljs$core$IFn$_invoke$arity$variadic = G__1795__delegate;
+return G__1795;
+})()
+;
+cljs$core$ep3 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$ep3__0.call(this);
+case 1:
+return cljs$core$ep3__1.call(this,x);
+case 2:
+return cljs$core$ep3__2.call(this,x,y);
+case 3:
+return cljs$core$ep3__3.call(this,x,y,z);
+default:
+var G__1798 = null;
+if (arguments.length > 3) {
+var G__1799__i = 0, G__1799__a = new Array(arguments.length -  3);
+while (G__1799__i < G__1799__a.length) {G__1799__a[G__1799__i] = arguments[G__1799__i + 3]; ++G__1799__i;}
+G__1798 = new cljs.core.IndexedSeq(G__1799__a,0,null);
+}
+return cljs$core$ep3__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1798);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$ep3.cljs$lang$maxFixedArity = 3;
+cljs$core$ep3.cljs$lang$applyTo = cljs$core$ep3__4.cljs$lang$applyTo;
+cljs$core$ep3.cljs$core$IFn$_invoke$arity$0 = cljs$core$ep3__0;
+cljs$core$ep3.cljs$core$IFn$_invoke$arity$1 = cljs$core$ep3__1;
+cljs$core$ep3.cljs$core$IFn$_invoke$arity$2 = cljs$core$ep3__2;
+cljs$core$ep3.cljs$core$IFn$_invoke$arity$3 = cljs$core$ep3__3;
+cljs$core$ep3.cljs$core$IFn$_invoke$arity$variadic = cljs$core$ep3__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$ep3;
+})()
+});
+
+cljs.core.every_pred.cljs$core$IFn$_invoke$arity$variadic = (function (p1,p2,p3,ps){
+var ps__$1 = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(p1,p2,p3,ps);
+return ((function (ps__$1){
+return (function() {
+var cljs$core$epn = null;
+var cljs$core$epn__0 = (function (){
+return true;
+});
+var cljs$core$epn__1 = (function (x){
+return cljs.core.every_QMARK_(((function (ps__$1){
+return (function (p1__1771_SHARP_){
+return (p1__1771_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1771_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1771_SHARP_.call(null,x));
+});})(ps__$1))
+,ps__$1);
+});
+var cljs$core$epn__2 = (function (x,y){
+return cljs.core.every_QMARK_(((function (ps__$1){
+return (function (p1__1772_SHARP_){
+var and__3925__auto__ = (p1__1772_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1772_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1772_SHARP_.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+return (p1__1772_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1772_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1772_SHARP_.call(null,y));
+} else {
+return and__3925__auto__;
+}
+});})(ps__$1))
+,ps__$1);
+});
+var cljs$core$epn__3 = (function (x,y,z){
+return cljs.core.every_QMARK_(((function (ps__$1){
+return (function (p1__1773_SHARP_){
+var and__3925__auto__ = (p1__1773_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1773_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1773_SHARP_.call(null,x));
+if(cljs.core.truth_(and__3925__auto__)){
+var and__3925__auto____$1 = (p1__1773_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1773_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1773_SHARP_.call(null,y));
+if(cljs.core.truth_(and__3925__auto____$1)){
+return (p1__1773_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1773_SHARP_.cljs$core$IFn$_invoke$arity$1(z) : p1__1773_SHARP_.call(null,z));
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+});})(ps__$1))
+,ps__$1);
+});
+var cljs$core$epn__4 = (function() { 
+var G__1800__delegate = function (x,y,z,args){
+return cljs.core.boolean$((function (){var and__3925__auto__ = cljs$core$epn.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(and__3925__auto__)){
+return cljs.core.every_QMARK_(((function (and__3925__auto__,ps__$1){
+return (function (p1__1774_SHARP_){
+return cljs.core.every_QMARK_(p1__1774_SHARP_,args);
+});})(and__3925__auto__,ps__$1))
+,ps__$1);
+} else {
+return and__3925__auto__;
+}
+})());
+};
+var G__1800 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1801__i = 0, G__1801__a = new Array(arguments.length -  3);
+while (G__1801__i < G__1801__a.length) {G__1801__a[G__1801__i] = arguments[G__1801__i + 3]; ++G__1801__i;}
+  args = new cljs.core.IndexedSeq(G__1801__a,0,null);
+} 
+return G__1800__delegate.call(this,x,y,z,args);};
+G__1800.cljs$lang$maxFixedArity = 3;
+G__1800.cljs$lang$applyTo = (function (arglist__1802){
+var x = cljs.core.first(arglist__1802);
+arglist__1802 = cljs.core.next(arglist__1802);
+var y = cljs.core.first(arglist__1802);
+arglist__1802 = cljs.core.next(arglist__1802);
+var z = cljs.core.first(arglist__1802);
+var args = cljs.core.rest(arglist__1802);
+return G__1800__delegate(x,y,z,args);
+});
+G__1800.cljs$core$IFn$_invoke$arity$variadic = G__1800__delegate;
+return G__1800;
+})()
+;
+cljs$core$epn = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$epn__0.call(this);
+case 1:
+return cljs$core$epn__1.call(this,x);
+case 2:
+return cljs$core$epn__2.call(this,x,y);
+case 3:
+return cljs$core$epn__3.call(this,x,y,z);
+default:
+var G__1803 = null;
+if (arguments.length > 3) {
+var G__1804__i = 0, G__1804__a = new Array(arguments.length -  3);
+while (G__1804__i < G__1804__a.length) {G__1804__a[G__1804__i] = arguments[G__1804__i + 3]; ++G__1804__i;}
+G__1803 = new cljs.core.IndexedSeq(G__1804__a,0,null);
+}
+return cljs$core$epn__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1803);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$epn.cljs$lang$maxFixedArity = 3;
+cljs$core$epn.cljs$lang$applyTo = cljs$core$epn__4.cljs$lang$applyTo;
+cljs$core$epn.cljs$core$IFn$_invoke$arity$0 = cljs$core$epn__0;
+cljs$core$epn.cljs$core$IFn$_invoke$arity$1 = cljs$core$epn__1;
+cljs$core$epn.cljs$core$IFn$_invoke$arity$2 = cljs$core$epn__2;
+cljs$core$epn.cljs$core$IFn$_invoke$arity$3 = cljs$core$epn__3;
+cljs$core$epn.cljs$core$IFn$_invoke$arity$variadic = cljs$core$epn__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$epn;
+})()
+;})(ps__$1))
+});
+
+/** @this {Function} */
+cljs.core.every_pred.cljs$lang$applyTo = (function (seq1776){
+var G__1777 = cljs.core.first(seq1776);
+var seq1776__$1 = cljs.core.next(seq1776);
+var G__1778 = cljs.core.first(seq1776__$1);
+var seq1776__$2 = cljs.core.next(seq1776__$1);
+var G__1779 = cljs.core.first(seq1776__$2);
+var seq1776__$3 = cljs.core.next(seq1776__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1777,G__1778,G__1779,seq1776__$3);
+});
+
+cljs.core.every_pred.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Takes a set of predicates and returns a function f that returns the first logical true value
+ *   returned by one of its composing predicates against any of its arguments, else it returns
+ *   logical false. Note that f is short-circuiting in that it will stop execution on the first
+ *   argument that triggers a logical true result against the original predicates.
+ */
+cljs.core.some_fn = (function cljs$core$some_fn(var_args){
+var G__1816 = arguments.length;
+switch (G__1816) {
+case 1:
+return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1818 = arguments.length;
+var i__4519__auto___1819 = (0);
+while(true){
+if((i__4519__auto___1819 < len__4518__auto___1818)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1819]));
+
+var G__1820 = (i__4519__auto___1819 + (1));
+i__4519__auto___1819 = G__1820;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.some_fn.cljs$core$IFn$_invoke$arity$1 = (function (p){
+return (function() {
+var cljs$core$sp1 = null;
+var cljs$core$sp1__0 = (function (){
+return null;
+});
+var cljs$core$sp1__1 = (function (x){
+return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
+});
+var cljs$core$sp1__2 = (function (x,y){
+var or__3936__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
+}
+});
+var cljs$core$sp1__3 = (function (x,y,z){
+var or__3936__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(z) : p.call(null,z));
+}
+}
+});
+var cljs$core$sp1__4 = (function() { 
+var G__1821__delegate = function (x,y,z,args){
+var or__3936__auto__ = cljs$core$sp1.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.some(p,args);
+}
+};
+var G__1821 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1822__i = 0, G__1822__a = new Array(arguments.length -  3);
+while (G__1822__i < G__1822__a.length) {G__1822__a[G__1822__i] = arguments[G__1822__i + 3]; ++G__1822__i;}
+  args = new cljs.core.IndexedSeq(G__1822__a,0,null);
+} 
+return G__1821__delegate.call(this,x,y,z,args);};
+G__1821.cljs$lang$maxFixedArity = 3;
+G__1821.cljs$lang$applyTo = (function (arglist__1823){
+var x = cljs.core.first(arglist__1823);
+arglist__1823 = cljs.core.next(arglist__1823);
+var y = cljs.core.first(arglist__1823);
+arglist__1823 = cljs.core.next(arglist__1823);
+var z = cljs.core.first(arglist__1823);
+var args = cljs.core.rest(arglist__1823);
+return G__1821__delegate(x,y,z,args);
+});
+G__1821.cljs$core$IFn$_invoke$arity$variadic = G__1821__delegate;
+return G__1821;
+})()
+;
+cljs$core$sp1 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$sp1__0.call(this);
+case 1:
+return cljs$core$sp1__1.call(this,x);
+case 2:
+return cljs$core$sp1__2.call(this,x,y);
+case 3:
+return cljs$core$sp1__3.call(this,x,y,z);
+default:
+var G__1824 = null;
+if (arguments.length > 3) {
+var G__1825__i = 0, G__1825__a = new Array(arguments.length -  3);
+while (G__1825__i < G__1825__a.length) {G__1825__a[G__1825__i] = arguments[G__1825__i + 3]; ++G__1825__i;}
+G__1824 = new cljs.core.IndexedSeq(G__1825__a,0,null);
+}
+return cljs$core$sp1__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1824);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$sp1.cljs$lang$maxFixedArity = 3;
+cljs$core$sp1.cljs$lang$applyTo = cljs$core$sp1__4.cljs$lang$applyTo;
+cljs$core$sp1.cljs$core$IFn$_invoke$arity$0 = cljs$core$sp1__0;
+cljs$core$sp1.cljs$core$IFn$_invoke$arity$1 = cljs$core$sp1__1;
+cljs$core$sp1.cljs$core$IFn$_invoke$arity$2 = cljs$core$sp1__2;
+cljs$core$sp1.cljs$core$IFn$_invoke$arity$3 = cljs$core$sp1__3;
+cljs$core$sp1.cljs$core$IFn$_invoke$arity$variadic = cljs$core$sp1__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$sp1;
+})()
+});
+
+cljs.core.some_fn.cljs$core$IFn$_invoke$arity$2 = (function (p1,p2){
+return (function() {
+var cljs$core$sp2 = null;
+var cljs$core$sp2__0 = (function (){
+return null;
+});
+var cljs$core$sp2__1 = (function (x){
+var or__3936__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+}
+});
+var cljs$core$sp2__2 = (function (x,y){
+var or__3936__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(or__3936__auto____$2)){
+return or__3936__auto____$2;
+} else {
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+}
+}
+}
+});
+var cljs$core$sp2__3 = (function (x,y,z){
+var or__3936__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
+if(cljs.core.truth_(or__3936__auto____$2)){
+return or__3936__auto____$2;
+} else {
+var or__3936__auto____$3 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(or__3936__auto____$3)){
+return or__3936__auto____$3;
+} else {
+var or__3936__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$4)){
+return or__3936__auto____$4;
+} else {
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
+}
+}
+}
+}
+}
+});
+var cljs$core$sp2__4 = (function() { 
+var G__1826__delegate = function (x,y,z,args){
+var or__3936__auto__ = cljs$core$sp2.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.some(((function (or__3936__auto__){
+return (function (p1__1805_SHARP_){
+var or__3936__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1805_SHARP_) : p1.call(null,p1__1805_SHARP_));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1805_SHARP_) : p2.call(null,p1__1805_SHARP_));
+}
+});})(or__3936__auto__))
+,args);
+}
+};
+var G__1826 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1827__i = 0, G__1827__a = new Array(arguments.length -  3);
+while (G__1827__i < G__1827__a.length) {G__1827__a[G__1827__i] = arguments[G__1827__i + 3]; ++G__1827__i;}
+  args = new cljs.core.IndexedSeq(G__1827__a,0,null);
+} 
+return G__1826__delegate.call(this,x,y,z,args);};
+G__1826.cljs$lang$maxFixedArity = 3;
+G__1826.cljs$lang$applyTo = (function (arglist__1828){
+var x = cljs.core.first(arglist__1828);
+arglist__1828 = cljs.core.next(arglist__1828);
+var y = cljs.core.first(arglist__1828);
+arglist__1828 = cljs.core.next(arglist__1828);
+var z = cljs.core.first(arglist__1828);
+var args = cljs.core.rest(arglist__1828);
+return G__1826__delegate(x,y,z,args);
+});
+G__1826.cljs$core$IFn$_invoke$arity$variadic = G__1826__delegate;
+return G__1826;
+})()
+;
+cljs$core$sp2 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$sp2__0.call(this);
+case 1:
+return cljs$core$sp2__1.call(this,x);
+case 2:
+return cljs$core$sp2__2.call(this,x,y);
+case 3:
+return cljs$core$sp2__3.call(this,x,y,z);
+default:
+var G__1829 = null;
+if (arguments.length > 3) {
+var G__1830__i = 0, G__1830__a = new Array(arguments.length -  3);
+while (G__1830__i < G__1830__a.length) {G__1830__a[G__1830__i] = arguments[G__1830__i + 3]; ++G__1830__i;}
+G__1829 = new cljs.core.IndexedSeq(G__1830__a,0,null);
+}
+return cljs$core$sp2__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1829);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$sp2.cljs$lang$maxFixedArity = 3;
+cljs$core$sp2.cljs$lang$applyTo = cljs$core$sp2__4.cljs$lang$applyTo;
+cljs$core$sp2.cljs$core$IFn$_invoke$arity$0 = cljs$core$sp2__0;
+cljs$core$sp2.cljs$core$IFn$_invoke$arity$1 = cljs$core$sp2__1;
+cljs$core$sp2.cljs$core$IFn$_invoke$arity$2 = cljs$core$sp2__2;
+cljs$core$sp2.cljs$core$IFn$_invoke$arity$3 = cljs$core$sp2__3;
+cljs$core$sp2.cljs$core$IFn$_invoke$arity$variadic = cljs$core$sp2__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$sp2;
+})()
+});
+
+cljs.core.some_fn.cljs$core$IFn$_invoke$arity$3 = (function (p1,p2,p3){
+return (function() {
+var cljs$core$sp3 = null;
+var cljs$core$sp3__0 = (function (){
+return null;
+});
+var cljs$core$sp3__1 = (function (x){
+var or__3936__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
+}
+}
+});
+var cljs$core$sp3__2 = (function (x,y){
+var or__3936__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
+if(cljs.core.truth_(or__3936__auto____$2)){
+return or__3936__auto____$2;
+} else {
+var or__3936__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$3)){
+return or__3936__auto____$3;
+} else {
+var or__3936__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$4)){
+return or__3936__auto____$4;
+} else {
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
+}
+}
+}
+}
+}
+});
+var cljs$core$sp3__3 = (function (x,y,z){
+var or__3936__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
+if(cljs.core.truth_(or__3936__auto____$2)){
+return or__3936__auto____$2;
+} else {
+var or__3936__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$3)){
+return or__3936__auto____$3;
+} else {
+var or__3936__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$4)){
+return or__3936__auto____$4;
+} else {
+var or__3936__auto____$5 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$5)){
+return or__3936__auto____$5;
+} else {
+var or__3936__auto____$6 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
+if(cljs.core.truth_(or__3936__auto____$6)){
+return or__3936__auto____$6;
+} else {
+var or__3936__auto____$7 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
+if(cljs.core.truth_(or__3936__auto____$7)){
+return or__3936__auto____$7;
+} else {
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(z) : p3.call(null,z));
+}
+}
+}
+}
+}
+}
+}
+}
+});
+var cljs$core$sp3__4 = (function() { 
+var G__1831__delegate = function (x,y,z,args){
+var or__3936__auto__ = cljs$core$sp3.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.some(((function (or__3936__auto__){
+return (function (p1__1806_SHARP_){
+var or__3936__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1806_SHARP_) : p1.call(null,p1__1806_SHARP_));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1806_SHARP_) : p2.call(null,p1__1806_SHARP_));
+if(cljs.core.truth_(or__3936__auto____$2)){
+return or__3936__auto____$2;
+} else {
+return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(p1__1806_SHARP_) : p3.call(null,p1__1806_SHARP_));
+}
+}
+});})(or__3936__auto__))
+,args);
+}
+};
+var G__1831 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1832__i = 0, G__1832__a = new Array(arguments.length -  3);
+while (G__1832__i < G__1832__a.length) {G__1832__a[G__1832__i] = arguments[G__1832__i + 3]; ++G__1832__i;}
+  args = new cljs.core.IndexedSeq(G__1832__a,0,null);
+} 
+return G__1831__delegate.call(this,x,y,z,args);};
+G__1831.cljs$lang$maxFixedArity = 3;
+G__1831.cljs$lang$applyTo = (function (arglist__1833){
+var x = cljs.core.first(arglist__1833);
+arglist__1833 = cljs.core.next(arglist__1833);
+var y = cljs.core.first(arglist__1833);
+arglist__1833 = cljs.core.next(arglist__1833);
+var z = cljs.core.first(arglist__1833);
+var args = cljs.core.rest(arglist__1833);
+return G__1831__delegate(x,y,z,args);
+});
+G__1831.cljs$core$IFn$_invoke$arity$variadic = G__1831__delegate;
+return G__1831;
+})()
+;
+cljs$core$sp3 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$sp3__0.call(this);
+case 1:
+return cljs$core$sp3__1.call(this,x);
+case 2:
+return cljs$core$sp3__2.call(this,x,y);
+case 3:
+return cljs$core$sp3__3.call(this,x,y,z);
+default:
+var G__1834 = null;
+if (arguments.length > 3) {
+var G__1835__i = 0, G__1835__a = new Array(arguments.length -  3);
+while (G__1835__i < G__1835__a.length) {G__1835__a[G__1835__i] = arguments[G__1835__i + 3]; ++G__1835__i;}
+G__1834 = new cljs.core.IndexedSeq(G__1835__a,0,null);
+}
+return cljs$core$sp3__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1834);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$sp3.cljs$lang$maxFixedArity = 3;
+cljs$core$sp3.cljs$lang$applyTo = cljs$core$sp3__4.cljs$lang$applyTo;
+cljs$core$sp3.cljs$core$IFn$_invoke$arity$0 = cljs$core$sp3__0;
+cljs$core$sp3.cljs$core$IFn$_invoke$arity$1 = cljs$core$sp3__1;
+cljs$core$sp3.cljs$core$IFn$_invoke$arity$2 = cljs$core$sp3__2;
+cljs$core$sp3.cljs$core$IFn$_invoke$arity$3 = cljs$core$sp3__3;
+cljs$core$sp3.cljs$core$IFn$_invoke$arity$variadic = cljs$core$sp3__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$sp3;
+})()
+});
+
+cljs.core.some_fn.cljs$core$IFn$_invoke$arity$variadic = (function (p1,p2,p3,ps){
+var ps__$1 = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(p1,p2,p3,ps);
+return ((function (ps__$1){
+return (function() {
+var cljs$core$spn = null;
+var cljs$core$spn__0 = (function (){
+return null;
+});
+var cljs$core$spn__1 = (function (x){
+return cljs.core.some(((function (ps__$1){
+return (function (p1__1807_SHARP_){
+return (p1__1807_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1807_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1807_SHARP_.call(null,x));
+});})(ps__$1))
+,ps__$1);
+});
+var cljs$core$spn__2 = (function (x,y){
+return cljs.core.some(((function (ps__$1){
+return (function (p1__1808_SHARP_){
+var or__3936__auto__ = (p1__1808_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1808_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1808_SHARP_.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return (p1__1808_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1808_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1808_SHARP_.call(null,y));
+}
+});})(ps__$1))
+,ps__$1);
+});
+var cljs$core$spn__3 = (function (x,y,z){
+return cljs.core.some(((function (ps__$1){
+return (function (p1__1809_SHARP_){
+var or__3936__auto__ = (p1__1809_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1809_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1809_SHARP_.call(null,x));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (p1__1809_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1809_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1809_SHARP_.call(null,y));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+return (p1__1809_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1809_SHARP_.cljs$core$IFn$_invoke$arity$1(z) : p1__1809_SHARP_.call(null,z));
+}
+}
+});})(ps__$1))
+,ps__$1);
+});
+var cljs$core$spn__4 = (function() { 
+var G__1836__delegate = function (x,y,z,args){
+var or__3936__auto__ = cljs$core$spn.cljs$core$IFn$_invoke$arity$3(x,y,z);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.some(((function (or__3936__auto__,ps__$1){
+return (function (p1__1810_SHARP_){
+return cljs.core.some(p1__1810_SHARP_,args);
+});})(or__3936__auto__,ps__$1))
+,ps__$1);
+}
+};
+var G__1836 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__1837__i = 0, G__1837__a = new Array(arguments.length -  3);
+while (G__1837__i < G__1837__a.length) {G__1837__a[G__1837__i] = arguments[G__1837__i + 3]; ++G__1837__i;}
+  args = new cljs.core.IndexedSeq(G__1837__a,0,null);
+} 
+return G__1836__delegate.call(this,x,y,z,args);};
+G__1836.cljs$lang$maxFixedArity = 3;
+G__1836.cljs$lang$applyTo = (function (arglist__1838){
+var x = cljs.core.first(arglist__1838);
+arglist__1838 = cljs.core.next(arglist__1838);
+var y = cljs.core.first(arglist__1838);
+arglist__1838 = cljs.core.next(arglist__1838);
+var z = cljs.core.first(arglist__1838);
+var args = cljs.core.rest(arglist__1838);
+return G__1836__delegate(x,y,z,args);
+});
+G__1836.cljs$core$IFn$_invoke$arity$variadic = G__1836__delegate;
+return G__1836;
+})()
+;
+cljs$core$spn = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return cljs$core$spn__0.call(this);
+case 1:
+return cljs$core$spn__1.call(this,x);
+case 2:
+return cljs$core$spn__2.call(this,x,y);
+case 3:
+return cljs$core$spn__3.call(this,x,y,z);
+default:
+var G__1839 = null;
+if (arguments.length > 3) {
+var G__1840__i = 0, G__1840__a = new Array(arguments.length -  3);
+while (G__1840__i < G__1840__a.length) {G__1840__a[G__1840__i] = arguments[G__1840__i + 3]; ++G__1840__i;}
+G__1839 = new cljs.core.IndexedSeq(G__1840__a,0,null);
+}
+return cljs$core$spn__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1839);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+cljs$core$spn.cljs$lang$maxFixedArity = 3;
+cljs$core$spn.cljs$lang$applyTo = cljs$core$spn__4.cljs$lang$applyTo;
+cljs$core$spn.cljs$core$IFn$_invoke$arity$0 = cljs$core$spn__0;
+cljs$core$spn.cljs$core$IFn$_invoke$arity$1 = cljs$core$spn__1;
+cljs$core$spn.cljs$core$IFn$_invoke$arity$2 = cljs$core$spn__2;
+cljs$core$spn.cljs$core$IFn$_invoke$arity$3 = cljs$core$spn__3;
+cljs$core$spn.cljs$core$IFn$_invoke$arity$variadic = cljs$core$spn__4.cljs$core$IFn$_invoke$arity$variadic;
+return cljs$core$spn;
+})()
+;})(ps__$1))
+});
+
+/** @this {Function} */
+cljs.core.some_fn.cljs$lang$applyTo = (function (seq1812){
+var G__1813 = cljs.core.first(seq1812);
+var seq1812__$1 = cljs.core.next(seq1812);
+var G__1814 = cljs.core.first(seq1812__$1);
+var seq1812__$2 = cljs.core.next(seq1812__$1);
+var G__1815 = cljs.core.first(seq1812__$2);
+var seq1812__$3 = cljs.core.next(seq1812__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1813,G__1814,G__1815,seq1812__$3);
+});
+
+cljs.core.some_fn.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Returns a lazy sequence consisting of the result of applying f to
+ *   the set of first items of each coll, followed by applying f to the
+ *   set of second items in each coll, until any one of the colls is
+ *   exhausted.  Any remaining items in other colls are ignored. Function
+ *   f should accept number-of-colls arguments. Returns a transducer when
+ *   no collection is provided.
+ */
+cljs.core.map = (function cljs$core$map(var_args){
+var G__1848 = arguments.length;
+switch (G__1848) {
+case 1:
+return cljs.core.map.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.map.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.map.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1861 = arguments.length;
+var i__4519__auto___1862 = (0);
+while(true){
+if((i__4519__auto___1862 < len__4518__auto___1861)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1862]));
+
+var G__1863 = (i__4519__auto___1862 + (1));
+i__4519__auto___1862 = G__1863;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((4)),(0),null));
+return cljs.core.map.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.map.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return (function (rf){
+return (function() {
+var G__1864 = null;
+var G__1864__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1864__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1864__2 = (function (result,input){
+var G__1849 = result;
+var G__1850 = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(input) : f.call(null,input));
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(G__1849,G__1850) : rf.call(null,G__1849,G__1850));
+});
+var G__1864__3 = (function() { 
+var G__1865__delegate = function (result,input,inputs){
+var G__1851 = result;
+var G__1852 = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(f,input,inputs);
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(G__1851,G__1852) : rf.call(null,G__1851,G__1852));
+};
+var G__1865 = function (result,input,var_args){
+var inputs = null;
+if (arguments.length > 2) {
+var G__1866__i = 0, G__1866__a = new Array(arguments.length -  2);
+while (G__1866__i < G__1866__a.length) {G__1866__a[G__1866__i] = arguments[G__1866__i + 2]; ++G__1866__i;}
+  inputs = new cljs.core.IndexedSeq(G__1866__a,0,null);
+} 
+return G__1865__delegate.call(this,result,input,inputs);};
+G__1865.cljs$lang$maxFixedArity = 2;
+G__1865.cljs$lang$applyTo = (function (arglist__1867){
+var result = cljs.core.first(arglist__1867);
+arglist__1867 = cljs.core.next(arglist__1867);
+var input = cljs.core.first(arglist__1867);
+var inputs = cljs.core.rest(arglist__1867);
+return G__1865__delegate(result,input,inputs);
+});
+G__1865.cljs$core$IFn$_invoke$arity$variadic = G__1865__delegate;
+return G__1865;
+})()
+;
+G__1864 = function(result,input,var_args){
+var inputs = var_args;
+switch(arguments.length){
+case 0:
+return G__1864__0.call(this);
+case 1:
+return G__1864__1.call(this,result);
+case 2:
+return G__1864__2.call(this,result,input);
+default:
+var G__1868 = null;
+if (arguments.length > 2) {
+var G__1869__i = 0, G__1869__a = new Array(arguments.length -  2);
+while (G__1869__i < G__1869__a.length) {G__1869__a[G__1869__i] = arguments[G__1869__i + 2]; ++G__1869__i;}
+G__1868 = new cljs.core.IndexedSeq(G__1869__a,0,null);
+}
+return G__1864__3.cljs$core$IFn$_invoke$arity$variadic(result,input, G__1868);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1864.cljs$lang$maxFixedArity = 2;
+G__1864.cljs$lang$applyTo = G__1864__3.cljs$lang$applyTo;
+G__1864.cljs$core$IFn$_invoke$arity$0 = G__1864__0;
+G__1864.cljs$core$IFn$_invoke$arity$1 = G__1864__1;
+G__1864.cljs$core$IFn$_invoke$arity$2 = G__1864__2;
+G__1864.cljs$core$IFn$_invoke$arity$variadic = G__1864__3.cljs$core$IFn$_invoke$arity$variadic;
+return G__1864;
+})()
+});
+});
+
+cljs.core.map.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s)){
+var c = cljs.core.chunk_first(s);
+var size = cljs.core.count(c);
+var b = cljs.core.chunk_buffer(size);
+var n__4395__auto___1870 = size;
+var i_1871 = (0);
+while(true){
+if((i_1871 < n__4395__auto___1870)){
+cljs.core.chunk_append(b,(function (){var G__1853 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1871);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1853) : f.call(null,G__1853));
+})());
+
+var G__1872 = (i_1871 + (1));
+i_1871 = G__1872;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core.chunk_cons(cljs.core.chunk(b),cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,cljs.core.chunk_rest(s)));
+} else {
+return cljs.core.cons((function (){var G__1854 = cljs.core.first(s);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1854) : f.call(null,G__1854));
+})(),cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,cljs.core.rest(s)));
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.map.cljs$core$IFn$_invoke$arity$3 = (function (f,c1,c2){
+return (new cljs.core.LazySeq(null,(function (){
+var s1 = cljs.core.seq(c1);
+var s2 = cljs.core.seq(c2);
+if(((s1) && (s2))){
+return cljs.core.cons((function (){var G__1855 = cljs.core.first(s1);
+var G__1856 = cljs.core.first(s2);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1855,G__1856) : f.call(null,G__1855,G__1856));
+})(),cljs.core.map.cljs$core$IFn$_invoke$arity$3(f,cljs.core.rest(s1),cljs.core.rest(s2)));
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.map.cljs$core$IFn$_invoke$arity$4 = (function (f,c1,c2,c3){
+return (new cljs.core.LazySeq(null,(function (){
+var s1 = cljs.core.seq(c1);
+var s2 = cljs.core.seq(c2);
+var s3 = cljs.core.seq(c3);
+if(((s1) && (s2) && (s3))){
+return cljs.core.cons((function (){var G__1857 = cljs.core.first(s1);
+var G__1858 = cljs.core.first(s2);
+var G__1859 = cljs.core.first(s3);
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1857,G__1858,G__1859) : f.call(null,G__1857,G__1858,G__1859));
+})(),cljs.core.map.cljs$core$IFn$_invoke$arity$4(f,cljs.core.rest(s1),cljs.core.rest(s2),cljs.core.rest(s3)));
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.map.cljs$core$IFn$_invoke$arity$variadic = (function (f,c1,c2,c3,colls){
+var step = (function cljs$core$step(cs){
+return (new cljs.core.LazySeq(null,(function (){
+var ss = cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.seq,cs);
+if(cljs.core.every_QMARK_(cljs.core.identity,ss)){
+return cljs.core.cons(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.first,ss),cljs$core$step(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.rest,ss)));
+} else {
+return null;
+}
+}),null,null));
+});
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (step){
+return (function (p1__1841_SHARP_){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(f,p1__1841_SHARP_);
+});})(step))
+,step(cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(colls,c3,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([c2,c1], 0))));
+});
+
+/** @this {Function} */
+cljs.core.map.cljs$lang$applyTo = (function (seq1843){
+var G__1844 = cljs.core.first(seq1843);
+var seq1843__$1 = cljs.core.next(seq1843);
+var G__1845 = cljs.core.first(seq1843__$1);
+var seq1843__$2 = cljs.core.next(seq1843__$1);
+var G__1846 = cljs.core.first(seq1843__$2);
+var seq1843__$3 = cljs.core.next(seq1843__$2);
+var G__1847 = cljs.core.first(seq1843__$3);
+var seq1843__$4 = cljs.core.next(seq1843__$3);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1844,G__1845,G__1846,G__1847,seq1843__$4);
+});
+
+cljs.core.map.cljs$lang$maxFixedArity = (4);
+
+/**
+ * Returns a lazy sequence of the first n items in coll, or all items if
+ *   there are fewer than n.  Returns a stateful transducer when
+ *   no collection is provided.
+ */
+cljs.core.take = (function cljs$core$take(var_args){
+var G__1874 = arguments.length;
+switch (G__1874) {
+case 1:
+return cljs.core.take.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.take.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.take.cljs$core$IFn$_invoke$arity$1 = (function (n){
+if(typeof n === 'number'){
+} else {
+throw (new Error("Assert failed: (number? n)"));
+}
+
+return (function (rf){
+var na = cljs.core.volatile_BANG_(n);
+return ((function (na){
+return (function() {
+var G__1876 = null;
+var G__1876__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1876__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1876__2 = (function (result,input){
+var n__$1 = cljs.core.deref(na);
+var nn = cljs.core._vreset_BANG_(na,(cljs.core._deref(na) - (1)));
+var result__$1 = (((n__$1 > (0)))?(rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input)):result);
+if(!((nn > (0)))){
+return cljs.core.ensure_reduced(result__$1);
+} else {
+return result__$1;
+}
+});
+G__1876 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1876__0.call(this);
+case 1:
+return G__1876__1.call(this,result);
+case 2:
+return G__1876__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1876.cljs$core$IFn$_invoke$arity$0 = G__1876__0;
+G__1876.cljs$core$IFn$_invoke$arity$1 = G__1876__1;
+G__1876.cljs$core$IFn$_invoke$arity$2 = G__1876__2;
+return G__1876;
+})()
+;})(na))
+});
+});
+
+cljs.core.take.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
+if(typeof n === 'number'){
+} else {
+throw (new Error("Assert failed: (number? n)"));
+}
+
+return (new cljs.core.LazySeq(null,(function (){
+if((n > (0))){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+return cljs.core.cons(cljs.core.first(s),cljs.core.take.cljs$core$IFn$_invoke$arity$2((n - (1)),cljs.core.rest(s)));
+} else {
+return null;
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.take.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a lazy sequence of all but the first n items in coll.
+ *   Returns a stateful transducer when no collection is provided.
+ */
+cljs.core.drop = (function cljs$core$drop(var_args){
+var G__1878 = arguments.length;
+switch (G__1878) {
+case 1:
+return cljs.core.drop.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.drop.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.drop.cljs$core$IFn$_invoke$arity$1 = (function (n){
+if(typeof n === 'number'){
+} else {
+throw (new Error("Assert failed: (number? n)"));
+}
+
+return (function (rf){
+var na = cljs.core.volatile_BANG_(n);
+return ((function (na){
+return (function() {
+var G__1880 = null;
+var G__1880__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1880__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1880__2 = (function (result,input){
+var n__$1 = cljs.core.deref(na);
+cljs.core._vreset_BANG_(na,(cljs.core._deref(na) - (1)));
+
+if((n__$1 > (0))){
+return result;
+} else {
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+}
+});
+G__1880 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1880__0.call(this);
+case 1:
+return G__1880__1.call(this,result);
+case 2:
+return G__1880__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1880.cljs$core$IFn$_invoke$arity$0 = G__1880__0;
+G__1880.cljs$core$IFn$_invoke$arity$1 = G__1880__1;
+G__1880.cljs$core$IFn$_invoke$arity$2 = G__1880__2;
+return G__1880;
+})()
+;})(na))
+});
+});
+
+cljs.core.drop.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
+if(typeof n === 'number'){
+} else {
+throw (new Error("Assert failed: (number? n)"));
+}
+
+var step = (function (n__$1,coll__$1){
+while(true){
+var s = cljs.core.seq(coll__$1);
+if((((n__$1 > (0))) && (s))){
+var G__1881 = (n__$1 - (1));
+var G__1882 = cljs.core.rest(s);
+n__$1 = G__1881;
+coll__$1 = G__1882;
+continue;
+} else {
+return s;
+}
+break;
+}
+});
+return (new cljs.core.LazySeq(null,((function (step){
+return (function (){
+return step(n,coll);
+});})(step))
+,null,null));
+});
+
+cljs.core.drop.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Return a lazy sequence of all but the last n (default 1) items in coll
+ */
+cljs.core.drop_last = (function cljs$core$drop_last(var_args){
+var G__1884 = arguments.length;
+switch (G__1884) {
+case 1:
+return cljs.core.drop_last.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.drop_last.cljs$core$IFn$_invoke$arity$1 = (function (s){
+return cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2((1),s);
+});
+
+cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2 = (function (n,s){
+return cljs.core.map.cljs$core$IFn$_invoke$arity$3((function (x,_){
+return x;
+}),s,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,s));
+});
+
+cljs.core.drop_last.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a seq of the last n items in coll.  Depending on the type
+ *   of coll may be no better than linear time.  For vectors, see also subvec.
+ */
+cljs.core.take_last = (function cljs$core$take_last(n,coll){
+var s = cljs.core.seq(coll);
+var lead = cljs.core.seq(cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,coll));
+while(true){
+if(lead){
+var G__1886 = cljs.core.next(s);
+var G__1887 = cljs.core.next(lead);
+s = G__1886;
+lead = G__1887;
+continue;
+} else {
+return s;
+}
+break;
+}
+});
+/**
+ * Returns a lazy sequence of the items in coll starting from the
+ *   first item for which (pred item) returns logical false.  Returns a
+ *   stateful transducer when no collection is provided.
+ */
+cljs.core.drop_while = (function cljs$core$drop_while(var_args){
+var G__1889 = arguments.length;
+switch (G__1889) {
+case 1:
+return cljs.core.drop_while.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.drop_while.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.drop_while.cljs$core$IFn$_invoke$arity$1 = (function (pred){
+return (function (rf){
+var da = cljs.core.volatile_BANG_(true);
+return ((function (da){
+return (function() {
+var G__1893 = null;
+var G__1893__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1893__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1893__2 = (function (result,input){
+var drop_QMARK_ = cljs.core.deref(da);
+if(cljs.core.truth_((function (){var and__3925__auto__ = drop_QMARK_;
+if(cljs.core.truth_(and__3925__auto__)){
+return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input));
+} else {
+return and__3925__auto__;
+}
+})())){
+return result;
+} else {
+cljs.core.vreset_BANG_(da,null);
+
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+}
+});
+G__1893 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1893__0.call(this);
+case 1:
+return G__1893__1.call(this,result);
+case 2:
+return G__1893__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1893.cljs$core$IFn$_invoke$arity$0 = G__1893__0;
+G__1893.cljs$core$IFn$_invoke$arity$1 = G__1893__1;
+G__1893.cljs$core$IFn$_invoke$arity$2 = G__1893__2;
+return G__1893;
+})()
+;})(da))
+});
+});
+
+cljs.core.drop_while.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
+var step = (function (pred__$1,coll__$1){
+while(true){
+var s = cljs.core.seq(coll__$1);
+if(cljs.core.truth_((function (){var and__3925__auto__ = s;
+if(and__3925__auto__){
+var G__1891 = cljs.core.first(s);
+return (pred__$1.cljs$core$IFn$_invoke$arity$1 ? pred__$1.cljs$core$IFn$_invoke$arity$1(G__1891) : pred__$1.call(null,G__1891));
+} else {
+return and__3925__auto__;
+}
+})())){
+var G__1894 = pred__$1;
+var G__1895 = cljs.core.rest(s);
+pred__$1 = G__1894;
+coll__$1 = G__1895;
+continue;
+} else {
+return s;
+}
+break;
+}
+});
+return (new cljs.core.LazySeq(null,((function (step){
+return (function (){
+return step(pred,coll);
+});})(step))
+,null,null));
+});
+
+cljs.core.drop_while.cljs$lang$maxFixedArity = 2;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IPending}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.Cycle = (function (meta,all,prev,current,_next){
+this.meta = meta;
+this.all = all;
+this.prev = prev;
+this.current = current;
+this._next = _next;
+this.cljs$lang$protocol_mask$partition0$ = 26083532;
+this.cljs$lang$protocol_mask$partition1$ = 1;
+});
+cljs.core.Cycle.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.Cycle.prototype.currentval = (function (){
+var self__ = this;
+var coll = this;
+if(self__.current){
+} else {
+var temp__5455__auto___1900 = cljs.core.next(self__.prev);
+if(temp__5455__auto___1900){
+var c_1901 = temp__5455__auto___1900;
+self__.current = c_1901;
+} else {
+self__.current = self__.all;
+}
+}
+
+return self__.current;
+});
+
+cljs.core.Cycle.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.Cycle.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ISeq$_rest$arity$1(null);
+});
+
+cljs.core.Cycle.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.Cycle.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return !((self__.current == null));
+});
+
+cljs.core.Cycle.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+var s = coll__$1.currentval();
+var ret = cljs.core.first(s);
+while(true){
+var s__$1 = (function (){var or__3936__auto__ = cljs.core.next(s);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return self__.all;
+}
+})();
+var ret__$1 = (function (){var G__1896 = ret;
+var G__1897 = cljs.core.first(s__$1);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1896,G__1897) : f.call(null,G__1896,G__1897));
+})();
+if(cljs.core.reduced_QMARK_(ret__$1)){
+return cljs.core.deref(ret__$1);
+} else {
+var G__1902 = s__$1;
+var G__1903 = ret__$1;
+s = G__1902;
+ret = G__1903;
+continue;
+}
+break;
+}
+});
+
+cljs.core.Cycle.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+var s = coll__$1.currentval();
+var ret = start;
+while(true){
+var ret__$1 = (function (){var G__1898 = ret;
+var G__1899 = cljs.core.first(s);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1898,G__1899) : f.call(null,G__1898,G__1899));
+})();
+if(cljs.core.reduced_QMARK_(ret__$1)){
+return cljs.core.deref(ret__$1);
+} else {
+var G__1904 = (function (){var or__3936__auto__ = cljs.core.next(s);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return self__.all;
+}
+})();
+var G__1905 = ret__$1;
+s = G__1904;
+ret = G__1905;
+continue;
+}
+break;
+}
+});
+
+cljs.core.Cycle.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.first(coll__$1.currentval());
+});
+
+cljs.core.Cycle.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__._next == null)){
+self__._next = (new cljs.core.Cycle(null,self__.all,coll__$1.currentval(),null,null));
+} else {
+}
+
+return self__._next;
+});
+
+cljs.core.Cycle.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.Cycle.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.Cycle(meta__$1,self__.all,self__.prev,self__.current,self__._next));
+});
+
+cljs.core.Cycle.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.Cycle.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$all,cljs.core.cst$sym$prev,cljs.core.with_meta(cljs.core.cst$sym$current,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$_next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Cycle.cljs$lang$type = true;
+
+cljs.core.Cycle.cljs$lang$ctorStr = "cljs.core/Cycle";
+
+cljs.core.Cycle.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Cycle");
+});
+
+/**
+ * Positional factory function for cljs.core/Cycle.
+ */
+cljs.core.__GT_Cycle = (function cljs$core$__GT_Cycle(meta,all,prev,current,_next){
+return (new cljs.core.Cycle(meta,all,prev,current,_next));
+});
+
+/**
+ * Returns a lazy (infinite!) sequence of repetitions of the items in coll.
+ */
+cljs.core.cycle = (function cljs$core$cycle(coll){
+var temp__5455__auto__ = cljs.core.seq(coll);
+if(temp__5455__auto__){
+var vals = temp__5455__auto__;
+return (new cljs.core.Cycle(null,vals,null,vals,null));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+/**
+ * Returns a vector of [(take n coll) (drop n coll)]
+ */
+cljs.core.split_at = (function cljs$core$split_at(n,coll){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,coll),cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,coll)], null);
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IPending}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.Repeat = (function (meta,count,val,next,__hash){
+this.meta = meta;
+this.count = count;
+this.val = val;
+this.next = next;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 32374988;
+this.cljs$lang$protocol_mask$partition1$ = 1;
+});
+cljs.core.Repeat.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.Repeat.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.Repeat.prototype.indexOf = (function() {
+var G__1906 = null;
+var G__1906__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__1906__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1906 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1906__1.call(this,x);
+case 2:
+return G__1906__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1906.cljs$core$IFn$_invoke$arity$1 = G__1906__1;
+G__1906.cljs$core$IFn$_invoke$arity$2 = G__1906__2;
+return G__1906;
+})()
+;
+
+cljs.core.Repeat.prototype.lastIndexOf = (function() {
+var G__1907 = null;
+var G__1907__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,self__.count);
+});
+var G__1907__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__1907 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__1907__1.call(this,x);
+case 2:
+return G__1907__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1907.cljs$core$IFn$_invoke$arity$1 = G__1907__1;
+G__1907.cljs$core$IFn$_invoke$arity$2 = G__1907__2;
+return G__1907;
+})()
+;
+
+cljs.core.Repeat.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.Repeat.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.next == null)){
+if((self__.count > (1))){
+self__.next = (new cljs.core.Repeat(null,(self__.count - (1)),self__.val,null,null));
+
+return self__.next;
+} else {
+if(((-1) === self__.count)){
+return coll__$1;
+} else {
+return null;
+}
+}
+} else {
+return self__.next;
+}
+});
+
+cljs.core.Repeat.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.Repeat.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.Repeat.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.Repeat.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return false;
+});
+
+cljs.core.Repeat.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+if((self__.count === (-1))){
+var ret = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(self__.val,self__.val) : f.call(null,self__.val,self__.val));
+while(true){
+if(cljs.core.reduced_QMARK_(ret)){
+return cljs.core.deref(ret);
+} else {
+var G__1908 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
+ret = G__1908;
+continue;
+}
+break;
+}
+} else {
+var i = (1);
+var ret = self__.val;
+while(true){
+if((i < self__.count)){
+var ret__$1 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
+if(cljs.core.reduced_QMARK_(ret__$1)){
+return cljs.core.deref(ret__$1);
+} else {
+var G__1909 = (i + (1));
+var G__1910 = ret__$1;
+i = G__1909;
+ret = G__1910;
+continue;
+}
+} else {
+return ret;
+}
+break;
+}
+}
+});
+
+cljs.core.Repeat.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+if((self__.count === (-1))){
+var ret = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(start,self__.val) : f.call(null,start,self__.val));
+while(true){
+if(cljs.core.reduced_QMARK_(ret)){
+return cljs.core.deref(ret);
+} else {
+var G__1911 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
+ret = G__1911;
+continue;
+}
+break;
+}
+} else {
+var i = (0);
+var ret = start;
+while(true){
+if((i < self__.count)){
+var ret__$1 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
+if(cljs.core.reduced_QMARK_(ret__$1)){
+return cljs.core.deref(ret__$1);
+} else {
+var G__1912 = (i + (1));
+var G__1913 = ret__$1;
+i = G__1912;
+ret = G__1913;
+continue;
+}
+} else {
+return ret;
+}
+break;
+}
+}
+});
+
+cljs.core.Repeat.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.val;
+});
+
+cljs.core.Repeat.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.next == null)){
+if((self__.count > (1))){
+self__.next = (new cljs.core.Repeat(null,(self__.count - (1)),self__.val,null,null));
+
+return self__.next;
+} else {
+if(((-1) === self__.count)){
+return coll__$1;
+} else {
+return cljs.core.List.EMPTY;
+}
+}
+} else {
+return self__.next;
+}
+});
+
+cljs.core.Repeat.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.Repeat.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.Repeat(meta__$1,self__.count,self__.val,self__.next,null));
+});
+
+cljs.core.Repeat.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.Repeat.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$count,cljs.core.cst$sym$val,cljs.core.with_meta(cljs.core.cst$sym$next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Repeat.cljs$lang$type = true;
+
+cljs.core.Repeat.cljs$lang$ctorStr = "cljs.core/Repeat";
+
+cljs.core.Repeat.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Repeat");
+});
+
+/**
+ * Positional factory function for cljs.core/Repeat.
+ */
+cljs.core.__GT_Repeat = (function cljs$core$__GT_Repeat(meta,count,val,next,__hash){
+return (new cljs.core.Repeat(meta,count,val,next,__hash));
+});
+
+/**
+ * Returns a lazy (infinite!, or length n if supplied) sequence of xs.
+ */
+cljs.core.repeat = (function cljs$core$repeat(var_args){
+var G__1915 = arguments.length;
+switch (G__1915) {
+case 1:
+return cljs.core.repeat.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.repeat.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.repeat.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return (new cljs.core.Repeat(null,(-1),x,null,null));
+});
+
+cljs.core.repeat.cljs$core$IFn$_invoke$arity$2 = (function (n,x){
+if((n > (0))){
+return (new cljs.core.Repeat(null,n,x,null,null));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.repeat.cljs$lang$maxFixedArity = 2;
+
+/**
+ * DEPRECATED: Use 'repeat' instead.
+ *   Returns a lazy seq of n xs.
+ */
+cljs.core.replicate = (function cljs$core$replicate(n,x){
+return cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.repeat.cljs$core$IFn$_invoke$arity$1(x));
+});
+/**
+ * Takes a function of no args, presumably with side effects, and
+ *   returns an infinite (or length n if supplied) lazy sequence of calls
+ *   to it
+ */
+cljs.core.repeatedly = (function cljs$core$repeatedly(var_args){
+var G__1918 = arguments.length;
+switch (G__1918) {
+case 1:
+return cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return (new cljs.core.LazySeq(null,(function (){
+return cljs.core.cons((f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1(f));
+}),null,null));
+});
+
+cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$2 = (function (n,f){
+return cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1(f));
+});
+
+cljs.core.repeatedly.cljs$lang$maxFixedArity = 2;
+
+cljs.core.UNREALIZED_SEED = ({});
+
+/**
+* @constructor
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IPending}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.Iterate = (function (meta,f,prev_seed,seed,next){
+this.meta = meta;
+this.f = f;
+this.prev_seed = prev_seed;
+this.seed = seed;
+this.next = next;
+this.cljs$lang$protocol_mask$partition0$ = 26083532;
+this.cljs$lang$protocol_mask$partition1$ = 1;
+});
+cljs.core.Iterate.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.Iterate.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.Iterate.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ISeq$_rest$arity$1(null);
+});
+
+cljs.core.Iterate.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.Iterate.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return !((self__.seed === cljs.core.UNREALIZED_SEED));
+});
+
+cljs.core.Iterate.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,rf){
+var self__ = this;
+var coll__$1 = this;
+var first = coll__$1.cljs$core$ISeq$_first$arity$1(null);
+var v = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(first) : self__.f.call(null,first));
+var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(first,v) : rf.call(null,first,v));
+var v__$1 = v;
+while(true){
+if(cljs.core.reduced_QMARK_(ret)){
+return cljs.core.deref(ret);
+} else {
+var v__$2 = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(v__$1) : self__.f.call(null,v__$1));
+var G__1920 = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(ret,v__$2) : rf.call(null,ret,v__$2));
+var G__1921 = v__$2;
+ret = G__1920;
+v__$1 = G__1921;
+continue;
+}
+break;
+}
+});
+
+cljs.core.Iterate.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,rf,start){
+var self__ = this;
+var coll__$1 = this;
+var v = coll__$1.cljs$core$ISeq$_first$arity$1(null);
+var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(start,v) : rf.call(null,start,v));
+var v__$1 = v;
+while(true){
+if(cljs.core.reduced_QMARK_(ret)){
+return cljs.core.deref(ret);
+} else {
+var v__$2 = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(v__$1) : self__.f.call(null,v__$1));
+var G__1922 = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(ret,v__$2) : rf.call(null,ret,v__$2));
+var G__1923 = v__$2;
+ret = G__1922;
+v__$1 = G__1923;
+continue;
+}
+break;
+}
+});
+
+cljs.core.Iterate.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((cljs.core.UNREALIZED_SEED === self__.seed)){
+self__.seed = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(self__.prev_seed) : self__.f.call(null,self__.prev_seed));
+} else {
+}
+
+return self__.seed;
+});
+
+cljs.core.Iterate.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.next == null)){
+self__.next = (new cljs.core.Iterate(null,self__.f,coll__$1.cljs$core$ISeq$_first$arity$1(null),cljs.core.UNREALIZED_SEED,null));
+} else {
+}
+
+return self__.next;
+});
+
+cljs.core.Iterate.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.Iterate.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.Iterate(meta__$1,self__.f,self__.prev_seed,self__.seed,self__.next));
+});
+
+cljs.core.Iterate.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.Iterate.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$f,cljs.core.cst$sym$prev_DASH_seed,cljs.core.with_meta(cljs.core.cst$sym$seed,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Iterate.cljs$lang$type = true;
+
+cljs.core.Iterate.cljs$lang$ctorStr = "cljs.core/Iterate";
+
+cljs.core.Iterate.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Iterate");
+});
+
+/**
+ * Positional factory function for cljs.core/Iterate.
+ */
+cljs.core.__GT_Iterate = (function cljs$core$__GT_Iterate(meta,f,prev_seed,seed,next){
+return (new cljs.core.Iterate(meta,f,prev_seed,seed,next));
+});
+
+/**
+ * Returns a lazy sequence of x, (f x), (f (f x)) etc. f must be free of side-effects
+ */
+cljs.core.iterate = (function cljs$core$iterate(f,x){
+return (new cljs.core.Iterate(null,f,null,x,null));
+});
+/**
+ * Returns a lazy seq of the first item in each coll, then the second etc.
+ */
+cljs.core.interleave = (function cljs$core$interleave(var_args){
+var G__1928 = arguments.length;
+switch (G__1928) {
+case 0:
+return cljs.core.interleave.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.interleave.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.interleave.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1930 = arguments.length;
+var i__4519__auto___1931 = (0);
+while(true){
+if((i__4519__auto___1931 < len__4518__auto___1930)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1931]));
+
+var G__1932 = (i__4519__auto___1931 + (1));
+i__4519__auto___1931 = G__1932;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return cljs.core.interleave.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.interleave.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.List.EMPTY;
+});
+
+cljs.core.interleave.cljs$core$IFn$_invoke$arity$1 = (function (c1){
+return (new cljs.core.LazySeq(null,(function (){
+return c1;
+}),null,null));
+});
+
+cljs.core.interleave.cljs$core$IFn$_invoke$arity$2 = (function (c1,c2){
+return (new cljs.core.LazySeq(null,(function (){
+var s1 = cljs.core.seq(c1);
+var s2 = cljs.core.seq(c2);
+if(((s1) && (s2))){
+return cljs.core.cons(cljs.core.first(s1),cljs.core.cons(cljs.core.first(s2),cljs.core.interleave.cljs$core$IFn$_invoke$arity$2(cljs.core.rest(s1),cljs.core.rest(s2))));
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.interleave.cljs$core$IFn$_invoke$arity$variadic = (function (c1,c2,colls){
+return (new cljs.core.LazySeq(null,(function (){
+var ss = cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.seq,cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(colls,c2,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([c1], 0)));
+if(cljs.core.every_QMARK_(cljs.core.identity,ss)){
+return cljs.core.concat.cljs$core$IFn$_invoke$arity$2(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.first,ss),cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.interleave,cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.rest,ss)));
+} else {
+return null;
+}
+}),null,null));
+});
+
+/** @this {Function} */
+cljs.core.interleave.cljs$lang$applyTo = (function (seq1925){
+var G__1926 = cljs.core.first(seq1925);
+var seq1925__$1 = cljs.core.next(seq1925);
+var G__1927 = cljs.core.first(seq1925__$1);
+var seq1925__$2 = cljs.core.next(seq1925__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1926,G__1927,seq1925__$2);
+});
+
+cljs.core.interleave.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns a lazy seq of the elements of coll separated by sep.
+ *   Returns a stateful transducer when no collection is provided.
+ */
+cljs.core.interpose = (function cljs$core$interpose(var_args){
+var G__1934 = arguments.length;
+switch (G__1934) {
+case 1:
+return cljs.core.interpose.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.interpose.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.interpose.cljs$core$IFn$_invoke$arity$1 = (function (sep){
+return (function (rf){
+var started = cljs.core.volatile_BANG_(false);
+return ((function (started){
+return (function() {
+var G__1936 = null;
+var G__1936__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1936__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1936__2 = (function (result,input){
+if(cljs.core.truth_(cljs.core.deref(started))){
+var sepr = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,sep) : rf.call(null,result,sep));
+if(cljs.core.reduced_QMARK_(sepr)){
+return sepr;
+} else {
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(sepr,input) : rf.call(null,sepr,input));
+}
+} else {
+cljs.core.vreset_BANG_(started,true);
+
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+}
+});
+G__1936 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1936__0.call(this);
+case 1:
+return G__1936__1.call(this,result);
+case 2:
+return G__1936__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1936.cljs$core$IFn$_invoke$arity$0 = G__1936__0;
+G__1936.cljs$core$IFn$_invoke$arity$1 = G__1936__1;
+G__1936.cljs$core$IFn$_invoke$arity$2 = G__1936__2;
+return G__1936;
+})()
+;})(started))
+});
+});
+
+cljs.core.interpose.cljs$core$IFn$_invoke$arity$2 = (function (sep,coll){
+return cljs.core.drop.cljs$core$IFn$_invoke$arity$2((1),cljs.core.interleave.cljs$core$IFn$_invoke$arity$2(cljs.core.repeat.cljs$core$IFn$_invoke$arity$1(sep),coll));
+});
+
+cljs.core.interpose.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Take a collection of collections, and return a lazy seq
+ *   of items from the inner collection
+ */
+cljs.core.flatten1 = (function cljs$core$flatten1(colls){
+var cat = (function cljs$core$flatten1_$_cat(coll,colls__$1){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5455__auto__ = cljs.core.seq(coll);
+if(temp__5455__auto__){
+var coll__$1 = temp__5455__auto__;
+return cljs.core.cons(cljs.core.first(coll__$1),cljs$core$flatten1_$_cat(cljs.core.rest(coll__$1),colls__$1));
+} else {
+if(cljs.core.seq(colls__$1)){
+return cljs$core$flatten1_$_cat(cljs.core.first(colls__$1),cljs.core.rest(colls__$1));
+} else {
+return null;
+}
+}
+}),null,null));
+});
+return cat(null,colls);
+});
+/**
+ * Returns the result of applying concat to the result of applying map
+ *   to f and colls.  Thus function f should return a collection. Returns
+ *   a transducer when no collections are provided
+ */
+cljs.core.mapcat = (function cljs$core$mapcat(var_args){
+var G__1940 = arguments.length;
+switch (G__1940) {
+case 1:
+return cljs.core.mapcat.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1942 = arguments.length;
+var i__4519__auto___1943 = (0);
+while(true){
+if((i__4519__auto___1943 < len__4518__auto___1942)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1943]));
+
+var G__1944 = (i__4519__auto___1943 + (1));
+i__4519__auto___1943 = G__1944;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((1)),(0),null));
+return cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.mapcat.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return cljs.core.comp.cljs$core$IFn$_invoke$arity$2(cljs.core.map.cljs$core$IFn$_invoke$arity$1(f),cljs.core.cat);
+});
+
+cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic = (function (f,colls){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.concat,cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.map,f,colls));
+});
+
+/** @this {Function} */
+cljs.core.mapcat.cljs$lang$applyTo = (function (seq1938){
+var G__1939 = cljs.core.first(seq1938);
+var seq1938__$1 = cljs.core.next(seq1938);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1939,seq1938__$1);
+});
+
+cljs.core.mapcat.cljs$lang$maxFixedArity = (1);
+
+/**
+ * Returns a lazy sequence of the items in coll for which
+ *   (pred item) returns logical true. pred must be free of side-effects.
+ *   Returns a transducer when no collection is provided.
+ */
+cljs.core.filter = (function cljs$core$filter(var_args){
+var G__1946 = arguments.length;
+switch (G__1946) {
+case 1:
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.filter.cljs$core$IFn$_invoke$arity$1 = (function (pred){
+return (function (rf){
+return (function() {
+var G__1949 = null;
+var G__1949__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__1949__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__1949__2 = (function (result,input){
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input)))){
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+} else {
+return result;
+}
+});
+G__1949 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__1949__0.call(this);
+case 1:
+return G__1949__1.call(this,result);
+case 2:
+return G__1949__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__1949.cljs$core$IFn$_invoke$arity$0 = G__1949__0;
+G__1949.cljs$core$IFn$_invoke$arity$1 = G__1949__1;
+G__1949.cljs$core$IFn$_invoke$arity$2 = G__1949__2;
+return G__1949;
+})()
+});
+});
+
+cljs.core.filter.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s)){
+var c = cljs.core.chunk_first(s);
+var size = cljs.core.count(c);
+var b = cljs.core.chunk_buffer(size);
+var n__4395__auto___1950 = size;
+var i_1951 = (0);
+while(true){
+if((i_1951 < n__4395__auto___1950)){
+if(cljs.core.truth_((function (){var G__1947 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1951);
+return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__1947) : pred.call(null,G__1947));
+})())){
+cljs.core.chunk_append(b,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1951));
+} else {
+}
+
+var G__1952 = (i_1951 + (1));
+i_1951 = G__1952;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core.chunk_cons(cljs.core.chunk(b),cljs.core.filter.cljs$core$IFn$_invoke$arity$2(pred,cljs.core.chunk_rest(s)));
+} else {
+var f = cljs.core.first(s);
+var r = cljs.core.rest(s);
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(f) : pred.call(null,f)))){
+return cljs.core.cons(f,cljs.core.filter.cljs$core$IFn$_invoke$arity$2(pred,r));
+} else {
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$2(pred,r);
+}
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.filter.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a lazy sequence of the items in coll for which
+ *   (pred item) returns logical false. pred must be free of side-effects.
+ *   Returns a transducer when no collection is provided.
+ */
+cljs.core.remove = (function cljs$core$remove(var_args){
+var G__1954 = arguments.length;
+switch (G__1954) {
+case 1:
+return cljs.core.remove.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.remove.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.remove.cljs$core$IFn$_invoke$arity$1 = (function (pred){
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$1(cljs.core.complement(pred));
+});
+
+cljs.core.remove.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$2(cljs.core.complement(pred),coll);
+});
+
+cljs.core.remove.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a lazy sequence of the nodes in a tree, via a depth-first walk.
+ *   branch? must be a fn of one arg that returns true if passed a node
+ *   that can have children (but may not).  children must be a fn of one
+ *   arg that returns a sequence of the children. Will only be called on
+ *   nodes for which branch? returns true. Root is the root node of the
+ *   tree.
+ */
+cljs.core.tree_seq = (function cljs$core$tree_seq(branch_QMARK_,children,root){
+var walk = (function cljs$core$tree_seq_$_walk(node){
+return (new cljs.core.LazySeq(null,(function (){
+return cljs.core.cons(node,(cljs.core.truth_((branch_QMARK_.cljs$core$IFn$_invoke$arity$1 ? branch_QMARK_.cljs$core$IFn$_invoke$arity$1(node) : branch_QMARK_.call(null,node)))?cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic(cljs$core$tree_seq_$_walk,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(children.cljs$core$IFn$_invoke$arity$1 ? children.cljs$core$IFn$_invoke$arity$1(node) : children.call(null,node))], 0)):null));
+}),null,null));
+});
+return walk(root);
+});
+/**
+ * Takes any nested combination of sequential things (lists, vectors,
+ *   etc.) and returns their contents as a single, flat sequence.
+ *   (flatten nil) returns nil.
+ */
+cljs.core.flatten = (function cljs$core$flatten(x){
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$2((function (p1__1956_SHARP_){
+return !(cljs.core.sequential_QMARK_(p1__1956_SHARP_));
+}),cljs.core.rest(cljs.core.tree_seq(cljs.core.sequential_QMARK_,cljs.core.seq,x)));
+});
+/**
+ * Returns a new coll consisting of to-coll with all of the items of
+ *   from-coll conjoined. A transducer may be supplied.
+ */
+cljs.core.into = (function cljs$core$into(var_args){
+var G__1958 = arguments.length;
+switch (G__1958) {
+case 0:
+return cljs.core.into.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.into.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.into.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.into.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.PersistentVector.EMPTY;
+});
+
+cljs.core.into.cljs$core$IFn$_invoke$arity$1 = (function (to){
+return to;
+});
+
+cljs.core.into.cljs$core$IFn$_invoke$arity$2 = (function (to,from){
+if(!((to == null))){
+if(((!((to == null)))?(((((to.cljs$lang$protocol_mask$partition1$ & (4))) || ((cljs.core.PROTOCOL_SENTINEL === to.cljs$core$IEditableCollection$))))?true:false):false)){
+return cljs.core._with_meta(cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj_BANG_,cljs.core.transient$(to),from)),cljs.core.meta(to));
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,to,from);
+}
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,cljs.core.List.EMPTY,from);
+}
+});
+
+cljs.core.into.cljs$core$IFn$_invoke$arity$3 = (function (to,xform,from){
+if(((!((to == null)))?(((((to.cljs$lang$protocol_mask$partition1$ & (4))) || ((cljs.core.PROTOCOL_SENTINEL === to.cljs$core$IEditableCollection$))))?true:false):false)){
+return cljs.core._with_meta(cljs.core.persistent_BANG_(cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(xform,cljs.core.conj_BANG_,cljs.core.transient$(to),from)),cljs.core.meta(to));
+} else {
+return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(xform,cljs.core.conj,to,from);
+}
+});
+
+cljs.core.into.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Returns a vector consisting of the result of applying f to the
+ *   set of first items of each coll, followed by applying f to the set
+ *   of second items in each coll, until any one of the colls is
+ *   exhausted.  Any remaining items in other colls are ignored. Function
+ *   f should accept number-of-colls arguments.
+ */
+cljs.core.mapv = (function cljs$core$mapv(var_args){
+var G__1968 = arguments.length;
+switch (G__1968) {
+case 2:
+return cljs.core.mapv.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.mapv.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.mapv.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___1970 = arguments.length;
+var i__4519__auto___1971 = (0);
+while(true){
+if((i__4519__auto___1971 < len__4518__auto___1970)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___1971]));
+
+var G__1972 = (i__4519__auto___1971 + (1));
+i__4519__auto___1971 = G__1972;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((4)),(0),null));
+return cljs.core.mapv.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.mapv.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (v,o){
+return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(v,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(o) : f.call(null,o)));
+}),cljs.core.transient$(cljs.core.PersistentVector.EMPTY),coll));
+});
+
+cljs.core.mapv.cljs$core$IFn$_invoke$arity$3 = (function (f,c1,c2){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentVector.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$3(f,c1,c2));
+});
+
+cljs.core.mapv.cljs$core$IFn$_invoke$arity$4 = (function (f,c1,c2,c3){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentVector.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$4(f,c1,c2,c3));
+});
+
+cljs.core.mapv.cljs$core$IFn$_invoke$arity$variadic = (function (f,c1,c2,c3,colls){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentVector.EMPTY,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(cljs.core.map,f,c1,c2,c3,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([colls], 0)));
+});
+
+/** @this {Function} */
+cljs.core.mapv.cljs$lang$applyTo = (function (seq1963){
+var G__1964 = cljs.core.first(seq1963);
+var seq1963__$1 = cljs.core.next(seq1963);
+var G__1965 = cljs.core.first(seq1963__$1);
+var seq1963__$2 = cljs.core.next(seq1963__$1);
+var G__1966 = cljs.core.first(seq1963__$2);
+var seq1963__$3 = cljs.core.next(seq1963__$2);
+var G__1967 = cljs.core.first(seq1963__$3);
+var seq1963__$4 = cljs.core.next(seq1963__$3);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1964,G__1965,G__1966,G__1967,seq1963__$4);
+});
+
+cljs.core.mapv.cljs$lang$maxFixedArity = (4);
+
+/**
+ * Returns a vector of the items in coll for which
+ *   (pred item) returns logical true. pred must be free of side-effects.
+ */
+cljs.core.filterv = (function cljs$core$filterv(pred,coll){
+return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (v,o){
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(o) : pred.call(null,o)))){
+return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(v,o);
+} else {
+return v;
+}
+}),cljs.core.transient$(cljs.core.PersistentVector.EMPTY),coll));
+});
+/**
+ * Returns a lazy sequence of lists of n items each, at offsets step
+ *   apart. If step is not supplied, defaults to n, i.e. the partitions
+ *   do not overlap. If a pad collection is supplied, use its elements as
+ *   necessary to complete last partition up to n items. In case there are
+ *   not enough padding elements, return a partition with less than n items.
+ */
+cljs.core.partition = (function cljs$core$partition(var_args){
+var G__1974 = arguments.length;
+switch (G__1974) {
+case 2:
+return cljs.core.partition.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.partition.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.partition.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.partition.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
+return cljs.core.partition.cljs$core$IFn$_invoke$arity$3(n,n,coll);
+});
+
+cljs.core.partition.cljs$core$IFn$_invoke$arity$3 = (function (n,step,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+var p = cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,s);
+if((n === cljs.core.count(p))){
+return cljs.core.cons(p,cljs.core.partition.cljs$core$IFn$_invoke$arity$3(n,step,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(step,s)));
+} else {
+return null;
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.partition.cljs$core$IFn$_invoke$arity$4 = (function (n,step,pad,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+var p = cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,s);
+if((n === cljs.core.count(p))){
+return cljs.core.cons(p,cljs.core.partition.cljs$core$IFn$_invoke$arity$4(n,step,pad,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(step,s)));
+} else {
+return (new cljs.core.List(null,cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.concat.cljs$core$IFn$_invoke$arity$2(p,pad)),null,(1),null));
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.partition.cljs$lang$maxFixedArity = 4;
+
+/**
+ * Returns the value in a nested associative structure,
+ *   where ks is a sequence of keys. Returns nil if the key is not present,
+ *   or the not-found value if supplied.
+ */
+cljs.core.get_in = (function cljs$core$get_in(var_args){
+var G__1977 = arguments.length;
+switch (G__1977) {
+case 2:
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.get_in.cljs$core$IFn$_invoke$arity$2 = (function (m,ks){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.get,m,ks);
+});
+
+cljs.core.get_in.cljs$core$IFn$_invoke$arity$3 = (function (m,ks,not_found){
+var sentinel = cljs.core.lookup_sentinel;
+var m__$1 = m;
+var ks__$1 = cljs.core.seq(ks);
+while(true){
+if(!((ks__$1 == null))){
+var m__$2 = cljs.core.get.cljs$core$IFn$_invoke$arity$3(m__$1,cljs.core.first(ks__$1),sentinel);
+if((sentinel === m__$2)){
+return not_found;
+} else {
+var G__1979 = sentinel;
+var G__1980 = m__$2;
+var G__1981 = cljs.core.next(ks__$1);
+sentinel = G__1979;
+m__$1 = G__1980;
+ks__$1 = G__1981;
+continue;
+}
+} else {
+return m__$1;
+}
+break;
+}
+});
+
+cljs.core.get_in.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Associates a value in a nested associative structure, where ks is a
+ *   sequence of keys and v is the new value and returns a new nested structure.
+ *   If any levels do not exist, hash-maps will be created.
+ */
+cljs.core.assoc_in = (function cljs$core$assoc_in(m,p__1982,v){
+var vec__1983 = p__1982;
+var seq__1984 = cljs.core.seq(vec__1983);
+var first__1985 = cljs.core.first(seq__1984);
+var seq__1984__$1 = cljs.core.next(seq__1984);
+var k = first__1985;
+var ks = seq__1984__$1;
+if(ks){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__1986 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__1987 = ks;
+var G__1988 = v;
+return (cljs.core.assoc_in.cljs$core$IFn$_invoke$arity$3 ? cljs.core.assoc_in.cljs$core$IFn$_invoke$arity$3(G__1986,G__1987,G__1988) : cljs.core.assoc_in.call(null,G__1986,G__1987,G__1988));
+})());
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,v);
+}
+});
+/**
+ * 'Updates' a value in a nested associative structure, where ks is a
+ *   sequence of keys and f is a function that will take the old value
+ *   and any supplied args and return the new value, and returns a new
+ *   nested structure.  If any levels do not exist, hash-maps will be
+ *   created.
+ */
+cljs.core.update_in = (function cljs$core$update_in(var_args){
+var G__1997 = arguments.length;
+switch (G__1997) {
+case 3:
+return cljs.core.update_in.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.update_in.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core.update_in.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+case 6:
+return cljs.core.update_in.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___2029 = arguments.length;
+var i__4519__auto___2030 = (0);
+while(true){
+if((i__4519__auto___2030 < len__4518__auto___2029)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___2030]));
+
+var G__2031 = (i__4519__auto___2030 + (1));
+i__4519__auto___2030 = G__2031;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((6)),(0),null));
+return cljs.core.update_in.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.update_in.cljs$core$IFn$_invoke$arity$3 = (function (m,p__1998,f){
+var vec__1999 = p__1998;
+var seq__2000 = cljs.core.seq(vec__1999);
+var first__2001 = cljs.core.first(seq__2000);
+var seq__2000__$1 = cljs.core.next(seq__2000);
+var k = first__2001;
+var ks = seq__2000__$1;
+if(ks){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$3(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f));
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2002 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__2002) : f.call(null,G__2002));
+})());
+}
+});
+
+cljs.core.update_in.cljs$core$IFn$_invoke$arity$4 = (function (m,p__2003,f,a){
+var vec__2004 = p__2003;
+var seq__2005 = cljs.core.seq(vec__2004);
+var first__2006 = cljs.core.first(seq__2005);
+var seq__2005__$1 = cljs.core.next(seq__2005);
+var k = first__2006;
+var ks = seq__2005__$1;
+if(ks){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$4(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a));
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2007 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__2008 = a;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2007,G__2008) : f.call(null,G__2007,G__2008));
+})());
+}
+});
+
+cljs.core.update_in.cljs$core$IFn$_invoke$arity$5 = (function (m,p__2009,f,a,b){
+var vec__2010 = p__2009;
+var seq__2011 = cljs.core.seq(vec__2010);
+var first__2012 = cljs.core.first(seq__2011);
+var seq__2011__$1 = cljs.core.next(seq__2011);
+var k = first__2012;
+var ks = seq__2011__$1;
+if(ks){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$5(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a,b));
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2013 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__2014 = a;
+var G__2015 = b;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2013,G__2014,G__2015) : f.call(null,G__2013,G__2014,G__2015));
+})());
+}
+});
+
+cljs.core.update_in.cljs$core$IFn$_invoke$arity$6 = (function (m,p__2016,f,a,b,c){
+var vec__2017 = p__2016;
+var seq__2018 = cljs.core.seq(vec__2017);
+var first__2019 = cljs.core.first(seq__2018);
+var seq__2018__$1 = cljs.core.next(seq__2018);
+var k = first__2019;
+var ks = seq__2018__$1;
+if(ks){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$6(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a,b,c));
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2020 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__2021 = a;
+var G__2022 = b;
+var G__2023 = c;
+return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(G__2020,G__2021,G__2022,G__2023) : f.call(null,G__2020,G__2021,G__2022,G__2023));
+})());
+}
+});
+
+cljs.core.update_in.cljs$core$IFn$_invoke$arity$variadic = (function (m,p__2024,f,a,b,c,args){
+var vec__2025 = p__2024;
+var seq__2026 = cljs.core.seq(vec__2025);
+var first__2027 = cljs.core.first(seq__2026);
+var seq__2026__$1 = cljs.core.next(seq__2026);
+var k = first__2027;
+var ks = seq__2026__$1;
+if(ks){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(cljs.core.update_in,cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([b,c,args], 0)));
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),a,b,c,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([args], 0)));
+}
+});
+
+/** @this {Function} */
+cljs.core.update_in.cljs$lang$applyTo = (function (seq1990){
+var G__1991 = cljs.core.first(seq1990);
+var seq1990__$1 = cljs.core.next(seq1990);
+var G__1992 = cljs.core.first(seq1990__$1);
+var seq1990__$2 = cljs.core.next(seq1990__$1);
+var G__1993 = cljs.core.first(seq1990__$2);
+var seq1990__$3 = cljs.core.next(seq1990__$2);
+var G__1994 = cljs.core.first(seq1990__$3);
+var seq1990__$4 = cljs.core.next(seq1990__$3);
+var G__1995 = cljs.core.first(seq1990__$4);
+var seq1990__$5 = cljs.core.next(seq1990__$4);
+var G__1996 = cljs.core.first(seq1990__$5);
+var seq1990__$6 = cljs.core.next(seq1990__$5);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1991,G__1992,G__1993,G__1994,G__1995,G__1996,seq1990__$6);
+});
+
+cljs.core.update_in.cljs$lang$maxFixedArity = (6);
+
+/**
+ * 'Updates' a value in an associative structure, where k is a
+ *   key and f is a function that will take the old value
+ *   and any supplied args and return the new value, and returns a new
+ *   structure.  If the key does not exist, nil is passed as the old value.
+ */
+cljs.core.update = (function cljs$core$update(var_args){
+var G__2040 = arguments.length;
+switch (G__2040) {
+case 3:
+return cljs.core.update.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.update.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core.update.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+case 6:
+return cljs.core.update.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___2052 = arguments.length;
+var i__4519__auto___2053 = (0);
+while(true){
+if((i__4519__auto___2053 < len__4518__auto___2052)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___2053]));
+
+var G__2054 = (i__4519__auto___2053 + (1));
+i__4519__auto___2053 = G__2054;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((6)),(0),null));
+return cljs.core.update.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.update.cljs$core$IFn$_invoke$arity$3 = (function (m,k,f){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2041 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__2041) : f.call(null,G__2041));
+})());
+});
+
+cljs.core.update.cljs$core$IFn$_invoke$arity$4 = (function (m,k,f,x){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2042 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__2043 = x;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2042,G__2043) : f.call(null,G__2042,G__2043));
+})());
+});
+
+cljs.core.update.cljs$core$IFn$_invoke$arity$5 = (function (m,k,f,x,y){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2044 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__2045 = x;
+var G__2046 = y;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2044,G__2045,G__2046) : f.call(null,G__2044,G__2045,G__2046));
+})());
+});
+
+cljs.core.update.cljs$core$IFn$_invoke$arity$6 = (function (m,k,f,x,y,z){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2047 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__2048 = x;
+var G__2049 = y;
+var G__2050 = z;
+return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(G__2047,G__2048,G__2049,G__2050) : f.call(null,G__2047,G__2048,G__2049,G__2050));
+})());
+});
+
+cljs.core.update.cljs$core$IFn$_invoke$arity$variadic = (function (m,k,f,x,y,z,more){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),x,y,z,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([more], 0)));
+});
+
+/** @this {Function} */
+cljs.core.update.cljs$lang$applyTo = (function (seq2033){
+var G__2034 = cljs.core.first(seq2033);
+var seq2033__$1 = cljs.core.next(seq2033);
+var G__2035 = cljs.core.first(seq2033__$1);
+var seq2033__$2 = cljs.core.next(seq2033__$1);
+var G__2036 = cljs.core.first(seq2033__$2);
+var seq2033__$3 = cljs.core.next(seq2033__$2);
+var G__2037 = cljs.core.first(seq2033__$3);
+var seq2033__$4 = cljs.core.next(seq2033__$3);
+var G__2038 = cljs.core.first(seq2033__$4);
+var seq2033__$5 = cljs.core.next(seq2033__$4);
+var G__2039 = cljs.core.first(seq2033__$5);
+var seq2033__$6 = cljs.core.next(seq2033__$5);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2034,G__2035,G__2036,G__2037,G__2038,G__2039,seq2033__$6);
+});
+
+cljs.core.update.cljs$lang$maxFixedArity = (6);
+
+
+/**
+* @constructor
+*/
+cljs.core.VectorNode = (function (edit,arr){
+this.edit = edit;
+this.arr = arr;
+});
+
+cljs.core.VectorNode.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.cst$sym$arr], null);
+});
+
+cljs.core.VectorNode.cljs$lang$type = true;
+
+cljs.core.VectorNode.cljs$lang$ctorStr = "cljs.core/VectorNode";
+
+cljs.core.VectorNode.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/VectorNode");
+});
+
+/**
+ * Positional factory function for cljs.core/VectorNode.
+ */
+cljs.core.__GT_VectorNode = (function cljs$core$__GT_VectorNode(edit,arr){
+return (new cljs.core.VectorNode(edit,arr));
+});
+
+cljs.core.pv_fresh_node = (function cljs$core$pv_fresh_node(edit){
+return (new cljs.core.VectorNode(edit,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]));
+});
+cljs.core.pv_aget = (function cljs$core$pv_aget(node,idx){
+return (node.arr[idx]);
+});
+cljs.core.pv_aset = (function cljs$core$pv_aset(node,idx,val){
+return (node.arr[idx] = val);
+});
+cljs.core.pv_clone_node = (function cljs$core$pv_clone_node(node){
+return (new cljs.core.VectorNode(node.edit,cljs.core.aclone(node.arr)));
+});
+cljs.core.tail_off = (function cljs$core$tail_off(pv){
+var cnt = pv.cnt;
+if((cnt < (32))){
+return (0);
+} else {
+return (((cnt - (1)) >>> (5)) << (5));
+}
+});
+cljs.core.new_path = (function cljs$core$new_path(edit,level,node){
+var ll = level;
+var ret = node;
+while(true){
+if((ll === (0))){
+return ret;
+} else {
+var embed = ret;
+var r = cljs.core.pv_fresh_node(edit);
+var _ = cljs.core.pv_aset(r,(0),embed);
+var G__2055 = (ll - (5));
+var G__2056 = r;
+ll = G__2055;
+ret = G__2056;
+continue;
+}
+break;
+}
+});
+cljs.core.push_tail = (function cljs$core$push_tail(pv,level,parent,tailnode){
+var ret = cljs.core.pv_clone_node(parent);
+var subidx = (((pv.cnt - (1)) >>> level) & (31));
+if(((5) === level)){
+cljs.core.pv_aset(ret,subidx,tailnode);
+
+return ret;
+} else {
+var child = cljs.core.pv_aget(parent,subidx);
+if(!((child == null))){
+var node_to_insert = (function (){var G__2057 = pv;
+var G__2058 = (level - (5));
+var G__2059 = child;
+var G__2060 = tailnode;
+return (cljs.core.push_tail.cljs$core$IFn$_invoke$arity$4 ? cljs.core.push_tail.cljs$core$IFn$_invoke$arity$4(G__2057,G__2058,G__2059,G__2060) : cljs.core.push_tail.call(null,G__2057,G__2058,G__2059,G__2060));
+})();
+cljs.core.pv_aset(ret,subidx,node_to_insert);
+
+return ret;
+} else {
+var node_to_insert = cljs.core.new_path(null,(level - (5)),tailnode);
+cljs.core.pv_aset(ret,subidx,node_to_insert);
+
+return ret;
+}
+}
+});
+cljs.core.vector_index_out_of_bounds = (function cljs$core$vector_index_out_of_bounds(i,cnt){
+throw (new Error(["No item ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(i)," in vector of length ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cnt)].join('')));
+});
+cljs.core.first_array_for_longvec = (function cljs$core$first_array_for_longvec(pv){
+var node = pv.root;
+var level = pv.shift;
+while(true){
+if((level > (0))){
+var G__2061 = cljs.core.pv_aget(node,(0));
+var G__2062 = (level - (5));
+node = G__2061;
+level = G__2062;
+continue;
+} else {
+return node.arr;
+}
+break;
+}
+});
+cljs.core.unchecked_array_for = (function cljs$core$unchecked_array_for(pv,i){
+if((i >= cljs.core.tail_off(pv))){
+return pv.tail;
+} else {
+var node = pv.root;
+var level = pv.shift;
+while(true){
+if((level > (0))){
+var G__2063 = cljs.core.pv_aget(node,((i >>> level) & (31)));
+var G__2064 = (level - (5));
+node = G__2063;
+level = G__2064;
+continue;
+} else {
+return node.arr;
+}
+break;
+}
+}
+});
+cljs.core.array_for = (function cljs$core$array_for(pv,i){
+if(((((0) <= i)) && ((i < pv.cnt)))){
+return cljs.core.unchecked_array_for(pv,i);
+} else {
+return cljs.core.vector_index_out_of_bounds(i,pv.cnt);
+}
+});
+cljs.core.do_assoc = (function cljs$core$do_assoc(pv,level,node,i,val){
+var ret = cljs.core.pv_clone_node(node);
+if((level === (0))){
+cljs.core.pv_aset(ret,(i & (31)),val);
+
+return ret;
+} else {
+var subidx = ((i >>> level) & (31));
+cljs.core.pv_aset(ret,subidx,(function (){var G__2065 = pv;
+var G__2066 = (level - (5));
+var G__2067 = cljs.core.pv_aget(node,subidx);
+var G__2068 = i;
+var G__2069 = val;
+return (cljs.core.do_assoc.cljs$core$IFn$_invoke$arity$5 ? cljs.core.do_assoc.cljs$core$IFn$_invoke$arity$5(G__2065,G__2066,G__2067,G__2068,G__2069) : cljs.core.do_assoc.call(null,G__2065,G__2066,G__2067,G__2068,G__2069));
+})());
+
+return ret;
+}
+});
+cljs.core.pop_tail = (function cljs$core$pop_tail(pv,level,node){
+var subidx = (((pv.cnt - (2)) >>> level) & (31));
+if((level > (5))){
+var new_child = (function (){var G__2070 = pv;
+var G__2071 = (level - (5));
+var G__2072 = cljs.core.pv_aget(node,subidx);
+return (cljs.core.pop_tail.cljs$core$IFn$_invoke$arity$3 ? cljs.core.pop_tail.cljs$core$IFn$_invoke$arity$3(G__2070,G__2071,G__2072) : cljs.core.pop_tail.call(null,G__2070,G__2071,G__2072));
+})();
+if((((new_child == null)) && ((subidx === (0))))){
+return null;
+} else {
+var ret = cljs.core.pv_clone_node(node);
+cljs.core.pv_aset(ret,subidx,new_child);
+
+return ret;
+}
+} else {
+if((subidx === (0))){
+return null;
+} else {
+var ret = cljs.core.pv_clone_node(node);
+cljs.core.pv_aset(ret,subidx,null);
+
+return ret;
+
+}
+}
+});
+
+/**
+* @constructor
+*/
+cljs.core.RangedIterator = (function (i,base,arr,v,start,end){
+this.i = i;
+this.base = base;
+this.arr = arr;
+this.v = v;
+this.start = start;
+this.end = end;
+});
+cljs.core.RangedIterator.prototype.hasNext = (function (){
+var self__ = this;
+var this$ = this;
+return (self__.i < self__.end);
+});
+
+cljs.core.RangedIterator.prototype.next = (function (){
+var self__ = this;
+var this$ = this;
+if(((self__.i - self__.base) === (32))){
+self__.arr = cljs.core.unchecked_array_for(self__.v,self__.i);
+
+self__.base = (self__.base + (32));
+} else {
+}
+
+var ret = (self__.arr[(self__.i & (31))]);
+self__.i = (self__.i + (1));
+
+return ret;
+});
+
+cljs.core.RangedIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$base,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$v,cljs.core.cst$sym$start,cljs.core.cst$sym$end], null);
+});
+
+cljs.core.RangedIterator.cljs$lang$type = true;
+
+cljs.core.RangedIterator.cljs$lang$ctorStr = "cljs.core/RangedIterator";
+
+cljs.core.RangedIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/RangedIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/RangedIterator.
+ */
+cljs.core.__GT_RangedIterator = (function cljs$core$__GT_RangedIterator(i,base,arr,v,start,end){
+return (new cljs.core.RangedIterator(i,base,arr,v,start,end));
+});
+
+cljs.core.ranged_iterator = (function cljs$core$ranged_iterator(v,start,end){
+var i = start;
+return (new cljs.core.RangedIterator(i,(i - (i % (32))),(((start < cljs.core.count(v)))?cljs.core.unchecked_array_for(v,i):null),v,start,end));
+});
+cljs.core.pv_reduce = (function cljs$core$pv_reduce(var_args){
+var G__2074 = arguments.length;
+switch (G__2074) {
+case 4:
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4 = (function (pv,f,start,end){
+if((start < end)){
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5(pv,f,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(pv,start),(start + (1)),end);
+} else {
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+}
+});
+
+cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5 = (function (pv,f,init,start,end){
+var acc = init;
+var i = start;
+var arr = cljs.core.unchecked_array_for(pv,start);
+while(true){
+if((i < end)){
+var j = (i & (31));
+var arr__$1 = (((j === (0)))?cljs.core.unchecked_array_for(pv,i):arr);
+var nacc = (function (){var G__2075 = acc;
+var G__2076 = (arr__$1[j]);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2075,G__2076) : f.call(null,G__2075,G__2076));
+})();
+if(cljs.core.reduced_QMARK_(nacc)){
+return cljs.core.deref(nacc);
+} else {
+var G__2078 = nacc;
+var G__2079 = (i + (1));
+var G__2080 = arr__$1;
+acc = G__2078;
+i = G__2079;
+arr = G__2080;
+continue;
+}
+} else {
+return acc;
+}
+break;
+}
+});
+
+cljs.core.pv_reduce.cljs$lang$maxFixedArity = 5;
+
+
+
+
+
+
+
+
+/**
+ * Marker protocol
+ * @interface
+ */
+cljs.core.APersistentVector = function(){};
+
+
+/**
+* @constructor
+ * @implements {cljs.core.APersistentVector}
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IVector}
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IKVReduce}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEditableCollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.ILookup}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.PersistentVector = (function (meta,cnt,shift,root,tail,__hash){
+this.meta = meta;
+this.cnt = cnt;
+this.shift = shift;
+this.root = root;
+this.tail = tail;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 167666463;
+this.cljs$lang$protocol_mask$partition1$ = 139268;
+});
+cljs.core.PersistentVector.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentVector.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,n){
+var self__ = this;
+var coll__$1 = this;
+if(((((0) <= n)) && ((n < self__.cnt)))){
+return (new cljs.core.MapEntry(n,(cljs.core.unchecked_array_for(coll__$1,n)[(n & (31))]),null));
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentVector.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentVector.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentVector.prototype.indexOf = (function() {
+var G__2087 = null;
+var G__2087__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2087__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2087 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2087__1.call(this,x);
+case 2:
+return G__2087__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2087.cljs$core$IFn$_invoke$arity$1 = G__2087__1;
+G__2087.cljs$core$IFn$_invoke$arity$2 = G__2087__2;
+return G__2087;
+})()
+;
+
+cljs.core.PersistentVector.prototype.lastIndexOf = (function() {
+var G__2088 = null;
+var G__2088__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2088__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2088 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2088__1.call(this,x);
+case 2:
+return G__2088__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2088.cljs$core$IFn$_invoke$arity$1 = G__2088__1;
+G__2088.cljs$core$IFn$_invoke$arity$2 = G__2088__2;
+return G__2088;
+})()
+;
+
+cljs.core.PersistentVector.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
+var self__ = this;
+var coll__$1 = this;
+if(typeof k === 'number'){
+return coll__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+} else {
+return not_found;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (v,f,init){
+var self__ = this;
+var v__$1 = this;
+var i = (0);
+var init__$1 = init;
+while(true){
+if((i < self__.cnt)){
+var arr = cljs.core.unchecked_array_for(v__$1,i);
+var len = arr.length;
+var init__$2 = (function (){var j = (0);
+var init__$2 = init__$1;
+while(true){
+if((j < len)){
+var init__$3 = (function (){var G__2082 = init__$2;
+var G__2083 = (j + i);
+var G__2084 = (arr[j]);
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2082,G__2083,G__2084) : f.call(null,G__2082,G__2083,G__2084));
+})();
+if(cljs.core.reduced_QMARK_(init__$3)){
+return init__$3;
+} else {
+var G__2089 = (j + (1));
+var G__2090 = init__$3;
+j = G__2089;
+init__$2 = G__2090;
+continue;
+}
+} else {
+return init__$2;
+}
+break;
+}
+})();
+if(cljs.core.reduced_QMARK_(init__$2)){
+return cljs.core.deref(init__$2);
+} else {
+var G__2091 = (i + len);
+var G__2092 = init__$2;
+i = G__2091;
+init__$1 = G__2092;
+continue;
+}
+} else {
+return init__$1;
+}
+break;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$APersistentVector$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentVector.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
+var self__ = this;
+var coll__$1 = this;
+return (cljs.core.array_for(coll__$1,n)[(n & (31))]);
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
+var self__ = this;
+var coll__$1 = this;
+if(((((0) <= n)) && ((n < self__.cnt)))){
+return (cljs.core.unchecked_array_for(coll__$1,n)[(n & (31))]);
+} else {
+return not_found;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (coll,n,val){
+var self__ = this;
+var coll__$1 = this;
+if(((((0) <= n)) && ((n < self__.cnt)))){
+if((cljs.core.tail_off(coll__$1) <= n)){
+var new_tail = cljs.core.aclone(self__.tail);
+(new_tail[(n & (31))] = val);
+
+return (new cljs.core.PersistentVector(self__.meta,self__.cnt,self__.shift,self__.root,new_tail,null));
+} else {
+return (new cljs.core.PersistentVector(self__.meta,self__.cnt,self__.shift,cljs.core.do_assoc(coll__$1,self__.shift,self__.root,n,val),self__.tail,null));
+}
+} else {
+if((n === self__.cnt)){
+return coll__$1.cljs$core$ICollection$_conj$arity$2(null,val);
+} else {
+throw (new Error(["Index ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)," out of bounds  [0,",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.cnt),"]"].join('')));
+
+}
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return cljs.core.ranged_iterator(this$__$1,(0),self__.cnt);
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.PersistentVector(self__.meta,self__.cnt,self__.shift,self__.root,self__.tail,self__.__hash));
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.cnt;
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt > (0))){
+return coll__$1.cljs$core$IIndexed$_nth$arity$2(null,(self__.cnt - (1)));
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt === (0))){
+throw (new Error("Can't pop empty vector"));
+} else {
+if(((1) === self__.cnt)){
+return cljs.core._with_meta(cljs.core.PersistentVector.EMPTY,self__.meta);
+} else {
+if(((1) < (self__.cnt - cljs.core.tail_off(coll__$1)))){
+return (new cljs.core.PersistentVector(self__.meta,(self__.cnt - (1)),self__.shift,self__.root,self__.tail.slice((0),(-1)),null));
+} else {
+var new_tail = cljs.core.unchecked_array_for(coll__$1,(self__.cnt - (2)));
+var nr = cljs.core.pop_tail(coll__$1,self__.shift,self__.root);
+var new_root = (((nr == null))?cljs.core.PersistentVector.EMPTY_NODE:nr);
+var cnt_1 = (self__.cnt - (1));
+if(((((5) < self__.shift)) && ((cljs.core.pv_aget(new_root,(1)) == null)))){
+return (new cljs.core.PersistentVector(self__.meta,cnt_1,(self__.shift - (5)),cljs.core.pv_aget(new_root,(0)),new_tail,null));
+} else {
+return (new cljs.core.PersistentVector(self__.meta,cnt_1,self__.shift,new_root,new_tail,null));
+}
+
+}
+}
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt > (0))){
+return (new cljs.core.RSeq(coll__$1,(self__.cnt - (1)),null));
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+if((other instanceof cljs.core.PersistentVector)){
+if((self__.cnt === cljs.core.count(other))){
+var me_iter = coll__$1.cljs$core$IIterable$_iterator$arity$1(null);
+var you_iter = cljs.core._iterator(other);
+while(true){
+if(me_iter.hasNext()){
+var x = me_iter.next();
+var y = you_iter.next();
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y)){
+continue;
+} else {
+return false;
+}
+} else {
+return true;
+}
+break;
+}
+} else {
+return false;
+}
+} else {
+return cljs.core.equiv_sequential(coll__$1,other);
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.TransientVector(self__.cnt,self__.shift,cljs.core.tv_editable_root(self__.root),cljs.core.tv_editable_tail(self__.tail)));
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.PersistentVector.EMPTY,self__.meta);
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (v,f){
+var self__ = this;
+var v__$1 = this;
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4(v__$1,f,(0),self__.cnt);
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (v,f,init){
+var self__ = this;
+var v__$1 = this;
+var i = (0);
+var init__$1 = init;
+while(true){
+if((i < self__.cnt)){
+var arr = cljs.core.unchecked_array_for(v__$1,i);
+var len = arr.length;
+var init__$2 = (function (){var j = (0);
+var init__$2 = init__$1;
+while(true){
+if((j < len)){
+var init__$3 = (function (){var G__2085 = init__$2;
+var G__2086 = (arr[j]);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2085,G__2086) : f.call(null,G__2085,G__2086));
+})();
+if(cljs.core.reduced_QMARK_(init__$3)){
+return init__$3;
+} else {
+var G__2093 = (j + (1));
+var G__2094 = init__$3;
+j = G__2093;
+init__$2 = G__2094;
+continue;
+}
+} else {
+return init__$2;
+}
+break;
+}
+})();
+if(cljs.core.reduced_QMARK_(init__$2)){
+return cljs.core.deref(init__$2);
+} else {
+var G__2095 = (i + len);
+var G__2096 = init__$2;
+i = G__2095;
+init__$1 = G__2096;
+continue;
+}
+} else {
+return init__$1;
+}
+break;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
+var self__ = this;
+var coll__$1 = this;
+if(typeof k === 'number'){
+return coll__$1.cljs$core$IVector$_assoc_n$arity$3(null,k,v);
+} else {
+throw (new Error("Vector's key for assoc must be a number."));
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+if(cljs.core.integer_QMARK_(k)){
+return ((((0) <= k)) && ((k < self__.cnt)));
+} else {
+return false;
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt === (0))){
+return null;
+} else {
+if((self__.cnt <= (32))){
+return (new cljs.core.IndexedSeq(self__.tail,(0),null));
+} else {
+return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(coll__$1,cljs.core.first_array_for_longvec(coll__$1),(0),(0));
+
+}
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentVector(meta__$1,self__.cnt,self__.shift,self__.root,self__.tail,self__.__hash));
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+if(((self__.cnt - cljs.core.tail_off(coll__$1)) < (32))){
+var len = self__.tail.length;
+var new_tail = (new Array((len + (1))));
+var n__4395__auto___2097 = len;
+var i_2098 = (0);
+while(true){
+if((i_2098 < n__4395__auto___2097)){
+(new_tail[i_2098] = (self__.tail[i_2098]));
+
+var G__2099 = (i_2098 + (1));
+i_2098 = G__2099;
+continue;
+} else {
+}
+break;
+}
+
+(new_tail[len] = o);
+
+return (new cljs.core.PersistentVector(self__.meta,(self__.cnt + (1)),self__.shift,self__.root,new_tail,null));
+} else {
+var root_overflow_QMARK_ = ((self__.cnt >>> (5)) > ((1) << self__.shift));
+var new_shift = ((root_overflow_QMARK_)?(self__.shift + (5)):self__.shift);
+var new_root = ((root_overflow_QMARK_)?(function (){var n_r = cljs.core.pv_fresh_node(null);
+cljs.core.pv_aset(n_r,(0),self__.root);
+
+cljs.core.pv_aset(n_r,(1),cljs.core.new_path(null,self__.shift,(new cljs.core.VectorNode(null,self__.tail))));
+
+return n_r;
+})():cljs.core.push_tail(coll__$1,self__.shift,self__.root,(new cljs.core.VectorNode(null,self__.tail))));
+return (new cljs.core.PersistentVector(self__.meta,(self__.cnt + (1)),new_shift,new_root,[o],null));
+}
+});
+
+cljs.core.PersistentVector.prototype.call = (function() {
+var G__2100 = null;
+var G__2100__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+var G__2100__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+G__2100 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2100__2.call(this,self__,k);
+case 3:
+return G__2100__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2100.cljs$core$IFn$_invoke$arity$2 = G__2100__2;
+G__2100.cljs$core$IFn$_invoke$arity$3 = G__2100__3;
+return G__2100;
+})()
+;
+
+cljs.core.PersistentVector.prototype.apply = (function (self__,args2081){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2081)));
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentVector.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$cnt,cljs.core.cst$sym$shift,cljs.core.cst$sym$root,cljs.core.cst$sym$tail,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentVector.cljs$lang$type = true;
+
+cljs.core.PersistentVector.cljs$lang$ctorStr = "cljs.core/PersistentVector";
+
+cljs.core.PersistentVector.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentVector");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentVector.
+ */
+cljs.core.__GT_PersistentVector = (function cljs$core$__GT_PersistentVector(meta,cnt,shift,root,tail,__hash){
+return (new cljs.core.PersistentVector(meta,cnt,shift,root,tail,__hash));
+});
+
+cljs.core.PersistentVector.EMPTY_NODE = (new cljs.core.VectorNode(null,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]));
+cljs.core.PersistentVector.EMPTY = (new cljs.core.PersistentVector(null,(0),(5),cljs.core.PersistentVector.EMPTY_NODE,[],cljs.core.empty_ordered_hash));
+cljs.core.PersistentVector.fromArray = (function (xs,no_clone){
+var l = xs.length;
+var xs__$1 = ((no_clone)?xs:cljs.core.aclone(xs));
+if((l < (32))){
+return (new cljs.core.PersistentVector(null,l,(5),cljs.core.PersistentVector.EMPTY_NODE,xs__$1,null));
+} else {
+var node = xs__$1.slice((0),(32));
+var v = (new cljs.core.PersistentVector(null,(32),(5),cljs.core.PersistentVector.EMPTY_NODE,node,null));
+var i = (32);
+var out = v.cljs$core$IEditableCollection$_as_transient$arity$1(null);
+while(true){
+if((i < l)){
+var G__2101 = (i + (1));
+var G__2102 = cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(out,(xs__$1[i]));
+i = G__2101;
+out = G__2102;
+continue;
+} else {
+return cljs.core.persistent_BANG_(out);
+}
+break;
+}
+}
+});
+var G__2103_2106 = cljs.core.PersistentVector.prototype;
+var G__2104_2107 = cljs.core.ITER_SYMBOL;
+var G__2105_2108 = ((function (G__2103_2106,G__2104_2107){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2103_2106,G__2104_2107))
+;
+goog.object.set(G__2103_2106,G__2104_2107,G__2105_2108);
+/**
+ * Creates a new vector containing the contents of coll. JavaScript arrays
+ *   will be aliased and should not be modified.
+ */
+cljs.core.vec = (function cljs$core$vec(coll){
+if(cljs.core.array_QMARK_(coll)){
+return cljs.core.PersistentVector.fromArray(coll,true);
+} else {
+return cljs.core._persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj_BANG_,cljs.core._as_transient(cljs.core.PersistentVector.EMPTY),coll));
+}
+});
+/**
+ * Creates a new vector containing the args.
+ */
+cljs.core.vector = (function cljs$core$vector(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2110 = arguments.length;
+var i__4519__auto___2111 = (0);
+while(true){
+if((i__4519__auto___2111 < len__4518__auto___2110)){
+args__4521__auto__.push((arguments[i__4519__auto___2111]));
+
+var G__2112 = (i__4519__auto___2111 + (1));
+i__4519__auto___2111 = G__2112;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.vector.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.vector.cljs$core$IFn$_invoke$arity$variadic = (function (args){
+if((((args instanceof cljs.core.IndexedSeq)) && ((args.i === (0))))){
+return cljs.core.PersistentVector.fromArray(args.arr,true);
+} else {
+return cljs.core.vec(args);
+}
+});
+
+cljs.core.vector.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.vector.cljs$lang$applyTo = (function (seq2109){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2109));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ASeq}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IChunkedNext}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IChunkedSeq}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.ChunkedSeq = (function (vec,node,i,off,meta,__hash){
+this.vec = vec;
+this.node = node;
+this.i = i;
+this.off = off;
+this.meta = meta;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 32375020;
+this.cljs$lang$protocol_mask$partition1$ = 1536;
+});
+cljs.core.ChunkedSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.ChunkedSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.ChunkedSeq.prototype.indexOf = (function() {
+var G__2113 = null;
+var G__2113__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2113__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2113 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2113__1.call(this,x);
+case 2:
+return G__2113__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2113.cljs$core$IFn$_invoke$arity$1 = G__2113__1;
+G__2113.cljs$core$IFn$_invoke$arity$2 = G__2113__2;
+return G__2113;
+})()
+;
+
+cljs.core.ChunkedSeq.prototype.lastIndexOf = (function() {
+var G__2114 = null;
+var G__2114__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2114__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2114 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2114__1.call(this,x);
+case 2:
+return G__2114__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2114.cljs$core$IFn$_invoke$arity$1 = G__2114__1;
+G__2114.cljs$core$IFn$_invoke$arity$2 = G__2114__2;
+return G__2114;
+})()
+;
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if(((self__.off + (1)) < self__.node.length)){
+var s = cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,self__.node,self__.i,(self__.off + (1)));
+if((s == null)){
+return null;
+} else {
+return s;
+}
+} else {
+return coll__$1.cljs$core$IChunkedNext$_chunked_next$arity$1(null);
+}
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.List.EMPTY;
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4(self__.vec,f,(self__.i + self__.off),cljs.core.count(self__.vec));
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5(self__.vec,f,start,(self__.i + self__.off),cljs.core.count(self__.vec));
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (self__.node[self__.off]);
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if(((self__.off + (1)) < self__.node.length)){
+var s = cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,self__.node,self__.i,(self__.off + (1)));
+if((s == null)){
+return cljs.core.List.EMPTY;
+} else {
+return s;
+}
+} else {
+return coll__$1.cljs$core$IChunkedSeq$_chunked_rest$arity$1(null);
+}
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IChunkedSeq$_chunked_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$2(self__.node,self__.off);
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IChunkedSeq$_chunked_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var end = (self__.i + self__.node.length);
+if((end < cljs.core._count(self__.vec))){
+return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,cljs.core.unchecked_array_for(self__.vec,end),end,(0));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,m){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$5(self__.vec,self__.node,self__.i,self__.off,m);
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IChunkedNext$_chunked_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var end = (self__.i + self__.node.length);
+if((end < cljs.core._count(self__.vec))){
+return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,cljs.core.unchecked_array_for(self__.vec,end),end,(0));
+} else {
+return null;
+}
+});
+
+cljs.core.ChunkedSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$vec,cljs.core.cst$sym$node,cljs.core.cst$sym$i,cljs.core.cst$sym$off,cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ChunkedSeq.cljs$lang$type = true;
+
+cljs.core.ChunkedSeq.cljs$lang$ctorStr = "cljs.core/ChunkedSeq";
+
+cljs.core.ChunkedSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ChunkedSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/ChunkedSeq.
+ */
+cljs.core.__GT_ChunkedSeq = (function cljs$core$__GT_ChunkedSeq(vec,node,i,off,meta,__hash){
+return (new cljs.core.ChunkedSeq(vec,node,i,off,meta,__hash));
+});
+
+var G__2115_2118 = cljs.core.ChunkedSeq.prototype;
+var G__2116_2119 = cljs.core.ITER_SYMBOL;
+var G__2117_2120 = ((function (G__2115_2118,G__2116_2119){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2115_2118,G__2116_2119))
+;
+goog.object.set(G__2115_2118,G__2116_2119,G__2117_2120);
+cljs.core.chunked_seq = (function cljs$core$chunked_seq(var_args){
+var G__2122 = arguments.length;
+switch (G__2122) {
+case 3:
+return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$3 = (function (vec,i,off){
+return (new cljs.core.ChunkedSeq(vec,cljs.core.array_for(vec,i),i,off,null,null));
+});
+
+cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4 = (function (vec,node,i,off){
+return (new cljs.core.ChunkedSeq(vec,node,i,off,null,null));
+});
+
+cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$5 = (function (vec,node,i,off,meta){
+return (new cljs.core.ChunkedSeq(vec,node,i,off,meta,null));
+});
+
+cljs.core.chunked_seq.cljs$lang$maxFixedArity = 5;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IVector}
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IKVReduce}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.ILookup}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.Subvec = (function (meta,v,start,end,__hash){
+this.meta = meta;
+this.v = v;
+this.start = start;
+this.end = end;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 167666463;
+this.cljs$lang$protocol_mask$partition1$ = 139264;
+});
+cljs.core.Subvec.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Subvec.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,n){
+var self__ = this;
+var coll__$1 = this;
+if((n < (0))){
+return null;
+} else {
+var idx = (self__.start + n);
+if((idx < self__.end)){
+return (new cljs.core.MapEntry(n,cljs.core._lookup.cljs$core$IFn$_invoke$arity$2(self__.v,idx),null));
+} else {
+return null;
+}
+}
+});
+
+cljs.core.Subvec.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.Subvec.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.Subvec.prototype.indexOf = (function() {
+var G__2131 = null;
+var G__2131__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2131__2 = (function (x,start__$1){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
+});
+G__2131 = function(x,start__$1){
+switch(arguments.length){
+case 1:
+return G__2131__1.call(this,x);
+case 2:
+return G__2131__2.call(this,x,start__$1);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2131.cljs$core$IFn$_invoke$arity$1 = G__2131__1;
+G__2131.cljs$core$IFn$_invoke$arity$2 = G__2131__2;
+return G__2131;
+})()
+;
+
+cljs.core.Subvec.prototype.lastIndexOf = (function() {
+var G__2132 = null;
+var G__2132__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2132__2 = (function (x,start__$1){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
+});
+G__2132 = function(x,start__$1){
+switch(arguments.length){
+case 1:
+return G__2132__1.call(this,x);
+case 2:
+return G__2132__2.call(this,x,start__$1);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2132.cljs$core$IFn$_invoke$arity$1 = G__2132__1;
+G__2132.cljs$core$IFn$_invoke$arity$2 = G__2132__2;
+return G__2132;
+})()
+;
+
+cljs.core.Subvec.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.Subvec.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
+var self__ = this;
+var coll__$1 = this;
+if(typeof k === 'number'){
+return coll__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+} else {
+return not_found;
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
+var self__ = this;
+var coll__$1 = this;
+var i = self__.start;
+var j = (0);
+var init__$1 = init;
+while(true){
+if((i < self__.end)){
+var init__$2 = (function (){var G__2125 = init__$1;
+var G__2126 = j;
+var G__2127 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,i);
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2125,G__2126,G__2127) : f.call(null,G__2125,G__2126,G__2127));
+})();
+if(cljs.core.reduced_QMARK_(init__$2)){
+return cljs.core.deref(init__$2);
+} else {
+var G__2133 = (i + (1));
+var G__2134 = (j + (1));
+var G__2135 = init__$2;
+i = G__2133;
+j = G__2134;
+init__$1 = G__2135;
+continue;
+}
+} else {
+return init__$1;
+}
+break;
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
+var self__ = this;
+var coll__$1 = this;
+if((((n < (0))) || ((self__.end <= (self__.start + n))))){
+return cljs.core.vector_index_out_of_bounds(n,(self__.end - self__.start));
+} else {
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,(self__.start + n));
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
+var self__ = this;
+var coll__$1 = this;
+if((((n < (0))) || ((self__.end <= (self__.start + n))))){
+return not_found;
+} else {
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$3(self__.v,(self__.start + n),not_found);
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (coll,n,val){
+var self__ = this;
+var coll__$1 = this;
+var v_pos = (self__.start + n);
+if((((n < (0))) || (((self__.end + (1)) <= v_pos)))){
+throw (new Error(["Index ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)," out of bounds [0,",cljs.core.str.cljs$core$IFn$_invoke$arity$1(coll__$1.cljs$core$ICounted$_count$arity$1(null)),"]"].join('')));
+} else {
+return cljs.core.build_subvec(self__.meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.v,v_pos,val),self__.start,(function (){var x__4024__auto__ = self__.end;
+var y__4025__auto__ = (v_pos + (1));
+return ((x__4024__auto__ > y__4025__auto__) ? x__4024__auto__ : y__4025__auto__);
+})(),null);
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if(((!((self__.v == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === self__.v.cljs$core$APersistentVector$))))?true:false):false)){
+return cljs.core.ranged_iterator(self__.v,self__.start,self__.end);
+} else {
+return cljs.core.seq_iter(coll__$1);
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.Subvec.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.Subvec(self__.meta,self__.v,self__.start,self__.end,self__.__hash));
+});
+
+cljs.core.Subvec.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (self__.end - self__.start);
+});
+
+cljs.core.Subvec.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,(self__.end - (1)));
+});
+
+cljs.core.Subvec.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.start === self__.end)){
+throw (new Error("Can't pop empty vector"));
+} else {
+return cljs.core.build_subvec(self__.meta,self__.v,self__.start,(self__.end - (1)),null);
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if(!((self__.start === self__.end))){
+return (new cljs.core.RSeq(coll__$1,((self__.end - self__.start) - (1)),null));
+} else {
+return null;
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.Subvec.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.PersistentVector.EMPTY,self__.meta);
+});
+
+cljs.core.Subvec.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+if(((!((self__.v == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === self__.v.cljs$core$APersistentVector$))))?true:false):false)){
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4(self__.v,f,self__.start,self__.end);
+} else {
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(coll__$1,f);
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,init){
+var self__ = this;
+var coll__$1 = this;
+if(((!((self__.v == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === self__.v.cljs$core$APersistentVector$))))?true:false):false)){
+return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5(self__.v,f,init,self__.start,self__.end);
+} else {
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(coll__$1,f,init);
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,key,val){
+var self__ = this;
+var coll__$1 = this;
+if(typeof key === 'number'){
+return coll__$1.cljs$core$IVector$_assoc_n$arity$3(null,key,val);
+} else {
+throw (new Error("Subvec's key for assoc must be a number."));
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var subvec_seq = ((function (coll__$1){
+return (function cljs$core$subvec_seq(i){
+if((i === self__.end)){
+return null;
+} else {
+return cljs.core.cons(cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,i),(new cljs.core.LazySeq(null,((function (coll__$1){
+return (function (){
+return cljs$core$subvec_seq((i + (1)));
+});})(coll__$1))
+,null,null)));
+}
+});})(coll__$1))
+;
+return subvec_seq(self__.start);
+});
+
+cljs.core.Subvec.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.build_subvec(meta__$1,self__.v,self__.start,self__.end,self__.__hash);
+});
+
+cljs.core.Subvec.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.build_subvec(self__.meta,cljs.core._assoc_n(self__.v,self__.end,o),self__.start,(self__.end + (1)),null);
+});
+
+cljs.core.Subvec.prototype.call = (function() {
+var G__2136 = null;
+var G__2136__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+var G__2136__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+G__2136 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2136__2.call(this,self__,k);
+case 3:
+return G__2136__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2136.cljs$core$IFn$_invoke$arity$2 = G__2136__2;
+G__2136.cljs$core$IFn$_invoke$arity$3 = G__2136__3;
+return G__2136;
+})()
+;
+
+cljs.core.Subvec.prototype.apply = (function (self__,args2124){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2124)));
+});
+
+cljs.core.Subvec.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+
+cljs.core.Subvec.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.Subvec.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$v,cljs.core.cst$sym$start,cljs.core.cst$sym$end,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Subvec.cljs$lang$type = true;
+
+cljs.core.Subvec.cljs$lang$ctorStr = "cljs.core/Subvec";
+
+cljs.core.Subvec.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Subvec");
+});
+
+/**
+ * Positional factory function for cljs.core/Subvec.
+ */
+cljs.core.__GT_Subvec = (function cljs$core$__GT_Subvec(meta,v,start,end,__hash){
+return (new cljs.core.Subvec(meta,v,start,end,__hash));
+});
+
+var G__2137_2140 = cljs.core.Subvec.prototype;
+var G__2138_2141 = cljs.core.ITER_SYMBOL;
+var G__2139_2142 = ((function (G__2137_2140,G__2138_2141){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2137_2140,G__2138_2141))
+;
+goog.object.set(G__2137_2140,G__2138_2141,G__2139_2142);
+cljs.core.build_subvec = (function cljs$core$build_subvec(meta,v,start,end,__hash){
+while(true){
+if((v instanceof cljs.core.Subvec)){
+var G__2143 = meta;
+var G__2144 = v.v;
+var G__2145 = (v.start + start);
+var G__2146 = (v.start + end);
+var G__2147 = __hash;
+meta = G__2143;
+v = G__2144;
+start = G__2145;
+end = G__2146;
+__hash = G__2147;
+continue;
+} else {
+if(cljs.core.vector_QMARK_(v)){
+} else {
+throw (new Error("v must satisfy IVector"));
+}
+
+var c_2148 = cljs.core.count(v);
+if((((start < (0))) || ((end < (0))) || ((start > c_2148)) || ((end > c_2148)))){
+throw (new Error("Index out of bounds"));
+} else {
+}
+
+return (new cljs.core.Subvec(meta,v,start,end,__hash));
+}
+break;
+}
+});
+/**
+ * Returns a persistent vector of the items in vector from
+ *   start (inclusive) to end (exclusive).  If end is not supplied,
+ *   defaults to (count vector). This operation is O(1) and very fast, as
+ *   the resulting vector shares structure with the original and no
+ *   trimming is done.
+ */
+cljs.core.subvec = (function cljs$core$subvec(var_args){
+var G__2150 = arguments.length;
+switch (G__2150) {
+case 2:
+return cljs.core.subvec.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.subvec.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.subvec.cljs$core$IFn$_invoke$arity$2 = (function (v,start){
+return cljs.core.subvec.cljs$core$IFn$_invoke$arity$3(v,start,cljs.core.count(v));
+});
+
+cljs.core.subvec.cljs$core$IFn$_invoke$arity$3 = (function (v,start,end){
+if(((!((start == null))) && (!((end == null))))){
+} else {
+throw (new Error("Assert failed: (and (not (nil? start)) (not (nil? end)))"));
+}
+
+return cljs.core.build_subvec(null,v,(start | (0)),(end | (0)),null);
+});
+
+cljs.core.subvec.cljs$lang$maxFixedArity = 3;
+
+cljs.core.tv_ensure_editable = (function cljs$core$tv_ensure_editable(edit,node){
+if((edit === node.edit)){
+return node;
+} else {
+return (new cljs.core.VectorNode(edit,cljs.core.aclone(node.arr)));
+}
+});
+cljs.core.tv_editable_root = (function cljs$core$tv_editable_root(node){
+return (new cljs.core.VectorNode({},cljs.core.aclone(node.arr)));
+});
+cljs.core.tv_editable_tail = (function cljs$core$tv_editable_tail(tl){
+var ret = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
+cljs.core.array_copy(tl,(0),ret,(0),tl.length);
+
+return ret;
+});
+cljs.core.tv_push_tail = (function cljs$core$tv_push_tail(tv,level,parent,tail_node){
+var ret = cljs.core.tv_ensure_editable(tv.root.edit,parent);
+var subidx = (((tv.cnt - (1)) >>> level) & (31));
+cljs.core.pv_aset(ret,subidx,(((level === (5)))?tail_node:(function (){var child = cljs.core.pv_aget(ret,subidx);
+if(!((child == null))){
+var G__2154 = tv;
+var G__2155 = (level - (5));
+var G__2156 = child;
+var G__2157 = tail_node;
+return (cljs.core.tv_push_tail.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tv_push_tail.cljs$core$IFn$_invoke$arity$4(G__2154,G__2155,G__2156,G__2157) : cljs.core.tv_push_tail.call(null,G__2154,G__2155,G__2156,G__2157));
+} else {
+return cljs.core.new_path(tv.root.edit,(level - (5)),tail_node);
+}
+})()));
+
+return ret;
+});
+cljs.core.tv_pop_tail = (function cljs$core$tv_pop_tail(tv,level,node){
+var node__$1 = cljs.core.tv_ensure_editable(tv.root.edit,node);
+var subidx = (((tv.cnt - (2)) >>> level) & (31));
+if((level > (5))){
+var new_child = (function (){var G__2158 = tv;
+var G__2159 = (level - (5));
+var G__2160 = cljs.core.pv_aget(node__$1,subidx);
+return (cljs.core.tv_pop_tail.cljs$core$IFn$_invoke$arity$3 ? cljs.core.tv_pop_tail.cljs$core$IFn$_invoke$arity$3(G__2158,G__2159,G__2160) : cljs.core.tv_pop_tail.call(null,G__2158,G__2159,G__2160));
+})();
+if((((new_child == null)) && ((subidx === (0))))){
+return null;
+} else {
+cljs.core.pv_aset(node__$1,subidx,new_child);
+
+return node__$1;
+}
+} else {
+if((subidx === (0))){
+return null;
+} else {
+cljs.core.pv_aset(node__$1,subidx,null);
+
+return node__$1;
+
+}
+}
+});
+cljs.core.unchecked_editable_array_for = (function cljs$core$unchecked_editable_array_for(tv,i){
+if((i >= cljs.core.tail_off(tv))){
+return tv.tail;
+} else {
+var root = tv.root;
+var node = root;
+var level = tv.shift;
+while(true){
+if((level > (0))){
+var G__2161 = cljs.core.tv_ensure_editable(root.edit,cljs.core.pv_aget(node,((i >>> level) & (31))));
+var G__2162 = (level - (5));
+node = G__2161;
+level = G__2162;
+continue;
+} else {
+return node.arr;
+}
+break;
+}
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ITransientCollection}
+ * @implements {cljs.core.ITransientVector}
+ * @implements {cljs.core.ITransientAssociative}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.TransientVector = (function (cnt,shift,root,tail){
+this.cnt = cnt;
+this.shift = shift;
+this.root = root;
+this.tail = tail;
+this.cljs$lang$protocol_mask$partition1$ = 88;
+this.cljs$lang$protocol_mask$partition0$ = 275;
+});
+cljs.core.TransientVector.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,o){
+var self__ = this;
+var tcoll__$1 = this;
+if(self__.root.edit){
+if(((self__.cnt - cljs.core.tail_off(tcoll__$1)) < (32))){
+(self__.tail[(self__.cnt & (31))] = o);
+
+self__.cnt = (self__.cnt + (1));
+
+return tcoll__$1;
+} else {
+var tail_node = (new cljs.core.VectorNode(self__.root.edit,self__.tail));
+var new_tail = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
+(new_tail[(0)] = o);
+
+self__.tail = new_tail;
+
+if(((self__.cnt >>> (5)) > ((1) << self__.shift))){
+var new_root_array = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
+var new_shift = (self__.shift + (5));
+(new_root_array[(0)] = self__.root);
+
+(new_root_array[(1)] = cljs.core.new_path(self__.root.edit,self__.shift,tail_node));
+
+self__.root = (new cljs.core.VectorNode(self__.root.edit,new_root_array));
+
+self__.shift = new_shift;
+
+self__.cnt = (self__.cnt + (1));
+
+return tcoll__$1;
+} else {
+var new_root = cljs.core.tv_push_tail(tcoll__$1,self__.shift,self__.root,tail_node);
+self__.root = new_root;
+
+self__.cnt = (self__.cnt + (1));
+
+return tcoll__$1;
+}
+}
+} else {
+throw (new Error("conj! after persistent!"));
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
+var self__ = this;
+var tcoll__$1 = this;
+if(self__.root.edit){
+self__.root.edit = null;
+
+var len = (self__.cnt - cljs.core.tail_off(tcoll__$1));
+var trimmed_tail = (new Array(len));
+cljs.core.array_copy(self__.tail,(0),trimmed_tail,(0),len);
+
+return (new cljs.core.PersistentVector(null,self__.cnt,self__.shift,self__.root,trimmed_tail,null));
+} else {
+throw (new Error("persistent! called twice"));
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 = (function (tcoll,key,val){
+var self__ = this;
+var tcoll__$1 = this;
+if(typeof key === 'number'){
+return tcoll__$1.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3(null,key,val);
+} else {
+throw (new Error("TransientVector's key for assoc! must be a number."));
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3 = (function (tcoll,n,val){
+var self__ = this;
+var tcoll__$1 = this;
+if(self__.root.edit){
+if(((((0) <= n)) && ((n < self__.cnt)))){
+if((cljs.core.tail_off(tcoll__$1) <= n)){
+(self__.tail[(n & (31))] = val);
+
+return tcoll__$1;
+} else {
+var new_root = (function (){var fexpr__2164 = ((function (tcoll__$1){
+return (function cljs$core$go(level,node){
+var node__$1 = cljs.core.tv_ensure_editable(self__.root.edit,node);
+if((level === (0))){
+cljs.core.pv_aset(node__$1,(n & (31)),val);
+
+return node__$1;
+} else {
+var subidx = ((n >>> level) & (31));
+cljs.core.pv_aset(node__$1,subidx,cljs$core$go((level - (5)),cljs.core.pv_aget(node__$1,subidx)));
+
+return node__$1;
+}
+});})(tcoll__$1))
+;
+return fexpr__2164(self__.shift,self__.root);
+})();
+self__.root = new_root;
+
+return tcoll__$1;
+}
+} else {
+if((n === self__.cnt)){
+return tcoll__$1.cljs$core$ITransientCollection$_conj_BANG_$arity$2(null,val);
+} else {
+throw (new Error(["Index ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)," out of bounds for TransientVector of length",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.cnt)].join('')));
+
+}
+}
+} else {
+throw (new Error("assoc! after persistent!"));
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$ITransientVector$_pop_BANG_$arity$1 = (function (tcoll){
+var self__ = this;
+var tcoll__$1 = this;
+if(self__.root.edit){
+if((self__.cnt === (0))){
+throw (new Error("Can't pop empty vector"));
+} else {
+if(((1) === self__.cnt)){
+self__.cnt = (0);
+
+return tcoll__$1;
+} else {
+if((((self__.cnt - (1)) & (31)) > (0))){
+self__.cnt = (self__.cnt - (1));
+
+return tcoll__$1;
+} else {
+var new_tail = cljs.core.unchecked_editable_array_for(tcoll__$1,(self__.cnt - (2)));
+var new_root = (function (){var nr = cljs.core.tv_pop_tail(tcoll__$1,self__.shift,self__.root);
+if(!((nr == null))){
+return nr;
+} else {
+return (new cljs.core.VectorNode(self__.root.edit,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]));
+}
+})();
+if(((((5) < self__.shift)) && ((cljs.core.pv_aget(new_root,(1)) == null)))){
+var new_root__$1 = cljs.core.tv_ensure_editable(self__.root.edit,cljs.core.pv_aget(new_root,(0)));
+self__.root = new_root__$1;
+
+self__.shift = (self__.shift - (5));
+
+self__.cnt = (self__.cnt - (1));
+
+self__.tail = new_tail;
+
+return tcoll__$1;
+} else {
+self__.root = new_root;
+
+self__.cnt = (self__.cnt - (1));
+
+self__.tail = new_tail;
+
+return tcoll__$1;
+}
+
+}
+}
+}
+} else {
+throw (new Error("pop! after persistent!"));
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if(self__.root.edit){
+return self__.cnt;
+} else {
+throw (new Error("count after persistent!"));
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
+var self__ = this;
+var coll__$1 = this;
+if(self__.root.edit){
+return (cljs.core.array_for(coll__$1,n)[(n & (31))]);
+} else {
+throw (new Error("nth after persistent!"));
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
+var self__ = this;
+var coll__$1 = this;
+if(((((0) <= n)) && ((n < self__.cnt)))){
+return coll__$1.cljs$core$IIndexed$_nth$arity$2(null,n);
+} else {
+return not_found;
+}
+});
+
+cljs.core.TransientVector.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.TransientVector.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
+var self__ = this;
+var coll__$1 = this;
+if(typeof k === 'number'){
+return coll__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+} else {
+return not_found;
+}
+});
+
+cljs.core.TransientVector.prototype.call = (function() {
+var G__2165 = null;
+var G__2165__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+var G__2165__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+G__2165 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2165__2.call(this,self__,k);
+case 3:
+return G__2165__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2165.cljs$core$IFn$_invoke$arity$2 = G__2165__2;
+G__2165.cljs$core$IFn$_invoke$arity$3 = G__2165__3;
+return G__2165;
+})()
+;
+
+cljs.core.TransientVector.prototype.apply = (function (self__,args2163){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2163)));
+});
+
+cljs.core.TransientVector.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+
+cljs.core.TransientVector.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.TransientVector.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$cnt,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$shift,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$root,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$tail,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.TransientVector.cljs$lang$type = true;
+
+cljs.core.TransientVector.cljs$lang$ctorStr = "cljs.core/TransientVector";
+
+cljs.core.TransientVector.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/TransientVector");
+});
+
+/**
+ * Positional factory function for cljs.core/TransientVector.
+ */
+cljs.core.__GT_TransientVector = (function cljs$core$__GT_TransientVector(cnt,shift,root,tail){
+return (new cljs.core.TransientVector(cnt,shift,root,tail));
+});
+
+
+/**
+* @constructor
+*/
+cljs.core.PersistentQueueIter = (function (fseq,riter){
+this.fseq = fseq;
+this.riter = riter;
+});
+cljs.core.PersistentQueueIter.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+var or__3936__auto__ = ((!((self__.fseq == null))) && (cljs.core.seq(self__.fseq)));
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+var and__3925__auto__ = !((self__.riter == null));
+if(and__3925__auto__){
+return self__.riter.hasNext();
+} else {
+return and__3925__auto__;
+}
+}
+});
+
+cljs.core.PersistentQueueIter.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+if(!((self__.fseq == null))){
+var ret = cljs.core.first(self__.fseq);
+self__.fseq = cljs.core.next(self__.fseq);
+
+return ret;
+} else {
+if(((!((self__.riter == null))) && (self__.riter.hasNext()))){
+return self__.riter.next();
+} else {
+throw (new Error("No such element"));
+
+}
+}
+});
+
+cljs.core.PersistentQueueIter.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.PersistentQueueIter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$fseq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$riter], null);
+});
+
+cljs.core.PersistentQueueIter.cljs$lang$type = true;
+
+cljs.core.PersistentQueueIter.cljs$lang$ctorStr = "cljs.core/PersistentQueueIter";
+
+cljs.core.PersistentQueueIter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentQueueIter");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentQueueIter.
+ */
+cljs.core.__GT_PersistentQueueIter = (function cljs$core$__GT_PersistentQueueIter(fseq,riter){
+return (new cljs.core.PersistentQueueIter(fseq,riter));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+*/
+cljs.core.PersistentQueueSeq = (function (meta,front,rear,__hash){
+this.meta = meta;
+this.front = front;
+this.rear = rear;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 31850700;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.PersistentQueueSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentQueueSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentQueueSeq.prototype.indexOf = (function() {
+var G__2166 = null;
+var G__2166__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2166__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2166 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2166__1.call(this,x);
+case 2:
+return G__2166__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2166.cljs$core$IFn$_invoke$arity$1 = G__2166__1;
+G__2166.cljs$core$IFn$_invoke$arity$2 = G__2166__2;
+return G__2166;
+})()
+;
+
+cljs.core.PersistentQueueSeq.prototype.lastIndexOf = (function() {
+var G__2167 = null;
+var G__2167__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2167__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2167 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2167__1.call(this,x);
+case 2:
+return G__2167__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2167.cljs$core$IFn$_invoke$arity$1 = G__2167__1;
+G__2167.cljs$core$IFn$_invoke$arity$2 = G__2167__2;
+return G__2167;
+})()
+;
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var temp__5455__auto__ = cljs.core.next(self__.front);
+if(temp__5455__auto__){
+var f1 = temp__5455__auto__;
+return (new cljs.core.PersistentQueueSeq(self__.meta,f1,self__.rear,null));
+} else {
+if(!((self__.rear == null))){
+return (new cljs.core.PersistentQueueSeq(self__.meta,self__.rear,null,null));
+} else {
+return null;
+}
+}
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.first(self__.front);
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var temp__5455__auto__ = cljs.core.next(self__.front);
+if(temp__5455__auto__){
+var f1 = temp__5455__auto__;
+return (new cljs.core.PersistentQueueSeq(self__.meta,f1,self__.rear,null));
+} else {
+if((self__.rear == null)){
+return coll__$1.cljs$core$IEmptyableCollection$_empty$arity$1(null);
+} else {
+return (new cljs.core.PersistentQueueSeq(self__.meta,self__.rear,null,null));
+}
+}
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentQueueSeq(meta__$1,self__.front,self__.rear,self__.__hash));
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.PersistentQueueSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$front,cljs.core.cst$sym$rear,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentQueueSeq.cljs$lang$type = true;
+
+cljs.core.PersistentQueueSeq.cljs$lang$ctorStr = "cljs.core/PersistentQueueSeq";
+
+cljs.core.PersistentQueueSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentQueueSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentQueueSeq.
+ */
+cljs.core.__GT_PersistentQueueSeq = (function cljs$core$__GT_PersistentQueueSeq(meta,front,rear,__hash){
+return (new cljs.core.PersistentQueueSeq(meta,front,rear,__hash));
+});
+
+var G__2168_2171 = cljs.core.PersistentQueueSeq.prototype;
+var G__2169_2172 = cljs.core.ITER_SYMBOL;
+var G__2170_2173 = ((function (G__2168_2171,G__2169_2172){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2168_2171,G__2169_2172))
+;
+goog.object.set(G__2168_2171,G__2169_2172,G__2170_2173);
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+*/
+cljs.core.PersistentQueue = (function (meta,count,front,rear,__hash){
+this.meta = meta;
+this.count = count;
+this.front = front;
+this.rear = rear;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition1$ = 139264;
+this.cljs$lang$protocol_mask$partition0$ = 31858766;
+});
+cljs.core.PersistentQueue.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentQueue.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentQueue.prototype.indexOf = (function() {
+var G__2174 = null;
+var G__2174__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2174__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2174 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2174__1.call(this,x);
+case 2:
+return G__2174__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2174.cljs$core$IFn$_invoke$arity$1 = G__2174__1;
+G__2174.cljs$core$IFn$_invoke$arity$2 = G__2174__2;
+return G__2174;
+})()
+;
+
+cljs.core.PersistentQueue.prototype.lastIndexOf = (function() {
+var G__2175 = null;
+var G__2175__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(self__.count.cljs$core$IFn$_invoke$arity$1 ? self__.count.cljs$core$IFn$_invoke$arity$1(coll) : self__.count.call(null,coll)));
+});
+var G__2175__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2175 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2175__1.call(this,x);
+case 2:
+return G__2175__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2175.cljs$core$IFn$_invoke$arity$1 = G__2175__1;
+G__2175.cljs$core$IFn$_invoke$arity$2 = G__2175__2;
+return G__2175;
+})()
+;
+
+cljs.core.PersistentQueue.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentQueueIter(self__.front,cljs.core._iterator(self__.rear)));
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentQueue(self__.meta,self__.count,self__.front,self__.rear,self__.__hash));
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.count;
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.first(self__.front);
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if(cljs.core.truth_(self__.front)){
+var temp__5455__auto__ = cljs.core.next(self__.front);
+if(temp__5455__auto__){
+var f1 = temp__5455__auto__;
+return (new cljs.core.PersistentQueue(self__.meta,(self__.count - (1)),f1,self__.rear,null));
+} else {
+return (new cljs.core.PersistentQueue(self__.meta,(self__.count - (1)),cljs.core.seq(self__.rear),cljs.core.PersistentVector.EMPTY,null));
+}
+} else {
+return coll__$1;
+}
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.PersistentQueue.EMPTY,self__.meta);
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.first(self__.front);
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.rest(cljs.core.seq(coll__$1));
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var rear__$1 = cljs.core.seq(self__.rear);
+if(cljs.core.truth_((function (){var or__3936__auto__ = self__.front;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return rear__$1;
+}
+})())){
+return (new cljs.core.PersistentQueueSeq(null,self__.front,cljs.core.seq(rear__$1),null));
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentQueue(meta__$1,self__.count,self__.front,self__.rear,self__.__hash));
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+if(cljs.core.truth_(self__.front)){
+return (new cljs.core.PersistentQueue(self__.meta,(self__.count + (1)),self__.front,cljs.core.conj.cljs$core$IFn$_invoke$arity$2((function (){var or__3936__auto__ = self__.rear;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.PersistentVector.EMPTY;
+}
+})(),o),null));
+} else {
+return (new cljs.core.PersistentQueue(self__.meta,(self__.count + (1)),cljs.core.conj.cljs$core$IFn$_invoke$arity$2(self__.front,o),cljs.core.PersistentVector.EMPTY,null));
+}
+});
+
+cljs.core.PersistentQueue.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$count,cljs.core.cst$sym$front,cljs.core.cst$sym$rear,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentQueue.cljs$lang$type = true;
+
+cljs.core.PersistentQueue.cljs$lang$ctorStr = "cljs.core/PersistentQueue";
+
+cljs.core.PersistentQueue.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentQueue");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentQueue.
+ */
+cljs.core.__GT_PersistentQueue = (function cljs$core$__GT_PersistentQueue(meta,count,front,rear,__hash){
+return (new cljs.core.PersistentQueue(meta,count,front,rear,__hash));
+});
+
+cljs.core.PersistentQueue.EMPTY = (new cljs.core.PersistentQueue(null,(0),null,cljs.core.PersistentVector.EMPTY,cljs.core.empty_ordered_hash));
+var G__2176_2179 = cljs.core.PersistentQueue.prototype;
+var G__2177_2180 = cljs.core.ITER_SYMBOL;
+var G__2178_2181 = ((function (G__2176_2179,G__2177_2180){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2176_2179,G__2177_2180))
+;
+goog.object.set(G__2176_2179,G__2177_2180,G__2178_2181);
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+*/
+cljs.core.NeverEquiv = (function (){
+this.cljs$lang$protocol_mask$partition0$ = 2097152;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.NeverEquiv.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.NeverEquiv.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
+var self__ = this;
+var o__$1 = this;
+return false;
+});
+
+cljs.core.NeverEquiv.getBasis = (function (){
+return cljs.core.PersistentVector.EMPTY;
+});
+
+cljs.core.NeverEquiv.cljs$lang$type = true;
+
+cljs.core.NeverEquiv.cljs$lang$ctorStr = "cljs.core/NeverEquiv";
+
+cljs.core.NeverEquiv.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/NeverEquiv");
+});
+
+/**
+ * Positional factory function for cljs.core/NeverEquiv.
+ */
+cljs.core.__GT_NeverEquiv = (function cljs$core$__GT_NeverEquiv(){
+return (new cljs.core.NeverEquiv());
+});
+
+cljs.core.never_equiv = (new cljs.core.NeverEquiv());
+/**
+ * Test map equivalence. Returns true if x equals y, otherwise returns false.
+ */
+cljs.core.equiv_map = (function cljs$core$equiv_map(x,y){
+return cljs.core.boolean$(((((cljs.core.map_QMARK_(y)) && (!(cljs.core.record_QMARK_(y)))))?(((cljs.core.count(x) === cljs.core.count(y)))?((((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition0$ & (1048576))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IKVReduce$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IKVReduce,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IKVReduce,x)))?cljs.core.reduce_kv((function (_,k,v){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(y,k,cljs.core.never_equiv),v)){
+return true;
+} else {
+return cljs.core.reduced(false);
+}
+}),true,x):cljs.core.every_QMARK_((function (xkv){
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(y,cljs.core.first(xkv),cljs.core.never_equiv),cljs.core.second(xkv));
+}),x)):null):null));
+});
+cljs.core.scan_array = (function cljs$core$scan_array(incr,k,array){
+var len = array.length;
+var i = (0);
+while(true){
+if((i < len)){
+if((k === (array[i]))){
+return i;
+} else {
+var G__2183 = (i + incr);
+i = G__2183;
+continue;
+}
+} else {
+return null;
+}
+break;
+}
+});
+cljs.core.obj_map_compare_keys = (function cljs$core$obj_map_compare_keys(a,b){
+var a__$1 = cljs.core.hash(a);
+var b__$1 = cljs.core.hash(b);
+if((a__$1 < b__$1)){
+return (-1);
+} else {
+if((a__$1 > b__$1)){
+return (1);
+} else {
+return (0);
+
+}
+}
+});
+cljs.core.obj_map__GT_hash_map = (function cljs$core$obj_map__GT_hash_map(m,k,v){
+var ks = m.keys;
+var len = ks.length;
+var so = m.strobj;
+var mm = cljs.core.meta(m);
+var i = (0);
+var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
+while(true){
+if((i < len)){
+var k__$1 = (ks[i]);
+var G__2184 = (i + (1));
+var G__2185 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,k__$1,goog.object.get(so,k__$1));
+i = G__2184;
+out = G__2185;
+continue;
+} else {
+return cljs.core._with_meta(cljs.core.persistent_BANG_(cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,k,v)),mm);
+}
+break;
+}
+});
+cljs.core.obj_clone = (function cljs$core$obj_clone(obj,ks){
+var new_obj = {};
+var l = ks.length;
+var i_2191 = (0);
+while(true){
+if((i_2191 < l)){
+var k_2192 = (ks[i_2191]);
+var G__2188_2193 = new_obj;
+var G__2189_2194 = k_2192;
+var G__2190_2195 = goog.object.get(obj,k_2192);
+goog.object.set(G__2188_2193,G__2189_2194,G__2190_2195);
+
+var G__2196 = (i_2191 + (1));
+i_2191 = G__2196;
+continue;
+} else {
+}
+break;
+}
+
+return new_obj;
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IKVReduce}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEditableCollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.IMap}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.ObjMap = (function (meta,keys,strobj,update_count,__hash){
+this.meta = meta;
+this.keys = keys;
+this.strobj = strobj;
+this.update_count = update_count;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 16123663;
+this.cljs$lang$protocol_mask$partition1$ = 4;
+});
+cljs.core.ObjMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ObjMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+if(((goog.isString(k)) && (!((cljs.core.scan_array((1),k,self__.keys) == null))))){
+return (new cljs.core.MapEntry(k,(self__.strobj[k]),null));
+} else {
+return null;
+}
+});
+
+cljs.core.ObjMap.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.ObjMap.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.ObjMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.ObjMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
+var self__ = this;
+var coll__$1 = this;
+if(((goog.isString(k)) && (!((cljs.core.scan_array((1),k,self__.keys) == null))))){
+return (self__.strobj[k]);
+} else {
+return not_found;
+}
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
+var self__ = this;
+var coll__$1 = this;
+var len = self__.keys.length;
+var keys__$1 = self__.keys.sort(cljs.core.obj_map_compare_keys);
+var init__$1 = init;
+while(true){
+if(cljs.core.seq(keys__$1)){
+var k = cljs.core.first(keys__$1);
+var init__$2 = (function (){var G__2199 = init__$1;
+var G__2200 = k;
+var G__2201 = (self__.strobj[k]);
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2199,G__2200,G__2201) : f.call(null,G__2199,G__2200,G__2201));
+})();
+if(cljs.core.reduced_QMARK_(init__$2)){
+return cljs.core.deref(init__$2);
+} else {
+var G__2202 = cljs.core.rest(keys__$1);
+var G__2203 = init__$2;
+keys__$1 = G__2202;
+init__$1 = G__2203;
+continue;
+}
+} else {
+return init__$1;
+}
+break;
+}
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.ObjMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.keys.length;
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_map(coll__$1,other);
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.transient$(cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentHashMap.EMPTY,coll__$1));
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.ObjMap.EMPTY,self__.meta);
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+if(((goog.isString(k)) && (!((cljs.core.scan_array((1),k,self__.keys) == null))))){
+var new_keys = cljs.core.aclone(self__.keys);
+var new_strobj = cljs.core.obj_clone(self__.strobj,self__.keys);
+new_keys.splice(cljs.core.scan_array((1),k,new_keys),(1));
+
+delete new_strobj[k];
+
+return (new cljs.core.ObjMap(self__.meta,new_keys,new_strobj,(self__.update_count + (1)),null));
+} else {
+return coll__$1;
+}
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
+var self__ = this;
+var coll__$1 = this;
+if(goog.isString(k)){
+if((((self__.update_count > cljs.core.ObjMap.HASHMAP_THRESHOLD)) || ((self__.keys.length >= cljs.core.ObjMap.HASHMAP_THRESHOLD)))){
+return cljs.core.obj_map__GT_hash_map(coll__$1,k,v);
+} else {
+if(!((cljs.core.scan_array((1),k,self__.keys) == null))){
+var new_strobj = cljs.core.obj_clone(self__.strobj,self__.keys);
+goog.object.set(new_strobj,k,v);
+
+return (new cljs.core.ObjMap(self__.meta,self__.keys,new_strobj,(self__.update_count + (1)),null));
+} else {
+var new_strobj = cljs.core.obj_clone(self__.strobj,self__.keys);
+var new_keys = cljs.core.aclone(self__.keys);
+goog.object.set(new_strobj,k,v);
+
+new_keys.push(k);
+
+return (new cljs.core.ObjMap(self__.meta,new_keys,new_strobj,(self__.update_count + (1)),null));
+}
+}
+} else {
+return cljs.core.obj_map__GT_hash_map(coll__$1,k,v);
+}
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+if(((goog.isString(k)) && (!((cljs.core.scan_array((1),k,self__.keys) == null))))){
+return true;
+} else {
+return false;
+}
+});
+
+cljs.core.ObjMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.keys.length > (0))){
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (coll__$1){
+return (function (p1__2197_SHARP_){
+return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[p1__2197_SHARP_,(self__.strobj[p1__2197_SHARP_])],null));
+});})(coll__$1))
+,self__.keys.sort(cljs.core.obj_map_compare_keys));
+} else {
+return null;
+}
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.ObjMap(meta__$1,self__.keys,self__.strobj,self__.update_count,self__.__hash));
+});
+
+cljs.core.ObjMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
+var self__ = this;
+var coll__$1 = this;
+if(cljs.core.vector_QMARK_(entry)){
+return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,coll__$1,entry);
+}
+});
+
+cljs.core.ObjMap.prototype.call = (function() {
+var G__2204 = null;
+var G__2204__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+var G__2204__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+G__2204 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2204__2.call(this,self__,k);
+case 3:
+return G__2204__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2204.cljs$core$IFn$_invoke$arity$2 = G__2204__2;
+G__2204.cljs$core$IFn$_invoke$arity$3 = G__2204__3;
+return G__2204;
+})()
+;
+
+cljs.core.ObjMap.prototype.apply = (function (self__,args2198){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2198)));
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.ObjMap.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$keys,cljs.core.cst$sym$strobj,cljs.core.cst$sym$update_DASH_count,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ObjMap.cljs$lang$type = true;
+
+cljs.core.ObjMap.cljs$lang$ctorStr = "cljs.core/ObjMap";
+
+cljs.core.ObjMap.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ObjMap");
+});
+
+/**
+ * Positional factory function for cljs.core/ObjMap.
+ */
+cljs.core.__GT_ObjMap = (function cljs$core$__GT_ObjMap(meta,keys,strobj,update_count,__hash){
+return (new cljs.core.ObjMap(meta,keys,strobj,update_count,__hash));
+});
+
+cljs.core.ObjMap.EMPTY = (new cljs.core.ObjMap(null,[],{},(0),cljs.core.empty_unordered_hash));
+cljs.core.ObjMap.HASHMAP_THRESHOLD = (8);
+cljs.core.ObjMap.fromObject = (function (ks,obj){
+return (new cljs.core.ObjMap(null,ks,obj,(0),null));
+});
+
+/**
+* @constructor
+*/
+cljs.core.RecordIter = (function (i,record,base_count,fields,ext_map_iter){
+this.i = i;
+this.record = record;
+this.base_count = base_count;
+this.fields = fields;
+this.ext_map_iter = ext_map_iter;
+});
+cljs.core.RecordIter.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+var or__3936__auto__ = (self__.i < self__.base_count);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return self__.ext_map_iter.hasNext();
+}
+});
+
+cljs.core.RecordIter.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+if((self__.i < self__.base_count)){
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$2(self__.fields,self__.i);
+self__.i = (self__.i + (1));
+
+return (new cljs.core.MapEntry(k,cljs.core._lookup.cljs$core$IFn$_invoke$arity$2(self__.record,k),null));
+} else {
+return self__.ext_map_iter.next();
+}
+});
+
+cljs.core.RecordIter.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.RecordIter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$record,cljs.core.cst$sym$base_DASH_count,cljs.core.cst$sym$fields,cljs.core.cst$sym$ext_DASH_map_DASH_iter], null);
+});
+
+cljs.core.RecordIter.cljs$lang$type = true;
+
+cljs.core.RecordIter.cljs$lang$ctorStr = "cljs.core/RecordIter";
+
+cljs.core.RecordIter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/RecordIter");
+});
+
+/**
+ * Positional factory function for cljs.core/RecordIter.
+ */
+cljs.core.__GT_RecordIter = (function cljs$core$__GT_RecordIter(i,record,base_count,fields,ext_map_iter){
+return (new cljs.core.RecordIter(i,record,base_count,fields,ext_map_iter));
+});
+
+
+/**
+* @constructor
+*/
+cljs.core.ES6EntriesIterator = (function (s){
+this.s = s;
+});
+cljs.core.ES6EntriesIterator.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+if(!((self__.s == null))){
+var vec__2207 = cljs.core.first(self__.s);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2207,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2207,(1),null);
+self__.s = cljs.core.next(self__.s);
+
+return ({"value": [k,v], "done": false});
+} else {
+return ({"value": null, "done": true});
+}
+});
+
+cljs.core.ES6EntriesIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ES6EntriesIterator.cljs$lang$type = true;
+
+cljs.core.ES6EntriesIterator.cljs$lang$ctorStr = "cljs.core/ES6EntriesIterator";
+
+cljs.core.ES6EntriesIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ES6EntriesIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/ES6EntriesIterator.
+ */
+cljs.core.__GT_ES6EntriesIterator = (function cljs$core$__GT_ES6EntriesIterator(s){
+return (new cljs.core.ES6EntriesIterator(s));
+});
+
+cljs.core.es6_entries_iterator = (function cljs$core$es6_entries_iterator(coll){
+return (new cljs.core.ES6EntriesIterator(cljs.core.seq(coll)));
+});
+
+/**
+* @constructor
+*/
+cljs.core.ES6SetEntriesIterator = (function (s){
+this.s = s;
+});
+cljs.core.ES6SetEntriesIterator.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+if(!((self__.s == null))){
+var x = cljs.core.first(self__.s);
+self__.s = cljs.core.next(self__.s);
+
+return ({"value": [x,x], "done": false});
+} else {
+return ({"value": null, "done": true});
+}
+});
+
+cljs.core.ES6SetEntriesIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ES6SetEntriesIterator.cljs$lang$type = true;
+
+cljs.core.ES6SetEntriesIterator.cljs$lang$ctorStr = "cljs.core/ES6SetEntriesIterator";
+
+cljs.core.ES6SetEntriesIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ES6SetEntriesIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/ES6SetEntriesIterator.
+ */
+cljs.core.__GT_ES6SetEntriesIterator = (function cljs$core$__GT_ES6SetEntriesIterator(s){
+return (new cljs.core.ES6SetEntriesIterator(s));
+});
+
+cljs.core.es6_set_entries_iterator = (function cljs$core$es6_set_entries_iterator(coll){
+return (new cljs.core.ES6SetEntriesIterator(cljs.core.seq(coll)));
+});
+cljs.core.array_index_of_nil_QMARK_ = (function cljs$core$array_index_of_nil_QMARK_(arr){
+var len = arr.length;
+var i = (0);
+while(true){
+if((len <= i)){
+return (-1);
+} else {
+if(((arr[i]) == null)){
+return i;
+} else {
+var G__2210 = (i + (2));
+i = G__2210;
+continue;
+
+}
+}
+break;
+}
+});
+cljs.core.array_index_of_keyword_QMARK_ = (function cljs$core$array_index_of_keyword_QMARK_(arr,k){
+var len = arr.length;
+var kstr = k.fqn;
+var i = (0);
+while(true){
+if((len <= i)){
+return (-1);
+} else {
+if(((((arr[i]) instanceof cljs.core.Keyword)) && ((kstr === (arr[i]).fqn)))){
+return i;
+} else {
+var G__2211 = (i + (2));
+i = G__2211;
+continue;
+
+}
+}
+break;
+}
+});
+cljs.core.array_index_of_symbol_QMARK_ = (function cljs$core$array_index_of_symbol_QMARK_(arr,k){
+var len = arr.length;
+var kstr = k.str;
+var i = (0);
+while(true){
+if((len <= i)){
+return (-1);
+} else {
+if(((((arr[i]) instanceof cljs.core.Symbol)) && ((kstr === (arr[i]).str)))){
+return i;
+} else {
+var G__2212 = (i + (2));
+i = G__2212;
+continue;
+
+}
+}
+break;
+}
+});
+cljs.core.array_index_of_identical_QMARK_ = (function cljs$core$array_index_of_identical_QMARK_(arr,k){
+var len = arr.length;
+var i = (0);
+while(true){
+if((len <= i)){
+return (-1);
+} else {
+if((k === (arr[i]))){
+return i;
+} else {
+var G__2213 = (i + (2));
+i = G__2213;
+continue;
+
+}
+}
+break;
+}
+});
+cljs.core.array_index_of_equiv_QMARK_ = (function cljs$core$array_index_of_equiv_QMARK_(arr,k){
+var len = arr.length;
+var i = (0);
+while(true){
+if((len <= i)){
+return (-1);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(k,(arr[i]))){
+return i;
+} else {
+var G__2214 = (i + (2));
+i = G__2214;
+continue;
+
+}
+}
+break;
+}
+});
+cljs.core.array_index_of = (function cljs$core$array_index_of(arr,k){
+if((k instanceof cljs.core.Keyword)){
+return cljs.core.array_index_of_keyword_QMARK_(arr,k);
+} else {
+if(((goog.isString(k)) || (typeof k === 'number'))){
+return cljs.core.array_index_of_identical_QMARK_(arr,k);
+} else {
+if((k instanceof cljs.core.Symbol)){
+return cljs.core.array_index_of_symbol_QMARK_(arr,k);
+} else {
+if((k == null)){
+return cljs.core.array_index_of_nil_QMARK_(arr);
+} else {
+return cljs.core.array_index_of_equiv_QMARK_(arr,k);
+
+}
+}
+}
+}
+});
+cljs.core.array_map_index_of = (function cljs$core$array_map_index_of(m,k){
+return cljs.core.array_index_of(m.arr,k);
+});
+cljs.core.array_extend_kv = (function cljs$core$array_extend_kv(arr,k,v){
+var l = arr.length;
+var narr = (new Array((l + (2))));
+var i_2215 = (0);
+while(true){
+if((i_2215 < l)){
+(narr[i_2215] = (arr[i_2215]));
+
+var G__2216 = (i_2215 + (1));
+i_2215 = G__2216;
+continue;
+} else {
+}
+break;
+}
+
+(narr[l] = k);
+
+(narr[(l + (1))] = v);
+
+return narr;
+});
+cljs.core.array_map_extend_kv = (function cljs$core$array_map_extend_kv(m,k,v){
+return cljs.core.array_extend_kv(m.arr,k,v);
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IVector}
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.IMapEntry}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.ILookup}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.MapEntry = (function (key,val,__hash){
+this.key = key;
+this.val = val;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 166619935;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.MapEntry.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.MapEntry.prototype.cljs$core$IFind$_find$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+var G__2218 = k;
+switch (G__2218) {
+case (0):
+return (new cljs.core.MapEntry((0),self__.key,null));
+
+break;
+case (1):
+return (new cljs.core.MapEntry((1),self__.val,null));
+
+break;
+default:
+return null;
+
+}
+});
+
+cljs.core.MapEntry.prototype.indexOf = (function() {
+var G__2220 = null;
+var G__2220__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2220__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2220 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2220__1.call(this,x);
+case 2:
+return G__2220__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2220.cljs$core$IFn$_invoke$arity$1 = G__2220__1;
+G__2220.cljs$core$IFn$_invoke$arity$2 = G__2220__2;
+return G__2220;
+})()
+;
+
+cljs.core.MapEntry.prototype.lastIndexOf = (function() {
+var G__2221 = null;
+var G__2221__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2221__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2221 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2221__1.call(this,x);
+case 2:
+return G__2221__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2221.cljs$core$IFn$_invoke$arity$1 = G__2221__1;
+G__2221.cljs$core$IFn$_invoke$arity$2 = G__2221__2;
+return G__2221;
+})()
+;
+
+cljs.core.MapEntry.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,null);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (node,k,not_found){
+var self__ = this;
+var node__$1 = this;
+return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (node,n){
+var self__ = this;
+var node__$1 = this;
+if((n === (0))){
+return self__.key;
+} else {
+if((n === (1))){
+return self__.val;
+} else {
+throw (new Error("Index out of bounds"));
+
+}
+}
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (node,n,not_found){
+var self__ = this;
+var node__$1 = this;
+if((n === (0))){
+return self__.key;
+} else {
+if((n === (1))){
+return self__.val;
+} else {
+return not_found;
+
+}
+}
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (node,n,v){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null).cljs$core$IVector$_assoc_n$arity$3(null,n,v);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IMeta$_meta$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return null;
+});
+
+cljs.core.MapEntry.prototype.cljs$core$ICounted$_count$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (2);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IMapEntry$_key$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.key;
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IMapEntry$_val$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.val;
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IStack$_peek$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.val;
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IStack$_pop$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key], null);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (new cljs.core.IndexedSeq([self__.val,self__.key],(0),null));
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return null;
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (node,f){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(node__$1,f);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (node,f,start){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(node__$1,f,start);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (node,k,v){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),k,v);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+return (((k === (0))) || ((k === (1))));
+});
+
+cljs.core.MapEntry.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (new cljs.core.IndexedSeq([self__.key,self__.val],(0),null));
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (node,meta){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.with_meta(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),meta);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$ICollection$_conj$arity$2 = (function (node,o){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val,o], null);
+});
+
+cljs.core.MapEntry.prototype.call = (function() {
+var G__2222 = null;
+var G__2222__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var node = self____$1;
+return node.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+var G__2222__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var node = self____$1;
+return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+G__2222 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2222__2.call(this,self__,k);
+case 3:
+return G__2222__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2222.cljs$core$IFn$_invoke$arity$2 = G__2222__2;
+G__2222.cljs$core$IFn$_invoke$arity$3 = G__2222__3;
+return G__2222;
+})()
+;
+
+cljs.core.MapEntry.prototype.apply = (function (self__,args2217){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2217)));
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var node = this;
+return node.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var node = this;
+return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.MapEntry.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$key,cljs.core.cst$sym$val,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.MapEntry.cljs$lang$type = true;
+
+cljs.core.MapEntry.cljs$lang$ctorStr = "cljs.core/MapEntry";
+
+cljs.core.MapEntry.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/MapEntry");
+});
+
+/**
+ * Positional factory function for cljs.core/MapEntry.
+ */
+cljs.core.__GT_MapEntry = (function cljs$core$__GT_MapEntry(key,val,__hash){
+return (new cljs.core.MapEntry(key,val,__hash));
+});
+
+/**
+ * Returns true if x satisfies IMapEntry
+ */
+cljs.core.map_entry_QMARK_ = (function cljs$core$map_entry_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (2048))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IMapEntry$)))){
+return true;
+} else {
+return false;
+}
+} else {
+return false;
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.PersistentArrayMapSeq = (function (arr,i,_meta){
+this.arr = arr;
+this.i = i;
+this._meta = _meta;
+this.cljs$lang$protocol_mask$partition0$ = 32374990;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.PersistentArrayMapSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.indexOf = (function() {
+var G__2224 = null;
+var G__2224__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2224__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2224 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2224__1.call(this,x);
+case 2:
+return G__2224__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2224.cljs$core$IFn$_invoke$arity$1 = G__2224__1;
+G__2224.cljs$core$IFn$_invoke$arity$2 = G__2224__2;
+return G__2224;
+})()
+;
+
+cljs.core.PersistentArrayMapSeq.prototype.lastIndexOf = (function() {
+var G__2225 = null;
+var G__2225__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2225__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2225 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2225__1.call(this,x);
+case 2:
+return G__2225__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2225.cljs$core$IFn$_invoke$arity$1 = G__2225__1;
+G__2225.cljs$core$IFn$_invoke$arity$2 = G__2225__2;
+return G__2225;
+})()
+;
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__._meta;
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.i < (self__.arr.length - (2)))){
+return (new cljs.core.PersistentArrayMapSeq(self__.arr,(self__.i + (2)),self__._meta));
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return ((self__.arr.length - self__.i) / (2));
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.hash_ordered_coll(coll__$1);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__._meta);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.MapEntry((self__.arr[self__.i]),(self__.arr[(self__.i + (1))]),null));
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.i < (self__.arr.length - (2)))){
+return (new cljs.core.PersistentArrayMapSeq(self__.arr,(self__.i + (2)),self__._meta));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentArrayMapSeq(self__.arr,self__.i,new_meta));
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.PersistentArrayMapSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.cst$sym$i,cljs.core.cst$sym$_meta], null);
+});
+
+cljs.core.PersistentArrayMapSeq.cljs$lang$type = true;
+
+cljs.core.PersistentArrayMapSeq.cljs$lang$ctorStr = "cljs.core/PersistentArrayMapSeq";
+
+cljs.core.PersistentArrayMapSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentArrayMapSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentArrayMapSeq.
+ */
+cljs.core.__GT_PersistentArrayMapSeq = (function cljs$core$__GT_PersistentArrayMapSeq(arr,i,_meta){
+return (new cljs.core.PersistentArrayMapSeq(arr,i,_meta));
+});
+
+var G__2226_2229 = cljs.core.PersistentArrayMapSeq.prototype;
+var G__2227_2230 = cljs.core.ITER_SYMBOL;
+var G__2228_2231 = ((function (G__2226_2229,G__2227_2230){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2226_2229,G__2227_2230))
+;
+goog.object.set(G__2226_2229,G__2227_2230,G__2228_2231);
+cljs.core.persistent_array_map_seq = (function cljs$core$persistent_array_map_seq(arr,i,_meta){
+if((i <= (arr.length - (2)))){
+return (new cljs.core.PersistentArrayMapSeq(arr,i,_meta));
+} else {
+return null;
+}
+});
+
+
+/**
+* @constructor
+*/
+cljs.core.PersistentArrayMapIterator = (function (arr,i,cnt){
+this.arr = arr;
+this.i = i;
+this.cnt = cnt;
+});
+cljs.core.PersistentArrayMapIterator.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+return (self__.i < self__.cnt);
+});
+
+cljs.core.PersistentArrayMapIterator.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+var ret = (new cljs.core.MapEntry((self__.arr[self__.i]),(self__.arr[(self__.i + (1))]),null));
+self__.i = (self__.i + (2));
+
+return ret;
+});
+
+cljs.core.PersistentArrayMapIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$cnt], null);
+});
+
+cljs.core.PersistentArrayMapIterator.cljs$lang$type = true;
+
+cljs.core.PersistentArrayMapIterator.cljs$lang$ctorStr = "cljs.core/PersistentArrayMapIterator";
+
+cljs.core.PersistentArrayMapIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentArrayMapIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentArrayMapIterator.
+ */
+cljs.core.__GT_PersistentArrayMapIterator = (function cljs$core$__GT_PersistentArrayMapIterator(arr,i,cnt){
+return (new cljs.core.PersistentArrayMapIterator(arr,i,cnt));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IKVReduce}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEditableCollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.IMap}
+ * @implements {cljs.core.ILookup}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.PersistentArrayMap = (function (meta,cnt,arr,__hash){
+this.meta = meta;
+this.cnt = cnt;
+this.arr = arr;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 16647951;
+this.cljs$lang$protocol_mask$partition1$ = 139268;
+});
+cljs.core.PersistentArrayMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+var idx = cljs.core.array_map_index_of(coll__$1,k);
+if((idx === (-1))){
+return null;
+} else {
+return (new cljs.core.MapEntry((self__.arr[idx]),(self__.arr[(idx + (1))]),null));
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentArrayMap.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentArrayMap.prototype.keys = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.keys(coll));
+});
+
+cljs.core.PersistentArrayMap.prototype.entries = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_entries_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentArrayMap.prototype.values = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.vals(coll));
+});
+
+cljs.core.PersistentArrayMap.prototype.has = (function (k){
+var self__ = this;
+var coll = this;
+return cljs.core.contains_QMARK_(coll,k);
+});
+
+cljs.core.PersistentArrayMap.prototype.get = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentArrayMap.prototype.forEach = (function (f){
+var self__ = this;
+var coll = this;
+var seq__2233 = cljs.core.seq(coll);
+var chunk__2234 = null;
+var count__2235 = (0);
+var i__2236 = (0);
+while(true){
+if((i__2236 < count__2235)){
+var vec__2237 = chunk__2234.cljs$core$IIndexed$_nth$arity$2(null,i__2236);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2237,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2237,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2249 = seq__2233;
+var G__2250 = chunk__2234;
+var G__2251 = count__2235;
+var G__2252 = (i__2236 + (1));
+seq__2233 = G__2249;
+chunk__2234 = G__2250;
+count__2235 = G__2251;
+i__2236 = G__2252;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__2233);
+if(temp__5457__auto__){
+var seq__2233__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__2233__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__2233__$1);
+var G__2253 = cljs.core.chunk_rest(seq__2233__$1);
+var G__2254 = c__4338__auto__;
+var G__2255 = cljs.core.count(c__4338__auto__);
+var G__2256 = (0);
+seq__2233 = G__2253;
+chunk__2234 = G__2254;
+count__2235 = G__2255;
+i__2236 = G__2256;
+continue;
+} else {
+var vec__2240 = cljs.core.first(seq__2233__$1);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2240,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2240,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2257 = cljs.core.next(seq__2233__$1);
+var G__2258 = null;
+var G__2259 = (0);
+var G__2260 = (0);
+seq__2233 = G__2257;
+chunk__2234 = G__2258;
+count__2235 = G__2259;
+i__2236 = G__2260;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
+var self__ = this;
+var coll__$1 = this;
+var idx = cljs.core.array_map_index_of(coll__$1,k);
+if((idx === (-1))){
+return not_found;
+} else {
+return (self__.arr[(idx + (1))]);
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
+var self__ = this;
+var coll__$1 = this;
+var len = self__.arr.length;
+var i = (0);
+var init__$1 = init;
+while(true){
+if((i < len)){
+var init__$2 = (function (){var G__2243 = init__$1;
+var G__2244 = (self__.arr[i]);
+var G__2245 = (self__.arr[(i + (1))]);
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2243,G__2244,G__2245) : f.call(null,G__2243,G__2244,G__2245));
+})();
+if(cljs.core.reduced_QMARK_(init__$2)){
+return cljs.core.deref(init__$2);
+} else {
+var G__2261 = (i + (2));
+var G__2262 = init__$2;
+i = G__2261;
+init__$1 = G__2262;
+continue;
+}
+} else {
+return init__$1;
+}
+break;
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return (new cljs.core.PersistentArrayMapIterator(self__.arr,(0),(self__.cnt * (2))));
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.PersistentArrayMap(self__.meta,self__.cnt,self__.arr,self__.__hash));
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.cnt;
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+if(((cljs.core.map_QMARK_(other)) && (!(cljs.core.record_QMARK_(other))))){
+var alen = self__.arr.length;
+var other__$1 = other;
+if((self__.cnt === other__$1.cljs$core$ICounted$_count$arity$1(null))){
+var i = (0);
+while(true){
+if((i < alen)){
+var v = other__$1.cljs$core$ILookup$_lookup$arity$3(null,(self__.arr[i]),cljs.core.lookup_sentinel);
+if(!((v === cljs.core.lookup_sentinel))){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((self__.arr[(i + (1))]),v)){
+var G__2263 = (i + (2));
+i = G__2263;
+continue;
+} else {
+return false;
+}
+} else {
+return false;
+}
+} else {
+return true;
+}
+break;
+}
+} else {
+return false;
+}
+} else {
+return false;
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.TransientArrayMap({},self__.arr.length,cljs.core.aclone(self__.arr)));
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.PersistentArrayMap.EMPTY,self__.meta);
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2(coll__$1,f);
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3(coll__$1,f,start);
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+var idx = cljs.core.array_map_index_of(coll__$1,k);
+if((idx >= (0))){
+var len = self__.arr.length;
+var new_len = (len - (2));
+if((new_len === (0))){
+return coll__$1.cljs$core$IEmptyableCollection$_empty$arity$1(null);
+} else {
+var new_arr = (new Array(new_len));
+var s = (0);
+var d = (0);
+while(true){
+if((s >= len)){
+return (new cljs.core.PersistentArrayMap(self__.meta,(self__.cnt - (1)),new_arr,null));
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(k,(self__.arr[s]))){
+var G__2264 = (s + (2));
+var G__2265 = d;
+s = G__2264;
+d = G__2265;
+continue;
+} else {
+(new_arr[d] = (self__.arr[s]));
+
+(new_arr[(d + (1))] = (self__.arr[(s + (1))]));
+
+var G__2266 = (s + (2));
+var G__2267 = (d + (2));
+s = G__2266;
+d = G__2267;
+continue;
+
+}
+}
+break;
+}
+}
+} else {
+return coll__$1;
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
+var self__ = this;
+var coll__$1 = this;
+var idx = cljs.core.array_map_index_of(coll__$1,k);
+if((idx === (-1))){
+if((self__.cnt < cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD)){
+var arr__$1 = cljs.core.array_map_extend_kv(coll__$1,k,v);
+return (new cljs.core.PersistentArrayMap(self__.meta,(self__.cnt + (1)),arr__$1,null));
+} else {
+return cljs.core._with_meta(cljs.core._assoc(cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentHashMap.EMPTY,coll__$1),k,v),self__.meta);
+}
+} else {
+if((v === (self__.arr[(idx + (1))]))){
+return coll__$1;
+} else {
+var arr__$1 = (function (){var G__2248 = cljs.core.aclone(self__.arr);
+(G__2248[(idx + (1))] = v);
+
+return G__2248;
+})();
+return (new cljs.core.PersistentArrayMap(self__.meta,self__.cnt,arr__$1,null));
+
+}
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return !((cljs.core.array_map_index_of(coll__$1,k) === (-1)));
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.persistent_array_map_seq(self__.arr,(0),null);
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentArrayMap(meta__$1,self__.cnt,self__.arr,self__.__hash));
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
+var self__ = this;
+var coll__$1 = this;
+if(cljs.core.vector_QMARK_(entry)){
+return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
+} else {
+var ret = coll__$1;
+var es = cljs.core.seq(entry);
+while(true){
+if((es == null)){
+return ret;
+} else {
+var e = cljs.core.first(es);
+if(cljs.core.vector_QMARK_(e)){
+var G__2268 = ret.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(1)));
+var G__2269 = cljs.core.next(es);
+ret = G__2268;
+es = G__2269;
+continue;
+} else {
+throw (new Error("conj on a map takes map entries or seqables of map entries"));
+}
+}
+break;
+}
+}
+});
+
+cljs.core.PersistentArrayMap.prototype.call = (function() {
+var G__2270 = null;
+var G__2270__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+var G__2270__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+G__2270 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2270__2.call(this,self__,k);
+case 3:
+return G__2270__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2270.cljs$core$IFn$_invoke$arity$2 = G__2270__2;
+G__2270.cljs$core$IFn$_invoke$arity$3 = G__2270__3;
+return G__2270;
+})()
+;
+
+cljs.core.PersistentArrayMap.prototype.apply = (function (self__,args2232){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2232)));
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentArrayMap.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$cnt,cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentArrayMap.cljs$lang$type = true;
+
+cljs.core.PersistentArrayMap.cljs$lang$ctorStr = "cljs.core/PersistentArrayMap";
+
+cljs.core.PersistentArrayMap.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentArrayMap");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentArrayMap.
+ */
+cljs.core.__GT_PersistentArrayMap = (function cljs$core$__GT_PersistentArrayMap(meta,cnt,arr,__hash){
+return (new cljs.core.PersistentArrayMap(meta,cnt,arr,__hash));
+});
+
+cljs.core.PersistentArrayMap.EMPTY = (new cljs.core.PersistentArrayMap(null,(0),[],cljs.core.empty_unordered_hash));
+cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD = (8);
+cljs.core.PersistentArrayMap.fromArray = (function (arr,no_clone,no_check){
+var arr__$1 = ((no_clone)?arr:cljs.core.aclone(arr));
+var arr__$2 = ((no_check)?arr__$1:(function (){var ret = [];
+var i_2271 = (0);
+while(true){
+if((i_2271 < arr__$1.length)){
+var k_2272 = (arr__$1[i_2271]);
+var v_2273 = (arr__$1[(i_2271 + (1))]);
+var idx_2274 = cljs.core.array_index_of(ret,k_2272);
+if((idx_2274 === (-1))){
+ret.push(k_2272);
+
+ret.push(v_2273);
+} else {
+}
+
+var G__2275 = (i_2271 + (2));
+i_2271 = G__2275;
+continue;
+} else {
+}
+break;
+}
+
+return ret;
+})());
+var cnt = (arr__$2.length / (2));
+return (new cljs.core.PersistentArrayMap(null,cnt,arr__$2,null));
+});
+cljs.core.PersistentArrayMap.createWithCheck = (function (arr){
+var ret = [];
+var i_2277 = (0);
+while(true){
+if((i_2277 < arr.length)){
+var k_2278 = (arr[i_2277]);
+var v_2279 = (arr[(i_2277 + (1))]);
+var idx_2280 = cljs.core.array_index_of(ret,k_2278);
+if((idx_2280 === (-1))){
+var G__2276_2281 = ret;
+G__2276_2281.push(k_2278);
+
+G__2276_2281.push(v_2279);
+
+} else {
+throw (new Error(["Duplicate key: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(k_2278)].join('')));
+}
+
+var G__2282 = (i_2277 + (2));
+i_2277 = G__2282;
+continue;
+} else {
+}
+break;
+}
+
+var cnt = (arr.length / (2));
+return (new cljs.core.PersistentArrayMap(null,cnt,arr,null));
+});
+cljs.core.PersistentArrayMap.createAsIfByAssoc = (function (arr){
+var ret = [];
+var i_2284 = (0);
+while(true){
+if((i_2284 < arr.length)){
+var k_2285 = (arr[i_2284]);
+var v_2286 = (arr[(i_2284 + (1))]);
+var idx_2287 = cljs.core.array_index_of(ret,k_2285);
+if((idx_2287 === (-1))){
+var G__2283_2288 = ret;
+G__2283_2288.push(k_2285);
+
+G__2283_2288.push(v_2286);
+
+} else {
+(ret[(idx_2287 + (1))] = v_2286);
+}
+
+var G__2289 = (i_2284 + (2));
+i_2284 = G__2289;
+continue;
+} else {
+}
+break;
+}
+
+return (new cljs.core.PersistentArrayMap(null,(ret.length / (2)),ret,null));
+});
+var G__2290_2293 = cljs.core.PersistentArrayMap.prototype;
+var G__2291_2294 = cljs.core.ITER_SYMBOL;
+var G__2292_2295 = ((function (G__2290_2293,G__2291_2294){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2290_2293,G__2291_2294))
+;
+goog.object.set(G__2290_2293,G__2291_2294,G__2292_2295);
+
+/**
+* @constructor
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ITransientMap}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ITransientCollection}
+ * @implements {cljs.core.ITransientAssociative}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.TransientArrayMap = (function (editable_QMARK_,len,arr){
+this.editable_QMARK_ = editable_QMARK_;
+this.len = len;
+this.arr = arr;
+this.cljs$lang$protocol_mask$partition0$ = 259;
+this.cljs$lang$protocol_mask$partition1$ = 56;
+});
+cljs.core.TransientArrayMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (tcoll){
+var self__ = this;
+var tcoll__$1 = this;
+if(cljs.core.truth_(self__.editable_QMARK_)){
+return cljs.core.quot(self__.len,(2));
+} else {
+throw (new Error("count after persistent!"));
+}
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (tcoll,k){
+var self__ = this;
+var tcoll__$1 = this;
+return tcoll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (tcoll,k,not_found){
+var self__ = this;
+var tcoll__$1 = this;
+if(cljs.core.truth_(self__.editable_QMARK_)){
+var idx = cljs.core.array_map_index_of(tcoll__$1,k);
+if((idx === (-1))){
+return not_found;
+} else {
+return (self__.arr[(idx + (1))]);
+}
+} else {
+throw (new Error("lookup after persistent!"));
+}
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,o){
+var self__ = this;
+var tcoll__$1 = this;
+if(cljs.core.truth_(self__.editable_QMARK_)){
+if(cljs.core.map_entry_QMARK_(o)){
+return tcoll__$1.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,cljs.core.key(o),cljs.core.val(o));
+} else {
+if(cljs.core.vector_QMARK_(o)){
+return tcoll__$1.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,(o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((0)) : o.call(null,(0))),(o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((1)) : o.call(null,(1))));
+} else {
+var es = cljs.core.seq(o);
+var tcoll__$2 = tcoll__$1;
+while(true){
+var temp__5455__auto__ = cljs.core.first(es);
+if(cljs.core.truth_(temp__5455__auto__)){
+var e = temp__5455__auto__;
+var G__2298 = cljs.core.next(es);
+var G__2299 = tcoll__$2.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,cljs.core.key(e),cljs.core.val(e));
+es = G__2298;
+tcoll__$2 = G__2299;
+continue;
+} else {
+return tcoll__$2;
+}
+break;
+}
+
+}
+}
+} else {
+throw (new Error("conj! after persistent!"));
+}
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
+var self__ = this;
+var tcoll__$1 = this;
+if(cljs.core.truth_(self__.editable_QMARK_)){
+self__.editable_QMARK_ = false;
+
+return (new cljs.core.PersistentArrayMap(null,cljs.core.quot(self__.len,(2)),self__.arr,null));
+} else {
+throw (new Error("persistent! called twice"));
+}
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 = (function (tcoll,key,val){
+var self__ = this;
+var tcoll__$1 = this;
+if(cljs.core.truth_(self__.editable_QMARK_)){
+var idx = cljs.core.array_map_index_of(tcoll__$1,key);
+if((idx === (-1))){
+if(((self__.len + (2)) <= ((2) * cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD))){
+self__.len = (self__.len + (2));
+
+self__.arr.push(key);
+
+self__.arr.push(val);
+
+return tcoll__$1;
+} else {
+return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(cljs.core.array__GT_transient_hash_map(self__.len,self__.arr),key,val);
+}
+} else {
+if((val === (self__.arr[(idx + (1))]))){
+return tcoll__$1;
+} else {
+(self__.arr[(idx + (1))] = val);
+
+return tcoll__$1;
+}
+}
+} else {
+throw (new Error("assoc! after persistent!"));
+}
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$ITransientMap$_dissoc_BANG_$arity$2 = (function (tcoll,key){
+var self__ = this;
+var tcoll__$1 = this;
+if(cljs.core.truth_(self__.editable_QMARK_)){
+var idx = cljs.core.array_map_index_of(tcoll__$1,key);
+if((idx >= (0))){
+(self__.arr[idx] = (self__.arr[(self__.len - (2))]));
+
+(self__.arr[(idx + (1))] = (self__.arr[(self__.len - (1))]));
+
+var G__2297_2300 = self__.arr;
+G__2297_2300.pop();
+
+G__2297_2300.pop();
+
+
+self__.len = (self__.len - (2));
+} else {
+}
+
+return tcoll__$1;
+} else {
+throw (new Error("dissoc! after persistent!"));
+}
+});
+
+cljs.core.TransientArrayMap.prototype.call = (function() {
+var G__2301 = null;
+var G__2301__2 = (function (self__,key){
+var self__ = this;
+var self____$1 = this;
+var tcoll = self____$1;
+return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,null);
+});
+var G__2301__3 = (function (self__,key,not_found){
+var self__ = this;
+var self____$1 = this;
+var tcoll = self____$1;
+return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
+});
+G__2301 = function(self__,key,not_found){
+switch(arguments.length){
+case 2:
+return G__2301__2.call(this,self__,key);
+case 3:
+return G__2301__3.call(this,self__,key,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2301.cljs$core$IFn$_invoke$arity$2 = G__2301__2;
+G__2301.cljs$core$IFn$_invoke$arity$3 = G__2301__3;
+return G__2301;
+})()
+;
+
+cljs.core.TransientArrayMap.prototype.apply = (function (self__,args2296){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2296)));
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (key){
+var self__ = this;
+var tcoll = this;
+return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,null);
+});
+
+cljs.core.TransientArrayMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (key,not_found){
+var self__ = this;
+var tcoll = this;
+return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
+});
+
+cljs.core.TransientArrayMap.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$editable_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$len,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$arr], null);
+});
+
+cljs.core.TransientArrayMap.cljs$lang$type = true;
+
+cljs.core.TransientArrayMap.cljs$lang$ctorStr = "cljs.core/TransientArrayMap";
+
+cljs.core.TransientArrayMap.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/TransientArrayMap");
+});
+
+/**
+ * Positional factory function for cljs.core/TransientArrayMap.
+ */
+cljs.core.__GT_TransientArrayMap = (function cljs$core$__GT_TransientArrayMap(editable_QMARK_,len,arr){
+return (new cljs.core.TransientArrayMap(editable_QMARK_,len,arr));
+});
+
+cljs.core.array__GT_transient_hash_map = (function cljs$core$array__GT_transient_hash_map(len,arr){
+var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
+var i = (0);
+while(true){
+if((i < len)){
+var G__2302 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,(arr[i]),(arr[(i + (1))]));
+var G__2303 = (i + (2));
+out = G__2302;
+i = G__2303;
+continue;
+} else {
+return out;
+}
+break;
+}
+});
+
+/**
+* @constructor
+*/
+cljs.core.Box = (function (val){
+this.val = val;
+});
+
+cljs.core.Box.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$val,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Box.cljs$lang$type = true;
+
+cljs.core.Box.cljs$lang$ctorStr = "cljs.core/Box";
+
+cljs.core.Box.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Box");
+});
+
+/**
+ * Positional factory function for cljs.core/Box.
+ */
+cljs.core.__GT_Box = (function cljs$core$__GT_Box(val){
+return (new cljs.core.Box(val));
+});
+
+
+
+
+
+
+cljs.core.key_test = (function cljs$core$key_test(key,other){
+if((key === other)){
+return true;
+} else {
+if(cljs.core.keyword_identical_QMARK_(key,other)){
+return true;
+} else {
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(key,other);
+
+}
+}
+});
+cljs.core.mask = (function cljs$core$mask(hash,shift){
+return ((hash >>> shift) & (31));
+});
+cljs.core.clone_and_set = (function cljs$core$clone_and_set(var_args){
+var G__2305 = arguments.length;
+switch (G__2305) {
+case 3:
+return cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 5:
+return cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3 = (function (arr,i,a){
+var G__2306 = cljs.core.aclone(arr);
+(G__2306[i] = a);
+
+return G__2306;
+});
+
+cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$5 = (function (arr,i,a,j,b){
+var G__2307 = cljs.core.aclone(arr);
+(G__2307[i] = a);
+
+(G__2307[j] = b);
+
+return G__2307;
+});
+
+cljs.core.clone_and_set.cljs$lang$maxFixedArity = 5;
+
+cljs.core.remove_pair = (function cljs$core$remove_pair(arr,i){
+var new_arr = (new Array((arr.length - (2))));
+cljs.core.array_copy(arr,(0),new_arr,(0),((2) * i));
+
+cljs.core.array_copy(arr,((2) * (i + (1))),new_arr,((2) * i),(new_arr.length - ((2) * i)));
+
+return new_arr;
+});
+cljs.core.bitmap_indexed_node_index = (function cljs$core$bitmap_indexed_node_index(bitmap,bit){
+return cljs.core.bit_count((bitmap & (bit - (1))));
+});
+cljs.core.bitpos = (function cljs$core$bitpos(hash,shift){
+return ((1) << ((hash >>> shift) & 0x01f));
+});
+cljs.core.edit_and_set = (function cljs$core$edit_and_set(var_args){
+var G__2310 = arguments.length;
+switch (G__2310) {
+case 4:
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 6:
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4 = (function (inode,edit,i,a){
+var editable = inode.ensure_editable(edit);
+(editable.arr[i] = a);
+
+return editable;
+});
+
+cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6 = (function (inode,edit,i,a,j,b){
+var editable = inode.ensure_editable(edit);
+(editable.arr[i] = a);
+
+(editable.arr[j] = b);
+
+return editable;
+});
+
+cljs.core.edit_and_set.cljs$lang$maxFixedArity = 6;
+
+cljs.core.inode_kv_reduce = (function cljs$core$inode_kv_reduce(arr,f,init){
+var len = arr.length;
+var i = (0);
+var init__$1 = init;
+while(true){
+if((i < len)){
+var init__$2 = (function (){var k = (arr[i]);
+if(!((k == null))){
+var G__2312 = init__$1;
+var G__2313 = k;
+var G__2314 = (arr[(i + (1))]);
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2312,G__2313,G__2314) : f.call(null,G__2312,G__2313,G__2314));
+} else {
+var node = (arr[(i + (1))]);
+if(!((node == null))){
+return node.kv_reduce(f,init__$1);
+} else {
+return init__$1;
+}
+}
+})();
+if(cljs.core.reduced_QMARK_(init__$2)){
+return init__$2;
+} else {
+var G__2315 = (i + (2));
+var G__2316 = init__$2;
+i = G__2315;
+init__$1 = G__2316;
+continue;
+}
+} else {
+return init__$1;
+}
+break;
+}
+});
+
+/**
+* @constructor
+*/
+cljs.core.NodeIterator = (function (arr,i,next_entry,next_iter){
+this.arr = arr;
+this.i = i;
+this.next_entry = next_entry;
+this.next_iter = next_iter;
+});
+cljs.core.NodeIterator.prototype.advance = (function (){
+var self__ = this;
+var this$ = this;
+var len = self__.arr.length;
+while(true){
+if((self__.i < len)){
+var key = (self__.arr[self__.i]);
+var node_or_val = (self__.arr[(self__.i + (1))]);
+var found = ((!((key == null)))?self__.next_entry = (new cljs.core.MapEntry(key,node_or_val,null)):((!((node_or_val == null)))?(function (){var new_iter = cljs.core._iterator(node_or_val);
+if(new_iter.hasNext()){
+return self__.next_iter = new_iter;
+} else {
+return false;
+}
+})():false
+));
+self__.i = (self__.i + (2));
+
+if(found){
+return true;
+} else {
+continue;
+}
+} else {
+return false;
+}
+break;
+}
+});
+
+cljs.core.NodeIterator.prototype.hasNext = (function (){
+var self__ = this;
+var this$ = this;
+var or__3936__auto__ = !((self__.next_entry == null));
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = !((self__.next_iter == null));
+if(or__3936__auto____$1){
+return or__3936__auto____$1;
+} else {
+return this$.advance();
+}
+}
+});
+
+cljs.core.NodeIterator.prototype.next = (function (){
+var self__ = this;
+var this$ = this;
+if(!((self__.next_entry == null))){
+var ret = self__.next_entry;
+self__.next_entry = null;
+
+return ret;
+} else {
+if(!((self__.next_iter == null))){
+var ret = self__.next_iter.next();
+if(self__.next_iter.hasNext()){
+} else {
+self__.next_iter = null;
+}
+
+return ret;
+} else {
+if(this$.advance()){
+return this$.next();
+} else {
+throw (new Error("No such element"));
+
+}
+}
+}
+});
+
+cljs.core.NodeIterator.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.NodeIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next_DASH_entry,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next_DASH_iter,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.NodeIterator.cljs$lang$type = true;
+
+cljs.core.NodeIterator.cljs$lang$ctorStr = "cljs.core/NodeIterator";
+
+cljs.core.NodeIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/NodeIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/NodeIterator.
+ */
+cljs.core.__GT_NodeIterator = (function cljs$core$__GT_NodeIterator(arr,i,next_entry,next_iter){
+return (new cljs.core.NodeIterator(arr,i,next_entry,next_iter));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IIterable}
+*/
+cljs.core.BitmapIndexedNode = (function (edit,bitmap,arr){
+this.edit = edit;
+this.bitmap = bitmap;
+this.arr = arr;
+this.cljs$lang$protocol_mask$partition1$ = 131072;
+this.cljs$lang$protocol_mask$partition0$ = 0;
+});
+cljs.core.BitmapIndexedNode.prototype.ensure_editable = (function (e){
+var self__ = this;
+var inode = this;
+if((e === self__.edit)){
+return inode;
+} else {
+var n = cljs.core.bit_count(self__.bitmap);
+var new_arr = (new Array((((n < (0)))?(4):((2) * (n + (1))))));
+cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * n));
+
+return (new cljs.core.BitmapIndexedNode(e,self__.bitmap,new_arr));
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.inode_without_BANG_ = (function (edit__$1,shift,hash,key,removed_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+var bit = (1 << ((hash >>> shift) & 0x01f));
+if(((self__.bitmap & bit) === (0))){
+return inode;
+} else {
+var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
+var key_or_nil = (self__.arr[((2) * idx)]);
+var val_or_node = (self__.arr[(((2) * idx) + (1))]);
+if((key_or_nil == null)){
+var n = val_or_node.inode_without_BANG_(edit__$1,(shift + (5)),hash,key,removed_leaf_QMARK_);
+if((n === val_or_node)){
+return inode;
+} else {
+if(!((n == null))){
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(((2) * idx) + (1)),n);
+} else {
+if((self__.bitmap === bit)){
+return null;
+} else {
+return inode.edit_and_remove_pair(edit__$1,bit,idx);
+
+}
+}
+}
+} else {
+if(cljs.core.key_test(key,key_or_nil)){
+removed_leaf_QMARK_.val = true;
+
+return inode.edit_and_remove_pair(edit__$1,bit,idx);
+} else {
+return inode;
+
+}
+}
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.edit_and_remove_pair = (function (e,bit,i){
+var self__ = this;
+var inode = this;
+if((self__.bitmap === bit)){
+return null;
+} else {
+var editable = inode.ensure_editable(e);
+var earr = editable.arr;
+var len = earr.length;
+editable.bitmap = (bit ^ editable.bitmap);
+
+cljs.core.array_copy(earr,((2) * (i + (1))),earr,((2) * i),(len - ((2) * (i + (1)))));
+
+(earr[(len - (2))] = null);
+
+(earr[(len - (1))] = null);
+
+return editable;
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.inode_seq = (function (){
+var self__ = this;
+var inode = this;
+return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1(self__.arr);
+});
+
+cljs.core.BitmapIndexedNode.prototype.kv_reduce = (function (f,init){
+var self__ = this;
+var inode = this;
+return cljs.core.inode_kv_reduce(self__.arr,f,init);
+});
+
+cljs.core.BitmapIndexedNode.prototype.inode_lookup = (function (shift,hash,key,not_found){
+var self__ = this;
+var inode = this;
+var bit = (1 << ((hash >>> shift) & 0x01f));
+if(((self__.bitmap & bit) === (0))){
+return not_found;
+} else {
+var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
+var key_or_nil = (self__.arr[((2) * idx)]);
+var val_or_node = (self__.arr[(((2) * idx) + (1))]);
+if((key_or_nil == null)){
+return val_or_node.inode_lookup((shift + (5)),hash,key,not_found);
+} else {
+if(cljs.core.key_test(key,key_or_nil)){
+return val_or_node;
+} else {
+return not_found;
+
+}
+}
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.inode_assoc_BANG_ = (function (edit__$1,shift,hash,key,val,added_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+var bit = (1 << ((hash >>> shift) & 0x01f));
+var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
+if(((self__.bitmap & bit) === (0))){
+var n = cljs.core.bit_count(self__.bitmap);
+if((((2) * n) < self__.arr.length)){
+var editable = inode.ensure_editable(edit__$1);
+var earr = editable.arr;
+added_leaf_QMARK_.val = true;
+
+cljs.core.array_copy_downward(earr,((2) * idx),earr,((2) * (idx + (1))),((2) * (n - idx)));
+
+(earr[((2) * idx)] = key);
+
+(earr[(((2) * idx) + (1))] = val);
+
+editable.bitmap = (editable.bitmap | bit);
+
+return editable;
+} else {
+if((n >= (16))){
+var nodes = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
+var jdx = ((hash >>> shift) & 0x01f);
+(nodes[jdx] = cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_));
+
+var i_2317 = (0);
+var j_2318 = (0);
+while(true){
+if((i_2317 < (32))){
+if((((self__.bitmap >>> i_2317) & (1)) === (0))){
+var G__2319 = (i_2317 + (1));
+var G__2320 = j_2318;
+i_2317 = G__2319;
+j_2318 = G__2320;
+continue;
+} else {
+(nodes[i_2317] = ((!(((self__.arr[j_2318]) == null)))?cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit__$1,(shift + (5)),cljs.core.hash((self__.arr[j_2318])),(self__.arr[j_2318]),(self__.arr[(j_2318 + (1))]),added_leaf_QMARK_):(self__.arr[(j_2318 + (1))])));
+
+var G__2321 = (i_2317 + (1));
+var G__2322 = (j_2318 + (2));
+i_2317 = G__2321;
+j_2318 = G__2322;
+continue;
+}
+} else {
+}
+break;
+}
+
+return (new cljs.core.ArrayNode(edit__$1,(n + (1)),nodes));
+} else {
+var new_arr = (new Array(((2) * (n + (4)))));
+cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * idx));
+
+(new_arr[((2) * idx)] = key);
+
+(new_arr[(((2) * idx) + (1))] = val);
+
+cljs.core.array_copy(self__.arr,((2) * idx),new_arr,((2) * (idx + (1))),((2) * (n - idx)));
+
+added_leaf_QMARK_.val = true;
+
+var editable = inode.ensure_editable(edit__$1);
+editable.arr = new_arr;
+
+editable.bitmap = (editable.bitmap | bit);
+
+return editable;
+
+}
+}
+} else {
+var key_or_nil = (self__.arr[((2) * idx)]);
+var val_or_node = (self__.arr[(((2) * idx) + (1))]);
+if((key_or_nil == null)){
+var n = val_or_node.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_);
+if((n === val_or_node)){
+return inode;
+} else {
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(((2) * idx) + (1)),n);
+}
+} else {
+if(cljs.core.key_test(key,key_or_nil)){
+if((val === val_or_node)){
+return inode;
+} else {
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(((2) * idx) + (1)),val);
+}
+} else {
+added_leaf_QMARK_.val = true;
+
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6(inode,edit__$1,((2) * idx),null,(((2) * idx) + (1)),cljs.core.create_node.cljs$core$IFn$_invoke$arity$7(edit__$1,(shift + (5)),key_or_nil,val_or_node,hash,key,val));
+
+}
+}
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.inode_assoc = (function (shift,hash,key,val,added_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+var bit = (1 << ((hash >>> shift) & 0x01f));
+var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
+if(((self__.bitmap & bit) === (0))){
+var n = cljs.core.bit_count(self__.bitmap);
+if((n >= (16))){
+var nodes = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
+var jdx = ((hash >>> shift) & 0x01f);
+(nodes[jdx] = cljs.core.BitmapIndexedNode.EMPTY.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_));
+
+var i_2323 = (0);
+var j_2324 = (0);
+while(true){
+if((i_2323 < (32))){
+if((((self__.bitmap >>> i_2323) & (1)) === (0))){
+var G__2325 = (i_2323 + (1));
+var G__2326 = j_2324;
+i_2323 = G__2325;
+j_2324 = G__2326;
+continue;
+} else {
+(nodes[i_2323] = ((!(((self__.arr[j_2324]) == null)))?cljs.core.BitmapIndexedNode.EMPTY.inode_assoc((shift + (5)),cljs.core.hash((self__.arr[j_2324])),(self__.arr[j_2324]),(self__.arr[(j_2324 + (1))]),added_leaf_QMARK_):(self__.arr[(j_2324 + (1))])));
+
+var G__2327 = (i_2323 + (1));
+var G__2328 = (j_2324 + (2));
+i_2323 = G__2327;
+j_2324 = G__2328;
+continue;
+}
+} else {
+}
+break;
+}
+
+return (new cljs.core.ArrayNode(null,(n + (1)),nodes));
+} else {
+var new_arr = (new Array(((2) * (n + (1)))));
+cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * idx));
+
+(new_arr[((2) * idx)] = key);
+
+(new_arr[(((2) * idx) + (1))] = val);
+
+cljs.core.array_copy(self__.arr,((2) * idx),new_arr,((2) * (idx + (1))),((2) * (n - idx)));
+
+added_leaf_QMARK_.val = true;
+
+return (new cljs.core.BitmapIndexedNode(null,(self__.bitmap | bit),new_arr));
+}
+} else {
+var key_or_nil = (self__.arr[((2) * idx)]);
+var val_or_node = (self__.arr[(((2) * idx) + (1))]);
+if((key_or_nil == null)){
+var n = val_or_node.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_);
+if((n === val_or_node)){
+return inode;
+} else {
+return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(((2) * idx) + (1)),n)));
+}
+} else {
+if(cljs.core.key_test(key,key_or_nil)){
+if((val === val_or_node)){
+return inode;
+} else {
+return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(((2) * idx) + (1)),val)));
+}
+} else {
+added_leaf_QMARK_.val = true;
+
+return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$5(self__.arr,((2) * idx),null,(((2) * idx) + (1)),cljs.core.create_node.cljs$core$IFn$_invoke$arity$6((shift + (5)),key_or_nil,val_or_node,hash,key,val))));
+
+}
+}
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.inode_find = (function (shift,hash,key,not_found){
+var self__ = this;
+var inode = this;
+var bit = (1 << ((hash >>> shift) & 0x01f));
+if(((self__.bitmap & bit) === (0))){
+return not_found;
+} else {
+var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
+var key_or_nil = (self__.arr[((2) * idx)]);
+var val_or_node = (self__.arr[(((2) * idx) + (1))]);
+if((key_or_nil == null)){
+return val_or_node.inode_find((shift + (5)),hash,key,not_found);
+} else {
+if(cljs.core.key_test(key,key_or_nil)){
+return (new cljs.core.MapEntry(key_or_nil,val_or_node,null));
+} else {
+return not_found;
+
+}
+}
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.inode_without = (function (shift,hash,key){
+var self__ = this;
+var inode = this;
+var bit = (1 << ((hash >>> shift) & 0x01f));
+if(((self__.bitmap & bit) === (0))){
+return inode;
+} else {
+var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
+var key_or_nil = (self__.arr[((2) * idx)]);
+var val_or_node = (self__.arr[(((2) * idx) + (1))]);
+if((key_or_nil == null)){
+var n = val_or_node.inode_without((shift + (5)),hash,key);
+if((n === val_or_node)){
+return inode;
+} else {
+if(!((n == null))){
+return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(((2) * idx) + (1)),n)));
+} else {
+if((self__.bitmap === bit)){
+return null;
+} else {
+return (new cljs.core.BitmapIndexedNode(null,(self__.bitmap ^ bit),cljs.core.remove_pair(self__.arr,idx)));
+
+}
+}
+}
+} else {
+if(cljs.core.key_test(key,key_or_nil)){
+return (new cljs.core.BitmapIndexedNode(null,(self__.bitmap ^ bit),cljs.core.remove_pair(self__.arr,idx)));
+} else {
+return inode;
+
+}
+}
+}
+});
+
+cljs.core.BitmapIndexedNode.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.NodeIterator(self__.arr,(0),null,null));
+});
+
+cljs.core.BitmapIndexedNode.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.with_meta(cljs.core.cst$sym$bitmap,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.BitmapIndexedNode.cljs$lang$type = true;
+
+cljs.core.BitmapIndexedNode.cljs$lang$ctorStr = "cljs.core/BitmapIndexedNode";
+
+cljs.core.BitmapIndexedNode.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/BitmapIndexedNode");
+});
+
+/**
+ * Positional factory function for cljs.core/BitmapIndexedNode.
+ */
+cljs.core.__GT_BitmapIndexedNode = (function cljs$core$__GT_BitmapIndexedNode(edit,bitmap,arr){
+return (new cljs.core.BitmapIndexedNode(edit,bitmap,arr));
+});
+
+cljs.core.BitmapIndexedNode.EMPTY = (new cljs.core.BitmapIndexedNode(null,(0),[]));
+cljs.core.pack_array_node = (function cljs$core$pack_array_node(array_node,edit,idx){
+var arr = array_node.arr;
+var len = arr.length;
+var new_arr = (new Array(((2) * (array_node.cnt - (1)))));
+var i = (0);
+var j = (1);
+var bitmap = (0);
+while(true){
+if((i < len)){
+if(((!((i === idx))) && (!(((arr[i]) == null))))){
+(new_arr[j] = (arr[i]));
+
+var G__2329 = (i + (1));
+var G__2330 = (j + (2));
+var G__2331 = (bitmap | ((1) << i));
+i = G__2329;
+j = G__2330;
+bitmap = G__2331;
+continue;
+} else {
+var G__2332 = (i + (1));
+var G__2333 = j;
+var G__2334 = bitmap;
+i = G__2332;
+j = G__2333;
+bitmap = G__2334;
+continue;
+}
+} else {
+return (new cljs.core.BitmapIndexedNode(edit,bitmap,new_arr));
+}
+break;
+}
+});
+
+/**
+* @constructor
+*/
+cljs.core.ArrayNodeIterator = (function (arr,i,next_iter){
+this.arr = arr;
+this.i = i;
+this.next_iter = next_iter;
+});
+cljs.core.ArrayNodeIterator.prototype.hasNext = (function (){
+var self__ = this;
+var this$ = this;
+var len = self__.arr.length;
+while(true){
+if(!(((!((self__.next_iter == null))) && (self__.next_iter.hasNext())))){
+if((self__.i < len)){
+var node = (self__.arr[self__.i]);
+self__.i = (self__.i + (1));
+
+if(!((node == null))){
+self__.next_iter = cljs.core._iterator(node);
+} else {
+}
+
+continue;
+} else {
+return false;
+}
+} else {
+return true;
+}
+break;
+}
+});
+
+cljs.core.ArrayNodeIterator.prototype.next = (function (){
+var self__ = this;
+var this$ = this;
+if(this$.hasNext()){
+return self__.next_iter.next();
+} else {
+throw (new Error("No such element"));
+}
+});
+
+cljs.core.ArrayNodeIterator.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.ArrayNodeIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next_DASH_iter,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ArrayNodeIterator.cljs$lang$type = true;
+
+cljs.core.ArrayNodeIterator.cljs$lang$ctorStr = "cljs.core/ArrayNodeIterator";
+
+cljs.core.ArrayNodeIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ArrayNodeIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/ArrayNodeIterator.
+ */
+cljs.core.__GT_ArrayNodeIterator = (function cljs$core$__GT_ArrayNodeIterator(arr,i,next_iter){
+return (new cljs.core.ArrayNodeIterator(arr,i,next_iter));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IIterable}
+*/
+cljs.core.ArrayNode = (function (edit,cnt,arr){
+this.edit = edit;
+this.cnt = cnt;
+this.arr = arr;
+this.cljs$lang$protocol_mask$partition1$ = 131072;
+this.cljs$lang$protocol_mask$partition0$ = 0;
+});
+cljs.core.ArrayNode.prototype.ensure_editable = (function (e){
+var self__ = this;
+var inode = this;
+if((e === self__.edit)){
+return inode;
+} else {
+return (new cljs.core.ArrayNode(e,self__.cnt,cljs.core.aclone(self__.arr)));
+}
+});
+
+cljs.core.ArrayNode.prototype.inode_without_BANG_ = (function (edit__$1,shift,hash,key,removed_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+var idx = ((hash >>> shift) & 0x01f);
+var node = (self__.arr[idx]);
+if((node == null)){
+return inode;
+} else {
+var n = node.inode_without_BANG_(edit__$1,(shift + (5)),hash,key,removed_leaf_QMARK_);
+if((n === node)){
+return inode;
+} else {
+if((n == null)){
+if((self__.cnt <= (8))){
+return cljs.core.pack_array_node(inode,edit__$1,idx);
+} else {
+var editable = cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,n);
+editable.cnt = (editable.cnt - (1));
+
+return editable;
+}
+} else {
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,n);
+
+}
+}
+}
+});
+
+cljs.core.ArrayNode.prototype.inode_seq = (function (){
+var self__ = this;
+var inode = this;
+return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$1(self__.arr);
+});
+
+cljs.core.ArrayNode.prototype.kv_reduce = (function (f,init){
+var self__ = this;
+var inode = this;
+var len = self__.arr.length;
+var i = (0);
+var init__$1 = init;
+while(true){
+if((i < len)){
+var node = (self__.arr[i]);
+if(!((node == null))){
+var init__$2 = node.kv_reduce(f,init__$1);
+if(cljs.core.reduced_QMARK_(init__$2)){
+return init__$2;
+} else {
+var G__2335 = (i + (1));
+var G__2336 = init__$2;
+i = G__2335;
+init__$1 = G__2336;
+continue;
+}
+} else {
+var G__2337 = (i + (1));
+var G__2338 = init__$1;
+i = G__2337;
+init__$1 = G__2338;
+continue;
+}
+} else {
+return init__$1;
+}
+break;
+}
+});
+
+cljs.core.ArrayNode.prototype.inode_lookup = (function (shift,hash,key,not_found){
+var self__ = this;
+var inode = this;
+var idx = ((hash >>> shift) & 0x01f);
+var node = (self__.arr[idx]);
+if(!((node == null))){
+return node.inode_lookup((shift + (5)),hash,key,not_found);
+} else {
+return not_found;
+}
+});
+
+cljs.core.ArrayNode.prototype.inode_assoc_BANG_ = (function (edit__$1,shift,hash,key,val,added_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+var idx = ((hash >>> shift) & 0x01f);
+var node = (self__.arr[idx]);
+if((node == null)){
+var editable = cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_));
+editable.cnt = (editable.cnt + (1));
+
+return editable;
+} else {
+var n = node.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_);
+if((n === node)){
+return inode;
+} else {
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,n);
+}
+}
+});
+
+cljs.core.ArrayNode.prototype.inode_assoc = (function (shift,hash,key,val,added_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+var idx = ((hash >>> shift) & 0x01f);
+var node = (self__.arr[idx]);
+if((node == null)){
+return (new cljs.core.ArrayNode(null,(self__.cnt + (1)),cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,cljs.core.BitmapIndexedNode.EMPTY.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_))));
+} else {
+var n = node.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_);
+if((n === node)){
+return inode;
+} else {
+return (new cljs.core.ArrayNode(null,self__.cnt,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,n)));
+}
+}
+});
+
+cljs.core.ArrayNode.prototype.inode_find = (function (shift,hash,key,not_found){
+var self__ = this;
+var inode = this;
+var idx = ((hash >>> shift) & 0x01f);
+var node = (self__.arr[idx]);
+if(!((node == null))){
+return node.inode_find((shift + (5)),hash,key,not_found);
+} else {
+return not_found;
+}
+});
+
+cljs.core.ArrayNode.prototype.inode_without = (function (shift,hash,key){
+var self__ = this;
+var inode = this;
+var idx = ((hash >>> shift) & 0x01f);
+var node = (self__.arr[idx]);
+if(!((node == null))){
+var n = node.inode_without((shift + (5)),hash,key);
+if((n === node)){
+return inode;
+} else {
+if((n == null)){
+if((self__.cnt <= (8))){
+return cljs.core.pack_array_node(inode,null,idx);
+} else {
+return (new cljs.core.ArrayNode(null,(self__.cnt - (1)),cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,n)));
+}
+} else {
+return (new cljs.core.ArrayNode(null,self__.cnt,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,n)));
+
+}
+}
+} else {
+return inode;
+}
+});
+
+cljs.core.ArrayNode.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.ArrayNodeIterator(self__.arr,(0),null));
+});
+
+cljs.core.ArrayNode.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.with_meta(cljs.core.cst$sym$cnt,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ArrayNode.cljs$lang$type = true;
+
+cljs.core.ArrayNode.cljs$lang$ctorStr = "cljs.core/ArrayNode";
+
+cljs.core.ArrayNode.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ArrayNode");
+});
+
+/**
+ * Positional factory function for cljs.core/ArrayNode.
+ */
+cljs.core.__GT_ArrayNode = (function cljs$core$__GT_ArrayNode(edit,cnt,arr){
+return (new cljs.core.ArrayNode(edit,cnt,arr));
+});
+
+cljs.core.hash_collision_node_find_index = (function cljs$core$hash_collision_node_find_index(arr,cnt,key){
+var lim = ((2) * cnt);
+var i = (0);
+while(true){
+if((i < lim)){
+if(cljs.core.key_test(key,(arr[i]))){
+return i;
+} else {
+var G__2339 = (i + (2));
+i = G__2339;
+continue;
+}
+} else {
+return (-1);
+}
+break;
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IIterable}
+*/
+cljs.core.HashCollisionNode = (function (edit,collision_hash,cnt,arr){
+this.edit = edit;
+this.collision_hash = collision_hash;
+this.cnt = cnt;
+this.arr = arr;
+this.cljs$lang$protocol_mask$partition1$ = 131072;
+this.cljs$lang$protocol_mask$partition0$ = 0;
+});
+cljs.core.HashCollisionNode.prototype.ensure_editable = (function (e){
+var self__ = this;
+var inode = this;
+if((e === self__.edit)){
+return inode;
+} else {
+var new_arr = (new Array(((2) * (self__.cnt + (1)))));
+cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * self__.cnt));
+
+return (new cljs.core.HashCollisionNode(e,self__.collision_hash,self__.cnt,new_arr));
+}
+});
+
+cljs.core.HashCollisionNode.prototype.inode_without_BANG_ = (function (edit__$1,shift,hash,key,removed_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
+if((idx === (-1))){
+return inode;
+} else {
+removed_leaf_QMARK_.val = true;
+
+if((self__.cnt === (1))){
+return null;
+} else {
+var editable = inode.ensure_editable(edit__$1);
+var earr = editable.arr;
+(earr[idx] = (earr[(((2) * self__.cnt) - (2))]));
+
+(earr[(idx + (1))] = (earr[(((2) * self__.cnt) - (1))]));
+
+(earr[(((2) * self__.cnt) - (1))] = null);
+
+(earr[(((2) * self__.cnt) - (2))] = null);
+
+editable.cnt = (editable.cnt - (1));
+
+return editable;
+}
+}
+});
+
+cljs.core.HashCollisionNode.prototype.inode_seq = (function (){
+var self__ = this;
+var inode = this;
+return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1(self__.arr);
+});
+
+cljs.core.HashCollisionNode.prototype.kv_reduce = (function (f,init){
+var self__ = this;
+var inode = this;
+return cljs.core.inode_kv_reduce(self__.arr,f,init);
+});
+
+cljs.core.HashCollisionNode.prototype.inode_lookup = (function (shift,hash,key,not_found){
+var self__ = this;
+var inode = this;
+var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
+if((idx < (0))){
+return not_found;
+} else {
+if(cljs.core.key_test(key,(self__.arr[idx]))){
+return (self__.arr[(idx + (1))]);
+} else {
+return not_found;
+
+}
+}
+});
+
+cljs.core.HashCollisionNode.prototype.inode_assoc_BANG_ = (function (edit__$1,shift,hash,key,val,added_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+if((hash === self__.collision_hash)){
+var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
+if((idx === (-1))){
+if((self__.arr.length > ((2) * self__.cnt))){
+var editable = cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6(inode,edit__$1,((2) * self__.cnt),key,(((2) * self__.cnt) + (1)),val);
+added_leaf_QMARK_.val = true;
+
+editable.cnt = (editable.cnt + (1));
+
+return editable;
+} else {
+var len = self__.arr.length;
+var new_arr = (new Array((len + (2))));
+cljs.core.array_copy(self__.arr,(0),new_arr,(0),len);
+
+(new_arr[len] = key);
+
+(new_arr[(len + (1))] = val);
+
+added_leaf_QMARK_.val = true;
+
+return inode.ensure_editable_array(edit__$1,(self__.cnt + (1)),new_arr);
+}
+} else {
+if(((self__.arr[(idx + (1))]) === val)){
+return inode;
+} else {
+return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(idx + (1)),val);
+}
+}
+} else {
+return (new cljs.core.BitmapIndexedNode(edit__$1,(1 << ((self__.collision_hash >>> shift) & 0x01f)),[null,inode,null,null])).inode_assoc_BANG_(edit__$1,shift,hash,key,val,added_leaf_QMARK_);
+}
+});
+
+cljs.core.HashCollisionNode.prototype.inode_assoc = (function (shift,hash,key,val,added_leaf_QMARK_){
+var self__ = this;
+var inode = this;
+if((hash === self__.collision_hash)){
+var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
+if((idx === (-1))){
+var len = ((2) * self__.cnt);
+var new_arr = (new Array((len + (2))));
+cljs.core.array_copy(self__.arr,(0),new_arr,(0),len);
+
+(new_arr[len] = key);
+
+(new_arr[(len + (1))] = val);
+
+added_leaf_QMARK_.val = true;
+
+return (new cljs.core.HashCollisionNode(null,self__.collision_hash,(self__.cnt + (1)),new_arr));
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((self__.arr[(idx + (1))]),val)){
+return inode;
+} else {
+return (new cljs.core.HashCollisionNode(null,self__.collision_hash,self__.cnt,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(idx + (1)),val)));
+}
+}
+} else {
+return (new cljs.core.BitmapIndexedNode(null,(1 << ((self__.collision_hash >>> shift) & 0x01f)),[null,inode])).inode_assoc(shift,hash,key,val,added_leaf_QMARK_);
+}
+});
+
+cljs.core.HashCollisionNode.prototype.ensure_editable_array = (function (e,count,array){
+var self__ = this;
+var inode = this;
+if((e === self__.edit)){
+self__.arr = array;
+
+self__.cnt = count;
+
+return inode;
+} else {
+return (new cljs.core.HashCollisionNode(self__.edit,self__.collision_hash,count,array));
+}
+});
+
+cljs.core.HashCollisionNode.prototype.inode_find = (function (shift,hash,key,not_found){
+var self__ = this;
+var inode = this;
+var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
+if((idx < (0))){
+return not_found;
+} else {
+if(cljs.core.key_test(key,(self__.arr[idx]))){
+return (new cljs.core.MapEntry((self__.arr[idx]),(self__.arr[(idx + (1))]),null));
+} else {
+return not_found;
+
+}
+}
+});
+
+cljs.core.HashCollisionNode.prototype.inode_without = (function (shift,hash,key){
+var self__ = this;
+var inode = this;
+var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
+if((idx === (-1))){
+return inode;
+} else {
+if((self__.cnt === (1))){
+return null;
+} else {
+return (new cljs.core.HashCollisionNode(null,self__.collision_hash,(self__.cnt - (1)),cljs.core.remove_pair(self__.arr,cljs.core.quot(idx,(2)))));
+
+}
+}
+});
+
+cljs.core.HashCollisionNode.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.NodeIterator(self__.arr,(0),null,null));
+});
+
+cljs.core.HashCollisionNode.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.with_meta(cljs.core.cst$sym$collision_DASH_hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$cnt,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.HashCollisionNode.cljs$lang$type = true;
+
+cljs.core.HashCollisionNode.cljs$lang$ctorStr = "cljs.core/HashCollisionNode";
+
+cljs.core.HashCollisionNode.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/HashCollisionNode");
+});
+
+/**
+ * Positional factory function for cljs.core/HashCollisionNode.
+ */
+cljs.core.__GT_HashCollisionNode = (function cljs$core$__GT_HashCollisionNode(edit,collision_hash,cnt,arr){
+return (new cljs.core.HashCollisionNode(edit,collision_hash,cnt,arr));
+});
+
+cljs.core.create_node = (function cljs$core$create_node(var_args){
+var G__2341 = arguments.length;
+switch (G__2341) {
+case 6:
+return cljs.core.create_node.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+case 7:
+return cljs.core.create_node.cljs$core$IFn$_invoke$arity$7((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.create_node.cljs$core$IFn$_invoke$arity$6 = (function (shift,key1,val1,key2hash,key2,val2){
+var key1hash = cljs.core.hash(key1);
+if((key1hash === key2hash)){
+return (new cljs.core.HashCollisionNode(null,key1hash,(2),[key1,val1,key2,val2]));
+} else {
+var added_leaf_QMARK_ = (new cljs.core.Box(false));
+return cljs.core.BitmapIndexedNode.EMPTY.inode_assoc(shift,key1hash,key1,val1,added_leaf_QMARK_).inode_assoc(shift,key2hash,key2,val2,added_leaf_QMARK_);
+}
+});
+
+cljs.core.create_node.cljs$core$IFn$_invoke$arity$7 = (function (edit,shift,key1,val1,key2hash,key2,val2){
+var key1hash = cljs.core.hash(key1);
+if((key1hash === key2hash)){
+return (new cljs.core.HashCollisionNode(null,key1hash,(2),[key1,val1,key2,val2]));
+} else {
+var added_leaf_QMARK_ = (new cljs.core.Box(false));
+return cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit,shift,key1hash,key1,val1,added_leaf_QMARK_).inode_assoc_BANG_(edit,shift,key2hash,key2,val2,added_leaf_QMARK_);
+}
+});
+
+cljs.core.create_node.cljs$lang$maxFixedArity = 7;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.NodeSeq = (function (meta,nodes,i,s,__hash){
+this.meta = meta;
+this.nodes = nodes;
+this.i = i;
+this.s = s;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 32374988;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.NodeSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.NodeSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.NodeSeq.prototype.indexOf = (function() {
+var G__2343 = null;
+var G__2343__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2343__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2343 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2343__1.call(this,x);
+case 2:
+return G__2343__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2343.cljs$core$IFn$_invoke$arity$1 = G__2343__1;
+G__2343.cljs$core$IFn$_invoke$arity$2 = G__2343__2;
+return G__2343;
+})()
+;
+
+cljs.core.NodeSeq.prototype.lastIndexOf = (function() {
+var G__2344 = null;
+var G__2344__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2344__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2344 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2344__1.call(this,x);
+case 2:
+return G__2344__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2344.cljs$core$IFn$_invoke$arity$1 = G__2344__1;
+G__2344.cljs$core$IFn$_invoke$arity$2 = G__2344__2;
+return G__2344;
+})()
+;
+
+cljs.core.NodeSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.s == null)){
+return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,(self__.i + (2)),null);
+} else {
+return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,self__.i,cljs.core.next(self__.s));
+}
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.s == null)){
+return (new cljs.core.MapEntry((self__.nodes[self__.i]),(self__.nodes[(self__.i + (1))]),null));
+} else {
+return cljs.core.first(self__.s);
+}
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var ret = (((self__.s == null))?cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,(self__.i + (2)),null):cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,self__.i,cljs.core.next(self__.s)));
+if(!((ret == null))){
+return ret;
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return this$__$1;
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.NodeSeq(meta__$1,self__.nodes,self__.i,self__.s,self__.__hash));
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.NodeSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$nodes,cljs.core.cst$sym$i,cljs.core.cst$sym$s,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.NodeSeq.cljs$lang$type = true;
+
+cljs.core.NodeSeq.cljs$lang$ctorStr = "cljs.core/NodeSeq";
+
+cljs.core.NodeSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/NodeSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/NodeSeq.
+ */
+cljs.core.__GT_NodeSeq = (function cljs$core$__GT_NodeSeq(meta,nodes,i,s,__hash){
+return (new cljs.core.NodeSeq(meta,nodes,i,s,__hash));
+});
+
+var G__2345_2348 = cljs.core.NodeSeq.prototype;
+var G__2346_2349 = cljs.core.ITER_SYMBOL;
+var G__2347_2350 = ((function (G__2345_2348,G__2346_2349){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2345_2348,G__2346_2349))
+;
+goog.object.set(G__2345_2348,G__2346_2349,G__2347_2350);
+cljs.core.create_inode_seq = (function cljs$core$create_inode_seq(var_args){
+var G__2352 = arguments.length;
+switch (G__2352) {
+case 1:
+return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 3:
+return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1 = (function (nodes){
+return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(nodes,(0),null);
+});
+
+cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3 = (function (nodes,i,s){
+if((s == null)){
+var len = nodes.length;
+var j = i;
+while(true){
+if((j < len)){
+if(!(((nodes[j]) == null))){
+return (new cljs.core.NodeSeq(null,nodes,j,null,null));
+} else {
+var temp__5455__auto__ = (nodes[(j + (1))]);
+if(cljs.core.truth_(temp__5455__auto__)){
+var node = temp__5455__auto__;
+var temp__5455__auto____$1 = node.inode_seq();
+if(cljs.core.truth_(temp__5455__auto____$1)){
+var node_seq = temp__5455__auto____$1;
+return (new cljs.core.NodeSeq(null,nodes,(j + (2)),node_seq,null));
+} else {
+var G__2354 = (j + (2));
+j = G__2354;
+continue;
+}
+} else {
+var G__2355 = (j + (2));
+j = G__2355;
+continue;
+}
+}
+} else {
+return null;
+}
+break;
+}
+} else {
+return (new cljs.core.NodeSeq(null,nodes,i,s,null));
+}
+});
+
+cljs.core.create_inode_seq.cljs$lang$maxFixedArity = 3;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.ArrayNodeSeq = (function (meta,nodes,i,s,__hash){
+this.meta = meta;
+this.nodes = nodes;
+this.i = i;
+this.s = s;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 32374988;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.ArrayNodeSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.ArrayNodeSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.ArrayNodeSeq.prototype.indexOf = (function() {
+var G__2356 = null;
+var G__2356__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2356__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2356 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2356__1.call(this,x);
+case 2:
+return G__2356__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2356.cljs$core$IFn$_invoke$arity$1 = G__2356__1;
+G__2356.cljs$core$IFn$_invoke$arity$2 = G__2356__2;
+return G__2356;
+})()
+;
+
+cljs.core.ArrayNodeSeq.prototype.lastIndexOf = (function() {
+var G__2357 = null;
+var G__2357__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2357__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2357 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2357__1.call(this,x);
+case 2:
+return G__2357__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2357.cljs$core$IFn$_invoke$arity$1 = G__2357__1;
+G__2357.cljs$core$IFn$_invoke$arity$2 = G__2357__2;
+return G__2357;
+})()
+;
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4(null,self__.nodes,self__.i,cljs.core.next(self__.s));
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.first(self__.s);
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var ret = cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4(null,self__.nodes,self__.i,cljs.core.next(self__.s));
+if(!((ret == null))){
+return ret;
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return this$__$1;
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.ArrayNodeSeq(meta__$1,self__.nodes,self__.i,self__.s,self__.__hash));
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.ArrayNodeSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$nodes,cljs.core.cst$sym$i,cljs.core.cst$sym$s,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ArrayNodeSeq.cljs$lang$type = true;
+
+cljs.core.ArrayNodeSeq.cljs$lang$ctorStr = "cljs.core/ArrayNodeSeq";
+
+cljs.core.ArrayNodeSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ArrayNodeSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/ArrayNodeSeq.
+ */
+cljs.core.__GT_ArrayNodeSeq = (function cljs$core$__GT_ArrayNodeSeq(meta,nodes,i,s,__hash){
+return (new cljs.core.ArrayNodeSeq(meta,nodes,i,s,__hash));
+});
+
+var G__2358_2361 = cljs.core.ArrayNodeSeq.prototype;
+var G__2359_2362 = cljs.core.ITER_SYMBOL;
+var G__2360_2363 = ((function (G__2358_2361,G__2359_2362){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2358_2361,G__2359_2362))
+;
+goog.object.set(G__2358_2361,G__2359_2362,G__2360_2363);
+cljs.core.create_array_node_seq = (function cljs$core$create_array_node_seq(var_args){
+var G__2365 = arguments.length;
+switch (G__2365) {
+case 1:
+return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 4:
+return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$1 = (function (nodes){
+return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4(null,nodes,(0),null);
+});
+
+cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4 = (function (meta,nodes,i,s){
+if((s == null)){
+var len = nodes.length;
+var j = i;
+while(true){
+if((j < len)){
+var temp__5455__auto__ = (nodes[j]);
+if(cljs.core.truth_(temp__5455__auto__)){
+var nj = temp__5455__auto__;
+var temp__5455__auto____$1 = nj.inode_seq();
+if(cljs.core.truth_(temp__5455__auto____$1)){
+var ns = temp__5455__auto____$1;
+return (new cljs.core.ArrayNodeSeq(meta,nodes,(j + (1)),ns,null));
+} else {
+var G__2367 = (j + (1));
+j = G__2367;
+continue;
+}
+} else {
+var G__2368 = (j + (1));
+j = G__2368;
+continue;
+}
+} else {
+return null;
+}
+break;
+}
+} else {
+return (new cljs.core.ArrayNodeSeq(meta,nodes,i,s,null));
+}
+});
+
+cljs.core.create_array_node_seq.cljs$lang$maxFixedArity = 4;
+
+
+/**
+* @constructor
+*/
+cljs.core.HashMapIter = (function (nil_val,root_iter,seen){
+this.nil_val = nil_val;
+this.root_iter = root_iter;
+this.seen = seen;
+});
+cljs.core.HashMapIter.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+return ((!(self__.seen)) || (self__.root_iter.hasNext()));
+});
+
+cljs.core.HashMapIter.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+if(!(self__.seen)){
+self__.seen = true;
+
+return (new cljs.core.MapEntry(null,self__.nil_val,null));
+} else {
+return self__.root_iter.next();
+}
+});
+
+cljs.core.HashMapIter.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.HashMapIter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$nil_DASH_val,cljs.core.cst$sym$root_DASH_iter,cljs.core.with_meta(cljs.core.cst$sym$seen,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.HashMapIter.cljs$lang$type = true;
+
+cljs.core.HashMapIter.cljs$lang$ctorStr = "cljs.core/HashMapIter";
+
+cljs.core.HashMapIter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/HashMapIter");
+});
+
+/**
+ * Positional factory function for cljs.core/HashMapIter.
+ */
+cljs.core.__GT_HashMapIter = (function cljs$core$__GT_HashMapIter(nil_val,root_iter,seen){
+return (new cljs.core.HashMapIter(nil_val,root_iter,seen));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IKVReduce}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEditableCollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.IMap}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.PersistentHashMap = (function (meta,cnt,root,has_nil_QMARK_,nil_val,__hash){
+this.meta = meta;
+this.cnt = cnt;
+this.root = root;
+this.has_nil_QMARK_ = has_nil_QMARK_;
+this.nil_val = nil_val;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 16123663;
+this.cljs$lang$protocol_mask$partition1$ = 139268;
+});
+cljs.core.PersistentHashMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+if((k == null)){
+if(self__.has_nil_QMARK_){
+return (new cljs.core.MapEntry(null,self__.nil_val,null));
+} else {
+return null;
+}
+} else {
+if((self__.root == null)){
+return null;
+} else {
+return self__.root.inode_find((0),cljs.core.hash(k),k,null);
+
+}
+}
+});
+
+cljs.core.PersistentHashMap.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentHashMap.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentHashMap.prototype.keys = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.keys(coll));
+});
+
+cljs.core.PersistentHashMap.prototype.entries = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_entries_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentHashMap.prototype.values = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.vals(coll));
+});
+
+cljs.core.PersistentHashMap.prototype.has = (function (k){
+var self__ = this;
+var coll = this;
+return cljs.core.contains_QMARK_(coll,k);
+});
+
+cljs.core.PersistentHashMap.prototype.get = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentHashMap.prototype.forEach = (function (f){
+var self__ = this;
+var coll = this;
+var seq__2370 = cljs.core.seq(coll);
+var chunk__2371 = null;
+var count__2372 = (0);
+var i__2373 = (0);
+while(true){
+if((i__2373 < count__2372)){
+var vec__2374 = chunk__2371.cljs$core$IIndexed$_nth$arity$2(null,i__2373);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2374,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2374,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2382 = seq__2370;
+var G__2383 = chunk__2371;
+var G__2384 = count__2372;
+var G__2385 = (i__2373 + (1));
+seq__2370 = G__2382;
+chunk__2371 = G__2383;
+count__2372 = G__2384;
+i__2373 = G__2385;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__2370);
+if(temp__5457__auto__){
+var seq__2370__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__2370__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__2370__$1);
+var G__2386 = cljs.core.chunk_rest(seq__2370__$1);
+var G__2387 = c__4338__auto__;
+var G__2388 = cljs.core.count(c__4338__auto__);
+var G__2389 = (0);
+seq__2370 = G__2386;
+chunk__2371 = G__2387;
+count__2372 = G__2388;
+i__2373 = G__2389;
+continue;
+} else {
+var vec__2377 = cljs.core.first(seq__2370__$1);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2377,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2377,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2390 = cljs.core.next(seq__2370__$1);
+var G__2391 = null;
+var G__2392 = (0);
+var G__2393 = (0);
+seq__2370 = G__2390;
+chunk__2371 = G__2391;
+count__2372 = G__2392;
+i__2373 = G__2393;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
+var self__ = this;
+var coll__$1 = this;
+if((k == null)){
+if(self__.has_nil_QMARK_){
+return self__.nil_val;
+} else {
+return not_found;
+}
+} else {
+if((self__.root == null)){
+return not_found;
+} else {
+return self__.root.inode_lookup((0),cljs.core.hash(k),k,not_found);
+
+}
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
+var self__ = this;
+var coll__$1 = this;
+var init__$1 = ((self__.has_nil_QMARK_)?(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(init,null,self__.nil_val) : f.call(null,init,null,self__.nil_val)):init);
+if(cljs.core.reduced_QMARK_(init__$1)){
+return cljs.core.deref(init__$1);
+} else {
+if(!((self__.root == null))){
+return cljs.core.unreduced(self__.root.kv_reduce(f,init__$1));
+} else {
+return init__$1;
+
+}
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var root_iter = ((self__.root)?cljs.core._iterator(self__.root):cljs.core.nil_iter());
+if(self__.has_nil_QMARK_){
+return (new cljs.core.HashMapIter(self__.nil_val,root_iter,false));
+} else {
+return root_iter;
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.PersistentHashMap(self__.meta,self__.cnt,self__.root,self__.has_nil_QMARK_,self__.nil_val,self__.__hash));
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.cnt;
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_map(coll__$1,other);
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.TransientHashMap({},self__.root,self__.cnt,self__.has_nil_QMARK_,self__.nil_val));
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.PersistentHashMap.EMPTY,self__.meta);
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+if((k == null)){
+if(self__.has_nil_QMARK_){
+return (new cljs.core.PersistentHashMap(self__.meta,(self__.cnt - (1)),self__.root,false,null,null));
+} else {
+return coll__$1;
+}
+} else {
+if((self__.root == null)){
+return coll__$1;
+} else {
+var new_root = self__.root.inode_without((0),cljs.core.hash(k),k);
+if((new_root === self__.root)){
+return coll__$1;
+} else {
+return (new cljs.core.PersistentHashMap(self__.meta,(self__.cnt - (1)),new_root,self__.has_nil_QMARK_,self__.nil_val,null));
+}
+
+}
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
+var self__ = this;
+var coll__$1 = this;
+if((k == null)){
+if(((self__.has_nil_QMARK_) && ((v === self__.nil_val)))){
+return coll__$1;
+} else {
+return (new cljs.core.PersistentHashMap(self__.meta,((self__.has_nil_QMARK_)?self__.cnt:(self__.cnt + (1))),self__.root,true,v,null));
+}
+} else {
+var added_leaf_QMARK_ = (new cljs.core.Box(false));
+var new_root = (((self__.root == null))?cljs.core.BitmapIndexedNode.EMPTY:self__.root).inode_assoc((0),cljs.core.hash(k),k,v,added_leaf_QMARK_);
+if((new_root === self__.root)){
+return coll__$1;
+} else {
+return (new cljs.core.PersistentHashMap(self__.meta,((added_leaf_QMARK_.val)?(self__.cnt + (1)):self__.cnt),new_root,self__.has_nil_QMARK_,self__.nil_val,null));
+}
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+if((k == null)){
+return self__.has_nil_QMARK_;
+} else {
+if((self__.root == null)){
+return false;
+} else {
+return !((self__.root.inode_lookup((0),cljs.core.hash(k),k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel));
+
+}
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt > (0))){
+var s = ((!((self__.root == null)))?self__.root.inode_seq():null);
+if(self__.has_nil_QMARK_){
+return cljs.core.cons((new cljs.core.MapEntry(null,self__.nil_val,null)),s);
+} else {
+return s;
+}
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentHashMap(meta__$1,self__.cnt,self__.root,self__.has_nil_QMARK_,self__.nil_val,self__.__hash));
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
+var self__ = this;
+var coll__$1 = this;
+if(cljs.core.vector_QMARK_(entry)){
+return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
+} else {
+var ret = coll__$1;
+var es = cljs.core.seq(entry);
+while(true){
+if((es == null)){
+return ret;
+} else {
+var e = cljs.core.first(es);
+if(cljs.core.vector_QMARK_(e)){
+var G__2394 = ret.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(1)));
+var G__2395 = cljs.core.next(es);
+ret = G__2394;
+es = G__2395;
+continue;
+} else {
+throw (new Error("conj on a map takes map entries or seqables of map entries"));
+}
+}
+break;
+}
+}
+});
+
+cljs.core.PersistentHashMap.prototype.call = (function() {
+var G__2396 = null;
+var G__2396__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+var G__2396__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+G__2396 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2396__2.call(this,self__,k);
+case 3:
+return G__2396__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2396.cljs$core$IFn$_invoke$arity$2 = G__2396__2;
+G__2396.cljs$core$IFn$_invoke$arity$3 = G__2396__3;
+return G__2396;
+})()
+;
+
+cljs.core.PersistentHashMap.prototype.apply = (function (self__,args2369){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2369)));
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentHashMap.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$cnt,cljs.core.cst$sym$root,cljs.core.with_meta(cljs.core.cst$sym$has_DASH_nil_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean], null)),cljs.core.cst$sym$nil_DASH_val,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentHashMap.cljs$lang$type = true;
+
+cljs.core.PersistentHashMap.cljs$lang$ctorStr = "cljs.core/PersistentHashMap";
+
+cljs.core.PersistentHashMap.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentHashMap");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentHashMap.
+ */
+cljs.core.__GT_PersistentHashMap = (function cljs$core$__GT_PersistentHashMap(meta,cnt,root,has_nil_QMARK_,nil_val,__hash){
+return (new cljs.core.PersistentHashMap(meta,cnt,root,has_nil_QMARK_,nil_val,__hash));
+});
+
+cljs.core.PersistentHashMap.EMPTY = (new cljs.core.PersistentHashMap(null,(0),null,false,null,cljs.core.empty_unordered_hash));
+cljs.core.PersistentHashMap.fromArray = (function (arr,no_clone){
+var arr__$1 = ((no_clone)?arr:cljs.core.aclone(arr));
+var len = arr__$1.length;
+var i = (0);
+var ret = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
+while(true){
+if((i < len)){
+var G__2397 = (i + (2));
+var G__2398 = cljs.core._assoc_BANG_(ret,(arr__$1[i]),(arr__$1[(i + (1))]));
+i = G__2397;
+ret = G__2398;
+continue;
+} else {
+return cljs.core._persistent_BANG_(ret);
+}
+break;
+}
+});
+cljs.core.PersistentHashMap.fromArrays = (function (ks,vs){
+var len = ks.length;
+var i = (0);
+var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
+while(true){
+if((i < len)){
+var G__2399 = (i + (1));
+var G__2400 = out.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,(ks[i]),(vs[i]));
+i = G__2399;
+out = G__2400;
+continue;
+} else {
+return cljs.core.persistent_BANG_(out);
+}
+break;
+}
+});
+cljs.core.PersistentHashMap.createWithCheck = (function (arr){
+var len = arr.length;
+var ret = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
+var i_2401 = (0);
+while(true){
+if((i_2401 < len)){
+cljs.core._assoc_BANG_(ret,(arr[i_2401]),(arr[(i_2401 + (1))]));
+
+if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core._count(ret),((i_2401 / (2)) + (1)))){
+throw (new Error(["Duplicate key: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1((arr[i_2401]))].join('')));
+} else {
+var G__2402 = (i_2401 + (2));
+i_2401 = G__2402;
+continue;
+}
+} else {
+}
+break;
+}
+
+return cljs.core._persistent_BANG_(ret);
+});
+var G__2403_2406 = cljs.core.PersistentHashMap.prototype;
+var G__2404_2407 = cljs.core.ITER_SYMBOL;
+var G__2405_2408 = ((function (G__2403_2406,G__2404_2407){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2403_2406,G__2404_2407))
+;
+goog.object.set(G__2403_2406,G__2404_2407,G__2405_2408);
+
+/**
+* @constructor
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ITransientMap}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ITransientCollection}
+ * @implements {cljs.core.ITransientAssociative}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.TransientHashMap = (function (edit,root,count,has_nil_QMARK_,nil_val){
+this.edit = edit;
+this.root = root;
+this.count = count;
+this.has_nil_QMARK_ = has_nil_QMARK_;
+this.nil_val = nil_val;
+this.cljs$lang$protocol_mask$partition0$ = 259;
+this.cljs$lang$protocol_mask$partition1$ = 56;
+});
+cljs.core.TransientHashMap.prototype.conj_BANG_ = (function (o){
+var self__ = this;
+var tcoll = this;
+if(self__.edit){
+if(cljs.core.map_entry_QMARK_(o)){
+return tcoll.assoc_BANG_(cljs.core.key(o),cljs.core.val(o));
+} else {
+if(cljs.core.vector_QMARK_(o)){
+return tcoll.assoc_BANG_((o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((0)) : o.call(null,(0))),(o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((1)) : o.call(null,(1))));
+} else {
+var es = cljs.core.seq(o);
+var tcoll__$1 = tcoll;
+while(true){
+var temp__5455__auto__ = cljs.core.first(es);
+if(cljs.core.truth_(temp__5455__auto__)){
+var e = temp__5455__auto__;
+var G__2410 = cljs.core.next(es);
+var G__2411 = tcoll__$1.assoc_BANG_(cljs.core.key(e),cljs.core.val(e));
+es = G__2410;
+tcoll__$1 = G__2411;
+continue;
+} else {
+return tcoll__$1;
+}
+break;
+}
+
+}
+}
+} else {
+throw (new Error("conj! after persistent"));
+}
+});
+
+cljs.core.TransientHashMap.prototype.assoc_BANG_ = (function (k,v){
+var self__ = this;
+var tcoll = this;
+if(self__.edit){
+if((k == null)){
+if((self__.nil_val === v)){
+} else {
+self__.nil_val = v;
+}
+
+if(self__.has_nil_QMARK_){
+} else {
+self__.count = (self__.count + (1));
+
+self__.has_nil_QMARK_ = true;
+}
+
+return tcoll;
+} else {
+var added_leaf_QMARK_ = (new cljs.core.Box(false));
+var node = (((self__.root == null))?cljs.core.BitmapIndexedNode.EMPTY:self__.root).inode_assoc_BANG_(self__.edit,(0),cljs.core.hash(k),k,v,added_leaf_QMARK_);
+if((node === self__.root)){
+} else {
+self__.root = node;
+}
+
+if(added_leaf_QMARK_.val){
+self__.count = (self__.count + (1));
+} else {
+}
+
+return tcoll;
+}
+} else {
+throw (new Error("assoc! after persistent!"));
+}
+});
+
+cljs.core.TransientHashMap.prototype.without_BANG_ = (function (k){
+var self__ = this;
+var tcoll = this;
+if(self__.edit){
+if((k == null)){
+if(self__.has_nil_QMARK_){
+self__.has_nil_QMARK_ = false;
+
+self__.nil_val = null;
+
+self__.count = (self__.count - (1));
+
+return tcoll;
+} else {
+return tcoll;
+}
+} else {
+if((self__.root == null)){
+return tcoll;
+} else {
+var removed_leaf_QMARK_ = (new cljs.core.Box(false));
+var node = self__.root.inode_without_BANG_(self__.edit,(0),cljs.core.hash(k),k,removed_leaf_QMARK_);
+if((node === self__.root)){
+} else {
+self__.root = node;
+}
+
+if(removed_leaf_QMARK_.val){
+self__.count = (self__.count - (1));
+} else {
+}
+
+return tcoll;
+}
+}
+} else {
+throw (new Error("dissoc! after persistent!"));
+}
+});
+
+cljs.core.TransientHashMap.prototype.persistent_BANG_ = (function (){
+var self__ = this;
+var tcoll = this;
+if(self__.edit){
+self__.edit = null;
+
+return (new cljs.core.PersistentHashMap(null,self__.count,self__.root,self__.has_nil_QMARK_,self__.nil_val,null));
+} else {
+throw (new Error("persistent! called twice"));
+}
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if(self__.edit){
+return self__.count;
+} else {
+throw (new Error("count after persistent!"));
+}
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (tcoll,k){
+var self__ = this;
+var tcoll__$1 = this;
+if((k == null)){
+if(self__.has_nil_QMARK_){
+return self__.nil_val;
+} else {
+return null;
+}
+} else {
+if((self__.root == null)){
+return null;
+} else {
+return self__.root.inode_lookup((0),cljs.core.hash(k),k);
+}
+}
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (tcoll,k,not_found){
+var self__ = this;
+var tcoll__$1 = this;
+if((k == null)){
+if(self__.has_nil_QMARK_){
+return self__.nil_val;
+} else {
+return not_found;
+}
+} else {
+if((self__.root == null)){
+return not_found;
+} else {
+return self__.root.inode_lookup((0),cljs.core.hash(k),k,not_found);
+}
+}
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,val){
+var self__ = this;
+var tcoll__$1 = this;
+return tcoll__$1.conj_BANG_(val);
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
+var self__ = this;
+var tcoll__$1 = this;
+return tcoll__$1.persistent_BANG_();
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 = (function (tcoll,key,val){
+var self__ = this;
+var tcoll__$1 = this;
+return tcoll__$1.assoc_BANG_(key,val);
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$ITransientMap$_dissoc_BANG_$arity$2 = (function (tcoll,key){
+var self__ = this;
+var tcoll__$1 = this;
+return tcoll__$1.without_BANG_(key);
+});
+
+cljs.core.TransientHashMap.prototype.call = (function() {
+var G__2412 = null;
+var G__2412__2 = (function (self__,key){
+var self__ = this;
+var self____$1 = this;
+var tcoll = self____$1;
+return tcoll.cljs$core$ILookup$_lookup$arity$2(null,key);
+});
+var G__2412__3 = (function (self__,key,not_found){
+var self__ = this;
+var self____$1 = this;
+var tcoll = self____$1;
+return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
+});
+G__2412 = function(self__,key,not_found){
+switch(arguments.length){
+case 2:
+return G__2412__2.call(this,self__,key);
+case 3:
+return G__2412__3.call(this,self__,key,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2412.cljs$core$IFn$_invoke$arity$2 = G__2412__2;
+G__2412.cljs$core$IFn$_invoke$arity$3 = G__2412__3;
+return G__2412;
+})()
+;
+
+cljs.core.TransientHashMap.prototype.apply = (function (self__,args2409){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2409)));
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (key){
+var self__ = this;
+var tcoll = this;
+return tcoll.cljs$core$ILookup$_lookup$arity$2(null,key);
+});
+
+cljs.core.TransientHashMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (key,not_found){
+var self__ = this;
+var tcoll = this;
+return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
+});
+
+cljs.core.TransientHashMap.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$edit,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean,cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$root,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$count,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$has_DASH_nil_QMARK_,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean,cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$nil_DASH_val,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.TransientHashMap.cljs$lang$type = true;
+
+cljs.core.TransientHashMap.cljs$lang$ctorStr = "cljs.core/TransientHashMap";
+
+cljs.core.TransientHashMap.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/TransientHashMap");
+});
+
+/**
+ * Positional factory function for cljs.core/TransientHashMap.
+ */
+cljs.core.__GT_TransientHashMap = (function cljs$core$__GT_TransientHashMap(edit,root,count,has_nil_QMARK_,nil_val){
+return (new cljs.core.TransientHashMap(edit,root,count,has_nil_QMARK_,nil_val));
+});
+
+cljs.core.tree_map_seq_push = (function cljs$core$tree_map_seq_push(node,stack,ascending_QMARK_){
+var t = node;
+var stack__$1 = stack;
+while(true){
+if(!((t == null))){
+var G__2413 = ((ascending_QMARK_)?t.left:t.right);
+var G__2414 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack__$1,t);
+t = G__2413;
+stack__$1 = G__2414;
+continue;
+} else {
+return stack__$1;
+}
+break;
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.PersistentTreeMapSeq = (function (meta,stack,ascending_QMARK_,cnt,__hash){
+this.meta = meta;
+this.stack = stack;
+this.ascending_QMARK_ = ascending_QMARK_;
+this.cnt = cnt;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 32374990;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.PersistentTreeMapSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.indexOf = (function() {
+var G__2415 = null;
+var G__2415__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2415__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2415 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2415__1.call(this,x);
+case 2:
+return G__2415__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2415.cljs$core$IFn$_invoke$arity$1 = G__2415__1;
+G__2415.cljs$core$IFn$_invoke$arity$2 = G__2415__2;
+return G__2415;
+})()
+;
+
+cljs.core.PersistentTreeMapSeq.prototype.lastIndexOf = (function() {
+var G__2416 = null;
+var G__2416__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2416__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2416 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2416__1.call(this,x);
+case 2:
+return G__2416__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2416.cljs$core$IFn$_invoke$arity$1 = G__2416__1;
+G__2416.cljs$core$IFn$_invoke$arity$2 = G__2416__2;
+return G__2416;
+})()
+;
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$INext$_next$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var t = cljs.core.first(self__.stack);
+var next_stack = cljs.core.tree_map_seq_push(((self__.ascending_QMARK_)?t.right:t.left),cljs.core.next(self__.stack),self__.ascending_QMARK_);
+if((next_stack == null)){
+return null;
+} else {
+return (new cljs.core.PersistentTreeMapSeq(null,next_stack,self__.ascending_QMARK_,(self__.cnt - (1)),null));
+}
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt < (0))){
+return (cljs.core.count(cljs.core.next(coll__$1)) + (1));
+} else {
+return self__.cnt;
+}
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return cljs.core.peek(self__.stack);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var t = cljs.core.first(self__.stack);
+var next_stack = cljs.core.tree_map_seq_push(((self__.ascending_QMARK_)?t.right:t.left),cljs.core.next(self__.stack),self__.ascending_QMARK_);
+if(!((next_stack == null))){
+return (new cljs.core.PersistentTreeMapSeq(null,next_stack,self__.ascending_QMARK_,(self__.cnt - (1)),null));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return this$__$1;
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentTreeMapSeq(meta__$1,self__.stack,self__.ascending_QMARK_,self__.cnt,self__.__hash));
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.PersistentTreeMapSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$stack,cljs.core.with_meta(cljs.core.cst$sym$ascending_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean], null)),cljs.core.cst$sym$cnt,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentTreeMapSeq.cljs$lang$type = true;
+
+cljs.core.PersistentTreeMapSeq.cljs$lang$ctorStr = "cljs.core/PersistentTreeMapSeq";
+
+cljs.core.PersistentTreeMapSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentTreeMapSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentTreeMapSeq.
+ */
+cljs.core.__GT_PersistentTreeMapSeq = (function cljs$core$__GT_PersistentTreeMapSeq(meta,stack,ascending_QMARK_,cnt,__hash){
+return (new cljs.core.PersistentTreeMapSeq(meta,stack,ascending_QMARK_,cnt,__hash));
+});
+
+var G__2417_2420 = cljs.core.PersistentTreeMapSeq.prototype;
+var G__2418_2421 = cljs.core.ITER_SYMBOL;
+var G__2419_2422 = ((function (G__2417_2420,G__2418_2421){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2417_2420,G__2418_2421))
+;
+goog.object.set(G__2417_2420,G__2418_2421,G__2419_2422);
+cljs.core.create_tree_map_seq = (function cljs$core$create_tree_map_seq(tree,ascending_QMARK_,cnt){
+return (new cljs.core.PersistentTreeMapSeq(null,cljs.core.tree_map_seq_push(tree,null,ascending_QMARK_),ascending_QMARK_,cnt,null));
+});
+
+cljs.core.balance_left = (function cljs$core$balance_left(key,val,ins,right){
+if((ins instanceof cljs.core.RedNode)){
+if((ins.left instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(ins.key,ins.val,ins.left.blacken(),(new cljs.core.BlackNode(key,val,ins.right,right,null)),null));
+} else {
+if((ins.right instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(ins.right.key,ins.right.val,(new cljs.core.BlackNode(ins.key,ins.val,ins.left,ins.right.left,null)),(new cljs.core.BlackNode(key,val,ins.right.right,right,null)),null));
+} else {
+return (new cljs.core.BlackNode(key,val,ins,right,null));
+
+}
+}
+} else {
+return (new cljs.core.BlackNode(key,val,ins,right,null));
+}
+});
+cljs.core.balance_right = (function cljs$core$balance_right(key,val,left,ins){
+if((ins instanceof cljs.core.RedNode)){
+if((ins.right instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(ins.key,ins.val,(new cljs.core.BlackNode(key,val,left,ins.left,null)),ins.right.blacken(),null));
+} else {
+if((ins.left instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(ins.left.key,ins.left.val,(new cljs.core.BlackNode(key,val,left,ins.left.left,null)),(new cljs.core.BlackNode(ins.key,ins.val,ins.left.right,ins.right,null)),null));
+} else {
+return (new cljs.core.BlackNode(key,val,left,ins,null));
+
+}
+}
+} else {
+return (new cljs.core.BlackNode(key,val,left,ins,null));
+}
+});
+cljs.core.balance_left_del = (function cljs$core$balance_left_del(key,val,del,right){
+if((del instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(key,val,del.blacken(),right,null));
+} else {
+if((right instanceof cljs.core.BlackNode)){
+return cljs.core.balance_right(key,val,del,right.redden());
+} else {
+if((((right instanceof cljs.core.RedNode)) && ((right.left instanceof cljs.core.BlackNode)))){
+return (new cljs.core.RedNode(right.left.key,right.left.val,(new cljs.core.BlackNode(key,val,del,right.left.left,null)),cljs.core.balance_right(right.key,right.val,right.left.right,right.right.redden()),null));
+} else {
+throw (new Error("red-black tree invariant violation"));
+
+}
+}
+}
+});
+cljs.core.balance_right_del = (function cljs$core$balance_right_del(key,val,left,del){
+if((del instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(key,val,left,del.blacken(),null));
+} else {
+if((left instanceof cljs.core.BlackNode)){
+return cljs.core.balance_left(key,val,left.redden(),del);
+} else {
+if((((left instanceof cljs.core.RedNode)) && ((left.right instanceof cljs.core.BlackNode)))){
+return (new cljs.core.RedNode(left.right.key,left.right.val,cljs.core.balance_left(left.key,left.val,left.left.redden(),left.right.left),(new cljs.core.BlackNode(key,val,left.right.right,del,null)),null));
+} else {
+throw (new Error("red-black tree invariant violation"));
+
+}
+}
+}
+});
+cljs.core.tree_map_kv_reduce = (function cljs$core$tree_map_kv_reduce(node,f,init){
+var init__$1 = ((!((node.left == null)))?(function (){var G__2423 = node.left;
+var G__2424 = f;
+var G__2425 = init;
+return (cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3 ? cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3(G__2423,G__2424,G__2425) : cljs.core.tree_map_kv_reduce.call(null,G__2423,G__2424,G__2425));
+})():init);
+if(cljs.core.reduced_QMARK_(init__$1)){
+return init__$1;
+} else {
+var init__$2 = (function (){var G__2426 = init__$1;
+var G__2427 = node.key;
+var G__2428 = node.val;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2426,G__2427,G__2428) : f.call(null,G__2426,G__2427,G__2428));
+})();
+if(cljs.core.reduced_QMARK_(init__$2)){
+return init__$2;
+} else {
+if(!((node.right == null))){
+var G__2429 = node.right;
+var G__2430 = f;
+var G__2431 = init__$2;
+return (cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3 ? cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3(G__2429,G__2430,G__2431) : cljs.core.tree_map_kv_reduce.call(null,G__2429,G__2430,G__2431));
+} else {
+return init__$2;
+}
+}
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IVector}
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.IMapEntry}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.ILookup}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.BlackNode = (function (key,val,left,right,__hash){
+this.key = key;
+this.val = val;
+this.left = left;
+this.right = right;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 166619935;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.BlackNode.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.BlackNode.prototype.cljs$core$IFind$_find$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+var G__2433 = k;
+switch (G__2433) {
+case (0):
+return (new cljs.core.MapEntry((0),self__.key,null));
+
+break;
+case (1):
+return (new cljs.core.MapEntry((1),self__.val,null));
+
+break;
+default:
+return null;
+
+}
+});
+
+cljs.core.BlackNode.prototype.lastIndexOf = (function() {
+var G__2435 = null;
+var G__2435__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2435__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2435 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2435__1.call(this,x);
+case 2:
+return G__2435__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2435.cljs$core$IFn$_invoke$arity$1 = G__2435__1;
+G__2435.cljs$core$IFn$_invoke$arity$2 = G__2435__2;
+return G__2435;
+})()
+;
+
+cljs.core.BlackNode.prototype.indexOf = (function() {
+var G__2436 = null;
+var G__2436__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2436__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2436 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2436__1.call(this,x);
+case 2:
+return G__2436__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2436.cljs$core$IFn$_invoke$arity$1 = G__2436__1;
+G__2436.cljs$core$IFn$_invoke$arity$2 = G__2436__2;
+return G__2436;
+})()
+;
+
+cljs.core.BlackNode.prototype.add_right = (function (ins){
+var self__ = this;
+var node = this;
+return ins.balance_right(node);
+});
+
+cljs.core.BlackNode.prototype.redden = (function (){
+var self__ = this;
+var node = this;
+return (new cljs.core.RedNode(self__.key,self__.val,self__.left,self__.right,null));
+});
+
+cljs.core.BlackNode.prototype.blacken = (function (){
+var self__ = this;
+var node = this;
+return node;
+});
+
+cljs.core.BlackNode.prototype.add_left = (function (ins){
+var self__ = this;
+var node = this;
+return ins.balance_left(node);
+});
+
+cljs.core.BlackNode.prototype.replace = (function (key__$1,val__$1,left__$1,right__$1){
+var self__ = this;
+var node = this;
+return (new cljs.core.BlackNode(key__$1,val__$1,left__$1,right__$1,null));
+});
+
+cljs.core.BlackNode.prototype.balance_left = (function (parent){
+var self__ = this;
+var node = this;
+return (new cljs.core.BlackNode(parent.key,parent.val,node,parent.right,null));
+});
+
+cljs.core.BlackNode.prototype.balance_right = (function (parent){
+var self__ = this;
+var node = this;
+return (new cljs.core.BlackNode(parent.key,parent.val,parent.left,node,null));
+});
+
+cljs.core.BlackNode.prototype.remove_left = (function (del){
+var self__ = this;
+var node = this;
+return cljs.core.balance_left_del(self__.key,self__.val,del,self__.right);
+});
+
+cljs.core.BlackNode.prototype.kv_reduce = (function (f,init){
+var self__ = this;
+var node = this;
+return cljs.core.tree_map_kv_reduce(node,f,init);
+});
+
+cljs.core.BlackNode.prototype.remove_right = (function (del){
+var self__ = this;
+var node = this;
+return cljs.core.balance_right_del(self__.key,self__.val,self__.left,del);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,null);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (node,k,not_found){
+var self__ = this;
+var node__$1 = this;
+return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (node,n){
+var self__ = this;
+var node__$1 = this;
+if((n === (0))){
+return self__.key;
+} else {
+if((n === (1))){
+return self__.val;
+} else {
+throw (new Error("Index out of bounds"));
+
+}
+}
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (node,n,not_found){
+var self__ = this;
+var node__$1 = this;
+if((n === (0))){
+return self__.key;
+} else {
+if((n === (1))){
+return self__.val;
+} else {
+return not_found;
+
+}
+}
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (node,n,v){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null).cljs$core$IVector$_assoc_n$arity$3(null,n,v);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IMeta$_meta$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return null;
+});
+
+cljs.core.BlackNode.prototype.cljs$core$ICounted$_count$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (2);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IMapEntry$_key$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.key;
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IMapEntry$_val$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.val;
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IStack$_peek$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.val;
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IStack$_pop$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key], null);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (new cljs.core.IndexedSeq([self__.val,self__.key],(0),null));
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return null;
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (node,f){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(node__$1,f);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (node,f,start){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(node__$1,f,start);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (node,k,v){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),k,v);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+return (((k === (0))) || ((k === (1))));
+});
+
+cljs.core.BlackNode.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (new cljs.core.IndexedSeq([self__.key,self__.val],(0),null));
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (node,meta){
+var self__ = this;
+var node__$1 = this;
+return cljs.core._with_meta(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),meta);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$ICollection$_conj$arity$2 = (function (node,o){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val,o], null);
+});
+
+cljs.core.BlackNode.prototype.call = (function() {
+var G__2437 = null;
+var G__2437__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var node = self____$1;
+return node.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+var G__2437__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var node = self____$1;
+return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+G__2437 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2437__2.call(this,self__,k);
+case 3:
+return G__2437__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2437.cljs$core$IFn$_invoke$arity$2 = G__2437__2;
+G__2437.cljs$core$IFn$_invoke$arity$3 = G__2437__3;
+return G__2437;
+})()
+;
+
+cljs.core.BlackNode.prototype.apply = (function (self__,args2432){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2432)));
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var node = this;
+return node.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var node = this;
+return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.BlackNode.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$key,cljs.core.cst$sym$val,cljs.core.cst$sym$left,cljs.core.cst$sym$right,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.BlackNode.cljs$lang$type = true;
+
+cljs.core.BlackNode.cljs$lang$ctorStr = "cljs.core/BlackNode";
+
+cljs.core.BlackNode.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/BlackNode");
+});
+
+/**
+ * Positional factory function for cljs.core/BlackNode.
+ */
+cljs.core.__GT_BlackNode = (function cljs$core$__GT_BlackNode(key,val,left,right,__hash){
+return (new cljs.core.BlackNode(key,val,left,right,__hash));
+});
+
+var G__2438_2441 = cljs.core.BlackNode.prototype;
+var G__2439_2442 = cljs.core.ITER_SYMBOL;
+var G__2440_2443 = ((function (G__2438_2441,G__2439_2442){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2438_2441,G__2439_2442))
+;
+goog.object.set(G__2438_2441,G__2439_2442,G__2440_2443);
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IVector}
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IStack}
+ * @implements {cljs.core.IMapEntry}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.ILookup}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.RedNode = (function (key,val,left,right,__hash){
+this.key = key;
+this.val = val;
+this.left = left;
+this.right = right;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 166619935;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.RedNode.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.RedNode.prototype.cljs$core$IFind$_find$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+var G__2445 = k;
+switch (G__2445) {
+case (0):
+return (new cljs.core.MapEntry((0),self__.key,null));
+
+break;
+case (1):
+return (new cljs.core.MapEntry((1),self__.val,null));
+
+break;
+default:
+return null;
+
+}
+});
+
+cljs.core.RedNode.prototype.lastIndexOf = (function() {
+var G__2447 = null;
+var G__2447__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2447__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2447 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2447__1.call(this,x);
+case 2:
+return G__2447__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2447.cljs$core$IFn$_invoke$arity$1 = G__2447__1;
+G__2447.cljs$core$IFn$_invoke$arity$2 = G__2447__2;
+return G__2447;
+})()
+;
+
+cljs.core.RedNode.prototype.indexOf = (function() {
+var G__2448 = null;
+var G__2448__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2448__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2448 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2448__1.call(this,x);
+case 2:
+return G__2448__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2448.cljs$core$IFn$_invoke$arity$1 = G__2448__1;
+G__2448.cljs$core$IFn$_invoke$arity$2 = G__2448__2;
+return G__2448;
+})()
+;
+
+cljs.core.RedNode.prototype.add_right = (function (ins){
+var self__ = this;
+var node = this;
+return (new cljs.core.RedNode(self__.key,self__.val,self__.left,ins,null));
+});
+
+cljs.core.RedNode.prototype.redden = (function (){
+var self__ = this;
+var node = this;
+throw (new Error("red-black tree invariant violation"));
+});
+
+cljs.core.RedNode.prototype.blacken = (function (){
+var self__ = this;
+var node = this;
+return (new cljs.core.BlackNode(self__.key,self__.val,self__.left,self__.right,null));
+});
+
+cljs.core.RedNode.prototype.add_left = (function (ins){
+var self__ = this;
+var node = this;
+return (new cljs.core.RedNode(self__.key,self__.val,ins,self__.right,null));
+});
+
+cljs.core.RedNode.prototype.replace = (function (key__$1,val__$1,left__$1,right__$1){
+var self__ = this;
+var node = this;
+return (new cljs.core.RedNode(key__$1,val__$1,left__$1,right__$1,null));
+});
+
+cljs.core.RedNode.prototype.balance_left = (function (parent){
+var self__ = this;
+var node = this;
+if((self__.left instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(self__.key,self__.val,self__.left.blacken(),(new cljs.core.BlackNode(parent.key,parent.val,self__.right,parent.right,null)),null));
+} else {
+if((self__.right instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(self__.right.key,self__.right.val,(new cljs.core.BlackNode(self__.key,self__.val,self__.left,self__.right.left,null)),(new cljs.core.BlackNode(parent.key,parent.val,self__.right.right,parent.right,null)),null));
+} else {
+return (new cljs.core.BlackNode(parent.key,parent.val,node,parent.right,null));
+
+}
+}
+});
+
+cljs.core.RedNode.prototype.balance_right = (function (parent){
+var self__ = this;
+var node = this;
+if((self__.right instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(self__.key,self__.val,(new cljs.core.BlackNode(parent.key,parent.val,parent.left,self__.left,null)),self__.right.blacken(),null));
+} else {
+if((self__.left instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(self__.left.key,self__.left.val,(new cljs.core.BlackNode(parent.key,parent.val,parent.left,self__.left.left,null)),(new cljs.core.BlackNode(self__.key,self__.val,self__.left.right,self__.right,null)),null));
+} else {
+return (new cljs.core.BlackNode(parent.key,parent.val,parent.left,node,null));
+
+}
+}
+});
+
+cljs.core.RedNode.prototype.remove_left = (function (del){
+var self__ = this;
+var node = this;
+return (new cljs.core.RedNode(self__.key,self__.val,del,self__.right,null));
+});
+
+cljs.core.RedNode.prototype.kv_reduce = (function (f,init){
+var self__ = this;
+var node = this;
+return cljs.core.tree_map_kv_reduce(node,f,init);
+});
+
+cljs.core.RedNode.prototype.remove_right = (function (del){
+var self__ = this;
+var node = this;
+return (new cljs.core.RedNode(self__.key,self__.val,self__.left,del,null));
+});
+
+cljs.core.RedNode.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,null);
+});
+
+cljs.core.RedNode.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (node,k,not_found){
+var self__ = this;
+var node__$1 = this;
+return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (node,n){
+var self__ = this;
+var node__$1 = this;
+if((n === (0))){
+return self__.key;
+} else {
+if((n === (1))){
+return self__.val;
+} else {
+throw (new Error("Index out of bounds"));
+
+}
+}
+});
+
+cljs.core.RedNode.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (node,n,not_found){
+var self__ = this;
+var node__$1 = this;
+if((n === (0))){
+return self__.key;
+} else {
+if((n === (1))){
+return self__.val;
+} else {
+return not_found;
+
+}
+}
+});
+
+cljs.core.RedNode.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (node,n,v){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null).cljs$core$IVector$_assoc_n$arity$3(null,n,v);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IMeta$_meta$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return null;
+});
+
+cljs.core.RedNode.prototype.cljs$core$ICounted$_count$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (2);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IMapEntry$_key$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.key;
+});
+
+cljs.core.RedNode.prototype.cljs$core$IMapEntry$_val$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.val;
+});
+
+cljs.core.RedNode.prototype.cljs$core$IStack$_peek$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return self__.val;
+});
+
+cljs.core.RedNode.prototype.cljs$core$IStack$_pop$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key], null);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (new cljs.core.IndexedSeq([self__.val,self__.key],(0),null));
+});
+
+cljs.core.RedNode.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.RedNode.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return null;
+});
+
+cljs.core.RedNode.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (node,f){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(node__$1,f);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (node,f,start){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(node__$1,f,start);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (node,k,v){
+var self__ = this;
+var node__$1 = this;
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),k,v);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (node,k){
+var self__ = this;
+var node__$1 = this;
+return (((k === (0))) || ((k === (1))));
+});
+
+cljs.core.RedNode.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (node){
+var self__ = this;
+var node__$1 = this;
+return (new cljs.core.IndexedSeq([self__.key,self__.val],(0),null));
+});
+
+cljs.core.RedNode.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (node,meta){
+var self__ = this;
+var node__$1 = this;
+return cljs.core._with_meta(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),meta);
+});
+
+cljs.core.RedNode.prototype.cljs$core$ICollection$_conj$arity$2 = (function (node,o){
+var self__ = this;
+var node__$1 = this;
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val,o], null);
+});
+
+cljs.core.RedNode.prototype.call = (function() {
+var G__2449 = null;
+var G__2449__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var node = self____$1;
+return node.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+var G__2449__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var node = self____$1;
+return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+G__2449 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2449__2.call(this,self__,k);
+case 3:
+return G__2449__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2449.cljs$core$IFn$_invoke$arity$2 = G__2449__2;
+G__2449.cljs$core$IFn$_invoke$arity$3 = G__2449__3;
+return G__2449;
+})()
+;
+
+cljs.core.RedNode.prototype.apply = (function (self__,args2444){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2444)));
+});
+
+cljs.core.RedNode.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var node = this;
+return node.cljs$core$IIndexed$_nth$arity$2(null,k);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var node = this;
+return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
+});
+
+cljs.core.RedNode.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$key,cljs.core.cst$sym$val,cljs.core.cst$sym$left,cljs.core.cst$sym$right,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.RedNode.cljs$lang$type = true;
+
+cljs.core.RedNode.cljs$lang$ctorStr = "cljs.core/RedNode";
+
+cljs.core.RedNode.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/RedNode");
+});
+
+/**
+ * Positional factory function for cljs.core/RedNode.
+ */
+cljs.core.__GT_RedNode = (function cljs$core$__GT_RedNode(key,val,left,right,__hash){
+return (new cljs.core.RedNode(key,val,left,right,__hash));
+});
+
+var G__2450_2453 = cljs.core.RedNode.prototype;
+var G__2451_2454 = cljs.core.ITER_SYMBOL;
+var G__2452_2455 = ((function (G__2450_2453,G__2451_2454){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2450_2453,G__2451_2454))
+;
+goog.object.set(G__2450_2453,G__2451_2454,G__2452_2455);
+cljs.core.tree_map_add = (function cljs$core$tree_map_add(comp,tree,k,v,found){
+if((tree == null)){
+return (new cljs.core.RedNode(k,v,null,null,null));
+} else {
+var c = (function (){var G__2456 = k;
+var G__2457 = tree.key;
+return (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(G__2456,G__2457) : comp.call(null,G__2456,G__2457));
+})();
+if((c === (0))){
+(found[(0)] = tree);
+
+return null;
+} else {
+if((c < (0))){
+var ins = (function (){var G__2458 = comp;
+var G__2459 = tree.left;
+var G__2460 = k;
+var G__2461 = v;
+var G__2462 = found;
+return (cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5 ? cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5(G__2458,G__2459,G__2460,G__2461,G__2462) : cljs.core.tree_map_add.call(null,G__2458,G__2459,G__2460,G__2461,G__2462));
+})();
+if(!((ins == null))){
+return tree.add_left(ins);
+} else {
+return null;
+}
+} else {
+var ins = (function (){var G__2463 = comp;
+var G__2464 = tree.right;
+var G__2465 = k;
+var G__2466 = v;
+var G__2467 = found;
+return (cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5 ? cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5(G__2463,G__2464,G__2465,G__2466,G__2467) : cljs.core.tree_map_add.call(null,G__2463,G__2464,G__2465,G__2466,G__2467));
+})();
+if(!((ins == null))){
+return tree.add_right(ins);
+} else {
+return null;
+}
+
+}
+}
+}
+});
+cljs.core.tree_map_append = (function cljs$core$tree_map_append(left,right){
+if((left == null)){
+return right;
+} else {
+if((right == null)){
+return left;
+} else {
+if((left instanceof cljs.core.RedNode)){
+if((right instanceof cljs.core.RedNode)){
+var app = (function (){var G__2468 = left.right;
+var G__2469 = right.left;
+return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2468,G__2469) : cljs.core.tree_map_append.call(null,G__2468,G__2469));
+})();
+if((app instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(app.key,app.val,(new cljs.core.RedNode(left.key,left.val,left.left,app.left,null)),(new cljs.core.RedNode(right.key,right.val,app.right,right.right,null)),null));
+} else {
+return (new cljs.core.RedNode(left.key,left.val,left.left,(new cljs.core.RedNode(right.key,right.val,app,right.right,null)),null));
+}
+} else {
+return (new cljs.core.RedNode(left.key,left.val,left.left,(function (){var G__2470 = left.right;
+var G__2471 = right;
+return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2470,G__2471) : cljs.core.tree_map_append.call(null,G__2470,G__2471));
+})(),null));
+}
+} else {
+if((right instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(right.key,right.val,(function (){var G__2472 = left;
+var G__2473 = right.left;
+return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2472,G__2473) : cljs.core.tree_map_append.call(null,G__2472,G__2473));
+})(),right.right,null));
+} else {
+var app = (function (){var G__2474 = left.right;
+var G__2475 = right.left;
+return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2474,G__2475) : cljs.core.tree_map_append.call(null,G__2474,G__2475));
+})();
+if((app instanceof cljs.core.RedNode)){
+return (new cljs.core.RedNode(app.key,app.val,(new cljs.core.BlackNode(left.key,left.val,left.left,app.left,null)),(new cljs.core.BlackNode(right.key,right.val,app.right,right.right,null)),null));
+} else {
+return cljs.core.balance_left_del(left.key,left.val,left.left,(new cljs.core.BlackNode(right.key,right.val,app,right.right,null)));
+}
+
+}
+}
+}
+}
+});
+cljs.core.tree_map_remove = (function cljs$core$tree_map_remove(comp,tree,k,found){
+if(!((tree == null))){
+var c = (function (){var G__2476 = k;
+var G__2477 = tree.key;
+return (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(G__2476,G__2477) : comp.call(null,G__2476,G__2477));
+})();
+if((c === (0))){
+(found[(0)] = tree);
+
+return cljs.core.tree_map_append(tree.left,tree.right);
+} else {
+if((c < (0))){
+var del = (function (){var G__2478 = comp;
+var G__2479 = tree.left;
+var G__2480 = k;
+var G__2481 = found;
+return (cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4(G__2478,G__2479,G__2480,G__2481) : cljs.core.tree_map_remove.call(null,G__2478,G__2479,G__2480,G__2481));
+})();
+if(((!((del == null))) || (!(((found[(0)]) == null))))){
+if((tree.left instanceof cljs.core.BlackNode)){
+return cljs.core.balance_left_del(tree.key,tree.val,del,tree.right);
+} else {
+return (new cljs.core.RedNode(tree.key,tree.val,del,tree.right,null));
+}
+} else {
+return null;
+}
+} else {
+var del = (function (){var G__2482 = comp;
+var G__2483 = tree.right;
+var G__2484 = k;
+var G__2485 = found;
+return (cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4(G__2482,G__2483,G__2484,G__2485) : cljs.core.tree_map_remove.call(null,G__2482,G__2483,G__2484,G__2485));
+})();
+if(((!((del == null))) || (!(((found[(0)]) == null))))){
+if((tree.right instanceof cljs.core.BlackNode)){
+return cljs.core.balance_right_del(tree.key,tree.val,tree.left,del);
+} else {
+return (new cljs.core.RedNode(tree.key,tree.val,tree.left,del,null));
+}
+} else {
+return null;
+}
+
+}
+}
+} else {
+return null;
+}
+});
+cljs.core.tree_map_replace = (function cljs$core$tree_map_replace(comp,tree,k,v){
+var tk = tree.key;
+var c = (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(k,tk) : comp.call(null,k,tk));
+if((c === (0))){
+return tree.replace(tk,v,tree.left,tree.right);
+} else {
+if((c < (0))){
+return tree.replace(tk,tree.val,(function (){var G__2486 = comp;
+var G__2487 = tree.left;
+var G__2488 = k;
+var G__2489 = v;
+return (cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4(G__2486,G__2487,G__2488,G__2489) : cljs.core.tree_map_replace.call(null,G__2486,G__2487,G__2488,G__2489));
+})(),tree.right);
+} else {
+return tree.replace(tk,tree.val,tree.left,(function (){var G__2490 = comp;
+var G__2491 = tree.right;
+var G__2492 = k;
+var G__2493 = v;
+return (cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4(G__2490,G__2491,G__2492,G__2493) : cljs.core.tree_map_replace.call(null,G__2490,G__2491,G__2492,G__2493));
+})());
+
+}
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IKVReduce}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IFind}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISorted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.IMap}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.PersistentTreeMap = (function (comp,tree,cnt,meta,__hash){
+this.comp = comp;
+this.tree = tree;
+this.cnt = cnt;
+this.meta = meta;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 418776847;
+this.cljs$lang$protocol_mask$partition1$ = 8192;
+});
+cljs.core.PersistentTreeMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.entry_at(k);
+});
+
+cljs.core.PersistentTreeMap.prototype.forEach = (function (f){
+var self__ = this;
+var coll = this;
+var seq__2495 = cljs.core.seq(coll);
+var chunk__2496 = null;
+var count__2497 = (0);
+var i__2498 = (0);
+while(true){
+if((i__2498 < count__2497)){
+var vec__2499 = chunk__2496.cljs$core$IIndexed$_nth$arity$2(null,i__2498);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2499,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2499,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2509 = seq__2495;
+var G__2510 = chunk__2496;
+var G__2511 = count__2497;
+var G__2512 = (i__2498 + (1));
+seq__2495 = G__2509;
+chunk__2496 = G__2510;
+count__2497 = G__2511;
+i__2498 = G__2512;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__2495);
+if(temp__5457__auto__){
+var seq__2495__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__2495__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__2495__$1);
+var G__2513 = cljs.core.chunk_rest(seq__2495__$1);
+var G__2514 = c__4338__auto__;
+var G__2515 = cljs.core.count(c__4338__auto__);
+var G__2516 = (0);
+seq__2495 = G__2513;
+chunk__2496 = G__2514;
+count__2497 = G__2515;
+i__2498 = G__2516;
+continue;
+} else {
+var vec__2502 = cljs.core.first(seq__2495__$1);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2502,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2502,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2517 = cljs.core.next(seq__2495__$1);
+var G__2518 = null;
+var G__2519 = (0);
+var G__2520 = (0);
+seq__2495 = G__2517;
+chunk__2496 = G__2518;
+count__2497 = G__2519;
+i__2498 = G__2520;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.get = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentTreeMap.prototype.entries = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_entries_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentTreeMap.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentTreeMap.prototype.keys = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.keys(coll));
+});
+
+cljs.core.PersistentTreeMap.prototype.values = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.vals(coll));
+});
+
+cljs.core.PersistentTreeMap.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentTreeMap.prototype.entry_at = (function (k){
+var self__ = this;
+var coll = this;
+var t = self__.tree;
+while(true){
+if(!((t == null))){
+var c = (function (){var G__2505 = k;
+var G__2506 = t.key;
+return (self__.comp.cljs$core$IFn$_invoke$arity$2 ? self__.comp.cljs$core$IFn$_invoke$arity$2(G__2505,G__2506) : self__.comp.call(null,G__2505,G__2506));
+})();
+if((c === (0))){
+return t;
+} else {
+if((c < (0))){
+var G__2521 = t.left;
+t = G__2521;
+continue;
+} else {
+var G__2522 = t.right;
+t = G__2522;
+continue;
+
+}
+}
+} else {
+return null;
+}
+break;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.has = (function (k){
+var self__ = this;
+var coll = this;
+return cljs.core.contains_QMARK_(coll,k);
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
+var self__ = this;
+var coll__$1 = this;
+var n = coll__$1.entry_at(k);
+if(!((n == null))){
+return n.val;
+} else {
+return not_found;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
+var self__ = this;
+var coll__$1 = this;
+if(!((self__.tree == null))){
+return cljs.core.unreduced(cljs.core.tree_map_kv_reduce(self__.tree,f,init));
+} else {
+return init;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.PersistentTreeMap(self__.comp,self__.tree,self__.cnt,self__.meta,self__.__hash));
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.cnt;
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt > (0))){
+return cljs.core.create_tree_map_seq(self__.tree,false,self__.cnt);
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_map(coll__$1,other);
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentTreeMap(self__.comp,null,(0),self__.meta,(0)));
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+var found = [null];
+var t = cljs.core.tree_map_remove(self__.comp,self__.tree,k,found);
+if((t == null)){
+if((cljs.core.nth.cljs$core$IFn$_invoke$arity$2(found,(0)) == null)){
+return coll__$1;
+} else {
+return (new cljs.core.PersistentTreeMap(self__.comp,null,(0),self__.meta,null));
+}
+} else {
+return (new cljs.core.PersistentTreeMap(self__.comp,t.blacken(),(self__.cnt - (1)),self__.meta,null));
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
+var self__ = this;
+var coll__$1 = this;
+var found = [null];
+var t = cljs.core.tree_map_add(self__.comp,self__.tree,k,v,found);
+if((t == null)){
+var found_node = cljs.core.nth.cljs$core$IFn$_invoke$arity$2(found,(0));
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(v,found_node.val)){
+return coll__$1;
+} else {
+return (new cljs.core.PersistentTreeMap(self__.comp,cljs.core.tree_map_replace(self__.comp,self__.tree,k,v),self__.cnt,self__.meta,null));
+}
+} else {
+return (new cljs.core.PersistentTreeMap(self__.comp,t.blacken(),(self__.cnt + (1)),self__.meta,null));
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
+var self__ = this;
+var coll__$1 = this;
+return !((coll__$1.entry_at(k) == null));
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt > (0))){
+return cljs.core.create_tree_map_seq(self__.tree,true,self__.cnt);
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentTreeMap(self__.comp,self__.tree,self__.cnt,meta__$1,self__.__hash));
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
+var self__ = this;
+var coll__$1 = this;
+if(cljs.core.vector_QMARK_(entry)){
+return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
+} else {
+var ret = coll__$1;
+var es = cljs.core.seq(entry);
+while(true){
+if((es == null)){
+return ret;
+} else {
+var e = cljs.core.first(es);
+if(cljs.core.vector_QMARK_(e)){
+var G__2523 = ret.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(1)));
+var G__2524 = cljs.core.next(es);
+ret = G__2523;
+es = G__2524;
+continue;
+} else {
+throw (new Error("conj on a map takes map entries or seqables of map entries"));
+}
+}
+break;
+}
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.call = (function() {
+var G__2525 = null;
+var G__2525__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+var G__2525__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+G__2525 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2525__2.call(this,self__,k);
+case 3:
+return G__2525__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2525.cljs$core$IFn$_invoke$arity$2 = G__2525__2;
+G__2525.cljs$core$IFn$_invoke$arity$3 = G__2525__3;
+return G__2525;
+})()
+;
+
+cljs.core.PersistentTreeMap.prototype.apply = (function (self__,args2494){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2494)));
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_sorted_seq$arity$2 = (function (coll,ascending_QMARK_){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt > (0))){
+return cljs.core.create_tree_map_seq(self__.tree,ascending_QMARK_,self__.cnt);
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_sorted_seq_from$arity$3 = (function (coll,k,ascending_QMARK_){
+var self__ = this;
+var coll__$1 = this;
+if((self__.cnt > (0))){
+var stack = null;
+var t = self__.tree;
+while(true){
+if(!((t == null))){
+var c = (function (){var G__2507 = k;
+var G__2508 = t.key;
+return (self__.comp.cljs$core$IFn$_invoke$arity$2 ? self__.comp.cljs$core$IFn$_invoke$arity$2(G__2507,G__2508) : self__.comp.call(null,G__2507,G__2508));
+})();
+if((c === (0))){
+return (new cljs.core.PersistentTreeMapSeq(null,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack,t),ascending_QMARK_,(-1),null));
+} else {
+if(cljs.core.truth_(ascending_QMARK_)){
+if((c < (0))){
+var G__2526 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack,t);
+var G__2527 = t.left;
+stack = G__2526;
+t = G__2527;
+continue;
+} else {
+var G__2528 = stack;
+var G__2529 = t.right;
+stack = G__2528;
+t = G__2529;
+continue;
+}
+} else {
+if((c > (0))){
+var G__2530 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack,t);
+var G__2531 = t.right;
+stack = G__2530;
+t = G__2531;
+continue;
+} else {
+var G__2532 = stack;
+var G__2533 = t.left;
+stack = G__2532;
+t = G__2533;
+continue;
+}
+
+}
+}
+} else {
+if((stack == null)){
+return null;
+} else {
+return (new cljs.core.PersistentTreeMapSeq(null,stack,ascending_QMARK_,(-1),null));
+}
+}
+break;
+}
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_entry_key$arity$2 = (function (coll,entry){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.key(entry);
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_comparator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.comp;
+});
+
+cljs.core.PersistentTreeMap.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$comp,cljs.core.cst$sym$tree,cljs.core.cst$sym$cnt,cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentTreeMap.cljs$lang$type = true;
+
+cljs.core.PersistentTreeMap.cljs$lang$ctorStr = "cljs.core/PersistentTreeMap";
+
+cljs.core.PersistentTreeMap.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentTreeMap");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentTreeMap.
+ */
+cljs.core.__GT_PersistentTreeMap = (function cljs$core$__GT_PersistentTreeMap(comp,tree,cnt,meta,__hash){
+return (new cljs.core.PersistentTreeMap(comp,tree,cnt,meta,__hash));
+});
+
+cljs.core.PersistentTreeMap.EMPTY = (new cljs.core.PersistentTreeMap(cljs.core.compare,null,(0),null,cljs.core.empty_unordered_hash));
+var G__2534_2537 = cljs.core.PersistentTreeMap.prototype;
+var G__2535_2538 = cljs.core.ITER_SYMBOL;
+var G__2536_2539 = ((function (G__2534_2537,G__2535_2538){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2534_2537,G__2535_2538))
+;
+goog.object.set(G__2534_2537,G__2535_2538,G__2536_2539);
+/**
+ * keyval => key val
+ *   Returns a new hash map with supplied mappings.
+ */
+cljs.core.hash_map = (function cljs$core$hash_map(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2541 = arguments.length;
+var i__4519__auto___2542 = (0);
+while(true){
+if((i__4519__auto___2542 < len__4518__auto___2541)){
+args__4521__auto__.push((arguments[i__4519__auto___2542]));
+
+var G__2543 = (i__4519__auto___2542 + (1));
+i__4519__auto___2542 = G__2543;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.hash_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.hash_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
+var in$ = cljs.core.seq(keyvals);
+var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
+while(true){
+if(in$){
+var G__2544 = cljs.core.nnext(in$);
+var G__2545 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,cljs.core.first(in$),cljs.core.second(in$));
+in$ = G__2544;
+out = G__2545;
+continue;
+} else {
+return cljs.core.persistent_BANG_(out);
+}
+break;
+}
+});
+
+cljs.core.hash_map.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.hash_map.cljs$lang$applyTo = (function (seq2540){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2540));
+});
+
+/**
+ * keyval => key val
+ *   Returns a new array map with supplied mappings.
+ */
+cljs.core.array_map = (function cljs$core$array_map(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2547 = arguments.length;
+var i__4519__auto___2548 = (0);
+while(true){
+if((i__4519__auto___2548 < len__4518__auto___2547)){
+args__4521__auto__.push((arguments[i__4519__auto___2548]));
+
+var G__2549 = (i__4519__auto___2548 + (1));
+i__4519__auto___2548 = G__2549;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.array_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.array_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
+var arr = (((((keyvals instanceof cljs.core.IndexedSeq)) && ((keyvals.i === (0)))))?keyvals.arr:cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(keyvals));
+return cljs.core.PersistentArrayMap.createAsIfByAssoc(arr);
+});
+
+cljs.core.array_map.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.array_map.cljs$lang$applyTo = (function (seq2546){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2546));
+});
+
+/**
+ * keyval => key val
+ *   Returns a new object map with supplied mappings.
+ */
+cljs.core.obj_map = (function cljs$core$obj_map(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2556 = arguments.length;
+var i__4519__auto___2557 = (0);
+while(true){
+if((i__4519__auto___2557 < len__4518__auto___2556)){
+args__4521__auto__.push((arguments[i__4519__auto___2557]));
+
+var G__2558 = (i__4519__auto___2557 + (1));
+i__4519__auto___2557 = G__2558;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.obj_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.obj_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
+var ks = [];
+var obj = {};
+var kvs = cljs.core.seq(keyvals);
+while(true){
+if(kvs){
+ks.push(cljs.core.first(kvs));
+
+var G__2553_2559 = obj;
+var G__2554_2560 = cljs.core.first(kvs);
+var G__2555_2561 = cljs.core.second(kvs);
+goog.object.set(G__2553_2559,G__2554_2560,G__2555_2561);
+
+var G__2562 = cljs.core.nnext(kvs);
+kvs = G__2562;
+continue;
+} else {
+return cljs.core.ObjMap.fromObject(ks,obj);
+}
+break;
+}
+});
+
+cljs.core.obj_map.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.obj_map.cljs$lang$applyTo = (function (seq2550){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2550));
+});
+
+/**
+ * keyval => key val
+ *   Returns a new sorted map with supplied mappings.
+ */
+cljs.core.sorted_map = (function cljs$core$sorted_map(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2564 = arguments.length;
+var i__4519__auto___2565 = (0);
+while(true){
+if((i__4519__auto___2565 < len__4518__auto___2564)){
+args__4521__auto__.push((arguments[i__4519__auto___2565]));
+
+var G__2566 = (i__4519__auto___2565 + (1));
+i__4519__auto___2565 = G__2566;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.sorted_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.sorted_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
+var in$ = cljs.core.seq(keyvals);
+var out = cljs.core.PersistentTreeMap.EMPTY;
+while(true){
+if(in$){
+var G__2567 = cljs.core.nnext(in$);
+var G__2568 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(out,cljs.core.first(in$),cljs.core.second(in$));
+in$ = G__2567;
+out = G__2568;
+continue;
+} else {
+return out;
+}
+break;
+}
+});
+
+cljs.core.sorted_map.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.sorted_map.cljs$lang$applyTo = (function (seq2563){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2563));
+});
+
+/**
+ * keyval => key val
+ *   Returns a new sorted map with supplied mappings, using the supplied comparator.
+ */
+cljs.core.sorted_map_by = (function cljs$core$sorted_map_by(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2571 = arguments.length;
+var i__4519__auto___2572 = (0);
+while(true){
+if((i__4519__auto___2572 < len__4518__auto___2571)){
+args__4521__auto__.push((arguments[i__4519__auto___2572]));
+
+var G__2573 = (i__4519__auto___2572 + (1));
+i__4519__auto___2572 = G__2573;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.core.sorted_map_by.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.core.sorted_map_by.cljs$core$IFn$_invoke$arity$variadic = (function (comparator,keyvals){
+var in$ = cljs.core.seq(keyvals);
+var out = (new cljs.core.PersistentTreeMap(cljs.core.fn__GT_comparator(comparator),null,(0),null,(0)));
+while(true){
+if(in$){
+var G__2574 = cljs.core.nnext(in$);
+var G__2575 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(out,cljs.core.first(in$),cljs.core.second(in$));
+in$ = G__2574;
+out = G__2575;
+continue;
+} else {
+return out;
+}
+break;
+}
+});
+
+cljs.core.sorted_map_by.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.core.sorted_map_by.cljs$lang$applyTo = (function (seq2569){
+var G__2570 = cljs.core.first(seq2569);
+var seq2569__$1 = cljs.core.next(seq2569);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2570,seq2569__$1);
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.KeySeq = (function (mseq,_meta){
+this.mseq = mseq;
+this._meta = _meta;
+this.cljs$lang$protocol_mask$partition0$ = 32374988;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.KeySeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.KeySeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.KeySeq.prototype.indexOf = (function() {
+var G__2578 = null;
+var G__2578__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2578__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2578 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2578__1.call(this,x);
+case 2:
+return G__2578__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2578.cljs$core$IFn$_invoke$arity$1 = G__2578__1;
+G__2578.cljs$core$IFn$_invoke$arity$2 = G__2578__2;
+return G__2578;
+})()
+;
+
+cljs.core.KeySeq.prototype.lastIndexOf = (function() {
+var G__2579 = null;
+var G__2579__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2579__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2579 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2579__1.call(this,x);
+case 2:
+return G__2579__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2579.cljs$core$IFn$_invoke$arity$1 = G__2579__1;
+G__2579.cljs$core$IFn$_invoke$arity$2 = G__2579__2;
+return G__2579;
+})()
+;
+
+cljs.core.KeySeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__._meta;
+});
+
+cljs.core.KeySeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var nseq = ((((!((self__.mseq == null)))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
+if((nseq == null)){
+return null;
+} else {
+return (new cljs.core.KeySeq(nseq,self__._meta));
+}
+});
+
+cljs.core.KeySeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.hash_ordered_coll(coll__$1);
+});
+
+cljs.core.KeySeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.KeySeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__._meta);
+});
+
+cljs.core.KeySeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.KeySeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.KeySeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var me = self__.mseq.cljs$core$ISeq$_first$arity$1(null);
+return me.cljs$core$IMapEntry$_key$arity$1(null);
+});
+
+cljs.core.KeySeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var nseq = ((((!((self__.mseq == null)))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
+if(!((nseq == null))){
+return (new cljs.core.KeySeq(nseq,self__._meta));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.KeySeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.KeySeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.KeySeq(self__.mseq,new_meta));
+});
+
+cljs.core.KeySeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.KeySeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$mseq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$not_DASH_native], null)),cljs.core.cst$sym$_meta], null);
+});
+
+cljs.core.KeySeq.cljs$lang$type = true;
+
+cljs.core.KeySeq.cljs$lang$ctorStr = "cljs.core/KeySeq";
+
+cljs.core.KeySeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/KeySeq");
+});
+
+/**
+ * Positional factory function for cljs.core/KeySeq.
+ */
+cljs.core.__GT_KeySeq = (function cljs$core$__GT_KeySeq(mseq,_meta){
+return (new cljs.core.KeySeq(mseq,_meta));
+});
+
+var G__2580_2583 = cljs.core.KeySeq.prototype;
+var G__2581_2584 = cljs.core.ITER_SYMBOL;
+var G__2582_2585 = ((function (G__2580_2583,G__2581_2584){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2580_2583,G__2581_2584))
+;
+goog.object.set(G__2580_2583,G__2581_2584,G__2582_2585);
+/**
+ * Returns a sequence of the map's keys.
+ */
+cljs.core.keys = (function cljs$core$keys(hash_map){
+var temp__5457__auto__ = cljs.core.seq(hash_map);
+if(temp__5457__auto__){
+var mseq = temp__5457__auto__;
+return (new cljs.core.KeySeq(mseq,null));
+} else {
+return null;
+}
+});
+/**
+ * Returns the key of the map entry.
+ */
+cljs.core.key = (function cljs$core$key(map_entry){
+return cljs.core._key(map_entry);
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.ValSeq = (function (mseq,_meta){
+this.mseq = mseq;
+this._meta = _meta;
+this.cljs$lang$protocol_mask$partition0$ = 32374988;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.ValSeq.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.ValSeq.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.ValSeq.prototype.indexOf = (function() {
+var G__2588 = null;
+var G__2588__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2588__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2588 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2588__1.call(this,x);
+case 2:
+return G__2588__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2588.cljs$core$IFn$_invoke$arity$1 = G__2588__1;
+G__2588.cljs$core$IFn$_invoke$arity$2 = G__2588__2;
+return G__2588;
+})()
+;
+
+cljs.core.ValSeq.prototype.lastIndexOf = (function() {
+var G__2589 = null;
+var G__2589__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2589__2 = (function (x,start){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
+});
+G__2589 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__2589__1.call(this,x);
+case 2:
+return G__2589__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2589.cljs$core$IFn$_invoke$arity$1 = G__2589__1;
+G__2589.cljs$core$IFn$_invoke$arity$2 = G__2589__2;
+return G__2589;
+})()
+;
+
+cljs.core.ValSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__._meta;
+});
+
+cljs.core.ValSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var nseq = ((((!((self__.mseq == null)))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
+if((nseq == null)){
+return null;
+} else {
+return (new cljs.core.ValSeq(nseq,self__._meta));
+}
+});
+
+cljs.core.ValSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.hash_ordered_coll(coll__$1);
+});
+
+cljs.core.ValSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.equiv_sequential(coll__$1,other);
+});
+
+cljs.core.ValSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__._meta);
+});
+
+cljs.core.ValSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
+});
+
+cljs.core.ValSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
+});
+
+cljs.core.ValSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var me = self__.mseq.cljs$core$ISeq$_first$arity$1(null);
+return me.cljs$core$IMapEntry$_val$arity$1(null);
+});
+
+cljs.core.ValSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var nseq = ((((!((self__.mseq == null)))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
+if(!((nseq == null))){
+return (new cljs.core.ValSeq(nseq,self__._meta));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.ValSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1;
+});
+
+cljs.core.ValSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.ValSeq(self__.mseq,new_meta));
+});
+
+cljs.core.ValSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.cons(o,coll__$1);
+});
+
+cljs.core.ValSeq.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$mseq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$not_DASH_native], null)),cljs.core.cst$sym$_meta], null);
+});
+
+cljs.core.ValSeq.cljs$lang$type = true;
+
+cljs.core.ValSeq.cljs$lang$ctorStr = "cljs.core/ValSeq";
+
+cljs.core.ValSeq.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ValSeq");
+});
+
+/**
+ * Positional factory function for cljs.core/ValSeq.
+ */
+cljs.core.__GT_ValSeq = (function cljs$core$__GT_ValSeq(mseq,_meta){
+return (new cljs.core.ValSeq(mseq,_meta));
+});
+
+var G__2590_2593 = cljs.core.ValSeq.prototype;
+var G__2591_2594 = cljs.core.ITER_SYMBOL;
+var G__2592_2595 = ((function (G__2590_2593,G__2591_2594){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2590_2593,G__2591_2594))
+;
+goog.object.set(G__2590_2593,G__2591_2594,G__2592_2595);
+/**
+ * Returns a sequence of the map's values.
+ */
+cljs.core.vals = (function cljs$core$vals(hash_map){
+var temp__5457__auto__ = cljs.core.seq(hash_map);
+if(temp__5457__auto__){
+var mseq = temp__5457__auto__;
+return (new cljs.core.ValSeq(mseq,null));
+} else {
+return null;
+}
+});
+/**
+ * Returns the value in the map entry.
+ */
+cljs.core.val = (function cljs$core$val(map_entry){
+return cljs.core._val(map_entry);
+});
+/**
+ * Returns a map that consists of the rest of the maps conj-ed onto
+ *   the first.  If a key occurs in more than one map, the mapping from
+ *   the latter (left-to-right) will be the mapping in the result.
+ */
+cljs.core.merge = (function cljs$core$merge(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2599 = arguments.length;
+var i__4519__auto___2600 = (0);
+while(true){
+if((i__4519__auto___2600 < len__4518__auto___2599)){
+args__4521__auto__.push((arguments[i__4519__auto___2600]));
+
+var G__2601 = (i__4519__auto___2600 + (1));
+i__4519__auto___2600 = G__2601;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic = (function (maps){
+if(cljs.core.truth_(cljs.core.some(cljs.core.identity,maps))){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$2((function (p1__2596_SHARP_,p2__2597_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2((function (){var or__3936__auto__ = p1__2596_SHARP_;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.PersistentArrayMap.EMPTY;
+}
+})(),p2__2597_SHARP_);
+}),maps);
+} else {
+return null;
+}
+});
+
+cljs.core.merge.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.merge.cljs$lang$applyTo = (function (seq2598){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2598));
+});
+
+/**
+ * Returns a map that consists of the rest of the maps conj-ed onto
+ *   the first.  If a key occurs in more than one map, the mapping(s)
+ *   from the latter (left-to-right) will be combined with the mapping in
+ *   the result by calling (f val-in-result val-in-latter).
+ */
+cljs.core.merge_with = (function cljs$core$merge_with(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2606 = arguments.length;
+var i__4519__auto___2607 = (0);
+while(true){
+if((i__4519__auto___2607 < len__4518__auto___2606)){
+args__4521__auto__.push((arguments[i__4519__auto___2607]));
+
+var G__2608 = (i__4519__auto___2607 + (1));
+i__4519__auto___2607 = G__2608;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.core.merge_with.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.core.merge_with.cljs$core$IFn$_invoke$arity$variadic = (function (f,maps){
+if(cljs.core.truth_(cljs.core.some(cljs.core.identity,maps))){
+var merge_entry = (function (m,e){
+var k = cljs.core.first(e);
+var v = cljs.core.second(e);
+if(cljs.core.contains_QMARK_(m,k)){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2604 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+var G__2605 = v;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2604,G__2605) : f.call(null,G__2604,G__2605));
+})());
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,v);
+}
+});
+var merge2 = ((function (merge_entry){
+return (function (m1,m2){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(merge_entry,(function (){var or__3936__auto__ = m1;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.PersistentArrayMap.EMPTY;
+}
+})(),cljs.core.seq(m2));
+});})(merge_entry))
+;
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$2(merge2,maps);
+} else {
+return null;
+}
+});
+
+cljs.core.merge_with.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.core.merge_with.cljs$lang$applyTo = (function (seq2602){
+var G__2603 = cljs.core.first(seq2602);
+var seq2602__$1 = cljs.core.next(seq2602);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2603,seq2602__$1);
+});
+
+/**
+ * Returns a map containing only those entries in map whose key is in keys
+ */
+cljs.core.select_keys = (function cljs$core$select_keys(map,keyseq){
+var ret = cljs.core.PersistentArrayMap.EMPTY;
+var keys = cljs.core.seq(keyseq);
+while(true){
+if(keys){
+var key = cljs.core.first(keys);
+var entry = cljs.core.get.cljs$core$IFn$_invoke$arity$3(map,key,cljs.core.cst$kw$cljs$core_SLASH_not_DASH_found);
+var G__2609 = ((cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(entry,cljs.core.cst$kw$cljs$core_SLASH_not_DASH_found))?cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(ret,key,entry):ret);
+var G__2610 = cljs.core.next(keys);
+ret = G__2609;
+keys = G__2610;
+continue;
+} else {
+return cljs.core._with_meta(ret,cljs.core.meta(map));
+}
+break;
+}
+});
+
+/**
+* @constructor
+*/
+cljs.core.HashSetIter = (function (iter){
+this.iter = iter;
+});
+cljs.core.HashSetIter.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+return self__.iter.hasNext();
+});
+
+cljs.core.HashSetIter.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+if(self__.iter.hasNext()){
+return self__.iter.next().key;
+} else {
+throw (new Error("No such element"));
+}
+});
+
+cljs.core.HashSetIter.prototype.remove = (function (){
+var self__ = this;
+var _ = this;
+return (new Error("Unsupported operation"));
+});
+
+cljs.core.HashSetIter.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$iter], null);
+});
+
+cljs.core.HashSetIter.cljs$lang$type = true;
+
+cljs.core.HashSetIter.cljs$lang$ctorStr = "cljs.core/HashSetIter";
+
+cljs.core.HashSetIter.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/HashSetIter");
+});
+
+/**
+ * Positional factory function for cljs.core/HashSetIter.
+ */
+cljs.core.__GT_HashSetIter = (function cljs$core$__GT_HashSetIter(iter){
+return (new cljs.core.HashSetIter(iter));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEditableCollection}
+ * @implements {cljs.core.ISet}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.PersistentHashSet = (function (meta,hash_map,__hash){
+this.meta = meta;
+this.hash_map = hash_map;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 15077647;
+this.cljs$lang$protocol_mask$partition1$ = 139268;
+});
+cljs.core.PersistentHashSet.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentHashSet.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentHashSet.prototype.keys = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentHashSet.prototype.entries = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_set_entries_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentHashSet.prototype.values = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentHashSet.prototype.has = (function (k){
+var self__ = this;
+var coll = this;
+return cljs.core.contains_QMARK_(coll,k);
+});
+
+cljs.core.PersistentHashSet.prototype.forEach = (function (f){
+var self__ = this;
+var coll = this;
+var seq__2614 = cljs.core.seq(coll);
+var chunk__2615 = null;
+var count__2616 = (0);
+var i__2617 = (0);
+while(true){
+if((i__2617 < count__2616)){
+var vec__2618 = chunk__2615.cljs$core$IIndexed$_nth$arity$2(null,i__2617);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2618,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2618,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2627 = seq__2614;
+var G__2628 = chunk__2615;
+var G__2629 = count__2616;
+var G__2630 = (i__2617 + (1));
+seq__2614 = G__2627;
+chunk__2615 = G__2628;
+count__2616 = G__2629;
+i__2617 = G__2630;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__2614);
+if(temp__5457__auto__){
+var seq__2614__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__2614__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__2614__$1);
+var G__2631 = cljs.core.chunk_rest(seq__2614__$1);
+var G__2632 = c__4338__auto__;
+var G__2633 = cljs.core.count(c__4338__auto__);
+var G__2634 = (0);
+seq__2614 = G__2631;
+chunk__2615 = G__2632;
+count__2616 = G__2633;
+i__2617 = G__2634;
+continue;
+} else {
+var vec__2621 = cljs.core.first(seq__2614__$1);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2621,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2621,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2635 = cljs.core.next(seq__2614__$1);
+var G__2636 = null;
+var G__2637 = (0);
+var G__2638 = (0);
+seq__2614 = G__2635;
+chunk__2615 = G__2636;
+count__2616 = G__2637;
+i__2617 = G__2638;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,v){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,v,not_found){
+var self__ = this;
+var coll__$1 = this;
+var temp__5455__auto__ = cljs.core._find(self__.hash_map,v);
+if(cljs.core.truth_(temp__5455__auto__)){
+var entry = temp__5455__auto__;
+return cljs.core.key(entry);
+} else {
+return not_found;
+}
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.HashSetIter(cljs.core._iterator(self__.hash_map)));
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.PersistentHashSet(self__.meta,self__.hash_map,self__.__hash));
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._count(self__.hash_map);
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+var and__3925__auto__ = cljs.core.set_QMARK_(other);
+if(and__3925__auto__){
+var and__3925__auto____$1 = (cljs.core.count(coll__$1) === cljs.core.count(other));
+if(and__3925__auto____$1){
+try{return cljs.core.reduce_kv(((function (and__3925__auto____$1,and__3925__auto__,coll__$1){
+return (function (p1__2612_SHARP_,p2__2611_SHARP_){
+var or__3936__auto__ = cljs.core.contains_QMARK_(other,p2__2611_SHARP_);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return cljs.core.reduced(false);
+}
+});})(and__3925__auto____$1,and__3925__auto__,coll__$1))
+,true,self__.hash_map);
+}catch (e2626){if((e2626 instanceof Error)){
+var ex = e2626;
+return false;
+} else {
+throw e2626;
+
+}
+}} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.TransientHashSet(cljs.core._as_transient(self__.hash_map)));
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._with_meta(cljs.core.PersistentHashSet.EMPTY,self__.meta);
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$ISet$_disjoin$arity$2 = (function (coll,v){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentHashSet(self__.meta,cljs.core._dissoc(self__.hash_map,v),null));
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.keys(self__.hash_map);
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentHashSet(meta__$1,self__.hash_map,self__.__hash));
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentHashSet(self__.meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.hash_map,o,null),null));
+});
+
+cljs.core.PersistentHashSet.prototype.call = (function() {
+var G__2639 = null;
+var G__2639__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+var G__2639__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+G__2639 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2639__2.call(this,self__,k);
+case 3:
+return G__2639__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2639.cljs$core$IFn$_invoke$arity$2 = G__2639__2;
+G__2639.cljs$core$IFn$_invoke$arity$3 = G__2639__3;
+return G__2639;
+})()
+;
+
+cljs.core.PersistentHashSet.prototype.apply = (function (self__,args2613){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2613)));
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentHashSet.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$hash_DASH_map,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentHashSet.cljs$lang$type = true;
+
+cljs.core.PersistentHashSet.cljs$lang$ctorStr = "cljs.core/PersistentHashSet";
+
+cljs.core.PersistentHashSet.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentHashSet");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentHashSet.
+ */
+cljs.core.__GT_PersistentHashSet = (function cljs$core$__GT_PersistentHashSet(meta,hash_map,__hash){
+return (new cljs.core.PersistentHashSet(meta,hash_map,__hash));
+});
+
+cljs.core.PersistentHashSet.EMPTY = (new cljs.core.PersistentHashSet(null,cljs.core.PersistentArrayMap.EMPTY,cljs.core.empty_unordered_hash));
+cljs.core.PersistentHashSet.fromArray = (function (items,no_clone){
+var len = items.length;
+if((len <= cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD)){
+var arr = ((no_clone)?items:cljs.core.aclone(items));
+var i = (0);
+var out = cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY);
+while(true){
+if((i < len)){
+var G__2640 = (i + (1));
+var G__2641 = cljs.core._assoc_BANG_(out,(items[i]),null);
+i = G__2640;
+out = G__2641;
+continue;
+} else {
+return (new cljs.core.PersistentHashSet(null,cljs.core._persistent_BANG_(out),null));
+}
+break;
+}
+} else {
+var i = (0);
+var out = cljs.core.transient$(cljs.core.PersistentHashSet.EMPTY);
+while(true){
+if((i < len)){
+var G__2642 = (i + (1));
+var G__2643 = cljs.core._conj_BANG_(out,(items[i]));
+i = G__2642;
+out = G__2643;
+continue;
+} else {
+return cljs.core._persistent_BANG_(out);
+}
+break;
+}
+}
+});
+cljs.core.PersistentHashSet.createWithCheck = (function (items){
+var len = items.length;
+var t = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
+var n__4395__auto___2644 = len;
+var i_2645 = (0);
+while(true){
+if((i_2645 < n__4395__auto___2644)){
+cljs.core._conj_BANG_(t,(items[i_2645]));
+
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(t),(i_2645 + (1)))){
+} else {
+throw (new Error(["Duplicate key: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1((items[i_2645]))].join('')));
+}
+
+var G__2646 = (i_2645 + (1));
+i_2645 = G__2646;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core._persistent_BANG_(t);
+});
+cljs.core.PersistentHashSet.createAsIfByAssoc = (function (items){
+var len = items.length;
+var t = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
+var n__4395__auto___2647 = len;
+var i_2648 = (0);
+while(true){
+if((i_2648 < n__4395__auto___2647)){
+cljs.core._conj_BANG_(t,(items[i_2648]));
+
+var G__2649 = (i_2648 + (1));
+i_2648 = G__2649;
+continue;
+} else {
+}
+break;
+}
+
+return cljs.core._persistent_BANG_(t);
+});
+var G__2650_2653 = cljs.core.PersistentHashSet.prototype;
+var G__2651_2654 = cljs.core.ITER_SYMBOL;
+var G__2652_2655 = ((function (G__2650_2653,G__2651_2654){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2650_2653,G__2651_2654))
+;
+goog.object.set(G__2650_2653,G__2651_2654,G__2652_2655);
+
+/**
+* @constructor
+ * @implements {cljs.core.ITransientSet}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ITransientCollection}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.TransientHashSet = (function (transient_map){
+this.transient_map = transient_map;
+this.cljs$lang$protocol_mask$partition1$ = 136;
+this.cljs$lang$protocol_mask$partition0$ = 259;
+});
+cljs.core.TransientHashSet.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,o){
+var self__ = this;
+var tcoll__$1 = this;
+self__.transient_map = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(self__.transient_map,o,null);
+
+return tcoll__$1;
+});
+
+cljs.core.TransientHashSet.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
+var self__ = this;
+var tcoll__$1 = this;
+return (new cljs.core.PersistentHashSet(null,cljs.core.persistent_BANG_(self__.transient_map),null));
+});
+
+cljs.core.TransientHashSet.prototype.cljs$core$ITransientSet$_disjoin_BANG_$arity$2 = (function (tcoll,v){
+var self__ = this;
+var tcoll__$1 = this;
+self__.transient_map = cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$2(self__.transient_map,v);
+
+return tcoll__$1;
+});
+
+cljs.core.TransientHashSet.prototype.cljs$core$ICounted$_count$arity$1 = (function (tcoll){
+var self__ = this;
+var tcoll__$1 = this;
+return cljs.core.count(self__.transient_map);
+});
+
+cljs.core.TransientHashSet.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (tcoll,v){
+var self__ = this;
+var tcoll__$1 = this;
+return tcoll__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
+});
+
+cljs.core.TransientHashSet.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (tcoll,v,not_found){
+var self__ = this;
+var tcoll__$1 = this;
+if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,v,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
+return not_found;
+} else {
+return v;
+}
+});
+
+cljs.core.TransientHashSet.prototype.call = (function() {
+var G__2657 = null;
+var G__2657__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var tcoll = self____$1;
+if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
+return null;
+} else {
+return k;
+}
+});
+var G__2657__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var tcoll = self____$1;
+if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
+return not_found;
+} else {
+return k;
+}
+});
+G__2657 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2657__2.call(this,self__,k);
+case 3:
+return G__2657__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2657.cljs$core$IFn$_invoke$arity$2 = G__2657__2;
+G__2657.cljs$core$IFn$_invoke$arity$3 = G__2657__3;
+return G__2657;
+})()
+;
+
+cljs.core.TransientHashSet.prototype.apply = (function (self__,args2656){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2656)));
+});
+
+cljs.core.TransientHashSet.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var tcoll = this;
+if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
+return null;
+} else {
+return k;
+}
+});
+
+cljs.core.TransientHashSet.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var tcoll = this;
+if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
+return not_found;
+} else {
+return k;
+}
+});
+
+cljs.core.TransientHashSet.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$transient_DASH_map,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.TransientHashSet.cljs$lang$type = true;
+
+cljs.core.TransientHashSet.cljs$lang$ctorStr = "cljs.core/TransientHashSet";
+
+cljs.core.TransientHashSet.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/TransientHashSet");
+});
+
+/**
+ * Positional factory function for cljs.core/TransientHashSet.
+ */
+cljs.core.__GT_TransientHashSet = (function cljs$core$__GT_TransientHashSet(transient_map){
+return (new cljs.core.TransientHashSet(transient_map));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IReversible}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.ISet}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISorted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.PersistentTreeSet = (function (meta,tree_map,__hash){
+this.meta = meta;
+this.tree_map = tree_map;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 417730831;
+this.cljs$lang$protocol_mask$partition1$ = 8192;
+});
+cljs.core.PersistentTreeSet.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.PersistentTreeSet.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.PersistentTreeSet.prototype.keys = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentTreeSet.prototype.entries = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_set_entries_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentTreeSet.prototype.values = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.es6_iterator(cljs.core.seq(coll));
+});
+
+cljs.core.PersistentTreeSet.prototype.has = (function (k){
+var self__ = this;
+var coll = this;
+return cljs.core.contains_QMARK_(coll,k);
+});
+
+cljs.core.PersistentTreeSet.prototype.forEach = (function (f){
+var self__ = this;
+var coll = this;
+var seq__2661 = cljs.core.seq(coll);
+var chunk__2662 = null;
+var count__2663 = (0);
+var i__2664 = (0);
+while(true){
+if((i__2664 < count__2663)){
+var vec__2665 = chunk__2662.cljs$core$IIndexed$_nth$arity$2(null,i__2664);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2665,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2665,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2674 = seq__2661;
+var G__2675 = chunk__2662;
+var G__2676 = count__2663;
+var G__2677 = (i__2664 + (1));
+seq__2661 = G__2674;
+chunk__2662 = G__2675;
+count__2663 = G__2676;
+i__2664 = G__2677;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__2661);
+if(temp__5457__auto__){
+var seq__2661__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__2661__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__2661__$1);
+var G__2678 = cljs.core.chunk_rest(seq__2661__$1);
+var G__2679 = c__4338__auto__;
+var G__2680 = cljs.core.count(c__4338__auto__);
+var G__2681 = (0);
+seq__2661 = G__2678;
+chunk__2662 = G__2679;
+count__2663 = G__2680;
+i__2664 = G__2681;
+continue;
+} else {
+var vec__2668 = cljs.core.first(seq__2661__$1);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2668,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2668,(1),null);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
+
+
+var G__2682 = cljs.core.next(seq__2661__$1);
+var G__2683 = null;
+var G__2684 = (0);
+var G__2685 = (0);
+seq__2661 = G__2682;
+chunk__2662 = G__2683;
+count__2663 = G__2684;
+i__2664 = G__2685;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,v){
+var self__ = this;
+var coll__$1 = this;
+return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,v,not_found){
+var self__ = this;
+var coll__$1 = this;
+var n = self__.tree_map.entry_at(v);
+if(!((n == null))){
+return n.key;
+} else {
+return not_found;
+}
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return self__.meta;
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.PersistentTreeSet(self__.meta,self__.tree_map,self__.__hash));
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.count(self__.tree_map);
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+if((cljs.core.count(self__.tree_map) > (0))){
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.key,cljs.core.rseq(self__.tree_map));
+} else {
+return null;
+}
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
+var self__ = this;
+var coll__$1 = this;
+var and__3925__auto__ = cljs.core.set_QMARK_(other);
+if(and__3925__auto__){
+var and__3925__auto____$1 = (cljs.core.count(coll__$1) === cljs.core.count(other));
+if(and__3925__auto____$1){
+try{return cljs.core.reduce_kv(((function (and__3925__auto____$1,and__3925__auto__,coll__$1){
+return (function (p1__2659_SHARP_,p2__2658_SHARP_){
+var or__3936__auto__ = cljs.core.contains_QMARK_(other,p2__2658_SHARP_);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return cljs.core.reduced(false);
+}
+});})(and__3925__auto____$1,and__3925__auto__,coll__$1))
+,true,self__.tree_map);
+}catch (e2673){if((e2673 instanceof Error)){
+var ex = e2673;
+return false;
+} else {
+throw e2673;
+
+}
+}} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentTreeSet(self__.meta,cljs.core._empty(self__.tree_map),(0)));
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ISet$_disjoin$arity$2 = (function (coll,v){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentTreeSet(self__.meta,cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(self__.tree_map,v),null));
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.keys(self__.tree_map);
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentTreeSet(meta__$1,self__.tree_map,self__.__hash));
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.PersistentTreeSet(self__.meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.tree_map,o,null),null));
+});
+
+cljs.core.PersistentTreeSet.prototype.call = (function() {
+var G__2686 = null;
+var G__2686__2 = (function (self__,k){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+var G__2686__3 = (function (self__,k,not_found){
+var self__ = this;
+var self____$1 = this;
+var coll = self____$1;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+G__2686 = function(self__,k,not_found){
+switch(arguments.length){
+case 2:
+return G__2686__2.call(this,self__,k);
+case 3:
+return G__2686__3.call(this,self__,k,not_found);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__2686.cljs$core$IFn$_invoke$arity$2 = G__2686__2;
+G__2686.cljs$core$IFn$_invoke$arity$3 = G__2686__3;
+return G__2686;
+})()
+;
+
+cljs.core.PersistentTreeSet.prototype.apply = (function (self__,args2660){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2660)));
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
+var self__ = this;
+var coll = this;
+return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_sorted_seq$arity$2 = (function (coll,ascending_QMARK_){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.key,cljs.core._sorted_seq(self__.tree_map,ascending_QMARK_));
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_sorted_seq_from$arity$3 = (function (coll,k,ascending_QMARK_){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.key,cljs.core._sorted_seq_from(self__.tree_map,k,ascending_QMARK_));
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_entry_key$arity$2 = (function (coll,entry){
+var self__ = this;
+var coll__$1 = this;
+return entry;
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_comparator$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._comparator(self__.tree_map);
+});
+
+cljs.core.PersistentTreeSet.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$tree_DASH_map,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.PersistentTreeSet.cljs$lang$type = true;
+
+cljs.core.PersistentTreeSet.cljs$lang$ctorStr = "cljs.core/PersistentTreeSet";
+
+cljs.core.PersistentTreeSet.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/PersistentTreeSet");
+});
+
+/**
+ * Positional factory function for cljs.core/PersistentTreeSet.
+ */
+cljs.core.__GT_PersistentTreeSet = (function cljs$core$__GT_PersistentTreeSet(meta,tree_map,__hash){
+return (new cljs.core.PersistentTreeSet(meta,tree_map,__hash));
+});
+
+cljs.core.PersistentTreeSet.EMPTY = (new cljs.core.PersistentTreeSet(null,cljs.core.PersistentTreeMap.EMPTY,cljs.core.empty_unordered_hash));
+var G__2687_2690 = cljs.core.PersistentTreeSet.prototype;
+var G__2688_2691 = cljs.core.ITER_SYMBOL;
+var G__2689_2692 = ((function (G__2687_2690,G__2688_2691){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2687_2690,G__2688_2691))
+;
+goog.object.set(G__2687_2690,G__2688_2691,G__2689_2692);
+cljs.core.set_from_indexed_seq = (function cljs$core$set_from_indexed_seq(iseq){
+var arr = iseq.arr;
+var ret = (function (){var a__4392__auto__ = arr;
+var l__4393__auto__ = a__4392__auto__.length;
+var i = (0);
+var res = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
+while(true){
+if((i < l__4393__auto__)){
+var G__2693 = (i + (1));
+var G__2694 = res.cljs$core$ITransientCollection$_conj_BANG_$arity$2(null,(arr[i]));
+i = G__2693;
+res = G__2694;
+continue;
+} else {
+return res;
+}
+break;
+}
+})();
+return ret.cljs$core$ITransientCollection$_persistent_BANG_$arity$1(null);
+});
+/**
+ * Returns a set of the distinct elements of coll.
+ */
+cljs.core.set = (function cljs$core$set(coll){
+var in$ = cljs.core.seq(coll);
+if((in$ == null)){
+return cljs.core.PersistentHashSet.EMPTY;
+} else {
+if((((in$ instanceof cljs.core.IndexedSeq)) && ((in$.i === (0))))){
+return cljs.core.PersistentHashSet.createAsIfByAssoc(in$.arr);
+} else {
+var in$__$1 = in$;
+var out = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
+while(true){
+if(!((in$__$1 == null))){
+var G__2695 = cljs.core.next(in$__$1);
+var G__2696 = out.cljs$core$ITransientCollection$_conj_BANG_$arity$2(null,in$__$1.cljs$core$ISeq$_first$arity$1(null));
+in$__$1 = G__2695;
+out = G__2696;
+continue;
+} else {
+return cljs.core.persistent_BANG_(out);
+}
+break;
+}
+
+}
+}
+});
+/**
+ * Returns a new hash set with supplied keys.  Any equal keys are
+ *   handled as if by repeated uses of conj.
+ */
+cljs.core.hash_set = (function cljs$core$hash_set(var_args){
+var G__2699 = arguments.length;
+switch (G__2699) {
+case 0:
+return cljs.core.hash_set.cljs$core$IFn$_invoke$arity$0();
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___2701 = arguments.length;
+var i__4519__auto___2702 = (0);
+while(true){
+if((i__4519__auto___2702 < len__4518__auto___2701)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___2702]));
+
+var G__2703 = (i__4519__auto___2702 + (1));
+i__4519__auto___2702 = G__2703;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((0)),(0),null));
+return cljs.core.hash_set.cljs$core$IFn$_invoke$arity$variadic(argseq__4534__auto__);
+
+}
+});
+
+cljs.core.hash_set.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.PersistentHashSet.EMPTY;
+});
+
+cljs.core.hash_set.cljs$core$IFn$_invoke$arity$variadic = (function (keys){
+return cljs.core.set(keys);
+});
+
+/** @this {Function} */
+cljs.core.hash_set.cljs$lang$applyTo = (function (seq2698){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2698));
+});
+
+cljs.core.hash_set.cljs$lang$maxFixedArity = (0);
+
+/**
+ * Returns a new sorted set with supplied keys.
+ */
+cljs.core.sorted_set = (function cljs$core$sorted_set(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2705 = arguments.length;
+var i__4519__auto___2706 = (0);
+while(true){
+if((i__4519__auto___2706 < len__4518__auto___2705)){
+args__4521__auto__.push((arguments[i__4519__auto___2706]));
+
+var G__2707 = (i__4519__auto___2706 + (1));
+i__4519__auto___2706 = G__2707;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.sorted_set.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.sorted_set.cljs$core$IFn$_invoke$arity$variadic = (function (keys){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,cljs.core.PersistentTreeSet.EMPTY,keys);
+});
+
+cljs.core.sorted_set.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.sorted_set.cljs$lang$applyTo = (function (seq2704){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2704));
+});
+
+/**
+ * Returns a new sorted set with supplied keys, using the supplied comparator.
+ */
+cljs.core.sorted_set_by = (function cljs$core$sorted_set_by(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2710 = arguments.length;
+var i__4519__auto___2711 = (0);
+while(true){
+if((i__4519__auto___2711 < len__4518__auto___2710)){
+args__4521__auto__.push((arguments[i__4519__auto___2711]));
+
+var G__2712 = (i__4519__auto___2711 + (1));
+i__4519__auto___2711 = G__2712;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.core.sorted_set_by.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.core.sorted_set_by.cljs$core$IFn$_invoke$arity$variadic = (function (comparator,keys){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,(new cljs.core.PersistentTreeSet(null,cljs.core.sorted_map_by(comparator),(0))),keys);
+});
+
+cljs.core.sorted_set_by.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.core.sorted_set_by.cljs$lang$applyTo = (function (seq2708){
+var G__2709 = cljs.core.first(seq2708);
+var seq2708__$1 = cljs.core.next(seq2708);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2709,seq2708__$1);
+});
+
+/**
+ * Given a map of replacement pairs and a vector/collection, returns a
+ *   vector/seq with any elements = a key in smap replaced with the
+ *   corresponding val in smap.  Returns a transducer when no collection
+ *   is provided.
+ */
+cljs.core.replace = (function cljs$core$replace(var_args){
+var G__2716 = arguments.length;
+switch (G__2716) {
+case 1:
+return cljs.core.replace.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.replace.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.replace.cljs$core$IFn$_invoke$arity$1 = (function (smap){
+return cljs.core.map.cljs$core$IFn$_invoke$arity$1((function (p1__2713_SHARP_){
+var temp__5455__auto__ = cljs.core.find(smap,p1__2713_SHARP_);
+if(cljs.core.truth_(temp__5455__auto__)){
+var e = temp__5455__auto__;
+return cljs.core.val(e);
+} else {
+return p1__2713_SHARP_;
+}
+}));
+});
+
+cljs.core.replace.cljs$core$IFn$_invoke$arity$2 = (function (smap,coll){
+if(cljs.core.vector_QMARK_(coll)){
+var n = cljs.core.count(coll);
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (n){
+return (function (v,i){
+var temp__5455__auto__ = cljs.core.find(smap,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,i));
+if(cljs.core.truth_(temp__5455__auto__)){
+var e = temp__5455__auto__;
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(v,i,cljs.core.second(e));
+} else {
+return v;
+}
+});})(n))
+,coll,cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.iterate(cljs.core.inc,(0))));
+} else {
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__2714_SHARP_){
+var temp__5455__auto__ = cljs.core.find(smap,p1__2714_SHARP_);
+if(cljs.core.truth_(temp__5455__auto__)){
+var e = temp__5455__auto__;
+return cljs.core.second(e);
+} else {
+return p1__2714_SHARP_;
+}
+}),coll);
+}
+});
+
+cljs.core.replace.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a lazy sequence of the elements of coll with duplicates removed.
+ *   Returns a stateful transducer when no collection is provided.
+ */
+cljs.core.distinct = (function cljs$core$distinct(var_args){
+var G__2719 = arguments.length;
+switch (G__2719) {
+case 0:
+return cljs.core.distinct.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.distinct.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.distinct.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (function (rf){
+var seen = cljs.core.volatile_BANG_(cljs.core.PersistentHashSet.EMPTY);
+return ((function (seen){
+return (function() {
+var G__2730 = null;
+var G__2730__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__2730__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__2730__2 = (function (result,input){
+if(cljs.core.contains_QMARK_(cljs.core.deref(seen),input)){
+return result;
+} else {
+cljs.core._vreset_BANG_(seen,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core._deref(seen),input));
+
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+}
+});
+G__2730 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__2730__0.call(this);
+case 1:
+return G__2730__1.call(this,result);
+case 2:
+return G__2730__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2730.cljs$core$IFn$_invoke$arity$0 = G__2730__0;
+G__2730.cljs$core$IFn$_invoke$arity$1 = G__2730__1;
+G__2730.cljs$core$IFn$_invoke$arity$2 = G__2730__2;
+return G__2730;
+})()
+;})(seen))
+});
+});
+
+cljs.core.distinct.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+var step = (function cljs$core$step(xs,seen){
+return (new cljs.core.LazySeq(null,(function (){
+var fexpr__2724 = (function (p__2725,seen__$1){
+while(true){
+var vec__2726 = p__2725;
+var f = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2726,(0),null);
+var xs__$1 = vec__2726;
+var temp__5457__auto__ = cljs.core.seq(xs__$1);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+if(cljs.core.contains_QMARK_(seen__$1,f)){
+var G__2731 = cljs.core.rest(s);
+var G__2732 = seen__$1;
+p__2725 = G__2731;
+seen__$1 = G__2732;
+continue;
+} else {
+return cljs.core.cons(f,cljs$core$step(cljs.core.rest(s),cljs.core.conj.cljs$core$IFn$_invoke$arity$2(seen__$1,f)));
+}
+} else {
+return null;
+}
+break;
+}
+});
+return fexpr__2724(xs,seen);
+}),null,null));
+});
+return step(coll,cljs.core.PersistentHashSet.EMPTY);
+});
+
+cljs.core.distinct.cljs$lang$maxFixedArity = 1;
+
+/**
+ * Return a seq of all but the last item in coll, in linear time
+ */
+cljs.core.butlast = (function cljs$core$butlast(s){
+var ret = cljs.core.PersistentVector.EMPTY;
+var s__$1 = s;
+while(true){
+if(cljs.core.next(s__$1)){
+var G__2733 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(ret,cljs.core.first(s__$1));
+var G__2734 = cljs.core.next(s__$1);
+ret = G__2733;
+s__$1 = G__2734;
+continue;
+} else {
+return cljs.core.seq(ret);
+}
+break;
+}
+});
+/**
+ * Returns the name String of a string, symbol or keyword.
+ */
+cljs.core.name = (function cljs$core$name(x){
+if(((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition1$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$INamed$))))?true:false):false)){
+return x.cljs$core$INamed$_name$arity$1(null);
+} else {
+if(typeof x === 'string'){
+return x;
+} else {
+throw (new Error(["Doesn't support name: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)].join('')));
+}
+}
+});
+/**
+ * Returns a map with the keys mapped to the corresponding vals.
+ */
+cljs.core.zipmap = (function cljs$core$zipmap(keys,vals){
+var map = cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY);
+var ks = cljs.core.seq(keys);
+var vs = cljs.core.seq(vals);
+while(true){
+if(((ks) && (vs))){
+var G__2736 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(map,cljs.core.first(ks),cljs.core.first(vs));
+var G__2737 = cljs.core.next(ks);
+var G__2738 = cljs.core.next(vs);
+map = G__2736;
+ks = G__2737;
+vs = G__2738;
+continue;
+} else {
+return cljs.core.persistent_BANG_(map);
+}
+break;
+}
+});
+/**
+ * Returns the x for which (k x), a number, is greatest.
+ *   
+ *   If there are multiple such xs, the last one is returned.
+ */
+cljs.core.max_key = (function cljs$core$max_key(var_args){
+var G__2746 = arguments.length;
+switch (G__2746) {
+case 2:
+return cljs.core.max_key.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.max_key.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___2748 = arguments.length;
+var i__4519__auto___2749 = (0);
+while(true){
+if((i__4519__auto___2749 < len__4518__auto___2748)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___2749]));
+
+var G__2750 = (i__4519__auto___2749 + (1));
+i__4519__auto___2749 = G__2750;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.max_key.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.max_key.cljs$core$IFn$_invoke$arity$2 = (function (k,x){
+return x;
+});
+
+cljs.core.max_key.cljs$core$IFn$_invoke$arity$3 = (function (k,x,y){
+if(((k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(x) : k.call(null,x)) > (k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(y) : k.call(null,y)))){
+return x;
+} else {
+return y;
+}
+});
+
+cljs.core.max_key.cljs$core$IFn$_invoke$arity$variadic = (function (k,x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__2739_SHARP_,p2__2740_SHARP_){
+return cljs.core.max_key.cljs$core$IFn$_invoke$arity$3(k,p1__2739_SHARP_,p2__2740_SHARP_);
+}),cljs.core.max_key.cljs$core$IFn$_invoke$arity$3(k,x,y),more);
+});
+
+/** @this {Function} */
+cljs.core.max_key.cljs$lang$applyTo = (function (seq2742){
+var G__2743 = cljs.core.first(seq2742);
+var seq2742__$1 = cljs.core.next(seq2742);
+var G__2744 = cljs.core.first(seq2742__$1);
+var seq2742__$2 = cljs.core.next(seq2742__$1);
+var G__2745 = cljs.core.first(seq2742__$2);
+var seq2742__$3 = cljs.core.next(seq2742__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2743,G__2744,G__2745,seq2742__$3);
+});
+
+cljs.core.max_key.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Returns the x for which (k x), a number, is least.
+ * 
+ *   If there are multiple such xs, the last one is returned.
+ */
+cljs.core.min_key = (function cljs$core$min_key(var_args){
+var G__2758 = arguments.length;
+switch (G__2758) {
+case 2:
+return cljs.core.min_key.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.min_key.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___2760 = arguments.length;
+var i__4519__auto___2761 = (0);
+while(true){
+if((i__4519__auto___2761 < len__4518__auto___2760)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___2761]));
+
+var G__2762 = (i__4519__auto___2761 + (1));
+i__4519__auto___2761 = G__2762;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.min_key.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.min_key.cljs$core$IFn$_invoke$arity$2 = (function (k,x){
+return x;
+});
+
+cljs.core.min_key.cljs$core$IFn$_invoke$arity$3 = (function (k,x,y){
+if(((k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(x) : k.call(null,x)) < (k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(y) : k.call(null,y)))){
+return x;
+} else {
+return y;
+}
+});
+
+cljs.core.min_key.cljs$core$IFn$_invoke$arity$variadic = (function (k,x,y,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__2751_SHARP_,p2__2752_SHARP_){
+return cljs.core.min_key.cljs$core$IFn$_invoke$arity$3(k,p1__2751_SHARP_,p2__2752_SHARP_);
+}),cljs.core.min_key.cljs$core$IFn$_invoke$arity$3(k,x,y),more);
+});
+
+/** @this {Function} */
+cljs.core.min_key.cljs$lang$applyTo = (function (seq2754){
+var G__2755 = cljs.core.first(seq2754);
+var seq2754__$1 = cljs.core.next(seq2754);
+var G__2756 = cljs.core.first(seq2754__$1);
+var seq2754__$2 = cljs.core.next(seq2754__$1);
+var G__2757 = cljs.core.first(seq2754__$2);
+var seq2754__$3 = cljs.core.next(seq2754__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2755,G__2756,G__2757,seq2754__$3);
+});
+
+cljs.core.min_key.cljs$lang$maxFixedArity = (3);
+
+
+/**
+* @constructor
+*/
+cljs.core.ArrayList = (function (arr){
+this.arr = arr;
+});
+cljs.core.ArrayList.prototype.add = (function (x){
+var self__ = this;
+var _ = this;
+return self__.arr.push(x);
+});
+
+cljs.core.ArrayList.prototype.size = (function (){
+var self__ = this;
+var _ = this;
+return self__.arr.length;
+});
+
+cljs.core.ArrayList.prototype.clear = (function (){
+var self__ = this;
+var _ = this;
+return self__.arr = [];
+});
+
+cljs.core.ArrayList.prototype.isEmpty = (function (){
+var self__ = this;
+var _ = this;
+return (self__.arr.length === (0));
+});
+
+cljs.core.ArrayList.prototype.toArray = (function (){
+var self__ = this;
+var _ = this;
+return self__.arr;
+});
+
+cljs.core.ArrayList.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.ArrayList.cljs$lang$type = true;
+
+cljs.core.ArrayList.cljs$lang$ctorStr = "cljs.core/ArrayList";
+
+cljs.core.ArrayList.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/ArrayList");
+});
+
+/**
+ * Positional factory function for cljs.core/ArrayList.
+ */
+cljs.core.__GT_ArrayList = (function cljs$core$__GT_ArrayList(arr){
+return (new cljs.core.ArrayList(arr));
+});
+
+cljs.core.array_list = (function cljs$core$array_list(){
+return (new cljs.core.ArrayList([]));
+});
+/**
+ * Returns a lazy sequence of lists like partition, but may include
+ *   partitions with fewer than n items at the end.  Returns a stateful
+ *   transducer when no collection is provided.
+ */
+cljs.core.partition_all = (function cljs$core$partition_all(var_args){
+var G__2764 = arguments.length;
+switch (G__2764) {
+case 1:
+return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.partition_all.cljs$core$IFn$_invoke$arity$1 = (function (n){
+return (function (rf){
+var a = cljs.core.array_list();
+return ((function (a){
+return (function() {
+var G__2766 = null;
+var G__2766__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__2766__1 = (function (result){
+var result__$1 = (cljs.core.truth_(a.isEmpty())?result:(function (){var v = cljs.core.vec(a.toArray());
+a.clear();
+
+return cljs.core.unreduced((rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v)));
+})());
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result__$1) : rf.call(null,result__$1));
+});
+var G__2766__2 = (function (result,input){
+a.add(input);
+
+if((n === a.size())){
+var v = cljs.core.vec(a.toArray());
+a.clear();
+
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
+} else {
+return result;
+}
+});
+G__2766 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__2766__0.call(this);
+case 1:
+return G__2766__1.call(this,result);
+case 2:
+return G__2766__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2766.cljs$core$IFn$_invoke$arity$0 = G__2766__0;
+G__2766.cljs$core$IFn$_invoke$arity$1 = G__2766__1;
+G__2766.cljs$core$IFn$_invoke$arity$2 = G__2766__2;
+return G__2766;
+})()
+;})(a))
+});
+});
+
+cljs.core.partition_all.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
+return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3(n,n,coll);
+});
+
+cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3 = (function (n,step,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+return cljs.core.cons(cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,s),cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3(n,step,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(step,s)));
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.partition_all.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Returns a lazy sequence of successive items from coll while
+ *   (pred item) returns logical true. pred must be free of side-effects.
+ *   Returns a transducer when no collection is provided.
+ */
+cljs.core.take_while = (function cljs$core$take_while(var_args){
+var G__2768 = arguments.length;
+switch (G__2768) {
+case 1:
+return cljs.core.take_while.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.take_while.cljs$core$IFn$_invoke$arity$1 = (function (pred){
+return (function (rf){
+return (function() {
+var G__2771 = null;
+var G__2771__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__2771__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__2771__2 = (function (result,input){
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input)))){
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+} else {
+return cljs.core.reduced(result);
+}
+});
+G__2771 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__2771__0.call(this);
+case 1:
+return G__2771__1.call(this,result);
+case 2:
+return G__2771__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2771.cljs$core$IFn$_invoke$arity$0 = G__2771__0;
+G__2771.cljs$core$IFn$_invoke$arity$1 = G__2771__1;
+G__2771.cljs$core$IFn$_invoke$arity$2 = G__2771__2;
+return G__2771;
+})()
+});
+});
+
+cljs.core.take_while.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+if(cljs.core.truth_((function (){var G__2769 = cljs.core.first(s);
+return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__2769) : pred.call(null,G__2769));
+})())){
+return cljs.core.cons(cljs.core.first(s),cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(pred,cljs.core.rest(s)));
+} else {
+return null;
+}
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.take_while.cljs$lang$maxFixedArity = 2;
+
+cljs.core.mk_bound_fn = (function cljs$core$mk_bound_fn(sc,test,key){
+return (function (e){
+var comp = cljs.core._comparator(sc);
+var G__2772 = (function (){var G__2774 = cljs.core._entry_key(sc,e);
+var G__2775 = key;
+return (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(G__2774,G__2775) : comp.call(null,G__2774,G__2775));
+})();
+var G__2773 = (0);
+return (test.cljs$core$IFn$_invoke$arity$2 ? test.cljs$core$IFn$_invoke$arity$2(G__2772,G__2773) : test.call(null,G__2772,G__2773));
+});
+});
+/**
+ * sc must be a sorted collection, test(s) one of <, <=, > or
+ *   >=. Returns a seq of those entries with keys ek for
+ *   which (test (.. sc comparator (compare ek key)) 0) is true
+ */
+cljs.core.subseq = (function cljs$core$subseq(var_args){
+var G__2777 = arguments.length;
+switch (G__2777) {
+case 3:
+return cljs.core.subseq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 5:
+return cljs.core.subseq.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.subseq.cljs$core$IFn$_invoke$arity$3 = (function (sc,test,key){
+var include = cljs.core.mk_bound_fn(sc,test,key);
+if(cljs.core.truth_((function (){var fexpr__2778 = cljs.core.PersistentHashSet.createAsIfByAssoc([cljs.core._GT_,cljs.core._GT__EQ_]);
+return (fexpr__2778.cljs$core$IFn$_invoke$arity$1 ? fexpr__2778.cljs$core$IFn$_invoke$arity$1(test) : fexpr__2778.call(null,test));
+})())){
+var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,key,true);
+if(cljs.core.truth_(temp__5457__auto__)){
+var vec__2779 = temp__5457__auto__;
+var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2779,(0),null);
+var s = vec__2779;
+if(cljs.core.truth_((include.cljs$core$IFn$_invoke$arity$1 ? include.cljs$core$IFn$_invoke$arity$1(e) : include.call(null,e)))){
+return s;
+} else {
+return cljs.core.next(s);
+}
+} else {
+return null;
+}
+} else {
+return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(include,cljs.core._sorted_seq(sc,true));
+}
+});
+
+cljs.core.subseq.cljs$core$IFn$_invoke$arity$5 = (function (sc,start_test,start_key,end_test,end_key){
+var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,start_key,true);
+if(cljs.core.truth_(temp__5457__auto__)){
+var vec__2782 = temp__5457__auto__;
+var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2782,(0),null);
+var s = vec__2782;
+return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(cljs.core.mk_bound_fn(sc,end_test,end_key),(cljs.core.truth_((function (){var fexpr__2785 = cljs.core.mk_bound_fn(sc,start_test,start_key);
+return (fexpr__2785.cljs$core$IFn$_invoke$arity$1 ? fexpr__2785.cljs$core$IFn$_invoke$arity$1(e) : fexpr__2785.call(null,e));
+})())?s:cljs.core.next(s)));
+} else {
+return null;
+}
+});
+
+cljs.core.subseq.cljs$lang$maxFixedArity = 5;
+
+/**
+ * sc must be a sorted collection, test(s) one of <, <=, > or
+ *   >=. Returns a reverse seq of those entries with keys ek for
+ *   which (test (.. sc comparator (compare ek key)) 0) is true
+ */
+cljs.core.rsubseq = (function cljs$core$rsubseq(var_args){
+var G__2788 = arguments.length;
+switch (G__2788) {
+case 3:
+return cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 5:
+return cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$3 = (function (sc,test,key){
+var include = cljs.core.mk_bound_fn(sc,test,key);
+if(cljs.core.truth_((function (){var fexpr__2789 = cljs.core.PersistentHashSet.createAsIfByAssoc([cljs.core._LT_,cljs.core._LT__EQ_]);
+return (fexpr__2789.cljs$core$IFn$_invoke$arity$1 ? fexpr__2789.cljs$core$IFn$_invoke$arity$1(test) : fexpr__2789.call(null,test));
+})())){
+var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,key,false);
+if(cljs.core.truth_(temp__5457__auto__)){
+var vec__2790 = temp__5457__auto__;
+var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2790,(0),null);
+var s = vec__2790;
+if(cljs.core.truth_((include.cljs$core$IFn$_invoke$arity$1 ? include.cljs$core$IFn$_invoke$arity$1(e) : include.call(null,e)))){
+return s;
+} else {
+return cljs.core.next(s);
+}
+} else {
+return null;
+}
+} else {
+return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(include,cljs.core._sorted_seq(sc,false));
+}
+});
+
+cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$5 = (function (sc,start_test,start_key,end_test,end_key){
+var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,end_key,false);
+if(cljs.core.truth_(temp__5457__auto__)){
+var vec__2793 = temp__5457__auto__;
+var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2793,(0),null);
+var s = vec__2793;
+return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(cljs.core.mk_bound_fn(sc,start_test,start_key),(cljs.core.truth_((function (){var fexpr__2796 = cljs.core.mk_bound_fn(sc,end_test,end_key);
+return (fexpr__2796.cljs$core$IFn$_invoke$arity$1 ? fexpr__2796.cljs$core$IFn$_invoke$arity$1(e) : fexpr__2796.call(null,e));
+})())?s:cljs.core.next(s)));
+} else {
+return null;
+}
+});
+
+cljs.core.rsubseq.cljs$lang$maxFixedArity = 5;
+
+
+/**
+* @constructor
+*/
+cljs.core.RangeIterator = (function (i,end,step){
+this.i = i;
+this.end = end;
+this.step = step;
+});
+cljs.core.RangeIterator.prototype.hasNext = (function (){
+var self__ = this;
+var _ = this;
+if((self__.step > (0))){
+return (self__.i < self__.end);
+} else {
+return (self__.i > self__.end);
+}
+});
+
+cljs.core.RangeIterator.prototype.next = (function (){
+var self__ = this;
+var _ = this;
+var ret = self__.i;
+self__.i = (self__.i + self__.step);
+
+return ret;
+});
+
+cljs.core.RangeIterator.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$end,cljs.core.cst$sym$step], null);
+});
+
+cljs.core.RangeIterator.cljs$lang$type = true;
+
+cljs.core.RangeIterator.cljs$lang$ctorStr = "cljs.core/RangeIterator";
+
+cljs.core.RangeIterator.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/RangeIterator");
+});
+
+/**
+ * Positional factory function for cljs.core/RangeIterator.
+ */
+cljs.core.__GT_RangeIterator = (function cljs$core$__GT_RangeIterator(i,end,step){
+return (new cljs.core.RangeIterator(i,end,step));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IIndexed}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.IEmptyableCollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeq}
+ * @implements {cljs.core.INext}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.Range = (function (meta,start,end,step,__hash){
+this.meta = meta;
+this.start = start;
+this.end = end;
+this.step = step;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 32375006;
+this.cljs$lang$protocol_mask$partition1$ = 139264;
+});
+cljs.core.Range.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.Range.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.Range.prototype.indexOf = (function() {
+var G__2799 = null;
+var G__2799__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
+});
+var G__2799__2 = (function (x,start__$1){
+var self__ = this;
+var coll = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
+});
+G__2799 = function(x,start__$1){
+switch(arguments.length){
+case 1:
+return G__2799__1.call(this,x);
+case 2:
+return G__2799__2.call(this,x,start__$1);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2799.cljs$core$IFn$_invoke$arity$1 = G__2799__1;
+G__2799.cljs$core$IFn$_invoke$arity$2 = G__2799__2;
+return G__2799;
+})()
+;
+
+cljs.core.Range.prototype.lastIndexOf = (function() {
+var G__2800 = null;
+var G__2800__1 = (function (x){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
+});
+var G__2800__2 = (function (x,start__$1){
+var self__ = this;
+var coll = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
+});
+G__2800 = function(x,start__$1){
+switch(arguments.length){
+case 1:
+return G__2800__1.call(this,x);
+case 2:
+return G__2800__2.call(this,x,start__$1);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2800.cljs$core$IFn$_invoke$arity$1 = G__2800__1;
+G__2800.cljs$core$IFn$_invoke$arity$2 = G__2800__2;
+return G__2800;
+})()
+;
+
+cljs.core.Range.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (rng,n){
+var self__ = this;
+var rng__$1 = this;
+if(((((0) <= n)) && ((n < rng__$1.cljs$core$ICounted$_count$arity$1(null))))){
+return (self__.start + (n * self__.step));
+} else {
+if(((((0) <= n)) && ((self__.start > self__.end)) && ((self__.step === (0))))){
+return self__.start;
+} else {
+throw (new Error("Index out of bounds"));
+}
+}
+});
+
+cljs.core.Range.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (rng,n,not_found){
+var self__ = this;
+var rng__$1 = this;
+if(((((0) <= n)) && ((n < rng__$1.cljs$core$ICounted$_count$arity$1(null))))){
+return (self__.start + (n * self__.step));
+} else {
+if(((((0) <= n)) && ((self__.start > self__.end)) && ((self__.step === (0))))){
+return self__.start;
+} else {
+return not_found;
+}
+}
+});
+
+cljs.core.Range.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.RangeIterator(self__.start,self__.end,self__.step));
+});
+
+cljs.core.Range.prototype.cljs$core$IMeta$_meta$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+return self__.meta;
+});
+
+cljs.core.Range.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return (new cljs.core.Range(self__.meta,self__.start,self__.end,self__.step,self__.__hash));
+});
+
+cljs.core.Range.prototype.cljs$core$INext$_next$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+if((self__.step > (0))){
+if(((self__.start + self__.step) < self__.end)){
+return (new cljs.core.Range(self__.meta,(self__.start + self__.step),self__.end,self__.step,null));
+} else {
+return null;
+}
+} else {
+if(((self__.start + self__.step) > self__.end)){
+return (new cljs.core.Range(self__.meta,(self__.start + self__.step),self__.end,self__.step,null));
+} else {
+return null;
+}
+}
+});
+
+cljs.core.Range.prototype.cljs$core$ICounted$_count$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+if(cljs.core.not(rng__$1.cljs$core$ISeqable$_seq$arity$1(null))){
+return (0);
+} else {
+var G__2798 = ((self__.end - self__.start) / self__.step);
+return Math.ceil(G__2798);
+}
+});
+
+cljs.core.Range.prototype.cljs$core$IHash$_hash$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = cljs.core.hash_ordered_coll(rng__$1);
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.core.Range.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (rng,other){
+var self__ = this;
+var rng__$1 = this;
+return cljs.core.equiv_sequential(rng__$1,other);
+});
+
+cljs.core.Range.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
+});
+
+cljs.core.Range.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (rng,f){
+var self__ = this;
+var rng__$1 = this;
+return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(rng__$1,f);
+});
+
+cljs.core.Range.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (rng,f,init){
+var self__ = this;
+var rng__$1 = this;
+var i = self__.start;
+var ret = init;
+while(true){
+if((((self__.step > (0)))?(i < self__.end):(i > self__.end))){
+var ret__$1 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,i) : f.call(null,ret,i));
+if(cljs.core.reduced_QMARK_(ret__$1)){
+return cljs.core.deref(ret__$1);
+} else {
+var G__2801 = (i + self__.step);
+var G__2802 = ret__$1;
+i = G__2801;
+ret = G__2802;
+continue;
+}
+} else {
+return ret;
+}
+break;
+}
+});
+
+cljs.core.Range.prototype.cljs$core$ISeq$_first$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+if((rng__$1.cljs$core$ISeqable$_seq$arity$1(null) == null)){
+return null;
+} else {
+return self__.start;
+}
+});
+
+cljs.core.Range.prototype.cljs$core$ISeq$_rest$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+if(!((rng__$1.cljs$core$ISeqable$_seq$arity$1(null) == null))){
+return (new cljs.core.Range(self__.meta,(self__.start + self__.step),self__.end,self__.step,null));
+} else {
+return cljs.core.List.EMPTY;
+}
+});
+
+cljs.core.Range.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (rng){
+var self__ = this;
+var rng__$1 = this;
+if((self__.step > (0))){
+if((self__.start < self__.end)){
+return rng__$1;
+} else {
+return null;
+}
+} else {
+if((self__.step < (0))){
+if((self__.start > self__.end)){
+return rng__$1;
+} else {
+return null;
+}
+} else {
+if((self__.start === self__.end)){
+return null;
+} else {
+return rng__$1;
+}
+
+}
+}
+});
+
+cljs.core.Range.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (rng,meta__$1){
+var self__ = this;
+var rng__$1 = this;
+return (new cljs.core.Range(meta__$1,self__.start,self__.end,self__.step,self__.__hash));
+});
+
+cljs.core.Range.prototype.cljs$core$ICollection$_conj$arity$2 = (function (rng,o){
+var self__ = this;
+var rng__$1 = this;
+return cljs.core.cons(o,rng__$1);
+});
+
+cljs.core.Range.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$start,cljs.core.cst$sym$end,cljs.core.cst$sym$step,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Range.cljs$lang$type = true;
+
+cljs.core.Range.cljs$lang$ctorStr = "cljs.core/Range";
+
+cljs.core.Range.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Range");
+});
+
+/**
+ * Positional factory function for cljs.core/Range.
+ */
+cljs.core.__GT_Range = (function cljs$core$__GT_Range(meta,start,end,step,__hash){
+return (new cljs.core.Range(meta,start,end,step,__hash));
+});
+
+var G__2803_2806 = cljs.core.Range.prototype;
+var G__2804_2807 = cljs.core.ITER_SYMBOL;
+var G__2805_2808 = ((function (G__2803_2806,G__2804_2807){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__2803_2806,G__2804_2807))
+;
+goog.object.set(G__2803_2806,G__2804_2807,G__2805_2808);
+/**
+ * Returns a lazy seq of nums from start (inclusive) to end
+ * (exclusive), by step, where start defaults to 0, step to 1,
+ * and end to infinity.
+ */
+cljs.core.range = (function cljs$core$range(var_args){
+var G__2810 = arguments.length;
+switch (G__2810) {
+case 0:
+return cljs.core.range.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.range.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.range.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.range.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.range.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.range.cljs$core$IFn$_invoke$arity$3((0),Number.MAX_VALUE,(1));
+});
+
+cljs.core.range.cljs$core$IFn$_invoke$arity$1 = (function (end){
+return cljs.core.range.cljs$core$IFn$_invoke$arity$3((0),end,(1));
+});
+
+cljs.core.range.cljs$core$IFn$_invoke$arity$2 = (function (start,end){
+return cljs.core.range.cljs$core$IFn$_invoke$arity$3(start,end,(1));
+});
+
+cljs.core.range.cljs$core$IFn$_invoke$arity$3 = (function (start,end,step){
+return (new cljs.core.Range(null,start,end,step,null));
+});
+
+cljs.core.range.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Returns a lazy seq of every nth item in coll.  Returns a stateful
+ *   transducer when no collection is provided.
+ */
+cljs.core.take_nth = (function cljs$core$take_nth(var_args){
+var G__2813 = arguments.length;
+switch (G__2813) {
+case 1:
+return cljs.core.take_nth.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.take_nth.cljs$core$IFn$_invoke$arity$1 = (function (n){
+if(typeof n === 'number'){
+} else {
+throw (new Error("Assert failed: (number? n)"));
+}
+
+return (function (rf){
+var ia = cljs.core.volatile_BANG_((-1));
+return ((function (ia){
+return (function() {
+var G__2815 = null;
+var G__2815__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__2815__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__2815__2 = (function (result,input){
+var i = cljs.core._vreset_BANG_(ia,(cljs.core._deref(ia) + (1)));
+if((cljs.core.rem(i,n) === (0))){
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+} else {
+return result;
+}
+});
+G__2815 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__2815__0.call(this);
+case 1:
+return G__2815__1.call(this,result);
+case 2:
+return G__2815__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2815.cljs$core$IFn$_invoke$arity$0 = G__2815__0;
+G__2815.cljs$core$IFn$_invoke$arity$1 = G__2815__1;
+G__2815.cljs$core$IFn$_invoke$arity$2 = G__2815__2;
+return G__2815;
+})()
+;})(ia))
+});
+});
+
+cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
+if(typeof n === 'number'){
+} else {
+throw (new Error("Assert failed: (number? n)"));
+}
+
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+return cljs.core.cons(cljs.core.first(s),cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2(n,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,s)));
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.take_nth.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a vector of [(take-while pred coll) (drop-while pred coll)]
+ */
+cljs.core.split_with = (function cljs$core$split_with(pred,coll){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(pred,coll),cljs.core.drop_while.cljs$core$IFn$_invoke$arity$2(pred,coll)], null);
+});
+/**
+ * Applies f to each value in coll, splitting it each time f returns a
+ * new value.  Returns a lazy seq of partitions.  Returns a stateful
+ * transducer when no collection is provided.
+ */
+cljs.core.partition_by = (function cljs$core$partition_by(var_args){
+var G__2818 = arguments.length;
+switch (G__2818) {
+case 1:
+return cljs.core.partition_by.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.partition_by.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.partition_by.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return (function (rf){
+var a = cljs.core.array_list();
+var pa = cljs.core.volatile_BANG_(cljs.core.cst$kw$cljs$core_SLASH_none);
+return ((function (a,pa){
+return (function() {
+var G__2820 = null;
+var G__2820__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__2820__1 = (function (result){
+var result__$1 = (cljs.core.truth_(a.isEmpty())?result:(function (){var v = cljs.core.vec(a.toArray());
+a.clear();
+
+return cljs.core.unreduced((rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v)));
+})());
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result__$1) : rf.call(null,result__$1));
+});
+var G__2820__2 = (function (result,input){
+var pval = cljs.core.deref(pa);
+var val = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(input) : f.call(null,input));
+cljs.core.vreset_BANG_(pa,val);
+
+if(((cljs.core.keyword_identical_QMARK_(pval,cljs.core.cst$kw$cljs$core_SLASH_none)) || (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(val,pval)))){
+a.add(input);
+
+return result;
+} else {
+var v = cljs.core.vec(a.toArray());
+a.clear();
+
+var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
+if(cljs.core.reduced_QMARK_(ret)){
+} else {
+a.add(input);
+}
+
+return ret;
+}
+});
+G__2820 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__2820__0.call(this);
+case 1:
+return G__2820__1.call(this,result);
+case 2:
+return G__2820__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2820.cljs$core$IFn$_invoke$arity$0 = G__2820__0;
+G__2820.cljs$core$IFn$_invoke$arity$1 = G__2820__1;
+G__2820.cljs$core$IFn$_invoke$arity$2 = G__2820__2;
+return G__2820;
+})()
+;})(a,pa))
+});
+});
+
+cljs.core.partition_by.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+var fst = cljs.core.first(s);
+var fv = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(fst) : f.call(null,fst));
+var run = cljs.core.cons(fst,cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(((function (fst,fv,s,temp__5457__auto__){
+return (function (p1__2816_SHARP_){
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(fv,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(p1__2816_SHARP_) : f.call(null,p1__2816_SHARP_)));
+});})(fst,fv,s,temp__5457__auto__))
+,cljs.core.next(s)));
+return cljs.core.cons(run,cljs.core.partition_by.cljs$core$IFn$_invoke$arity$2(f,cljs.core.seq(cljs.core.drop.cljs$core$IFn$_invoke$arity$2(cljs.core.count(run),s))));
+} else {
+return null;
+}
+}),null,null));
+});
+
+cljs.core.partition_by.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a map from distinct items in coll to the number of times
+ *   they appear.
+ */
+cljs.core.frequencies = (function cljs$core$frequencies(coll){
+return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (counts,x){
+return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(counts,x,(cljs.core.get.cljs$core$IFn$_invoke$arity$3(counts,x,(0)) + (1)));
+}),cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY),coll));
+});
+/**
+ * Returns a lazy seq of the intermediate values of the reduction (as
+ *   per reduce) of coll by f, starting with init.
+ */
+cljs.core.reductions = (function cljs$core$reductions(var_args){
+var G__2822 = arguments.length;
+switch (G__2822) {
+case 2:
+return cljs.core.reductions.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.reductions.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.reductions.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
+return (new cljs.core.LazySeq(null,(function (){
+var temp__5455__auto__ = cljs.core.seq(coll);
+if(temp__5455__auto__){
+var s = temp__5455__auto__;
+return cljs.core.reductions.cljs$core$IFn$_invoke$arity$3(f,cljs.core.first(s),cljs.core.rest(s));
+} else {
+return (new cljs.core.List(null,(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),null,(1),null));
+}
+}),null,null));
+});
+
+cljs.core.reductions.cljs$core$IFn$_invoke$arity$3 = (function (f,init,coll){
+if(cljs.core.reduced_QMARK_(init)){
+return (new cljs.core.List(null,cljs.core.deref(init),null,(1),null));
+} else {
+return cljs.core.cons(init,(new cljs.core.LazySeq(null,(function (){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+return cljs.core.reductions.cljs$core$IFn$_invoke$arity$3(f,(function (){var G__2823 = init;
+var G__2824 = cljs.core.first(s);
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2823,G__2824) : f.call(null,G__2823,G__2824));
+})(),cljs.core.rest(s));
+} else {
+return null;
+}
+}),null,null)));
+}
+});
+
+cljs.core.reductions.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Takes a set of functions and returns a fn that is the juxtaposition
+ *   of those fns.  The returned fn takes a variable number of args, and
+ *   returns a vector containing the result of applying each fn to the
+ *   args (left-to-right).
+ *   ((juxt a b c) x) => [(a x) (b x) (c x)]
+ */
+cljs.core.juxt = (function cljs$core$juxt(var_args){
+var G__2841 = arguments.length;
+switch (G__2841) {
+case 1:
+return cljs.core.juxt.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.juxt.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.juxt.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___2843 = arguments.length;
+var i__4519__auto___2844 = (0);
+while(true){
+if((i__4519__auto___2844 < len__4518__auto___2843)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___2844]));
+
+var G__2845 = (i__4519__auto___2844 + (1));
+i__4519__auto___2844 = G__2845;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return cljs.core.juxt.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.juxt.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return (function() {
+var G__2846 = null;
+var G__2846__0 = (function (){
+return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null))],null));
+});
+var G__2846__1 = (function (x){
+return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x))],null));
+});
+var G__2846__2 = (function (x,y){
+return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y))],null));
+});
+var G__2846__3 = (function (x,y,z){
+return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(x,y,z) : f.call(null,x,y,z))],null));
+});
+var G__2846__4 = (function() { 
+var G__2847__delegate = function (x,y,z,args){
+return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,x,y,z,args)],null));
+};
+var G__2847 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__2848__i = 0, G__2848__a = new Array(arguments.length -  3);
+while (G__2848__i < G__2848__a.length) {G__2848__a[G__2848__i] = arguments[G__2848__i + 3]; ++G__2848__i;}
+  args = new cljs.core.IndexedSeq(G__2848__a,0,null);
+} 
+return G__2847__delegate.call(this,x,y,z,args);};
+G__2847.cljs$lang$maxFixedArity = 3;
+G__2847.cljs$lang$applyTo = (function (arglist__2849){
+var x = cljs.core.first(arglist__2849);
+arglist__2849 = cljs.core.next(arglist__2849);
+var y = cljs.core.first(arglist__2849);
+arglist__2849 = cljs.core.next(arglist__2849);
+var z = cljs.core.first(arglist__2849);
+var args = cljs.core.rest(arglist__2849);
+return G__2847__delegate(x,y,z,args);
+});
+G__2847.cljs$core$IFn$_invoke$arity$variadic = G__2847__delegate;
+return G__2847;
+})()
+;
+G__2846 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__2846__0.call(this);
+case 1:
+return G__2846__1.call(this,x);
+case 2:
+return G__2846__2.call(this,x,y);
+case 3:
+return G__2846__3.call(this,x,y,z);
+default:
+var G__2850 = null;
+if (arguments.length > 3) {
+var G__2851__i = 0, G__2851__a = new Array(arguments.length -  3);
+while (G__2851__i < G__2851__a.length) {G__2851__a[G__2851__i] = arguments[G__2851__i + 3]; ++G__2851__i;}
+G__2850 = new cljs.core.IndexedSeq(G__2851__a,0,null);
+}
+return G__2846__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2850);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2846.cljs$lang$maxFixedArity = 3;
+G__2846.cljs$lang$applyTo = G__2846__4.cljs$lang$applyTo;
+G__2846.cljs$core$IFn$_invoke$arity$0 = G__2846__0;
+G__2846.cljs$core$IFn$_invoke$arity$1 = G__2846__1;
+G__2846.cljs$core$IFn$_invoke$arity$2 = G__2846__2;
+G__2846.cljs$core$IFn$_invoke$arity$3 = G__2846__3;
+G__2846.cljs$core$IFn$_invoke$arity$variadic = G__2846__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__2846;
+})()
+});
+
+cljs.core.juxt.cljs$core$IFn$_invoke$arity$2 = (function (f,g){
+return (function() {
+var G__2852 = null;
+var G__2852__0 = (function (){
+return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),(g.cljs$core$IFn$_invoke$arity$0 ? g.cljs$core$IFn$_invoke$arity$0() : g.call(null))],null));
+});
+var G__2852__1 = (function (x){
+return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x)),(g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(x) : g.call(null,x))],null));
+});
+var G__2852__2 = (function (x,y){
+return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y)),(g.cljs$core$IFn$_invoke$arity$2 ? g.cljs$core$IFn$_invoke$arity$2(x,y) : g.call(null,x,y))],null));
+});
+var G__2852__3 = (function (x,y,z){
+return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(x,y,z) : f.call(null,x,y,z)),(g.cljs$core$IFn$_invoke$arity$3 ? g.cljs$core$IFn$_invoke$arity$3(x,y,z) : g.call(null,x,y,z))],null));
+});
+var G__2852__4 = (function() { 
+var G__2853__delegate = function (x,y,z,args){
+return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,x,y,z,args),cljs.core.apply.cljs$core$IFn$_invoke$arity$5(g,x,y,z,args)],null));
+};
+var G__2853 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__2854__i = 0, G__2854__a = new Array(arguments.length -  3);
+while (G__2854__i < G__2854__a.length) {G__2854__a[G__2854__i] = arguments[G__2854__i + 3]; ++G__2854__i;}
+  args = new cljs.core.IndexedSeq(G__2854__a,0,null);
+} 
+return G__2853__delegate.call(this,x,y,z,args);};
+G__2853.cljs$lang$maxFixedArity = 3;
+G__2853.cljs$lang$applyTo = (function (arglist__2855){
+var x = cljs.core.first(arglist__2855);
+arglist__2855 = cljs.core.next(arglist__2855);
+var y = cljs.core.first(arglist__2855);
+arglist__2855 = cljs.core.next(arglist__2855);
+var z = cljs.core.first(arglist__2855);
+var args = cljs.core.rest(arglist__2855);
+return G__2853__delegate(x,y,z,args);
+});
+G__2853.cljs$core$IFn$_invoke$arity$variadic = G__2853__delegate;
+return G__2853;
+})()
+;
+G__2852 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__2852__0.call(this);
+case 1:
+return G__2852__1.call(this,x);
+case 2:
+return G__2852__2.call(this,x,y);
+case 3:
+return G__2852__3.call(this,x,y,z);
+default:
+var G__2856 = null;
+if (arguments.length > 3) {
+var G__2857__i = 0, G__2857__a = new Array(arguments.length -  3);
+while (G__2857__i < G__2857__a.length) {G__2857__a[G__2857__i] = arguments[G__2857__i + 3]; ++G__2857__i;}
+G__2856 = new cljs.core.IndexedSeq(G__2857__a,0,null);
+}
+return G__2852__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2856);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2852.cljs$lang$maxFixedArity = 3;
+G__2852.cljs$lang$applyTo = G__2852__4.cljs$lang$applyTo;
+G__2852.cljs$core$IFn$_invoke$arity$0 = G__2852__0;
+G__2852.cljs$core$IFn$_invoke$arity$1 = G__2852__1;
+G__2852.cljs$core$IFn$_invoke$arity$2 = G__2852__2;
+G__2852.cljs$core$IFn$_invoke$arity$3 = G__2852__3;
+G__2852.cljs$core$IFn$_invoke$arity$variadic = G__2852__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__2852;
+})()
+});
+
+cljs.core.juxt.cljs$core$IFn$_invoke$arity$3 = (function (f,g,h){
+return (function() {
+var G__2858 = null;
+var G__2858__0 = (function (){
+return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),(g.cljs$core$IFn$_invoke$arity$0 ? g.cljs$core$IFn$_invoke$arity$0() : g.call(null)),(h.cljs$core$IFn$_invoke$arity$0 ? h.cljs$core$IFn$_invoke$arity$0() : h.call(null))],null));
+});
+var G__2858__1 = (function (x){
+return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x)),(g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(x) : g.call(null,x)),(h.cljs$core$IFn$_invoke$arity$1 ? h.cljs$core$IFn$_invoke$arity$1(x) : h.call(null,x))],null));
+});
+var G__2858__2 = (function (x,y){
+return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y)),(g.cljs$core$IFn$_invoke$arity$2 ? g.cljs$core$IFn$_invoke$arity$2(x,y) : g.call(null,x,y)),(h.cljs$core$IFn$_invoke$arity$2 ? h.cljs$core$IFn$_invoke$arity$2(x,y) : h.call(null,x,y))],null));
+});
+var G__2858__3 = (function (x,y,z){
+return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(x,y,z) : f.call(null,x,y,z)),(g.cljs$core$IFn$_invoke$arity$3 ? g.cljs$core$IFn$_invoke$arity$3(x,y,z) : g.call(null,x,y,z)),(h.cljs$core$IFn$_invoke$arity$3 ? h.cljs$core$IFn$_invoke$arity$3(x,y,z) : h.call(null,x,y,z))],null));
+});
+var G__2858__4 = (function() { 
+var G__2859__delegate = function (x,y,z,args){
+return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,x,y,z,args),cljs.core.apply.cljs$core$IFn$_invoke$arity$5(g,x,y,z,args),cljs.core.apply.cljs$core$IFn$_invoke$arity$5(h,x,y,z,args)],null));
+};
+var G__2859 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__2860__i = 0, G__2860__a = new Array(arguments.length -  3);
+while (G__2860__i < G__2860__a.length) {G__2860__a[G__2860__i] = arguments[G__2860__i + 3]; ++G__2860__i;}
+  args = new cljs.core.IndexedSeq(G__2860__a,0,null);
+} 
+return G__2859__delegate.call(this,x,y,z,args);};
+G__2859.cljs$lang$maxFixedArity = 3;
+G__2859.cljs$lang$applyTo = (function (arglist__2861){
+var x = cljs.core.first(arglist__2861);
+arglist__2861 = cljs.core.next(arglist__2861);
+var y = cljs.core.first(arglist__2861);
+arglist__2861 = cljs.core.next(arglist__2861);
+var z = cljs.core.first(arglist__2861);
+var args = cljs.core.rest(arglist__2861);
+return G__2859__delegate(x,y,z,args);
+});
+G__2859.cljs$core$IFn$_invoke$arity$variadic = G__2859__delegate;
+return G__2859;
+})()
+;
+G__2858 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__2858__0.call(this);
+case 1:
+return G__2858__1.call(this,x);
+case 2:
+return G__2858__2.call(this,x,y);
+case 3:
+return G__2858__3.call(this,x,y,z);
+default:
+var G__2862 = null;
+if (arguments.length > 3) {
+var G__2863__i = 0, G__2863__a = new Array(arguments.length -  3);
+while (G__2863__i < G__2863__a.length) {G__2863__a[G__2863__i] = arguments[G__2863__i + 3]; ++G__2863__i;}
+G__2862 = new cljs.core.IndexedSeq(G__2863__a,0,null);
+}
+return G__2858__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2862);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2858.cljs$lang$maxFixedArity = 3;
+G__2858.cljs$lang$applyTo = G__2858__4.cljs$lang$applyTo;
+G__2858.cljs$core$IFn$_invoke$arity$0 = G__2858__0;
+G__2858.cljs$core$IFn$_invoke$arity$1 = G__2858__1;
+G__2858.cljs$core$IFn$_invoke$arity$2 = G__2858__2;
+G__2858.cljs$core$IFn$_invoke$arity$3 = G__2858__3;
+G__2858.cljs$core$IFn$_invoke$arity$variadic = G__2858__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__2858;
+})()
+});
+
+cljs.core.juxt.cljs$core$IFn$_invoke$arity$variadic = (function (f,g,h,fs){
+var fs__$1 = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(f,g,h,fs);
+return ((function (fs__$1){
+return (function() {
+var G__2864 = null;
+var G__2864__0 = (function (){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
+return (function (p1__2826_SHARP_,p2__2827_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2826_SHARP_,(p2__2827_SHARP_.cljs$core$IFn$_invoke$arity$0 ? p2__2827_SHARP_.cljs$core$IFn$_invoke$arity$0() : p2__2827_SHARP_.call(null)));
+});})(fs__$1))
+,cljs.core.PersistentVector.EMPTY,fs__$1);
+});
+var G__2864__1 = (function (x){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
+return (function (p1__2828_SHARP_,p2__2829_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2828_SHARP_,(p2__2829_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p2__2829_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p2__2829_SHARP_.call(null,x)));
+});})(fs__$1))
+,cljs.core.PersistentVector.EMPTY,fs__$1);
+});
+var G__2864__2 = (function (x,y){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
+return (function (p1__2830_SHARP_,p2__2831_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2830_SHARP_,(p2__2831_SHARP_.cljs$core$IFn$_invoke$arity$2 ? p2__2831_SHARP_.cljs$core$IFn$_invoke$arity$2(x,y) : p2__2831_SHARP_.call(null,x,y)));
+});})(fs__$1))
+,cljs.core.PersistentVector.EMPTY,fs__$1);
+});
+var G__2864__3 = (function (x,y,z){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
+return (function (p1__2832_SHARP_,p2__2833_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2832_SHARP_,(p2__2833_SHARP_.cljs$core$IFn$_invoke$arity$3 ? p2__2833_SHARP_.cljs$core$IFn$_invoke$arity$3(x,y,z) : p2__2833_SHARP_.call(null,x,y,z)));
+});})(fs__$1))
+,cljs.core.PersistentVector.EMPTY,fs__$1);
+});
+var G__2864__4 = (function() { 
+var G__2865__delegate = function (x,y,z,args){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
+return (function (p1__2834_SHARP_,p2__2835_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2834_SHARP_,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(p2__2835_SHARP_,x,y,z,args));
+});})(fs__$1))
+,cljs.core.PersistentVector.EMPTY,fs__$1);
+};
+var G__2865 = function (x,y,z,var_args){
+var args = null;
+if (arguments.length > 3) {
+var G__2866__i = 0, G__2866__a = new Array(arguments.length -  3);
+while (G__2866__i < G__2866__a.length) {G__2866__a[G__2866__i] = arguments[G__2866__i + 3]; ++G__2866__i;}
+  args = new cljs.core.IndexedSeq(G__2866__a,0,null);
+} 
+return G__2865__delegate.call(this,x,y,z,args);};
+G__2865.cljs$lang$maxFixedArity = 3;
+G__2865.cljs$lang$applyTo = (function (arglist__2867){
+var x = cljs.core.first(arglist__2867);
+arglist__2867 = cljs.core.next(arglist__2867);
+var y = cljs.core.first(arglist__2867);
+arglist__2867 = cljs.core.next(arglist__2867);
+var z = cljs.core.first(arglist__2867);
+var args = cljs.core.rest(arglist__2867);
+return G__2865__delegate(x,y,z,args);
+});
+G__2865.cljs$core$IFn$_invoke$arity$variadic = G__2865__delegate;
+return G__2865;
+})()
+;
+G__2864 = function(x,y,z,var_args){
+var args = var_args;
+switch(arguments.length){
+case 0:
+return G__2864__0.call(this);
+case 1:
+return G__2864__1.call(this,x);
+case 2:
+return G__2864__2.call(this,x,y);
+case 3:
+return G__2864__3.call(this,x,y,z);
+default:
+var G__2868 = null;
+if (arguments.length > 3) {
+var G__2869__i = 0, G__2869__a = new Array(arguments.length -  3);
+while (G__2869__i < G__2869__a.length) {G__2869__a[G__2869__i] = arguments[G__2869__i + 3]; ++G__2869__i;}
+G__2868 = new cljs.core.IndexedSeq(G__2869__a,0,null);
+}
+return G__2864__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2868);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__2864.cljs$lang$maxFixedArity = 3;
+G__2864.cljs$lang$applyTo = G__2864__4.cljs$lang$applyTo;
+G__2864.cljs$core$IFn$_invoke$arity$0 = G__2864__0;
+G__2864.cljs$core$IFn$_invoke$arity$1 = G__2864__1;
+G__2864.cljs$core$IFn$_invoke$arity$2 = G__2864__2;
+G__2864.cljs$core$IFn$_invoke$arity$3 = G__2864__3;
+G__2864.cljs$core$IFn$_invoke$arity$variadic = G__2864__4.cljs$core$IFn$_invoke$arity$variadic;
+return G__2864;
+})()
+;})(fs__$1))
+});
+
+/** @this {Function} */
+cljs.core.juxt.cljs$lang$applyTo = (function (seq2837){
+var G__2838 = cljs.core.first(seq2837);
+var seq2837__$1 = cljs.core.next(seq2837);
+var G__2839 = cljs.core.first(seq2837__$1);
+var seq2837__$2 = cljs.core.next(seq2837__$1);
+var G__2840 = cljs.core.first(seq2837__$2);
+var seq2837__$3 = cljs.core.next(seq2837__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2838,G__2839,G__2840,seq2837__$3);
+});
+
+cljs.core.juxt.cljs$lang$maxFixedArity = (3);
+
+/**
+ * When lazy sequences are produced via functions that have side
+ *   effects, any effects other than those needed to produce the first
+ *   element in the seq do not occur until the seq is consumed. dorun can
+ *   be used to force any effects. Walks through the successive nexts of
+ *   the seq, does not retain the head and returns nil.
+ */
+cljs.core.dorun = (function cljs$core$dorun(var_args){
+var G__2871 = arguments.length;
+switch (G__2871) {
+case 1:
+return cljs.core.dorun.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.dorun.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.dorun.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+while(true){
+var temp__5457__auto__ = cljs.core.seq(coll);
+if(temp__5457__auto__){
+var s = temp__5457__auto__;
+var G__2873 = cljs.core.next(s);
+coll = G__2873;
+continue;
+} else {
+return null;
+}
+break;
+}
+});
+
+cljs.core.dorun.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
+while(true){
+if(((cljs.core.seq(coll)) && ((n > (0))))){
+var G__2874 = (n - (1));
+var G__2875 = cljs.core.next(coll);
+n = G__2874;
+coll = G__2875;
+continue;
+} else {
+return null;
+}
+break;
+}
+});
+
+cljs.core.dorun.cljs$lang$maxFixedArity = 2;
+
+/**
+ * When lazy sequences are produced via functions that have side
+ *   effects, any effects other than those needed to produce the first
+ *   element in the seq do not occur until the seq is consumed. doall can
+ *   be used to force any effects. Walks through the successive nexts of
+ *   the seq, retains the head and returns it, thus causing the entire
+ *   seq to reside in memory at one time.
+ */
+cljs.core.doall = (function cljs$core$doall(var_args){
+var G__2877 = arguments.length;
+switch (G__2877) {
+case 1:
+return cljs.core.doall.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.doall.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.doall.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+cljs.core.dorun.cljs$core$IFn$_invoke$arity$1(coll);
+
+return coll;
+});
+
+cljs.core.doall.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
+cljs.core.dorun.cljs$core$IFn$_invoke$arity$2(n,coll);
+
+return coll;
+});
+
+cljs.core.doall.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns true if x is a JavaScript RegExp instance.
+ */
+cljs.core.regexp_QMARK_ = (function cljs$core$regexp_QMARK_(x){
+return (x instanceof RegExp);
+});
+/**
+ * Returns the result of (re-find re s) if re fully matches s.
+ */
+cljs.core.re_matches = (function cljs$core$re_matches(re,s){
+if(typeof s === 'string'){
+var matches = re.exec(s);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.first(matches),s)){
+if((cljs.core.count(matches) === (1))){
+return cljs.core.first(matches);
+} else {
+return cljs.core.vec(matches);
+}
+} else {
+return null;
+}
+} else {
+throw (new TypeError("re-matches must match against a string."));
+}
+});
+/**
+ * Returns the first regex match, if any, of s to re, using
+ *   re.exec(s). Returns a vector, containing first the matching
+ *   substring, then any capturing groups if the regular expression contains
+ *   capturing groups.
+ */
+cljs.core.re_find = (function cljs$core$re_find(re,s){
+if(typeof s === 'string'){
+var matches = re.exec(s);
+if((matches == null)){
+return null;
+} else {
+if((cljs.core.count(matches) === (1))){
+return cljs.core.first(matches);
+} else {
+return cljs.core.vec(matches);
+}
+}
+} else {
+throw (new TypeError("re-find must match against a string."));
+}
+});
+/**
+ * Returns a lazy sequence of successive matches of re in s.
+ */
+cljs.core.re_seq = (function cljs$core$re_seq(re,s){
+var match_data = cljs.core.re_find(re,s);
+var match_idx = s.search(re);
+var match_str = ((cljs.core.coll_QMARK_(match_data))?cljs.core.first(match_data):match_data);
+var post_idx = (match_idx + (function (){var x__4024__auto__ = (1);
+var y__4025__auto__ = cljs.core.count(match_str);
+return ((x__4024__auto__ > y__4025__auto__) ? x__4024__auto__ : y__4025__auto__);
+})());
+var post_match = cljs.core.subs.cljs$core$IFn$_invoke$arity$2(s,post_idx);
+if(cljs.core.truth_(match_data)){
+return (new cljs.core.LazySeq(null,((function (match_data,match_idx,match_str,post_idx,post_match){
+return (function (){
+return cljs.core.cons(match_data,(((post_idx <= cljs.core.count(s)))?(cljs.core.re_seq.cljs$core$IFn$_invoke$arity$2 ? cljs.core.re_seq.cljs$core$IFn$_invoke$arity$2(re,post_match) : cljs.core.re_seq.call(null,re,post_match)):null));
+});})(match_data,match_idx,match_str,post_idx,post_match))
+,null,null));
+} else {
+return null;
+}
+});
+/**
+ * Returns an instance of RegExp which has compiled the provided string.
+ */
+cljs.core.re_pattern = (function cljs$core$re_pattern(s){
+if((s instanceof RegExp)){
+return s;
+} else {
+var vec__2879 = cljs.core.re_find(/^\(\?([idmsux]*)\)/,s);
+var prefix = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2879,(0),null);
+var flags = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2879,(1),null);
+var pattern = cljs.core.subs.cljs$core$IFn$_invoke$arity$2(s,cljs.core.count(prefix));
+return (new RegExp(pattern,(function (){var or__3936__auto__ = flags;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return "";
+}
+})()));
+}
+});
+cljs.core.pr_sequential_writer = (function cljs$core$pr_sequential_writer(writer,print_one,begin,sep,end,opts,coll){
+var _STAR_print_level_STAR_2882 = cljs.core._STAR_print_level_STAR_;
+cljs.core._STAR_print_level_STAR_ = (((cljs.core._STAR_print_level_STAR_ == null))?null:(cljs.core._STAR_print_level_STAR_ - (1)));
+
+try{if(((!((cljs.core._STAR_print_level_STAR_ == null))) && ((cljs.core._STAR_print_level_STAR_ < (0))))){
+return cljs.core._write(writer,"#");
+} else {
+cljs.core._write(writer,begin);
+
+if((cljs.core.cst$kw$print_DASH_length.cljs$core$IFn$_invoke$arity$1(opts) === (0))){
+if(cljs.core.seq(coll)){
+cljs.core._write(writer,(function (){var or__3936__auto__ = cljs.core.cst$kw$more_DASH_marker.cljs$core$IFn$_invoke$arity$1(opts);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return "...";
+}
+})());
+} else {
+}
+} else {
+if(cljs.core.seq(coll)){
+var G__2883_2889 = cljs.core.first(coll);
+var G__2884_2890 = writer;
+var G__2885_2891 = opts;
+(print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__2883_2889,G__2884_2890,G__2885_2891) : print_one.call(null,G__2883_2889,G__2884_2890,G__2885_2891));
+} else {
+}
+
+var coll_2892__$1 = cljs.core.next(coll);
+var n_2893 = (cljs.core.cst$kw$print_DASH_length.cljs$core$IFn$_invoke$arity$1(opts) - (1));
+while(true){
+if(((coll_2892__$1) && ((((n_2893 == null)) || (!((n_2893 === (0)))))))){
+cljs.core._write(writer,sep);
+
+var G__2886_2894 = cljs.core.first(coll_2892__$1);
+var G__2887_2895 = writer;
+var G__2888_2896 = opts;
+(print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__2886_2894,G__2887_2895,G__2888_2896) : print_one.call(null,G__2886_2894,G__2887_2895,G__2888_2896));
+
+var G__2897 = cljs.core.next(coll_2892__$1);
+var G__2898 = (n_2893 - (1));
+coll_2892__$1 = G__2897;
+n_2893 = G__2898;
+continue;
+} else {
+if(((cljs.core.seq(coll_2892__$1)) && ((n_2893 === (0))))){
+cljs.core._write(writer,sep);
+
+cljs.core._write(writer,(function (){var or__3936__auto__ = cljs.core.cst$kw$more_DASH_marker.cljs$core$IFn$_invoke$arity$1(opts);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return "...";
+}
+})());
+} else {
+}
+}
+break;
+}
+}
+
+return cljs.core._write(writer,end);
+}
+}finally {cljs.core._STAR_print_level_STAR_ = _STAR_print_level_STAR_2882;
+}});
+cljs.core.write_all = (function cljs$core$write_all(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2905 = arguments.length;
+var i__4519__auto___2906 = (0);
+while(true){
+if((i__4519__auto___2906 < len__4518__auto___2905)){
+args__4521__auto__.push((arguments[i__4519__auto___2906]));
+
+var G__2907 = (i__4519__auto___2906 + (1));
+i__4519__auto___2906 = G__2907;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic = (function (writer,ss){
+var seq__2901 = cljs.core.seq(ss);
+var chunk__2902 = null;
+var count__2903 = (0);
+var i__2904 = (0);
+while(true){
+if((i__2904 < count__2903)){
+var s = chunk__2902.cljs$core$IIndexed$_nth$arity$2(null,i__2904);
+cljs.core._write(writer,s);
+
+
+var G__2908 = seq__2901;
+var G__2909 = chunk__2902;
+var G__2910 = count__2903;
+var G__2911 = (i__2904 + (1));
+seq__2901 = G__2908;
+chunk__2902 = G__2909;
+count__2903 = G__2910;
+i__2904 = G__2911;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__2901);
+if(temp__5457__auto__){
+var seq__2901__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__2901__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__2901__$1);
+var G__2912 = cljs.core.chunk_rest(seq__2901__$1);
+var G__2913 = c__4338__auto__;
+var G__2914 = cljs.core.count(c__4338__auto__);
+var G__2915 = (0);
+seq__2901 = G__2912;
+chunk__2902 = G__2913;
+count__2903 = G__2914;
+i__2904 = G__2915;
+continue;
+} else {
+var s = cljs.core.first(seq__2901__$1);
+cljs.core._write(writer,s);
+
+
+var G__2916 = cljs.core.next(seq__2901__$1);
+var G__2917 = null;
+var G__2918 = (0);
+var G__2919 = (0);
+seq__2901 = G__2916;
+chunk__2902 = G__2917;
+count__2903 = G__2918;
+i__2904 = G__2919;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+cljs.core.write_all.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.core.write_all.cljs$lang$applyTo = (function (seq2899){
+var G__2900 = cljs.core.first(seq2899);
+var seq2899__$1 = cljs.core.next(seq2899);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2900,seq2899__$1);
+});
+
+cljs.core.string_print = (function cljs$core$string_print(x){
+if((cljs.core._STAR_print_fn_STAR_ == null)){
+throw (new Error("No *print-fn* fn set for evaluation environment"));
+} else {
+}
+
+(cljs.core._STAR_print_fn_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_print_fn_STAR_.cljs$core$IFn$_invoke$arity$1(x) : cljs.core._STAR_print_fn_STAR_.call(null,x));
+
+return null;
+});
+cljs.core.flush = (function cljs$core$flush(){
+return null;
+});
+cljs.core.char_escapes = (function (){var obj2921 = {"\"":"\\\"","\\":"\\\\","\b":"\\b","\f":"\\f","\n":"\\n","\r":"\\r","\t":"\\t"};
+return obj2921;
+})();
+cljs.core.quote_string = (function cljs$core$quote_string(s){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1("\""),cljs.core.str.cljs$core$IFn$_invoke$arity$1(s.replace(RegExp("[\\\\\"\b\f\n\r\t]","g"),(function (match){
+return (cljs.core.char_escapes[match]);
+}))),cljs.core.str.cljs$core$IFn$_invoke$arity$1("\"")].join('');
+});
+cljs.core.print_meta_QMARK_ = (function cljs$core$print_meta_QMARK_(opts,obj){
+var and__3925__auto__ = cljs.core.boolean$(cljs.core.get.cljs$core$IFn$_invoke$arity$2(opts,cljs.core.cst$kw$meta));
+if(and__3925__auto__){
+var and__3925__auto____$1 = ((!((obj == null)))?(((((obj.cljs$lang$protocol_mask$partition0$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === obj.cljs$core$IMeta$))))?true:false):false);
+if(and__3925__auto____$1){
+return !((cljs.core.meta(obj) == null));
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+});
+cljs.core.pr_writer_impl = (function cljs$core$pr_writer_impl(obj,writer,opts){
+if((obj == null)){
+return cljs.core._write(writer,"nil");
+} else {
+if(cljs.core.print_meta_QMARK_(opts,obj)){
+cljs.core._write(writer,"^");
+
+cljs.core.pr_writer(cljs.core.meta(obj),writer,opts);
+
+cljs.core._write(writer," ");
+} else {
+}
+
+if(obj.cljs$lang$type){
+return obj.cljs$lang$ctorPrWriter(obj,writer,opts);
+} else {
+if(((!((obj == null)))?(((((obj.cljs$lang$protocol_mask$partition0$ & (2147483648))) || ((cljs.core.PROTOCOL_SENTINEL === obj.cljs$core$IPrintWithWriter$))))?true:false):false)){
+return obj.cljs$core$IPrintWithWriter$_pr_writer$arity$3(null,writer,opts);
+} else {
+if(((obj === true) || (obj === false))){
+return cljs.core._write(writer,[cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj)].join(''));
+} else {
+if(typeof obj === 'number'){
+return cljs.core._write(writer,((isNaN(obj))?"##NaN":(((obj === Number.POSITIVE_INFINITY))?"##Inf":(((obj === Number.NEGATIVE_INFINITY))?"##-Inf":[cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj)].join('')
+))));
+} else {
+if(cljs.core.object_QMARK_(obj)){
+cljs.core._write(writer,"#js ");
+
+return cljs.core.print_map(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (k){
+return (new cljs.core.MapEntry((function (){var G__2926 = k;
+if(!((cljs.core.re_matches(/[A-Za-z_\*\+\?!\-'][\w\*\+\?!\-']*/,k) == null))){
+return cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(G__2926);
+} else {
+return G__2926;
+}
+})(),(obj[k]),null));
+}),cljs.core.js_keys(obj)),cljs.core.pr_writer,writer,opts);
+} else {
+if(cljs.core.array_QMARK_(obj)){
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#js ["," ","]",opts,obj);
+} else {
+if(goog.isString(obj)){
+if(cljs.core.truth_(cljs.core.cst$kw$readably.cljs$core$IFn$_invoke$arity$1(opts))){
+return cljs.core._write(writer,cljs.core.quote_string(obj));
+} else {
+return cljs.core._write(writer,obj);
+}
+} else {
+if(goog.isFunction(obj)){
+var name = obj.name;
+var name__$1 = (cljs.core.truth_((function (){var or__3936__auto__ = (name == null);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return goog.string.isEmpty(name);
+}
+})())?"Function":name);
+return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",name__$1,((cljs.core._STAR_print_fn_bodies_STAR_)?[" \"",cljs.core.str.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj)].join('')),"\""].join(''):""),"]"], 0));
+} else {
+if((obj instanceof Date)){
+var normalize = (function (n,len){
+var ns = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)].join('');
+while(true){
+if((cljs.core.count(ns) < len)){
+var G__2929 = ["0",cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns)].join('');
+ns = G__2929;
+continue;
+} else {
+return ns;
+}
+break;
+}
+});
+return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#inst \"",[cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj.getUTCFullYear())].join(''),"-",normalize((obj.getUTCMonth() + (1)),(2)),"-",normalize(obj.getUTCDate(),(2)),"T",normalize(obj.getUTCHours(),(2)),":",normalize(obj.getUTCMinutes(),(2)),":",normalize(obj.getUTCSeconds(),(2)),".",normalize(obj.getUTCMilliseconds(),(3)),"-","00:00\""], 0));
+} else {
+if(cljs.core.regexp_QMARK_(obj)){
+return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#\"",obj.source,"\""], 0));
+} else {
+if(cljs.core.truth_((function (){var G__2927 = obj;
+var G__2927__$1 = (((G__2927 == null))?null:G__2927.constructor);
+if((G__2927__$1 == null)){
+return null;
+} else {
+return G__2927__$1.cljs$lang$ctorStr;
+}
+})())){
+return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",obj.constructor.cljs$lang$ctorStr.replace((new RegExp("/","g")),"."),"]"], 0));
+} else {
+var name = (function (){var G__2928 = obj;
+var G__2928__$1 = (((G__2928 == null))?null:G__2928.constructor);
+if((G__2928__$1 == null)){
+return null;
+} else {
+return G__2928__$1.name;
+}
+})();
+var name__$1 = (cljs.core.truth_((function (){var or__3936__auto__ = (name == null);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return goog.string.isEmpty(name);
+}
+})())?"Object":name);
+if((obj.constructor == null)){
+return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",name__$1,"]"], 0));
+} else {
+return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",name__$1," ",[cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj)].join(''),"]"], 0));
+}
+}
+
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+
+}
+});
+/**
+ * Prefer this to pr-seq, because it makes the printing function
+ * configurable, allowing efficient implementations such as appending
+ * to a StringBuffer.
+ */
+cljs.core.pr_writer = (function cljs$core$pr_writer(obj,writer,opts){
+var temp__5455__auto__ = cljs.core.cst$kw$alt_DASH_impl.cljs$core$IFn$_invoke$arity$1(opts);
+if(cljs.core.truth_(temp__5455__auto__)){
+var alt_impl = temp__5455__auto__;
+var G__2930 = obj;
+var G__2931 = writer;
+var G__2932 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(opts,cljs.core.cst$kw$fallback_DASH_impl,cljs.core.pr_writer_impl);
+return (alt_impl.cljs$core$IFn$_invoke$arity$3 ? alt_impl.cljs$core$IFn$_invoke$arity$3(G__2930,G__2931,G__2932) : alt_impl.call(null,G__2930,G__2931,G__2932));
+} else {
+return cljs.core.pr_writer_impl(obj,writer,opts);
+}
+});
+cljs.core.pr_seq_writer = (function cljs$core$pr_seq_writer(objs,writer,opts){
+cljs.core.pr_writer(cljs.core.first(objs),writer,opts);
+
+var seq__2933 = cljs.core.seq(cljs.core.next(objs));
+var chunk__2934 = null;
+var count__2935 = (0);
+var i__2936 = (0);
+while(true){
+if((i__2936 < count__2935)){
+var obj = chunk__2934.cljs$core$IIndexed$_nth$arity$2(null,i__2936);
+cljs.core._write(writer," ");
+
+cljs.core.pr_writer(obj,writer,opts);
+
+
+var G__2937 = seq__2933;
+var G__2938 = chunk__2934;
+var G__2939 = count__2935;
+var G__2940 = (i__2936 + (1));
+seq__2933 = G__2937;
+chunk__2934 = G__2938;
+count__2935 = G__2939;
+i__2936 = G__2940;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__2933);
+if(temp__5457__auto__){
+var seq__2933__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__2933__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__2933__$1);
+var G__2941 = cljs.core.chunk_rest(seq__2933__$1);
+var G__2942 = c__4338__auto__;
+var G__2943 = cljs.core.count(c__4338__auto__);
+var G__2944 = (0);
+seq__2933 = G__2941;
+chunk__2934 = G__2942;
+count__2935 = G__2943;
+i__2936 = G__2944;
+continue;
+} else {
+var obj = cljs.core.first(seq__2933__$1);
+cljs.core._write(writer," ");
+
+cljs.core.pr_writer(obj,writer,opts);
+
+
+var G__2945 = cljs.core.next(seq__2933__$1);
+var G__2946 = null;
+var G__2947 = (0);
+var G__2948 = (0);
+seq__2933 = G__2945;
+chunk__2934 = G__2946;
+count__2935 = G__2947;
+i__2936 = G__2948;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+cljs.core.pr_sb_with_opts = (function cljs$core$pr_sb_with_opts(objs,opts){
+var sb = (new goog.string.StringBuffer());
+var writer = (new cljs.core.StringBufferWriter(sb));
+cljs.core.pr_seq_writer(objs,writer,opts);
+
+writer.cljs$core$IWriter$_flush$arity$1(null);
+
+return sb;
+});
+/**
+ * Prints a sequence of objects to a string, observing all the
+ *   options given in opts
+ */
+cljs.core.pr_str_with_opts = (function cljs$core$pr_str_with_opts(objs,opts){
+if(cljs.core.empty_QMARK_(objs)){
+return "";
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_sb_with_opts(objs,opts))].join('');
+}
+});
+/**
+ * Same as pr-str-with-opts followed by (newline)
+ */
+cljs.core.prn_str_with_opts = (function cljs$core$prn_str_with_opts(objs,opts){
+if(cljs.core.empty_QMARK_(objs)){
+return "\n";
+} else {
+var sb = cljs.core.pr_sb_with_opts(objs,opts);
+sb.append("\n");
+
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(sb)].join('');
+}
+});
+/**
+ * Prints a sequence of objects using string-print, observing all
+ *   the options given in opts
+ */
+cljs.core.pr_with_opts = (function cljs$core$pr_with_opts(objs,opts){
+return cljs.core.string_print(cljs.core.pr_str_with_opts(objs,opts));
+});
+/**
+ * Prints a newline using *print-fn*
+ */
+cljs.core.newline = (function cljs$core$newline(var_args){
+var G__2950 = arguments.length;
+switch (G__2950) {
+case 0:
+return cljs.core.newline.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.newline.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.newline.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.newline.cljs$core$IFn$_invoke$arity$1(null);
+});
+
+cljs.core.newline.cljs$core$IFn$_invoke$arity$1 = (function (opts){
+cljs.core.string_print("\n");
+
+if(cljs.core.truth_(cljs.core.get.cljs$core$IFn$_invoke$arity$2(opts,cljs.core.cst$kw$flush_DASH_on_DASH_newline))){
+return cljs.core.flush();
+} else {
+return null;
+}
+});
+
+cljs.core.newline.cljs$lang$maxFixedArity = 1;
+
+/**
+ * pr to a string, returning it. Fundamental entrypoint to IPrintWithWriter.
+ */
+cljs.core.pr_str = (function cljs$core$pr_str(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2953 = arguments.length;
+var i__4519__auto___2954 = (0);
+while(true){
+if((i__4519__auto___2954 < len__4518__auto___2953)){
+args__4521__auto__.push((arguments[i__4519__auto___2954]));
+
+var G__2955 = (i__4519__auto___2954 + (1));
+i__4519__auto___2954 = G__2955;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
+return cljs.core.pr_str_with_opts(objs,cljs.core.pr_opts());
+});
+
+cljs.core.pr_str.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.pr_str.cljs$lang$applyTo = (function (seq2952){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2952));
+});
+
+/**
+ * Same as pr-str followed by (newline)
+ */
+cljs.core.prn_str = (function cljs$core$prn_str(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2957 = arguments.length;
+var i__4519__auto___2958 = (0);
+while(true){
+if((i__4519__auto___2958 < len__4518__auto___2957)){
+args__4521__auto__.push((arguments[i__4519__auto___2958]));
+
+var G__2959 = (i__4519__auto___2958 + (1));
+i__4519__auto___2958 = G__2959;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.prn_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.prn_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
+return cljs.core.prn_str_with_opts(objs,cljs.core.pr_opts());
+});
+
+cljs.core.prn_str.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.prn_str.cljs$lang$applyTo = (function (seq2956){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2956));
+});
+
+/**
+ * Prints the object(s) using string-print.  Prints the
+ *   object(s), separated by spaces if there is more than one.
+ *   By default, pr and prn print in a way that objects can be
+ *   read by the reader
+ */
+cljs.core.pr = (function cljs$core$pr(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2961 = arguments.length;
+var i__4519__auto___2962 = (0);
+while(true){
+if((i__4519__auto___2962 < len__4518__auto___2961)){
+args__4521__auto__.push((arguments[i__4519__auto___2962]));
+
+var G__2963 = (i__4519__auto___2962 + (1));
+i__4519__auto___2962 = G__2963;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.pr.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.pr.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
+return cljs.core.pr_with_opts(objs,cljs.core.pr_opts());
+});
+
+cljs.core.pr.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.pr.cljs$lang$applyTo = (function (seq2960){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2960));
+});
+
+/**
+ * Prints the object(s) using string-print.
+ *   print and println produce output for human consumption.
+ * @param {...*} var_args
+ */
+cljs.core.print = (function() { 
+var cljs$core$cljs_core_print__delegate = function (objs){
+return cljs.core.pr_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
+};
+var cljs$core$cljs_core_print = function (var_args){
+var objs = null;
+if (arguments.length > 0) {
+var G__2964__i = 0, G__2964__a = new Array(arguments.length -  0);
+while (G__2964__i < G__2964__a.length) {G__2964__a[G__2964__i] = arguments[G__2964__i + 0]; ++G__2964__i;}
+  objs = new cljs.core.IndexedSeq(G__2964__a,0,null);
+} 
+return cljs$core$cljs_core_print__delegate.call(this,objs);};
+cljs$core$cljs_core_print.cljs$lang$maxFixedArity = 0;
+cljs$core$cljs_core_print.cljs$lang$applyTo = (function (arglist__2965){
+var objs = cljs.core.seq(arglist__2965);
+return cljs$core$cljs_core_print__delegate(objs);
+});
+cljs$core$cljs_core_print.cljs$core$IFn$_invoke$arity$variadic = cljs$core$cljs_core_print__delegate;
+return cljs$core$cljs_core_print;
+})()
+;
+/**
+ * print to a string, returning it
+ */
+cljs.core.print_str = (function cljs$core$print_str(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2967 = arguments.length;
+var i__4519__auto___2968 = (0);
+while(true){
+if((i__4519__auto___2968 < len__4518__auto___2967)){
+args__4521__auto__.push((arguments[i__4519__auto___2968]));
+
+var G__2969 = (i__4519__auto___2968 + (1));
+i__4519__auto___2968 = G__2969;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.print_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.print_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
+return cljs.core.pr_str_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
+});
+
+cljs.core.print_str.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.print_str.cljs$lang$applyTo = (function (seq2966){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2966));
+});
+
+/**
+ * Same as print followed by (newline)
+ */
+cljs.core.println = (function cljs$core$println(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2971 = arguments.length;
+var i__4519__auto___2972 = (0);
+while(true){
+if((i__4519__auto___2972 < len__4518__auto___2971)){
+args__4521__auto__.push((arguments[i__4519__auto___2972]));
+
+var G__2973 = (i__4519__auto___2972 + (1));
+i__4519__auto___2972 = G__2973;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.println.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.println.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
+cljs.core.pr_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
+
+if(cljs.core._STAR_print_newline_STAR_){
+return cljs.core.newline.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_opts());
+} else {
+return null;
+}
+});
+
+cljs.core.println.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.println.cljs$lang$applyTo = (function (seq2970){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2970));
+});
+
+/**
+ * println to a string, returning it
+ */
+cljs.core.println_str = (function cljs$core$println_str(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2975 = arguments.length;
+var i__4519__auto___2976 = (0);
+while(true){
+if((i__4519__auto___2976 < len__4518__auto___2975)){
+args__4521__auto__.push((arguments[i__4519__auto___2976]));
+
+var G__2977 = (i__4519__auto___2976 + (1));
+i__4519__auto___2976 = G__2977;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.println_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.println_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
+return cljs.core.prn_str_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
+});
+
+cljs.core.println_str.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.println_str.cljs$lang$applyTo = (function (seq2974){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2974));
+});
+
+/**
+ * Same as pr followed by (newline).
+ */
+cljs.core.prn = (function cljs$core$prn(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___2979 = arguments.length;
+var i__4519__auto___2980 = (0);
+while(true){
+if((i__4519__auto___2980 < len__4518__auto___2979)){
+args__4521__auto__.push((arguments[i__4519__auto___2980]));
+
+var G__2981 = (i__4519__auto___2980 + (1));
+i__4519__auto___2980 = G__2981;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.prn.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.prn.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
+cljs.core.pr_with_opts(objs,cljs.core.pr_opts());
+
+if(cljs.core._STAR_print_newline_STAR_){
+return cljs.core.newline.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_opts());
+} else {
+return null;
+}
+});
+
+cljs.core.prn.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.prn.cljs$lang$applyTo = (function (seq2978){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2978));
+});
+
+cljs.core.strip_ns = (function cljs$core$strip_ns(named){
+if((named instanceof cljs.core.Symbol)){
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(null,cljs.core.name(named));
+} else {
+return cljs.core.keyword.cljs$core$IFn$_invoke$arity$2(null,cljs.core.name(named));
+}
+});
+/**
+ * Returns [lifted-ns lifted-map] or nil if m can't be lifted.
+ */
+cljs.core.lift_ns = (function cljs$core$lift_ns(m){
+if(cljs.core._STAR_print_namespace_maps_STAR_){
+var ns = null;
+var G__2988 = cljs.core.seq(m);
+var vec__2989 = G__2988;
+var seq__2990 = cljs.core.seq(vec__2989);
+var first__2991 = cljs.core.first(seq__2990);
+var seq__2990__$1 = cljs.core.next(seq__2990);
+var vec__2992 = first__2991;
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2992,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2992,(1),null);
+var entry = vec__2992;
+var entries = seq__2990__$1;
+var lm = cljs.core.empty(m);
+var ns__$1 = ns;
+var G__2988__$1 = G__2988;
+var lm__$1 = lm;
+while(true){
+var ns__$2 = ns__$1;
+var vec__2995 = G__2988__$1;
+var seq__2996 = cljs.core.seq(vec__2995);
+var first__2997 = cljs.core.first(seq__2996);
+var seq__2996__$1 = cljs.core.next(seq__2996);
+var vec__2998 = first__2997;
+var k__$1 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2998,(0),null);
+var v__$1 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2998,(1),null);
+var entry__$1 = vec__2998;
+var entries__$1 = seq__2996__$1;
+var lm__$2 = lm__$1;
+if(cljs.core.truth_(entry__$1)){
+if((((k__$1 instanceof cljs.core.Keyword)) || ((k__$1 instanceof cljs.core.Symbol)))){
+if(cljs.core.truth_(ns__$2)){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(ns__$2,cljs.core.namespace(k__$1))){
+var G__3001 = ns__$2;
+var G__3002 = entries__$1;
+var G__3003 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(lm__$2,cljs.core.strip_ns(k__$1),v__$1);
+ns__$1 = G__3001;
+G__2988__$1 = G__3002;
+lm__$1 = G__3003;
+continue;
+} else {
+return null;
+}
+} else {
+var temp__5457__auto__ = cljs.core.namespace(k__$1);
+if(cljs.core.truth_(temp__5457__auto__)){
+var new_ns = temp__5457__auto__;
+var G__3004 = new_ns;
+var G__3005 = entries__$1;
+var G__3006 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(lm__$2,cljs.core.strip_ns(k__$1),v__$1);
+ns__$1 = G__3004;
+G__2988__$1 = G__3005;
+lm__$1 = G__3006;
+continue;
+} else {
+return null;
+}
+}
+} else {
+return null;
+}
+} else {
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [ns__$2,lm__$2], null);
+}
+break;
+}
+} else {
+return null;
+}
+});
+cljs.core.print_prefix_map = (function cljs$core$print_prefix_map(prefix,m,print_one,writer,opts){
+return cljs.core.pr_sequential_writer(writer,(function (e,w,opts__$1){
+var G__3007_3013 = cljs.core.key(e);
+var G__3008_3014 = w;
+var G__3009_3015 = opts__$1;
+(print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__3007_3013,G__3008_3014,G__3009_3015) : print_one.call(null,G__3007_3013,G__3008_3014,G__3009_3015));
+
+cljs.core._write(w," ");
+
+var G__3010 = cljs.core.val(e);
+var G__3011 = w;
+var G__3012 = opts__$1;
+return (print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__3010,G__3011,G__3012) : print_one.call(null,G__3010,G__3011,G__3012));
+}),[cljs.core.str.cljs$core$IFn$_invoke$arity$1(prefix),"{"].join(''),", ","}",opts,cljs.core.seq(m));
+});
+cljs.core.print_map = (function cljs$core$print_map(m,print_one,writer,opts){
+var vec__3016 = ((cljs.core.map_QMARK_(m))?cljs.core.lift_ns(m):null);
+var ns = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3016,(0),null);
+var lift_map = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3016,(1),null);
+if(cljs.core.truth_(ns)){
+return cljs.core.print_prefix_map(["#:",cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns)].join(''),lift_map,print_one,writer,opts);
+} else {
+return cljs.core.print_prefix_map(null,m,print_one,writer,opts);
+}
+});
+cljs.core.Volatile.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Volatile.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,writer,opts){
+var a__$1 = this;
+cljs.core._write(writer,"#object [cljs.core.Volatile ");
+
+cljs.core.pr_writer(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$val,a__$1.state], null),writer,opts);
+
+return cljs.core._write(writer,"]");
+});
+
+cljs.core.Var.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Var.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,writer,opts){
+var a__$1 = this;
+cljs.core._write(writer,"#'");
+
+return cljs.core.pr_writer(a__$1.sym,writer,opts);
+});
+
+cljs.core.IndexedSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.IndexedSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.LazySeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.LazySeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.MapEntry.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
+});
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.NodeSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.NodeSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.BlackNode.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
+});
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.ES6IteratorSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ES6IteratorSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentTreeSet.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#{"," ","}",opts,coll__$1);
+});
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ChunkedSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.ObjMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ObjMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
+});
+
+cljs.core.Cons.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Cons.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.Iterate.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Iterate.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.RSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.RSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentHashMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
+});
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ArrayNodeSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.Subvec.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Subvec.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
+});
+
+cljs.core.Cycle.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Cycle.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentTreeMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
+});
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentHashSet.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#{"," ","}",opts,coll__$1);
+});
+
+cljs.core.ChunkedCons.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ChunkedCons.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.Atom.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Atom.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,writer,opts){
+var a__$1 = this;
+cljs.core._write(writer,"#object [cljs.core.Atom ");
+
+cljs.core.pr_writer(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$val,a__$1.state], null),writer,opts);
+
+return cljs.core._write(writer,"]");
+});
+
+cljs.core.ValSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ValSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.RedNode.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.RedNode.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
+});
+
+cljs.core.Repeat.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Repeat.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentVector.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
+});
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentQueueSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.EmptyList.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.EmptyList.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core._write(writer,"()");
+});
+
+cljs.core.PersistentQueue.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentQueue.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#queue ["," ","]",opts,cljs.core.seq(coll__$1));
+});
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentArrayMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
+});
+
+cljs.core.Range.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Range.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.TransformerIterator.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.TransformerIterator.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.KeySeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.KeySeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+
+cljs.core.List.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.List.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
+});
+cljs.core.Symbol.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Symbol.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
+var x__$1 = this;
+if((y instanceof cljs.core.Symbol)){
+return cljs.core.compare_symbols(x__$1,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+});
+
+cljs.core.Keyword.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Keyword.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
+var x__$1 = this;
+if((y instanceof cljs.core.Keyword)){
+return cljs.core.compare_keywords(x__$1,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+});
+
+cljs.core.Subvec.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.Subvec.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
+var x__$1 = this;
+if(cljs.core.vector_QMARK_(y)){
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+});
+
+cljs.core.PersistentVector.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.PersistentVector.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
+var x__$1 = this;
+if(cljs.core.vector_QMARK_(y)){
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+});
+
+cljs.core.MapEntry.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.MapEntry.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
+var x__$1 = this;
+if(cljs.core.vector_QMARK_(y)){
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+});
+
+cljs.core.BlackNode.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.BlackNode.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
+var x__$1 = this;
+if(cljs.core.vector_QMARK_(y)){
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+});
+
+cljs.core.RedNode.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.RedNode.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
+var x__$1 = this;
+if(cljs.core.vector_QMARK_(y)){
+return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
+} else {
+throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
+}
+});
+/**
+ * Atomically sets the metadata for a namespace/var/ref/agent/atom to be:
+ * 
+ *   (apply f its-current-meta args)
+ * 
+ *   f must be free of side-effects
+ */
+cljs.core.alter_meta_BANG_ = (function cljs$core$alter_meta_BANG_(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3022 = arguments.length;
+var i__4519__auto___3023 = (0);
+while(true){
+if((i__4519__auto___3023 < len__4518__auto___3022)){
+args__4521__auto__.push((arguments[i__4519__auto___3023]));
+
+var G__3024 = (i__4519__auto___3023 + (1));
+i__4519__auto___3023 = G__3024;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((2) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((2)),(0),null)):null);
+return cljs.core.alter_meta_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4522__auto__);
+});
+
+cljs.core.alter_meta_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (iref,f,args){
+return iref.meta = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(f,iref.meta,args);
+});
+
+cljs.core.alter_meta_BANG_.cljs$lang$maxFixedArity = (2);
+
+/** @this {Function} */
+cljs.core.alter_meta_BANG_.cljs$lang$applyTo = (function (seq3019){
+var G__3020 = cljs.core.first(seq3019);
+var seq3019__$1 = cljs.core.next(seq3019);
+var G__3021 = cljs.core.first(seq3019__$1);
+var seq3019__$2 = cljs.core.next(seq3019__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3020,G__3021,seq3019__$2);
+});
+
+/**
+ * Atomically resets the metadata for an atom
+ */
+cljs.core.reset_meta_BANG_ = (function cljs$core$reset_meta_BANG_(iref,m){
+return iref.meta = m;
+});
+/**
+ * Adds a watch function to an atom reference. The watch fn must be a
+ *   fn of 4 args: a key, the reference, its old-state, its
+ *   new-state. Whenever the reference's state might have been changed,
+ *   any registered watches will have their functions called. The watch
+ *   fn will be called synchronously. Note that an atom's state
+ *   may have changed again prior to the fn call, so use old/new-state
+ *   rather than derefing the reference. Keys must be unique per
+ *   reference, and can be used to remove the watch with remove-watch,
+ *   but are otherwise considered opaque by the watch mechanism.  Bear in
+ *   mind that regardless of the result or action of the watch fns the
+ *   atom's value will change.  Example:
+ * 
+ *    (def a (atom 0))
+ *    (add-watch a :inc (fn [k r o n] (assert (== 0 n))))
+ *    (swap! a inc)
+ *    ;; Assertion Error
+ *    (deref a)
+ *    ;=> 1
+ */
+cljs.core.add_watch = (function cljs$core$add_watch(iref,key,f){
+cljs.core._add_watch(iref,key,f);
+
+return iref;
+});
+/**
+ * Removes a watch (set by add-watch) from a reference
+ */
+cljs.core.remove_watch = (function cljs$core$remove_watch(iref,key){
+cljs.core._remove_watch(iref,key);
+
+return iref;
+});
+/**
+ * @type {*}
+ */
+cljs.core.gensym_counter = null;
+/**
+ * Returns a new symbol with a unique name. If a prefix string is
+ *   supplied, the name is prefix# where # is some unique number. If
+ *   prefix is not supplied, the prefix is 'G__'.
+ */
+cljs.core.gensym = (function cljs$core$gensym(var_args){
+var G__3026 = arguments.length;
+switch (G__3026) {
+case 0:
+return cljs.core.gensym.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.gensym.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.gensym.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.gensym.cljs$core$IFn$_invoke$arity$1("G__");
+});
+
+cljs.core.gensym.cljs$core$IFn$_invoke$arity$1 = (function (prefix_string){
+if((cljs.core.gensym_counter == null)){
+cljs.core.gensym_counter = cljs.core.atom.cljs$core$IFn$_invoke$arity$1((0));
+} else {
+}
+
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1(prefix_string),cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(cljs.core.gensym_counter,cljs.core.inc))].join(''));
+});
+
+cljs.core.gensym.cljs$lang$maxFixedArity = 1;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IPending}
+ * @implements {cljs.core.IDeref}
+*/
+cljs.core.Delay = (function (f,value){
+this.f = f;
+this.value = value;
+this.cljs$lang$protocol_mask$partition0$ = 32768;
+this.cljs$lang$protocol_mask$partition1$ = 1;
+});
+cljs.core.Delay.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+if(cljs.core.truth_(self__.f)){
+self__.value = (self__.f.cljs$core$IFn$_invoke$arity$0 ? self__.f.cljs$core$IFn$_invoke$arity$0() : self__.f.call(null));
+
+self__.f = null;
+} else {
+}
+
+return self__.value;
+});
+
+cljs.core.Delay.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (x){
+var self__ = this;
+var x__$1 = this;
+return cljs.core.not(self__.f);
+});
+
+cljs.core.Delay.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$f,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$value,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.Delay.cljs$lang$type = true;
+
+cljs.core.Delay.cljs$lang$ctorStr = "cljs.core/Delay";
+
+cljs.core.Delay.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Delay");
+});
+
+/**
+ * Positional factory function for cljs.core/Delay.
+ */
+cljs.core.__GT_Delay = (function cljs$core$__GT_Delay(f,value){
+return (new cljs.core.Delay(f,value));
+});
+
+/**
+ * returns true if x is a Delay created with delay
+ */
+cljs.core.delay_QMARK_ = (function cljs$core$delay_QMARK_(x){
+return (x instanceof cljs.core.Delay);
+});
+/**
+ * If x is a Delay, returns the (possibly cached) value of its expression, else returns x
+ */
+cljs.core.force = (function cljs$core$force(x){
+if(cljs.core.delay_QMARK_(x)){
+return cljs.core.deref(x);
+} else {
+return x;
+}
+});
+/**
+ * Returns true if a value has been produced for a delay or lazy sequence.
+ */
+cljs.core.realized_QMARK_ = (function cljs$core$realized_QMARK_(x){
+return cljs.core._realized_QMARK_(x);
+});
+cljs.core.preserving_reduced = (function cljs$core$preserving_reduced(rf){
+return (function (p1__3028_SHARP_,p2__3029_SHARP_){
+var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(p1__3028_SHARP_,p2__3029_SHARP_) : rf.call(null,p1__3028_SHARP_,p2__3029_SHARP_));
+if(cljs.core.reduced_QMARK_(ret)){
+return cljs.core.reduced(ret);
+} else {
+return ret;
+}
+});
+});
+/**
+ * A transducer which concatenates the contents of each input, which must be a
+ *   collection, into the reduction.
+ */
+cljs.core.cat = (function cljs$core$cat(rf){
+var rf1 = cljs.core.preserving_reduced(rf);
+return ((function (rf1){
+return (function() {
+var G__3030 = null;
+var G__3030__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__3030__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__3030__2 = (function (result,input){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(rf1,result,input);
+});
+G__3030 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__3030__0.call(this);
+case 1:
+return G__3030__1.call(this,result);
+case 2:
+return G__3030__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__3030.cljs$core$IFn$_invoke$arity$0 = G__3030__0;
+G__3030.cljs$core$IFn$_invoke$arity$1 = G__3030__1;
+G__3030.cljs$core$IFn$_invoke$arity$2 = G__3030__2;
+return G__3030;
+})()
+;})(rf1))
+});
+/**
+ * Returns a transducer that ends transduction when pred returns true
+ *   for an input. When retf is supplied it must be a fn of 2 arguments -
+ *   it will be passed the (completed) result so far and the input that
+ *   triggered the predicate, and its return value (if it does not throw
+ *   an exception) will be the return value of the transducer. If retf
+ *   is not supplied, the input that triggered the predicate will be
+ *   returned. If the predicate never returns true the transduction is
+ *   unaffected.
+ */
+cljs.core.halt_when = (function cljs$core$halt_when(var_args){
+var G__3032 = arguments.length;
+switch (G__3032) {
+case 1:
+return cljs.core.halt_when.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.halt_when.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.halt_when.cljs$core$IFn$_invoke$arity$1 = (function (pred){
+return cljs.core.halt_when.cljs$core$IFn$_invoke$arity$2(pred,null);
+});
+
+cljs.core.halt_when.cljs$core$IFn$_invoke$arity$2 = (function (pred,retf){
+return (function (rf){
+return (function() {
+var G__3036 = null;
+var G__3036__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__3036__1 = (function (result){
+if(((cljs.core.map_QMARK_(result)) && (cljs.core.contains_QMARK_(result,cljs.core.cst$kw$cljs$core_SLASH_halt)))){
+return cljs.core.cst$kw$cljs$core_SLASH_halt.cljs$core$IFn$_invoke$arity$1(result);
+} else {
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+}
+});
+var G__3036__2 = (function (result,input){
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input)))){
+return cljs.core.reduced(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cljs$core_SLASH_halt,(cljs.core.truth_(retf)?(function (){var G__3033 = (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+var G__3034 = input;
+return (retf.cljs$core$IFn$_invoke$arity$2 ? retf.cljs$core$IFn$_invoke$arity$2(G__3033,G__3034) : retf.call(null,G__3033,G__3034));
+})():input)], null));
+} else {
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+}
+});
+G__3036 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__3036__0.call(this);
+case 1:
+return G__3036__1.call(this,result);
+case 2:
+return G__3036__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__3036.cljs$core$IFn$_invoke$arity$0 = G__3036__0;
+G__3036.cljs$core$IFn$_invoke$arity$1 = G__3036__1;
+G__3036.cljs$core$IFn$_invoke$arity$2 = G__3036__2;
+return G__3036;
+})()
+});
+});
+
+cljs.core.halt_when.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a lazy sequence removing consecutive duplicates in coll.
+ *   Returns a transducer when no collection is provided.
+ */
+cljs.core.dedupe = (function cljs$core$dedupe(var_args){
+var G__3038 = arguments.length;
+switch (G__3038) {
+case 0:
+return cljs.core.dedupe.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.dedupe.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.dedupe.cljs$core$IFn$_invoke$arity$0 = (function (){
+return (function (rf){
+var pa = cljs.core.volatile_BANG_(cljs.core.cst$kw$cljs$core_SLASH_none);
+return ((function (pa){
+return (function() {
+var G__3040 = null;
+var G__3040__0 = (function (){
+return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
+});
+var G__3040__1 = (function (result){
+return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
+});
+var G__3040__2 = (function (result,input){
+var prior = cljs.core.deref(pa);
+cljs.core.vreset_BANG_(pa,input);
+
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(prior,input)){
+return result;
+} else {
+return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
+}
+});
+G__3040 = function(result,input){
+switch(arguments.length){
+case 0:
+return G__3040__0.call(this);
+case 1:
+return G__3040__1.call(this,result);
+case 2:
+return G__3040__2.call(this,result,input);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__3040.cljs$core$IFn$_invoke$arity$0 = G__3040__0;
+G__3040.cljs$core$IFn$_invoke$arity$1 = G__3040__1;
+G__3040.cljs$core$IFn$_invoke$arity$2 = G__3040__2;
+return G__3040;
+})()
+;})(pa))
+});
+});
+
+cljs.core.dedupe.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+return cljs.core.sequence.cljs$core$IFn$_invoke$arity$2(cljs.core.dedupe.cljs$core$IFn$_invoke$arity$0(),coll);
+});
+
+cljs.core.dedupe.cljs$lang$maxFixedArity = 1;
+
+/**
+ * Returns items from coll with random probability of prob (0.0 -
+ *   1.0).  Returns a transducer when no collection is provided.
+ */
+cljs.core.random_sample = (function cljs$core$random_sample(var_args){
+var G__3042 = arguments.length;
+switch (G__3042) {
+case 1:
+return cljs.core.random_sample.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.random_sample.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.random_sample.cljs$core$IFn$_invoke$arity$1 = (function (prob){
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$1((function (_){
+return (cljs.core.rand.cljs$core$IFn$_invoke$arity$0() < prob);
+}));
+});
+
+cljs.core.random_sample.cljs$core$IFn$_invoke$arity$2 = (function (prob,coll){
+return cljs.core.filter.cljs$core$IFn$_invoke$arity$2((function (_){
+return (cljs.core.rand.cljs$core$IFn$_invoke$arity$0() < prob);
+}),coll);
+});
+
+cljs.core.random_sample.cljs$lang$maxFixedArity = 2;
+
+
+/**
+* @constructor
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.ISequential}
+ * @implements {cljs.core.IReduce}
+*/
+cljs.core.Eduction = (function (xform,coll){
+this.xform = xform;
+this.coll = coll;
+this.cljs$lang$protocol_mask$partition0$ = 2173173760;
+this.cljs$lang$protocol_mask$partition1$ = 131072;
+});
+cljs.core.Eduction.prototype.indexOf = (function() {
+var G__3044 = null;
+var G__3044__1 = (function (x){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,(0));
+});
+var G__3044__2 = (function (x,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,start);
+});
+G__3044 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__3044__1.call(this,x);
+case 2:
+return G__3044__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__3044.cljs$core$IFn$_invoke$arity$1 = G__3044__1;
+G__3044.cljs$core$IFn$_invoke$arity$2 = G__3044__2;
+return G__3044;
+})()
+;
+
+cljs.core.Eduction.prototype.lastIndexOf = (function() {
+var G__3045 = null;
+var G__3045__1 = (function (x){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,cljs.core.count(coll__$1));
+});
+var G__3045__2 = (function (x,start){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,start);
+});
+G__3045 = function(x,start){
+switch(arguments.length){
+case 1:
+return G__3045__1.call(this,x);
+case 2:
+return G__3045__2.call(this,x,start);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__3045.cljs$core$IFn$_invoke$arity$1 = G__3045__1;
+G__3045.cljs$core$IFn$_invoke$arity$2 = G__3045__2;
+return G__3045;
+})()
+;
+
+cljs.core.Eduction.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.TransformerIterator.create(self__.xform,cljs.core.iter(self__.coll));
+});
+
+cljs.core.Eduction.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.seq(cljs.core.sequence.cljs$core$IFn$_invoke$arity$2(self__.xform,self__.coll));
+});
+
+cljs.core.Eduction.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (_,f){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.transduce.cljs$core$IFn$_invoke$arity$3(self__.xform,cljs.core.completing.cljs$core$IFn$_invoke$arity$1(f),self__.coll);
+});
+
+cljs.core.Eduction.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (_,f,init){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(self__.xform,cljs.core.completing.cljs$core$IFn$_invoke$arity$1(f),init,self__.coll);
+});
+
+cljs.core.Eduction.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll__$1,writer,opts){
+var self__ = this;
+var coll__$2 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$2);
+});
+
+cljs.core.Eduction.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$xform,cljs.core.cst$sym$coll], null);
+});
+
+cljs.core.Eduction.cljs$lang$type = true;
+
+cljs.core.Eduction.cljs$lang$ctorStr = "cljs.core/Eduction";
+
+cljs.core.Eduction.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Eduction");
+});
+
+/**
+ * Positional factory function for cljs.core/Eduction.
+ */
+cljs.core.__GT_Eduction = (function cljs$core$__GT_Eduction(xform,coll){
+return (new cljs.core.Eduction(xform,coll));
+});
+
+var G__3046_3049 = cljs.core.Eduction.prototype;
+var G__3047_3050 = cljs.core.ITER_SYMBOL;
+var G__3048_3051 = ((function (G__3046_3049,G__3047_3050){
+return (function (){
+var this__4457__auto__ = this;
+return cljs.core.es6_iterator(this__4457__auto__);
+});})(G__3046_3049,G__3047_3050))
+;
+goog.object.set(G__3046_3049,G__3047_3050,G__3048_3051);
+/**
+ * Returns a reducible/iterable application of the transducers
+ *   to the items in coll. Transducers are applied in order as if
+ *   combined with comp. Note that these applications will be
+ *   performed every time reduce/iterator is called.
+ */
+cljs.core.eduction = (function cljs$core$eduction(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3053 = arguments.length;
+var i__4519__auto___3054 = (0);
+while(true){
+if((i__4519__auto___3054 < len__4518__auto___3053)){
+args__4521__auto__.push((arguments[i__4519__auto___3054]));
+
+var G__3055 = (i__4519__auto___3054 + (1));
+i__4519__auto___3054 = G__3055;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return cljs.core.eduction.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+cljs.core.eduction.cljs$core$IFn$_invoke$arity$variadic = (function (xforms){
+return (new cljs.core.Eduction(cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.comp,cljs.core.butlast(xforms)),cljs.core.last(xforms)));
+});
+
+cljs.core.eduction.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+cljs.core.eduction.cljs$lang$applyTo = (function (seq3052){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq3052));
+});
+
+/**
+ * Runs the supplied procedure (via reduce), for purposes of side
+ *   effects, on successive items in the collection. Returns nil
+ */
+cljs.core.run_BANG_ = (function cljs$core$run_BANG_(proc,coll){
+cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__3057_SHARP_,p2__3056_SHARP_){
+return (proc.cljs$core$IFn$_invoke$arity$1 ? proc.cljs$core$IFn$_invoke$arity$1(p2__3056_SHARP_) : proc.call(null,p2__3056_SHARP_));
+}),null,coll);
+
+return null;
+});
+
+/**
+ * @interface
+ */
+cljs.core.IEncodeJS = function(){};
+
+/**
+ * Recursively transforms clj values to JavaScript
+ */
+cljs.core._clj__GT_js = (function cljs$core$_clj__GT_js(x){
+if(((!((x == null))) && (!((x.cljs$core$IEncodeJS$_clj__GT_js$arity$1 == null))))){
+return x.cljs$core$IEncodeJS$_clj__GT_js$arity$1(x);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (cljs.core._clj__GT_js[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto__.call(null,x));
+} else {
+var m__4231__auto____$1 = (cljs.core._clj__GT_js["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto____$1.call(null,x));
+} else {
+throw cljs.core.missing_protocol("IEncodeJS.-clj->js",x);
+}
+}
+}
+});
+
+/**
+ * Transforms map keys to valid JavaScript keys. Arbitrary keys are
+ *   encoded to their string representation via (pr-str x)
+ */
+cljs.core._key__GT_js = (function cljs$core$_key__GT_js(x){
+if(((!((x == null))) && (!((x.cljs$core$IEncodeJS$_key__GT_js$arity$1 == null))))){
+return x.cljs$core$IEncodeJS$_key__GT_js$arity$1(x);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (cljs.core._key__GT_js[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto__.call(null,x));
+} else {
+var m__4231__auto____$1 = (cljs.core._key__GT_js["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto____$1.call(null,x));
+} else {
+throw cljs.core.missing_protocol("IEncodeJS.-key->js",x);
+}
+}
+}
+});
+
+cljs.core.key__GT_js = (function cljs$core$key__GT_js(var_args){
+var G__3059 = arguments.length;
+switch (G__3059) {
+case 1:
+return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$1 = (function (k){
+return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2(k,cljs.core.clj__GT_js);
+});
+
+cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2 = (function (k,primitive_fn){
+if(((!((k == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === k.cljs$core$IEncodeJS$))))?true:(((!k.cljs$lang$protocol_mask$partition$))?cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,k):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,k))){
+return cljs.core._clj__GT_js(k);
+} else {
+if(((typeof k === 'string') || (typeof k === 'number') || ((k instanceof cljs.core.Keyword)) || ((k instanceof cljs.core.Symbol)))){
+return (primitive_fn.cljs$core$IFn$_invoke$arity$1 ? primitive_fn.cljs$core$IFn$_invoke$arity$1(k) : primitive_fn.call(null,k));
+} else {
+return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([k], 0));
+
+}
+}
+});
+
+cljs.core.key__GT_js.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Recursively transforms ClojureScript values to JavaScript.
+ *   sets/vectors/lists become Arrays, Keywords and Symbol become Strings,
+ *   Maps become Objects. Arbitrary keys are encoded to by `key->js`.
+ *   Options is a key-value pair, where the only valid key is
+ *   :keyword-fn, which should point to a single-argument function to be
+ *   called on keyword keys. Default to `name`.
+ */
+cljs.core.clj__GT_js = (function cljs$core$clj__GT_js(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3113 = arguments.length;
+var i__4519__auto___3114 = (0);
+while(true){
+if((i__4519__auto___3114 < len__4518__auto___3113)){
+args__4521__auto__.push((arguments[i__4519__auto___3114]));
+
+var G__3115 = (i__4519__auto___3114 + (1));
+i__4519__auto___3114 = G__3115;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.core.clj__GT_js.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.core.clj__GT_js.cljs$core$IFn$_invoke$arity$variadic = (function (x,p__3064){
+var map__3065 = p__3064;
+var map__3065__$1 = ((((!((map__3065 == null)))?(((((map__3065.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3065.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3065):map__3065);
+var options = map__3065__$1;
+var keyword_fn = cljs.core.get.cljs$core$IFn$_invoke$arity$3(map__3065__$1,cljs.core.cst$kw$keyword_DASH_fn,cljs.core.name);
+var keyfn = ((function (map__3065,map__3065__$1,options,keyword_fn){
+return (function cljs$core$keyfn(k){
+return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2(k,thisfn);
+});})(map__3065,map__3065__$1,options,keyword_fn))
+;
+var thisfn = ((function (map__3065,map__3065__$1,options,keyword_fn){
+return (function cljs$core$thisfn(x__$1){
+if((x__$1 == null)){
+return null;
+} else {
+if(((!((x__$1 == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === x__$1.cljs$core$IEncodeJS$))))?true:(((!x__$1.cljs$lang$protocol_mask$partition$))?cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,x__$1):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,x__$1))){
+return cljs.core._clj__GT_js(x__$1);
+} else {
+if((x__$1 instanceof cljs.core.Keyword)){
+return (keyword_fn.cljs$core$IFn$_invoke$arity$1 ? keyword_fn.cljs$core$IFn$_invoke$arity$1(x__$1) : keyword_fn.call(null,x__$1));
+} else {
+if((x__$1 instanceof cljs.core.Symbol)){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)].join('');
+} else {
+if(cljs.core.map_QMARK_(x__$1)){
+var m = {};
+var seq__3093_3116 = cljs.core.seq(x__$1);
+var chunk__3094_3117 = null;
+var count__3095_3118 = (0);
+var i__3096_3119 = (0);
+while(true){
+if((i__3096_3119 < count__3095_3118)){
+var vec__3097_3120 = chunk__3094_3117.cljs$core$IIndexed$_nth$arity$2(null,i__3096_3119);
+var k_3121 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3097_3120,(0),null);
+var v_3122 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3097_3120,(1),null);
+var G__3100_3123 = m;
+var G__3101_3124 = keyfn(k_3121);
+var G__3102_3125 = cljs$core$thisfn(v_3122);
+goog.object.set(G__3100_3123,G__3101_3124,G__3102_3125);
+
+
+var G__3126 = seq__3093_3116;
+var G__3127 = chunk__3094_3117;
+var G__3128 = count__3095_3118;
+var G__3129 = (i__3096_3119 + (1));
+seq__3093_3116 = G__3126;
+chunk__3094_3117 = G__3127;
+count__3095_3118 = G__3128;
+i__3096_3119 = G__3129;
+continue;
+} else {
+var temp__5457__auto___3130 = cljs.core.seq(seq__3093_3116);
+if(temp__5457__auto___3130){
+var seq__3093_3131__$1 = temp__5457__auto___3130;
+if(cljs.core.chunked_seq_QMARK_(seq__3093_3131__$1)){
+var c__4338__auto___3132 = cljs.core.chunk_first(seq__3093_3131__$1);
+var G__3133 = cljs.core.chunk_rest(seq__3093_3131__$1);
+var G__3134 = c__4338__auto___3132;
+var G__3135 = cljs.core.count(c__4338__auto___3132);
+var G__3136 = (0);
+seq__3093_3116 = G__3133;
+chunk__3094_3117 = G__3134;
+count__3095_3118 = G__3135;
+i__3096_3119 = G__3136;
+continue;
+} else {
+var vec__3103_3137 = cljs.core.first(seq__3093_3131__$1);
+var k_3138 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3103_3137,(0),null);
+var v_3139 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3103_3137,(1),null);
+var G__3106_3140 = m;
+var G__3107_3141 = keyfn(k_3138);
+var G__3108_3142 = cljs$core$thisfn(v_3139);
+goog.object.set(G__3106_3140,G__3107_3141,G__3108_3142);
+
+
+var G__3143 = cljs.core.next(seq__3093_3131__$1);
+var G__3144 = null;
+var G__3145 = (0);
+var G__3146 = (0);
+seq__3093_3116 = G__3143;
+chunk__3094_3117 = G__3144;
+count__3095_3118 = G__3145;
+i__3096_3119 = G__3146;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+return m;
+} else {
+if(cljs.core.coll_QMARK_(x__$1)){
+var arr = [];
+var seq__3109_3147 = cljs.core.seq(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs$core$thisfn,x__$1));
+var chunk__3110_3148 = null;
+var count__3111_3149 = (0);
+var i__3112_3150 = (0);
+while(true){
+if((i__3112_3150 < count__3111_3149)){
+var x_3151__$2 = chunk__3110_3148.cljs$core$IIndexed$_nth$arity$2(null,i__3112_3150);
+arr.push(x_3151__$2);
+
+
+var G__3152 = seq__3109_3147;
+var G__3153 = chunk__3110_3148;
+var G__3154 = count__3111_3149;
+var G__3155 = (i__3112_3150 + (1));
+seq__3109_3147 = G__3152;
+chunk__3110_3148 = G__3153;
+count__3111_3149 = G__3154;
+i__3112_3150 = G__3155;
+continue;
+} else {
+var temp__5457__auto___3156 = cljs.core.seq(seq__3109_3147);
+if(temp__5457__auto___3156){
+var seq__3109_3157__$1 = temp__5457__auto___3156;
+if(cljs.core.chunked_seq_QMARK_(seq__3109_3157__$1)){
+var c__4338__auto___3158 = cljs.core.chunk_first(seq__3109_3157__$1);
+var G__3159 = cljs.core.chunk_rest(seq__3109_3157__$1);
+var G__3160 = c__4338__auto___3158;
+var G__3161 = cljs.core.count(c__4338__auto___3158);
+var G__3162 = (0);
+seq__3109_3147 = G__3159;
+chunk__3110_3148 = G__3160;
+count__3111_3149 = G__3161;
+i__3112_3150 = G__3162;
+continue;
+} else {
+var x_3163__$2 = cljs.core.first(seq__3109_3157__$1);
+arr.push(x_3163__$2);
+
+
+var G__3164 = cljs.core.next(seq__3109_3157__$1);
+var G__3165 = null;
+var G__3166 = (0);
+var G__3167 = (0);
+seq__3109_3147 = G__3164;
+chunk__3110_3148 = G__3165;
+count__3111_3149 = G__3166;
+i__3112_3150 = G__3167;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+return arr;
+} else {
+return x__$1;
+
+}
+}
+}
+}
+}
+}
+});})(map__3065,map__3065__$1,options,keyword_fn))
+;
+return thisfn(x);
+});
+
+cljs.core.clj__GT_js.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.core.clj__GT_js.cljs$lang$applyTo = (function (seq3062){
+var G__3063 = cljs.core.first(seq3062);
+var seq3062__$1 = cljs.core.next(seq3062);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3063,seq3062__$1);
+});
+
+
+/**
+ * @interface
+ */
+cljs.core.IEncodeClojure = function(){};
+
+/**
+ * Transforms JavaScript values to Clojure
+ */
+cljs.core._js__GT_clj = (function cljs$core$_js__GT_clj(x,options){
+if(((!((x == null))) && (!((x.cljs$core$IEncodeClojure$_js__GT_clj$arity$2 == null))))){
+return x.cljs$core$IEncodeClojure$_js__GT_clj$arity$2(x,options);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (cljs.core._js__GT_clj[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(x,options) : m__4231__auto__.call(null,x,options));
+} else {
+var m__4231__auto____$1 = (cljs.core._js__GT_clj["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(x,options) : m__4231__auto____$1.call(null,x,options));
+} else {
+throw cljs.core.missing_protocol("IEncodeClojure.-js->clj",x);
+}
+}
+}
+});
+
+/**
+ * Recursively transforms JavaScript arrays into ClojureScript
+ *   vectors, and JavaScript objects into ClojureScript maps.  With
+ *   option ':keywordize-keys true' will convert object fields from
+ *   strings to keywords.
+ */
+cljs.core.js__GT_clj = (function cljs$core$js__GT_clj(var_args){
+var G__3171 = arguments.length;
+switch (G__3171) {
+case 1:
+return cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3180 = arguments.length;
+var i__4519__auto___3181 = (0);
+while(true){
+if((i__4519__auto___3181 < len__4518__auto___3180)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3181]));
+
+var G__3182 = (i__4519__auto___3181 + (1));
+i__4519__auto___3181 = G__3182;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((1)),(0),null));
+return cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic(x,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$keywordize_DASH_keys,false], 0));
+});
+
+cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic = (function (x,opts){
+var map__3172 = opts;
+var map__3172__$1 = ((((!((map__3172 == null)))?(((((map__3172.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3172.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3172):map__3172);
+var keywordize_keys = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3172__$1,cljs.core.cst$kw$keywordize_DASH_keys);
+var keyfn = (cljs.core.truth_(keywordize_keys)?cljs.core.keyword:cljs.core.str);
+var f = ((function (map__3172,map__3172__$1,keywordize_keys,keyfn){
+return (function cljs$core$thisfn(x__$1){
+if(((!((x__$1 == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === x__$1.cljs$core$IEncodeClojure$))))?true:(((!x__$1.cljs$lang$protocol_mask$partition$))?cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeClojure,x__$1):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeClojure,x__$1))){
+return cljs.core._js__GT_clj(x__$1,cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.array_map,opts));
+} else {
+if(cljs.core.seq_QMARK_(x__$1)){
+return cljs.core.doall.cljs$core$IFn$_invoke$arity$1(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs$core$thisfn,x__$1));
+} else {
+if(cljs.core.map_entry_QMARK_(x__$1)){
+return (new cljs.core.MapEntry(cljs$core$thisfn(cljs.core.key(x__$1)),cljs$core$thisfn(cljs.core.val(x__$1)),null));
+} else {
+if(cljs.core.coll_QMARK_(x__$1)){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.empty(x__$1),cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs$core$thisfn,x__$1));
+} else {
+if(cljs.core.array_QMARK_(x__$1)){
+return cljs.core.vec(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs$core$thisfn,x__$1));
+} else {
+if((cljs.core.type(x__$1) === Object)){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,(function (){var iter__4311__auto__ = ((function (map__3172,map__3172__$1,keywordize_keys,keyfn){
+return (function cljs$core$thisfn_$_iter__3175(s__3176){
+return (new cljs.core.LazySeq(null,((function (map__3172,map__3172__$1,keywordize_keys,keyfn){
+return (function (){
+var s__3176__$1 = s__3176;
+while(true){
+var temp__5457__auto__ = cljs.core.seq(s__3176__$1);
+if(temp__5457__auto__){
+var s__3176__$2 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s__3176__$2)){
+var c__4309__auto__ = cljs.core.chunk_first(s__3176__$2);
+var size__4310__auto__ = cljs.core.count(c__4309__auto__);
+var b__3178 = cljs.core.chunk_buffer(size__4310__auto__);
+if((function (){var i__3177 = (0);
+while(true){
+if((i__3177 < size__4310__auto__)){
+var k = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c__4309__auto__,i__3177);
+cljs.core.chunk_append(b__3178,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(keyfn.cljs$core$IFn$_invoke$arity$1 ? keyfn.cljs$core$IFn$_invoke$arity$1(k) : keyfn.call(null,k)),cljs$core$thisfn((x__$1[k]))], null));
+
+var G__3183 = (i__3177 + (1));
+i__3177 = G__3183;
+continue;
+} else {
+return true;
+}
+break;
+}
+})()){
+return cljs.core.chunk_cons(cljs.core.chunk(b__3178),cljs$core$thisfn_$_iter__3175(cljs.core.chunk_rest(s__3176__$2)));
+} else {
+return cljs.core.chunk_cons(cljs.core.chunk(b__3178),null);
+}
+} else {
+var k = cljs.core.first(s__3176__$2);
+return cljs.core.cons(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(keyfn.cljs$core$IFn$_invoke$arity$1 ? keyfn.cljs$core$IFn$_invoke$arity$1(k) : keyfn.call(null,k)),cljs$core$thisfn((x__$1[k]))], null),cljs$core$thisfn_$_iter__3175(cljs.core.rest(s__3176__$2)));
+}
+} else {
+return null;
+}
+break;
+}
+});})(map__3172,map__3172__$1,keywordize_keys,keyfn))
+,null,null));
+});})(map__3172,map__3172__$1,keywordize_keys,keyfn))
+;
+return iter__4311__auto__(cljs.core.js_keys(x__$1));
+})());
+} else {
+return x__$1;
+
+}
+}
+}
+}
+}
+}
+});})(map__3172,map__3172__$1,keywordize_keys,keyfn))
+;
+return f(x);
+});
+
+/** @this {Function} */
+cljs.core.js__GT_clj.cljs$lang$applyTo = (function (seq3169){
+var G__3170 = cljs.core.first(seq3169);
+var seq3169__$1 = cljs.core.next(seq3169);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3170,seq3169__$1);
+});
+
+cljs.core.js__GT_clj.cljs$lang$maxFixedArity = (1);
+
+/**
+ * Returns a memoized version of a referentially transparent function. The
+ *   memoized version of the function keeps a cache of the mapping from arguments
+ *   to results and, when calls with the same arguments are repeated often, has
+ *   higher performance at the expense of higher memory use.
+ */
+cljs.core.memoize = (function cljs$core$memoize(f){
+var mem = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+return ((function (mem){
+return (function() { 
+var G__3184__delegate = function (args){
+var v = cljs.core.get.cljs$core$IFn$_invoke$arity$3(cljs.core.deref(mem),args,cljs.core.lookup_sentinel);
+if((v === cljs.core.lookup_sentinel)){
+var ret = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(f,args);
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(mem,cljs.core.assoc,args,ret);
+
+return ret;
+} else {
+return v;
+}
+};
+var G__3184 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__3185__i = 0, G__3185__a = new Array(arguments.length -  0);
+while (G__3185__i < G__3185__a.length) {G__3185__a[G__3185__i] = arguments[G__3185__i + 0]; ++G__3185__i;}
+  args = new cljs.core.IndexedSeq(G__3185__a,0,null);
+} 
+return G__3184__delegate.call(this,args);};
+G__3184.cljs$lang$maxFixedArity = 0;
+G__3184.cljs$lang$applyTo = (function (arglist__3186){
+var args = cljs.core.seq(arglist__3186);
+return G__3184__delegate(args);
+});
+G__3184.cljs$core$IFn$_invoke$arity$variadic = G__3184__delegate;
+return G__3184;
+})()
+;
+;})(mem))
+});
+/**
+ * trampoline can be used to convert algorithms requiring mutual
+ *   recursion without stack consumption. Calls f with supplied args, if
+ *   any. If f returns a fn, calls that fn with no arguments, and
+ *   continues to repeat, until the return value is not a fn, then
+ *   returns that non-fn value. Note that if you want to return a fn as a
+ *   final value, you must wrap it in some data structure and unpack it
+ *   after trampoline returns.
+ */
+cljs.core.trampoline = (function cljs$core$trampoline(var_args){
+var G__3190 = arguments.length;
+switch (G__3190) {
+case 1:
+return cljs.core.trampoline.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3192 = arguments.length;
+var i__4519__auto___3193 = (0);
+while(true){
+if((i__4519__auto___3193 < len__4518__auto___3192)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3193]));
+
+var G__3194 = (i__4519__auto___3193 + (1));
+i__4519__auto___3193 = G__3194;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((1)),(0),null));
+return cljs.core.trampoline.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4534__auto__);
+
+}
+});
+
+cljs.core.trampoline.cljs$core$IFn$_invoke$arity$1 = (function (f){
+while(true){
+var ret = (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+if(cljs.core.fn_QMARK_(ret)){
+var G__3195 = ret;
+f = G__3195;
+continue;
+} else {
+return ret;
+}
+break;
+}
+});
+
+cljs.core.trampoline.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
+return cljs.core.trampoline.cljs$core$IFn$_invoke$arity$1((function (){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(f,args);
+}));
+});
+
+/** @this {Function} */
+cljs.core.trampoline.cljs$lang$applyTo = (function (seq3188){
+var G__3189 = cljs.core.first(seq3188);
+var seq3188__$1 = cljs.core.next(seq3188);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3189,seq3188__$1);
+});
+
+cljs.core.trampoline.cljs$lang$maxFixedArity = (1);
+
+/**
+ * Returns a random floating point number between 0 (inclusive) and
+ *   n (default 1) (exclusive).
+ */
+cljs.core.rand = (function cljs$core$rand(var_args){
+var G__3197 = arguments.length;
+switch (G__3197) {
+case 0:
+return cljs.core.rand.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.rand.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.rand.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.rand.cljs$core$IFn$_invoke$arity$1((1));
+});
+
+cljs.core.rand.cljs$core$IFn$_invoke$arity$1 = (function (n){
+return (Math.random() * n);
+});
+
+cljs.core.rand.cljs$lang$maxFixedArity = 1;
+
+/**
+ * Returns a random integer between 0 (inclusive) and n (exclusive).
+ */
+cljs.core.rand_int = (function cljs$core$rand_int(n){
+var G__3199 = (Math.random() * n);
+return Math.floor(G__3199);
+});
+/**
+ * Return a random element of the (sequential) collection. Will have
+ *   the same performance characteristics as nth for the given
+ *   collection.
+ */
+cljs.core.rand_nth = (function cljs$core$rand_nth(coll){
+return cljs.core.nth.cljs$core$IFn$_invoke$arity$2(coll,cljs.core.rand_int(cljs.core.count(coll)));
+});
+/**
+ * Returns a map of the elements of coll keyed by the result of
+ *   f on each element. The value at each key will be a vector of the
+ *   corresponding elements, in the order they appeared in coll.
+ */
+cljs.core.group_by = (function cljs$core$group_by(f,coll){
+return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (ret,x){
+var k = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x));
+return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(ret,k,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(ret,k,cljs.core.PersistentVector.EMPTY),x));
+}),cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY),coll));
+});
+/**
+ * Creates a hierarchy object for use with derive, isa? etc.
+ */
+cljs.core.make_hierarchy = (function cljs$core$make_hierarchy(){
+return new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$parents,cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$descendants,cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$ancestors,cljs.core.PersistentArrayMap.EMPTY], null);
+});
+/**
+ * @type {*}
+ */
+cljs.core._global_hierarchy = null;
+cljs.core.get_global_hierarchy = (function cljs$core$get_global_hierarchy(){
+if((cljs.core._global_hierarchy == null)){
+cljs.core._global_hierarchy = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.make_hierarchy());
+} else {
+}
+
+return cljs.core._global_hierarchy;
+});
+cljs.core.swap_global_hierarchy_BANG_ = (function cljs$core$swap_global_hierarchy_BANG_(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3202 = arguments.length;
+var i__4519__auto___3203 = (0);
+while(true){
+if((i__4519__auto___3203 < len__4518__auto___3202)){
+args__4521__auto__.push((arguments[i__4519__auto___3203]));
+
+var G__3204 = (i__4519__auto___3203 + (1));
+i__4519__auto___3203 = G__3204;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.swap_BANG_,cljs.core.get_global_hierarchy(),f,args);
+});
+
+cljs.core.swap_global_hierarchy_BANG_.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.core.swap_global_hierarchy_BANG_.cljs$lang$applyTo = (function (seq3200){
+var G__3201 = cljs.core.first(seq3200);
+var seq3200__$1 = cljs.core.next(seq3200);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3201,seq3200__$1);
+});
+
+/**
+ * Returns true if (= child parent), or child is directly or indirectly derived from
+ *   parent, either via a JavaScript type inheritance relationship or a
+ *   relationship established via derive. h must be a hierarchy obtained
+ *   from make-hierarchy, if not supplied defaults to the global
+ *   hierarchy
+ */
+cljs.core.isa_QMARK_ = (function cljs$core$isa_QMARK_(var_args){
+var G__3206 = arguments.length;
+switch (G__3206) {
+case 2:
+return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$2 = (function (child,parent){
+return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(cljs.core.deref(cljs.core.get_global_hierarchy()),child,parent);
+});
+
+cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3 = (function (h,child,parent){
+var or__3936__auto__ = cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(child,parent);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = cljs.core.contains_QMARK_((function (){var fexpr__3209 = cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h);
+return (fexpr__3209.cljs$core$IFn$_invoke$arity$1 ? fexpr__3209.cljs$core$IFn$_invoke$arity$1(child) : fexpr__3209.call(null,child));
+})(),parent);
+if(or__3936__auto____$1){
+return or__3936__auto____$1;
+} else {
+var and__3925__auto__ = cljs.core.vector_QMARK_(parent);
+if(and__3925__auto__){
+var and__3925__auto____$1 = cljs.core.vector_QMARK_(child);
+if(and__3925__auto____$1){
+var and__3925__auto____$2 = (cljs.core.count(parent) === cljs.core.count(child));
+if(and__3925__auto____$2){
+var ret = true;
+var i = (0);
+while(true){
+if(((!(ret)) || ((i === cljs.core.count(parent))))){
+return ret;
+} else {
+var G__3211 = cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(h,(child.cljs$core$IFn$_invoke$arity$1 ? child.cljs$core$IFn$_invoke$arity$1(i) : child.call(null,i)),(parent.cljs$core$IFn$_invoke$arity$1 ? parent.cljs$core$IFn$_invoke$arity$1(i) : parent.call(null,i)));
+var G__3212 = (i + (1));
+ret = G__3211;
+i = G__3212;
+continue;
+}
+break;
+}
+} else {
+return and__3925__auto____$2;
+}
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+}
+}
+});
+
+cljs.core.isa_QMARK_.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Returns the immediate parents of tag, either via a JavaScript type
+ *   inheritance relationship or a relationship established via derive. h
+ *   must be a hierarchy obtained from make-hierarchy, if not supplied
+ *   defaults to the global hierarchy
+ */
+cljs.core.parents = (function cljs$core$parents(var_args){
+var G__3214 = arguments.length;
+switch (G__3214) {
+case 1:
+return cljs.core.parents.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.parents.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.parents.cljs$core$IFn$_invoke$arity$1 = (function (tag){
+return cljs.core.parents.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.get_global_hierarchy()),tag);
+});
+
+cljs.core.parents.cljs$core$IFn$_invoke$arity$2 = (function (h,tag){
+return cljs.core.not_empty(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h),tag));
+});
+
+cljs.core.parents.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns the immediate and indirect parents of tag, either via a JavaScript type
+ *   inheritance relationship or a relationship established via derive. h
+ *   must be a hierarchy obtained from make-hierarchy, if not supplied
+ *   defaults to the global hierarchy
+ */
+cljs.core.ancestors = (function cljs$core$ancestors(var_args){
+var G__3217 = arguments.length;
+switch (G__3217) {
+case 1:
+return cljs.core.ancestors.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.ancestors.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.ancestors.cljs$core$IFn$_invoke$arity$1 = (function (tag){
+return cljs.core.ancestors.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.get_global_hierarchy()),tag);
+});
+
+cljs.core.ancestors.cljs$core$IFn$_invoke$arity$2 = (function (h,tag){
+return cljs.core.not_empty(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h),tag));
+});
+
+cljs.core.ancestors.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns the immediate and indirect children of tag, through a
+ *   relationship established via derive. h must be a hierarchy obtained
+ *   from make-hierarchy, if not supplied defaults to the global
+ *   hierarchy. Note: does not work on JavaScript type inheritance
+ *   relationships.
+ */
+cljs.core.descendants = (function cljs$core$descendants(var_args){
+var G__3220 = arguments.length;
+switch (G__3220) {
+case 1:
+return cljs.core.descendants.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.descendants.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.descendants.cljs$core$IFn$_invoke$arity$1 = (function (tag){
+return cljs.core.descendants.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.get_global_hierarchy()),tag);
+});
+
+cljs.core.descendants.cljs$core$IFn$_invoke$arity$2 = (function (h,tag){
+return cljs.core.not_empty(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$descendants.cljs$core$IFn$_invoke$arity$1(h),tag));
+});
+
+cljs.core.descendants.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Establishes a parent/child relationship between parent and
+ *   tag. Parent must be a namespace-qualified symbol or keyword and
+ *   child can be either a namespace-qualified symbol or keyword or a
+ *   class. h must be a hierarchy obtained from make-hierarchy, if not
+ *   supplied defaults to, and modifies, the global hierarchy.
+ */
+cljs.core.derive = (function cljs$core$derive(var_args){
+var G__3223 = arguments.length;
+switch (G__3223) {
+case 2:
+return cljs.core.derive.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.derive.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.derive.cljs$core$IFn$_invoke$arity$2 = (function (tag,parent){
+if(cljs.core.truth_(cljs.core.namespace(parent))){
+} else {
+throw (new Error("Assert failed: (namespace parent)"));
+}
+
+cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic(cljs.core.derive,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([tag,parent], 0));
+
+return null;
+});
+
+cljs.core.derive.cljs$core$IFn$_invoke$arity$3 = (function (h,tag,parent){
+if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(tag,parent)){
+} else {
+throw (new Error("Assert failed: (not= tag parent)"));
+}
+
+var tp = cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h);
+var td = cljs.core.cst$kw$descendants.cljs$core$IFn$_invoke$arity$1(h);
+var ta = cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h);
+var tf = ((function (tp,td,ta){
+return (function (m,source,sources,target,targets){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (tp,td,ta){
+return (function (ret,k){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(ret,k,cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,cljs.core.get.cljs$core$IFn$_invoke$arity$3(targets,k,cljs.core.PersistentHashSet.EMPTY),cljs.core.cons(target,(targets.cljs$core$IFn$_invoke$arity$1 ? targets.cljs$core$IFn$_invoke$arity$1(target) : targets.call(null,target)))));
+});})(tp,td,ta))
+,m,cljs.core.cons(source,(sources.cljs$core$IFn$_invoke$arity$1 ? sources.cljs$core$IFn$_invoke$arity$1(source) : sources.call(null,source))));
+});})(tp,td,ta))
+;
+var or__3936__auto__ = ((cljs.core.contains_QMARK_((tp.cljs$core$IFn$_invoke$arity$1 ? tp.cljs$core$IFn$_invoke$arity$1(tag) : tp.call(null,tag)),parent))?null:(function (){
+if(cljs.core.contains_QMARK_((ta.cljs$core$IFn$_invoke$arity$1 ? ta.cljs$core$IFn$_invoke$arity$1(tag) : ta.call(null,tag)),parent)){
+throw (new Error([cljs.core.str.cljs$core$IFn$_invoke$arity$1(tag),"already has",cljs.core.str.cljs$core$IFn$_invoke$arity$1(parent),"as ancestor"].join('')));
+} else {
+}
+
+if(cljs.core.contains_QMARK_((ta.cljs$core$IFn$_invoke$arity$1 ? ta.cljs$core$IFn$_invoke$arity$1(parent) : ta.call(null,parent)),tag)){
+throw (new Error(["Cyclic derivation:",cljs.core.str.cljs$core$IFn$_invoke$arity$1(parent),"has",cljs.core.str.cljs$core$IFn$_invoke$arity$1(tag),"as ancestor"].join('')));
+} else {
+}
+
+return new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$parents,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h),tag,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(tp,tag,cljs.core.PersistentHashSet.EMPTY),parent)),cljs.core.cst$kw$ancestors,tf(cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h),tag,td,parent,ta),cljs.core.cst$kw$descendants,tf(cljs.core.cst$kw$descendants.cljs$core$IFn$_invoke$arity$1(h),parent,ta,tag,td)], null);
+})()
+);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return h;
+}
+});
+
+cljs.core.derive.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Removes a parent/child relationship between parent and
+ *   tag. h must be a hierarchy obtained from make-hierarchy, if not
+ *   supplied defaults to, and modifies, the global hierarchy.
+ */
+cljs.core.underive = (function cljs$core$underive(var_args){
+var G__3229 = arguments.length;
+switch (G__3229) {
+case 2:
+return cljs.core.underive.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.underive.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.underive.cljs$core$IFn$_invoke$arity$2 = (function (tag,parent){
+cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic(cljs.core.underive,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([tag,parent], 0));
+
+return null;
+});
+
+cljs.core.underive.cljs$core$IFn$_invoke$arity$3 = (function (h,tag,parent){
+var parentMap = cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h);
+var childsParents = (cljs.core.truth_((parentMap.cljs$core$IFn$_invoke$arity$1 ? parentMap.cljs$core$IFn$_invoke$arity$1(tag) : parentMap.call(null,tag)))?cljs.core.disj.cljs$core$IFn$_invoke$arity$2((parentMap.cljs$core$IFn$_invoke$arity$1 ? parentMap.cljs$core$IFn$_invoke$arity$1(tag) : parentMap.call(null,tag)),parent):cljs.core.PersistentHashSet.EMPTY);
+var newParents = (cljs.core.truth_(cljs.core.not_empty(childsParents))?cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(parentMap,tag,childsParents):cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(parentMap,tag));
+var deriv_seq = cljs.core.flatten(cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (parentMap,childsParents,newParents){
+return (function (p1__3225_SHARP_){
+return cljs.core.cons(cljs.core.first(p1__3225_SHARP_),cljs.core.interpose.cljs$core$IFn$_invoke$arity$2(cljs.core.first(p1__3225_SHARP_),cljs.core.second(p1__3225_SHARP_)));
+});})(parentMap,childsParents,newParents))
+,cljs.core.seq(newParents)));
+if(cljs.core.contains_QMARK_((parentMap.cljs$core$IFn$_invoke$arity$1 ? parentMap.cljs$core$IFn$_invoke$arity$1(tag) : parentMap.call(null,tag)),parent)){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (parentMap,childsParents,newParents,deriv_seq){
+return (function (p1__3226_SHARP_,p2__3227_SHARP_){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.derive,p1__3226_SHARP_,p2__3227_SHARP_);
+});})(parentMap,childsParents,newParents,deriv_seq))
+,cljs.core.make_hierarchy(),cljs.core.partition.cljs$core$IFn$_invoke$arity$2((2),deriv_seq));
+} else {
+return h;
+}
+});
+
+cljs.core.underive.cljs$lang$maxFixedArity = 3;
+
+cljs.core.reset_cache = (function cljs$core$reset_cache(method_cache,method_table,cached_hierarchy,hierarchy){
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(method_cache,(function (_){
+return cljs.core.deref(method_table);
+}));
+
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(cached_hierarchy,(function (_){
+return cljs.core.deref(hierarchy);
+}));
+});
+cljs.core.prefers_STAR_ = (function cljs$core$prefers_STAR_(x,y,prefer_table){
+var xprefs = (function (){var fexpr__3231 = cljs.core.deref(prefer_table);
+return (fexpr__3231.cljs$core$IFn$_invoke$arity$1 ? fexpr__3231.cljs$core$IFn$_invoke$arity$1(x) : fexpr__3231.call(null,x));
+})();
+var or__3936__auto__ = (cljs.core.truth_((function (){var and__3925__auto__ = xprefs;
+if(cljs.core.truth_(and__3925__auto__)){
+return (xprefs.cljs$core$IFn$_invoke$arity$1 ? xprefs.cljs$core$IFn$_invoke$arity$1(y) : xprefs.call(null,y));
+} else {
+return and__3925__auto__;
+}
+})())?true:null);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (function (){var ps = cljs.core.parents.cljs$core$IFn$_invoke$arity$1(y);
+while(true){
+if((cljs.core.count(ps) > (0))){
+if(cljs.core.truth_((function (){var G__3235 = x;
+var G__3236 = cljs.core.first(ps);
+var G__3237 = prefer_table;
+return (cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3 ? cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3(G__3235,G__3236,G__3237) : cljs.core.prefers_STAR_.call(null,G__3235,G__3236,G__3237));
+})())){
+} else {
+}
+
+var G__3244 = cljs.core.rest(ps);
+ps = G__3244;
+continue;
+} else {
+return null;
+}
+break;
+}
+})();
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = (function (){var ps = cljs.core.parents.cljs$core$IFn$_invoke$arity$1(x);
+while(true){
+if((cljs.core.count(ps) > (0))){
+if(cljs.core.truth_((function (){var G__3241 = cljs.core.first(ps);
+var G__3242 = y;
+var G__3243 = prefer_table;
+return (cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3 ? cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3(G__3241,G__3242,G__3243) : cljs.core.prefers_STAR_.call(null,G__3241,G__3242,G__3243));
+})())){
+} else {
+}
+
+var G__3245 = cljs.core.rest(ps);
+ps = G__3245;
+continue;
+} else {
+return null;
+}
+break;
+}
+})();
+if(cljs.core.truth_(or__3936__auto____$2)){
+return or__3936__auto____$2;
+} else {
+return false;
+}
+}
+}
+});
+cljs.core.dominates = (function cljs$core$dominates(x,y,prefer_table,hierarchy){
+var or__3936__auto__ = cljs.core.prefers_STAR_(x,y,prefer_table);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(hierarchy,x,y);
+}
+});
+cljs.core.find_and_cache_best_method = (function cljs$core$find_and_cache_best_method(name,dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy,default_dispatch_val){
+var best_entry = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (be,p__3246){
+var vec__3247 = p__3246;
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3247,(0),null);
+var _ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3247,(1),null);
+var e = vec__3247;
+if(cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(cljs.core.deref(hierarchy),dispatch_val,k)){
+var be2 = (cljs.core.truth_((function (){var or__3936__auto__ = (be == null);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return cljs.core.dominates(k,cljs.core.first(be),prefer_table,cljs.core.deref(hierarchy));
+}
+})())?e:be);
+if(cljs.core.truth_(cljs.core.dominates(cljs.core.first(be2),k,prefer_table,cljs.core.deref(hierarchy)))){
+} else {
+throw (new Error(["Multiple methods in multimethod '",cljs.core.str.cljs$core$IFn$_invoke$arity$1(name),"' match dispatch value: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val)," -> ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(k)," and ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(be2)),", and neither is preferred"].join('')));
+}
+
+return be2;
+} else {
+return be;
+}
+}),null,cljs.core.deref(method_table));
+var best_entry__$1 = (function (){var temp__5455__auto__ = (function (){var and__3925__auto__ = (best_entry == null);
+if(and__3925__auto__){
+var fexpr__3251 = cljs.core.deref(method_table);
+return (fexpr__3251.cljs$core$IFn$_invoke$arity$1 ? fexpr__3251.cljs$core$IFn$_invoke$arity$1(default_dispatch_val) : fexpr__3251.call(null,default_dispatch_val));
+} else {
+return and__3925__auto__;
+}
+})();
+if(cljs.core.truth_(temp__5455__auto__)){
+var entry = temp__5455__auto__;
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [default_dispatch_val,entry], null);
+} else {
+return best_entry;
+}
+})();
+if(cljs.core.truth_(best_entry__$1)){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cached_hierarchy),cljs.core.deref(hierarchy))){
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(method_cache,cljs.core.assoc,dispatch_val,cljs.core.second(best_entry__$1));
+
+return cljs.core.second(best_entry__$1);
+} else {
+cljs.core.reset_cache(method_cache,method_table,cached_hierarchy,hierarchy);
+
+return (cljs.core.find_and_cache_best_method.cljs$core$IFn$_invoke$arity$8 ? cljs.core.find_and_cache_best_method.cljs$core$IFn$_invoke$arity$8(name,dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy,default_dispatch_val) : cljs.core.find_and_cache_best_method.call(null,name,dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy,default_dispatch_val));
+}
+} else {
+return null;
+}
+});
+
+/**
+ * @interface
+ */
+cljs.core.IMultiFn = function(){};
+
+cljs.core._reset = (function cljs$core$_reset(mf){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_reset$arity$1 == null))))){
+return mf.cljs$core$IMultiFn$_reset$arity$1(mf);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._reset[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto__.call(null,mf));
+} else {
+var m__4231__auto____$1 = (cljs.core._reset["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto____$1.call(null,mf));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-reset",mf);
+}
+}
+}
+});
+
+cljs.core._add_method = (function cljs$core$_add_method(mf,dispatch_val,method){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_add_method$arity$3 == null))))){
+return mf.cljs$core$IMultiFn$_add_method$arity$3(mf,dispatch_val,method);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._add_method[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,method) : m__4231__auto__.call(null,mf,dispatch_val,method));
+} else {
+var m__4231__auto____$1 = (cljs.core._add_method["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,method) : m__4231__auto____$1.call(null,mf,dispatch_val,method));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-add-method",mf);
+}
+}
+}
+});
+
+cljs.core._remove_method = (function cljs$core$_remove_method(mf,dispatch_val){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_remove_method$arity$2 == null))))){
+return mf.cljs$core$IMultiFn$_remove_method$arity$2(mf,dispatch_val);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._remove_method[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4231__auto__.call(null,mf,dispatch_val));
+} else {
+var m__4231__auto____$1 = (cljs.core._remove_method["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4231__auto____$1.call(null,mf,dispatch_val));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-remove-method",mf);
+}
+}
+}
+});
+
+cljs.core._prefer_method = (function cljs$core$_prefer_method(mf,dispatch_val,dispatch_val_y){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_prefer_method$arity$3 == null))))){
+return mf.cljs$core$IMultiFn$_prefer_method$arity$3(mf,dispatch_val,dispatch_val_y);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._prefer_method[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,dispatch_val_y) : m__4231__auto__.call(null,mf,dispatch_val,dispatch_val_y));
+} else {
+var m__4231__auto____$1 = (cljs.core._prefer_method["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,dispatch_val_y) : m__4231__auto____$1.call(null,mf,dispatch_val,dispatch_val_y));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-prefer-method",mf);
+}
+}
+}
+});
+
+cljs.core._get_method = (function cljs$core$_get_method(mf,dispatch_val){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_get_method$arity$2 == null))))){
+return mf.cljs$core$IMultiFn$_get_method$arity$2(mf,dispatch_val);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._get_method[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4231__auto__.call(null,mf,dispatch_val));
+} else {
+var m__4231__auto____$1 = (cljs.core._get_method["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4231__auto____$1.call(null,mf,dispatch_val));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-get-method",mf);
+}
+}
+}
+});
+
+cljs.core._methods = (function cljs$core$_methods(mf){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_methods$arity$1 == null))))){
+return mf.cljs$core$IMultiFn$_methods$arity$1(mf);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._methods[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto__.call(null,mf));
+} else {
+var m__4231__auto____$1 = (cljs.core._methods["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto____$1.call(null,mf));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-methods",mf);
+}
+}
+}
+});
+
+cljs.core._prefers = (function cljs$core$_prefers(mf){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_prefers$arity$1 == null))))){
+return mf.cljs$core$IMultiFn$_prefers$arity$1(mf);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._prefers[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto__.call(null,mf));
+} else {
+var m__4231__auto____$1 = (cljs.core._prefers["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto____$1.call(null,mf));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-prefers",mf);
+}
+}
+}
+});
+
+cljs.core._default_dispatch_val = (function cljs$core$_default_dispatch_val(mf){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_default_dispatch_val$arity$1 == null))))){
+return mf.cljs$core$IMultiFn$_default_dispatch_val$arity$1(mf);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._default_dispatch_val[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto__.call(null,mf));
+} else {
+var m__4231__auto____$1 = (cljs.core._default_dispatch_val["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto____$1.call(null,mf));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-default-dispatch-val",mf);
+}
+}
+}
+});
+
+cljs.core._dispatch_fn = (function cljs$core$_dispatch_fn(mf){
+if(((!((mf == null))) && (!((mf.cljs$core$IMultiFn$_dispatch_fn$arity$1 == null))))){
+return mf.cljs$core$IMultiFn$_dispatch_fn$arity$1(mf);
+} else {
+var x__4230__auto__ = (((mf == null))?null:mf);
+var m__4231__auto__ = (cljs.core._dispatch_fn[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto__.call(null,mf));
+} else {
+var m__4231__auto____$1 = (cljs.core._dispatch_fn["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4231__auto____$1.call(null,mf));
+} else {
+throw cljs.core.missing_protocol("IMultiFn.-dispatch-fn",mf);
+}
+}
+}
+});
+
+cljs.core.throw_no_method_error = (function cljs$core$throw_no_method_error(name,dispatch_val){
+throw (new Error(["No method in multimethod '",cljs.core.str.cljs$core$IFn$_invoke$arity$1(name),"' for dispatch value: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val)].join('')));
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.IMultiFn}
+ * @implements {cljs.core.INamed}
+*/
+cljs.core.MultiFn = (function (name,dispatch_fn,default_dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy){
+this.name = name;
+this.dispatch_fn = dispatch_fn;
+this.default_dispatch_val = default_dispatch_val;
+this.hierarchy = hierarchy;
+this.method_table = method_table;
+this.prefer_table = prefer_table;
+this.method_cache = method_cache;
+this.cached_hierarchy = cached_hierarchy;
+this.cljs$lang$protocol_mask$partition0$ = 4194305;
+this.cljs$lang$protocol_mask$partition1$ = 4352;
+});
+cljs.core.MultiFn.prototype.call = (function() {
+var G__3254 = null;
+var G__3254__1 = (function (self__){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0() : self__.dispatch_fn.call(null));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$0 ? target_fn.cljs$core$IFn$_invoke$arity$0() : target_fn.call(null));
+});
+var G__3254__2 = (function (self__,a){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1(a) : self__.dispatch_fn.call(null,a));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$1 ? target_fn.cljs$core$IFn$_invoke$arity$1(a) : target_fn.call(null,a));
+});
+var G__3254__3 = (function (self__,a,b){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.dispatch_fn.call(null,a,b));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$2 ? target_fn.cljs$core$IFn$_invoke$arity$2(a,b) : target_fn.call(null,a,b));
+});
+var G__3254__4 = (function (self__,a,b,c){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.dispatch_fn.call(null,a,b,c));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$3 ? target_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : target_fn.call(null,a,b,c));
+});
+var G__3254__5 = (function (self__,a,b,c,d){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.dispatch_fn.call(null,a,b,c,d));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$4 ? target_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : target_fn.call(null,a,b,c,d));
+});
+var G__3254__6 = (function (self__,a,b,c,d,e){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.dispatch_fn.call(null,a,b,c,d,e));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$5 ? target_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : target_fn.call(null,a,b,c,d,e));
+});
+var G__3254__7 = (function (self__,a,b,c,d,e,f){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.dispatch_fn.call(null,a,b,c,d,e,f));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$6 ? target_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : target_fn.call(null,a,b,c,d,e,f));
+});
+var G__3254__8 = (function (self__,a,b,c,d,e,f,g){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$7 ? target_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : target_fn.call(null,a,b,c,d,e,f,g));
+});
+var G__3254__9 = (function (self__,a,b,c,d,e,f,g,h){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$8 ? target_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : target_fn.call(null,a,b,c,d,e,f,g,h));
+});
+var G__3254__10 = (function (self__,a,b,c,d,e,f,g,h,i){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$9 ? target_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : target_fn.call(null,a,b,c,d,e,f,g,h,i));
+});
+var G__3254__11 = (function (self__,a,b,c,d,e,f,g,h,i,j){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$10 ? target_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j));
+});
+var G__3254__12 = (function (self__,a,b,c,d,e,f,g,h,i,j,k){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$11 ? target_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
+});
+var G__3254__13 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$12 ? target_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+});
+var G__3254__14 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$13 ? target_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+});
+var G__3254__15 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$14 ? target_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+});
+var G__3254__16 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$15 ? target_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+});
+var G__3254__17 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$16 ? target_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+});
+var G__3254__18 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$17 ? target_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+});
+var G__3254__19 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$18 ? target_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+var G__3254__20 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$19 ? target_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+var G__3254__21 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$20 ? target_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+var G__3254__22 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var self____$1 = this;
+var mf = self____$1;
+var dispatch_val = cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.dispatch_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(target_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+G__3254 = function(self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+switch(arguments.length){
+case 1:
+return G__3254__1.call(this,self__);
+case 2:
+return G__3254__2.call(this,self__,a);
+case 3:
+return G__3254__3.call(this,self__,a,b);
+case 4:
+return G__3254__4.call(this,self__,a,b,c);
+case 5:
+return G__3254__5.call(this,self__,a,b,c,d);
+case 6:
+return G__3254__6.call(this,self__,a,b,c,d,e);
+case 7:
+return G__3254__7.call(this,self__,a,b,c,d,e,f);
+case 8:
+return G__3254__8.call(this,self__,a,b,c,d,e,f,g);
+case 9:
+return G__3254__9.call(this,self__,a,b,c,d,e,f,g,h);
+case 10:
+return G__3254__10.call(this,self__,a,b,c,d,e,f,g,h,i);
+case 11:
+return G__3254__11.call(this,self__,a,b,c,d,e,f,g,h,i,j);
+case 12:
+return G__3254__12.call(this,self__,a,b,c,d,e,f,g,h,i,j,k);
+case 13:
+return G__3254__13.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l);
+case 14:
+return G__3254__14.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m);
+case 15:
+return G__3254__15.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
+case 16:
+return G__3254__16.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
+case 17:
+return G__3254__17.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
+case 18:
+return G__3254__18.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
+case 19:
+return G__3254__19.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
+case 20:
+return G__3254__20.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
+case 21:
+return G__3254__21.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
+case 22:
+return G__3254__22.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__3254.cljs$core$IFn$_invoke$arity$1 = G__3254__1;
+G__3254.cljs$core$IFn$_invoke$arity$2 = G__3254__2;
+G__3254.cljs$core$IFn$_invoke$arity$3 = G__3254__3;
+G__3254.cljs$core$IFn$_invoke$arity$4 = G__3254__4;
+G__3254.cljs$core$IFn$_invoke$arity$5 = G__3254__5;
+G__3254.cljs$core$IFn$_invoke$arity$6 = G__3254__6;
+G__3254.cljs$core$IFn$_invoke$arity$7 = G__3254__7;
+G__3254.cljs$core$IFn$_invoke$arity$8 = G__3254__8;
+G__3254.cljs$core$IFn$_invoke$arity$9 = G__3254__9;
+G__3254.cljs$core$IFn$_invoke$arity$10 = G__3254__10;
+G__3254.cljs$core$IFn$_invoke$arity$11 = G__3254__11;
+G__3254.cljs$core$IFn$_invoke$arity$12 = G__3254__12;
+G__3254.cljs$core$IFn$_invoke$arity$13 = G__3254__13;
+G__3254.cljs$core$IFn$_invoke$arity$14 = G__3254__14;
+G__3254.cljs$core$IFn$_invoke$arity$15 = G__3254__15;
+G__3254.cljs$core$IFn$_invoke$arity$16 = G__3254__16;
+G__3254.cljs$core$IFn$_invoke$arity$17 = G__3254__17;
+G__3254.cljs$core$IFn$_invoke$arity$18 = G__3254__18;
+G__3254.cljs$core$IFn$_invoke$arity$19 = G__3254__19;
+G__3254.cljs$core$IFn$_invoke$arity$20 = G__3254__20;
+G__3254.cljs$core$IFn$_invoke$arity$21 = G__3254__21;
+G__3254.cljs$core$IFn$_invoke$arity$22 = G__3254__22;
+return G__3254;
+})()
+;
+
+cljs.core.MultiFn.prototype.apply = (function (self__,args3252){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args3252)));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$0 = (function (){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0() : self__.dispatch_fn.call(null));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$0 ? target_fn.cljs$core$IFn$_invoke$arity$0() : target_fn.call(null));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$1 = (function (a){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1(a) : self__.dispatch_fn.call(null,a));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$1 ? target_fn.cljs$core$IFn$_invoke$arity$1(a) : target_fn.call(null,a));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.dispatch_fn.call(null,a,b));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$2 ? target_fn.cljs$core$IFn$_invoke$arity$2(a,b) : target_fn.call(null,a,b));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$3 = (function (a,b,c){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.dispatch_fn.call(null,a,b,c));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$3 ? target_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : target_fn.call(null,a,b,c));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,d){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.dispatch_fn.call(null,a,b,c,d));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$4 ? target_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : target_fn.call(null,a,b,c,d));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$5 = (function (a,b,c,d,e){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.dispatch_fn.call(null,a,b,c,d,e));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$5 ? target_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : target_fn.call(null,a,b,c,d,e));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$6 = (function (a,b,c,d,e,f){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.dispatch_fn.call(null,a,b,c,d,e,f));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$6 ? target_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : target_fn.call(null,a,b,c,d,e,f));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$7 = (function (a,b,c,d,e,f,g){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$7 ? target_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : target_fn.call(null,a,b,c,d,e,f,g));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$8 = (function (a,b,c,d,e,f,g,h){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$8 ? target_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : target_fn.call(null,a,b,c,d,e,f,g,h));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$9 = (function (a,b,c,d,e,f,g,h,i){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$9 ? target_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : target_fn.call(null,a,b,c,d,e,f,g,h,i));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$10 = (function (a,b,c,d,e,f,g,h,i,j){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$10 ? target_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$11 = (function (a,b,c,d,e,f,g,h,i,j,k){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$11 ? target_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$12 = (function (a,b,c,d,e,f,g,h,i,j,k,l){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$12 ? target_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$13 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$13 ? target_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$14 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$14 ? target_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$15 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$15 ? target_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$16 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$16 ? target_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$17 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$17 ? target_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$18 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$18 ? target_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$19 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$19 ? target_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$20 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var mf = this;
+var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return (target_fn.cljs$core$IFn$_invoke$arity$20 ? target_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$21 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var mf = this;
+var dispatch_val = cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.dispatch_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
+if(cljs.core.truth_(target_fn)){
+} else {
+cljs.core.throw_no_method_error(self__.name,dispatch_val);
+}
+
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(target_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_prefer_method$arity$3 = (function (mf,dispatch_val_x,dispatch_val_y){
+var self__ = this;
+var mf__$1 = this;
+if(cljs.core.truth_(cljs.core.prefers_STAR_(dispatch_val_x,dispatch_val_y,self__.prefer_table))){
+throw (new Error(["Preference conflict in multimethod '",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.name),"': ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val_y)," is already preferred to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val_x)].join('')));
+} else {
+}
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.prefer_table,((function (mf__$1){
+return (function (old){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(old,dispatch_val_x,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(old,dispatch_val_x,cljs.core.PersistentHashSet.EMPTY),dispatch_val_y));
+});})(mf__$1))
+);
+
+return cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_default_dispatch_val$arity$1 = (function (mf){
+var self__ = this;
+var mf__$1 = this;
+return self__.default_dispatch_val;
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_remove_method$arity$2 = (function (mf,dispatch_val){
+var self__ = this;
+var mf__$1 = this;
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(self__.method_table,cljs.core.dissoc,dispatch_val);
+
+cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
+
+return mf__$1;
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_methods$arity$1 = (function (mf){
+var self__ = this;
+var mf__$1 = this;
+return cljs.core.deref(self__.method_table);
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_prefers$arity$1 = (function (mf){
+var self__ = this;
+var mf__$1 = this;
+return cljs.core.deref(self__.prefer_table);
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_dispatch_fn$arity$1 = (function (mf){
+var self__ = this;
+var mf__$1 = this;
+return self__.dispatch_fn;
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_add_method$arity$3 = (function (mf,dispatch_val,method){
+var self__ = this;
+var mf__$1 = this;
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(self__.method_table,cljs.core.assoc,dispatch_val,method);
+
+cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
+
+return mf__$1;
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_reset$arity$1 = (function (mf){
+var self__ = this;
+var mf__$1 = this;
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.method_table,((function (mf__$1){
+return (function (mf__$2){
+return cljs.core.PersistentArrayMap.EMPTY;
+});})(mf__$1))
+);
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.method_cache,((function (mf__$1){
+return (function (mf__$2){
+return cljs.core.PersistentArrayMap.EMPTY;
+});})(mf__$1))
+);
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.prefer_table,((function (mf__$1){
+return (function (mf__$2){
+return cljs.core.PersistentArrayMap.EMPTY;
+});})(mf__$1))
+);
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.cached_hierarchy,((function (mf__$1){
+return (function (mf__$2){
+return null;
+});})(mf__$1))
+);
+
+return mf__$1;
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_get_method$arity$2 = (function (mf,dispatch_val){
+var self__ = this;
+var mf__$1 = this;
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(self__.cached_hierarchy),cljs.core.deref(self__.hierarchy))){
+} else {
+cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
+}
+
+var temp__5455__auto__ = (function (){var fexpr__3253 = cljs.core.deref(self__.method_cache);
+return (fexpr__3253.cljs$core$IFn$_invoke$arity$1 ? fexpr__3253.cljs$core$IFn$_invoke$arity$1(dispatch_val) : fexpr__3253.call(null,dispatch_val));
+})();
+if(cljs.core.truth_(temp__5455__auto__)){
+var target_fn = temp__5455__auto__;
+return target_fn;
+} else {
+return cljs.core.find_and_cache_best_method(self__.name,dispatch_val,self__.hierarchy,self__.method_table,self__.prefer_table,self__.method_cache,self__.cached_hierarchy,self__.default_dispatch_val);
+}
+});
+
+cljs.core.MultiFn.prototype.cljs$core$INamed$_name$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return cljs.core._name(self__.name);
+});
+
+cljs.core.MultiFn.prototype.cljs$core$INamed$_namespace$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return cljs.core._namespace(self__.name);
+});
+
+cljs.core.MultiFn.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return goog.getUid(this$__$1);
+});
+
+cljs.core.MultiFn.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 8, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$name,cljs.core.cst$sym$dispatch_DASH_fn,cljs.core.cst$sym$default_DASH_dispatch_DASH_val,cljs.core.cst$sym$hierarchy,cljs.core.cst$sym$method_DASH_table,cljs.core.cst$sym$prefer_DASH_table,cljs.core.cst$sym$method_DASH_cache,cljs.core.cst$sym$cached_DASH_hierarchy], null);
+});
+
+cljs.core.MultiFn.cljs$lang$type = true;
+
+cljs.core.MultiFn.cljs$lang$ctorStr = "cljs.core/MultiFn";
+
+cljs.core.MultiFn.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/MultiFn");
+});
+
+/**
+ * Positional factory function for cljs.core/MultiFn.
+ */
+cljs.core.__GT_MultiFn = (function cljs$core$__GT_MultiFn(name,dispatch_fn,default_dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy){
+return (new cljs.core.MultiFn(name,dispatch_fn,default_dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy));
+});
+
+/**
+ * Removes all of the methods of multimethod.
+ */
+cljs.core.remove_all_methods = (function cljs$core$remove_all_methods(multifn){
+return cljs.core._reset(multifn);
+});
+/**
+ * Removes the method of multimethod associated with dispatch-value.
+ */
+cljs.core.remove_method = (function cljs$core$remove_method(multifn,dispatch_val){
+return cljs.core._remove_method(multifn,dispatch_val);
+});
+/**
+ * Causes the multimethod to prefer matches of dispatch-val-x over dispatch-val-y
+ * when there is a conflict
+ */
+cljs.core.prefer_method = (function cljs$core$prefer_method(multifn,dispatch_val_x,dispatch_val_y){
+return cljs.core._prefer_method(multifn,dispatch_val_x,dispatch_val_y);
+});
+/**
+ * Given a multimethod, returns a map of dispatch values -> dispatch fns
+ */
+cljs.core.methods$ = (function cljs$core$methods(multifn){
+return cljs.core._methods(multifn);
+});
+/**
+ * Given a multimethod and a dispatch value, returns the dispatch fn
+ *   that would apply to that value, or nil if none apply and no default
+ */
+cljs.core.get_method = (function cljs$core$get_method(multifn,dispatch_val){
+return cljs.core._get_method(multifn,dispatch_val);
+});
+/**
+ * Given a multimethod, returns a map of preferred value -> set of other values
+ */
+cljs.core.prefers = (function cljs$core$prefers(multifn){
+return cljs.core._prefers(multifn);
+});
+/**
+ * Given a multimethod, return it's default-dispatch-val.
+ */
+cljs.core.default_dispatch_val = (function cljs$core$default_dispatch_val(multifn){
+return cljs.core._default_dispatch_val(multifn);
+});
+/**
+ * Given a multimethod, return it's dispatch-fn.
+ */
+cljs.core.dispatch_fn = (function cljs$core$dispatch_fn(multifn){
+return cljs.core._dispatch_fn(multifn);
+});
+
+/**
+ * A marker protocol for UUIDs
+ * @interface
+ */
+cljs.core.IUUID = function(){};
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {cljs.core.IComparable}
+ * @implements {cljs.core.IUUID}
+*/
+cljs.core.UUID = (function (uuid,__hash){
+this.uuid = uuid;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 2153775104;
+this.cljs$lang$protocol_mask$partition1$ = 2048;
+});
+cljs.core.UUID.prototype.cljs$core$IUUID$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.UUID.prototype.toString = (function (){
+var self__ = this;
+var _ = this;
+return self__.uuid;
+});
+
+cljs.core.UUID.prototype.equiv = (function (other){
+var self__ = this;
+var this$ = this;
+return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
+});
+
+cljs.core.UUID.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+return (((other instanceof cljs.core.UUID)) && ((self__.uuid === other.uuid)));
+});
+
+cljs.core.UUID.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (_,writer,___$1){
+var self__ = this;
+var ___$2 = this;
+return cljs.core._write(writer,["#uuid \"",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.uuid),"\""].join(''));
+});
+
+cljs.core.UUID.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+if((self__.__hash == null)){
+self__.__hash = cljs.core.hash(self__.uuid);
+} else {
+}
+
+return self__.__hash;
+});
+
+cljs.core.UUID.prototype.cljs$core$IComparable$_compare$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+var G__3255 = self__.uuid;
+var G__3256 = other.uuid;
+return goog.array.defaultCompare(G__3255,G__3256);
+});
+
+cljs.core.UUID.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$uuid,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.core.UUID.cljs$lang$type = true;
+
+cljs.core.UUID.cljs$lang$ctorStr = "cljs.core/UUID";
+
+cljs.core.UUID.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/UUID");
+});
+
+/**
+ * Positional factory function for cljs.core/UUID.
+ */
+cljs.core.__GT_UUID = (function cljs$core$__GT_UUID(uuid,__hash){
+return (new cljs.core.UUID(uuid,__hash));
+});
+
+cljs.core.uuid = (function cljs$core$uuid(s){
+if(typeof s === 'string'){
+} else {
+throw (new Error("Assert failed: (string? s)"));
+}
+
+return (new cljs.core.UUID(s.toLowerCase(),null));
+});
+cljs.core.random_uuid = (function cljs$core$random_uuid(){
+var hex = (function cljs$core$random_uuid_$_hex(){
+return cljs.core.rand_int((16)).toString((16));
+});
+var rhex = ((8) | ((3) & cljs.core.rand_int((16)))).toString((16));
+return cljs.core.uuid([cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-",cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-","4",cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-",cljs.core.str.cljs$core$IFn$_invoke$arity$1(rhex),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-",cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex())].join(''));
+});
+cljs.core.uuid_QMARK_ = (function cljs$core$uuid_QMARK_(x){
+if(!((x == null))){
+if(((false) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IUUID$)))){
+return true;
+} else {
+return false;
+}
+} else {
+return false;
+}
+});
+cljs.core.pr_writer_ex_info = (function cljs$core$pr_writer_ex_info(obj,writer,opts){
+cljs.core._write(writer,"#error {:message ");
+
+cljs.core.pr_writer(obj.message,writer,opts);
+
+if(cljs.core.truth_(obj.data)){
+cljs.core._write(writer,", :data ");
+
+cljs.core.pr_writer(obj.data,writer,opts);
+} else {
+}
+
+if(cljs.core.truth_(obj.cause)){
+cljs.core._write(writer,", :cause ");
+
+cljs.core.pr_writer(obj.cause,writer,opts);
+} else {
+}
+
+return cljs.core._write(writer,"}");
+});
+/**
+ * @constructor
+ */
+cljs.core.ExceptionInfo = (function cljs$core$ExceptionInfo(message,data,cause){
+var e = (new Error(message));
+var this$ = this;
+this$.message = message;
+
+this$.data = data;
+
+this$.cause = cause;
+
+this$.name = e.name;
+
+this$.description = e.description;
+
+this$.number = e.number;
+
+this$.fileName = e.fileName;
+
+this$.lineNumber = e.lineNumber;
+
+this$.columnNumber = e.columnNumber;
+
+this$.stack = e.stack;
+
+return this$;
+});
+cljs.core.ExceptionInfo.prototype.__proto__ = Error.prototype;
+cljs.core.ExceptionInfo.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.core.ExceptionInfo.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (obj,writer,opts){
+var obj__$1 = this;
+return cljs.core.pr_writer_ex_info(obj__$1,writer,opts);
+});
+cljs.core.ExceptionInfo.prototype.toString = (function (){
+var this$ = this;
+return cljs.core.pr_str_STAR_(this$);
+});
+/**
+ * Create an instance of ExceptionInfo, an Error type that carries a
+ *   map of additional data.
+ */
+cljs.core.ex_info = (function cljs$core$ex_info(var_args){
+var G__3259 = arguments.length;
+switch (G__3259) {
+case 2:
+return cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2 = (function (msg,data){
+return cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3(msg,data,null);
+});
+
+cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3 = (function (msg,data,cause){
+return (new cljs.core.ExceptionInfo(msg,data,cause));
+});
+
+cljs.core.ex_info.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Returns exception data (a map) if ex is an ExceptionInfo.
+ *   Otherwise returns nil.
+ */
+cljs.core.ex_data = (function cljs$core$ex_data(ex){
+if((ex instanceof cljs.core.ExceptionInfo)){
+return ex.data;
+} else {
+return null;
+}
+});
+/**
+ * Returns the message attached to the given Error / ExceptionInfo object.
+ *   For non-Errors returns nil.
+ */
+cljs.core.ex_message = (function cljs$core$ex_message(ex){
+if((ex instanceof Error)){
+return ex.message;
+} else {
+return null;
+}
+});
+/**
+ * Returns exception cause (an Error / ExceptionInfo) if ex is an
+ *   ExceptionInfo.
+ *   Otherwise returns nil.
+ */
+cljs.core.ex_cause = (function cljs$core$ex_cause(ex){
+if((ex instanceof cljs.core.ExceptionInfo)){
+return ex.cause;
+} else {
+return null;
+}
+});
+/**
+ * Returns an JavaScript compatible comparator based upon pred.
+ */
+cljs.core.comparator = (function cljs$core$comparator(pred){
+return (function (x,y){
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$2 ? pred.cljs$core$IFn$_invoke$arity$2(x,y) : pred.call(null,x,y)))){
+return (-1);
+} else {
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$2 ? pred.cljs$core$IFn$_invoke$arity$2(y,x) : pred.call(null,y,x)))){
+return (1);
+} else {
+return (0);
+
+}
+}
+});
+});
+/**
+ * Returns true if x names a special form
+ */
+cljs.core.special_symbol_QMARK_ = (function cljs$core$special_symbol_QMARK_(x){
+return cljs.core.contains_QMARK_(new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 24, [cljs.core.cst$sym$_AMPERSAND_,null,cljs.core.cst$sym$case_STAR_,null,cljs.core.cst$sym$defrecord_STAR_,null,cljs.core.cst$sym$try,null,cljs.core.cst$sym$ns_STAR_,null,cljs.core.cst$sym$finally,null,cljs.core.cst$sym$loop_STAR_,null,cljs.core.cst$sym$do,null,cljs.core.cst$sym$letfn_STAR_,null,cljs.core.cst$sym$if,null,cljs.core.cst$sym$new,null,cljs.core.cst$sym$ns,null,cljs.core.cst$sym$deftype_STAR_,null,cljs.core.cst$sym$let_STAR_,null,cljs.core.cst$sym$js_STAR_,null,cljs.core.cst$sym$fn_STAR_,null,cljs.core.cst$sym$recur,null,cljs.core.cst$sym$set_BANG_,null,cljs.core.cst$sym$_DOT_,null,cljs.core.cst$sym$var,null,cljs.core.cst$sym$quote,null,cljs.core.cst$sym$catch,null,cljs.core.cst$sym$throw,null,cljs.core.cst$sym$def,null], null), null),x);
+});
+/**
+ * test [v] finds fn at key :test in var metadata and calls it,
+ *   presuming failure will throw exception
+ */
+cljs.core.test = (function cljs$core$test(v){
+var f = v.cljs$lang$test;
+if(cljs.core.truth_(f)){
+(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+
+return cljs.core.cst$kw$ok;
+} else {
+return cljs.core.cst$kw$no_DASH_test;
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.core.TaggedLiteral = (function (tag,form){
+this.tag = tag;
+this.form = form;
+this.cljs$lang$protocol_mask$partition0$ = 2153775360;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.TaggedLiteral.prototype.toString = (function (){
+var self__ = this;
+var coll = this;
+return cljs.core.pr_str_STAR_(coll);
+});
+
+cljs.core.TaggedLiteral.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (this$,other){
+var self__ = this;
+var this$__$1 = this;
+return (((other instanceof cljs.core.TaggedLiteral)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.tag,other.tag)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.form,other.form)));
+});
+
+cljs.core.TaggedLiteral.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return (((31) * cljs.core.hash(self__.tag)) + cljs.core.hash(self__.form));
+});
+
+cljs.core.TaggedLiteral.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (this$,v){
+var self__ = this;
+var this$__$1 = this;
+return this$__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
+});
+
+cljs.core.TaggedLiteral.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (this$,v,not_found){
+var self__ = this;
+var this$__$1 = this;
+var G__3261 = v;
+var G__3261__$1 = (((G__3261 instanceof cljs.core.Keyword))?G__3261.fqn:null);
+switch (G__3261__$1) {
+case "tag":
+return self__.tag;
+
+break;
+case "form":
+return self__.form;
+
+break;
+default:
+return not_found;
+
+}
+});
+
+cljs.core.TaggedLiteral.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (o,writer,opts){
+var self__ = this;
+var o__$1 = this;
+cljs.core._write(writer,["#",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.tag)," "].join(''));
+
+return cljs.core.pr_writer(self__.form,writer,opts);
+});
+
+cljs.core.TaggedLiteral.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$tag,cljs.core.cst$sym$form], null);
+});
+
+cljs.core.TaggedLiteral.cljs$lang$type = true;
+
+cljs.core.TaggedLiteral.cljs$lang$ctorStr = "cljs.core/TaggedLiteral";
+
+cljs.core.TaggedLiteral.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/TaggedLiteral");
+});
+
+/**
+ * Positional factory function for cljs.core/TaggedLiteral.
+ */
+cljs.core.__GT_TaggedLiteral = (function cljs$core$__GT_TaggedLiteral(tag,form){
+return (new cljs.core.TaggedLiteral(tag,form));
+});
+
+/**
+ * Return true if the value is the data representation of a tagged literal
+ */
+cljs.core.tagged_literal_QMARK_ = (function cljs$core$tagged_literal_QMARK_(value){
+return (value instanceof cljs.core.TaggedLiteral);
+});
+/**
+ * Construct a data representation of a tagged literal from a
+ *   tag symbol and a form.
+ */
+cljs.core.tagged_literal = (function cljs$core$tagged_literal(tag,form){
+if((tag instanceof cljs.core.Symbol)){
+} else {
+throw (new Error("Assert failed: (symbol? tag)"));
+}
+
+return (new cljs.core.TaggedLiteral(tag,form));
+});
+/**
+ * @type {*}
+ */
+cljs.core.js_reserved_arr = ["arguments","abstract","await","boolean","break","byte","case","catch","char","class","const","continue","debugger","default","delete","do","double","else","enum","export","extends","final","finally","float","for","function","goto","if","implements","import","in","instanceof","int","interface","let","long","native","new","package","private","protected","public","return","short","static","super","switch","synchronized","this","throw","throws","transient","try","typeof","var","void","volatile","while","with","yield","methods","null","constructor"];
+/**
+ * @type {null|Object}
+ */
+cljs.core.js_reserved = null;
+cljs.core.js_reserved_QMARK_ = (function cljs$core$js_reserved_QMARK_(x){
+if((cljs.core.js_reserved == null)){
+cljs.core.js_reserved = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__3263_SHARP_,p2__3264_SHARP_){
+goog.object.set(p1__3263_SHARP_,p2__3264_SHARP_,true);
+
+return p1__3263_SHARP_;
+}),({}),cljs.core.js_reserved_arr);
+} else {
+}
+
+return cljs.core.js_reserved.hasOwnProperty(x);
+});
+cljs.core.demunge_pattern = (function cljs$core$demunge_pattern(){
+if(cljs.core.truth_(cljs.core.DEMUNGE_PATTERN)){
+} else {
+cljs.core.DEMUNGE_PATTERN = (function (){var ks = cljs.core.sort.cljs$core$IFn$_invoke$arity$2((function (a,b){
+return (b.length - a.length);
+}),cljs.core.js_keys(cljs.core.DEMUNGE_MAP));
+var ks__$1 = ks;
+var ret = "";
+while(true){
+if(cljs.core.seq(ks__$1)){
+var G__3266 = cljs.core.next(ks__$1);
+var G__3267 = [cljs.core.str.cljs$core$IFn$_invoke$arity$1((function (){var G__3265 = ret;
+if(!((ret === ""))){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__3265),"|"].join('');
+} else {
+return G__3265;
+}
+})()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(ks__$1))].join('');
+ks__$1 = G__3266;
+ret = G__3267;
+continue;
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ret),"|\\$"].join('');
+}
+break;
+}
+})();
+}
+
+return cljs.core.DEMUNGE_PATTERN;
+});
+cljs.core.munge_str = (function cljs$core$munge_str(name){
+var sb = (new goog.string.StringBuffer());
+var i_3268 = (0);
+while(true){
+if((i_3268 < name.length)){
+var c_3269 = name.charAt(i_3268);
+var sub_3270 = goog.object.get(cljs.core.CHAR_MAP,c_3269);
+if(!((sub_3270 == null))){
+sb.append(sub_3270);
+} else {
+sb.append(c_3269);
+}
+
+var G__3271 = (i_3268 + (1));
+i_3268 = G__3271;
+continue;
+} else {
+}
+break;
+}
+
+return sb.toString();
+});
+cljs.core.munge = (function cljs$core$munge(name){
+var name_SINGLEQUOTE_ = cljs.core.munge_str([cljs.core.str.cljs$core$IFn$_invoke$arity$1(name)].join(''));
+var name_SINGLEQUOTE___$1 = (((name_SINGLEQUOTE_ === ".."))?"_DOT__DOT_":(cljs.core.truth_(cljs.core.js_reserved_QMARK_(name_SINGLEQUOTE_))?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(name_SINGLEQUOTE_),"$"].join(''):name_SINGLEQUOTE_
+));
+if((name instanceof cljs.core.Symbol)){
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(name_SINGLEQUOTE___$1);
+} else {
+return name_SINGLEQUOTE___$1;
+}
+});
+cljs.core.demunge_str = (function cljs$core$demunge_str(munged_name){
+var r = (new RegExp(cljs.core.demunge_pattern(),"g"));
+var munged_name__$1 = (cljs.core.truth_(goog.string.endsWith(munged_name,"$"))?munged_name.substring((0),(munged_name.length - (1))):munged_name);
+var ret = "";
+var last_match_end = (0);
+while(true){
+var temp__5455__auto__ = r.exec(munged_name__$1);
+if(cljs.core.truth_(temp__5455__auto__)){
+var match = temp__5455__auto__;
+var vec__3272 = match;
+var x = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3272,(0),null);
+var G__3275 = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ret),cljs.core.str.cljs$core$IFn$_invoke$arity$1(munged_name__$1.substring(last_match_end,(r.lastIndex - x.length))),cljs.core.str.cljs$core$IFn$_invoke$arity$1((((x === "$"))?"/":goog.object.get(cljs.core.DEMUNGE_MAP,x)))].join('');
+var G__3276 = r.lastIndex;
+ret = G__3275;
+last_match_end = G__3276;
+continue;
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ret),cljs.core.str.cljs$core$IFn$_invoke$arity$1(munged_name__$1.substring(last_match_end,munged_name__$1.length))].join('');
+}
+break;
+}
+});
+cljs.core.demunge = (function cljs$core$demunge(name){
+var G__3278 = (function (){var name_SINGLEQUOTE_ = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(name)].join('');
+if((name_SINGLEQUOTE_ === "_DOT__DOT_")){
+return "..";
+} else {
+return cljs.core.demunge_str(name_SINGLEQUOTE_);
+}
+})();
+var fexpr__3277 = (((name instanceof cljs.core.Symbol))?cljs.core.symbol:cljs.core.str);
+return (fexpr__3277.cljs$core$IFn$_invoke$arity$1 ? fexpr__3277.cljs$core$IFn$_invoke$arity$1(G__3278) : fexpr__3277.call(null,G__3278));
+});
+if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core.tapset !== 'undefined')){
+} else {
+/**
+ * @type {*}
+ */
+cljs.core.tapset = null;
+}
+cljs.core.maybe_init_tapset = (function cljs$core$maybe_init_tapset(){
+if((cljs.core.tapset == null)){
+return cljs.core.tapset = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentHashSet.EMPTY);
+} else {
+return null;
+}
+});
+/**
+ * Adds f, a fn of one argument, to the tap set. This function will be called with
+ *   anything sent via tap>. Remember f in order to remove-tap
+ */
+cljs.core.add_tap = (function cljs$core$add_tap(f){
+cljs.core.maybe_init_tapset();
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(cljs.core.tapset,cljs.core.conj,f);
+
+return null;
+});
+/**
+ * Remove f from the tap set.
+ */
+cljs.core.remove_tap = (function cljs$core$remove_tap(f){
+cljs.core.maybe_init_tapset();
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(cljs.core.tapset,cljs.core.disj,f);
+
+return null;
+});
+/**
+ * Sends x to any taps. Returns the result of *exec-tap-fn*, a Boolean value.
+ */
+cljs.core.tap_GT_ = (function cljs$core$tap_GT_(x){
+cljs.core.maybe_init_tapset();
+
+return (cljs.core._STAR_exec_tap_fn_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_exec_tap_fn_STAR_.cljs$core$IFn$_invoke$arity$1((function (){
+var seq__3279 = cljs.core.seq(cljs.core.deref(cljs.core.tapset));
+var chunk__3280 = null;
+var count__3281 = (0);
+var i__3282 = (0);
+while(true){
+if((i__3282 < count__3281)){
+var tap = chunk__3280.cljs$core$IIndexed$_nth$arity$2(null,i__3282);
+try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
+}catch (e3283){if((e3283 instanceof Error)){
+var ex_3285 = e3283;
+} else {
+throw e3283;
+
+}
+}
+
+var G__3286 = seq__3279;
+var G__3287 = chunk__3280;
+var G__3288 = count__3281;
+var G__3289 = (i__3282 + (1));
+seq__3279 = G__3286;
+chunk__3280 = G__3287;
+count__3281 = G__3288;
+i__3282 = G__3289;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__3279);
+if(temp__5457__auto__){
+var seq__3279__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__3279__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__3279__$1);
+var G__3290 = cljs.core.chunk_rest(seq__3279__$1);
+var G__3291 = c__4338__auto__;
+var G__3292 = cljs.core.count(c__4338__auto__);
+var G__3293 = (0);
+seq__3279 = G__3290;
+chunk__3280 = G__3291;
+count__3281 = G__3292;
+i__3282 = G__3293;
+continue;
+} else {
+var tap = cljs.core.first(seq__3279__$1);
+try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
+}catch (e3284){if((e3284 instanceof Error)){
+var ex_3294 = e3284;
+} else {
+throw e3284;
+
+}
+}
+
+var G__3295 = cljs.core.next(seq__3279__$1);
+var G__3296 = null;
+var G__3297 = (0);
+var G__3298 = (0);
+seq__3279 = G__3295;
+chunk__3280 = G__3296;
+count__3281 = G__3297;
+i__3282 = G__3298;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+})) : cljs.core._STAR_exec_tap_fn_STAR_.call(null,(function (){
+var seq__3279 = cljs.core.seq(cljs.core.deref(cljs.core.tapset));
+var chunk__3280 = null;
+var count__3281 = (0);
+var i__3282 = (0);
+while(true){
+if((i__3282 < count__3281)){
+var tap = chunk__3280.cljs$core$IIndexed$_nth$arity$2(null,i__3282);
+try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
+}catch (e3283){if((e3283 instanceof Error)){
+var ex_3299 = e3283;
+} else {
+throw e3283;
+
+}
+}
+
+var G__3300 = seq__3279;
+var G__3301 = chunk__3280;
+var G__3302 = count__3281;
+var G__3303 = (i__3282 + (1));
+seq__3279 = G__3300;
+chunk__3280 = G__3301;
+count__3281 = G__3302;
+i__3282 = G__3303;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__3279);
+if(temp__5457__auto__){
+var seq__3279__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__3279__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__3279__$1);
+var G__3304 = cljs.core.chunk_rest(seq__3279__$1);
+var G__3305 = c__4338__auto__;
+var G__3306 = cljs.core.count(c__4338__auto__);
+var G__3307 = (0);
+seq__3279 = G__3304;
+chunk__3280 = G__3305;
+count__3281 = G__3306;
+i__3282 = G__3307;
+continue;
+} else {
+var tap = cljs.core.first(seq__3279__$1);
+try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
+}catch (e3284){if((e3284 instanceof Error)){
+var ex_3308 = e3284;
+} else {
+throw e3284;
+
+}
+}
+
+var G__3309 = cljs.core.next(seq__3279__$1);
+var G__3310 = null;
+var G__3311 = (0);
+var G__3312 = (0);
+seq__3279 = G__3309;
+chunk__3280 = G__3310;
+count__3281 = G__3311;
+i__3282 = G__3312;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+})));
+});
+/**
+ * Bootstrap only.
+ */
+cljs.core.ns_lookup = (function cljs$core$ns_lookup(ns_obj,k){
+return (function (){
+return goog.object.get(ns_obj,k);
+});
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+*/
+cljs.core.Namespace = (function (obj,name){
+this.obj = obj;
+this.name = name;
+this.cljs$lang$protocol_mask$partition0$ = 6291456;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+cljs.core.Namespace.prototype.findInternedVar = (function (sym){
+var self__ = this;
+var this$ = this;
+var k = cljs.core.munge([cljs.core.str.cljs$core$IFn$_invoke$arity$1(sym)].join(''));
+if(goog.object.containsKey(self__.obj,k)){
+var var_sym = cljs.core.symbol.cljs$core$IFn$_invoke$arity$2([cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.name)].join(''),[cljs.core.str.cljs$core$IFn$_invoke$arity$1(sym)].join(''));
+var var_meta = new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$ns,this$], null);
+return (new cljs.core.Var(cljs.core.ns_lookup(self__.obj,k),var_sym,var_meta));
+} else {
+return null;
+}
+});
+
+cljs.core.Namespace.prototype.getName = (function (){
+var self__ = this;
+var _ = this;
+return self__.name;
+});
+
+cljs.core.Namespace.prototype.toString = (function (){
+var self__ = this;
+var _ = this;
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.name)].join('');
+});
+
+cljs.core.Namespace.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+if((other instanceof cljs.core.Namespace)){
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.name,other.name);
+} else {
+return false;
+}
+});
+
+cljs.core.Namespace.prototype.cljs$core$IHash$_hash$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.hash(self__.name);
+});
+
+cljs.core.Namespace.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$obj,cljs.core.cst$sym$name], null);
+});
+
+cljs.core.Namespace.cljs$lang$type = true;
+
+cljs.core.Namespace.cljs$lang$ctorStr = "cljs.core/Namespace";
+
+cljs.core.Namespace.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.core/Namespace");
+});
+
+/**
+ * Positional factory function for cljs.core/Namespace.
+ */
+cljs.core.__GT_Namespace = (function cljs$core$__GT_Namespace(obj,name){
+return (new cljs.core.Namespace(obj,name));
+});
+
+/**
+ * Bootstrap only.
+ * @type {*}
+ */
+cljs.core.NS_CACHE = null;
+/**
+ * Bootstrap only.
+ */
+cljs.core.find_ns_obj_STAR_ = (function cljs$core$find_ns_obj_STAR_(ctxt,xs){
+while(true){
+if((ctxt == null)){
+return null;
+} else {
+if((xs == null)){
+return ctxt;
+} else {
+var G__3315 = (function (){var G__3313 = ctxt;
+var G__3314 = cljs.core.first(xs);
+return goog.object.get(G__3313,G__3314);
+})();
+var G__3316 = cljs.core.next(xs);
+ctxt = G__3315;
+xs = G__3316;
+continue;
+
+}
+}
+break;
+}
+});
+/**
+ * Bootstrap only.
+ */
+cljs.core.find_ns_obj = (function cljs$core$find_ns_obj(ns){
+var munged_ns = cljs.core.munge([cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns)].join(''));
+var segs = munged_ns.split(".");
+var G__3317 = cljs.core._STAR_target_STAR_;
+switch (G__3317) {
+case "nodejs":
+if(COMPILED){
+return cljs.core.find_ns_obj_STAR_((function (){try{var ctxt = eval(cljs.core.first(segs));
+if(cljs.core.truth_((function (){var and__3925__auto__ = ctxt;
+if(cljs.core.truth_(and__3925__auto__)){
+return cljs.core.object_QMARK_(ctxt);
+} else {
+return and__3925__auto__;
+}
+})())){
+return ctxt;
+} else {
+return null;
+}
+}catch (e3318){if((e3318 instanceof ReferenceError)){
+var e = e3318;
+return null;
+} else {
+throw e3318;
+
+}
+}})(),cljs.core.next(segs));
+} else {
+return cljs.core.find_ns_obj_STAR_(goog.global,segs);
+}
+
+break;
+case "default":
+case "webworker":
+return cljs.core.find_ns_obj_STAR_(goog.global,segs);
+
+break;
+default:
+throw (new Error(["find-ns-obj not supported for target ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core._STAR_target_STAR_)].join('')));
+
+}
+});
+/**
+ * Returns a map of the intern mappings for the namespace.
+ *   Bootstrap only.
+ */
+cljs.core.ns_interns_STAR_ = (function cljs$core$ns_interns_STAR_(sym){
+var ns_obj = cljs.core.find_ns_obj(sym);
+var ns = (new cljs.core.Namespace(ns_obj,sym));
+var step = ((function (ns_obj,ns){
+return (function cljs$core$ns_interns_STAR__$_step(ret,k){
+var var_sym = cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(cljs.core.demunge(k));
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(ret,var_sym,(new cljs.core.Var(((function (var_sym,ns_obj,ns){
+return (function (){
+return goog.object.get(ns_obj,k);
+});})(var_sym,ns_obj,ns))
+,cljs.core.symbol.cljs$core$IFn$_invoke$arity$2([cljs.core.str.cljs$core$IFn$_invoke$arity$1(sym)].join(''),[cljs.core.str.cljs$core$IFn$_invoke$arity$1(var_sym)].join('')),new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$ns,ns], null))));
+});})(ns_obj,ns))
+;
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(step,cljs.core.PersistentArrayMap.EMPTY,cljs.core.js_keys(ns_obj));
+});
+/**
+ * Create a new namespace named by the symbol. Bootstrap only.
+ */
+cljs.core.create_ns = (function cljs$core$create_ns(var_args){
+var G__3321 = arguments.length;
+switch (G__3321) {
+case 1:
+return cljs.core.create_ns.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.core.create_ns.cljs$core$IFn$_invoke$arity$1 = (function (sym){
+return cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2(sym,cljs.core.find_ns_obj(sym));
+});
+
+cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2 = (function (sym,ns_obj){
+return (new cljs.core.Namespace(ns_obj,sym));
+});
+
+cljs.core.create_ns.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns the namespace named by the symbol or nil if it doesn't exist.
+ *   Bootstrap only.
+ */
+cljs.core.find_ns = (function cljs$core$find_ns(ns){
+if((cljs.core.NS_CACHE == null)){
+cljs.core.NS_CACHE = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+} else {
+}
+
+var the_ns = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.NS_CACHE),ns);
+if(!((the_ns == null))){
+return the_ns;
+} else {
+var ns_obj = cljs.core.find_ns_obj(ns);
+if((ns_obj == null)){
+return null;
+} else {
+var new_ns = cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2(ns,ns_obj);
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(cljs.core.NS_CACHE,cljs.core.assoc,ns,new_ns);
+
+return new_ns;
+}
+}
+});
+/**
+ * Returns the macros namespace named by the symbol or nil if it doesn't exist.
+ *   Bootstrap only.
+ */
+cljs.core.find_macros_ns = (function cljs$core$find_macros_ns(ns){
+if((cljs.core.NS_CACHE == null)){
+cljs.core.NS_CACHE = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+} else {
+}
+
+var ns_str = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns)].join('');
+var ns__$1 = ((!(goog.string.contains(ns_str,"$macros")))?cljs.core.symbol.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns_str),"$macros"].join('')):ns);
+var the_ns = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.NS_CACHE),ns__$1);
+if(!((the_ns == null))){
+return the_ns;
+} else {
+var ns_obj = cljs.core.find_ns_obj(ns__$1);
+if((ns_obj == null)){
+return null;
+} else {
+var new_ns = cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2(ns__$1,ns_obj);
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(cljs.core.NS_CACHE,cljs.core.assoc,ns__$1,new_ns);
+
+return new_ns;
+}
+}
+});
+/**
+ * Returns the name of the namespace, a Namespace object.
+ *   Bootstrap only.
+ */
+cljs.core.ns_name = (function cljs$core$ns_name(ns_obj){
+return ns_obj.name;
+});
+/**
+ * Returns true x is a goog.Uri instance.
+ */
+cljs.core.uri_QMARK_ = (function cljs$core$uri_QMARK_(x){
+return (x instanceof goog.Uri);
+});
+cljs.core.maybe_enable_print_BANG_ = (function cljs$core$maybe_enable_print_BANG_(){
+if((typeof console !== 'undefined')){
+return cljs.core.enable_console_print_BANG_();
+} else {
+if((cljs.core._STAR_target_STAR_ === "nashorn")){
+var system = Java.type("java.lang.System");
+cljs.core._STAR_print_newline_STAR_ = false;
+
+cljs.core.set_print_fn_BANG_(((function (system){
+return (function (){
+var xs = arguments;
+var s = goog.array.clone(xs).join("");
+return system.out.println(s);
+});})(system))
+);
+
+return cljs.core.set_print_err_fn_BANG_(((function (system){
+return (function (){
+var xs = arguments;
+var s = goog.array.clone(xs).join("");
+return system.error.println(s);
+});})(system))
+);
+} else {
+return null;
+}
+}
+});
+cljs.core.maybe_enable_print_BANG_();
+if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_eval_STAR_ !== 'undefined')){
+} else {
+/**
+ * Runtime environments may provide a way to evaluate ClojureScript
+ *   forms. Whatever function *eval* is bound to will be passed any forms which
+ *   should be evaluated.
+ */
+cljs.core._STAR_eval_STAR_ = (function cljs$core$_STAR_eval_STAR_(_){
+throw (new Error("cljs.core/*eval* not bound"));
+});
+}
+/**
+ * Evaluates the form data structure (not text!) and returns the result.
+ *   Delegates to cljs.core/*eval*. Intended for use in self-hosted ClojureScript,
+ *   which sets up an implementation of cljs.core/*eval* for that environment.
+ */
+cljs.core.eval = (function cljs$core$eval(form){
+return (cljs.core._STAR_eval_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_eval_STAR_.cljs$core$IFn$_invoke$arity$1(form) : cljs.core._STAR_eval_STAR_.call(null,form));
+});
diff --git a/js/cljs/core/constants.js b/js/cljs/core/constants.js
new file mode 100644
index 0000000..d7fcc7d
--- /dev/null
+++ b/js/cljs/core/constants.js
@@ -0,0 +1,392 @@
+goog.provide('cljs.core.constants');
+goog.require('cljs.core');
+cljs.core.cst$sym$form = new cljs.core.Symbol(null,"form","form",16469056,null);
+cljs.core.cst$kw$dyn_DASH_v = new cljs.core.Keyword(null,"dyn-v","dyn-v",949994592);
+cljs.core.cst$sym$tag = new cljs.core.Symbol(null,"tag","tag",350170304,null);
+cljs.core.cst$sym$_AMPERSAND_ = new cljs.core.Symbol(null,"&","&",-2144855648,null);
+cljs.core.cst$kw$unnamed = new cljs.core.Keyword(null,"unnamed","unnamed",-26044928);
+cljs.core.cst$sym$uuid = new cljs.core.Symbol(null,"uuid","uuid",-504564192,null);
+cljs.core.cst$kw$path = new cljs.core.Keyword(null,"path","path",-188191168);
+cljs.core.cst$kw$features = new cljs.core.Keyword(null,"features","features",-1146962336);
+cljs.core.cst$kw$add_DASH_event = new cljs.core.Keyword(null,"add-event","add-event",938429088);
+cljs.core.cst$sym$case_STAR_ = new cljs.core.Symbol(null,"case*","case*",-1938255072,null);
+cljs.core.cst$kw$ex_DASH_kind = new cljs.core.Keyword(null,"ex-kind","ex-kind",1581199296);
+cljs.core.cst$kw$yield = new cljs.core.Keyword(null,"yield","yield",177875009);
+cljs.core.cst$sym$end = new cljs.core.Symbol(null,"end","end",1372345569,null);
+cljs.core.cst$kw$tags = new cljs.core.Keyword(null,"tags","tags",1771418977);
+cljs.core.cst$sym$defrecord_STAR_ = new cljs.core.Symbol(null,"defrecord*","defrecord*",-1936366207,null);
+cljs.core.cst$sym$base = new cljs.core.Symbol(null,"base","base",1825810849,null);
+cljs.core.cst$sym$obj = new cljs.core.Symbol(null,"obj","obj",-1672671807,null);
+cljs.core.cst$sym$post_DASH_event_DASH_callback_DASH_fns = new cljs.core.Symbol(null,"post-event-callback-fns","post-event-callback-fns",-297038335,null);
+cljs.core.cst$sym$fqn = new cljs.core.Symbol(null,"fqn","fqn",-1749334463,null);
+cljs.core.cst$sym$first = new cljs.core.Symbol(null,"first","first",996428481,null);
+cljs.core.cst$kw$reader_DASH_error = new cljs.core.Keyword(null,"reader-error","reader-error",1610253121);
+cljs.core.cst$kw$paused = new cljs.core.Keyword(null,"paused","paused",-1710376127);
+cljs.core.cst$sym$try = new cljs.core.Symbol(null,"try","try",-1273693247,null);
+cljs.core.cst$sym$has_DASH_nil_QMARK_ = new cljs.core.Symbol(null,"has-nil?","has-nil?",825886722,null);
+cljs.core.cst$kw$errors = new cljs.core.Keyword(null,"errors","errors",-908790718);
+cljs.core.cst$kw$on_DASH_set = new cljs.core.Keyword(null,"on-set","on-set",-140953470);
+cljs.core.cst$sym$caught = new cljs.core.Symbol(null,"caught","caught",2084008322,null);
+cljs.core.cst$kw$block = new cljs.core.Keyword(null,"block","block",664686210);
+cljs.core.cst$sym$rear = new cljs.core.Symbol(null,"rear","rear",-900164830,null);
+cljs.core.cst$sym$hierarchy = new cljs.core.Symbol(null,"hierarchy","hierarchy",587061186,null);
+cljs.core.cst$sym$iter = new cljs.core.Symbol(null,"iter","iter",-1346195486,null);
+cljs.core.cst$sym$clojure$core_SLASH_list = new cljs.core.Symbol("clojure.core","list","clojure.core/list",-1119203325,null);
+cljs.core.cst$sym$watching = new cljs.core.Symbol(null,"watching","watching",1947648227,null);
+cljs.core.cst$kw$cljsLegacyRender = new cljs.core.Keyword(null,"cljsLegacyRender","cljsLegacyRender",-1527295613);
+cljs.core.cst$sym$step = new cljs.core.Symbol(null,"step","step",-1365547645,null);
+cljs.core.cst$kw$sub_SLASH_run = new cljs.core.Keyword("sub","run","sub/run",-1821315581);
+cljs.core.cst$sym$boolean = new cljs.core.Symbol(null,"boolean","boolean",-278886877,null);
+cljs.core.cst$sym$update_DASH_count = new cljs.core.Symbol(null,"update-count","update-count",-411982269,null);
+cljs.core.cst$sym$reaction = new cljs.core.Symbol(null,"reaction","reaction",2131401315,null);
+cljs.core.cst$sym$method_DASH_table = new cljs.core.Symbol(null,"method-table","method-table",-1878263165,null);
+cljs.core.cst$sym$chunk = new cljs.core.Symbol(null,"chunk","chunk",449371907,null);
+cljs.core.cst$kw$idle = new cljs.core.Keyword(null,"idle","idle",-2007156861);
+cljs.core.cst$sym$callback = new cljs.core.Symbol(null,"callback","callback",935395299,null);
+cljs.core.cst$kw$cause = new cljs.core.Keyword(null,"cause","cause",231901252);
+cljs.core.cst$kw$app_DASH_db_DASH_after = new cljs.core.Keyword(null,"app-db-after","app-db-after",1477492964);
+cljs.core.cst$kw$current_DASH_state = new cljs.core.Keyword(null,"current-state","current-state",1048284452);
+cljs.core.cst$sym$i = new cljs.core.Symbol(null,"i","i",253690212,null);
+cljs.core.cst$kw$new_DASH_state = new cljs.core.Keyword(null,"new-state","new-state",-490349212);
+cljs.core.cst$sym$rest = new cljs.core.Symbol(null,"rest","rest",398835108,null);
+cljs.core.cst$kw$namespaced_DASH_map = new cljs.core.Keyword(null,"namespaced-map","namespaced-map",1235665380);
+cljs.core.cst$kw$group = new cljs.core.Keyword(null,"group","group",582596132);
+cljs.core.cst$kw$meta = new cljs.core.Keyword(null,"meta","meta",1499536964);
+cljs.core.cst$sym$s_DASH_pos = new cljs.core.Symbol(null,"s-pos","s-pos",-540562492,null);
+cljs.core.cst$sym$gateway_DASH_url = new cljs.core.Symbol(null,"gateway-url","gateway-url",-1608204283,null);
+cljs.core.cst$kw$ul = new cljs.core.Keyword(null,"ul","ul",-1349521403);
+cljs.core.cst$kw$dup = new cljs.core.Keyword(null,"dup","dup",556298533);
+cljs.core.cst$sym$view = new cljs.core.Symbol(null,"view","view",-1406440955,null);
+cljs.core.cst$kw$key = new cljs.core.Keyword(null,"key","key",-1516042587);
+cljs.core.cst$kw$fsm_DASH_state = new cljs.core.Keyword(null,"fsm-state","fsm-state",1656310533);
+cljs.core.cst$sym$comp = new cljs.core.Symbol(null,"comp","comp",-1462482139,null);
+cljs.core.cst$sym$cljs$core_SLASH_array_DASH_map = new cljs.core.Symbol("cljs.core","array-map","cljs.core/array-map",-1519210683,null);
+cljs.core.cst$sym$dispatch_DASH_fn = new cljs.core.Symbol(null,"dispatch-fn","dispatch-fn",-1401088155,null);
+cljs.core.cst$sym$buffer = new cljs.core.Symbol(null,"buffer","buffer",-2037140571,null);
+cljs.core.cst$sym$text = new cljs.core.Symbol(null,"text","text",-150030170,null);
+cljs.core.cst$sym$prev_DASH_column = new cljs.core.Symbol(null,"prev-column","prev-column",324083974,null);
+cljs.core.cst$kw$reader_DASH_exception = new cljs.core.Keyword(null,"reader-exception","reader-exception",-1938323098);
+cljs.core.cst$kw$else = new cljs.core.Keyword(null,"else","else",-1508377146);
+cljs.core.cst$kw$invalid_DASH_namespaces = new cljs.core.Keyword(null,"invalid-namespaces","invalid-namespaces",-935340538);
+cljs.core.cst$kw$_LT__DASH_ = new cljs.core.Keyword(null,"<-","<-",760412998);
+cljs.core.cst$sym$left = new cljs.core.Symbol(null,"left","left",1241415590,null);
+cljs.core.cst$sym$ns_STAR_ = new cljs.core.Symbol(null,"ns*","ns*",1840949383,null);
+cljs.core.cst$kw$offset = new cljs.core.Keyword(null,"offset","offset",296498311);
+cljs.core.cst$sym$path = new cljs.core.Symbol(null,"path","path",1452340359,null);
+cljs.core.cst$kw$cljs$core_SLASH_none = new cljs.core.Keyword("cljs.core","none","cljs.core/none",926646439);
+cljs.core.cst$sym$shift = new cljs.core.Symbol(null,"shift","shift",-1657295705,null);
+cljs.core.cst$sym$cljs$core_SLASH_hash_DASH_map = new cljs.core.Symbol("cljs.core","hash-map","cljs.core/hash-map",303385767,null);
+cljs.core.cst$sym$iters = new cljs.core.Symbol(null,"iters","iters",719353031,null);
+cljs.core.cst$kw$button = new cljs.core.Keyword(null,"button","button",1456579943);
+cljs.core.cst$kw$db = new cljs.core.Keyword(null,"db","db",993250759);
+cljs.core.cst$kw$unknown_DASH_block_DASH_type = new cljs.core.Keyword(null,"unknown-block-type","unknown-block-type",-507846201);
+cljs.core.cst$kw$fx_DASH_handler = new cljs.core.Keyword(null,"fx-handler","fx-handler",-549783097);
+cljs.core.cst$kw$sub = new cljs.core.Keyword(null,"sub","sub",-2093760025);
+cljs.core.cst$sym$cljs$core_SLASH_apply = new cljs.core.Symbol("cljs.core","apply","cljs.core/apply",1757277831,null);
+cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_not_DASH_found = new cljs.core.Keyword("re-frame.std-interceptors","not-found","re-frame.std-interceptors/not-found",-1614827865);
+cljs.core.cst$kw$queue = new cljs.core.Keyword(null,"queue","queue",1455835879);
+cljs.core.cst$kw$displayName = new cljs.core.Keyword(null,"displayName","displayName",-809144601);
+cljs.core.cst$sym$args = new cljs.core.Symbol(null,"args","args",-1338879193,null);
+cljs.core.cst$sym$xform = new cljs.core.Symbol(null,"xform","xform",-85179481,null);
+cljs.core.cst$kw$validator = new cljs.core.Keyword(null,"validator","validator",-1966190681);
+cljs.core.cst$sym$finally = new cljs.core.Symbol(null,"finally","finally",-1065347064,null);
+cljs.core.cst$kw$sub_SLASH_create = new cljs.core.Keyword("sub","create","sub/create",-1301317560);
+cljs.core.cst$kw$content = new cljs.core.Keyword(null,"content","content",15833224);
+cljs.core.cst$kw$default = new cljs.core.Keyword(null,"default","default",-1987822328);
+cljs.core.cst$kw$sequential = new cljs.core.Keyword(null,"sequential","sequential",-1082983960);
+cljs.core.cst$sym$prefer_DASH_table = new cljs.core.Symbol(null,"prefer-table","prefer-table",462168584,null);
+cljs.core.cst$sym$loop_STAR_ = new cljs.core.Symbol(null,"loop*","loop*",615029416,null);
+cljs.core.cst$sym$watches = new cljs.core.Symbol(null,"watches","watches",1367433992,null);
+cljs.core.cst$kw$ns = new cljs.core.Keyword(null,"ns","ns",441598760);
+cljs.core.cst$kw$symbol = new cljs.core.Keyword(null,"symbol","symbol",-1038572696);
+cljs.core.cst$kw$warn = new cljs.core.Keyword(null,"warn","warn",-436710552);
+cljs.core.cst$kw$name = new cljs.core.Keyword(null,"name","name",1843675177);
+cljs.core.cst$kw$events = new cljs.core.Keyword(null,"events","events",1792552201);
+cljs.core.cst$sym$NaN = new cljs.core.Symbol(null,"NaN","NaN",666918153,null);
+cljs.core.cst$sym$rdr = new cljs.core.Symbol(null,"rdr","rdr",190007785,null);
+cljs.core.cst$kw$li = new cljs.core.Keyword(null,"li","li",723558921);
+cljs.core.cst$sym$bitmap = new cljs.core.Symbol(null,"bitmap","bitmap",501334601,null);
+cljs.core.cst$sym$_seq = new cljs.core.Symbol(null,"_seq","_seq",-449557847,null);
+cljs.core.cst$kw$views_SLASH_main = new cljs.core.Keyword("views","main","views/main",-1995108663);
+cljs.core.cst$sym$nil_DASH_val = new cljs.core.Symbol(null,"nil-val","nil-val",-513933559,null);
+cljs.core.cst$kw$value = new cljs.core.Keyword(null,"value","value",305978217);
+cljs.core.cst$kw$child_DASH_of = new cljs.core.Keyword(null,"child-of","child-of",-903376662);
+cljs.core.cst$sym$let = new cljs.core.Symbol(null,"let","let",358118826,null);
+cljs.core.cst$kw$file = new cljs.core.Keyword(null,"file","file",-1269645878);
+cljs.core.cst$sym$cljs$core_SLASH_concat = new cljs.core.Symbol("cljs.core","concat","cljs.core/concat",-1133584918,null);
+cljs.core.cst$kw$re_DASH_frame$router_SLASH_fsm_DASH_trigger = new cljs.core.Keyword("re-frame.router","fsm-trigger","re-frame.router/fsm-trigger",1379787274);
+cljs.core.cst$sym$v = new cljs.core.Symbol(null,"v","v",1661996586,null);
+cljs.core.cst$kw$operation = new cljs.core.Keyword(null,"operation","operation",-1267664310);
+cljs.core.cst$kw$valid_DASH_hooks = new cljs.core.Keyword(null,"valid-hooks","valid-hooks",-1178341686);
+cljs.core.cst$kw$do_DASH_fx = new cljs.core.Keyword(null,"do-fx","do-fx",1194163050);
+cljs.core.cst$kw$end_DASH_column = new cljs.core.Keyword(null,"end-column","end-column",1425389514);
+cljs.core.cst$sym$riter = new cljs.core.Symbol(null,"riter","riter",-237834262,null);
+cljs.core.cst$sym$__hash = new cljs.core.Symbol(null,"__hash","__hash",-1328796629,null);
+cljs.core.cst$sym$meta = new cljs.core.Symbol(null,"meta","meta",-1154898805,null);
+cljs.core.cst$sym$_meta = new cljs.core.Symbol(null,"_meta","_meta",-1716892533,null);
+cljs.core.cst$kw$start = new cljs.core.Keyword(null,"start","start",-355208981);
+cljs.core.cst$kw$app_DASH_db_DASH_before = new cljs.core.Keyword(null,"app-db-before","app-db-before",-1442902645);
+cljs.core.cst$sym$afn = new cljs.core.Symbol(null,"afn","afn",216963467,null);
+cljs.core.cst$kw$hooks_SLASH_main = new cljs.core.Keyword("hooks","main","hooks/main",-1948863093);
+cljs.core.cst$sym$tree = new cljs.core.Symbol(null,"tree","tree",1444219499,null);
+cljs.core.cst$sym$fn = new cljs.core.Symbol(null,"fn","fn",465265323,null);
+cljs.core.cst$sym$front = new cljs.core.Symbol(null,"front","front",117022539,null);
+cljs.core.cst$sym$buf = new cljs.core.Symbol(null,"buf","buf",1426618187,null);
+cljs.core.cst$kw$component_DASH_did_DASH_update = new cljs.core.Keyword(null,"component-did-update","component-did-update",-1468549173);
+cljs.core.cst$sym$next_DASH_entry = new cljs.core.Symbol(null,"next-entry","next-entry",1091342476,null);
+cljs.core.cst$kw$read_DASH_cond = new cljs.core.Keyword(null,"read-cond","read-cond",1056899244);
+cljs.core.cst$kw$val = new cljs.core.Keyword(null,"val","val",128701612);
+cljs.core.cst$sym$key = new cljs.core.Symbol(null,"key","key",124488940,null);
+cljs.core.cst$kw$dispatch_DASH_n = new cljs.core.Keyword(null,"dispatch-n","dispatch-n",-504469236);
+cljs.core.cst$sym$_next = new cljs.core.Symbol(null,"_next","_next",101877036,null);
+cljs.core.cst$sym$fsm_DASH_state = new cljs.core.Symbol(null,"fsm-state","fsm-state",-998125236,null);
+cljs.core.cst$kw$type = new cljs.core.Keyword(null,"type","type",1174270348);
+cljs.core.cst$kw$unknown_DASH_view = new cljs.core.Keyword(null,"unknown-view","unknown-view",-324262388);
+cljs.core.cst$sym$root_DASH_iter = new cljs.core.Symbol(null,"root-iter","root-iter",1974672108,null);
+cljs.core.cst$sym$do = new cljs.core.Symbol(null,"do","do",1686842252,null);
+cljs.core.cst$sym$vec = new cljs.core.Symbol(null,"vec","vec",982683596,null);
+cljs.core.cst$kw$duration = new cljs.core.Keyword(null,"duration","duration",1444101068);
+cljs.core.cst$kw$debug = new cljs.core.Keyword(null,"debug","debug",-1608172596);
+cljs.core.cst$sym$when = new cljs.core.Symbol(null,"when","when",1064114221,null);
+cljs.core.cst$kw$query_DASH_v = new cljs.core.Keyword(null,"query-v","query-v",-1514170131);
+cljs.core.cst$kw$preserve = new cljs.core.Keyword(null,"preserve","preserve",1276846509);
+cljs.core.cst$kw$fallback_DASH_impl = new cljs.core.Keyword(null,"fallback-impl","fallback-impl",-1501286995);
+cljs.core.cst$kw$keyword_DASH_fn = new cljs.core.Keyword(null,"keyword-fn","keyword-fn",-64566675);
+cljs.core.cst$sym$Inf = new cljs.core.Symbol(null,"Inf","Inf",647172781,null);
+cljs.core.cst$kw$source = new cljs.core.Keyword(null,"source","source",-433931539);
+cljs.core.cst$kw$flush_DASH_on_DASH_newline = new cljs.core.Keyword(null,"flush-on-newline","flush-on-newline",-151457939);
+cljs.core.cst$kw$env = new cljs.core.Keyword(null,"env","env",-1815813235);
+cljs.core.cst$sym$default_DASH_dispatch_DASH_val = new cljs.core.Symbol(null,"default-dispatch-val","default-dispatch-val",-1231201266,null);
+cljs.core.cst$kw$componentWillUnmount = new cljs.core.Keyword(null,"componentWillUnmount","componentWillUnmount",1573788814);
+cljs.core.cst$kw$no_DASH_test = new cljs.core.Keyword(null,"no-test","no-test",-1679482642);
+cljs.core.cst$kw$string = new cljs.core.Keyword(null,"string","string",-1989541586);
+cljs.core.cst$sym$queue = new cljs.core.Symbol(null,"queue","queue",-1198599890,null);
+cljs.core.cst$kw$vector = new cljs.core.Keyword(null,"vector","vector",1902966158);
+cljs.core.cst$sym$validator = new cljs.core.Symbol(null,"validator","validator",-325659154,null);
+cljs.core.cst$kw$extra_DASH_properties = new cljs.core.Keyword(null,"extra-properties","extra-properties",39412206);
+cljs.core.cst$kw$illegal_DASH_argument = new cljs.core.Keyword(null,"illegal-argument","illegal-argument",-1845493170);
+cljs.core.cst$sym$letfn_STAR_ = new cljs.core.Symbol(null,"letfn*","letfn*",-110097810,null);
+cljs.core.cst$kw$deregister_DASH_event_DASH_handler = new cljs.core.Keyword(null,"deregister-event-handler","deregister-event-handler",-1096518994);
+cljs.core.cst$sym$if = new cljs.core.Symbol(null,"if","if",1181717262,null);
+cljs.core.cst$sym$readable = new cljs.core.Symbol(null,"readable","readable",2113054478,null);
+cljs.core.cst$sym$cljs$core_SLASH_with_DASH_meta = new cljs.core.Symbol("cljs.core","with-meta","cljs.core/with-meta",749126446,null);
+cljs.core.cst$sym$button = new cljs.core.Symbol(null,"button","button",-1197855826,null);
+cljs.core.cst$sym$arr = new cljs.core.Symbol(null,"arr","arr",2115492975,null);
+cljs.core.cst$sym$new = new cljs.core.Symbol(null,"new","new",-444906321,null);
+cljs.core.cst$kw$strable = new cljs.core.Keyword(null,"strable","strable",1877668047);
+cljs.core.cst$kw$descendants = new cljs.core.Keyword(null,"descendants","descendants",1824886031);
+cljs.core.cst$kw$unknown_DASH_reference_DASH_type = new cljs.core.Keyword(null,"unknown-reference-type","unknown-reference-type",-472552113);
+cljs.core.cst$kw$allow = new cljs.core.Keyword(null,"allow","allow",-1857325745);
+cljs.core.cst$sym$ns = new cljs.core.Symbol(null,"ns","ns",2082130287,null);
+cljs.core.cst$kw$running = new cljs.core.Keyword(null,"running","running",1554969103);
+cljs.core.cst$kw$sym = new cljs.core.Keyword(null,"sym","sym",-1444860305);
+cljs.core.cst$kw$column = new cljs.core.Keyword(null,"column","column",2078222095);
+cljs.core.cst$sym$completed = new cljs.core.Symbol(null,"completed","completed",1154475024,null);
+cljs.core.cst$kw$shouldComponentUpdate = new cljs.core.Keyword(null,"shouldComponentUpdate","shouldComponentUpdate",1795750960);
+cljs.core.cst$kw$ancestors = new cljs.core.Keyword(null,"ancestors","ancestors",-776045424);
+cljs.core.cst$kw$invalid_DASH_hooks = new cljs.core.Keyword(null,"invalid-hooks","invalid-hooks",926439600);
+cljs.core.cst$kw$flush_DASH_dom = new cljs.core.Keyword(null,"flush-dom","flush-dom",-933676816);
+cljs.core.cst$kw$style = new cljs.core.Keyword(null,"style","style",-496642736);
+cljs.core.cst$sym$value = new cljs.core.Symbol(null,"value","value",1946509744,null);
+cljs.core.cst$sym$name = new cljs.core.Symbol(null,"name","name",-810760592,null);
+cljs.core.cst$kw$div = new cljs.core.Keyword(null,"div","div",1057191632);
+cljs.core.cst$kw$trim_DASH_v = new cljs.core.Keyword(null,"trim-v","trim-v",-1274938640);
+cljs.core.cst$sym$frames = new cljs.core.Symbol(null,"frames","frames",-888748272,null);
+cljs.core.cst$kw$readably = new cljs.core.Keyword(null,"readably","readably",1129599760);
+cljs.core.cst$sym$meta9267 = new cljs.core.Symbol(null,"meta9267","meta9267",-292538576,null);
+cljs.core.cst$kw$random_DASH_boolean = new cljs.core.Keyword(null,"random-boolean","random-boolean",2015461168);
+cljs.core.cst$sym$pfn = new cljs.core.Symbol(null,"pfn","pfn",-513383568,null);
+cljs.core.cst$kw$more_DASH_marker = new cljs.core.Keyword(null,"more-marker","more-marker",-14717935);
+cljs.core.cst$kw$dispatch = new cljs.core.Keyword(null,"dispatch","dispatch",1319337009);
+cljs.core.cst$sym$fields = new cljs.core.Symbol(null,"fields","fields",-291534703,null);
+cljs.core.cst$sym$scheduled_QMARK_ = new cljs.core.Symbol(null,"scheduled?","scheduled?",579986609,null);
+cljs.core.cst$sym$method_DASH_cache = new cljs.core.Symbol(null,"method-cache","method-cache",1230193905,null);
+cljs.core.cst$sym$dirty_QMARK_ = new cljs.core.Symbol(null,"dirty?","dirty?",-419314319,null);
+cljs.core.cst$kw$reagentRender = new cljs.core.Keyword(null,"reagentRender","reagentRender",-358306383);
+cljs.core.cst$kw$Objects = new cljs.core.Keyword(null,"Objects","Objects",-610644271);
+cljs.core.cst$sym$edit = new cljs.core.Symbol(null,"edit","edit",-1302639,null);
+cljs.core.cst$kw$_LT__GT_ = new cljs.core.Keyword(null,"<>","<>",1280186386);
+cljs.core.cst$kw$event_SLASH_handler = new cljs.core.Keyword("event","handler","event/handler",-295903150);
+cljs.core.cst$sym$editable_QMARK_ = new cljs.core.Symbol(null,"editable?","editable?",-164945806,null);
+cljs.core.cst$sym$base_DASH_count = new cljs.core.Symbol(null,"base-count","base-count",-1180647182,null);
+cljs.core.cst$kw$no_DASH_cache = new cljs.core.Keyword(null,"no-cache","no-cache",1588056370);
+cljs.core.cst$kw$render = new cljs.core.Keyword(null,"render","render",-1408033454);
+cljs.core.cst$kw$illegal_DASH_state = new cljs.core.Keyword(null,"illegal-state","illegal-state",-1519851182);
+cljs.core.cst$kw$db_DASH_handler = new cljs.core.Keyword(null,"db-handler","db-handler",579530098);
+cljs.core.cst$sym$clojure$core_SLASH_unquote_DASH_splicing = new cljs.core.Symbol("clojure.core","unquote-splicing","clojure.core/unquote-splicing",-552003150,null);
+cljs.core.cst$sym$collision_DASH_hash = new cljs.core.Symbol(null,"collision-hash","collision-hash",-35831342,null);
+cljs.core.cst$sym$deftype_STAR_ = new cljs.core.Symbol(null,"deftype*","deftype*",962659890,null);
+cljs.core.cst$kw$event = new cljs.core.Keyword(null,"event","event",301435442);
+cljs.core.cst$sym$let_STAR_ = new cljs.core.Symbol(null,"let*","let*",1920721458,null);
+cljs.core.cst$kw$after = new cljs.core.Keyword(null,"after","after",594996914);
+cljs.core.cst$sym$start = new cljs.core.Symbol(null,"start","start",1285322546,null);
+cljs.core.cst$kw$splicing_QMARK_ = new cljs.core.Keyword(null,"splicing?","splicing?",-428596366);
+cljs.core.cst$sym$sourceIter = new cljs.core.Symbol(null,"sourceIter","sourceIter",1068220306,null);
+cljs.core.cst$kw$success = new cljs.core.Keyword(null,"success","success",1890645906);
+cljs.core.cst$sym$coll = new cljs.core.Symbol(null,"coll","coll",-1006698606,null);
+cljs.core.cst$kw$components = new cljs.core.Keyword(null,"components","components",-1073188942);
+cljs.core.cst$sym$not_DASH_native = new cljs.core.Symbol(null,"not-native","not-native",-236392494,null);
+cljs.core.cst$sym$js_STAR_ = new cljs.core.Symbol(null,"js*","js*",-1134233646,null);
+cljs.core.cst$kw$reagent_DASH_render = new cljs.core.Keyword(null,"reagent-render","reagent-render",-985383853);
+cljs.core.cst$sym$strobj = new cljs.core.Symbol(null,"strobj","strobj",1088091283,null);
+cljs.core.cst$kw$capacities = new cljs.core.Keyword(null,"capacities","capacities",-1666536173);
+cljs.core.cst$kw$line = new cljs.core.Keyword(null,"line","line",212345235);
+cljs.core.cst$sym$_rest = new cljs.core.Symbol(null,"_rest","_rest",-2100466189,null);
+cljs.core.cst$kw$list = new cljs.core.Keyword(null,"list","list",765357683);
+cljs.core.cst$sym$fn_STAR_ = new cljs.core.Symbol(null,"fn*","fn*",-752876845,null);
+cljs.core.cst$sym$val = new cljs.core.Symbol(null,"val","val",1769233139,null);
+cljs.core.cst$kw$on_DASH_write = new cljs.core.Keyword(null,"on-write","on-write",31519475);
+cljs.core.cst$kw$keyword = new cljs.core.Keyword(null,"keyword","keyword",811389747);
+cljs.core.cst$sym$ascending_QMARK_ = new cljs.core.Symbol(null,"ascending?","ascending?",-1938452653,null);
+cljs.core.cst$sym$recur = new cljs.core.Symbol(null,"recur","recur",1202958259,null);
+cljs.core.cst$sym$xf = new cljs.core.Symbol(null,"xf","xf",2042434515,null);
+cljs.core.cst$sym$ci = new cljs.core.Symbol(null,"ci","ci",2049808339,null);
+cljs.core.cst$kw$event_SLASH_do_DASH_fx = new cljs.core.Keyword("event","do-fx","event/do-fx",1357330452);
+cljs.core.cst$kw$print_DASH_length = new cljs.core.Keyword(null,"print-length","print-length",1931866356);
+cljs.core.cst$kw$col = new cljs.core.Keyword(null,"col","col",-1959363084);
+cljs.core.cst$kw$id = new cljs.core.Keyword(null,"id","id",-1388402092);
+cljs.core.cst$sym$ratom = new cljs.core.Symbol(null,"ratom","ratom",1514010260,null);
+cljs.core.cst$kw$class = new cljs.core.Keyword(null,"class","class",-2030961996);
+cljs.core.cst$sym$state = new cljs.core.Symbol(null,"state","state",-348086572,null);
+cljs.core.cst$kw$effects = new cljs.core.Keyword(null,"effects","effects",-282369292);
+cljs.core.cst$kw$Links = new cljs.core.Keyword(null,"Links","Links",1715516180);
+cljs.core.cst$kw$ok = new cljs.core.Keyword(null,"ok","ok",967785236);
+cljs.core.cst$sym$vals = new cljs.core.Symbol(null,"vals","vals",-1886377036,null);
+cljs.core.cst$sym$all = new cljs.core.Symbol(null,"all","all",-1762306027,null);
+cljs.core.cst$sym$clojure$core_SLASH_deref = new cljs.core.Symbol("clojure.core","deref","clojure.core/deref",188719157,null);
+cljs.core.cst$kw$cljs$core_SLASH_halt = new cljs.core.Keyword("cljs.core","halt","cljs.core/halt",-1049036715);
+cljs.core.cst$kw$opts = new cljs.core.Keyword(null,"opts","opts",155075701);
+cljs.core.cst$kw$nil = new cljs.core.Keyword(null,"nil","nil",99600501);
+cljs.core.cst$sym$cached_DASH_hierarchy = new cljs.core.Symbol(null,"cached-hierarchy","cached-hierarchy",-1085460203,null);
+cljs.core.cst$kw$auto_DASH_run = new cljs.core.Keyword(null,"auto-run","auto-run",1958400437);
+cljs.core.cst$sym$s = new cljs.core.Symbol(null,"s","s",-948495851,null);
+cljs.core.cst$kw$parents = new cljs.core.Keyword(null,"parents","parents",-2027538891);
+cljs.core.cst$sym$cnt = new cljs.core.Symbol(null,"cnt","cnt",1924510325,null);
+cljs.core.cst$sym$_SLASH_ = new cljs.core.Symbol(null,"/","/",-1371932971,null);
+cljs.core.cst$kw$run_DASH_queue = new cljs.core.Keyword(null,"run-queue","run-queue",-1701798027);
+cljs.core.cst$sym$node = new cljs.core.Symbol(null,"node","node",-2073234571,null);
+cljs.core.cst$kw$component_DASH_will_DASH_unmount = new cljs.core.Keyword(null,"component-will-unmount","component-will-unmount",-2058314698);
+cljs.core.cst$sym$sym = new cljs.core.Symbol(null,"sym","sym",195671222,null);
+cljs.core.cst$sym$column = new cljs.core.Symbol(null,"column","column",-576213674,null);
+cljs.core.cst$kw$extension_DASH_id = new cljs.core.Keyword(null,"extension-id","extension-id",-629939786);
+cljs.core.cst$sym$sb = new cljs.core.Symbol(null,"sb","sb",-1249746442,null);
+cljs.core.cst$kw$stack = new cljs.core.Keyword(null,"stack","stack",-793405930);
+cljs.core.cst$sym$clojure$core_SLASH_unquote = new cljs.core.Symbol("clojure.core","unquote","clojure.core/unquote",843087510,null);
+cljs.core.cst$kw$Hash = new cljs.core.Keyword(null,"Hash","Hash",-72757482);
+cljs.core.cst$sym$seed = new cljs.core.Symbol(null,"seed","seed",1709144854,null);
+cljs.core.cst$kw$b = new cljs.core.Keyword(null,"b","b",1482224470);
+cljs.core.cst$kw$end_DASH_line = new cljs.core.Keyword(null,"end-line","end-line",1837326455);
+cljs.core.cst$kw$unknown_DASH_key = new cljs.core.Keyword(null,"unknown-key","unknown-key",255305911);
+cljs.core.cst$sym$prev_DASH_seed = new cljs.core.Symbol(null,"prev-seed","prev-seed",2126381367,null);
+cljs.core.cst$sym$buf_DASH_pos = new cljs.core.Symbol(null,"buf-pos","buf-pos",-807229033,null);
+cljs.core.cst$kw$display_DASH_name = new cljs.core.Keyword(null,"display-name","display-name",694513143);
+cljs.core.cst$kw$scheduled = new cljs.core.Keyword(null,"scheduled","scheduled",553898551);
+cljs.core.cst$kw$random = new cljs.core.Keyword(null,"random","random",-557811113);
+cljs.core.cst$sym$cljs$core_SLASH_vec = new cljs.core.Symbol("cljs.core","vec","cljs.core/vec",307622519,null);
+cljs.core.cst$sym$_DASH_Inf = new cljs.core.Symbol(null,"-Inf","-Inf",-2123243689,null);
+cljs.core.cst$kw$Name = new cljs.core.Keyword(null,"Name","Name",-131211369);
+cljs.core.cst$sym$_hash = new cljs.core.Symbol(null,"_hash","_hash",-2130838312,null);
+cljs.core.cst$kw$on_DASH_dispose = new cljs.core.Keyword(null,"on-dispose","on-dispose",2105306360);
+cljs.core.cst$kw$cached_QMARK_ = new cljs.core.Keyword(null,"cached?","cached?",86081880);
+cljs.core.cst$kw$sub_SLASH_dispose = new cljs.core.Keyword("sub","dispose","sub/dispose",365440536);
+cljs.core.cst$sym$cljs$core_SLASH_sequence = new cljs.core.Symbol("cljs.core","sequence","cljs.core/sequence",1908459032,null);
+cljs.core.cst$kw$pause = new cljs.core.Keyword(null,"pause","pause",-2095325672);
+cljs.core.cst$kw$error = new cljs.core.Keyword(null,"error","error",-978969032);
+cljs.core.cst$kw$regex = new cljs.core.Keyword(null,"regex","regex",939488856);
+cljs.core.cst$kw$componentFunction = new cljs.core.Keyword(null,"componentFunction","componentFunction",825866104);
+cljs.core.cst$kw$exception = new cljs.core.Keyword(null,"exception","exception",-335277064);
+cljs.core.cst$sym$keys = new cljs.core.Symbol(null,"keys","keys",-1586012071,null);
+cljs.core.cst$kw$coeffects = new cljs.core.Keyword(null,"coeffects","coeffects",497912985);
+cljs.core.cst$kw$input_DASH_signals = new cljs.core.Keyword(null,"input-signals","input-signals",563633497);
+cljs.core.cst$sym$set_BANG_ = new cljs.core.Symbol(null,"set!","set!",250714521,null);
+cljs.core.cst$kw$unsupported_DASH_operation = new cljs.core.Keyword(null,"unsupported-operation","unsupported-operation",1890540953);
+cljs.core.cst$sym$splicing_QMARK_ = new cljs.core.Symbol(null,"splicing?","splicing?",1211935161,null);
+cljs.core.cst$kw$form = new cljs.core.Keyword(null,"form","form",-1624062471);
+cljs.core.cst$kw$tag = new cljs.core.Keyword(null,"tag","tag",-1290361223);
+cljs.core.cst$sym$tree_DASH_map = new cljs.core.Symbol(null,"tree-map","tree-map",1373073049,null);
+cljs.core.cst$kw$interceptors = new cljs.core.Keyword(null,"interceptors","interceptors",-1546782951);
+cljs.core.cst$sym$_DOT_ = new cljs.core.Symbol(null,".",".",1975675962,null);
+cljs.core.cst$kw$re_DASH_frame_DASH_path_SLASH_db_DASH_store = new cljs.core.Keyword("re-frame-path","db-store","re-frame-path/db-store",655758490);
+cljs.core.cst$sym$var = new cljs.core.Symbol(null,"var","var",870848730,null);
+cljs.core.cst$kw$mutable = new cljs.core.Keyword(null,"mutable","mutable",875778266);
+cljs.core.cst$sym$quote = new cljs.core.Symbol(null,"quote","quote",1377916282,null);
+cljs.core.cst$kw$set = new cljs.core.Keyword(null,"set","set",304602554);
+cljs.core.cst$kw$timeout = new cljs.core.Keyword(null,"timeout","timeout",-318625318);
+cljs.core.cst$sym$line_DASH_start_QMARK_ = new cljs.core.Symbol(null,"line-start?","line-start?",1357012474,null);
+cljs.core.cst$sym$root = new cljs.core.Symbol(null,"root","root",1191874074,null);
+cljs.core.cst$sym$multi = new cljs.core.Symbol(null,"multi","multi",1450238522,null);
+cljs.core.cst$kw$end = new cljs.core.Keyword(null,"end","end",-268185958);
+cljs.core.cst$sym$str = new cljs.core.Symbol(null,"str","str",-1564826950,null);
+cljs.core.cst$sym$next = new cljs.core.Symbol(null,"next","next",1522830042,null);
+cljs.core.cst$kw$on_DASH_changes = new cljs.core.Keyword(null,"on-changes","on-changes",1345912602);
+cljs.core.cst$sym$nodes = new cljs.core.Symbol(null,"nodes","nodes",-459054278,null);
+cljs.core.cst$sym$seen = new cljs.core.Symbol(null,"seen","seen",1121531738,null);
+cljs.core.cst$sym$hash_DASH_map = new cljs.core.Symbol(null,"hash-map","hash-map",-439030950,null);
+cljs.core.cst$sym$line = new cljs.core.Symbol(null,"line","line",1852876762,null);
+cljs.core.cst$kw$groupEnd = new cljs.core.Keyword(null,"groupEnd","groupEnd",-337721382);
+cljs.core.cst$kw$ctx_DASH_handler = new cljs.core.Keyword(null,"ctx-handler","ctx-handler",-1777672230);
+cljs.core.cst$kw$atom = new cljs.core.Keyword(null,"atom","atom",-397043653);
+cljs.core.cst$kw$trigger = new cljs.core.Keyword(null,"trigger","trigger",103466139);
+cljs.core.cst$kw$unknown_DASH_component = new cljs.core.Keyword(null,"unknown-component","unknown-component",-530928453);
+cljs.core.cst$kw$eof = new cljs.core.Keyword(null,"eof","eof",-489063237);
+cljs.core.cst$kw$autobind = new cljs.core.Keyword(null,"autobind","autobind",-570650245);
+cljs.core.cst$kw$hierarchy = new cljs.core.Keyword(null,"hierarchy","hierarchy",-1053470341);
+cljs.core.cst$sym$catch = new cljs.core.Symbol(null,"catch","catch",-1616370245,null);
+cljs.core.cst$kw$cofx = new cljs.core.Keyword(null,"cofx","cofx",2013202907);
+cljs.core.cst$kw$queries = new cljs.core.Keyword(null,"queries","queries",1446291995);
+cljs.core.cst$sym$s_DASH_len = new cljs.core.Symbol(null,"s-len","s-len",1869978331,null);
+cljs.core.cst$kw$alt_DASH_impl = new cljs.core.Keyword(null,"alt-impl","alt-impl",670969595);
+cljs.core.cst$kw$resume = new cljs.core.Keyword(null,"resume","resume",-118572261);
+cljs.core.cst$sym$ext_DASH_map_DASH_iter = new cljs.core.Symbol(null,"ext-map-iter","ext-map-iter",-1215982757,null);
+cljs.core.cst$kw$ms = new cljs.core.Keyword(null,"ms","ms",-1152709733);
+cljs.core.cst$sym$tail = new cljs.core.Symbol(null,"tail","tail",494507963,null);
+cljs.core.cst$kw$enrich = new cljs.core.Keyword(null,"enrich","enrich",-2108921925);
+cljs.core.cst$kw$reaction = new cljs.core.Keyword(null,"reaction","reaction",490869788);
+cljs.core.cst$sym$file_DASH_name = new cljs.core.Symbol(null,"file-name","file-name",-13685732,null);
+cljs.core.cst$sym$record = new cljs.core.Symbol(null,"record","record",861424668,null);
+cljs.core.cst$kw$fx = new cljs.core.Keyword(null,"fx","fx",-1237829572);
+cljs.core.cst$sym$meta10806 = new cljs.core.Symbol(null,"meta10806","meta10806",539595900,null);
+cljs.core.cst$sym$changed = new cljs.core.Symbol(null,"changed","changed",-2083710852,null);
+cljs.core.cst$sym$mseq = new cljs.core.Symbol(null,"mseq","mseq",1602647196,null);
+cljs.core.cst$sym$count = new cljs.core.Symbol(null,"count","count",-514511684,null);
+cljs.core.cst$kw$before = new cljs.core.Keyword(null,"before","before",-1633692388);
+cljs.core.cst$kw$op_DASH_type = new cljs.core.Keyword(null,"op-type","op-type",-1636141668);
+cljs.core.cst$kw$keywordize_DASH_keys = new cljs.core.Keyword(null,"keywordize-keys","keywordize-keys",1310784252);
+cljs.core.cst$sym$current = new cljs.core.Symbol(null,"current","current",552492924,null);
+cljs.core.cst$sym$off = new cljs.core.Symbol(null,"off","off",-2047994980,null);
+cljs.core.cst$kw$log = new cljs.core.Keyword(null,"log","log",-1595516004);
+cljs.core.cst$sym$auto_DASH_run = new cljs.core.Symbol(null,"auto-run","auto-run",-696035332,null);
+cljs.core.cst$kw$unsupported_DASH_type = new cljs.core.Keyword(null,"unsupported-type","unsupported-type",-734728196);
+cljs.core.cst$sym$stack = new cljs.core.Symbol(null,"stack","stack",847125597,null);
+cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_untrimmed_DASH_event = new cljs.core.Keyword("re-frame.std-interceptors","untrimmed-event","re-frame.std-interceptors/untrimmed-event",-840935075);
+cljs.core.cst$sym$cljs$core_SLASH_hash_DASH_set = new cljs.core.Symbol("cljs.core","hash-set","cljs.core/hash-set",1130426749,null);
+cljs.core.cst$sym$transient_DASH_map = new cljs.core.Symbol(null,"transient-map","transient-map",351764893,null);
+cljs.core.cst$kw$character = new cljs.core.Keyword(null,"character","character",380652989);
+cljs.core.cst$kw$map = new cljs.core.Keyword(null,"map","map",1371690461);
+cljs.core.cst$sym$cljs$core_SLASH_list = new cljs.core.Symbol("cljs.core","list","cljs.core/list",-1331406371,null);
+cljs.core.cst$kw$eofthrow = new cljs.core.Keyword(null,"eofthrow","eofthrow",-334166531);
+cljs.core.cst$kw$finish_DASH_run = new cljs.core.Keyword(null,"finish-run","finish-run",753148477);
+cljs.core.cst$sym$prev = new cljs.core.Symbol(null,"prev","prev",43462301,null);
+cljs.core.cst$sym$len = new cljs.core.Symbol(null,"len","len",-1230778691,null);
+cljs.core.cst$kw$componentWillMount = new cljs.core.Keyword(null,"componentWillMount","componentWillMount",-285327619);
+cljs.core.cst$kw$test = new cljs.core.Keyword(null,"test","test",577538877);
+cljs.core.cst$sym$right = new cljs.core.Symbol(null,"right","right",1187949694,null);
+cljs.core.cst$sym$buf_DASH_len = new cljs.core.Symbol(null,"buf-len","buf-len",404510846,null);
+cljs.core.cst$kw$runtime_DASH_exception = new cljs.core.Keyword(null,"runtime-exception","runtime-exception",-1495664514);
+cljs.core.cst$sym$throw = new cljs.core.Symbol(null,"throw","throw",595905694,null);
+cljs.core.cst$kw$none = new cljs.core.Keyword(null,"none","none",1333468478);
+cljs.core.cst$kw$buffer = new cljs.core.Keyword(null,"buffer","buffer",617295198);
+cljs.core.cst$kw$invalid_DASH_extension_DASH_keys = new cljs.core.Keyword(null,"invalid-extension-keys","invalid-extension-keys",-164289122);
+cljs.core.cst$kw$gateway_DASH_url = new cljs.core.Keyword(null,"gateway-url","gateway-url",1046231486);
+cljs.core.cst$sym$fseq = new cljs.core.Symbol(null,"fseq","fseq",-1466412450,null);
+cljs.core.cst$sym$nocache_QMARK_ = new cljs.core.Symbol(null,"nocache?","nocache?",-1065670978,null);
+cljs.core.cst$kw$dispatch_DASH_later = new cljs.core.Keyword(null,"dispatch-later","dispatch-later",291951390);
+cljs.core.cst$kw$message = new cljs.core.Keyword(null,"message","message",-406056002);
+cljs.core.cst$kw$view = new cljs.core.Keyword(null,"view","view",1247994814);
+cljs.core.cst$kw$cljs$core_SLASH_not_DASH_found = new cljs.core.Keyword("cljs.core","not-found","cljs.core/not-found",-1572889185);
+cljs.core.cst$sym$more = new cljs.core.Symbol(null,"more","more",-418290273,null);
+cljs.core.cst$sym$def = new cljs.core.Symbol(null,"def","def",597100991,null);
+cljs.core.cst$kw$span = new cljs.core.Keyword(null,"span","span",1394872991);
+cljs.core.cst$kw$data = new cljs.core.Keyword(null,"data","data",-232669377);
+cljs.core.cst$sym$f = new cljs.core.Symbol(null,"f","f",43394975,null);
+cljs.core.cst$sym$next_DASH_iter = new cljs.core.Symbol(null,"next-iter","next-iter",1526626239,null);
diff --git a/js/cljs/tools/reader.cljs b/js/cljs/tools/reader.cljs
new file mode 100644
index 0000000..49910da
--- /dev/null
+++ b/js/cljs/tools/reader.cljs
@@ -0,0 +1,944 @@
+;;   Copyright (c) Nicola Mometto, Rich Hickey & contributors.
+;;   The use and distribution terms for this software are covered by the
+;;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;;   which can be found in the file epl-v10.html at the root of this distribution.
+;;   By using this software in any fashion, you are agreeing to be bound by
+;;   the terms of this license.
+;;   You must not remove this notice, or any other, from this software.
+
+(ns ^{:doc "A clojure reader in clojure"
+      :author "Bronsa"}
+  cljs.tools.reader
+  (:refer-clojure :exclude [read read-line read-string char
+                            default-data-readers *default-data-reader-fn*
+                            *data-readers* *suppress-read*])
+  (:require-macros [cljs.tools.reader.reader-types :refer [log-source]])
+  (:require [cljs.tools.reader.reader-types :refer
+             [read-char unread peek-char indexing-reader?
+              get-line-number get-column-number get-file-name
+              string-push-back-reader]]
+            [cljs.tools.reader.impl.utils :refer
+             [char ex-info? whitespace? numeric? desugar-meta next-id namespace-keys second'
+              ReaderConditional reader-conditional reader-conditional?]]
+            [cljs.tools.reader.impl.commons :refer
+             [number-literal? read-past match-number parse-symbol read-comment throwing-reader]]
+            [cljs.tools.reader.impl.errors :as err]
+            [goog.array :as garray]
+            [goog.string :as gstring])
+  (:import goog.string.StringBuffer))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; helpers
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(declare ^:private read*
+         macros dispatch-macros
+         ^:dynamic *data-readers*
+         ^:dynamic *default-data-reader-fn*
+         ^:dynamic *suppress-read*
+         default-data-readers)
+
+(defn- ^boolean macro-terminating? [ch]
+  (case ch
+    (\" \; \@ \^ \` \~ \( \) \[ \] \{ \} \\) true
+    false))
+
+(def sb (StringBuffer.))
+
+(defn- read-token
+  "Read in a single logical token from the reader"
+  [^not-native rdr kind initch]
+  (if (nil? initch)
+    (err/throw-eof-at-start rdr kind)
+    (do
+      (.clear sb)
+      (loop [ch initch]
+        (if (or (whitespace? ch)
+                (macro-terminating? ch)
+                (nil? ch))
+          (do
+            (when-not (nil? ch)
+              (unread rdr ch))
+            (.toString sb))
+          (do
+            (.append sb ch)
+            (recur (read-char rdr))))))))
+
+(declare read-tagged)
+
+(defn- read-dispatch
+  [^not-native rdr _ opts pending-forms]
+  (if-let [ch (read-char rdr)]
+    (if-let [dm (dispatch-macros ch)]
+      (dm rdr ch opts pending-forms)
+      (read-tagged (doto rdr (unread ch)) ch opts pending-forms)) ;; ctor reader is implemented as a tagged literal
+    (err/throw-eof-at-dispatch rdr)))
+
+(defn- read-unmatched-delimiter
+  [rdr ch opts pending-forms]
+  (err/throw-unmatch-delimiter rdr ch))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; readers
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(defn read-regex
+  [^not-native rdr ch opts pending-forms]
+  (let [sb (StringBuffer.)]
+    (loop [ch (read-char rdr)]
+      (if (identical? \" ch)
+        (re-pattern (str sb))
+        (if (nil? ch)
+          (err/throw-eof-reading rdr :regex sb)
+          (do
+            (.append sb ch )
+            (when (identical? \\ ch)
+              (let [ch (read-char rdr)]
+                (if (nil? ch)
+                  (err/throw-eof-reading rdr :regex sb))
+                (.append sb ch)))
+            (recur (read-char rdr))))))))
+
+(defn- char-code [ch base]
+  (let [code (js/parseInt ch base)]
+    (if (js/isNaN code)
+      -1
+      code)))
+
+(defn- read-unicode-char
+  ([token offset length base]
+     (let [l (+ offset length)]
+       (when-not (== (count token) l)
+         (err/throw-invalid-unicode-literal nil token))
+       (loop [i offset uc 0]
+         (if (== i l)
+           (js/String.fromCharCode uc)
+           (let [d (char-code (nth token i) base)]
+             (if (== d -1)
+               (err/throw-invalid-unicode-digit-in-token nil (nth token i) token)
+               (recur (inc i) (+ d (* uc base)))))))))
+
+  ([^not-native rdr initch base length exact?]
+     (loop [i 1 uc (char-code initch base)]
+       (if (== uc -1)
+         (err/throw-invalid-unicode-digit rdr initch)
+         (if-not (== i length)
+           (let [ch (peek-char rdr)]
+             (if (or (whitespace? ch)
+                     (macros ch)
+                     (nil? ch))
+               (if exact?
+                 (err/throw-invalid-unicode-len rdr i length)
+                 (js/String.fromCharCode uc))
+               (let [d (char-code ch base)]
+                 (read-char rdr)
+                 (if (== d -1)
+                   (err/throw-invalid-unicode-digit rdr ch)
+                   (recur (inc i) (+ d (* uc base)))))))
+           (js/String.fromCharCode uc))))))
+
+(def ^:private ^:const upper-limit (.charCodeAt \uD7ff 0))
+(def ^:private ^:const lower-limit (.charCodeAt \uE000 0))
+
+(defn- valid-octal? [token base]
+  (<= (js/parseInt token base) 0377))
+
+(defn- read-char*
+  "Read in a character literal"
+  [^not-native rdr backslash opts pending-forms]
+  (let [ch (read-char rdr)]
+    (if-not (nil? ch)
+      (let [token (if (or (macro-terminating? ch)
+                          (whitespace? ch))
+                    (str ch)
+                    (read-token rdr :character ch))
+            token-len (. token -length)]
+        (cond
+
+         (== 1 token-len)  (.charAt token 0) ;;; no char type - so can't ensure/cache char
+
+         (= token "newline") \newline
+         (= token "space") \space
+         (= token "tab") \tab
+         (= token "backspace") \backspace
+         (= token "formfeed") \formfeed
+         (= token "return") \return
+
+         (gstring/startsWith token "u")
+         (let [c (read-unicode-char token 1 4 16)
+               ic (.charCodeAt c 0)]
+           (if (and (> ic upper-limit)
+                    (< ic lower-limit))
+             (err/throw-invalid-character-literal rdr (.toString ic 16))
+             c))
+
+         (gstring/startsWith token "o")
+         (let [len (dec token-len)]
+           (if (> len 3)
+             (err/throw-invalid-octal-len rdr token)
+             (let [offset 1
+                   base 8
+                   uc (read-unicode-char token offset len base)]
+               (if-not (valid-octal? (subs token offset) base)
+                 (err/throw-bad-octal-number rdr)
+                 uc))))
+
+         :else (err/throw-unsupported-character rdr token)))
+      (err/throw-eof-in-character rdr))))
+
+(defn- starting-line-col-info [^not-native rdr]
+  (when (indexing-reader? rdr)
+    [(get-line-number rdr) (int (dec (get-column-number rdr)))]))
+
+(defn- ending-line-col-info [^not-native rdr]
+  (when (indexing-reader? rdr)
+    [(get-line-number rdr) (get-column-number rdr)]))
+
+(defonce ^:private READ_EOF (js/Object.))
+(defonce ^:private READ_FINISHED (js/Object.))
+
+(def ^:dynamic *read-delim* false)
+
+(defn- read-delimited-internal [kind delim rdr opts pending-forms]
+  (let [[start-line start-column] (starting-line-col-info rdr)
+        delim (char delim)]
+    (loop [a (transient [])]
+      (let [form (read* rdr false READ_EOF delim opts pending-forms)]
+        (if (identical? form READ_FINISHED)
+          (persistent! a)
+          (if (identical? form READ_EOF)
+            (err/throw-eof-delimited rdr kind start-line start-column (count a))
+            (recur (conj! a form))))))))
+
+(defn- read-delimited
+  "Reads and returns a collection ended with delim"
+  [kind delim rdr opts pending-forms]
+  (binding [*read-delim* true]
+    (read-delimited-internal kind delim rdr opts pending-forms)))
+
+(defn- read-list
+  "Read in a list, including its location if the reader is an indexing reader"
+  [rdr _ opts pending-forms]
+  (let [[start-line start-column] (starting-line-col-info rdr)
+        the-list (read-delimited :list \) rdr opts pending-forms)
+        [end-line end-column] (ending-line-col-info rdr)]
+    (with-meta (if (empty? the-list)
+                 '()
+                 (apply list the-list))
+      (when start-line
+        (merge
+         (when-let [file (get-file-name rdr)]
+           {:file file})
+         {:line start-line
+          :column start-column
+          :end-line end-line
+          :end-column end-column})))))
+
+(defn- read-vector
+  "Read in a vector, including its location if the reader is an indexing reader"
+  [rdr _ opts pending-forms]
+  (let [[start-line start-column] (starting-line-col-info rdr)
+        the-vector (read-delimited :vector \] rdr opts pending-forms)
+        [end-line end-column] (ending-line-col-info rdr)]
+    (with-meta the-vector
+      (when start-line
+        (merge
+         (when-let [file (get-file-name rdr)]
+           {:file file})
+         {:line start-line
+          :column start-column
+          :end-line end-line
+          :end-column end-column})))))
+
+(defn- read-map
+  "Read in a map, including its location if the reader is an indexing reader"
+  [rdr _ opts pending-forms]
+  (let [[start-line start-column] (starting-line-col-info rdr)
+        the-map (read-delimited :map \} rdr opts pending-forms)
+        map-count (count the-map)
+        ks (take-nth 2 the-map)
+        key-set (set ks)
+        [end-line end-column] (ending-line-col-info rdr)]
+    (when (odd? map-count)
+      (err/throw-odd-map rdr start-line start-column the-map))
+    (when-not (= (count key-set) (count ks))
+      (err/throw-dup-keys rdr :map ks))
+    (with-meta
+      (if (<= map-count (* 2 (.-HASHMAP-THRESHOLD cljs.core/PersistentArrayMap)))
+        (.fromArray cljs.core/PersistentArrayMap (to-array the-map) true true)
+        (.fromArray cljs.core/PersistentHashMap (to-array the-map) true))
+      (when start-line
+        (merge
+         (when-let [file (get-file-name rdr)]
+           {:file file})
+         {:line start-line
+          :column start-column
+          :end-line end-line
+          :end-column end-column})))))
+
+(defn- read-number
+  [^not-native rdr initch]
+  (loop [sb (doto (StringBuffer.) (.append initch))
+         ch (read-char rdr)]
+    (if (or (whitespace? ch) (macros ch) (nil? ch))
+      (let [s (str sb)]
+        (unread rdr ch)
+        (or (match-number s)
+            (err/throw-invalid-number rdr s)))
+      (recur (doto sb (.append ch)) (read-char rdr)))))
+
+(defn- escape-char [sb ^not-native rdr]
+  (let [ch (read-char rdr)]
+    (case ch
+      \t "\t"
+      \r "\r"
+      \n "\n"
+      \\ "\\"
+      \" "\""
+      \b "\b"
+      \f "\f"
+      \u (let [ch (read-char rdr)]
+           (if (== -1 (js/parseInt (int ch) 16))
+             (err/throw-invalid-unicode-escape rdr ch)
+             (read-unicode-char rdr ch 16 4 true)))
+      (if (numeric? ch)
+        (let [ch (read-unicode-char rdr ch 8 3 false)]
+          (if (> (int ch) 0377)
+            (err/throw-bad-octal-number rdr)
+            ch))
+        (err/throw-bad-escape-char rdr ch)))))
+
+(defn- read-string*
+  [^not-native reader _ opts pending-forms]
+  (loop [sb (StringBuffer.)
+         ch (read-char reader)]
+    (if (nil? ch)
+      (err/throw-eof-reading reader :string \" sb)
+      (case ch
+        \\ (recur (doto sb (.append (escape-char sb reader)))
+             (read-char reader))
+        \" (str sb)
+        (recur (doto sb (.append ch)) (read-char reader))))))
+
+(defn- loc-info [rdr line column]
+  (when-not (nil? line)
+    (let [file (get-file-name rdr)
+          filem (when-not (nil? file) {:file file})
+          [end-line end-column] (ending-line-col-info rdr)
+          lcm {:line line
+               :column column
+               :end-line end-line
+               :end-column end-column}]
+      (merge filem lcm))))
+
+(defn- read-symbol
+  [rdr initch]
+  (let [[line column] (starting-line-col-info rdr)
+        token (read-token rdr :symbol initch)]
+    (when-not (nil? token)
+      (case token
+
+        ;; special symbols
+        "nil" nil
+        "true" true
+        "false" false
+        "/" '/
+
+        (let [^not-native p (parse-symbol token)]
+          (if-not (nil? p)
+            (let [^not-native sym (symbol (-nth p 0) (-nth p 1))]
+              (-with-meta sym (loc-info rdr line column)))
+            (err/throw-invalid rdr :symbol token)))))))
+
+(def ^:dynamic *alias-map*
+  "Map from ns alias to ns, if non-nil, it will be used to resolve read-time
+   ns aliases.
+
+   Defaults to nil"
+  nil)
+
+(defn- resolve-alias [sym]
+  (get *alias-map* sym))
+
+(defn- resolve-ns [sym]
+  (or (resolve-alias sym)
+      (when-let [ns (find-ns sym)]
+        (symbol (ns-name ns)))))
+
+(defn- read-keyword
+  [^not-native reader initch opts pending-forms]
+  (let [ch (read-char reader)]
+    (if-not (whitespace? ch)
+      (let [token (read-token reader :keyword ch)
+            ^not-native s (parse-symbol token)]
+        (if-not (nil? s)
+          (let [ns (-nth s 0)
+                name (-nth s 1)]
+            (if (identical? \: (.charAt token 0))
+              (if-not (nil? ns)
+                (if-let [ns (resolve-alias (symbol (subs ns 1)))]
+                  (keyword (str ns) name)
+                  (err/throw-invalid reader :keyword (str \: token)))
+                (if-let [ns *ns*]
+                  (keyword (str ns) (subs name 1))
+                  (err/reader-error reader "Invalid token: :" token)))
+              (keyword ns name)))
+          (err/throw-invalid reader :keyword (str \: token))))
+      (err/throw-single-colon reader))))
+
+(defn- wrapping-reader
+  "Returns a function which wraps a reader in a call to sym"
+  [sym]
+  (fn [rdr _ opts pending-forms]
+    (list sym (read* rdr true nil opts pending-forms))))
+
+(defn- read-meta
+  "Read metadata and return the following object with the metadata applied"
+  [rdr _ opts pending-forms]
+  (log-source rdr
+    (let [[line column] (starting-line-col-info rdr)
+          m (desugar-meta (read* rdr true nil opts pending-forms))]
+      (when-not (map? m)
+        (err/throw-bad-metadata rdr m))
+      (let [o (read* rdr true nil opts pending-forms)]
+        (if (implements? IMeta o)
+          (let [m (if (and line (seq? o))
+                    (assoc m :line line :column column)
+                    m)]
+            (if (implements? IWithMeta o)
+              (with-meta o (merge (meta o) m))
+              (reset-meta! o m)))
+          (err/throw-bad-metadata-target rdr o))))))
+
+(defn- read-set
+  [rdr _ opts pending-forms]
+  (let [[start-line start-column] (starting-line-col-info rdr)
+        ;; subtract 1 from start-column so it includes the # in the leading #{
+        start-column (if start-column (int (dec start-column)))
+        coll (read-delimited :set \} rdr opts pending-forms)
+        the-set (set coll)
+        [end-line end-column] (ending-line-col-info rdr)]
+      (when-not (= (count coll) (count the-set))
+        (err/reader-error rdr (err/throw-dup-keys rdr :set coll)))
+      (with-meta the-set
+        (when start-line
+          (merge
+           (when-let [file (get-file-name rdr)]
+             {:file file})
+           {:line start-line
+            :column start-column
+            :end-line end-line
+            :end-column end-column})))))
+
+(defn- read-discard
+  "Read and discard the first object from rdr"
+  [rdr _ opts pending-forms]
+  (doto rdr
+    (read* true nil opts pending-forms)))
+
+(defn- read-symbolic-value
+  [rdr _ opts pending-forms]
+  (let [sym (read* rdr true nil opts pending-forms)]
+    (case sym
+
+      NaN js/Number.NaN
+      -Inf js/Number.NEGATIVE_INFINITY
+      Inf js/Number.POSITIVE_INFINITY
+
+      (err/reader-error rdr (str "Invalid token: ##" sym)))))
+
+(def ^:private RESERVED_FEATURES #{:else :none})
+
+(defn- has-feature?
+  [rdr feature opts]
+  (if (keyword? feature)
+    (or (= :default feature) (contains? (get opts :features) feature))
+    (err/reader-error rdr "Feature should be a keyword: " feature)))
+
+(defn- check-eof-error
+  [form rdr first-line]
+  (when (identical? form READ_EOF)
+    (err/throw-eof-error rdr (and (< first-line 0) first-line))))
+
+(defn- check-reserved-features
+  [rdr form]
+  (when (get RESERVED_FEATURES form)
+    (err/reader-error rdr "Feature name " form " is reserved")))
+
+(defn- check-invalid-read-cond
+  [form rdr first-line]
+  (when (identical? form READ_FINISHED)
+    (if (< first-line 0)
+      (err/reader-error rdr "read-cond requires an even number of forms")
+      (err/reader-error rdr "read-cond starting on line " first-line " requires an even number of forms"))))
+
+(defn- read-suppress
+  "Read next form and suppress. Return nil or READ_FINISHED."
+  [first-line rdr opts pending-forms]
+  (binding [*suppress-read* true]
+    (let [form (read* rdr false READ_EOF \) opts pending-forms)]
+      (check-eof-error form rdr first-line)
+      (when (identical? form READ_FINISHED)
+        READ_FINISHED))))
+
+(defonce ^:private NO_MATCH (js/Object.))
+
+(defn- match-feature
+  "Read next feature. If matched, read next form and return.
+   Otherwise, read and skip next form, returning READ_FINISHED or nil."
+  [first-line rdr opts pending-forms]
+  (let [feature (read* rdr false READ_EOF \) opts pending-forms)]
+    (check-eof-error feature rdr first-line)
+    (if (= feature READ_FINISHED)
+      READ_FINISHED
+      (do
+        (check-reserved-features rdr feature)
+        (if (has-feature? rdr feature opts)
+          ;; feature matched, read selected form
+          (doto (read* rdr false READ_EOF \) opts pending-forms)
+            (check-eof-error rdr first-line)
+            (check-invalid-read-cond rdr first-line))
+          ;; feature not matched, ignore next form
+          (or (read-suppress first-line rdr opts pending-forms)
+              NO_MATCH))))))
+
+(defn- read-cond-delimited
+  [rdr splicing opts pending-forms]
+  (let [first-line (if (indexing-reader? rdr) (get-line-number rdr) -1)
+        result (loop [matched NO_MATCH
+                      finished nil]
+                 (cond
+                  ;; still looking for match, read feature+form
+                  (identical? matched NO_MATCH)
+                  (let [match (match-feature first-line rdr opts pending-forms)]
+                    (if (identical? match READ_FINISHED)
+                      READ_FINISHED
+                      (recur match nil)))
+
+                  ;; found match, just read and ignore the rest
+                  (not (identical? finished READ_FINISHED))
+                  (recur matched (read-suppress first-line rdr opts pending-forms))
+
+                  :else
+                  matched))]
+    (if (identical? result READ_FINISHED)
+      rdr
+      (if splicing
+        (do
+          (if (implements? ISequential result)
+            (do
+              (garray/insertArrayAt pending-forms (to-array result) 0)
+              rdr)
+            (err/reader-error rdr "Spliced form list in read-cond-splicing must implement ISequential")))
+        result))))
+
+(defn- read-cond
+  [^not-native rdr _ opts pending-forms]
+  (when (not (and opts (#{:allow :preserve} (:read-cond opts))))
+    (throw (ex-info "Conditional read not allowed"
+                    {:type :runtime-exception})))
+  (if-let [ch (read-char rdr)]
+    (let [splicing (= ch \@)
+          ch (if splicing (read-char rdr) ch)]
+      (when splicing
+        (when-not *read-delim*
+          (err/reader-error rdr "cond-splice not in list")))
+      (if-let [ch (if (whitespace? ch) (read-past whitespace? rdr) ch)]
+        (if (not= ch \()
+          (throw (ex-info "read-cond body must be a list"
+                          {:type :runtime-exception}))
+          (binding [*suppress-read* (or *suppress-read* (= :preserve (:read-cond opts)))]
+            (if *suppress-read*
+              (reader-conditional (read-list rdr ch opts pending-forms) splicing)
+              (read-cond-delimited rdr splicing opts pending-forms))))
+        (err/throw-eof-in-character rdr)))
+    (err/throw-eof-in-character rdr)))
+
+(def ^:private ^:dynamic arg-env nil)
+
+(defn- garg
+  "Get a symbol for an anonymous ?argument?"
+  [n]
+  (symbol (str (if (== -1 n) "rest" (str "p" n))
+               "__" (next-id) "#")))
+
+(defn- read-fn
+  [rdr _ opts pending-forms]
+  (if arg-env
+    (throw (ex-info "Nested #()s are not allowed" {:type :illegal-state})))
+  (binding [arg-env (sorted-map)]
+    (let [form (read* (doto rdr (unread \()) true nil opts pending-forms) ;; this sets bindings
+          rargs (rseq arg-env)
+          args (if rargs
+                 (let [higharg (key (first rargs))]
+                   (let [args (loop [i 1 args (transient [])]
+                                (if (> i higharg)
+                                  (persistent! args)
+                                  (recur (inc i) (conj! args (or (get arg-env i)
+                                                                 (garg i))))))
+                         args (if (arg-env -1)
+                                (conj args '& (arg-env -1))
+                                args)]
+                     args))
+                 [])]
+      (list 'fn* args form))))
+
+(defn- register-arg
+  "Registers an argument to the arg-env"
+  [n]
+  (if arg-env
+    (if-let [ret (arg-env n)]
+      ret
+      (let [g (garg n)]
+        (set! arg-env (assoc arg-env n g))
+        g))
+    (throw (ex-info "Arg literal not in #()"
+                    {:type :illegal-state})))) ;; should never hit this
+
+(declare read-symbol)
+
+(defn- read-arg
+  [^not-native rdr pct opts pending-forms]
+  (if (nil? arg-env)
+    (read-symbol rdr pct)
+    (let [ch (peek-char rdr)]
+      (cond
+       (or (whitespace? ch)
+           (macro-terminating? ch)
+           (nil? ch))
+       (register-arg 1)
+
+       (= ch \&)
+       (do (read-char rdr)
+           (register-arg -1))
+
+       :else
+       (let [n (read* rdr true nil opts pending-forms)]
+         (if-not (integer? n)
+           (throw (ex-info "Arg literal must be %, %& or %integer"
+                           {:type :illegal-state}))
+           (register-arg n)))))))
+
+(def ^:private ^:dynamic gensym-env nil)
+
+(defn- read-unquote
+  [^not-native rdr comma opts pending-forms]
+  (if-let [ch (peek-char rdr)]
+    (if (= \@ ch)
+      ((wrapping-reader 'clojure.core/unquote-splicing) (doto rdr read-char) \@ opts pending-forms)
+      ((wrapping-reader 'clojure.core/unquote) rdr \~ opts pending-forms))))
+
+(declare syntax-quote*)
+
+(defn- unquote-splicing? [form]
+  (and (seq? form)
+       (= (first form) 'clojure.core/unquote-splicing)))
+
+(defn- unquote? [form]
+  (and (seq? form)
+       (= (first form) 'clojure.core/unquote)))
+
+(defn- expand-list
+  "Expand a list by resolving its syntax quotes and unquotes"
+  [s]
+  (loop [s (seq s) r (transient [])]
+    (if s
+      (let [item (first s)
+            ret (conj! r
+                       (cond
+                        (unquote? item)          (list 'clojure.core/list (second item))
+                        (unquote-splicing? item) (second item)
+                        :else                    (list 'clojure.core/list (syntax-quote* item))))]
+        (recur (next s) ret))
+      (seq (persistent! r)))))
+
+(defn- flatten-map
+  "Flatten a map into a seq of alternate keys and values"
+  [form]
+  (loop [s (seq form) key-vals (transient [])]
+    (if s
+      (let [e (first s)]
+        (recur (next s) (-> key-vals
+                          (conj! (key e))
+                          (conj! (val e)))))
+      (seq (persistent! key-vals)))))
+
+(defn- register-gensym [sym]
+  (if-not gensym-env
+    (throw (ex-info "Gensym literal not in syntax-quote"
+                    {:type :illegal-state})))
+  (or (get gensym-env sym)
+      (let [gs (symbol (str (subs (name sym)
+                                  0 (dec (count (name sym))))
+                            "__" (next-id) "__auto__"))]
+        (set! gensym-env (assoc gensym-env sym gs))
+        gs)))
+
+(defn- add-meta [form ret]
+  (if (and (implements? IWithMeta form)
+           (seq (dissoc (meta form) :line :column :end-line :end-column :file :source)))
+    (list 'cljs.core/with-meta ret (syntax-quote* (meta form)))
+    ret))
+
+(defn- syntax-quote-coll [type coll]
+  (let [res (list 'cljs.core/sequence
+                  (cons 'cljs.core/concat
+                        (expand-list coll)))]
+    (if type
+      (list 'cljs.core/apply type res)
+      res)))
+
+(defn map-func
+  "Decide which map type to use, array-map if less than 16 elements"
+  [coll]
+  (if (>= (count coll) 16)
+    'cljs.core/hash-map
+    'cljs.core/array-map))
+
+(defn bool? [x]
+  (or (instance? js/Boolean x)
+      (true? x)
+      (false? x)))
+
+(defn ^:dynamic resolve-symbol
+  "Resolve a symbol s into its fully qualified namespace version"
+  [s]
+  (throw (ex-info "resolve-symbol is not implemented" {:sym s})))
+
+(defn- syntax-quote* [form]
+  (->>
+   (cond
+    (special-symbol? form) (list 'quote form)
+
+    (symbol? form)
+    (list 'quote
+          (if (and (not (namespace form))
+                   (gstring/endsWith (name form) "#"))
+            (register-gensym form)
+            (let [sym (str form)]
+              (if (gstring/endsWith sym ".")
+                (let [csym (symbol (subs sym 0 (dec (count sym))))]
+                  (symbol (str (resolve-symbol csym) ".")))
+                (resolve-symbol form)))))
+
+    (unquote? form) (second form)
+    (unquote-splicing? form) (throw (ex-info "unquote-splice not in list"
+                                             {:type :illegal-state}))
+
+    (coll? form)
+    (cond
+
+     (implements? IRecord form) form
+     (map? form) (syntax-quote-coll (map-func form) (flatten-map form))
+     (vector? form) (list 'cljs.core/vec (syntax-quote-coll nil form))
+     (set? form) (syntax-quote-coll 'cljs.core/hash-set form)
+     (or (seq? form) (list? form))
+     (let [seq (seq form)]
+       (if seq
+         (syntax-quote-coll nil seq)
+         '(cljs.core/list)))
+
+     :else (throw (ex-info "Unknown Collection type"
+                           {:type :unsupported-operation})))
+
+    (or (keyword? form)
+        (number? form)
+        (string? form)
+        (nil? form)
+        (bool? form)
+        (instance? js/RegExp form))
+    form
+
+    :else (list 'quote form))
+   (add-meta form)))
+
+(defn- read-syntax-quote
+  [rdr backquote opts pending-forms]
+  (binding [gensym-env {}]
+    (-> (read* rdr true nil opts pending-forms)
+      syntax-quote*)))
+
+(defn- read-namespaced-map
+  [rdr _ opts pending-forms]
+  (let [token (read-token rdr :namespaced-map (read-char rdr))]
+    (if-let [ns (cond
+                  (= token ":")
+                  (ns-name *ns*)
+
+                  (= \: (first token))
+                  (some-> token (subs 1) parse-symbol second' symbol resolve-ns)
+
+                  :else
+                  (some-> token parse-symbol second'))]
+
+      (let [ch (read-past whitespace? rdr)]
+        (if (identical? ch \{)
+          (let [items (read-delimited :namespaced-map \} rdr opts pending-forms)]
+            (when (odd? (count items))
+              (err/throw-odd-map rdr nil nil items))
+            (let [keys (namespace-keys (str ns) (take-nth 2 items))
+                  vals (take-nth 2 (rest items))]
+              (when-not (= (count (set keys)) (count keys))
+                (err/throw-dup-keys rdr :namespaced-map keys))
+              (zipmap keys vals)))
+              (err/throw-ns-map-no-map rdr token)))
+          (err/throw-bad-ns rdr token))))
+
+(defn- macros [ch]
+  (case ch
+    \" read-string*
+    \: read-keyword
+    \; read-comment
+    \' (wrapping-reader 'quote)
+    \@ (wrapping-reader 'clojure.core/deref)
+    \^ read-meta
+    \` read-syntax-quote
+    \~ read-unquote
+    \( read-list
+    \) read-unmatched-delimiter
+    \[ read-vector
+    \] read-unmatched-delimiter
+    \{ read-map
+    \} read-unmatched-delimiter
+    \\ read-char*
+    \% read-arg
+    \# read-dispatch
+    nil))
+
+(defn- dispatch-macros [ch]
+  (case ch
+    \^ read-meta                ;; deprecated
+    \' (wrapping-reader 'var)
+    \( read-fn
+    \{ read-set
+    \< (throwing-reader "Unreadable form")
+    \= (throwing-reader "read-eval not supported")
+    \" read-regex
+    \! read-comment
+    \_ read-discard
+    \? read-cond
+    \: read-namespaced-map
+    \# read-symbolic-value
+    nil))
+
+(defn- read-tagged [^not-native rdr initch opts pending-forms]
+  (let [tag (read* rdr true nil opts pending-forms)]
+    (if-not (symbol? tag)
+      (err/throw-bad-reader-tag rdr tag))
+    (if *suppress-read*
+      (tagged-literal tag (read* rdr true nil opts pending-forms))
+      (if-let [f (or (*data-readers* tag)
+                     (default-data-readers tag))]
+        (f (read* rdr true nil opts pending-forms))
+        (if-let [f *default-data-reader-fn*]
+          (f tag (read* rdr true nil opts pending-forms))
+          (err/throw-unknown-reader-tag rdr tag))))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; Public API
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(def ^:dynamic *data-readers*
+  "Map from reader tag symbols to data reader Vars.
+  Reader tags without namespace qualifiers are reserved for Clojure.
+  This light version of tools.reader has no implementation for default
+  reader tags such as #inst and #uuid."
+  {})
+
+(def ^:dynamic *default-data-reader-fn*
+  "When no data reader is found for a tag and *default-data-reader-fn*
+  is non-nil, it will be called with two arguments, the tag and the value.
+  If *default-data-reader-fn* is nil (the default value), an exception
+  will be thrown for the unknown tag."
+  nil)
+
+(def ^:dynamic *suppress-read* false)
+
+(def default-data-readers
+  "Default map of data reader functions provided by Clojure.
+  May be overridden by binding *data-readers*"
+  {})
+
+(defn- read*-internal
+  [^not-native reader ^boolean eof-error? sentinel return-on opts pending-forms]
+  (loop []
+    (log-source reader
+      (if-not ^boolean (garray/isEmpty pending-forms)
+        (let [form (aget pending-forms 0)]
+          (garray/removeAt pending-forms 0)
+          form)
+        (let [ch (read-char reader)]
+          (cond
+            (whitespace? ch) (recur)
+            (nil? ch) (if eof-error? (err/throw-eof-error reader nil) sentinel)
+            (identical? ch return-on) READ_FINISHED
+            (number-literal? reader ch) (read-number reader ch)
+            :else (let [f (macros ch)]
+                    (if-not (nil? f)
+                      (let [res (f reader ch opts pending-forms)]
+                        (if (identical? res reader)
+                          (recur)
+                          res))
+                      (read-symbol reader ch)))))))))
+
+(defn- read*
+  ([reader eof-error? sentinel opts pending-forms]
+     (read* reader eof-error? sentinel nil opts pending-forms))
+  ([^not-native reader eof-error? sentinel return-on opts pending-forms]
+     (try
+       (read*-internal reader eof-error? sentinel return-on opts pending-forms)
+       (catch js/Error e
+         (if (ex-info? e)
+           (let [d (ex-data e)]
+             (if (= :reader-exception (:type d))
+               (throw e)
+               (throw (ex-info (.-message e)
+                               (merge {:type :reader-exception}
+                                      d
+                                      (if (indexing-reader? reader)
+                                        {:line   (get-line-number reader)
+                                         :column (get-column-number reader)
+                                         :file   (get-file-name reader)}))
+                               e))))
+           (throw (ex-info (.-message e)
+                           (merge {:type :reader-exception}
+                                  (if (indexing-reader? reader)
+                                    {:line   (get-line-number reader)
+                                     :column (get-column-number reader)
+                                     :file   (get-file-name reader)}))
+                           e)))))))
+
+(defn read
+  "Reads the first object from an IPushbackReader.
+   Returns the object read. If EOF, throws if eof-error? is true.
+   Otherwise returns sentinel. If no stream is providen, *in* will be used.
+
+   Opts is a persistent map with valid keys:
+    :read-cond - :allow to process reader conditionals, or
+                 :preserve to keep all branches
+    :features - persistent set of feature keywords for reader conditionals
+    :eof - on eof, return value unless :eofthrow, then throw.
+           if not specified, will throw
+
+   To read data structures only, use clojure.tools.reader.edn/read
+
+   Note that the function signature of clojure.tools.reader/read and
+   clojure.tools.reader.edn/read is not the same for eof-handling"
+  {:arglists '([] [reader] [opts reader] [reader eof-error? eof-value])}
+  ([reader] (read reader true nil))
+  ([{eof :eof :as opts :or {eof :eofthrow}} reader] (read* reader (= eof :eofthrow) eof nil opts (to-array [])))
+  ([reader eof-error? sentinel] (read* reader eof-error? sentinel nil {} (to-array []))))
+
+(defn read-string
+  "Reads one object from the string s.
+   Returns nil when s is nil or empty.
+
+   To read data structures only, use clojure.tools.reader.edn/read-string
+
+   Note that the function signature of clojure.tools.reader/read-string and
+   clojure.tools.reader.edn/read-string is not the same for eof-handling"
+  ([s]
+     (read-string {} s))
+  ([opts s]
+     (when (and s (not (identical? s "")))
+       (read opts (string-push-back-reader s)))))
diff --git a/js/cljs/tools/reader.cljs.cache.json b/js/cljs/tools/reader.cljs.cache.json
new file mode 100644
index 0000000..68a9014
--- /dev/null
+++ b/js/cljs/tools/reader.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$parseInt",["^ "],"~$isNaN",["^ "],"~$Error",["^ "],"~$String",["^ ","~$fromCharCode",["^ "]],"~$Object",["^ "],"~$Number",["^ ","~$NaN",["^ "],"~$NEGATIVE_INFINITY",["^ "],"~$POSITIVE_INFINITY",["^ "]],"~$Boolean",["^ "],"~$RegExp",["^ "]],"~:use-macros",["^ ","~$log-source","~$cljs.tools.reader.reader-types"],"~:excludes",["~#set",["~$char","~$*suppress-read*","~$*default-data-reader-fn*","~$read","~$default-data-readers","~$*data-readers*","~$read-line","~$read-string"]],"~:name","~$cljs.tools.reader","~:imports",["^ ","~$StringBuffer","~$goog.string.StringBuffer"],"~:requires",["^ ","~$cljs.tools.reader.impl.commons","^R","~$gstring","~$goog.string","^T","^T","~$cljs.tools.reader.impl.errors","^U","~$garray","~$goog.array","^A","^A","~$err","^U","^O","^P","~$cljs.tools.reader.impl.utils","^Y","^W","^W"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","~$match-number","^R","~$reader-conditional","^Y","~$whitespace?","^Y","~$read-comment","^R","^D","^Y","~$numeric?","^Y","~$ReaderConditional","^Y","~$unread","^A","~$peek-char","^A","~$parse-symbol","^R","~$second'","^Y","~$desugar-meta","^Y","~$next-id","^Y","~$number-literal?","^R","~$read-past","^R","~$indexing-reader?","^A","~$read-char","^A","~$get-column-number","^A","~$ex-info?","^Y","~$get-file-name","^A","~$reader-conditional?","^Y","~$throwing-reader","^R","~$string-push-back-reader","^A","~$namespace-keys","^Y","~$get-line-number","^A"],"~:defs",["^ ","~$NO_MATCH",["^ ","^L","~$cljs.tools.reader/NO_MATCH","~:file","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","~:line",484,"~:column",1,"~:end-line",484,"~:end-column",28,"~:private",true,"~:meta",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",484,"^1M",20,"^1N",484,"^1O",28,"^1P",true],"~:tag","~$object"],"~$READ_EOF",["^ ","^L","~$cljs.tools.reader/READ_EOF","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",197,"^1M",1,"^1N",197,"^1O",28,"^1P",true,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",197,"^1M",20,"^1N",197,"^1O",28,"^1P",true],"^1R","^1S"],"~$unquote-splicing?",["^ ","~:protocol-inline",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",633,"^1M",8,"^1N",633,"^1O",25,"^1P",true,"~:arglists",["~#list",["~$quote",["^1Y",[["~$form"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/unquote-splicing?","~:variadic",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",25,"~:method-params",["^1Y",[["^1["]]],"~:protocol-impl",null,"~:arglists-meta",["^1Y",[null,null]],"^1M",1,"^1L",633,"^1N",633,"~:max-fixed-arity",1,"~:fn-var",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1["]]]]]],"~$read-symbolic-value",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",439,"^1M",8,"^1N",439,"^1O",27,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$rdr","~$_","~$opts","~$pending-forms"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-symbolic-value","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",27,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",439,"^1N",439,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"~$read-tagged",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",824,"^1M",8,"^1N",824,"^1O",19,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$initch","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-tagged","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",19,"^22",["^1Y",[["^28","^2=","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",824,"^1N",824,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2=","^29","^2:"]]]]]],"~$starting-line-col-info",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",189,"^1M",8,"^1N",189,"^1O",30,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/starting-line-col-info","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",30,"^22",["^1Y",[["^28"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",189,"^1N",189,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28"]]]]]],"~$wrapping-reader",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",389,"^1M",8,"^1N",389,"^1O",23,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$sym"]]]]],"~:doc","Returns a function which wraps a reader in a call to sym"],"^1P",true,"^L","~$cljs.tools.reader/wrapping-reader","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",23,"^22",["^1Y",[["^2B"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",389,"^1N",389,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2B"]]]]],"^2C","Returns a function which wraps a reader in a call to sym"],"~$resolve-alias",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",360,"^1M",8,"^1N",360,"^1O",21,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2B"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/resolve-alias","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",21,"^22",["^1Y",[["^2B"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",360,"^1N",360,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2B"]]]]]],"~$read-meta",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",395,"^1M",8,"^1N",395,"^1O",17,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read metadata and return the following object with the metadata applied"],"^1P",true,"^L","~$cljs.tools.reader/read-meta","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",17,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",395,"^1N",395,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read metadata and return the following object with the metadata applied"],"~$read-unicode-char",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",108,"^1M",8,"^1N",108,"^1O",25,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$token","~$offset","~$length","~$base"],["^28","^2=","^2M","^2L","~$exact?"]]]]],"~:top-fn",["^ ","^21",false,"^25",5,"^22",["^1Y",[["^2J","^2K","^2L","^2M"],["^28","^2=","^2M","^2L","^2N"]]],"^1X",["^1Y",[["^2J","^2K","^2L","^2M"],["^28","^2=","^2M","^2L","^2N"]]],"^24",["^1Y",[null,null]]]],"^1P",true,"^L","~$cljs.tools.reader/read-unicode-char","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",25,"^2O",["^ ","^21",false,"^25",5,"^22",["^1Y",[["^2J","^2K","^2L","^2M"],["^28","^2=","^2M","^2L","^2N"]]],"^1X",["^1Y",[["^2J","^2K","^2L","^2M"],["^28","^2=","^2M","^2L","^2N"]]],"^24",["^1Y",[null,null]]],"^22",["^1Y",[["^2J","^2K","^2L","^2M"],["^28","^2=","^2M","^2L","^2N"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",108,"^1N",108,"^25",5,"^26",true,"^1X",["^1Y",[["^2J","^2K","^2L","^2M"],["^28","^2=","^2M","^2L","^2N"]]]],"~$char-code",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",102,"^1M",8,"^1N",102,"^1O",17,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$ch","^2M"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/char-code","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",17,"^22",["^1Y",[["^2R","^2M"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",102,"^1N",102,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2R","^2M"]]]]]],"~$read-unmatched-delimiter",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",77,"^1M",8,"^1N",77,"^1O",32,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2R","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-unmatched-delimiter","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",32,"^22",["^1Y",[["^28","^2R","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",77,"^1N",77,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2R","^29","^2:"]]]]]],"~$read-fn",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",565,"^1M",8,"^1N",565,"^1O",15,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-fn","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",15,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",565,"^1N",565,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"~$syntax-quote*",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",708,"^1M",8,"^1N",708,"^1O",21,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1["]]]]]],"^1P",true,"^L","~$cljs.tools.reader/syntax-quote*","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",21,"^22",["^1Y",[["^1["]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",708,"^1N",708,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1["]]]]]],"~$bool?",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",698,"^1M",7,"^1N",698,"^1O",12,"^1X",["^1Y",["^1Z",["^1Y",[["~$x"]]]]]],"^L","~$cljs.tools.reader/bool?","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",12,"^22",["^1Y",[["~$x"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",698,"^1N",698,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$x"]]]]]],"~$arg-env",["^ ","^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",557,"^1M",26,"^1N",557,"^1O",33,"~:dynamic",true,"^1P",true],"^1P",true,"^L","~$cljs.tools.reader/arg-env","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",33,"^1M",1,"^31",true,"^1L",557,"^1N",557,"^1R","~$clj-nil"],"~$read-suppress",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",475,"^1M",8,"^1N",475,"^1O",21,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$first-line","^28","^29","^2:"]]]]],"^2C","Read next form and suppress. Return nil or READ_FINISHED."],"^1P",true,"^L","~$cljs.tools.reader/read-suppress","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",21,"^22",["^1Y",[["^35","^28","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",475,"^1N",475,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^35","^28","^29","^2:"]]]]],"^2C","Read next form and suppress. Return nil or READ_FINISHED."],"^E",["^ ","^L","~$cljs.tools.reader/*suppress-read*","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",855,"^1M",1,"^1N",855,"^1O",31,"^31",true,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",855,"^1M",16,"^1N",855,"^1O",31,"^31",true],"^1R","~$boolean"],"~$flatten-map",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",655,"^1M",8,"^1N",655,"^1O",19,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1["]]]]],"^2C","Flatten a map into a seq of alternate keys and values"],"^1P",true,"^L","~$cljs.tools.reader/flatten-map","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",19,"^22",["^1Y",[["^1["]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",655,"^1N",655,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1["]]]]],"^2C","Flatten a map into a seq of alternate keys and values"],"^F",["^ ","^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",848,"^1M",16,"^1N",848,"^1O",40,"^31",true],"^L","~$cljs.tools.reader/*default-data-reader-fn*","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",40,"^1M",1,"^31",true,"^1L",848,"^1N",848,"^1R","^33","^2C","When no data reader is found for a tag and *default-data-reader-fn*\n  is non-nil, it will be called with two arguments, the tag and the value.\n  If *default-data-reader-fn* is nil (the default value), an exception\n  will be thrown for the unknown tag."],"^G",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",911,"^1M",7,"^1N",911,"^1O",11,"^1X",["^1Y",["^1Z",["^1Y",[[],["~$reader"],["^29","^3<"],["^3<","~$eof-error?","~$eof-value"]]]]],"^2C","Reads the first object from an IPushbackReader.\n   Returns the object read. If EOF, throws if eof-error? is true.\n   Otherwise returns sentinel. If no stream is providen, *in* will be used.\n\n   Opts is a persistent map with valid keys:\n    :read-cond - :allow to process reader conditionals, or\n                 :preserve to keep all branches\n    :features - persistent set of feature keywords for reader conditionals\n    :eof - on eof, return value unless :eofthrow, then throw.\n           if not specified, will throw\n\n   To read data structures only, use clojure.tools.reader.edn/read\n\n   Note that the function signature of clojure.tools.reader/read and\n   clojure.tools.reader.edn/read is not the same for eof-handling","^2O",["^ ","^21",false,"^25",3,"^22",["^1Y",[["^3<"],[["^ ","~$eof","~:eof","~:as","^29","~:or",["^ ","^3?","~:eofthrow"]],"^3<"],["^3<","^3=","~$sentinel"]]],"^1X",["^1Y",[["^3<"],[["^ ","^3?","^3@","^3A","^29","^3B",["^ ","^3?","^3C"]],"^3<"],["^3<","^3=","^3D"]]],"^24",["^1Y",[null,null,null]]]],"^L","~$cljs.tools.reader/read","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",11,"^2O",["^ ","^21",false,"^25",3,"^22",["^1Y",[["^3<"],[["^ ","^3?","^3@","^3A","^29","^3B",["^ ","^3?","^3C"]],"^3<"],["^3<","^3=","^3D"]]],"^1X",["^1Y",[["^3<"],[["^ ","^3?","^3@","^3A","^29","^3B",["^ ","^3?","^3C"]],"^3<"],["^3<","^3=","^3D"]]],"^24",["^1Y",[null,null,null]]],"^22",["^1Y",[["^3<"],[["^ ","^3?","^3@","^3A","^29","^3B",["^ ","^3?","^3C"]],"^3<"],["^3<","^3=","^3D"]]],"^23",null,"^24",["^1Y",[null,null,null]],"^1M",1,"^1L",911,"^1N",911,"^25",3,"^26",true,"^1X",["^1Y",[["^3<"],[["^ ","^3?","^3@","^3A","^29","^3B",["^ ","^3?","^3C"]],"^3<"],["^3<","^3=","^3D"]]],"^2C","Reads the first object from an IPushbackReader.\n   Returns the object read. If EOF, throws if eof-error? is true.\n   Otherwise returns sentinel. If no stream is providen, *in* will be used.\n\n   Opts is a persistent map with valid keys:\n    :read-cond - :allow to process reader conditionals, or\n                 :preserve to keep all branches\n    :features - persistent set of feature keywords for reader conditionals\n    :eof - on eof, return value unless :eofthrow, then throw.\n           if not specified, will throw\n\n   To read data structures only, use clojure.tools.reader.edn/read\n\n   Note that the function signature of clojure.tools.reader/read and\n   clojure.tools.reader.edn/read is not the same for eof-handling"],"~$read-set",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",413,"^1M",8,"^1N",413,"^1O",16,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-set","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",16,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",413,"^1N",413,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"~$read-symbol",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",334,"^1M",8,"^1N",334,"^1O",19,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2="]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-symbol","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",19,"^22",["^1Y",[["^28","^2="]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",334,"^1N",334,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2="]]]]]],"~$read-unquote",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",624,"^1M",8,"^1N",624,"^1O",20,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$comma","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-unquote","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",20,"^22",["^1Y",[["^28","^3K","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",624,"^1N",624,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^3K","^29","^2:"]]]]]],"~$read-map",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",253,"^1M",8,"^1N",253,"^1O",16,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read in a map, including its location if the reader is an indexing reader"],"^1P",true,"^L","~$cljs.tools.reader/read-map","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",16,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",253,"^1N",253,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read in a map, including its location if the reader is an indexing reader"],"~$read*-internal",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",862,"^1M",8,"^1N",862,"^1O",22,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^3<","^3=","^3D","~$return-on","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read*-internal","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",22,"^22",["^1Y",[["^3<","^3=","^3D","^3P","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",862,"^1N",862,"^25",6,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^3<","^3=","^3D","^3P","^29","^2:"]]]]]],"~$unquote?",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",637,"^1M",8,"^1N",637,"^1O",16,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1["]]]]]],"^1P",true,"^L","~$cljs.tools.reader/unquote?","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",16,"^22",["^1Y",[["^1["]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",637,"^1N",637,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1["]]]]]],"^H",["^ ","^L","~$cljs.tools.reader/default-data-readers","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",857,"^1M",1,"^1N",857,"^1O",26,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",857,"^1M",6,"^1N",857,"^1O",26],"^2C","Default map of data reader functions provided by Clojure.\n  May be overridden by binding *data-readers*","^1R","~$cljs.core/IMap"],"~$macros",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",787,"^1M",8,"^1N",787,"^1O",14,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2R"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/macros","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",14,"^22",["^1Y",[["^2R"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",787,"^1N",787,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2R"]]]]]],"~$read-arg",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",600,"^1M",8,"^1N",600,"^1O",16,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$pct","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-arg","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",16,"^22",["^1Y",[["^28","^3Y","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",600,"^1N",600,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^3Y","^29","^2:"]]]]]],"~$match-feature",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",486,"^1M",8,"^1N",486,"^1O",21,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^35","^28","^29","^2:"]]]]],"^2C","Read next feature. If matched, read next form and return.\n   Otherwise, read and skip next form, returning READ_FINISHED or nil."],"^1P",true,"^L","~$cljs.tools.reader/match-feature","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",21,"^22",["^1Y",[["^35","^28","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",486,"^1N",486,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^35","^28","^29","^2:"]]]]],"^2C","Read next feature. If matched, read next form and return.\n   Otherwise, read and skip next form, returning READ_FINISHED or nil."],"~$read-namespaced-map",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",761,"^1M",8,"^1N",761,"^1O",27,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-namespaced-map","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",27,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",761,"^1N",761,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"~$read-syntax-quote",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",755,"^1M",8,"^1N",755,"^1O",25,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$backquote","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-syntax-quote","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",25,"^22",["^1Y",[["^28","^44","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",755,"^1N",755,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^44","^29","^2:"]]]]]],"~$READ_FINISHED",["^ ","^L","~$cljs.tools.reader/READ_FINISHED","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",198,"^1M",1,"^1N",198,"^1O",33,"^1P",true,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",198,"^1M",20,"^1N",198,"^1O",33,"^1P",true],"^1R","^1S"],"~$read-list",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",219,"^1M",8,"^1N",219,"^1O",17,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read in a list, including its location if the reader is an indexing reader"],"^1P",true,"^L","~$cljs.tools.reader/read-list","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",17,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",219,"^1N",219,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read in a list, including its location if the reader is an indexing reader"],"~$read-cond-delimited",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",505,"^1M",8,"^1N",505,"^1O",27,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$splicing","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-cond-delimited","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",27,"^22",["^1Y",[["^28","^4;","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",505,"^1N",505,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^4;","^29","^2:"]]]]]],"~$RESERVED_FEATURES",["^ ","^L","~$cljs.tools.reader/RESERVED_FEATURES","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",450,"^1M",1,"^1N",450,"^1O",33,"^1P",true,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",450,"^1M",16,"^1N",450,"^1O",33,"^1P",true],"^1R","~$cljs.core/ISet"],"~$dispatch-macros",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",808,"^1M",8,"^1N",808,"^1O",23,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2R"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/dispatch-macros","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",23,"^22",["^1Y",[["^2R"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",808,"^1N",808,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2R"]]]]]],"~$read*",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",884,"^1M",8,"^1N",884,"^1O",13,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^3<","^3=","^3D","^29","^2:"],["^3<","^3=","^3D","^3P","^29","^2:"]]]]],"^2O",["^ ","^21",false,"^25",6,"^22",["^1Y",[["^3<","^3=","^3D","^29","^2:"],["^3<","^3=","^3D","^3P","^29","^2:"]]],"^1X",["^1Y",[["^3<","^3=","^3D","^29","^2:"],["^3<","^3=","^3D","^3P","^29","^2:"]]],"^24",["^1Y",[null,null]]]],"^1P",true,"^L","~$cljs.tools.reader/read*","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",13,"^2O",["^ ","^21",false,"^25",6,"^22",["^1Y",[["^3<","^3=","^3D","^29","^2:"],["^3<","^3=","^3D","^3P","^29","^2:"]]],"^1X",["^1Y",[["^3<","^3=","^3D","^29","^2:"],["^3<","^3=","^3D","^3P","^29","^2:"]]],"^24",["^1Y",[null,null]]],"^22",["^1Y",[["^3<","^3=","^3D","^29","^2:"],["^3<","^3=","^3D","^3P","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",884,"^1N",884,"^25",6,"^26",true,"^1X",["^1Y",[["^3<","^3=","^3D","^29","^2:"],["^3<","^3=","^3D","^3P","^29","^2:"]]]],"^I",["^ ","^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",841,"^1M",16,"^1N",841,"^1O",30,"^31",true],"^L","~$cljs.tools.reader/*data-readers*","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",30,"^1M",1,"^31",true,"^1L",841,"^1N",841,"^1R","^3U","^2C","Map from reader tag symbols to data reader Vars.\n  Reader tags without namespace qualifiers are reserved for Clojure.\n  This light version of tools.reader has no implementation for default\n  reader tags such as #inst and #uuid."],"~$syntax-quote-coll",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",683,"^1M",8,"^1N",683,"^1O",25,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$type","~$coll"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/syntax-quote-coll","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",25,"^22",["^1Y",[["^4F","^4G"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",683,"^1N",683,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^4F","^4G"]]]]]],"~$*read-delim*",["^ ","^L","~$cljs.tools.reader/*read-delim*","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",200,"^1M",1,"^1N",200,"^1O",28,"^31",true,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",200,"^1M",16,"^1N",200,"^1O",28,"^31",true],"^1R","^38"],"~$resolve-symbol",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",703,"^1M",17,"^1N",703,"^1O",31,"^31",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$s"]]]]],"^2C","Resolve a symbol s into its fully qualified namespace version"],"^L","~$cljs.tools.reader/resolve-symbol","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",31,"^22",["^1Y",[["~$s"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^31",true,"^1L",703,"^1N",703,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$s"]]]]],"^2C","Resolve a symbol s into its fully qualified namespace version"],"~$read-delimited",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",213,"^1M",8,"^1N",213,"^1O",22,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$kind","~$delim","^28","^29","^2:"]]]]],"^2C","Reads and returns a collection ended with delim"],"^1P",true,"^L","~$cljs.tools.reader/read-delimited","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",22,"^22",["^1Y",[["^4N","^4O","^28","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",213,"^1N",213,"^25",5,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^4N","^4O","^28","^29","^2:"]]]]],"^2C","Reads and returns a collection ended with delim"],"~$read-token",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",48,"^1M",8,"^1N",48,"^1O",18,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^4N","^2="]]]]],"^2C","Read in a single logical token from the reader"],"^1P",true,"^L","~$cljs.tools.reader/read-token","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",18,"^22",["^1Y",[["^28","^4N","^2="]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",48,"^1N",48,"^25",3,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^4N","^2="]]]]],"^2C","Read in a single logical token from the reader"],"~$read-cond",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",535,"^1M",8,"^1N",535,"^1O",17,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-cond","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",17,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",535,"^1N",535,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"~$upper-limit",["^ ","^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",140,"^1M",24,"^1N",140,"^1O",35,"~:const",true,"^1P",true],"^1P",true,"^L","~$cljs.tools.reader/upper-limit","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",35,"^1M",1,"^4V",true,"^1L",140,"^1N",140,"^1R","~$any"],"~$loc-info",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",323,"^1M",8,"^1N",323,"^1O",16,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$line","~$column"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/loc-info","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",16,"^22",["^1Y",[["^28","^4Z","^4["]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",323,"^1N",323,"^25",3,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^4Z","^4["]]]]]],"~$gensym-env",["^ ","^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",622,"^1M",26,"^1N",622,"^1O",36,"^31",true,"^1P",true],"^1P",true,"^L","~$cljs.tools.reader/gensym-env","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",36,"^1M",1,"^31",true,"^1L",622,"^1N",622,"^1R","^33"],"~$*alias-map*",["^ ","^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",353,"^1M",16,"^1N",353,"^1O",27,"^31",true],"^L","~$cljs.tools.reader/*alias-map*","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",27,"^1M",1,"^31",true,"^1L",353,"^1N",353,"^1R","^33","^2C","Map from ns alias to ns, if non-nil, it will be used to resolve read-time\n   ns aliases.\n\n   Defaults to nil"],"~$read-regex",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",85,"^1M",7,"^1N",85,"^1O",17,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2R","^29","^2:"]]]]]],"^L","~$cljs.tools.reader/read-regex","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",17,"^22",["^1Y",[["^28","^2R","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",85,"^1N",85,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2R","^29","^2:"]]]]]],"~$sb",["^ ","^L","~$cljs.tools.reader/sb","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",46,"^1M",1,"^1N",46,"^1O",8,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",46,"^1M",6,"^1N",46,"^1O",8],"^1R","~$goog/string.StringBuffer"],"~$read-dispatch",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",69,"^1M",8,"^1N",69,"^1O",21,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-dispatch","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",21,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",69,"^1N",69,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]]],"~$check-eof-error",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",458,"^1M",8,"^1N",458,"^1O",23,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1[","^28","^35"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/check-eof-error","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",23,"^22",["^1Y",[["^1[","^28","^35"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",458,"^1N",458,"^25",3,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1[","^28","^35"]]]]]],"~$check-invalid-read-cond",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",468,"^1M",8,"^1N",468,"^1O",31,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1[","^28","^35"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/check-invalid-read-cond","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",31,"^22",["^1Y",[["^1[","^28","^35"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",468,"^1N",468,"^25",3,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1[","^28","^35"]]]]]],"^K",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",932,"^1M",7,"^1N",932,"^1O",18,"^1X",["^1Y",["^1Z",["^1Y",[["~$s"],["^29","~$s"]]]]],"^2C","Reads one object from the string s.\n   Returns nil when s is nil or empty.\n\n   To read data structures only, use clojure.tools.reader.edn/read-string\n\n   Note that the function signature of clojure.tools.reader/read-string and\n   clojure.tools.reader.edn/read-string is not the same for eof-handling","^2O",["^ ","^21",false,"^25",2,"^22",["^1Y",[["~$s"],["^29","~$s"]]],"^1X",["^1Y",[["~$s"],["^29","~$s"]]],"^24",["^1Y",[null,null]]]],"^L","~$cljs.tools.reader/read-string","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",18,"^2O",["^ ","^21",false,"^25",2,"^22",["^1Y",[["~$s"],["^29","~$s"]]],"^1X",["^1Y",[["~$s"],["^29","~$s"]]],"^24",["^1Y",[null,null]]],"^22",["^1Y",[["~$s"],["^29","~$s"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",932,"^1N",932,"^25",2,"^26",true,"^1X",["^1Y",[["~$s"],["^29","~$s"]]],"^2C","Reads one object from the string s.\n   Returns nil when s is nil or empty.\n\n   To read data structures only, use clojure.tools.reader.edn/read-string\n\n   Note that the function signature of clojure.tools.reader/read-string and\n   clojure.tools.reader.edn/read-string is not the same for eof-handling"],"~$check-reserved-features",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",463,"^1M",8,"^1N",463,"^1O",31,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^1["]]]]]],"^1P",true,"^L","~$cljs.tools.reader/check-reserved-features","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",31,"^22",["^1Y",[["^28","^1["]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",463,"^1N",463,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^1["]]]]]],"~$has-feature?",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",452,"^1M",8,"^1N",452,"^1O",20,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$feature","^29"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/has-feature?","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",20,"^22",["^1Y",[["^28","^5D","^29"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",452,"^1N",452,"^25",3,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^5D","^29"]]]]]],"~$valid-octal?",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",143,"^1M",8,"^1N",143,"^1O",20,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2J","^2M"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/valid-octal?","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",20,"^22",["^1Y",[["^2J","^2M"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",143,"^1N",143,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2J","^2M"]]]]]],"~$escape-char",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",290,"^1M",8,"^1N",290,"^1O",19,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^57","^28"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/escape-char","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",19,"^22",["^1Y",[["^57","^28"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",290,"^1N",290,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^57","^28"]]]]]],"~$read-char*",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",146,"^1M",8,"^1N",146,"^1O",18,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$backslash","^29","^2:"]]]]],"^2C","Read in a character literal"],"^1P",true,"^L","~$cljs.tools.reader/read-char*","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",18,"^22",["^1Y",[["^28","^5K","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",146,"^1N",146,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^5K","^29","^2:"]]]]],"^2C","Read in a character literal"],"~$resolve-ns",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",363,"^1M",8,"^1N",363,"^1O",18,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2B"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/resolve-ns","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",18,"^22",["^1Y",[["^2B"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",363,"^1N",363,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2B"]]]]]],"~$read-delimited-internal",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",202,"^1M",8,"^1N",202,"^1O",31,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^4N","^4O","^28","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-delimited-internal","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",31,"^22",["^1Y",[["^4N","^4O","^28","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",202,"^1N",202,"^25",5,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^4N","^4O","^28","^29","^2:"]]]]]],"~$read-string*",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",311,"^1M",8,"^1N",311,"^1O",20,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^3<","~$_","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-string*","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",20,"^22",["^1Y",[["^3<","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",311,"^1N",311,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^3<","~$_","^29","^2:"]]]]]],"~$macro-terminating?",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",41,"^1M",17,"^1N",41,"^1O",35,"^1R","^38","^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2R"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/macro-terminating?","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",35,"^22",["^1Y",[["^2R"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",41,"~:ret-tag","^38","^1N",41,"^25",1,"^1R","^38","^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2R"]]]]]],"~$map-func",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",691,"^1M",7,"^1N",691,"^1O",15,"^1X",["^1Y",["^1Z",["^1Y",[["^4G"]]]]],"^2C","Decide which map type to use, array-map if less than 16 elements"],"^L","~$cljs.tools.reader/map-func","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",15,"^22",["^1Y",[["^4G"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",691,"^1N",691,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^4G"]]]]],"^2C","Decide which map type to use, array-map if less than 16 elements"],"~$lower-limit",["^ ","^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",141,"^1M",24,"^1N",141,"^1O",35,"^4V",true,"^1P",true],"^1P",true,"^L","~$cljs.tools.reader/lower-limit","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",35,"^1M",1,"^4V",true,"^1L",141,"^1N",141,"^1R","^4X"],"~$ending-line-col-info",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",193,"^1M",8,"^1N",193,"^1O",28,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/ending-line-col-info","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",28,"^22",["^1Y",[["^28"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",193,"^1N",193,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28"]]]]]],"~$register-arg",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",586,"^1M",8,"^1N",586,"^1O",20,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$n"]]]]],"^2C","Registers an argument to the arg-env"],"^1P",true,"^L","~$cljs.tools.reader/register-arg","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",20,"^22",["^1Y",[["~$n"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",586,"^1N",586,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$n"]]]]],"^2C","Registers an argument to the arg-env"],"~$read-keyword",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",368,"^1M",8,"^1N",368,"^1O",20,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^3<","^2=","^29","^2:"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-keyword","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",20,"^22",["^1Y",[["^3<","^2=","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",368,"^1N",368,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^3<","^2=","^29","^2:"]]]]]],"~$read-discard",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",433,"^1M",8,"^1N",433,"^1O",20,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read and discard the first object from rdr"],"^1P",true,"^L","~$cljs.tools.reader/read-discard","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",20,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",433,"^1N",433,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read and discard the first object from rdr"],"~$garg",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",559,"^1M",8,"^1N",559,"^1O",12,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$n"]]]]],"^2C","Get a symbol for an anonymous ?argument?"],"^1P",true,"^L","~$cljs.tools.reader/garg","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",12,"^22",["^1Y",[["~$n"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",559,"^1N",559,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$n"]]]]],"^2C","Get a symbol for an anonymous ?argument?"],"~$read-vector",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",237,"^1M",8,"^1N",237,"^1O",19,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read in a vector, including its location if the reader is an indexing reader"],"^1P",true,"^L","~$cljs.tools.reader/read-vector","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",19,"^22",["^1Y",[["^28","~$_","^29","^2:"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",237,"^1N",237,"^25",4,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","~$_","^29","^2:"]]]]],"^2C","Read in a vector, including its location if the reader is an indexing reader"],"~$read-number",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",279,"^1M",8,"^1N",279,"^1O",19,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2="]]]]]],"^1P",true,"^L","~$cljs.tools.reader/read-number","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",19,"^22",["^1Y",[["^28","^2="]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",279,"^1N",279,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^28","^2="]]]]]],"~$add-meta",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",677,"^1M",8,"^1N",677,"^1O",16,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1[","~$ret"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/add-meta","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",16,"^22",["^1Y",[["^1[","^6="]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",677,"^1N",677,"^25",2,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^1[","^6="]]]]]],"~$register-gensym",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",666,"^1M",8,"^1N",666,"^1O",23,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2B"]]]]]],"^1P",true,"^L","~$cljs.tools.reader/register-gensym","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",23,"^22",["^1Y",[["^2B"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",666,"^1N",666,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["^2B"]]]]]],"~$expand-list",["^ ","^1W",null,"^1Q",["^ ","^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1L",641,"^1M",8,"^1N",641,"^1O",19,"^1P",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$s"]]]]],"^2C","Expand a list by resolving its syntax quotes and unquotes"],"^1P",true,"^L","~$cljs.tools.reader/expand-list","^21",false,"^1K","/home/julien/.cljs/.aot_cache/1.10.329/997FB71/cljs/tools/reader.cljs","^1O",19,"^22",["^1Y",[["~$s"]]],"^23",null,"^24",["^1Y",[null,null]],"^1M",1,"^1L",641,"^1N",641,"^25",1,"^26",true,"^1X",["^1Y",["^1Z",["^1Y",[["~$s"]]]]],"^2C","Expand a list by resolving its syntax quotes and unquotes"]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^A","^A"],"~:cljs.analyzer/constants",["^ ","~:seen",["^C",["~$&","~:features","~$clojure.core/list","~:namespaced-map","~$cljs.core/array-map","~:reader-exception","~:else","~$cljs.core/hash-map","~$cljs.core/apply","~:default","~:symbol","^:","^1K","~$cljs.core/concat","^1O","~:read-cond","~:type","~:preserve","~$Inf","~:source","~:string","~:vector","~$cljs.core/with-meta","~:allow","~:sym","^1M","~:illegal-state","~$clojure.core/unquote-splicing","^1L","~:list","~$fn*","~:keyword","~$clojure.core/deref","~$/","~$clojure.core/unquote","^1N","~$cljs.core/vec","~$-Inf","~$cljs.core/sequence","~:regex","~:unsupported-operation","~$var","^1Z","~:set","^3@","~$cljs.core/hash-set","~:character","~:map","~$cljs.core/list","^3C","~:runtime-exception","~:none"]],"~:order",["^7:","^7?","^6L","^72","^1K","^1L","^1M","^1N","^1O","^6X","^7@","^6W","^6P","~$/","^74","^7=","^:","^78","^6U","^7C","^6O","^6G","^6T","^6Z","^6R","^6S","^7B","^70","~$&","^73","^71","^76","^6H","^6V","^6Y","^79","^6Q","^6N","^6M","^6J","^6[","^1Z","^77","^7>","^7A","^7;","^6I","^75","^7<","^6K","^3@","^3C"]],"^2C","A clojure reader in clojure"]
\ No newline at end of file
diff --git a/js/cljs/tools/reader.js b/js/cljs/tools/reader.js
new file mode 100644
index 0000000..b9b57c9
--- /dev/null
+++ b/js/cljs/tools/reader.js
@@ -0,0 +1,1782 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('cljs.tools.reader');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('cljs.tools.reader.reader_types');
+goog.require('cljs.tools.reader.impl.utils');
+goog.require('cljs.tools.reader.impl.commons');
+goog.require('cljs.tools.reader.impl.errors');
+goog.require('goog.array');
+goog.require('goog.string');
+goog.require('goog.string.StringBuffer');
+
+
+
+
+
+
+cljs.tools.reader.macro_terminating_QMARK_ = (function cljs$tools$reader$macro_terminating_QMARK_(ch){
+var G__4747 = ch;
+switch (G__4747) {
+case "\"":
+case ";":
+case "@":
+case "^":
+case "`":
+case "~":
+case "(":
+case ")":
+case "[":
+case "]":
+case "{":
+case "}":
+case "\\":
+return true;
+
+break;
+default:
+return false;
+
+}
+});
+cljs.tools.reader.sb = (new goog.string.StringBuffer());
+/**
+ * Read in a single logical token from the reader
+ */
+cljs.tools.reader.read_token = (function cljs$tools$reader$read_token(rdr,kind,initch){
+if((initch == null)){
+return cljs.tools.reader.impl.errors.throw_eof_at_start(rdr,kind);
+} else {
+cljs.tools.reader.sb.clear();
+
+var ch = initch;
+while(true){
+if(((cljs.tools.reader.impl.utils.whitespace_QMARK_(ch)) || (cljs.tools.reader.macro_terminating_QMARK_(ch)) || ((ch == null)))){
+if((ch == null)){
+} else {
+rdr.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2(null,ch);
+}
+
+return cljs.tools.reader.sb.toString();
+} else {
+cljs.tools.reader.sb.append(ch);
+
+var G__4749 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+ch = G__4749;
+continue;
+}
+break;
+}
+}
+});
+cljs.tools.reader.read_dispatch = (function cljs$tools$reader$read_dispatch(rdr,_,opts,pending_forms){
+var temp__5455__auto__ = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(cljs.core.truth_(temp__5455__auto__)){
+var ch = temp__5455__auto__;
+var temp__5455__auto____$1 = (cljs.tools.reader.dispatch_macros.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.dispatch_macros.cljs$core$IFn$_invoke$arity$1(ch) : cljs.tools.reader.dispatch_macros.call(null,ch));
+if(cljs.core.truth_(temp__5455__auto____$1)){
+var dm = temp__5455__auto____$1;
+return (dm.cljs$core$IFn$_invoke$arity$4 ? dm.cljs$core$IFn$_invoke$arity$4(rdr,ch,opts,pending_forms) : dm.call(null,rdr,ch,opts,pending_forms));
+} else {
+var G__4750 = (function (){var G__4754 = rdr;
+G__4754.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2(null,ch);
+
+return G__4754;
+})();
+var G__4751 = ch;
+var G__4752 = opts;
+var G__4753 = pending_forms;
+return (cljs.tools.reader.read_tagged.cljs$core$IFn$_invoke$arity$4 ? cljs.tools.reader.read_tagged.cljs$core$IFn$_invoke$arity$4(G__4750,G__4751,G__4752,G__4753) : cljs.tools.reader.read_tagged.call(null,G__4750,G__4751,G__4752,G__4753));
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_eof_at_dispatch(rdr);
+}
+});
+cljs.tools.reader.read_unmatched_delimiter = (function cljs$tools$reader$read_unmatched_delimiter(rdr,ch,opts,pending_forms){
+return cljs.tools.reader.impl.errors.throw_unmatch_delimiter(rdr,ch);
+});
+cljs.tools.reader.read_regex = (function cljs$tools$reader$read_regex(rdr,ch,opts,pending_forms){
+var sb = (new goog.string.StringBuffer());
+var ch__$1 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+while(true){
+if(("\"" === ch__$1)){
+return cljs.core.re_pattern([cljs.core.str.cljs$core$IFn$_invoke$arity$1(sb)].join(''));
+} else {
+if((ch__$1 == null)){
+return cljs.tools.reader.impl.errors.throw_eof_reading.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.cst$kw$regex,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([sb], 0));
+} else {
+sb.append(ch__$1);
+
+if(("\\" === ch__$1)){
+var ch_4755__$2 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if((ch_4755__$2 == null)){
+cljs.tools.reader.impl.errors.throw_eof_reading.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.cst$kw$regex,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([sb], 0));
+} else {
+}
+
+sb.append(ch_4755__$2);
+} else {
+}
+
+var G__4756 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+ch__$1 = G__4756;
+continue;
+}
+}
+break;
+}
+});
+cljs.tools.reader.char_code = (function cljs$tools$reader$char_code(ch,base){
+var code = parseInt(ch,base);
+if(cljs.core.truth_(isNaN(code))){
+return (-1);
+} else {
+return code;
+}
+});
+cljs.tools.reader.read_unicode_char = (function cljs$tools$reader$read_unicode_char(var_args){
+var G__4758 = arguments.length;
+switch (G__4758) {
+case 4:
+return cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$4 = (function (token,offset,length,base){
+var l = (offset + length);
+if((cljs.core.count(token) === l)){
+} else {
+cljs.tools.reader.impl.errors.throw_invalid_unicode_literal(null,token);
+}
+
+var i = offset;
+var uc = (0);
+while(true){
+if((i === l)){
+return String.fromCharCode(uc);
+} else {
+var d = cljs.tools.reader.char_code(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(token,i),base);
+if((d === (-1))){
+return cljs.tools.reader.impl.errors.throw_invalid_unicode_digit_in_token(null,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(token,i),token);
+} else {
+var G__4760 = (i + (1));
+var G__4761 = (d + (uc * base));
+i = G__4760;
+uc = G__4761;
+continue;
+}
+}
+break;
+}
+});
+
+cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$5 = (function (rdr,initch,base,length,exact_QMARK_){
+var i = (1);
+var uc = cljs.tools.reader.char_code(initch,base);
+while(true){
+if((uc === (-1))){
+return cljs.tools.reader.impl.errors.throw_invalid_unicode_digit(rdr,initch);
+} else {
+if(!((i === length))){
+var ch = rdr.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null);
+if(cljs.core.truth_((function (){var or__3936__auto__ = cljs.tools.reader.impl.utils.whitespace_QMARK_(ch);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (cljs.tools.reader.macros.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.macros.cljs$core$IFn$_invoke$arity$1(ch) : cljs.tools.reader.macros.call(null,ch));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+return (ch == null);
+}
+}
+})())){
+if(cljs.core.truth_(exact_QMARK_)){
+return cljs.tools.reader.impl.errors.throw_invalid_unicode_len(rdr,i,length);
+} else {
+return String.fromCharCode(uc);
+}
+} else {
+var d = cljs.tools.reader.char_code(ch,base);
+rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+
+if((d === (-1))){
+return cljs.tools.reader.impl.errors.throw_invalid_unicode_digit(rdr,ch);
+} else {
+var G__4762 = (i + (1));
+var G__4763 = (d + (uc * base));
+i = G__4762;
+uc = G__4763;
+continue;
+}
+}
+} else {
+return String.fromCharCode(uc);
+}
+}
+break;
+}
+});
+
+cljs.tools.reader.read_unicode_char.cljs$lang$maxFixedArity = 5;
+
+cljs.tools.reader.upper_limit = "\uD7FF".charCodeAt((0));
+cljs.tools.reader.lower_limit = "\uE000".charCodeAt((0));
+cljs.tools.reader.valid_octal_QMARK_ = (function cljs$tools$reader$valid_octal_QMARK_(token,base){
+return (parseInt(token,base) <= (255));
+});
+/**
+ * Read in a character literal
+ */
+cljs.tools.reader.read_char_STAR_ = (function cljs$tools$reader$read_char_STAR_(rdr,backslash,opts,pending_forms){
+var ch = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(!((ch == null))){
+var token = ((((cljs.tools.reader.macro_terminating_QMARK_(ch)) || (cljs.tools.reader.impl.utils.whitespace_QMARK_(ch))))?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(ch)].join(''):cljs.tools.reader.read_token(rdr,cljs.core.cst$kw$character,ch));
+var token_len = token.length;
+if(((1) === token_len)){
+return token.charAt((0));
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(token,"newline")){
+return "\n";
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(token,"space")){
+return " ";
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(token,"tab")){
+return "\t";
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(token,"backspace")){
+return "\b";
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(token,"formfeed")){
+return "\f";
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(token,"return")){
+return "\r";
+} else {
+if(cljs.core.truth_(goog.string.startsWith(token,"u"))){
+var c = cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$4(token,(1),(4),(16));
+var ic = c.charCodeAt((0));
+if((((ic > cljs.tools.reader.upper_limit)) && ((ic < cljs.tools.reader.lower_limit)))){
+return cljs.tools.reader.impl.errors.throw_invalid_character_literal(rdr,ic.toString((16)));
+} else {
+return c;
+}
+} else {
+if(cljs.core.truth_(goog.string.startsWith(token,"o"))){
+var len = (token_len - (1));
+if((len > (3))){
+return cljs.tools.reader.impl.errors.throw_invalid_octal_len(rdr,token);
+} else {
+var offset = (1);
+var base = (8);
+var uc = cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$4(token,offset,len,base);
+if(cljs.core.not(cljs.tools.reader.valid_octal_QMARK_(cljs.core.subs.cljs$core$IFn$_invoke$arity$2(token,offset),base))){
+return cljs.tools.reader.impl.errors.throw_bad_octal_number(rdr);
+} else {
+return uc;
+}
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_unsupported_character(rdr,token);
+
+}
+}
+}
+}
+}
+}
+}
+}
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_eof_in_character(rdr);
+}
+});
+cljs.tools.reader.starting_line_col_info = (function cljs$tools$reader$starting_line_col_info(rdr){
+if(cljs.core.truth_(cljs.tools.reader.reader_types.indexing_reader_QMARK_(rdr))){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [rdr.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1(null),((rdr.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1(null) - (1)) | (0))], null);
+} else {
+return null;
+}
+});
+cljs.tools.reader.ending_line_col_info = (function cljs$tools$reader$ending_line_col_info(rdr){
+if(cljs.core.truth_(cljs.tools.reader.reader_types.indexing_reader_QMARK_(rdr))){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [rdr.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1(null),rdr.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1(null)], null);
+} else {
+return null;
+}
+});
+if((typeof cljs !== 'undefined') && (typeof cljs.tools !== 'undefined') && (typeof cljs.tools.reader !== 'undefined') && (typeof cljs.tools.reader.READ_EOF !== 'undefined')){
+} else {
+cljs.tools.reader.READ_EOF = (new Object());
+}
+if((typeof cljs !== 'undefined') && (typeof cljs.tools !== 'undefined') && (typeof cljs.tools.reader !== 'undefined') && (typeof cljs.tools.reader.READ_FINISHED !== 'undefined')){
+} else {
+cljs.tools.reader.READ_FINISHED = (new Object());
+}
+cljs.tools.reader._STAR_read_delim_STAR_ = false;
+cljs.tools.reader.read_delimited_internal = (function cljs$tools$reader$read_delimited_internal(kind,delim,rdr,opts,pending_forms){
+var vec__4764 = cljs.tools.reader.starting_line_col_info(rdr);
+var start_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4764,(0),null);
+var start_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4764,(1),null);
+var delim__$1 = cljs.tools.reader.impl.utils.char$(delim);
+var a = cljs.core.transient$(cljs.core.PersistentVector.EMPTY);
+while(true){
+var form = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6(rdr,false,cljs.tools.reader.READ_EOF,delim__$1,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,false,cljs.tools.reader.READ_EOF,delim__$1,opts,pending_forms));
+if((form === cljs.tools.reader.READ_FINISHED)){
+return cljs.core.persistent_BANG_(a);
+} else {
+if((form === cljs.tools.reader.READ_EOF)){
+return cljs.tools.reader.impl.errors.throw_eof_delimited.cljs$core$IFn$_invoke$arity$5(rdr,kind,start_line,start_column,cljs.core.count(a));
+} else {
+var G__4767 = cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(a,form);
+a = G__4767;
+continue;
+}
+}
+break;
+}
+});
+/**
+ * Reads and returns a collection ended with delim
+ */
+cljs.tools.reader.read_delimited = (function cljs$tools$reader$read_delimited(kind,delim,rdr,opts,pending_forms){
+var _STAR_read_delim_STAR_4768 = cljs.tools.reader._STAR_read_delim_STAR_;
+cljs.tools.reader._STAR_read_delim_STAR_ = true;
+
+try{return cljs.tools.reader.read_delimited_internal(kind,delim,rdr,opts,pending_forms);
+}finally {cljs.tools.reader._STAR_read_delim_STAR_ = _STAR_read_delim_STAR_4768;
+}});
+/**
+ * Read in a list, including its location if the reader is an indexing reader
+ */
+cljs.tools.reader.read_list = (function cljs$tools$reader$read_list(rdr,_,opts,pending_forms){
+var vec__4769 = cljs.tools.reader.starting_line_col_info(rdr);
+var start_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4769,(0),null);
+var start_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4769,(1),null);
+var the_list = cljs.tools.reader.read_delimited(cljs.core.cst$kw$list,")",rdr,opts,pending_forms);
+var vec__4772 = cljs.tools.reader.ending_line_col_info(rdr);
+var end_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4772,(0),null);
+var end_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4772,(1),null);
+return cljs.core.with_meta(((cljs.core.empty_QMARK_(the_list))?cljs.core.List.EMPTY:cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.list,the_list)),(cljs.core.truth_(start_line)?cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(function (){var temp__5457__auto__ = cljs.tools.reader.reader_types.get_file_name(rdr);
+if(cljs.core.truth_(temp__5457__auto__)){
+var file = temp__5457__auto__;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$file,file], null);
+} else {
+return null;
+}
+})(),new cljs.core.PersistentArrayMap(null, 4, [cljs.core.cst$kw$line,start_line,cljs.core.cst$kw$column,start_column,cljs.core.cst$kw$end_DASH_line,end_line,cljs.core.cst$kw$end_DASH_column,end_column], null)], 0)):null));
+});
+/**
+ * Read in a vector, including its location if the reader is an indexing reader
+ */
+cljs.tools.reader.read_vector = (function cljs$tools$reader$read_vector(rdr,_,opts,pending_forms){
+var vec__4775 = cljs.tools.reader.starting_line_col_info(rdr);
+var start_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4775,(0),null);
+var start_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4775,(1),null);
+var the_vector = cljs.tools.reader.read_delimited(cljs.core.cst$kw$vector,"]",rdr,opts,pending_forms);
+var vec__4778 = cljs.tools.reader.ending_line_col_info(rdr);
+var end_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4778,(0),null);
+var end_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4778,(1),null);
+return cljs.core.with_meta(the_vector,(cljs.core.truth_(start_line)?cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(function (){var temp__5457__auto__ = cljs.tools.reader.reader_types.get_file_name(rdr);
+if(cljs.core.truth_(temp__5457__auto__)){
+var file = temp__5457__auto__;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$file,file], null);
+} else {
+return null;
+}
+})(),new cljs.core.PersistentArrayMap(null, 4, [cljs.core.cst$kw$line,start_line,cljs.core.cst$kw$column,start_column,cljs.core.cst$kw$end_DASH_line,end_line,cljs.core.cst$kw$end_DASH_column,end_column], null)], 0)):null));
+});
+/**
+ * Read in a map, including its location if the reader is an indexing reader
+ */
+cljs.tools.reader.read_map = (function cljs$tools$reader$read_map(rdr,_,opts,pending_forms){
+var vec__4781 = cljs.tools.reader.starting_line_col_info(rdr);
+var start_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4781,(0),null);
+var start_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4781,(1),null);
+var the_map = cljs.tools.reader.read_delimited(cljs.core.cst$kw$map,"}",rdr,opts,pending_forms);
+var map_count = cljs.core.count(the_map);
+var ks = cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2((2),the_map);
+var key_set = cljs.core.set(ks);
+var vec__4784 = cljs.tools.reader.ending_line_col_info(rdr);
+var end_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4784,(0),null);
+var end_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4784,(1),null);
+if(cljs.core.odd_QMARK_(map_count)){
+cljs.tools.reader.impl.errors.throw_odd_map(rdr,start_line,start_column,the_map);
+} else {
+}
+
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(key_set),cljs.core.count(ks))){
+} else {
+cljs.tools.reader.impl.errors.throw_dup_keys(rdr,cljs.core.cst$kw$map,ks);
+}
+
+return cljs.core.with_meta((((map_count <= ((2) * cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD)))?cljs.core.PersistentArrayMap.fromArray(cljs.core.to_array(the_map),true,true):cljs.core.PersistentHashMap.fromArray(cljs.core.to_array(the_map),true)),(cljs.core.truth_(start_line)?cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(function (){var temp__5457__auto__ = cljs.tools.reader.reader_types.get_file_name(rdr);
+if(cljs.core.truth_(temp__5457__auto__)){
+var file = temp__5457__auto__;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$file,file], null);
+} else {
+return null;
+}
+})(),new cljs.core.PersistentArrayMap(null, 4, [cljs.core.cst$kw$line,start_line,cljs.core.cst$kw$column,start_column,cljs.core.cst$kw$end_DASH_line,end_line,cljs.core.cst$kw$end_DASH_column,end_column], null)], 0)):null));
+});
+cljs.tools.reader.read_number = (function cljs$tools$reader$read_number(rdr,initch){
+var sb = (function (){var G__4787 = (new goog.string.StringBuffer());
+G__4787.append(initch);
+
+return G__4787;
+})();
+var ch = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+while(true){
+if(cljs.core.truth_((function (){var or__3936__auto__ = cljs.tools.reader.impl.utils.whitespace_QMARK_(ch);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (cljs.tools.reader.macros.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.macros.cljs$core$IFn$_invoke$arity$1(ch) : cljs.tools.reader.macros.call(null,ch));
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+return (ch == null);
+}
+}
+})())){
+var s = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(sb)].join('');
+rdr.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2(null,ch);
+
+var or__3936__auto__ = cljs.tools.reader.impl.commons.match_number(s);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.tools.reader.impl.errors.throw_invalid_number(rdr,s);
+}
+} else {
+var G__4789 = (function (){var G__4788 = sb;
+G__4788.append(ch);
+
+return G__4788;
+})();
+var G__4790 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+sb = G__4789;
+ch = G__4790;
+continue;
+}
+break;
+}
+});
+cljs.tools.reader.escape_char = (function cljs$tools$reader$escape_char(sb,rdr){
+var ch = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+var G__4791 = ch;
+switch (G__4791) {
+case "t":
+return "\t";
+
+break;
+case "r":
+return "\r";
+
+break;
+case "n":
+return "\n";
+
+break;
+case "\\":
+return "\\";
+
+break;
+case "\"":
+return "\"";
+
+break;
+case "b":
+return "\b";
+
+break;
+case "f":
+return "\f";
+
+break;
+case "u":
+var ch__$1 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(((-1) === parseInt((ch__$1 | (0)),(16)))){
+return cljs.tools.reader.impl.errors.throw_invalid_unicode_escape(rdr,ch__$1);
+} else {
+return cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$5(rdr,ch__$1,(16),(4),true);
+}
+
+break;
+default:
+if(cljs.tools.reader.impl.utils.numeric_QMARK_(ch)){
+var ch__$1 = cljs.tools.reader.read_unicode_char.cljs$core$IFn$_invoke$arity$5(rdr,ch,(8),(3),false);
+if(((ch__$1 | (0)) > (255))){
+return cljs.tools.reader.impl.errors.throw_bad_octal_number(rdr);
+} else {
+return ch__$1;
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_bad_escape_char(rdr,ch);
+}
+
+}
+});
+cljs.tools.reader.read_string_STAR_ = (function cljs$tools$reader$read_string_STAR_(reader,_,opts,pending_forms){
+var sb = (new goog.string.StringBuffer());
+var ch = reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+while(true){
+if((ch == null)){
+return cljs.tools.reader.impl.errors.throw_eof_reading.cljs$core$IFn$_invoke$arity$variadic(reader,cljs.core.cst$kw$string,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["\"",sb], 0));
+} else {
+var G__4793 = ch;
+switch (G__4793) {
+case "\\":
+var G__4797 = (function (){var G__4794 = sb;
+G__4794.append(cljs.tools.reader.escape_char(sb,reader));
+
+return G__4794;
+})();
+var G__4798 = reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+sb = G__4797;
+ch = G__4798;
+continue;
+
+break;
+case "\"":
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(sb)].join('');
+
+break;
+default:
+var G__4799 = (function (){var G__4795 = sb;
+G__4795.append(ch);
+
+return G__4795;
+})();
+var G__4800 = reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+sb = G__4799;
+ch = G__4800;
+continue;
+
+}
+}
+break;
+}
+});
+cljs.tools.reader.loc_info = (function cljs$tools$reader$loc_info(rdr,line,column){
+if((line == null)){
+return null;
+} else {
+var file = cljs.tools.reader.reader_types.get_file_name(rdr);
+var filem = (((file == null))?null:new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$file,file], null));
+var vec__4801 = cljs.tools.reader.ending_line_col_info(rdr);
+var end_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4801,(0),null);
+var end_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4801,(1),null);
+var lcm = new cljs.core.PersistentArrayMap(null, 4, [cljs.core.cst$kw$line,line,cljs.core.cst$kw$column,column,cljs.core.cst$kw$end_DASH_line,end_line,cljs.core.cst$kw$end_DASH_column,end_column], null);
+return cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([filem,lcm], 0));
+}
+});
+cljs.tools.reader.read_symbol = (function cljs$tools$reader$read_symbol(rdr,initch){
+var vec__4804 = cljs.tools.reader.starting_line_col_info(rdr);
+var line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4804,(0),null);
+var column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4804,(1),null);
+var token = cljs.tools.reader.read_token(rdr,cljs.core.cst$kw$symbol,initch);
+if((token == null)){
+return null;
+} else {
+var G__4807 = token;
+switch (G__4807) {
+case "nil":
+return null;
+
+break;
+case "true":
+return true;
+
+break;
+case "false":
+return false;
+
+break;
+case "/":
+return cljs.core.cst$sym$_SLASH_;
+
+break;
+default:
+var p = cljs.tools.reader.impl.commons.parse_symbol(token);
+if(!((p == null))){
+var sym = cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(p.cljs$core$IIndexed$_nth$arity$2(null,(0)),p.cljs$core$IIndexed$_nth$arity$2(null,(1)));
+return sym.cljs$core$IWithMeta$_with_meta$arity$2(null,cljs.tools.reader.loc_info(rdr,line,column));
+} else {
+return cljs.tools.reader.impl.errors.throw_invalid(rdr,cljs.core.cst$kw$symbol,token);
+}
+
+}
+}
+});
+/**
+ * Map from ns alias to ns, if non-nil, it will be used to resolve read-time
+ * ns aliases.
+ * 
+ * Defaults to nil
+ */
+cljs.tools.reader._STAR_alias_map_STAR_ = null;
+cljs.tools.reader.resolve_alias = (function cljs$tools$reader$resolve_alias(sym){
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.tools.reader._STAR_alias_map_STAR_,sym);
+});
+cljs.tools.reader.resolve_ns = (function cljs$tools$reader$resolve_ns(sym){
+var or__3936__auto__ = cljs.tools.reader.resolve_alias(sym);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var temp__5457__auto__ = cljs.core.find_ns(sym);
+if(cljs.core.truth_(temp__5457__auto__)){
+var ns = temp__5457__auto__;
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(cljs.core.ns_name(ns));
+} else {
+return null;
+}
+}
+});
+cljs.tools.reader.read_keyword = (function cljs$tools$reader$read_keyword(reader,initch,opts,pending_forms){
+var ch = reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(!(cljs.tools.reader.impl.utils.whitespace_QMARK_(ch))){
+var token = cljs.tools.reader.read_token(reader,cljs.core.cst$kw$keyword,ch);
+var s = cljs.tools.reader.impl.commons.parse_symbol(token);
+if(!((s == null))){
+var ns = s.cljs$core$IIndexed$_nth$arity$2(null,(0));
+var name = s.cljs$core$IIndexed$_nth$arity$2(null,(1));
+if((":" === token.charAt((0)))){
+if(!((ns == null))){
+var temp__5455__auto__ = cljs.tools.reader.resolve_alias(cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(cljs.core.subs.cljs$core$IFn$_invoke$arity$2(ns,(1))));
+if(cljs.core.truth_(temp__5455__auto__)){
+var ns__$1 = temp__5455__auto__;
+return cljs.core.keyword.cljs$core$IFn$_invoke$arity$2([cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns__$1)].join(''),name);
+} else {
+return cljs.tools.reader.impl.errors.throw_invalid(reader,cljs.core.cst$kw$keyword,[cljs.core.str.cljs$core$IFn$_invoke$arity$1(":"),cljs.core.str.cljs$core$IFn$_invoke$arity$1(token)].join(''));
+}
+} else {
+var temp__5455__auto__ = cljs.core._STAR_ns_STAR_;
+if(cljs.core.truth_(temp__5455__auto__)){
+var ns__$1 = temp__5455__auto__;
+return cljs.core.keyword.cljs$core$IFn$_invoke$arity$2([cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns__$1)].join(''),cljs.core.subs.cljs$core$IFn$_invoke$arity$2(name,(1)));
+} else {
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(reader,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid token: :",token], 0));
+}
+}
+} else {
+return cljs.core.keyword.cljs$core$IFn$_invoke$arity$2(ns,name);
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_invalid(reader,cljs.core.cst$kw$keyword,[cljs.core.str.cljs$core$IFn$_invoke$arity$1(":"),cljs.core.str.cljs$core$IFn$_invoke$arity$1(token)].join(''));
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_single_colon(reader);
+}
+});
+/**
+ * Returns a function which wraps a reader in a call to sym
+ */
+cljs.tools.reader.wrapping_reader = (function cljs$tools$reader$wrapping_reader(sym){
+return (function (rdr,_,opts,pending_forms){
+return (new cljs.core.List(null,sym,(new cljs.core.List(null,(cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms)),null,(1),null)),(2),null));
+});
+});
+/**
+ * Read metadata and return the following object with the metadata applied
+ */
+cljs.tools.reader.read_meta = (function cljs$tools$reader$read_meta(rdr,_,opts,pending_forms){
+if(((cljs.tools.reader.reader_types.source_logging_reader_QMARK_(rdr)) && (!(cljs.tools.reader.impl.utils.whitespace_QMARK_(cljs.tools.reader.reader_types.peek_char(rdr)))))){
+return cljs.tools.reader.reader_types.log_source_STAR_(rdr,(function (){
+var vec__4809 = cljs.tools.reader.starting_line_col_info(rdr);
+var line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4809,(0),null);
+var column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4809,(1),null);
+var m = cljs.tools.reader.impl.utils.desugar_meta((cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms)));
+if(cljs.core.map_QMARK_(m)){
+} else {
+cljs.tools.reader.impl.errors.throw_bad_metadata(rdr,m);
+}
+
+var o = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms));
+if(((!((o == null)))?(((((o.cljs$lang$protocol_mask$partition0$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IMeta$))))?true:false):false)){
+var m__$1 = (cljs.core.truth_((function (){var and__3925__auto__ = line;
+if(cljs.core.truth_(and__3925__auto__)){
+return cljs.core.seq_QMARK_(o);
+} else {
+return and__3925__auto__;
+}
+})())?cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(m,cljs.core.cst$kw$line,line,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$column,column], 0)):m);
+if(((!((o == null)))?(((((o.cljs$lang$protocol_mask$partition0$ & (262144))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IWithMeta$))))?true:false):false)){
+return cljs.core.with_meta(o,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.meta(o),m__$1], 0)));
+} else {
+return cljs.core.reset_meta_BANG_(o,m__$1);
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_bad_metadata_target(rdr,o);
+}
+}));
+} else {
+var vec__4814 = cljs.tools.reader.starting_line_col_info(rdr);
+var line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4814,(0),null);
+var column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4814,(1),null);
+var m = cljs.tools.reader.impl.utils.desugar_meta((cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms)));
+if(cljs.core.map_QMARK_(m)){
+} else {
+cljs.tools.reader.impl.errors.throw_bad_metadata(rdr,m);
+}
+
+var o = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms));
+if(((!((o == null)))?(((((o.cljs$lang$protocol_mask$partition0$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IMeta$))))?true:false):false)){
+var m__$1 = (cljs.core.truth_((function (){var and__3925__auto__ = line;
+if(cljs.core.truth_(and__3925__auto__)){
+return cljs.core.seq_QMARK_(o);
+} else {
+return and__3925__auto__;
+}
+})())?cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(m,cljs.core.cst$kw$line,line,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$column,column], 0)):m);
+if(((!((o == null)))?(((((o.cljs$lang$protocol_mask$partition0$ & (262144))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IWithMeta$))))?true:false):false)){
+return cljs.core.with_meta(o,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.meta(o),m__$1], 0)));
+} else {
+return cljs.core.reset_meta_BANG_(o,m__$1);
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_bad_metadata_target(rdr,o);
+}
+}
+});
+cljs.tools.reader.read_set = (function cljs$tools$reader$read_set(rdr,_,opts,pending_forms){
+var vec__4819 = cljs.tools.reader.starting_line_col_info(rdr);
+var start_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4819,(0),null);
+var start_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4819,(1),null);
+var start_column__$1 = (cljs.core.truth_(start_column)?((start_column - (1)) | (0)):null);
+var coll = cljs.tools.reader.read_delimited(cljs.core.cst$kw$set,"}",rdr,opts,pending_forms);
+var the_set = cljs.core.set(coll);
+var vec__4822 = cljs.tools.reader.ending_line_col_info(rdr);
+var end_line = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4822,(0),null);
+var end_column = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4822,(1),null);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(coll),cljs.core.count(the_set))){
+} else {
+cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.tools.reader.impl.errors.throw_dup_keys(rdr,cljs.core.cst$kw$set,coll)], 0));
+}
+
+return cljs.core.with_meta(the_set,(cljs.core.truth_(start_line)?cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(function (){var temp__5457__auto__ = cljs.tools.reader.reader_types.get_file_name(rdr);
+if(cljs.core.truth_(temp__5457__auto__)){
+var file = temp__5457__auto__;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$file,file], null);
+} else {
+return null;
+}
+})(),new cljs.core.PersistentArrayMap(null, 4, [cljs.core.cst$kw$line,start_line,cljs.core.cst$kw$column,start_column__$1,cljs.core.cst$kw$end_DASH_line,end_line,cljs.core.cst$kw$end_DASH_column,end_column], null)], 0)):null));
+});
+/**
+ * Read and discard the first object from rdr
+ */
+cljs.tools.reader.read_discard = (function cljs$tools$reader$read_discard(rdr,_,opts,pending_forms){
+var G__4825 = rdr;
+(cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(G__4825,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,G__4825,true,null,opts,pending_forms));
+
+return G__4825;
+});
+cljs.tools.reader.read_symbolic_value = (function cljs$tools$reader$read_symbolic_value(rdr,_,opts,pending_forms){
+var sym = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms));
+var G__4826 = sym;
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$sym$NaN,G__4826)){
+return Number.NaN;
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$sym$_DASH_Inf,G__4826)){
+return Number.NEGATIVE_INFINITY;
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$sym$Inf,G__4826)){
+return Number.POSITIVE_INFINITY;
+} else {
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([["Invalid token: ##",cljs.core.str.cljs$core$IFn$_invoke$arity$1(sym)].join('')], 0));
+
+}
+}
+}
+});
+cljs.tools.reader.RESERVED_FEATURES = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$else,null,cljs.core.cst$kw$none,null], null), null);
+cljs.tools.reader.has_feature_QMARK_ = (function cljs$tools$reader$has_feature_QMARK_(rdr,feature,opts){
+if((feature instanceof cljs.core.Keyword)){
+return ((cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$default,feature)) || (cljs.core.contains_QMARK_(cljs.core.get.cljs$core$IFn$_invoke$arity$2(opts,cljs.core.cst$kw$features),feature)));
+} else {
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Feature should be a keyword: ",feature], 0));
+}
+});
+cljs.tools.reader.check_eof_error = (function cljs$tools$reader$check_eof_error(form,rdr,first_line){
+if((form === cljs.tools.reader.READ_EOF)){
+return cljs.tools.reader.impl.errors.throw_eof_error(rdr,(function (){var and__3925__auto__ = (first_line < (0));
+if(and__3925__auto__){
+return first_line;
+} else {
+return and__3925__auto__;
+}
+})());
+} else {
+return null;
+}
+});
+cljs.tools.reader.check_reserved_features = (function cljs$tools$reader$check_reserved_features(rdr,form){
+if(cljs.core.truth_(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.tools.reader.RESERVED_FEATURES,form))){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Feature name ",form," is reserved"], 0));
+} else {
+return null;
+}
+});
+cljs.tools.reader.check_invalid_read_cond = (function cljs$tools$reader$check_invalid_read_cond(form,rdr,first_line){
+if((form === cljs.tools.reader.READ_FINISHED)){
+if((first_line < (0))){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["read-cond requires an even number of forms"], 0));
+} else {
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["read-cond starting on line ",first_line," requires an even number of forms"], 0));
+}
+} else {
+return null;
+}
+});
+/**
+ * Read next form and suppress. Return nil or READ_FINISHED.
+ */
+cljs.tools.reader.read_suppress = (function cljs$tools$reader$read_suppress(first_line,rdr,opts,pending_forms){
+var _STAR_suppress_read_STAR_4827 = cljs.tools.reader._STAR_suppress_read_STAR_;
+cljs.tools.reader._STAR_suppress_read_STAR_ = true;
+
+try{var form = (function (){var G__4828 = rdr;
+var G__4829 = false;
+var G__4830 = cljs.tools.reader.READ_EOF;
+var G__4831 = ")";
+var G__4832 = opts;
+var G__4833 = pending_forms;
+return (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6(G__4828,G__4829,G__4830,G__4831,G__4832,G__4833) : cljs.tools.reader.read_STAR_.call(null,G__4828,G__4829,G__4830,G__4831,G__4832,G__4833));
+})();
+cljs.tools.reader.check_eof_error(form,rdr,first_line);
+
+if((form === cljs.tools.reader.READ_FINISHED)){
+return cljs.tools.reader.READ_FINISHED;
+} else {
+return null;
+}
+}finally {cljs.tools.reader._STAR_suppress_read_STAR_ = _STAR_suppress_read_STAR_4827;
+}});
+if((typeof cljs !== 'undefined') && (typeof cljs.tools !== 'undefined') && (typeof cljs.tools.reader !== 'undefined') && (typeof cljs.tools.reader.NO_MATCH !== 'undefined')){
+} else {
+cljs.tools.reader.NO_MATCH = (new Object());
+}
+/**
+ * Read next feature. If matched, read next form and return.
+ * Otherwise, read and skip next form, returning READ_FINISHED or nil.
+ */
+cljs.tools.reader.match_feature = (function cljs$tools$reader$match_feature(first_line,rdr,opts,pending_forms){
+var feature = (function (){var G__4834 = rdr;
+var G__4835 = false;
+var G__4836 = cljs.tools.reader.READ_EOF;
+var G__4837 = ")";
+var G__4838 = opts;
+var G__4839 = pending_forms;
+return (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6(G__4834,G__4835,G__4836,G__4837,G__4838,G__4839) : cljs.tools.reader.read_STAR_.call(null,G__4834,G__4835,G__4836,G__4837,G__4838,G__4839));
+})();
+cljs.tools.reader.check_eof_error(feature,rdr,first_line);
+
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(feature,cljs.tools.reader.READ_FINISHED)){
+return cljs.tools.reader.READ_FINISHED;
+} else {
+cljs.tools.reader.check_reserved_features(rdr,feature);
+
+if(cljs.core.truth_(cljs.tools.reader.has_feature_QMARK_(rdr,feature,opts))){
+var G__4840 = (function (){var G__4841 = rdr;
+var G__4842 = false;
+var G__4843 = cljs.tools.reader.READ_EOF;
+var G__4844 = ")";
+var G__4845 = opts;
+var G__4846 = pending_forms;
+return (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6(G__4841,G__4842,G__4843,G__4844,G__4845,G__4846) : cljs.tools.reader.read_STAR_.call(null,G__4841,G__4842,G__4843,G__4844,G__4845,G__4846));
+})();
+cljs.tools.reader.check_eof_error(G__4840,rdr,first_line);
+
+cljs.tools.reader.check_invalid_read_cond(G__4840,rdr,first_line);
+
+return G__4840;
+} else {
+var or__3936__auto__ = cljs.tools.reader.read_suppress(first_line,rdr,opts,pending_forms);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.tools.reader.NO_MATCH;
+}
+}
+}
+});
+cljs.tools.reader.read_cond_delimited = (function cljs$tools$reader$read_cond_delimited(rdr,splicing,opts,pending_forms){
+var first_line = (cljs.core.truth_(cljs.tools.reader.reader_types.indexing_reader_QMARK_(rdr))?cljs.tools.reader.reader_types.get_line_number(rdr):(-1));
+var result = (function (){var matched = cljs.tools.reader.NO_MATCH;
+var finished = null;
+while(true){
+if((matched === cljs.tools.reader.NO_MATCH)){
+var match = cljs.tools.reader.match_feature(first_line,rdr,opts,pending_forms);
+if((match === cljs.tools.reader.READ_FINISHED)){
+return cljs.tools.reader.READ_FINISHED;
+} else {
+var G__4851 = match;
+var G__4852 = null;
+matched = G__4851;
+finished = G__4852;
+continue;
+}
+} else {
+if(!((finished === cljs.tools.reader.READ_FINISHED))){
+var G__4853 = matched;
+var G__4854 = cljs.tools.reader.read_suppress(first_line,rdr,opts,pending_forms);
+matched = G__4853;
+finished = G__4854;
+continue;
+} else {
+return matched;
+
+}
+}
+break;
+}
+})();
+if((result === cljs.tools.reader.READ_FINISHED)){
+return rdr;
+} else {
+if(cljs.core.truth_(splicing)){
+if(((!((result == null)))?(((((result.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === result.cljs$core$ISequential$))))?true:false):false)){
+var G__4848_4855 = pending_forms;
+var G__4849_4856 = cljs.core.to_array(result);
+var G__4850_4857 = (0);
+goog.array.insertArrayAt(G__4848_4855,G__4849_4856,G__4850_4857);
+
+return rdr;
+} else {
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Spliced form list in read-cond-splicing must implement ISequential"], 0));
+}
+} else {
+return result;
+}
+}
+});
+cljs.tools.reader.read_cond = (function cljs$tools$reader$read_cond(rdr,_,opts,pending_forms){
+if(cljs.core.not((function (){var and__3925__auto__ = opts;
+if(cljs.core.truth_(and__3925__auto__)){
+var G__4859 = cljs.core.cst$kw$read_DASH_cond.cljs$core$IFn$_invoke$arity$1(opts);
+var fexpr__4858 = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$preserve,null,cljs.core.cst$kw$allow,null], null), null);
+return (fexpr__4858.cljs$core$IFn$_invoke$arity$1 ? fexpr__4858.cljs$core$IFn$_invoke$arity$1(G__4859) : fexpr__4858.call(null,G__4859));
+} else {
+return and__3925__auto__;
+}
+})())){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("Conditional read not allowed",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$runtime_DASH_exception], null));
+} else {
+}
+
+var temp__5455__auto__ = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(cljs.core.truth_(temp__5455__auto__)){
+var ch = temp__5455__auto__;
+var splicing = cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(ch,"@");
+var ch__$1 = ((splicing)?rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null):ch);
+if(splicing){
+if(cljs.tools.reader._STAR_read_delim_STAR_){
+} else {
+cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["cond-splice not in list"], 0));
+}
+} else {
+}
+
+var temp__5455__auto____$1 = ((cljs.tools.reader.impl.utils.whitespace_QMARK_(ch__$1))?cljs.tools.reader.impl.commons.read_past(cljs.tools.reader.impl.utils.whitespace_QMARK_,rdr):ch__$1);
+if(cljs.core.truth_(temp__5455__auto____$1)){
+var ch__$2 = temp__5455__auto____$1;
+if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(ch__$2,"(")){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("read-cond body must be a list",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$runtime_DASH_exception], null));
+} else {
+var _STAR_suppress_read_STAR_4860 = cljs.tools.reader._STAR_suppress_read_STAR_;
+cljs.tools.reader._STAR_suppress_read_STAR_ = (function (){var or__3936__auto__ = cljs.tools.reader._STAR_suppress_read_STAR_;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$preserve,cljs.core.cst$kw$read_DASH_cond.cljs$core$IFn$_invoke$arity$1(opts));
+}
+})();
+
+try{if(cljs.core.truth_(cljs.tools.reader._STAR_suppress_read_STAR_)){
+return cljs.tools.reader.impl.utils.reader_conditional(cljs.tools.reader.read_list(rdr,ch__$2,opts,pending_forms),splicing);
+} else {
+return cljs.tools.reader.read_cond_delimited(rdr,splicing,opts,pending_forms);
+}
+}finally {cljs.tools.reader._STAR_suppress_read_STAR_ = _STAR_suppress_read_STAR_4860;
+}}
+} else {
+return cljs.tools.reader.impl.errors.throw_eof_in_character(rdr);
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_eof_in_character(rdr);
+}
+});
+cljs.tools.reader.arg_env = null;
+/**
+ * Get a symbol for an anonymous ?argument?
+ */
+cljs.tools.reader.garg = (function cljs$tools$reader$garg(n){
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1(((((-1) === n))?"rest":["p",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)].join(''))),"__",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.tools.reader.impl.utils.next_id()),"#"].join(''));
+});
+cljs.tools.reader.read_fn = (function cljs$tools$reader$read_fn(rdr,_,opts,pending_forms){
+if(cljs.core.truth_(cljs.tools.reader.arg_env)){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("Nested #()s are not allowed",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$illegal_DASH_state], null));
+} else {
+}
+
+var arg_env4861 = cljs.tools.reader.arg_env;
+cljs.tools.reader.arg_env = cljs.core.sorted_map();
+
+try{var form = (function (){var G__4862 = (function (){var G__4867 = rdr;
+cljs.tools.reader.reader_types.unread(G__4867,"(");
+
+return G__4867;
+})();
+var G__4863 = true;
+var G__4864 = null;
+var G__4865 = opts;
+var G__4866 = pending_forms;
+return (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(G__4862,G__4863,G__4864,G__4865,G__4866) : cljs.tools.reader.read_STAR_.call(null,G__4862,G__4863,G__4864,G__4865,G__4866));
+})();
+var rargs = cljs.core.rseq(cljs.tools.reader.arg_env);
+var args = ((rargs)?(function (){var higharg = cljs.core.key(cljs.core.first(rargs));
+var args = (function (){var i = (1);
+var args = cljs.core.transient$(cljs.core.PersistentVector.EMPTY);
+while(true){
+if((i > higharg)){
+return cljs.core.persistent_BANG_(args);
+} else {
+var G__4868 = (i + (1));
+var G__4869 = cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(args,(function (){var or__3936__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.tools.reader.arg_env,i);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.tools.reader.garg(i);
+}
+})());
+i = G__4868;
+args = G__4869;
+continue;
+}
+break;
+}
+})();
+var args__$1 = (cljs.core.truth_((cljs.tools.reader.arg_env.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.arg_env.cljs$core$IFn$_invoke$arity$1((-1)) : cljs.tools.reader.arg_env.call(null,(-1))))?cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(args,cljs.core.cst$sym$_AMPERSAND_,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(cljs.tools.reader.arg_env.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.arg_env.cljs$core$IFn$_invoke$arity$1((-1)) : cljs.tools.reader.arg_env.call(null,(-1)))], 0)):args);
+return args__$1;
+})():cljs.core.PersistentVector.EMPTY);
+return (new cljs.core.List(null,cljs.core.cst$sym$fn_STAR_,(new cljs.core.List(null,args,(new cljs.core.List(null,form,null,(1),null)),(2),null)),(3),null));
+}finally {cljs.tools.reader.arg_env = arg_env4861;
+}});
+/**
+ * Registers an argument to the arg-env
+ */
+cljs.tools.reader.register_arg = (function cljs$tools$reader$register_arg(n){
+if(cljs.core.truth_(cljs.tools.reader.arg_env)){
+var temp__5455__auto__ = (cljs.tools.reader.arg_env.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.arg_env.cljs$core$IFn$_invoke$arity$1(n) : cljs.tools.reader.arg_env.call(null,n));
+if(cljs.core.truth_(temp__5455__auto__)){
+var ret = temp__5455__auto__;
+return ret;
+} else {
+var g = cljs.tools.reader.garg(n);
+cljs.tools.reader.arg_env = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.tools.reader.arg_env,n,g);
+
+return g;
+}
+} else {
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("Arg literal not in #()",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$illegal_DASH_state], null));
+}
+});
+cljs.tools.reader.read_arg = (function cljs$tools$reader$read_arg(rdr,pct,opts,pending_forms){
+if((cljs.tools.reader.arg_env == null)){
+return cljs.tools.reader.read_symbol(rdr,pct);
+} else {
+var ch = rdr.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null);
+if(((cljs.tools.reader.impl.utils.whitespace_QMARK_(ch)) || (cljs.tools.reader.macro_terminating_QMARK_(ch)) || ((ch == null)))){
+return cljs.tools.reader.register_arg((1));
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(ch,"&")){
+rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+
+return cljs.tools.reader.register_arg((-1));
+} else {
+var n = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms));
+if(!(cljs.core.integer_QMARK_(n))){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("Arg literal must be %, %& or %integer",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$illegal_DASH_state], null));
+} else {
+return cljs.tools.reader.register_arg(n);
+}
+
+}
+}
+}
+});
+cljs.tools.reader.gensym_env = null;
+cljs.tools.reader.read_unquote = (function cljs$tools$reader$read_unquote(rdr,comma,opts,pending_forms){
+var temp__5455__auto__ = rdr.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null);
+if(cljs.core.truth_(temp__5455__auto__)){
+var ch = temp__5455__auto__;
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2("@",ch)){
+var G__4871 = (function (){var G__4875 = rdr;
+G__4875.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+
+return G__4875;
+})();
+var G__4872 = "@";
+var G__4873 = opts;
+var G__4874 = pending_forms;
+var fexpr__4870 = cljs.tools.reader.wrapping_reader(cljs.core.cst$sym$clojure$core_SLASH_unquote_DASH_splicing);
+return (fexpr__4870.cljs$core$IFn$_invoke$arity$4 ? fexpr__4870.cljs$core$IFn$_invoke$arity$4(G__4871,G__4872,G__4873,G__4874) : fexpr__4870.call(null,G__4871,G__4872,G__4873,G__4874));
+} else {
+var G__4877 = rdr;
+var G__4878 = "~";
+var G__4879 = opts;
+var G__4880 = pending_forms;
+var fexpr__4876 = cljs.tools.reader.wrapping_reader(cljs.core.cst$sym$clojure$core_SLASH_unquote);
+return (fexpr__4876.cljs$core$IFn$_invoke$arity$4 ? fexpr__4876.cljs$core$IFn$_invoke$arity$4(G__4877,G__4878,G__4879,G__4880) : fexpr__4876.call(null,G__4877,G__4878,G__4879,G__4880));
+}
+} else {
+return null;
+}
+});
+cljs.tools.reader.unquote_splicing_QMARK_ = (function cljs$tools$reader$unquote_splicing_QMARK_(form){
+return ((cljs.core.seq_QMARK_(form)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.first(form),cljs.core.cst$sym$clojure$core_SLASH_unquote_DASH_splicing)));
+});
+cljs.tools.reader.unquote_QMARK_ = (function cljs$tools$reader$unquote_QMARK_(form){
+return ((cljs.core.seq_QMARK_(form)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.first(form),cljs.core.cst$sym$clojure$core_SLASH_unquote)));
+});
+/**
+ * Expand a list by resolving its syntax quotes and unquotes
+ */
+cljs.tools.reader.expand_list = (function cljs$tools$reader$expand_list(s){
+var s__$1 = cljs.core.seq(s);
+var r = cljs.core.transient$(cljs.core.PersistentVector.EMPTY);
+while(true){
+if(s__$1){
+var item = cljs.core.first(s__$1);
+var ret = cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(r,(cljs.core.truth_(cljs.tools.reader.unquote_QMARK_(item))?(new cljs.core.List(null,cljs.core.cst$sym$clojure$core_SLASH_list,(new cljs.core.List(null,cljs.core.second(item),null,(1),null)),(2),null)):(cljs.core.truth_(cljs.tools.reader.unquote_splicing_QMARK_(item))?cljs.core.second(item):(new cljs.core.List(null,cljs.core.cst$sym$clojure$core_SLASH_list,(new cljs.core.List(null,(cljs.tools.reader.syntax_quote_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.syntax_quote_STAR_.cljs$core$IFn$_invoke$arity$1(item) : cljs.tools.reader.syntax_quote_STAR_.call(null,item)),null,(1),null)),(2),null))
+)));
+var G__4881 = cljs.core.next(s__$1);
+var G__4882 = ret;
+s__$1 = G__4881;
+r = G__4882;
+continue;
+} else {
+return cljs.core.seq(cljs.core.persistent_BANG_(r));
+}
+break;
+}
+});
+/**
+ * Flatten a map into a seq of alternate keys and values
+ */
+cljs.tools.reader.flatten_map = (function cljs$tools$reader$flatten_map(form){
+var s = cljs.core.seq(form);
+var key_vals = cljs.core.transient$(cljs.core.PersistentVector.EMPTY);
+while(true){
+if(s){
+var e = cljs.core.first(s);
+var G__4883 = cljs.core.next(s);
+var G__4884 = cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(key_vals,cljs.core.key(e)),cljs.core.val(e));
+s = G__4883;
+key_vals = G__4884;
+continue;
+} else {
+return cljs.core.seq(cljs.core.persistent_BANG_(key_vals));
+}
+break;
+}
+});
+cljs.tools.reader.register_gensym = (function cljs$tools$reader$register_gensym(sym){
+if(cljs.core.not(cljs.tools.reader.gensym_env)){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("Gensym literal not in syntax-quote",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$illegal_DASH_state], null));
+} else {
+}
+
+var or__3936__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.tools.reader.gensym_env,sym);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var gs = cljs.core.symbol.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.subs.cljs$core$IFn$_invoke$arity$3(cljs.core.name(sym),(0),(cljs.core.count(cljs.core.name(sym)) - (1)))),"__",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.tools.reader.impl.utils.next_id()),"__auto__"].join(''));
+cljs.tools.reader.gensym_env = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.tools.reader.gensym_env,sym,gs);
+
+return gs;
+}
+});
+cljs.tools.reader.add_meta = (function cljs$tools$reader$add_meta(form,ret){
+if((function (){var and__3925__auto__ = ((!((form == null)))?(((((form.cljs$lang$protocol_mask$partition0$ & (262144))) || ((cljs.core.PROTOCOL_SENTINEL === form.cljs$core$IWithMeta$))))?true:false):false);
+if(and__3925__auto__){
+return cljs.core.seq(cljs.core.dissoc.cljs$core$IFn$_invoke$arity$variadic(cljs.core.meta(form),cljs.core.cst$kw$line,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$column,cljs.core.cst$kw$end_DASH_line,cljs.core.cst$kw$end_DASH_column,cljs.core.cst$kw$file,cljs.core.cst$kw$source], 0)));
+} else {
+return and__3925__auto__;
+}
+})()){
+return (new cljs.core.List(null,cljs.core.cst$sym$cljs$core_SLASH_with_DASH_meta,(new cljs.core.List(null,ret,(new cljs.core.List(null,(function (){var G__4887 = cljs.core.meta(form);
+return (cljs.tools.reader.syntax_quote_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.syntax_quote_STAR_.cljs$core$IFn$_invoke$arity$1(G__4887) : cljs.tools.reader.syntax_quote_STAR_.call(null,G__4887));
+})(),null,(1),null)),(2),null)),(3),null));
+} else {
+return ret;
+}
+});
+cljs.tools.reader.syntax_quote_coll = (function cljs$tools$reader$syntax_quote_coll(type,coll){
+var res = (new cljs.core.List(null,cljs.core.cst$sym$cljs$core_SLASH_sequence,(new cljs.core.List(null,cljs.core.cons(cljs.core.cst$sym$cljs$core_SLASH_concat,cljs.tools.reader.expand_list(coll)),null,(1),null)),(2),null));
+if(cljs.core.truth_(type)){
+return (new cljs.core.List(null,cljs.core.cst$sym$cljs$core_SLASH_apply,(new cljs.core.List(null,type,(new cljs.core.List(null,res,null,(1),null)),(2),null)),(3),null));
+} else {
+return res;
+}
+});
+/**
+ * Decide which map type to use, array-map if less than 16 elements
+ */
+cljs.tools.reader.map_func = (function cljs$tools$reader$map_func(coll){
+if((cljs.core.count(coll) >= (16))){
+return cljs.core.cst$sym$cljs$core_SLASH_hash_DASH_map;
+} else {
+return cljs.core.cst$sym$cljs$core_SLASH_array_DASH_map;
+}
+});
+cljs.tools.reader.bool_QMARK_ = (function cljs$tools$reader$bool_QMARK_(x){
+return (((x instanceof Boolean)) || (x === true) || (x === false));
+});
+/**
+ * Resolve a symbol s into its fully qualified namespace version
+ */
+cljs.tools.reader.resolve_symbol = (function cljs$tools$reader$resolve_symbol(s){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("resolve-symbol is not implemented",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$sym,s], null));
+});
+cljs.tools.reader.syntax_quote_STAR_ = (function cljs$tools$reader$syntax_quote_STAR_(form){
+return cljs.tools.reader.add_meta(form,((cljs.core.special_symbol_QMARK_(form))?(new cljs.core.List(null,cljs.core.cst$sym$quote,(new cljs.core.List(null,form,null,(1),null)),(2),null)):(((form instanceof cljs.core.Symbol))?(new cljs.core.List(null,cljs.core.cst$sym$quote,(new cljs.core.List(null,(cljs.core.truth_((function (){var and__3925__auto__ = cljs.core.not(cljs.core.namespace(form));
+if(and__3925__auto__){
+var G__4890 = cljs.core.name(form);
+var G__4891 = "#";
+return goog.string.endsWith(G__4890,G__4891);
+} else {
+return and__3925__auto__;
+}
+})())?cljs.tools.reader.register_gensym(form):(function (){var sym = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(form)].join('');
+if(cljs.core.truth_(goog.string.endsWith(sym,"."))){
+var csym = cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(cljs.core.subs.cljs$core$IFn$_invoke$arity$3(sym,(0),(cljs.core.count(sym) - (1))));
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1((cljs.tools.reader.resolve_symbol.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.resolve_symbol.cljs$core$IFn$_invoke$arity$1(csym) : cljs.tools.reader.resolve_symbol.call(null,csym))),"."].join(''));
+} else {
+return (cljs.tools.reader.resolve_symbol.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.resolve_symbol.cljs$core$IFn$_invoke$arity$1(form) : cljs.tools.reader.resolve_symbol.call(null,form));
+}
+})()),null,(1),null)),(2),null)):(cljs.core.truth_(cljs.tools.reader.unquote_QMARK_(form))?cljs.core.second(form):(cljs.core.truth_(cljs.tools.reader.unquote_splicing_QMARK_(form))?(function(){throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("unquote-splice not in list",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$illegal_DASH_state], null))})():((cljs.core.coll_QMARK_(form))?((((!((form == null)))?(((((form.cljs$lang$protocol_mask$partition0$ & (67108864))) || ((cljs.core.PROTOCOL_SENTINEL === form.cljs$core$IRecord$))))?true:false):false))?form:((cljs.core.map_QMARK_(form))?cljs.tools.reader.syntax_quote_coll(cljs.tools.reader.map_func(form),cljs.tools.reader.flatten_map(form)):((cljs.core.vector_QMARK_(form))?(new cljs.core.List(null,cljs.core.cst$sym$cljs$core_SLASH_vec,(new cljs.core.List(null,cljs.tools.reader.syntax_quote_coll(null,form),null,(1),null)),(2),null)):((cljs.core.set_QMARK_(form))?cljs.tools.reader.syntax_quote_coll(cljs.core.cst$sym$cljs$core_SLASH_hash_DASH_set,form):((((cljs.core.seq_QMARK_(form)) || (cljs.core.list_QMARK_(form))))?(function (){var seq = cljs.core.seq(form);
+if(seq){
+return cljs.tools.reader.syntax_quote_coll(null,seq);
+} else {
+return cljs.core.list(cljs.core.cst$sym$cljs$core_SLASH_list);
+}
+})():(function(){throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("Unknown Collection type",new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$unsupported_DASH_operation], null))})()
+))))):(cljs.core.truth_((function (){var or__3936__auto__ = (form instanceof cljs.core.Keyword);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = typeof form === 'number';
+if(or__3936__auto____$1){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = typeof form === 'string';
+if(or__3936__auto____$2){
+return or__3936__auto____$2;
+} else {
+var or__3936__auto____$3 = (form == null);
+if(or__3936__auto____$3){
+return or__3936__auto____$3;
+} else {
+var or__3936__auto____$4 = cljs.tools.reader.bool_QMARK_(form);
+if(cljs.core.truth_(or__3936__auto____$4)){
+return or__3936__auto____$4;
+} else {
+return (form instanceof RegExp);
+}
+}
+}
+}
+}
+})())?form:(new cljs.core.List(null,cljs.core.cst$sym$quote,(new cljs.core.List(null,form,null,(1),null)),(2),null))
+)))))));
+});
+cljs.tools.reader.read_syntax_quote = (function cljs$tools$reader$read_syntax_quote(rdr,backquote,opts,pending_forms){
+var gensym_env4893 = cljs.tools.reader.gensym_env;
+cljs.tools.reader.gensym_env = cljs.core.PersistentArrayMap.EMPTY;
+
+try{return cljs.tools.reader.syntax_quote_STAR_((cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms)));
+}finally {cljs.tools.reader.gensym_env = gensym_env4893;
+}});
+cljs.tools.reader.read_namespaced_map = (function cljs$tools$reader$read_namespaced_map(rdr,_,opts,pending_forms){
+var token = cljs.tools.reader.read_token(rdr,cljs.core.cst$kw$namespaced_DASH_map,cljs.tools.reader.reader_types.read_char(rdr));
+var temp__5455__auto__ = ((cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(token,":"))?cljs.core.ns_name(cljs.core._STAR_ns_STAR_):((cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(":",cljs.core.first(token)))?(function (){var G__4894 = token;
+var G__4894__$1 = (((G__4894 == null))?null:cljs.core.subs.cljs$core$IFn$_invoke$arity$2(G__4894,(1)));
+var G__4894__$2 = (((G__4894__$1 == null))?null:cljs.tools.reader.impl.commons.parse_symbol(G__4894__$1));
+var G__4894__$3 = (((G__4894__$2 == null))?null:cljs.tools.reader.impl.utils.second_SINGLEQUOTE_(G__4894__$2));
+var G__4894__$4 = (((G__4894__$3 == null))?null:cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(G__4894__$3));
+if((G__4894__$4 == null)){
+return null;
+} else {
+return cljs.tools.reader.resolve_ns(G__4894__$4);
+}
+})():(function (){var G__4895 = token;
+var G__4895__$1 = (((G__4895 == null))?null:cljs.tools.reader.impl.commons.parse_symbol(G__4895));
+if((G__4895__$1 == null)){
+return null;
+} else {
+return cljs.tools.reader.impl.utils.second_SINGLEQUOTE_(G__4895__$1);
+}
+})()
+));
+if(cljs.core.truth_(temp__5455__auto__)){
+var ns = temp__5455__auto__;
+var ch = cljs.tools.reader.impl.commons.read_past(cljs.tools.reader.impl.utils.whitespace_QMARK_,rdr);
+if((ch === "{")){
+var items = cljs.tools.reader.read_delimited(cljs.core.cst$kw$namespaced_DASH_map,"}",rdr,opts,pending_forms);
+if(cljs.core.odd_QMARK_(cljs.core.count(items))){
+cljs.tools.reader.impl.errors.throw_odd_map(rdr,null,null,items);
+} else {
+}
+
+var keys = cljs.tools.reader.impl.utils.namespace_keys([cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns)].join(''),cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2((2),items));
+var vals = cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2((2),cljs.core.rest(items));
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(cljs.core.set(keys)),cljs.core.count(keys))){
+} else {
+cljs.tools.reader.impl.errors.throw_dup_keys(rdr,cljs.core.cst$kw$namespaced_DASH_map,keys);
+}
+
+return cljs.core.zipmap(keys,vals);
+} else {
+return cljs.tools.reader.impl.errors.throw_ns_map_no_map(rdr,token);
+}
+} else {
+return cljs.tools.reader.impl.errors.throw_bad_ns(rdr,token);
+}
+});
+cljs.tools.reader.macros = (function cljs$tools$reader$macros(ch){
+var G__4896 = ch;
+switch (G__4896) {
+case "\"":
+return cljs.tools.reader.read_string_STAR_;
+
+break;
+case ":":
+return cljs.tools.reader.read_keyword;
+
+break;
+case ";":
+return cljs.tools.reader.impl.commons.read_comment;
+
+break;
+case "'":
+return cljs.tools.reader.wrapping_reader(cljs.core.cst$sym$quote);
+
+break;
+case "@":
+return cljs.tools.reader.wrapping_reader(cljs.core.cst$sym$clojure$core_SLASH_deref);
+
+break;
+case "^":
+return cljs.tools.reader.read_meta;
+
+break;
+case "`":
+return cljs.tools.reader.read_syntax_quote;
+
+break;
+case "~":
+return cljs.tools.reader.read_unquote;
+
+break;
+case "(":
+return cljs.tools.reader.read_list;
+
+break;
+case ")":
+return cljs.tools.reader.read_unmatched_delimiter;
+
+break;
+case "[":
+return cljs.tools.reader.read_vector;
+
+break;
+case "]":
+return cljs.tools.reader.read_unmatched_delimiter;
+
+break;
+case "{":
+return cljs.tools.reader.read_map;
+
+break;
+case "}":
+return cljs.tools.reader.read_unmatched_delimiter;
+
+break;
+case "\\":
+return cljs.tools.reader.read_char_STAR_;
+
+break;
+case "%":
+return cljs.tools.reader.read_arg;
+
+break;
+case "#":
+return cljs.tools.reader.read_dispatch;
+
+break;
+default:
+return null;
+
+}
+});
+cljs.tools.reader.dispatch_macros = (function cljs$tools$reader$dispatch_macros(ch){
+var G__4898 = ch;
+switch (G__4898) {
+case "^":
+return cljs.tools.reader.read_meta;
+
+break;
+case "'":
+return cljs.tools.reader.wrapping_reader(cljs.core.cst$sym$var);
+
+break;
+case "(":
+return cljs.tools.reader.read_fn;
+
+break;
+case "{":
+return cljs.tools.reader.read_set;
+
+break;
+case "<":
+return cljs.tools.reader.impl.commons.throwing_reader("Unreadable form");
+
+break;
+case "=":
+return cljs.tools.reader.impl.commons.throwing_reader("read-eval not supported");
+
+break;
+case "\"":
+return cljs.tools.reader.read_regex;
+
+break;
+case "!":
+return cljs.tools.reader.impl.commons.read_comment;
+
+break;
+case "_":
+return cljs.tools.reader.read_discard;
+
+break;
+case "?":
+return cljs.tools.reader.read_cond;
+
+break;
+case ":":
+return cljs.tools.reader.read_namespaced_map;
+
+break;
+case "#":
+return cljs.tools.reader.read_symbolic_value;
+
+break;
+default:
+return null;
+
+}
+});
+cljs.tools.reader.read_tagged = (function cljs$tools$reader$read_tagged(rdr,initch,opts,pending_forms){
+var tag = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms));
+if(!((tag instanceof cljs.core.Symbol))){
+cljs.tools.reader.impl.errors.throw_bad_reader_tag(rdr,tag);
+} else {
+}
+
+if(cljs.core.truth_(cljs.tools.reader._STAR_suppress_read_STAR_)){
+return cljs.core.tagged_literal(tag,(cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms)));
+} else {
+var temp__5455__auto__ = (function (){var or__3936__auto__ = (cljs.tools.reader._STAR_data_readers_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader._STAR_data_readers_STAR_.cljs$core$IFn$_invoke$arity$1(tag) : cljs.tools.reader._STAR_data_readers_STAR_.call(null,tag));
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return (cljs.tools.reader.default_data_readers.cljs$core$IFn$_invoke$arity$1 ? cljs.tools.reader.default_data_readers.cljs$core$IFn$_invoke$arity$1(tag) : cljs.tools.reader.default_data_readers.call(null,tag));
+}
+})();
+if(cljs.core.truth_(temp__5455__auto__)){
+var f = temp__5455__auto__;
+var G__4900 = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms));
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__4900) : f.call(null,G__4900));
+} else {
+var temp__5455__auto____$1 = cljs.tools.reader._STAR_default_data_reader_fn_STAR_;
+if(cljs.core.truth_(temp__5455__auto____$1)){
+var f = temp__5455__auto____$1;
+var G__4901 = tag;
+var G__4902 = (cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 ? cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5(rdr,true,null,opts,pending_forms) : cljs.tools.reader.read_STAR_.call(null,rdr,true,null,opts,pending_forms));
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__4901,G__4902) : f.call(null,G__4901,G__4902));
+} else {
+return cljs.tools.reader.impl.errors.throw_unknown_reader_tag(rdr,tag);
+}
+}
+}
+});
+/**
+ * Map from reader tag symbols to data reader Vars.
+ *   Reader tags without namespace qualifiers are reserved for Clojure.
+ *   This light version of tools.reader has no implementation for default
+ *   reader tags such as #inst and #uuid.
+ */
+cljs.tools.reader._STAR_data_readers_STAR_ = cljs.core.PersistentArrayMap.EMPTY;
+/**
+ * When no data reader is found for a tag and *default-data-reader-fn*
+ *   is non-nil, it will be called with two arguments, the tag and the value.
+ *   If *default-data-reader-fn* is nil (the default value), an exception
+ *   will be thrown for the unknown tag.
+ */
+cljs.tools.reader._STAR_default_data_reader_fn_STAR_ = null;
+cljs.tools.reader._STAR_suppress_read_STAR_ = false;
+/**
+ * Default map of data reader functions provided by Clojure.
+ *   May be overridden by binding *data-readers*
+ */
+cljs.tools.reader.default_data_readers = cljs.core.PersistentArrayMap.EMPTY;
+cljs.tools.reader.read_STAR__internal = (function cljs$tools$reader$read_STAR__internal(reader,eof_error_QMARK_,sentinel,return_on,opts,pending_forms){
+while(true){
+if(((cljs.tools.reader.reader_types.source_logging_reader_QMARK_(reader)) && (!(cljs.tools.reader.impl.utils.whitespace_QMARK_(reader.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null)))))){
+return cljs.tools.reader.reader_types.log_source_STAR_(reader,(function (){
+while(true){
+if(!(goog.array.isEmpty(pending_forms))){
+var form = (pending_forms[(0)]);
+goog.array.removeAt(pending_forms,(0));
+
+return form;
+} else {
+var ch = reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(cljs.tools.reader.impl.utils.whitespace_QMARK_(ch)){
+continue;
+} else {
+if((ch == null)){
+if(eof_error_QMARK_){
+return cljs.tools.reader.impl.errors.throw_eof_error(reader,null);
+} else {
+return sentinel;
+}
+} else {
+if((ch === return_on)){
+return cljs.tools.reader.READ_FINISHED;
+} else {
+if(cljs.tools.reader.impl.commons.number_literal_QMARK_(reader,ch)){
+return cljs.tools.reader.read_number(reader,ch);
+} else {
+var f = cljs.tools.reader.macros(ch);
+if(!((f == null))){
+var res = (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(reader,ch,opts,pending_forms) : f.call(null,reader,ch,opts,pending_forms));
+if((res === reader)){
+continue;
+} else {
+return res;
+}
+} else {
+return cljs.tools.reader.read_symbol(reader,ch);
+}
+
+}
+}
+}
+}
+}
+break;
+}
+}));
+} else {
+if(!(goog.array.isEmpty(pending_forms))){
+var form = (pending_forms[(0)]);
+goog.array.removeAt(pending_forms,(0));
+
+return form;
+} else {
+var ch = reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(cljs.tools.reader.impl.utils.whitespace_QMARK_(ch)){
+continue;
+} else {
+if((ch == null)){
+if(eof_error_QMARK_){
+return cljs.tools.reader.impl.errors.throw_eof_error(reader,null);
+} else {
+return sentinel;
+}
+} else {
+if((ch === return_on)){
+return cljs.tools.reader.READ_FINISHED;
+} else {
+if(cljs.tools.reader.impl.commons.number_literal_QMARK_(reader,ch)){
+return cljs.tools.reader.read_number(reader,ch);
+} else {
+var f = cljs.tools.reader.macros(ch);
+if(!((f == null))){
+var res = (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(reader,ch,opts,pending_forms) : f.call(null,reader,ch,opts,pending_forms));
+if((res === reader)){
+continue;
+} else {
+return res;
+}
+} else {
+return cljs.tools.reader.read_symbol(reader,ch);
+}
+
+}
+}
+}
+}
+}
+}
+break;
+}
+});
+cljs.tools.reader.read_STAR_ = (function cljs$tools$reader$read_STAR_(var_args){
+var G__4904 = arguments.length;
+switch (G__4904) {
+case 5:
+return cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+case 6:
+return cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$5 = (function (reader,eof_error_QMARK_,sentinel,opts,pending_forms){
+return cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6(reader,eof_error_QMARK_,sentinel,null,opts,pending_forms);
+});
+
+cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6 = (function (reader,eof_error_QMARK_,sentinel,return_on,opts,pending_forms){
+try{return cljs.tools.reader.read_STAR__internal(reader,eof_error_QMARK_,sentinel,return_on,opts,pending_forms);
+}catch (e4905){if((e4905 instanceof Error)){
+var e = e4905;
+if(cljs.tools.reader.impl.utils.ex_info_QMARK_(e)){
+var d = cljs.core.ex_data(e);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$reader_DASH_exception,cljs.core.cst$kw$type.cljs$core$IFn$_invoke$arity$1(d))){
+throw e;
+} else {
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3(e.message,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$reader_DASH_exception], null),d,(cljs.core.truth_(cljs.tools.reader.reader_types.indexing_reader_QMARK_(reader))?new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$line,reader.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1(null),cljs.core.cst$kw$column,reader.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1(null),cljs.core.cst$kw$file,reader.cljs$tools$reader$reader_types$IndexingReader$get_file_name$arity$1(null)], null):null)], 0)),e);
+}
+} else {
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3(e.message,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$reader_DASH_exception], null),(cljs.core.truth_(cljs.tools.reader.reader_types.indexing_reader_QMARK_(reader))?new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$line,reader.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1(null),cljs.core.cst$kw$column,reader.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1(null),cljs.core.cst$kw$file,reader.cljs$tools$reader$reader_types$IndexingReader$get_file_name$arity$1(null)], null):null)], 0)),e);
+}
+} else {
+throw e4905;
+
+}
+}});
+
+cljs.tools.reader.read_STAR_.cljs$lang$maxFixedArity = 6;
+
+/**
+ * Reads the first object from an IPushbackReader.
+ * Returns the object read. If EOF, throws if eof-error? is true.
+ * Otherwise returns sentinel. If no stream is providen, *in* will be used.
+ * 
+ * Opts is a persistent map with valid keys:
+ *  :read-cond - :allow to process reader conditionals, or
+ *               :preserve to keep all branches
+ *  :features - persistent set of feature keywords for reader conditionals
+ *  :eof - on eof, return value unless :eofthrow, then throw.
+ *         if not specified, will throw
+ * 
+ * To read data structures only, use clojure.tools.reader.edn/read
+ * 
+ * Note that the function signature of clojure.tools.reader/read and
+ * clojure.tools.reader.edn/read is not the same for eof-handling
+ */
+cljs.tools.reader.read = (function cljs$tools$reader$read(var_args){
+var G__4908 = arguments.length;
+switch (G__4908) {
+case 1:
+return cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$1 = (function (reader){
+return cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$3(reader,true,null);
+});
+
+cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$2 = (function (p__4909,reader){
+var map__4910 = p__4909;
+var map__4910__$1 = ((((!((map__4910 == null)))?(((((map__4910.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__4910.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__4910):map__4910);
+var opts = map__4910__$1;
+var eof = cljs.core.get.cljs$core$IFn$_invoke$arity$3(map__4910__$1,cljs.core.cst$kw$eof,cljs.core.cst$kw$eofthrow);
+return cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6(reader,cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(eof,cljs.core.cst$kw$eofthrow),eof,null,opts,cljs.core.to_array(cljs.core.PersistentVector.EMPTY));
+});
+
+cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$3 = (function (reader,eof_error_QMARK_,sentinel){
+return cljs.tools.reader.read_STAR_.cljs$core$IFn$_invoke$arity$6(reader,eof_error_QMARK_,sentinel,null,cljs.core.PersistentArrayMap.EMPTY,cljs.core.to_array(cljs.core.PersistentVector.EMPTY));
+});
+
+cljs.tools.reader.read.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Reads one object from the string s.
+ * Returns nil when s is nil or empty.
+ * 
+ * To read data structures only, use clojure.tools.reader.edn/read-string
+ * 
+ * Note that the function signature of clojure.tools.reader/read-string and
+ * clojure.tools.reader.edn/read-string is not the same for eof-handling
+ */
+cljs.tools.reader.read_string = (function cljs$tools$reader$read_string(var_args){
+var G__4914 = arguments.length;
+switch (G__4914) {
+case 1:
+return cljs.tools.reader.read_string.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.tools.reader.read_string.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.read_string.cljs$core$IFn$_invoke$arity$1 = (function (s){
+return cljs.tools.reader.read_string.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,s);
+});
+
+cljs.tools.reader.read_string.cljs$core$IFn$_invoke$arity$2 = (function (opts,s){
+if(cljs.core.truth_((function (){var and__3925__auto__ = s;
+if(cljs.core.truth_(and__3925__auto__)){
+return !((s === ""));
+} else {
+return and__3925__auto__;
+}
+})())){
+return cljs.tools.reader.read.cljs$core$IFn$_invoke$arity$2(opts,cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$1(s));
+} else {
+return null;
+}
+});
+
+cljs.tools.reader.read_string.cljs$lang$maxFixedArity = 2;
+
diff --git a/js/cljs/tools/reader/impl/commons.cljs b/js/cljs/tools/reader/impl/commons.cljs
new file mode 100644
index 0000000..bb81955
--- /dev/null
+++ b/js/cljs/tools/reader/impl/commons.cljs
@@ -0,0 +1,131 @@
+;;   Copyright (c) Nicola Mometto, Rich Hickey & contributors.
+;;   The use and distribution terms for this software are covered by the
+;;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;;   which can be found in the file epl-v10.html at the root of this distribution.
+;;   By using this software in any fashion, you are agreeing to be bound by
+;;   the terms of this license.
+;;   You must not remove this notice, or any other, from this software.
+
+(ns cljs.tools.reader.impl.commons
+  (:refer-clojure :exclude [char])
+  (:require
+   [cljs.tools.reader.impl.errors :refer [reader-error]]
+   [cljs.tools.reader.reader-types :refer [peek-char read-char]]
+   [cljs.tools.reader.impl.utils :refer [numeric? newline? char]]))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; helpers
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(defn ^boolean number-literal?
+  "Checks whether the reader is at the start of a number literal"
+  [^not-native reader initch]
+  (or (numeric? initch)
+      (and (or (identical? \+ initch) (identical?  \- initch))
+           (numeric? (peek-char reader)))))
+
+(defn read-past
+  "Read until first character that doesn't match pred, returning
+   char."
+  [pred ^not-native rdr]
+  (loop [ch (read-char rdr)]
+    (if ^boolean (pred ch)
+      (recur (read-char rdr))
+      ch)))
+
+(defn skip-line
+  "Advances the reader to the end of a line. Returns the reader"
+  [^not-native reader]
+  (loop []
+    (when-not (newline? (read-char reader))
+      (recur)))
+  reader)
+
+(def int-pattern #"^([-+]?)(?:(0)|([1-9][0-9]*)|0[xX]([0-9A-Fa-f]+)|0([0-7]+)|([1-9][0-9]?)[rR]([0-9A-Za-z]+)|0[0-9]+)(N)?$")
+(def ratio-pattern #"([-+]?[0-9]+)/([0-9]+)")
+(def float-pattern #"([-+]?[0-9]+(\.[0-9]*)?([eE][-+]?[0-9]+)?)(M)?")
+
+(defn- match-int
+  [s]
+  (let [m (vec (re-find int-pattern s))]
+    (if-not (nil? (m 2))
+      0
+      (let [^boolean negate? (identical? "-" (m 1))
+            a (cond
+               (not (nil? (m 3))) [(m 3) 10]
+               (not (nil? (m 4))) [(m 4) 16]
+               (not (nil? (m 5))) [(m 5) 8]
+               (not (nil? (m 7))) [(m 7) (js/parseInt (m 6))]
+               :else              [nil nil])
+            n (a 0)]
+        (when-not (nil? n)
+          (let [bn (js/parseInt n (a 1))
+                bn (if negate? (* -1 bn) bn)]
+            (when-not (js/isNaN bn)
+              bn)))))))
+
+(defn- match-ratio
+  [s]
+  (let [m (vec (re-find ratio-pattern s))
+        numerator (m 1)
+        denominator (m 2)
+        numerator (if (re-find #"^\+" numerator)
+                    (subs numerator 1)
+                    numerator)]
+    (/ (-> numerator   js/parseInt) ;;; No ratio type in cljs
+       (-> denominator js/parseInt)))); So will convert to js/Number
+
+(defn- match-float
+  [s]
+  (let [m (vec (re-find float-pattern s))]
+    (if-not (nil? (m 4)) ;; for BigDecimal "10.03M", as all parsed to js/Number
+      (js/parseFloat (m 1))
+      (js/parseFloat s))))
+
+(defn ^boolean matches? [pattern s]
+  (let [[match] (re-find pattern s)]
+    (identical? match s)))
+
+(defn match-number [s]
+  (if (matches? int-pattern s)
+    (match-int s)
+    (if (matches? float-pattern s)
+      (match-float s)
+      (when (matches? ratio-pattern s)
+        (match-ratio s)))))
+
+(defn parse-symbol
+  "Parses a string into a vector of the namespace and symbol"
+  [token]
+  (when-not (or (identical? "" token)
+                (true? (.test #":$" token))
+                (true? (.test #"^::" token)))
+    (let [ns-idx (.indexOf token "/")
+          ns (when (pos? ns-idx)
+               (subs token 0 ns-idx))]
+      (if-not (nil? ns)
+        (let [ns-idx (inc ns-idx)]
+          (when-not (== ns-idx (count token))
+            (let [sym (subs token ns-idx)]
+              (when (and (not (numeric? (nth sym 0)))
+                         (not (identical? "" sym))
+                         (false? (.test #":$" ns))
+                         (or (identical? sym "/")
+                             (== -1 (.indexOf sym "/"))))
+                [ns sym]))))
+        (when (or (identical? token "/")
+                  (== -1 (.indexOf token "/")))
+          [nil token])))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; readers
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(defn read-comment
+  [rdr & _]
+  (skip-line rdr))
+
+(defn throwing-reader
+  [msg]
+  (fn [rdr & _]
+    (reader-error rdr msg)))
diff --git a/js/cljs/tools/reader/impl/commons.cljs.cache.json b/js/cljs/tools/reader/impl/commons.cljs.cache.json
new file mode 100644
index 0000000..18d40e4
--- /dev/null
+++ b/js/cljs/tools/reader/impl/commons.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$parseInt",["^ "],"~$isNaN",["^ "],"~$parseFloat",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",["~$char"]],"~:name","~$cljs.tools.reader.impl.commons","~:imports",null,"~:requires",["^ ","~$cljs.tools.reader.impl.errors","^>","~$cljs.tools.reader.reader-types","^?","~$cljs.tools.reader.impl.utils","^@"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^9","^@","~$numeric?","^@","~$reader-error","^>","~$peek-char","^?","~$read-char","^?","~$newline?","^@"],"~:defs",["^ ","~$match-number",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","~:line",89,"~:column",7,"~:end-line",89,"~:end-column",19,"~:arglists",["~#list",["~$quote",["^R",[["~$s"]]]]]],"^:","~$cljs.tools.reader.impl.commons/match-number","~:variadic",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",19,"~:method-params",["^R",[["~$s"]]],"~:protocol-impl",null,"~:arglists-meta",["^R",[null,null]],"^N",1,"^M",89,"^O",89,"~:max-fixed-arity",1,"~:fn-var",true,"^Q",["^R",["^S",["^R",[["~$s"]]]]]],"~$skip-line",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",36,"^N",7,"^O",36,"^P",16,"^Q",["^R",["^S",["^R",[["~$reader"]]]]],"~:doc","Advances the reader to the end of a line. Returns the reader"],"^:","~$cljs.tools.reader.impl.commons/skip-line","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",16,"^V",["^R",[["^10"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",36,"^O",36,"^Y",1,"^Z",true,"^Q",["^R",["^S",["^R",[["^10"]]]]],"^11","Advances the reader to the end of a line. Returns the reader"],"~$int-pattern",["^ ","^:","~$cljs.tools.reader.impl.commons/int-pattern","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",44,"^N",1,"^O",44,"^P",17,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",44,"^N",6,"^O",44,"^P",17],"~:tag","~$any"],"~$read-comment",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",124,"^N",7,"^O",124,"^P",19,"^Q",["^R",["^S",["^R",[["~$rdr","~$&","~$_"]]]]],"~:top-fn",["^ ","^U",true,"^Y",1,"^V",[["^R",["^18","~$_"]]],"^Q",["^R",[["^18","~$&","~$_"]]],"^X",["^R",[null]]]],"^:","~$cljs.tools.reader.impl.commons/read-comment","^U",true,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",19,"^19",["^ ","^U",true,"^Y",1,"^V",[["^R",["^18","~$_"]]],"^Q",["^R",[["^18","~$&","~$_"]]],"^X",["^R",[null]]],"^V",[["^R",["^18","~$_"]]],"^W",null,"^X",["^R",[null]],"^N",1,"^M",124,"^O",124,"^Y",1,"^Z",true,"^Q",["^R",[["^18","~$&","~$_"]]]],"~$match-ratio",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",67,"^N",8,"^O",67,"^P",19,"~:private",true,"^Q",["^R",["^S",["^R",[["~$s"]]]]]],"^1<",true,"^:","~$cljs.tools.reader.impl.commons/match-ratio","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",19,"^V",["^R",[["~$s"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",67,"^O",67,"^Y",1,"^Z",true,"^Q",["^R",["^S",["^R",[["~$s"]]]]]],"~$match-int",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",48,"^N",8,"^O",48,"^P",17,"^1<",true,"^Q",["^R",["^S",["^R",[["~$s"]]]]]],"^1<",true,"^:","~$cljs.tools.reader.impl.commons/match-int","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",17,"^V",["^R",[["~$s"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",48,"^O",48,"^Y",1,"^Z",true,"^Q",["^R",["^S",["^R",[["~$s"]]]]]],"~$parse-symbol",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",97,"^N",7,"^O",97,"^P",19,"^Q",["^R",["^S",["^R",[["~$token"]]]]],"^11","Parses a string into a vector of the namespace and symbol"],"^:","~$cljs.tools.reader.impl.commons/parse-symbol","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",19,"^V",["^R",[["^1A"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",97,"^O",97,"^Y",1,"^Z",true,"^Q",["^R",["^S",["^R",[["^1A"]]]]],"^11","Parses a string into a vector of the namespace and symbol"],"~$number-literal?",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",20,"^N",16,"^O",20,"^P",31,"^15","~$boolean","^Q",["^R",["^S",["^R",[["^10","~$initch"]]]]],"^11","Checks whether the reader is at the start of a number literal"],"^:","~$cljs.tools.reader.impl.commons/number-literal?","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",31,"^V",["^R",[["^10","^1E"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",20,"~:ret-tag","^1D","^O",20,"^Y",2,"^15","^1D","^Z",true,"^Q",["^R",["^S",["^R",[["^10","^1E"]]]]],"^11","Checks whether the reader is at the start of a number literal"],"~$read-past",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",27,"^N",7,"^O",27,"^P",16,"^Q",["^R",["^S",["^R",[["~$pred","^18"]]]]],"^11","Read until first character that doesn't match pred, returning\n   char."],"^:","~$cljs.tools.reader.impl.commons/read-past","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",16,"^V",["^R",[["^1I","^18"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",27,"^O",27,"^Y",2,"^Z",true,"^Q",["^R",["^S",["^R",[["^1I","^18"]]]]],"^11","Read until first character that doesn't match pred, returning\n   char."],"~$float-pattern",["^ ","^:","~$cljs.tools.reader.impl.commons/float-pattern","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",46,"^N",1,"^O",46,"^P",19,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",46,"^N",6,"^O",46,"^P",19],"^15","^16"],"~$matches?",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",85,"^N",16,"^O",85,"^P",24,"^15","^1D","^Q",["^R",["^S",["^R",[["~$pattern","~$s"]]]]]],"^:","~$cljs.tools.reader.impl.commons/matches?","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",24,"^V",["^R",[["^1N","~$s"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",85,"^1G","^1D","^O",85,"^Y",2,"^15","^1D","^Z",true,"^Q",["^R",["^S",["^R",[["^1N","~$s"]]]]]],"~$throwing-reader",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",128,"^N",7,"^O",128,"^P",22,"^Q",["^R",["^S",["^R",[["~$msg"]]]]]],"^:","~$cljs.tools.reader.impl.commons/throwing-reader","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",22,"^V",["^R",[["^1Q"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",128,"^O",128,"^Y",1,"^Z",true,"^Q",["^R",["^S",["^R",[["^1Q"]]]]]],"~$match-float",["^ ","^J",null,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",78,"^N",8,"^O",78,"^P",19,"^1<",true,"^Q",["^R",["^S",["^R",[["~$s"]]]]]],"^1<",true,"^:","~$cljs.tools.reader.impl.commons/match-float","^U",false,"^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^P",19,"^V",["^R",[["~$s"]]],"^W",null,"^X",["^R",[null,null]],"^N",1,"^M",78,"^O",78,"^Y",1,"^Z",true,"^Q",["^R",["^S",["^R",[["~$s"]]]]]],"~$ratio-pattern",["^ ","^:","~$cljs.tools.reader.impl.commons/ratio-pattern","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",45,"^N",1,"^O",45,"^P",19,"^K",["^ ","^L","/home/julien/.cljs/.aot_cache/1.10.329/91AE00E/cljs/tools/reader/impl/commons.cljs","^M",45,"^N",6,"^O",45,"^P",19],"^15","^16"]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^8",["~:else"]],"~:order",["^1["]],"^11",null]
\ No newline at end of file
diff --git a/js/cljs/tools/reader/impl/commons.js b/js/cljs/tools/reader/impl/commons.js
new file mode 100644
index 0000000..e9c4f3b
--- /dev/null
+++ b/js/cljs/tools/reader/impl/commons.js
@@ -0,0 +1,192 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('cljs.tools.reader.impl.commons');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('cljs.tools.reader.impl.errors');
+goog.require('cljs.tools.reader.reader_types');
+goog.require('cljs.tools.reader.impl.utils');
+/**
+ * Checks whether the reader is at the start of a number literal
+ */
+cljs.tools.reader.impl.commons.number_literal_QMARK_ = (function cljs$tools$reader$impl$commons$number_literal_QMARK_(reader,initch){
+return ((cljs.tools.reader.impl.utils.numeric_QMARK_(initch)) || (((((("+" === initch)) || (("-" === initch)))) && (cljs.tools.reader.impl.utils.numeric_QMARK_(reader.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null))))));
+});
+/**
+ * Read until first character that doesn't match pred, returning
+ * char.
+ */
+cljs.tools.reader.impl.commons.read_past = (function cljs$tools$reader$impl$commons$read_past(pred,rdr){
+var ch = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+while(true){
+if((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(ch) : pred.call(null,ch))){
+var G__4718 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+ch = G__4718;
+continue;
+} else {
+return ch;
+}
+break;
+}
+});
+/**
+ * Advances the reader to the end of a line. Returns the reader
+ */
+cljs.tools.reader.impl.commons.skip_line = (function cljs$tools$reader$impl$commons$skip_line(reader){
+while(true){
+if(cljs.tools.reader.impl.utils.newline_QMARK_(reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null))){
+} else {
+continue;
+}
+break;
+}
+
+return reader;
+});
+cljs.tools.reader.impl.commons.int_pattern = /^([-+]?)(?:(0)|([1-9][0-9]*)|0[xX]([0-9A-Fa-f]+)|0([0-7]+)|([1-9][0-9]?)[rR]([0-9A-Za-z]+)|0[0-9]+)(N)?$/;
+cljs.tools.reader.impl.commons.ratio_pattern = /([-+]?[0-9]+)\/([0-9]+)/;
+cljs.tools.reader.impl.commons.float_pattern = /([-+]?[0-9]+(\.[0-9]*)?([eE][-+]?[0-9]+)?)(M)?/;
+cljs.tools.reader.impl.commons.match_int = (function cljs$tools$reader$impl$commons$match_int(s){
+var m = cljs.core.vec(cljs.core.re_find(cljs.tools.reader.impl.commons.int_pattern,s));
+if(!(((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((2)) : m.call(null,(2))) == null))){
+return (0);
+} else {
+var negate_QMARK_ = ("-" === (m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((1)) : m.call(null,(1))));
+var a = ((!(((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((3)) : m.call(null,(3))) == null)))?new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((3)) : m.call(null,(3))),(10)], null):((!(((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((4)) : m.call(null,(4))) == null)))?new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((4)) : m.call(null,(4))),(16)], null):((!(((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((5)) : m.call(null,(5))) == null)))?new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((5)) : m.call(null,(5))),(8)], null):((!(((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((7)) : m.call(null,(7))) == null)))?new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((7)) : m.call(null,(7))),parseInt((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((6)) : m.call(null,(6))))], null):new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,null], null)
+))));
+var n = (a.cljs$core$IFn$_invoke$arity$1 ? a.cljs$core$IFn$_invoke$arity$1((0)) : a.call(null,(0)));
+if((n == null)){
+return null;
+} else {
+var bn = parseInt(n,(a.cljs$core$IFn$_invoke$arity$1 ? a.cljs$core$IFn$_invoke$arity$1((1)) : a.call(null,(1))));
+var bn__$1 = ((negate_QMARK_)?((-1) * bn):bn);
+if(cljs.core.truth_(isNaN(bn__$1))){
+return null;
+} else {
+return bn__$1;
+}
+}
+}
+});
+cljs.tools.reader.impl.commons.match_ratio = (function cljs$tools$reader$impl$commons$match_ratio(s){
+var m = cljs.core.vec(cljs.core.re_find(cljs.tools.reader.impl.commons.ratio_pattern,s));
+var numerator = (m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((1)) : m.call(null,(1)));
+var denominator = (m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((2)) : m.call(null,(2)));
+var numerator__$1 = (cljs.core.truth_(cljs.core.re_find(/^\+/,numerator))?cljs.core.subs.cljs$core$IFn$_invoke$arity$2(numerator,(1)):numerator);
+return (parseInt(numerator__$1) / parseInt(denominator));
+});
+cljs.tools.reader.impl.commons.match_float = (function cljs$tools$reader$impl$commons$match_float(s){
+var m = cljs.core.vec(cljs.core.re_find(cljs.tools.reader.impl.commons.float_pattern,s));
+if(!(((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((4)) : m.call(null,(4))) == null))){
+return parseFloat((m.cljs$core$IFn$_invoke$arity$1 ? m.cljs$core$IFn$_invoke$arity$1((1)) : m.call(null,(1))));
+} else {
+return parseFloat(s);
+}
+});
+cljs.tools.reader.impl.commons.matches_QMARK_ = (function cljs$tools$reader$impl$commons$matches_QMARK_(pattern,s){
+var vec__4719 = cljs.core.re_find(pattern,s);
+var match = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4719,(0),null);
+return (match === s);
+});
+cljs.tools.reader.impl.commons.match_number = (function cljs$tools$reader$impl$commons$match_number(s){
+if(cljs.tools.reader.impl.commons.matches_QMARK_(cljs.tools.reader.impl.commons.int_pattern,s)){
+return cljs.tools.reader.impl.commons.match_int(s);
+} else {
+if(cljs.tools.reader.impl.commons.matches_QMARK_(cljs.tools.reader.impl.commons.float_pattern,s)){
+return cljs.tools.reader.impl.commons.match_float(s);
+} else {
+if(cljs.tools.reader.impl.commons.matches_QMARK_(cljs.tools.reader.impl.commons.ratio_pattern,s)){
+return cljs.tools.reader.impl.commons.match_ratio(s);
+} else {
+return null;
+}
+}
+}
+});
+/**
+ * Parses a string into a vector of the namespace and symbol
+ */
+cljs.tools.reader.impl.commons.parse_symbol = (function cljs$tools$reader$impl$commons$parse_symbol(token){
+if(((("" === token)) || (/:$/.test(token) === true) || (/^::/.test(token) === true))){
+return null;
+} else {
+var ns_idx = token.indexOf("/");
+var ns = (((ns_idx > (0)))?cljs.core.subs.cljs$core$IFn$_invoke$arity$3(token,(0),ns_idx):null);
+if(!((ns == null))){
+var ns_idx__$1 = (ns_idx + (1));
+if((ns_idx__$1 === cljs.core.count(token))){
+return null;
+} else {
+var sym = cljs.core.subs.cljs$core$IFn$_invoke$arity$2(token,ns_idx__$1);
+if(((!(cljs.tools.reader.impl.utils.numeric_QMARK_(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(sym,(0))))) && (!(("" === sym))) && (/:$/.test(ns) === false) && ((((sym === "/")) || (((-1) === sym.indexOf("/"))))))){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [ns,sym], null);
+} else {
+return null;
+}
+}
+} else {
+if((((token === "/")) || (((-1) === token.indexOf("/"))))){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,token], null);
+} else {
+return null;
+}
+}
+}
+});
+cljs.tools.reader.impl.commons.read_comment = (function cljs$tools$reader$impl$commons$read_comment(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4724 = arguments.length;
+var i__4519__auto___4725 = (0);
+while(true){
+if((i__4519__auto___4725 < len__4518__auto___4724)){
+args__4521__auto__.push((arguments[i__4519__auto___4725]));
+
+var G__4726 = (i__4519__auto___4725 + (1));
+i__4519__auto___4725 = G__4726;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.tools.reader.impl.commons.read_comment.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.tools.reader.impl.commons.read_comment.cljs$core$IFn$_invoke$arity$variadic = (function (rdr,_){
+return cljs.tools.reader.impl.commons.skip_line(rdr);
+});
+
+cljs.tools.reader.impl.commons.read_comment.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.tools.reader.impl.commons.read_comment.cljs$lang$applyTo = (function (seq4722){
+var G__4723 = cljs.core.first(seq4722);
+var seq4722__$1 = cljs.core.next(seq4722);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__4723,seq4722__$1);
+});
+
+cljs.tools.reader.impl.commons.throwing_reader = (function cljs$tools$reader$impl$commons$throwing_reader(msg){
+return (function() { 
+var G__4727__delegate = function (rdr,_){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([msg], 0));
+};
+var G__4727 = function (rdr,var_args){
+var _ = null;
+if (arguments.length > 1) {
+var G__4728__i = 0, G__4728__a = new Array(arguments.length -  1);
+while (G__4728__i < G__4728__a.length) {G__4728__a[G__4728__i] = arguments[G__4728__i + 1]; ++G__4728__i;}
+  _ = new cljs.core.IndexedSeq(G__4728__a,0,null);
+} 
+return G__4727__delegate.call(this,rdr,_);};
+G__4727.cljs$lang$maxFixedArity = 1;
+G__4727.cljs$lang$applyTo = (function (arglist__4729){
+var rdr = cljs.core.first(arglist__4729);
+var _ = cljs.core.rest(arglist__4729);
+return G__4727__delegate(rdr,_);
+});
+G__4727.cljs$core$IFn$_invoke$arity$variadic = G__4727__delegate;
+return G__4727;
+})()
+;
+});
diff --git a/js/cljs/tools/reader/impl/errors.cljs b/js/cljs/tools/reader/impl/errors.cljs
new file mode 100644
index 0000000..104e662
--- /dev/null
+++ b/js/cljs/tools/reader/impl/errors.cljs
@@ -0,0 +1,253 @@
+;;   Copyright (c) Russ Olsen, Nicola Mometto, Rich Hickey & contributors.
+;;   The use and distribution terms for this software are covered by the
+;;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;;   which can be found in the file epl-v10.html at the root of this distribution.
+;;   By using this software in any fashion, you are agreeing to be bound by
+;;   the terms of this license.
+;;   You must not remove this notice, or any other, from this software.
+
+(ns cljs.tools.reader.impl.errors
+  (:require [cljs.tools.reader.reader-types :as types]
+            [clojure.string :as s]
+            [cljs.tools.reader.impl.inspect :as i]))
+
+(defn- ex-details
+  [rdr ex-type]
+  (let [details {:type :reader-exception
+                 :ex-kind ex-type}]
+    (if (types/indexing-reader? rdr)
+      (assoc
+       details
+       :file (types/get-file-name rdr)
+       :line (types/get-line-number rdr)
+       :col (types/get-column-number rdr))
+      details)))
+
+(defn- throw-ex
+  "Throw an ex-info error."
+  [rdr ex-type & msg]
+  (let [details (ex-details rdr ex-type)
+        file (:file details)
+        line (:line details)
+        col (:col details)
+        msg1 (if file (str file " "))
+        msg2 (if line (str "[line " line ", col " col "]"))
+        msg3 (if (or msg1 msg2) " ")
+        full-msg (apply str msg1 msg2 msg3 msg)]
+    (throw (ex-info full-msg details))))
+
+(defn reader-error
+  "Throws an ExceptionInfo with the given message.
+   If rdr is an IndexingReader, additional information about column and line number is provided"
+  [rdr & msgs]
+  (throw-ex rdr :reader-error (apply str msgs)))
+
+(defn illegal-arg-error
+  "Throws an ExceptionInfo with the given message.
+   If rdr is an IndexingReader, additional information about column and line number is provided"
+  [rdr & msgs]
+  (throw-ex rdr :illegal-argument (apply str msgs)))
+
+(defn eof-error
+  "Throws an ExceptionInfo with the given message.
+   If rdr is an IndexingReader, additional information about column and line number is provided"
+  [rdr & msgs]
+  (throw-ex rdr :eof (apply str msgs)))
+
+(defn throw-eof-delimited
+  ([rdr kind column line] (throw-eof-delimited rdr kind line column nil))
+  ([rdr kind line column n]
+   (eof-error
+    rdr
+    "Unexpected EOF while reading "
+    (if n
+      (str "item " n " of "))
+    (name kind)
+    (if line
+      (str ", starting at line " line " and column " column))
+    ".")))
+
+(defn throw-odd-map [rdr line col elements]
+  (reader-error
+   rdr
+   "The map literal starting with "
+   (i/inspect (first elements))
+   (if line (str " on line " line " column " col))
+   " contains "
+   (count elements)
+   " form(s). Map literals must contain an even number of forms."))
+
+(defn throw-invalid-number [rdr token]
+  (reader-error
+   rdr
+   "Invalid number: "
+   token
+   "."))
+
+(defn throw-invalid-unicode-literal [rdr token]
+  (throw
+   (illegal-arg-error
+    rdr
+    "Invalid unicode literal: \\"
+    token
+    ".")))
+
+(defn throw-invalid-unicode-escape [rdr ch]
+  (reader-error
+   rdr
+   "Invalid unicode escape: \\u"
+   ch
+   "."))
+
+(defn throw-invalid [rdr kind token]
+  (reader-error rdr "Invalid " (name kind) ": " token "."))
+
+(defn throw-eof-at-start [rdr kind]
+  (eof-error rdr "Unexpected EOF while reading start of " (name kind) "."))
+
+(defn throw-bad-char [rdr kind ch]
+  (reader-error rdr "Invalid character: " ch " found while reading " (name kind) "."))
+
+(defn throw-eof-at-dispatch [rdr]
+  (eof-error rdr "Unexpected EOF while reading dispatch character."))
+
+(defn throw-bad-dispatch [rdr ch]
+  (reader-error rdr "No dispatch macro for " ch "."))
+
+(defn throw-unmatch-delimiter [rdr ch]
+  (reader-error rdr "Unmatched delimiter " ch "."))
+
+(defn throw-eof-reading [rdr kind & start]
+  (let [init (case kind :regex "#\"" :string \")]
+    (eof-error rdr "Unexpected EOF reading " (name kind) " starting " (apply str init start) ".")))
+
+(defn throw-no-dispatch [rdr ch]
+  (throw-bad-dispatch rdr ch))
+
+(defn throw-invalid-unicode-char[rdr token]
+  (reader-error
+   rdr
+   "Invalid unicode character \\"
+   token
+   "."))
+
+(defn throw-invalid-unicode-digit-in-token[rdr ch token]
+  (illegal-arg-error
+   rdr
+   "Invalid digit "
+   ch
+   " in unicode character \\"
+   token
+   "."))
+
+(defn throw-invalid-unicode-digit[rdr ch]
+  (illegal-arg-error
+   rdr
+   "Invalid digit "
+   ch
+   " in unicode character."))
+
+(defn throw-invalid-unicode-len[rdr actual expected]
+  (illegal-arg-error
+   rdr
+   "Invalid unicode literal. Unicode literals should be "
+   expected
+   "characters long.  "
+   "value suppled is "
+   actual
+   "characters long."))
+
+(defn throw-invalid-character-literal[rdr token]
+  (reader-error rdr "Invalid character literal \\u" token "."))
+
+(defn throw-invalid-octal-len[rdr token]
+  (reader-error
+   rdr
+   "Invalid octal escape sequence in a character literal:"
+   token
+   ". Octal escape sequences must be 3 or fewer digits."))
+
+(defn throw-bad-octal-number [rdr]
+  (reader-error rdr "Octal escape sequence must be in range [0, 377]."))
+
+(defn throw-unsupported-character[rdr token]
+  (reader-error
+   rdr
+   "Unsupported character: "
+   token
+   "."))
+
+(defn throw-eof-in-character [rdr]
+  (eof-error
+   rdr
+   "Unexpected EOF while reading character."))
+
+(defn throw-bad-escape-char [rdr ch]
+  (reader-error rdr "Unsupported escape character: \\" ch "."))
+
+(defn throw-single-colon [rdr]
+  (reader-error rdr "A single colon is not a valid keyword."))
+
+(defn throw-bad-metadata [rdr x]
+  (reader-error
+   rdr
+   "Metadata cannot be "
+   (i/inspect x)
+   ". Metadata must be a Symbol, Keyword, String or Map."))
+
+(defn throw-bad-metadata-target [rdr target]
+  (reader-error
+   rdr
+   "Metadata can not be applied to "
+   (i/inspect target)
+   ". "
+   "Metadata can only be applied to IMetas."))
+
+(defn throw-feature-not-keyword [rdr feature]
+  (reader-error
+   rdr
+   "Feature cannot be "
+   (i/inspect feature)
+   " Features must be keywords."))
+
+(defn throw-ns-map-no-map [rdr ns-name]
+  (reader-error rdr "Namespaced map with namespace " ns-name " does not specify a map."))
+
+(defn throw-bad-ns [rdr ns-name]
+  (reader-error rdr "Invalid value used as namespace in namespaced map: " ns-name "."))
+
+(defn throw-bad-reader-tag [rdr tag]
+  (reader-error
+   rdr
+   "Invalid reader tag: "
+   (i/inspect tag)
+   ". Reader tags must be symbols."))
+
+(defn throw-unknown-reader-tag [rdr tag]
+  (reader-error
+   rdr
+   "No reader function for tag "
+   (i/inspect tag)
+   "."))
+
+(defn- duplicate-keys-error [msg coll]
+  (letfn [(duplicates [seq]
+            (for [[id freq] (frequencies seq)
+                  :when (> freq 1)]
+              id))]
+    (let [dups (duplicates coll)]
+      (apply str msg
+             (when (> (count dups) 1) "s")
+             ": " (interpose ", " dups)))))
+
+(defn throw-dup-keys [rdr kind ks]
+  (reader-error
+   rdr
+   (duplicate-keys-error
+    (str (s/capitalize (name kind)) " literal contains duplicate key")
+    ks)))
+
+(defn throw-eof-error [rdr line]
+  (if line
+    (eof-error rdr "EOF while reading, starting at line " line ".")
+    (eof-error rdr "EOF while reading.")))
diff --git a/js/cljs/tools/reader/impl/errors.cljs.cache.json b/js/cljs/tools/reader/impl/errors.cljs.cache.json
new file mode 100644
index 0000000..bcb0c6f
--- /dev/null
+++ b/js/cljs/tools/reader/impl/errors.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$cljs.tools.reader.impl.errors","~:imports",null,"~:requires",["^ ","~$types","~$cljs.tools.reader.reader-types","^<","^<","~$s","~$clojure.string","^=","^=","~$i","~$cljs.tools.reader.impl.inspect","^>","^>"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$throw-bad-dispatch",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","~:line",114,"~:column",7,"~:end-line",114,"~:end-column",25,"~:arglists",["~#list",["~$quote",["^K",[["~$rdr","~$ch"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-dispatch","~:variadic",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",25,"~:method-params",["^K",[["^M","^N"]]],"~:protocol-impl",null,"~:arglists-meta",["^K",[null,null]],"^G",1,"^F",114,"^H",114,"~:max-fixed-arity",2,"~:fn-var",true,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"~$throw-invalid-unicode-escape",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",95,"^G",7,"^H",95,"^I",35,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-unicode-escape","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",35,"^Q",["^K",[["^M","^N"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",95,"^H",95,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"~$throw-dup-keys",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",243,"^G",7,"^H",243,"^I",21,"^J",["^K",["^L",["^K",[["^M","~$kind","~$ks"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-dup-keys","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",21,"^Q",["^K",[["^M","^Y","^Z"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",243,"^H",243,"^T",3,"^U",true,"^J",["^K",["^L",["^K",[["^M","^Y","^Z"]]]]]],"~$throw-bad-ns",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",216,"^G",7,"^H",216,"^I",19,"^J",["^K",["^L",["^K",[["^M","~$ns-name"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-ns","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",19,"^Q",["^K",[["^M","^11"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",216,"^H",216,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^11"]]]]]],"~$duplicate-keys-error",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",233,"^G",8,"^H",233,"^I",28,"~:private",true,"^J",["^K",["^L",["^K",[["~$msg","~$coll"]]]]]],"^14",true,"^7","~$cljs.tools.reader.impl.errors/duplicate-keys-error","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",28,"^Q",["^K",[["^15","^16"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",233,"^H",233,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^15","^16"]]]]]],"~$throw-unknown-reader-tag",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",226,"^G",7,"^H",226,"^I",31,"^J",["^K",["^L",["^K",[["^M","~$tag"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-unknown-reader-tag","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",31,"^Q",["^K",[["^M","^19"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",226,"^H",226,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^19"]]]]]],"~$throw-eof-at-dispatch",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",111,"^G",7,"^H",111,"^I",28,"^J",["^K",["^L",["^K",[["^M"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-eof-at-dispatch","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",28,"^Q",["^K",[["^M"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",111,"^H",111,"^T",1,"^U",true,"^J",["^K",["^L",["^K",[["^M"]]]]]],"~$throw-bad-metadata-target",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",198,"^G",7,"^H",198,"^I",32,"^J",["^K",["^L",["^K",[["^M","~$target"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-metadata-target","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",32,"^Q",["^K",[["^M","^1>"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",198,"^H",198,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1>"]]]]]],"~$throw-invalid-number",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",80,"^G",7,"^H",80,"^I",27,"^J",["^K",["^L",["^K",[["^M","~$token"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-number","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",27,"^Q",["^K",[["^M","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",80,"^H",80,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"~$reader-error",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",39,"^G",7,"^H",39,"^I",19,"^J",["^K",["^L",["^K",[["^M","~$&","~$msgs"]]]]],"~:doc","Throws an ExceptionInfo with the given message.\n   If rdr is an IndexingReader, additional information about column and line number is provided","~:top-fn",["^ ","^P",true,"^T",1,"^Q",[["^K",["^M","^1D"]]],"^J",["^K",[["^M","~$&","^1D"]]],"^S",["^K",[null]]]],"^7","~$cljs.tools.reader.impl.errors/reader-error","^P",true,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",19,"^1F",["^ ","^P",true,"^T",1,"^Q",[["^K",["^M","^1D"]]],"^J",["^K",[["^M","~$&","^1D"]]],"^S",["^K",[null]]],"^Q",[["^K",["^M","^1D"]]],"^R",null,"^S",["^K",[null]],"^G",1,"^F",39,"^H",39,"^T",1,"^U",true,"^J",["^K",[["^M","~$&","^1D"]]],"^1E","Throws an ExceptionInfo with the given message.\n   If rdr is an IndexingReader, additional information about column and line number is provided"],"~$throw-invalid-unicode-literal",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",87,"^G",7,"^H",87,"^I",36,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-unicode-literal","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",36,"^Q",["^K",[["^M","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",87,"^H",87,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"~$throw-ns-map-no-map",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",213,"^G",7,"^H",213,"^I",26,"^J",["^K",["^L",["^K",[["^M","^11"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-ns-map-no-map","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",26,"^Q",["^K",[["^M","^11"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",213,"^H",213,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^11"]]]]]],"~$throw-unsupported-character",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",173,"^G",7,"^H",173,"^I",34,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-unsupported-character","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",34,"^Q",["^K",[["^M","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",173,"^H",173,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"~$throw-feature-not-keyword",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",206,"^G",7,"^H",206,"^I",32,"^J",["^K",["^L",["^K",[["^M","~$feature"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-feature-not-keyword","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",32,"^Q",["^K",[["^M","^1O"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",206,"^H",206,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1O"]]]]]],"~$throw-eof-delimited",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",57,"^G",7,"^H",57,"^I",26,"^J",["^K",["^L",["^K",[["^M","^Y","~$column","~$line"],["^M","^Y","^1S","^1R","~$n"]]]]],"^1F",["^ ","^P",false,"^T",5,"^Q",["^K",[["^M","^Y","^1R","^1S"],["^M","^Y","^1S","^1R","~$n"]]],"^J",["^K",[["^M","^Y","^1R","^1S"],["^M","^Y","^1S","^1R","~$n"]]],"^S",["^K",[null,null]]]],"^7","~$cljs.tools.reader.impl.errors/throw-eof-delimited","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",26,"^1F",["^ ","^P",false,"^T",5,"^Q",["^K",[["^M","^Y","^1R","^1S"],["^M","^Y","^1S","^1R","~$n"]]],"^J",["^K",[["^M","^Y","^1R","^1S"],["^M","^Y","^1S","^1R","~$n"]]],"^S",["^K",[null,null]]],"^Q",["^K",[["^M","^Y","^1R","^1S"],["^M","^Y","^1S","^1R","~$n"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",57,"^H",57,"^T",5,"^U",true,"^J",["^K",[["^M","^Y","^1R","^1S"],["^M","^Y","^1S","^1R","~$n"]]]],"~$throw-eof-in-character",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",180,"^G",7,"^H",180,"^I",29,"^J",["^K",["^L",["^K",[["^M"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-eof-in-character","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",29,"^Q",["^K",[["^M"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",180,"^H",180,"^T",1,"^U",true,"^J",["^K",["^L",["^K",[["^M"]]]]]],"~$throw-bad-char",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",108,"^G",7,"^H",108,"^I",21,"^J",["^K",["^L",["^K",[["^M","^Y","^N"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-char","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",21,"^Q",["^K",[["^M","^Y","^N"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",108,"^H",108,"^T",3,"^U",true,"^J",["^K",["^L",["^K",[["^M","^Y","^N"]]]]]],"~$eof-error",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",51,"^G",7,"^H",51,"^I",16,"^J",["^K",["^L",["^K",[["^M","~$&","^1D"]]]]],"^1E","Throws an ExceptionInfo with the given message.\n   If rdr is an IndexingReader, additional information about column and line number is provided","^1F",["^ ","^P",true,"^T",1,"^Q",[["^K",["^M","^1D"]]],"^J",["^K",[["^M","~$&","^1D"]]],"^S",["^K",[null]]]],"^7","~$cljs.tools.reader.impl.errors/eof-error","^P",true,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",16,"^1F",["^ ","^P",true,"^T",1,"^Q",[["^K",["^M","^1D"]]],"^J",["^K",[["^M","~$&","^1D"]]],"^S",["^K",[null]]],"^Q",[["^K",["^M","^1D"]]],"^R",null,"^S",["^K",[null]],"^G",1,"^F",51,"^H",51,"^T",1,"^U",true,"^J",["^K",[["^M","~$&","^1D"]]],"^1E","Throws an ExceptionInfo with the given message.\n   If rdr is an IndexingReader, additional information about column and line number is provided"],"~$throw-bad-metadata",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",191,"^G",7,"^H",191,"^I",25,"^J",["^K",["^L",["^K",[["^M","~$x"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-metadata","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",25,"^Q",["^K",[["^M","~$x"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",191,"^H",191,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","~$x"]]]]]],"~$throw-eof-reading",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",120,"^G",7,"^H",120,"^I",24,"^J",["^K",["^L",["^K",[["^M","^Y","~$&","~$start"]]]]],"^1F",["^ ","^P",true,"^T",2,"^Q",[["^K",["^M","^Y","^22"]]],"^J",["^K",[["^M","^Y","~$&","^22"]]],"^S",["^K",[null]]]],"^7","~$cljs.tools.reader.impl.errors/throw-eof-reading","^P",true,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",24,"^1F",["^ ","^P",true,"^T",2,"^Q",[["^K",["^M","^Y","^22"]]],"^J",["^K",[["^M","^Y","~$&","^22"]]],"^S",["^K",[null]]],"^Q",[["^K",["^M","^Y","^22"]]],"^R",null,"^S",["^K",[null]],"^G",1,"^F",120,"^H",120,"^T",2,"^U",true,"^J",["^K",[["^M","^Y","~$&","^22"]]]],"~$throw-eof-error",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",250,"^G",7,"^H",250,"^I",22,"^J",["^K",["^L",["^K",[["^M","^1S"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-eof-error","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",22,"^Q",["^K",[["^M","^1S"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",250,"^H",250,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1S"]]]]]],"~$illegal-arg-error",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",45,"^G",7,"^H",45,"^I",24,"^J",["^K",["^L",["^K",[["^M","~$&","^1D"]]]]],"^1E","Throws an ExceptionInfo with the given message.\n   If rdr is an IndexingReader, additional information about column and line number is provided","^1F",["^ ","^P",true,"^T",1,"^Q",[["^K",["^M","^1D"]]],"^J",["^K",[["^M","~$&","^1D"]]],"^S",["^K",[null]]]],"^7","~$cljs.tools.reader.impl.errors/illegal-arg-error","^P",true,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",24,"^1F",["^ ","^P",true,"^T",1,"^Q",[["^K",["^M","^1D"]]],"^J",["^K",[["^M","~$&","^1D"]]],"^S",["^K",[null]]],"^Q",[["^K",["^M","^1D"]]],"^R",null,"^S",["^K",[null]],"^G",1,"^F",45,"^H",45,"^T",1,"^U",true,"^J",["^K",[["^M","~$&","^1D"]]],"^1E","Throws an ExceptionInfo with the given message.\n   If rdr is an IndexingReader, additional information about column and line number is provided"],"~$throw-invalid-octal-len",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",163,"^G",7,"^H",163,"^I",30,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-octal-len","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",30,"^Q",["^K",[["^M","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",163,"^H",163,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"~$throw-invalid-unicode-digit",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",143,"^G",7,"^H",143,"^I",34,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-unicode-digit","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",34,"^Q",["^K",[["^M","^N"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",143,"^H",143,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"~$throw-invalid-unicode-digit-in-token",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",134,"^G",7,"^H",134,"^I",43,"^J",["^K",["^L",["^K",[["^M","^N","^1A"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-unicode-digit-in-token","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",43,"^Q",["^K",[["^M","^N","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",134,"^H",134,"^T",3,"^U",true,"^J",["^K",["^L",["^K",[["^M","^N","^1A"]]]]]],"~$throw-invalid-unicode-len",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",150,"^G",7,"^H",150,"^I",32,"^J",["^K",["^L",["^K",[["^M","~$actual","~$expected"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-unicode-len","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",32,"^Q",["^K",[["^M","^2?","^2@"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",150,"^H",150,"^T",3,"^U",true,"^J",["^K",["^L",["^K",[["^M","^2?","^2@"]]]]]],"~$throw-single-colon",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",188,"^G",7,"^H",188,"^I",25,"^J",["^K",["^L",["^K",[["^M"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-single-colon","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",25,"^Q",["^K",[["^M"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",188,"^H",188,"^T",1,"^U",true,"^J",["^K",["^L",["^K",[["^M"]]]]]],"~$throw-odd-map",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",70,"^G",7,"^H",70,"^I",20,"^J",["^K",["^L",["^K",[["^M","^1S","~$col","~$elements"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-odd-map","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",20,"^Q",["^K",[["^M","^1S","^2E","^2F"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",70,"^H",70,"^T",4,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1S","^2E","^2F"]]]]]],"~$throw-bad-octal-number",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",170,"^G",7,"^H",170,"^I",29,"^J",["^K",["^L",["^K",[["^M"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-octal-number","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",29,"^Q",["^K",[["^M"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",170,"^H",170,"^T",1,"^U",true,"^J",["^K",["^L",["^K",[["^M"]]]]]],"~$throw-bad-reader-tag",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",219,"^G",7,"^H",219,"^I",27,"^J",["^K",["^L",["^K",[["^M","^19"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-reader-tag","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",27,"^Q",["^K",[["^M","^19"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",219,"^H",219,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^19"]]]]]],"~$throw-unmatch-delimiter",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",117,"^G",7,"^H",117,"^I",30,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-unmatch-delimiter","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",30,"^Q",["^K",[["^M","^N"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",117,"^H",117,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"~$throw-invalid-character-literal",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",160,"^G",7,"^H",160,"^I",38,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-character-literal","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",38,"^Q",["^K",[["^M","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",160,"^H",160,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"~$throw-invalid-unicode-char",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",127,"^G",7,"^H",127,"^I",33,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid-unicode-char","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",33,"^Q",["^K",[["^M","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",127,"^H",127,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^1A"]]]]]],"~$throw-bad-escape-char",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",185,"^G",7,"^H",185,"^I",28,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-bad-escape-char","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",28,"^Q",["^K",[["^M","^N"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",185,"^H",185,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"~$throw-no-dispatch",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",124,"^G",7,"^H",124,"^I",24,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-no-dispatch","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",24,"^Q",["^K",[["^M","^N"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",124,"^H",124,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^N"]]]]]],"~$throw-eof-at-start",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",105,"^G",7,"^H",105,"^I",25,"^J",["^K",["^L",["^K",[["^M","^Y"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-eof-at-start","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",25,"^Q",["^K",[["^M","^Y"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",105,"^H",105,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^Y"]]]]]],"~$ex-details",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",14,"^G",8,"^H",14,"^I",18,"^14",true,"^J",["^K",["^L",["^K",[["^M","~$ex-type"]]]]]],"^14",true,"^7","~$cljs.tools.reader.impl.errors/ex-details","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",18,"^Q",["^K",[["^M","^2Y"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",14,"^H",14,"^T",2,"^U",true,"^J",["^K",["^L",["^K",[["^M","^2Y"]]]]]],"~$throw-ex",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",26,"^G",8,"^H",26,"^I",16,"^14",true,"^J",["^K",["^L",["^K",[["^M","^2Y","~$&","^15"]]]]],"^1E","Throw an ex-info error.","^1F",["^ ","^P",true,"^T",2,"^Q",[["^K",["^M","^2Y","^15"]]],"^J",["^K",[["^M","^2Y","~$&","^15"]]],"^S",["^K",[null]]]],"^14",true,"^7","~$cljs.tools.reader.impl.errors/throw-ex","^P",true,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",16,"^1F",["^ ","^P",true,"^T",2,"^Q",[["^K",["^M","^2Y","^15"]]],"^J",["^K",[["^M","^2Y","~$&","^15"]]],"^S",["^K",[null]]],"^Q",[["^K",["^M","^2Y","^15"]]],"^R",null,"^S",["^K",[null]],"^G",1,"^F",26,"^H",26,"^T",2,"^U",true,"^J",["^K",[["^M","^2Y","~$&","^15"]]],"^1E","Throw an ex-info error."],"~$throw-invalid",["^ ","^C",null,"^D",["^ ","^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^F",102,"^G",7,"^H",102,"^I",20,"^J",["^K",["^L",["^K",[["^M","^Y","^1A"]]]]]],"^7","~$cljs.tools.reader.impl.errors/throw-invalid","^P",false,"^E","/home/julien/.cljs/.aot_cache/1.10.329/4068E1E/cljs/tools/reader/impl/errors.cljs","^I",20,"^Q",["^K",[["^M","^Y","^1A"]]],"^R",null,"^S",["^K",[null,null]],"^G",1,"^F",102,"^H",102,"^T",3,"^U",true,"^J",["^K",["^L",["^K",[["^M","^Y","^1A"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["~:ex-kind","~:reader-error","~:reader-exception","^E","~:type","~:illegal-argument","^F","~:col","~:eof"]],"~:order",["^3:","^37","^39","^E","^F","^3<","^38","^3;","^3="]],"^1E",null]
\ No newline at end of file
diff --git a/js/cljs/tools/reader/impl/errors.js b/js/cljs/tools/reader/impl/errors.js
new file mode 100644
index 0000000..f8781e8
--- /dev/null
+++ b/js/cljs/tools/reader/impl/errors.js
@@ -0,0 +1,422 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('cljs.tools.reader.impl.errors');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('cljs.tools.reader.reader_types');
+goog.require('clojure.string');
+goog.require('cljs.tools.reader.impl.inspect');
+cljs.tools.reader.impl.errors.ex_details = (function cljs$tools$reader$impl$errors$ex_details(rdr,ex_type){
+var details = new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$reader_DASH_exception,cljs.core.cst$kw$ex_DASH_kind,ex_type], null);
+if(cljs.core.truth_(cljs.tools.reader.reader_types.indexing_reader_QMARK_(rdr))){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(details,cljs.core.cst$kw$file,cljs.tools.reader.reader_types.get_file_name(rdr),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$line,cljs.tools.reader.reader_types.get_line_number(rdr),cljs.core.cst$kw$col,cljs.tools.reader.reader_types.get_column_number(rdr)], 0));
+} else {
+return details;
+}
+});
+/**
+ * Throw an ex-info error.
+ */
+cljs.tools.reader.impl.errors.throw_ex = (function cljs$tools$reader$impl$errors$throw_ex(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4664 = arguments.length;
+var i__4519__auto___4665 = (0);
+while(true){
+if((i__4519__auto___4665 < len__4518__auto___4664)){
+args__4521__auto__.push((arguments[i__4519__auto___4665]));
+
+var G__4666 = (i__4519__auto___4665 + (1));
+i__4519__auto___4665 = G__4666;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((2) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((2)),(0),null)):null);
+return cljs.tools.reader.impl.errors.throw_ex.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4522__auto__);
+});
+
+cljs.tools.reader.impl.errors.throw_ex.cljs$core$IFn$_invoke$arity$variadic = (function (rdr,ex_type,msg){
+var details = cljs.tools.reader.impl.errors.ex_details(rdr,ex_type);
+var file = cljs.core.cst$kw$file.cljs$core$IFn$_invoke$arity$1(details);
+var line = cljs.core.cst$kw$line.cljs$core$IFn$_invoke$arity$1(details);
+var col = cljs.core.cst$kw$col.cljs$core$IFn$_invoke$arity$1(details);
+var msg1 = (cljs.core.truth_(file)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(file)," "].join(''):null);
+var msg2 = (cljs.core.truth_(line)?["[line ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(line),", col ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(col),"]"].join(''):null);
+var msg3 = (cljs.core.truth_((function (){var or__3936__auto__ = msg1;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return msg2;
+}
+})())?" ":null);
+var full_msg = cljs.core.apply.cljs$core$IFn$_invoke$arity$5(cljs.core.str,msg1,msg2,msg3,msg);
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2(full_msg,details);
+});
+
+cljs.tools.reader.impl.errors.throw_ex.cljs$lang$maxFixedArity = (2);
+
+/** @this {Function} */
+cljs.tools.reader.impl.errors.throw_ex.cljs$lang$applyTo = (function (seq4661){
+var G__4662 = cljs.core.first(seq4661);
+var seq4661__$1 = cljs.core.next(seq4661);
+var G__4663 = cljs.core.first(seq4661__$1);
+var seq4661__$2 = cljs.core.next(seq4661__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__4662,G__4663,seq4661__$2);
+});
+
+/**
+ * Throws an ExceptionInfo with the given message.
+ * If rdr is an IndexingReader, additional information about column and line number is provided
+ */
+cljs.tools.reader.impl.errors.reader_error = (function cljs$tools$reader$impl$errors$reader_error(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4669 = arguments.length;
+var i__4519__auto___4670 = (0);
+while(true){
+if((i__4519__auto___4670 < len__4518__auto___4669)){
+args__4521__auto__.push((arguments[i__4519__auto___4670]));
+
+var G__4671 = (i__4519__auto___4670 + (1));
+i__4519__auto___4670 = G__4671;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic = (function (rdr,msgs){
+return cljs.tools.reader.impl.errors.throw_ex.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.cst$kw$reader_DASH_error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.str,msgs)], 0));
+});
+
+cljs.tools.reader.impl.errors.reader_error.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.tools.reader.impl.errors.reader_error.cljs$lang$applyTo = (function (seq4667){
+var G__4668 = cljs.core.first(seq4667);
+var seq4667__$1 = cljs.core.next(seq4667);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__4668,seq4667__$1);
+});
+
+/**
+ * Throws an ExceptionInfo with the given message.
+ * If rdr is an IndexingReader, additional information about column and line number is provided
+ */
+cljs.tools.reader.impl.errors.illegal_arg_error = (function cljs$tools$reader$impl$errors$illegal_arg_error(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4674 = arguments.length;
+var i__4519__auto___4675 = (0);
+while(true){
+if((i__4519__auto___4675 < len__4518__auto___4674)){
+args__4521__auto__.push((arguments[i__4519__auto___4675]));
+
+var G__4676 = (i__4519__auto___4675 + (1));
+i__4519__auto___4675 = G__4676;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.tools.reader.impl.errors.illegal_arg_error.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.tools.reader.impl.errors.illegal_arg_error.cljs$core$IFn$_invoke$arity$variadic = (function (rdr,msgs){
+return cljs.tools.reader.impl.errors.throw_ex.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.cst$kw$illegal_DASH_argument,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.str,msgs)], 0));
+});
+
+cljs.tools.reader.impl.errors.illegal_arg_error.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.tools.reader.impl.errors.illegal_arg_error.cljs$lang$applyTo = (function (seq4672){
+var G__4673 = cljs.core.first(seq4672);
+var seq4672__$1 = cljs.core.next(seq4672);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__4673,seq4672__$1);
+});
+
+/**
+ * Throws an ExceptionInfo with the given message.
+ * If rdr is an IndexingReader, additional information about column and line number is provided
+ */
+cljs.tools.reader.impl.errors.eof_error = (function cljs$tools$reader$impl$errors$eof_error(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4679 = arguments.length;
+var i__4519__auto___4680 = (0);
+while(true){
+if((i__4519__auto___4680 < len__4518__auto___4679)){
+args__4521__auto__.push((arguments[i__4519__auto___4680]));
+
+var G__4681 = (i__4519__auto___4680 + (1));
+i__4519__auto___4680 = G__4681;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic = (function (rdr,msgs){
+return cljs.tools.reader.impl.errors.throw_ex.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.cst$kw$eof,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.str,msgs)], 0));
+});
+
+cljs.tools.reader.impl.errors.eof_error.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+cljs.tools.reader.impl.errors.eof_error.cljs$lang$applyTo = (function (seq4677){
+var G__4678 = cljs.core.first(seq4677);
+var seq4677__$1 = cljs.core.next(seq4677);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__4678,seq4677__$1);
+});
+
+cljs.tools.reader.impl.errors.throw_eof_delimited = (function cljs$tools$reader$impl$errors$throw_eof_delimited(var_args){
+var G__4683 = arguments.length;
+switch (G__4683) {
+case 4:
+return cljs.tools.reader.impl.errors.throw_eof_delimited.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return cljs.tools.reader.impl.errors.throw_eof_delimited.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.impl.errors.throw_eof_delimited.cljs$core$IFn$_invoke$arity$4 = (function (rdr,kind,column,line){
+return cljs.tools.reader.impl.errors.throw_eof_delimited.cljs$core$IFn$_invoke$arity$5(rdr,kind,line,column,null);
+});
+
+cljs.tools.reader.impl.errors.throw_eof_delimited.cljs$core$IFn$_invoke$arity$5 = (function (rdr,kind,line,column,n){
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unexpected EOF while reading ",(cljs.core.truth_(n)?["item ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)," of "].join(''):null),cljs.core.name(kind),(cljs.core.truth_(line)?[", starting at line ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(line)," and column ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(column)].join(''):null),"."], 0));
+});
+
+cljs.tools.reader.impl.errors.throw_eof_delimited.cljs$lang$maxFixedArity = 5;
+
+cljs.tools.reader.impl.errors.throw_odd_map = (function cljs$tools$reader$impl$errors$throw_odd_map(rdr,line,col,elements){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["The map literal starting with ",cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1(cljs.core.first(elements)),(cljs.core.truth_(line)?[" on line ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(line)," column ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(col)].join(''):null)," contains ",cljs.core.count(elements)," form(s). Map literals must contain an even number of forms."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_number = (function cljs$tools$reader$impl$errors$throw_invalid_number(rdr,token){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid number: ",token,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_unicode_literal = (function cljs$tools$reader$impl$errors$throw_invalid_unicode_literal(rdr,token){
+throw cljs.tools.reader.impl.errors.illegal_arg_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid unicode literal: \\",token,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_unicode_escape = (function cljs$tools$reader$impl$errors$throw_invalid_unicode_escape(rdr,ch){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid unicode escape: \\u",ch,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid = (function cljs$tools$reader$impl$errors$throw_invalid(rdr,kind,token){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid ",cljs.core.name(kind),": ",token,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_eof_at_start = (function cljs$tools$reader$impl$errors$throw_eof_at_start(rdr,kind){
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unexpected EOF while reading start of ",cljs.core.name(kind),"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_char = (function cljs$tools$reader$impl$errors$throw_bad_char(rdr,kind,ch){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid character: ",ch," found while reading ",cljs.core.name(kind),"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_eof_at_dispatch = (function cljs$tools$reader$impl$errors$throw_eof_at_dispatch(rdr){
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unexpected EOF while reading dispatch character."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_dispatch = (function cljs$tools$reader$impl$errors$throw_bad_dispatch(rdr,ch){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["No dispatch macro for ",ch,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_unmatch_delimiter = (function cljs$tools$reader$impl$errors$throw_unmatch_delimiter(rdr,ch){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unmatched delimiter ",ch,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_eof_reading = (function cljs$tools$reader$impl$errors$throw_eof_reading(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4689 = arguments.length;
+var i__4519__auto___4690 = (0);
+while(true){
+if((i__4519__auto___4690 < len__4518__auto___4689)){
+args__4521__auto__.push((arguments[i__4519__auto___4690]));
+
+var G__4691 = (i__4519__auto___4690 + (1));
+i__4519__auto___4690 = G__4691;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((2) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((2)),(0),null)):null);
+return cljs.tools.reader.impl.errors.throw_eof_reading.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4522__auto__);
+});
+
+cljs.tools.reader.impl.errors.throw_eof_reading.cljs$core$IFn$_invoke$arity$variadic = (function (rdr,kind,start){
+var init = (function (){var G__4688 = kind;
+var G__4688__$1 = (((G__4688 instanceof cljs.core.Keyword))?G__4688.fqn:null);
+switch (G__4688__$1) {
+case "regex":
+return "#\"";
+
+break;
+case "string":
+return "\"";
+
+break;
+default:
+throw (new Error(["No matching clause: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__4688__$1)].join('')));
+
+}
+})();
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unexpected EOF reading ",cljs.core.name(kind)," starting ",cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.str,init,start),"."], 0));
+});
+
+cljs.tools.reader.impl.errors.throw_eof_reading.cljs$lang$maxFixedArity = (2);
+
+/** @this {Function} */
+cljs.tools.reader.impl.errors.throw_eof_reading.cljs$lang$applyTo = (function (seq4685){
+var G__4686 = cljs.core.first(seq4685);
+var seq4685__$1 = cljs.core.next(seq4685);
+var G__4687 = cljs.core.first(seq4685__$1);
+var seq4685__$2 = cljs.core.next(seq4685__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__4686,G__4687,seq4685__$2);
+});
+
+cljs.tools.reader.impl.errors.throw_no_dispatch = (function cljs$tools$reader$impl$errors$throw_no_dispatch(rdr,ch){
+return cljs.tools.reader.impl.errors.throw_bad_dispatch(rdr,ch);
+});
+cljs.tools.reader.impl.errors.throw_invalid_unicode_char = (function cljs$tools$reader$impl$errors$throw_invalid_unicode_char(rdr,token){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid unicode character \\",token,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_unicode_digit_in_token = (function cljs$tools$reader$impl$errors$throw_invalid_unicode_digit_in_token(rdr,ch,token){
+return cljs.tools.reader.impl.errors.illegal_arg_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid digit ",ch," in unicode character \\",token,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_unicode_digit = (function cljs$tools$reader$impl$errors$throw_invalid_unicode_digit(rdr,ch){
+return cljs.tools.reader.impl.errors.illegal_arg_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid digit ",ch," in unicode character."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_unicode_len = (function cljs$tools$reader$impl$errors$throw_invalid_unicode_len(rdr,actual,expected){
+return cljs.tools.reader.impl.errors.illegal_arg_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid unicode literal. Unicode literals should be ",expected,"characters long.  ","value suppled is ",actual,"characters long."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_character_literal = (function cljs$tools$reader$impl$errors$throw_invalid_character_literal(rdr,token){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid character literal \\u",token,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_invalid_octal_len = (function cljs$tools$reader$impl$errors$throw_invalid_octal_len(rdr,token){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid octal escape sequence in a character literal:",token,". Octal escape sequences must be 3 or fewer digits."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_octal_number = (function cljs$tools$reader$impl$errors$throw_bad_octal_number(rdr){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Octal escape sequence must be in range [0, 377]."], 0));
+});
+cljs.tools.reader.impl.errors.throw_unsupported_character = (function cljs$tools$reader$impl$errors$throw_unsupported_character(rdr,token){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unsupported character: ",token,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_eof_in_character = (function cljs$tools$reader$impl$errors$throw_eof_in_character(rdr){
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unexpected EOF while reading character."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_escape_char = (function cljs$tools$reader$impl$errors$throw_bad_escape_char(rdr,ch){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Unsupported escape character: \\",ch,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_single_colon = (function cljs$tools$reader$impl$errors$throw_single_colon(rdr){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["A single colon is not a valid keyword."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_metadata = (function cljs$tools$reader$impl$errors$throw_bad_metadata(rdr,x){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Metadata cannot be ",cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1(x),". Metadata must be a Symbol, Keyword, String or Map."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_metadata_target = (function cljs$tools$reader$impl$errors$throw_bad_metadata_target(rdr,target){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Metadata can not be applied to ",cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1(target),". ","Metadata can only be applied to IMetas."], 0));
+});
+cljs.tools.reader.impl.errors.throw_feature_not_keyword = (function cljs$tools$reader$impl$errors$throw_feature_not_keyword(rdr,feature){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Feature cannot be ",cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1(feature)," Features must be keywords."], 0));
+});
+cljs.tools.reader.impl.errors.throw_ns_map_no_map = (function cljs$tools$reader$impl$errors$throw_ns_map_no_map(rdr,ns_name){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Namespaced map with namespace ",ns_name," does not specify a map."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_ns = (function cljs$tools$reader$impl$errors$throw_bad_ns(rdr,ns_name){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid value used as namespace in namespaced map: ",ns_name,"."], 0));
+});
+cljs.tools.reader.impl.errors.throw_bad_reader_tag = (function cljs$tools$reader$impl$errors$throw_bad_reader_tag(rdr,tag){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid reader tag: ",cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1(tag),". Reader tags must be symbols."], 0));
+});
+cljs.tools.reader.impl.errors.throw_unknown_reader_tag = (function cljs$tools$reader$impl$errors$throw_unknown_reader_tag(rdr,tag){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["No reader function for tag ",cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1(tag),"."], 0));
+});
+cljs.tools.reader.impl.errors.duplicate_keys_error = (function cljs$tools$reader$impl$errors$duplicate_keys_error(msg,coll){
+var duplicates = (function cljs$tools$reader$impl$errors$duplicate_keys_error_$_duplicates(seq){
+var iter__4311__auto__ = (function cljs$tools$reader$impl$errors$duplicate_keys_error_$_duplicates_$_iter__4703(s__4704){
+return (new cljs.core.LazySeq(null,(function (){
+var s__4704__$1 = s__4704;
+while(true){
+var temp__5457__auto__ = cljs.core.seq(s__4704__$1);
+if(temp__5457__auto__){
+var s__4704__$2 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s__4704__$2)){
+var c__4309__auto__ = cljs.core.chunk_first(s__4704__$2);
+var size__4310__auto__ = cljs.core.count(c__4309__auto__);
+var b__4706 = cljs.core.chunk_buffer(size__4310__auto__);
+if((function (){var i__4705 = (0);
+while(true){
+if((i__4705 < size__4310__auto__)){
+var vec__4707 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c__4309__auto__,i__4705);
+var id = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4707,(0),null);
+var freq = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4707,(1),null);
+if((freq > (1))){
+cljs.core.chunk_append(b__4706,id);
+
+var G__4713 = (i__4705 + (1));
+i__4705 = G__4713;
+continue;
+} else {
+var G__4714 = (i__4705 + (1));
+i__4705 = G__4714;
+continue;
+}
+} else {
+return true;
+}
+break;
+}
+})()){
+return cljs.core.chunk_cons(cljs.core.chunk(b__4706),cljs$tools$reader$impl$errors$duplicate_keys_error_$_duplicates_$_iter__4703(cljs.core.chunk_rest(s__4704__$2)));
+} else {
+return cljs.core.chunk_cons(cljs.core.chunk(b__4706),null);
+}
+} else {
+var vec__4710 = cljs.core.first(s__4704__$2);
+var id = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4710,(0),null);
+var freq = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4710,(1),null);
+if((freq > (1))){
+return cljs.core.cons(id,cljs$tools$reader$impl$errors$duplicate_keys_error_$_duplicates_$_iter__4703(cljs.core.rest(s__4704__$2)));
+} else {
+var G__4715 = cljs.core.rest(s__4704__$2);
+s__4704__$1 = G__4715;
+continue;
+}
+}
+} else {
+return null;
+}
+break;
+}
+}),null,null));
+});
+return iter__4311__auto__(cljs.core.frequencies(seq));
+});
+var dups = duplicates(coll);
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(cljs.core.str,msg,(((cljs.core.count(dups) > (1)))?"s":null),": ",cljs.core.interpose.cljs$core$IFn$_invoke$arity$2(", ",dups));
+});
+cljs.tools.reader.impl.errors.throw_dup_keys = (function cljs$tools$reader$impl$errors$throw_dup_keys(rdr,kind,ks){
+return cljs.tools.reader.impl.errors.reader_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.tools.reader.impl.errors.duplicate_keys_error([cljs.core.str.cljs$core$IFn$_invoke$arity$1(clojure.string.capitalize(cljs.core.name(kind)))," literal contains duplicate key"].join(''),ks)], 0));
+});
+cljs.tools.reader.impl.errors.throw_eof_error = (function cljs$tools$reader$impl$errors$throw_eof_error(rdr,line){
+if(cljs.core.truth_(line)){
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["EOF while reading, starting at line ",line,"."], 0));
+} else {
+return cljs.tools.reader.impl.errors.eof_error.cljs$core$IFn$_invoke$arity$variadic(rdr,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["EOF while reading."], 0));
+}
+});
diff --git a/js/cljs/tools/reader/impl/inspect.cljs b/js/cljs/tools/reader/impl/inspect.cljs
new file mode 100644
index 0000000..ae1711e
--- /dev/null
+++ b/js/cljs/tools/reader/impl/inspect.cljs
@@ -0,0 +1,90 @@
+;;   Copyright (c) Russ Olsen, Nicola Mometto, Rich Hickey & contributors.
+;;   The use and distribution terms for this software are covered by the
+;;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;;   which can be found in the file epl-v10.html at the root of this distribution.
+;;   By using this software in any fashion, you are agreeing to be bound by
+;;   the terms of this license.
+;;   You must not remove this notice, or any other, from this software.
+
+(ns cljs.tools.reader.impl.inspect)
+
+(declare inspect*)
+
+(defn- inspect*-col [truncate col start end]
+  (let [n (count col)
+        l (if truncate 0 (min 10 n))
+        elements (map (partial inspect* true) (take l col))
+        content (apply str (interpose " " elements))
+        suffix (if (< l n) "...")]
+    (str start content suffix end)))
+
+(defn- dispatch-inspect
+  [_ x]
+  (cond
+   (nil? x) :nil
+   (string? x) :string
+   (keyword? x) :strable
+   (number? x) :strable
+   (symbol? x) :strable
+   (vector? x) :vector
+   (list? x)  :list
+   (map? x) :map
+   (set? x) :set
+   (= x true) :strable
+   (= x false) :strable
+   :default (type x)))
+
+(defmulti inspect* dispatch-inspect)
+
+(defmethod inspect* :string [truncate ^String x]
+  (let [n (if truncate 5 20)
+        suffix (if (> (.-length x) n) "...\"" "\"")]
+    (str
+      \"
+      (.substring ^String x 0 (min n (.-length x)))
+      suffix)))
+
+(defmethod inspect* :strable [truncate x] (str x))
+
+(defmethod inspect* cljs.core/IndexedSeq [truncate x]
+  "<indexed seq>")
+
+(defmethod inspect* cljs.core/PersistentArrayMapSeq [truncate x]
+  "<map seq>")
+
+(defmethod inspect* cljs.core/NodeSeq [truncate x]
+  "<map seq>")
+
+(defmethod inspect* cljs.core/Cons [truncate x] "<cons>")
+
+(defmethod inspect* cljs.core/LazySeq [truncate x] "<lazy seq>")
+
+(defmethod inspect* :nil [_ _] "nil")
+
+(defmethod inspect* :list [truncate col]
+  (inspect*-col truncate col \( \)))
+
+(defmethod inspect* :map [truncate m]
+  (let [len (count m)
+        n-shown (if truncate 0 len)
+        contents (apply concat (take n-shown m))
+        suffix (if (> len n-shown) "...}" \})]
+    (inspect*-col truncate contents \{ suffix)))
+
+(defmethod inspect* :set [truncate col]
+  (inspect*-col truncate col "#{" \}))
+
+(defmethod inspect* :vector [truncate col]
+  (inspect*-col truncate col \[ \]))
+
+(defmethod inspect* :default [truncate x]
+  (pr-str (type x)))
+
+(defn inspect
+  "Return a string description of the value supplied.
+   May be the a string version of the value itself (e.g. \"true\")
+   or it may be a description (e.g. \"an instance of Foo\").
+   If truncate is true then return a very terse version of
+   the inspection."
+  ([x] (inspect* false x))
+  ([truncate x] (inspect* truncate x)))
diff --git a/js/cljs/tools/reader/impl/inspect.cljs.cache.json b/js/cljs/tools/reader/impl/inspect.cljs.cache.json
new file mode 100644
index 0000000..ae9f803
--- /dev/null
+++ b/js/cljs/tools/reader/impl/inspect.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$cljs.tools.reader.impl.inspect","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$inspect*",["^ ","^7","~$cljs.tools.reader.impl.inspect/inspect*","~:file","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","~:line",37,"~:column",1,"~:end-line",37,"~:end-column",19,"~:meta",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","^A",37,"^B",11,"^C",37,"^D",19],"~:tag","~$cljs.core/MultiFn"],"~$inspect*-col",["^ ","~:protocol-inline",null,"^E",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","^A",13,"^B",8,"^C",13,"^D",20,"~:private",true,"~:arglists",["~#list",["~$quote",["^L",[["~$truncate","~$col","~$start","~$end"]]]]]],"^J",true,"^7","~$cljs.tools.reader.impl.inspect/inspect*-col","~:variadic",false,"^@","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","^D",20,"~:method-params",["^L",[["^N","^O","^P","^Q"]]],"~:protocol-impl",null,"~:arglists-meta",["^L",[null,null]],"^B",1,"^A",13,"^C",13,"~:max-fixed-arity",4,"~:fn-var",true,"^K",["^L",["^M",["^L",[["^N","^O","^P","^Q"]]]]]],"~$dispatch-inspect",["^ ","^I",null,"^E",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","^A",21,"^B",8,"^C",21,"^D",24,"^J",true,"^K",["^L",["^M",["^L",[["~$_","~$x"]]]]]],"^J",true,"^7","~$cljs.tools.reader.impl.inspect/dispatch-inspect","^S",false,"^@","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","^D",24,"^T",["^L",[["~$_","~$x"]]],"^U",null,"^V",["^L",[null,null]],"^B",1,"^A",21,"^C",21,"^W",2,"^X",true,"^K",["^L",["^M",["^L",[["~$_","~$x"]]]]]],"~$inspect",["^ ","^I",null,"^E",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","^A",83,"^B",7,"^C",83,"^D",14,"^K",["^L",["^M",["^L",[["~$x"],["^N","~$x"]]]]],"~:doc","Return a string description of the value supplied.\n   May be the a string version of the value itself (e.g. \"true\")\n   or it may be a description (e.g. \"an instance of Foo\").\n   If truncate is true then return a very terse version of\n   the inspection.","~:top-fn",["^ ","^S",false,"^W",2,"^T",["^L",[["~$x"],["^N","~$x"]]],"^K",["^L",[["~$x"],["^N","~$x"]]],"^V",["^L",[null,null]]]],"^7","~$cljs.tools.reader.impl.inspect/inspect","^S",false,"^@","/home/julien/.cljs/.aot_cache/1.10.329/D9FBECF/cljs/tools/reader/impl/inspect.cljs","^D",14,"^11",["^ ","^S",false,"^W",2,"^T",["^L",[["~$x"],["^N","~$x"]]],"^K",["^L",[["~$x"],["^N","~$x"]]],"^V",["^L",[null,null]]],"^T",["^L",[["~$x"],["^N","~$x"]]],"^U",null,"^V",["^L",[null,null]],"^B",1,"^A",83,"^C",83,"^W",2,"^X",true,"^K",["^L",[["~$x"],["^N","~$x"]]],"^10","Return a string description of the value supplied.\n   May be the a string version of the value itself (e.g. \"true\")\n   or it may be a description (e.g. \"an instance of Foo\").\n   If truncate is true then return a very terse version of\n   the inspection."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["~:default","~:string","~:vector","~:strable","~:list","~:nil","~:set","~:hierarchy","~:map"]],"~:order",["^1<","^18","^1:","^19","^1;","^1?","^1=","^17","^1>"]],"^10",null]
\ No newline at end of file
diff --git a/js/cljs/tools/reader/impl/inspect.js b/js/cljs/tools/reader/impl/inspect.js
new file mode 100644
index 0000000..9684c29
--- /dev/null
+++ b/js/cljs/tools/reader/impl/inspect.js
@@ -0,0 +1,155 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('cljs.tools.reader.impl.inspect');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+cljs.tools.reader.impl.inspect.inspect_STAR__col = (function cljs$tools$reader$impl$inspect$inspect_STAR__col(truncate,col,start,end){
+var n = cljs.core.count(col);
+var l = (cljs.core.truth_(truncate)?(0):(function (){var x__4027__auto__ = (10);
+var y__4028__auto__ = n;
+return ((x__4027__auto__ < y__4028__auto__) ? x__4027__auto__ : y__4028__auto__);
+})());
+var elements = cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(cljs.tools.reader.impl.inspect.inspect_STAR_,true),cljs.core.take.cljs$core$IFn$_invoke$arity$2(l,col));
+var content = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.str,cljs.core.interpose.cljs$core$IFn$_invoke$arity$2(" ",elements));
+var suffix = (((l < n))?"...":null);
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(start),cljs.core.str.cljs$core$IFn$_invoke$arity$1(content),cljs.core.str.cljs$core$IFn$_invoke$arity$1(suffix),cljs.core.str.cljs$core$IFn$_invoke$arity$1(end)].join('');
+});
+cljs.tools.reader.impl.inspect.dispatch_inspect = (function cljs$tools$reader$impl$inspect$dispatch_inspect(_,x){
+if((x == null)){
+return cljs.core.cst$kw$nil;
+} else {
+if(typeof x === 'string'){
+return cljs.core.cst$kw$string;
+} else {
+if((x instanceof cljs.core.Keyword)){
+return cljs.core.cst$kw$strable;
+} else {
+if(typeof x === 'number'){
+return cljs.core.cst$kw$strable;
+} else {
+if((x instanceof cljs.core.Symbol)){
+return cljs.core.cst$kw$strable;
+} else {
+if(cljs.core.vector_QMARK_(x)){
+return cljs.core.cst$kw$vector;
+} else {
+if(cljs.core.list_QMARK_(x)){
+return cljs.core.cst$kw$list;
+} else {
+if(cljs.core.map_QMARK_(x)){
+return cljs.core.cst$kw$map;
+} else {
+if(cljs.core.set_QMARK_(x)){
+return cljs.core.cst$kw$set;
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,true)){
+return cljs.core.cst$kw$strable;
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,false)){
+return cljs.core.cst$kw$strable;
+} else {
+return cljs.core.type(x);
+
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+}
+});
+if((typeof cljs !== 'undefined') && (typeof cljs.tools !== 'undefined') && (typeof cljs.tools.reader !== 'undefined') && (typeof cljs.tools.reader.impl !== 'undefined') && (typeof cljs.tools.reader.impl.inspect !== 'undefined') && (typeof cljs.tools.reader.impl.inspect.inspect_STAR_ !== 'undefined')){
+} else {
+cljs.tools.reader.impl.inspect.inspect_STAR_ = (function (){var method_table__4401__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var prefer_table__4402__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var method_cache__4403__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var cached_hierarchy__4404__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var hierarchy__4405__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$3(cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$hierarchy,cljs.core.get_global_hierarchy());
+return (new cljs.core.MultiFn(cljs.core.symbol.cljs$core$IFn$_invoke$arity$2("cljs.tools.reader.impl.inspect","inspect*"),cljs.tools.reader.impl.inspect.dispatch_inspect,cljs.core.cst$kw$default,hierarchy__4405__auto__,method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__));
+})();
+}
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$string,(function (truncate,x){
+var n = (cljs.core.truth_(truncate)?(5):(20));
+var suffix = (((x.length > n))?"...\"":"\"");
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1("\""),cljs.core.str.cljs$core$IFn$_invoke$arity$1(x.substring((0),(function (){var x__4027__auto__ = n;
+var y__4028__auto__ = x.length;
+return ((x__4027__auto__ < y__4028__auto__) ? x__4027__auto__ : y__4028__auto__);
+})())),cljs.core.str.cljs$core$IFn$_invoke$arity$1(suffix)].join('');
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$strable,(function (truncate,x){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)].join('');
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.IndexedSeq,(function (truncate,x){
+return "<indexed seq>";
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.PersistentArrayMapSeq,(function (truncate,x){
+return "<map seq>";
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.NodeSeq,(function (truncate,x){
+return "<map seq>";
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.Cons,(function (truncate,x){
+return "<cons>";
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.LazySeq,(function (truncate,x){
+return "<lazy seq>";
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$nil,(function (_,___$1){
+return "nil";
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$list,(function (truncate,col){
+return cljs.tools.reader.impl.inspect.inspect_STAR__col(truncate,col,"(",")");
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$map,(function (truncate,m){
+var len = cljs.core.count(m);
+var n_shown = (cljs.core.truth_(truncate)?(0):len);
+var contents = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.concat,cljs.core.take.cljs$core$IFn$_invoke$arity$2(n_shown,m));
+var suffix = (((len > n_shown))?"...}":"}");
+return cljs.tools.reader.impl.inspect.inspect_STAR__col(truncate,contents,"{",suffix);
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$set,(function (truncate,col){
+return cljs.tools.reader.impl.inspect.inspect_STAR__col(truncate,col,"#{","}");
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$vector,(function (truncate,col){
+return cljs.tools.reader.impl.inspect.inspect_STAR__col(truncate,col,"[","]");
+}));
+cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$default,(function (truncate,x){
+return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.type(x)], 0));
+}));
+/**
+ * Return a string description of the value supplied.
+ * May be the a string version of the value itself (e.g. "true")
+ * or it may be a description (e.g. "an instance of Foo").
+ * If truncate is true then return a very terse version of
+ * the inspection.
+ */
+cljs.tools.reader.impl.inspect.inspect = (function cljs$tools$reader$impl$inspect$inspect(var_args){
+var G__4657 = arguments.length;
+switch (G__4657) {
+case 1:
+return cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return (cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IFn$_invoke$arity$2 ? cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IFn$_invoke$arity$2(false,x) : cljs.tools.reader.impl.inspect.inspect_STAR_.call(null,false,x));
+});
+
+cljs.tools.reader.impl.inspect.inspect.cljs$core$IFn$_invoke$arity$2 = (function (truncate,x){
+return (cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IFn$_invoke$arity$2 ? cljs.tools.reader.impl.inspect.inspect_STAR_.cljs$core$IFn$_invoke$arity$2(truncate,x) : cljs.tools.reader.impl.inspect.inspect_STAR_.call(null,truncate,x));
+});
+
+cljs.tools.reader.impl.inspect.inspect.cljs$lang$maxFixedArity = 2;
+
diff --git a/js/cljs/tools/reader/impl/utils.cljs b/js/cljs/tools/reader/impl/utils.cljs
new file mode 100644
index 0000000..46e2d99
--- /dev/null
+++ b/js/cljs/tools/reader/impl/utils.cljs
@@ -0,0 +1,97 @@
+;;   Copyright (c) Nicola Mometto, Rich Hickey & contributors.
+;;   The use and distribution terms for this software are covered by the
+;;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;;   which can be found in the file epl-v10.html at the root of this distribution.
+;;   By using this software in any fashion, you are agreeing to be bound by
+;;   the terms of this license.
+;;   You must not remove this notice, or any other, from this software.
+
+(ns cljs.tools.reader.impl.utils
+  (:refer-clojure :exclude [char])
+  (:require
+   [clojure.string :as string]
+   [goog.string :as gstring]))
+
+(defn char [x]
+  (when-not (nil? x)
+    (cljs.core/char x)))
+
+(defn ^boolean ex-info? [ex]
+  (instance? cljs.core.ExceptionInfo ex))
+
+(defrecord ReaderConditional [splicing? form])
+
+(defn ^boolean reader-conditional?
+  "Return true if the value is the data representation of a reader conditional"
+  [value]
+  (instance? ReaderConditional value))
+
+(defn reader-conditional
+  "Construct a data representation of a reader conditional.
+  If true, splicing? indicates read-cond-splicing."
+  [form splicing?]
+  (ReaderConditional. splicing? form))
+
+(extend-protocol IPrintWithWriter
+  ReaderConditional
+  (-pr-writer [coll writer opts]
+    (-write writer (str "#?" (when (:splicing? coll) "@")))
+    (pr-writer (:form coll) writer opts)))
+
+(def ws-rx #"[\s]")
+
+(defn ^boolean whitespace?
+  "Checks whether a given character is whitespace"
+  [ch]
+  (when-not (nil? ch)
+    (if (identical? ch \,)
+      true
+      (.test ws-rx ch))))
+
+(defn ^boolean numeric?
+  "Checks whether a given character is numeric"
+  [ch]
+  (when-not (nil? ch)
+    (gstring/isNumeric ch)))
+
+(defn ^boolean newline?
+  "Checks whether the character is a newline"
+  [c]
+  (or (identical? \newline c)
+      (identical? "\n" c)
+      (nil? c)))
+
+(defn desugar-meta
+  "Resolves syntactical sugar in metadata" ;; could be combined with some other desugar?
+  [f]
+  (cond
+    (keyword? f) {f true}
+    (symbol? f)  {:tag f}
+    (string? f)  {:tag f}
+    :else        f))
+
+(def last-id (atom 0))
+
+(defn next-id
+  []
+  (swap! last-id inc))
+
+(defn namespace-keys [ns keys]
+  (for [key keys]
+    (if (or (symbol? key)
+            (keyword? key))
+      (let [[key-ns key-name] ((juxt namespace name) key)
+            ->key (if (symbol? key) symbol keyword)]
+        (cond
+          (nil? key-ns)
+          (->key ns key-name)
+
+          (= "_" key-ns)
+          (->key key-name)
+
+          :else
+          key))
+      key)))
+
+(defn second' [[a b]]
+  (when-not a b))
diff --git a/js/cljs/tools/reader/impl/utils.cljs.cache.json b/js/cljs/tools/reader/impl/utils.cljs.cache.json
new file mode 100644
index 0000000..427179b
--- /dev/null
+++ b/js/cljs/tools/reader/impl/utils.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",["~$char"]],"~:name","~$cljs.tools.reader.impl.utils","~:imports",null,"~:requires",["^ ","~$string","~$clojure.string","^;","^;","~$gstring","~$goog.string","^=","^="],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$reader-conditional",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","~:line",29,"~:column",7,"~:end-line",29,"~:end-column",25,"~:arglists",["~#list",["~$quote",["^J",[["~$form","~$splicing?"]]]]],"~:doc","Construct a data representation of a reader conditional.\n  If true, splicing? indicates read-cond-splicing."],"^6","~$cljs.tools.reader.impl.utils/reader-conditional","~:variadic",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",25,"~:method-params",["^J",[["^L","^M"]]],"~:protocol-impl",null,"~:arglists-meta",["^J",[null,null]],"^F",1,"^E",29,"^G",29,"~:max-fixed-arity",2,"~:fn-var",true,"^I",["^J",["^K",["^J",[["^L","^M"]]]]],"^N","Construct a data representation of a reader conditional.\n  If true, splicing? indicates read-cond-splicing."],"~$whitespace?",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",43,"^F",16,"^G",43,"^H",27,"~:tag","~$boolean","^I",["^J",["^K",["^J",[["~$ch"]]]]],"^N","Checks whether a given character is whitespace"],"^6","~$cljs.tools.reader.impl.utils/whitespace?","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",27,"^Q",["^J",[["^Y"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",43,"~:ret-tag","^X","^G",43,"^T",1,"^W","^X","^U",true,"^I",["^J",["^K",["^J",[["^Y"]]]]],"^N","Checks whether a given character is whitespace"],"~$last-id",["^ ","^6","~$cljs.tools.reader.impl.utils/last-id","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",73,"^F",1,"^G",73,"^H",13,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",73,"^F",6,"^G",73,"^H",13],"^W","~$any"],"^5",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",15,"^F",7,"^G",15,"^H",11,"^I",["^J",["^K",["^J",[["~$x"]]]]]],"^6","~$cljs.tools.reader.impl.utils/char","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",11,"^Q",["^J",[["~$x"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",15,"^G",15,"^T",1,"^U",true,"^I",["^J",["^K",["^J",[["~$x"]]]]]],"~$numeric?",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",51,"^F",16,"^G",51,"^H",24,"^W","^X","^I",["^J",["^K",["^J",[["^Y"]]]]],"^N","Checks whether a given character is numeric"],"^6","~$cljs.tools.reader.impl.utils/numeric?","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",24,"^Q",["^J",[["^Y"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",51,"^[","^X","^G",51,"^T",1,"^W","^X","^U",true,"^I",["^J",["^K",["^J",[["^Y"]]]]],"^N","Checks whether a given character is numeric"],"~$ReaderConditional",["^ ","~:num-fields",2,"~:protocols",["^4",["~$cljs.core/IRecord","~$cljs.core/IEquiv","~$cljs.core/IHash","~$cljs.core/ICollection","~$cljs.core/ICounted","~$cljs.core/ISeqable","~$cljs.core/IMeta","~$cljs.core/ICloneable","~$cljs.core/IPrintWithWriter","~$cljs.core/IIterable","~$cljs.core/IWithMeta","~$cljs.core/IAssociative","~$cljs.core/IMap","~$cljs.core/ILookup"]],"^6","~$cljs.tools.reader.impl.utils/ReaderConditional","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",29,"~:type",true,"^F",12,"~:internal-ctor",true,"^E",22,"~:record",true,"^G",22,"^W","~$function","~:skip-protocol-flag",["^4",["^19","^1:","^1;","^1<","^1=","^1>","^1?","^1@","^1A","^1B","^1C","^1D","^1E","^1F"]]],"~$second'",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",96,"^F",7,"^G",96,"^H",14,"^I",["^J",["^K",["^J",[[["~$a","~$b"]]]]]]],"^6","~$cljs.tools.reader.impl.utils/second'","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",14,"^Q",["^J",[["~$p__4635"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",96,"^G",96,"^T",1,"^U",true,"^I",["^J",["^K",["^J",[[["~$a","~$b"]]]]]]],"~$desugar-meta",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",64,"^F",7,"^G",64,"^H",19,"^I",["^J",["^K",["^J",[["~$f"]]]]],"^N","Resolves syntactical sugar in metadata"],"^6","~$cljs.tools.reader.impl.utils/desugar-meta","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",19,"^Q",["^J",[["~$f"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",64,"^G",64,"^T",1,"^U",true,"^I",["^J",["^K",["^J",[["~$f"]]]]],"^N","Resolves syntactical sugar in metadata"],"~$->ReaderConditional",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",22,"^F",12,"^G",22,"^H",29,"^1I",true,"~:factory","~:positional","^I",["^J",["^K",["^J",[["^M","^L"]]]]],"^N","Positional factory function for cljs.tools.reader.impl.utils/ReaderConditional."],"^6","~$cljs.tools.reader.impl.utils/->ReaderConditional","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",29,"^Q",["^J",[["^M","^L"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^1I",true,"^1S","^1T","^E",22,"^G",22,"^T",2,"^U",true,"^I",["^J",["^K",["^J",[["^M","^L"]]]]],"^N","Positional factory function for cljs.tools.reader.impl.utils/ReaderConditional."],"~$next-id",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",75,"^F",7,"^G",75,"^H",14,"^I",["^J",["^K",["^J",[[]]]]]],"^6","~$cljs.tools.reader.impl.utils/next-id","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",14,"^Q",["^J",[[]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",75,"^G",75,"^T",0,"^U",true,"^I",["^J",["^K",["^J",[[]]]]]],"~$map->ReaderConditional",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",22,"^F",12,"^G",22,"^H",29,"^1I",true,"^1S","~:map","^I",["^J",["^K",["^J",[["~$G__4610"]]]]],"^N","Factory function for cljs.tools.reader.impl.utils/ReaderConditional, taking a map of keywords to field values."],"^6","~$cljs.tools.reader.impl.utils/map->ReaderConditional","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",29,"^Q",["^J",[["^1Z"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^1I",true,"^1S","^1Y","^E",22,"^G",22,"^T",1,"^U",true,"^I",["^J",["^K",["^J",[["^1Z"]]]]],"^N","Factory function for cljs.tools.reader.impl.utils/ReaderConditional, taking a map of keywords to field values."],"~$ex-info?",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",19,"^F",16,"^G",19,"^H",24,"^W","^X","^I",["^J",["^K",["^J",[["~$ex"]]]]]],"^6","~$cljs.tools.reader.impl.utils/ex-info?","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",24,"^Q",["^J",[["^21"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",19,"^[","^X","^G",19,"^T",1,"^W","^X","^U",true,"^I",["^J",["^K",["^J",[["^21"]]]]]],"~$reader-conditional?",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",24,"^F",16,"^G",24,"^H",35,"^W","^X","^I",["^J",["^K",["^J",[["~$value"]]]]],"^N","Return true if the value is the data representation of a reader conditional"],"^6","~$cljs.tools.reader.impl.utils/reader-conditional?","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",35,"^Q",["^J",[["^24"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",24,"^[","^X","^G",24,"^T",1,"^W","^X","^U",true,"^I",["^J",["^K",["^J",[["^24"]]]]],"^N","Return true if the value is the data representation of a reader conditional"],"~$newline?",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",57,"^F",16,"^G",57,"^H",24,"^W","^X","^I",["^J",["^K",["^J",[["~$c"]]]]],"^N","Checks whether the character is a newline"],"^6","~$cljs.tools.reader.impl.utils/newline?","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",24,"^Q",["^J",[["~$c"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",57,"^[","^X","^G",57,"^T",1,"^W","^X","^U",true,"^I",["^J",["^K",["^J",[["~$c"]]]]],"^N","Checks whether the character is a newline"],"~$namespace-keys",["^ ","^B",null,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",79,"^F",7,"^G",79,"^H",21,"^I",["^J",["^K",["^J",[["~$ns","~$keys"]]]]]],"^6","~$cljs.tools.reader.impl.utils/namespace-keys","^P",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^H",21,"^Q",["^J",[["^29","^2:"]]],"^R",null,"^S",["^J",[null,null]],"^F",1,"^E",79,"^G",79,"^T",2,"^U",true,"^I",["^J",["^K",["^J",[["^29","^2:"]]]]]],"~$ws-rx",["^ ","^6","~$cljs.tools.reader.impl.utils/ws-rx","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",41,"^F",1,"^G",41,"^H",11,"^C",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/4642029/cljs/tools/reader/impl/utils.cljs","^E",41,"^F",6,"^G",41,"^H",11],"^W","^12"]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^4",["^L","~:else","~:splicing?","^M","~:form","^W"]],"~:order",["^2C","^2D","^M","^L","^W","^2B"]],"^N",null]
\ No newline at end of file
diff --git a/js/cljs/tools/reader/impl/utils.js b/js/cljs/tools/reader/impl/utils.js
new file mode 100644
index 0000000..4713b66
--- /dev/null
+++ b/js/cljs/tools/reader/impl/utils.js
@@ -0,0 +1,380 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('cljs.tools.reader.impl.utils');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.string');
+goog.require('goog.string');
+cljs.tools.reader.impl.utils.char$ = (function cljs$tools$reader$impl$utils$char(x){
+if((x == null)){
+return null;
+} else {
+return cljs.core.char$(x);
+}
+});
+cljs.tools.reader.impl.utils.ex_info_QMARK_ = (function cljs$tools$reader$impl$utils$ex_info_QMARK_(ex){
+return (ex instanceof cljs.core.ExceptionInfo);
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IRecord}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {cljs.core.IIterable}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.IMap}
+ * @implements {cljs.core.ILookup}
+*/
+cljs.tools.reader.impl.utils.ReaderConditional = (function (splicing_QMARK_,form,__meta,__extmap,__hash){
+this.splicing_QMARK_ = splicing_QMARK_;
+this.form = form;
+this.__meta = __meta;
+this.__extmap = __extmap;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 2229667594;
+this.cljs$lang$protocol_mask$partition1$ = 139264;
+});
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (this__4190__auto__,k__4191__auto__){
+var self__ = this;
+var this__4190__auto____$1 = this;
+return this__4190__auto____$1.cljs$core$ILookup$_lookup$arity$3(null,k__4191__auto__,null);
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (this__4192__auto__,k4607,else__4193__auto__){
+var self__ = this;
+var this__4192__auto____$1 = this;
+var G__4611 = k4607;
+var G__4611__$1 = (((G__4611 instanceof cljs.core.Keyword))?G__4611.fqn:null);
+switch (G__4611__$1) {
+case "splicing?":
+return self__.splicing_QMARK_;
+
+break;
+case "form":
+return self__.form;
+
+break;
+default:
+return cljs.core.get.cljs$core$IFn$_invoke$arity$3(self__.__extmap,k4607,else__4193__auto__);
+
+}
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (this__4204__auto__,writer__4205__auto__,opts__4206__auto__){
+var self__ = this;
+var this__4204__auto____$1 = this;
+var pr_pair__4207__auto__ = ((function (this__4204__auto____$1){
+return (function (keyval__4208__auto__){
+return cljs.core.pr_sequential_writer(writer__4205__auto__,cljs.core.pr_writer,""," ","",opts__4206__auto__,keyval__4208__auto__);
+});})(this__4204__auto____$1))
+;
+return cljs.core.pr_sequential_writer(writer__4205__auto__,pr_pair__4207__auto__,"#cljs.tools.reader.impl.utils.ReaderConditional{",", ","}",opts__4206__auto__,cljs.core.concat.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.cst$kw$splicing_QMARK_,self__.splicing_QMARK_],null)),(new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.cst$kw$form,self__.form],null))], null),self__.__extmap));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (G__4606){
+var self__ = this;
+var G__4606__$1 = this;
+return (new cljs.core.RecordIter((0),G__4606__$1,2,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$splicing_QMARK_,cljs.core.cst$kw$form], null),(cljs.core.truth_(self__.__extmap)?cljs.core._iterator(self__.__extmap):cljs.core.nil_iter())));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IMeta$_meta$arity$1 = (function (this__4188__auto__){
+var self__ = this;
+var this__4188__auto____$1 = this;
+return self__.__meta;
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (this__4185__auto__){
+var self__ = this;
+var this__4185__auto____$1 = this;
+return (new cljs.tools.reader.impl.utils.ReaderConditional(self__.splicing_QMARK_,self__.form,self__.__meta,self__.__extmap,self__.__hash));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$ICounted$_count$arity$1 = (function (this__4194__auto__){
+var self__ = this;
+var this__4194__auto____$1 = this;
+return (2 + cljs.core.count(self__.__extmap));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IHash$_hash$arity$1 = (function (this__4186__auto__){
+var self__ = this;
+var this__4186__auto____$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = (function (){var fexpr__4612 = ((function (h__4048__auto__,this__4186__auto____$1){
+return (function (coll__4187__auto__){
+return (-209062840 ^ cljs.core.hash_unordered_coll(coll__4187__auto__));
+});})(h__4048__auto__,this__4186__auto____$1))
+;
+return fexpr__4612(this__4186__auto____$1);
+})();
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (this4608,other4609){
+var self__ = this;
+var this4608__$1 = this;
+return ((!((other4609 == null))) && ((this4608__$1.constructor === other4609.constructor)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(this4608__$1.splicing_QMARK_,other4609.splicing_QMARK_)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(this4608__$1.form,other4609.form)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(this4608__$1.__extmap,other4609.__extmap)));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (this__4199__auto__,k__4200__auto__){
+var self__ = this;
+var this__4199__auto____$1 = this;
+if(cljs.core.contains_QMARK_(new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$splicing_QMARK_,null,cljs.core.cst$kw$form,null], null), null),k__4200__auto__)){
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(cljs.core._with_meta(cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,this__4199__auto____$1),self__.__meta),k__4200__auto__);
+} else {
+return (new cljs.tools.reader.impl.utils.ReaderConditional(self__.splicing_QMARK_,self__.form,self__.__meta,cljs.core.not_empty(cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(self__.__extmap,k__4200__auto__)),null));
+}
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (this__4197__auto__,k__4198__auto__,G__4606){
+var self__ = this;
+var this__4197__auto____$1 = this;
+var pred__4613 = cljs.core.keyword_identical_QMARK_;
+var expr__4614 = k__4198__auto__;
+if(cljs.core.truth_((function (){var G__4616 = cljs.core.cst$kw$splicing_QMARK_;
+var G__4617 = expr__4614;
+return (pred__4613.cljs$core$IFn$_invoke$arity$2 ? pred__4613.cljs$core$IFn$_invoke$arity$2(G__4616,G__4617) : pred__4613.call(null,G__4616,G__4617));
+})())){
+return (new cljs.tools.reader.impl.utils.ReaderConditional(G__4606,self__.form,self__.__meta,self__.__extmap,null));
+} else {
+if(cljs.core.truth_((function (){var G__4618 = cljs.core.cst$kw$form;
+var G__4619 = expr__4614;
+return (pred__4613.cljs$core$IFn$_invoke$arity$2 ? pred__4613.cljs$core$IFn$_invoke$arity$2(G__4618,G__4619) : pred__4613.call(null,G__4618,G__4619));
+})())){
+return (new cljs.tools.reader.impl.utils.ReaderConditional(self__.splicing_QMARK_,G__4606,self__.__meta,self__.__extmap,null));
+} else {
+return (new cljs.tools.reader.impl.utils.ReaderConditional(self__.splicing_QMARK_,self__.form,self__.__meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.__extmap,k__4198__auto__,G__4606),null));
+}
+}
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this__4202__auto__){
+var self__ = this;
+var this__4202__auto____$1 = this;
+return cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(new cljs.core.MapEntry(cljs.core.cst$kw$splicing_QMARK_,self__.splicing_QMARK_,null)),(new cljs.core.MapEntry(cljs.core.cst$kw$form,self__.form,null))], null),self__.__extmap));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (this__4189__auto__,G__4606){
+var self__ = this;
+var this__4189__auto____$1 = this;
+return (new cljs.tools.reader.impl.utils.ReaderConditional(self__.splicing_QMARK_,self__.form,G__4606,self__.__extmap,self__.__hash));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$ICollection$_conj$arity$2 = (function (this__4195__auto__,entry__4196__auto__){
+var self__ = this;
+var this__4195__auto____$1 = this;
+if(cljs.core.vector_QMARK_(entry__4196__auto__)){
+return this__4195__auto____$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry__4196__auto__,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry__4196__auto__,(1)));
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,this__4195__auto____$1,entry__4196__auto__);
+}
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$splicing_QMARK_,cljs.core.cst$sym$form], null);
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.cljs$lang$type = true;
+
+cljs.tools.reader.impl.utils.ReaderConditional.cljs$lang$ctorPrSeq = (function (this__4227__auto__){
+return (new cljs.core.List(null,"cljs.tools.reader.impl.utils/ReaderConditional",null,(1),null));
+});
+
+cljs.tools.reader.impl.utils.ReaderConditional.cljs$lang$ctorPrWriter = (function (this__4227__auto__,writer__4228__auto__){
+return cljs.core._write(writer__4228__auto__,"cljs.tools.reader.impl.utils/ReaderConditional");
+});
+
+/**
+ * Positional factory function for cljs.tools.reader.impl.utils/ReaderConditional.
+ */
+cljs.tools.reader.impl.utils.__GT_ReaderConditional = (function cljs$tools$reader$impl$utils$__GT_ReaderConditional(splicing_QMARK_,form){
+return (new cljs.tools.reader.impl.utils.ReaderConditional(splicing_QMARK_,form,null,null,null));
+});
+
+/**
+ * Factory function for cljs.tools.reader.impl.utils/ReaderConditional, taking a map of keywords to field values.
+ */
+cljs.tools.reader.impl.utils.map__GT_ReaderConditional = (function cljs$tools$reader$impl$utils$map__GT_ReaderConditional(G__4610){
+var extmap__4223__auto__ = (function (){var G__4620 = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$variadic(G__4610,cljs.core.cst$kw$splicing_QMARK_,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$form], 0));
+if(cljs.core.record_QMARK_(G__4610)){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,G__4620);
+} else {
+return G__4620;
+}
+})();
+return (new cljs.tools.reader.impl.utils.ReaderConditional(cljs.core.cst$kw$splicing_QMARK_.cljs$core$IFn$_invoke$arity$1(G__4610),cljs.core.cst$kw$form.cljs$core$IFn$_invoke$arity$1(G__4610),null,cljs.core.not_empty(extmap__4223__auto__),null));
+});
+
+/**
+ * Return true if the value is the data representation of a reader conditional
+ */
+cljs.tools.reader.impl.utils.reader_conditional_QMARK_ = (function cljs$tools$reader$impl$utils$reader_conditional_QMARK_(value){
+return (value instanceof cljs.tools.reader.impl.utils.ReaderConditional);
+});
+/**
+ * Construct a data representation of a reader conditional.
+ *   If true, splicing? indicates read-cond-splicing.
+ */
+cljs.tools.reader.impl.utils.reader_conditional = (function cljs$tools$reader$impl$utils$reader_conditional(form,splicing_QMARK_){
+return (new cljs.tools.reader.impl.utils.ReaderConditional(splicing_QMARK_,form,null,null,null));
+});
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.impl.utils.ReaderConditional.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var coll__$1 = this;
+cljs.core._write(writer,["#?",cljs.core.str.cljs$core$IFn$_invoke$arity$1((cljs.core.truth_(cljs.core.cst$kw$splicing_QMARK_.cljs$core$IFn$_invoke$arity$1(coll__$1))?"@":null))].join(''));
+
+return cljs.core.pr_writer(cljs.core.cst$kw$form.cljs$core$IFn$_invoke$arity$1(coll__$1),writer,opts);
+});
+cljs.tools.reader.impl.utils.ws_rx = /[\s]/;
+/**
+ * Checks whether a given character is whitespace
+ */
+cljs.tools.reader.impl.utils.whitespace_QMARK_ = (function cljs$tools$reader$impl$utils$whitespace_QMARK_(ch){
+if((ch == null)){
+return null;
+} else {
+if((ch === ",")){
+return true;
+} else {
+return cljs.tools.reader.impl.utils.ws_rx.test(ch);
+}
+}
+});
+/**
+ * Checks whether a given character is numeric
+ */
+cljs.tools.reader.impl.utils.numeric_QMARK_ = (function cljs$tools$reader$impl$utils$numeric_QMARK_(ch){
+if((ch == null)){
+return null;
+} else {
+return goog.string.isNumeric(ch);
+}
+});
+/**
+ * Checks whether the character is a newline
+ */
+cljs.tools.reader.impl.utils.newline_QMARK_ = (function cljs$tools$reader$impl$utils$newline_QMARK_(c){
+return ((("\n" === c)) || (("\n" === c)) || ((c == null)));
+});
+/**
+ * Resolves syntactical sugar in metadata
+ */
+cljs.tools.reader.impl.utils.desugar_meta = (function cljs$tools$reader$impl$utils$desugar_meta(f){
+if((f instanceof cljs.core.Keyword)){
+return cljs.core.PersistentArrayMap.createAsIfByAssoc([f,true]);
+} else {
+if((f instanceof cljs.core.Symbol)){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,f], null);
+} else {
+if(typeof f === 'string'){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,f], null);
+} else {
+return f;
+
+}
+}
+}
+});
+cljs.tools.reader.impl.utils.last_id = cljs.core.atom.cljs$core$IFn$_invoke$arity$1((0));
+cljs.tools.reader.impl.utils.next_id = (function cljs$tools$reader$impl$utils$next_id(){
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(cljs.tools.reader.impl.utils.last_id,cljs.core.inc);
+});
+cljs.tools.reader.impl.utils.namespace_keys = (function cljs$tools$reader$impl$utils$namespace_keys(ns,keys){
+var iter__4311__auto__ = (function cljs$tools$reader$impl$utils$namespace_keys_$_iter__4622(s__4623){
+return (new cljs.core.LazySeq(null,(function (){
+var s__4623__$1 = s__4623;
+while(true){
+var temp__5457__auto__ = cljs.core.seq(s__4623__$1);
+if(temp__5457__auto__){
+var s__4623__$2 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s__4623__$2)){
+var c__4309__auto__ = cljs.core.chunk_first(s__4623__$2);
+var size__4310__auto__ = cljs.core.count(c__4309__auto__);
+var b__4625 = cljs.core.chunk_buffer(size__4310__auto__);
+if((function (){var i__4624 = (0);
+while(true){
+if((i__4624 < size__4310__auto__)){
+var key = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c__4309__auto__,i__4624);
+cljs.core.chunk_append(b__4625,(((((key instanceof cljs.core.Symbol)) || ((key instanceof cljs.core.Keyword))))?(function (){var vec__4626 = (function (){var fexpr__4629 = cljs.core.juxt.cljs$core$IFn$_invoke$arity$2(cljs.core.namespace,cljs.core.name);
+return (fexpr__4629.cljs$core$IFn$_invoke$arity$1 ? fexpr__4629.cljs$core$IFn$_invoke$arity$1(key) : fexpr__4629.call(null,key));
+})();
+var key_ns = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4626,(0),null);
+var key_name = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4626,(1),null);
+var __GT_key = (((key instanceof cljs.core.Symbol))?cljs.core.symbol:cljs.core.keyword);
+if((key_ns == null)){
+return (__GT_key.cljs$core$IFn$_invoke$arity$2 ? __GT_key.cljs$core$IFn$_invoke$arity$2(ns,key_name) : __GT_key.call(null,ns,key_name));
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2("_",key_ns)){
+return (__GT_key.cljs$core$IFn$_invoke$arity$1 ? __GT_key.cljs$core$IFn$_invoke$arity$1(key_name) : __GT_key.call(null,key_name));
+} else {
+return key;
+
+}
+}
+})():key));
+
+var G__4634 = (i__4624 + (1));
+i__4624 = G__4634;
+continue;
+} else {
+return true;
+}
+break;
+}
+})()){
+return cljs.core.chunk_cons(cljs.core.chunk(b__4625),cljs$tools$reader$impl$utils$namespace_keys_$_iter__4622(cljs.core.chunk_rest(s__4623__$2)));
+} else {
+return cljs.core.chunk_cons(cljs.core.chunk(b__4625),null);
+}
+} else {
+var key = cljs.core.first(s__4623__$2);
+return cljs.core.cons((((((key instanceof cljs.core.Symbol)) || ((key instanceof cljs.core.Keyword))))?(function (){var vec__4630 = (function (){var fexpr__4633 = cljs.core.juxt.cljs$core$IFn$_invoke$arity$2(cljs.core.namespace,cljs.core.name);
+return (fexpr__4633.cljs$core$IFn$_invoke$arity$1 ? fexpr__4633.cljs$core$IFn$_invoke$arity$1(key) : fexpr__4633.call(null,key));
+})();
+var key_ns = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4630,(0),null);
+var key_name = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4630,(1),null);
+var __GT_key = (((key instanceof cljs.core.Symbol))?cljs.core.symbol:cljs.core.keyword);
+if((key_ns == null)){
+return (__GT_key.cljs$core$IFn$_invoke$arity$2 ? __GT_key.cljs$core$IFn$_invoke$arity$2(ns,key_name) : __GT_key.call(null,ns,key_name));
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2("_",key_ns)){
+return (__GT_key.cljs$core$IFn$_invoke$arity$1 ? __GT_key.cljs$core$IFn$_invoke$arity$1(key_name) : __GT_key.call(null,key_name));
+} else {
+return key;
+
+}
+}
+})():key),cljs$tools$reader$impl$utils$namespace_keys_$_iter__4622(cljs.core.rest(s__4623__$2)));
+}
+} else {
+return null;
+}
+break;
+}
+}),null,null));
+});
+return iter__4311__auto__(keys);
+});
+cljs.tools.reader.impl.utils.second_SINGLEQUOTE_ = (function cljs$tools$reader$impl$utils$second_SINGLEQUOTE_(p__4635){
+var vec__4636 = p__4635;
+var a = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4636,(0),null);
+var b = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4636,(1),null);
+if(cljs.core.truth_(a)){
+return null;
+} else {
+return b;
+}
+});
diff --git a/js/cljs/tools/reader/reader_types.cljs b/js/cljs/tools/reader/reader_types.cljs
new file mode 100644
index 0000000..ec51be2
--- /dev/null
+++ b/js/cljs/tools/reader/reader_types.cljs
@@ -0,0 +1,283 @@
+;;   Copyright (c) Nicola Mometto, Rich Hickey & contributors.
+;;   The use and distribution terms for this software are covered by the
+;;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;;   which can be found in the file epl-v10.html at the root of this distribution.
+;;   By using this software in any fashion, you are agreeing to be bound by
+;;   the terms of this license.
+;;   You must not remove this notice, or any other, from this software.
+
+(ns ^{:doc "Protocols and default Reader types implementation"
+      :author "Bronsa"}
+  cljs.tools.reader.reader-types
+  (:refer-clojure :exclude [char read-line])
+  (:require [cljs.tools.reader.impl.utils :refer [char whitespace? newline?]]
+            [goog.string])
+  (:import goog.string.StringBuffer))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; reader protocols
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(defprotocol Reader
+  (read-char [reader]
+    "Returns the next char from the Reader, nil if the end of stream has been reached")
+  (peek-char [reader]
+    "Returns the next char from the Reader without removing it from the reader stream"))
+
+(defprotocol IPushbackReader
+  (unread [reader ch]
+    "Pushes back a single character on to the stream"))
+
+(defprotocol IndexingReader
+  (get-line-number [reader]
+    "Returns the line number of the next character to be read from the stream")
+  (get-column-number [reader]
+    "Returns the column number of the next character to be read from the stream")
+  (get-file-name [reader]
+    "Returns the file name the reader is reading from, or nil"))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; reader deftypes
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(deftype StringReader
+    [s s-len ^:mutable s-pos]
+  Reader
+  (read-char [reader]
+    (when (> s-len s-pos)
+      (let [r (.charAt s s-pos)]
+        (set! s-pos (inc s-pos))
+        r)))
+  (peek-char [reader]
+    (when (> s-len s-pos)
+      (.charAt s s-pos))))
+
+(deftype NodeReadableReader [readable ^:mutable buf]
+  Reader
+  (read-char [reader]
+    (if buf
+      (let [c (aget buf 0)]
+        (set! buf nil)
+        (char c))
+      (let [c (str (.read readable 1))]
+        (when c
+          (char c)))))
+  (peek-char [reader]
+    (when-not buf
+      (set! buf (str (.read readable 1))))
+    (when buf
+      (char (aget buf 0)))))
+
+(deftype PushbackReader
+  [^not-native rdr buf buf-len ^:mutable buf-pos]
+  Reader
+  (read-char [reader]
+    (let [c (if (< buf-pos buf-len)
+              (aget buf buf-pos)
+              (read-char rdr))]
+      (when (< buf-pos buf-len)
+        (set! buf-pos (inc buf-pos)))
+      (char c)))
+  (peek-char [reader]
+    (let [c (if (< buf-pos buf-len)
+              (aget buf buf-pos)
+              (peek-char rdr))]
+      (char c)))
+  IPushbackReader
+  (unread [reader ch]
+    (when ch
+      (if (zero? buf-pos) (throw (js/Error. "Pushback buffer is full")))
+      (set! buf-pos (dec buf-pos))
+      (aset buf buf-pos ch))))
+
+(defn- normalize-newline [^not-native rdr ch]
+  (if (identical? \return ch)
+    (let [c (peek-char rdr)]
+      (when (or (identical? \formfeed c)
+                (identical? \newline c))
+        (read-char rdr))
+      \newline)
+    ch))
+
+(deftype IndexingPushbackReader
+    [^not-native rdr ^:mutable line ^:mutable column
+     ^:mutable line-start? ^:mutable prev
+     ^:mutable prev-column file-name]
+  Reader
+  (read-char [reader]
+    (when-let [ch (read-char rdr)]
+      (let [ch (normalize-newline rdr ch)]
+        (set! prev line-start?)
+        (set! line-start? (newline? ch))
+        (when line-start?
+          (set! prev-column column)
+          (set! column 0)
+          (set! line (inc line)))
+        (set! column (inc column))
+        ch)))
+
+  (peek-char [reader]
+    (peek-char rdr))
+
+  IPushbackReader
+  (unread [reader ch]
+    (if line-start?
+      (do (set! line (dec line))
+          (set! column prev-column))
+      (set! column (dec column)))
+    (set! line-start? prev)
+    (unread rdr ch))
+
+  IndexingReader
+  (get-line-number [reader] (int line))
+  (get-column-number [reader] (int column))
+  (get-file-name [reader] file-name))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; Source Logging support
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(defn merge-meta
+  "Returns an object of the same type and value as `obj`, with its
+metadata merged over `m`."
+  [obj m]
+  (let [orig-meta (meta obj)]
+    (with-meta obj (merge m (dissoc orig-meta :source)))))
+
+(defn- peek-source-log
+  "Returns a string containing the contents of the top most source
+logging frame."
+  [frames]
+  (subs (str (:buffer frames)) (first (:offset frames))))
+
+(defn- log-source-char
+  "Logs `char` to all currently active source logging frames."
+  [frames char]
+  (when-let [buffer (:buffer frames)]
+    (.append buffer char)))
+
+(defn- drop-last-logged-char
+  "Removes the last logged character from all currently active source
+logging frames. Called when pushing a character back."
+  [frames]
+  (when-let [buffer (:buffer frames)]
+    (.set buffer (subs (str buffer) 0 (dec (.getLength buffer))))))
+
+(deftype SourceLoggingPushbackReader
+    [^not-native rdr ^:mutable line ^:mutable column
+     ^:mutable line-start? ^:mutable prev
+     ^:mutable prev-column file-name frames]
+  Reader
+  (read-char [reader]
+    (when-let [ch (read-char rdr)]
+      (let [ch (normalize-newline rdr ch)]
+        (set! prev line-start?)
+        (set! line-start? (newline? ch))
+        (when line-start?
+          (set! prev-column column)
+          (set! column 0)
+          (set! line (inc line)))
+        (set! column (inc column))
+        (log-source-char @frames ch)
+        ch)))
+
+  (peek-char [reader]
+    (peek-char rdr))
+
+  IPushbackReader
+  (unread [reader ch]
+    (if line-start?
+      (do (set! line (dec line))
+          (set! column prev-column))
+      (set! column (dec column)))
+    (set! line-start? prev)
+    (when ch
+      (drop-last-logged-char @frames))
+    (unread rdr ch))
+
+  IndexingReader
+  (get-line-number [reader] (int line))
+  (get-column-number [reader] (int column))
+  (get-file-name [reader] file-name))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; Public API
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+;; fast check for provided implementations
+(defn indexing-reader?
+  "Returns true if the reader satisfies IndexingReader"
+  [rdr]
+  (implements? IndexingReader rdr))
+
+(defn string-reader
+  "Creates a StringReader from a given string"
+  ([s]
+     (StringReader. s (count s) 0)))
+
+(defn string-push-back-reader
+  "Creates a PushbackReader from a given string"
+  ([s]
+     (string-push-back-reader s 1))
+  ([s buf-len]
+     (PushbackReader. (string-reader s) (object-array buf-len) buf-len buf-len)))
+
+(defn node-readable-push-back-reader [readable]
+  (PushbackReader. (NodeReadableReader. readable nil) (object-array 1) 1 1))
+
+(defn indexing-push-back-reader
+  "Creates an IndexingPushbackReader from a given string or PushbackReader"
+  ([s-or-rdr]
+     (indexing-push-back-reader s-or-rdr 1))
+  ([s-or-rdr buf-len]
+     (indexing-push-back-reader s-or-rdr buf-len nil))
+  ([s-or-rdr buf-len file-name]
+     (IndexingPushbackReader.
+      (if (string? s-or-rdr) (string-push-back-reader s-or-rdr buf-len) s-or-rdr) 1 1 true nil 0 file-name)))
+
+(defn source-logging-push-back-reader
+  "Creates a SourceLoggingPushbackReader from a given string or PushbackReader"
+  ([s-or-rdr]
+     (source-logging-push-back-reader s-or-rdr 1))
+  ([s-or-rdr buf-len]
+     (source-logging-push-back-reader s-or-rdr buf-len nil))
+  ([s-or-rdr buf-len file-name]
+     (SourceLoggingPushbackReader.
+      (if (string? s-or-rdr) (string-push-back-reader s-or-rdr buf-len) s-or-rdr)
+      1
+      1
+      true
+      nil
+      0
+      file-name
+      (atom {:buffer (StringBuffer.) :offset '(0)}))))
+
+(defn read-line
+  "Reads a line from the reader or from *in* if no reader is specified"
+  ([^not-native rdr]
+     (loop [c (read-char rdr) s (StringBuffer.)]
+       (if (newline? c)
+         (str s)
+         (recur (read-char rdr) (.append s c))))))
+
+(defn ^boolean source-logging-reader?
+  [rdr]
+  (instance? SourceLoggingPushbackReader rdr))
+
+(defn ^boolean line-start?
+  "Returns true if rdr is an IndexingReader and the current char starts a new line"
+  [^not-native rdr]
+  (when (indexing-reader? rdr)
+    (== 1 (get-column-number rdr))))
+
+(defn log-source*
+  [reader f]
+  (let [buffer (:buffer @(.-frames reader))]
+    (try
+      (swap! (.-frames reader) update-in [:offset] conj (.getLength buffer))
+      (let [ret (f)]
+        (if (implements? IMeta ret)
+          (merge-meta ret {:source (peek-source-log @ (.-frames reader))})
+          ret))
+      (finally
+        (swap! (.-frames reader) update-in [:offset] rest)))))
+
diff --git a/js/cljs/tools/reader/reader_types.cljs.cache.json b/js/cljs/tools/reader/reader_types.cljs.cache.json
new file mode 100644
index 0000000..486cdef
--- /dev/null
+++ b/js/cljs/tools/reader/reader_types.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",["~$char","~$read-line"]],"~:name","~$cljs.tools.reader.reader-types","~:imports",["^ ","~$StringBuffer","~$goog.string.StringBuffer"],"~:requires",["^ ","~$cljs.tools.reader.impl.utils","^?","~$goog.string","^@","^<","^="],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","~$whitespace?","^?","^7","^?","~$newline?","^?"],"~:defs",["^ ","~$indexing-push-back-reader",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","~:line",227,"~:column",7,"~:end-line",227,"~:end-column",32,"~:arglists",["~#list",["~$quote",["^O",[["~$s-or-rdr"],["^Q","~$buf-len"],["^Q","^R","~$file-name"]]]]],"~:doc","Creates an IndexingPushbackReader from a given string or PushbackReader","~:top-fn",["^ ","~:variadic",false,"~:max-fixed-arity",3,"~:method-params",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^N",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"~:arglists-meta",["^O",[null,null,null]]]],"^9","~$cljs.tools.reader.reader-types/indexing-push-back-reader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",32,"^U",["^ ","^V",false,"^W",3,"^X",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^N",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^Y",["^O",[null,null,null]]],"^X",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"~:protocol-impl",null,"^Y",["^O",[null,null,null]],"^K",1,"^J",227,"^L",227,"^W",3,"~:fn-var",true,"^N",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^T","Creates an IndexingPushbackReader from a given string or PushbackReader"],"~$log-source*",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",272,"^K",7,"^L",272,"^M",18,"^N",["^O",["^P",["^O",[["~$reader","~$f"]]]]]],"^9","~$cljs.tools.reader.reader-types/log-source*","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",18,"^X",["^O",[["^12","~$f"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",272,"^L",272,"^W",2,"^10",true,"^N",["^O",["^P",["^O",[["^12","~$f"]]]]]],"~$merge-meta",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",139,"^K",7,"^L",139,"^M",17,"^N",["^O",["^P",["^O",[["~$obj","~$m"]]]]],"^T","Returns an object of the same type and value as `obj`, with its\nmetadata merged over `m`."],"^9","~$cljs.tools.reader.reader-types/merge-meta","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",17,"^X",["^O",[["^15","~$m"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",139,"^L",139,"^W",2,"^10",true,"^N",["^O",["^P",["^O",[["^15","~$m"]]]]],"^T","Returns an object of the same type and value as `obj`, with its\nmetadata merged over `m`."],"~$PushbackReader",["^ ","~:num-fields",4,"~:protocols",["^6",["~$cljs.tools.reader.reader-types/Reader","~$cljs.tools.reader.reader-types/IPushbackReader"]],"^9","~$cljs.tools.reader.reader-types/PushbackReader","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",24,"~:type",true,"^K",10,"^J",71,"~:record",false,"^L",71,"~:tag","~$function","~:skip-protocol-flag",null],"~$->StringReader",["^ ","^G",null,"^H",["^ ","^19",["^6",["^1:"]],"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",22,"^K",10,"~:factory","~:positional","^J",43,"^L",43,"^N",["^O",["^P",["^O",[["~$s","~$s-len","~$s-pos"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/StringReader."],"^19",["^6",["^1:"]],"^9","~$cljs.tools.reader.reader-types/->StringReader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",22,"^X",["^O",[["~$s","^1E","^1F"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^1C","^1D","^J",43,"^L",43,"^W",3,"^10",true,"^N",["^O",["^P",["^O",[["~$s","^1E","^1F"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/StringReader."],"~$normalize-newline",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",93,"^K",8,"^L",93,"^M",25,"~:private",true,"^N",["^O",["^P",["^O",[["~$rdr","~$ch"]]]]]],"^1I",true,"^9","~$cljs.tools.reader.reader-types/normalize-newline","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",25,"^X",["^O",[["^1J","^1K"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",93,"^L",93,"^W",2,"^10",true,"^N",["^O",["^P",["^O",[["^1J","^1K"]]]]]],"~$peek-source-log",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",146,"^K",8,"^L",146,"^M",23,"^1I",true,"^N",["^O",["^P",["^O",[["~$frames"]]]]],"^T","Returns a string containing the contents of the top most source\nlogging frame."],"^1I",true,"^9","~$cljs.tools.reader.reader-types/peek-source-log","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",23,"^X",["^O",[["^1N"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",146,"^L",146,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^1N"]]]]],"^T","Returns a string containing the contents of the top most source\nlogging frame."],"~$IndexingPushbackReader",["^ ","^18",7,"^19",["^6",["~$cljs.tools.reader.reader-types/IndexingReader","^1:","^1;"]],"^9","~$cljs.tools.reader.reader-types/IndexingPushbackReader","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",32,"^1=",true,"^K",10,"^J",102,"^1>",false,"^L",102,"^1?","^1@","^1A",null],"~$StringReader",["^ ","^18",3,"^19",["^6",["^1:"]],"^9","~$cljs.tools.reader.reader-types/StringReader","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",22,"^1=",true,"^K",10,"^J",43,"^1>",false,"^L",43,"^1?","^1@","^1A",null],"~$Reader",["^ ","^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",21,"^K",14,"^L",21,"^M",20,"^T",null,"~:protocol-symbol",true,"~:jsdoc",["^O",["@interface"]],"~:protocol-info",["^ ","~:methods",["^ ","~$read-char",[["^12"]],"~$peek-char",[["^12"]]]]],"^1V",true,"^9","^1:","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",20,"^K",1,"^J",21,"^1X",["^ ","^1Y",["^ ","^1Z",[["^12"]],"^1[",[["^12"]]]],"~:info",null,"^L",21,"^1?","~$any","~:impls",["^6",["~$cljs.tools.reader.reader-types/SourceLoggingPushbackReader","^1R","~$cljs.tools.reader.reader-types/NodeReadableReader","^1T","^1<"]],"^T",null,"^1W",["^O",["@interface"]]],"~$source-logging-push-back-reader",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",237,"^K",7,"^L",237,"^M",38,"^N",["^O",["^P",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]]]],"^T","Creates a SourceLoggingPushbackReader from a given string or PushbackReader","^U",["^ ","^V",false,"^W",3,"^X",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^N",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^Y",["^O",[null,null,null]]]],"^9","~$cljs.tools.reader.reader-types/source-logging-push-back-reader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",38,"^U",["^ ","^V",false,"^W",3,"^X",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^N",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^Y",["^O",[null,null,null]]],"^X",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^[",null,"^Y",["^O",[null,null,null]],"^K",1,"^J",237,"^L",237,"^W",3,"^10",true,"^N",["^O",[["^Q"],["^Q","^R"],["^Q","^R","^S"]]],"^T","Creates a SourceLoggingPushbackReader from a given string or PushbackReader"],"~$unread",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",28,"^K",4,"^L",28,"^M",10,"~:protocol","^1;","^T","Pushes back a single character on to the stream","^N",["^O",["^P",["^O",[["^12","^1K"]]]]]],"^28","^1;","^9","~$cljs.tools.reader.reader-types/unread","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",10,"^X",["^O",[["^12","^1K"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",27,"^L",28,"^W",2,"^10",true,"^N",["^O",["^P",["^O",[["^12","^1K"]]]]],"^T","Pushes back a single character on to the stream"],"^1[",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",24,"^K",4,"^L",24,"^M",13,"^28","^1:","^T","Returns the next char from the Reader without removing it from the reader stream","^N",["^O",["^P",["^O",[["^12"]]]]]],"^28","^1:","^9","~$cljs.tools.reader.reader-types/peek-char","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",13,"^X",["^O",[["^12"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",21,"^L",24,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^12"]]]]],"^T","Returns the next char from the Reader without removing it from the reader stream"],"~$IPushbackReader",["^ ","^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",27,"^K",14,"^L",27,"^M",29,"^T",null,"^1V",true,"^1W",["^O",["@interface"]],"^1X",["^ ","^1Y",["^ ","^27",[["^12","^1K"]]]]],"^1V",true,"^9","^1;","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",29,"^K",1,"^J",27,"^1X",["^ ","^1Y",["^ ","^27",[["^12","^1K"]]]],"^20",null,"^L",27,"^1?","^21","^22",["^6",["^23","^1R","^1<"]],"^T",null,"^1W",["^O",["@interface"]]],"~$->NodeReadableReader",["^ ","^G",null,"^H",["^ ","^19",["^6",["^1:"]],"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",28,"^K",10,"^1C","^1D","^J",55,"^L",55,"^N",["^O",["^P",["^O",[["~$readable","~$buf"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/NodeReadableReader."],"^19",["^6",["^1:"]],"^9","~$cljs.tools.reader.reader-types/->NodeReadableReader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",28,"^X",["^O",[["^2=","^2>"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^1C","^1D","^J",55,"^L",55,"^W",2,"^10",true,"^N",["^O",["^P",["^O",[["^2=","^2>"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/NodeReadableReader."],"~$indexing-reader?",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",207,"^K",7,"^L",207,"^M",23,"^N",["^O",["^P",["^O",[["^1J"]]]]],"^T","Returns true if the reader satisfies IndexingReader"],"^9","~$cljs.tools.reader.reader-types/indexing-reader?","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",23,"^X",["^O",[["^1J"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",207,"^L",207,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^1J"]]]]],"^T","Returns true if the reader satisfies IndexingReader"],"~$string-reader",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",212,"^K",7,"^L",212,"^M",20,"^N",["^O",["^P",["^O",[["~$s"]]]]],"^T","Creates a StringReader from a given string"],"^9","~$cljs.tools.reader.reader-types/string-reader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",20,"^X",["^O",[["~$s"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",212,"^L",212,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["~$s"]]]]],"^T","Creates a StringReader from a given string"],"^1Z",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",22,"^K",4,"^L",22,"^M",13,"^28","^1:","^T","Returns the next char from the Reader, nil if the end of stream has been reached","^N",["^O",["^P",["^O",[["^12"]]]]]],"^28","^1:","^9","~$cljs.tools.reader.reader-types/read-char","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",13,"^X",["^O",[["^12"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",21,"^L",22,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^12"]]]]],"^T","Returns the next char from the Reader, nil if the end of stream has been reached"],"~$get-column-number",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",34,"^K",4,"^L",34,"^M",21,"^28","^1Q","^T","Returns the column number of the next character to be read from the stream","^N",["^O",["^P",["^O",[["^12"]]]]]],"^28","^1Q","^9","~$cljs.tools.reader.reader-types/get-column-number","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",21,"^X",["^O",[["^12"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",31,"^L",34,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^12"]]]]],"^T","Returns the column number of the next character to be read from the stream"],"~$get-file-name",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",36,"^K",4,"^L",36,"^M",17,"^28","^1Q","^T","Returns the file name the reader is reading from, or nil","^N",["^O",["^P",["^O",[["^12"]]]]]],"^28","^1Q","^9","~$cljs.tools.reader.reader-types/get-file-name","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",17,"^X",["^O",[["^12"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",31,"^L",36,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^12"]]]]],"^T","Returns the file name the reader is reading from, or nil"],"^8",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",254,"^K",7,"^L",254,"^M",16,"^N",["^O",["^P",["^O",[["^1J"]]]]],"^T","Reads a line from the reader or from *in* if no reader is specified"],"^9","~$cljs.tools.reader.reader-types/read-line","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",16,"^X",["^O",[["^1J"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",254,"^L",254,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^1J"]]]]],"^T","Reads a line from the reader or from *in* if no reader is specified"],"~$->PushbackReader",["^ ","^G",null,"^H",["^ ","^19",["^6",["^1:","^1;"]],"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",24,"^K",10,"^1C","^1D","^J",71,"^L",71,"^N",["^O",["^P",["^O",[["^1J","^2>","^R","~$buf-pos"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/PushbackReader."],"^19",["^6",["^1:","^1;"]],"^9","~$cljs.tools.reader.reader-types/->PushbackReader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",24,"^X",["^O",[["^1J","^2>","^R","^2K"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^1C","^1D","^J",71,"^L",71,"^W",4,"^10",true,"^N",["^O",["^P",["^O",[["^1J","^2>","^R","^2K"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/PushbackReader."],"~$log-source-char",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",152,"^K",8,"^L",152,"^M",23,"^1I",true,"^N",["^O",["^P",["^O",[["^1N","^7"]]]]],"^T","Logs `char` to all currently active source logging frames."],"^1I",true,"^9","~$cljs.tools.reader.reader-types/log-source-char","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",23,"^X",["^O",[["^1N","^7"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",152,"^L",152,"^W",2,"^10",true,"^N",["^O",["^P",["^O",[["^1N","^7"]]]]],"^T","Logs `char` to all currently active source logging frames."],"~$string-push-back-reader",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",217,"^K",7,"^L",217,"^M",30,"^N",["^O",["^P",["^O",[["~$s"],["~$s","^R"]]]]],"^T","Creates a PushbackReader from a given string","^U",["^ ","^V",false,"^W",2,"^X",["^O",[["~$s"],["~$s","^R"]]],"^N",["^O",[["~$s"],["~$s","^R"]]],"^Y",["^O",[null,null]]]],"^9","~$cljs.tools.reader.reader-types/string-push-back-reader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",30,"^U",["^ ","^V",false,"^W",2,"^X",["^O",[["~$s"],["~$s","^R"]]],"^N",["^O",[["~$s"],["~$s","^R"]]],"^Y",["^O",[null,null]]],"^X",["^O",[["~$s"],["~$s","^R"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",217,"^L",217,"^W",2,"^10",true,"^N",["^O",[["~$s"],["~$s","^R"]]],"^T","Creates a PushbackReader from a given string"],"~$drop-last-logged-char",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",158,"^K",8,"^L",158,"^M",29,"^1I",true,"^N",["^O",["^P",["^O",[["^1N"]]]]],"^T","Removes the last logged character from all currently active source\nlogging frames. Called when pushing a character back."],"^1I",true,"^9","~$cljs.tools.reader.reader-types/drop-last-logged-char","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",29,"^X",["^O",[["^1N"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",158,"^L",158,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^1N"]]]]],"^T","Removes the last logged character from all currently active source\nlogging frames. Called when pushing a character back."],"~$->SourceLoggingPushbackReader",["^ ","^G",null,"^H",["^ ","^19",["^6",["^1Q","^1:","^1;"]],"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",37,"^K",10,"^1C","^1D","^J",165,"^L",165,"^N",["^O",["^P",["^O",[["^1J","~$line","~$column","~$line-start?","~$prev","~$prev-column","^S","^1N"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/SourceLoggingPushbackReader."],"^19",["^6",["^1Q","^1:","^1;"]],"^9","~$cljs.tools.reader.reader-types/->SourceLoggingPushbackReader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",37,"^X",["^O",[["^1J","^2T","^2U","^2V","^2W","^2X","^S","^1N"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^1C","^1D","^J",165,"^L",165,"^W",8,"^10",true,"^N",["^O",["^P",["^O",[["^1J","^2T","^2U","^2V","^2W","^2X","^S","^1N"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/SourceLoggingPushbackReader."],"^2V",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",266,"^K",16,"^L",266,"^M",27,"^1?","~$boolean","^N",["^O",["^P",["^O",[["^1J"]]]]],"^T","Returns true if rdr is an IndexingReader and the current char starts a new line"],"^9","~$cljs.tools.reader.reader-types/line-start?","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",27,"^X",["^O",[["^1J"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",266,"~:ret-tag","^2Z","^L",266,"^W",1,"^1?","^2Z","^10",true,"^N",["^O",["^P",["^O",[["^1J"]]]]],"^T","Returns true if rdr is an IndexingReader and the current char starts a new line"],"~$source-logging-reader?",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",262,"^K",16,"^L",262,"^M",38,"^1?","^2Z","^N",["^O",["^P",["^O",[["^1J"]]]]]],"^9","~$cljs.tools.reader.reader-types/source-logging-reader?","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",38,"^X",["^O",[["^1J"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",262,"^30","^2Z","^L",262,"^W",1,"^1?","^2Z","^10",true,"^N",["^O",["^P",["^O",[["^1J"]]]]]],"~$IndexingReader",["^ ","^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",31,"^K",14,"^L",31,"^M",28,"^T",null,"^1V",true,"^1W",["^O",["@interface"]],"^1X",["^ ","^1Y",["^ ","~$get-line-number",[["^12"]],"^2E",[["^12"]],"^2G",[["^12"]]]]],"^1V",true,"^9","^1Q","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",28,"^K",1,"^J",31,"^1X",["^ ","^1Y",["^ ","^34",[["^12"]],"^2E",[["^12"]],"^2G",[["^12"]]]],"^20",null,"^L",31,"^1?","^21","^22",["^6",["^23","^1R"]],"^T",null,"^1W",["^O",["@interface"]]],"~$node-readable-push-back-reader",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",224,"^K",7,"^L",224,"^M",37,"^N",["^O",["^P",["^O",[["^2="]]]]]],"^9","~$cljs.tools.reader.reader-types/node-readable-push-back-reader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",37,"^X",["^O",[["^2="]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",224,"^L",224,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^2="]]]]]],"~$SourceLoggingPushbackReader",["^ ","^18",8,"^19",["^6",["^1Q","^1:","^1;"]],"^9","^23","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",37,"^1=",true,"^K",10,"^J",165,"^1>",false,"^L",165,"^1?","^1@","^1A",null],"^34",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^J",32,"^K",4,"^L",32,"^M",19,"^28","^1Q","^T","Returns the line number of the next character to be read from the stream","^N",["^O",["^P",["^O",[["^12"]]]]]],"^28","^1Q","^9","~$cljs.tools.reader.reader-types/get-line-number","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",19,"^X",["^O",[["^12"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^J",31,"^L",32,"^W",1,"^10",true,"^N",["^O",["^P",["^O",[["^12"]]]]],"^T","Returns the line number of the next character to be read from the stream"],"~$NodeReadableReader",["^ ","^18",2,"^19",["^6",["^1:"]],"^9","^24","^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",28,"^1=",true,"^K",10,"^J",55,"^1>",false,"^L",55,"^1?","^1@","^1A",null],"~$->IndexingPushbackReader",["^ ","^G",null,"^H",["^ ","^19",["^6",["^1Q","^1:","^1;"]],"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",32,"^K",10,"^1C","^1D","^J",102,"^L",102,"^N",["^O",["^P",["^O",[["^1J","^2T","^2U","^2V","^2W","^2X","^S"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/IndexingPushbackReader."],"^19",["^6",["^1Q","^1:","^1;"]],"^9","~$cljs.tools.reader.reader-types/->IndexingPushbackReader","^V",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/550BA18/cljs/tools/reader/reader_types.cljs","^M",32,"^X",["^O",[["^1J","^2T","^2U","^2V","^2W","^2X","^S"]]],"^[",null,"^Y",["^O",[null,null]],"^K",1,"^1C","^1D","^J",102,"^L",102,"^W",7,"^10",true,"^N",["^O",["^P",["^O",[["^1J","^2T","^2U","^2V","^2W","^2X","^S"]]]]],"^1A",null,"^T","Positional factory function for cljs.tools.reader.reader-types/IndexingPushbackReader."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["^1F","^2X","~:offset","^1J","^2>","~:source","^2=","^1N","~$not-native","~$s","^2U","^2K","^1?","~:mutable","^2V","^2T","^1E","^S","^2W","^R","~:buffer"]],"~:order",["~$s","^1E","^1F","^3C","^2=","^2>","^1J","^1?","^3B","^R","^2K","^2T","^2U","^2V","^2W","^2X","^S","^3A","^3D","^3@","^1N"]],"^T","Protocols and default Reader types implementation"]
\ No newline at end of file
diff --git a/js/cljs/tools/reader/reader_types.js b/js/cljs/tools/reader/reader_types.js
new file mode 100644
index 0000000..9a1b4ff
--- /dev/null
+++ b/js/cljs/tools/reader/reader_types.js
@@ -0,0 +1,797 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('cljs.tools.reader.reader_types');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('cljs.tools.reader.impl.utils');
+goog.require('goog.string');
+goog.require('goog.string.StringBuffer');
+
+/**
+ * @interface
+ */
+cljs.tools.reader.reader_types.Reader = function(){};
+
+/**
+ * Returns the next char from the Reader, nil if the end of stream has been reached
+ */
+cljs.tools.reader.reader_types.read_char = (function cljs$tools$reader$reader_types$read_char(reader){
+if(((!((reader == null))) && (!((reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1 == null))))){
+return reader.cljs$tools$reader$reader_types$Reader$read_char$arity$1(reader);
+} else {
+var x__4230__auto__ = (((reader == null))?null:reader);
+var m__4231__auto__ = (cljs.tools.reader.reader_types.read_char[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto__.call(null,reader));
+} else {
+var m__4231__auto____$1 = (cljs.tools.reader.reader_types.read_char["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto____$1.call(null,reader));
+} else {
+throw cljs.core.missing_protocol("Reader.read-char",reader);
+}
+}
+}
+});
+
+/**
+ * Returns the next char from the Reader without removing it from the reader stream
+ */
+cljs.tools.reader.reader_types.peek_char = (function cljs$tools$reader$reader_types$peek_char(reader){
+if(((!((reader == null))) && (!((reader.cljs$tools$reader$reader_types$Reader$peek_char$arity$1 == null))))){
+return reader.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(reader);
+} else {
+var x__4230__auto__ = (((reader == null))?null:reader);
+var m__4231__auto__ = (cljs.tools.reader.reader_types.peek_char[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto__.call(null,reader));
+} else {
+var m__4231__auto____$1 = (cljs.tools.reader.reader_types.peek_char["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto____$1.call(null,reader));
+} else {
+throw cljs.core.missing_protocol("Reader.peek-char",reader);
+}
+}
+}
+});
+
+
+/**
+ * @interface
+ */
+cljs.tools.reader.reader_types.IPushbackReader = function(){};
+
+/**
+ * Pushes back a single character on to the stream
+ */
+cljs.tools.reader.reader_types.unread = (function cljs$tools$reader$reader_types$unread(reader,ch){
+if(((!((reader == null))) && (!((reader.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2 == null))))){
+return reader.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2(reader,ch);
+} else {
+var x__4230__auto__ = (((reader == null))?null:reader);
+var m__4231__auto__ = (cljs.tools.reader.reader_types.unread[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(reader,ch) : m__4231__auto__.call(null,reader,ch));
+} else {
+var m__4231__auto____$1 = (cljs.tools.reader.reader_types.unread["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(reader,ch) : m__4231__auto____$1.call(null,reader,ch));
+} else {
+throw cljs.core.missing_protocol("IPushbackReader.unread",reader);
+}
+}
+}
+});
+
+
+/**
+ * @interface
+ */
+cljs.tools.reader.reader_types.IndexingReader = function(){};
+
+/**
+ * Returns the line number of the next character to be read from the stream
+ */
+cljs.tools.reader.reader_types.get_line_number = (function cljs$tools$reader$reader_types$get_line_number(reader){
+if(((!((reader == null))) && (!((reader.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1 == null))))){
+return reader.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1(reader);
+} else {
+var x__4230__auto__ = (((reader == null))?null:reader);
+var m__4231__auto__ = (cljs.tools.reader.reader_types.get_line_number[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto__.call(null,reader));
+} else {
+var m__4231__auto____$1 = (cljs.tools.reader.reader_types.get_line_number["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto____$1.call(null,reader));
+} else {
+throw cljs.core.missing_protocol("IndexingReader.get-line-number",reader);
+}
+}
+}
+});
+
+/**
+ * Returns the column number of the next character to be read from the stream
+ */
+cljs.tools.reader.reader_types.get_column_number = (function cljs$tools$reader$reader_types$get_column_number(reader){
+if(((!((reader == null))) && (!((reader.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1 == null))))){
+return reader.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1(reader);
+} else {
+var x__4230__auto__ = (((reader == null))?null:reader);
+var m__4231__auto__ = (cljs.tools.reader.reader_types.get_column_number[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto__.call(null,reader));
+} else {
+var m__4231__auto____$1 = (cljs.tools.reader.reader_types.get_column_number["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto____$1.call(null,reader));
+} else {
+throw cljs.core.missing_protocol("IndexingReader.get-column-number",reader);
+}
+}
+}
+});
+
+/**
+ * Returns the file name the reader is reading from, or nil
+ */
+cljs.tools.reader.reader_types.get_file_name = (function cljs$tools$reader$reader_types$get_file_name(reader){
+if(((!((reader == null))) && (!((reader.cljs$tools$reader$reader_types$IndexingReader$get_file_name$arity$1 == null))))){
+return reader.cljs$tools$reader$reader_types$IndexingReader$get_file_name$arity$1(reader);
+} else {
+var x__4230__auto__ = (((reader == null))?null:reader);
+var m__4231__auto__ = (cljs.tools.reader.reader_types.get_file_name[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto__.call(null,reader));
+} else {
+var m__4231__auto____$1 = (cljs.tools.reader.reader_types.get_file_name["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(reader) : m__4231__auto____$1.call(null,reader));
+} else {
+throw cljs.core.missing_protocol("IndexingReader.get-file-name",reader);
+}
+}
+}
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.tools.reader.reader_types.Reader}
+*/
+cljs.tools.reader.reader_types.StringReader = (function (s,s_len,s_pos){
+this.s = s;
+this.s_len = s_len;
+this.s_pos = s_pos;
+});
+cljs.tools.reader.reader_types.StringReader.prototype.cljs$tools$reader$reader_types$Reader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.StringReader.prototype.cljs$tools$reader$reader_types$Reader$read_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+if((self__.s_len > self__.s_pos)){
+var r = self__.s.charAt(self__.s_pos);
+self__.s_pos = (self__.s_pos + (1));
+
+return r;
+} else {
+return null;
+}
+});
+
+cljs.tools.reader.reader_types.StringReader.prototype.cljs$tools$reader$reader_types$Reader$peek_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+if((self__.s_len > self__.s_pos)){
+return self__.s.charAt(self__.s_pos);
+} else {
+return null;
+}
+});
+
+cljs.tools.reader.reader_types.StringReader.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$s,cljs.core.cst$sym$s_DASH_len,cljs.core.with_meta(cljs.core.cst$sym$s_DASH_pos,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.tools.reader.reader_types.StringReader.cljs$lang$type = true;
+
+cljs.tools.reader.reader_types.StringReader.cljs$lang$ctorStr = "cljs.tools.reader.reader-types/StringReader";
+
+cljs.tools.reader.reader_types.StringReader.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.tools.reader.reader-types/StringReader");
+});
+
+/**
+ * Positional factory function for cljs.tools.reader.reader-types/StringReader.
+ */
+cljs.tools.reader.reader_types.__GT_StringReader = (function cljs$tools$reader$reader_types$__GT_StringReader(s,s_len,s_pos){
+return (new cljs.tools.reader.reader_types.StringReader(s,s_len,s_pos));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.tools.reader.reader_types.Reader}
+*/
+cljs.tools.reader.reader_types.NodeReadableReader = (function (readable,buf){
+this.readable = readable;
+this.buf = buf;
+});
+cljs.tools.reader.reader_types.NodeReadableReader.prototype.cljs$tools$reader$reader_types$Reader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.NodeReadableReader.prototype.cljs$tools$reader$reader_types$Reader$read_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+if(cljs.core.truth_(self__.buf)){
+var c = (self__.buf[(0)]);
+self__.buf = null;
+
+return cljs.tools.reader.impl.utils.char$(c);
+} else {
+var c = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.readable.read((1)))].join('');
+if(cljs.core.truth_(c)){
+return cljs.tools.reader.impl.utils.char$(c);
+} else {
+return null;
+}
+}
+});
+
+cljs.tools.reader.reader_types.NodeReadableReader.prototype.cljs$tools$reader$reader_types$Reader$peek_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+if(cljs.core.truth_(self__.buf)){
+} else {
+self__.buf = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.readable.read((1)))].join('');
+}
+
+if(cljs.core.truth_(self__.buf)){
+return cljs.tools.reader.impl.utils.char$((self__.buf[(0)]));
+} else {
+return null;
+}
+});
+
+cljs.tools.reader.reader_types.NodeReadableReader.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$readable,cljs.core.with_meta(cljs.core.cst$sym$buf,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.tools.reader.reader_types.NodeReadableReader.cljs$lang$type = true;
+
+cljs.tools.reader.reader_types.NodeReadableReader.cljs$lang$ctorStr = "cljs.tools.reader.reader-types/NodeReadableReader";
+
+cljs.tools.reader.reader_types.NodeReadableReader.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.tools.reader.reader-types/NodeReadableReader");
+});
+
+/**
+ * Positional factory function for cljs.tools.reader.reader-types/NodeReadableReader.
+ */
+cljs.tools.reader.reader_types.__GT_NodeReadableReader = (function cljs$tools$reader$reader_types$__GT_NodeReadableReader(readable,buf){
+return (new cljs.tools.reader.reader_types.NodeReadableReader(readable,buf));
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.tools.reader.reader_types.Reader}
+ * @implements {cljs.tools.reader.reader_types.IPushbackReader}
+*/
+cljs.tools.reader.reader_types.PushbackReader = (function (rdr,buf,buf_len,buf_pos){
+this.rdr = rdr;
+this.buf = buf;
+this.buf_len = buf_len;
+this.buf_pos = buf_pos;
+});
+cljs.tools.reader.reader_types.PushbackReader.prototype.cljs$tools$reader$reader_types$Reader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.PushbackReader.prototype.cljs$tools$reader$reader_types$Reader$read_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+var c = (((self__.buf_pos < self__.buf_len))?(self__.buf[self__.buf_pos]):self__.rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null));
+if((self__.buf_pos < self__.buf_len)){
+self__.buf_pos = (self__.buf_pos + (1));
+} else {
+}
+
+return cljs.tools.reader.impl.utils.char$(c);
+});
+
+cljs.tools.reader.reader_types.PushbackReader.prototype.cljs$tools$reader$reader_types$Reader$peek_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+var c = (((self__.buf_pos < self__.buf_len))?(self__.buf[self__.buf_pos]):self__.rdr.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null));
+return cljs.tools.reader.impl.utils.char$(c);
+});
+
+cljs.tools.reader.reader_types.PushbackReader.prototype.cljs$tools$reader$reader_types$IPushbackReader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.PushbackReader.prototype.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2 = (function (reader,ch){
+var self__ = this;
+var reader__$1 = this;
+if(cljs.core.truth_(ch)){
+if((self__.buf_pos === (0))){
+throw (new Error("Pushback buffer is full"));
+} else {
+}
+
+self__.buf_pos = (self__.buf_pos - (1));
+
+return (self__.buf[self__.buf_pos] = ch);
+} else {
+return null;
+}
+});
+
+cljs.tools.reader.reader_types.PushbackReader.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$rdr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$not_DASH_native], null)),cljs.core.cst$sym$buf,cljs.core.cst$sym$buf_DASH_len,cljs.core.with_meta(cljs.core.cst$sym$buf_DASH_pos,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+cljs.tools.reader.reader_types.PushbackReader.cljs$lang$type = true;
+
+cljs.tools.reader.reader_types.PushbackReader.cljs$lang$ctorStr = "cljs.tools.reader.reader-types/PushbackReader";
+
+cljs.tools.reader.reader_types.PushbackReader.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.tools.reader.reader-types/PushbackReader");
+});
+
+/**
+ * Positional factory function for cljs.tools.reader.reader-types/PushbackReader.
+ */
+cljs.tools.reader.reader_types.__GT_PushbackReader = (function cljs$tools$reader$reader_types$__GT_PushbackReader(rdr,buf,buf_len,buf_pos){
+return (new cljs.tools.reader.reader_types.PushbackReader(rdr,buf,buf_len,buf_pos));
+});
+
+cljs.tools.reader.reader_types.normalize_newline = (function cljs$tools$reader$reader_types$normalize_newline(rdr,ch){
+if(("\r" === ch)){
+var c = rdr.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null);
+if(((("\f" === c)) || (("\n" === c)))){
+rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+} else {
+}
+
+return "\n";
+} else {
+return ch;
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.tools.reader.reader_types.IndexingReader}
+ * @implements {cljs.tools.reader.reader_types.Reader}
+ * @implements {cljs.tools.reader.reader_types.IPushbackReader}
+*/
+cljs.tools.reader.reader_types.IndexingPushbackReader = (function (rdr,line,column,line_start_QMARK_,prev,prev_column,file_name){
+this.rdr = rdr;
+this.line = line;
+this.column = column;
+this.line_start_QMARK_ = line_start_QMARK_;
+this.prev = prev;
+this.prev_column = prev_column;
+this.file_name = file_name;
+});
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$Reader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$Reader$read_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+var temp__5457__auto__ = self__.rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(cljs.core.truth_(temp__5457__auto__)){
+var ch = temp__5457__auto__;
+var ch__$1 = cljs.tools.reader.reader_types.normalize_newline(self__.rdr,ch);
+self__.prev = self__.line_start_QMARK_;
+
+self__.line_start_QMARK_ = cljs.tools.reader.impl.utils.newline_QMARK_(ch__$1);
+
+if(cljs.core.truth_(self__.line_start_QMARK_)){
+self__.prev_column = self__.column;
+
+self__.column = (0);
+
+self__.line = (self__.line + (1));
+} else {
+}
+
+self__.column = (self__.column + (1));
+
+return ch__$1;
+} else {
+return null;
+}
+});
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$Reader$peek_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return self__.rdr.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null);
+});
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$IPushbackReader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2 = (function (reader,ch){
+var self__ = this;
+var reader__$1 = this;
+if(cljs.core.truth_(self__.line_start_QMARK_)){
+self__.line = (self__.line - (1));
+
+self__.column = self__.prev_column;
+} else {
+self__.column = (self__.column - (1));
+}
+
+self__.line_start_QMARK_ = self__.prev;
+
+return self__.rdr.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2(null,ch);
+});
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return (self__.line | (0));
+});
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return (self__.column | (0));
+});
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$get_file_name$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return self__.file_name;
+});
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 7, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$rdr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$not_DASH_native], null)),cljs.core.with_meta(cljs.core.cst$sym$line,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$column,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$line_DASH_start_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$prev,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$prev_DASH_column,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$file_DASH_name], null);
+});
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.cljs$lang$type = true;
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.cljs$lang$ctorStr = "cljs.tools.reader.reader-types/IndexingPushbackReader";
+
+cljs.tools.reader.reader_types.IndexingPushbackReader.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.tools.reader.reader-types/IndexingPushbackReader");
+});
+
+/**
+ * Positional factory function for cljs.tools.reader.reader-types/IndexingPushbackReader.
+ */
+cljs.tools.reader.reader_types.__GT_IndexingPushbackReader = (function cljs$tools$reader$reader_types$__GT_IndexingPushbackReader(rdr,line,column,line_start_QMARK_,prev,prev_column,file_name){
+return (new cljs.tools.reader.reader_types.IndexingPushbackReader(rdr,line,column,line_start_QMARK_,prev,prev_column,file_name));
+});
+
+/**
+ * Returns an object of the same type and value as `obj`, with its
+ * metadata merged over `m`.
+ */
+cljs.tools.reader.reader_types.merge_meta = (function cljs$tools$reader$reader_types$merge_meta(obj,m){
+var orig_meta = cljs.core.meta(obj);
+return cljs.core.with_meta(obj,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([m,cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(orig_meta,cljs.core.cst$kw$source)], 0)));
+});
+/**
+ * Returns a string containing the contents of the top most source
+ * logging frame.
+ */
+cljs.tools.reader.reader_types.peek_source_log = (function cljs$tools$reader$reader_types$peek_source_log(frames){
+return cljs.core.subs.cljs$core$IFn$_invoke$arity$2([cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.cst$kw$buffer.cljs$core$IFn$_invoke$arity$1(frames))].join(''),cljs.core.first(cljs.core.cst$kw$offset.cljs$core$IFn$_invoke$arity$1(frames)));
+});
+/**
+ * Logs `char` to all currently active source logging frames.
+ */
+cljs.tools.reader.reader_types.log_source_char = (function cljs$tools$reader$reader_types$log_source_char(frames,char$){
+var temp__5457__auto__ = cljs.core.cst$kw$buffer.cljs$core$IFn$_invoke$arity$1(frames);
+if(cljs.core.truth_(temp__5457__auto__)){
+var buffer = temp__5457__auto__;
+return buffer.append(char$);
+} else {
+return null;
+}
+});
+/**
+ * Removes the last logged character from all currently active source
+ * logging frames. Called when pushing a character back.
+ */
+cljs.tools.reader.reader_types.drop_last_logged_char = (function cljs$tools$reader$reader_types$drop_last_logged_char(frames){
+var temp__5457__auto__ = cljs.core.cst$kw$buffer.cljs$core$IFn$_invoke$arity$1(frames);
+if(cljs.core.truth_(temp__5457__auto__)){
+var buffer = temp__5457__auto__;
+return buffer.set(cljs.core.subs.cljs$core$IFn$_invoke$arity$3([cljs.core.str.cljs$core$IFn$_invoke$arity$1(buffer)].join(''),(0),(buffer.getLength() - (1))));
+} else {
+return null;
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.tools.reader.reader_types.IndexingReader}
+ * @implements {cljs.tools.reader.reader_types.Reader}
+ * @implements {cljs.tools.reader.reader_types.IPushbackReader}
+*/
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader = (function (rdr,line,column,line_start_QMARK_,prev,prev_column,file_name,frames){
+this.rdr = rdr;
+this.line = line;
+this.column = column;
+this.line_start_QMARK_ = line_start_QMARK_;
+this.prev = prev;
+this.prev_column = prev_column;
+this.file_name = file_name;
+this.frames = frames;
+});
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$Reader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$Reader$read_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+var temp__5457__auto__ = self__.rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+if(cljs.core.truth_(temp__5457__auto__)){
+var ch = temp__5457__auto__;
+var ch__$1 = cljs.tools.reader.reader_types.normalize_newline(self__.rdr,ch);
+self__.prev = self__.line_start_QMARK_;
+
+self__.line_start_QMARK_ = cljs.tools.reader.impl.utils.newline_QMARK_(ch__$1);
+
+if(cljs.core.truth_(self__.line_start_QMARK_)){
+self__.prev_column = self__.column;
+
+self__.column = (0);
+
+self__.line = (self__.line + (1));
+} else {
+}
+
+self__.column = (self__.column + (1));
+
+cljs.tools.reader.reader_types.log_source_char(cljs.core.deref(self__.frames),ch__$1);
+
+return ch__$1;
+} else {
+return null;
+}
+});
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$Reader$peek_char$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return self__.rdr.cljs$tools$reader$reader_types$Reader$peek_char$arity$1(null);
+});
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$IPushbackReader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2 = (function (reader,ch){
+var self__ = this;
+var reader__$1 = this;
+if(cljs.core.truth_(self__.line_start_QMARK_)){
+self__.line = (self__.line - (1));
+
+self__.column = self__.prev_column;
+} else {
+self__.column = (self__.column - (1));
+}
+
+self__.line_start_QMARK_ = self__.prev;
+
+if(cljs.core.truth_(ch)){
+cljs.tools.reader.reader_types.drop_last_logged_char(cljs.core.deref(self__.frames));
+} else {
+}
+
+return self__.rdr.cljs$tools$reader$reader_types$IPushbackReader$unread$arity$2(null,ch);
+});
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$ = cljs.core.PROTOCOL_SENTINEL;
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$get_line_number$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return (self__.line | (0));
+});
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return (self__.column | (0));
+});
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.prototype.cljs$tools$reader$reader_types$IndexingReader$get_file_name$arity$1 = (function (reader){
+var self__ = this;
+var reader__$1 = this;
+return self__.file_name;
+});
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 8, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$rdr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$not_DASH_native], null)),cljs.core.with_meta(cljs.core.cst$sym$line,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$column,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$line_DASH_start_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$prev,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$prev_DASH_column,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$file_DASH_name,cljs.core.cst$sym$frames], null);
+});
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.cljs$lang$type = true;
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.cljs$lang$ctorStr = "cljs.tools.reader.reader-types/SourceLoggingPushbackReader";
+
+cljs.tools.reader.reader_types.SourceLoggingPushbackReader.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"cljs.tools.reader.reader-types/SourceLoggingPushbackReader");
+});
+
+/**
+ * Positional factory function for cljs.tools.reader.reader-types/SourceLoggingPushbackReader.
+ */
+cljs.tools.reader.reader_types.__GT_SourceLoggingPushbackReader = (function cljs$tools$reader$reader_types$__GT_SourceLoggingPushbackReader(rdr,line,column,line_start_QMARK_,prev,prev_column,file_name,frames){
+return (new cljs.tools.reader.reader_types.SourceLoggingPushbackReader(rdr,line,column,line_start_QMARK_,prev,prev_column,file_name,frames));
+});
+
+/**
+ * Returns true if the reader satisfies IndexingReader
+ */
+cljs.tools.reader.reader_types.indexing_reader_QMARK_ = (function cljs$tools$reader$reader_types$indexing_reader_QMARK_(rdr){
+if(!((rdr == null))){
+if(((false) || ((cljs.core.PROTOCOL_SENTINEL === rdr.cljs$tools$reader$reader_types$IndexingReader$)))){
+return true;
+} else {
+return false;
+}
+} else {
+return false;
+}
+});
+/**
+ * Creates a StringReader from a given string
+ */
+cljs.tools.reader.reader_types.string_reader = (function cljs$tools$reader$reader_types$string_reader(s){
+return (new cljs.tools.reader.reader_types.StringReader(s,cljs.core.count(s),(0)));
+});
+/**
+ * Creates a PushbackReader from a given string
+ */
+cljs.tools.reader.reader_types.string_push_back_reader = (function cljs$tools$reader$reader_types$string_push_back_reader(var_args){
+var G__4643 = arguments.length;
+switch (G__4643) {
+case 1:
+return cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$1 = (function (s){
+return cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$2(s,(1));
+});
+
+cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$2 = (function (s,buf_len){
+return (new cljs.tools.reader.reader_types.PushbackReader(cljs.tools.reader.reader_types.string_reader(s),cljs.core.object_array.cljs$core$IFn$_invoke$arity$1(buf_len),buf_len,buf_len));
+});
+
+cljs.tools.reader.reader_types.string_push_back_reader.cljs$lang$maxFixedArity = 2;
+
+cljs.tools.reader.reader_types.node_readable_push_back_reader = (function cljs$tools$reader$reader_types$node_readable_push_back_reader(readable){
+return (new cljs.tools.reader.reader_types.PushbackReader((new cljs.tools.reader.reader_types.NodeReadableReader(readable,null)),cljs.core.object_array.cljs$core$IFn$_invoke$arity$1((1)),(1),(1)));
+});
+/**
+ * Creates an IndexingPushbackReader from a given string or PushbackReader
+ */
+cljs.tools.reader.reader_types.indexing_push_back_reader = (function cljs$tools$reader$reader_types$indexing_push_back_reader(var_args){
+var G__4646 = arguments.length;
+switch (G__4646) {
+case 1:
+return cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$1 = (function (s_or_rdr){
+return cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$2(s_or_rdr,(1));
+});
+
+cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$2 = (function (s_or_rdr,buf_len){
+return cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$3(s_or_rdr,buf_len,null);
+});
+
+cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$core$IFn$_invoke$arity$3 = (function (s_or_rdr,buf_len,file_name){
+return (new cljs.tools.reader.reader_types.IndexingPushbackReader(((typeof s_or_rdr === 'string')?cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$2(s_or_rdr,buf_len):s_or_rdr),(1),(1),true,null,(0),file_name));
+});
+
+cljs.tools.reader.reader_types.indexing_push_back_reader.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Creates a SourceLoggingPushbackReader from a given string or PushbackReader
+ */
+cljs.tools.reader.reader_types.source_logging_push_back_reader = (function cljs$tools$reader$reader_types$source_logging_push_back_reader(var_args){
+var G__4649 = arguments.length;
+switch (G__4649) {
+case 1:
+return cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$1 = (function (s_or_rdr){
+return cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$2(s_or_rdr,(1));
+});
+
+cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$2 = (function (s_or_rdr,buf_len){
+return cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$3(s_or_rdr,buf_len,null);
+});
+
+cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$core$IFn$_invoke$arity$3 = (function (s_or_rdr,buf_len,file_name){
+return (new cljs.tools.reader.reader_types.SourceLoggingPushbackReader(((typeof s_or_rdr === 'string')?cljs.tools.reader.reader_types.string_push_back_reader.cljs$core$IFn$_invoke$arity$2(s_or_rdr,buf_len):s_or_rdr),(1),(1),true,null,(0),file_name,cljs.core.atom.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$buffer,(new goog.string.StringBuffer()),cljs.core.cst$kw$offset,cljs.core.list((0))], null))));
+});
+
+cljs.tools.reader.reader_types.source_logging_push_back_reader.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Reads a line from the reader or from *in* if no reader is specified
+ */
+cljs.tools.reader.reader_types.read_line = (function cljs$tools$reader$reader_types$read_line(rdr){
+var c = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+var s = (new goog.string.StringBuffer());
+while(true){
+if(cljs.tools.reader.impl.utils.newline_QMARK_(c)){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(s)].join('');
+} else {
+var G__4651 = rdr.cljs$tools$reader$reader_types$Reader$read_char$arity$1(null);
+var G__4652 = s.append(c);
+c = G__4651;
+s = G__4652;
+continue;
+}
+break;
+}
+});
+cljs.tools.reader.reader_types.source_logging_reader_QMARK_ = (function cljs$tools$reader$reader_types$source_logging_reader_QMARK_(rdr){
+return (rdr instanceof cljs.tools.reader.reader_types.SourceLoggingPushbackReader);
+});
+/**
+ * Returns true if rdr is an IndexingReader and the current char starts a new line
+ */
+cljs.tools.reader.reader_types.line_start_QMARK_ = (function cljs$tools$reader$reader_types$line_start_QMARK_(rdr){
+if(cljs.core.truth_(cljs.tools.reader.reader_types.indexing_reader_QMARK_(rdr))){
+return ((1) === rdr.cljs$tools$reader$reader_types$IndexingReader$get_column_number$arity$1(null));
+} else {
+return null;
+}
+});
+cljs.tools.reader.reader_types.log_source_STAR_ = (function cljs$tools$reader$reader_types$log_source_STAR_(reader,f){
+var buffer = cljs.core.cst$kw$buffer.cljs$core$IFn$_invoke$arity$1(cljs.core.deref(reader.frames));
+try{cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic(reader.frames,cljs.core.update_in,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$offset], null),cljs.core.conj,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([buffer.getLength()], 0));
+
+var ret = (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+if(((!((ret == null)))?(((((ret.cljs$lang$protocol_mask$partition0$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === ret.cljs$core$IMeta$))))?true:false):false)){
+return cljs.tools.reader.reader_types.merge_meta(ret,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$source,cljs.tools.reader.reader_types.peek_source_log(cljs.core.deref(reader.frames))], null));
+} else {
+return ret;
+}
+}finally {cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(reader.frames,cljs.core.update_in,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$offset], null),cljs.core.rest);
+}});
diff --git a/js/cljsc_opts.edn b/js/cljsc_opts.edn
new file mode 100644
index 0000000..17e56c9
--- /dev/null
+++ b/js/cljsc_opts.edn
@@ -0,0 +1 @@
+{:optimizations :advanced, :output-dir "website/static/js", :output-to "website/static/js/pluto.js", :main pluto.examples, :aot-cache true}
\ No newline at end of file
diff --git a/js/cljsjs/create-react-class/production/create-react-class.min.inc.js b/js/cljsjs/create-react-class/production/create-react-class.min.inc.js
new file mode 100644
index 0000000..0486cee
--- /dev/null
+++ b/js/cljsjs/create-react-class/production/create-react-class.min.inc.js
@@ -0,0 +1,1298 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory(require("react"));
+	else if(typeof define === 'function' && define.amd)
+		define(["react"], factory);
+	else if(typeof exports === 'object')
+		exports["createReactClass"] = factory(require("react"));
+	else
+		root["createReactClass"] = factory(root["React"]);
+})(this, function(__WEBPACK_EXTERNAL_MODULE_1__) {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+/******/
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+/******/
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId]) {
+/******/ 			return installedModules[moduleId].exports;
+/******/ 		}
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			i: moduleId,
+/******/ 			l: false,
+/******/ 			exports: {}
+/******/ 		};
+/******/
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+/******/
+/******/ 		// Flag the module as loaded
+/******/ 		module.l = true;
+/******/
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+/******/
+/******/
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+/******/
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+/******/
+/******/ 	// identity function for calling harmony imports with the correct context
+/******/ 	__webpack_require__.i = function(value) { return value; };
+/******/
+/******/ 	// define getter function for harmony exports
+/******/ 	__webpack_require__.d = function(exports, name, getter) {
+/******/ 		if(!__webpack_require__.o(exports, name)) {
+/******/ 			Object.defineProperty(exports, name, {
+/******/ 				configurable: false,
+/******/ 				enumerable: true,
+/******/ 				get: getter
+/******/ 			});
+/******/ 		}
+/******/ 	};
+/******/
+/******/ 	// getDefaultExport function for compatibility with non-harmony modules
+/******/ 	__webpack_require__.n = function(module) {
+/******/ 		var getter = module && module.__esModule ?
+/******/ 			function getDefault() { return module['default']; } :
+/******/ 			function getModuleExports() { return module; };
+/******/ 		__webpack_require__.d(getter, 'a', getter);
+/******/ 		return getter;
+/******/ 	};
+/******/
+/******/ 	// Object.prototype.hasOwnProperty.call
+/******/ 	__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
+/******/
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+/******/
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(__webpack_require__.s = 2);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+var _assign = __webpack_require__(7);
+
+var emptyObject = __webpack_require__(4);
+var _invariant = __webpack_require__(5);
+
+if (true) {
+  var warning = __webpack_require__(6);
+}
+
+var MIXINS_KEY = 'mixins';
+
+// Helper function to allow the creation of anonymous functions which do not
+// have .name set to the name of the variable being assigned to.
+function identity(fn) {
+  return fn;
+}
+
+var ReactPropTypeLocationNames;
+if (true) {
+  ReactPropTypeLocationNames = {
+    prop: 'prop',
+    context: 'context',
+    childContext: 'child context'
+  };
+} else {
+  ReactPropTypeLocationNames = {};
+}
+
+function factory(ReactComponent, isValidElement, ReactNoopUpdateQueue) {
+  /**
+   * Policies that describe methods in `ReactClassInterface`.
+   */
+
+  var injectedMixins = [];
+
+  /**
+   * Composite components are higher-level components that compose other composite
+   * or host components.
+   *
+   * To create a new type of `ReactClass`, pass a specification of
+   * your new class to `React.createClass`. The only requirement of your class
+   * specification is that you implement a `render` method.
+   *
+   *   var MyComponent = React.createClass({
+   *     render: function() {
+   *       return <div>Hello World</div>;
+   *     }
+   *   });
+   *
+   * The class specification supports a specific protocol of methods that have
+   * special meaning (e.g. `render`). See `ReactClassInterface` for
+   * more the comprehensive protocol. Any other properties and methods in the
+   * class specification will be available on the prototype.
+   *
+   * @interface ReactClassInterface
+   * @internal
+   */
+  var ReactClassInterface = {
+    /**
+     * An array of Mixin objects to include when defining your component.
+     *
+     * @type {array}
+     * @optional
+     */
+    mixins: 'DEFINE_MANY',
+
+    /**
+     * An object containing properties and methods that should be defined on
+     * the component's constructor instead of its prototype (static methods).
+     *
+     * @type {object}
+     * @optional
+     */
+    statics: 'DEFINE_MANY',
+
+    /**
+     * Definition of prop types for this component.
+     *
+     * @type {object}
+     * @optional
+     */
+    propTypes: 'DEFINE_MANY',
+
+    /**
+     * Definition of context types for this component.
+     *
+     * @type {object}
+     * @optional
+     */
+    contextTypes: 'DEFINE_MANY',
+
+    /**
+     * Definition of context types this component sets for its children.
+     *
+     * @type {object}
+     * @optional
+     */
+    childContextTypes: 'DEFINE_MANY',
+
+    // ==== Definition methods ====
+
+    /**
+     * Invoked when the component is mounted. Values in the mapping will be set on
+     * `this.props` if that prop is not specified (i.e. using an `in` check).
+     *
+     * This method is invoked before `getInitialState` and therefore cannot rely
+     * on `this.state` or use `this.setState`.
+     *
+     * @return {object}
+     * @optional
+     */
+    getDefaultProps: 'DEFINE_MANY_MERGED',
+
+    /**
+     * Invoked once before the component is mounted. The return value will be used
+     * as the initial value of `this.state`.
+     *
+     *   getInitialState: function() {
+     *     return {
+     *       isOn: false,
+     *       fooBaz: new BazFoo()
+     *     }
+     *   }
+     *
+     * @return {object}
+     * @optional
+     */
+    getInitialState: 'DEFINE_MANY_MERGED',
+
+    /**
+     * @return {object}
+     * @optional
+     */
+    getChildContext: 'DEFINE_MANY_MERGED',
+
+    /**
+     * Uses props from `this.props` and state from `this.state` to render the
+     * structure of the component.
+     *
+     * No guarantees are made about when or how often this method is invoked, so
+     * it must not have side effects.
+     *
+     *   render: function() {
+     *     var name = this.props.name;
+     *     return <div>Hello, {name}!</div>;
+     *   }
+     *
+     * @return {ReactComponent}
+     * @required
+     */
+    render: 'DEFINE_ONCE',
+
+    // ==== Delegate methods ====
+
+    /**
+     * Invoked when the component is initially created and about to be mounted.
+     * This may have side effects, but any external subscriptions or data created
+     * by this method must be cleaned up in `componentWillUnmount`.
+     *
+     * @optional
+     */
+    componentWillMount: 'DEFINE_MANY',
+
+    /**
+     * Invoked when the component has been mounted and has a DOM representation.
+     * However, there is no guarantee that the DOM node is in the document.
+     *
+     * Use this as an opportunity to operate on the DOM when the component has
+     * been mounted (initialized and rendered) for the first time.
+     *
+     * @param {DOMElement} rootNode DOM element representing the component.
+     * @optional
+     */
+    componentDidMount: 'DEFINE_MANY',
+
+    /**
+     * Invoked before the component receives new props.
+     *
+     * Use this as an opportunity to react to a prop transition by updating the
+     * state using `this.setState`. Current props are accessed via `this.props`.
+     *
+     *   componentWillReceiveProps: function(nextProps, nextContext) {
+     *     this.setState({
+     *       likesIncreasing: nextProps.likeCount > this.props.likeCount
+     *     });
+     *   }
+     *
+     * NOTE: There is no equivalent `componentWillReceiveState`. An incoming prop
+     * transition may cause a state change, but the opposite is not true. If you
+     * need it, you are probably looking for `componentWillUpdate`.
+     *
+     * @param {object} nextProps
+     * @optional
+     */
+    componentWillReceiveProps: 'DEFINE_MANY',
+
+    /**
+     * Invoked while deciding if the component should be updated as a result of
+     * receiving new props, state and/or context.
+     *
+     * Use this as an opportunity to `return false` when you're certain that the
+     * transition to the new props/state/context will not require a component
+     * update.
+     *
+     *   shouldComponentUpdate: function(nextProps, nextState, nextContext) {
+     *     return !equal(nextProps, this.props) ||
+     *       !equal(nextState, this.state) ||
+     *       !equal(nextContext, this.context);
+     *   }
+     *
+     * @param {object} nextProps
+     * @param {?object} nextState
+     * @param {?object} nextContext
+     * @return {boolean} True if the component should update.
+     * @optional
+     */
+    shouldComponentUpdate: 'DEFINE_ONCE',
+
+    /**
+     * Invoked when the component is about to update due to a transition from
+     * `this.props`, `this.state` and `this.context` to `nextProps`, `nextState`
+     * and `nextContext`.
+     *
+     * Use this as an opportunity to perform preparation before an update occurs.
+     *
+     * NOTE: You **cannot** use `this.setState()` in this method.
+     *
+     * @param {object} nextProps
+     * @param {?object} nextState
+     * @param {?object} nextContext
+     * @param {ReactReconcileTransaction} transaction
+     * @optional
+     */
+    componentWillUpdate: 'DEFINE_MANY',
+
+    /**
+     * Invoked when the component's DOM representation has been updated.
+     *
+     * Use this as an opportunity to operate on the DOM when the component has
+     * been updated.
+     *
+     * @param {object} prevProps
+     * @param {?object} prevState
+     * @param {?object} prevContext
+     * @param {DOMElement} rootNode DOM element representing the component.
+     * @optional
+     */
+    componentDidUpdate: 'DEFINE_MANY',
+
+    /**
+     * Invoked when the component is about to be removed from its parent and have
+     * its DOM representation destroyed.
+     *
+     * Use this as an opportunity to deallocate any external resources.
+     *
+     * NOTE: There is no `componentDidUnmount` since your component will have been
+     * destroyed by that point.
+     *
+     * @optional
+     */
+    componentWillUnmount: 'DEFINE_MANY',
+
+    // ==== Advanced methods ====
+
+    /**
+     * Updates the component's currently mounted DOM representation.
+     *
+     * By default, this implements React's rendering and reconciliation algorithm.
+     * Sophisticated clients may wish to override this.
+     *
+     * @param {ReactReconcileTransaction} transaction
+     * @internal
+     * @overridable
+     */
+    updateComponent: 'OVERRIDE_BASE'
+  };
+
+  /**
+   * Mapping from class specification keys to special processing functions.
+   *
+   * Although these are declared like instance properties in the specification
+   * when defining classes using `React.createClass`, they are actually static
+   * and are accessible on the constructor instead of the prototype. Despite
+   * being static, they must be defined outside of the "statics" key under
+   * which all other static methods are defined.
+   */
+  var RESERVED_SPEC_KEYS = {
+    displayName: function(Constructor, displayName) {
+      Constructor.displayName = displayName;
+    },
+    mixins: function(Constructor, mixins) {
+      if (mixins) {
+        for (var i = 0; i < mixins.length; i++) {
+          mixSpecIntoComponent(Constructor, mixins[i]);
+        }
+      }
+    },
+    childContextTypes: function(Constructor, childContextTypes) {
+      if (true) {
+        validateTypeDef(Constructor, childContextTypes, 'childContext');
+      }
+      Constructor.childContextTypes = _assign(
+        {},
+        Constructor.childContextTypes,
+        childContextTypes
+      );
+    },
+    contextTypes: function(Constructor, contextTypes) {
+      if (true) {
+        validateTypeDef(Constructor, contextTypes, 'context');
+      }
+      Constructor.contextTypes = _assign(
+        {},
+        Constructor.contextTypes,
+        contextTypes
+      );
+    },
+    /**
+     * Special case getDefaultProps which should move into statics but requires
+     * automatic merging.
+     */
+    getDefaultProps: function(Constructor, getDefaultProps) {
+      if (Constructor.getDefaultProps) {
+        Constructor.getDefaultProps = createMergedResultFunction(
+          Constructor.getDefaultProps,
+          getDefaultProps
+        );
+      } else {
+        Constructor.getDefaultProps = getDefaultProps;
+      }
+    },
+    propTypes: function(Constructor, propTypes) {
+      if (true) {
+        validateTypeDef(Constructor, propTypes, 'prop');
+      }
+      Constructor.propTypes = _assign({}, Constructor.propTypes, propTypes);
+    },
+    statics: function(Constructor, statics) {
+      mixStaticSpecIntoComponent(Constructor, statics);
+    },
+    autobind: function() {}
+  };
+
+  function validateTypeDef(Constructor, typeDef, location) {
+    for (var propName in typeDef) {
+      if (typeDef.hasOwnProperty(propName)) {
+        // use a warning instead of an _invariant so components
+        // don't show up in prod but only in __DEV__
+        if (true) {
+          warning(
+            typeof typeDef[propName] === 'function',
+            '%s: %s type `%s` is invalid; it must be a function, usually from ' +
+              'React.PropTypes.',
+            Constructor.displayName || 'ReactClass',
+            ReactPropTypeLocationNames[location],
+            propName
+          );
+        }
+      }
+    }
+  }
+
+  function validateMethodOverride(isAlreadyDefined, name) {
+    var specPolicy = ReactClassInterface.hasOwnProperty(name)
+      ? ReactClassInterface[name]
+      : null;
+
+    // Disallow overriding of base class methods unless explicitly allowed.
+    if (ReactClassMixin.hasOwnProperty(name)) {
+      _invariant(
+        specPolicy === 'OVERRIDE_BASE',
+        'ReactClassInterface: You are attempting to override ' +
+          '`%s` from your class specification. Ensure that your method names ' +
+          'do not overlap with React methods.',
+        name
+      );
+    }
+
+    // Disallow defining methods more than once unless explicitly allowed.
+    if (isAlreadyDefined) {
+      _invariant(
+        specPolicy === 'DEFINE_MANY' || specPolicy === 'DEFINE_MANY_MERGED',
+        'ReactClassInterface: You are attempting to define ' +
+          '`%s` on your component more than once. This conflict may be due ' +
+          'to a mixin.',
+        name
+      );
+    }
+  }
+
+  /**
+   * Mixin helper which handles policy validation and reserved
+   * specification keys when building React classes.
+   */
+  function mixSpecIntoComponent(Constructor, spec) {
+    if (!spec) {
+      if (true) {
+        var typeofSpec = typeof spec;
+        var isMixinValid = typeofSpec === 'object' && spec !== null;
+
+        if (true) {
+          warning(
+            isMixinValid,
+            "%s: You're attempting to include a mixin that is either null " +
+              'or not an object. Check the mixins included by the component, ' +
+              'as well as any mixins they include themselves. ' +
+              'Expected object but got %s.',
+            Constructor.displayName || 'ReactClass',
+            spec === null ? null : typeofSpec
+          );
+        }
+      }
+
+      return;
+    }
+
+    _invariant(
+      typeof spec !== 'function',
+      "ReactClass: You're attempting to " +
+        'use a component class or function as a mixin. Instead, just use a ' +
+        'regular object.'
+    );
+    _invariant(
+      !isValidElement(spec),
+      "ReactClass: You're attempting to " +
+        'use a component as a mixin. Instead, just use a regular object.'
+    );
+
+    var proto = Constructor.prototype;
+    var autoBindPairs = proto.__reactAutoBindPairs;
+
+    // By handling mixins before any other properties, we ensure the same
+    // chaining order is applied to methods with DEFINE_MANY policy, whether
+    // mixins are listed before or after these methods in the spec.
+    if (spec.hasOwnProperty(MIXINS_KEY)) {
+      RESERVED_SPEC_KEYS.mixins(Constructor, spec.mixins);
+    }
+
+    for (var name in spec) {
+      if (!spec.hasOwnProperty(name)) {
+        continue;
+      }
+
+      if (name === MIXINS_KEY) {
+        // We have already handled mixins in a special case above.
+        continue;
+      }
+
+      var property = spec[name];
+      var isAlreadyDefined = proto.hasOwnProperty(name);
+      validateMethodOverride(isAlreadyDefined, name);
+
+      if (RESERVED_SPEC_KEYS.hasOwnProperty(name)) {
+        RESERVED_SPEC_KEYS[name](Constructor, property);
+      } else {
+        // Setup methods on prototype:
+        // The following member methods should not be automatically bound:
+        // 1. Expected ReactClass methods (in the "interface").
+        // 2. Overridden methods (that were mixed in).
+        var isReactClassMethod = ReactClassInterface.hasOwnProperty(name);
+        var isFunction = typeof property === 'function';
+        var shouldAutoBind =
+          isFunction &&
+          !isReactClassMethod &&
+          !isAlreadyDefined &&
+          spec.autobind !== false;
+
+        if (shouldAutoBind) {
+          autoBindPairs.push(name, property);
+          proto[name] = property;
+        } else {
+          if (isAlreadyDefined) {
+            var specPolicy = ReactClassInterface[name];
+
+            // These cases should already be caught by validateMethodOverride.
+            _invariant(
+              isReactClassMethod &&
+                (specPolicy === 'DEFINE_MANY_MERGED' ||
+                  specPolicy === 'DEFINE_MANY'),
+              'ReactClass: Unexpected spec policy %s for key %s ' +
+                'when mixing in component specs.',
+              specPolicy,
+              name
+            );
+
+            // For methods which are defined more than once, call the existing
+            // methods before calling the new property, merging if appropriate.
+            if (specPolicy === 'DEFINE_MANY_MERGED') {
+              proto[name] = createMergedResultFunction(proto[name], property);
+            } else if (specPolicy === 'DEFINE_MANY') {
+              proto[name] = createChainedFunction(proto[name], property);
+            }
+          } else {
+            proto[name] = property;
+            if (true) {
+              // Add verbose displayName to the function, which helps when looking
+              // at profiling tools.
+              if (typeof property === 'function' && spec.displayName) {
+                proto[name].displayName = spec.displayName + '_' + name;
+              }
+            }
+          }
+        }
+      }
+    }
+  }
+
+  function mixStaticSpecIntoComponent(Constructor, statics) {
+    if (!statics) {
+      return;
+    }
+    for (var name in statics) {
+      var property = statics[name];
+      if (!statics.hasOwnProperty(name)) {
+        continue;
+      }
+
+      var isReserved = name in RESERVED_SPEC_KEYS;
+      _invariant(
+        !isReserved,
+        'ReactClass: You are attempting to define a reserved ' +
+          'property, `%s`, that shouldn\'t be on the "statics" key. Define it ' +
+          'as an instance property instead; it will still be accessible on the ' +
+          'constructor.',
+        name
+      );
+
+      var isInherited = name in Constructor;
+      _invariant(
+        !isInherited,
+        'ReactClass: You are attempting to define ' +
+          '`%s` on your component more than once. This conflict may be ' +
+          'due to a mixin.',
+        name
+      );
+      Constructor[name] = property;
+    }
+  }
+
+  /**
+   * Merge two objects, but throw if both contain the same key.
+   *
+   * @param {object} one The first object, which is mutated.
+   * @param {object} two The second object
+   * @return {object} one after it has been mutated to contain everything in two.
+   */
+  function mergeIntoWithNoDuplicateKeys(one, two) {
+    _invariant(
+      one && two && typeof one === 'object' && typeof two === 'object',
+      'mergeIntoWithNoDuplicateKeys(): Cannot merge non-objects.'
+    );
+
+    for (var key in two) {
+      if (two.hasOwnProperty(key)) {
+        _invariant(
+          one[key] === undefined,
+          'mergeIntoWithNoDuplicateKeys(): ' +
+            'Tried to merge two objects with the same key: `%s`. This conflict ' +
+            'may be due to a mixin; in particular, this may be caused by two ' +
+            'getInitialState() or getDefaultProps() methods returning objects ' +
+            'with clashing keys.',
+          key
+        );
+        one[key] = two[key];
+      }
+    }
+    return one;
+  }
+
+  /**
+   * Creates a function that invokes two functions and merges their return values.
+   *
+   * @param {function} one Function to invoke first.
+   * @param {function} two Function to invoke second.
+   * @return {function} Function that invokes the two argument functions.
+   * @private
+   */
+  function createMergedResultFunction(one, two) {
+    return function mergedResult() {
+      var a = one.apply(this, arguments);
+      var b = two.apply(this, arguments);
+      if (a == null) {
+        return b;
+      } else if (b == null) {
+        return a;
+      }
+      var c = {};
+      mergeIntoWithNoDuplicateKeys(c, a);
+      mergeIntoWithNoDuplicateKeys(c, b);
+      return c;
+    };
+  }
+
+  /**
+   * Creates a function that invokes two functions and ignores their return vales.
+   *
+   * @param {function} one Function to invoke first.
+   * @param {function} two Function to invoke second.
+   * @return {function} Function that invokes the two argument functions.
+   * @private
+   */
+  function createChainedFunction(one, two) {
+    return function chainedFunction() {
+      one.apply(this, arguments);
+      two.apply(this, arguments);
+    };
+  }
+
+  /**
+   * Binds a method to the component.
+   *
+   * @param {object} component Component whose method is going to be bound.
+   * @param {function} method Method to be bound.
+   * @return {function} The bound method.
+   */
+  function bindAutoBindMethod(component, method) {
+    var boundMethod = method.bind(component);
+    if (true) {
+      boundMethod.__reactBoundContext = component;
+      boundMethod.__reactBoundMethod = method;
+      boundMethod.__reactBoundArguments = null;
+      var componentName = component.constructor.displayName;
+      var _bind = boundMethod.bind;
+      boundMethod.bind = function(newThis) {
+        for (
+          var _len = arguments.length,
+            args = Array(_len > 1 ? _len - 1 : 0),
+            _key = 1;
+          _key < _len;
+          _key++
+        ) {
+          args[_key - 1] = arguments[_key];
+        }
+
+        // User is trying to bind() an autobound method; we effectively will
+        // ignore the value of "this" that the user is trying to use, so
+        // let's warn.
+        if (newThis !== component && newThis !== null) {
+          if (true) {
+            warning(
+              false,
+              'bind(): React component methods may only be bound to the ' +
+                'component instance. See %s',
+              componentName
+            );
+          }
+        } else if (!args.length) {
+          if (true) {
+            warning(
+              false,
+              'bind(): You are binding a component method to the component. ' +
+                'React does this for you automatically in a high-performance ' +
+                'way, so you can safely remove this call. See %s',
+              componentName
+            );
+          }
+          return boundMethod;
+        }
+        var reboundMethod = _bind.apply(boundMethod, arguments);
+        reboundMethod.__reactBoundContext = component;
+        reboundMethod.__reactBoundMethod = method;
+        reboundMethod.__reactBoundArguments = args;
+        return reboundMethod;
+      };
+    }
+    return boundMethod;
+  }
+
+  /**
+   * Binds all auto-bound methods in a component.
+   *
+   * @param {object} component Component whose method is going to be bound.
+   */
+  function bindAutoBindMethods(component) {
+    var pairs = component.__reactAutoBindPairs;
+    for (var i = 0; i < pairs.length; i += 2) {
+      var autoBindKey = pairs[i];
+      var method = pairs[i + 1];
+      component[autoBindKey] = bindAutoBindMethod(component, method);
+    }
+  }
+
+  var IsMountedPreMixin = {
+    componentDidMount: function() {
+      this.__isMounted = true;
+    }
+  };
+
+  var IsMountedPostMixin = {
+    componentWillUnmount: function() {
+      this.__isMounted = false;
+    }
+  };
+
+  /**
+   * Add more to the ReactClass base class. These are all legacy features and
+   * therefore not already part of the modern ReactComponent.
+   */
+  var ReactClassMixin = {
+    /**
+     * TODO: This will be deprecated because state should always keep a consistent
+     * type signature and the only use case for this, is to avoid that.
+     */
+    replaceState: function(newState, callback) {
+      this.updater.enqueueReplaceState(this, newState, callback);
+    },
+
+    /**
+     * Checks whether or not this composite component is mounted.
+     * @return {boolean} True if mounted, false otherwise.
+     * @protected
+     * @final
+     */
+    isMounted: function() {
+      if (true) {
+        warning(
+          this.__didWarnIsMounted,
+          '%s: isMounted is deprecated. Instead, make sure to clean up ' +
+            'subscriptions and pending requests in componentWillUnmount to ' +
+            'prevent memory leaks.',
+          (this.constructor && this.constructor.displayName) ||
+            this.name ||
+            'Component'
+        );
+        this.__didWarnIsMounted = true;
+      }
+      return !!this.__isMounted;
+    }
+  };
+
+  var ReactClassComponent = function() {};
+  _assign(
+    ReactClassComponent.prototype,
+    ReactComponent.prototype,
+    ReactClassMixin
+  );
+
+  /**
+   * Creates a composite component class given a class specification.
+   * See https://facebook.github.io/react/docs/top-level-api.html#react.createclass
+   *
+   * @param {object} spec Class specification (which must define `render`).
+   * @return {function} Component constructor function.
+   * @public
+   */
+  function createClass(spec) {
+    // To keep our warnings more understandable, we'll use a little hack here to
+    // ensure that Constructor.name !== 'Constructor'. This makes sure we don't
+    // unnecessarily identify a class without displayName as 'Constructor'.
+    var Constructor = identity(function(props, context, updater) {
+      // This constructor gets overridden by mocks. The argument is used
+      // by mocks to assert on what gets mounted.
+
+      if (true) {
+        warning(
+          this instanceof Constructor,
+          'Something is calling a React component directly. Use a factory or ' +
+            'JSX instead. See: https://fb.me/react-legacyfactory'
+        );
+      }
+
+      // Wire up auto-binding
+      if (this.__reactAutoBindPairs.length) {
+        bindAutoBindMethods(this);
+      }
+
+      this.props = props;
+      this.context = context;
+      this.refs = emptyObject;
+      this.updater = updater || ReactNoopUpdateQueue;
+
+      this.state = null;
+
+      // ReactClasses doesn't have constructors. Instead, they use the
+      // getInitialState and componentWillMount methods for initialization.
+
+      var initialState = this.getInitialState ? this.getInitialState() : null;
+      if (true) {
+        // We allow auto-mocks to proceed as if they're returning null.
+        if (
+          initialState === undefined &&
+          this.getInitialState._isMockFunction
+        ) {
+          // This is probably bad practice. Consider warning here and
+          // deprecating this convenience.
+          initialState = null;
+        }
+      }
+      _invariant(
+        typeof initialState === 'object' && !Array.isArray(initialState),
+        '%s.getInitialState(): must return an object or null',
+        Constructor.displayName || 'ReactCompositeComponent'
+      );
+
+      this.state = initialState;
+    });
+    Constructor.prototype = new ReactClassComponent();
+    Constructor.prototype.constructor = Constructor;
+    Constructor.prototype.__reactAutoBindPairs = [];
+
+    injectedMixins.forEach(mixSpecIntoComponent.bind(null, Constructor));
+
+    mixSpecIntoComponent(Constructor, IsMountedPreMixin);
+    mixSpecIntoComponent(Constructor, spec);
+    mixSpecIntoComponent(Constructor, IsMountedPostMixin);
+
+    // Initialize the defaultProps property after all mixins have been merged.
+    if (Constructor.getDefaultProps) {
+      Constructor.defaultProps = Constructor.getDefaultProps();
+    }
+
+    if (true) {
+      // This is a tag to indicate that the use of these method names is ok,
+      // since it's used with createClass. If it's not, then it's likely a
+      // mistake so we'll warn you to use the static property, property
+      // initializer or constructor respectively.
+      if (Constructor.getDefaultProps) {
+        Constructor.getDefaultProps.isReactClassApproved = {};
+      }
+      if (Constructor.prototype.getInitialState) {
+        Constructor.prototype.getInitialState.isReactClassApproved = {};
+      }
+    }
+
+    _invariant(
+      Constructor.prototype.render,
+      'createClass(...): Class specification must implement a `render` method.'
+    );
+
+    if (true) {
+      warning(
+        !Constructor.prototype.componentShouldUpdate,
+        '%s has a method called ' +
+          'componentShouldUpdate(). Did you mean shouldComponentUpdate()? ' +
+          'The name is phrased as a question because the function is ' +
+          'expected to return a value.',
+        spec.displayName || 'A component'
+      );
+      warning(
+        !Constructor.prototype.componentWillRecieveProps,
+        '%s has a method called ' +
+          'componentWillRecieveProps(). Did you mean componentWillReceiveProps()?',
+        spec.displayName || 'A component'
+      );
+    }
+
+    // Reduce time spent doing lookups by setting these on the prototype.
+    for (var methodName in ReactClassInterface) {
+      if (!Constructor.prototype[methodName]) {
+        Constructor.prototype[methodName] = null;
+      }
+    }
+
+    return Constructor;
+  }
+
+  return createClass;
+}
+
+module.exports = factory;
+
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports) {
+
+module.exports = __WEBPACK_EXTERNAL_MODULE_1__;
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+var React = __webpack_require__(1);
+var factory = __webpack_require__(0);
+
+if (typeof React === 'undefined') {
+  throw Error(
+    'create-react-class could not find the React object. If you are using script tags, ' +
+      'make sure that React is being loaded before create-react-class.'
+  );
+}
+
+// Hack to grab NoopUpdateQueue from isomorphic React
+var ReactNoopUpdateQueue = new React.Component().updater;
+
+module.exports = factory(
+  React.Component,
+  React.isValidElement,
+  ReactNoopUpdateQueue
+);
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ * 
+ */
+
+function makeEmptyFunction(arg) {
+  return function () {
+    return arg;
+  };
+}
+
+/**
+ * This function accepts and discards inputs; it has no side effects. This is
+ * primarily useful idiomatically for overridable function endpoints which
+ * always need to be callable, since JS lacks a null-call idiom ala Cocoa.
+ */
+var emptyFunction = function emptyFunction() {};
+
+emptyFunction.thatReturns = makeEmptyFunction;
+emptyFunction.thatReturnsFalse = makeEmptyFunction(false);
+emptyFunction.thatReturnsTrue = makeEmptyFunction(true);
+emptyFunction.thatReturnsNull = makeEmptyFunction(null);
+emptyFunction.thatReturnsThis = function () {
+  return this;
+};
+emptyFunction.thatReturnsArgument = function (arg) {
+  return arg;
+};
+
+module.exports = emptyFunction;
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ */
+
+
+
+var emptyObject = {};
+
+if (true) {
+  Object.freeze(emptyObject);
+}
+
+module.exports = emptyObject;
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ */
+
+
+
+/**
+ * Use invariant() to assert state which your program assumes to be true.
+ *
+ * Provide sprintf-style format (only %s is supported) and arguments
+ * to provide information about what broke and what you were
+ * expecting.
+ *
+ * The invariant message will be stripped in production, but the invariant
+ * will remain to ensure logic does not differ in production.
+ */
+
+var validateFormat = function validateFormat(format) {};
+
+if (true) {
+  validateFormat = function validateFormat(format) {
+    if (format === undefined) {
+      throw new Error('invariant requires an error message argument');
+    }
+  };
+}
+
+function invariant(condition, format, a, b, c, d, e, f) {
+  validateFormat(format);
+
+  if (!condition) {
+    var error;
+    if (format === undefined) {
+      error = new Error('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.');
+    } else {
+      var args = [a, b, c, d, e, f];
+      var argIndex = 0;
+      error = new Error(format.replace(/%s/g, function () {
+        return args[argIndex++];
+      }));
+      error.name = 'Invariant Violation';
+    }
+
+    error.framesToPop = 1; // we don't care about invariant's own frame
+    throw error;
+  }
+}
+
+module.exports = invariant;
+
+/***/ }),
+/* 6 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+/**
+ * Copyright 2014-2015, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ */
+
+
+
+var emptyFunction = __webpack_require__(3);
+
+/**
+ * Similar to invariant but only logs a warning if the condition is not met.
+ * This can be used to log issues in development environments in critical
+ * paths. Removing the logging code for production environments will keep the
+ * same logic and follow the same code paths.
+ */
+
+var warning = emptyFunction;
+
+if (true) {
+  (function () {
+    var printWarning = function printWarning(format) {
+      for (var _len = arguments.length, args = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+        args[_key - 1] = arguments[_key];
+      }
+
+      var argIndex = 0;
+      var message = 'Warning: ' + format.replace(/%s/g, function () {
+        return args[argIndex++];
+      });
+      if (typeof console !== 'undefined') {
+        console.error(message);
+      }
+      try {
+        // --- Welcome to debugging React ---
+        // This error was thrown as a convenience so that you can use this stack
+        // to find the callsite that caused this warning to fire.
+        throw new Error(message);
+      } catch (x) {}
+    };
+
+    warning = function warning(condition, format) {
+      if (format === undefined) {
+        throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument');
+      }
+
+      if (format.indexOf('Failed Composite propType: ') === 0) {
+        return; // Ignore CompositeComponent proptype check.
+      }
+
+      if (!condition) {
+        for (var _len2 = arguments.length, args = Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) {
+          args[_key2 - 2] = arguments[_key2];
+        }
+
+        printWarning.apply(undefined, [format].concat(args));
+      }
+    };
+  })();
+}
+
+module.exports = warning;
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+/*
+object-assign
+(c) Sindre Sorhus
+@license MIT
+*/
+
+
+/* eslint-disable no-unused-vars */
+var getOwnPropertySymbols = Object.getOwnPropertySymbols;
+var hasOwnProperty = Object.prototype.hasOwnProperty;
+var propIsEnumerable = Object.prototype.propertyIsEnumerable;
+
+function toObject(val) {
+	if (val === null || val === undefined) {
+		throw new TypeError('Object.assign cannot be called with null or undefined');
+	}
+
+	return Object(val);
+}
+
+function shouldUseNative() {
+	try {
+		if (!Object.assign) {
+			return false;
+		}
+
+		// Detect buggy property enumeration order in older V8 versions.
+
+		// https://bugs.chromium.org/p/v8/issues/detail?id=4118
+		var test1 = new String('abc');  // eslint-disable-line no-new-wrappers
+		test1[5] = 'de';
+		if (Object.getOwnPropertyNames(test1)[0] === '5') {
+			return false;
+		}
+
+		// https://bugs.chromium.org/p/v8/issues/detail?id=3056
+		var test2 = {};
+		for (var i = 0; i < 10; i++) {
+			test2['_' + String.fromCharCode(i)] = i;
+		}
+		var order2 = Object.getOwnPropertyNames(test2).map(function (n) {
+			return test2[n];
+		});
+		if (order2.join('') !== '0123456789') {
+			return false;
+		}
+
+		// https://bugs.chromium.org/p/v8/issues/detail?id=3056
+		var test3 = {};
+		'abcdefghijklmnopqrst'.split('').forEach(function (letter) {
+			test3[letter] = letter;
+		});
+		if (Object.keys(Object.assign({}, test3)).join('') !==
+				'abcdefghijklmnopqrst') {
+			return false;
+		}
+
+		return true;
+	} catch (err) {
+		// We don't expect any of the above to throw, but better to be safe.
+		return false;
+	}
+}
+
+module.exports = shouldUseNative() ? Object.assign : function (target, source) {
+	var from;
+	var to = toObject(target);
+	var symbols;
+
+	for (var s = 1; s < arguments.length; s++) {
+		from = Object(arguments[s]);
+
+		for (var key in from) {
+			if (hasOwnProperty.call(from, key)) {
+				to[key] = from[key];
+			}
+		}
+
+		if (getOwnPropertySymbols) {
+			symbols = getOwnPropertySymbols(from);
+			for (var i = 0; i < symbols.length; i++) {
+				if (propIsEnumerable.call(from, symbols[i])) {
+					to[symbols[i]] = from[symbols[i]];
+				}
+			}
+		}
+	}
+
+	return to;
+};
+
+
+/***/ })
+/******/ ]);
+});
\ No newline at end of file
diff --git a/js/cljsjs/react-dom/production/react-dom.min.inc.js b/js/cljsjs/react-dom/production/react-dom.min.inc.js
new file mode 100644
index 0000000..d461fae
--- /dev/null
+++ b/js/cljsjs/react-dom/production/react-dom.min.inc.js
@@ -0,0 +1,17098 @@
+/** @license React v16.3.0
+ * react-dom.development.js
+ *
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+'use strict';
+
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory(require('react')) :
+	typeof define === 'function' && define.amd ? define(['react'], factory) :
+	(global.ReactDOM = factory(global.React));
+}(this, (function (React) { 'use strict';
+
+/**
+ * WARNING: DO NOT manually require this module.
+ * This is a replacement for `invariant(...)` used by the error code system
+ * and will _only_ be required by the corresponding babel pass.
+ * It always throws.
+ */
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+/**
+ * Use invariant() to assert state which your program assumes to be true.
+ *
+ * Provide sprintf-style format (only %s is supported) and arguments
+ * to provide information about what broke and what you were
+ * expecting.
+ *
+ * The invariant message will be stripped in production, but the invariant
+ * will remain to ensure logic does not differ in production.
+ */
+
+var validateFormat = function validateFormat(format) {};
+
+{
+  validateFormat = function validateFormat(format) {
+    if (format === undefined) {
+      throw new Error('invariant requires an error message argument');
+    }
+  };
+}
+
+function invariant(condition, format, a, b, c, d, e, f) {
+  validateFormat(format);
+
+  if (!condition) {
+    var error;
+    if (format === undefined) {
+      error = new Error('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.');
+    } else {
+      var args = [a, b, c, d, e, f];
+      var argIndex = 0;
+      error = new Error(format.replace(/%s/g, function () {
+        return args[argIndex++];
+      }));
+      error.name = 'Invariant Violation';
+    }
+
+    error.framesToPop = 1; // we don't care about invariant's own frame
+    throw error;
+  }
+}
+
+var invariant_1 = invariant;
+
+!React ? invariant_1(false, 'ReactDOM was loaded before React. Make sure you load the React package before loading ReactDOM.') : void 0;
+
+var invokeGuardedCallback = function (name, func, context, a, b, c, d, e, f) {
+  this._hasCaughtError = false;
+  this._caughtError = null;
+  var funcArgs = Array.prototype.slice.call(arguments, 3);
+  try {
+    func.apply(context, funcArgs);
+  } catch (error) {
+    this._caughtError = error;
+    this._hasCaughtError = true;
+  }
+};
+
+{
+  // In DEV mode, we swap out invokeGuardedCallback for a special version
+  // that plays more nicely with the browser's DevTools. The idea is to preserve
+  // "Pause on exceptions" behavior. Because React wraps all user-provided
+  // functions in invokeGuardedCallback, and the production version of
+  // invokeGuardedCallback uses a try-catch, all user exceptions are treated
+  // like caught exceptions, and the DevTools won't pause unless the developer
+  // takes the extra step of enabling pause on caught exceptions. This is
+  // untintuitive, though, because even though React has caught the error, from
+  // the developer's perspective, the error is uncaught.
+  //
+  // To preserve the expected "Pause on exceptions" behavior, we don't use a
+  // try-catch in DEV. Instead, we synchronously dispatch a fake event to a fake
+  // DOM node, and call the user-provided callback from inside an event handler
+  // for that fake event. If the callback throws, the error is "captured" using
+  // a global event handler. But because the error happens in a different
+  // event loop context, it does not interrupt the normal program flow.
+  // Effectively, this gives us try-catch behavior without actually using
+  // try-catch. Neat!
+
+  // Check that the browser supports the APIs we need to implement our special
+  // DEV version of invokeGuardedCallback
+  if (typeof window !== 'undefined' && typeof window.dispatchEvent === 'function' && typeof document !== 'undefined' && typeof document.createEvent === 'function') {
+    var fakeNode = document.createElement('react');
+
+    var invokeGuardedCallbackDev = function (name, func, context, a, b, c, d, e, f) {
+      // If document doesn't exist we know for sure we will crash in this method
+      // when we call document.createEvent(). However this can cause confusing
+      // errors: https://github.com/facebookincubator/create-react-app/issues/3482
+      // So we preemptively throw with a better message instead.
+      !(typeof document !== 'undefined') ? invariant_1(false, 'The `document` global was defined when React was initialized, but is not defined anymore. This can happen in a test environment if a component schedules an update from an asynchronous callback, but the test has already finished running. To solve this, you can either unmount the component at the end of your test (and ensure that any asynchronous operations get canceled in `componentWillUnmount`), or you can change the test itself to be asynchronous.') : void 0;
+      var evt = document.createEvent('Event');
+
+      // Keeps track of whether the user-provided callback threw an error. We
+      // set this to true at the beginning, then set it to false right after
+      // calling the function. If the function errors, `didError` will never be
+      // set to false. This strategy works even if the browser is flaky and
+      // fails to call our global error handler, because it doesn't rely on
+      // the error event at all.
+      var didError = true;
+
+      // Create an event handler for our fake event. We will synchronously
+      // dispatch our fake event using `dispatchEvent`. Inside the handler, we
+      // call the user-provided callback.
+      var funcArgs = Array.prototype.slice.call(arguments, 3);
+      function callCallback() {
+        // We immediately remove the callback from event listeners so that
+        // nested `invokeGuardedCallback` calls do not clash. Otherwise, a
+        // nested call would trigger the fake event handlers of any call higher
+        // in the stack.
+        fakeNode.removeEventListener(evtType, callCallback, false);
+        func.apply(context, funcArgs);
+        didError = false;
+      }
+
+      // Create a global error event handler. We use this to capture the value
+      // that was thrown. It's possible that this error handler will fire more
+      // than once; for example, if non-React code also calls `dispatchEvent`
+      // and a handler for that event throws. We should be resilient to most of
+      // those cases. Even if our error event handler fires more than once, the
+      // last error event is always used. If the callback actually does error,
+      // we know that the last error event is the correct one, because it's not
+      // possible for anything else to have happened in between our callback
+      // erroring and the code that follows the `dispatchEvent` call below. If
+      // the callback doesn't error, but the error event was fired, we know to
+      // ignore it because `didError` will be false, as described above.
+      var error = void 0;
+      // Use this to track whether the error event is ever called.
+      var didSetError = false;
+      var isCrossOriginError = false;
+
+      function onError(event) {
+        error = event.error;
+        didSetError = true;
+        if (error === null && event.colno === 0 && event.lineno === 0) {
+          isCrossOriginError = true;
+        }
+      }
+
+      // Create a fake event type.
+      var evtType = 'react-' + (name ? name : 'invokeguardedcallback');
+
+      // Attach our event handlers
+      window.addEventListener('error', onError);
+      fakeNode.addEventListener(evtType, callCallback, false);
+
+      // Synchronously dispatch our fake event. If the user-provided function
+      // errors, it will trigger our global error handler.
+      evt.initEvent(evtType, false, false);
+      fakeNode.dispatchEvent(evt);
+
+      if (didError) {
+        if (!didSetError) {
+          // The callback errored, but the error event never fired.
+          error = new Error('An error was thrown inside one of your components, but React ' + "doesn't know what it was. This is likely due to browser " + 'flakiness. React does its best to preserve the "Pause on ' + 'exceptions" behavior of the DevTools, which requires some ' + "DEV-mode only tricks. It's possible that these don't work in " + 'your browser. Try triggering the error in production mode, ' + 'or switching to a modern browser. If you suspect that this is ' + 'actually an issue with React, please file an issue.');
+        } else if (isCrossOriginError) {
+          error = new Error("A cross-origin error was thrown. React doesn't have access to " + 'the actual error object in development. ' + 'See https://fb.me/react-crossorigin-error for more information.');
+        }
+        this._hasCaughtError = true;
+        this._caughtError = error;
+      } else {
+        this._hasCaughtError = false;
+        this._caughtError = null;
+      }
+
+      // Remove our event listeners
+      window.removeEventListener('error', onError);
+    };
+
+    invokeGuardedCallback = invokeGuardedCallbackDev;
+  }
+}
+
+var invokeGuardedCallback$1 = invokeGuardedCallback;
+
+var ReactErrorUtils = {
+  // Used by Fiber to simulate a try-catch.
+  _caughtError: null,
+  _hasCaughtError: false,
+
+  // Used by event system to capture/rethrow the first error.
+  _rethrowError: null,
+  _hasRethrowError: false,
+
+  /**
+   * Call a function while guarding against errors that happens within it.
+   * Returns an error if it throws, otherwise null.
+   *
+   * In production, this is implemented using a try-catch. The reason we don't
+   * use a try-catch directly is so that we can swap out a different
+   * implementation in DEV mode.
+   *
+   * @param {String} name of the guard to use for logging or debugging
+   * @param {Function} func The function to invoke
+   * @param {*} context The context to use when calling the function
+   * @param {...*} args Arguments for function
+   */
+  invokeGuardedCallback: function (name, func, context, a, b, c, d, e, f) {
+    invokeGuardedCallback$1.apply(ReactErrorUtils, arguments);
+  },
+
+  /**
+   * Same as invokeGuardedCallback, but instead of returning an error, it stores
+   * it in a global so it can be rethrown by `rethrowCaughtError` later.
+   * TODO: See if _caughtError and _rethrowError can be unified.
+   *
+   * @param {String} name of the guard to use for logging or debugging
+   * @param {Function} func The function to invoke
+   * @param {*} context The context to use when calling the function
+   * @param {...*} args Arguments for function
+   */
+  invokeGuardedCallbackAndCatchFirstError: function (name, func, context, a, b, c, d, e, f) {
+    ReactErrorUtils.invokeGuardedCallback.apply(this, arguments);
+    if (ReactErrorUtils.hasCaughtError()) {
+      var error = ReactErrorUtils.clearCaughtError();
+      if (!ReactErrorUtils._hasRethrowError) {
+        ReactErrorUtils._hasRethrowError = true;
+        ReactErrorUtils._rethrowError = error;
+      }
+    }
+  },
+
+  /**
+   * During execution of guarded functions we will capture the first error which
+   * we will rethrow to be handled by the top level error handler.
+   */
+  rethrowCaughtError: function () {
+    return rethrowCaughtError.apply(ReactErrorUtils, arguments);
+  },
+
+  hasCaughtError: function () {
+    return ReactErrorUtils._hasCaughtError;
+  },
+
+  clearCaughtError: function () {
+    if (ReactErrorUtils._hasCaughtError) {
+      var error = ReactErrorUtils._caughtError;
+      ReactErrorUtils._caughtError = null;
+      ReactErrorUtils._hasCaughtError = false;
+      return error;
+    } else {
+      invariant_1(false, 'clearCaughtError was called but no error was captured. This error is likely caused by a bug in React. Please file an issue.');
+    }
+  }
+};
+
+var rethrowCaughtError = function () {
+  if (ReactErrorUtils._hasRethrowError) {
+    var error = ReactErrorUtils._rethrowError;
+    ReactErrorUtils._rethrowError = null;
+    ReactErrorUtils._hasRethrowError = false;
+    throw error;
+  }
+};
+
+/**
+ * Injectable ordering of event plugins.
+ */
+var eventPluginOrder = null;
+
+/**
+ * Injectable mapping from names to event plugin modules.
+ */
+var namesToPlugins = {};
+
+/**
+ * Recomputes the plugin list using the injected plugins and plugin ordering.
+ *
+ * @private
+ */
+function recomputePluginOrdering() {
+  if (!eventPluginOrder) {
+    // Wait until an `eventPluginOrder` is injected.
+    return;
+  }
+  for (var pluginName in namesToPlugins) {
+    var pluginModule = namesToPlugins[pluginName];
+    var pluginIndex = eventPluginOrder.indexOf(pluginName);
+    !(pluginIndex > -1) ? invariant_1(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;
+    if (plugins[pluginIndex]) {
+      continue;
+    }
+    !pluginModule.extractEvents ? invariant_1(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;
+    plugins[pluginIndex] = pluginModule;
+    var publishedEvents = pluginModule.eventTypes;
+    for (var eventName in publishedEvents) {
+      !publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant_1(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;
+    }
+  }
+}
+
+/**
+ * Publishes an event so that it can be dispatched by the supplied plugin.
+ *
+ * @param {object} dispatchConfig Dispatch configuration for the event.
+ * @param {object} PluginModule Plugin publishing the event.
+ * @return {boolean} True if the event was successfully published.
+ * @private
+ */
+function publishEventForPlugin(dispatchConfig, pluginModule, eventName) {
+  !!eventNameDispatchConfigs.hasOwnProperty(eventName) ? invariant_1(false, 'EventPluginHub: More than one plugin attempted to publish the same event name, `%s`.', eventName) : void 0;
+  eventNameDispatchConfigs[eventName] = dispatchConfig;
+
+  var phasedRegistrationNames = dispatchConfig.phasedRegistrationNames;
+  if (phasedRegistrationNames) {
+    for (var phaseName in phasedRegistrationNames) {
+      if (phasedRegistrationNames.hasOwnProperty(phaseName)) {
+        var phasedRegistrationName = phasedRegistrationNames[phaseName];
+        publishRegistrationName(phasedRegistrationName, pluginModule, eventName);
+      }
+    }
+    return true;
+  } else if (dispatchConfig.registrationName) {
+    publishRegistrationName(dispatchConfig.registrationName, pluginModule, eventName);
+    return true;
+  }
+  return false;
+}
+
+/**
+ * Publishes a registration name that is used to identify dispatched events.
+ *
+ * @param {string} registrationName Registration name to add.
+ * @param {object} PluginModule Plugin publishing the event.
+ * @private
+ */
+function publishRegistrationName(registrationName, pluginModule, eventName) {
+  !!registrationNameModules[registrationName] ? invariant_1(false, 'EventPluginHub: More than one plugin attempted to publish the same registration name, `%s`.', registrationName) : void 0;
+  registrationNameModules[registrationName] = pluginModule;
+  registrationNameDependencies[registrationName] = pluginModule.eventTypes[eventName].dependencies;
+
+  {
+    var lowerCasedName = registrationName.toLowerCase();
+    possibleRegistrationNames[lowerCasedName] = registrationName;
+
+    if (registrationName === 'onDoubleClick') {
+      possibleRegistrationNames.ondblclick = registrationName;
+    }
+  }
+}
+
+/**
+ * Registers plugins so that they can extract and dispatch events.
+ *
+ * @see {EventPluginHub}
+ */
+
+/**
+ * Ordered list of injected plugins.
+ */
+var plugins = [];
+
+/**
+ * Mapping from event name to dispatch config
+ */
+var eventNameDispatchConfigs = {};
+
+/**
+ * Mapping from registration name to plugin module
+ */
+var registrationNameModules = {};
+
+/**
+ * Mapping from registration name to event name
+ */
+var registrationNameDependencies = {};
+
+/**
+ * Mapping from lowercase registration names to the properly cased version,
+ * used to warn in the case of missing event handlers. Available
+ * only in true.
+ * @type {Object}
+ */
+var possibleRegistrationNames = {};
+// Trust the developer to only use possibleRegistrationNames in true
+
+/**
+ * Injects an ordering of plugins (by plugin name). This allows the ordering
+ * to be decoupled from injection of the actual plugins so that ordering is
+ * always deterministic regardless of packaging, on-the-fly injection, etc.
+ *
+ * @param {array} InjectedEventPluginOrder
+ * @internal
+ * @see {EventPluginHub.injection.injectEventPluginOrder}
+ */
+function injectEventPluginOrder(injectedEventPluginOrder) {
+  !!eventPluginOrder ? invariant_1(false, 'EventPluginRegistry: Cannot inject event plugin ordering more than once. You are likely trying to load more than one copy of React.') : void 0;
+  // Clone the ordering so it cannot be dynamically mutated.
+  eventPluginOrder = Array.prototype.slice.call(injectedEventPluginOrder);
+  recomputePluginOrdering();
+}
+
+/**
+ * Injects plugins to be used by `EventPluginHub`. The plugin names must be
+ * in the ordering injected by `injectEventPluginOrder`.
+ *
+ * Plugins can be injected as part of page initialization or on-the-fly.
+ *
+ * @param {object} injectedNamesToPlugins Map from names to plugin modules.
+ * @internal
+ * @see {EventPluginHub.injection.injectEventPluginsByName}
+ */
+function injectEventPluginsByName(injectedNamesToPlugins) {
+  var isOrderingDirty = false;
+  for (var pluginName in injectedNamesToPlugins) {
+    if (!injectedNamesToPlugins.hasOwnProperty(pluginName)) {
+      continue;
+    }
+    var pluginModule = injectedNamesToPlugins[pluginName];
+    if (!namesToPlugins.hasOwnProperty(pluginName) || namesToPlugins[pluginName] !== pluginModule) {
+      !!namesToPlugins[pluginName] ? invariant_1(false, 'EventPluginRegistry: Cannot inject two different event plugins using the same name, `%s`.', pluginName) : void 0;
+      namesToPlugins[pluginName] = pluginModule;
+      isOrderingDirty = true;
+    }
+  }
+  if (isOrderingDirty) {
+    recomputePluginOrdering();
+  }
+}
+
+var EventPluginRegistry = Object.freeze({
+	plugins: plugins,
+	eventNameDispatchConfigs: eventNameDispatchConfigs,
+	registrationNameModules: registrationNameModules,
+	registrationNameDependencies: registrationNameDependencies,
+	possibleRegistrationNames: possibleRegistrationNames,
+	injectEventPluginOrder: injectEventPluginOrder,
+	injectEventPluginsByName: injectEventPluginsByName
+});
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * 
+ */
+
+function makeEmptyFunction(arg) {
+  return function () {
+    return arg;
+  };
+}
+
+/**
+ * This function accepts and discards inputs; it has no side effects. This is
+ * primarily useful idiomatically for overridable function endpoints which
+ * always need to be callable, since JS lacks a null-call idiom ala Cocoa.
+ */
+var emptyFunction = function emptyFunction() {};
+
+emptyFunction.thatReturns = makeEmptyFunction;
+emptyFunction.thatReturnsFalse = makeEmptyFunction(false);
+emptyFunction.thatReturnsTrue = makeEmptyFunction(true);
+emptyFunction.thatReturnsNull = makeEmptyFunction(null);
+emptyFunction.thatReturnsThis = function () {
+  return this;
+};
+emptyFunction.thatReturnsArgument = function (arg) {
+  return arg;
+};
+
+var emptyFunction_1 = emptyFunction;
+
+/**
+ * Copyright (c) 2014-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+
+
+/**
+ * Similar to invariant but only logs a warning if the condition is not met.
+ * This can be used to log issues in development environments in critical
+ * paths. Removing the logging code for production environments will keep the
+ * same logic and follow the same code paths.
+ */
+
+var warning = emptyFunction_1;
+
+{
+  var printWarning = function printWarning(format) {
+    for (var _len = arguments.length, args = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+      args[_key - 1] = arguments[_key];
+    }
+
+    var argIndex = 0;
+    var message = 'Warning: ' + format.replace(/%s/g, function () {
+      return args[argIndex++];
+    });
+    if (typeof console !== 'undefined') {
+      console.error(message);
+    }
+    try {
+      // --- Welcome to debugging React ---
+      // This error was thrown as a convenience so that you can use this stack
+      // to find the callsite that caused this warning to fire.
+      throw new Error(message);
+    } catch (x) {}
+  };
+
+  warning = function warning(condition, format) {
+    if (format === undefined) {
+      throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument');
+    }
+
+    if (format.indexOf('Failed Composite propType: ') === 0) {
+      return; // Ignore CompositeComponent proptype check.
+    }
+
+    if (!condition) {
+      for (var _len2 = arguments.length, args = Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) {
+        args[_key2 - 2] = arguments[_key2];
+      }
+
+      printWarning.apply(undefined, [format].concat(args));
+    }
+  };
+}
+
+var warning_1 = warning;
+
+var getFiberCurrentPropsFromNode = null;
+var getInstanceFromNode = null;
+var getNodeFromInstance = null;
+
+var injection$1 = {
+  injectComponentTree: function (Injected) {
+    getFiberCurrentPropsFromNode = Injected.getFiberCurrentPropsFromNode;
+    getInstanceFromNode = Injected.getInstanceFromNode;
+    getNodeFromInstance = Injected.getNodeFromInstance;
+
+    {
+      warning_1(getNodeFromInstance && getInstanceFromNode, 'EventPluginUtils.injection.injectComponentTree(...): Injected ' + 'module is missing getNodeFromInstance or getInstanceFromNode.');
+    }
+  }
+};
+
+
+
+
+
+
+var validateEventDispatches = void 0;
+{
+  validateEventDispatches = function (event) {
+    var dispatchListeners = event._dispatchListeners;
+    var dispatchInstances = event._dispatchInstances;
+
+    var listenersIsArr = Array.isArray(dispatchListeners);
+    var listenersLen = listenersIsArr ? dispatchListeners.length : dispatchListeners ? 1 : 0;
+
+    var instancesIsArr = Array.isArray(dispatchInstances);
+    var instancesLen = instancesIsArr ? dispatchInstances.length : dispatchInstances ? 1 : 0;
+
+    warning_1(instancesIsArr === listenersIsArr && instancesLen === listenersLen, 'EventPluginUtils: Invalid `event`.');
+  };
+}
+
+/**
+ * Dispatch the event to the listener.
+ * @param {SyntheticEvent} event SyntheticEvent to handle
+ * @param {boolean} simulated If the event is simulated (changes exn behavior)
+ * @param {function} listener Application-level callback
+ * @param {*} inst Internal component instance
+ */
+function executeDispatch(event, simulated, listener, inst) {
+  var type = event.type || 'unknown-event';
+  event.currentTarget = getNodeFromInstance(inst);
+  ReactErrorUtils.invokeGuardedCallbackAndCatchFirstError(type, listener, undefined, event);
+  event.currentTarget = null;
+}
+
+/**
+ * Standard/simple iteration through an event's collected dispatches.
+ */
+function executeDispatchesInOrder(event, simulated) {
+  var dispatchListeners = event._dispatchListeners;
+  var dispatchInstances = event._dispatchInstances;
+  {
+    validateEventDispatches(event);
+  }
+  if (Array.isArray(dispatchListeners)) {
+    for (var i = 0; i < dispatchListeners.length; i++) {
+      if (event.isPropagationStopped()) {
+        break;
+      }
+      // Listeners and Instances are two parallel arrays that are always in sync.
+      executeDispatch(event, simulated, dispatchListeners[i], dispatchInstances[i]);
+    }
+  } else if (dispatchListeners) {
+    executeDispatch(event, simulated, dispatchListeners, dispatchInstances);
+  }
+  event._dispatchListeners = null;
+  event._dispatchInstances = null;
+}
+
+/**
+ * @see executeDispatchesInOrderStopAtTrueImpl
+ */
+
+
+/**
+ * Execution of a "direct" dispatch - there must be at most one dispatch
+ * accumulated on the event or it is considered an error. It doesn't really make
+ * sense for an event with multiple dispatches (bubbled) to keep track of the
+ * return values at each dispatch execution, but it does tend to make sense when
+ * dealing with "direct" dispatches.
+ *
+ * @return {*} The return value of executing the single dispatch.
+ */
+
+
+/**
+ * @param {SyntheticEvent} event
+ * @return {boolean} True iff number of dispatches accumulated is greater than 0.
+ */
+
+/**
+ * Accumulates items that must not be null or undefined into the first one. This
+ * is used to conserve memory by avoiding array allocations, and thus sacrifices
+ * API cleanness. Since `current` can be null before being passed in and not
+ * null after this function, make sure to assign it back to `current`:
+ *
+ * `a = accumulateInto(a, b);`
+ *
+ * This API should be sparingly used. Try `accumulate` for something cleaner.
+ *
+ * @return {*|array<*>} An accumulation of items.
+ */
+
+function accumulateInto(current, next) {
+  !(next != null) ? invariant_1(false, 'accumulateInto(...): Accumulated items must not be null or undefined.') : void 0;
+
+  if (current == null) {
+    return next;
+  }
+
+  // Both are not empty. Warning: Never call x.concat(y) when you are not
+  // certain that x is an Array (x could be a string with concat method).
+  if (Array.isArray(current)) {
+    if (Array.isArray(next)) {
+      current.push.apply(current, next);
+      return current;
+    }
+    current.push(next);
+    return current;
+  }
+
+  if (Array.isArray(next)) {
+    // A bit too dangerous to mutate `next`.
+    return [current].concat(next);
+  }
+
+  return [current, next];
+}
+
+/**
+ * @param {array} arr an "accumulation" of items which is either an Array or
+ * a single item. Useful when paired with the `accumulate` module. This is a
+ * simple utility that allows us to reason about a collection of items, but
+ * handling the case when there is exactly one item (and we do not need to
+ * allocate an array).
+ * @param {function} cb Callback invoked with each element or a collection.
+ * @param {?} [scope] Scope used as `this` in a callback.
+ */
+function forEachAccumulated(arr, cb, scope) {
+  if (Array.isArray(arr)) {
+    arr.forEach(cb, scope);
+  } else if (arr) {
+    cb.call(scope, arr);
+  }
+}
+
+/**
+ * Internal queue of events that have accumulated their dispatches and are
+ * waiting to have their dispatches executed.
+ */
+var eventQueue = null;
+
+/**
+ * Dispatches an event and releases it back into the pool, unless persistent.
+ *
+ * @param {?object} event Synthetic event to be dispatched.
+ * @param {boolean} simulated If the event is simulated (changes exn behavior)
+ * @private
+ */
+var executeDispatchesAndRelease = function (event, simulated) {
+  if (event) {
+    executeDispatchesInOrder(event, simulated);
+
+    if (!event.isPersistent()) {
+      event.constructor.release(event);
+    }
+  }
+};
+var executeDispatchesAndReleaseSimulated = function (e) {
+  return executeDispatchesAndRelease(e, true);
+};
+var executeDispatchesAndReleaseTopLevel = function (e) {
+  return executeDispatchesAndRelease(e, false);
+};
+
+function isInteractive(tag) {
+  return tag === 'button' || tag === 'input' || tag === 'select' || tag === 'textarea';
+}
+
+function shouldPreventMouseEvent(name, type, props) {
+  switch (name) {
+    case 'onClick':
+    case 'onClickCapture':
+    case 'onDoubleClick':
+    case 'onDoubleClickCapture':
+    case 'onMouseDown':
+    case 'onMouseDownCapture':
+    case 'onMouseMove':
+    case 'onMouseMoveCapture':
+    case 'onMouseUp':
+    case 'onMouseUpCapture':
+      return !!(props.disabled && isInteractive(type));
+    default:
+      return false;
+  }
+}
+
+/**
+ * This is a unified interface for event plugins to be installed and configured.
+ *
+ * Event plugins can implement the following properties:
+ *
+ *   `extractEvents` {function(string, DOMEventTarget, string, object): *}
+ *     Required. When a top-level event is fired, this method is expected to
+ *     extract synthetic events that will in turn be queued and dispatched.
+ *
+ *   `eventTypes` {object}
+ *     Optional, plugins that fire events must publish a mapping of registration
+ *     names that are used to register listeners. Values of this mapping must
+ *     be objects that contain `registrationName` or `phasedRegistrationNames`.
+ *
+ *   `executeDispatch` {function(object, function, string)}
+ *     Optional, allows plugins to override how an event gets dispatched. By
+ *     default, the listener is simply invoked.
+ *
+ * Each plugin that is injected into `EventsPluginHub` is immediately operable.
+ *
+ * @public
+ */
+
+/**
+ * Methods for injecting dependencies.
+ */
+var injection = {
+  /**
+   * @param {array} InjectedEventPluginOrder
+   * @public
+   */
+  injectEventPluginOrder: injectEventPluginOrder,
+
+  /**
+   * @param {object} injectedNamesToPlugins Map from names to plugin modules.
+   */
+  injectEventPluginsByName: injectEventPluginsByName
+};
+
+/**
+ * @param {object} inst The instance, which is the source of events.
+ * @param {string} registrationName Name of listener (e.g. `onClick`).
+ * @return {?function} The stored callback.
+ */
+function getListener(inst, registrationName) {
+  var listener = void 0;
+
+  // TODO: shouldPreventMouseEvent is DOM-specific and definitely should not
+  // live here; needs to be moved to a better place soon
+  var stateNode = inst.stateNode;
+  if (!stateNode) {
+    // Work in progress (ex: onload events in incremental mode).
+    return null;
+  }
+  var props = getFiberCurrentPropsFromNode(stateNode);
+  if (!props) {
+    // Work in progress.
+    return null;
+  }
+  listener = props[registrationName];
+  if (shouldPreventMouseEvent(registrationName, inst.type, props)) {
+    return null;
+  }
+  !(!listener || typeof listener === 'function') ? invariant_1(false, 'Expected `%s` listener to be a function, instead got a value of `%s` type.', registrationName, typeof listener) : void 0;
+  return listener;
+}
+
+/**
+ * Allows registered plugins an opportunity to extract events from top-level
+ * native browser events.
+ *
+ * @return {*} An accumulation of synthetic events.
+ * @internal
+ */
+function extractEvents(topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+  var events = null;
+  for (var i = 0; i < plugins.length; i++) {
+    // Not every plugin in the ordering may be loaded at runtime.
+    var possiblePlugin = plugins[i];
+    if (possiblePlugin) {
+      var extractedEvents = possiblePlugin.extractEvents(topLevelType, targetInst, nativeEvent, nativeEventTarget);
+      if (extractedEvents) {
+        events = accumulateInto(events, extractedEvents);
+      }
+    }
+  }
+  return events;
+}
+
+function runEventsInBatch(events, simulated) {
+  if (events !== null) {
+    eventQueue = accumulateInto(eventQueue, events);
+  }
+
+  // Set `eventQueue` to null before processing it so that we can tell if more
+  // events get enqueued while processing.
+  var processingEventQueue = eventQueue;
+  eventQueue = null;
+
+  if (!processingEventQueue) {
+    return;
+  }
+
+  if (simulated) {
+    forEachAccumulated(processingEventQueue, executeDispatchesAndReleaseSimulated);
+  } else {
+    forEachAccumulated(processingEventQueue, executeDispatchesAndReleaseTopLevel);
+  }
+  !!eventQueue ? invariant_1(false, 'processEventQueue(): Additional events were enqueued while processing an event queue. Support for this has not yet been implemented.') : void 0;
+  // This would be a good time to rethrow if any of the event handlers threw.
+  ReactErrorUtils.rethrowCaughtError();
+}
+
+function runExtractedEventsInBatch(topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+  var events = extractEvents(topLevelType, targetInst, nativeEvent, nativeEventTarget);
+  runEventsInBatch(events, false);
+}
+
+var EventPluginHub = Object.freeze({
+	injection: injection,
+	getListener: getListener,
+	runEventsInBatch: runEventsInBatch,
+	runExtractedEventsInBatch: runExtractedEventsInBatch
+});
+
+var IndeterminateComponent = 0; // Before we know whether it is functional or class
+var FunctionalComponent = 1;
+var ClassComponent = 2;
+var HostRoot = 3; // Root of a host tree. Could be nested inside another node.
+var HostPortal = 4; // A subtree. Could be an entry point to a different renderer.
+var HostComponent = 5;
+var HostText = 6;
+var CallComponent = 7;
+var CallHandlerPhase = 8;
+var ReturnComponent = 9;
+var Fragment = 10;
+var Mode = 11;
+var ContextConsumer = 12;
+var ContextProvider = 13;
+var ForwardRef = 14;
+
+var randomKey = Math.random().toString(36).slice(2);
+var internalInstanceKey = '__reactInternalInstance$' + randomKey;
+var internalEventHandlersKey = '__reactEventHandlers$' + randomKey;
+
+function precacheFiberNode$1(hostInst, node) {
+  node[internalInstanceKey] = hostInst;
+}
+
+/**
+ * Given a DOM node, return the closest ReactDOMComponent or
+ * ReactDOMTextComponent instance ancestor.
+ */
+function getClosestInstanceFromNode(node) {
+  if (node[internalInstanceKey]) {
+    return node[internalInstanceKey];
+  }
+
+  while (!node[internalInstanceKey]) {
+    if (node.parentNode) {
+      node = node.parentNode;
+    } else {
+      // Top of the tree. This node must not be part of a React tree (or is
+      // unmounted, potentially).
+      return null;
+    }
+  }
+
+  var inst = node[internalInstanceKey];
+  if (inst.tag === HostComponent || inst.tag === HostText) {
+    // In Fiber, this will always be the deepest root.
+    return inst;
+  }
+
+  return null;
+}
+
+/**
+ * Given a DOM node, return the ReactDOMComponent or ReactDOMTextComponent
+ * instance, or null if the node was not rendered by this React.
+ */
+function getInstanceFromNode$1(node) {
+  var inst = node[internalInstanceKey];
+  if (inst) {
+    if (inst.tag === HostComponent || inst.tag === HostText) {
+      return inst;
+    } else {
+      return null;
+    }
+  }
+  return null;
+}
+
+/**
+ * Given a ReactDOMComponent or ReactDOMTextComponent, return the corresponding
+ * DOM node.
+ */
+function getNodeFromInstance$1(inst) {
+  if (inst.tag === HostComponent || inst.tag === HostText) {
+    // In Fiber this, is just the state node right now. We assume it will be
+    // a host component or host text.
+    return inst.stateNode;
+  }
+
+  // Without this first invariant, passing a non-DOM-component triggers the next
+  // invariant for a missing parent, which is super confusing.
+  invariant_1(false, 'getNodeFromInstance: Invalid argument.');
+}
+
+function getFiberCurrentPropsFromNode$1(node) {
+  return node[internalEventHandlersKey] || null;
+}
+
+function updateFiberProps$1(node, props) {
+  node[internalEventHandlersKey] = props;
+}
+
+var ReactDOMComponentTree = Object.freeze({
+	precacheFiberNode: precacheFiberNode$1,
+	getClosestInstanceFromNode: getClosestInstanceFromNode,
+	getInstanceFromNode: getInstanceFromNode$1,
+	getNodeFromInstance: getNodeFromInstance$1,
+	getFiberCurrentPropsFromNode: getFiberCurrentPropsFromNode$1,
+	updateFiberProps: updateFiberProps$1
+});
+
+function getParent(inst) {
+  do {
+    inst = inst['return'];
+    // TODO: If this is a HostRoot we might want to bail out.
+    // That is depending on if we want nested subtrees (layers) to bubble
+    // events to their parent. We could also go through parentNode on the
+    // host node but that wouldn't work for React Native and doesn't let us
+    // do the portal feature.
+  } while (inst && inst.tag !== HostComponent);
+  if (inst) {
+    return inst;
+  }
+  return null;
+}
+
+/**
+ * Return the lowest common ancestor of A and B, or null if they are in
+ * different trees.
+ */
+function getLowestCommonAncestor(instA, instB) {
+  var depthA = 0;
+  for (var tempA = instA; tempA; tempA = getParent(tempA)) {
+    depthA++;
+  }
+  var depthB = 0;
+  for (var tempB = instB; tempB; tempB = getParent(tempB)) {
+    depthB++;
+  }
+
+  // If A is deeper, crawl up.
+  while (depthA - depthB > 0) {
+    instA = getParent(instA);
+    depthA--;
+  }
+
+  // If B is deeper, crawl up.
+  while (depthB - depthA > 0) {
+    instB = getParent(instB);
+    depthB--;
+  }
+
+  // Walk in lockstep until we find a match.
+  var depth = depthA;
+  while (depth--) {
+    if (instA === instB || instA === instB.alternate) {
+      return instA;
+    }
+    instA = getParent(instA);
+    instB = getParent(instB);
+  }
+  return null;
+}
+
+/**
+ * Return if A is an ancestor of B.
+ */
+
+
+/**
+ * Return the parent instance of the passed-in instance.
+ */
+function getParentInstance(inst) {
+  return getParent(inst);
+}
+
+/**
+ * Simulates the traversal of a two-phase, capture/bubble event dispatch.
+ */
+function traverseTwoPhase(inst, fn, arg) {
+  var path = [];
+  while (inst) {
+    path.push(inst);
+    inst = getParent(inst);
+  }
+  var i = void 0;
+  for (i = path.length; i-- > 0;) {
+    fn(path[i], 'captured', arg);
+  }
+  for (i = 0; i < path.length; i++) {
+    fn(path[i], 'bubbled', arg);
+  }
+}
+
+/**
+ * Traverses the ID hierarchy and invokes the supplied `cb` on any IDs that
+ * should would receive a `mouseEnter` or `mouseLeave` event.
+ *
+ * Does not invoke the callback on the nearest common ancestor because nothing
+ * "entered" or "left" that element.
+ */
+function traverseEnterLeave(from, to, fn, argFrom, argTo) {
+  var common = from && to ? getLowestCommonAncestor(from, to) : null;
+  var pathFrom = [];
+  while (true) {
+    if (!from) {
+      break;
+    }
+    if (from === common) {
+      break;
+    }
+    var alternate = from.alternate;
+    if (alternate !== null && alternate === common) {
+      break;
+    }
+    pathFrom.push(from);
+    from = getParent(from);
+  }
+  var pathTo = [];
+  while (true) {
+    if (!to) {
+      break;
+    }
+    if (to === common) {
+      break;
+    }
+    var _alternate = to.alternate;
+    if (_alternate !== null && _alternate === common) {
+      break;
+    }
+    pathTo.push(to);
+    to = getParent(to);
+  }
+  for (var i = 0; i < pathFrom.length; i++) {
+    fn(pathFrom[i], 'bubbled', argFrom);
+  }
+  for (var _i = pathTo.length; _i-- > 0;) {
+    fn(pathTo[_i], 'captured', argTo);
+  }
+}
+
+/**
+ * Some event types have a notion of different registration names for different
+ * "phases" of propagation. This finds listeners by a given phase.
+ */
+function listenerAtPhase(inst, event, propagationPhase) {
+  var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];
+  return getListener(inst, registrationName);
+}
+
+/**
+ * A small set of propagation patterns, each of which will accept a small amount
+ * of information, and generate a set of "dispatch ready event objects" - which
+ * are sets of events that have already been annotated with a set of dispatched
+ * listener functions/ids. The API is designed this way to discourage these
+ * propagation strategies from actually executing the dispatches, since we
+ * always want to collect the entire set of dispatches before executing even a
+ * single one.
+ */
+
+/**
+ * Tags a `SyntheticEvent` with dispatched listeners. Creating this function
+ * here, allows us to not have to bind or create functions for each event.
+ * Mutating the event's members allows us to not have to create a wrapping
+ * "dispatch" object that pairs the event with the listener.
+ */
+function accumulateDirectionalDispatches(inst, phase, event) {
+  {
+    warning_1(inst, 'Dispatching inst must not be null');
+  }
+  var listener = listenerAtPhase(inst, event, phase);
+  if (listener) {
+    event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);
+    event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);
+  }
+}
+
+/**
+ * Collect dispatches (must be entirely collected before dispatching - see unit
+ * tests). Lazily allocate the array to conserve memory.  We must loop through
+ * each event and perform the traversal for each one. We cannot perform a
+ * single traversal for the entire collection of events because each event may
+ * have a different target.
+ */
+function accumulateTwoPhaseDispatchesSingle(event) {
+  if (event && event.dispatchConfig.phasedRegistrationNames) {
+    traverseTwoPhase(event._targetInst, accumulateDirectionalDispatches, event);
+  }
+}
+
+/**
+ * Same as `accumulateTwoPhaseDispatchesSingle`, but skips over the targetID.
+ */
+function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {
+  if (event && event.dispatchConfig.phasedRegistrationNames) {
+    var targetInst = event._targetInst;
+    var parentInst = targetInst ? getParentInstance(targetInst) : null;
+    traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);
+  }
+}
+
+/**
+ * Accumulates without regard to direction, does not look for phased
+ * registration names. Same as `accumulateDirectDispatchesSingle` but without
+ * requiring that the `dispatchMarker` be the same as the dispatched ID.
+ */
+function accumulateDispatches(inst, ignoredDirection, event) {
+  if (inst && event && event.dispatchConfig.registrationName) {
+    var registrationName = event.dispatchConfig.registrationName;
+    var listener = getListener(inst, registrationName);
+    if (listener) {
+      event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);
+      event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);
+    }
+  }
+}
+
+/**
+ * Accumulates dispatches on an `SyntheticEvent`, but only for the
+ * `dispatchMarker`.
+ * @param {SyntheticEvent} event
+ */
+function accumulateDirectDispatchesSingle(event) {
+  if (event && event.dispatchConfig.registrationName) {
+    accumulateDispatches(event._targetInst, null, event);
+  }
+}
+
+function accumulateTwoPhaseDispatches(events) {
+  forEachAccumulated(events, accumulateTwoPhaseDispatchesSingle);
+}
+
+function accumulateTwoPhaseDispatchesSkipTarget(events) {
+  forEachAccumulated(events, accumulateTwoPhaseDispatchesSingleSkipTarget);
+}
+
+function accumulateEnterLeaveDispatches(leave, enter, from, to) {
+  traverseEnterLeave(from, to, accumulateDispatches, leave, enter);
+}
+
+function accumulateDirectDispatches(events) {
+  forEachAccumulated(events, accumulateDirectDispatchesSingle);
+}
+
+var EventPropagators = Object.freeze({
+	accumulateTwoPhaseDispatches: accumulateTwoPhaseDispatches,
+	accumulateTwoPhaseDispatchesSkipTarget: accumulateTwoPhaseDispatchesSkipTarget,
+	accumulateEnterLeaveDispatches: accumulateEnterLeaveDispatches,
+	accumulateDirectDispatches: accumulateDirectDispatches
+});
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+var canUseDOM = !!(typeof window !== 'undefined' && window.document && window.document.createElement);
+
+/**
+ * Simple, lightweight module assisting with the detection and context of
+ * Worker. Helps avoid circular dependencies and allows code to reason about
+ * whether or not they are in a Worker, even if they never include the main
+ * `ReactWorker` dependency.
+ */
+var ExecutionEnvironment = {
+
+  canUseDOM: canUseDOM,
+
+  canUseWorkers: typeof Worker !== 'undefined',
+
+  canUseEventListeners: canUseDOM && !!(window.addEventListener || window.attachEvent),
+
+  canUseViewport: canUseDOM && !!window.screen,
+
+  isInWorker: !canUseDOM // For now, this is true - might change in the future.
+
+};
+
+var ExecutionEnvironment_1 = ExecutionEnvironment;
+
+var contentKey = null;
+
+/**
+ * Gets the key used to access text content on a DOM node.
+ *
+ * @return {?string} Key used to access text content.
+ * @internal
+ */
+function getTextContentAccessor() {
+  if (!contentKey && ExecutionEnvironment_1.canUseDOM) {
+    // Prefer textContent to innerText because many browsers support both but
+    // SVG <text> elements don't support innerText even when <div> does.
+    contentKey = 'textContent' in document.documentElement ? 'textContent' : 'innerText';
+  }
+  return contentKey;
+}
+
+/**
+ * This helper object stores information about text content of a target node,
+ * allowing comparison of content before and after a given event.
+ *
+ * Identify the node where selection currently begins, then observe
+ * both its text content and its current position in the DOM. Since the
+ * browser may natively replace the target node during composition, we can
+ * use its position to find its replacement.
+ *
+ *
+ */
+var compositionState = {
+  _root: null,
+  _startText: null,
+  _fallbackText: null
+};
+
+function initialize(nativeEventTarget) {
+  compositionState._root = nativeEventTarget;
+  compositionState._startText = getText();
+  return true;
+}
+
+function reset() {
+  compositionState._root = null;
+  compositionState._startText = null;
+  compositionState._fallbackText = null;
+}
+
+function getData() {
+  if (compositionState._fallbackText) {
+    return compositionState._fallbackText;
+  }
+
+  var start = void 0;
+  var startValue = compositionState._startText;
+  var startLength = startValue.length;
+  var end = void 0;
+  var endValue = getText();
+  var endLength = endValue.length;
+
+  for (start = 0; start < startLength; start++) {
+    if (startValue[start] !== endValue[start]) {
+      break;
+    }
+  }
+
+  var minEnd = startLength - start;
+  for (end = 1; end <= minEnd; end++) {
+    if (startValue[startLength - end] !== endValue[endLength - end]) {
+      break;
+    }
+  }
+
+  var sliceTail = end > 1 ? 1 - end : undefined;
+  compositionState._fallbackText = endValue.slice(start, sliceTail);
+  return compositionState._fallbackText;
+}
+
+function getText() {
+  if ('value' in compositionState._root) {
+    return compositionState._root.value;
+  }
+  return compositionState._root[getTextContentAccessor()];
+}
+
+var ReactInternals = React.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
+
+var _assign = ReactInternals.assign;
+
+/* eslint valid-typeof: 0 */
+
+var didWarnForAddedNewProperty = false;
+var EVENT_POOL_SIZE = 10;
+
+var shouldBeReleasedProperties = ['dispatchConfig', '_targetInst', 'nativeEvent', 'isDefaultPrevented', 'isPropagationStopped', '_dispatchListeners', '_dispatchInstances'];
+
+/**
+ * @interface Event
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/
+ */
+var EventInterface = {
+  type: null,
+  target: null,
+  // currentTarget is set when dispatching; no use in copying it here
+  currentTarget: emptyFunction_1.thatReturnsNull,
+  eventPhase: null,
+  bubbles: null,
+  cancelable: null,
+  timeStamp: function (event) {
+    return event.timeStamp || Date.now();
+  },
+  defaultPrevented: null,
+  isTrusted: null
+};
+
+/**
+ * Synthetic events are dispatched by event plugins, typically in response to a
+ * top-level event delegation handler.
+ *
+ * These systems should generally use pooling to reduce the frequency of garbage
+ * collection. The system should check `isPersistent` to determine whether the
+ * event should be released into the pool after being dispatched. Users that
+ * need a persisted event should invoke `persist`.
+ *
+ * Synthetic events (and subclasses) implement the DOM Level 3 Events API by
+ * normalizing browser quirks. Subclasses do not necessarily have to implement a
+ * DOM interface; custom application-specific events can also subclass this.
+ *
+ * @param {object} dispatchConfig Configuration used to dispatch this event.
+ * @param {*} targetInst Marker identifying the event target.
+ * @param {object} nativeEvent Native browser event.
+ * @param {DOMEventTarget} nativeEventTarget Target node.
+ */
+function SyntheticEvent(dispatchConfig, targetInst, nativeEvent, nativeEventTarget) {
+  {
+    // these have a getter/setter for warnings
+    delete this.nativeEvent;
+    delete this.preventDefault;
+    delete this.stopPropagation;
+  }
+
+  this.dispatchConfig = dispatchConfig;
+  this._targetInst = targetInst;
+  this.nativeEvent = nativeEvent;
+
+  var Interface = this.constructor.Interface;
+  for (var propName in Interface) {
+    if (!Interface.hasOwnProperty(propName)) {
+      continue;
+    }
+    {
+      delete this[propName]; // this has a getter/setter for warnings
+    }
+    var normalize = Interface[propName];
+    if (normalize) {
+      this[propName] = normalize(nativeEvent);
+    } else {
+      if (propName === 'target') {
+        this.target = nativeEventTarget;
+      } else {
+        this[propName] = nativeEvent[propName];
+      }
+    }
+  }
+
+  var defaultPrevented = nativeEvent.defaultPrevented != null ? nativeEvent.defaultPrevented : nativeEvent.returnValue === false;
+  if (defaultPrevented) {
+    this.isDefaultPrevented = emptyFunction_1.thatReturnsTrue;
+  } else {
+    this.isDefaultPrevented = emptyFunction_1.thatReturnsFalse;
+  }
+  this.isPropagationStopped = emptyFunction_1.thatReturnsFalse;
+  return this;
+}
+
+_assign(SyntheticEvent.prototype, {
+  preventDefault: function () {
+    this.defaultPrevented = true;
+    var event = this.nativeEvent;
+    if (!event) {
+      return;
+    }
+
+    if (event.preventDefault) {
+      event.preventDefault();
+    } else if (typeof event.returnValue !== 'unknown') {
+      event.returnValue = false;
+    }
+    this.isDefaultPrevented = emptyFunction_1.thatReturnsTrue;
+  },
+
+  stopPropagation: function () {
+    var event = this.nativeEvent;
+    if (!event) {
+      return;
+    }
+
+    if (event.stopPropagation) {
+      event.stopPropagation();
+    } else if (typeof event.cancelBubble !== 'unknown') {
+      // The ChangeEventPlugin registers a "propertychange" event for
+      // IE. This event does not support bubbling or cancelling, and
+      // any references to cancelBubble throw "Member not found".  A
+      // typeof check of "unknown" circumvents this issue (and is also
+      // IE specific).
+      event.cancelBubble = true;
+    }
+
+    this.isPropagationStopped = emptyFunction_1.thatReturnsTrue;
+  },
+
+  /**
+   * We release all dispatched `SyntheticEvent`s after each event loop, adding
+   * them back into the pool. This allows a way to hold onto a reference that
+   * won't be added back into the pool.
+   */
+  persist: function () {
+    this.isPersistent = emptyFunction_1.thatReturnsTrue;
+  },
+
+  /**
+   * Checks if this event should be released back into the pool.
+   *
+   * @return {boolean} True if this should not be released, false otherwise.
+   */
+  isPersistent: emptyFunction_1.thatReturnsFalse,
+
+  /**
+   * `PooledClass` looks for `destructor` on each instance it releases.
+   */
+  destructor: function () {
+    var Interface = this.constructor.Interface;
+    for (var propName in Interface) {
+      {
+        Object.defineProperty(this, propName, getPooledWarningPropertyDefinition(propName, Interface[propName]));
+      }
+    }
+    for (var i = 0; i < shouldBeReleasedProperties.length; i++) {
+      this[shouldBeReleasedProperties[i]] = null;
+    }
+    {
+      Object.defineProperty(this, 'nativeEvent', getPooledWarningPropertyDefinition('nativeEvent', null));
+      Object.defineProperty(this, 'preventDefault', getPooledWarningPropertyDefinition('preventDefault', emptyFunction_1));
+      Object.defineProperty(this, 'stopPropagation', getPooledWarningPropertyDefinition('stopPropagation', emptyFunction_1));
+    }
+  }
+});
+
+SyntheticEvent.Interface = EventInterface;
+
+/**
+ * Helper to reduce boilerplate when creating subclasses.
+ */
+SyntheticEvent.extend = function (Interface) {
+  var Super = this;
+
+  var E = function () {};
+  E.prototype = Super.prototype;
+  var prototype = new E();
+
+  function Class() {
+    return Super.apply(this, arguments);
+  }
+  _assign(prototype, Class.prototype);
+  Class.prototype = prototype;
+  Class.prototype.constructor = Class;
+
+  Class.Interface = _assign({}, Super.Interface, Interface);
+  Class.extend = Super.extend;
+  addEventPoolingTo(Class);
+
+  return Class;
+};
+
+/** Proxying after everything set on SyntheticEvent
+ * to resolve Proxy issue on some WebKit browsers
+ * in which some Event properties are set to undefined (GH#10010)
+ */
+{
+  var isProxySupported = typeof Proxy === 'function' &&
+  // https://github.com/facebook/react/issues/12011
+  !Object.isSealed(new Proxy({}, {}));
+
+  if (isProxySupported) {
+    /*eslint-disable no-func-assign */
+    SyntheticEvent = new Proxy(SyntheticEvent, {
+      construct: function (target, args) {
+        return this.apply(target, Object.create(target.prototype), args);
+      },
+      apply: function (constructor, that, args) {
+        return new Proxy(constructor.apply(that, args), {
+          set: function (target, prop, value) {
+            if (prop !== 'isPersistent' && !target.constructor.Interface.hasOwnProperty(prop) && shouldBeReleasedProperties.indexOf(prop) === -1) {
+              warning_1(didWarnForAddedNewProperty || target.isPersistent(), "This synthetic event is reused for performance reasons. If you're " + "seeing this, you're adding a new property in the synthetic event object. " + 'The property is never released. See ' + 'https://fb.me/react-event-pooling for more information.');
+              didWarnForAddedNewProperty = true;
+            }
+            target[prop] = value;
+            return true;
+          }
+        });
+      }
+    });
+    /*eslint-enable no-func-assign */
+  }
+}
+
+addEventPoolingTo(SyntheticEvent);
+
+/**
+ * Helper to nullify syntheticEvent instance properties when destructing
+ *
+ * @param {String} propName
+ * @param {?object} getVal
+ * @return {object} defineProperty object
+ */
+function getPooledWarningPropertyDefinition(propName, getVal) {
+  var isFunction = typeof getVal === 'function';
+  return {
+    configurable: true,
+    set: set,
+    get: get
+  };
+
+  function set(val) {
+    var action = isFunction ? 'setting the method' : 'setting the property';
+    warn(action, 'This is effectively a no-op');
+    return val;
+  }
+
+  function get() {
+    var action = isFunction ? 'accessing the method' : 'accessing the property';
+    var result = isFunction ? 'This is a no-op function' : 'This is set to null';
+    warn(action, result);
+    return getVal;
+  }
+
+  function warn(action, result) {
+    var warningCondition = false;
+    warning_1(warningCondition, "This synthetic event is reused for performance reasons. If you're seeing this, " + "you're %s `%s` on a released/nullified synthetic event. %s. " + 'If you must keep the original synthetic event around, use event.persist(). ' + 'See https://fb.me/react-event-pooling for more information.', action, propName, result);
+  }
+}
+
+function getPooledEvent(dispatchConfig, targetInst, nativeEvent, nativeInst) {
+  var EventConstructor = this;
+  if (EventConstructor.eventPool.length) {
+    var instance = EventConstructor.eventPool.pop();
+    EventConstructor.call(instance, dispatchConfig, targetInst, nativeEvent, nativeInst);
+    return instance;
+  }
+  return new EventConstructor(dispatchConfig, targetInst, nativeEvent, nativeInst);
+}
+
+function releasePooledEvent(event) {
+  var EventConstructor = this;
+  !(event instanceof EventConstructor) ? invariant_1(false, 'Trying to release an event instance  into a pool of a different type.') : void 0;
+  event.destructor();
+  if (EventConstructor.eventPool.length < EVENT_POOL_SIZE) {
+    EventConstructor.eventPool.push(event);
+  }
+}
+
+function addEventPoolingTo(EventConstructor) {
+  EventConstructor.eventPool = [];
+  EventConstructor.getPooled = getPooledEvent;
+  EventConstructor.release = releasePooledEvent;
+}
+
+var SyntheticEvent$1 = SyntheticEvent;
+
+/**
+ * @interface Event
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/#events-compositionevents
+ */
+var SyntheticCompositionEvent = SyntheticEvent$1.extend({
+  data: null
+});
+
+/**
+ * @interface Event
+ * @see http://www.w3.org/TR/2013/WD-DOM-Level-3-Events-20131105
+ *      /#events-inputevents
+ */
+var SyntheticInputEvent = SyntheticEvent$1.extend({
+  data: null
+});
+
+var END_KEYCODES = [9, 13, 27, 32]; // Tab, Return, Esc, Space
+var START_KEYCODE = 229;
+
+var canUseCompositionEvent = ExecutionEnvironment_1.canUseDOM && 'CompositionEvent' in window;
+
+var documentMode = null;
+if (ExecutionEnvironment_1.canUseDOM && 'documentMode' in document) {
+  documentMode = document.documentMode;
+}
+
+// Webkit offers a very useful `textInput` event that can be used to
+// directly represent `beforeInput`. The IE `textinput` event is not as
+// useful, so we don't use it.
+var canUseTextInputEvent = ExecutionEnvironment_1.canUseDOM && 'TextEvent' in window && !documentMode;
+
+// In IE9+, we have access to composition events, but the data supplied
+// by the native compositionend event may be incorrect. Japanese ideographic
+// spaces, for instance (\u3000) are not recorded correctly.
+var useFallbackCompositionData = ExecutionEnvironment_1.canUseDOM && (!canUseCompositionEvent || documentMode && documentMode > 8 && documentMode <= 11);
+
+var SPACEBAR_CODE = 32;
+var SPACEBAR_CHAR = String.fromCharCode(SPACEBAR_CODE);
+
+// Events and their corresponding property names.
+var eventTypes = {
+  beforeInput: {
+    phasedRegistrationNames: {
+      bubbled: 'onBeforeInput',
+      captured: 'onBeforeInputCapture'
+    },
+    dependencies: ['topCompositionEnd', 'topKeyPress', 'topTextInput', 'topPaste']
+  },
+  compositionEnd: {
+    phasedRegistrationNames: {
+      bubbled: 'onCompositionEnd',
+      captured: 'onCompositionEndCapture'
+    },
+    dependencies: ['topBlur', 'topCompositionEnd', 'topKeyDown', 'topKeyPress', 'topKeyUp', 'topMouseDown']
+  },
+  compositionStart: {
+    phasedRegistrationNames: {
+      bubbled: 'onCompositionStart',
+      captured: 'onCompositionStartCapture'
+    },
+    dependencies: ['topBlur', 'topCompositionStart', 'topKeyDown', 'topKeyPress', 'topKeyUp', 'topMouseDown']
+  },
+  compositionUpdate: {
+    phasedRegistrationNames: {
+      bubbled: 'onCompositionUpdate',
+      captured: 'onCompositionUpdateCapture'
+    },
+    dependencies: ['topBlur', 'topCompositionUpdate', 'topKeyDown', 'topKeyPress', 'topKeyUp', 'topMouseDown']
+  }
+};
+
+// Track whether we've ever handled a keypress on the space key.
+var hasSpaceKeypress = false;
+
+/**
+ * Return whether a native keypress event is assumed to be a command.
+ * This is required because Firefox fires `keypress` events for key commands
+ * (cut, copy, select-all, etc.) even though no character is inserted.
+ */
+function isKeypressCommand(nativeEvent) {
+  return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&
+  // ctrlKey && altKey is equivalent to AltGr, and is not a command.
+  !(nativeEvent.ctrlKey && nativeEvent.altKey);
+}
+
+/**
+ * Translate native top level events into event types.
+ *
+ * @param {string} topLevelType
+ * @return {object}
+ */
+function getCompositionEventType(topLevelType) {
+  switch (topLevelType) {
+    case 'topCompositionStart':
+      return eventTypes.compositionStart;
+    case 'topCompositionEnd':
+      return eventTypes.compositionEnd;
+    case 'topCompositionUpdate':
+      return eventTypes.compositionUpdate;
+  }
+}
+
+/**
+ * Does our fallback best-guess model think this event signifies that
+ * composition has begun?
+ *
+ * @param {string} topLevelType
+ * @param {object} nativeEvent
+ * @return {boolean}
+ */
+function isFallbackCompositionStart(topLevelType, nativeEvent) {
+  return topLevelType === 'topKeyDown' && nativeEvent.keyCode === START_KEYCODE;
+}
+
+/**
+ * Does our fallback mode think that this event is the end of composition?
+ *
+ * @param {string} topLevelType
+ * @param {object} nativeEvent
+ * @return {boolean}
+ */
+function isFallbackCompositionEnd(topLevelType, nativeEvent) {
+  switch (topLevelType) {
+    case 'topKeyUp':
+      // Command keys insert or clear IME input.
+      return END_KEYCODES.indexOf(nativeEvent.keyCode) !== -1;
+    case 'topKeyDown':
+      // Expect IME keyCode on each keydown. If we get any other
+      // code we must have exited earlier.
+      return nativeEvent.keyCode !== START_KEYCODE;
+    case 'topKeyPress':
+    case 'topMouseDown':
+    case 'topBlur':
+      // Events are not possible without cancelling IME.
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Google Input Tools provides composition data via a CustomEvent,
+ * with the `data` property populated in the `detail` object. If this
+ * is available on the event object, use it. If not, this is a plain
+ * composition event and we have nothing special to extract.
+ *
+ * @param {object} nativeEvent
+ * @return {?string}
+ */
+function getDataFromCustomEvent(nativeEvent) {
+  var detail = nativeEvent.detail;
+  if (typeof detail === 'object' && 'data' in detail) {
+    return detail.data;
+  }
+  return null;
+}
+
+// Track the current IME composition status, if any.
+var isComposing = false;
+
+/**
+ * @return {?object} A SyntheticCompositionEvent.
+ */
+function extractCompositionEvent(topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+  var eventType = void 0;
+  var fallbackData = void 0;
+
+  if (canUseCompositionEvent) {
+    eventType = getCompositionEventType(topLevelType);
+  } else if (!isComposing) {
+    if (isFallbackCompositionStart(topLevelType, nativeEvent)) {
+      eventType = eventTypes.compositionStart;
+    }
+  } else if (isFallbackCompositionEnd(topLevelType, nativeEvent)) {
+    eventType = eventTypes.compositionEnd;
+  }
+
+  if (!eventType) {
+    return null;
+  }
+
+  if (useFallbackCompositionData) {
+    // The current composition is stored statically and must not be
+    // overwritten while composition continues.
+    if (!isComposing && eventType === eventTypes.compositionStart) {
+      isComposing = initialize(nativeEventTarget);
+    } else if (eventType === eventTypes.compositionEnd) {
+      if (isComposing) {
+        fallbackData = getData();
+      }
+    }
+  }
+
+  var event = SyntheticCompositionEvent.getPooled(eventType, targetInst, nativeEvent, nativeEventTarget);
+
+  if (fallbackData) {
+    // Inject data generated from fallback path into the synthetic event.
+    // This matches the property of native CompositionEventInterface.
+    event.data = fallbackData;
+  } else {
+    var customData = getDataFromCustomEvent(nativeEvent);
+    if (customData !== null) {
+      event.data = customData;
+    }
+  }
+
+  accumulateTwoPhaseDispatches(event);
+  return event;
+}
+
+/**
+ * @param {TopLevelTypes} topLevelType Record from `BrowserEventConstants`.
+ * @param {object} nativeEvent Native browser event.
+ * @return {?string} The string corresponding to this `beforeInput` event.
+ */
+function getNativeBeforeInputChars(topLevelType, nativeEvent) {
+  switch (topLevelType) {
+    case 'topCompositionEnd':
+      return getDataFromCustomEvent(nativeEvent);
+    case 'topKeyPress':
+      /**
+       * If native `textInput` events are available, our goal is to make
+       * use of them. However, there is a special case: the spacebar key.
+       * In Webkit, preventing default on a spacebar `textInput` event
+       * cancels character insertion, but it *also* causes the browser
+       * to fall back to its default spacebar behavior of scrolling the
+       * page.
+       *
+       * Tracking at:
+       * https://code.google.com/p/chromium/issues/detail?id=355103
+       *
+       * To avoid this issue, use the keypress event as if no `textInput`
+       * event is available.
+       */
+      var which = nativeEvent.which;
+      if (which !== SPACEBAR_CODE) {
+        return null;
+      }
+
+      hasSpaceKeypress = true;
+      return SPACEBAR_CHAR;
+
+    case 'topTextInput':
+      // Record the characters to be added to the DOM.
+      var chars = nativeEvent.data;
+
+      // If it's a spacebar character, assume that we have already handled
+      // it at the keypress level and bail immediately. Android Chrome
+      // doesn't give us keycodes, so we need to blacklist it.
+      if (chars === SPACEBAR_CHAR && hasSpaceKeypress) {
+        return null;
+      }
+
+      return chars;
+
+    default:
+      // For other native event types, do nothing.
+      return null;
+  }
+}
+
+/**
+ * For browsers that do not provide the `textInput` event, extract the
+ * appropriate string to use for SyntheticInputEvent.
+ *
+ * @param {string} topLevelType Record from `BrowserEventConstants`.
+ * @param {object} nativeEvent Native browser event.
+ * @return {?string} The fallback string for this `beforeInput` event.
+ */
+function getFallbackBeforeInputChars(topLevelType, nativeEvent) {
+  // If we are currently composing (IME) and using a fallback to do so,
+  // try to extract the composed characters from the fallback object.
+  // If composition event is available, we extract a string only at
+  // compositionevent, otherwise extract it at fallback events.
+  if (isComposing) {
+    if (topLevelType === 'topCompositionEnd' || !canUseCompositionEvent && isFallbackCompositionEnd(topLevelType, nativeEvent)) {
+      var chars = getData();
+      reset();
+      isComposing = false;
+      return chars;
+    }
+    return null;
+  }
+
+  switch (topLevelType) {
+    case 'topPaste':
+      // If a paste event occurs after a keypress, throw out the input
+      // chars. Paste events should not lead to BeforeInput events.
+      return null;
+    case 'topKeyPress':
+      /**
+       * As of v27, Firefox may fire keypress events even when no character
+       * will be inserted. A few possibilities:
+       *
+       * - `which` is `0`. Arrow keys, Esc key, etc.
+       *
+       * - `which` is the pressed key code, but no char is available.
+       *   Ex: 'AltGr + d` in Polish. There is no modified character for
+       *   this key combination and no character is inserted into the
+       *   document, but FF fires the keypress for char code `100` anyway.
+       *   No `input` event will occur.
+       *
+       * - `which` is the pressed key code, but a command combination is
+       *   being used. Ex: `Cmd+C`. No character is inserted, and no
+       *   `input` event will occur.
+       */
+      if (!isKeypressCommand(nativeEvent)) {
+        // IE fires the `keypress` event when a user types an emoji via
+        // Touch keyboard of Windows.  In such a case, the `char` property
+        // holds an emoji character like `\uD83D\uDE0A`.  Because its length
+        // is 2, the property `which` does not represent an emoji correctly.
+        // In such a case, we directly return the `char` property instead of
+        // using `which`.
+        if (nativeEvent.char && nativeEvent.char.length > 1) {
+          return nativeEvent.char;
+        } else if (nativeEvent.which) {
+          return String.fromCharCode(nativeEvent.which);
+        }
+      }
+      return null;
+    case 'topCompositionEnd':
+      return useFallbackCompositionData ? null : nativeEvent.data;
+    default:
+      return null;
+  }
+}
+
+/**
+ * Extract a SyntheticInputEvent for `beforeInput`, based on either native
+ * `textInput` or fallback behavior.
+ *
+ * @return {?object} A SyntheticInputEvent.
+ */
+function extractBeforeInputEvent(topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+  var chars = void 0;
+
+  if (canUseTextInputEvent) {
+    chars = getNativeBeforeInputChars(topLevelType, nativeEvent);
+  } else {
+    chars = getFallbackBeforeInputChars(topLevelType, nativeEvent);
+  }
+
+  // If no characters are being inserted, no BeforeInput event should
+  // be fired.
+  if (!chars) {
+    return null;
+  }
+
+  var event = SyntheticInputEvent.getPooled(eventTypes.beforeInput, targetInst, nativeEvent, nativeEventTarget);
+
+  event.data = chars;
+  accumulateTwoPhaseDispatches(event);
+  return event;
+}
+
+/**
+ * Create an `onBeforeInput` event to match
+ * http://www.w3.org/TR/2013/WD-DOM-Level-3-Events-20131105/#events-inputevents.
+ *
+ * This event plugin is based on the native `textInput` event
+ * available in Chrome, Safari, Opera, and IE. This event fires after
+ * `onKeyPress` and `onCompositionEnd`, but before `onInput`.
+ *
+ * `beforeInput` is spec'd but not implemented in any browsers, and
+ * the `input` event does not provide any useful information about what has
+ * actually been added, contrary to the spec. Thus, `textInput` is the best
+ * available event to identify the characters that have actually been inserted
+ * into the target node.
+ *
+ * This plugin is also responsible for emitting `composition` events, thus
+ * allowing us to share composition fallback code for both `beforeInput` and
+ * `composition` event types.
+ */
+var BeforeInputEventPlugin = {
+  eventTypes: eventTypes,
+
+  extractEvents: function (topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+    var composition = extractCompositionEvent(topLevelType, targetInst, nativeEvent, nativeEventTarget);
+
+    var beforeInput = extractBeforeInputEvent(topLevelType, targetInst, nativeEvent, nativeEventTarget);
+
+    if (composition === null) {
+      return beforeInput;
+    }
+
+    if (beforeInput === null) {
+      return composition;
+    }
+
+    return [composition, beforeInput];
+  }
+};
+
+// Use to restore controlled state after a change event has fired.
+
+var fiberHostComponent = null;
+
+var ReactControlledComponentInjection = {
+  injectFiberControlledHostComponent: function (hostComponentImpl) {
+    // The fiber implementation doesn't use dynamic dispatch so we need to
+    // inject the implementation.
+    fiberHostComponent = hostComponentImpl;
+  }
+};
+
+var restoreTarget = null;
+var restoreQueue = null;
+
+function restoreStateOfTarget(target) {
+  // We perform this translation at the end of the event loop so that we
+  // always receive the correct fiber here
+  var internalInstance = getInstanceFromNode(target);
+  if (!internalInstance) {
+    // Unmounted
+    return;
+  }
+  !(fiberHostComponent && typeof fiberHostComponent.restoreControlledState === 'function') ? invariant_1(false, 'Fiber needs to be injected to handle a fiber target for controlled events. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+  var props = getFiberCurrentPropsFromNode(internalInstance.stateNode);
+  fiberHostComponent.restoreControlledState(internalInstance.stateNode, internalInstance.type, props);
+}
+
+var injection$2 = ReactControlledComponentInjection;
+
+function enqueueStateRestore(target) {
+  if (restoreTarget) {
+    if (restoreQueue) {
+      restoreQueue.push(target);
+    } else {
+      restoreQueue = [target];
+    }
+  } else {
+    restoreTarget = target;
+  }
+}
+
+function needsStateRestore() {
+  return restoreTarget !== null || restoreQueue !== null;
+}
+
+function restoreStateIfNeeded() {
+  if (!restoreTarget) {
+    return;
+  }
+  var target = restoreTarget;
+  var queuedTargets = restoreQueue;
+  restoreTarget = null;
+  restoreQueue = null;
+
+  restoreStateOfTarget(target);
+  if (queuedTargets) {
+    for (var i = 0; i < queuedTargets.length; i++) {
+      restoreStateOfTarget(queuedTargets[i]);
+    }
+  }
+}
+
+var ReactControlledComponent = Object.freeze({
+	injection: injection$2,
+	enqueueStateRestore: enqueueStateRestore,
+	needsStateRestore: needsStateRestore,
+	restoreStateIfNeeded: restoreStateIfNeeded
+});
+
+// Used as a way to call batchedUpdates when we don't have a reference to
+// the renderer. Such as when we're dispatching events or if third party
+// libraries need to call batchedUpdates. Eventually, this API will go away when
+// everything is batched by default. We'll then have a similar API to opt-out of
+// scheduled work and instead do synchronous work.
+
+// Defaults
+var _batchedUpdates = function (fn, bookkeeping) {
+  return fn(bookkeeping);
+};
+var _interactiveUpdates = function (fn, a, b) {
+  return fn(a, b);
+};
+var _flushInteractiveUpdates = function () {};
+
+var isBatching = false;
+function batchedUpdates(fn, bookkeeping) {
+  if (isBatching) {
+    // If we are currently inside another batch, we need to wait until it
+    // fully completes before restoring state.
+    return fn(bookkeeping);
+  }
+  isBatching = true;
+  try {
+    return _batchedUpdates(fn, bookkeeping);
+  } finally {
+    // Here we wait until all updates have propagated, which is important
+    // when using controlled components within layers:
+    // https://github.com/facebook/react/issues/1698
+    // Then we restore state of any controlled component.
+    isBatching = false;
+    var controlledComponentsHavePendingUpdates = needsStateRestore();
+    if (controlledComponentsHavePendingUpdates) {
+      // If a controlled event was fired, we may need to restore the state of
+      // the DOM node back to the controlled value. This is necessary when React
+      // bails out of the update without touching the DOM.
+      _flushInteractiveUpdates();
+      restoreStateIfNeeded();
+    }
+  }
+}
+
+function interactiveUpdates(fn, a, b) {
+  return _interactiveUpdates(fn, a, b);
+}
+
+
+
+var injection$3 = {
+  injectRenderer: function (renderer) {
+    _batchedUpdates = renderer.batchedUpdates;
+    _interactiveUpdates = renderer.interactiveUpdates;
+    _flushInteractiveUpdates = renderer.flushInteractiveUpdates;
+  }
+};
+
+/**
+ * @see http://www.whatwg.org/specs/web-apps/current-work/multipage/the-input-element.html#input-type-attr-summary
+ */
+var supportedInputTypes = {
+  color: true,
+  date: true,
+  datetime: true,
+  'datetime-local': true,
+  email: true,
+  month: true,
+  number: true,
+  password: true,
+  range: true,
+  search: true,
+  tel: true,
+  text: true,
+  time: true,
+  url: true,
+  week: true
+};
+
+function isTextInputElement(elem) {
+  var nodeName = elem && elem.nodeName && elem.nodeName.toLowerCase();
+
+  if (nodeName === 'input') {
+    return !!supportedInputTypes[elem.type];
+  }
+
+  if (nodeName === 'textarea') {
+    return true;
+  }
+
+  return false;
+}
+
+/**
+ * HTML nodeType values that represent the type of the node
+ */
+
+var ELEMENT_NODE = 1;
+var TEXT_NODE = 3;
+var COMMENT_NODE = 8;
+var DOCUMENT_NODE = 9;
+var DOCUMENT_FRAGMENT_NODE = 11;
+
+/**
+ * Gets the target node from a native browser event by accounting for
+ * inconsistencies in browser DOM APIs.
+ *
+ * @param {object} nativeEvent Native browser event.
+ * @return {DOMEventTarget} Target node.
+ */
+function getEventTarget(nativeEvent) {
+  var target = nativeEvent.target || window;
+
+  // Normalize SVG <use> element events #4963
+  if (target.correspondingUseElement) {
+    target = target.correspondingUseElement;
+  }
+
+  // Safari may fire events on text nodes (Node.TEXT_NODE is 3).
+  // @see http://www.quirksmode.org/js/events_properties.html
+  return target.nodeType === TEXT_NODE ? target.parentNode : target;
+}
+
+/**
+ * Checks if an event is supported in the current execution environment.
+ *
+ * NOTE: This will not work correctly for non-generic events such as `change`,
+ * `reset`, `load`, `error`, and `select`.
+ *
+ * Borrows from Modernizr.
+ *
+ * @param {string} eventNameSuffix Event name, e.g. "click".
+ * @param {?boolean} capture Check if the capture phase is supported.
+ * @return {boolean} True if the event is supported.
+ * @internal
+ * @license Modernizr 3.0.0pre (Custom Build) | MIT
+ */
+function isEventSupported(eventNameSuffix, capture) {
+  if (!ExecutionEnvironment_1.canUseDOM || capture && !('addEventListener' in document)) {
+    return false;
+  }
+
+  var eventName = 'on' + eventNameSuffix;
+  var isSupported = eventName in document;
+
+  if (!isSupported) {
+    var element = document.createElement('div');
+    element.setAttribute(eventName, 'return;');
+    isSupported = typeof element[eventName] === 'function';
+  }
+
+  return isSupported;
+}
+
+function isCheckable(elem) {
+  var type = elem.type;
+  var nodeName = elem.nodeName;
+  return nodeName && nodeName.toLowerCase() === 'input' && (type === 'checkbox' || type === 'radio');
+}
+
+function getTracker(node) {
+  return node._valueTracker;
+}
+
+function detachTracker(node) {
+  node._valueTracker = null;
+}
+
+function getValueFromNode(node) {
+  var value = '';
+  if (!node) {
+    return value;
+  }
+
+  if (isCheckable(node)) {
+    value = node.checked ? 'true' : 'false';
+  } else {
+    value = node.value;
+  }
+
+  return value;
+}
+
+function trackValueOnNode(node) {
+  var valueField = isCheckable(node) ? 'checked' : 'value';
+  var descriptor = Object.getOwnPropertyDescriptor(node.constructor.prototype, valueField);
+
+  var currentValue = '' + node[valueField];
+
+  // if someone has already defined a value or Safari, then bail
+  // and don't track value will cause over reporting of changes,
+  // but it's better then a hard failure
+  // (needed for certain tests that spyOn input values and Safari)
+  if (node.hasOwnProperty(valueField) || typeof descriptor.get !== 'function' || typeof descriptor.set !== 'function') {
+    return;
+  }
+
+  Object.defineProperty(node, valueField, {
+    configurable: true,
+    get: function () {
+      return descriptor.get.call(this);
+    },
+    set: function (value) {
+      currentValue = '' + value;
+      descriptor.set.call(this, value);
+    }
+  });
+  // We could've passed this the first time
+  // but it triggers a bug in IE11 and Edge 14/15.
+  // Calling defineProperty() again should be equivalent.
+  // https://github.com/facebook/react/issues/11768
+  Object.defineProperty(node, valueField, {
+    enumerable: descriptor.enumerable
+  });
+
+  var tracker = {
+    getValue: function () {
+      return currentValue;
+    },
+    setValue: function (value) {
+      currentValue = '' + value;
+    },
+    stopTracking: function () {
+      detachTracker(node);
+      delete node[valueField];
+    }
+  };
+  return tracker;
+}
+
+function track(node) {
+  if (getTracker(node)) {
+    return;
+  }
+
+  // TODO: Once it's just Fiber we can move this to node._wrapperState
+  node._valueTracker = trackValueOnNode(node);
+}
+
+function updateValueIfChanged(node) {
+  if (!node) {
+    return false;
+  }
+
+  var tracker = getTracker(node);
+  // if there is no tracker at this point it's unlikely
+  // that trying again will succeed
+  if (!tracker) {
+    return true;
+  }
+
+  var lastValue = tracker.getValue();
+  var nextValue = getValueFromNode(node);
+  if (nextValue !== lastValue) {
+    tracker.setValue(nextValue);
+    return true;
+  }
+  return false;
+}
+
+var ReactInternals$1 = React.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
+
+var ReactCurrentOwner = ReactInternals$1.ReactCurrentOwner;
+var ReactDebugCurrentFrame = ReactInternals$1.ReactDebugCurrentFrame;
+
+var describeComponentFrame = function (name, source, ownerName) {
+  return '\n    in ' + (name || 'Unknown') + (source ? ' (at ' + source.fileName.replace(/^.*[\\\/]/, '') + ':' + source.lineNumber + ')' : ownerName ? ' (created by ' + ownerName + ')' : '');
+};
+
+// The Symbol used to tag the ReactElement-like types. If there is no native Symbol
+// nor polyfill, then a plain number is used for performance.
+var hasSymbol = typeof Symbol === 'function' && Symbol['for'];
+
+var REACT_ELEMENT_TYPE = hasSymbol ? Symbol['for']('react.element') : 0xeac7;
+var REACT_CALL_TYPE = hasSymbol ? Symbol['for']('react.call') : 0xeac8;
+var REACT_RETURN_TYPE = hasSymbol ? Symbol['for']('react.return') : 0xeac9;
+var REACT_PORTAL_TYPE = hasSymbol ? Symbol['for']('react.portal') : 0xeaca;
+var REACT_FRAGMENT_TYPE = hasSymbol ? Symbol['for']('react.fragment') : 0xeacb;
+var REACT_STRICT_MODE_TYPE = hasSymbol ? Symbol['for']('react.strict_mode') : 0xeacc;
+var REACT_PROVIDER_TYPE = hasSymbol ? Symbol['for']('react.provider') : 0xeacd;
+var REACT_CONTEXT_TYPE = hasSymbol ? Symbol['for']('react.context') : 0xeace;
+var REACT_ASYNC_MODE_TYPE = hasSymbol ? Symbol['for']('react.async_mode') : 0xeacf;
+var REACT_FORWARD_REF_TYPE = hasSymbol ? Symbol['for']('react.forward_ref') : 0xead0;
+
+var MAYBE_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;
+var FAUX_ITERATOR_SYMBOL = '@@iterator';
+
+function getIteratorFn(maybeIterable) {
+  if (maybeIterable === null || typeof maybeIterable === 'undefined') {
+    return null;
+  }
+  var maybeIterator = MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL];
+  if (typeof maybeIterator === 'function') {
+    return maybeIterator;
+  }
+  return null;
+}
+
+function getComponentName(fiber) {
+  var type = fiber.type;
+
+  if (typeof type === 'function') {
+    return type.displayName || type.name;
+  }
+  if (typeof type === 'string') {
+    return type;
+  }
+  switch (type) {
+    case REACT_FRAGMENT_TYPE:
+      return 'ReactFragment';
+    case REACT_PORTAL_TYPE:
+      return 'ReactPortal';
+    case REACT_CALL_TYPE:
+      return 'ReactCall';
+    case REACT_RETURN_TYPE:
+      return 'ReactReturn';
+  }
+  return null;
+}
+
+function describeFiber(fiber) {
+  switch (fiber.tag) {
+    case IndeterminateComponent:
+    case FunctionalComponent:
+    case ClassComponent:
+    case HostComponent:
+      var owner = fiber._debugOwner;
+      var source = fiber._debugSource;
+      var name = getComponentName(fiber);
+      var ownerName = null;
+      if (owner) {
+        ownerName = getComponentName(owner);
+      }
+      return describeComponentFrame(name, source, ownerName);
+    default:
+      return '';
+  }
+}
+
+// This function can only be called with a work-in-progress fiber and
+// only during begin or complete phase. Do not call it under any other
+// circumstances.
+function getStackAddendumByWorkInProgressFiber(workInProgress) {
+  var info = '';
+  var node = workInProgress;
+  do {
+    info += describeFiber(node);
+    // Otherwise this return pointer might point to the wrong tree:
+    node = node['return'];
+  } while (node);
+  return info;
+}
+
+function getCurrentFiberOwnerName$1() {
+  {
+    var fiber = ReactDebugCurrentFiber.current;
+    if (fiber === null) {
+      return null;
+    }
+    var owner = fiber._debugOwner;
+    if (owner !== null && typeof owner !== 'undefined') {
+      return getComponentName(owner);
+    }
+  }
+  return null;
+}
+
+function getCurrentFiberStackAddendum$1() {
+  {
+    var fiber = ReactDebugCurrentFiber.current;
+    if (fiber === null) {
+      return null;
+    }
+    // Safe because if current fiber exists, we are reconciling,
+    // and it is guaranteed to be the work-in-progress version.
+    return getStackAddendumByWorkInProgressFiber(fiber);
+  }
+  return null;
+}
+
+function resetCurrentFiber() {
+  ReactDebugCurrentFrame.getCurrentStack = null;
+  ReactDebugCurrentFiber.current = null;
+  ReactDebugCurrentFiber.phase = null;
+}
+
+function setCurrentFiber(fiber) {
+  ReactDebugCurrentFrame.getCurrentStack = getCurrentFiberStackAddendum$1;
+  ReactDebugCurrentFiber.current = fiber;
+  ReactDebugCurrentFiber.phase = null;
+}
+
+function setCurrentPhase(phase) {
+  ReactDebugCurrentFiber.phase = phase;
+}
+
+var ReactDebugCurrentFiber = {
+  current: null,
+  phase: null,
+  resetCurrentFiber: resetCurrentFiber,
+  setCurrentFiber: setCurrentFiber,
+  setCurrentPhase: setCurrentPhase,
+  getCurrentFiberOwnerName: getCurrentFiberOwnerName$1,
+  getCurrentFiberStackAddendum: getCurrentFiberStackAddendum$1
+};
+
+// A reserved attribute.
+// It is handled by React separately and shouldn't be written to the DOM.
+var RESERVED = 0;
+
+// A simple string attribute.
+// Attributes that aren't in the whitelist are presumed to have this type.
+var STRING = 1;
+
+// A string attribute that accepts booleans in React. In HTML, these are called
+// "enumerated" attributes with "true" and "false" as possible values.
+// When true, it should be set to a "true" string.
+// When false, it should be set to a "false" string.
+var BOOLEANISH_STRING = 2;
+
+// A real boolean attribute.
+// When true, it should be present (set either to an empty string or its name).
+// When false, it should be omitted.
+var BOOLEAN = 3;
+
+// An attribute that can be used as a flag as well as with a value.
+// When true, it should be present (set either to an empty string or its name).
+// When false, it should be omitted.
+// For any other value, should be present with that value.
+var OVERLOADED_BOOLEAN = 4;
+
+// An attribute that must be numeric or parse as a numeric.
+// When falsy, it should be removed.
+var NUMERIC = 5;
+
+// An attribute that must be positive numeric or parse as a positive numeric.
+// When falsy, it should be removed.
+var POSITIVE_NUMERIC = 6;
+
+/* eslint-disable max-len */
+var ATTRIBUTE_NAME_START_CHAR = ':A-Z_a-z\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF\\u0370-\\u037D\\u037F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00-\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD';
+/* eslint-enable max-len */
+var ATTRIBUTE_NAME_CHAR = ATTRIBUTE_NAME_START_CHAR + '\\-.0-9\\u00B7\\u0300-\\u036F\\u203F-\\u2040';
+
+
+var ROOT_ATTRIBUTE_NAME = 'data-reactroot';
+var VALID_ATTRIBUTE_NAME_REGEX = new RegExp('^[' + ATTRIBUTE_NAME_START_CHAR + '][' + ATTRIBUTE_NAME_CHAR + ']*$');
+
+var illegalAttributeNameCache = {};
+var validatedAttributeNameCache = {};
+
+function isAttributeNameSafe(attributeName) {
+  if (validatedAttributeNameCache.hasOwnProperty(attributeName)) {
+    return true;
+  }
+  if (illegalAttributeNameCache.hasOwnProperty(attributeName)) {
+    return false;
+  }
+  if (VALID_ATTRIBUTE_NAME_REGEX.test(attributeName)) {
+    validatedAttributeNameCache[attributeName] = true;
+    return true;
+  }
+  illegalAttributeNameCache[attributeName] = true;
+  {
+    warning_1(false, 'Invalid attribute name: `%s`', attributeName);
+  }
+  return false;
+}
+
+function shouldIgnoreAttribute(name, propertyInfo, isCustomComponentTag) {
+  if (propertyInfo !== null) {
+    return propertyInfo.type === RESERVED;
+  }
+  if (isCustomComponentTag) {
+    return false;
+  }
+  if (name.length > 2 && (name[0] === 'o' || name[0] === 'O') && (name[1] === 'n' || name[1] === 'N')) {
+    return true;
+  }
+  return false;
+}
+
+function shouldRemoveAttributeWithWarning(name, value, propertyInfo, isCustomComponentTag) {
+  if (propertyInfo !== null && propertyInfo.type === RESERVED) {
+    return false;
+  }
+  switch (typeof value) {
+    case 'function':
+    // $FlowIssue symbol is perfectly valid here
+    case 'symbol':
+      // eslint-disable-line
+      return true;
+    case 'boolean':
+      {
+        if (isCustomComponentTag) {
+          return false;
+        }
+        if (propertyInfo !== null) {
+          return !propertyInfo.acceptsBooleans;
+        } else {
+          var prefix = name.toLowerCase().slice(0, 5);
+          return prefix !== 'data-' && prefix !== 'aria-';
+        }
+      }
+    default:
+      return false;
+  }
+}
+
+function shouldRemoveAttribute(name, value, propertyInfo, isCustomComponentTag) {
+  if (value === null || typeof value === 'undefined') {
+    return true;
+  }
+  if (shouldRemoveAttributeWithWarning(name, value, propertyInfo, isCustomComponentTag)) {
+    return true;
+  }
+  if (propertyInfo !== null) {
+    switch (propertyInfo.type) {
+      case BOOLEAN:
+        return !value;
+      case OVERLOADED_BOOLEAN:
+        return value === false;
+      case NUMERIC:
+        return isNaN(value);
+      case POSITIVE_NUMERIC:
+        return isNaN(value) || value < 1;
+    }
+  }
+  return false;
+}
+
+function getPropertyInfo(name) {
+  return properties.hasOwnProperty(name) ? properties[name] : null;
+}
+
+function PropertyInfoRecord(name, type, mustUseProperty, attributeName, attributeNamespace) {
+  this.acceptsBooleans = type === BOOLEANISH_STRING || type === BOOLEAN || type === OVERLOADED_BOOLEAN;
+  this.attributeName = attributeName;
+  this.attributeNamespace = attributeNamespace;
+  this.mustUseProperty = mustUseProperty;
+  this.propertyName = name;
+  this.type = type;
+}
+
+// When adding attributes to this list, be sure to also add them to
+// the `possibleStandardNames` module to ensure casing and incorrect
+// name warnings.
+var properties = {};
+
+// These props are reserved by React. They shouldn't be written to the DOM.
+['children', 'dangerouslySetInnerHTML',
+// TODO: This prevents the assignment of defaultValue to regular
+// elements (not just inputs). Now that ReactDOMInput assigns to the
+// defaultValue property -- do we need this?
+'defaultValue', 'defaultChecked', 'innerHTML', 'suppressContentEditableWarning', 'suppressHydrationWarning', 'style'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, RESERVED, false, // mustUseProperty
+  name, // attributeName
+  null);
+});
+
+// A few React string attributes have a different name.
+// This is a mapping from React prop names to the attribute names.
+[['acceptCharset', 'accept-charset'], ['className', 'class'], ['htmlFor', 'for'], ['httpEquiv', 'http-equiv']].forEach(function (_ref) {
+  var name = _ref[0],
+      attributeName = _ref[1];
+
+  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty
+  attributeName, // attributeName
+  null);
+});
+
+// These are "enumerated" HTML attributes that accept "true" and "false".
+// In React, we let users pass `true` and `false` even though technically
+// these aren't boolean attributes (they are coerced to strings).
+['contentEditable', 'draggable', 'spellCheck', 'value'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, BOOLEANISH_STRING, false, // mustUseProperty
+  name.toLowerCase(), // attributeName
+  null);
+});
+
+// These are "enumerated" SVG attributes that accept "true" and "false".
+// In React, we let users pass `true` and `false` even though technically
+// these aren't boolean attributes (they are coerced to strings).
+// Since these are SVG attributes, their attribute names are case-sensitive.
+['autoReverse', 'externalResourcesRequired', 'preserveAlpha'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, BOOLEANISH_STRING, false, // mustUseProperty
+  name, // attributeName
+  null);
+});
+
+// These are HTML boolean attributes.
+['allowFullScreen', 'async',
+// Note: there is a special case that prevents it from being written to the DOM
+// on the client side because the browsers are inconsistent. Instead we call focus().
+'autoFocus', 'autoPlay', 'controls', 'default', 'defer', 'disabled', 'formNoValidate', 'hidden', 'loop', 'noModule', 'noValidate', 'open', 'playsInline', 'readOnly', 'required', 'reversed', 'scoped', 'seamless',
+// Microdata
+'itemScope'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, BOOLEAN, false, // mustUseProperty
+  name.toLowerCase(), // attributeName
+  null);
+});
+
+// These are the few React props that we set as DOM properties
+// rather than attributes. These are all booleans.
+['checked',
+// Note: `option.selected` is not updated if `select.multiple` is
+// disabled with `removeAttribute`. We have special logic for handling this.
+'multiple', 'muted', 'selected'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, BOOLEAN, true, // mustUseProperty
+  name.toLowerCase(), // attributeName
+  null);
+});
+
+// These are HTML attributes that are "overloaded booleans": they behave like
+// booleans, but can also accept a string value.
+['capture', 'download'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, OVERLOADED_BOOLEAN, false, // mustUseProperty
+  name.toLowerCase(), // attributeName
+  null);
+});
+
+// These are HTML attributes that must be positive numbers.
+['cols', 'rows', 'size', 'span'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, POSITIVE_NUMERIC, false, // mustUseProperty
+  name.toLowerCase(), // attributeName
+  null);
+});
+
+// These are HTML attributes that must be numbers.
+['rowSpan', 'start'].forEach(function (name) {
+  properties[name] = new PropertyInfoRecord(name, NUMERIC, false, // mustUseProperty
+  name.toLowerCase(), // attributeName
+  null);
+});
+
+var CAMELIZE = /[\-\:]([a-z])/g;
+var capitalize = function (token) {
+  return token[1].toUpperCase();
+};
+
+// This is a list of all SVG attributes that need special casing, namespacing,
+// or boolean value assignment. Regular attributes that just accept strings
+// and have the same names are omitted, just like in the HTML whitelist.
+// Some of these attributes can be hard to find. This list was created by
+// scrapping the MDN documentation.
+['accent-height', 'alignment-baseline', 'arabic-form', 'baseline-shift', 'cap-height', 'clip-path', 'clip-rule', 'color-interpolation', 'color-interpolation-filters', 'color-profile', 'color-rendering', 'dominant-baseline', 'enable-background', 'fill-opacity', 'fill-rule', 'flood-color', 'flood-opacity', 'font-family', 'font-size', 'font-size-adjust', 'font-stretch', 'font-style', 'font-variant', 'font-weight', 'glyph-name', 'glyph-orientation-horizontal', 'glyph-orientation-vertical', 'horiz-adv-x', 'horiz-origin-x', 'image-rendering', 'letter-spacing', 'lighting-color', 'marker-end', 'marker-mid', 'marker-start', 'overline-position', 'overline-thickness', 'paint-order', 'panose-1', 'pointer-events', 'rendering-intent', 'shape-rendering', 'stop-color', 'stop-opacity', 'strikethrough-position', 'strikethrough-thickness', 'stroke-dasharray', 'stroke-dashoffset', 'stroke-linecap', 'stroke-linejoin', 'stroke-miterlimit', 'stroke-opacity', 'stroke-width', 'text-anchor', 'text-decoration', 'text-rendering', 'underline-position', 'underline-thickness', 'unicode-bidi', 'unicode-range', 'units-per-em', 'v-alphabetic', 'v-hanging', 'v-ideographic', 'v-mathematical', 'vector-effect', 'vert-adv-y', 'vert-origin-x', 'vert-origin-y', 'word-spacing', 'writing-mode', 'xmlns:xlink', 'x-height'].forEach(function (attributeName) {
+  var name = attributeName.replace(CAMELIZE, capitalize);
+  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty
+  attributeName, null);
+});
+
+// String SVG attributes with the xlink namespace.
+['xlink:actuate', 'xlink:arcrole', 'xlink:href', 'xlink:role', 'xlink:show', 'xlink:title', 'xlink:type'].forEach(function (attributeName) {
+  var name = attributeName.replace(CAMELIZE, capitalize);
+  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty
+  attributeName, 'http://www.w3.org/1999/xlink');
+});
+
+// String SVG attributes with the xml namespace.
+['xml:base', 'xml:lang', 'xml:space'].forEach(function (attributeName) {
+  var name = attributeName.replace(CAMELIZE, capitalize);
+  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty
+  attributeName, 'http://www.w3.org/XML/1998/namespace');
+});
+
+// Special case: this attribute exists both in HTML and SVG.
+// Its "tabindex" attribute name is case-sensitive in SVG so we can't just use
+// its React `tabIndex` name, like we do for attributes that exist only in HTML.
+properties.tabIndex = new PropertyInfoRecord('tabIndex', STRING, false, // mustUseProperty
+'tabindex', // attributeName
+null);
+
+/**
+ * Get the value for a property on a node. Only used in DEV for SSR validation.
+ * The "expected" argument is used as a hint of what the expected value is.
+ * Some properties have multiple equivalent values.
+ */
+function getValueForProperty(node, name, expected, propertyInfo) {
+  {
+    if (propertyInfo.mustUseProperty) {
+      var propertyName = propertyInfo.propertyName;
+
+      return node[propertyName];
+    } else {
+      var attributeName = propertyInfo.attributeName;
+
+      var stringValue = null;
+
+      if (propertyInfo.type === OVERLOADED_BOOLEAN) {
+        if (node.hasAttribute(attributeName)) {
+          var value = node.getAttribute(attributeName);
+          if (value === '') {
+            return true;
+          }
+          if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
+            return value;
+          }
+          if (value === '' + expected) {
+            return expected;
+          }
+          return value;
+        }
+      } else if (node.hasAttribute(attributeName)) {
+        if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
+          // We had an attribute but shouldn't have had one, so read it
+          // for the error message.
+          return node.getAttribute(attributeName);
+        }
+        if (propertyInfo.type === BOOLEAN) {
+          // If this was a boolean, it doesn't matter what the value is
+          // the fact that we have it is the same as the expected.
+          return expected;
+        }
+        // Even if this property uses a namespace we use getAttribute
+        // because we assume its namespaced name is the same as our config.
+        // To use getAttributeNS we need the local name which we don't have
+        // in our config atm.
+        stringValue = node.getAttribute(attributeName);
+      }
+
+      if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
+        return stringValue === null ? expected : stringValue;
+      } else if (stringValue === '' + expected) {
+        return expected;
+      } else {
+        return stringValue;
+      }
+    }
+  }
+}
+
+/**
+ * Get the value for a attribute on a node. Only used in DEV for SSR validation.
+ * The third argument is used as a hint of what the expected value is. Some
+ * attributes have multiple equivalent values.
+ */
+function getValueForAttribute(node, name, expected) {
+  {
+    if (!isAttributeNameSafe(name)) {
+      return;
+    }
+    if (!node.hasAttribute(name)) {
+      return expected === undefined ? undefined : null;
+    }
+    var value = node.getAttribute(name);
+    if (value === '' + expected) {
+      return expected;
+    }
+    return value;
+  }
+}
+
+/**
+ * Sets the value for a property on a node.
+ *
+ * @param {DOMElement} node
+ * @param {string} name
+ * @param {*} value
+ */
+function setValueForProperty(node, name, value, isCustomComponentTag) {
+  var propertyInfo = getPropertyInfo(name);
+  if (shouldIgnoreAttribute(name, propertyInfo, isCustomComponentTag)) {
+    return;
+  }
+  if (shouldRemoveAttribute(name, value, propertyInfo, isCustomComponentTag)) {
+    value = null;
+  }
+  // If the prop isn't in the special list, treat it as a simple attribute.
+  if (isCustomComponentTag || propertyInfo === null) {
+    if (isAttributeNameSafe(name)) {
+      var _attributeName = name;
+      if (value === null) {
+        node.removeAttribute(_attributeName);
+      } else {
+        node.setAttribute(_attributeName, '' + value);
+      }
+    }
+    return;
+  }
+  var mustUseProperty = propertyInfo.mustUseProperty;
+
+  if (mustUseProperty) {
+    var propertyName = propertyInfo.propertyName;
+
+    if (value === null) {
+      var type = propertyInfo.type;
+
+      node[propertyName] = type === BOOLEAN ? false : '';
+    } else {
+      // Contrary to `setAttribute`, object properties are properly
+      // `toString`ed by IE8/9.
+      node[propertyName] = value;
+    }
+    return;
+  }
+  // The rest are treated as attributes with special cases.
+  var attributeName = propertyInfo.attributeName,
+      attributeNamespace = propertyInfo.attributeNamespace;
+
+  if (value === null) {
+    node.removeAttribute(attributeName);
+  } else {
+    var _type = propertyInfo.type;
+
+    var attributeValue = void 0;
+    if (_type === BOOLEAN || _type === OVERLOADED_BOOLEAN && value === true) {
+      attributeValue = '';
+    } else {
+      // `setAttribute` with objects becomes only `[object]` in IE8/9,
+      // ('' + value) makes it output the correct toString()-value.
+      attributeValue = '' + value;
+    }
+    if (attributeNamespace) {
+      node.setAttributeNS(attributeNamespace, attributeName, attributeValue);
+    } else {
+      node.setAttribute(attributeName, attributeValue);
+    }
+  }
+}
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+
+
+var ReactPropTypesSecret$1 = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';
+
+var ReactPropTypesSecret_1 = ReactPropTypesSecret$1;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+
+
+{
+  var invariant$2 = invariant_1;
+  var warning$2 = warning_1;
+  var ReactPropTypesSecret = ReactPropTypesSecret_1;
+  var loggedTypeFailures = {};
+}
+
+/**
+ * Assert that the values match with the type specs.
+ * Error messages are memorized and will only be shown once.
+ *
+ * @param {object} typeSpecs Map of name to a ReactPropType
+ * @param {object} values Runtime values that need to be type-checked
+ * @param {string} location e.g. "prop", "context", "child context"
+ * @param {string} componentName Name of the component for error messages.
+ * @param {?Function} getStack Returns the component stack.
+ * @private
+ */
+function checkPropTypes(typeSpecs, values, location, componentName, getStack) {
+  {
+    for (var typeSpecName in typeSpecs) {
+      if (typeSpecs.hasOwnProperty(typeSpecName)) {
+        var error;
+        // Prop type validation may throw. In case they do, we don't want to
+        // fail the render phase where it didn't fail before. So we log it.
+        // After these have been cleaned up, we'll let them throw.
+        try {
+          // This is intentionally an invariant that gets caught. It's the same
+          // behavior as without this statement except with a better message.
+          invariant$2(typeof typeSpecs[typeSpecName] === 'function', '%s: %s type `%s` is invalid; it must be a function, usually from ' + 'the `prop-types` package, but received `%s`.', componentName || 'React class', location, typeSpecName, typeof typeSpecs[typeSpecName]);
+          error = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, ReactPropTypesSecret);
+        } catch (ex) {
+          error = ex;
+        }
+        warning$2(!error || error instanceof Error, '%s: type specification of %s `%s` is invalid; the type checker ' + 'function must return `null` or an `Error` but returned a %s. ' + 'You may have forgotten to pass an argument to the type checker ' + 'creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and ' + 'shape all require an argument).', componentName || 'React class', location, typeSpecName, typeof error);
+        if (error instanceof Error && !(error.message in loggedTypeFailures)) {
+          // Only monitor this failure once because there tends to be a lot of the
+          // same error.
+          loggedTypeFailures[error.message] = true;
+
+          var stack = getStack ? getStack() : '';
+
+          warning$2(false, 'Failed %s type: %s%s', location, error.message, stack != null ? stack : '');
+        }
+      }
+    }
+  }
+}
+
+var checkPropTypes_1 = checkPropTypes;
+
+var ReactControlledValuePropTypes = {
+  checkPropTypes: null
+};
+
+{
+  var hasReadOnlyValue = {
+    button: true,
+    checkbox: true,
+    image: true,
+    hidden: true,
+    radio: true,
+    reset: true,
+    submit: true
+  };
+
+  var propTypes = {
+    value: function (props, propName, componentName) {
+      if (!props[propName] || hasReadOnlyValue[props.type] || props.onChange || props.readOnly || props.disabled) {
+        return null;
+      }
+      return new Error('You provided a `value` prop to a form field without an ' + '`onChange` handler. This will render a read-only field. If ' + 'the field should be mutable use `defaultValue`. Otherwise, ' + 'set either `onChange` or `readOnly`.');
+    },
+    checked: function (props, propName, componentName) {
+      if (!props[propName] || props.onChange || props.readOnly || props.disabled) {
+        return null;
+      }
+      return new Error('You provided a `checked` prop to a form field without an ' + '`onChange` handler. This will render a read-only field. If ' + 'the field should be mutable use `defaultChecked`. Otherwise, ' + 'set either `onChange` or `readOnly`.');
+    }
+  };
+
+  /**
+   * Provide a linked `value` attribute for controlled forms. You should not use
+   * this outside of the ReactDOM controlled form components.
+   */
+  ReactControlledValuePropTypes.checkPropTypes = function (tagName, props, getStack) {
+    checkPropTypes_1(propTypes, props, 'prop', tagName, getStack);
+  };
+}
+
+// TODO: direct imports like some-package/src/* are bad. Fix me.
+var getCurrentFiberOwnerName = ReactDebugCurrentFiber.getCurrentFiberOwnerName;
+var getCurrentFiberStackAddendum = ReactDebugCurrentFiber.getCurrentFiberStackAddendum;
+
+var didWarnValueDefaultValue = false;
+var didWarnCheckedDefaultChecked = false;
+var didWarnControlledToUncontrolled = false;
+var didWarnUncontrolledToControlled = false;
+
+function isControlled(props) {
+  var usesChecked = props.type === 'checkbox' || props.type === 'radio';
+  return usesChecked ? props.checked != null : props.value != null;
+}
+
+/**
+ * Implements an <input> host component that allows setting these optional
+ * props: `checked`, `value`, `defaultChecked`, and `defaultValue`.
+ *
+ * If `checked` or `value` are not supplied (or null/undefined), user actions
+ * that affect the checked state or value will trigger updates to the element.
+ *
+ * If they are supplied (and not null/undefined), the rendered element will not
+ * trigger updates to the element. Instead, the props must change in order for
+ * the rendered element to be updated.
+ *
+ * The rendered element will be initialized as unchecked (or `defaultChecked`)
+ * with an empty value (or `defaultValue`).
+ *
+ * See http://www.w3.org/TR/2012/WD-html5-20121025/the-input-element.html
+ */
+
+function getHostProps(element, props) {
+  var node = element;
+  var checked = props.checked;
+
+  var hostProps = _assign({}, props, {
+    defaultChecked: undefined,
+    defaultValue: undefined,
+    value: undefined,
+    checked: checked != null ? checked : node._wrapperState.initialChecked
+  });
+
+  return hostProps;
+}
+
+function initWrapperState(element, props) {
+  {
+    ReactControlledValuePropTypes.checkPropTypes('input', props, getCurrentFiberStackAddendum);
+
+    if (props.checked !== undefined && props.defaultChecked !== undefined && !didWarnCheckedDefaultChecked) {
+      warning_1(false, '%s contains an input of type %s with both checked and defaultChecked props. ' + 'Input elements must be either controlled or uncontrolled ' + '(specify either the checked prop, or the defaultChecked prop, but not ' + 'both). Decide between using a controlled or uncontrolled input ' + 'element and remove one of these props. More info: ' + 'https://fb.me/react-controlled-components', getCurrentFiberOwnerName() || 'A component', props.type);
+      didWarnCheckedDefaultChecked = true;
+    }
+    if (props.value !== undefined && props.defaultValue !== undefined && !didWarnValueDefaultValue) {
+      warning_1(false, '%s contains an input of type %s with both value and defaultValue props. ' + 'Input elements must be either controlled or uncontrolled ' + '(specify either the value prop, or the defaultValue prop, but not ' + 'both). Decide between using a controlled or uncontrolled input ' + 'element and remove one of these props. More info: ' + 'https://fb.me/react-controlled-components', getCurrentFiberOwnerName() || 'A component', props.type);
+      didWarnValueDefaultValue = true;
+    }
+  }
+
+  var node = element;
+  var defaultValue = props.defaultValue == null ? '' : props.defaultValue;
+
+  node._wrapperState = {
+    initialChecked: props.checked != null ? props.checked : props.defaultChecked,
+    initialValue: getSafeValue(props.value != null ? props.value : defaultValue),
+    controlled: isControlled(props)
+  };
+}
+
+function updateChecked(element, props) {
+  var node = element;
+  var checked = props.checked;
+  if (checked != null) {
+    setValueForProperty(node, 'checked', checked, false);
+  }
+}
+
+function updateWrapper(element, props) {
+  var node = element;
+  {
+    var _controlled = isControlled(props);
+
+    if (!node._wrapperState.controlled && _controlled && !didWarnUncontrolledToControlled) {
+      warning_1(false, 'A component is changing an uncontrolled input of type %s to be controlled. ' + 'Input elements should not switch from uncontrolled to controlled (or vice versa). ' + 'Decide between using a controlled or uncontrolled input ' + 'element for the lifetime of the component. More info: https://fb.me/react-controlled-components%s', props.type, getCurrentFiberStackAddendum());
+      didWarnUncontrolledToControlled = true;
+    }
+    if (node._wrapperState.controlled && !_controlled && !didWarnControlledToUncontrolled) {
+      warning_1(false, 'A component is changing a controlled input of type %s to be uncontrolled. ' + 'Input elements should not switch from controlled to uncontrolled (or vice versa). ' + 'Decide between using a controlled or uncontrolled input ' + 'element for the lifetime of the component. More info: https://fb.me/react-controlled-components%s', props.type, getCurrentFiberStackAddendum());
+      didWarnControlledToUncontrolled = true;
+    }
+  }
+
+  updateChecked(element, props);
+
+  var value = getSafeValue(props.value);
+
+  if (value != null) {
+    if (props.type === 'number') {
+      if (value === 0 && node.value === '' ||
+      // eslint-disable-next-line
+      node.value != value) {
+        node.value = '' + value;
+      }
+    } else if (node.value !== '' + value) {
+      node.value = '' + value;
+    }
+  }
+
+  if (props.hasOwnProperty('value')) {
+    setDefaultValue(node, props.type, value);
+  } else if (props.hasOwnProperty('defaultValue')) {
+    setDefaultValue(node, props.type, getSafeValue(props.defaultValue));
+  }
+
+  if (props.checked == null && props.defaultChecked != null) {
+    node.defaultChecked = !!props.defaultChecked;
+  }
+}
+
+function postMountWrapper(element, props) {
+  var node = element;
+
+  if (props.hasOwnProperty('value') || props.hasOwnProperty('defaultValue')) {
+    // Do not assign value if it is already set. This prevents user text input
+    // from being lost during SSR hydration.
+    if (node.value === '') {
+      node.value = '' + node._wrapperState.initialValue;
+    }
+
+    // value must be assigned before defaultValue. This fixes an issue where the
+    // visually displayed value of date inputs disappears on mobile Safari and Chrome:
+    // https://github.com/facebook/react/issues/7233
+    node.defaultValue = '' + node._wrapperState.initialValue;
+  }
+
+  // Normally, we'd just do `node.checked = node.checked` upon initial mount, less this bug
+  // this is needed to work around a chrome bug where setting defaultChecked
+  // will sometimes influence the value of checked (even after detachment).
+  // Reference: https://bugs.chromium.org/p/chromium/issues/detail?id=608416
+  // We need to temporarily unset name to avoid disrupting radio button groups.
+  var name = node.name;
+  if (name !== '') {
+    node.name = '';
+  }
+  node.defaultChecked = !node.defaultChecked;
+  node.defaultChecked = !node.defaultChecked;
+  if (name !== '') {
+    node.name = name;
+  }
+}
+
+function restoreControlledState(element, props) {
+  var node = element;
+  updateWrapper(node, props);
+  updateNamedCousins(node, props);
+}
+
+function updateNamedCousins(rootNode, props) {
+  var name = props.name;
+  if (props.type === 'radio' && name != null) {
+    var queryRoot = rootNode;
+
+    while (queryRoot.parentNode) {
+      queryRoot = queryRoot.parentNode;
+    }
+
+    // If `rootNode.form` was non-null, then we could try `form.elements`,
+    // but that sometimes behaves strangely in IE8. We could also try using
+    // `form.getElementsByName`, but that will only return direct children
+    // and won't include inputs that use the HTML5 `form=` attribute. Since
+    // the input might not even be in a form. It might not even be in the
+    // document. Let's just use the local `querySelectorAll` to ensure we don't
+    // miss anything.
+    var group = queryRoot.querySelectorAll('input[name=' + JSON.stringify('' + name) + '][type="radio"]');
+
+    for (var i = 0; i < group.length; i++) {
+      var otherNode = group[i];
+      if (otherNode === rootNode || otherNode.form !== rootNode.form) {
+        continue;
+      }
+      // This will throw if radio buttons rendered by different copies of React
+      // and the same name are rendered into the same form (same as #1939).
+      // That's probably okay; we don't support it just as we don't support
+      // mixing React radio buttons with non-React ones.
+      var otherProps = getFiberCurrentPropsFromNode$1(otherNode);
+      !otherProps ? invariant_1(false, 'ReactDOMInput: Mixing React and non-React radio inputs with the same `name` is not supported.') : void 0;
+
+      // We need update the tracked value on the named cousin since the value
+      // was changed but the input saw no event or value set
+      updateValueIfChanged(otherNode);
+
+      // If this is a controlled radio button group, forcing the input that
+      // was previously checked to update will cause it to be come re-checked
+      // as appropriate.
+      updateWrapper(otherNode, otherProps);
+    }
+  }
+}
+
+// In Chrome, assigning defaultValue to certain input types triggers input validation.
+// For number inputs, the display value loses trailing decimal points. For email inputs,
+// Chrome raises "The specified value <x> is not a valid email address".
+//
+// Here we check to see if the defaultValue has actually changed, avoiding these problems
+// when the user is inputting text
+//
+// https://github.com/facebook/react/issues/7253
+function setDefaultValue(node, type, value) {
+  if (
+  // Focused number inputs synchronize on blur. See ChangeEventPlugin.js
+  type !== 'number' || node.ownerDocument.activeElement !== node) {
+    if (value == null) {
+      node.defaultValue = '' + node._wrapperState.initialValue;
+    } else if (node.defaultValue !== '' + value) {
+      node.defaultValue = '' + value;
+    }
+  }
+}
+
+function getSafeValue(value) {
+  switch (typeof value) {
+    case 'boolean':
+    case 'number':
+    case 'object':
+    case 'string':
+    case 'undefined':
+      return value;
+    default:
+      // function, symbol are assigned as empty strings
+      return '';
+  }
+}
+
+var eventTypes$1 = {
+  change: {
+    phasedRegistrationNames: {
+      bubbled: 'onChange',
+      captured: 'onChangeCapture'
+    },
+    dependencies: ['topBlur', 'topChange', 'topClick', 'topFocus', 'topInput', 'topKeyDown', 'topKeyUp', 'topSelectionChange']
+  }
+};
+
+function createAndAccumulateChangeEvent(inst, nativeEvent, target) {
+  var event = SyntheticEvent$1.getPooled(eventTypes$1.change, inst, nativeEvent, target);
+  event.type = 'change';
+  // Flag this event loop as needing state restore.
+  enqueueStateRestore(target);
+  accumulateTwoPhaseDispatches(event);
+  return event;
+}
+/**
+ * For IE shims
+ */
+var activeElement = null;
+var activeElementInst = null;
+
+/**
+ * SECTION: handle `change` event
+ */
+function shouldUseChangeEvent(elem) {
+  var nodeName = elem.nodeName && elem.nodeName.toLowerCase();
+  return nodeName === 'select' || nodeName === 'input' && elem.type === 'file';
+}
+
+function manualDispatchChangeEvent(nativeEvent) {
+  var event = createAndAccumulateChangeEvent(activeElementInst, nativeEvent, getEventTarget(nativeEvent));
+
+  // If change and propertychange bubbled, we'd just bind to it like all the
+  // other events and have it go through ReactBrowserEventEmitter. Since it
+  // doesn't, we manually listen for the events and so we have to enqueue and
+  // process the abstract event manually.
+  //
+  // Batching is necessary here in order to ensure that all event handlers run
+  // before the next rerender (including event handlers attached to ancestor
+  // elements instead of directly on the input). Without this, controlled
+  // components don't work properly in conjunction with event bubbling because
+  // the component is rerendered and the value reverted before all the event
+  // handlers can run. See https://github.com/facebook/react/issues/708.
+  batchedUpdates(runEventInBatch, event);
+}
+
+function runEventInBatch(event) {
+  runEventsInBatch(event, false);
+}
+
+function getInstIfValueChanged(targetInst) {
+  var targetNode = getNodeFromInstance$1(targetInst);
+  if (updateValueIfChanged(targetNode)) {
+    return targetInst;
+  }
+}
+
+function getTargetInstForChangeEvent(topLevelType, targetInst) {
+  if (topLevelType === 'topChange') {
+    return targetInst;
+  }
+}
+
+/**
+ * SECTION: handle `input` event
+ */
+var isInputEventSupported = false;
+if (ExecutionEnvironment_1.canUseDOM) {
+  // IE9 claims to support the input event but fails to trigger it when
+  // deleting text, so we ignore its input events.
+  isInputEventSupported = isEventSupported('input') && (!document.documentMode || document.documentMode > 9);
+}
+
+/**
+ * (For IE <=9) Starts tracking propertychange events on the passed-in element
+ * and override the value property so that we can distinguish user events from
+ * value changes in JS.
+ */
+function startWatchingForValueChange(target, targetInst) {
+  activeElement = target;
+  activeElementInst = targetInst;
+  activeElement.attachEvent('onpropertychange', handlePropertyChange);
+}
+
+/**
+ * (For IE <=9) Removes the event listeners from the currently-tracked element,
+ * if any exists.
+ */
+function stopWatchingForValueChange() {
+  if (!activeElement) {
+    return;
+  }
+  activeElement.detachEvent('onpropertychange', handlePropertyChange);
+  activeElement = null;
+  activeElementInst = null;
+}
+
+/**
+ * (For IE <=9) Handles a propertychange event, sending a `change` event if
+ * the value of the active element has changed.
+ */
+function handlePropertyChange(nativeEvent) {
+  if (nativeEvent.propertyName !== 'value') {
+    return;
+  }
+  if (getInstIfValueChanged(activeElementInst)) {
+    manualDispatchChangeEvent(nativeEvent);
+  }
+}
+
+function handleEventsForInputEventPolyfill(topLevelType, target, targetInst) {
+  if (topLevelType === 'topFocus') {
+    // In IE9, propertychange fires for most input events but is buggy and
+    // doesn't fire when text is deleted, but conveniently, selectionchange
+    // appears to fire in all of the remaining cases so we catch those and
+    // forward the event if the value has changed
+    // In either case, we don't want to call the event handler if the value
+    // is changed from JS so we redefine a setter for `.value` that updates
+    // our activeElementValue variable, allowing us to ignore those changes
+    //
+    // stopWatching() should be a noop here but we call it just in case we
+    // missed a blur event somehow.
+    stopWatchingForValueChange();
+    startWatchingForValueChange(target, targetInst);
+  } else if (topLevelType === 'topBlur') {
+    stopWatchingForValueChange();
+  }
+}
+
+// For IE8 and IE9.
+function getTargetInstForInputEventPolyfill(topLevelType, targetInst) {
+  if (topLevelType === 'topSelectionChange' || topLevelType === 'topKeyUp' || topLevelType === 'topKeyDown') {
+    // On the selectionchange event, the target is just document which isn't
+    // helpful for us so just check activeElement instead.
+    //
+    // 99% of the time, keydown and keyup aren't necessary. IE8 fails to fire
+    // propertychange on the first input event after setting `value` from a
+    // script and fires only keydown, keypress, keyup. Catching keyup usually
+    // gets it and catching keydown lets us fire an event for the first
+    // keystroke if user does a key repeat (it'll be a little delayed: right
+    // before the second keystroke). Other input methods (e.g., paste) seem to
+    // fire selectionchange normally.
+    return getInstIfValueChanged(activeElementInst);
+  }
+}
+
+/**
+ * SECTION: handle `click` event
+ */
+function shouldUseClickEvent(elem) {
+  // Use the `click` event to detect changes to checkbox and radio inputs.
+  // This approach works across all browsers, whereas `change` does not fire
+  // until `blur` in IE8.
+  var nodeName = elem.nodeName;
+  return nodeName && nodeName.toLowerCase() === 'input' && (elem.type === 'checkbox' || elem.type === 'radio');
+}
+
+function getTargetInstForClickEvent(topLevelType, targetInst) {
+  if (topLevelType === 'topClick') {
+    return getInstIfValueChanged(targetInst);
+  }
+}
+
+function getTargetInstForInputOrChangeEvent(topLevelType, targetInst) {
+  if (topLevelType === 'topInput' || topLevelType === 'topChange') {
+    return getInstIfValueChanged(targetInst);
+  }
+}
+
+function handleControlledInputBlur(inst, node) {
+  // TODO: In IE, inst is occasionally null. Why?
+  if (inst == null) {
+    return;
+  }
+
+  // Fiber and ReactDOM keep wrapper state in separate places
+  var state = inst._wrapperState || node._wrapperState;
+
+  if (!state || !state.controlled || node.type !== 'number') {
+    return;
+  }
+
+  // If controlled, assign the value attribute to the current value on blur
+  setDefaultValue(node, 'number', node.value);
+}
+
+/**
+ * This plugin creates an `onChange` event that normalizes change events
+ * across form elements. This event fires at a time when it's possible to
+ * change the element's value without seeing a flicker.
+ *
+ * Supported elements are:
+ * - input (see `isTextInputElement`)
+ * - textarea
+ * - select
+ */
+var ChangeEventPlugin = {
+  eventTypes: eventTypes$1,
+
+  _isInputEventSupported: isInputEventSupported,
+
+  extractEvents: function (topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+    var targetNode = targetInst ? getNodeFromInstance$1(targetInst) : window;
+
+    var getTargetInstFunc = void 0,
+        handleEventFunc = void 0;
+    if (shouldUseChangeEvent(targetNode)) {
+      getTargetInstFunc = getTargetInstForChangeEvent;
+    } else if (isTextInputElement(targetNode)) {
+      if (isInputEventSupported) {
+        getTargetInstFunc = getTargetInstForInputOrChangeEvent;
+      } else {
+        getTargetInstFunc = getTargetInstForInputEventPolyfill;
+        handleEventFunc = handleEventsForInputEventPolyfill;
+      }
+    } else if (shouldUseClickEvent(targetNode)) {
+      getTargetInstFunc = getTargetInstForClickEvent;
+    }
+
+    if (getTargetInstFunc) {
+      var inst = getTargetInstFunc(topLevelType, targetInst);
+      if (inst) {
+        var event = createAndAccumulateChangeEvent(inst, nativeEvent, nativeEventTarget);
+        return event;
+      }
+    }
+
+    if (handleEventFunc) {
+      handleEventFunc(topLevelType, targetNode, targetInst);
+    }
+
+    // When blurring, set the value attribute for number inputs
+    if (topLevelType === 'topBlur') {
+      handleControlledInputBlur(targetInst, targetNode);
+    }
+  }
+};
+
+/**
+ * Module that is injectable into `EventPluginHub`, that specifies a
+ * deterministic ordering of `EventPlugin`s. A convenient way to reason about
+ * plugins, without having to package every one of them. This is better than
+ * having plugins be ordered in the same order that they are injected because
+ * that ordering would be influenced by the packaging order.
+ * `ResponderEventPlugin` must occur before `SimpleEventPlugin` so that
+ * preventing default on events is convenient in `SimpleEventPlugin` handlers.
+ */
+var DOMEventPluginOrder = ['ResponderEventPlugin', 'SimpleEventPlugin', 'TapEventPlugin', 'EnterLeaveEventPlugin', 'ChangeEventPlugin', 'SelectEventPlugin', 'BeforeInputEventPlugin'];
+
+var SyntheticUIEvent = SyntheticEvent$1.extend({
+  view: null,
+  detail: null
+});
+
+/**
+ * Translation from modifier key to the associated property in the event.
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/#keys-Modifiers
+ */
+
+var modifierKeyToProp = {
+  Alt: 'altKey',
+  Control: 'ctrlKey',
+  Meta: 'metaKey',
+  Shift: 'shiftKey'
+};
+
+// IE8 does not implement getModifierState so we simply map it to the only
+// modifier keys exposed by the event itself, does not support Lock-keys.
+// Currently, all major browsers except Chrome seems to support Lock-keys.
+function modifierStateGetter(keyArg) {
+  var syntheticEvent = this;
+  var nativeEvent = syntheticEvent.nativeEvent;
+  if (nativeEvent.getModifierState) {
+    return nativeEvent.getModifierState(keyArg);
+  }
+  var keyProp = modifierKeyToProp[keyArg];
+  return keyProp ? !!nativeEvent[keyProp] : false;
+}
+
+function getEventModifierState(nativeEvent) {
+  return modifierStateGetter;
+}
+
+/**
+ * @interface MouseEvent
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/
+ */
+var SyntheticMouseEvent = SyntheticUIEvent.extend({
+  screenX: null,
+  screenY: null,
+  clientX: null,
+  clientY: null,
+  pageX: null,
+  pageY: null,
+  ctrlKey: null,
+  shiftKey: null,
+  altKey: null,
+  metaKey: null,
+  getModifierState: getEventModifierState,
+  button: null,
+  buttons: null,
+  relatedTarget: function (event) {
+    return event.relatedTarget || (event.fromElement === event.srcElement ? event.toElement : event.fromElement);
+  }
+});
+
+var eventTypes$2 = {
+  mouseEnter: {
+    registrationName: 'onMouseEnter',
+    dependencies: ['topMouseOut', 'topMouseOver']
+  },
+  mouseLeave: {
+    registrationName: 'onMouseLeave',
+    dependencies: ['topMouseOut', 'topMouseOver']
+  }
+};
+
+var EnterLeaveEventPlugin = {
+  eventTypes: eventTypes$2,
+
+  /**
+   * For almost every interaction we care about, there will be both a top-level
+   * `mouseover` and `mouseout` event that occurs. Only use `mouseout` so that
+   * we do not extract duplicate events. However, moving the mouse into the
+   * browser from outside will not fire a `mouseout` event. In this case, we use
+   * the `mouseover` top-level event.
+   */
+  extractEvents: function (topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+    if (topLevelType === 'topMouseOver' && (nativeEvent.relatedTarget || nativeEvent.fromElement)) {
+      return null;
+    }
+    if (topLevelType !== 'topMouseOut' && topLevelType !== 'topMouseOver') {
+      // Must not be a mouse in or mouse out - ignoring.
+      return null;
+    }
+
+    var win = void 0;
+    if (nativeEventTarget.window === nativeEventTarget) {
+      // `nativeEventTarget` is probably a window object.
+      win = nativeEventTarget;
+    } else {
+      // TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.
+      var doc = nativeEventTarget.ownerDocument;
+      if (doc) {
+        win = doc.defaultView || doc.parentWindow;
+      } else {
+        win = window;
+      }
+    }
+
+    var from = void 0;
+    var to = void 0;
+    if (topLevelType === 'topMouseOut') {
+      from = targetInst;
+      var related = nativeEvent.relatedTarget || nativeEvent.toElement;
+      to = related ? getClosestInstanceFromNode(related) : null;
+    } else {
+      // Moving to a node from outside the window.
+      from = null;
+      to = targetInst;
+    }
+
+    if (from === to) {
+      // Nothing pertains to our managed components.
+      return null;
+    }
+
+    var fromNode = from == null ? win : getNodeFromInstance$1(from);
+    var toNode = to == null ? win : getNodeFromInstance$1(to);
+
+    var leave = SyntheticMouseEvent.getPooled(eventTypes$2.mouseLeave, from, nativeEvent, nativeEventTarget);
+    leave.type = 'mouseleave';
+    leave.target = fromNode;
+    leave.relatedTarget = toNode;
+
+    var enter = SyntheticMouseEvent.getPooled(eventTypes$2.mouseEnter, to, nativeEvent, nativeEventTarget);
+    enter.type = 'mouseenter';
+    enter.target = toNode;
+    enter.relatedTarget = fromNode;
+
+    accumulateEnterLeaveDispatches(leave, enter, from, to);
+
+    return [leave, enter];
+  }
+};
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ */
+
+/* eslint-disable fb-www/typeof-undefined */
+
+/**
+ * Same as document.activeElement but wraps in a try-catch block. In IE it is
+ * not safe to call document.activeElement if there is nothing focused.
+ *
+ * The activeElement will be null only if the document or document body is not
+ * yet defined.
+ *
+ * @param {?DOMDocument} doc Defaults to current document.
+ * @return {?DOMElement}
+ */
+function getActiveElement(doc) /*?DOMElement*/{
+  doc = doc || (typeof document !== 'undefined' ? document : undefined);
+  if (typeof doc === 'undefined') {
+    return null;
+  }
+  try {
+    return doc.activeElement || doc.body;
+  } catch (e) {
+    return doc.body;
+  }
+}
+
+var getActiveElement_1 = getActiveElement;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ * 
+ */
+
+/*eslint-disable no-self-compare */
+
+
+
+var hasOwnProperty = Object.prototype.hasOwnProperty;
+
+/**
+ * inlined Object.is polyfill to avoid requiring consumers ship their own
+ * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
+ */
+function is(x, y) {
+  // SameValue algorithm
+  if (x === y) {
+    // Steps 1-5, 7-10
+    // Steps 6.b-6.e: +0 != -0
+    // Added the nonzero y check to make Flow happy, but it is redundant
+    return x !== 0 || y !== 0 || 1 / x === 1 / y;
+  } else {
+    // Step 6.a: NaN == NaN
+    return x !== x && y !== y;
+  }
+}
+
+/**
+ * Performs equality by iterating through keys on an object and returning false
+ * when any key has values which are not strictly equal between the arguments.
+ * Returns true when the values of all keys are strictly equal.
+ */
+function shallowEqual(objA, objB) {
+  if (is(objA, objB)) {
+    return true;
+  }
+
+  if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) {
+    return false;
+  }
+
+  var keysA = Object.keys(objA);
+  var keysB = Object.keys(objB);
+
+  if (keysA.length !== keysB.length) {
+    return false;
+  }
+
+  // Test for A's keys different from B.
+  for (var i = 0; i < keysA.length; i++) {
+    if (!hasOwnProperty.call(objB, keysA[i]) || !is(objA[keysA[i]], objB[keysA[i]])) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+var shallowEqual_1 = shallowEqual;
+
+/**
+ * `ReactInstanceMap` maintains a mapping from a public facing stateful
+ * instance (key) and the internal representation (value). This allows public
+ * methods to accept the user facing instance as an argument and map them back
+ * to internal methods.
+ *
+ * Note that this module is currently shared and assumed to be stateless.
+ * If this becomes an actual Map, that will break.
+ */
+
+/**
+ * This API should be called `delete` but we'd have to make sure to always
+ * transform these to strings for IE support. When this transform is fully
+ * supported we can rename it.
+ */
+
+
+function get(key) {
+  return key._reactInternalFiber;
+}
+
+function has(key) {
+  return key._reactInternalFiber !== undefined;
+}
+
+function set(key, value) {
+  key._reactInternalFiber = value;
+}
+
+// Don't change these two values. They're used by React Dev Tools.
+var NoEffect = /*              */0;
+var PerformedWork = /*         */1;
+
+// You can change the rest (and add more).
+var Placement = /*             */2;
+var Update = /*                */4;
+var PlacementAndUpdate = /*    */6;
+var Deletion = /*              */8;
+var ContentReset = /*          */16;
+var Callback = /*              */32;
+var DidCapture = /*            */64;
+var Ref = /*                   */128;
+var ErrLog = /*                */256;
+var Snapshot = /*              */2048;
+
+// Union of all host effects
+var HostEffectMask = /*        */2559;
+
+var Incomplete = /*            */512;
+var ShouldCapture = /*         */1024;
+
+var MOUNTING = 1;
+var MOUNTED = 2;
+var UNMOUNTED = 3;
+
+function isFiberMountedImpl(fiber) {
+  var node = fiber;
+  if (!fiber.alternate) {
+    // If there is no alternate, this might be a new tree that isn't inserted
+    // yet. If it is, then it will have a pending insertion effect on it.
+    if ((node.effectTag & Placement) !== NoEffect) {
+      return MOUNTING;
+    }
+    while (node['return']) {
+      node = node['return'];
+      if ((node.effectTag & Placement) !== NoEffect) {
+        return MOUNTING;
+      }
+    }
+  } else {
+    while (node['return']) {
+      node = node['return'];
+    }
+  }
+  if (node.tag === HostRoot) {
+    // TODO: Check if this was a nested HostRoot when used with
+    // renderContainerIntoSubtree.
+    return MOUNTED;
+  }
+  // If we didn't hit the root, that means that we're in an disconnected tree
+  // that has been unmounted.
+  return UNMOUNTED;
+}
+
+function isFiberMounted(fiber) {
+  return isFiberMountedImpl(fiber) === MOUNTED;
+}
+
+function isMounted(component) {
+  {
+    var owner = ReactCurrentOwner.current;
+    if (owner !== null && owner.tag === ClassComponent) {
+      var ownerFiber = owner;
+      var instance = ownerFiber.stateNode;
+      warning_1(instance._warnedAboutRefsInRender, '%s is accessing isMounted inside its render() function. ' + 'render() should be a pure function of props and state. It should ' + 'never access something that requires stale data from the previous ' + 'render, such as refs. Move this logic to componentDidMount and ' + 'componentDidUpdate instead.', getComponentName(ownerFiber) || 'A component');
+      instance._warnedAboutRefsInRender = true;
+    }
+  }
+
+  var fiber = get(component);
+  if (!fiber) {
+    return false;
+  }
+  return isFiberMountedImpl(fiber) === MOUNTED;
+}
+
+function assertIsMounted(fiber) {
+  !(isFiberMountedImpl(fiber) === MOUNTED) ? invariant_1(false, 'Unable to find node on an unmounted component.') : void 0;
+}
+
+function findCurrentFiberUsingSlowPath(fiber) {
+  var alternate = fiber.alternate;
+  if (!alternate) {
+    // If there is no alternate, then we only need to check if it is mounted.
+    var state = isFiberMountedImpl(fiber);
+    !(state !== UNMOUNTED) ? invariant_1(false, 'Unable to find node on an unmounted component.') : void 0;
+    if (state === MOUNTING) {
+      return null;
+    }
+    return fiber;
+  }
+  // If we have two possible branches, we'll walk backwards up to the root
+  // to see what path the root points to. On the way we may hit one of the
+  // special cases and we'll deal with them.
+  var a = fiber;
+  var b = alternate;
+  while (true) {
+    var parentA = a['return'];
+    var parentB = parentA ? parentA.alternate : null;
+    if (!parentA || !parentB) {
+      // We're at the root.
+      break;
+    }
+
+    // If both copies of the parent fiber point to the same child, we can
+    // assume that the child is current. This happens when we bailout on low
+    // priority: the bailed out fiber's child reuses the current child.
+    if (parentA.child === parentB.child) {
+      var child = parentA.child;
+      while (child) {
+        if (child === a) {
+          // We've determined that A is the current branch.
+          assertIsMounted(parentA);
+          return fiber;
+        }
+        if (child === b) {
+          // We've determined that B is the current branch.
+          assertIsMounted(parentA);
+          return alternate;
+        }
+        child = child.sibling;
+      }
+      // We should never have an alternate for any mounting node. So the only
+      // way this could possibly happen is if this was unmounted, if at all.
+      invariant_1(false, 'Unable to find node on an unmounted component.');
+    }
+
+    if (a['return'] !== b['return']) {
+      // The return pointer of A and the return pointer of B point to different
+      // fibers. We assume that return pointers never criss-cross, so A must
+      // belong to the child set of A.return, and B must belong to the child
+      // set of B.return.
+      a = parentA;
+      b = parentB;
+    } else {
+      // The return pointers point to the same fiber. We'll have to use the
+      // default, slow path: scan the child sets of each parent alternate to see
+      // which child belongs to which set.
+      //
+      // Search parent A's child set
+      var didFindChild = false;
+      var _child = parentA.child;
+      while (_child) {
+        if (_child === a) {
+          didFindChild = true;
+          a = parentA;
+          b = parentB;
+          break;
+        }
+        if (_child === b) {
+          didFindChild = true;
+          b = parentA;
+          a = parentB;
+          break;
+        }
+        _child = _child.sibling;
+      }
+      if (!didFindChild) {
+        // Search parent B's child set
+        _child = parentB.child;
+        while (_child) {
+          if (_child === a) {
+            didFindChild = true;
+            a = parentB;
+            b = parentA;
+            break;
+          }
+          if (_child === b) {
+            didFindChild = true;
+            b = parentB;
+            a = parentA;
+            break;
+          }
+          _child = _child.sibling;
+        }
+        !didFindChild ? invariant_1(false, 'Child was not found in either parent set. This indicates a bug in React related to the return pointer. Please file an issue.') : void 0;
+      }
+    }
+
+    !(a.alternate === b) ? invariant_1(false, 'Return fibers should always be each others\' alternates. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+  }
+  // If the root is not a host container, we're in a disconnected tree. I.e.
+  // unmounted.
+  !(a.tag === HostRoot) ? invariant_1(false, 'Unable to find node on an unmounted component.') : void 0;
+  if (a.stateNode.current === a) {
+    // We've determined that A is the current branch.
+    return fiber;
+  }
+  // Otherwise B has to be current branch.
+  return alternate;
+}
+
+function findCurrentHostFiber(parent) {
+  var currentParent = findCurrentFiberUsingSlowPath(parent);
+  if (!currentParent) {
+    return null;
+  }
+
+  // Next we'll drill down this component to find the first HostComponent/Text.
+  var node = currentParent;
+  while (true) {
+    if (node.tag === HostComponent || node.tag === HostText) {
+      return node;
+    } else if (node.child) {
+      node.child['return'] = node;
+      node = node.child;
+      continue;
+    }
+    if (node === currentParent) {
+      return null;
+    }
+    while (!node.sibling) {
+      if (!node['return'] || node['return'] === currentParent) {
+        return null;
+      }
+      node = node['return'];
+    }
+    node.sibling['return'] = node['return'];
+    node = node.sibling;
+  }
+  // Flow needs the return null here, but ESLint complains about it.
+  // eslint-disable-next-line no-unreachable
+  return null;
+}
+
+function findCurrentHostFiberWithNoPortals(parent) {
+  var currentParent = findCurrentFiberUsingSlowPath(parent);
+  if (!currentParent) {
+    return null;
+  }
+
+  // Next we'll drill down this component to find the first HostComponent/Text.
+  var node = currentParent;
+  while (true) {
+    if (node.tag === HostComponent || node.tag === HostText) {
+      return node;
+    } else if (node.child && node.tag !== HostPortal) {
+      node.child['return'] = node;
+      node = node.child;
+      continue;
+    }
+    if (node === currentParent) {
+      return null;
+    }
+    while (!node.sibling) {
+      if (!node['return'] || node['return'] === currentParent) {
+        return null;
+      }
+      node = node['return'];
+    }
+    node.sibling['return'] = node['return'];
+    node = node.sibling;
+  }
+  // Flow needs the return null here, but ESLint complains about it.
+  // eslint-disable-next-line no-unreachable
+  return null;
+}
+
+function addEventBubbleListener(element, eventType, listener) {
+  element.addEventListener(eventType, listener, false);
+}
+
+function addEventCaptureListener(element, eventType, listener) {
+  element.addEventListener(eventType, listener, true);
+}
+
+/**
+ * @interface Event
+ * @see http://www.w3.org/TR/css3-animations/#AnimationEvent-interface
+ * @see https://developer.mozilla.org/en-US/docs/Web/API/AnimationEvent
+ */
+var SyntheticAnimationEvent = SyntheticEvent$1.extend({
+  animationName: null,
+  elapsedTime: null,
+  pseudoElement: null
+});
+
+/**
+ * @interface Event
+ * @see http://www.w3.org/TR/clipboard-apis/
+ */
+var SyntheticClipboardEvent = SyntheticEvent$1.extend({
+  clipboardData: function (event) {
+    return 'clipboardData' in event ? event.clipboardData : window.clipboardData;
+  }
+});
+
+/**
+ * @interface FocusEvent
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/
+ */
+var SyntheticFocusEvent = SyntheticUIEvent.extend({
+  relatedTarget: null
+});
+
+/**
+ * `charCode` represents the actual "character code" and is safe to use with
+ * `String.fromCharCode`. As such, only keys that correspond to printable
+ * characters produce a valid `charCode`, the only exception to this is Enter.
+ * The Tab-key is considered non-printable and does not have a `charCode`,
+ * presumably because it does not produce a tab-character in browsers.
+ *
+ * @param {object} nativeEvent Native browser event.
+ * @return {number} Normalized `charCode` property.
+ */
+function getEventCharCode(nativeEvent) {
+  var charCode = void 0;
+  var keyCode = nativeEvent.keyCode;
+
+  if ('charCode' in nativeEvent) {
+    charCode = nativeEvent.charCode;
+
+    // FF does not set `charCode` for the Enter-key, check against `keyCode`.
+    if (charCode === 0 && keyCode === 13) {
+      charCode = 13;
+    }
+  } else {
+    // IE8 does not implement `charCode`, but `keyCode` has the correct value.
+    charCode = keyCode;
+  }
+
+  // IE and Edge (on Windows) and Chrome / Safari (on Windows and Linux)
+  // report Enter as charCode 10 when ctrl is pressed.
+  if (charCode === 10) {
+    charCode = 13;
+  }
+
+  // Some non-printable keys are reported in `charCode`/`keyCode`, discard them.
+  // Must not discard the (non-)printable Enter-key.
+  if (charCode >= 32 || charCode === 13) {
+    return charCode;
+  }
+
+  return 0;
+}
+
+/**
+ * Normalization of deprecated HTML5 `key` values
+ * @see https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent#Key_names
+ */
+var normalizeKey = {
+  Esc: 'Escape',
+  Spacebar: ' ',
+  Left: 'ArrowLeft',
+  Up: 'ArrowUp',
+  Right: 'ArrowRight',
+  Down: 'ArrowDown',
+  Del: 'Delete',
+  Win: 'OS',
+  Menu: 'ContextMenu',
+  Apps: 'ContextMenu',
+  Scroll: 'ScrollLock',
+  MozPrintableKey: 'Unidentified'
+};
+
+/**
+ * Translation from legacy `keyCode` to HTML5 `key`
+ * Only special keys supported, all others depend on keyboard layout or browser
+ * @see https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent#Key_names
+ */
+var translateToKey = {
+  '8': 'Backspace',
+  '9': 'Tab',
+  '12': 'Clear',
+  '13': 'Enter',
+  '16': 'Shift',
+  '17': 'Control',
+  '18': 'Alt',
+  '19': 'Pause',
+  '20': 'CapsLock',
+  '27': 'Escape',
+  '32': ' ',
+  '33': 'PageUp',
+  '34': 'PageDown',
+  '35': 'End',
+  '36': 'Home',
+  '37': 'ArrowLeft',
+  '38': 'ArrowUp',
+  '39': 'ArrowRight',
+  '40': 'ArrowDown',
+  '45': 'Insert',
+  '46': 'Delete',
+  '112': 'F1',
+  '113': 'F2',
+  '114': 'F3',
+  '115': 'F4',
+  '116': 'F5',
+  '117': 'F6',
+  '118': 'F7',
+  '119': 'F8',
+  '120': 'F9',
+  '121': 'F10',
+  '122': 'F11',
+  '123': 'F12',
+  '144': 'NumLock',
+  '145': 'ScrollLock',
+  '224': 'Meta'
+};
+
+/**
+ * @param {object} nativeEvent Native browser event.
+ * @return {string} Normalized `key` property.
+ */
+function getEventKey(nativeEvent) {
+  if (nativeEvent.key) {
+    // Normalize inconsistent values reported by browsers due to
+    // implementations of a working draft specification.
+
+    // FireFox implements `key` but returns `MozPrintableKey` for all
+    // printable characters (normalized to `Unidentified`), ignore it.
+    var key = normalizeKey[nativeEvent.key] || nativeEvent.key;
+    if (key !== 'Unidentified') {
+      return key;
+    }
+  }
+
+  // Browser does not implement `key`, polyfill as much of it as we can.
+  if (nativeEvent.type === 'keypress') {
+    var charCode = getEventCharCode(nativeEvent);
+
+    // The enter-key is technically both printable and non-printable and can
+    // thus be captured by `keypress`, no other non-printable key should.
+    return charCode === 13 ? 'Enter' : String.fromCharCode(charCode);
+  }
+  if (nativeEvent.type === 'keydown' || nativeEvent.type === 'keyup') {
+    // While user keyboard layout determines the actual meaning of each
+    // `keyCode` value, almost all function keys have a universal value.
+    return translateToKey[nativeEvent.keyCode] || 'Unidentified';
+  }
+  return '';
+}
+
+/**
+ * @interface KeyboardEvent
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/
+ */
+var SyntheticKeyboardEvent = SyntheticUIEvent.extend({
+  key: getEventKey,
+  location: null,
+  ctrlKey: null,
+  shiftKey: null,
+  altKey: null,
+  metaKey: null,
+  repeat: null,
+  locale: null,
+  getModifierState: getEventModifierState,
+  // Legacy Interface
+  charCode: function (event) {
+    // `charCode` is the result of a KeyPress event and represents the value of
+    // the actual printable character.
+
+    // KeyPress is deprecated, but its replacement is not yet final and not
+    // implemented in any major browser. Only KeyPress has charCode.
+    if (event.type === 'keypress') {
+      return getEventCharCode(event);
+    }
+    return 0;
+  },
+  keyCode: function (event) {
+    // `keyCode` is the result of a KeyDown/Up event and represents the value of
+    // physical keyboard key.
+
+    // The actual meaning of the value depends on the users' keyboard layout
+    // which cannot be detected. Assuming that it is a US keyboard layout
+    // provides a surprisingly accurate mapping for US and European users.
+    // Due to this, it is left to the user to implement at this time.
+    if (event.type === 'keydown' || event.type === 'keyup') {
+      return event.keyCode;
+    }
+    return 0;
+  },
+  which: function (event) {
+    // `which` is an alias for either `keyCode` or `charCode` depending on the
+    // type of the event.
+    if (event.type === 'keypress') {
+      return getEventCharCode(event);
+    }
+    if (event.type === 'keydown' || event.type === 'keyup') {
+      return event.keyCode;
+    }
+    return 0;
+  }
+});
+
+/**
+ * @interface DragEvent
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/
+ */
+var SyntheticDragEvent = SyntheticMouseEvent.extend({
+  dataTransfer: null
+});
+
+/**
+ * @interface TouchEvent
+ * @see http://www.w3.org/TR/touch-events/
+ */
+var SyntheticTouchEvent = SyntheticUIEvent.extend({
+  touches: null,
+  targetTouches: null,
+  changedTouches: null,
+  altKey: null,
+  metaKey: null,
+  ctrlKey: null,
+  shiftKey: null,
+  getModifierState: getEventModifierState
+});
+
+/**
+ * @interface Event
+ * @see http://www.w3.org/TR/2009/WD-css3-transitions-20090320/#transition-events-
+ * @see https://developer.mozilla.org/en-US/docs/Web/API/TransitionEvent
+ */
+var SyntheticTransitionEvent = SyntheticEvent$1.extend({
+  propertyName: null,
+  elapsedTime: null,
+  pseudoElement: null
+});
+
+/**
+ * @interface WheelEvent
+ * @see http://www.w3.org/TR/DOM-Level-3-Events/
+ */
+var SyntheticWheelEvent = SyntheticMouseEvent.extend({
+  deltaX: function (event) {
+    return 'deltaX' in event ? event.deltaX : // Fallback to `wheelDeltaX` for Webkit and normalize (right is positive).
+    'wheelDeltaX' in event ? -event.wheelDeltaX : 0;
+  },
+  deltaY: function (event) {
+    return 'deltaY' in event ? event.deltaY : // Fallback to `wheelDeltaY` for Webkit and normalize (down is positive).
+    'wheelDeltaY' in event ? -event.wheelDeltaY : // Fallback to `wheelDelta` for IE<9 and normalize (down is positive).
+    'wheelDelta' in event ? -event.wheelDelta : 0;
+  },
+
+  deltaZ: null,
+
+  // Browsers without "deltaMode" is reporting in raw wheel delta where one
+  // notch on the scroll is always +/- 120, roughly equivalent to pixels.
+  // A good approximation of DOM_DELTA_LINE (1) is 5% of viewport size or
+  // ~40 pixels, for DOM_DELTA_SCREEN (2) it is 87.5% of viewport size.
+  deltaMode: null
+});
+
+/**
+ * Turns
+ * ['abort', ...]
+ * into
+ * eventTypes = {
+ *   'abort': {
+ *     phasedRegistrationNames: {
+ *       bubbled: 'onAbort',
+ *       captured: 'onAbortCapture',
+ *     },
+ *     dependencies: ['topAbort'],
+ *   },
+ *   ...
+ * };
+ * topLevelEventsToDispatchConfig = {
+ *   'topAbort': { sameConfig }
+ * };
+ */
+var interactiveEventTypeNames = ['blur', 'cancel', 'click', 'close', 'contextMenu', 'copy', 'cut', 'doubleClick', 'dragEnd', 'dragStart', 'drop', 'focus', 'input', 'invalid', 'keyDown', 'keyPress', 'keyUp', 'mouseDown', 'mouseUp', 'paste', 'pause', 'play', 'rateChange', 'reset', 'seeked', 'submit', 'touchCancel', 'touchEnd', 'touchStart', 'volumeChange'];
+var nonInteractiveEventTypeNames = ['abort', 'animationEnd', 'animationIteration', 'animationStart', 'canPlay', 'canPlayThrough', 'drag', 'dragEnter', 'dragExit', 'dragLeave', 'dragOver', 'durationChange', 'emptied', 'encrypted', 'ended', 'error', 'load', 'loadedData', 'loadedMetadata', 'loadStart', 'mouseMove', 'mouseOut', 'mouseOver', 'playing', 'progress', 'scroll', 'seeking', 'stalled', 'suspend', 'timeUpdate', 'toggle', 'touchMove', 'transitionEnd', 'waiting', 'wheel'];
+
+var eventTypes$4 = {};
+var topLevelEventsToDispatchConfig = {};
+
+function addEventTypeNameToConfig(event, isInteractive) {
+  var capitalizedEvent = event[0].toUpperCase() + event.slice(1);
+  var onEvent = 'on' + capitalizedEvent;
+  var topEvent = 'top' + capitalizedEvent;
+
+  var type = {
+    phasedRegistrationNames: {
+      bubbled: onEvent,
+      captured: onEvent + 'Capture'
+    },
+    dependencies: [topEvent],
+    isInteractive: isInteractive
+  };
+  eventTypes$4[event] = type;
+  topLevelEventsToDispatchConfig[topEvent] = type;
+}
+
+interactiveEventTypeNames.forEach(function (eventTypeName) {
+  addEventTypeNameToConfig(eventTypeName, true);
+});
+nonInteractiveEventTypeNames.forEach(function (eventTypeName) {
+  addEventTypeNameToConfig(eventTypeName, false);
+});
+
+// Only used in DEV for exhaustiveness validation.
+var knownHTMLTopLevelTypes = ['topAbort', 'topCancel', 'topCanPlay', 'topCanPlayThrough', 'topClose', 'topDurationChange', 'topEmptied', 'topEncrypted', 'topEnded', 'topError', 'topInput', 'topInvalid', 'topLoad', 'topLoadedData', 'topLoadedMetadata', 'topLoadStart', 'topPause', 'topPlay', 'topPlaying', 'topProgress', 'topRateChange', 'topReset', 'topSeeked', 'topSeeking', 'topStalled', 'topSubmit', 'topSuspend', 'topTimeUpdate', 'topToggle', 'topVolumeChange', 'topWaiting'];
+
+var SimpleEventPlugin = {
+  eventTypes: eventTypes$4,
+
+  isInteractiveTopLevelEventType: function (topLevelType) {
+    var config = topLevelEventsToDispatchConfig[topLevelType];
+    return config !== undefined && config.isInteractive === true;
+  },
+
+
+  extractEvents: function (topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+    var dispatchConfig = topLevelEventsToDispatchConfig[topLevelType];
+    if (!dispatchConfig) {
+      return null;
+    }
+    var EventConstructor = void 0;
+    switch (topLevelType) {
+      case 'topKeyPress':
+        // Firefox creates a keypress event for function keys too. This removes
+        // the unwanted keypress events. Enter is however both printable and
+        // non-printable. One would expect Tab to be as well (but it isn't).
+        if (getEventCharCode(nativeEvent) === 0) {
+          return null;
+        }
+      /* falls through */
+      case 'topKeyDown':
+      case 'topKeyUp':
+        EventConstructor = SyntheticKeyboardEvent;
+        break;
+      case 'topBlur':
+      case 'topFocus':
+        EventConstructor = SyntheticFocusEvent;
+        break;
+      case 'topClick':
+        // Firefox creates a click event on right mouse clicks. This removes the
+        // unwanted click events.
+        if (nativeEvent.button === 2) {
+          return null;
+        }
+      /* falls through */
+      case 'topDoubleClick':
+      case 'topMouseDown':
+      case 'topMouseMove':
+      case 'topMouseUp':
+      // TODO: Disabled elements should not respond to mouse events
+      /* falls through */
+      case 'topMouseOut':
+      case 'topMouseOver':
+      case 'topContextMenu':
+        EventConstructor = SyntheticMouseEvent;
+        break;
+      case 'topDrag':
+      case 'topDragEnd':
+      case 'topDragEnter':
+      case 'topDragExit':
+      case 'topDragLeave':
+      case 'topDragOver':
+      case 'topDragStart':
+      case 'topDrop':
+        EventConstructor = SyntheticDragEvent;
+        break;
+      case 'topTouchCancel':
+      case 'topTouchEnd':
+      case 'topTouchMove':
+      case 'topTouchStart':
+        EventConstructor = SyntheticTouchEvent;
+        break;
+      case 'topAnimationEnd':
+      case 'topAnimationIteration':
+      case 'topAnimationStart':
+        EventConstructor = SyntheticAnimationEvent;
+        break;
+      case 'topTransitionEnd':
+        EventConstructor = SyntheticTransitionEvent;
+        break;
+      case 'topScroll':
+        EventConstructor = SyntheticUIEvent;
+        break;
+      case 'topWheel':
+        EventConstructor = SyntheticWheelEvent;
+        break;
+      case 'topCopy':
+      case 'topCut':
+      case 'topPaste':
+        EventConstructor = SyntheticClipboardEvent;
+        break;
+      default:
+        {
+          if (knownHTMLTopLevelTypes.indexOf(topLevelType) === -1) {
+            warning_1(false, 'SimpleEventPlugin: Unhandled event type, `%s`. This warning ' + 'is likely caused by a bug in React. Please file an issue.', topLevelType);
+          }
+        }
+        // HTML Events
+        // @see http://www.w3.org/TR/html5/index.html#events-0
+        EventConstructor = SyntheticEvent$1;
+        break;
+    }
+    var event = EventConstructor.getPooled(dispatchConfig, targetInst, nativeEvent, nativeEventTarget);
+    accumulateTwoPhaseDispatches(event);
+    return event;
+  }
+};
+
+var isInteractiveTopLevelEventType = SimpleEventPlugin.isInteractiveTopLevelEventType;
+
+
+var CALLBACK_BOOKKEEPING_POOL_SIZE = 10;
+var callbackBookkeepingPool = [];
+
+/**
+ * Find the deepest React component completely containing the root of the
+ * passed-in instance (for use when entire React trees are nested within each
+ * other). If React trees are not nested, returns null.
+ */
+function findRootContainerNode(inst) {
+  // TODO: It may be a good idea to cache this to prevent unnecessary DOM
+  // traversal, but caching is difficult to do correctly without using a
+  // mutation observer to listen for all DOM changes.
+  while (inst['return']) {
+    inst = inst['return'];
+  }
+  if (inst.tag !== HostRoot) {
+    // This can happen if we're in a detached tree.
+    return null;
+  }
+  return inst.stateNode.containerInfo;
+}
+
+// Used to store ancestor hierarchy in top level callback
+function getTopLevelCallbackBookKeeping(topLevelType, nativeEvent, targetInst) {
+  if (callbackBookkeepingPool.length) {
+    var instance = callbackBookkeepingPool.pop();
+    instance.topLevelType = topLevelType;
+    instance.nativeEvent = nativeEvent;
+    instance.targetInst = targetInst;
+    return instance;
+  }
+  return {
+    topLevelType: topLevelType,
+    nativeEvent: nativeEvent,
+    targetInst: targetInst,
+    ancestors: []
+  };
+}
+
+function releaseTopLevelCallbackBookKeeping(instance) {
+  instance.topLevelType = null;
+  instance.nativeEvent = null;
+  instance.targetInst = null;
+  instance.ancestors.length = 0;
+  if (callbackBookkeepingPool.length < CALLBACK_BOOKKEEPING_POOL_SIZE) {
+    callbackBookkeepingPool.push(instance);
+  }
+}
+
+function handleTopLevel(bookKeeping) {
+  var targetInst = bookKeeping.targetInst;
+
+  // Loop through the hierarchy, in case there's any nested components.
+  // It's important that we build the array of ancestors before calling any
+  // event handlers, because event handlers can modify the DOM, leading to
+  // inconsistencies with ReactMount's node cache. See #1105.
+  var ancestor = targetInst;
+  do {
+    if (!ancestor) {
+      bookKeeping.ancestors.push(ancestor);
+      break;
+    }
+    var root = findRootContainerNode(ancestor);
+    if (!root) {
+      break;
+    }
+    bookKeeping.ancestors.push(ancestor);
+    ancestor = getClosestInstanceFromNode(root);
+  } while (ancestor);
+
+  for (var i = 0; i < bookKeeping.ancestors.length; i++) {
+    targetInst = bookKeeping.ancestors[i];
+    runExtractedEventsInBatch(bookKeeping.topLevelType, targetInst, bookKeeping.nativeEvent, getEventTarget(bookKeeping.nativeEvent));
+  }
+}
+
+// TODO: can we stop exporting these?
+var _enabled = true;
+
+function setEnabled(enabled) {
+  _enabled = !!enabled;
+}
+
+function isEnabled() {
+  return _enabled;
+}
+
+/**
+ * Traps top-level events by using event bubbling.
+ *
+ * @param {string} topLevelType Record from `BrowserEventConstants`.
+ * @param {string} handlerBaseName Event name (e.g. "click").
+ * @param {object} element Element on which to attach listener.
+ * @return {?object} An object with a remove function which will forcefully
+ *                  remove the listener.
+ * @internal
+ */
+function trapBubbledEvent(topLevelType, handlerBaseName, element) {
+  if (!element) {
+    return null;
+  }
+  var dispatch = isInteractiveTopLevelEventType(topLevelType) ? dispatchInteractiveEvent : dispatchEvent;
+
+  addEventBubbleListener(element, handlerBaseName,
+  // Check if interactive and wrap in interactiveUpdates
+  dispatch.bind(null, topLevelType));
+}
+
+/**
+ * Traps a top-level event by using event capturing.
+ *
+ * @param {string} topLevelType Record from `BrowserEventConstants`.
+ * @param {string} handlerBaseName Event name (e.g. "click").
+ * @param {object} element Element on which to attach listener.
+ * @return {?object} An object with a remove function which will forcefully
+ *                  remove the listener.
+ * @internal
+ */
+function trapCapturedEvent(topLevelType, handlerBaseName, element) {
+  if (!element) {
+    return null;
+  }
+  var dispatch = isInteractiveTopLevelEventType(topLevelType) ? dispatchInteractiveEvent : dispatchEvent;
+
+  addEventCaptureListener(element, handlerBaseName,
+  // Check if interactive and wrap in interactiveUpdates
+  dispatch.bind(null, topLevelType));
+}
+
+function dispatchInteractiveEvent(topLevelType, nativeEvent) {
+  interactiveUpdates(dispatchEvent, topLevelType, nativeEvent);
+}
+
+function dispatchEvent(topLevelType, nativeEvent) {
+  if (!_enabled) {
+    return;
+  }
+
+  var nativeEventTarget = getEventTarget(nativeEvent);
+  var targetInst = getClosestInstanceFromNode(nativeEventTarget);
+  if (targetInst !== null && typeof targetInst.tag === 'number' && !isFiberMounted(targetInst)) {
+    // If we get an event (ex: img onload) before committing that
+    // component's mount, ignore it for now (that is, treat it as if it was an
+    // event on a non-React tree). We might also consider queueing events and
+    // dispatching them after the mount.
+    targetInst = null;
+  }
+
+  var bookKeeping = getTopLevelCallbackBookKeeping(topLevelType, nativeEvent, targetInst);
+
+  try {
+    // Event queue being processed in the same cycle allows
+    // `preventDefault`.
+    batchedUpdates(handleTopLevel, bookKeeping);
+  } finally {
+    releaseTopLevelCallbackBookKeeping(bookKeeping);
+  }
+}
+
+var ReactDOMEventListener = Object.freeze({
+	get _enabled () { return _enabled; },
+	setEnabled: setEnabled,
+	isEnabled: isEnabled,
+	trapBubbledEvent: trapBubbledEvent,
+	trapCapturedEvent: trapCapturedEvent,
+	dispatchEvent: dispatchEvent
+});
+
+/**
+ * Generate a mapping of standard vendor prefixes using the defined style property and event name.
+ *
+ * @param {string} styleProp
+ * @param {string} eventName
+ * @returns {object}
+ */
+function makePrefixMap(styleProp, eventName) {
+  var prefixes = {};
+
+  prefixes[styleProp.toLowerCase()] = eventName.toLowerCase();
+  prefixes['Webkit' + styleProp] = 'webkit' + eventName;
+  prefixes['Moz' + styleProp] = 'moz' + eventName;
+  prefixes['ms' + styleProp] = 'MS' + eventName;
+  prefixes['O' + styleProp] = 'o' + eventName.toLowerCase();
+
+  return prefixes;
+}
+
+/**
+ * A list of event names to a configurable list of vendor prefixes.
+ */
+var vendorPrefixes = {
+  animationend: makePrefixMap('Animation', 'AnimationEnd'),
+  animationiteration: makePrefixMap('Animation', 'AnimationIteration'),
+  animationstart: makePrefixMap('Animation', 'AnimationStart'),
+  transitionend: makePrefixMap('Transition', 'TransitionEnd')
+};
+
+/**
+ * Event names that have already been detected and prefixed (if applicable).
+ */
+var prefixedEventNames = {};
+
+/**
+ * Element to check for prefixes on.
+ */
+var style = {};
+
+/**
+ * Bootstrap if a DOM exists.
+ */
+if (ExecutionEnvironment_1.canUseDOM) {
+  style = document.createElement('div').style;
+
+  // On some platforms, in particular some releases of Android 4.x,
+  // the un-prefixed "animation" and "transition" properties are defined on the
+  // style object but the events that fire will still be prefixed, so we need
+  // to check if the un-prefixed events are usable, and if not remove them from the map.
+  if (!('AnimationEvent' in window)) {
+    delete vendorPrefixes.animationend.animation;
+    delete vendorPrefixes.animationiteration.animation;
+    delete vendorPrefixes.animationstart.animation;
+  }
+
+  // Same as above
+  if (!('TransitionEvent' in window)) {
+    delete vendorPrefixes.transitionend.transition;
+  }
+}
+
+/**
+ * Attempts to determine the correct vendor prefixed event name.
+ *
+ * @param {string} eventName
+ * @returns {string}
+ */
+function getVendorPrefixedEventName(eventName) {
+  if (prefixedEventNames[eventName]) {
+    return prefixedEventNames[eventName];
+  } else if (!vendorPrefixes[eventName]) {
+    return eventName;
+  }
+
+  var prefixMap = vendorPrefixes[eventName];
+
+  for (var styleProp in prefixMap) {
+    if (prefixMap.hasOwnProperty(styleProp) && styleProp in style) {
+      return prefixedEventNames[eventName] = prefixMap[styleProp];
+    }
+  }
+
+  return eventName;
+}
+
+/**
+ * Types of raw signals from the browser caught at the top level.
+ *
+ * For events like 'submit' or audio/video events which don't consistently
+ * bubble (which we trap at a lower node than `document`), binding
+ * at `document` would cause duplicate events so we don't include them here.
+ */
+var topLevelTypes = {
+  topAnimationEnd: getVendorPrefixedEventName('animationend'),
+  topAnimationIteration: getVendorPrefixedEventName('animationiteration'),
+  topAnimationStart: getVendorPrefixedEventName('animationstart'),
+  topBlur: 'blur',
+  topCancel: 'cancel',
+  topChange: 'change',
+  topClick: 'click',
+  topClose: 'close',
+  topCompositionEnd: 'compositionend',
+  topCompositionStart: 'compositionstart',
+  topCompositionUpdate: 'compositionupdate',
+  topContextMenu: 'contextmenu',
+  topCopy: 'copy',
+  topCut: 'cut',
+  topDoubleClick: 'dblclick',
+  topDrag: 'drag',
+  topDragEnd: 'dragend',
+  topDragEnter: 'dragenter',
+  topDragExit: 'dragexit',
+  topDragLeave: 'dragleave',
+  topDragOver: 'dragover',
+  topDragStart: 'dragstart',
+  topDrop: 'drop',
+  topFocus: 'focus',
+  topInput: 'input',
+  topKeyDown: 'keydown',
+  topKeyPress: 'keypress',
+  topKeyUp: 'keyup',
+  topLoad: 'load',
+  topLoadStart: 'loadstart',
+  topMouseDown: 'mousedown',
+  topMouseMove: 'mousemove',
+  topMouseOut: 'mouseout',
+  topMouseOver: 'mouseover',
+  topMouseUp: 'mouseup',
+  topPaste: 'paste',
+  topScroll: 'scroll',
+  topSelectionChange: 'selectionchange',
+  topTextInput: 'textInput',
+  topToggle: 'toggle',
+  topTouchCancel: 'touchcancel',
+  topTouchEnd: 'touchend',
+  topTouchMove: 'touchmove',
+  topTouchStart: 'touchstart',
+  topTransitionEnd: getVendorPrefixedEventName('transitionend'),
+  topWheel: 'wheel'
+};
+
+// There are so many media events, it makes sense to just
+// maintain a list of them. Note these aren't technically
+// "top-level" since they don't bubble. We should come up
+// with a better naming convention if we come to refactoring
+// the event system.
+var mediaEventTypes = {
+  topAbort: 'abort',
+  topCanPlay: 'canplay',
+  topCanPlayThrough: 'canplaythrough',
+  topDurationChange: 'durationchange',
+  topEmptied: 'emptied',
+  topEncrypted: 'encrypted',
+  topEnded: 'ended',
+  topError: 'error',
+  topLoadedData: 'loadeddata',
+  topLoadedMetadata: 'loadedmetadata',
+  topLoadStart: 'loadstart',
+  topPause: 'pause',
+  topPlay: 'play',
+  topPlaying: 'playing',
+  topProgress: 'progress',
+  topRateChange: 'ratechange',
+  topSeeked: 'seeked',
+  topSeeking: 'seeking',
+  topStalled: 'stalled',
+  topSuspend: 'suspend',
+  topTimeUpdate: 'timeupdate',
+  topVolumeChange: 'volumechange',
+  topWaiting: 'waiting'
+};
+
+/**
+ * Summary of `ReactBrowserEventEmitter` event handling:
+ *
+ *  - Top-level delegation is used to trap most native browser events. This
+ *    may only occur in the main thread and is the responsibility of
+ *    ReactDOMEventListener, which is injected and can therefore support
+ *    pluggable event sources. This is the only work that occurs in the main
+ *    thread.
+ *
+ *  - We normalize and de-duplicate events to account for browser quirks. This
+ *    may be done in the worker thread.
+ *
+ *  - Forward these native events (with the associated top-level type used to
+ *    trap it) to `EventPluginHub`, which in turn will ask plugins if they want
+ *    to extract any synthetic events.
+ *
+ *  - The `EventPluginHub` will then process each event by annotating them with
+ *    "dispatches", a sequence of listeners and IDs that care about that event.
+ *
+ *  - The `EventPluginHub` then dispatches the events.
+ *
+ * Overview of React and the event system:
+ *
+ * +------------+    .
+ * |    DOM     |    .
+ * +------------+    .
+ *       |           .
+ *       v           .
+ * +------------+    .
+ * | ReactEvent |    .
+ * |  Listener  |    .
+ * +------------+    .                         +-----------+
+ *       |           .               +--------+|SimpleEvent|
+ *       |           .               |         |Plugin     |
+ * +-----|------+    .               v         +-----------+
+ * |     |      |    .    +--------------+                    +------------+
+ * |     +-----------.--->|EventPluginHub|                    |    Event   |
+ * |            |    .    |              |     +-----------+  | Propagators|
+ * | ReactEvent |    .    |              |     |TapEvent   |  |------------|
+ * |  Emitter   |    .    |              |<---+|Plugin     |  |other plugin|
+ * |            |    .    |              |     +-----------+  |  utilities |
+ * |     +-----------.--->|              |                    +------------+
+ * |     |      |    .    +--------------+
+ * +-----|------+    .                ^        +-----------+
+ *       |           .                |        |Enter/Leave|
+ *       +           .                +-------+|Plugin     |
+ * +-------------+   .                         +-----------+
+ * | application |   .
+ * |-------------|   .
+ * |             |   .
+ * |             |   .
+ * +-------------+   .
+ *                   .
+ *    React Core     .  General Purpose Event Plugin System
+ */
+
+var alreadyListeningTo = {};
+var reactTopListenersCounter = 0;
+
+/**
+ * To ensure no conflicts with other potential React instances on the page
+ */
+var topListenersIDKey = '_reactListenersID' + ('' + Math.random()).slice(2);
+
+function getListeningForDocument(mountAt) {
+  // In IE8, `mountAt` is a host object and doesn't have `hasOwnProperty`
+  // directly.
+  if (!Object.prototype.hasOwnProperty.call(mountAt, topListenersIDKey)) {
+    mountAt[topListenersIDKey] = reactTopListenersCounter++;
+    alreadyListeningTo[mountAt[topListenersIDKey]] = {};
+  }
+  return alreadyListeningTo[mountAt[topListenersIDKey]];
+}
+
+/**
+ * We listen for bubbled touch events on the document object.
+ *
+ * Firefox v8.01 (and possibly others) exhibited strange behavior when
+ * mounting `onmousemove` events at some node that was not the document
+ * element. The symptoms were that if your mouse is not moving over something
+ * contained within that mount point (for example on the background) the
+ * top-level listeners for `onmousemove` won't be called. However, if you
+ * register the `mousemove` on the document object, then it will of course
+ * catch all `mousemove`s. This along with iOS quirks, justifies restricting
+ * top-level listeners to the document object only, at least for these
+ * movement types of events and possibly all events.
+ *
+ * @see http://www.quirksmode.org/blog/archives/2010/09/click_event_del.html
+ *
+ * Also, `keyup`/`keypress`/`keydown` do not bubble to the window on IE, but
+ * they bubble to document.
+ *
+ * @param {string} registrationName Name of listener (e.g. `onClick`).
+ * @param {object} contentDocumentHandle Document which owns the container
+ */
+function listenTo(registrationName, contentDocumentHandle) {
+  var mountAt = contentDocumentHandle;
+  var isListening = getListeningForDocument(mountAt);
+  var dependencies = registrationNameDependencies[registrationName];
+
+  for (var i = 0; i < dependencies.length; i++) {
+    var dependency = dependencies[i];
+    if (!(isListening.hasOwnProperty(dependency) && isListening[dependency])) {
+      if (dependency === 'topScroll') {
+        trapCapturedEvent('topScroll', 'scroll', mountAt);
+      } else if (dependency === 'topFocus' || dependency === 'topBlur') {
+        trapCapturedEvent('topFocus', 'focus', mountAt);
+        trapCapturedEvent('topBlur', 'blur', mountAt);
+
+        // to make sure blur and focus event listeners are only attached once
+        isListening.topBlur = true;
+        isListening.topFocus = true;
+      } else if (dependency === 'topCancel') {
+        if (isEventSupported('cancel', true)) {
+          trapCapturedEvent('topCancel', 'cancel', mountAt);
+        }
+        isListening.topCancel = true;
+      } else if (dependency === 'topClose') {
+        if (isEventSupported('close', true)) {
+          trapCapturedEvent('topClose', 'close', mountAt);
+        }
+        isListening.topClose = true;
+      } else if (topLevelTypes.hasOwnProperty(dependency)) {
+        trapBubbledEvent(dependency, topLevelTypes[dependency], mountAt);
+      }
+
+      isListening[dependency] = true;
+    }
+  }
+}
+
+function isListeningToAllDependencies(registrationName, mountAt) {
+  var isListening = getListeningForDocument(mountAt);
+  var dependencies = registrationNameDependencies[registrationName];
+  for (var i = 0; i < dependencies.length; i++) {
+    var dependency = dependencies[i];
+    if (!(isListening.hasOwnProperty(dependency) && isListening[dependency])) {
+      return false;
+    }
+  }
+  return true;
+}
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ */
+
+/**
+ * @param {*} object The object to check.
+ * @return {boolean} Whether or not the object is a DOM node.
+ */
+function isNode(object) {
+  var doc = object ? object.ownerDocument || object : document;
+  var defaultView = doc.defaultView || window;
+  return !!(object && (typeof defaultView.Node === 'function' ? object instanceof defaultView.Node : typeof object === 'object' && typeof object.nodeType === 'number' && typeof object.nodeName === 'string'));
+}
+
+var isNode_1 = isNode;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ */
+
+
+
+/**
+ * @param {*} object The object to check.
+ * @return {boolean} Whether or not the object is a DOM text node.
+ */
+function isTextNode(object) {
+  return isNode_1(object) && object.nodeType == 3;
+}
+
+var isTextNode_1 = isTextNode;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * 
+ */
+
+
+
+/*eslint-disable no-bitwise */
+
+/**
+ * Checks if a given DOM node contains or is another DOM node.
+ */
+function containsNode(outerNode, innerNode) {
+  if (!outerNode || !innerNode) {
+    return false;
+  } else if (outerNode === innerNode) {
+    return true;
+  } else if (isTextNode_1(outerNode)) {
+    return false;
+  } else if (isTextNode_1(innerNode)) {
+    return containsNode(outerNode, innerNode.parentNode);
+  } else if ('contains' in outerNode) {
+    return outerNode.contains(innerNode);
+  } else if (outerNode.compareDocumentPosition) {
+    return !!(outerNode.compareDocumentPosition(innerNode) & 16);
+  } else {
+    return false;
+  }
+}
+
+var containsNode_1 = containsNode;
+
+/**
+ * Given any node return the first leaf node without children.
+ *
+ * @param {DOMElement|DOMTextNode} node
+ * @return {DOMElement|DOMTextNode}
+ */
+function getLeafNode(node) {
+  while (node && node.firstChild) {
+    node = node.firstChild;
+  }
+  return node;
+}
+
+/**
+ * Get the next sibling within a container. This will walk up the
+ * DOM if a node's siblings have been exhausted.
+ *
+ * @param {DOMElement|DOMTextNode} node
+ * @return {?DOMElement|DOMTextNode}
+ */
+function getSiblingNode(node) {
+  while (node) {
+    if (node.nextSibling) {
+      return node.nextSibling;
+    }
+    node = node.parentNode;
+  }
+}
+
+/**
+ * Get object describing the nodes which contain characters at offset.
+ *
+ * @param {DOMElement|DOMTextNode} root
+ * @param {number} offset
+ * @return {?object}
+ */
+function getNodeForCharacterOffset(root, offset) {
+  var node = getLeafNode(root);
+  var nodeStart = 0;
+  var nodeEnd = 0;
+
+  while (node) {
+    if (node.nodeType === TEXT_NODE) {
+      nodeEnd = nodeStart + node.textContent.length;
+
+      if (nodeStart <= offset && nodeEnd >= offset) {
+        return {
+          node: node,
+          offset: offset - nodeStart
+        };
+      }
+
+      nodeStart = nodeEnd;
+    }
+
+    node = getLeafNode(getSiblingNode(node));
+  }
+}
+
+/**
+ * @param {DOMElement} outerNode
+ * @return {?object}
+ */
+function getOffsets(outerNode) {
+  var selection = window.getSelection && window.getSelection();
+
+  if (!selection || selection.rangeCount === 0) {
+    return null;
+  }
+
+  var anchorNode = selection.anchorNode,
+      anchorOffset = selection.anchorOffset,
+      focusNode = selection.focusNode,
+      focusOffset = selection.focusOffset;
+
+  // In Firefox, anchorNode and focusNode can be "anonymous divs", e.g. the
+  // up/down buttons on an <input type="number">. Anonymous divs do not seem to
+  // expose properties, triggering a "Permission denied error" if any of its
+  // properties are accessed. The only seemingly possible way to avoid erroring
+  // is to access a property that typically works for non-anonymous divs and
+  // catch any error that may otherwise arise. See
+  // https://bugzilla.mozilla.org/show_bug.cgi?id=208427
+
+  try {
+    /* eslint-disable no-unused-expressions */
+    anchorNode.nodeType;
+    focusNode.nodeType;
+    /* eslint-enable no-unused-expressions */
+  } catch (e) {
+    return null;
+  }
+
+  return getModernOffsetsFromPoints(outerNode, anchorNode, anchorOffset, focusNode, focusOffset);
+}
+
+/**
+ * Returns {start, end} where `start` is the character/codepoint index of
+ * (anchorNode, anchorOffset) within the textContent of `outerNode`, and
+ * `end` is the index of (focusNode, focusOffset).
+ *
+ * Returns null if you pass in garbage input but we should probably just crash.
+ *
+ * Exported only for testing.
+ */
+function getModernOffsetsFromPoints(outerNode, anchorNode, anchorOffset, focusNode, focusOffset) {
+  var length = 0;
+  var start = -1;
+  var end = -1;
+  var indexWithinAnchor = 0;
+  var indexWithinFocus = 0;
+  var node = outerNode;
+  var parentNode = null;
+
+  outer: while (true) {
+    var next = null;
+
+    while (true) {
+      if (node === anchorNode && (anchorOffset === 0 || node.nodeType === TEXT_NODE)) {
+        start = length + anchorOffset;
+      }
+      if (node === focusNode && (focusOffset === 0 || node.nodeType === TEXT_NODE)) {
+        end = length + focusOffset;
+      }
+
+      if (node.nodeType === TEXT_NODE) {
+        length += node.nodeValue.length;
+      }
+
+      if ((next = node.firstChild) === null) {
+        break;
+      }
+      // Moving from `node` to its first child `next`.
+      parentNode = node;
+      node = next;
+    }
+
+    while (true) {
+      if (node === outerNode) {
+        // If `outerNode` has children, this is always the second time visiting
+        // it. If it has no children, this is still the first loop, and the only
+        // valid selection is anchorNode and focusNode both equal to this node
+        // and both offsets 0, in which case we will have handled above.
+        break outer;
+      }
+      if (parentNode === anchorNode && ++indexWithinAnchor === anchorOffset) {
+        start = length;
+      }
+      if (parentNode === focusNode && ++indexWithinFocus === focusOffset) {
+        end = length;
+      }
+      if ((next = node.nextSibling) !== null) {
+        break;
+      }
+      node = parentNode;
+      parentNode = node.parentNode;
+    }
+
+    // Moving from `node` to its next sibling `next`.
+    node = next;
+  }
+
+  if (start === -1 || end === -1) {
+    // This should never happen. (Would happen if the anchor/focus nodes aren't
+    // actually inside the passed-in node.)
+    return null;
+  }
+
+  return {
+    start: start,
+    end: end
+  };
+}
+
+/**
+ * In modern non-IE browsers, we can support both forward and backward
+ * selections.
+ *
+ * Note: IE10+ supports the Selection object, but it does not support
+ * the `extend` method, which means that even in modern IE, it's not possible
+ * to programmatically create a backward selection. Thus, for all IE
+ * versions, we use the old IE API to create our selections.
+ *
+ * @param {DOMElement|DOMTextNode} node
+ * @param {object} offsets
+ */
+function setOffsets(node, offsets) {
+  if (!window.getSelection) {
+    return;
+  }
+
+  var selection = window.getSelection();
+  var length = node[getTextContentAccessor()].length;
+  var start = Math.min(offsets.start, length);
+  var end = offsets.end === undefined ? start : Math.min(offsets.end, length);
+
+  // IE 11 uses modern selection, but doesn't support the extend method.
+  // Flip backward selections, so we can set with a single range.
+  if (!selection.extend && start > end) {
+    var temp = end;
+    end = start;
+    start = temp;
+  }
+
+  var startMarker = getNodeForCharacterOffset(node, start);
+  var endMarker = getNodeForCharacterOffset(node, end);
+
+  if (startMarker && endMarker) {
+    if (selection.rangeCount === 1 && selection.anchorNode === startMarker.node && selection.anchorOffset === startMarker.offset && selection.focusNode === endMarker.node && selection.focusOffset === endMarker.offset) {
+      return;
+    }
+    var range = document.createRange();
+    range.setStart(startMarker.node, startMarker.offset);
+    selection.removeAllRanges();
+
+    if (start > end) {
+      selection.addRange(range);
+      selection.extend(endMarker.node, endMarker.offset);
+    } else {
+      range.setEnd(endMarker.node, endMarker.offset);
+      selection.addRange(range);
+    }
+  }
+}
+
+function isInDocument(node) {
+  return containsNode_1(document.documentElement, node);
+}
+
+/**
+ * @ReactInputSelection: React input selection module. Based on Selection.js,
+ * but modified to be suitable for react and has a couple of bug fixes (doesn't
+ * assume buttons have range selections allowed).
+ * Input selection module for React.
+ */
+
+function hasSelectionCapabilities(elem) {
+  var nodeName = elem && elem.nodeName && elem.nodeName.toLowerCase();
+  return nodeName && (nodeName === 'input' && elem.type === 'text' || nodeName === 'textarea' || elem.contentEditable === 'true');
+}
+
+function getSelectionInformation() {
+  var focusedElem = getActiveElement_1();
+  return {
+    focusedElem: focusedElem,
+    selectionRange: hasSelectionCapabilities(focusedElem) ? getSelection$1(focusedElem) : null
+  };
+}
+
+/**
+ * @restoreSelection: If any selection information was potentially lost,
+ * restore it. This is useful when performing operations that could remove dom
+ * nodes and place them back in, resulting in focus being lost.
+ */
+function restoreSelection(priorSelectionInformation) {
+  var curFocusedElem = getActiveElement_1();
+  var priorFocusedElem = priorSelectionInformation.focusedElem;
+  var priorSelectionRange = priorSelectionInformation.selectionRange;
+  if (curFocusedElem !== priorFocusedElem && isInDocument(priorFocusedElem)) {
+    if (hasSelectionCapabilities(priorFocusedElem)) {
+      setSelection(priorFocusedElem, priorSelectionRange);
+    }
+
+    // Focusing a node can change the scroll position, which is undesirable
+    var ancestors = [];
+    var ancestor = priorFocusedElem;
+    while (ancestor = ancestor.parentNode) {
+      if (ancestor.nodeType === ELEMENT_NODE) {
+        ancestors.push({
+          element: ancestor,
+          left: ancestor.scrollLeft,
+          top: ancestor.scrollTop
+        });
+      }
+    }
+
+    priorFocusedElem.focus();
+
+    for (var i = 0; i < ancestors.length; i++) {
+      var info = ancestors[i];
+      info.element.scrollLeft = info.left;
+      info.element.scrollTop = info.top;
+    }
+  }
+}
+
+/**
+ * @getSelection: Gets the selection bounds of a focused textarea, input or
+ * contentEditable node.
+ * -@input: Look up selection bounds of this input
+ * -@return {start: selectionStart, end: selectionEnd}
+ */
+function getSelection$1(input) {
+  var selection = void 0;
+
+  if ('selectionStart' in input) {
+    // Modern browser with input or textarea.
+    selection = {
+      start: input.selectionStart,
+      end: input.selectionEnd
+    };
+  } else {
+    // Content editable or old IE textarea.
+    selection = getOffsets(input);
+  }
+
+  return selection || { start: 0, end: 0 };
+}
+
+/**
+ * @setSelection: Sets the selection bounds of a textarea or input and focuses
+ * the input.
+ * -@input     Set selection bounds of this input or textarea
+ * -@offsets   Object of same form that is returned from get*
+ */
+function setSelection(input, offsets) {
+  var start = offsets.start,
+      end = offsets.end;
+
+  if (end === undefined) {
+    end = start;
+  }
+
+  if ('selectionStart' in input) {
+    input.selectionStart = start;
+    input.selectionEnd = Math.min(end, input.value.length);
+  } else {
+    setOffsets(input, offsets);
+  }
+}
+
+var skipSelectionChangeEvent = ExecutionEnvironment_1.canUseDOM && 'documentMode' in document && document.documentMode <= 11;
+
+var eventTypes$3 = {
+  select: {
+    phasedRegistrationNames: {
+      bubbled: 'onSelect',
+      captured: 'onSelectCapture'
+    },
+    dependencies: ['topBlur', 'topContextMenu', 'topFocus', 'topKeyDown', 'topKeyUp', 'topMouseDown', 'topMouseUp', 'topSelectionChange']
+  }
+};
+
+var activeElement$1 = null;
+var activeElementInst$1 = null;
+var lastSelection = null;
+var mouseDown = false;
+
+/**
+ * Get an object which is a unique representation of the current selection.
+ *
+ * The return value will not be consistent across nodes or browsers, but
+ * two identical selections on the same node will return identical objects.
+ *
+ * @param {DOMElement} node
+ * @return {object}
+ */
+function getSelection(node) {
+  if ('selectionStart' in node && hasSelectionCapabilities(node)) {
+    return {
+      start: node.selectionStart,
+      end: node.selectionEnd
+    };
+  } else if (window.getSelection) {
+    var selection = window.getSelection();
+    return {
+      anchorNode: selection.anchorNode,
+      anchorOffset: selection.anchorOffset,
+      focusNode: selection.focusNode,
+      focusOffset: selection.focusOffset
+    };
+  }
+}
+
+/**
+ * Poll selection to see whether it's changed.
+ *
+ * @param {object} nativeEvent
+ * @return {?SyntheticEvent}
+ */
+function constructSelectEvent(nativeEvent, nativeEventTarget) {
+  // Ensure we have the right element, and that the user is not dragging a
+  // selection (this matches native `select` event behavior). In HTML5, select
+  // fires only on input and textarea thus if there's no focused element we
+  // won't dispatch.
+  if (mouseDown || activeElement$1 == null || activeElement$1 !== getActiveElement_1()) {
+    return null;
+  }
+
+  // Only fire when selection has actually changed.
+  var currentSelection = getSelection(activeElement$1);
+  if (!lastSelection || !shallowEqual_1(lastSelection, currentSelection)) {
+    lastSelection = currentSelection;
+
+    var syntheticEvent = SyntheticEvent$1.getPooled(eventTypes$3.select, activeElementInst$1, nativeEvent, nativeEventTarget);
+
+    syntheticEvent.type = 'select';
+    syntheticEvent.target = activeElement$1;
+
+    accumulateTwoPhaseDispatches(syntheticEvent);
+
+    return syntheticEvent;
+  }
+
+  return null;
+}
+
+/**
+ * This plugin creates an `onSelect` event that normalizes select events
+ * across form elements.
+ *
+ * Supported elements are:
+ * - input (see `isTextInputElement`)
+ * - textarea
+ * - contentEditable
+ *
+ * This differs from native browser implementations in the following ways:
+ * - Fires on contentEditable fields as well as inputs.
+ * - Fires for collapsed selection.
+ * - Fires after user input.
+ */
+var SelectEventPlugin = {
+  eventTypes: eventTypes$3,
+
+  extractEvents: function (topLevelType, targetInst, nativeEvent, nativeEventTarget) {
+    var doc = nativeEventTarget.window === nativeEventTarget ? nativeEventTarget.document : nativeEventTarget.nodeType === DOCUMENT_NODE ? nativeEventTarget : nativeEventTarget.ownerDocument;
+    // Track whether all listeners exists for this plugin. If none exist, we do
+    // not extract events. See #3639.
+    if (!doc || !isListeningToAllDependencies('onSelect', doc)) {
+      return null;
+    }
+
+    var targetNode = targetInst ? getNodeFromInstance$1(targetInst) : window;
+
+    switch (topLevelType) {
+      // Track the input node that has focus.
+      case 'topFocus':
+        if (isTextInputElement(targetNode) || targetNode.contentEditable === 'true') {
+          activeElement$1 = targetNode;
+          activeElementInst$1 = targetInst;
+          lastSelection = null;
+        }
+        break;
+      case 'topBlur':
+        activeElement$1 = null;
+        activeElementInst$1 = null;
+        lastSelection = null;
+        break;
+      // Don't fire the event while the user is dragging. This matches the
+      // semantics of the native select event.
+      case 'topMouseDown':
+        mouseDown = true;
+        break;
+      case 'topContextMenu':
+      case 'topMouseUp':
+        mouseDown = false;
+        return constructSelectEvent(nativeEvent, nativeEventTarget);
+      // Chrome and IE fire non-standard event when selection is changed (and
+      // sometimes when it hasn't). IE's event fires out of order with respect
+      // to key and input events on deletion, so we discard it.
+      //
+      // Firefox doesn't support selectionchange, so check selection status
+      // after each key entry. The selection changes after keydown and before
+      // keyup, but we check on keydown as well in the case of holding down a
+      // key, when multiple keydown events are fired but only one keyup is.
+      // This is also our approach for IE handling, for the reason above.
+      case 'topSelectionChange':
+        if (skipSelectionChangeEvent) {
+          break;
+        }
+      // falls through
+      case 'topKeyDown':
+      case 'topKeyUp':
+        return constructSelectEvent(nativeEvent, nativeEventTarget);
+    }
+
+    return null;
+  }
+};
+
+/**
+ * Inject modules for resolving DOM hierarchy and plugin ordering.
+ */
+injection.injectEventPluginOrder(DOMEventPluginOrder);
+injection$1.injectComponentTree(ReactDOMComponentTree);
+
+/**
+ * Some important event plugins included by default (without having to require
+ * them).
+ */
+injection.injectEventPluginsByName({
+  SimpleEventPlugin: SimpleEventPlugin,
+  EnterLeaveEventPlugin: EnterLeaveEventPlugin,
+  ChangeEventPlugin: ChangeEventPlugin,
+  SelectEventPlugin: SelectEventPlugin,
+  BeforeInputEventPlugin: BeforeInputEventPlugin
+});
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+var emptyObject = {};
+
+{
+  Object.freeze(emptyObject);
+}
+
+var emptyObject_1 = emptyObject;
+
+// Max 31 bit integer. The max integer size in V8 for 32-bit systems.
+// Math.pow(2, 30) - 1
+// 0b111111111111111111111111111111
+var MAX_SIGNED_31_BIT_INT = 1073741823;
+
+// TODO: Use an opaque type once ESLint et al support the syntax
+
+
+var NoWork = 0;
+var Sync = 1;
+var Never = MAX_SIGNED_31_BIT_INT;
+
+var UNIT_SIZE = 10;
+var MAGIC_NUMBER_OFFSET = 2;
+
+// 1 unit of expiration time represents 10ms.
+function msToExpirationTime(ms) {
+  // Always add an offset so that we don't clash with the magic number for NoWork.
+  return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;
+}
+
+function expirationTimeToMs(expirationTime) {
+  return (expirationTime - MAGIC_NUMBER_OFFSET) * UNIT_SIZE;
+}
+
+function ceiling(num, precision) {
+  return ((num / precision | 0) + 1) * precision;
+}
+
+function computeExpirationBucket(currentTime, expirationInMs, bucketSizeMs) {
+  return ceiling(currentTime + expirationInMs / UNIT_SIZE, bucketSizeMs / UNIT_SIZE);
+}
+
+var NoContext = 0;
+var AsyncMode = 1;
+var StrictMode = 2;
+
+var hasBadMapPolyfill = void 0;
+
+{
+  hasBadMapPolyfill = false;
+  try {
+    var nonExtensibleObject = Object.preventExtensions({});
+    var testMap = new Map([[nonExtensibleObject, null]]);
+    var testSet = new Set([nonExtensibleObject]);
+    // This is necessary for Rollup to not consider these unused.
+    // https://github.com/rollup/rollup/issues/1771
+    // TODO: we can remove these if Rollup fixes the bug.
+    testMap.set(0, 0);
+    testSet.add(0);
+  } catch (e) {
+    // TODO: Consider warning about bad polyfills
+    hasBadMapPolyfill = true;
+  }
+}
+
+// A Fiber is work on a Component that needs to be done or was done. There can
+// be more than one per component.
+
+
+var debugCounter = void 0;
+
+{
+  debugCounter = 1;
+}
+
+function FiberNode(tag, pendingProps, key, mode) {
+  // Instance
+  this.tag = tag;
+  this.key = key;
+  this.type = null;
+  this.stateNode = null;
+
+  // Fiber
+  this['return'] = null;
+  this.child = null;
+  this.sibling = null;
+  this.index = 0;
+
+  this.ref = null;
+
+  this.pendingProps = pendingProps;
+  this.memoizedProps = null;
+  this.updateQueue = null;
+  this.memoizedState = null;
+
+  this.mode = mode;
+
+  // Effects
+  this.effectTag = NoEffect;
+  this.nextEffect = null;
+
+  this.firstEffect = null;
+  this.lastEffect = null;
+
+  this.expirationTime = NoWork;
+
+  this.alternate = null;
+
+  {
+    this._debugID = debugCounter++;
+    this._debugSource = null;
+    this._debugOwner = null;
+    this._debugIsCurrentlyTiming = false;
+    if (!hasBadMapPolyfill && typeof Object.preventExtensions === 'function') {
+      Object.preventExtensions(this);
+    }
+  }
+}
+
+// This is a constructor function, rather than a POJO constructor, still
+// please ensure we do the following:
+// 1) Nobody should add any instance methods on this. Instance methods can be
+//    more difficult to predict when they get optimized and they are almost
+//    never inlined properly in static compilers.
+// 2) Nobody should rely on `instanceof Fiber` for type testing. We should
+//    always know when it is a fiber.
+// 3) We might want to experiment with using numeric keys since they are easier
+//    to optimize in a non-JIT environment.
+// 4) We can easily go from a constructor to a createFiber object literal if that
+//    is faster.
+// 5) It should be easy to port this to a C struct and keep a C implementation
+//    compatible.
+var createFiber = function (tag, pendingProps, key, mode) {
+  // $FlowFixMe: the shapes are exact here but Flow doesn't like constructors
+  return new FiberNode(tag, pendingProps, key, mode);
+};
+
+function shouldConstruct(Component) {
+  return !!(Component.prototype && Component.prototype.isReactComponent);
+}
+
+// This is used to create an alternate fiber to do work on.
+function createWorkInProgress(current, pendingProps, expirationTime) {
+  var workInProgress = current.alternate;
+  if (workInProgress === null) {
+    // We use a double buffering pooling technique because we know that we'll
+    // only ever need at most two versions of a tree. We pool the "other" unused
+    // node that we're free to reuse. This is lazily created to avoid allocating
+    // extra objects for things that are never updated. It also allow us to
+    // reclaim the extra memory if needed.
+    workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);
+    workInProgress.type = current.type;
+    workInProgress.stateNode = current.stateNode;
+
+    {
+      // DEV-only fields
+      workInProgress._debugID = current._debugID;
+      workInProgress._debugSource = current._debugSource;
+      workInProgress._debugOwner = current._debugOwner;
+    }
+
+    workInProgress.alternate = current;
+    current.alternate = workInProgress;
+  } else {
+    workInProgress.pendingProps = pendingProps;
+
+    // We already have an alternate.
+    // Reset the effect tag.
+    workInProgress.effectTag = NoEffect;
+
+    // The effect list is no longer valid.
+    workInProgress.nextEffect = null;
+    workInProgress.firstEffect = null;
+    workInProgress.lastEffect = null;
+  }
+
+  workInProgress.expirationTime = expirationTime;
+
+  workInProgress.child = current.child;
+  workInProgress.memoizedProps = current.memoizedProps;
+  workInProgress.memoizedState = current.memoizedState;
+  workInProgress.updateQueue = current.updateQueue;
+
+  // These will be overridden during the parent's reconciliation
+  workInProgress.sibling = current.sibling;
+  workInProgress.index = current.index;
+  workInProgress.ref = current.ref;
+
+  return workInProgress;
+}
+
+function createHostRootFiber(isAsync) {
+  var mode = isAsync ? AsyncMode | StrictMode : NoContext;
+  return createFiber(HostRoot, null, null, mode);
+}
+
+function createFiberFromElement(element, mode, expirationTime) {
+  var owner = null;
+  {
+    owner = element._owner;
+  }
+
+  var fiber = void 0;
+  var type = element.type;
+  var key = element.key;
+  var pendingProps = element.props;
+
+  var fiberTag = void 0;
+  if (typeof type === 'function') {
+    fiberTag = shouldConstruct(type) ? ClassComponent : IndeterminateComponent;
+  } else if (typeof type === 'string') {
+    fiberTag = HostComponent;
+  } else {
+    switch (type) {
+      case REACT_FRAGMENT_TYPE:
+        return createFiberFromFragment(pendingProps.children, mode, expirationTime, key);
+      case REACT_ASYNC_MODE_TYPE:
+        fiberTag = Mode;
+        mode |= AsyncMode | StrictMode;
+        break;
+      case REACT_STRICT_MODE_TYPE:
+        fiberTag = Mode;
+        mode |= StrictMode;
+        break;
+      case REACT_CALL_TYPE:
+        fiberTag = CallComponent;
+        break;
+      case REACT_RETURN_TYPE:
+        fiberTag = ReturnComponent;
+        break;
+      default:
+        {
+          if (typeof type === 'object' && type !== null) {
+            switch (type.$$typeof) {
+              case REACT_PROVIDER_TYPE:
+                fiberTag = ContextProvider;
+                break;
+              case REACT_CONTEXT_TYPE:
+                // This is a consumer
+                fiberTag = ContextConsumer;
+                break;
+              case REACT_FORWARD_REF_TYPE:
+                fiberTag = ForwardRef;
+                break;
+              default:
+                if (typeof type.tag === 'number') {
+                  // Currently assumed to be a continuation and therefore is a
+                  // fiber already.
+                  // TODO: The yield system is currently broken for updates in
+                  // some cases. The reified yield stores a fiber, but we don't
+                  // know which fiber that is; the current or a workInProgress?
+                  // When the continuation gets rendered here we don't know if we
+                  // can reuse that fiber or if we need to clone it. There is
+                  // probably a clever way to restructure this.
+                  fiber = type;
+                  fiber.pendingProps = pendingProps;
+                  fiber.expirationTime = expirationTime;
+                  return fiber;
+                } else {
+                  throwOnInvalidElementType(type, owner);
+                }
+                break;
+            }
+          } else {
+            throwOnInvalidElementType(type, owner);
+          }
+        }
+    }
+  }
+
+  fiber = createFiber(fiberTag, pendingProps, key, mode);
+  fiber.type = type;
+  fiber.expirationTime = expirationTime;
+
+  {
+    fiber._debugSource = element._source;
+    fiber._debugOwner = element._owner;
+  }
+
+  return fiber;
+}
+
+function throwOnInvalidElementType(type, owner) {
+  var info = '';
+  {
+    if (type === undefined || typeof type === 'object' && type !== null && Object.keys(type).length === 0) {
+      info += ' You likely forgot to export your component from the file ' + "it's defined in, or you might have mixed up default and " + 'named imports.';
+    }
+    var ownerName = owner ? getComponentName(owner) : null;
+    if (ownerName) {
+      info += '\n\nCheck the render method of `' + ownerName + '`.';
+    }
+  }
+  invariant_1(false, 'Element type is invalid: expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s', type == null ? type : typeof type, info);
+}
+
+function createFiberFromFragment(elements, mode, expirationTime, key) {
+  var fiber = createFiber(Fragment, elements, key, mode);
+  fiber.expirationTime = expirationTime;
+  return fiber;
+}
+
+function createFiberFromText(content, mode, expirationTime) {
+  var fiber = createFiber(HostText, content, null, mode);
+  fiber.expirationTime = expirationTime;
+  return fiber;
+}
+
+function createFiberFromHostInstanceForDeletion() {
+  var fiber = createFiber(HostComponent, null, null, NoContext);
+  fiber.type = 'DELETED';
+  return fiber;
+}
+
+function createFiberFromPortal(portal, mode, expirationTime) {
+  var pendingProps = portal.children !== null ? portal.children : [];
+  var fiber = createFiber(HostPortal, pendingProps, portal.key, mode);
+  fiber.expirationTime = expirationTime;
+  fiber.stateNode = {
+    containerInfo: portal.containerInfo,
+    pendingChildren: null, // Used by persistent updates
+    implementation: portal.implementation
+  };
+  return fiber;
+}
+
+// TODO: This should be lifted into the renderer.
+
+
+function createFiberRoot(containerInfo, isAsync, hydrate) {
+  // Cyclic construction. This cheats the type system right now because
+  // stateNode is any.
+  var uninitializedFiber = createHostRootFiber(isAsync);
+  var root = {
+    current: uninitializedFiber,
+    containerInfo: containerInfo,
+    pendingChildren: null,
+    pendingCommitExpirationTime: NoWork,
+    finishedWork: null,
+    context: null,
+    pendingContext: null,
+    hydrate: hydrate,
+    remainingExpirationTime: NoWork,
+    firstBatch: null,
+    nextScheduledRoot: null
+  };
+  uninitializedFiber.stateNode = root;
+  return root;
+}
+
+var onCommitFiberRoot = null;
+var onCommitFiberUnmount = null;
+var hasLoggedError = false;
+
+function catchErrors(fn) {
+  return function (arg) {
+    try {
+      return fn(arg);
+    } catch (err) {
+      if (true && !hasLoggedError) {
+        hasLoggedError = true;
+        warning_1(false, 'React DevTools encountered an error: %s', err);
+      }
+    }
+  };
+}
+
+function injectInternals(internals) {
+  if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ === 'undefined') {
+    // No DevTools
+    return false;
+  }
+  var hook = __REACT_DEVTOOLS_GLOBAL_HOOK__;
+  if (hook.isDisabled) {
+    // This isn't a real property on the hook, but it can be set to opt out
+    // of DevTools integration and associated warnings and logs.
+    // https://github.com/facebook/react/issues/3877
+    return true;
+  }
+  if (!hook.supportsFiber) {
+    {
+      warning_1(false, 'The installed version of React DevTools is too old and will not work ' + 'with the current version of React. Please update React DevTools. ' + 'https://fb.me/react-devtools');
+    }
+    // DevTools exists, even though it doesn't support Fiber.
+    return true;
+  }
+  try {
+    var rendererID = hook.inject(internals);
+    // We have successfully injected, so now it is safe to set up hooks.
+    onCommitFiberRoot = catchErrors(function (root) {
+      return hook.onCommitFiberRoot(rendererID, root);
+    });
+    onCommitFiberUnmount = catchErrors(function (fiber) {
+      return hook.onCommitFiberUnmount(rendererID, fiber);
+    });
+  } catch (err) {
+    // Catch all errors because it is unsafe to throw during initialization.
+    {
+      warning_1(false, 'React DevTools encountered an error: %s.', err);
+    }
+  }
+  // DevTools exists
+  return true;
+}
+
+function onCommitRoot(root) {
+  if (typeof onCommitFiberRoot === 'function') {
+    onCommitFiberRoot(root);
+  }
+}
+
+function onCommitUnmount(fiber) {
+  if (typeof onCommitFiberUnmount === 'function') {
+    onCommitFiberUnmount(fiber);
+  }
+}
+
+/**
+ * Forked from fbjs/warning:
+ * https://github.com/facebook/fbjs/blob/e66ba20ad5be433eb54423f2b097d829324d9de6/packages/fbjs/src/__forks__/warning.js
+ *
+ * Only change is we use console.warn instead of console.error,
+ * and do nothing when 'console' is not supported.
+ * This really simplifies the code.
+ * ---
+ * Similar to invariant but only logs a warning if the condition is not met.
+ * This can be used to log issues in development environments in critical
+ * paths. Removing the logging code for production environments will keep the
+ * same logic and follow the same code paths.
+ */
+
+var lowPriorityWarning = function () {};
+
+{
+  var printWarning$1 = function (format) {
+    for (var _len = arguments.length, args = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+      args[_key - 1] = arguments[_key];
+    }
+
+    var argIndex = 0;
+    var message = 'Warning: ' + format.replace(/%s/g, function () {
+      return args[argIndex++];
+    });
+    if (typeof console !== 'undefined') {
+      console.warn(message);
+    }
+    try {
+      // --- Welcome to debugging React ---
+      // This error was thrown as a convenience so that you can use this stack
+      // to find the callsite that caused this warning to fire.
+      throw new Error(message);
+    } catch (x) {}
+  };
+
+  lowPriorityWarning = function (condition, format) {
+    if (format === undefined) {
+      throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument');
+    }
+    if (!condition) {
+      for (var _len2 = arguments.length, args = Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) {
+        args[_key2 - 2] = arguments[_key2];
+      }
+
+      printWarning$1.apply(undefined, [format].concat(args));
+    }
+  };
+}
+
+var lowPriorityWarning$1 = lowPriorityWarning;
+
+var ReactStrictModeWarnings = {
+  discardPendingWarnings: function () {},
+  flushPendingDeprecationWarnings: function () {},
+  flushPendingUnsafeLifecycleWarnings: function () {},
+  recordDeprecationWarnings: function (fiber, instance) {},
+  recordUnsafeLifecycleWarnings: function (fiber, instance) {}
+};
+
+{
+  var LIFECYCLE_SUGGESTIONS = {
+    UNSAFE_componentWillMount: 'componentDidMount',
+    UNSAFE_componentWillReceiveProps: 'static getDerivedStateFromProps',
+    UNSAFE_componentWillUpdate: 'componentDidUpdate'
+  };
+
+  var pendingComponentWillMountWarnings = [];
+  var pendingComponentWillReceivePropsWarnings = [];
+  var pendingComponentWillUpdateWarnings = [];
+  var pendingUnsafeLifecycleWarnings = new Map();
+
+  // Tracks components we have already warned about.
+  var didWarnAboutDeprecatedLifecycles = new Set();
+  var didWarnAboutUnsafeLifecycles = new Set();
+
+  ReactStrictModeWarnings.discardPendingWarnings = function () {
+    pendingComponentWillMountWarnings = [];
+    pendingComponentWillReceivePropsWarnings = [];
+    pendingComponentWillUpdateWarnings = [];
+    pendingUnsafeLifecycleWarnings = new Map();
+  };
+
+  ReactStrictModeWarnings.flushPendingUnsafeLifecycleWarnings = function () {
+    pendingUnsafeLifecycleWarnings.forEach(function (lifecycleWarningsMap, strictRoot) {
+      var lifecyclesWarningMesages = [];
+
+      Object.keys(lifecycleWarningsMap).forEach(function (lifecycle) {
+        var lifecycleWarnings = lifecycleWarningsMap[lifecycle];
+        if (lifecycleWarnings.length > 0) {
+          var componentNames = new Set();
+          lifecycleWarnings.forEach(function (fiber) {
+            componentNames.add(getComponentName(fiber) || 'Component');
+            didWarnAboutUnsafeLifecycles.add(fiber.type);
+          });
+
+          var formatted = lifecycle.replace('UNSAFE_', '');
+          var suggestion = LIFECYCLE_SUGGESTIONS[lifecycle];
+          var sortedComponentNames = Array.from(componentNames).sort().join(', ');
+
+          lifecyclesWarningMesages.push(formatted + ': Please update the following components to use ' + (suggestion + ' instead: ' + sortedComponentNames));
+        }
+      });
+
+      if (lifecyclesWarningMesages.length > 0) {
+        var strictRootComponentStack = getStackAddendumByWorkInProgressFiber(strictRoot);
+
+        warning_1(false, 'Unsafe lifecycle methods were found within a strict-mode tree:%s' + '\n\n%s' + '\n\nLearn more about this warning here:' + '\nhttps://fb.me/react-strict-mode-warnings', strictRootComponentStack, lifecyclesWarningMesages.join('\n\n'));
+      }
+    });
+
+    pendingUnsafeLifecycleWarnings = new Map();
+  };
+
+  var getStrictRoot = function (fiber) {
+    var maybeStrictRoot = null;
+
+    while (fiber !== null) {
+      if (fiber.mode & StrictMode) {
+        maybeStrictRoot = fiber;
+      }
+
+      fiber = fiber['return'];
+    }
+
+    return maybeStrictRoot;
+  };
+
+  ReactStrictModeWarnings.flushPendingDeprecationWarnings = function () {
+    if (pendingComponentWillMountWarnings.length > 0) {
+      var uniqueNames = new Set();
+      pendingComponentWillMountWarnings.forEach(function (fiber) {
+        uniqueNames.add(getComponentName(fiber) || 'Component');
+        didWarnAboutDeprecatedLifecycles.add(fiber.type);
+      });
+
+      var sortedNames = Array.from(uniqueNames).sort().join(', ');
+
+      lowPriorityWarning$1(false, 'componentWillMount is deprecated and will be removed in the next major version. ' + 'Use componentDidMount instead. As a temporary workaround, ' + 'you can rename to UNSAFE_componentWillMount.' + '\n\nPlease update the following components: %s' + '\n\nLearn more about this warning here:' + '\nhttps://fb.me/react-async-component-lifecycle-hooks', sortedNames);
+
+      pendingComponentWillMountWarnings = [];
+    }
+
+    if (pendingComponentWillReceivePropsWarnings.length > 0) {
+      var _uniqueNames = new Set();
+      pendingComponentWillReceivePropsWarnings.forEach(function (fiber) {
+        _uniqueNames.add(getComponentName(fiber) || 'Component');
+        didWarnAboutDeprecatedLifecycles.add(fiber.type);
+      });
+
+      var _sortedNames = Array.from(_uniqueNames).sort().join(', ');
+
+      lowPriorityWarning$1(false, 'componentWillReceiveProps is deprecated and will be removed in the next major version. ' + 'Use static getDerivedStateFromProps instead.' + '\n\nPlease update the following components: %s' + '\n\nLearn more about this warning here:' + '\nhttps://fb.me/react-async-component-lifecycle-hooks', _sortedNames);
+
+      pendingComponentWillReceivePropsWarnings = [];
+    }
+
+    if (pendingComponentWillUpdateWarnings.length > 0) {
+      var _uniqueNames2 = new Set();
+      pendingComponentWillUpdateWarnings.forEach(function (fiber) {
+        _uniqueNames2.add(getComponentName(fiber) || 'Component');
+        didWarnAboutDeprecatedLifecycles.add(fiber.type);
+      });
+
+      var _sortedNames2 = Array.from(_uniqueNames2).sort().join(', ');
+
+      lowPriorityWarning$1(false, 'componentWillUpdate is deprecated and will be removed in the next major version. ' + 'Use componentDidUpdate instead. As a temporary workaround, ' + 'you can rename to UNSAFE_componentWillUpdate.' + '\n\nPlease update the following components: %s' + '\n\nLearn more about this warning here:' + '\nhttps://fb.me/react-async-component-lifecycle-hooks', _sortedNames2);
+
+      pendingComponentWillUpdateWarnings = [];
+    }
+  };
+
+  ReactStrictModeWarnings.recordDeprecationWarnings = function (fiber, instance) {
+    // Dedup strategy: Warn once per component.
+    if (didWarnAboutDeprecatedLifecycles.has(fiber.type)) {
+      return;
+    }
+
+    // Don't warn about react-lifecycles-compat polyfilled components.
+    if (typeof instance.componentWillMount === 'function' && instance.componentWillMount.__suppressDeprecationWarning !== true) {
+      pendingComponentWillMountWarnings.push(fiber);
+    }
+    if (typeof instance.componentWillReceiveProps === 'function' && instance.componentWillReceiveProps.__suppressDeprecationWarning !== true) {
+      pendingComponentWillReceivePropsWarnings.push(fiber);
+    }
+    if (typeof instance.componentWillUpdate === 'function' && instance.componentWillUpdate.__suppressDeprecationWarning !== true) {
+      pendingComponentWillUpdateWarnings.push(fiber);
+    }
+  };
+
+  ReactStrictModeWarnings.recordUnsafeLifecycleWarnings = function (fiber, instance) {
+    var strictRoot = getStrictRoot(fiber);
+
+    // Dedup strategy: Warn once per component.
+    // This is difficult to track any other way since component names
+    // are often vague and are likely to collide between 3rd party libraries.
+    // An expand property is probably okay to use here since it's DEV-only,
+    // and will only be set in the event of serious warnings.
+    if (didWarnAboutUnsafeLifecycles.has(fiber.type)) {
+      return;
+    }
+
+    // Don't warn about react-lifecycles-compat polyfilled components.
+    // Note that it is sufficient to check for the presence of a
+    // single lifecycle, componentWillMount, with the polyfill flag.
+    if (typeof instance.componentWillMount === 'function' && instance.componentWillMount.__suppressDeprecationWarning === true) {
+      return;
+    }
+
+    var warningsForRoot = void 0;
+    if (!pendingUnsafeLifecycleWarnings.has(strictRoot)) {
+      warningsForRoot = {
+        UNSAFE_componentWillMount: [],
+        UNSAFE_componentWillReceiveProps: [],
+        UNSAFE_componentWillUpdate: []
+      };
+
+      pendingUnsafeLifecycleWarnings.set(strictRoot, warningsForRoot);
+    } else {
+      warningsForRoot = pendingUnsafeLifecycleWarnings.get(strictRoot);
+    }
+
+    var unsafeLifecycles = [];
+    if (typeof instance.componentWillMount === 'function' || typeof instance.UNSAFE_componentWillMount === 'function') {
+      unsafeLifecycles.push('UNSAFE_componentWillMount');
+    }
+    if (typeof instance.componentWillReceiveProps === 'function' || typeof instance.UNSAFE_componentWillReceiveProps === 'function') {
+      unsafeLifecycles.push('UNSAFE_componentWillReceiveProps');
+    }
+    if (typeof instance.componentWillUpdate === 'function' || typeof instance.UNSAFE_componentWillUpdate === 'function') {
+      unsafeLifecycles.push('UNSAFE_componentWillUpdate');
+    }
+
+    if (unsafeLifecycles.length > 0) {
+      unsafeLifecycles.forEach(function (lifecycle) {
+        warningsForRoot[lifecycle].push(fiber);
+      });
+    }
+  };
+}
+
+// Exports ReactDOM.createRoot
+var enableUserTimingAPI = true;
+
+// Mutating mode (React DOM, React ART, React Native):
+var enableMutatingReconciler = true;
+// Experimental noop mode (currently unused):
+var enableNoopReconciler = false;
+// Experimental persistent mode (Fabric):
+var enablePersistentReconciler = false;
+// Experimental error-boundary API that can recover from errors within a single
+// render phase
+var enableGetDerivedStateFromCatch = false;
+// Helps identify side effects in begin-phase lifecycle hooks and setState reducers:
+var debugRenderPhaseSideEffects = false;
+
+// In some cases, StrictMode should also double-render lifecycles.
+// This can be confusing for tests though,
+// And it can be bad for performance in production.
+// This feature flag can be used to control the behavior:
+var debugRenderPhaseSideEffectsForStrictMode = true;
+
+// To preserve the "Pause on caught exceptions" behavior of the debugger, we
+// replay the begin phase of a failed component inside invokeGuardedCallback.
+var replayFailedUnitOfWorkWithInvokeGuardedCallback = true;
+
+// Warn about deprecated, async-unsafe lifecycles; relates to RFC #6:
+var warnAboutDeprecatedLifecycles = false;
+
+var alwaysUseRequestIdleCallbackPolyfill = false;
+
+// Only used in www builds.
+
+// Prefix measurements so that it's possible to filter them.
+// Longer prefixes are hard to read in DevTools.
+var reactEmoji = '\u269B';
+var warningEmoji = '\u26D4';
+var supportsUserTiming = typeof performance !== 'undefined' && typeof performance.mark === 'function' && typeof performance.clearMarks === 'function' && typeof performance.measure === 'function' && typeof performance.clearMeasures === 'function';
+
+// Keep track of current fiber so that we know the path to unwind on pause.
+// TODO: this looks the same as nextUnitOfWork in scheduler. Can we unify them?
+var currentFiber = null;
+// If we're in the middle of user code, which fiber and method is it?
+// Reusing `currentFiber` would be confusing for this because user code fiber
+// can change during commit phase too, but we don't need to unwind it (since
+// lifecycles in the commit phase don't resemble a tree).
+var currentPhase = null;
+var currentPhaseFiber = null;
+// Did lifecycle hook schedule an update? This is often a performance problem,
+// so we will keep track of it, and include it in the report.
+// Track commits caused by cascading updates.
+var isCommitting = false;
+var hasScheduledUpdateInCurrentCommit = false;
+var hasScheduledUpdateInCurrentPhase = false;
+var commitCountInCurrentWorkLoop = 0;
+var effectCountInCurrentCommit = 0;
+var isWaitingForCallback = false;
+// During commits, we only show a measurement once per method name
+// to avoid stretch the commit phase with measurement overhead.
+var labelsInCurrentCommit = new Set();
+
+var formatMarkName = function (markName) {
+  return reactEmoji + ' ' + markName;
+};
+
+var formatLabel = function (label, warning) {
+  var prefix = warning ? warningEmoji + ' ' : reactEmoji + ' ';
+  var suffix = warning ? ' Warning: ' + warning : '';
+  return '' + prefix + label + suffix;
+};
+
+var beginMark = function (markName) {
+  performance.mark(formatMarkName(markName));
+};
+
+var clearMark = function (markName) {
+  performance.clearMarks(formatMarkName(markName));
+};
+
+var endMark = function (label, markName, warning) {
+  var formattedMarkName = formatMarkName(markName);
+  var formattedLabel = formatLabel(label, warning);
+  try {
+    performance.measure(formattedLabel, formattedMarkName);
+  } catch (err) {}
+  // If previous mark was missing for some reason, this will throw.
+  // This could only happen if React crashed in an unexpected place earlier.
+  // Don't pile on with more errors.
+
+  // Clear marks immediately to avoid growing buffer.
+  performance.clearMarks(formattedMarkName);
+  performance.clearMeasures(formattedLabel);
+};
+
+var getFiberMarkName = function (label, debugID) {
+  return label + ' (#' + debugID + ')';
+};
+
+var getFiberLabel = function (componentName, isMounted, phase) {
+  if (phase === null) {
+    // These are composite component total time measurements.
+    return componentName + ' [' + (isMounted ? 'update' : 'mount') + ']';
+  } else {
+    // Composite component methods.
+    return componentName + '.' + phase;
+  }
+};
+
+var beginFiberMark = function (fiber, phase) {
+  var componentName = getComponentName(fiber) || 'Unknown';
+  var debugID = fiber._debugID;
+  var isMounted = fiber.alternate !== null;
+  var label = getFiberLabel(componentName, isMounted, phase);
+
+  if (isCommitting && labelsInCurrentCommit.has(label)) {
+    // During the commit phase, we don't show duplicate labels because
+    // there is a fixed overhead for every measurement, and we don't
+    // want to stretch the commit phase beyond necessary.
+    return false;
+  }
+  labelsInCurrentCommit.add(label);
+
+  var markName = getFiberMarkName(label, debugID);
+  beginMark(markName);
+  return true;
+};
+
+var clearFiberMark = function (fiber, phase) {
+  var componentName = getComponentName(fiber) || 'Unknown';
+  var debugID = fiber._debugID;
+  var isMounted = fiber.alternate !== null;
+  var label = getFiberLabel(componentName, isMounted, phase);
+  var markName = getFiberMarkName(label, debugID);
+  clearMark(markName);
+};
+
+var endFiberMark = function (fiber, phase, warning) {
+  var componentName = getComponentName(fiber) || 'Unknown';
+  var debugID = fiber._debugID;
+  var isMounted = fiber.alternate !== null;
+  var label = getFiberLabel(componentName, isMounted, phase);
+  var markName = getFiberMarkName(label, debugID);
+  endMark(label, markName, warning);
+};
+
+var shouldIgnoreFiber = function (fiber) {
+  // Host components should be skipped in the timeline.
+  // We could check typeof fiber.type, but does this work with RN?
+  switch (fiber.tag) {
+    case HostRoot:
+    case HostComponent:
+    case HostText:
+    case HostPortal:
+    case CallComponent:
+    case ReturnComponent:
+    case Fragment:
+    case ContextProvider:
+    case ContextConsumer:
+      return true;
+    default:
+      return false;
+  }
+};
+
+var clearPendingPhaseMeasurement = function () {
+  if (currentPhase !== null && currentPhaseFiber !== null) {
+    clearFiberMark(currentPhaseFiber, currentPhase);
+  }
+  currentPhaseFiber = null;
+  currentPhase = null;
+  hasScheduledUpdateInCurrentPhase = false;
+};
+
+var pauseTimers = function () {
+  // Stops all currently active measurements so that they can be resumed
+  // if we continue in a later deferred loop from the same unit of work.
+  var fiber = currentFiber;
+  while (fiber) {
+    if (fiber._debugIsCurrentlyTiming) {
+      endFiberMark(fiber, null, null);
+    }
+    fiber = fiber['return'];
+  }
+};
+
+var resumeTimersRecursively = function (fiber) {
+  if (fiber['return'] !== null) {
+    resumeTimersRecursively(fiber['return']);
+  }
+  if (fiber._debugIsCurrentlyTiming) {
+    beginFiberMark(fiber, null);
+  }
+};
+
+var resumeTimers = function () {
+  // Resumes all measurements that were active during the last deferred loop.
+  if (currentFiber !== null) {
+    resumeTimersRecursively(currentFiber);
+  }
+};
+
+function recordEffect() {
+  if (enableUserTimingAPI) {
+    effectCountInCurrentCommit++;
+  }
+}
+
+function recordScheduleUpdate() {
+  if (enableUserTimingAPI) {
+    if (isCommitting) {
+      hasScheduledUpdateInCurrentCommit = true;
+    }
+    if (currentPhase !== null && currentPhase !== 'componentWillMount' && currentPhase !== 'componentWillReceiveProps') {
+      hasScheduledUpdateInCurrentPhase = true;
+    }
+  }
+}
+
+function startRequestCallbackTimer() {
+  if (enableUserTimingAPI) {
+    if (supportsUserTiming && !isWaitingForCallback) {
+      isWaitingForCallback = true;
+      beginMark('(Waiting for async callback...)');
+    }
+  }
+}
+
+function stopRequestCallbackTimer(didExpire, expirationTime) {
+  if (enableUserTimingAPI) {
+    if (supportsUserTiming) {
+      isWaitingForCallback = false;
+      var warning = didExpire ? 'React was blocked by main thread' : null;
+      endMark('(Waiting for async callback... will force flush in ' + expirationTime + ' ms)', '(Waiting for async callback...)', warning);
+    }
+  }
+}
+
+function startWorkTimer(fiber) {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming || shouldIgnoreFiber(fiber)) {
+      return;
+    }
+    // If we pause, this is the fiber to unwind from.
+    currentFiber = fiber;
+    if (!beginFiberMark(fiber, null)) {
+      return;
+    }
+    fiber._debugIsCurrentlyTiming = true;
+  }
+}
+
+function cancelWorkTimer(fiber) {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming || shouldIgnoreFiber(fiber)) {
+      return;
+    }
+    // Remember we shouldn't complete measurement for this fiber.
+    // Otherwise flamechart will be deep even for small updates.
+    fiber._debugIsCurrentlyTiming = false;
+    clearFiberMark(fiber, null);
+  }
+}
+
+function stopWorkTimer(fiber) {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming || shouldIgnoreFiber(fiber)) {
+      return;
+    }
+    // If we pause, its parent is the fiber to unwind from.
+    currentFiber = fiber['return'];
+    if (!fiber._debugIsCurrentlyTiming) {
+      return;
+    }
+    fiber._debugIsCurrentlyTiming = false;
+    endFiberMark(fiber, null, null);
+  }
+}
+
+function stopFailedWorkTimer(fiber) {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming || shouldIgnoreFiber(fiber)) {
+      return;
+    }
+    // If we pause, its parent is the fiber to unwind from.
+    currentFiber = fiber['return'];
+    if (!fiber._debugIsCurrentlyTiming) {
+      return;
+    }
+    fiber._debugIsCurrentlyTiming = false;
+    var warning = 'An error was thrown inside this error boundary';
+    endFiberMark(fiber, null, warning);
+  }
+}
+
+function startPhaseTimer(fiber, phase) {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    clearPendingPhaseMeasurement();
+    if (!beginFiberMark(fiber, phase)) {
+      return;
+    }
+    currentPhaseFiber = fiber;
+    currentPhase = phase;
+  }
+}
+
+function stopPhaseTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    if (currentPhase !== null && currentPhaseFiber !== null) {
+      var warning = hasScheduledUpdateInCurrentPhase ? 'Scheduled a cascading update' : null;
+      endFiberMark(currentPhaseFiber, currentPhase, warning);
+    }
+    currentPhase = null;
+    currentPhaseFiber = null;
+  }
+}
+
+function startWorkLoopTimer(nextUnitOfWork) {
+  if (enableUserTimingAPI) {
+    currentFiber = nextUnitOfWork;
+    if (!supportsUserTiming) {
+      return;
+    }
+    commitCountInCurrentWorkLoop = 0;
+    // This is top level call.
+    // Any other measurements are performed within.
+    beginMark('(React Tree Reconciliation)');
+    // Resume any measurements that were in progress during the last loop.
+    resumeTimers();
+  }
+}
+
+function stopWorkLoopTimer(interruptedBy) {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    var warning = null;
+    if (interruptedBy !== null) {
+      if (interruptedBy.tag === HostRoot) {
+        warning = 'A top-level update interrupted the previous render';
+      } else {
+        var componentName = getComponentName(interruptedBy) || 'Unknown';
+        warning = 'An update to ' + componentName + ' interrupted the previous render';
+      }
+    } else if (commitCountInCurrentWorkLoop > 1) {
+      warning = 'There were cascading updates';
+    }
+    commitCountInCurrentWorkLoop = 0;
+    // Pause any measurements until the next loop.
+    pauseTimers();
+    endMark('(React Tree Reconciliation)', '(React Tree Reconciliation)', warning);
+  }
+}
+
+function startCommitTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    isCommitting = true;
+    hasScheduledUpdateInCurrentCommit = false;
+    labelsInCurrentCommit.clear();
+    beginMark('(Committing Changes)');
+  }
+}
+
+function stopCommitTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+
+    var warning = null;
+    if (hasScheduledUpdateInCurrentCommit) {
+      warning = 'Lifecycle hook scheduled a cascading update';
+    } else if (commitCountInCurrentWorkLoop > 0) {
+      warning = 'Caused by a cascading update in earlier commit';
+    }
+    hasScheduledUpdateInCurrentCommit = false;
+    commitCountInCurrentWorkLoop++;
+    isCommitting = false;
+    labelsInCurrentCommit.clear();
+
+    endMark('(Committing Changes)', '(Committing Changes)', warning);
+  }
+}
+
+function startCommitSnapshotEffectsTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    effectCountInCurrentCommit = 0;
+    beginMark('(Committing Snapshot Effects)');
+  }
+}
+
+function stopCommitSnapshotEffectsTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    var count = effectCountInCurrentCommit;
+    effectCountInCurrentCommit = 0;
+    endMark('(Committing Snapshot Effects: ' + count + ' Total)', '(Committing Snapshot Effects)', null);
+  }
+}
+
+function startCommitHostEffectsTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    effectCountInCurrentCommit = 0;
+    beginMark('(Committing Host Effects)');
+  }
+}
+
+function stopCommitHostEffectsTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    var count = effectCountInCurrentCommit;
+    effectCountInCurrentCommit = 0;
+    endMark('(Committing Host Effects: ' + count + ' Total)', '(Committing Host Effects)', null);
+  }
+}
+
+function startCommitLifeCyclesTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    effectCountInCurrentCommit = 0;
+    beginMark('(Calling Lifecycle Methods)');
+  }
+}
+
+function stopCommitLifeCyclesTimer() {
+  if (enableUserTimingAPI) {
+    if (!supportsUserTiming) {
+      return;
+    }
+    var count = effectCountInCurrentCommit;
+    effectCountInCurrentCommit = 0;
+    endMark('(Calling Lifecycle Methods: ' + count + ' Total)', '(Calling Lifecycle Methods)', null);
+  }
+}
+
+var didWarnUpdateInsideUpdate = void 0;
+
+{
+  didWarnUpdateInsideUpdate = false;
+}
+
+// Callbacks are not validated until invocation
+
+
+// Singly linked-list of updates. When an update is scheduled, it is added to
+// the queue of the current fiber and the work-in-progress fiber. The two queues
+// are separate but they share a persistent structure.
+//
+// During reconciliation, updates are removed from the work-in-progress fiber,
+// but they remain on the current fiber. That ensures that if a work-in-progress
+// is aborted, the aborted updates are recovered by cloning from current.
+//
+// The work-in-progress queue is always a subset of the current queue.
+//
+// When the tree is committed, the work-in-progress becomes the current.
+
+
+function createUpdateQueue(baseState) {
+  var queue = {
+    baseState: baseState,
+    expirationTime: NoWork,
+    first: null,
+    last: null,
+    callbackList: null,
+    hasForceUpdate: false,
+    isInitialized: false,
+    capturedValues: null
+  };
+  {
+    queue.isProcessing = false;
+  }
+  return queue;
+}
+
+function insertUpdateIntoQueue(queue, update) {
+  // Append the update to the end of the list.
+  if (queue.last === null) {
+    // Queue is empty
+    queue.first = queue.last = update;
+  } else {
+    queue.last.next = update;
+    queue.last = update;
+  }
+  if (queue.expirationTime === NoWork || queue.expirationTime > update.expirationTime) {
+    queue.expirationTime = update.expirationTime;
+  }
+}
+
+var q1 = void 0;
+var q2 = void 0;
+function ensureUpdateQueues(fiber) {
+  q1 = q2 = null;
+  // We'll have at least one and at most two distinct update queues.
+  var alternateFiber = fiber.alternate;
+  var queue1 = fiber.updateQueue;
+  if (queue1 === null) {
+    // TODO: We don't know what the base state will be until we begin work.
+    // It depends on which fiber is the next current. Initialize with an empty
+    // base state, then set to the memoizedState when rendering. Not super
+    // happy with this approach.
+    queue1 = fiber.updateQueue = createUpdateQueue(null);
+  }
+
+  var queue2 = void 0;
+  if (alternateFiber !== null) {
+    queue2 = alternateFiber.updateQueue;
+    if (queue2 === null) {
+      queue2 = alternateFiber.updateQueue = createUpdateQueue(null);
+    }
+  } else {
+    queue2 = null;
+  }
+  queue2 = queue2 !== queue1 ? queue2 : null;
+
+  // Use module variables instead of returning a tuple
+  q1 = queue1;
+  q2 = queue2;
+}
+
+function insertUpdateIntoFiber(fiber, update) {
+  ensureUpdateQueues(fiber);
+  var queue1 = q1;
+  var queue2 = q2;
+
+  // Warn if an update is scheduled from inside an updater function.
+  {
+    if ((queue1.isProcessing || queue2 !== null && queue2.isProcessing) && !didWarnUpdateInsideUpdate) {
+      warning_1(false, 'An update (setState, replaceState, or forceUpdate) was scheduled ' + 'from inside an update function. Update functions should be pure, ' + 'with zero side-effects. Consider using componentDidUpdate or a ' + 'callback.');
+      didWarnUpdateInsideUpdate = true;
+    }
+  }
+
+  // If there's only one queue, add the update to that queue and exit.
+  if (queue2 === null) {
+    insertUpdateIntoQueue(queue1, update);
+    return;
+  }
+
+  // If either queue is empty, we need to add to both queues.
+  if (queue1.last === null || queue2.last === null) {
+    insertUpdateIntoQueue(queue1, update);
+    insertUpdateIntoQueue(queue2, update);
+    return;
+  }
+
+  // If both lists are not empty, the last update is the same for both lists
+  // because of structural sharing. So, we should only append to one of
+  // the lists.
+  insertUpdateIntoQueue(queue1, update);
+  // But we still need to update the `last` pointer of queue2.
+  queue2.last = update;
+}
+
+function getUpdateExpirationTime(fiber) {
+  switch (fiber.tag) {
+    case HostRoot:
+    case ClassComponent:
+      var updateQueue = fiber.updateQueue;
+      if (updateQueue === null) {
+        return NoWork;
+      }
+      return updateQueue.expirationTime;
+    default:
+      return NoWork;
+  }
+}
+
+function getStateFromUpdate(update, instance, prevState, props) {
+  var partialState = update.partialState;
+  if (typeof partialState === 'function') {
+    return partialState.call(instance, prevState, props);
+  } else {
+    return partialState;
+  }
+}
+
+function processUpdateQueue(current, workInProgress, queue, instance, props, renderExpirationTime) {
+  if (current !== null && current.updateQueue === queue) {
+    // We need to create a work-in-progress queue, by cloning the current queue.
+    var currentQueue = queue;
+    queue = workInProgress.updateQueue = {
+      baseState: currentQueue.baseState,
+      expirationTime: currentQueue.expirationTime,
+      first: currentQueue.first,
+      last: currentQueue.last,
+      isInitialized: currentQueue.isInitialized,
+      capturedValues: currentQueue.capturedValues,
+      // These fields are no longer valid because they were already committed.
+      // Reset them.
+      callbackList: null,
+      hasForceUpdate: false
+    };
+  }
+
+  {
+    // Set this flag so we can warn if setState is called inside the update
+    // function of another setState.
+    queue.isProcessing = true;
+  }
+
+  // Reset the remaining expiration time. If we skip over any updates, we'll
+  // increase this accordingly.
+  queue.expirationTime = NoWork;
+
+  // TODO: We don't know what the base state will be until we begin work.
+  // It depends on which fiber is the next current. Initialize with an empty
+  // base state, then set to the memoizedState when rendering. Not super
+  // happy with this approach.
+  var state = void 0;
+  if (queue.isInitialized) {
+    state = queue.baseState;
+  } else {
+    state = queue.baseState = workInProgress.memoizedState;
+    queue.isInitialized = true;
+  }
+  var dontMutatePrevState = true;
+  var update = queue.first;
+  var didSkip = false;
+  while (update !== null) {
+    var updateExpirationTime = update.expirationTime;
+    if (updateExpirationTime > renderExpirationTime) {
+      // This update does not have sufficient priority. Skip it.
+      var remainingExpirationTime = queue.expirationTime;
+      if (remainingExpirationTime === NoWork || remainingExpirationTime > updateExpirationTime) {
+        // Update the remaining expiration time.
+        queue.expirationTime = updateExpirationTime;
+      }
+      if (!didSkip) {
+        didSkip = true;
+        queue.baseState = state;
+      }
+      // Continue to the next update.
+      update = update.next;
+      continue;
+    }
+
+    // This update does have sufficient priority.
+
+    // If no previous updates were skipped, drop this update from the queue by
+    // advancing the head of the list.
+    if (!didSkip) {
+      queue.first = update.next;
+      if (queue.first === null) {
+        queue.last = null;
+      }
+    }
+
+    // Invoke setState callback an extra time to help detect side-effects.
+    // Ignore the return value in this case.
+    if (debugRenderPhaseSideEffects || debugRenderPhaseSideEffectsForStrictMode && workInProgress.mode & StrictMode) {
+      getStateFromUpdate(update, instance, state, props);
+    }
+
+    // Process the update
+    var _partialState = void 0;
+    if (update.isReplace) {
+      state = getStateFromUpdate(update, instance, state, props);
+      dontMutatePrevState = true;
+    } else {
+      _partialState = getStateFromUpdate(update, instance, state, props);
+      if (_partialState) {
+        if (dontMutatePrevState) {
+          // $FlowFixMe: Idk how to type this properly.
+          state = _assign({}, state, _partialState);
+        } else {
+          state = _assign(state, _partialState);
+        }
+        dontMutatePrevState = false;
+      }
+    }
+    if (update.isForced) {
+      queue.hasForceUpdate = true;
+    }
+    if (update.callback !== null) {
+      // Append to list of callbacks.
+      var _callbackList = queue.callbackList;
+      if (_callbackList === null) {
+        _callbackList = queue.callbackList = [];
+      }
+      _callbackList.push(update);
+    }
+    if (update.capturedValue !== null) {
+      var _capturedValues = queue.capturedValues;
+      if (_capturedValues === null) {
+        queue.capturedValues = [update.capturedValue];
+      } else {
+        _capturedValues.push(update.capturedValue);
+      }
+    }
+    update = update.next;
+  }
+
+  if (queue.callbackList !== null) {
+    workInProgress.effectTag |= Callback;
+  } else if (queue.first === null && !queue.hasForceUpdate && queue.capturedValues === null) {
+    // The queue is empty. We can reset it.
+    workInProgress.updateQueue = null;
+  }
+
+  if (!didSkip) {
+    didSkip = true;
+    queue.baseState = state;
+  }
+
+  {
+    // No longer processing.
+    queue.isProcessing = false;
+  }
+
+  return state;
+}
+
+function commitCallbacks(queue, context) {
+  var callbackList = queue.callbackList;
+  if (callbackList === null) {
+    return;
+  }
+  // Set the list to null to make sure they don't get called more than once.
+  queue.callbackList = null;
+  for (var i = 0; i < callbackList.length; i++) {
+    var update = callbackList[i];
+    var _callback = update.callback;
+    // This update might be processed again. Clear the callback so it's only
+    // called once.
+    update.callback = null;
+    !(typeof _callback === 'function') ? invariant_1(false, 'Invalid argument passed as callback. Expected a function. Instead received: %s', _callback) : void 0;
+    _callback.call(context);
+  }
+}
+
+var fakeInternalInstance = {};
+var isArray = Array.isArray;
+
+var didWarnAboutStateAssignmentForComponent = void 0;
+var didWarnAboutUndefinedDerivedState = void 0;
+var didWarnAboutUninitializedState = void 0;
+var didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate = void 0;
+var didWarnAboutLegacyLifecyclesAndDerivedState = void 0;
+var warnOnInvalidCallback$1 = void 0;
+
+{
+  didWarnAboutStateAssignmentForComponent = new Set();
+  didWarnAboutUndefinedDerivedState = new Set();
+  didWarnAboutUninitializedState = new Set();
+  didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate = new Set();
+  didWarnAboutLegacyLifecyclesAndDerivedState = new Set();
+
+  var didWarnOnInvalidCallback = new Set();
+
+  warnOnInvalidCallback$1 = function (callback, callerName) {
+    if (callback === null || typeof callback === 'function') {
+      return;
+    }
+    var key = callerName + '_' + callback;
+    if (!didWarnOnInvalidCallback.has(key)) {
+      didWarnOnInvalidCallback.add(key);
+      warning_1(false, '%s(...): Expected the last optional `callback` argument to be a ' + 'function. Instead received: %s.', callerName, callback);
+    }
+  };
+
+  // This is so gross but it's at least non-critical and can be removed if
+  // it causes problems. This is meant to give a nicer error message for
+  // ReactDOM15.unstable_renderSubtreeIntoContainer(reactDOM16Component,
+  // ...)) which otherwise throws a "_processChildContext is not a function"
+  // exception.
+  Object.defineProperty(fakeInternalInstance, '_processChildContext', {
+    enumerable: false,
+    value: function () {
+      invariant_1(false, '_processChildContext is not available in React 16+. This likely means you have multiple copies of React and are attempting to nest a React 15 tree inside a React 16 tree using unstable_renderSubtreeIntoContainer, which isn\'t supported. Try to make sure you have only one copy of React (and ideally, switch to ReactDOM.createPortal).');
+    }
+  });
+  Object.freeze(fakeInternalInstance);
+}
+function callGetDerivedStateFromCatch(ctor, capturedValues) {
+  var resultState = {};
+  for (var i = 0; i < capturedValues.length; i++) {
+    var capturedValue = capturedValues[i];
+    var error = capturedValue.value;
+    var partialState = ctor.getDerivedStateFromCatch.call(null, error);
+    if (partialState !== null && partialState !== undefined) {
+      _assign(resultState, partialState);
+    }
+  }
+  return resultState;
+}
+
+var ReactFiberClassComponent = function (legacyContext, scheduleWork, computeExpirationForFiber, memoizeProps, memoizeState) {
+  var cacheContext = legacyContext.cacheContext,
+      getMaskedContext = legacyContext.getMaskedContext,
+      getUnmaskedContext = legacyContext.getUnmaskedContext,
+      isContextConsumer = legacyContext.isContextConsumer,
+      hasContextChanged = legacyContext.hasContextChanged;
+
+  // Class component state updater
+
+  var updater = {
+    isMounted: isMounted,
+    enqueueSetState: function (instance, partialState, callback) {
+      var fiber = get(instance);
+      callback = callback === undefined ? null : callback;
+      {
+        warnOnInvalidCallback$1(callback, 'setState');
+      }
+      var expirationTime = computeExpirationForFiber(fiber);
+      var update = {
+        expirationTime: expirationTime,
+        partialState: partialState,
+        callback: callback,
+        isReplace: false,
+        isForced: false,
+        capturedValue: null,
+        next: null
+      };
+      insertUpdateIntoFiber(fiber, update);
+      scheduleWork(fiber, expirationTime);
+    },
+    enqueueReplaceState: function (instance, state, callback) {
+      var fiber = get(instance);
+      callback = callback === undefined ? null : callback;
+      {
+        warnOnInvalidCallback$1(callback, 'replaceState');
+      }
+      var expirationTime = computeExpirationForFiber(fiber);
+      var update = {
+        expirationTime: expirationTime,
+        partialState: state,
+        callback: callback,
+        isReplace: true,
+        isForced: false,
+        capturedValue: null,
+        next: null
+      };
+      insertUpdateIntoFiber(fiber, update);
+      scheduleWork(fiber, expirationTime);
+    },
+    enqueueForceUpdate: function (instance, callback) {
+      var fiber = get(instance);
+      callback = callback === undefined ? null : callback;
+      {
+        warnOnInvalidCallback$1(callback, 'forceUpdate');
+      }
+      var expirationTime = computeExpirationForFiber(fiber);
+      var update = {
+        expirationTime: expirationTime,
+        partialState: null,
+        callback: callback,
+        isReplace: false,
+        isForced: true,
+        capturedValue: null,
+        next: null
+      };
+      insertUpdateIntoFiber(fiber, update);
+      scheduleWork(fiber, expirationTime);
+    }
+  };
+
+  function checkShouldComponentUpdate(workInProgress, oldProps, newProps, oldState, newState, newContext) {
+    if (oldProps === null || workInProgress.updateQueue !== null && workInProgress.updateQueue.hasForceUpdate) {
+      // If the workInProgress already has an Update effect, return true
+      return true;
+    }
+
+    var instance = workInProgress.stateNode;
+    var ctor = workInProgress.type;
+    if (typeof instance.shouldComponentUpdate === 'function') {
+      startPhaseTimer(workInProgress, 'shouldComponentUpdate');
+      var shouldUpdate = instance.shouldComponentUpdate(newProps, newState, newContext);
+      stopPhaseTimer();
+
+      {
+        warning_1(shouldUpdate !== undefined, '%s.shouldComponentUpdate(): Returned undefined instead of a ' + 'boolean value. Make sure to return true or false.', getComponentName(workInProgress) || 'Component');
+      }
+
+      return shouldUpdate;
+    }
+
+    if (ctor.prototype && ctor.prototype.isPureReactComponent) {
+      return !shallowEqual_1(oldProps, newProps) || !shallowEqual_1(oldState, newState);
+    }
+
+    return true;
+  }
+
+  function checkClassInstance(workInProgress) {
+    var instance = workInProgress.stateNode;
+    var type = workInProgress.type;
+    {
+      var name = getComponentName(workInProgress) || 'Component';
+      var renderPresent = instance.render;
+
+      if (!renderPresent) {
+        if (type.prototype && typeof type.prototype.render === 'function') {
+          warning_1(false, '%s(...): No `render` method found on the returned component ' + 'instance: did you accidentally return an object from the constructor?', name);
+        } else {
+          warning_1(false, '%s(...): No `render` method found on the returned component ' + 'instance: you may have forgotten to define `render`.', name);
+        }
+      }
+
+      var noGetInitialStateOnES6 = !instance.getInitialState || instance.getInitialState.isReactClassApproved || instance.state;
+      warning_1(noGetInitialStateOnES6, 'getInitialState was defined on %s, a plain JavaScript class. ' + 'This is only supported for classes created using React.createClass. ' + 'Did you mean to define a state property instead?', name);
+      var noGetDefaultPropsOnES6 = !instance.getDefaultProps || instance.getDefaultProps.isReactClassApproved;
+      warning_1(noGetDefaultPropsOnES6, 'getDefaultProps was defined on %s, a plain JavaScript class. ' + 'This is only supported for classes created using React.createClass. ' + 'Use a static property to define defaultProps instead.', name);
+      var noInstancePropTypes = !instance.propTypes;
+      warning_1(noInstancePropTypes, 'propTypes was defined as an instance property on %s. Use a static ' + 'property to define propTypes instead.', name);
+      var noInstanceContextTypes = !instance.contextTypes;
+      warning_1(noInstanceContextTypes, 'contextTypes was defined as an instance property on %s. Use a static ' + 'property to define contextTypes instead.', name);
+      var noComponentShouldUpdate = typeof instance.componentShouldUpdate !== 'function';
+      warning_1(noComponentShouldUpdate, '%s has a method called ' + 'componentShouldUpdate(). Did you mean shouldComponentUpdate()? ' + 'The name is phrased as a question because the function is ' + 'expected to return a value.', name);
+      if (type.prototype && type.prototype.isPureReactComponent && typeof instance.shouldComponentUpdate !== 'undefined') {
+        warning_1(false, '%s has a method called shouldComponentUpdate(). ' + 'shouldComponentUpdate should not be used when extending React.PureComponent. ' + 'Please extend React.Component if shouldComponentUpdate is used.', getComponentName(workInProgress) || 'A pure component');
+      }
+      var noComponentDidUnmount = typeof instance.componentDidUnmount !== 'function';
+      warning_1(noComponentDidUnmount, '%s has a method called ' + 'componentDidUnmount(). But there is no such lifecycle method. ' + 'Did you mean componentWillUnmount()?', name);
+      var noComponentDidReceiveProps = typeof instance.componentDidReceiveProps !== 'function';
+      warning_1(noComponentDidReceiveProps, '%s has a method called ' + 'componentDidReceiveProps(). But there is no such lifecycle method. ' + 'If you meant to update the state in response to changing props, ' + 'use componentWillReceiveProps(). If you meant to fetch data or ' + 'run side-effects or mutations after React has updated the UI, use componentDidUpdate().', name);
+      var noComponentWillRecieveProps = typeof instance.componentWillRecieveProps !== 'function';
+      warning_1(noComponentWillRecieveProps, '%s has a method called ' + 'componentWillRecieveProps(). Did you mean componentWillReceiveProps()?', name);
+      var noUnsafeComponentWillRecieveProps = typeof instance.UNSAFE_componentWillRecieveProps !== 'function';
+      warning_1(noUnsafeComponentWillRecieveProps, '%s has a method called ' + 'UNSAFE_componentWillRecieveProps(). Did you mean UNSAFE_componentWillReceiveProps()?', name);
+      var hasMutatedProps = instance.props !== workInProgress.pendingProps;
+      warning_1(instance.props === undefined || !hasMutatedProps, '%s(...): When calling super() in `%s`, make sure to pass ' + "up the same props that your component's constructor was passed.", name, name);
+      var noInstanceDefaultProps = !instance.defaultProps;
+      warning_1(noInstanceDefaultProps, 'Setting defaultProps as an instance property on %s is not supported and will be ignored.' + ' Instead, define defaultProps as a static property on %s.', name, name);
+
+      if (typeof instance.getSnapshotBeforeUpdate === 'function' && typeof instance.componentDidUpdate !== 'function' && typeof instance.componentDidUpdate !== 'function' && !didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate.has(type)) {
+        didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate.add(type);
+        warning_1(false, '%s: getSnapshotBeforeUpdate() should be used with componentDidUpdate(). ' + 'This component defines getSnapshotBeforeUpdate() only.', getComponentName(workInProgress));
+      }
+
+      var noInstanceGetDerivedStateFromProps = typeof instance.getDerivedStateFromProps !== 'function';
+      warning_1(noInstanceGetDerivedStateFromProps, '%s: getDerivedStateFromProps() is defined as an instance method ' + 'and will be ignored. Instead, declare it as a static method.', name);
+      var noInstanceGetDerivedStateFromCatch = typeof instance.getDerivedStateFromCatch !== 'function';
+      warning_1(noInstanceGetDerivedStateFromCatch, '%s: getDerivedStateFromCatch() is defined as an instance method ' + 'and will be ignored. Instead, declare it as a static method.', name);
+      var noStaticGetSnapshotBeforeUpdate = typeof type.getSnapshotBeforeUpdate !== 'function';
+      warning_1(noStaticGetSnapshotBeforeUpdate, '%s: getSnapshotBeforeUpdate() is defined as a static method ' + 'and will be ignored. Instead, declare it as an instance method.', name);
+      var _state = instance.state;
+      if (_state && (typeof _state !== 'object' || isArray(_state))) {
+        warning_1(false, '%s.state: must be set to an object or null', name);
+      }
+      if (typeof instance.getChildContext === 'function') {
+        warning_1(typeof type.childContextTypes === 'object', '%s.getChildContext(): childContextTypes must be defined in order to ' + 'use getChildContext().', name);
+      }
+    }
+  }
+
+  function resetInputPointers(workInProgress, instance) {
+    instance.props = workInProgress.memoizedProps;
+    instance.state = workInProgress.memoizedState;
+  }
+
+  function adoptClassInstance(workInProgress, instance) {
+    instance.updater = updater;
+    workInProgress.stateNode = instance;
+    // The instance needs access to the fiber so that it can schedule updates
+    set(instance, workInProgress);
+    {
+      instance._reactInternalInstance = fakeInternalInstance;
+    }
+  }
+
+  function constructClassInstance(workInProgress, props) {
+    var ctor = workInProgress.type;
+    var unmaskedContext = getUnmaskedContext(workInProgress);
+    var needsContext = isContextConsumer(workInProgress);
+    var context = needsContext ? getMaskedContext(workInProgress, unmaskedContext) : emptyObject_1;
+
+    // Instantiate twice to help detect side-effects.
+    if (debugRenderPhaseSideEffects || debugRenderPhaseSideEffectsForStrictMode && workInProgress.mode & StrictMode) {
+      new ctor(props, context); // eslint-disable-line no-new
+    }
+
+    var instance = new ctor(props, context);
+    var state = instance.state !== null && instance.state !== undefined ? instance.state : null;
+    adoptClassInstance(workInProgress, instance);
+
+    {
+      if (typeof ctor.getDerivedStateFromProps === 'function' && state === null) {
+        var componentName = getComponentName(workInProgress) || 'Component';
+        if (!didWarnAboutUninitializedState.has(componentName)) {
+          didWarnAboutUninitializedState.add(componentName);
+          warning_1(false, '%s: Did not properly initialize state during construction. ' + 'Expected state to be an object, but it was %s.', componentName, instance.state === null ? 'null' : 'undefined');
+        }
+      }
+
+      // If new component APIs are defined, "unsafe" lifecycles won't be called.
+      // Warn about these lifecycles if they are present.
+      // Don't warn about react-lifecycles-compat polyfilled methods though.
+      if (typeof ctor.getDerivedStateFromProps === 'function' || typeof instance.getSnapshotBeforeUpdate === 'function') {
+        var foundWillMountName = null;
+        var foundWillReceivePropsName = null;
+        var foundWillUpdateName = null;
+        if (typeof instance.componentWillMount === 'function' && instance.componentWillMount.__suppressDeprecationWarning !== true) {
+          foundWillMountName = 'componentWillMount';
+        } else if (typeof instance.UNSAFE_componentWillMount === 'function') {
+          foundWillMountName = 'UNSAFE_componentWillMount';
+        }
+        if (typeof instance.componentWillReceiveProps === 'function' && instance.componentWillReceiveProps.__suppressDeprecationWarning !== true) {
+          foundWillReceivePropsName = 'componentWillReceiveProps';
+        } else if (typeof instance.UNSAFE_componentWillReceiveProps === 'function') {
+          foundWillReceivePropsName = 'UNSAFE_componentWillReceiveProps';
+        }
+        if (typeof instance.componentWillUpdate === 'function' && instance.componentWillUpdate.__suppressDeprecationWarning !== true) {
+          foundWillUpdateName = 'componentWillUpdate';
+        } else if (typeof instance.UNSAFE_componentWillUpdate === 'function') {
+          foundWillUpdateName = 'UNSAFE_componentWillUpdate';
+        }
+        if (foundWillMountName !== null || foundWillReceivePropsName !== null || foundWillUpdateName !== null) {
+          var _componentName = getComponentName(workInProgress) || 'Component';
+          var newApiName = typeof ctor.getDerivedStateFromProps === 'function' ? 'getDerivedStateFromProps()' : 'getSnapshotBeforeUpdate()';
+          if (!didWarnAboutLegacyLifecyclesAndDerivedState.has(_componentName)) {
+            didWarnAboutLegacyLifecyclesAndDerivedState.add(_componentName);
+            warning_1(false, 'Unsafe legacy lifecycles will not be called for components using new component APIs.\n\n' + '%s uses %s but also contains the following legacy lifecycles:%s%s%s\n\n' + 'The above lifecycles should be removed. Learn more about this warning here:\n' + 'https://fb.me/react-async-component-lifecycle-hooks', _componentName, newApiName, foundWillMountName !== null ? '\n  ' + foundWillMountName : '', foundWillReceivePropsName !== null ? '\n  ' + foundWillReceivePropsName : '', foundWillUpdateName !== null ? '\n  ' + foundWillUpdateName : '');
+          }
+        }
+      }
+    }
+
+    workInProgress.memoizedState = state;
+
+    var partialState = callGetDerivedStateFromProps(workInProgress, instance, props, state);
+
+    if (partialState !== null && partialState !== undefined) {
+      // Render-phase updates (like this) should not be added to the update queue,
+      // So that multiple render passes do not enqueue multiple updates.
+      // Instead, just synchronously merge the returned state into the instance.
+      workInProgress.memoizedState = _assign({}, workInProgress.memoizedState, partialState);
+    }
+
+    // Cache unmasked context so we can avoid recreating masked context unless necessary.
+    // ReactFiberContext usually updates this cache but can't for newly-created instances.
+    if (needsContext) {
+      cacheContext(workInProgress, unmaskedContext, context);
+    }
+
+    return instance;
+  }
+
+  function callComponentWillMount(workInProgress, instance) {
+    startPhaseTimer(workInProgress, 'componentWillMount');
+    var oldState = instance.state;
+
+    if (typeof instance.componentWillMount === 'function') {
+      instance.componentWillMount();
+    }
+    if (typeof instance.UNSAFE_componentWillMount === 'function') {
+      instance.UNSAFE_componentWillMount();
+    }
+
+    stopPhaseTimer();
+
+    if (oldState !== instance.state) {
+      {
+        warning_1(false, '%s.componentWillMount(): Assigning directly to this.state is ' + "deprecated (except inside a component's " + 'constructor). Use setState instead.', getComponentName(workInProgress) || 'Component');
+      }
+      updater.enqueueReplaceState(instance, instance.state, null);
+    }
+  }
+
+  function callComponentWillReceiveProps(workInProgress, instance, newProps, newContext) {
+    var oldState = instance.state;
+    startPhaseTimer(workInProgress, 'componentWillReceiveProps');
+    if (typeof instance.componentWillReceiveProps === 'function') {
+      instance.componentWillReceiveProps(newProps, newContext);
+    }
+    if (typeof instance.UNSAFE_componentWillReceiveProps === 'function') {
+      instance.UNSAFE_componentWillReceiveProps(newProps, newContext);
+    }
+    stopPhaseTimer();
+
+    if (instance.state !== oldState) {
+      {
+        var componentName = getComponentName(workInProgress) || 'Component';
+        if (!didWarnAboutStateAssignmentForComponent.has(componentName)) {
+          didWarnAboutStateAssignmentForComponent.add(componentName);
+          warning_1(false, '%s.componentWillReceiveProps(): Assigning directly to ' + "this.state is deprecated (except inside a component's " + 'constructor). Use setState instead.', componentName);
+        }
+      }
+      updater.enqueueReplaceState(instance, instance.state, null);
+    }
+  }
+
+  function callGetDerivedStateFromProps(workInProgress, instance, nextProps, prevState) {
+    var type = workInProgress.type;
+
+
+    if (typeof type.getDerivedStateFromProps === 'function') {
+      if (debugRenderPhaseSideEffects || debugRenderPhaseSideEffectsForStrictMode && workInProgress.mode & StrictMode) {
+        // Invoke method an extra time to help detect side-effects.
+        type.getDerivedStateFromProps.call(null, nextProps, prevState);
+      }
+
+      var partialState = type.getDerivedStateFromProps.call(null, nextProps, prevState);
+
+      {
+        if (partialState === undefined) {
+          var componentName = getComponentName(workInProgress) || 'Component';
+          if (!didWarnAboutUndefinedDerivedState.has(componentName)) {
+            didWarnAboutUndefinedDerivedState.add(componentName);
+            warning_1(false, '%s.getDerivedStateFromProps(): A valid state object (or null) must be returned. ' + 'You have returned undefined.', componentName);
+          }
+        }
+      }
+
+      return partialState;
+    }
+  }
+
+  // Invokes the mount life-cycles on a previously never rendered instance.
+  function mountClassInstance(workInProgress, renderExpirationTime) {
+    var ctor = workInProgress.type;
+    var current = workInProgress.alternate;
+
+    {
+      checkClassInstance(workInProgress);
+    }
+
+    var instance = workInProgress.stateNode;
+    var props = workInProgress.pendingProps;
+    var unmaskedContext = getUnmaskedContext(workInProgress);
+
+    instance.props = props;
+    instance.state = workInProgress.memoizedState;
+    instance.refs = emptyObject_1;
+    instance.context = getMaskedContext(workInProgress, unmaskedContext);
+
+    {
+      if (workInProgress.mode & StrictMode) {
+        ReactStrictModeWarnings.recordUnsafeLifecycleWarnings(workInProgress, instance);
+      }
+
+      if (warnAboutDeprecatedLifecycles) {
+        ReactStrictModeWarnings.recordDeprecationWarnings(workInProgress, instance);
+      }
+    }
+
+    // In order to support react-lifecycles-compat polyfilled components,
+    // Unsafe lifecycles should not be invoked for components using the new APIs.
+    if (typeof ctor.getDerivedStateFromProps !== 'function' && typeof instance.getSnapshotBeforeUpdate !== 'function' && (typeof instance.UNSAFE_componentWillMount === 'function' || typeof instance.componentWillMount === 'function')) {
+      callComponentWillMount(workInProgress, instance);
+      // If we had additional state updates during this life-cycle, let's
+      // process them now.
+      var updateQueue = workInProgress.updateQueue;
+      if (updateQueue !== null) {
+        instance.state = processUpdateQueue(current, workInProgress, updateQueue, instance, props, renderExpirationTime);
+      }
+    }
+    if (typeof instance.componentDidMount === 'function') {
+      workInProgress.effectTag |= Update;
+    }
+  }
+
+  function resumeMountClassInstance(workInProgress, renderExpirationTime) {
+    var ctor = workInProgress.type;
+    var instance = workInProgress.stateNode;
+    resetInputPointers(workInProgress, instance);
+
+    var oldProps = workInProgress.memoizedProps;
+    var newProps = workInProgress.pendingProps;
+    var oldContext = instance.context;
+    var newUnmaskedContext = getUnmaskedContext(workInProgress);
+    var newContext = getMaskedContext(workInProgress, newUnmaskedContext);
+
+    var hasNewLifecycles = typeof ctor.getDerivedStateFromProps === 'function' || typeof instance.getSnapshotBeforeUpdate === 'function';
+
+    // Note: During these life-cycles, instance.props/instance.state are what
+    // ever the previously attempted to render - not the "current". However,
+    // during componentDidUpdate we pass the "current" props.
+
+    // In order to support react-lifecycles-compat polyfilled components,
+    // Unsafe lifecycles should not be invoked for components using the new APIs.
+    if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillReceiveProps === 'function' || typeof instance.componentWillReceiveProps === 'function')) {
+      if (oldProps !== newProps || oldContext !== newContext) {
+        callComponentWillReceiveProps(workInProgress, instance, newProps, newContext);
+      }
+    }
+
+    // Compute the next state using the memoized state and the update queue.
+    var oldState = workInProgress.memoizedState;
+    // TODO: Previous state can be null.
+    var newState = void 0;
+    var derivedStateFromCatch = void 0;
+    if (workInProgress.updateQueue !== null) {
+      newState = processUpdateQueue(null, workInProgress, workInProgress.updateQueue, instance, newProps, renderExpirationTime);
+
+      var updateQueue = workInProgress.updateQueue;
+      if (updateQueue !== null && updateQueue.capturedValues !== null && enableGetDerivedStateFromCatch && typeof ctor.getDerivedStateFromCatch === 'function') {
+        var capturedValues = updateQueue.capturedValues;
+        // Don't remove these from the update queue yet. We need them in
+        // finishClassComponent. Do the reset there.
+        // TODO: This is awkward. Refactor class components.
+        // updateQueue.capturedValues = null;
+        derivedStateFromCatch = callGetDerivedStateFromCatch(ctor, capturedValues);
+      }
+    } else {
+      newState = oldState;
+    }
+
+    var derivedStateFromProps = void 0;
+    if (oldProps !== newProps) {
+      // The prevState parameter should be the partially updated state.
+      // Otherwise, spreading state in return values could override updates.
+      derivedStateFromProps = callGetDerivedStateFromProps(workInProgress, instance, newProps, newState);
+    }
+
+    if (derivedStateFromProps !== null && derivedStateFromProps !== undefined) {
+      // Render-phase updates (like this) should not be added to the update queue,
+      // So that multiple render passes do not enqueue multiple updates.
+      // Instead, just synchronously merge the returned state into the instance.
+      newState = newState === null || newState === undefined ? derivedStateFromProps : _assign({}, newState, derivedStateFromProps);
+    }
+    if (derivedStateFromCatch !== null && derivedStateFromCatch !== undefined) {
+      // Render-phase updates (like this) should not be added to the update queue,
+      // So that multiple render passes do not enqueue multiple updates.
+      // Instead, just synchronously merge the returned state into the instance.
+      newState = newState === null || newState === undefined ? derivedStateFromCatch : _assign({}, newState, derivedStateFromCatch);
+    }
+
+    if (oldProps === newProps && oldState === newState && !hasContextChanged() && !(workInProgress.updateQueue !== null && workInProgress.updateQueue.hasForceUpdate)) {
+      // If an update was already in progress, we should schedule an Update
+      // effect even though we're bailing out, so that cWU/cDU are called.
+      if (typeof instance.componentDidMount === 'function') {
+        workInProgress.effectTag |= Update;
+      }
+      return false;
+    }
+
+    var shouldUpdate = checkShouldComponentUpdate(workInProgress, oldProps, newProps, oldState, newState, newContext);
+
+    if (shouldUpdate) {
+      // In order to support react-lifecycles-compat polyfilled components,
+      // Unsafe lifecycles should not be invoked for components using the new APIs.
+      if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillMount === 'function' || typeof instance.componentWillMount === 'function')) {
+        startPhaseTimer(workInProgress, 'componentWillMount');
+        if (typeof instance.componentWillMount === 'function') {
+          instance.componentWillMount();
+        }
+        if (typeof instance.UNSAFE_componentWillMount === 'function') {
+          instance.UNSAFE_componentWillMount();
+        }
+        stopPhaseTimer();
+      }
+      if (typeof instance.componentDidMount === 'function') {
+        workInProgress.effectTag |= Update;
+      }
+    } else {
+      // If an update was already in progress, we should schedule an Update
+      // effect even though we're bailing out, so that cWU/cDU are called.
+      if (typeof instance.componentDidMount === 'function') {
+        workInProgress.effectTag |= Update;
+      }
+
+      // If shouldComponentUpdate returned false, we should still update the
+      // memoized props/state to indicate that this work can be reused.
+      memoizeProps(workInProgress, newProps);
+      memoizeState(workInProgress, newState);
+    }
+
+    // Update the existing instance's state, props, and context pointers even
+    // if shouldComponentUpdate returns false.
+    instance.props = newProps;
+    instance.state = newState;
+    instance.context = newContext;
+
+    return shouldUpdate;
+  }
+
+  // Invokes the update life-cycles and returns false if it shouldn't rerender.
+  function updateClassInstance(current, workInProgress, renderExpirationTime) {
+    var ctor = workInProgress.type;
+    var instance = workInProgress.stateNode;
+    resetInputPointers(workInProgress, instance);
+
+    var oldProps = workInProgress.memoizedProps;
+    var newProps = workInProgress.pendingProps;
+    var oldContext = instance.context;
+    var newUnmaskedContext = getUnmaskedContext(workInProgress);
+    var newContext = getMaskedContext(workInProgress, newUnmaskedContext);
+
+    var hasNewLifecycles = typeof ctor.getDerivedStateFromProps === 'function' || typeof instance.getSnapshotBeforeUpdate === 'function';
+
+    // Note: During these life-cycles, instance.props/instance.state are what
+    // ever the previously attempted to render - not the "current". However,
+    // during componentDidUpdate we pass the "current" props.
+
+    // In order to support react-lifecycles-compat polyfilled components,
+    // Unsafe lifecycles should not be invoked for components using the new APIs.
+    if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillReceiveProps === 'function' || typeof instance.componentWillReceiveProps === 'function')) {
+      if (oldProps !== newProps || oldContext !== newContext) {
+        callComponentWillReceiveProps(workInProgress, instance, newProps, newContext);
+      }
+    }
+
+    // Compute the next state using the memoized state and the update queue.
+    var oldState = workInProgress.memoizedState;
+    // TODO: Previous state can be null.
+    var newState = void 0;
+    var derivedStateFromCatch = void 0;
+
+    if (workInProgress.updateQueue !== null) {
+      newState = processUpdateQueue(current, workInProgress, workInProgress.updateQueue, instance, newProps, renderExpirationTime);
+
+      var updateQueue = workInProgress.updateQueue;
+      if (updateQueue !== null && updateQueue.capturedValues !== null && enableGetDerivedStateFromCatch && typeof ctor.getDerivedStateFromCatch === 'function') {
+        var capturedValues = updateQueue.capturedValues;
+        // Don't remove these from the update queue yet. We need them in
+        // finishClassComponent. Do the reset there.
+        // TODO: This is awkward. Refactor class components.
+        // updateQueue.capturedValues = null;
+        derivedStateFromCatch = callGetDerivedStateFromCatch(ctor, capturedValues);
+      }
+    } else {
+      newState = oldState;
+    }
+
+    var derivedStateFromProps = void 0;
+    if (oldProps !== newProps) {
+      // The prevState parameter should be the partially updated state.
+      // Otherwise, spreading state in return values could override updates.
+      derivedStateFromProps = callGetDerivedStateFromProps(workInProgress, instance, newProps, newState);
+    }
+
+    if (derivedStateFromProps !== null && derivedStateFromProps !== undefined) {
+      // Render-phase updates (like this) should not be added to the update queue,
+      // So that multiple render passes do not enqueue multiple updates.
+      // Instead, just synchronously merge the returned state into the instance.
+      newState = newState === null || newState === undefined ? derivedStateFromProps : _assign({}, newState, derivedStateFromProps);
+    }
+    if (derivedStateFromCatch !== null && derivedStateFromCatch !== undefined) {
+      // Render-phase updates (like this) should not be added to the update queue,
+      // So that multiple render passes do not enqueue multiple updates.
+      // Instead, just synchronously merge the returned state into the instance.
+      newState = newState === null || newState === undefined ? derivedStateFromCatch : _assign({}, newState, derivedStateFromCatch);
+    }
+
+    if (oldProps === newProps && oldState === newState && !hasContextChanged() && !(workInProgress.updateQueue !== null && workInProgress.updateQueue.hasForceUpdate)) {
+      // If an update was already in progress, we should schedule an Update
+      // effect even though we're bailing out, so that cWU/cDU are called.
+      if (typeof instance.componentDidUpdate === 'function') {
+        if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
+          workInProgress.effectTag |= Update;
+        }
+      }
+      if (typeof instance.getSnapshotBeforeUpdate === 'function') {
+        if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
+          workInProgress.effectTag |= Snapshot;
+        }
+      }
+      return false;
+    }
+
+    var shouldUpdate = checkShouldComponentUpdate(workInProgress, oldProps, newProps, oldState, newState, newContext);
+
+    if (shouldUpdate) {
+      // In order to support react-lifecycles-compat polyfilled components,
+      // Unsafe lifecycles should not be invoked for components using the new APIs.
+      if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillUpdate === 'function' || typeof instance.componentWillUpdate === 'function')) {
+        startPhaseTimer(workInProgress, 'componentWillUpdate');
+        if (typeof instance.componentWillUpdate === 'function') {
+          instance.componentWillUpdate(newProps, newState, newContext);
+        }
+        if (typeof instance.UNSAFE_componentWillUpdate === 'function') {
+          instance.UNSAFE_componentWillUpdate(newProps, newState, newContext);
+        }
+        stopPhaseTimer();
+      }
+      if (typeof instance.componentDidUpdate === 'function') {
+        workInProgress.effectTag |= Update;
+      }
+      if (typeof instance.getSnapshotBeforeUpdate === 'function') {
+        workInProgress.effectTag |= Snapshot;
+      }
+    } else {
+      // If an update was already in progress, we should schedule an Update
+      // effect even though we're bailing out, so that cWU/cDU are called.
+      if (typeof instance.componentDidUpdate === 'function') {
+        if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
+          workInProgress.effectTag |= Update;
+        }
+      }
+      if (typeof instance.getSnapshotBeforeUpdate === 'function') {
+        if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
+          workInProgress.effectTag |= Snapshot;
+        }
+      }
+
+      // If shouldComponentUpdate returned false, we should still update the
+      // memoized props/state to indicate that this work can be reused.
+      memoizeProps(workInProgress, newProps);
+      memoizeState(workInProgress, newState);
+    }
+
+    // Update the existing instance's state, props, and context pointers even
+    // if shouldComponentUpdate returns false.
+    instance.props = newProps;
+    instance.state = newState;
+    instance.context = newContext;
+
+    return shouldUpdate;
+  }
+
+  return {
+    adoptClassInstance: adoptClassInstance,
+    callGetDerivedStateFromProps: callGetDerivedStateFromProps,
+    constructClassInstance: constructClassInstance,
+    mountClassInstance: mountClassInstance,
+    resumeMountClassInstance: resumeMountClassInstance,
+    updateClassInstance: updateClassInstance
+  };
+};
+
+var getCurrentFiberStackAddendum$2 = ReactDebugCurrentFiber.getCurrentFiberStackAddendum;
+
+
+var didWarnAboutMaps = void 0;
+var didWarnAboutStringRefInStrictMode = void 0;
+var ownerHasKeyUseWarning = void 0;
+var ownerHasFunctionTypeWarning = void 0;
+var warnForMissingKey = function (child) {};
+
+{
+  didWarnAboutMaps = false;
+  didWarnAboutStringRefInStrictMode = {};
+
+  /**
+   * Warn if there's no key explicitly set on dynamic arrays of children or
+   * object keys are not valid. This allows us to keep track of children between
+   * updates.
+   */
+  ownerHasKeyUseWarning = {};
+  ownerHasFunctionTypeWarning = {};
+
+  warnForMissingKey = function (child) {
+    if (child === null || typeof child !== 'object') {
+      return;
+    }
+    if (!child._store || child._store.validated || child.key != null) {
+      return;
+    }
+    !(typeof child._store === 'object') ? invariant_1(false, 'React Component in warnForMissingKey should have a _store. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+    child._store.validated = true;
+
+    var currentComponentErrorInfo = 'Each child in an array or iterator should have a unique ' + '"key" prop. See https://fb.me/react-warning-keys for ' + 'more information.' + (getCurrentFiberStackAddendum$2() || '');
+    if (ownerHasKeyUseWarning[currentComponentErrorInfo]) {
+      return;
+    }
+    ownerHasKeyUseWarning[currentComponentErrorInfo] = true;
+
+    warning_1(false, 'Each child in an array or iterator should have a unique ' + '"key" prop. See https://fb.me/react-warning-keys for ' + 'more information.%s', getCurrentFiberStackAddendum$2());
+  };
+}
+
+var isArray$1 = Array.isArray;
+
+function coerceRef(returnFiber, current, element) {
+  var mixedRef = element.ref;
+  if (mixedRef !== null && typeof mixedRef !== 'function' && typeof mixedRef !== 'object') {
+    {
+      if (returnFiber.mode & StrictMode) {
+        var componentName = getComponentName(returnFiber) || 'Component';
+        if (!didWarnAboutStringRefInStrictMode[componentName]) {
+          warning_1(false, 'A string ref, "%s", has been found within a strict mode tree. ' + 'String refs are a source of potential bugs and should be avoided. ' + 'We recommend using createRef() instead.' + '\n%s' + '\n\nLearn more about using refs safely here:' + '\nhttps://fb.me/react-strict-mode-string-ref', mixedRef, getStackAddendumByWorkInProgressFiber(returnFiber));
+          didWarnAboutStringRefInStrictMode[componentName] = true;
+        }
+      }
+    }
+
+    if (element._owner) {
+      var owner = element._owner;
+      var inst = void 0;
+      if (owner) {
+        var ownerFiber = owner;
+        !(ownerFiber.tag === ClassComponent) ? invariant_1(false, 'Stateless function components cannot have refs.') : void 0;
+        inst = ownerFiber.stateNode;
+      }
+      !inst ? invariant_1(false, 'Missing owner for string ref %s. This error is likely caused by a bug in React. Please file an issue.', mixedRef) : void 0;
+      var stringRef = '' + mixedRef;
+      // Check if previous string ref matches new string ref
+      if (current !== null && current.ref !== null && current.ref._stringRef === stringRef) {
+        return current.ref;
+      }
+      var ref = function (value) {
+        var refs = inst.refs === emptyObject_1 ? inst.refs = {} : inst.refs;
+        if (value === null) {
+          delete refs[stringRef];
+        } else {
+          refs[stringRef] = value;
+        }
+      };
+      ref._stringRef = stringRef;
+      return ref;
+    } else {
+      !(typeof mixedRef === 'string') ? invariant_1(false, 'Expected ref to be a function or a string.') : void 0;
+      !element._owner ? invariant_1(false, 'Element ref was specified as a string (%s) but no owner was set. This could happen for one of the following reasons:\n1. You may be adding a ref to a functional component\n2. You may be adding a ref to a component that was not created inside a component\'s render method\n3. You have multiple copies of React loaded\nSee https://fb.me/react-refs-must-have-owner for more information.', mixedRef) : void 0;
+    }
+  }
+  return mixedRef;
+}
+
+function throwOnInvalidObjectType(returnFiber, newChild) {
+  if (returnFiber.type !== 'textarea') {
+    var addendum = '';
+    {
+      addendum = ' If you meant to render a collection of children, use an array ' + 'instead.' + (getCurrentFiberStackAddendum$2() || '');
+    }
+    invariant_1(false, 'Objects are not valid as a React child (found: %s).%s', Object.prototype.toString.call(newChild) === '[object Object]' ? 'object with keys {' + Object.keys(newChild).join(', ') + '}' : newChild, addendum);
+  }
+}
+
+function warnOnFunctionType() {
+  var currentComponentErrorInfo = 'Functions are not valid as a React child. This may happen if ' + 'you return a Component instead of <Component /> from render. ' + 'Or maybe you meant to call this function rather than return it.' + (getCurrentFiberStackAddendum$2() || '');
+
+  if (ownerHasFunctionTypeWarning[currentComponentErrorInfo]) {
+    return;
+  }
+  ownerHasFunctionTypeWarning[currentComponentErrorInfo] = true;
+
+  warning_1(false, 'Functions are not valid as a React child. This may happen if ' + 'you return a Component instead of <Component /> from render. ' + 'Or maybe you meant to call this function rather than return it.%s', getCurrentFiberStackAddendum$2() || '');
+}
+
+// This wrapper function exists because I expect to clone the code in each path
+// to be able to optimize each path individually by branching early. This needs
+// a compiler or we can do it manually. Helpers that don't need this branching
+// live outside of this function.
+function ChildReconciler(shouldTrackSideEffects) {
+  function deleteChild(returnFiber, childToDelete) {
+    if (!shouldTrackSideEffects) {
+      // Noop.
+      return;
+    }
+    // Deletions are added in reversed order so we add it to the front.
+    // At this point, the return fiber's effect list is empty except for
+    // deletions, so we can just append the deletion to the list. The remaining
+    // effects aren't added until the complete phase. Once we implement
+    // resuming, this may not be true.
+    var last = returnFiber.lastEffect;
+    if (last !== null) {
+      last.nextEffect = childToDelete;
+      returnFiber.lastEffect = childToDelete;
+    } else {
+      returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;
+    }
+    childToDelete.nextEffect = null;
+    childToDelete.effectTag = Deletion;
+  }
+
+  function deleteRemainingChildren(returnFiber, currentFirstChild) {
+    if (!shouldTrackSideEffects) {
+      // Noop.
+      return null;
+    }
+
+    // TODO: For the shouldClone case, this could be micro-optimized a bit by
+    // assuming that after the first child we've already added everything.
+    var childToDelete = currentFirstChild;
+    while (childToDelete !== null) {
+      deleteChild(returnFiber, childToDelete);
+      childToDelete = childToDelete.sibling;
+    }
+    return null;
+  }
+
+  function mapRemainingChildren(returnFiber, currentFirstChild) {
+    // Add the remaining children to a temporary map so that we can find them by
+    // keys quickly. Implicit (null) keys get added to this set with their index
+    var existingChildren = new Map();
+
+    var existingChild = currentFirstChild;
+    while (existingChild !== null) {
+      if (existingChild.key !== null) {
+        existingChildren.set(existingChild.key, existingChild);
+      } else {
+        existingChildren.set(existingChild.index, existingChild);
+      }
+      existingChild = existingChild.sibling;
+    }
+    return existingChildren;
+  }
+
+  function useFiber(fiber, pendingProps, expirationTime) {
+    // We currently set sibling to null and index to 0 here because it is easy
+    // to forget to do before returning it. E.g. for the single child case.
+    var clone = createWorkInProgress(fiber, pendingProps, expirationTime);
+    clone.index = 0;
+    clone.sibling = null;
+    return clone;
+  }
+
+  function placeChild(newFiber, lastPlacedIndex, newIndex) {
+    newFiber.index = newIndex;
+    if (!shouldTrackSideEffects) {
+      // Noop.
+      return lastPlacedIndex;
+    }
+    var current = newFiber.alternate;
+    if (current !== null) {
+      var oldIndex = current.index;
+      if (oldIndex < lastPlacedIndex) {
+        // This is a move.
+        newFiber.effectTag = Placement;
+        return lastPlacedIndex;
+      } else {
+        // This item can stay in place.
+        return oldIndex;
+      }
+    } else {
+      // This is an insertion.
+      newFiber.effectTag = Placement;
+      return lastPlacedIndex;
+    }
+  }
+
+  function placeSingleChild(newFiber) {
+    // This is simpler for the single child case. We only need to do a
+    // placement for inserting new children.
+    if (shouldTrackSideEffects && newFiber.alternate === null) {
+      newFiber.effectTag = Placement;
+    }
+    return newFiber;
+  }
+
+  function updateTextNode(returnFiber, current, textContent, expirationTime) {
+    if (current === null || current.tag !== HostText) {
+      // Insert
+      var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);
+      created['return'] = returnFiber;
+      return created;
+    } else {
+      // Update
+      var existing = useFiber(current, textContent, expirationTime);
+      existing['return'] = returnFiber;
+      return existing;
+    }
+  }
+
+  function updateElement(returnFiber, current, element, expirationTime) {
+    if (current !== null && current.type === element.type) {
+      // Move based on index
+      var existing = useFiber(current, element.props, expirationTime);
+      existing.ref = coerceRef(returnFiber, current, element);
+      existing['return'] = returnFiber;
+      {
+        existing._debugSource = element._source;
+        existing._debugOwner = element._owner;
+      }
+      return existing;
+    } else {
+      // Insert
+      var created = createFiberFromElement(element, returnFiber.mode, expirationTime);
+      created.ref = coerceRef(returnFiber, current, element);
+      created['return'] = returnFiber;
+      return created;
+    }
+  }
+
+  function updatePortal(returnFiber, current, portal, expirationTime) {
+    if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {
+      // Insert
+      var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);
+      created['return'] = returnFiber;
+      return created;
+    } else {
+      // Update
+      var existing = useFiber(current, portal.children || [], expirationTime);
+      existing['return'] = returnFiber;
+      return existing;
+    }
+  }
+
+  function updateFragment(returnFiber, current, fragment, expirationTime, key) {
+    if (current === null || current.tag !== Fragment) {
+      // Insert
+      var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);
+      created['return'] = returnFiber;
+      return created;
+    } else {
+      // Update
+      var existing = useFiber(current, fragment, expirationTime);
+      existing['return'] = returnFiber;
+      return existing;
+    }
+  }
+
+  function createChild(returnFiber, newChild, expirationTime) {
+    if (typeof newChild === 'string' || typeof newChild === 'number') {
+      // Text nodes don't have keys. If the previous node is implicitly keyed
+      // we can continue to replace it without aborting even if it is not a text
+      // node.
+      var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);
+      created['return'] = returnFiber;
+      return created;
+    }
+
+    if (typeof newChild === 'object' && newChild !== null) {
+      switch (newChild.$$typeof) {
+        case REACT_ELEMENT_TYPE:
+          {
+            var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);
+            _created.ref = coerceRef(returnFiber, null, newChild);
+            _created['return'] = returnFiber;
+            return _created;
+          }
+        case REACT_PORTAL_TYPE:
+          {
+            var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);
+            _created2['return'] = returnFiber;
+            return _created2;
+          }
+      }
+
+      if (isArray$1(newChild) || getIteratorFn(newChild)) {
+        var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);
+        _created3['return'] = returnFiber;
+        return _created3;
+      }
+
+      throwOnInvalidObjectType(returnFiber, newChild);
+    }
+
+    {
+      if (typeof newChild === 'function') {
+        warnOnFunctionType();
+      }
+    }
+
+    return null;
+  }
+
+  function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {
+    // Update the fiber if the keys match, otherwise return null.
+
+    var key = oldFiber !== null ? oldFiber.key : null;
+
+    if (typeof newChild === 'string' || typeof newChild === 'number') {
+      // Text nodes don't have keys. If the previous node is implicitly keyed
+      // we can continue to replace it without aborting even if it is not a text
+      // node.
+      if (key !== null) {
+        return null;
+      }
+      return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);
+    }
+
+    if (typeof newChild === 'object' && newChild !== null) {
+      switch (newChild.$$typeof) {
+        case REACT_ELEMENT_TYPE:
+          {
+            if (newChild.key === key) {
+              if (newChild.type === REACT_FRAGMENT_TYPE) {
+                return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);
+              }
+              return updateElement(returnFiber, oldFiber, newChild, expirationTime);
+            } else {
+              return null;
+            }
+          }
+        case REACT_PORTAL_TYPE:
+          {
+            if (newChild.key === key) {
+              return updatePortal(returnFiber, oldFiber, newChild, expirationTime);
+            } else {
+              return null;
+            }
+          }
+      }
+
+      if (isArray$1(newChild) || getIteratorFn(newChild)) {
+        if (key !== null) {
+          return null;
+        }
+
+        return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);
+      }
+
+      throwOnInvalidObjectType(returnFiber, newChild);
+    }
+
+    {
+      if (typeof newChild === 'function') {
+        warnOnFunctionType();
+      }
+    }
+
+    return null;
+  }
+
+  function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {
+    if (typeof newChild === 'string' || typeof newChild === 'number') {
+      // Text nodes don't have keys, so we neither have to check the old nor
+      // new node for the key. If both are text nodes, they match.
+      var matchedFiber = existingChildren.get(newIdx) || null;
+      return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);
+    }
+
+    if (typeof newChild === 'object' && newChild !== null) {
+      switch (newChild.$$typeof) {
+        case REACT_ELEMENT_TYPE:
+          {
+            var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;
+            if (newChild.type === REACT_FRAGMENT_TYPE) {
+              return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);
+            }
+            return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);
+          }
+        case REACT_PORTAL_TYPE:
+          {
+            var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;
+            return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);
+          }
+      }
+
+      if (isArray$1(newChild) || getIteratorFn(newChild)) {
+        var _matchedFiber3 = existingChildren.get(newIdx) || null;
+        return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);
+      }
+
+      throwOnInvalidObjectType(returnFiber, newChild);
+    }
+
+    {
+      if (typeof newChild === 'function') {
+        warnOnFunctionType();
+      }
+    }
+
+    return null;
+  }
+
+  /**
+   * Warns if there is a duplicate or missing key
+   */
+  function warnOnInvalidKey(child, knownKeys) {
+    {
+      if (typeof child !== 'object' || child === null) {
+        return knownKeys;
+      }
+      switch (child.$$typeof) {
+        case REACT_ELEMENT_TYPE:
+        case REACT_PORTAL_TYPE:
+          warnForMissingKey(child);
+          var key = child.key;
+          if (typeof key !== 'string') {
+            break;
+          }
+          if (knownKeys === null) {
+            knownKeys = new Set();
+            knownKeys.add(key);
+            break;
+          }
+          if (!knownKeys.has(key)) {
+            knownKeys.add(key);
+            break;
+          }
+          warning_1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());
+          break;
+        default:
+          break;
+      }
+    }
+    return knownKeys;
+  }
+
+  function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {
+    // This algorithm can't optimize by searching from boths ends since we
+    // don't have backpointers on fibers. I'm trying to see how far we can get
+    // with that model. If it ends up not being worth the tradeoffs, we can
+    // add it later.
+
+    // Even with a two ended optimization, we'd want to optimize for the case
+    // where there are few changes and brute force the comparison instead of
+    // going for the Map. It'd like to explore hitting that path first in
+    // forward-only mode and only go for the Map once we notice that we need
+    // lots of look ahead. This doesn't handle reversal as well as two ended
+    // search but that's unusual. Besides, for the two ended optimization to
+    // work on Iterables, we'd need to copy the whole set.
+
+    // In this first iteration, we'll just live with hitting the bad case
+    // (adding everything to a Map) in for every insert/move.
+
+    // If you change this code, also update reconcileChildrenIterator() which
+    // uses the same algorithm.
+
+    {
+      // First, validate keys.
+      var knownKeys = null;
+      for (var i = 0; i < newChildren.length; i++) {
+        var child = newChildren[i];
+        knownKeys = warnOnInvalidKey(child, knownKeys);
+      }
+    }
+
+    var resultingFirstChild = null;
+    var previousNewFiber = null;
+
+    var oldFiber = currentFirstChild;
+    var lastPlacedIndex = 0;
+    var newIdx = 0;
+    var nextOldFiber = null;
+    for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {
+      if (oldFiber.index > newIdx) {
+        nextOldFiber = oldFiber;
+        oldFiber = null;
+      } else {
+        nextOldFiber = oldFiber.sibling;
+      }
+      var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);
+      if (newFiber === null) {
+        // TODO: This breaks on empty slots like null children. That's
+        // unfortunate because it triggers the slow path all the time. We need
+        // a better way to communicate whether this was a miss or null,
+        // boolean, undefined, etc.
+        if (oldFiber === null) {
+          oldFiber = nextOldFiber;
+        }
+        break;
+      }
+      if (shouldTrackSideEffects) {
+        if (oldFiber && newFiber.alternate === null) {
+          // We matched the slot, but we didn't reuse the existing fiber, so we
+          // need to delete the existing child.
+          deleteChild(returnFiber, oldFiber);
+        }
+      }
+      lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);
+      if (previousNewFiber === null) {
+        // TODO: Move out of the loop. This only happens for the first run.
+        resultingFirstChild = newFiber;
+      } else {
+        // TODO: Defer siblings if we're not at the right index for this slot.
+        // I.e. if we had null values before, then we want to defer this
+        // for each null value. However, we also don't want to call updateSlot
+        // with the previous one.
+        previousNewFiber.sibling = newFiber;
+      }
+      previousNewFiber = newFiber;
+      oldFiber = nextOldFiber;
+    }
+
+    if (newIdx === newChildren.length) {
+      // We've reached the end of the new children. We can delete the rest.
+      deleteRemainingChildren(returnFiber, oldFiber);
+      return resultingFirstChild;
+    }
+
+    if (oldFiber === null) {
+      // If we don't have any more existing children we can choose a fast path
+      // since the rest will all be insertions.
+      for (; newIdx < newChildren.length; newIdx++) {
+        var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);
+        if (!_newFiber) {
+          continue;
+        }
+        lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);
+        if (previousNewFiber === null) {
+          // TODO: Move out of the loop. This only happens for the first run.
+          resultingFirstChild = _newFiber;
+        } else {
+          previousNewFiber.sibling = _newFiber;
+        }
+        previousNewFiber = _newFiber;
+      }
+      return resultingFirstChild;
+    }
+
+    // Add all children to a key map for quick lookups.
+    var existingChildren = mapRemainingChildren(returnFiber, oldFiber);
+
+    // Keep scanning and use the map to restore deleted items as moves.
+    for (; newIdx < newChildren.length; newIdx++) {
+      var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);
+      if (_newFiber2) {
+        if (shouldTrackSideEffects) {
+          if (_newFiber2.alternate !== null) {
+            // The new fiber is a work in progress, but if there exists a
+            // current, that means that we reused the fiber. We need to delete
+            // it from the child list so that we don't add it to the deletion
+            // list.
+            existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);
+          }
+        }
+        lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);
+        if (previousNewFiber === null) {
+          resultingFirstChild = _newFiber2;
+        } else {
+          previousNewFiber.sibling = _newFiber2;
+        }
+        previousNewFiber = _newFiber2;
+      }
+    }
+
+    if (shouldTrackSideEffects) {
+      // Any existing children that weren't consumed above were deleted. We need
+      // to add them to the deletion list.
+      existingChildren.forEach(function (child) {
+        return deleteChild(returnFiber, child);
+      });
+    }
+
+    return resultingFirstChild;
+  }
+
+  function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {
+    // This is the same implementation as reconcileChildrenArray(),
+    // but using the iterator instead.
+
+    var iteratorFn = getIteratorFn(newChildrenIterable);
+    !(typeof iteratorFn === 'function') ? invariant_1(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+
+    {
+      // Warn about using Maps as children
+      if (typeof newChildrenIterable.entries === 'function') {
+        var possibleMap = newChildrenIterable;
+        if (possibleMap.entries === iteratorFn) {
+          warning_1(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2());
+          didWarnAboutMaps = true;
+        }
+      }
+
+      // First, validate keys.
+      // We'll get a different iterator later for the main pass.
+      var _newChildren = iteratorFn.call(newChildrenIterable);
+      if (_newChildren) {
+        var knownKeys = null;
+        var _step = _newChildren.next();
+        for (; !_step.done; _step = _newChildren.next()) {
+          var child = _step.value;
+          knownKeys = warnOnInvalidKey(child, knownKeys);
+        }
+      }
+    }
+
+    var newChildren = iteratorFn.call(newChildrenIterable);
+    !(newChildren != null) ? invariant_1(false, 'An iterable object provided no iterator.') : void 0;
+
+    var resultingFirstChild = null;
+    var previousNewFiber = null;
+
+    var oldFiber = currentFirstChild;
+    var lastPlacedIndex = 0;
+    var newIdx = 0;
+    var nextOldFiber = null;
+
+    var step = newChildren.next();
+    for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {
+      if (oldFiber.index > newIdx) {
+        nextOldFiber = oldFiber;
+        oldFiber = null;
+      } else {
+        nextOldFiber = oldFiber.sibling;
+      }
+      var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);
+      if (newFiber === null) {
+        // TODO: This breaks on empty slots like null children. That's
+        // unfortunate because it triggers the slow path all the time. We need
+        // a better way to communicate whether this was a miss or null,
+        // boolean, undefined, etc.
+        if (!oldFiber) {
+          oldFiber = nextOldFiber;
+        }
+        break;
+      }
+      if (shouldTrackSideEffects) {
+        if (oldFiber && newFiber.alternate === null) {
+          // We matched the slot, but we didn't reuse the existing fiber, so we
+          // need to delete the existing child.
+          deleteChild(returnFiber, oldFiber);
+        }
+      }
+      lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);
+      if (previousNewFiber === null) {
+        // TODO: Move out of the loop. This only happens for the first run.
+        resultingFirstChild = newFiber;
+      } else {
+        // TODO: Defer siblings if we're not at the right index for this slot.
+        // I.e. if we had null values before, then we want to defer this
+        // for each null value. However, we also don't want to call updateSlot
+        // with the previous one.
+        previousNewFiber.sibling = newFiber;
+      }
+      previousNewFiber = newFiber;
+      oldFiber = nextOldFiber;
+    }
+
+    if (step.done) {
+      // We've reached the end of the new children. We can delete the rest.
+      deleteRemainingChildren(returnFiber, oldFiber);
+      return resultingFirstChild;
+    }
+
+    if (oldFiber === null) {
+      // If we don't have any more existing children we can choose a fast path
+      // since the rest will all be insertions.
+      for (; !step.done; newIdx++, step = newChildren.next()) {
+        var _newFiber3 = createChild(returnFiber, step.value, expirationTime);
+        if (_newFiber3 === null) {
+          continue;
+        }
+        lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);
+        if (previousNewFiber === null) {
+          // TODO: Move out of the loop. This only happens for the first run.
+          resultingFirstChild = _newFiber3;
+        } else {
+          previousNewFiber.sibling = _newFiber3;
+        }
+        previousNewFiber = _newFiber3;
+      }
+      return resultingFirstChild;
+    }
+
+    // Add all children to a key map for quick lookups.
+    var existingChildren = mapRemainingChildren(returnFiber, oldFiber);
+
+    // Keep scanning and use the map to restore deleted items as moves.
+    for (; !step.done; newIdx++, step = newChildren.next()) {
+      var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);
+      if (_newFiber4 !== null) {
+        if (shouldTrackSideEffects) {
+          if (_newFiber4.alternate !== null) {
+            // The new fiber is a work in progress, but if there exists a
+            // current, that means that we reused the fiber. We need to delete
+            // it from the child list so that we don't add it to the deletion
+            // list.
+            existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);
+          }
+        }
+        lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);
+        if (previousNewFiber === null) {
+          resultingFirstChild = _newFiber4;
+        } else {
+          previousNewFiber.sibling = _newFiber4;
+        }
+        previousNewFiber = _newFiber4;
+      }
+    }
+
+    if (shouldTrackSideEffects) {
+      // Any existing children that weren't consumed above were deleted. We need
+      // to add them to the deletion list.
+      existingChildren.forEach(function (child) {
+        return deleteChild(returnFiber, child);
+      });
+    }
+
+    return resultingFirstChild;
+  }
+
+  function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {
+    // There's no need to check for keys on text nodes since we don't have a
+    // way to define them.
+    if (currentFirstChild !== null && currentFirstChild.tag === HostText) {
+      // We already have an existing node so let's just update it and delete
+      // the rest.
+      deleteRemainingChildren(returnFiber, currentFirstChild.sibling);
+      var existing = useFiber(currentFirstChild, textContent, expirationTime);
+      existing['return'] = returnFiber;
+      return existing;
+    }
+    // The existing first child is not a text node so we need to create one
+    // and delete the existing ones.
+    deleteRemainingChildren(returnFiber, currentFirstChild);
+    var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);
+    created['return'] = returnFiber;
+    return created;
+  }
+
+  function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {
+    var key = element.key;
+    var child = currentFirstChild;
+    while (child !== null) {
+      // TODO: If key === null and child.key === null, then this only applies to
+      // the first item in the list.
+      if (child.key === key) {
+        if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {
+          deleteRemainingChildren(returnFiber, child.sibling);
+          var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);
+          existing.ref = coerceRef(returnFiber, child, element);
+          existing['return'] = returnFiber;
+          {
+            existing._debugSource = element._source;
+            existing._debugOwner = element._owner;
+          }
+          return existing;
+        } else {
+          deleteRemainingChildren(returnFiber, child);
+          break;
+        }
+      } else {
+        deleteChild(returnFiber, child);
+      }
+      child = child.sibling;
+    }
+
+    if (element.type === REACT_FRAGMENT_TYPE) {
+      var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);
+      created['return'] = returnFiber;
+      return created;
+    } else {
+      var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);
+      _created4.ref = coerceRef(returnFiber, currentFirstChild, element);
+      _created4['return'] = returnFiber;
+      return _created4;
+    }
+  }
+
+  function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {
+    var key = portal.key;
+    var child = currentFirstChild;
+    while (child !== null) {
+      // TODO: If key === null and child.key === null, then this only applies to
+      // the first item in the list.
+      if (child.key === key) {
+        if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {
+          deleteRemainingChildren(returnFiber, child.sibling);
+          var existing = useFiber(child, portal.children || [], expirationTime);
+          existing['return'] = returnFiber;
+          return existing;
+        } else {
+          deleteRemainingChildren(returnFiber, child);
+          break;
+        }
+      } else {
+        deleteChild(returnFiber, child);
+      }
+      child = child.sibling;
+    }
+
+    var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);
+    created['return'] = returnFiber;
+    return created;
+  }
+
+  // This API will tag the children with the side-effect of the reconciliation
+  // itself. They will be added to the side-effect list as we pass through the
+  // children and the parent.
+  function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {
+    // This function is not recursive.
+    // If the top level item is an array, we treat it as a set of children,
+    // not as a fragment. Nested arrays on the other hand will be treated as
+    // fragment nodes. Recursion happens at the normal flow.
+
+    // Handle top level unkeyed fragments as if they were arrays.
+    // This leads to an ambiguity between <>{[...]}</> and <>...</>.
+    // We treat the ambiguous cases above the same.
+    if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {
+      newChild = newChild.props.children;
+    }
+
+    // Handle object types
+    var isObject = typeof newChild === 'object' && newChild !== null;
+
+    if (isObject) {
+      switch (newChild.$$typeof) {
+        case REACT_ELEMENT_TYPE:
+          return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));
+        case REACT_PORTAL_TYPE:
+          return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));
+      }
+    }
+
+    if (typeof newChild === 'string' || typeof newChild === 'number') {
+      return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));
+    }
+
+    if (isArray$1(newChild)) {
+      return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);
+    }
+
+    if (getIteratorFn(newChild)) {
+      return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);
+    }
+
+    if (isObject) {
+      throwOnInvalidObjectType(returnFiber, newChild);
+    }
+
+    {
+      if (typeof newChild === 'function') {
+        warnOnFunctionType();
+      }
+    }
+    if (typeof newChild === 'undefined') {
+      // If the new child is undefined, and the return fiber is a composite
+      // component, throw an error. If Fiber return types are disabled,
+      // we already threw above.
+      switch (returnFiber.tag) {
+        case ClassComponent:
+          {
+            {
+              var instance = returnFiber.stateNode;
+              if (instance.render._isMockFunction) {
+                // We allow auto-mocks to proceed as if they're returning null.
+                break;
+              }
+            }
+          }
+        // Intentionally fall through to the next case, which handles both
+        // functions and classes
+        // eslint-disable-next-lined no-fallthrough
+        case FunctionalComponent:
+          {
+            var Component = returnFiber.type;
+            invariant_1(false, '%s(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.', Component.displayName || Component.name || 'Component');
+          }
+      }
+    }
+
+    // Remaining cases are all treated as empty.
+    return deleteRemainingChildren(returnFiber, currentFirstChild);
+  }
+
+  return reconcileChildFibers;
+}
+
+var reconcileChildFibers = ChildReconciler(true);
+var mountChildFibers = ChildReconciler(false);
+
+function cloneChildFibers(current, workInProgress) {
+  !(current === null || workInProgress.child === current.child) ? invariant_1(false, 'Resuming work not yet implemented.') : void 0;
+
+  if (workInProgress.child === null) {
+    return;
+  }
+
+  var currentChild = workInProgress.child;
+  var newChild = createWorkInProgress(currentChild, currentChild.pendingProps, currentChild.expirationTime);
+  workInProgress.child = newChild;
+
+  newChild['return'] = workInProgress;
+  while (currentChild.sibling !== null) {
+    currentChild = currentChild.sibling;
+    newChild = newChild.sibling = createWorkInProgress(currentChild, currentChild.pendingProps, currentChild.expirationTime);
+    newChild['return'] = workInProgress;
+  }
+  newChild.sibling = null;
+}
+
+var didWarnAboutBadClass = void 0;
+var didWarnAboutGetDerivedStateOnFunctionalComponent = void 0;
+var didWarnAboutStatelessRefs = void 0;
+
+{
+  didWarnAboutBadClass = {};
+  didWarnAboutGetDerivedStateOnFunctionalComponent = {};
+  didWarnAboutStatelessRefs = {};
+}
+
+var ReactFiberBeginWork = function (config, hostContext, legacyContext, newContext, hydrationContext, scheduleWork, computeExpirationForFiber) {
+  var shouldSetTextContent = config.shouldSetTextContent,
+      shouldDeprioritizeSubtree = config.shouldDeprioritizeSubtree;
+  var pushHostContext = hostContext.pushHostContext,
+      pushHostContainer = hostContext.pushHostContainer;
+  var pushProvider = newContext.pushProvider;
+  var getMaskedContext = legacyContext.getMaskedContext,
+      getUnmaskedContext = legacyContext.getUnmaskedContext,
+      hasLegacyContextChanged = legacyContext.hasContextChanged,
+      pushLegacyContextProvider = legacyContext.pushContextProvider,
+      pushTopLevelContextObject = legacyContext.pushTopLevelContextObject,
+      invalidateContextProvider = legacyContext.invalidateContextProvider;
+  var enterHydrationState = hydrationContext.enterHydrationState,
+      resetHydrationState = hydrationContext.resetHydrationState,
+      tryToClaimNextHydratableInstance = hydrationContext.tryToClaimNextHydratableInstance;
+
+  var _ReactFiberClassCompo = ReactFiberClassComponent(legacyContext, scheduleWork, computeExpirationForFiber, memoizeProps, memoizeState),
+      adoptClassInstance = _ReactFiberClassCompo.adoptClassInstance,
+      callGetDerivedStateFromProps = _ReactFiberClassCompo.callGetDerivedStateFromProps,
+      constructClassInstance = _ReactFiberClassCompo.constructClassInstance,
+      mountClassInstance = _ReactFiberClassCompo.mountClassInstance,
+      resumeMountClassInstance = _ReactFiberClassCompo.resumeMountClassInstance,
+      updateClassInstance = _ReactFiberClassCompo.updateClassInstance;
+
+  // TODO: Remove this and use reconcileChildrenAtExpirationTime directly.
+
+
+  function reconcileChildren(current, workInProgress, nextChildren) {
+    reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);
+  }
+
+  function reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, renderExpirationTime) {
+    if (current === null) {
+      // If this is a fresh new component that hasn't been rendered yet, we
+      // won't update its child set by applying minimal side-effects. Instead,
+      // we will add them all to the child before it gets rendered. That means
+      // we can optimize this reconciliation pass by not tracking side-effects.
+      workInProgress.child = mountChildFibers(workInProgress, null, nextChildren, renderExpirationTime);
+    } else {
+      // If the current child is the same as the work in progress, it means that
+      // we haven't yet started any work on these children. Therefore, we use
+      // the clone algorithm to create a copy of all the current children.
+
+      // If we had any progressed work already, that is invalid at this point so
+      // let's throw it out.
+      workInProgress.child = reconcileChildFibers(workInProgress, current.child, nextChildren, renderExpirationTime);
+    }
+  }
+
+  function updateForwardRef(current, workInProgress) {
+    var render = workInProgress.type.render;
+    var nextChildren = render(workInProgress.pendingProps, workInProgress.ref);
+    reconcileChildren(current, workInProgress, nextChildren);
+    memoizeProps(workInProgress, nextChildren);
+    return workInProgress.child;
+  }
+
+  function updateFragment(current, workInProgress) {
+    var nextChildren = workInProgress.pendingProps;
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else if (workInProgress.memoizedProps === nextChildren) {
+      return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+    reconcileChildren(current, workInProgress, nextChildren);
+    memoizeProps(workInProgress, nextChildren);
+    return workInProgress.child;
+  }
+
+  function updateMode(current, workInProgress) {
+    var nextChildren = workInProgress.pendingProps.children;
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else if (nextChildren === null || workInProgress.memoizedProps === nextChildren) {
+      return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+    reconcileChildren(current, workInProgress, nextChildren);
+    memoizeProps(workInProgress, nextChildren);
+    return workInProgress.child;
+  }
+
+  function markRef(current, workInProgress) {
+    var ref = workInProgress.ref;
+    if (current === null && ref !== null || current !== null && current.ref !== ref) {
+      // Schedule a Ref effect
+      workInProgress.effectTag |= Ref;
+    }
+  }
+
+  function updateFunctionalComponent(current, workInProgress) {
+    var fn = workInProgress.type;
+    var nextProps = workInProgress.pendingProps;
+
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else {
+      if (workInProgress.memoizedProps === nextProps) {
+        return bailoutOnAlreadyFinishedWork(current, workInProgress);
+      }
+      // TODO: consider bringing fn.shouldComponentUpdate() back.
+      // It used to be here.
+    }
+
+    var unmaskedContext = getUnmaskedContext(workInProgress);
+    var context = getMaskedContext(workInProgress, unmaskedContext);
+
+    var nextChildren = void 0;
+
+    {
+      ReactCurrentOwner.current = workInProgress;
+      ReactDebugCurrentFiber.setCurrentPhase('render');
+      nextChildren = fn(nextProps, context);
+      ReactDebugCurrentFiber.setCurrentPhase(null);
+    }
+    // React DevTools reads this flag.
+    workInProgress.effectTag |= PerformedWork;
+    reconcileChildren(current, workInProgress, nextChildren);
+    memoizeProps(workInProgress, nextProps);
+    return workInProgress.child;
+  }
+
+  function updateClassComponent(current, workInProgress, renderExpirationTime) {
+    // Push context providers early to prevent context stack mismatches.
+    // During mounting we don't know the child context yet as the instance doesn't exist.
+    // We will invalidate the child context in finishClassComponent() right after rendering.
+    var hasContext = pushLegacyContextProvider(workInProgress);
+    var shouldUpdate = void 0;
+    if (current === null) {
+      if (workInProgress.stateNode === null) {
+        // In the initial pass we might need to construct the instance.
+        constructClassInstance(workInProgress, workInProgress.pendingProps);
+        mountClassInstance(workInProgress, renderExpirationTime);
+
+        shouldUpdate = true;
+      } else {
+        // In a resume, we'll already have an instance we can reuse.
+        shouldUpdate = resumeMountClassInstance(workInProgress, renderExpirationTime);
+      }
+    } else {
+      shouldUpdate = updateClassInstance(current, workInProgress, renderExpirationTime);
+    }
+
+    // We processed the update queue inside updateClassInstance. It may have
+    // included some errors that were dispatched during the commit phase.
+    // TODO: Refactor class components so this is less awkward.
+    var didCaptureError = false;
+    var updateQueue = workInProgress.updateQueue;
+    if (updateQueue !== null && updateQueue.capturedValues !== null) {
+      shouldUpdate = true;
+      didCaptureError = true;
+    }
+    return finishClassComponent(current, workInProgress, shouldUpdate, hasContext, didCaptureError, renderExpirationTime);
+  }
+
+  function finishClassComponent(current, workInProgress, shouldUpdate, hasContext, didCaptureError, renderExpirationTime) {
+    // Refs should update even if shouldComponentUpdate returns false
+    markRef(current, workInProgress);
+
+    if (!shouldUpdate && !didCaptureError) {
+      // Context providers should defer to sCU for rendering
+      if (hasContext) {
+        invalidateContextProvider(workInProgress, false);
+      }
+
+      return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+
+    var ctor = workInProgress.type;
+    var instance = workInProgress.stateNode;
+
+    // Rerender
+    ReactCurrentOwner.current = workInProgress;
+    var nextChildren = void 0;
+    if (didCaptureError && (!enableGetDerivedStateFromCatch || typeof ctor.getDerivedStateFromCatch !== 'function')) {
+      // If we captured an error, but getDerivedStateFrom catch is not defined,
+      // unmount all the children. componentDidCatch will schedule an update to
+      // re-render a fallback. This is temporary until we migrate everyone to
+      // the new API.
+      // TODO: Warn in a future release.
+      nextChildren = null;
+    } else {
+      {
+        ReactDebugCurrentFiber.setCurrentPhase('render');
+        nextChildren = instance.render();
+        if (debugRenderPhaseSideEffects || debugRenderPhaseSideEffectsForStrictMode && workInProgress.mode & StrictMode) {
+          instance.render();
+        }
+        ReactDebugCurrentFiber.setCurrentPhase(null);
+      }
+    }
+
+    // React DevTools reads this flag.
+    workInProgress.effectTag |= PerformedWork;
+    if (didCaptureError) {
+      // If we're recovering from an error, reconcile twice: first to delete
+      // all the existing children.
+      reconcileChildrenAtExpirationTime(current, workInProgress, null, renderExpirationTime);
+      workInProgress.child = null;
+      // Now we can continue reconciling like normal. This has the effect of
+      // remounting all children regardless of whether their their
+      // identity matches.
+    }
+    reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, renderExpirationTime);
+    // Memoize props and state using the values we just used to render.
+    // TODO: Restructure so we never read values from the instance.
+    memoizeState(workInProgress, instance.state);
+    memoizeProps(workInProgress, instance.props);
+
+    // The context might have changed so we need to recalculate it.
+    if (hasContext) {
+      invalidateContextProvider(workInProgress, true);
+    }
+
+    return workInProgress.child;
+  }
+
+  function pushHostRootContext(workInProgress) {
+    var root = workInProgress.stateNode;
+    if (root.pendingContext) {
+      pushTopLevelContextObject(workInProgress, root.pendingContext, root.pendingContext !== root.context);
+    } else if (root.context) {
+      // Should always be set
+      pushTopLevelContextObject(workInProgress, root.context, false);
+    }
+    pushHostContainer(workInProgress, root.containerInfo);
+  }
+
+  function updateHostRoot(current, workInProgress, renderExpirationTime) {
+    pushHostRootContext(workInProgress);
+    var updateQueue = workInProgress.updateQueue;
+    if (updateQueue !== null) {
+      var prevState = workInProgress.memoizedState;
+      var state = processUpdateQueue(current, workInProgress, updateQueue, null, null, renderExpirationTime);
+      memoizeState(workInProgress, state);
+      updateQueue = workInProgress.updateQueue;
+
+      var element = void 0;
+      if (updateQueue !== null && updateQueue.capturedValues !== null) {
+        // There's an uncaught error. Unmount the whole root.
+        element = null;
+      } else if (prevState === state) {
+        // If the state is the same as before, that's a bailout because we had
+        // no work that expires at this time.
+        resetHydrationState();
+        return bailoutOnAlreadyFinishedWork(current, workInProgress);
+      } else {
+        element = state.element;
+      }
+      var root = workInProgress.stateNode;
+      if ((current === null || current.child === null) && root.hydrate && enterHydrationState(workInProgress)) {
+        // If we don't have any current children this might be the first pass.
+        // We always try to hydrate. If this isn't a hydration pass there won't
+        // be any children to hydrate which is effectively the same thing as
+        // not hydrating.
+
+        // This is a bit of a hack. We track the host root as a placement to
+        // know that we're currently in a mounting state. That way isMounted
+        // works as expected. We must reset this before committing.
+        // TODO: Delete this when we delete isMounted and findDOMNode.
+        workInProgress.effectTag |= Placement;
+
+        // Ensure that children mount into this root without tracking
+        // side-effects. This ensures that we don't store Placement effects on
+        // nodes that will be hydrated.
+        workInProgress.child = mountChildFibers(workInProgress, null, element, renderExpirationTime);
+      } else {
+        // Otherwise reset hydration state in case we aborted and resumed another
+        // root.
+        resetHydrationState();
+        reconcileChildren(current, workInProgress, element);
+      }
+      memoizeState(workInProgress, state);
+      return workInProgress.child;
+    }
+    resetHydrationState();
+    // If there is no update queue, that's a bailout because the root has no props.
+    return bailoutOnAlreadyFinishedWork(current, workInProgress);
+  }
+
+  function updateHostComponent(current, workInProgress, renderExpirationTime) {
+    pushHostContext(workInProgress);
+
+    if (current === null) {
+      tryToClaimNextHydratableInstance(workInProgress);
+    }
+
+    var type = workInProgress.type;
+    var memoizedProps = workInProgress.memoizedProps;
+    var nextProps = workInProgress.pendingProps;
+    var prevProps = current !== null ? current.memoizedProps : null;
+
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else if (memoizedProps === nextProps) {
+      var isHidden = workInProgress.mode & AsyncMode && shouldDeprioritizeSubtree(type, nextProps);
+      if (isHidden) {
+        // Before bailing out, make sure we've deprioritized a hidden component.
+        workInProgress.expirationTime = Never;
+      }
+      if (!isHidden || renderExpirationTime !== Never) {
+        return bailoutOnAlreadyFinishedWork(current, workInProgress);
+      }
+      // If we're rendering a hidden node at hidden priority, don't bailout. The
+      // parent is complete, but the children may not be.
+    }
+
+    var nextChildren = nextProps.children;
+    var isDirectTextChild = shouldSetTextContent(type, nextProps);
+
+    if (isDirectTextChild) {
+      // We special case a direct text child of a host node. This is a common
+      // case. We won't handle it as a reified child. We will instead handle
+      // this in the host environment that also have access to this prop. That
+      // avoids allocating another HostText fiber and traversing it.
+      nextChildren = null;
+    } else if (prevProps && shouldSetTextContent(type, prevProps)) {
+      // If we're switching from a direct text child to a normal child, or to
+      // empty, we need to schedule the text content to be reset.
+      workInProgress.effectTag |= ContentReset;
+    }
+
+    markRef(current, workInProgress);
+
+    // Check the host config to see if the children are offscreen/hidden.
+    if (renderExpirationTime !== Never && workInProgress.mode & AsyncMode && shouldDeprioritizeSubtree(type, nextProps)) {
+      // Down-prioritize the children.
+      workInProgress.expirationTime = Never;
+      // Bailout and come back to this fiber later.
+      workInProgress.memoizedProps = nextProps;
+      return null;
+    }
+
+    reconcileChildren(current, workInProgress, nextChildren);
+    memoizeProps(workInProgress, nextProps);
+    return workInProgress.child;
+  }
+
+  function updateHostText(current, workInProgress) {
+    if (current === null) {
+      tryToClaimNextHydratableInstance(workInProgress);
+    }
+    var nextProps = workInProgress.pendingProps;
+    memoizeProps(workInProgress, nextProps);
+    // Nothing to do here. This is terminal. We'll do the completion step
+    // immediately after.
+    return null;
+  }
+
+  function mountIndeterminateComponent(current, workInProgress, renderExpirationTime) {
+    !(current === null) ? invariant_1(false, 'An indeterminate component should never have mounted. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+    var fn = workInProgress.type;
+    var props = workInProgress.pendingProps;
+    var unmaskedContext = getUnmaskedContext(workInProgress);
+    var context = getMaskedContext(workInProgress, unmaskedContext);
+
+    var value = void 0;
+
+    {
+      if (fn.prototype && typeof fn.prototype.render === 'function') {
+        var componentName = getComponentName(workInProgress) || 'Unknown';
+
+        if (!didWarnAboutBadClass[componentName]) {
+          warning_1(false, "The <%s /> component appears to have a render method, but doesn't extend React.Component. " + 'This is likely to cause errors. Change %s to extend React.Component instead.', componentName, componentName);
+          didWarnAboutBadClass[componentName] = true;
+        }
+      }
+      ReactCurrentOwner.current = workInProgress;
+      value = fn(props, context);
+    }
+    // React DevTools reads this flag.
+    workInProgress.effectTag |= PerformedWork;
+
+    if (typeof value === 'object' && value !== null && typeof value.render === 'function' && value.$$typeof === undefined) {
+      var Component = workInProgress.type;
+
+      // Proceed under the assumption that this is a class instance
+      workInProgress.tag = ClassComponent;
+
+      workInProgress.memoizedState = value.state !== null && value.state !== undefined ? value.state : null;
+
+      if (typeof Component.getDerivedStateFromProps === 'function') {
+        var partialState = callGetDerivedStateFromProps(workInProgress, value, props, workInProgress.memoizedState);
+
+        if (partialState !== null && partialState !== undefined) {
+          workInProgress.memoizedState = _assign({}, workInProgress.memoizedState, partialState);
+        }
+      }
+
+      // Push context providers early to prevent context stack mismatches.
+      // During mounting we don't know the child context yet as the instance doesn't exist.
+      // We will invalidate the child context in finishClassComponent() right after rendering.
+      var hasContext = pushLegacyContextProvider(workInProgress);
+      adoptClassInstance(workInProgress, value);
+      mountClassInstance(workInProgress, renderExpirationTime);
+      return finishClassComponent(current, workInProgress, true, hasContext, false, renderExpirationTime);
+    } else {
+      // Proceed under the assumption that this is a functional component
+      workInProgress.tag = FunctionalComponent;
+      {
+        var _Component = workInProgress.type;
+
+        if (_Component) {
+          warning_1(!_Component.childContextTypes, '%s(...): childContextTypes cannot be defined on a functional component.', _Component.displayName || _Component.name || 'Component');
+        }
+        if (workInProgress.ref !== null) {
+          var info = '';
+          var ownerName = ReactDebugCurrentFiber.getCurrentFiberOwnerName();
+          if (ownerName) {
+            info += '\n\nCheck the render method of `' + ownerName + '`.';
+          }
+
+          var warningKey = ownerName || workInProgress._debugID || '';
+          var debugSource = workInProgress._debugSource;
+          if (debugSource) {
+            warningKey = debugSource.fileName + ':' + debugSource.lineNumber;
+          }
+          if (!didWarnAboutStatelessRefs[warningKey]) {
+            didWarnAboutStatelessRefs[warningKey] = true;
+            warning_1(false, 'Stateless function components cannot be given refs. ' + 'Attempts to access this ref will fail.%s%s', info, ReactDebugCurrentFiber.getCurrentFiberStackAddendum());
+          }
+        }
+
+        if (typeof fn.getDerivedStateFromProps === 'function') {
+          var _componentName = getComponentName(workInProgress) || 'Unknown';
+
+          if (!didWarnAboutGetDerivedStateOnFunctionalComponent[_componentName]) {
+            warning_1(false, '%s: Stateless functional components do not support getDerivedStateFromProps.', _componentName);
+            didWarnAboutGetDerivedStateOnFunctionalComponent[_componentName] = true;
+          }
+        }
+      }
+      reconcileChildren(current, workInProgress, value);
+      memoizeProps(workInProgress, props);
+      return workInProgress.child;
+    }
+  }
+
+  function updateCallComponent(current, workInProgress, renderExpirationTime) {
+    var nextProps = workInProgress.pendingProps;
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else if (workInProgress.memoizedProps === nextProps) {
+      nextProps = workInProgress.memoizedProps;
+      // TODO: When bailing out, we might need to return the stateNode instead
+      // of the child. To check it for work.
+      // return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+
+    var nextChildren = nextProps.children;
+
+    // The following is a fork of reconcileChildrenAtExpirationTime but using
+    // stateNode to store the child.
+    if (current === null) {
+      workInProgress.stateNode = mountChildFibers(workInProgress, workInProgress.stateNode, nextChildren, renderExpirationTime);
+    } else {
+      workInProgress.stateNode = reconcileChildFibers(workInProgress, current.stateNode, nextChildren, renderExpirationTime);
+    }
+
+    memoizeProps(workInProgress, nextProps);
+    // This doesn't take arbitrary time so we could synchronously just begin
+    // eagerly do the work of workInProgress.child as an optimization.
+    return workInProgress.stateNode;
+  }
+
+  function updatePortalComponent(current, workInProgress, renderExpirationTime) {
+    pushHostContainer(workInProgress, workInProgress.stateNode.containerInfo);
+    var nextChildren = workInProgress.pendingProps;
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else if (workInProgress.memoizedProps === nextChildren) {
+      return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+
+    if (current === null) {
+      // Portals are special because we don't append the children during mount
+      // but at commit. Therefore we need to track insertions which the normal
+      // flow doesn't do during mount. This doesn't happen at the root because
+      // the root always starts with a "current" with a null child.
+      // TODO: Consider unifying this with how the root works.
+      workInProgress.child = reconcileChildFibers(workInProgress, null, nextChildren, renderExpirationTime);
+      memoizeProps(workInProgress, nextChildren);
+    } else {
+      reconcileChildren(current, workInProgress, nextChildren);
+      memoizeProps(workInProgress, nextChildren);
+    }
+    return workInProgress.child;
+  }
+
+  function propagateContextChange(workInProgress, context, changedBits, renderExpirationTime) {
+    var fiber = workInProgress.child;
+    if (fiber !== null) {
+      // Set the return pointer of the child to the work-in-progress fiber.
+      fiber['return'] = workInProgress;
+    }
+    while (fiber !== null) {
+      var nextFiber = void 0;
+      // Visit this fiber.
+      switch (fiber.tag) {
+        case ContextConsumer:
+          // Check if the context matches.
+          var observedBits = fiber.stateNode | 0;
+          if (fiber.type === context && (observedBits & changedBits) !== 0) {
+            // Update the expiration time of all the ancestors, including
+            // the alternates.
+            var node = fiber;
+            while (node !== null) {
+              var alternate = node.alternate;
+              if (node.expirationTime === NoWork || node.expirationTime > renderExpirationTime) {
+                node.expirationTime = renderExpirationTime;
+                if (alternate !== null && (alternate.expirationTime === NoWork || alternate.expirationTime > renderExpirationTime)) {
+                  alternate.expirationTime = renderExpirationTime;
+                }
+              } else if (alternate !== null && (alternate.expirationTime === NoWork || alternate.expirationTime > renderExpirationTime)) {
+                alternate.expirationTime = renderExpirationTime;
+              } else {
+                // Neither alternate was updated, which means the rest of the
+                // ancestor path already has sufficient priority.
+                break;
+              }
+              node = node['return'];
+            }
+            // Don't scan deeper than a matching consumer. When we render the
+            // consumer, we'll continue scanning from that point. This way the
+            // scanning work is time-sliced.
+            nextFiber = null;
+          } else {
+            // Traverse down.
+            nextFiber = fiber.child;
+          }
+          break;
+        case ContextProvider:
+          // Don't scan deeper if this is a matching provider
+          nextFiber = fiber.type === workInProgress.type ? null : fiber.child;
+          break;
+        default:
+          // Traverse down.
+          nextFiber = fiber.child;
+          break;
+      }
+      if (nextFiber !== null) {
+        // Set the return pointer of the child to the work-in-progress fiber.
+        nextFiber['return'] = fiber;
+      } else {
+        // No child. Traverse to next sibling.
+        nextFiber = fiber;
+        while (nextFiber !== null) {
+          if (nextFiber === workInProgress) {
+            // We're back to the root of this subtree. Exit.
+            nextFiber = null;
+            break;
+          }
+          var sibling = nextFiber.sibling;
+          if (sibling !== null) {
+            nextFiber = sibling;
+            break;
+          }
+          // No more siblings. Traverse up.
+          nextFiber = nextFiber['return'];
+        }
+      }
+      fiber = nextFiber;
+    }
+  }
+
+  function updateContextProvider(current, workInProgress, renderExpirationTime) {
+    var providerType = workInProgress.type;
+    var context = providerType.context;
+
+    var newProps = workInProgress.pendingProps;
+    var oldProps = workInProgress.memoizedProps;
+
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else if (oldProps === newProps) {
+      workInProgress.stateNode = 0;
+      pushProvider(workInProgress);
+      return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+
+    var newValue = newProps.value;
+    workInProgress.memoizedProps = newProps;
+
+    var changedBits = void 0;
+    if (oldProps === null) {
+      // Initial render
+      changedBits = MAX_SIGNED_31_BIT_INT;
+    } else {
+      if (oldProps.value === newProps.value) {
+        // No change. Bailout early if children are the same.
+        if (oldProps.children === newProps.children) {
+          workInProgress.stateNode = 0;
+          pushProvider(workInProgress);
+          return bailoutOnAlreadyFinishedWork(current, workInProgress);
+        }
+        changedBits = 0;
+      } else {
+        var oldValue = oldProps.value;
+        // Use Object.is to compare the new context value to the old value.
+        // Inlined Object.is polyfill.
+        // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
+        if (oldValue === newValue && (oldValue !== 0 || 1 / oldValue === 1 / newValue) || oldValue !== oldValue && newValue !== newValue // eslint-disable-line no-self-compare
+        ) {
+            // No change. Bailout early if children are the same.
+            if (oldProps.children === newProps.children) {
+              workInProgress.stateNode = 0;
+              pushProvider(workInProgress);
+              return bailoutOnAlreadyFinishedWork(current, workInProgress);
+            }
+            changedBits = 0;
+          } else {
+          changedBits = typeof context._calculateChangedBits === 'function' ? context._calculateChangedBits(oldValue, newValue) : MAX_SIGNED_31_BIT_INT;
+          {
+            warning_1((changedBits & MAX_SIGNED_31_BIT_INT) === changedBits, 'calculateChangedBits: Expected the return value to be a ' + '31-bit integer. Instead received: %s', changedBits);
+          }
+          changedBits |= 0;
+
+          if (changedBits === 0) {
+            // No change. Bailout early if children are the same.
+            if (oldProps.children === newProps.children) {
+              workInProgress.stateNode = 0;
+              pushProvider(workInProgress);
+              return bailoutOnAlreadyFinishedWork(current, workInProgress);
+            }
+          } else {
+            propagateContextChange(workInProgress, context, changedBits, renderExpirationTime);
+          }
+        }
+      }
+    }
+
+    workInProgress.stateNode = changedBits;
+    pushProvider(workInProgress);
+
+    var newChildren = newProps.children;
+    reconcileChildren(current, workInProgress, newChildren);
+    return workInProgress.child;
+  }
+
+  function updateContextConsumer(current, workInProgress, renderExpirationTime) {
+    var context = workInProgress.type;
+    var newProps = workInProgress.pendingProps;
+    var oldProps = workInProgress.memoizedProps;
+
+    var newValue = context._currentValue;
+    var changedBits = context._changedBits;
+
+    if (hasLegacyContextChanged()) {
+      // Normally we can bail out on props equality but if context has changed
+      // we don't do the bailout and we have to reuse existing props instead.
+    } else if (changedBits === 0 && oldProps === newProps) {
+      return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+    workInProgress.memoizedProps = newProps;
+
+    var observedBits = newProps.unstable_observedBits;
+    if (observedBits === undefined || observedBits === null) {
+      // Subscribe to all changes by default
+      observedBits = MAX_SIGNED_31_BIT_INT;
+    }
+    // Store the observedBits on the fiber's stateNode for quick access.
+    workInProgress.stateNode = observedBits;
+
+    if ((changedBits & observedBits) !== 0) {
+      // Context change propagation stops at matching consumers, for time-
+      // slicing. Continue the propagation here.
+      propagateContextChange(workInProgress, context, changedBits, renderExpirationTime);
+    }
+    // There is no bailout on `children` equality because we expect people
+    // to often pass a bound method as a child, but it may reference
+    // `this.state` or `this.props` (and thus needs to re-render on `setState`).
+
+    var render = newProps.children;
+
+    {
+      warning_1(typeof render === 'function', 'A context consumer was rendered with multiple children, or a child ' + "that isn't a function. A context consumer expects a single child " + 'that is a function. If you did pass a function, make sure there ' + 'is no trailing or leading whitespace around it.');
+    }
+
+    var newChildren = render(newValue);
+    reconcileChildren(current, workInProgress, newChildren);
+    return workInProgress.child;
+  }
+
+  /*
+  function reuseChildrenEffects(returnFiber : Fiber, firstChild : Fiber) {
+    let child = firstChild;
+    do {
+      // Ensure that the first and last effect of the parent corresponds
+      // to the children's first and last effect.
+      if (!returnFiber.firstEffect) {
+        returnFiber.firstEffect = child.firstEffect;
+      }
+      if (child.lastEffect) {
+        if (returnFiber.lastEffect) {
+          returnFiber.lastEffect.nextEffect = child.firstEffect;
+        }
+        returnFiber.lastEffect = child.lastEffect;
+      }
+    } while (child = child.sibling);
+  }
+  */
+
+  function bailoutOnAlreadyFinishedWork(current, workInProgress) {
+    cancelWorkTimer(workInProgress);
+
+    // TODO: We should ideally be able to bail out early if the children have no
+    // more work to do. However, since we don't have a separation of this
+    // Fiber's priority and its children yet - we don't know without doing lots
+    // of the same work we do anyway. Once we have that separation we can just
+    // bail out here if the children has no more work at this priority level.
+    // if (workInProgress.priorityOfChildren <= priorityLevel) {
+    //   // If there are side-effects in these children that have not yet been
+    //   // committed we need to ensure that they get properly transferred up.
+    //   if (current && current.child !== workInProgress.child) {
+    //     reuseChildrenEffects(workInProgress, child);
+    //   }
+    //   return null;
+    // }
+
+    cloneChildFibers(current, workInProgress);
+    return workInProgress.child;
+  }
+
+  function bailoutOnLowPriority(current, workInProgress) {
+    cancelWorkTimer(workInProgress);
+
+    // TODO: Handle HostComponent tags here as well and call pushHostContext()?
+    // See PR 8590 discussion for context
+    switch (workInProgress.tag) {
+      case HostRoot:
+        pushHostRootContext(workInProgress);
+        break;
+      case ClassComponent:
+        pushLegacyContextProvider(workInProgress);
+        break;
+      case HostPortal:
+        pushHostContainer(workInProgress, workInProgress.stateNode.containerInfo);
+        break;
+      case ContextProvider:
+        pushProvider(workInProgress);
+        break;
+    }
+    // TODO: What if this is currently in progress?
+    // How can that happen? How is this not being cloned?
+    return null;
+  }
+
+  // TODO: Delete memoizeProps/State and move to reconcile/bailout instead
+  function memoizeProps(workInProgress, nextProps) {
+    workInProgress.memoizedProps = nextProps;
+  }
+
+  function memoizeState(workInProgress, nextState) {
+    workInProgress.memoizedState = nextState;
+    // Don't reset the updateQueue, in case there are pending updates. Resetting
+    // is handled by processUpdateQueue.
+  }
+
+  function beginWork(current, workInProgress, renderExpirationTime) {
+    if (workInProgress.expirationTime === NoWork || workInProgress.expirationTime > renderExpirationTime) {
+      return bailoutOnLowPriority(current, workInProgress);
+    }
+
+    switch (workInProgress.tag) {
+      case IndeterminateComponent:
+        return mountIndeterminateComponent(current, workInProgress, renderExpirationTime);
+      case FunctionalComponent:
+        return updateFunctionalComponent(current, workInProgress);
+      case ClassComponent:
+        return updateClassComponent(current, workInProgress, renderExpirationTime);
+      case HostRoot:
+        return updateHostRoot(current, workInProgress, renderExpirationTime);
+      case HostComponent:
+        return updateHostComponent(current, workInProgress, renderExpirationTime);
+      case HostText:
+        return updateHostText(current, workInProgress);
+      case CallHandlerPhase:
+        // This is a restart. Reset the tag to the initial phase.
+        workInProgress.tag = CallComponent;
+      // Intentionally fall through since this is now the same.
+      case CallComponent:
+        return updateCallComponent(current, workInProgress, renderExpirationTime);
+      case ReturnComponent:
+        // A return component is just a placeholder, we can just run through the
+        // next one immediately.
+        return null;
+      case HostPortal:
+        return updatePortalComponent(current, workInProgress, renderExpirationTime);
+      case ForwardRef:
+        return updateForwardRef(current, workInProgress);
+      case Fragment:
+        return updateFragment(current, workInProgress);
+      case Mode:
+        return updateMode(current, workInProgress);
+      case ContextProvider:
+        return updateContextProvider(current, workInProgress, renderExpirationTime);
+      case ContextConsumer:
+        return updateContextConsumer(current, workInProgress, renderExpirationTime);
+      default:
+        invariant_1(false, 'Unknown unit of work tag. This error is likely caused by a bug in React. Please file an issue.');
+    }
+  }
+
+  return {
+    beginWork: beginWork
+  };
+};
+
+var ReactFiberCompleteWork = function (config, hostContext, legacyContext, newContext, hydrationContext) {
+  var createInstance = config.createInstance,
+      createTextInstance = config.createTextInstance,
+      appendInitialChild = config.appendInitialChild,
+      finalizeInitialChildren = config.finalizeInitialChildren,
+      prepareUpdate = config.prepareUpdate,
+      mutation = config.mutation,
+      persistence = config.persistence;
+  var getRootHostContainer = hostContext.getRootHostContainer,
+      popHostContext = hostContext.popHostContext,
+      getHostContext = hostContext.getHostContext,
+      popHostContainer = hostContext.popHostContainer;
+  var popLegacyContextProvider = legacyContext.popContextProvider,
+      popTopLevelLegacyContextObject = legacyContext.popTopLevelContextObject;
+  var popProvider = newContext.popProvider;
+  var prepareToHydrateHostInstance = hydrationContext.prepareToHydrateHostInstance,
+      prepareToHydrateHostTextInstance = hydrationContext.prepareToHydrateHostTextInstance,
+      popHydrationState = hydrationContext.popHydrationState;
+
+
+  function markUpdate(workInProgress) {
+    // Tag the fiber with an update effect. This turns a Placement into
+    // an UpdateAndPlacement.
+    workInProgress.effectTag |= Update;
+  }
+
+  function markRef(workInProgress) {
+    workInProgress.effectTag |= Ref;
+  }
+
+  function appendAllReturns(returns, workInProgress) {
+    var node = workInProgress.stateNode;
+    if (node) {
+      node['return'] = workInProgress;
+    }
+    while (node !== null) {
+      if (node.tag === HostComponent || node.tag === HostText || node.tag === HostPortal) {
+        invariant_1(false, 'A call cannot have host component children.');
+      } else if (node.tag === ReturnComponent) {
+        returns.push(node.pendingProps.value);
+      } else if (node.child !== null) {
+        node.child['return'] = node;
+        node = node.child;
+        continue;
+      }
+      while (node.sibling === null) {
+        if (node['return'] === null || node['return'] === workInProgress) {
+          return;
+        }
+        node = node['return'];
+      }
+      node.sibling['return'] = node['return'];
+      node = node.sibling;
+    }
+  }
+
+  function moveCallToHandlerPhase(current, workInProgress, renderExpirationTime) {
+    var props = workInProgress.memoizedProps;
+    !props ? invariant_1(false, 'Should be resolved by now. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+
+    // First step of the call has completed. Now we need to do the second.
+    // TODO: It would be nice to have a multi stage call represented by a
+    // single component, or at least tail call optimize nested ones. Currently
+    // that requires additional fields that we don't want to add to the fiber.
+    // So this requires nested handlers.
+    // Note: This doesn't mutate the alternate node. I don't think it needs to
+    // since this stage is reset for every pass.
+    workInProgress.tag = CallHandlerPhase;
+
+    // Build up the returns.
+    // TODO: Compare this to a generator or opaque helpers like Children.
+    var returns = [];
+    appendAllReturns(returns, workInProgress);
+    var fn = props.handler;
+    var childProps = props.props;
+    var nextChildren = fn(childProps, returns);
+
+    var currentFirstChild = current !== null ? current.child : null;
+    workInProgress.child = reconcileChildFibers(workInProgress, currentFirstChild, nextChildren, renderExpirationTime);
+    return workInProgress.child;
+  }
+
+  function appendAllChildren(parent, workInProgress) {
+    // We only have the top Fiber that was created but we need recurse down its
+    // children to find all the terminal nodes.
+    var node = workInProgress.child;
+    while (node !== null) {
+      if (node.tag === HostComponent || node.tag === HostText) {
+        appendInitialChild(parent, node.stateNode);
+      } else if (node.tag === HostPortal) {
+        // If we have a portal child, then we don't want to traverse
+        // down its children. Instead, we'll get insertions from each child in
+        // the portal directly.
+      } else if (node.child !== null) {
+        node.child['return'] = node;
+        node = node.child;
+        continue;
+      }
+      if (node === workInProgress) {
+        return;
+      }
+      while (node.sibling === null) {
+        if (node['return'] === null || node['return'] === workInProgress) {
+          return;
+        }
+        node = node['return'];
+      }
+      node.sibling['return'] = node['return'];
+      node = node.sibling;
+    }
+  }
+
+  var updateHostContainer = void 0;
+  var updateHostComponent = void 0;
+  var updateHostText = void 0;
+  if (mutation) {
+    if (enableMutatingReconciler) {
+      // Mutation mode
+      updateHostContainer = function (workInProgress) {
+        // Noop
+      };
+      updateHostComponent = function (current, workInProgress, updatePayload, type, oldProps, newProps, rootContainerInstance, currentHostContext) {
+        // TODO: Type this specific to this type of component.
+        workInProgress.updateQueue = updatePayload;
+        // If the update payload indicates that there is a change or if there
+        // is a new ref we mark this as an update. All the work is done in commitWork.
+        if (updatePayload) {
+          markUpdate(workInProgress);
+        }
+      };
+      updateHostText = function (current, workInProgress, oldText, newText) {
+        // If the text differs, mark it as an update. All the work in done in commitWork.
+        if (oldText !== newText) {
+          markUpdate(workInProgress);
+        }
+      };
+    } else {
+      invariant_1(false, 'Mutating reconciler is disabled.');
+    }
+  } else if (persistence) {
+    if (enablePersistentReconciler) {
+      // Persistent host tree mode
+      var cloneInstance = persistence.cloneInstance,
+          createContainerChildSet = persistence.createContainerChildSet,
+          appendChildToContainerChildSet = persistence.appendChildToContainerChildSet,
+          finalizeContainerChildren = persistence.finalizeContainerChildren;
+
+      // An unfortunate fork of appendAllChildren because we have two different parent types.
+
+      var appendAllChildrenToContainer = function (containerChildSet, workInProgress) {
+        // We only have the top Fiber that was created but we need recurse down its
+        // children to find all the terminal nodes.
+        var node = workInProgress.child;
+        while (node !== null) {
+          if (node.tag === HostComponent || node.tag === HostText) {
+            appendChildToContainerChildSet(containerChildSet, node.stateNode);
+          } else if (node.tag === HostPortal) {
+            // If we have a portal child, then we don't want to traverse
+            // down its children. Instead, we'll get insertions from each child in
+            // the portal directly.
+          } else if (node.child !== null) {
+            node.child['return'] = node;
+            node = node.child;
+            continue;
+          }
+          if (node === workInProgress) {
+            return;
+          }
+          while (node.sibling === null) {
+            if (node['return'] === null || node['return'] === workInProgress) {
+              return;
+            }
+            node = node['return'];
+          }
+          node.sibling['return'] = node['return'];
+          node = node.sibling;
+        }
+      };
+      updateHostContainer = function (workInProgress) {
+        var portalOrRoot = workInProgress.stateNode;
+        var childrenUnchanged = workInProgress.firstEffect === null;
+        if (childrenUnchanged) {
+          // No changes, just reuse the existing instance.
+        } else {
+          var container = portalOrRoot.containerInfo;
+          var newChildSet = createContainerChildSet(container);
+          // If children might have changed, we have to add them all to the set.
+          appendAllChildrenToContainer(newChildSet, workInProgress);
+          portalOrRoot.pendingChildren = newChildSet;
+          // Schedule an update on the container to swap out the container.
+          markUpdate(workInProgress);
+          finalizeContainerChildren(container, newChildSet);
+        }
+      };
+      updateHostComponent = function (current, workInProgress, updatePayload, type, oldProps, newProps, rootContainerInstance, currentHostContext) {
+        // If there are no effects associated with this node, then none of our children had any updates.
+        // This guarantees that we can reuse all of them.
+        var childrenUnchanged = workInProgress.firstEffect === null;
+        var currentInstance = current.stateNode;
+        if (childrenUnchanged && updatePayload === null) {
+          // No changes, just reuse the existing instance.
+          // Note that this might release a previous clone.
+          workInProgress.stateNode = currentInstance;
+        } else {
+          var recyclableInstance = workInProgress.stateNode;
+          var newInstance = cloneInstance(currentInstance, updatePayload, type, oldProps, newProps, workInProgress, childrenUnchanged, recyclableInstance);
+          if (finalizeInitialChildren(newInstance, type, newProps, rootContainerInstance, currentHostContext)) {
+            markUpdate(workInProgress);
+          }
+          workInProgress.stateNode = newInstance;
+          if (childrenUnchanged) {
+            // If there are no other effects in this tree, we need to flag this node as having one.
+            // Even though we're not going to use it for anything.
+            // Otherwise parents won't know that there are new children to propagate upwards.
+            markUpdate(workInProgress);
+          } else {
+            // If children might have changed, we have to add them all to the set.
+            appendAllChildren(newInstance, workInProgress);
+          }
+        }
+      };
+      updateHostText = function (current, workInProgress, oldText, newText) {
+        if (oldText !== newText) {
+          // If the text content differs, we'll create a new text instance for it.
+          var rootContainerInstance = getRootHostContainer();
+          var currentHostContext = getHostContext();
+          workInProgress.stateNode = createTextInstance(newText, rootContainerInstance, currentHostContext, workInProgress);
+          // We'll have to mark it as having an effect, even though we won't use the effect for anything.
+          // This lets the parents know that at least one of their children has changed.
+          markUpdate(workInProgress);
+        }
+      };
+    } else {
+      invariant_1(false, 'Persistent reconciler is disabled.');
+    }
+  } else {
+    if (enableNoopReconciler) {
+      // No host operations
+      updateHostContainer = function (workInProgress) {
+        // Noop
+      };
+      updateHostComponent = function (current, workInProgress, updatePayload, type, oldProps, newProps, rootContainerInstance, currentHostContext) {
+        // Noop
+      };
+      updateHostText = function (current, workInProgress, oldText, newText) {
+        // Noop
+      };
+    } else {
+      invariant_1(false, 'Noop reconciler is disabled.');
+    }
+  }
+
+  function completeWork(current, workInProgress, renderExpirationTime) {
+    var newProps = workInProgress.pendingProps;
+    switch (workInProgress.tag) {
+      case FunctionalComponent:
+        return null;
+      case ClassComponent:
+        {
+          // We are leaving this subtree, so pop context if any.
+          popLegacyContextProvider(workInProgress);
+
+          // If this component caught an error, schedule an error log effect.
+          var instance = workInProgress.stateNode;
+          var updateQueue = workInProgress.updateQueue;
+          if (updateQueue !== null && updateQueue.capturedValues !== null) {
+            workInProgress.effectTag &= ~DidCapture;
+            if (typeof instance.componentDidCatch === 'function') {
+              workInProgress.effectTag |= ErrLog;
+            } else {
+              // Normally we clear this in the commit phase, but since we did not
+              // schedule an effect, we need to reset it here.
+              updateQueue.capturedValues = null;
+            }
+          }
+          return null;
+        }
+      case HostRoot:
+        {
+          popHostContainer(workInProgress);
+          popTopLevelLegacyContextObject(workInProgress);
+          var fiberRoot = workInProgress.stateNode;
+          if (fiberRoot.pendingContext) {
+            fiberRoot.context = fiberRoot.pendingContext;
+            fiberRoot.pendingContext = null;
+          }
+          if (current === null || current.child === null) {
+            // If we hydrated, pop so that we can delete any remaining children
+            // that weren't hydrated.
+            popHydrationState(workInProgress);
+            // This resets the hacky state to fix isMounted before committing.
+            // TODO: Delete this when we delete isMounted and findDOMNode.
+            workInProgress.effectTag &= ~Placement;
+          }
+          updateHostContainer(workInProgress);
+
+          var _updateQueue = workInProgress.updateQueue;
+          if (_updateQueue !== null && _updateQueue.capturedValues !== null) {
+            workInProgress.effectTag |= ErrLog;
+          }
+          return null;
+        }
+      case HostComponent:
+        {
+          popHostContext(workInProgress);
+          var rootContainerInstance = getRootHostContainer();
+          var type = workInProgress.type;
+          if (current !== null && workInProgress.stateNode != null) {
+            // If we have an alternate, that means this is an update and we need to
+            // schedule a side-effect to do the updates.
+            var oldProps = current.memoizedProps;
+            // If we get updated because one of our children updated, we don't
+            // have newProps so we'll have to reuse them.
+            // TODO: Split the update API as separate for the props vs. children.
+            // Even better would be if children weren't special cased at all tho.
+            var _instance = workInProgress.stateNode;
+            var currentHostContext = getHostContext();
+            // TODO: Experiencing an error where oldProps is null. Suggests a host
+            // component is hitting the resume path. Figure out why. Possibly
+            // related to `hidden`.
+            var updatePayload = prepareUpdate(_instance, type, oldProps, newProps, rootContainerInstance, currentHostContext);
+
+            updateHostComponent(current, workInProgress, updatePayload, type, oldProps, newProps, rootContainerInstance, currentHostContext);
+
+            if (current.ref !== workInProgress.ref) {
+              markRef(workInProgress);
+            }
+          } else {
+            if (!newProps) {
+              !(workInProgress.stateNode !== null) ? invariant_1(false, 'We must have new props for new mounts. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+              // This can happen when we abort work.
+              return null;
+            }
+
+            var _currentHostContext = getHostContext();
+            // TODO: Move createInstance to beginWork and keep it on a context
+            // "stack" as the parent. Then append children as we go in beginWork
+            // or completeWork depending on we want to add then top->down or
+            // bottom->up. Top->down is faster in IE11.
+            var wasHydrated = popHydrationState(workInProgress);
+            if (wasHydrated) {
+              // TODO: Move this and createInstance step into the beginPhase
+              // to consolidate.
+              if (prepareToHydrateHostInstance(workInProgress, rootContainerInstance, _currentHostContext)) {
+                // If changes to the hydrated node needs to be applied at the
+                // commit-phase we mark this as such.
+                markUpdate(workInProgress);
+              }
+            } else {
+              var _instance2 = createInstance(type, newProps, rootContainerInstance, _currentHostContext, workInProgress);
+
+              appendAllChildren(_instance2, workInProgress);
+
+              // Certain renderers require commit-time effects for initial mount.
+              // (eg DOM renderer supports auto-focus for certain elements).
+              // Make sure such renderers get scheduled for later work.
+              if (finalizeInitialChildren(_instance2, type, newProps, rootContainerInstance, _currentHostContext)) {
+                markUpdate(workInProgress);
+              }
+              workInProgress.stateNode = _instance2;
+            }
+
+            if (workInProgress.ref !== null) {
+              // If there is a ref on a host node we need to schedule a callback
+              markRef(workInProgress);
+            }
+          }
+          return null;
+        }
+      case HostText:
+        {
+          var newText = newProps;
+          if (current && workInProgress.stateNode != null) {
+            var oldText = current.memoizedProps;
+            // If we have an alternate, that means this is an update and we need
+            // to schedule a side-effect to do the updates.
+            updateHostText(current, workInProgress, oldText, newText);
+          } else {
+            if (typeof newText !== 'string') {
+              !(workInProgress.stateNode !== null) ? invariant_1(false, 'We must have new props for new mounts. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+              // This can happen when we abort work.
+              return null;
+            }
+            var _rootContainerInstance = getRootHostContainer();
+            var _currentHostContext2 = getHostContext();
+            var _wasHydrated = popHydrationState(workInProgress);
+            if (_wasHydrated) {
+              if (prepareToHydrateHostTextInstance(workInProgress)) {
+                markUpdate(workInProgress);
+              }
+            } else {
+              workInProgress.stateNode = createTextInstance(newText, _rootContainerInstance, _currentHostContext2, workInProgress);
+            }
+          }
+          return null;
+        }
+      case CallComponent:
+        return moveCallToHandlerPhase(current, workInProgress, renderExpirationTime);
+      case CallHandlerPhase:
+        // Reset the tag to now be a first phase call.
+        workInProgress.tag = CallComponent;
+        return null;
+      case ReturnComponent:
+        // Does nothing.
+        return null;
+      case ForwardRef:
+        return null;
+      case Fragment:
+        return null;
+      case Mode:
+        return null;
+      case HostPortal:
+        popHostContainer(workInProgress);
+        updateHostContainer(workInProgress);
+        return null;
+      case ContextProvider:
+        // Pop provider fiber
+        popProvider(workInProgress);
+        return null;
+      case ContextConsumer:
+        return null;
+      // Error cases
+      case IndeterminateComponent:
+        invariant_1(false, 'An indeterminate component should have become determinate before completing. This error is likely caused by a bug in React. Please file an issue.');
+      // eslint-disable-next-line no-fallthrough
+      default:
+        invariant_1(false, 'Unknown unit of work tag. This error is likely caused by a bug in React. Please file an issue.');
+    }
+  }
+
+  return {
+    completeWork: completeWork
+  };
+};
+
+function createCapturedValue(value, source) {
+  // If the value is an error, call this function immediately after it is thrown
+  // so the stack is accurate.
+  return {
+    value: value,
+    source: source,
+    stack: getStackAddendumByWorkInProgressFiber(source)
+  };
+}
+
+var ReactFiberUnwindWork = function (hostContext, legacyContext, newContext, scheduleWork, isAlreadyFailedLegacyErrorBoundary) {
+  var popHostContainer = hostContext.popHostContainer,
+      popHostContext = hostContext.popHostContext;
+  var popLegacyContextProvider = legacyContext.popContextProvider,
+      popTopLevelLegacyContextObject = legacyContext.popTopLevelContextObject;
+  var popProvider = newContext.popProvider;
+
+
+  function throwException(returnFiber, sourceFiber, rawValue) {
+    // The source fiber did not complete.
+    sourceFiber.effectTag |= Incomplete;
+    // Its effect list is no longer valid.
+    sourceFiber.firstEffect = sourceFiber.lastEffect = null;
+
+    var value = createCapturedValue(rawValue, sourceFiber);
+
+    var workInProgress = returnFiber;
+    do {
+      switch (workInProgress.tag) {
+        case HostRoot:
+          {
+            // Uncaught error
+            var errorInfo = value;
+            ensureUpdateQueues(workInProgress);
+            var updateQueue = workInProgress.updateQueue;
+            updateQueue.capturedValues = [errorInfo];
+            workInProgress.effectTag |= ShouldCapture;
+            return;
+          }
+        case ClassComponent:
+          // Capture and retry
+          var ctor = workInProgress.type;
+          var _instance = workInProgress.stateNode;
+          if ((workInProgress.effectTag & DidCapture) === NoEffect && (typeof ctor.getDerivedStateFromCatch === 'function' && enableGetDerivedStateFromCatch || _instance !== null && typeof _instance.componentDidCatch === 'function' && !isAlreadyFailedLegacyErrorBoundary(_instance))) {
+            ensureUpdateQueues(workInProgress);
+            var _updateQueue = workInProgress.updateQueue;
+            var capturedValues = _updateQueue.capturedValues;
+            if (capturedValues === null) {
+              _updateQueue.capturedValues = [value];
+            } else {
+              capturedValues.push(value);
+            }
+            workInProgress.effectTag |= ShouldCapture;
+            return;
+          }
+          break;
+        default:
+          break;
+      }
+      workInProgress = workInProgress['return'];
+    } while (workInProgress !== null);
+  }
+
+  function unwindWork(workInProgress) {
+    switch (workInProgress.tag) {
+      case ClassComponent:
+        {
+          popLegacyContextProvider(workInProgress);
+          var effectTag = workInProgress.effectTag;
+          if (effectTag & ShouldCapture) {
+            workInProgress.effectTag = effectTag & ~ShouldCapture | DidCapture;
+            return workInProgress;
+          }
+          return null;
+        }
+      case HostRoot:
+        {
+          popHostContainer(workInProgress);
+          popTopLevelLegacyContextObject(workInProgress);
+          var _effectTag = workInProgress.effectTag;
+          if (_effectTag & ShouldCapture) {
+            workInProgress.effectTag = _effectTag & ~ShouldCapture | DidCapture;
+            return workInProgress;
+          }
+          return null;
+        }
+      case HostComponent:
+        {
+          popHostContext(workInProgress);
+          return null;
+        }
+      case HostPortal:
+        popHostContainer(workInProgress);
+        return null;
+      case ContextProvider:
+        popProvider(workInProgress);
+        return null;
+      default:
+        return null;
+    }
+  }
+
+  function unwindInterruptedWork(interruptedWork) {
+    switch (interruptedWork.tag) {
+      case ClassComponent:
+        {
+          popLegacyContextProvider(interruptedWork);
+          break;
+        }
+      case HostRoot:
+        {
+          popHostContainer(interruptedWork);
+          popTopLevelLegacyContextObject(interruptedWork);
+          break;
+        }
+      case HostComponent:
+        {
+          popHostContext(interruptedWork);
+          break;
+        }
+      case HostPortal:
+        popHostContainer(interruptedWork);
+        break;
+      case ContextProvider:
+        popProvider(interruptedWork);
+        break;
+      default:
+        break;
+    }
+  }
+
+  return {
+    throwException: throwException,
+    unwindWork: unwindWork,
+    unwindInterruptedWork: unwindInterruptedWork
+  };
+};
+
+// This module is forked in different environments.
+// By default, return `true` to log errors to the console.
+// Forks can return `false` if this isn't desirable.
+function showErrorDialog(capturedError) {
+  return true;
+}
+
+function logCapturedError(capturedError) {
+  var logError = showErrorDialog(capturedError);
+
+  // Allow injected showErrorDialog() to prevent default console.error logging.
+  // This enables renderers like ReactNative to better manage redbox behavior.
+  if (logError === false) {
+    return;
+  }
+
+  var error = capturedError.error;
+  var suppressLogging = error && error.suppressReactErrorLogging;
+  if (suppressLogging) {
+    return;
+  }
+
+  {
+    var componentName = capturedError.componentName,
+        componentStack = capturedError.componentStack,
+        errorBoundaryName = capturedError.errorBoundaryName,
+        errorBoundaryFound = capturedError.errorBoundaryFound,
+        willRetry = capturedError.willRetry;
+
+
+    var componentNameMessage = componentName ? 'The above error occurred in the <' + componentName + '> component:' : 'The above error occurred in one of your React components:';
+
+    var errorBoundaryMessage = void 0;
+    // errorBoundaryFound check is sufficient; errorBoundaryName check is to satisfy Flow.
+    if (errorBoundaryFound && errorBoundaryName) {
+      if (willRetry) {
+        errorBoundaryMessage = 'React will try to recreate this component tree from scratch ' + ('using the error boundary you provided, ' + errorBoundaryName + '.');
+      } else {
+        errorBoundaryMessage = 'This error was initially handled by the error boundary ' + errorBoundaryName + '.\n' + 'Recreating the tree from scratch failed so React will unmount the tree.';
+      }
+    } else {
+      errorBoundaryMessage = 'Consider adding an error boundary to your tree to customize error handling behavior.\n' + 'Visit https://fb.me/react-error-boundaries to learn more about error boundaries.';
+    }
+    var combinedMessage = '' + componentNameMessage + componentStack + '\n\n' + ('' + errorBoundaryMessage);
+
+    // In development, we provide our own message with just the component stack.
+    // We don't include the original error message and JS stack because the browser
+    // has already printed it. Even if the application swallows the error, it is still
+    // displayed by the browser thanks to the DEV-only fake event trick in ReactErrorUtils.
+    console.error(combinedMessage);
+  }
+}
+
+var invokeGuardedCallback$3 = ReactErrorUtils.invokeGuardedCallback;
+var hasCaughtError$1 = ReactErrorUtils.hasCaughtError;
+var clearCaughtError$1 = ReactErrorUtils.clearCaughtError;
+
+
+var didWarnAboutUndefinedSnapshotBeforeUpdate = null;
+{
+  didWarnAboutUndefinedSnapshotBeforeUpdate = new Set();
+}
+
+function logError(boundary, errorInfo) {
+  var source = errorInfo.source;
+  var stack = errorInfo.stack;
+  if (stack === null) {
+    stack = getStackAddendumByWorkInProgressFiber(source);
+  }
+
+  var capturedError = {
+    componentName: source !== null ? getComponentName(source) : null,
+    componentStack: stack !== null ? stack : '',
+    error: errorInfo.value,
+    errorBoundary: null,
+    errorBoundaryName: null,
+    errorBoundaryFound: false,
+    willRetry: false
+  };
+
+  if (boundary !== null && boundary.tag === ClassComponent) {
+    capturedError.errorBoundary = boundary.stateNode;
+    capturedError.errorBoundaryName = getComponentName(boundary);
+    capturedError.errorBoundaryFound = true;
+    capturedError.willRetry = true;
+  }
+
+  try {
+    logCapturedError(capturedError);
+  } catch (e) {
+    // Prevent cycle if logCapturedError() throws.
+    // A cycle may still occur if logCapturedError renders a component that throws.
+    var suppressLogging = e && e.suppressReactErrorLogging;
+    if (!suppressLogging) {
+      console.error(e);
+    }
+  }
+}
+
+var ReactFiberCommitWork = function (config, captureError, scheduleWork, computeExpirationForFiber, markLegacyErrorBoundaryAsFailed, recalculateCurrentTime) {
+  var getPublicInstance = config.getPublicInstance,
+      mutation = config.mutation,
+      persistence = config.persistence;
+
+
+  var callComponentWillUnmountWithTimer = function (current, instance) {
+    startPhaseTimer(current, 'componentWillUnmount');
+    instance.props = current.memoizedProps;
+    instance.state = current.memoizedState;
+    instance.componentWillUnmount();
+    stopPhaseTimer();
+  };
+
+  // Capture errors so they don't interrupt unmounting.
+  function safelyCallComponentWillUnmount(current, instance) {
+    {
+      invokeGuardedCallback$3(null, callComponentWillUnmountWithTimer, null, current, instance);
+      if (hasCaughtError$1()) {
+        var unmountError = clearCaughtError$1();
+        captureError(current, unmountError);
+      }
+    }
+  }
+
+  function safelyDetachRef(current) {
+    var ref = current.ref;
+    if (ref !== null) {
+      if (typeof ref === 'function') {
+        {
+          invokeGuardedCallback$3(null, ref, null, null);
+          if (hasCaughtError$1()) {
+            var refError = clearCaughtError$1();
+            captureError(current, refError);
+          }
+        }
+      } else {
+        ref.current = null;
+      }
+    }
+  }
+
+  function commitBeforeMutationLifeCycles(current, finishedWork) {
+    switch (finishedWork.tag) {
+      case ClassComponent:
+        {
+          if (finishedWork.effectTag & Snapshot) {
+            if (current !== null) {
+              var prevProps = current.memoizedProps;
+              var prevState = current.memoizedState;
+              startPhaseTimer(finishedWork, 'getSnapshotBeforeUpdate');
+              var _instance = finishedWork.stateNode;
+              _instance.props = finishedWork.memoizedProps;
+              _instance.state = finishedWork.memoizedState;
+              var snapshot = _instance.getSnapshotBeforeUpdate(prevProps, prevState);
+              {
+                var didWarnSet = didWarnAboutUndefinedSnapshotBeforeUpdate;
+                if (snapshot === undefined && !didWarnSet.has(finishedWork.type)) {
+                  didWarnSet.add(finishedWork.type);
+                  warning_1(false, '%s.getSnapshotBeforeUpdate(): A snapshot value (or null) ' + 'must be returned. You have returned undefined.', getComponentName(finishedWork));
+                }
+              }
+              _instance.__reactInternalSnapshotBeforeUpdate = snapshot;
+              stopPhaseTimer();
+            }
+          }
+          return;
+        }
+      case HostRoot:
+      case HostComponent:
+      case HostText:
+      case HostPortal:
+        // Nothing to do for these component types
+        return;
+      default:
+        {
+          invariant_1(false, 'This unit of work tag should not have side-effects. This error is likely caused by a bug in React. Please file an issue.');
+        }
+    }
+  }
+
+  function commitLifeCycles(finishedRoot, current, finishedWork, currentTime, committedExpirationTime) {
+    switch (finishedWork.tag) {
+      case ClassComponent:
+        {
+          var _instance2 = finishedWork.stateNode;
+          if (finishedWork.effectTag & Update) {
+            if (current === null) {
+              startPhaseTimer(finishedWork, 'componentDidMount');
+              _instance2.props = finishedWork.memoizedProps;
+              _instance2.state = finishedWork.memoizedState;
+              _instance2.componentDidMount();
+              stopPhaseTimer();
+            } else {
+              var prevProps = current.memoizedProps;
+              var prevState = current.memoizedState;
+              startPhaseTimer(finishedWork, 'componentDidUpdate');
+              _instance2.props = finishedWork.memoizedProps;
+              _instance2.state = finishedWork.memoizedState;
+              _instance2.componentDidUpdate(prevProps, prevState, _instance2.__reactInternalSnapshotBeforeUpdate);
+              stopPhaseTimer();
+            }
+          }
+          var updateQueue = finishedWork.updateQueue;
+          if (updateQueue !== null) {
+            commitCallbacks(updateQueue, _instance2);
+          }
+          return;
+        }
+      case HostRoot:
+        {
+          var _updateQueue = finishedWork.updateQueue;
+          if (_updateQueue !== null) {
+            var _instance3 = null;
+            if (finishedWork.child !== null) {
+              switch (finishedWork.child.tag) {
+                case HostComponent:
+                  _instance3 = getPublicInstance(finishedWork.child.stateNode);
+                  break;
+                case ClassComponent:
+                  _instance3 = finishedWork.child.stateNode;
+                  break;
+              }
+            }
+            commitCallbacks(_updateQueue, _instance3);
+          }
+          return;
+        }
+      case HostComponent:
+        {
+          var _instance4 = finishedWork.stateNode;
+
+          // Renderers may schedule work to be done after host components are mounted
+          // (eg DOM renderer may schedule auto-focus for inputs and form controls).
+          // These effects should only be committed when components are first mounted,
+          // aka when there is no current/alternate.
+          if (current === null && finishedWork.effectTag & Update) {
+            var type = finishedWork.type;
+            var props = finishedWork.memoizedProps;
+            commitMount(_instance4, type, props, finishedWork);
+          }
+
+          return;
+        }
+      case HostText:
+        {
+          // We have no life-cycles associated with text.
+          return;
+        }
+      case HostPortal:
+        {
+          // We have no life-cycles associated with portals.
+          return;
+        }
+      default:
+        {
+          invariant_1(false, 'This unit of work tag should not have side-effects. This error is likely caused by a bug in React. Please file an issue.');
+        }
+    }
+  }
+
+  function commitErrorLogging(finishedWork, onUncaughtError) {
+    switch (finishedWork.tag) {
+      case ClassComponent:
+        {
+          var ctor = finishedWork.type;
+          var _instance5 = finishedWork.stateNode;
+          var updateQueue = finishedWork.updateQueue;
+          !(updateQueue !== null && updateQueue.capturedValues !== null) ? invariant_1(false, 'An error logging effect should not have been scheduled if no errors were captured. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+          var capturedErrors = updateQueue.capturedValues;
+          updateQueue.capturedValues = null;
+
+          if (typeof ctor.getDerivedStateFromCatch !== 'function') {
+            // To preserve the preexisting retry behavior of error boundaries,
+            // we keep track of which ones already failed during this batch.
+            // This gets reset before we yield back to the browser.
+            // TODO: Warn in strict mode if getDerivedStateFromCatch is
+            // not defined.
+            markLegacyErrorBoundaryAsFailed(_instance5);
+          }
+
+          _instance5.props = finishedWork.memoizedProps;
+          _instance5.state = finishedWork.memoizedState;
+          for (var i = 0; i < capturedErrors.length; i++) {
+            var errorInfo = capturedErrors[i];
+            var _error = errorInfo.value;
+            var stack = errorInfo.stack;
+            logError(finishedWork, errorInfo);
+            _instance5.componentDidCatch(_error, {
+              componentStack: stack !== null ? stack : ''
+            });
+          }
+        }
+        break;
+      case HostRoot:
+        {
+          var _updateQueue2 = finishedWork.updateQueue;
+          !(_updateQueue2 !== null && _updateQueue2.capturedValues !== null) ? invariant_1(false, 'An error logging effect should not have been scheduled if no errors were captured. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+          var _capturedErrors = _updateQueue2.capturedValues;
+          _updateQueue2.capturedValues = null;
+          for (var _i = 0; _i < _capturedErrors.length; _i++) {
+            var _errorInfo = _capturedErrors[_i];
+            logError(finishedWork, _errorInfo);
+            onUncaughtError(_errorInfo.value);
+          }
+          break;
+        }
+      default:
+        invariant_1(false, 'This unit of work tag cannot capture errors.  This error is likely caused by a bug in React. Please file an issue.');
+    }
+  }
+
+  function commitAttachRef(finishedWork) {
+    var ref = finishedWork.ref;
+    if (ref !== null) {
+      var _instance6 = finishedWork.stateNode;
+      var instanceToUse = void 0;
+      switch (finishedWork.tag) {
+        case HostComponent:
+          instanceToUse = getPublicInstance(_instance6);
+          break;
+        default:
+          instanceToUse = _instance6;
+      }
+      if (typeof ref === 'function') {
+        ref(instanceToUse);
+      } else {
+        {
+          if (!ref.hasOwnProperty('current')) {
+            warning_1(false, 'Unexpected ref object provided for %s. ' + 'Use either a ref-setter function or React.createRef().%s', getComponentName(finishedWork), getStackAddendumByWorkInProgressFiber(finishedWork));
+          }
+        }
+
+        ref.current = instanceToUse;
+      }
+    }
+  }
+
+  function commitDetachRef(current) {
+    var currentRef = current.ref;
+    if (currentRef !== null) {
+      if (typeof currentRef === 'function') {
+        currentRef(null);
+      } else {
+        currentRef.current = null;
+      }
+    }
+  }
+
+  // User-originating errors (lifecycles and refs) should not interrupt
+  // deletion, so don't let them throw. Host-originating errors should
+  // interrupt deletion, so it's okay
+  function commitUnmount(current) {
+    if (typeof onCommitUnmount === 'function') {
+      onCommitUnmount(current);
+    }
+
+    switch (current.tag) {
+      case ClassComponent:
+        {
+          safelyDetachRef(current);
+          var _instance7 = current.stateNode;
+          if (typeof _instance7.componentWillUnmount === 'function') {
+            safelyCallComponentWillUnmount(current, _instance7);
+          }
+          return;
+        }
+      case HostComponent:
+        {
+          safelyDetachRef(current);
+          return;
+        }
+      case CallComponent:
+        {
+          commitNestedUnmounts(current.stateNode);
+          return;
+        }
+      case HostPortal:
+        {
+          // TODO: this is recursive.
+          // We are also not using this parent because
+          // the portal will get pushed immediately.
+          if (enableMutatingReconciler && mutation) {
+            unmountHostComponents(current);
+          } else if (enablePersistentReconciler && persistence) {
+            emptyPortalContainer(current);
+          }
+          return;
+        }
+    }
+  }
+
+  function commitNestedUnmounts(root) {
+    // While we're inside a removed host node we don't want to call
+    // removeChild on the inner nodes because they're removed by the top
+    // call anyway. We also want to call componentWillUnmount on all
+    // composites before this host node is removed from the tree. Therefore
+    var node = root;
+    while (true) {
+      commitUnmount(node);
+      // Visit children because they may contain more composite or host nodes.
+      // Skip portals because commitUnmount() currently visits them recursively.
+      if (node.child !== null && (
+      // If we use mutation we drill down into portals using commitUnmount above.
+      // If we don't use mutation we drill down into portals here instead.
+      !mutation || node.tag !== HostPortal)) {
+        node.child['return'] = node;
+        node = node.child;
+        continue;
+      }
+      if (node === root) {
+        return;
+      }
+      while (node.sibling === null) {
+        if (node['return'] === null || node['return'] === root) {
+          return;
+        }
+        node = node['return'];
+      }
+      node.sibling['return'] = node['return'];
+      node = node.sibling;
+    }
+  }
+
+  function detachFiber(current) {
+    // Cut off the return pointers to disconnect it from the tree. Ideally, we
+    // should clear the child pointer of the parent alternate to let this
+    // get GC:ed but we don't know which for sure which parent is the current
+    // one so we'll settle for GC:ing the subtree of this child. This child
+    // itself will be GC:ed when the parent updates the next time.
+    current['return'] = null;
+    current.child = null;
+    if (current.alternate) {
+      current.alternate.child = null;
+      current.alternate['return'] = null;
+    }
+  }
+
+  var emptyPortalContainer = void 0;
+
+  if (!mutation) {
+    var commitContainer = void 0;
+    if (persistence) {
+      var replaceContainerChildren = persistence.replaceContainerChildren,
+          createContainerChildSet = persistence.createContainerChildSet;
+
+      emptyPortalContainer = function (current) {
+        var portal = current.stateNode;
+        var containerInfo = portal.containerInfo;
+
+        var emptyChildSet = createContainerChildSet(containerInfo);
+        replaceContainerChildren(containerInfo, emptyChildSet);
+      };
+      commitContainer = function (finishedWork) {
+        switch (finishedWork.tag) {
+          case ClassComponent:
+            {
+              return;
+            }
+          case HostComponent:
+            {
+              return;
+            }
+          case HostText:
+            {
+              return;
+            }
+          case HostRoot:
+          case HostPortal:
+            {
+              var portalOrRoot = finishedWork.stateNode;
+              var containerInfo = portalOrRoot.containerInfo,
+                  _pendingChildren = portalOrRoot.pendingChildren;
+
+              replaceContainerChildren(containerInfo, _pendingChildren);
+              return;
+            }
+          default:
+            {
+              invariant_1(false, 'This unit of work tag should not have side-effects. This error is likely caused by a bug in React. Please file an issue.');
+            }
+        }
+      };
+    } else {
+      commitContainer = function (finishedWork) {
+        // Noop
+      };
+    }
+    if (enablePersistentReconciler || enableNoopReconciler) {
+      return {
+        commitResetTextContent: function (finishedWork) {},
+        commitPlacement: function (finishedWork) {},
+        commitDeletion: function (current) {
+          // Detach refs and call componentWillUnmount() on the whole subtree.
+          commitNestedUnmounts(current);
+          detachFiber(current);
+        },
+        commitWork: function (current, finishedWork) {
+          commitContainer(finishedWork);
+        },
+
+        commitLifeCycles: commitLifeCycles,
+        commitBeforeMutationLifeCycles: commitBeforeMutationLifeCycles,
+        commitErrorLogging: commitErrorLogging,
+        commitAttachRef: commitAttachRef,
+        commitDetachRef: commitDetachRef
+      };
+    } else if (persistence) {
+      invariant_1(false, 'Persistent reconciler is disabled.');
+    } else {
+      invariant_1(false, 'Noop reconciler is disabled.');
+    }
+  }
+  var commitMount = mutation.commitMount,
+      commitUpdate = mutation.commitUpdate,
+      resetTextContent = mutation.resetTextContent,
+      commitTextUpdate = mutation.commitTextUpdate,
+      appendChild = mutation.appendChild,
+      appendChildToContainer = mutation.appendChildToContainer,
+      insertBefore = mutation.insertBefore,
+      insertInContainerBefore = mutation.insertInContainerBefore,
+      removeChild = mutation.removeChild,
+      removeChildFromContainer = mutation.removeChildFromContainer;
+
+
+  function getHostParentFiber(fiber) {
+    var parent = fiber['return'];
+    while (parent !== null) {
+      if (isHostParent(parent)) {
+        return parent;
+      }
+      parent = parent['return'];
+    }
+    invariant_1(false, 'Expected to find a host parent. This error is likely caused by a bug in React. Please file an issue.');
+  }
+
+  function isHostParent(fiber) {
+    return fiber.tag === HostComponent || fiber.tag === HostRoot || fiber.tag === HostPortal;
+  }
+
+  function getHostSibling(fiber) {
+    // We're going to search forward into the tree until we find a sibling host
+    // node. Unfortunately, if multiple insertions are done in a row we have to
+    // search past them. This leads to exponential search for the next sibling.
+    var node = fiber;
+    siblings: while (true) {
+      // If we didn't find anything, let's try the next sibling.
+      while (node.sibling === null) {
+        if (node['return'] === null || isHostParent(node['return'])) {
+          // If we pop out of the root or hit the parent the fiber we are the
+          // last sibling.
+          return null;
+        }
+        node = node['return'];
+      }
+      node.sibling['return'] = node['return'];
+      node = node.sibling;
+      while (node.tag !== HostComponent && node.tag !== HostText) {
+        // If it is not host node and, we might have a host node inside it.
+        // Try to search down until we find one.
+        if (node.effectTag & Placement) {
+          // If we don't have a child, try the siblings instead.
+          continue siblings;
+        }
+        // If we don't have a child, try the siblings instead.
+        // We also skip portals because they are not part of this host tree.
+        if (node.child === null || node.tag === HostPortal) {
+          continue siblings;
+        } else {
+          node.child['return'] = node;
+          node = node.child;
+        }
+      }
+      // Check if this host node is stable or about to be placed.
+      if (!(node.effectTag & Placement)) {
+        // Found it!
+        return node.stateNode;
+      }
+    }
+  }
+
+  function commitPlacement(finishedWork) {
+    // Recursively insert all host nodes into the parent.
+    var parentFiber = getHostParentFiber(finishedWork);
+    var parent = void 0;
+    var isContainer = void 0;
+    switch (parentFiber.tag) {
+      case HostComponent:
+        parent = parentFiber.stateNode;
+        isContainer = false;
+        break;
+      case HostRoot:
+        parent = parentFiber.stateNode.containerInfo;
+        isContainer = true;
+        break;
+      case HostPortal:
+        parent = parentFiber.stateNode.containerInfo;
+        isContainer = true;
+        break;
+      default:
+        invariant_1(false, 'Invalid host parent fiber. This error is likely caused by a bug in React. Please file an issue.');
+    }
+    if (parentFiber.effectTag & ContentReset) {
+      // Reset the text content of the parent before doing any insertions
+      resetTextContent(parent);
+      // Clear ContentReset from the effect tag
+      parentFiber.effectTag &= ~ContentReset;
+    }
+
+    var before = getHostSibling(finishedWork);
+    // We only have the top Fiber that was inserted but we need recurse down its
+    // children to find all the terminal nodes.
+    var node = finishedWork;
+    while (true) {
+      if (node.tag === HostComponent || node.tag === HostText) {
+        if (before) {
+          if (isContainer) {
+            insertInContainerBefore(parent, node.stateNode, before);
+          } else {
+            insertBefore(parent, node.stateNode, before);
+          }
+        } else {
+          if (isContainer) {
+            appendChildToContainer(parent, node.stateNode);
+          } else {
+            appendChild(parent, node.stateNode);
+          }
+        }
+      } else if (node.tag === HostPortal) {
+        // If the insertion itself is a portal, then we don't want to traverse
+        // down its children. Instead, we'll get insertions from each child in
+        // the portal directly.
+      } else if (node.child !== null) {
+        node.child['return'] = node;
+        node = node.child;
+        continue;
+      }
+      if (node === finishedWork) {
+        return;
+      }
+      while (node.sibling === null) {
+        if (node['return'] === null || node['return'] === finishedWork) {
+          return;
+        }
+        node = node['return'];
+      }
+      node.sibling['return'] = node['return'];
+      node = node.sibling;
+    }
+  }
+
+  function unmountHostComponents(current) {
+    // We only have the top Fiber that was inserted but we need recurse down its
+    var node = current;
+
+    // Each iteration, currentParent is populated with node's host parent if not
+    // currentParentIsValid.
+    var currentParentIsValid = false;
+    var currentParent = void 0;
+    var currentParentIsContainer = void 0;
+
+    while (true) {
+      if (!currentParentIsValid) {
+        var parent = node['return'];
+        findParent: while (true) {
+          !(parent !== null) ? invariant_1(false, 'Expected to find a host parent. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+          switch (parent.tag) {
+            case HostComponent:
+              currentParent = parent.stateNode;
+              currentParentIsContainer = false;
+              break findParent;
+            case HostRoot:
+              currentParent = parent.stateNode.containerInfo;
+              currentParentIsContainer = true;
+              break findParent;
+            case HostPortal:
+              currentParent = parent.stateNode.containerInfo;
+              currentParentIsContainer = true;
+              break findParent;
+          }
+          parent = parent['return'];
+        }
+        currentParentIsValid = true;
+      }
+
+      if (node.tag === HostComponent || node.tag === HostText) {
+        commitNestedUnmounts(node);
+        // After all the children have unmounted, it is now safe to remove the
+        // node from the tree.
+        if (currentParentIsContainer) {
+          removeChildFromContainer(currentParent, node.stateNode);
+        } else {
+          removeChild(currentParent, node.stateNode);
+        }
+        // Don't visit children because we already visited them.
+      } else if (node.tag === HostPortal) {
+        // When we go into a portal, it becomes the parent to remove from.
+        // We will reassign it back when we pop the portal on the way up.
+        currentParent = node.stateNode.containerInfo;
+        // Visit children because portals might contain host components.
+        if (node.child !== null) {
+          node.child['return'] = node;
+          node = node.child;
+          continue;
+        }
+      } else {
+        commitUnmount(node);
+        // Visit children because we may find more host components below.
+        if (node.child !== null) {
+          node.child['return'] = node;
+          node = node.child;
+          continue;
+        }
+      }
+      if (node === current) {
+        return;
+      }
+      while (node.sibling === null) {
+        if (node['return'] === null || node['return'] === current) {
+          return;
+        }
+        node = node['return'];
+        if (node.tag === HostPortal) {
+          // When we go out of the portal, we need to restore the parent.
+          // Since we don't keep a stack of them, we will search for it.
+          currentParentIsValid = false;
+        }
+      }
+      node.sibling['return'] = node['return'];
+      node = node.sibling;
+    }
+  }
+
+  function commitDeletion(current) {
+    // Recursively delete all host nodes from the parent.
+    // Detach refs and call componentWillUnmount() on the whole subtree.
+    unmountHostComponents(current);
+    detachFiber(current);
+  }
+
+  function commitWork(current, finishedWork) {
+    switch (finishedWork.tag) {
+      case ClassComponent:
+        {
+          return;
+        }
+      case HostComponent:
+        {
+          var _instance8 = finishedWork.stateNode;
+          if (_instance8 != null) {
+            // Commit the work prepared earlier.
+            var newProps = finishedWork.memoizedProps;
+            // For hydration we reuse the update path but we treat the oldProps
+            // as the newProps. The updatePayload will contain the real change in
+            // this case.
+            var oldProps = current !== null ? current.memoizedProps : newProps;
+            var type = finishedWork.type;
+            // TODO: Type the updateQueue to be specific to host components.
+            var updatePayload = finishedWork.updateQueue;
+            finishedWork.updateQueue = null;
+            if (updatePayload !== null) {
+              commitUpdate(_instance8, updatePayload, type, oldProps, newProps, finishedWork);
+            }
+          }
+          return;
+        }
+      case HostText:
+        {
+          !(finishedWork.stateNode !== null) ? invariant_1(false, 'This should have a text node initialized. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+          var textInstance = finishedWork.stateNode;
+          var newText = finishedWork.memoizedProps;
+          // For hydration we reuse the update path but we treat the oldProps
+          // as the newProps. The updatePayload will contain the real change in
+          // this case.
+          var oldText = current !== null ? current.memoizedProps : newText;
+          commitTextUpdate(textInstance, oldText, newText);
+          return;
+        }
+      case HostRoot:
+        {
+          return;
+        }
+      default:
+        {
+          invariant_1(false, 'This unit of work tag should not have side-effects. This error is likely caused by a bug in React. Please file an issue.');
+        }
+    }
+  }
+
+  function commitResetTextContent(current) {
+    resetTextContent(current.stateNode);
+  }
+
+  if (enableMutatingReconciler) {
+    return {
+      commitBeforeMutationLifeCycles: commitBeforeMutationLifeCycles,
+      commitResetTextContent: commitResetTextContent,
+      commitPlacement: commitPlacement,
+      commitDeletion: commitDeletion,
+      commitWork: commitWork,
+      commitLifeCycles: commitLifeCycles,
+      commitErrorLogging: commitErrorLogging,
+      commitAttachRef: commitAttachRef,
+      commitDetachRef: commitDetachRef
+    };
+  } else {
+    invariant_1(false, 'Mutating reconciler is disabled.');
+  }
+};
+
+var NO_CONTEXT = {};
+
+var ReactFiberHostContext = function (config, stack) {
+  var getChildHostContext = config.getChildHostContext,
+      getRootHostContext = config.getRootHostContext;
+  var createCursor = stack.createCursor,
+      push = stack.push,
+      pop = stack.pop;
+
+
+  var contextStackCursor = createCursor(NO_CONTEXT);
+  var contextFiberStackCursor = createCursor(NO_CONTEXT);
+  var rootInstanceStackCursor = createCursor(NO_CONTEXT);
+
+  function requiredContext(c) {
+    !(c !== NO_CONTEXT) ? invariant_1(false, 'Expected host context to exist. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+    return c;
+  }
+
+  function getRootHostContainer() {
+    var rootInstance = requiredContext(rootInstanceStackCursor.current);
+    return rootInstance;
+  }
+
+  function pushHostContainer(fiber, nextRootInstance) {
+    // Push current root instance onto the stack;
+    // This allows us to reset root when portals are popped.
+    push(rootInstanceStackCursor, nextRootInstance, fiber);
+
+    var nextRootContext = getRootHostContext(nextRootInstance);
+
+    // Track the context and the Fiber that provided it.
+    // This enables us to pop only Fibers that provide unique contexts.
+    push(contextFiberStackCursor, fiber, fiber);
+    push(contextStackCursor, nextRootContext, fiber);
+  }
+
+  function popHostContainer(fiber) {
+    pop(contextStackCursor, fiber);
+    pop(contextFiberStackCursor, fiber);
+    pop(rootInstanceStackCursor, fiber);
+  }
+
+  function getHostContext() {
+    var context = requiredContext(contextStackCursor.current);
+    return context;
+  }
+
+  function pushHostContext(fiber) {
+    var rootInstance = requiredContext(rootInstanceStackCursor.current);
+    var context = requiredContext(contextStackCursor.current);
+    var nextContext = getChildHostContext(context, fiber.type, rootInstance);
+
+    // Don't push this Fiber's context unless it's unique.
+    if (context === nextContext) {
+      return;
+    }
+
+    // Track the context and the Fiber that provided it.
+    // This enables us to pop only Fibers that provide unique contexts.
+    push(contextFiberStackCursor, fiber, fiber);
+    push(contextStackCursor, nextContext, fiber);
+  }
+
+  function popHostContext(fiber) {
+    // Do not pop unless this Fiber provided the current context.
+    // pushHostContext() only pushes Fibers that provide unique contexts.
+    if (contextFiberStackCursor.current !== fiber) {
+      return;
+    }
+
+    pop(contextStackCursor, fiber);
+    pop(contextFiberStackCursor, fiber);
+  }
+
+  return {
+    getHostContext: getHostContext,
+    getRootHostContainer: getRootHostContainer,
+    popHostContainer: popHostContainer,
+    popHostContext: popHostContext,
+    pushHostContainer: pushHostContainer,
+    pushHostContext: pushHostContext
+  };
+};
+
+var ReactFiberHydrationContext = function (config) {
+  var shouldSetTextContent = config.shouldSetTextContent,
+      hydration = config.hydration;
+
+  // If this doesn't have hydration mode.
+
+  if (!hydration) {
+    return {
+      enterHydrationState: function () {
+        return false;
+      },
+      resetHydrationState: function () {},
+      tryToClaimNextHydratableInstance: function () {},
+      prepareToHydrateHostInstance: function () {
+        invariant_1(false, 'Expected prepareToHydrateHostInstance() to never be called. This error is likely caused by a bug in React. Please file an issue.');
+      },
+      prepareToHydrateHostTextInstance: function () {
+        invariant_1(false, 'Expected prepareToHydrateHostTextInstance() to never be called. This error is likely caused by a bug in React. Please file an issue.');
+      },
+      popHydrationState: function (fiber) {
+        return false;
+      }
+    };
+  }
+
+  var canHydrateInstance = hydration.canHydrateInstance,
+      canHydrateTextInstance = hydration.canHydrateTextInstance,
+      getNextHydratableSibling = hydration.getNextHydratableSibling,
+      getFirstHydratableChild = hydration.getFirstHydratableChild,
+      hydrateInstance = hydration.hydrateInstance,
+      hydrateTextInstance = hydration.hydrateTextInstance,
+      didNotMatchHydratedContainerTextInstance = hydration.didNotMatchHydratedContainerTextInstance,
+      didNotMatchHydratedTextInstance = hydration.didNotMatchHydratedTextInstance,
+      didNotHydrateContainerInstance = hydration.didNotHydrateContainerInstance,
+      didNotHydrateInstance = hydration.didNotHydrateInstance,
+      didNotFindHydratableContainerInstance = hydration.didNotFindHydratableContainerInstance,
+      didNotFindHydratableContainerTextInstance = hydration.didNotFindHydratableContainerTextInstance,
+      didNotFindHydratableInstance = hydration.didNotFindHydratableInstance,
+      didNotFindHydratableTextInstance = hydration.didNotFindHydratableTextInstance;
+
+  // The deepest Fiber on the stack involved in a hydration context.
+  // This may have been an insertion or a hydration.
+
+  var hydrationParentFiber = null;
+  var nextHydratableInstance = null;
+  var isHydrating = false;
+
+  function enterHydrationState(fiber) {
+    var parentInstance = fiber.stateNode.containerInfo;
+    nextHydratableInstance = getFirstHydratableChild(parentInstance);
+    hydrationParentFiber = fiber;
+    isHydrating = true;
+    return true;
+  }
+
+  function deleteHydratableInstance(returnFiber, instance) {
+    {
+      switch (returnFiber.tag) {
+        case HostRoot:
+          didNotHydrateContainerInstance(returnFiber.stateNode.containerInfo, instance);
+          break;
+        case HostComponent:
+          didNotHydrateInstance(returnFiber.type, returnFiber.memoizedProps, returnFiber.stateNode, instance);
+          break;
+      }
+    }
+
+    var childToDelete = createFiberFromHostInstanceForDeletion();
+    childToDelete.stateNode = instance;
+    childToDelete['return'] = returnFiber;
+    childToDelete.effectTag = Deletion;
+
+    // This might seem like it belongs on progressedFirstDeletion. However,
+    // these children are not part of the reconciliation list of children.
+    // Even if we abort and rereconcile the children, that will try to hydrate
+    // again and the nodes are still in the host tree so these will be
+    // recreated.
+    if (returnFiber.lastEffect !== null) {
+      returnFiber.lastEffect.nextEffect = childToDelete;
+      returnFiber.lastEffect = childToDelete;
+    } else {
+      returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;
+    }
+  }
+
+  function insertNonHydratedInstance(returnFiber, fiber) {
+    fiber.effectTag |= Placement;
+    {
+      switch (returnFiber.tag) {
+        case HostRoot:
+          {
+            var parentContainer = returnFiber.stateNode.containerInfo;
+            switch (fiber.tag) {
+              case HostComponent:
+                var type = fiber.type;
+                var props = fiber.pendingProps;
+                didNotFindHydratableContainerInstance(parentContainer, type, props);
+                break;
+              case HostText:
+                var text = fiber.pendingProps;
+                didNotFindHydratableContainerTextInstance(parentContainer, text);
+                break;
+            }
+            break;
+          }
+        case HostComponent:
+          {
+            var parentType = returnFiber.type;
+            var parentProps = returnFiber.memoizedProps;
+            var parentInstance = returnFiber.stateNode;
+            switch (fiber.tag) {
+              case HostComponent:
+                var _type = fiber.type;
+                var _props = fiber.pendingProps;
+                didNotFindHydratableInstance(parentType, parentProps, parentInstance, _type, _props);
+                break;
+              case HostText:
+                var _text = fiber.pendingProps;
+                didNotFindHydratableTextInstance(parentType, parentProps, parentInstance, _text);
+                break;
+            }
+            break;
+          }
+        default:
+          return;
+      }
+    }
+  }
+
+  function tryHydrate(fiber, nextInstance) {
+    switch (fiber.tag) {
+      case HostComponent:
+        {
+          var type = fiber.type;
+          var props = fiber.pendingProps;
+          var instance = canHydrateInstance(nextInstance, type, props);
+          if (instance !== null) {
+            fiber.stateNode = instance;
+            return true;
+          }
+          return false;
+        }
+      case HostText:
+        {
+          var text = fiber.pendingProps;
+          var textInstance = canHydrateTextInstance(nextInstance, text);
+          if (textInstance !== null) {
+            fiber.stateNode = textInstance;
+            return true;
+          }
+          return false;
+        }
+      default:
+        return false;
+    }
+  }
+
+  function tryToClaimNextHydratableInstance(fiber) {
+    if (!isHydrating) {
+      return;
+    }
+    var nextInstance = nextHydratableInstance;
+    if (!nextInstance) {
+      // Nothing to hydrate. Make it an insertion.
+      insertNonHydratedInstance(hydrationParentFiber, fiber);
+      isHydrating = false;
+      hydrationParentFiber = fiber;
+      return;
+    }
+    if (!tryHydrate(fiber, nextInstance)) {
+      // If we can't hydrate this instance let's try the next one.
+      // We use this as a heuristic. It's based on intuition and not data so it
+      // might be flawed or unnecessary.
+      nextInstance = getNextHydratableSibling(nextInstance);
+      if (!nextInstance || !tryHydrate(fiber, nextInstance)) {
+        // Nothing to hydrate. Make it an insertion.
+        insertNonHydratedInstance(hydrationParentFiber, fiber);
+        isHydrating = false;
+        hydrationParentFiber = fiber;
+        return;
+      }
+      // We matched the next one, we'll now assume that the first one was
+      // superfluous and we'll delete it. Since we can't eagerly delete it
+      // we'll have to schedule a deletion. To do that, this node needs a dummy
+      // fiber associated with it.
+      deleteHydratableInstance(hydrationParentFiber, nextHydratableInstance);
+    }
+    hydrationParentFiber = fiber;
+    nextHydratableInstance = getFirstHydratableChild(nextInstance);
+  }
+
+  function prepareToHydrateHostInstance(fiber, rootContainerInstance, hostContext) {
+    var instance = fiber.stateNode;
+    var updatePayload = hydrateInstance(instance, fiber.type, fiber.memoizedProps, rootContainerInstance, hostContext, fiber);
+    // TODO: Type this specific to this type of component.
+    fiber.updateQueue = updatePayload;
+    // If the update payload indicates that there is a change or if there
+    // is a new ref we mark this as an update.
+    if (updatePayload !== null) {
+      return true;
+    }
+    return false;
+  }
+
+  function prepareToHydrateHostTextInstance(fiber) {
+    var textInstance = fiber.stateNode;
+    var textContent = fiber.memoizedProps;
+    var shouldUpdate = hydrateTextInstance(textInstance, textContent, fiber);
+    {
+      if (shouldUpdate) {
+        // We assume that prepareToHydrateHostTextInstance is called in a context where the
+        // hydration parent is the parent host component of this host text.
+        var returnFiber = hydrationParentFiber;
+        if (returnFiber !== null) {
+          switch (returnFiber.tag) {
+            case HostRoot:
+              {
+                var parentContainer = returnFiber.stateNode.containerInfo;
+                didNotMatchHydratedContainerTextInstance(parentContainer, textInstance, textContent);
+                break;
+              }
+            case HostComponent:
+              {
+                var parentType = returnFiber.type;
+                var parentProps = returnFiber.memoizedProps;
+                var parentInstance = returnFiber.stateNode;
+                didNotMatchHydratedTextInstance(parentType, parentProps, parentInstance, textInstance, textContent);
+                break;
+              }
+          }
+        }
+      }
+    }
+    return shouldUpdate;
+  }
+
+  function popToNextHostParent(fiber) {
+    var parent = fiber['return'];
+    while (parent !== null && parent.tag !== HostComponent && parent.tag !== HostRoot) {
+      parent = parent['return'];
+    }
+    hydrationParentFiber = parent;
+  }
+
+  function popHydrationState(fiber) {
+    if (fiber !== hydrationParentFiber) {
+      // We're deeper than the current hydration context, inside an inserted
+      // tree.
+      return false;
+    }
+    if (!isHydrating) {
+      // If we're not currently hydrating but we're in a hydration context, then
+      // we were an insertion and now need to pop up reenter hydration of our
+      // siblings.
+      popToNextHostParent(fiber);
+      isHydrating = true;
+      return false;
+    }
+
+    var type = fiber.type;
+
+    // If we have any remaining hydratable nodes, we need to delete them now.
+    // We only do this deeper than head and body since they tend to have random
+    // other nodes in them. We also ignore components with pure text content in
+    // side of them.
+    // TODO: Better heuristic.
+    if (fiber.tag !== HostComponent || type !== 'head' && type !== 'body' && !shouldSetTextContent(type, fiber.memoizedProps)) {
+      var nextInstance = nextHydratableInstance;
+      while (nextInstance) {
+        deleteHydratableInstance(fiber, nextInstance);
+        nextInstance = getNextHydratableSibling(nextInstance);
+      }
+    }
+
+    popToNextHostParent(fiber);
+    nextHydratableInstance = hydrationParentFiber ? getNextHydratableSibling(fiber.stateNode) : null;
+    return true;
+  }
+
+  function resetHydrationState() {
+    hydrationParentFiber = null;
+    nextHydratableInstance = null;
+    isHydrating = false;
+  }
+
+  return {
+    enterHydrationState: enterHydrationState,
+    resetHydrationState: resetHydrationState,
+    tryToClaimNextHydratableInstance: tryToClaimNextHydratableInstance,
+    prepareToHydrateHostInstance: prepareToHydrateHostInstance,
+    prepareToHydrateHostTextInstance: prepareToHydrateHostTextInstance,
+    popHydrationState: popHydrationState
+  };
+};
+
+// This lets us hook into Fiber to debug what it's doing.
+// See https://github.com/facebook/react/pull/8033.
+// This is not part of the public API, not even for React DevTools.
+// You may only inject a debugTool if you work on React Fiber itself.
+var ReactFiberInstrumentation = {
+  debugTool: null
+};
+
+var ReactFiberInstrumentation_1 = ReactFiberInstrumentation;
+
+var warnedAboutMissingGetChildContext = void 0;
+
+{
+  warnedAboutMissingGetChildContext = {};
+}
+
+var ReactFiberLegacyContext = function (stack) {
+  var createCursor = stack.createCursor,
+      push = stack.push,
+      pop = stack.pop;
+
+  // A cursor to the current merged context object on the stack.
+
+  var contextStackCursor = createCursor(emptyObject_1);
+  // A cursor to a boolean indicating whether the context has changed.
+  var didPerformWorkStackCursor = createCursor(false);
+  // Keep track of the previous context object that was on the stack.
+  // We use this to get access to the parent context after we have already
+  // pushed the next context provider, and now need to merge their contexts.
+  var previousContext = emptyObject_1;
+
+  function getUnmaskedContext(workInProgress) {
+    var hasOwnContext = isContextProvider(workInProgress);
+    if (hasOwnContext) {
+      // If the fiber is a context provider itself, when we read its context
+      // we have already pushed its own child context on the stack. A context
+      // provider should not "see" its own child context. Therefore we read the
+      // previous (parent) context instead for a context provider.
+      return previousContext;
+    }
+    return contextStackCursor.current;
+  }
+
+  function cacheContext(workInProgress, unmaskedContext, maskedContext) {
+    var instance = workInProgress.stateNode;
+    instance.__reactInternalMemoizedUnmaskedChildContext = unmaskedContext;
+    instance.__reactInternalMemoizedMaskedChildContext = maskedContext;
+  }
+
+  function getMaskedContext(workInProgress, unmaskedContext) {
+    var type = workInProgress.type;
+    var contextTypes = type.contextTypes;
+    if (!contextTypes) {
+      return emptyObject_1;
+    }
+
+    // Avoid recreating masked context unless unmasked context has changed.
+    // Failing to do this will result in unnecessary calls to componentWillReceiveProps.
+    // This may trigger infinite loops if componentWillReceiveProps calls setState.
+    var instance = workInProgress.stateNode;
+    if (instance && instance.__reactInternalMemoizedUnmaskedChildContext === unmaskedContext) {
+      return instance.__reactInternalMemoizedMaskedChildContext;
+    }
+
+    var context = {};
+    for (var key in contextTypes) {
+      context[key] = unmaskedContext[key];
+    }
+
+    {
+      var name = getComponentName(workInProgress) || 'Unknown';
+      checkPropTypes_1(contextTypes, context, 'context', name, ReactDebugCurrentFiber.getCurrentFiberStackAddendum);
+    }
+
+    // Cache unmasked context so we can avoid recreating masked context unless necessary.
+    // Context is created before the class component is instantiated so check for instance.
+    if (instance) {
+      cacheContext(workInProgress, unmaskedContext, context);
+    }
+
+    return context;
+  }
+
+  function hasContextChanged() {
+    return didPerformWorkStackCursor.current;
+  }
+
+  function isContextConsumer(fiber) {
+    return fiber.tag === ClassComponent && fiber.type.contextTypes != null;
+  }
+
+  function isContextProvider(fiber) {
+    return fiber.tag === ClassComponent && fiber.type.childContextTypes != null;
+  }
+
+  function popContextProvider(fiber) {
+    if (!isContextProvider(fiber)) {
+      return;
+    }
+
+    pop(didPerformWorkStackCursor, fiber);
+    pop(contextStackCursor, fiber);
+  }
+
+  function popTopLevelContextObject(fiber) {
+    pop(didPerformWorkStackCursor, fiber);
+    pop(contextStackCursor, fiber);
+  }
+
+  function pushTopLevelContextObject(fiber, context, didChange) {
+    !(contextStackCursor.cursor == null) ? invariant_1(false, 'Unexpected context found on stack. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+
+    push(contextStackCursor, context, fiber);
+    push(didPerformWorkStackCursor, didChange, fiber);
+  }
+
+  function processChildContext(fiber, parentContext) {
+    var instance = fiber.stateNode;
+    var childContextTypes = fiber.type.childContextTypes;
+
+    // TODO (bvaughn) Replace this behavior with an invariant() in the future.
+    // It has only been added in Fiber to match the (unintentional) behavior in Stack.
+    if (typeof instance.getChildContext !== 'function') {
+      {
+        var componentName = getComponentName(fiber) || 'Unknown';
+
+        if (!warnedAboutMissingGetChildContext[componentName]) {
+          warnedAboutMissingGetChildContext[componentName] = true;
+          warning_1(false, '%s.childContextTypes is specified but there is no getChildContext() method ' + 'on the instance. You can either define getChildContext() on %s or remove ' + 'childContextTypes from it.', componentName, componentName);
+        }
+      }
+      return parentContext;
+    }
+
+    var childContext = void 0;
+    {
+      ReactDebugCurrentFiber.setCurrentPhase('getChildContext');
+    }
+    startPhaseTimer(fiber, 'getChildContext');
+    childContext = instance.getChildContext();
+    stopPhaseTimer();
+    {
+      ReactDebugCurrentFiber.setCurrentPhase(null);
+    }
+    for (var contextKey in childContext) {
+      !(contextKey in childContextTypes) ? invariant_1(false, '%s.getChildContext(): key "%s" is not defined in childContextTypes.', getComponentName(fiber) || 'Unknown', contextKey) : void 0;
+    }
+    {
+      var name = getComponentName(fiber) || 'Unknown';
+      checkPropTypes_1(childContextTypes, childContext, 'child context', name,
+      // In practice, there is one case in which we won't get a stack. It's when
+      // somebody calls unstable_renderSubtreeIntoContainer() and we process
+      // context from the parent component instance. The stack will be missing
+      // because it's outside of the reconciliation, and so the pointer has not
+      // been set. This is rare and doesn't matter. We'll also remove that API.
+      ReactDebugCurrentFiber.getCurrentFiberStackAddendum);
+    }
+
+    return _assign({}, parentContext, childContext);
+  }
+
+  function pushContextProvider(workInProgress) {
+    if (!isContextProvider(workInProgress)) {
+      return false;
+    }
+
+    var instance = workInProgress.stateNode;
+    // We push the context as early as possible to ensure stack integrity.
+    // If the instance does not exist yet, we will push null at first,
+    // and replace it on the stack later when invalidating the context.
+    var memoizedMergedChildContext = instance && instance.__reactInternalMemoizedMergedChildContext || emptyObject_1;
+
+    // Remember the parent context so we can merge with it later.
+    // Inherit the parent's did-perform-work value to avoid inadvertently blocking updates.
+    previousContext = contextStackCursor.current;
+    push(contextStackCursor, memoizedMergedChildContext, workInProgress);
+    push(didPerformWorkStackCursor, didPerformWorkStackCursor.current, workInProgress);
+
+    return true;
+  }
+
+  function invalidateContextProvider(workInProgress, didChange) {
+    var instance = workInProgress.stateNode;
+    !instance ? invariant_1(false, 'Expected to have an instance by this point. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+
+    if (didChange) {
+      // Merge parent and own context.
+      // Skip this if we're not updating due to sCU.
+      // This avoids unnecessarily recomputing memoized values.
+      var mergedContext = processChildContext(workInProgress, previousContext);
+      instance.__reactInternalMemoizedMergedChildContext = mergedContext;
+
+      // Replace the old (or empty) context with the new one.
+      // It is important to unwind the context in the reverse order.
+      pop(didPerformWorkStackCursor, workInProgress);
+      pop(contextStackCursor, workInProgress);
+      // Now push the new context and mark that it has changed.
+      push(contextStackCursor, mergedContext, workInProgress);
+      push(didPerformWorkStackCursor, didChange, workInProgress);
+    } else {
+      pop(didPerformWorkStackCursor, workInProgress);
+      push(didPerformWorkStackCursor, didChange, workInProgress);
+    }
+  }
+
+  function findCurrentUnmaskedContext(fiber) {
+    // Currently this is only used with renderSubtreeIntoContainer; not sure if it
+    // makes sense elsewhere
+    !(isFiberMounted(fiber) && fiber.tag === ClassComponent) ? invariant_1(false, 'Expected subtree parent to be a mounted class component. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+
+    var node = fiber;
+    while (node.tag !== HostRoot) {
+      if (isContextProvider(node)) {
+        return node.stateNode.__reactInternalMemoizedMergedChildContext;
+      }
+      var parent = node['return'];
+      !parent ? invariant_1(false, 'Found unexpected detached subtree parent. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+      node = parent;
+    }
+    return node.stateNode.context;
+  }
+
+  return {
+    getUnmaskedContext: getUnmaskedContext,
+    cacheContext: cacheContext,
+    getMaskedContext: getMaskedContext,
+    hasContextChanged: hasContextChanged,
+    isContextConsumer: isContextConsumer,
+    isContextProvider: isContextProvider,
+    popContextProvider: popContextProvider,
+    popTopLevelContextObject: popTopLevelContextObject,
+    pushTopLevelContextObject: pushTopLevelContextObject,
+    processChildContext: processChildContext,
+    pushContextProvider: pushContextProvider,
+    invalidateContextProvider: invalidateContextProvider,
+    findCurrentUnmaskedContext: findCurrentUnmaskedContext
+  };
+};
+
+var ReactFiberNewContext = function (stack) {
+  var createCursor = stack.createCursor,
+      push = stack.push,
+      pop = stack.pop;
+
+
+  var providerCursor = createCursor(null);
+  var valueCursor = createCursor(null);
+  var changedBitsCursor = createCursor(0);
+
+  var rendererSigil = void 0;
+  {
+    // Use this to detect multiple renderers using the same context
+    rendererSigil = {};
+  }
+
+  function pushProvider(providerFiber) {
+    var context = providerFiber.type.context;
+
+    push(changedBitsCursor, context._changedBits, providerFiber);
+    push(valueCursor, context._currentValue, providerFiber);
+    push(providerCursor, providerFiber, providerFiber);
+
+    context._currentValue = providerFiber.pendingProps.value;
+    context._changedBits = providerFiber.stateNode;
+
+    {
+      warning_1(context._currentRenderer === null || context._currentRenderer === rendererSigil, 'Detected multiple renderers concurrently rendering the ' + 'same context provider. This is currently unsupported.');
+      context._currentRenderer = rendererSigil;
+    }
+  }
+
+  function popProvider(providerFiber) {
+    var changedBits = changedBitsCursor.current;
+    var currentValue = valueCursor.current;
+
+    pop(providerCursor, providerFiber);
+    pop(valueCursor, providerFiber);
+    pop(changedBitsCursor, providerFiber);
+
+    var context = providerFiber.type.context;
+    context._currentValue = currentValue;
+    context._changedBits = changedBits;
+  }
+
+  return {
+    pushProvider: pushProvider,
+    popProvider: popProvider
+  };
+};
+
+var ReactFiberStack = function () {
+  var valueStack = [];
+
+  var fiberStack = void 0;
+
+  {
+    fiberStack = [];
+  }
+
+  var index = -1;
+
+  function createCursor(defaultValue) {
+    return {
+      current: defaultValue
+    };
+  }
+
+  function isEmpty() {
+    return index === -1;
+  }
+
+  function pop(cursor, fiber) {
+    if (index < 0) {
+      {
+        warning_1(false, 'Unexpected pop.');
+      }
+      return;
+    }
+
+    {
+      if (fiber !== fiberStack[index]) {
+        warning_1(false, 'Unexpected Fiber popped.');
+      }
+    }
+
+    cursor.current = valueStack[index];
+
+    valueStack[index] = null;
+
+    {
+      fiberStack[index] = null;
+    }
+
+    index--;
+  }
+
+  function push(cursor, value, fiber) {
+    index++;
+
+    valueStack[index] = cursor.current;
+
+    {
+      fiberStack[index] = fiber;
+    }
+
+    cursor.current = value;
+  }
+
+  function checkThatStackIsEmpty() {
+    {
+      if (index !== -1) {
+        warning_1(false, 'Expected an empty stack. Something was not reset properly.');
+      }
+    }
+  }
+
+  function resetStackAfterFatalErrorInDev() {
+    {
+      index = -1;
+      valueStack.length = 0;
+      fiberStack.length = 0;
+    }
+  }
+
+  return {
+    createCursor: createCursor,
+    isEmpty: isEmpty,
+    pop: pop,
+    push: push,
+    checkThatStackIsEmpty: checkThatStackIsEmpty,
+    resetStackAfterFatalErrorInDev: resetStackAfterFatalErrorInDev
+  };
+};
+
+var invokeGuardedCallback$2 = ReactErrorUtils.invokeGuardedCallback;
+var hasCaughtError = ReactErrorUtils.hasCaughtError;
+var clearCaughtError = ReactErrorUtils.clearCaughtError;
+
+
+var didWarnAboutStateTransition = void 0;
+var didWarnSetStateChildContext = void 0;
+var warnAboutUpdateOnUnmounted = void 0;
+var warnAboutInvalidUpdates = void 0;
+
+{
+  didWarnAboutStateTransition = false;
+  didWarnSetStateChildContext = false;
+  var didWarnStateUpdateForUnmountedComponent = {};
+
+  warnAboutUpdateOnUnmounted = function (fiber) {
+    // We show the whole stack but dedupe on the top component's name because
+    // the problematic code almost always lies inside that component.
+    var componentName = getComponentName(fiber) || 'ReactClass';
+    if (didWarnStateUpdateForUnmountedComponent[componentName]) {
+      return;
+    }
+    warning_1(false, "Can't call setState (or forceUpdate) on an unmounted component. This " + 'is a no-op, but it indicates a memory leak in your application. To ' + 'fix, cancel all subscriptions and asynchronous tasks in the ' + 'componentWillUnmount method.%s', getStackAddendumByWorkInProgressFiber(fiber));
+    didWarnStateUpdateForUnmountedComponent[componentName] = true;
+  };
+
+  warnAboutInvalidUpdates = function (instance) {
+    switch (ReactDebugCurrentFiber.phase) {
+      case 'getChildContext':
+        if (didWarnSetStateChildContext) {
+          return;
+        }
+        warning_1(false, 'setState(...): Cannot call setState() inside getChildContext()');
+        didWarnSetStateChildContext = true;
+        break;
+      case 'render':
+        if (didWarnAboutStateTransition) {
+          return;
+        }
+        warning_1(false, 'Cannot update during an existing state transition (such as within ' + "`render` or another component's constructor). Render methods should " + 'be a pure function of props and state; constructor side-effects are ' + 'an anti-pattern, but can be moved to `componentWillMount`.');
+        didWarnAboutStateTransition = true;
+        break;
+    }
+  };
+}
+
+var ReactFiberScheduler = function (config) {
+  var stack = ReactFiberStack();
+  var hostContext = ReactFiberHostContext(config, stack);
+  var legacyContext = ReactFiberLegacyContext(stack);
+  var newContext = ReactFiberNewContext(stack);
+  var popHostContext = hostContext.popHostContext,
+      popHostContainer = hostContext.popHostContainer;
+  var popTopLevelLegacyContextObject = legacyContext.popTopLevelContextObject,
+      popLegacyContextProvider = legacyContext.popContextProvider;
+  var popProvider = newContext.popProvider;
+
+  var hydrationContext = ReactFiberHydrationContext(config);
+
+  var _ReactFiberBeginWork = ReactFiberBeginWork(config, hostContext, legacyContext, newContext, hydrationContext, scheduleWork, computeExpirationForFiber),
+      beginWork = _ReactFiberBeginWork.beginWork;
+
+  var _ReactFiberCompleteWo = ReactFiberCompleteWork(config, hostContext, legacyContext, newContext, hydrationContext),
+      completeWork = _ReactFiberCompleteWo.completeWork;
+
+  var _ReactFiberUnwindWork = ReactFiberUnwindWork(hostContext, legacyContext, newContext, scheduleWork, isAlreadyFailedLegacyErrorBoundary),
+      throwException = _ReactFiberUnwindWork.throwException,
+      unwindWork = _ReactFiberUnwindWork.unwindWork,
+      unwindInterruptedWork = _ReactFiberUnwindWork.unwindInterruptedWork;
+
+  var _ReactFiberCommitWork = ReactFiberCommitWork(config, onCommitPhaseError, scheduleWork, computeExpirationForFiber, markLegacyErrorBoundaryAsFailed, recalculateCurrentTime),
+      commitBeforeMutationLifeCycles = _ReactFiberCommitWork.commitBeforeMutationLifeCycles,
+      commitResetTextContent = _ReactFiberCommitWork.commitResetTextContent,
+      commitPlacement = _ReactFiberCommitWork.commitPlacement,
+      commitDeletion = _ReactFiberCommitWork.commitDeletion,
+      commitWork = _ReactFiberCommitWork.commitWork,
+      commitLifeCycles = _ReactFiberCommitWork.commitLifeCycles,
+      commitErrorLogging = _ReactFiberCommitWork.commitErrorLogging,
+      commitAttachRef = _ReactFiberCommitWork.commitAttachRef,
+      commitDetachRef = _ReactFiberCommitWork.commitDetachRef;
+
+  var now = config.now,
+      scheduleDeferredCallback = config.scheduleDeferredCallback,
+      cancelDeferredCallback = config.cancelDeferredCallback,
+      prepareForCommit = config.prepareForCommit,
+      resetAfterCommit = config.resetAfterCommit;
+
+  // Represents the current time in ms.
+
+  var originalStartTimeMs = now();
+  var mostRecentCurrentTime = msToExpirationTime(0);
+  var mostRecentCurrentTimeMs = originalStartTimeMs;
+
+  // Used to ensure computeUniqueAsyncExpiration is monotonically increases.
+  var lastUniqueAsyncExpiration = 0;
+
+  // Represents the expiration time that incoming updates should use. (If this
+  // is NoWork, use the default strategy: async updates in async mode, sync
+  // updates in sync mode.)
+  var expirationContext = NoWork;
+
+  var isWorking = false;
+
+  // The next work in progress fiber that we're currently working on.
+  var nextUnitOfWork = null;
+  var nextRoot = null;
+  // The time at which we're currently rendering work.
+  var nextRenderExpirationTime = NoWork;
+
+  // The next fiber with an effect that we're currently committing.
+  var nextEffect = null;
+
+  var isCommitting = false;
+
+  var isRootReadyForCommit = false;
+
+  var legacyErrorBoundariesThatAlreadyFailed = null;
+
+  // Used for performance tracking.
+  var interruptedBy = null;
+
+  var stashedWorkInProgressProperties = void 0;
+  var replayUnitOfWork = void 0;
+  if (true && replayFailedUnitOfWorkWithInvokeGuardedCallback) {
+    stashedWorkInProgressProperties = null;
+    replayUnitOfWork = function (failedUnitOfWork, isAsync) {
+      // Retore the original state of the work-in-progress
+      _assign(failedUnitOfWork, stashedWorkInProgressProperties);
+      switch (failedUnitOfWork.tag) {
+        case HostRoot:
+          popHostContainer(failedUnitOfWork);
+          popTopLevelLegacyContextObject(failedUnitOfWork);
+          break;
+        case HostComponent:
+          popHostContext(failedUnitOfWork);
+          break;
+        case ClassComponent:
+          popLegacyContextProvider(failedUnitOfWork);
+          break;
+        case HostPortal:
+          popHostContainer(failedUnitOfWork);
+          break;
+        case ContextProvider:
+          popProvider(failedUnitOfWork);
+          break;
+      }
+      // Replay the begin phase.
+      invokeGuardedCallback$2(null, workLoop, null, isAsync);
+      if (hasCaughtError()) {
+        clearCaughtError();
+      } else {
+        // This should be unreachable because the render phase is
+        // idempotent
+      }
+    };
+  }
+
+  function resetStack() {
+    if (nextUnitOfWork !== null) {
+      var interruptedWork = nextUnitOfWork['return'];
+      while (interruptedWork !== null) {
+        unwindInterruptedWork(interruptedWork);
+        interruptedWork = interruptedWork['return'];
+      }
+    }
+
+    {
+      ReactStrictModeWarnings.discardPendingWarnings();
+      stack.checkThatStackIsEmpty();
+    }
+
+    nextRoot = null;
+    nextRenderExpirationTime = NoWork;
+    nextUnitOfWork = null;
+
+    isRootReadyForCommit = false;
+  }
+
+  function commitAllHostEffects() {
+    while (nextEffect !== null) {
+      {
+        ReactDebugCurrentFiber.setCurrentFiber(nextEffect);
+      }
+      recordEffect();
+
+      var effectTag = nextEffect.effectTag;
+
+      if (effectTag & ContentReset) {
+        commitResetTextContent(nextEffect);
+      }
+
+      if (effectTag & Ref) {
+        var current = nextEffect.alternate;
+        if (current !== null) {
+          commitDetachRef(current);
+        }
+      }
+
+      // The following switch statement is only concerned about placement,
+      // updates, and deletions. To avoid needing to add a case for every
+      // possible bitmap value, we remove the secondary effects from the
+      // effect tag and switch on that value.
+      var primaryEffectTag = effectTag & (Placement | Update | Deletion);
+      switch (primaryEffectTag) {
+        case Placement:
+          {
+            commitPlacement(nextEffect);
+            // Clear the "placement" from effect tag so that we know that this is inserted, before
+            // any life-cycles like componentDidMount gets called.
+            // TODO: findDOMNode doesn't rely on this any more but isMounted
+            // does and isMounted is deprecated anyway so we should be able
+            // to kill this.
+            nextEffect.effectTag &= ~Placement;
+            break;
+          }
+        case PlacementAndUpdate:
+          {
+            // Placement
+            commitPlacement(nextEffect);
+            // Clear the "placement" from effect tag so that we know that this is inserted, before
+            // any life-cycles like componentDidMount gets called.
+            nextEffect.effectTag &= ~Placement;
+
+            // Update
+            var _current = nextEffect.alternate;
+            commitWork(_current, nextEffect);
+            break;
+          }
+        case Update:
+          {
+            var _current2 = nextEffect.alternate;
+            commitWork(_current2, nextEffect);
+            break;
+          }
+        case Deletion:
+          {
+            commitDeletion(nextEffect);
+            break;
+          }
+      }
+      nextEffect = nextEffect.nextEffect;
+    }
+
+    {
+      ReactDebugCurrentFiber.resetCurrentFiber();
+    }
+  }
+
+  function commitBeforeMutationLifecycles() {
+    while (nextEffect !== null) {
+      var effectTag = nextEffect.effectTag;
+
+      if (effectTag & Snapshot) {
+        recordEffect();
+        var current = nextEffect.alternate;
+        commitBeforeMutationLifeCycles(current, nextEffect);
+      }
+
+      // Don't cleanup effects yet;
+      // This will be done by commitAllLifeCycles()
+      nextEffect = nextEffect.nextEffect;
+    }
+  }
+
+  function commitAllLifeCycles(finishedRoot, currentTime, committedExpirationTime) {
+    {
+      ReactStrictModeWarnings.flushPendingUnsafeLifecycleWarnings();
+
+      if (warnAboutDeprecatedLifecycles) {
+        ReactStrictModeWarnings.flushPendingDeprecationWarnings();
+      }
+    }
+    while (nextEffect !== null) {
+      var effectTag = nextEffect.effectTag;
+
+      if (effectTag & (Update | Callback)) {
+        recordEffect();
+        var current = nextEffect.alternate;
+        commitLifeCycles(finishedRoot, current, nextEffect, currentTime, committedExpirationTime);
+      }
+
+      if (effectTag & ErrLog) {
+        commitErrorLogging(nextEffect, onUncaughtError);
+      }
+
+      if (effectTag & Ref) {
+        recordEffect();
+        commitAttachRef(nextEffect);
+      }
+
+      var next = nextEffect.nextEffect;
+      // Ensure that we clean these up so that we don't accidentally keep them.
+      // I'm not actually sure this matters because we can't reset firstEffect
+      // and lastEffect since they're on every node, not just the effectful
+      // ones. So we have to clean everything as we reuse nodes anyway.
+      nextEffect.nextEffect = null;
+      // Ensure that we reset the effectTag here so that we can rely on effect
+      // tags to reason about the current life-cycle.
+      nextEffect = next;
+    }
+  }
+
+  function isAlreadyFailedLegacyErrorBoundary(instance) {
+    return legacyErrorBoundariesThatAlreadyFailed !== null && legacyErrorBoundariesThatAlreadyFailed.has(instance);
+  }
+
+  function markLegacyErrorBoundaryAsFailed(instance) {
+    if (legacyErrorBoundariesThatAlreadyFailed === null) {
+      legacyErrorBoundariesThatAlreadyFailed = new Set([instance]);
+    } else {
+      legacyErrorBoundariesThatAlreadyFailed.add(instance);
+    }
+  }
+
+  function commitRoot(finishedWork) {
+    isWorking = true;
+    isCommitting = true;
+    startCommitTimer();
+
+    var root = finishedWork.stateNode;
+    !(root.current !== finishedWork) ? invariant_1(false, 'Cannot commit the same tree as before. This is probably a bug related to the return field. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+    var committedExpirationTime = root.pendingCommitExpirationTime;
+    !(committedExpirationTime !== NoWork) ? invariant_1(false, 'Cannot commit an incomplete root. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+    root.pendingCommitExpirationTime = NoWork;
+
+    var currentTime = recalculateCurrentTime();
+
+    // Reset this to null before calling lifecycles
+    ReactCurrentOwner.current = null;
+
+    var firstEffect = void 0;
+    if (finishedWork.effectTag > PerformedWork) {
+      // A fiber's effect list consists only of its children, not itself. So if
+      // the root has an effect, we need to add it to the end of the list. The
+      // resulting list is the set that would belong to the root's parent, if
+      // it had one; that is, all the effects in the tree including the root.
+      if (finishedWork.lastEffect !== null) {
+        finishedWork.lastEffect.nextEffect = finishedWork;
+        firstEffect = finishedWork.firstEffect;
+      } else {
+        firstEffect = finishedWork;
+      }
+    } else {
+      // There is no effect on the root.
+      firstEffect = finishedWork.firstEffect;
+    }
+
+    prepareForCommit(root.containerInfo);
+
+    // Invoke instances of getSnapshotBeforeUpdate before mutation.
+    nextEffect = firstEffect;
+    startCommitSnapshotEffectsTimer();
+    while (nextEffect !== null) {
+      var didError = false;
+      var error = void 0;
+      {
+        invokeGuardedCallback$2(null, commitBeforeMutationLifecycles, null);
+        if (hasCaughtError()) {
+          didError = true;
+          error = clearCaughtError();
+        }
+      }
+      if (didError) {
+        !(nextEffect !== null) ? invariant_1(false, 'Should have next effect. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+        onCommitPhaseError(nextEffect, error);
+        // Clean-up
+        if (nextEffect !== null) {
+          nextEffect = nextEffect.nextEffect;
+        }
+      }
+    }
+    stopCommitSnapshotEffectsTimer();
+
+    // Commit all the side-effects within a tree. We'll do this in two passes.
+    // The first pass performs all the host insertions, updates, deletions and
+    // ref unmounts.
+    nextEffect = firstEffect;
+    startCommitHostEffectsTimer();
+    while (nextEffect !== null) {
+      var _didError = false;
+      var _error = void 0;
+      {
+        invokeGuardedCallback$2(null, commitAllHostEffects, null);
+        if (hasCaughtError()) {
+          _didError = true;
+          _error = clearCaughtError();
+        }
+      }
+      if (_didError) {
+        !(nextEffect !== null) ? invariant_1(false, 'Should have next effect. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+        onCommitPhaseError(nextEffect, _error);
+        // Clean-up
+        if (nextEffect !== null) {
+          nextEffect = nextEffect.nextEffect;
+        }
+      }
+    }
+    stopCommitHostEffectsTimer();
+
+    resetAfterCommit(root.containerInfo);
+
+    // The work-in-progress tree is now the current tree. This must come after
+    // the first pass of the commit phase, so that the previous tree is still
+    // current during componentWillUnmount, but before the second pass, so that
+    // the finished work is current during componentDidMount/Update.
+    root.current = finishedWork;
+
+    // In the second pass we'll perform all life-cycles and ref callbacks.
+    // Life-cycles happen as a separate pass so that all placements, updates,
+    // and deletions in the entire tree have already been invoked.
+    // This pass also triggers any renderer-specific initial effects.
+    nextEffect = firstEffect;
+    startCommitLifeCyclesTimer();
+    while (nextEffect !== null) {
+      var _didError2 = false;
+      var _error2 = void 0;
+      {
+        invokeGuardedCallback$2(null, commitAllLifeCycles, null, root, currentTime, committedExpirationTime);
+        if (hasCaughtError()) {
+          _didError2 = true;
+          _error2 = clearCaughtError();
+        }
+      }
+      if (_didError2) {
+        !(nextEffect !== null) ? invariant_1(false, 'Should have next effect. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+        onCommitPhaseError(nextEffect, _error2);
+        if (nextEffect !== null) {
+          nextEffect = nextEffect.nextEffect;
+        }
+      }
+    }
+
+    isCommitting = false;
+    isWorking = false;
+    stopCommitLifeCyclesTimer();
+    stopCommitTimer();
+    if (typeof onCommitRoot === 'function') {
+      onCommitRoot(finishedWork.stateNode);
+    }
+    if (true && ReactFiberInstrumentation_1.debugTool) {
+      ReactFiberInstrumentation_1.debugTool.onCommitWork(finishedWork);
+    }
+
+    var remainingTime = root.current.expirationTime;
+    if (remainingTime === NoWork) {
+      // If there's no remaining work, we can clear the set of already failed
+      // error boundaries.
+      legacyErrorBoundariesThatAlreadyFailed = null;
+    }
+    return remainingTime;
+  }
+
+  function resetExpirationTime(workInProgress, renderTime) {
+    if (renderTime !== Never && workInProgress.expirationTime === Never) {
+      // The children of this component are hidden. Don't bubble their
+      // expiration times.
+      return;
+    }
+
+    // Check for pending updates.
+    var newExpirationTime = getUpdateExpirationTime(workInProgress);
+
+    // TODO: Calls need to visit stateNode
+
+    // Bubble up the earliest expiration time.
+    var child = workInProgress.child;
+    while (child !== null) {
+      if (child.expirationTime !== NoWork && (newExpirationTime === NoWork || newExpirationTime > child.expirationTime)) {
+        newExpirationTime = child.expirationTime;
+      }
+      child = child.sibling;
+    }
+    workInProgress.expirationTime = newExpirationTime;
+  }
+
+  function completeUnitOfWork(workInProgress) {
+    // Attempt to complete the current unit of work, then move to the
+    // next sibling. If there are no more siblings, return to the
+    // parent fiber.
+    while (true) {
+      // The current, flushed, state of this fiber is the alternate.
+      // Ideally nothing should rely on this, but relying on it here
+      // means that we don't need an additional field on the work in
+      // progress.
+      var current = workInProgress.alternate;
+      {
+        ReactDebugCurrentFiber.setCurrentFiber(workInProgress);
+      }
+
+      var returnFiber = workInProgress['return'];
+      var siblingFiber = workInProgress.sibling;
+
+      if ((workInProgress.effectTag & Incomplete) === NoEffect) {
+        // This fiber completed.
+        var next = completeWork(current, workInProgress, nextRenderExpirationTime);
+        stopWorkTimer(workInProgress);
+        resetExpirationTime(workInProgress, nextRenderExpirationTime);
+        {
+          ReactDebugCurrentFiber.resetCurrentFiber();
+        }
+
+        if (next !== null) {
+          stopWorkTimer(workInProgress);
+          if (true && ReactFiberInstrumentation_1.debugTool) {
+            ReactFiberInstrumentation_1.debugTool.onCompleteWork(workInProgress);
+          }
+          // If completing this work spawned new work, do that next. We'll come
+          // back here again.
+          return next;
+        }
+
+        if (returnFiber !== null &&
+        // Do not append effects to parents if a sibling failed to complete
+        (returnFiber.effectTag & Incomplete) === NoEffect) {
+          // Append all the effects of the subtree and this fiber onto the effect
+          // list of the parent. The completion order of the children affects the
+          // side-effect order.
+          if (returnFiber.firstEffect === null) {
+            returnFiber.firstEffect = workInProgress.firstEffect;
+          }
+          if (workInProgress.lastEffect !== null) {
+            if (returnFiber.lastEffect !== null) {
+              returnFiber.lastEffect.nextEffect = workInProgress.firstEffect;
+            }
+            returnFiber.lastEffect = workInProgress.lastEffect;
+          }
+
+          // If this fiber had side-effects, we append it AFTER the children's
+          // side-effects. We can perform certain side-effects earlier if
+          // needed, by doing multiple passes over the effect list. We don't want
+          // to schedule our own side-effect on our own list because if end up
+          // reusing children we'll schedule this effect onto itself since we're
+          // at the end.
+          var effectTag = workInProgress.effectTag;
+          // Skip both NoWork and PerformedWork tags when creating the effect list.
+          // PerformedWork effect is read by React DevTools but shouldn't be committed.
+          if (effectTag > PerformedWork) {
+            if (returnFiber.lastEffect !== null) {
+              returnFiber.lastEffect.nextEffect = workInProgress;
+            } else {
+              returnFiber.firstEffect = workInProgress;
+            }
+            returnFiber.lastEffect = workInProgress;
+          }
+        }
+
+        if (true && ReactFiberInstrumentation_1.debugTool) {
+          ReactFiberInstrumentation_1.debugTool.onCompleteWork(workInProgress);
+        }
+
+        if (siblingFiber !== null) {
+          // If there is more work to do in this returnFiber, do that next.
+          return siblingFiber;
+        } else if (returnFiber !== null) {
+          // If there's no more work in this returnFiber. Complete the returnFiber.
+          workInProgress = returnFiber;
+          continue;
+        } else {
+          // We've reached the root.
+          isRootReadyForCommit = true;
+          return null;
+        }
+      } else {
+        // This fiber did not complete because something threw. Pop values off
+        // the stack without entering the complete phase. If this is a boundary,
+        // capture values if possible.
+        var _next = unwindWork(workInProgress);
+        // Because this fiber did not complete, don't reset its expiration time.
+        if (workInProgress.effectTag & DidCapture) {
+          // Restarting an error boundary
+          stopFailedWorkTimer(workInProgress);
+        } else {
+          stopWorkTimer(workInProgress);
+        }
+
+        {
+          ReactDebugCurrentFiber.resetCurrentFiber();
+        }
+
+        if (_next !== null) {
+          stopWorkTimer(workInProgress);
+          if (true && ReactFiberInstrumentation_1.debugTool) {
+            ReactFiberInstrumentation_1.debugTool.onCompleteWork(workInProgress);
+          }
+          // If completing this work spawned new work, do that next. We'll come
+          // back here again.
+          // Since we're restarting, remove anything that is not a host effect
+          // from the effect tag.
+          _next.effectTag &= HostEffectMask;
+          return _next;
+        }
+
+        if (returnFiber !== null) {
+          // Mark the parent fiber as incomplete and clear its effect list.
+          returnFiber.firstEffect = returnFiber.lastEffect = null;
+          returnFiber.effectTag |= Incomplete;
+        }
+
+        if (true && ReactFiberInstrumentation_1.debugTool) {
+          ReactFiberInstrumentation_1.debugTool.onCompleteWork(workInProgress);
+        }
+
+        if (siblingFiber !== null) {
+          // If there is more work to do in this returnFiber, do that next.
+          return siblingFiber;
+        } else if (returnFiber !== null) {
+          // If there's no more work in this returnFiber. Complete the returnFiber.
+          workInProgress = returnFiber;
+          continue;
+        } else {
+          return null;
+        }
+      }
+    }
+
+    // Without this explicit null return Flow complains of invalid return type
+    // TODO Remove the above while(true) loop
+    // eslint-disable-next-line no-unreachable
+    return null;
+  }
+
+  function performUnitOfWork(workInProgress) {
+    // The current, flushed, state of this fiber is the alternate.
+    // Ideally nothing should rely on this, but relying on it here
+    // means that we don't need an additional field on the work in
+    // progress.
+    var current = workInProgress.alternate;
+
+    // See if beginning this work spawns more work.
+    startWorkTimer(workInProgress);
+    {
+      ReactDebugCurrentFiber.setCurrentFiber(workInProgress);
+    }
+
+    if (true && replayFailedUnitOfWorkWithInvokeGuardedCallback) {
+      stashedWorkInProgressProperties = _assign({}, workInProgress);
+    }
+    var next = beginWork(current, workInProgress, nextRenderExpirationTime);
+
+    {
+      ReactDebugCurrentFiber.resetCurrentFiber();
+    }
+    if (true && ReactFiberInstrumentation_1.debugTool) {
+      ReactFiberInstrumentation_1.debugTool.onBeginWork(workInProgress);
+    }
+
+    if (next === null) {
+      // If this doesn't spawn new work, complete the current work.
+      next = completeUnitOfWork(workInProgress);
+    }
+
+    ReactCurrentOwner.current = null;
+
+    return next;
+  }
+
+  function workLoop(isAsync) {
+    if (!isAsync) {
+      // Flush all expired work.
+      while (nextUnitOfWork !== null) {
+        nextUnitOfWork = performUnitOfWork(nextUnitOfWork);
+      }
+    } else {
+      // Flush asynchronous work until the deadline runs out of time.
+      while (nextUnitOfWork !== null && !shouldYield()) {
+        nextUnitOfWork = performUnitOfWork(nextUnitOfWork);
+      }
+    }
+  }
+
+  function renderRoot(root, expirationTime, isAsync) {
+    !!isWorking ? invariant_1(false, 'renderRoot was called recursively. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+    isWorking = true;
+
+    // Check if we're starting from a fresh stack, or if we're resuming from
+    // previously yielded work.
+    if (expirationTime !== nextRenderExpirationTime || root !== nextRoot || nextUnitOfWork === null) {
+      // Reset the stack and start working from the root.
+      resetStack();
+      nextRoot = root;
+      nextRenderExpirationTime = expirationTime;
+      nextUnitOfWork = createWorkInProgress(nextRoot.current, null, nextRenderExpirationTime);
+      root.pendingCommitExpirationTime = NoWork;
+    }
+
+    var didFatal = false;
+
+    startWorkLoopTimer(nextUnitOfWork);
+
+    do {
+      try {
+        workLoop(isAsync);
+      } catch (thrownValue) {
+        if (nextUnitOfWork === null) {
+          // This is a fatal error.
+          didFatal = true;
+          onUncaughtError(thrownValue);
+          break;
+        }
+
+        if (true && replayFailedUnitOfWorkWithInvokeGuardedCallback) {
+          var failedUnitOfWork = nextUnitOfWork;
+          replayUnitOfWork(failedUnitOfWork, isAsync);
+        }
+
+        var sourceFiber = nextUnitOfWork;
+        var returnFiber = sourceFiber['return'];
+        if (returnFiber === null) {
+          // This is the root. The root could capture its own errors. However,
+          // we don't know if it errors before or after we pushed the host
+          // context. This information is needed to avoid a stack mismatch.
+          // Because we're not sure, treat this as a fatal error. We could track
+          // which phase it fails in, but doesn't seem worth it. At least
+          // for now.
+          didFatal = true;
+          onUncaughtError(thrownValue);
+          break;
+        }
+        throwException(returnFiber, sourceFiber, thrownValue);
+        nextUnitOfWork = completeUnitOfWork(sourceFiber);
+      }
+      break;
+    } while (true);
+
+    // We're done performing work. Time to clean up.
+    stopWorkLoopTimer(interruptedBy);
+    interruptedBy = null;
+    isWorking = false;
+
+    // Yield back to main thread.
+    if (didFatal) {
+      // There was a fatal error.
+      {
+        stack.resetStackAfterFatalErrorInDev();
+      }
+      return null;
+    } else if (nextUnitOfWork === null) {
+      // We reached the root.
+      if (isRootReadyForCommit) {
+        // The root successfully completed. It's ready for commit.
+        root.pendingCommitExpirationTime = expirationTime;
+        var finishedWork = root.current.alternate;
+        return finishedWork;
+      } else {
+        // The root did not complete.
+        invariant_1(false, 'Expired work should have completed. This error is likely caused by a bug in React. Please file an issue.');
+      }
+    } else {
+      // There's more work to do, but we ran out of time. Yield back to
+      // the renderer.
+      return null;
+    }
+  }
+
+  function scheduleCapture(sourceFiber, boundaryFiber, value, expirationTime) {
+    // TODO: We only support dispatching errors.
+    var capturedValue = createCapturedValue(value, sourceFiber);
+    var update = {
+      expirationTime: expirationTime,
+      partialState: null,
+      callback: null,
+      isReplace: false,
+      isForced: false,
+      capturedValue: capturedValue,
+      next: null
+    };
+    insertUpdateIntoFiber(boundaryFiber, update);
+    scheduleWork(boundaryFiber, expirationTime);
+  }
+
+  function dispatch(sourceFiber, value, expirationTime) {
+    !(!isWorking || isCommitting) ? invariant_1(false, 'dispatch: Cannot dispatch during the render phase.') : void 0;
+
+    // TODO: Handle arrays
+
+    var fiber = sourceFiber['return'];
+    while (fiber !== null) {
+      switch (fiber.tag) {
+        case ClassComponent:
+          var ctor = fiber.type;
+          var instance = fiber.stateNode;
+          if (typeof ctor.getDerivedStateFromCatch === 'function' || typeof instance.componentDidCatch === 'function' && !isAlreadyFailedLegacyErrorBoundary(instance)) {
+            scheduleCapture(sourceFiber, fiber, value, expirationTime);
+            return;
+          }
+          break;
+        // TODO: Handle async boundaries
+        case HostRoot:
+          scheduleCapture(sourceFiber, fiber, value, expirationTime);
+          return;
+      }
+      fiber = fiber['return'];
+    }
+
+    if (sourceFiber.tag === HostRoot) {
+      // Error was thrown at the root. There is no parent, so the root
+      // itself should capture it.
+      scheduleCapture(sourceFiber, sourceFiber, value, expirationTime);
+    }
+  }
+
+  function onCommitPhaseError(fiber, error) {
+    return dispatch(fiber, error, Sync);
+  }
+
+  function computeAsyncExpiration(currentTime) {
+    // Given the current clock time, returns an expiration time. We use rounding
+    // to batch like updates together.
+    // Should complete within ~1000ms. 1200ms max.
+    var expirationMs = 5000;
+    var bucketSizeMs = 250;
+    return computeExpirationBucket(currentTime, expirationMs, bucketSizeMs);
+  }
+
+  function computeInteractiveExpiration(currentTime) {
+    // Should complete within ~500ms. 600ms max.
+    var expirationMs = 500;
+    var bucketSizeMs = 100;
+    return computeExpirationBucket(currentTime, expirationMs, bucketSizeMs);
+  }
+
+  // Creates a unique async expiration time.
+  function computeUniqueAsyncExpiration() {
+    var currentTime = recalculateCurrentTime();
+    var result = computeAsyncExpiration(currentTime);
+    if (result <= lastUniqueAsyncExpiration) {
+      // Since we assume the current time monotonically increases, we only hit
+      // this branch when computeUniqueAsyncExpiration is fired multiple times
+      // within a 200ms window (or whatever the async bucket size is).
+      result = lastUniqueAsyncExpiration + 1;
+    }
+    lastUniqueAsyncExpiration = result;
+    return lastUniqueAsyncExpiration;
+  }
+
+  function computeExpirationForFiber(fiber) {
+    var expirationTime = void 0;
+    if (expirationContext !== NoWork) {
+      // An explicit expiration context was set;
+      expirationTime = expirationContext;
+    } else if (isWorking) {
+      if (isCommitting) {
+        // Updates that occur during the commit phase should have sync priority
+        // by default.
+        expirationTime = Sync;
+      } else {
+        // Updates during the render phase should expire at the same time as
+        // the work that is being rendered.
+        expirationTime = nextRenderExpirationTime;
+      }
+    } else {
+      // No explicit expiration context was set, and we're not currently
+      // performing work. Calculate a new expiration time.
+      if (fiber.mode & AsyncMode) {
+        if (isBatchingInteractiveUpdates) {
+          // This is an interactive update
+          var currentTime = recalculateCurrentTime();
+          expirationTime = computeInteractiveExpiration(currentTime);
+        } else {
+          // This is an async update
+          var _currentTime = recalculateCurrentTime();
+          expirationTime = computeAsyncExpiration(_currentTime);
+        }
+      } else {
+        // This is a sync update
+        expirationTime = Sync;
+      }
+    }
+    if (isBatchingInteractiveUpdates) {
+      // This is an interactive update. Keep track of the lowest pending
+      // interactive expiration time. This allows us to synchronously flush
+      // all interactive updates when needed.
+      if (lowestPendingInteractiveExpirationTime === NoWork || expirationTime > lowestPendingInteractiveExpirationTime) {
+        lowestPendingInteractiveExpirationTime = expirationTime;
+      }
+    }
+    return expirationTime;
+  }
+
+  function scheduleWork(fiber, expirationTime) {
+    return scheduleWorkImpl(fiber, expirationTime, false);
+  }
+
+  function scheduleWorkImpl(fiber, expirationTime, isErrorRecovery) {
+    recordScheduleUpdate();
+
+    {
+      if (!isErrorRecovery && fiber.tag === ClassComponent) {
+        var instance = fiber.stateNode;
+        warnAboutInvalidUpdates(instance);
+      }
+    }
+
+    var node = fiber;
+    while (node !== null) {
+      // Walk the parent path to the root and update each node's
+      // expiration time.
+      if (node.expirationTime === NoWork || node.expirationTime > expirationTime) {
+        node.expirationTime = expirationTime;
+      }
+      if (node.alternate !== null) {
+        if (node.alternate.expirationTime === NoWork || node.alternate.expirationTime > expirationTime) {
+          node.alternate.expirationTime = expirationTime;
+        }
+      }
+      if (node['return'] === null) {
+        if (node.tag === HostRoot) {
+          var root = node.stateNode;
+          if (!isWorking && nextRenderExpirationTime !== NoWork && expirationTime < nextRenderExpirationTime) {
+            // This is an interruption. (Used for performance tracking.)
+            interruptedBy = fiber;
+            resetStack();
+          }
+          if (
+          // If we're in the render phase, we don't need to schedule this root
+          // for an update, because we'll do it before we exit...
+          !isWorking || isCommitting ||
+          // ...unless this is a different root than the one we're rendering.
+          nextRoot !== root) {
+            // Add this root to the root schedule.
+            requestWork(root, expirationTime);
+          }
+          if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {
+            invariant_1(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');
+          }
+        } else {
+          {
+            if (!isErrorRecovery && fiber.tag === ClassComponent) {
+              warnAboutUpdateOnUnmounted(fiber);
+            }
+          }
+          return;
+        }
+      }
+      node = node['return'];
+    }
+  }
+
+  function recalculateCurrentTime() {
+    // Subtract initial time so it fits inside 32bits
+    mostRecentCurrentTimeMs = now() - originalStartTimeMs;
+    mostRecentCurrentTime = msToExpirationTime(mostRecentCurrentTimeMs);
+    return mostRecentCurrentTime;
+  }
+
+  function deferredUpdates(fn) {
+    var previousExpirationContext = expirationContext;
+    var currentTime = recalculateCurrentTime();
+    expirationContext = computeAsyncExpiration(currentTime);
+    try {
+      return fn();
+    } finally {
+      expirationContext = previousExpirationContext;
+    }
+  }
+  function syncUpdates(fn, a, b, c, d) {
+    var previousExpirationContext = expirationContext;
+    expirationContext = Sync;
+    try {
+      return fn(a, b, c, d);
+    } finally {
+      expirationContext = previousExpirationContext;
+    }
+  }
+
+  // TODO: Everything below this is written as if it has been lifted to the
+  // renderers. I'll do this in a follow-up.
+
+  // Linked-list of roots
+  var firstScheduledRoot = null;
+  var lastScheduledRoot = null;
+
+  var callbackExpirationTime = NoWork;
+  var callbackID = -1;
+  var isRendering = false;
+  var nextFlushedRoot = null;
+  var nextFlushedExpirationTime = NoWork;
+  var lowestPendingInteractiveExpirationTime = NoWork;
+  var deadlineDidExpire = false;
+  var hasUnhandledError = false;
+  var unhandledError = null;
+  var deadline = null;
+
+  var isBatchingUpdates = false;
+  var isUnbatchingUpdates = false;
+  var isBatchingInteractiveUpdates = false;
+
+  var completedBatches = null;
+
+  // Use these to prevent an infinite loop of nested updates
+  var NESTED_UPDATE_LIMIT = 1000;
+  var nestedUpdateCount = 0;
+
+  var timeHeuristicForUnitOfWork = 1;
+
+  function scheduleCallbackWithExpiration(expirationTime) {
+    if (callbackExpirationTime !== NoWork) {
+      // A callback is already scheduled. Check its expiration time (timeout).
+      if (expirationTime > callbackExpirationTime) {
+        // Existing callback has sufficient timeout. Exit.
+        return;
+      } else {
+        // Existing callback has insufficient timeout. Cancel and schedule a
+        // new one.
+        cancelDeferredCallback(callbackID);
+      }
+      // The request callback timer is already running. Don't start a new one.
+    } else {
+      startRequestCallbackTimer();
+    }
+
+    // Compute a timeout for the given expiration time.
+    var currentMs = now() - originalStartTimeMs;
+    var expirationMs = expirationTimeToMs(expirationTime);
+    var timeout = expirationMs - currentMs;
+
+    callbackExpirationTime = expirationTime;
+    callbackID = scheduleDeferredCallback(performAsyncWork, { timeout: timeout });
+  }
+
+  // requestWork is called by the scheduler whenever a root receives an update.
+  // It's up to the renderer to call renderRoot at some point in the future.
+  function requestWork(root, expirationTime) {
+    addRootToSchedule(root, expirationTime);
+
+    if (isRendering) {
+      // Prevent reentrancy. Remaining work will be scheduled at the end of
+      // the currently rendering batch.
+      return;
+    }
+
+    if (isBatchingUpdates) {
+      // Flush work at the end of the batch.
+      if (isUnbatchingUpdates) {
+        // ...unless we're inside unbatchedUpdates, in which case we should
+        // flush it now.
+        nextFlushedRoot = root;
+        nextFlushedExpirationTime = Sync;
+        performWorkOnRoot(root, Sync, false);
+      }
+      return;
+    }
+
+    // TODO: Get rid of Sync and use current time?
+    if (expirationTime === Sync) {
+      performSyncWork();
+    } else {
+      scheduleCallbackWithExpiration(expirationTime);
+    }
+  }
+
+  function addRootToSchedule(root, expirationTime) {
+    // Add the root to the schedule.
+    // Check if this root is already part of the schedule.
+    if (root.nextScheduledRoot === null) {
+      // This root is not already scheduled. Add it.
+      root.remainingExpirationTime = expirationTime;
+      if (lastScheduledRoot === null) {
+        firstScheduledRoot = lastScheduledRoot = root;
+        root.nextScheduledRoot = root;
+      } else {
+        lastScheduledRoot.nextScheduledRoot = root;
+        lastScheduledRoot = root;
+        lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;
+      }
+    } else {
+      // This root is already scheduled, but its priority may have increased.
+      var remainingExpirationTime = root.remainingExpirationTime;
+      if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {
+        // Update the priority.
+        root.remainingExpirationTime = expirationTime;
+      }
+    }
+  }
+
+  function findHighestPriorityRoot() {
+    var highestPriorityWork = NoWork;
+    var highestPriorityRoot = null;
+    if (lastScheduledRoot !== null) {
+      var previousScheduledRoot = lastScheduledRoot;
+      var root = firstScheduledRoot;
+      while (root !== null) {
+        var remainingExpirationTime = root.remainingExpirationTime;
+        if (remainingExpirationTime === NoWork) {
+          // This root no longer has work. Remove it from the scheduler.
+
+          // TODO: This check is redudant, but Flow is confused by the branch
+          // below where we set lastScheduledRoot to null, even though we break
+          // from the loop right after.
+          !(previousScheduledRoot !== null && lastScheduledRoot !== null) ? invariant_1(false, 'Should have a previous and last root. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+          if (root === root.nextScheduledRoot) {
+            // This is the only root in the list.
+            root.nextScheduledRoot = null;
+            firstScheduledRoot = lastScheduledRoot = null;
+            break;
+          } else if (root === firstScheduledRoot) {
+            // This is the first root in the list.
+            var next = root.nextScheduledRoot;
+            firstScheduledRoot = next;
+            lastScheduledRoot.nextScheduledRoot = next;
+            root.nextScheduledRoot = null;
+          } else if (root === lastScheduledRoot) {
+            // This is the last root in the list.
+            lastScheduledRoot = previousScheduledRoot;
+            lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;
+            root.nextScheduledRoot = null;
+            break;
+          } else {
+            previousScheduledRoot.nextScheduledRoot = root.nextScheduledRoot;
+            root.nextScheduledRoot = null;
+          }
+          root = previousScheduledRoot.nextScheduledRoot;
+        } else {
+          if (highestPriorityWork === NoWork || remainingExpirationTime < highestPriorityWork) {
+            // Update the priority, if it's higher
+            highestPriorityWork = remainingExpirationTime;
+            highestPriorityRoot = root;
+          }
+          if (root === lastScheduledRoot) {
+            break;
+          }
+          previousScheduledRoot = root;
+          root = root.nextScheduledRoot;
+        }
+      }
+    }
+
+    // If the next root is the same as the previous root, this is a nested
+    // update. To prevent an infinite loop, increment the nested update count.
+    var previousFlushedRoot = nextFlushedRoot;
+    if (previousFlushedRoot !== null && previousFlushedRoot === highestPriorityRoot && highestPriorityWork === Sync) {
+      nestedUpdateCount++;
+    } else {
+      // Reset whenever we switch roots.
+      nestedUpdateCount = 0;
+    }
+    nextFlushedRoot = highestPriorityRoot;
+    nextFlushedExpirationTime = highestPriorityWork;
+  }
+
+  function performAsyncWork(dl) {
+    performWork(NoWork, true, dl);
+  }
+
+  function performSyncWork() {
+    performWork(Sync, false, null);
+  }
+
+  function performWork(minExpirationTime, isAsync, dl) {
+    deadline = dl;
+
+    // Keep working on roots until there's no more work, or until the we reach
+    // the deadline.
+    findHighestPriorityRoot();
+
+    if (enableUserTimingAPI && deadline !== null) {
+      var didExpire = nextFlushedExpirationTime < recalculateCurrentTime();
+      var timeout = expirationTimeToMs(nextFlushedExpirationTime);
+      stopRequestCallbackTimer(didExpire, timeout);
+    }
+
+    if (isAsync) {
+      while (nextFlushedRoot !== null && nextFlushedExpirationTime !== NoWork && (minExpirationTime === NoWork || minExpirationTime >= nextFlushedExpirationTime) && (!deadlineDidExpire || recalculateCurrentTime() >= nextFlushedExpirationTime)) {
+        performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime, !deadlineDidExpire);
+        findHighestPriorityRoot();
+      }
+    } else {
+      while (nextFlushedRoot !== null && nextFlushedExpirationTime !== NoWork && (minExpirationTime === NoWork || minExpirationTime >= nextFlushedExpirationTime)) {
+        performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime, false);
+        findHighestPriorityRoot();
+      }
+    }
+
+    // We're done flushing work. Either we ran out of time in this callback,
+    // or there's no more work left with sufficient priority.
+
+    // If we're inside a callback, set this to false since we just completed it.
+    if (deadline !== null) {
+      callbackExpirationTime = NoWork;
+      callbackID = -1;
+    }
+    // If there's work left over, schedule a new callback.
+    if (nextFlushedExpirationTime !== NoWork) {
+      scheduleCallbackWithExpiration(nextFlushedExpirationTime);
+    }
+
+    // Clean-up.
+    deadline = null;
+    deadlineDidExpire = false;
+
+    finishRendering();
+  }
+
+  function flushRoot(root, expirationTime) {
+    !!isRendering ? invariant_1(false, 'work.commit(): Cannot commit while already rendering. This likely means you attempted to commit from inside a lifecycle method.') : void 0;
+    // Perform work on root as if the given expiration time is the current time.
+    // This has the effect of synchronously flushing all work up to and
+    // including the given time.
+    nextFlushedRoot = root;
+    nextFlushedExpirationTime = expirationTime;
+    performWorkOnRoot(root, expirationTime, false);
+    // Flush any sync work that was scheduled by lifecycles
+    performSyncWork();
+    finishRendering();
+  }
+
+  function finishRendering() {
+    nestedUpdateCount = 0;
+
+    if (completedBatches !== null) {
+      var batches = completedBatches;
+      completedBatches = null;
+      for (var i = 0; i < batches.length; i++) {
+        var batch = batches[i];
+        try {
+          batch._onComplete();
+        } catch (error) {
+          if (!hasUnhandledError) {
+            hasUnhandledError = true;
+            unhandledError = error;
+          }
+        }
+      }
+    }
+
+    if (hasUnhandledError) {
+      var error = unhandledError;
+      unhandledError = null;
+      hasUnhandledError = false;
+      throw error;
+    }
+  }
+
+  function performWorkOnRoot(root, expirationTime, isAsync) {
+    !!isRendering ? invariant_1(false, 'performWorkOnRoot was called recursively. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+
+    isRendering = true;
+
+    // Check if this is async work or sync/expired work.
+    if (!isAsync) {
+      // Flush sync work.
+      var finishedWork = root.finishedWork;
+      if (finishedWork !== null) {
+        // This root is already complete. We can commit it.
+        completeRoot(root, finishedWork, expirationTime);
+      } else {
+        root.finishedWork = null;
+        finishedWork = renderRoot(root, expirationTime, false);
+        if (finishedWork !== null) {
+          // We've completed the root. Commit it.
+          completeRoot(root, finishedWork, expirationTime);
+        }
+      }
+    } else {
+      // Flush async work.
+      var _finishedWork = root.finishedWork;
+      if (_finishedWork !== null) {
+        // This root is already complete. We can commit it.
+        completeRoot(root, _finishedWork, expirationTime);
+      } else {
+        root.finishedWork = null;
+        _finishedWork = renderRoot(root, expirationTime, true);
+        if (_finishedWork !== null) {
+          // We've completed the root. Check the deadline one more time
+          // before committing.
+          if (!shouldYield()) {
+            // Still time left. Commit the root.
+            completeRoot(root, _finishedWork, expirationTime);
+          } else {
+            // There's no time left. Mark this root as complete. We'll come
+            // back and commit it later.
+            root.finishedWork = _finishedWork;
+          }
+        }
+      }
+    }
+
+    isRendering = false;
+  }
+
+  function completeRoot(root, finishedWork, expirationTime) {
+    // Check if there's a batch that matches this expiration time.
+    var firstBatch = root.firstBatch;
+    if (firstBatch !== null && firstBatch._expirationTime <= expirationTime) {
+      if (completedBatches === null) {
+        completedBatches = [firstBatch];
+      } else {
+        completedBatches.push(firstBatch);
+      }
+      if (firstBatch._defer) {
+        // This root is blocked from committing by a batch. Unschedule it until
+        // we receive another update.
+        root.finishedWork = finishedWork;
+        root.remainingExpirationTime = NoWork;
+        return;
+      }
+    }
+
+    // Commit the root.
+    root.finishedWork = null;
+    root.remainingExpirationTime = commitRoot(finishedWork);
+  }
+
+  // When working on async work, the reconciler asks the renderer if it should
+  // yield execution. For DOM, we implement this with requestIdleCallback.
+  function shouldYield() {
+    if (deadline === null) {
+      return false;
+    }
+    if (deadline.timeRemaining() > timeHeuristicForUnitOfWork) {
+      // Disregard deadline.didTimeout. Only expired work should be flushed
+      // during a timeout. This path is only hit for non-expired work.
+      return false;
+    }
+    deadlineDidExpire = true;
+    return true;
+  }
+
+  function onUncaughtError(error) {
+    !(nextFlushedRoot !== null) ? invariant_1(false, 'Should be working on a root. This error is likely caused by a bug in React. Please file an issue.') : void 0;
+    // Unschedule this root so we don't work on it again until there's
+    // another update.
+    nextFlushedRoot.remainingExpirationTime = NoWork;
+    if (!hasUnhandledError) {
+      hasUnhandledError = true;
+      unhandledError = error;
+    }
+  }
+
+  // TODO: Batching should be implemented at the renderer level, not inside
+  // the reconciler.
+  function batchedUpdates(fn, a) {
+    var previousIsBatchingUpdates = isBatchingUpdates;
+    isBatchingUpdates = true;
+    try {
+      return fn(a);
+    } finally {
+      isBatchingUpdates = previousIsBatchingUpdates;
+      if (!isBatchingUpdates && !isRendering) {
+        performSyncWork();
+      }
+    }
+  }
+
+  // TODO: Batching should be implemented at the renderer level, not inside
+  // the reconciler.
+  function unbatchedUpdates(fn, a) {
+    if (isBatchingUpdates && !isUnbatchingUpdates) {
+      isUnbatchingUpdates = true;
+      try {
+        return fn(a);
+      } finally {
+        isUnbatchingUpdates = false;
+      }
+    }
+    return fn(a);
+  }
+
+  // TODO: Batching should be implemented at the renderer level, not within
+  // the reconciler.
+  function flushSync(fn, a) {
+    !!isRendering ? invariant_1(false, 'flushSync was called from inside a lifecycle method. It cannot be called when React is already rendering.') : void 0;
+    var previousIsBatchingUpdates = isBatchingUpdates;
+    isBatchingUpdates = true;
+    try {
+      return syncUpdates(fn, a);
+    } finally {
+      isBatchingUpdates = previousIsBatchingUpdates;
+      performSyncWork();
+    }
+  }
+
+  function interactiveUpdates(fn, a, b) {
+    if (isBatchingInteractiveUpdates) {
+      return fn(a, b);
+    }
+    // If there are any pending interactive updates, synchronously flush them.
+    // This needs to happen before we read any handlers, because the effect of
+    // the previous event may influence which handlers are called during
+    // this event.
+    if (!isBatchingUpdates && !isRendering && lowestPendingInteractiveExpirationTime !== NoWork) {
+      // Synchronously flush pending interactive updates.
+      performWork(lowestPendingInteractiveExpirationTime, false, null);
+      lowestPendingInteractiveExpirationTime = NoWork;
+    }
+    var previousIsBatchingInteractiveUpdates = isBatchingInteractiveUpdates;
+    var previousIsBatchingUpdates = isBatchingUpdates;
+    isBatchingInteractiveUpdates = true;
+    isBatchingUpdates = true;
+    try {
+      return fn(a, b);
+    } finally {
+      isBatchingInteractiveUpdates = previousIsBatchingInteractiveUpdates;
+      isBatchingUpdates = previousIsBatchingUpdates;
+      if (!isBatchingUpdates && !isRendering) {
+        performSyncWork();
+      }
+    }
+  }
+
+  function flushInteractiveUpdates() {
+    if (!isRendering && lowestPendingInteractiveExpirationTime !== NoWork) {
+      // Synchronously flush pending interactive updates.
+      performWork(lowestPendingInteractiveExpirationTime, false, null);
+      lowestPendingInteractiveExpirationTime = NoWork;
+    }
+  }
+
+  function flushControlled(fn) {
+    var previousIsBatchingUpdates = isBatchingUpdates;
+    isBatchingUpdates = true;
+    try {
+      syncUpdates(fn);
+    } finally {
+      isBatchingUpdates = previousIsBatchingUpdates;
+      if (!isBatchingUpdates && !isRendering) {
+        performWork(Sync, false, null);
+      }
+    }
+  }
+
+  return {
+    recalculateCurrentTime: recalculateCurrentTime,
+    computeExpirationForFiber: computeExpirationForFiber,
+    scheduleWork: scheduleWork,
+    requestWork: requestWork,
+    flushRoot: flushRoot,
+    batchedUpdates: batchedUpdates,
+    unbatchedUpdates: unbatchedUpdates,
+    flushSync: flushSync,
+    flushControlled: flushControlled,
+    deferredUpdates: deferredUpdates,
+    syncUpdates: syncUpdates,
+    interactiveUpdates: interactiveUpdates,
+    flushInteractiveUpdates: flushInteractiveUpdates,
+    computeUniqueAsyncExpiration: computeUniqueAsyncExpiration,
+    legacyContext: legacyContext
+  };
+};
+
+var didWarnAboutNestedUpdates = void 0;
+
+{
+  didWarnAboutNestedUpdates = false;
+}
+
+// 0 is PROD, 1 is DEV.
+// Might add PROFILE later.
+
+
+var ReactFiberReconciler$1 = function (config) {
+  var getPublicInstance = config.getPublicInstance;
+
+  var _ReactFiberScheduler = ReactFiberScheduler(config),
+      computeUniqueAsyncExpiration = _ReactFiberScheduler.computeUniqueAsyncExpiration,
+      recalculateCurrentTime = _ReactFiberScheduler.recalculateCurrentTime,
+      computeExpirationForFiber = _ReactFiberScheduler.computeExpirationForFiber,
+      scheduleWork = _ReactFiberScheduler.scheduleWork,
+      requestWork = _ReactFiberScheduler.requestWork,
+      flushRoot = _ReactFiberScheduler.flushRoot,
+      batchedUpdates = _ReactFiberScheduler.batchedUpdates,
+      unbatchedUpdates = _ReactFiberScheduler.unbatchedUpdates,
+      flushSync = _ReactFiberScheduler.flushSync,
+      flushControlled = _ReactFiberScheduler.flushControlled,
+      deferredUpdates = _ReactFiberScheduler.deferredUpdates,
+      syncUpdates = _ReactFiberScheduler.syncUpdates,
+      interactiveUpdates = _ReactFiberScheduler.interactiveUpdates,
+      flushInteractiveUpdates = _ReactFiberScheduler.flushInteractiveUpdates,
+      legacyContext = _ReactFiberScheduler.legacyContext;
+
+  var findCurrentUnmaskedContext = legacyContext.findCurrentUnmaskedContext,
+      isContextProvider = legacyContext.isContextProvider,
+      processChildContext = legacyContext.processChildContext;
+
+
+  function getContextForSubtree(parentComponent) {
+    if (!parentComponent) {
+      return emptyObject_1;
+    }
+
+    var fiber = get(parentComponent);
+    var parentContext = findCurrentUnmaskedContext(fiber);
+    return isContextProvider(fiber) ? processChildContext(fiber, parentContext) : parentContext;
+  }
+
+  function scheduleRootUpdate(current, element, currentTime, expirationTime, callback) {
+    {
+      if (ReactDebugCurrentFiber.phase === 'render' && ReactDebugCurrentFiber.current !== null && !didWarnAboutNestedUpdates) {
+        didWarnAboutNestedUpdates = true;
+        warning_1(false, 'Render methods should be a pure function of props and state; ' + 'triggering nested component updates from render is not allowed. ' + 'If necessary, trigger nested updates in componentDidUpdate.\n\n' + 'Check the render method of %s.', getComponentName(ReactDebugCurrentFiber.current) || 'Unknown');
+      }
+    }
+
+    callback = callback === undefined ? null : callback;
+    {
+      warning_1(callback === null || typeof callback === 'function', 'render(...): Expected the last optional `callback` argument to be a ' + 'function. Instead received: %s.', callback);
+    }
+
+    var update = {
+      expirationTime: expirationTime,
+      partialState: { element: element },
+      callback: callback,
+      isReplace: false,
+      isForced: false,
+      capturedValue: null,
+      next: null
+    };
+    insertUpdateIntoFiber(current, update);
+    scheduleWork(current, expirationTime);
+
+    return expirationTime;
+  }
+
+  function updateContainerAtExpirationTime(element, container, parentComponent, currentTime, expirationTime, callback) {
+    // TODO: If this is a nested container, this won't be the root.
+    var current = container.current;
+
+    {
+      if (ReactFiberInstrumentation_1.debugTool) {
+        if (current.alternate === null) {
+          ReactFiberInstrumentation_1.debugTool.onMountContainer(container);
+        } else if (element === null) {
+          ReactFiberInstrumentation_1.debugTool.onUnmountContainer(container);
+        } else {
+          ReactFiberInstrumentation_1.debugTool.onUpdateContainer(container);
+        }
+      }
+    }
+
+    var context = getContextForSubtree(parentComponent);
+    if (container.context === null) {
+      container.context = context;
+    } else {
+      container.pendingContext = context;
+    }
+
+    return scheduleRootUpdate(current, element, currentTime, expirationTime, callback);
+  }
+
+  function findHostInstance(fiber) {
+    var hostFiber = findCurrentHostFiber(fiber);
+    if (hostFiber === null) {
+      return null;
+    }
+    return hostFiber.stateNode;
+  }
+
+  return {
+    createContainer: function (containerInfo, isAsync, hydrate) {
+      return createFiberRoot(containerInfo, isAsync, hydrate);
+    },
+    updateContainer: function (element, container, parentComponent, callback) {
+      var current = container.current;
+      var currentTime = recalculateCurrentTime();
+      var expirationTime = computeExpirationForFiber(current);
+      return updateContainerAtExpirationTime(element, container, parentComponent, currentTime, expirationTime, callback);
+    },
+    updateContainerAtExpirationTime: function (element, container, parentComponent, expirationTime, callback) {
+      var currentTime = recalculateCurrentTime();
+      return updateContainerAtExpirationTime(element, container, parentComponent, currentTime, expirationTime, callback);
+    },
+
+
+    flushRoot: flushRoot,
+
+    requestWork: requestWork,
+
+    computeUniqueAsyncExpiration: computeUniqueAsyncExpiration,
+
+    batchedUpdates: batchedUpdates,
+
+    unbatchedUpdates: unbatchedUpdates,
+
+    deferredUpdates: deferredUpdates,
+
+    syncUpdates: syncUpdates,
+
+    interactiveUpdates: interactiveUpdates,
+
+    flushInteractiveUpdates: flushInteractiveUpdates,
+
+    flushControlled: flushControlled,
+
+    flushSync: flushSync,
+
+    getPublicRootInstance: function (container) {
+      var containerFiber = container.current;
+      if (!containerFiber.child) {
+        return null;
+      }
+      switch (containerFiber.child.tag) {
+        case HostComponent:
+          return getPublicInstance(containerFiber.child.stateNode);
+        default:
+          return containerFiber.child.stateNode;
+      }
+    },
+
+
+    findHostInstance: findHostInstance,
+
+    findHostInstanceWithNoPortals: function (fiber) {
+      var hostFiber = findCurrentHostFiberWithNoPortals(fiber);
+      if (hostFiber === null) {
+        return null;
+      }
+      return hostFiber.stateNode;
+    },
+    injectIntoDevTools: function (devToolsConfig) {
+      var findFiberByHostInstance = devToolsConfig.findFiberByHostInstance;
+
+      return injectInternals(_assign({}, devToolsConfig, {
+        findHostInstanceByFiber: function (fiber) {
+          return findHostInstance(fiber);
+        },
+        findFiberByHostInstance: function (instance) {
+          if (!findFiberByHostInstance) {
+            // Might not be implemented by the renderer.
+            return null;
+          }
+          return findFiberByHostInstance(instance);
+        }
+      }));
+    }
+  };
+};
+
+var ReactFiberReconciler$2 = Object.freeze({
+	default: ReactFiberReconciler$1
+});
+
+var ReactFiberReconciler$3 = ( ReactFiberReconciler$2 && ReactFiberReconciler$1 ) || ReactFiberReconciler$2;
+
+// TODO: bundle Flow types with the package.
+
+
+
+// TODO: decide on the top-level export form.
+// This is hacky but makes it work with both Rollup and Jest.
+var reactReconciler = ReactFiberReconciler$3['default'] ? ReactFiberReconciler$3['default'] : ReactFiberReconciler$3;
+
+function createPortal$1(children, containerInfo,
+// TODO: figure out the API for cross-renderer implementation.
+implementation) {
+  var key = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;
+
+  return {
+    // This tag allow us to uniquely identify this as a React Portal
+    $$typeof: REACT_PORTAL_TYPE,
+    key: key == null ? null : '' + key,
+    children: children,
+    containerInfo: containerInfo,
+    implementation: implementation
+  };
+}
+
+// TODO: this is special because it gets imported during build.
+
+var ReactVersion = '16.3.0';
+
+// a requestAnimationFrame, storing the time for the start of the frame, then
+// scheduling a postMessage which gets scheduled after paint. Within the
+// postMessage handler do as much work as possible until time + frame rate.
+// By separating the idle call into a separate event tick we ensure that
+// layout, paint and other browser work is counted against the available time.
+// The frame rate is dynamically adjusted.
+
+{
+  if (ExecutionEnvironment_1.canUseDOM && typeof requestAnimationFrame !== 'function') {
+    warning_1(false, 'React depends on requestAnimationFrame. Make sure that you load a ' + 'polyfill in older browsers. https://fb.me/react-polyfills');
+  }
+}
+
+var hasNativePerformanceNow = typeof performance === 'object' && typeof performance.now === 'function';
+
+var now = void 0;
+if (hasNativePerformanceNow) {
+  now = function () {
+    return performance.now();
+  };
+} else {
+  now = function () {
+    return Date.now();
+  };
+}
+
+// TODO: There's no way to cancel, because Fiber doesn't atm.
+var rIC = void 0;
+var cIC = void 0;
+
+if (!ExecutionEnvironment_1.canUseDOM) {
+  rIC = function (frameCallback) {
+    return setTimeout(function () {
+      frameCallback({
+        timeRemaining: function () {
+          return Infinity;
+        },
+
+        didTimeout: false
+      });
+    });
+  };
+  cIC = function (timeoutID) {
+    clearTimeout(timeoutID);
+  };
+} else if (alwaysUseRequestIdleCallbackPolyfill || typeof requestIdleCallback !== 'function' || typeof cancelIdleCallback !== 'function') {
+  // Polyfill requestIdleCallback and cancelIdleCallback
+
+  var scheduledRICCallback = null;
+  var isIdleScheduled = false;
+  var timeoutTime = -1;
+
+  var isAnimationFrameScheduled = false;
+
+  var frameDeadline = 0;
+  // We start out assuming that we run at 30fps but then the heuristic tracking
+  // will adjust this value to a faster fps if we get more frequent animation
+  // frames.
+  var previousFrameTime = 33;
+  var activeFrameTime = 33;
+
+  var frameDeadlineObject = void 0;
+  if (hasNativePerformanceNow) {
+    frameDeadlineObject = {
+      didTimeout: false,
+      timeRemaining: function () {
+        // We assume that if we have a performance timer that the rAF callback
+        // gets a performance timer value. Not sure if this is always true.
+        var remaining = frameDeadline - performance.now();
+        return remaining > 0 ? remaining : 0;
+      }
+    };
+  } else {
+    frameDeadlineObject = {
+      didTimeout: false,
+      timeRemaining: function () {
+        // Fallback to Date.now()
+        var remaining = frameDeadline - Date.now();
+        return remaining > 0 ? remaining : 0;
+      }
+    };
+  }
+
+  // We use the postMessage trick to defer idle work until after the repaint.
+  var messageKey = '__reactIdleCallback$' + Math.random().toString(36).slice(2);
+  var idleTick = function (event) {
+    if (event.source !== window || event.data !== messageKey) {
+      return;
+    }
+
+    isIdleScheduled = false;
+
+    var currentTime = now();
+    if (frameDeadline - currentTime <= 0) {
+      // There's no time left in this idle period. Check if the callback has
+      // a timeout and whether it's been exceeded.
+      if (timeoutTime !== -1 && timeoutTime <= currentTime) {
+        // Exceeded the timeout. Invoke the callback even though there's no
+        // time left.
+        frameDeadlineObject.didTimeout = true;
+      } else {
+        // No timeout.
+        if (!isAnimationFrameScheduled) {
+          // Schedule another animation callback so we retry later.
+          isAnimationFrameScheduled = true;
+          requestAnimationFrame(animationTick);
+        }
+        // Exit without invoking the callback.
+        return;
+      }
+    } else {
+      // There's still time left in this idle period.
+      frameDeadlineObject.didTimeout = false;
+    }
+
+    timeoutTime = -1;
+    var callback = scheduledRICCallback;
+    scheduledRICCallback = null;
+    if (callback !== null) {
+      callback(frameDeadlineObject);
+    }
+  };
+  // Assumes that we have addEventListener in this environment. Might need
+  // something better for old IE.
+  window.addEventListener('message', idleTick, false);
+
+  var animationTick = function (rafTime) {
+    isAnimationFrameScheduled = false;
+    var nextFrameTime = rafTime - frameDeadline + activeFrameTime;
+    if (nextFrameTime < activeFrameTime && previousFrameTime < activeFrameTime) {
+      if (nextFrameTime < 8) {
+        // Defensive coding. We don't support higher frame rates than 120hz.
+        // If we get lower than that, it is probably a bug.
+        nextFrameTime = 8;
+      }
+      // If one frame goes long, then the next one can be short to catch up.
+      // If two frames are short in a row, then that's an indication that we
+      // actually have a higher frame rate than what we're currently optimizing.
+      // We adjust our heuristic dynamically accordingly. For example, if we're
+      // running on 120hz display or 90hz VR display.
+      // Take the max of the two in case one of them was an anomaly due to
+      // missed frame deadlines.
+      activeFrameTime = nextFrameTime < previousFrameTime ? previousFrameTime : nextFrameTime;
+    } else {
+      previousFrameTime = nextFrameTime;
+    }
+    frameDeadline = rafTime + activeFrameTime;
+    if (!isIdleScheduled) {
+      isIdleScheduled = true;
+      window.postMessage(messageKey, '*');
+    }
+  };
+
+  rIC = function (callback, options) {
+    // This assumes that we only schedule one callback at a time because that's
+    // how Fiber uses it.
+    scheduledRICCallback = callback;
+    if (options != null && typeof options.timeout === 'number') {
+      timeoutTime = now() + options.timeout;
+    }
+    if (!isAnimationFrameScheduled) {
+      // If rAF didn't already schedule one, we need to schedule a frame.
+      // TODO: If this rAF doesn't materialize because the browser throttles, we
+      // might want to still have setTimeout trigger rIC as a backup to ensure
+      // that we keep performing work.
+      isAnimationFrameScheduled = true;
+      requestAnimationFrame(animationTick);
+    }
+    return 0;
+  };
+
+  cIC = function () {
+    scheduledRICCallback = null;
+    isIdleScheduled = false;
+    timeoutTime = -1;
+  };
+} else {
+  rIC = window.requestIdleCallback;
+  cIC = window.cancelIdleCallback;
+}
+
+var didWarnSelectedSetOnOption = false;
+
+function flattenChildren(children) {
+  var content = '';
+
+  // Flatten children and warn if they aren't strings or numbers;
+  // invalid types are ignored.
+  // We can silently skip them because invalid DOM nesting warning
+  // catches these cases in Fiber.
+  React.Children.forEach(children, function (child) {
+    if (child == null) {
+      return;
+    }
+    if (typeof child === 'string' || typeof child === 'number') {
+      content += child;
+    }
+  });
+
+  return content;
+}
+
+/**
+ * Implements an <option> host component that warns when `selected` is set.
+ */
+
+function validateProps(element, props) {
+  // TODO (yungsters): Remove support for `selected` in <option>.
+  {
+    if (props.selected != null && !didWarnSelectedSetOnOption) {
+      warning_1(false, 'Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');
+      didWarnSelectedSetOnOption = true;
+    }
+  }
+}
+
+function postMountWrapper$1(element, props) {
+  // value="" should make a value attribute (#6219)
+  if (props.value != null) {
+    element.setAttribute('value', props.value);
+  }
+}
+
+function getHostProps$1(element, props) {
+  var hostProps = _assign({ children: undefined }, props);
+  var content = flattenChildren(props.children);
+
+  if (content) {
+    hostProps.children = content;
+  }
+
+  return hostProps;
+}
+
+// TODO: direct imports like some-package/src/* are bad. Fix me.
+var getCurrentFiberOwnerName$3 = ReactDebugCurrentFiber.getCurrentFiberOwnerName;
+var getCurrentFiberStackAddendum$4 = ReactDebugCurrentFiber.getCurrentFiberStackAddendum;
+
+
+var didWarnValueDefaultValue$1 = void 0;
+
+{
+  didWarnValueDefaultValue$1 = false;
+}
+
+function getDeclarationErrorAddendum() {
+  var ownerName = getCurrentFiberOwnerName$3();
+  if (ownerName) {
+    return '\n\nCheck the render method of `' + ownerName + '`.';
+  }
+  return '';
+}
+
+var valuePropNames = ['value', 'defaultValue'];
+
+/**
+ * Validation function for `value` and `defaultValue`.
+ */
+function checkSelectPropTypes(props) {
+  ReactControlledValuePropTypes.checkPropTypes('select', props, getCurrentFiberStackAddendum$4);
+
+  for (var i = 0; i < valuePropNames.length; i++) {
+    var propName = valuePropNames[i];
+    if (props[propName] == null) {
+      continue;
+    }
+    var isArray = Array.isArray(props[propName]);
+    if (props.multiple && !isArray) {
+      warning_1(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum());
+    } else if (!props.multiple && isArray) {
+      warning_1(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum());
+    }
+  }
+}
+
+function updateOptions(node, multiple, propValue, setDefaultSelected) {
+  var options = node.options;
+
+  if (multiple) {
+    var selectedValues = propValue;
+    var selectedValue = {};
+    for (var i = 0; i < selectedValues.length; i++) {
+      // Prefix to avoid chaos with special keys.
+      selectedValue['$' + selectedValues[i]] = true;
+    }
+    for (var _i = 0; _i < options.length; _i++) {
+      var selected = selectedValue.hasOwnProperty('$' + options[_i].value);
+      if (options[_i].selected !== selected) {
+        options[_i].selected = selected;
+      }
+      if (selected && setDefaultSelected) {
+        options[_i].defaultSelected = true;
+      }
+    }
+  } else {
+    // Do not set `select.value` as exact behavior isn't consistent across all
+    // browsers for all cases.
+    var _selectedValue = '' + propValue;
+    var defaultSelected = null;
+    for (var _i2 = 0; _i2 < options.length; _i2++) {
+      if (options[_i2].value === _selectedValue) {
+        options[_i2].selected = true;
+        if (setDefaultSelected) {
+          options[_i2].defaultSelected = true;
+        }
+        return;
+      }
+      if (defaultSelected === null && !options[_i2].disabled) {
+        defaultSelected = options[_i2];
+      }
+    }
+    if (defaultSelected !== null) {
+      defaultSelected.selected = true;
+    }
+  }
+}
+
+/**
+ * Implements a <select> host component that allows optionally setting the
+ * props `value` and `defaultValue`. If `multiple` is false, the prop must be a
+ * stringable. If `multiple` is true, the prop must be an array of stringables.
+ *
+ * If `value` is not supplied (or null/undefined), user actions that change the
+ * selected option will trigger updates to the rendered options.
+ *
+ * If it is supplied (and not null/undefined), the rendered options will not
+ * update in response to user actions. Instead, the `value` prop must change in
+ * order for the rendered options to update.
+ *
+ * If `defaultValue` is provided, any options with the supplied values will be
+ * selected.
+ */
+
+function getHostProps$2(element, props) {
+  return _assign({}, props, {
+    value: undefined
+  });
+}
+
+function initWrapperState$1(element, props) {
+  var node = element;
+  {
+    checkSelectPropTypes(props);
+  }
+
+  var value = props.value;
+  node._wrapperState = {
+    initialValue: value != null ? value : props.defaultValue,
+    wasMultiple: !!props.multiple
+  };
+
+  {
+    if (props.value !== undefined && props.defaultValue !== undefined && !didWarnValueDefaultValue$1) {
+      warning_1(false, 'Select elements must be either controlled or uncontrolled ' + '(specify either the value prop, or the defaultValue prop, but not ' + 'both). Decide between using a controlled or uncontrolled select ' + 'element and remove one of these props. More info: ' + 'https://fb.me/react-controlled-components');
+      didWarnValueDefaultValue$1 = true;
+    }
+  }
+}
+
+function postMountWrapper$2(element, props) {
+  var node = element;
+  node.multiple = !!props.multiple;
+  var value = props.value;
+  if (value != null) {
+    updateOptions(node, !!props.multiple, value, false);
+  } else if (props.defaultValue != null) {
+    updateOptions(node, !!props.multiple, props.defaultValue, true);
+  }
+}
+
+function postUpdateWrapper(element, props) {
+  var node = element;
+  // After the initial mount, we control selected-ness manually so don't pass
+  // this value down
+  node._wrapperState.initialValue = undefined;
+
+  var wasMultiple = node._wrapperState.wasMultiple;
+  node._wrapperState.wasMultiple = !!props.multiple;
+
+  var value = props.value;
+  if (value != null) {
+    updateOptions(node, !!props.multiple, value, false);
+  } else if (wasMultiple !== !!props.multiple) {
+    // For simplicity, reapply `defaultValue` if `multiple` is toggled.
+    if (props.defaultValue != null) {
+      updateOptions(node, !!props.multiple, props.defaultValue, true);
+    } else {
+      // Revert the select back to its default unselected state.
+      updateOptions(node, !!props.multiple, props.multiple ? [] : '', false);
+    }
+  }
+}
+
+function restoreControlledState$2(element, props) {
+  var node = element;
+  var value = props.value;
+
+  if (value != null) {
+    updateOptions(node, !!props.multiple, value, false);
+  }
+}
+
+// TODO: direct imports like some-package/src/* are bad. Fix me.
+var getCurrentFiberStackAddendum$5 = ReactDebugCurrentFiber.getCurrentFiberStackAddendum;
+
+var didWarnValDefaultVal = false;
+
+/**
+ * Implements a <textarea> host component that allows setting `value`, and
+ * `defaultValue`. This differs from the traditional DOM API because value is
+ * usually set as PCDATA children.
+ *
+ * If `value` is not supplied (or null/undefined), user actions that affect the
+ * value will trigger updates to the element.
+ *
+ * If `value` is supplied (and not null/undefined), the rendered element will
+ * not trigger updates to the element. Instead, the `value` prop must change in
+ * order for the rendered element to be updated.
+ *
+ * The rendered element will be initialized with an empty value, the prop
+ * `defaultValue` if specified, or the children content (deprecated).
+ */
+
+function getHostProps$3(element, props) {
+  var node = element;
+  !(props.dangerouslySetInnerHTML == null) ? invariant_1(false, '`dangerouslySetInnerHTML` does not make sense on <textarea>.') : void 0;
+
+  // Always set children to the same thing. In IE9, the selection range will
+  // get reset if `textContent` is mutated.  We could add a check in setTextContent
+  // to only set the value if/when the value differs from the node value (which would
+  // completely solve this IE9 bug), but Sebastian+Sophie seemed to like this
+  // solution. The value can be a boolean or object so that's why it's forced
+  // to be a string.
+  var hostProps = _assign({}, props, {
+    value: undefined,
+    defaultValue: undefined,
+    children: '' + node._wrapperState.initialValue
+  });
+
+  return hostProps;
+}
+
+function initWrapperState$2(element, props) {
+  var node = element;
+  {
+    ReactControlledValuePropTypes.checkPropTypes('textarea', props, getCurrentFiberStackAddendum$5);
+    if (props.value !== undefined && props.defaultValue !== undefined && !didWarnValDefaultVal) {
+      warning_1(false, 'Textarea elements must be either controlled or uncontrolled ' + '(specify either the value prop, or the defaultValue prop, but not ' + 'both). Decide between using a controlled or uncontrolled textarea ' + 'and remove one of these props. More info: ' + 'https://fb.me/react-controlled-components');
+      didWarnValDefaultVal = true;
+    }
+  }
+
+  var initialValue = props.value;
+
+  // Only bother fetching default value if we're going to use it
+  if (initialValue == null) {
+    var defaultValue = props.defaultValue;
+    // TODO (yungsters): Remove support for children content in <textarea>.
+    var children = props.children;
+    if (children != null) {
+      {
+        warning_1(false, 'Use the `defaultValue` or `value` props instead of setting ' + 'children on <textarea>.');
+      }
+      !(defaultValue == null) ? invariant_1(false, 'If you supply `defaultValue` on a <textarea>, do not pass children.') : void 0;
+      if (Array.isArray(children)) {
+        !(children.length <= 1) ? invariant_1(false, '<textarea> can only have at most one child.') : void 0;
+        children = children[0];
+      }
+
+      defaultValue = '' + children;
+    }
+    if (defaultValue == null) {
+      defaultValue = '';
+    }
+    initialValue = defaultValue;
+  }
+
+  node._wrapperState = {
+    initialValue: '' + initialValue
+  };
+}
+
+function updateWrapper$1(element, props) {
+  var node = element;
+  var value = props.value;
+  if (value != null) {
+    // Cast `value` to a string to ensure the value is set correctly. While
+    // browsers typically do this as necessary, jsdom doesn't.
+    var newValue = '' + value;
+
+    // To avoid side effects (such as losing text selection), only set value if changed
+    if (newValue !== node.value) {
+      node.value = newValue;
+    }
+    if (props.defaultValue == null) {
+      node.defaultValue = newValue;
+    }
+  }
+  if (props.defaultValue != null) {
+    node.defaultValue = props.defaultValue;
+  }
+}
+
+function postMountWrapper$3(element, props) {
+  var node = element;
+  // This is in postMount because we need access to the DOM node, which is not
+  // available until after the component has mounted.
+  var textContent = node.textContent;
+
+  // Only set node.value if textContent is equal to the expected
+  // initial value. In IE10/IE11 there is a bug where the placeholder attribute
+  // will populate textContent as well.
+  // https://developer.microsoft.com/microsoft-edge/platform/issues/101525/
+  if (textContent === node._wrapperState.initialValue) {
+    node.value = textContent;
+  }
+}
+
+function restoreControlledState$3(element, props) {
+  // DOM component is still mounted; update
+  updateWrapper$1(element, props);
+}
+
+var HTML_NAMESPACE$1 = 'http://www.w3.org/1999/xhtml';
+var MATH_NAMESPACE = 'http://www.w3.org/1998/Math/MathML';
+var SVG_NAMESPACE = 'http://www.w3.org/2000/svg';
+
+var Namespaces = {
+  html: HTML_NAMESPACE$1,
+  mathml: MATH_NAMESPACE,
+  svg: SVG_NAMESPACE
+};
+
+// Assumes there is no parent namespace.
+function getIntrinsicNamespace(type) {
+  switch (type) {
+    case 'svg':
+      return SVG_NAMESPACE;
+    case 'math':
+      return MATH_NAMESPACE;
+    default:
+      return HTML_NAMESPACE$1;
+  }
+}
+
+function getChildNamespace(parentNamespace, type) {
+  if (parentNamespace == null || parentNamespace === HTML_NAMESPACE$1) {
+    // No (or default) parent namespace: potential entry point.
+    return getIntrinsicNamespace(type);
+  }
+  if (parentNamespace === SVG_NAMESPACE && type === 'foreignObject') {
+    // We're leaving SVG.
+    return HTML_NAMESPACE$1;
+  }
+  // By default, pass namespace below.
+  return parentNamespace;
+}
+
+/* globals MSApp */
+
+/**
+ * Create a function which has 'unsafe' privileges (required by windows8 apps)
+ */
+var createMicrosoftUnsafeLocalFunction = function (func) {
+  if (typeof MSApp !== 'undefined' && MSApp.execUnsafeLocalFunction) {
+    return function (arg0, arg1, arg2, arg3) {
+      MSApp.execUnsafeLocalFunction(function () {
+        return func(arg0, arg1, arg2, arg3);
+      });
+    };
+  } else {
+    return func;
+  }
+};
+
+// SVG temp container for IE lacking innerHTML
+var reusableSVGContainer = void 0;
+
+/**
+ * Set the innerHTML property of a node
+ *
+ * @param {DOMElement} node
+ * @param {string} html
+ * @internal
+ */
+var setInnerHTML = createMicrosoftUnsafeLocalFunction(function (node, html) {
+  // IE does not have innerHTML for SVG nodes, so instead we inject the
+  // new markup in a temp node and then move the child nodes across into
+  // the target node
+
+  if (node.namespaceURI === Namespaces.svg && !('innerHTML' in node)) {
+    reusableSVGContainer = reusableSVGContainer || document.createElement('div');
+    reusableSVGContainer.innerHTML = '<svg>' + html + '</svg>';
+    var svgNode = reusableSVGContainer.firstChild;
+    while (node.firstChild) {
+      node.removeChild(node.firstChild);
+    }
+    while (svgNode.firstChild) {
+      node.appendChild(svgNode.firstChild);
+    }
+  } else {
+    node.innerHTML = html;
+  }
+});
+
+/**
+ * Set the textContent property of a node. For text updates, it's faster
+ * to set the `nodeValue` of the Text node directly instead of using
+ * `.textContent` which will remove the existing node and create a new one.
+ *
+ * @param {DOMElement} node
+ * @param {string} text
+ * @internal
+ */
+var setTextContent = function (node, text) {
+  if (text) {
+    var firstChild = node.firstChild;
+
+    if (firstChild && firstChild === node.lastChild && firstChild.nodeType === TEXT_NODE) {
+      firstChild.nodeValue = text;
+      return;
+    }
+  }
+  node.textContent = text;
+};
+
+/**
+ * CSS properties which accept numbers but are not in units of "px".
+ */
+var isUnitlessNumber = {
+  animationIterationCount: true,
+  borderImageOutset: true,
+  borderImageSlice: true,
+  borderImageWidth: true,
+  boxFlex: true,
+  boxFlexGroup: true,
+  boxOrdinalGroup: true,
+  columnCount: true,
+  columns: true,
+  flex: true,
+  flexGrow: true,
+  flexPositive: true,
+  flexShrink: true,
+  flexNegative: true,
+  flexOrder: true,
+  gridRow: true,
+  gridRowEnd: true,
+  gridRowSpan: true,
+  gridRowStart: true,
+  gridColumn: true,
+  gridColumnEnd: true,
+  gridColumnSpan: true,
+  gridColumnStart: true,
+  fontWeight: true,
+  lineClamp: true,
+  lineHeight: true,
+  opacity: true,
+  order: true,
+  orphans: true,
+  tabSize: true,
+  widows: true,
+  zIndex: true,
+  zoom: true,
+
+  // SVG-related properties
+  fillOpacity: true,
+  floodOpacity: true,
+  stopOpacity: true,
+  strokeDasharray: true,
+  strokeDashoffset: true,
+  strokeMiterlimit: true,
+  strokeOpacity: true,
+  strokeWidth: true
+};
+
+/**
+ * @param {string} prefix vendor-specific prefix, eg: Webkit
+ * @param {string} key style name, eg: transitionDuration
+ * @return {string} style name prefixed with `prefix`, properly camelCased, eg:
+ * WebkitTransitionDuration
+ */
+function prefixKey(prefix, key) {
+  return prefix + key.charAt(0).toUpperCase() + key.substring(1);
+}
+
+/**
+ * Support style names that may come passed in prefixed by adding permutations
+ * of vendor prefixes.
+ */
+var prefixes = ['Webkit', 'ms', 'Moz', 'O'];
+
+// Using Object.keys here, or else the vanilla for-in loop makes IE8 go into an
+// infinite loop, because it iterates over the newly added props too.
+Object.keys(isUnitlessNumber).forEach(function (prop) {
+  prefixes.forEach(function (prefix) {
+    isUnitlessNumber[prefixKey(prefix, prop)] = isUnitlessNumber[prop];
+  });
+});
+
+/**
+ * Convert a value into the proper css writable value. The style name `name`
+ * should be logical (no hyphens), as specified
+ * in `CSSProperty.isUnitlessNumber`.
+ *
+ * @param {string} name CSS property name such as `topMargin`.
+ * @param {*} value CSS property value such as `10px`.
+ * @return {string} Normalized style value with dimensions applied.
+ */
+function dangerousStyleValue(name, value, isCustomProperty) {
+  // Note that we've removed escapeTextForBrowser() calls here since the
+  // whole string will be escaped when the attribute is injected into
+  // the markup. If you provide unsafe user data here they can inject
+  // arbitrary CSS which may be problematic (I couldn't repro this):
+  // https://www.owasp.org/index.php/XSS_Filter_Evasion_Cheat_Sheet
+  // http://www.thespanner.co.uk/2007/11/26/ultimate-xss-css-injection/
+  // This is not an XSS hole but instead a potential CSS injection issue
+  // which has lead to a greater discussion about how we're going to
+  // trust URLs moving forward. See #2115901
+
+  var isEmpty = value == null || typeof value === 'boolean' || value === '';
+  if (isEmpty) {
+    return '';
+  }
+
+  if (!isCustomProperty && typeof value === 'number' && value !== 0 && !(isUnitlessNumber.hasOwnProperty(name) && isUnitlessNumber[name])) {
+    return value + 'px'; // Presumes implicit 'px' suffix for unitless numbers
+  }
+
+  return ('' + value).trim();
+}
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ */
+
+var _uppercasePattern = /([A-Z])/g;
+
+/**
+ * Hyphenates a camelcased string, for example:
+ *
+ *   > hyphenate('backgroundColor')
+ *   < "background-color"
+ *
+ * For CSS style names, use `hyphenateStyleName` instead which works properly
+ * with all vendor prefixes, including `ms`.
+ *
+ * @param {string} string
+ * @return {string}
+ */
+function hyphenate(string) {
+  return string.replace(_uppercasePattern, '-$1').toLowerCase();
+}
+
+var hyphenate_1 = hyphenate;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ */
+
+
+
+
+
+var msPattern = /^ms-/;
+
+/**
+ * Hyphenates a camelcased CSS property name, for example:
+ *
+ *   > hyphenateStyleName('backgroundColor')
+ *   < "background-color"
+ *   > hyphenateStyleName('MozTransition')
+ *   < "-moz-transition"
+ *   > hyphenateStyleName('msTransition')
+ *   < "-ms-transition"
+ *
+ * As Modernizr suggests (http://modernizr.com/docs/#prefixed), an `ms` prefix
+ * is converted to `-ms-`.
+ *
+ * @param {string} string
+ * @return {string}
+ */
+function hyphenateStyleName(string) {
+  return hyphenate_1(string).replace(msPattern, '-ms-');
+}
+
+var hyphenateStyleName_1 = hyphenateStyleName;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ */
+
+var _hyphenPattern = /-(.)/g;
+
+/**
+ * Camelcases a hyphenated string, for example:
+ *
+ *   > camelize('background-color')
+ *   < "backgroundColor"
+ *
+ * @param {string} string
+ * @return {string}
+ */
+function camelize(string) {
+  return string.replace(_hyphenPattern, function (_, character) {
+    return character.toUpperCase();
+  });
+}
+
+var camelize_1 = camelize;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @typechecks
+ */
+
+
+
+
+
+var msPattern$1 = /^-ms-/;
+
+/**
+ * Camelcases a hyphenated CSS property name, for example:
+ *
+ *   > camelizeStyleName('background-color')
+ *   < "backgroundColor"
+ *   > camelizeStyleName('-moz-transition')
+ *   < "MozTransition"
+ *   > camelizeStyleName('-ms-transition')
+ *   < "msTransition"
+ *
+ * As Andi Smith suggests
+ * (http://www.andismith.com/blog/2012/02/modernizr-prefixed/), an `-ms` prefix
+ * is converted to lowercase `ms`.
+ *
+ * @param {string} string
+ * @return {string}
+ */
+function camelizeStyleName(string) {
+  return camelize_1(string.replace(msPattern$1, 'ms-'));
+}
+
+var camelizeStyleName_1 = camelizeStyleName;
+
+var warnValidStyle = emptyFunction_1;
+
+{
+  // 'msTransform' is correct, but the other prefixes should be capitalized
+  var badVendoredStyleNamePattern = /^(?:webkit|moz|o)[A-Z]/;
+
+  // style values shouldn't contain a semicolon
+  var badStyleValueWithSemicolonPattern = /;\s*$/;
+
+  var warnedStyleNames = {};
+  var warnedStyleValues = {};
+  var warnedForNaNValue = false;
+  var warnedForInfinityValue = false;
+
+  var warnHyphenatedStyleName = function (name, getStack) {
+    if (warnedStyleNames.hasOwnProperty(name) && warnedStyleNames[name]) {
+      return;
+    }
+
+    warnedStyleNames[name] = true;
+    warning_1(false, 'Unsupported style property %s. Did you mean %s?%s', name, camelizeStyleName_1(name), getStack());
+  };
+
+  var warnBadVendoredStyleName = function (name, getStack) {
+    if (warnedStyleNames.hasOwnProperty(name) && warnedStyleNames[name]) {
+      return;
+    }
+
+    warnedStyleNames[name] = true;
+    warning_1(false, 'Unsupported vendor-prefixed style property %s. Did you mean %s?%s', name, name.charAt(0).toUpperCase() + name.slice(1), getStack());
+  };
+
+  var warnStyleValueWithSemicolon = function (name, value, getStack) {
+    if (warnedStyleValues.hasOwnProperty(value) && warnedStyleValues[value]) {
+      return;
+    }
+
+    warnedStyleValues[value] = true;
+    warning_1(false, "Style property values shouldn't contain a semicolon. " + 'Try "%s: %s" instead.%s', name, value.replace(badStyleValueWithSemicolonPattern, ''), getStack());
+  };
+
+  var warnStyleValueIsNaN = function (name, value, getStack) {
+    if (warnedForNaNValue) {
+      return;
+    }
+
+    warnedForNaNValue = true;
+    warning_1(false, '`NaN` is an invalid value for the `%s` css style property.%s', name, getStack());
+  };
+
+  var warnStyleValueIsInfinity = function (name, value, getStack) {
+    if (warnedForInfinityValue) {
+      return;
+    }
+
+    warnedForInfinityValue = true;
+    warning_1(false, '`Infinity` is an invalid value for the `%s` css style property.%s', name, getStack());
+  };
+
+  warnValidStyle = function (name, value, getStack) {
+    if (name.indexOf('-') > -1) {
+      warnHyphenatedStyleName(name, getStack);
+    } else if (badVendoredStyleNamePattern.test(name)) {
+      warnBadVendoredStyleName(name, getStack);
+    } else if (badStyleValueWithSemicolonPattern.test(value)) {
+      warnStyleValueWithSemicolon(name, value, getStack);
+    }
+
+    if (typeof value === 'number') {
+      if (isNaN(value)) {
+        warnStyleValueIsNaN(name, value, getStack);
+      } else if (!isFinite(value)) {
+        warnStyleValueIsInfinity(name, value, getStack);
+      }
+    }
+  };
+}
+
+var warnValidStyle$1 = warnValidStyle;
+
+/**
+ * Operations for dealing with CSS properties.
+ */
+
+/**
+ * This creates a string that is expected to be equivalent to the style
+ * attribute generated by server-side rendering. It by-passes warnings and
+ * security checks so it's not safe to use this value for anything other than
+ * comparison. It is only used in DEV for SSR validation.
+ */
+function createDangerousStringForStyles(styles) {
+  {
+    var serialized = '';
+    var delimiter = '';
+    for (var styleName in styles) {
+      if (!styles.hasOwnProperty(styleName)) {
+        continue;
+      }
+      var styleValue = styles[styleName];
+      if (styleValue != null) {
+        var isCustomProperty = styleName.indexOf('--') === 0;
+        serialized += delimiter + hyphenateStyleName_1(styleName) + ':';
+        serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);
+
+        delimiter = ';';
+      }
+    }
+    return serialized || null;
+  }
+}
+
+/**
+ * Sets the value for multiple styles on a node.  If a value is specified as
+ * '' (empty string), the corresponding style property will be unset.
+ *
+ * @param {DOMElement} node
+ * @param {object} styles
+ */
+function setValueForStyles(node, styles, getStack) {
+  var style = node.style;
+  for (var styleName in styles) {
+    if (!styles.hasOwnProperty(styleName)) {
+      continue;
+    }
+    var isCustomProperty = styleName.indexOf('--') === 0;
+    {
+      if (!isCustomProperty) {
+        warnValidStyle$1(styleName, styles[styleName], getStack);
+      }
+    }
+    var styleValue = dangerousStyleValue(styleName, styles[styleName], isCustomProperty);
+    if (styleName === 'float') {
+      styleName = 'cssFloat';
+    }
+    if (isCustomProperty) {
+      style.setProperty(styleName, styleValue);
+    } else {
+      style[styleName] = styleValue;
+    }
+  }
+}
+
+// For HTML, certain tags should omit their close tag. We keep a whitelist for
+// those special-case tags.
+
+var omittedCloseTags = {
+  area: true,
+  base: true,
+  br: true,
+  col: true,
+  embed: true,
+  hr: true,
+  img: true,
+  input: true,
+  keygen: true,
+  link: true,
+  meta: true,
+  param: true,
+  source: true,
+  track: true,
+  wbr: true
+};
+
+// For HTML, certain tags cannot have children. This has the same purpose as
+// `omittedCloseTags` except that `menuitem` should still have its closing tag.
+
+var voidElementTags = _assign({
+  menuitem: true
+}, omittedCloseTags);
+
+var HTML$1 = '__html';
+
+function assertValidProps(tag, props, getStack) {
+  if (!props) {
+    return;
+  }
+  // Note the use of `==` which checks for null or undefined.
+  if (voidElementTags[tag]) {
+    !(props.children == null && props.dangerouslySetInnerHTML == null) ? invariant_1(false, '%s is a void element tag and must neither have `children` nor use `dangerouslySetInnerHTML`.%s', tag, getStack()) : void 0;
+  }
+  if (props.dangerouslySetInnerHTML != null) {
+    !(props.children == null) ? invariant_1(false, 'Can only set one of `children` or `props.dangerouslySetInnerHTML`.') : void 0;
+    !(typeof props.dangerouslySetInnerHTML === 'object' && HTML$1 in props.dangerouslySetInnerHTML) ? invariant_1(false, '`props.dangerouslySetInnerHTML` must be in the form `{__html: ...}`. Please visit https://fb.me/react-invariant-dangerously-set-inner-html for more information.') : void 0;
+  }
+  {
+    warning_1(props.suppressContentEditableWarning || !props.contentEditable || props.children == null, 'A component is `contentEditable` and contains `children` managed by ' + 'React. It is now your responsibility to guarantee that none of ' + 'those nodes are unexpectedly modified or duplicated. This is ' + 'probably not intentional.%s', getStack());
+  }
+  !(props.style == null || typeof props.style === 'object') ? invariant_1(false, 'The `style` prop expects a mapping from style properties to values, not a string. For example, style={{marginRight: spacing + \'em\'}} when using JSX.%s', getStack()) : void 0;
+}
+
+function isCustomComponent(tagName, props) {
+  if (tagName.indexOf('-') === -1) {
+    return typeof props.is === 'string';
+  }
+  switch (tagName) {
+    // These are reserved SVG and MathML elements.
+    // We don't mind this whitelist too much because we expect it to never grow.
+    // The alternative is to track the namespace in a few places which is convoluted.
+    // https://w3c.github.io/webcomponents/spec/custom/#custom-elements-core-concepts
+    case 'annotation-xml':
+    case 'color-profile':
+    case 'font-face':
+    case 'font-face-src':
+    case 'font-face-uri':
+    case 'font-face-format':
+    case 'font-face-name':
+    case 'missing-glyph':
+      return false;
+    default:
+      return true;
+  }
+}
+
+// When adding attributes to the HTML or SVG whitelist, be sure to
+// also add them to this module to ensure casing and incorrect name
+// warnings.
+var possibleStandardNames = {
+  // HTML
+  accept: 'accept',
+  acceptcharset: 'acceptCharset',
+  'accept-charset': 'acceptCharset',
+  accesskey: 'accessKey',
+  action: 'action',
+  allowfullscreen: 'allowFullScreen',
+  alt: 'alt',
+  as: 'as',
+  async: 'async',
+  autocapitalize: 'autoCapitalize',
+  autocomplete: 'autoComplete',
+  autocorrect: 'autoCorrect',
+  autofocus: 'autoFocus',
+  autoplay: 'autoPlay',
+  autosave: 'autoSave',
+  capture: 'capture',
+  cellpadding: 'cellPadding',
+  cellspacing: 'cellSpacing',
+  challenge: 'challenge',
+  charset: 'charSet',
+  checked: 'checked',
+  children: 'children',
+  cite: 'cite',
+  'class': 'className',
+  classid: 'classID',
+  classname: 'className',
+  cols: 'cols',
+  colspan: 'colSpan',
+  content: 'content',
+  contenteditable: 'contentEditable',
+  contextmenu: 'contextMenu',
+  controls: 'controls',
+  controlslist: 'controlsList',
+  coords: 'coords',
+  crossorigin: 'crossOrigin',
+  dangerouslysetinnerhtml: 'dangerouslySetInnerHTML',
+  data: 'data',
+  datetime: 'dateTime',
+  'default': 'default',
+  defaultchecked: 'defaultChecked',
+  defaultvalue: 'defaultValue',
+  defer: 'defer',
+  dir: 'dir',
+  disabled: 'disabled',
+  download: 'download',
+  draggable: 'draggable',
+  enctype: 'encType',
+  'for': 'htmlFor',
+  form: 'form',
+  formmethod: 'formMethod',
+  formaction: 'formAction',
+  formenctype: 'formEncType',
+  formnovalidate: 'formNoValidate',
+  formtarget: 'formTarget',
+  frameborder: 'frameBorder',
+  headers: 'headers',
+  height: 'height',
+  hidden: 'hidden',
+  high: 'high',
+  href: 'href',
+  hreflang: 'hrefLang',
+  htmlfor: 'htmlFor',
+  httpequiv: 'httpEquiv',
+  'http-equiv': 'httpEquiv',
+  icon: 'icon',
+  id: 'id',
+  innerhtml: 'innerHTML',
+  inputmode: 'inputMode',
+  integrity: 'integrity',
+  is: 'is',
+  itemid: 'itemID',
+  itemprop: 'itemProp',
+  itemref: 'itemRef',
+  itemscope: 'itemScope',
+  itemtype: 'itemType',
+  keyparams: 'keyParams',
+  keytype: 'keyType',
+  kind: 'kind',
+  label: 'label',
+  lang: 'lang',
+  list: 'list',
+  loop: 'loop',
+  low: 'low',
+  manifest: 'manifest',
+  marginwidth: 'marginWidth',
+  marginheight: 'marginHeight',
+  max: 'max',
+  maxlength: 'maxLength',
+  media: 'media',
+  mediagroup: 'mediaGroup',
+  method: 'method',
+  min: 'min',
+  minlength: 'minLength',
+  multiple: 'multiple',
+  muted: 'muted',
+  name: 'name',
+  nomodule: 'noModule',
+  nonce: 'nonce',
+  novalidate: 'noValidate',
+  open: 'open',
+  optimum: 'optimum',
+  pattern: 'pattern',
+  placeholder: 'placeholder',
+  playsinline: 'playsInline',
+  poster: 'poster',
+  preload: 'preload',
+  profile: 'profile',
+  radiogroup: 'radioGroup',
+  readonly: 'readOnly',
+  referrerpolicy: 'referrerPolicy',
+  rel: 'rel',
+  required: 'required',
+  reversed: 'reversed',
+  role: 'role',
+  rows: 'rows',
+  rowspan: 'rowSpan',
+  sandbox: 'sandbox',
+  scope: 'scope',
+  scoped: 'scoped',
+  scrolling: 'scrolling',
+  seamless: 'seamless',
+  selected: 'selected',
+  shape: 'shape',
+  size: 'size',
+  sizes: 'sizes',
+  span: 'span',
+  spellcheck: 'spellCheck',
+  src: 'src',
+  srcdoc: 'srcDoc',
+  srclang: 'srcLang',
+  srcset: 'srcSet',
+  start: 'start',
+  step: 'step',
+  style: 'style',
+  summary: 'summary',
+  tabindex: 'tabIndex',
+  target: 'target',
+  title: 'title',
+  type: 'type',
+  usemap: 'useMap',
+  value: 'value',
+  width: 'width',
+  wmode: 'wmode',
+  wrap: 'wrap',
+
+  // SVG
+  about: 'about',
+  accentheight: 'accentHeight',
+  'accent-height': 'accentHeight',
+  accumulate: 'accumulate',
+  additive: 'additive',
+  alignmentbaseline: 'alignmentBaseline',
+  'alignment-baseline': 'alignmentBaseline',
+  allowreorder: 'allowReorder',
+  alphabetic: 'alphabetic',
+  amplitude: 'amplitude',
+  arabicform: 'arabicForm',
+  'arabic-form': 'arabicForm',
+  ascent: 'ascent',
+  attributename: 'attributeName',
+  attributetype: 'attributeType',
+  autoreverse: 'autoReverse',
+  azimuth: 'azimuth',
+  basefrequency: 'baseFrequency',
+  baselineshift: 'baselineShift',
+  'baseline-shift': 'baselineShift',
+  baseprofile: 'baseProfile',
+  bbox: 'bbox',
+  begin: 'begin',
+  bias: 'bias',
+  by: 'by',
+  calcmode: 'calcMode',
+  capheight: 'capHeight',
+  'cap-height': 'capHeight',
+  clip: 'clip',
+  clippath: 'clipPath',
+  'clip-path': 'clipPath',
+  clippathunits: 'clipPathUnits',
+  cliprule: 'clipRule',
+  'clip-rule': 'clipRule',
+  color: 'color',
+  colorinterpolation: 'colorInterpolation',
+  'color-interpolation': 'colorInterpolation',
+  colorinterpolationfilters: 'colorInterpolationFilters',
+  'color-interpolation-filters': 'colorInterpolationFilters',
+  colorprofile: 'colorProfile',
+  'color-profile': 'colorProfile',
+  colorrendering: 'colorRendering',
+  'color-rendering': 'colorRendering',
+  contentscripttype: 'contentScriptType',
+  contentstyletype: 'contentStyleType',
+  cursor: 'cursor',
+  cx: 'cx',
+  cy: 'cy',
+  d: 'd',
+  datatype: 'datatype',
+  decelerate: 'decelerate',
+  descent: 'descent',
+  diffuseconstant: 'diffuseConstant',
+  direction: 'direction',
+  display: 'display',
+  divisor: 'divisor',
+  dominantbaseline: 'dominantBaseline',
+  'dominant-baseline': 'dominantBaseline',
+  dur: 'dur',
+  dx: 'dx',
+  dy: 'dy',
+  edgemode: 'edgeMode',
+  elevation: 'elevation',
+  enablebackground: 'enableBackground',
+  'enable-background': 'enableBackground',
+  end: 'end',
+  exponent: 'exponent',
+  externalresourcesrequired: 'externalResourcesRequired',
+  fill: 'fill',
+  fillopacity: 'fillOpacity',
+  'fill-opacity': 'fillOpacity',
+  fillrule: 'fillRule',
+  'fill-rule': 'fillRule',
+  filter: 'filter',
+  filterres: 'filterRes',
+  filterunits: 'filterUnits',
+  floodopacity: 'floodOpacity',
+  'flood-opacity': 'floodOpacity',
+  floodcolor: 'floodColor',
+  'flood-color': 'floodColor',
+  focusable: 'focusable',
+  fontfamily: 'fontFamily',
+  'font-family': 'fontFamily',
+  fontsize: 'fontSize',
+  'font-size': 'fontSize',
+  fontsizeadjust: 'fontSizeAdjust',
+  'font-size-adjust': 'fontSizeAdjust',
+  fontstretch: 'fontStretch',
+  'font-stretch': 'fontStretch',
+  fontstyle: 'fontStyle',
+  'font-style': 'fontStyle',
+  fontvariant: 'fontVariant',
+  'font-variant': 'fontVariant',
+  fontweight: 'fontWeight',
+  'font-weight': 'fontWeight',
+  format: 'format',
+  from: 'from',
+  fx: 'fx',
+  fy: 'fy',
+  g1: 'g1',
+  g2: 'g2',
+  glyphname: 'glyphName',
+  'glyph-name': 'glyphName',
+  glyphorientationhorizontal: 'glyphOrientationHorizontal',
+  'glyph-orientation-horizontal': 'glyphOrientationHorizontal',
+  glyphorientationvertical: 'glyphOrientationVertical',
+  'glyph-orientation-vertical': 'glyphOrientationVertical',
+  glyphref: 'glyphRef',
+  gradienttransform: 'gradientTransform',
+  gradientunits: 'gradientUnits',
+  hanging: 'hanging',
+  horizadvx: 'horizAdvX',
+  'horiz-adv-x': 'horizAdvX',
+  horizoriginx: 'horizOriginX',
+  'horiz-origin-x': 'horizOriginX',
+  ideographic: 'ideographic',
+  imagerendering: 'imageRendering',
+  'image-rendering': 'imageRendering',
+  in2: 'in2',
+  'in': 'in',
+  inlist: 'inlist',
+  intercept: 'intercept',
+  k1: 'k1',
+  k2: 'k2',
+  k3: 'k3',
+  k4: 'k4',
+  k: 'k',
+  kernelmatrix: 'kernelMatrix',
+  kernelunitlength: 'kernelUnitLength',
+  kerning: 'kerning',
+  keypoints: 'keyPoints',
+  keysplines: 'keySplines',
+  keytimes: 'keyTimes',
+  lengthadjust: 'lengthAdjust',
+  letterspacing: 'letterSpacing',
+  'letter-spacing': 'letterSpacing',
+  lightingcolor: 'lightingColor',
+  'lighting-color': 'lightingColor',
+  limitingconeangle: 'limitingConeAngle',
+  local: 'local',
+  markerend: 'markerEnd',
+  'marker-end': 'markerEnd',
+  markerheight: 'markerHeight',
+  markermid: 'markerMid',
+  'marker-mid': 'markerMid',
+  markerstart: 'markerStart',
+  'marker-start': 'markerStart',
+  markerunits: 'markerUnits',
+  markerwidth: 'markerWidth',
+  mask: 'mask',
+  maskcontentunits: 'maskContentUnits',
+  maskunits: 'maskUnits',
+  mathematical: 'mathematical',
+  mode: 'mode',
+  numoctaves: 'numOctaves',
+  offset: 'offset',
+  opacity: 'opacity',
+  operator: 'operator',
+  order: 'order',
+  orient: 'orient',
+  orientation: 'orientation',
+  origin: 'origin',
+  overflow: 'overflow',
+  overlineposition: 'overlinePosition',
+  'overline-position': 'overlinePosition',
+  overlinethickness: 'overlineThickness',
+  'overline-thickness': 'overlineThickness',
+  paintorder: 'paintOrder',
+  'paint-order': 'paintOrder',
+  panose1: 'panose1',
+  'panose-1': 'panose1',
+  pathlength: 'pathLength',
+  patterncontentunits: 'patternContentUnits',
+  patterntransform: 'patternTransform',
+  patternunits: 'patternUnits',
+  pointerevents: 'pointerEvents',
+  'pointer-events': 'pointerEvents',
+  points: 'points',
+  pointsatx: 'pointsAtX',
+  pointsaty: 'pointsAtY',
+  pointsatz: 'pointsAtZ',
+  prefix: 'prefix',
+  preservealpha: 'preserveAlpha',
+  preserveaspectratio: 'preserveAspectRatio',
+  primitiveunits: 'primitiveUnits',
+  property: 'property',
+  r: 'r',
+  radius: 'radius',
+  refx: 'refX',
+  refy: 'refY',
+  renderingintent: 'renderingIntent',
+  'rendering-intent': 'renderingIntent',
+  repeatcount: 'repeatCount',
+  repeatdur: 'repeatDur',
+  requiredextensions: 'requiredExtensions',
+  requiredfeatures: 'requiredFeatures',
+  resource: 'resource',
+  restart: 'restart',
+  result: 'result',
+  results: 'results',
+  rotate: 'rotate',
+  rx: 'rx',
+  ry: 'ry',
+  scale: 'scale',
+  security: 'security',
+  seed: 'seed',
+  shaperendering: 'shapeRendering',
+  'shape-rendering': 'shapeRendering',
+  slope: 'slope',
+  spacing: 'spacing',
+  specularconstant: 'specularConstant',
+  specularexponent: 'specularExponent',
+  speed: 'speed',
+  spreadmethod: 'spreadMethod',
+  startoffset: 'startOffset',
+  stddeviation: 'stdDeviation',
+  stemh: 'stemh',
+  stemv: 'stemv',
+  stitchtiles: 'stitchTiles',
+  stopcolor: 'stopColor',
+  'stop-color': 'stopColor',
+  stopopacity: 'stopOpacity',
+  'stop-opacity': 'stopOpacity',
+  strikethroughposition: 'strikethroughPosition',
+  'strikethrough-position': 'strikethroughPosition',
+  strikethroughthickness: 'strikethroughThickness',
+  'strikethrough-thickness': 'strikethroughThickness',
+  string: 'string',
+  stroke: 'stroke',
+  strokedasharray: 'strokeDasharray',
+  'stroke-dasharray': 'strokeDasharray',
+  strokedashoffset: 'strokeDashoffset',
+  'stroke-dashoffset': 'strokeDashoffset',
+  strokelinecap: 'strokeLinecap',
+  'stroke-linecap': 'strokeLinecap',
+  strokelinejoin: 'strokeLinejoin',
+  'stroke-linejoin': 'strokeLinejoin',
+  strokemiterlimit: 'strokeMiterlimit',
+  'stroke-miterlimit': 'strokeMiterlimit',
+  strokewidth: 'strokeWidth',
+  'stroke-width': 'strokeWidth',
+  strokeopacity: 'strokeOpacity',
+  'stroke-opacity': 'strokeOpacity',
+  suppresscontenteditablewarning: 'suppressContentEditableWarning',
+  suppresshydrationwarning: 'suppressHydrationWarning',
+  surfacescale: 'surfaceScale',
+  systemlanguage: 'systemLanguage',
+  tablevalues: 'tableValues',
+  targetx: 'targetX',
+  targety: 'targetY',
+  textanchor: 'textAnchor',
+  'text-anchor': 'textAnchor',
+  textdecoration: 'textDecoration',
+  'text-decoration': 'textDecoration',
+  textlength: 'textLength',
+  textrendering: 'textRendering',
+  'text-rendering': 'textRendering',
+  to: 'to',
+  transform: 'transform',
+  'typeof': 'typeof',
+  u1: 'u1',
+  u2: 'u2',
+  underlineposition: 'underlinePosition',
+  'underline-position': 'underlinePosition',
+  underlinethickness: 'underlineThickness',
+  'underline-thickness': 'underlineThickness',
+  unicode: 'unicode',
+  unicodebidi: 'unicodeBidi',
+  'unicode-bidi': 'unicodeBidi',
+  unicoderange: 'unicodeRange',
+  'unicode-range': 'unicodeRange',
+  unitsperem: 'unitsPerEm',
+  'units-per-em': 'unitsPerEm',
+  unselectable: 'unselectable',
+  valphabetic: 'vAlphabetic',
+  'v-alphabetic': 'vAlphabetic',
+  values: 'values',
+  vectoreffect: 'vectorEffect',
+  'vector-effect': 'vectorEffect',
+  version: 'version',
+  vertadvy: 'vertAdvY',
+  'vert-adv-y': 'vertAdvY',
+  vertoriginx: 'vertOriginX',
+  'vert-origin-x': 'vertOriginX',
+  vertoriginy: 'vertOriginY',
+  'vert-origin-y': 'vertOriginY',
+  vhanging: 'vHanging',
+  'v-hanging': 'vHanging',
+  videographic: 'vIdeographic',
+  'v-ideographic': 'vIdeographic',
+  viewbox: 'viewBox',
+  viewtarget: 'viewTarget',
+  visibility: 'visibility',
+  vmathematical: 'vMathematical',
+  'v-mathematical': 'vMathematical',
+  vocab: 'vocab',
+  widths: 'widths',
+  wordspacing: 'wordSpacing',
+  'word-spacing': 'wordSpacing',
+  writingmode: 'writingMode',
+  'writing-mode': 'writingMode',
+  x1: 'x1',
+  x2: 'x2',
+  x: 'x',
+  xchannelselector: 'xChannelSelector',
+  xheight: 'xHeight',
+  'x-height': 'xHeight',
+  xlinkactuate: 'xlinkActuate',
+  'xlink:actuate': 'xlinkActuate',
+  xlinkarcrole: 'xlinkArcrole',
+  'xlink:arcrole': 'xlinkArcrole',
+  xlinkhref: 'xlinkHref',
+  'xlink:href': 'xlinkHref',
+  xlinkrole: 'xlinkRole',
+  'xlink:role': 'xlinkRole',
+  xlinkshow: 'xlinkShow',
+  'xlink:show': 'xlinkShow',
+  xlinktitle: 'xlinkTitle',
+  'xlink:title': 'xlinkTitle',
+  xlinktype: 'xlinkType',
+  'xlink:type': 'xlinkType',
+  xmlbase: 'xmlBase',
+  'xml:base': 'xmlBase',
+  xmllang: 'xmlLang',
+  'xml:lang': 'xmlLang',
+  xmlns: 'xmlns',
+  'xml:space': 'xmlSpace',
+  xmlnsxlink: 'xmlnsXlink',
+  'xmlns:xlink': 'xmlnsXlink',
+  xmlspace: 'xmlSpace',
+  y1: 'y1',
+  y2: 'y2',
+  y: 'y',
+  ychannelselector: 'yChannelSelector',
+  z: 'z',
+  zoomandpan: 'zoomAndPan'
+};
+
+var ariaProperties = {
+  'aria-current': 0, // state
+  'aria-details': 0,
+  'aria-disabled': 0, // state
+  'aria-hidden': 0, // state
+  'aria-invalid': 0, // state
+  'aria-keyshortcuts': 0,
+  'aria-label': 0,
+  'aria-roledescription': 0,
+  // Widget Attributes
+  'aria-autocomplete': 0,
+  'aria-checked': 0,
+  'aria-expanded': 0,
+  'aria-haspopup': 0,
+  'aria-level': 0,
+  'aria-modal': 0,
+  'aria-multiline': 0,
+  'aria-multiselectable': 0,
+  'aria-orientation': 0,
+  'aria-placeholder': 0,
+  'aria-pressed': 0,
+  'aria-readonly': 0,
+  'aria-required': 0,
+  'aria-selected': 0,
+  'aria-sort': 0,
+  'aria-valuemax': 0,
+  'aria-valuemin': 0,
+  'aria-valuenow': 0,
+  'aria-valuetext': 0,
+  // Live Region Attributes
+  'aria-atomic': 0,
+  'aria-busy': 0,
+  'aria-live': 0,
+  'aria-relevant': 0,
+  // Drag-and-Drop Attributes
+  'aria-dropeffect': 0,
+  'aria-grabbed': 0,
+  // Relationship Attributes
+  'aria-activedescendant': 0,
+  'aria-colcount': 0,
+  'aria-colindex': 0,
+  'aria-colspan': 0,
+  'aria-controls': 0,
+  'aria-describedby': 0,
+  'aria-errormessage': 0,
+  'aria-flowto': 0,
+  'aria-labelledby': 0,
+  'aria-owns': 0,
+  'aria-posinset': 0,
+  'aria-rowcount': 0,
+  'aria-rowindex': 0,
+  'aria-rowspan': 0,
+  'aria-setsize': 0
+};
+
+var warnedProperties = {};
+var rARIA = new RegExp('^(aria)-[' + ATTRIBUTE_NAME_CHAR + ']*$');
+var rARIACamel = new RegExp('^(aria)[A-Z][' + ATTRIBUTE_NAME_CHAR + ']*$');
+
+var hasOwnProperty$1 = Object.prototype.hasOwnProperty;
+
+function getStackAddendum() {
+  var stack = ReactDebugCurrentFrame.getStackAddendum();
+  return stack != null ? stack : '';
+}
+
+function validateProperty(tagName, name) {
+  if (hasOwnProperty$1.call(warnedProperties, name) && warnedProperties[name]) {
+    return true;
+  }
+
+  if (rARIACamel.test(name)) {
+    var ariaName = 'aria-' + name.slice(4).toLowerCase();
+    var correctName = ariaProperties.hasOwnProperty(ariaName) ? ariaName : null;
+
+    // If this is an aria-* attribute, but is not listed in the known DOM
+    // DOM properties, then it is an invalid aria-* attribute.
+    if (correctName == null) {
+      warning_1(false, 'Invalid ARIA attribute `%s`. ARIA attributes follow the pattern aria-* and must be lowercase.%s', name, getStackAddendum());
+      warnedProperties[name] = true;
+      return true;
+    }
+    // aria-* attributes should be lowercase; suggest the lowercase version.
+    if (name !== correctName) {
+      warning_1(false, 'Invalid ARIA attribute `%s`. Did you mean `%s`?%s', name, correctName, getStackAddendum());
+      warnedProperties[name] = true;
+      return true;
+    }
+  }
+
+  if (rARIA.test(name)) {
+    var lowerCasedName = name.toLowerCase();
+    var standardName = ariaProperties.hasOwnProperty(lowerCasedName) ? lowerCasedName : null;
+
+    // If this is an aria-* attribute, but is not listed in the known DOM
+    // DOM properties, then it is an invalid aria-* attribute.
+    if (standardName == null) {
+      warnedProperties[name] = true;
+      return false;
+    }
+    // aria-* attributes should be lowercase; suggest the lowercase version.
+    if (name !== standardName) {
+      warning_1(false, 'Unknown ARIA attribute `%s`. Did you mean `%s`?%s', name, standardName, getStackAddendum());
+      warnedProperties[name] = true;
+      return true;
+    }
+  }
+
+  return true;
+}
+
+function warnInvalidARIAProps(type, props) {
+  var invalidProps = [];
+
+  for (var key in props) {
+    var isValid = validateProperty(type, key);
+    if (!isValid) {
+      invalidProps.push(key);
+    }
+  }
+
+  var unknownPropString = invalidProps.map(function (prop) {
+    return '`' + prop + '`';
+  }).join(', ');
+
+  if (invalidProps.length === 1) {
+    warning_1(false, 'Invalid aria prop %s on <%s> tag. ' + 'For details, see https://fb.me/invalid-aria-prop%s', unknownPropString, type, getStackAddendum());
+  } else if (invalidProps.length > 1) {
+    warning_1(false, 'Invalid aria props %s on <%s> tag. ' + 'For details, see https://fb.me/invalid-aria-prop%s', unknownPropString, type, getStackAddendum());
+  }
+}
+
+function validateProperties(type, props) {
+  if (isCustomComponent(type, props)) {
+    return;
+  }
+  warnInvalidARIAProps(type, props);
+}
+
+var didWarnValueNull = false;
+
+function getStackAddendum$1() {
+  var stack = ReactDebugCurrentFrame.getStackAddendum();
+  return stack != null ? stack : '';
+}
+
+function validateProperties$1(type, props) {
+  if (type !== 'input' && type !== 'textarea' && type !== 'select') {
+    return;
+  }
+
+  if (props != null && props.value === null && !didWarnValueNull) {
+    didWarnValueNull = true;
+    if (type === 'select' && props.multiple) {
+      warning_1(false, '`value` prop on `%s` should not be null. ' + 'Consider using an empty array when `multiple` is set to `true` ' + 'to clear the component or `undefined` for uncontrolled components.%s', type, getStackAddendum$1());
+    } else {
+      warning_1(false, '`value` prop on `%s` should not be null. ' + 'Consider using an empty string to clear the component or `undefined` ' + 'for uncontrolled components.%s', type, getStackAddendum$1());
+    }
+  }
+}
+
+function getStackAddendum$2() {
+  var stack = ReactDebugCurrentFrame.getStackAddendum();
+  return stack != null ? stack : '';
+}
+
+var validateProperty$1 = function () {};
+
+{
+  var warnedProperties$1 = {};
+  var _hasOwnProperty = Object.prototype.hasOwnProperty;
+  var EVENT_NAME_REGEX = /^on./;
+  var INVALID_EVENT_NAME_REGEX = /^on[^A-Z]/;
+  var rARIA$1 = new RegExp('^(aria)-[' + ATTRIBUTE_NAME_CHAR + ']*$');
+  var rARIACamel$1 = new RegExp('^(aria)[A-Z][' + ATTRIBUTE_NAME_CHAR + ']*$');
+
+  validateProperty$1 = function (tagName, name, value, canUseEventSystem) {
+    if (_hasOwnProperty.call(warnedProperties$1, name) && warnedProperties$1[name]) {
+      return true;
+    }
+
+    var lowerCasedName = name.toLowerCase();
+    if (lowerCasedName === 'onfocusin' || lowerCasedName === 'onfocusout') {
+      warning_1(false, 'React uses onFocus and onBlur instead of onFocusIn and onFocusOut. ' + 'All React events are normalized to bubble, so onFocusIn and onFocusOut ' + 'are not needed/supported by React.');
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    // We can't rely on the event system being injected on the server.
+    if (canUseEventSystem) {
+      if (registrationNameModules.hasOwnProperty(name)) {
+        return true;
+      }
+      var registrationName = possibleRegistrationNames.hasOwnProperty(lowerCasedName) ? possibleRegistrationNames[lowerCasedName] : null;
+      if (registrationName != null) {
+        warning_1(false, 'Invalid event handler property `%s`. Did you mean `%s`?%s', name, registrationName, getStackAddendum$2());
+        warnedProperties$1[name] = true;
+        return true;
+      }
+      if (EVENT_NAME_REGEX.test(name)) {
+        warning_1(false, 'Unknown event handler property `%s`. It will be ignored.%s', name, getStackAddendum$2());
+        warnedProperties$1[name] = true;
+        return true;
+      }
+    } else if (EVENT_NAME_REGEX.test(name)) {
+      // If no event plugins have been injected, we are in a server environment.
+      // So we can't tell if the event name is correct for sure, but we can filter
+      // out known bad ones like `onclick`. We can't suggest a specific replacement though.
+      if (INVALID_EVENT_NAME_REGEX.test(name)) {
+        warning_1(false, 'Invalid event handler property `%s`. ' + 'React events use the camelCase naming convention, for example `onClick`.%s', name, getStackAddendum$2());
+      }
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    // Let the ARIA attribute hook validate ARIA attributes
+    if (rARIA$1.test(name) || rARIACamel$1.test(name)) {
+      return true;
+    }
+
+    if (lowerCasedName === 'innerhtml') {
+      warning_1(false, 'Directly setting property `innerHTML` is not permitted. ' + 'For more information, lookup documentation on `dangerouslySetInnerHTML`.');
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    if (lowerCasedName === 'aria') {
+      warning_1(false, 'The `aria` attribute is reserved for future use in React. ' + 'Pass individual `aria-` attributes instead.');
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    if (lowerCasedName === 'is' && value !== null && value !== undefined && typeof value !== 'string') {
+      warning_1(false, 'Received a `%s` for a string attribute `is`. If this is expected, cast ' + 'the value to a string.%s', typeof value, getStackAddendum$2());
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    if (typeof value === 'number' && isNaN(value)) {
+      warning_1(false, 'Received NaN for the `%s` attribute. If this is expected, cast ' + 'the value to a string.%s', name, getStackAddendum$2());
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    var propertyInfo = getPropertyInfo(name);
+    var isReserved = propertyInfo !== null && propertyInfo.type === RESERVED;
+
+    // Known attributes should match the casing specified in the property config.
+    if (possibleStandardNames.hasOwnProperty(lowerCasedName)) {
+      var standardName = possibleStandardNames[lowerCasedName];
+      if (standardName !== name) {
+        warning_1(false, 'Invalid DOM property `%s`. Did you mean `%s`?%s', name, standardName, getStackAddendum$2());
+        warnedProperties$1[name] = true;
+        return true;
+      }
+    } else if (!isReserved && name !== lowerCasedName) {
+      // Unknown attributes should have lowercase casing since that's how they
+      // will be cased anyway with server rendering.
+      warning_1(false, 'React does not recognize the `%s` prop on a DOM element. If you ' + 'intentionally want it to appear in the DOM as a custom ' + 'attribute, spell it as lowercase `%s` instead. ' + 'If you accidentally passed it from a parent component, remove ' + 'it from the DOM element.%s', name, lowerCasedName, getStackAddendum$2());
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    if (typeof value === 'boolean' && shouldRemoveAttributeWithWarning(name, value, propertyInfo, false)) {
+      if (value) {
+        warning_1(false, 'Received `%s` for a non-boolean attribute `%s`.\n\n' + 'If you want to write it to the DOM, pass a string instead: ' + '%s="%s" or %s={value.toString()}.%s', value, name, name, value, name, getStackAddendum$2());
+      } else {
+        warning_1(false, 'Received `%s` for a non-boolean attribute `%s`.\n\n' + 'If you want to write it to the DOM, pass a string instead: ' + '%s="%s" or %s={value.toString()}.\n\n' + 'If you used to conditionally omit it with %s={condition && value}, ' + 'pass %s={condition ? value : undefined} instead.%s', value, name, name, value, name, name, name, getStackAddendum$2());
+      }
+      warnedProperties$1[name] = true;
+      return true;
+    }
+
+    // Now that we've validated casing, do not validate
+    // data types for reserved props
+    if (isReserved) {
+      return true;
+    }
+
+    // Warn when a known attribute is a bad type
+    if (shouldRemoveAttributeWithWarning(name, value, propertyInfo, false)) {
+      warnedProperties$1[name] = true;
+      return false;
+    }
+
+    return true;
+  };
+}
+
+var warnUnknownProperties = function (type, props, canUseEventSystem) {
+  var unknownProps = [];
+  for (var key in props) {
+    var isValid = validateProperty$1(type, key, props[key], canUseEventSystem);
+    if (!isValid) {
+      unknownProps.push(key);
+    }
+  }
+
+  var unknownPropString = unknownProps.map(function (prop) {
+    return '`' + prop + '`';
+  }).join(', ');
+  if (unknownProps.length === 1) {
+    warning_1(false, 'Invalid value for prop %s on <%s> tag. Either remove it from the element, ' + 'or pass a string or number value to keep it in the DOM. ' + 'For details, see https://fb.me/react-attribute-behavior%s', unknownPropString, type, getStackAddendum$2());
+  } else if (unknownProps.length > 1) {
+    warning_1(false, 'Invalid values for props %s on <%s> tag. Either remove them from the element, ' + 'or pass a string or number value to keep them in the DOM. ' + 'For details, see https://fb.me/react-attribute-behavior%s', unknownPropString, type, getStackAddendum$2());
+  }
+};
+
+function validateProperties$2(type, props, canUseEventSystem) {
+  if (isCustomComponent(type, props)) {
+    return;
+  }
+  warnUnknownProperties(type, props, canUseEventSystem);
+}
+
+// TODO: direct imports like some-package/src/* are bad. Fix me.
+var getCurrentFiberOwnerName$2 = ReactDebugCurrentFiber.getCurrentFiberOwnerName;
+var getCurrentFiberStackAddendum$3 = ReactDebugCurrentFiber.getCurrentFiberStackAddendum;
+
+var didWarnInvalidHydration = false;
+var didWarnShadyDOM = false;
+
+var DANGEROUSLY_SET_INNER_HTML = 'dangerouslySetInnerHTML';
+var SUPPRESS_CONTENT_EDITABLE_WARNING = 'suppressContentEditableWarning';
+var SUPPRESS_HYDRATION_WARNING$1 = 'suppressHydrationWarning';
+var AUTOFOCUS = 'autoFocus';
+var CHILDREN = 'children';
+var STYLE = 'style';
+var HTML = '__html';
+
+var HTML_NAMESPACE = Namespaces.html;
+
+
+var getStack = emptyFunction_1.thatReturns('');
+
+var warnedUnknownTags = void 0;
+var suppressHydrationWarning = void 0;
+
+var validatePropertiesInDevelopment = void 0;
+var warnForTextDifference = void 0;
+var warnForPropDifference = void 0;
+var warnForExtraAttributes = void 0;
+var warnForInvalidEventListener = void 0;
+
+var normalizeMarkupForTextOrAttribute = void 0;
+var normalizeHTML = void 0;
+
+{
+  getStack = getCurrentFiberStackAddendum$3;
+
+  warnedUnknownTags = {
+    // Chrome is the only major browser not shipping <time>. But as of July
+    // 2017 it intends to ship it due to widespread usage. We intentionally
+    // *don't* warn for <time> even if it's unrecognized by Chrome because
+    // it soon will be, and many apps have been using it anyway.
+    time: true,
+    // There are working polyfills for <dialog>. Let people use it.
+    dialog: true
+  };
+
+  validatePropertiesInDevelopment = function (type, props) {
+    validateProperties(type, props);
+    validateProperties$1(type, props);
+    validateProperties$2(type, props, /* canUseEventSystem */true);
+  };
+
+  // HTML parsing normalizes CR and CRLF to LF.
+  // It also can turn \u0000 into \uFFFD inside attributes.
+  // https://www.w3.org/TR/html5/single-page.html#preprocessing-the-input-stream
+  // If we have a mismatch, it might be caused by that.
+  // We will still patch up in this case but not fire the warning.
+  var NORMALIZE_NEWLINES_REGEX = /\r\n?/g;
+  var NORMALIZE_NULL_AND_REPLACEMENT_REGEX = /\u0000|\uFFFD/g;
+
+  normalizeMarkupForTextOrAttribute = function (markup) {
+    var markupString = typeof markup === 'string' ? markup : '' + markup;
+    return markupString.replace(NORMALIZE_NEWLINES_REGEX, '\n').replace(NORMALIZE_NULL_AND_REPLACEMENT_REGEX, '');
+  };
+
+  warnForTextDifference = function (serverText, clientText) {
+    if (didWarnInvalidHydration) {
+      return;
+    }
+    var normalizedClientText = normalizeMarkupForTextOrAttribute(clientText);
+    var normalizedServerText = normalizeMarkupForTextOrAttribute(serverText);
+    if (normalizedServerText === normalizedClientText) {
+      return;
+    }
+    didWarnInvalidHydration = true;
+    warning_1(false, 'Text content did not match. Server: "%s" Client: "%s"', normalizedServerText, normalizedClientText);
+  };
+
+  warnForPropDifference = function (propName, serverValue, clientValue) {
+    if (didWarnInvalidHydration) {
+      return;
+    }
+    var normalizedClientValue = normalizeMarkupForTextOrAttribute(clientValue);
+    var normalizedServerValue = normalizeMarkupForTextOrAttribute(serverValue);
+    if (normalizedServerValue === normalizedClientValue) {
+      return;
+    }
+    didWarnInvalidHydration = true;
+    warning_1(false, 'Prop `%s` did not match. Server: %s Client: %s', propName, JSON.stringify(normalizedServerValue), JSON.stringify(normalizedClientValue));
+  };
+
+  warnForExtraAttributes = function (attributeNames) {
+    if (didWarnInvalidHydration) {
+      return;
+    }
+    didWarnInvalidHydration = true;
+    var names = [];
+    attributeNames.forEach(function (name) {
+      names.push(name);
+    });
+    warning_1(false, 'Extra attributes from the server: %s', names);
+  };
+
+  warnForInvalidEventListener = function (registrationName, listener) {
+    if (listener === false) {
+      warning_1(false, 'Expected `%s` listener to be a function, instead got `false`.\n\n' + 'If you used to conditionally omit it with %s={condition && value}, ' + 'pass %s={condition ? value : undefined} instead.%s', registrationName, registrationName, registrationName, getCurrentFiberStackAddendum$3());
+    } else {
+      warning_1(false, 'Expected `%s` listener to be a function, instead got a value of `%s` type.%s', registrationName, typeof listener, getCurrentFiberStackAddendum$3());
+    }
+  };
+
+  // Parse the HTML and read it back to normalize the HTML string so that it
+  // can be used for comparison.
+  normalizeHTML = function (parent, html) {
+    // We could have created a separate document here to avoid
+    // re-initializing custom elements if they exist. But this breaks
+    // how <noscript> is being handled. So we use the same document.
+    // See the discussion in https://github.com/facebook/react/pull/11157.
+    var testElement = parent.namespaceURI === HTML_NAMESPACE ? parent.ownerDocument.createElement(parent.tagName) : parent.ownerDocument.createElementNS(parent.namespaceURI, parent.tagName);
+    testElement.innerHTML = html;
+    return testElement.innerHTML;
+  };
+}
+
+function ensureListeningTo(rootContainerElement, registrationName) {
+  var isDocumentOrFragment = rootContainerElement.nodeType === DOCUMENT_NODE || rootContainerElement.nodeType === DOCUMENT_FRAGMENT_NODE;
+  var doc = isDocumentOrFragment ? rootContainerElement : rootContainerElement.ownerDocument;
+  listenTo(registrationName, doc);
+}
+
+function getOwnerDocumentFromRootContainer(rootContainerElement) {
+  return rootContainerElement.nodeType === DOCUMENT_NODE ? rootContainerElement : rootContainerElement.ownerDocument;
+}
+
+function trapClickOnNonInteractiveElement(node) {
+  // Mobile Safari does not fire properly bubble click events on
+  // non-interactive elements, which means delegated click listeners do not
+  // fire. The workaround for this bug involves attaching an empty click
+  // listener on the target node.
+  // http://www.quirksmode.org/blog/archives/2010/09/click_event_del.html
+  // Just set it using the onclick property so that we don't have to manage any
+  // bookkeeping for it. Not sure if we need to clear it when the listener is
+  // removed.
+  // TODO: Only do this for the relevant Safaris maybe?
+  node.onclick = emptyFunction_1;
+}
+
+function setInitialDOMProperties(tag, domElement, rootContainerElement, nextProps, isCustomComponentTag) {
+  for (var propKey in nextProps) {
+    if (!nextProps.hasOwnProperty(propKey)) {
+      continue;
+    }
+    var nextProp = nextProps[propKey];
+    if (propKey === STYLE) {
+      {
+        if (nextProp) {
+          // Freeze the next style object so that we can assume it won't be
+          // mutated. We have already warned for this in the past.
+          Object.freeze(nextProp);
+        }
+      }
+      // Relies on `updateStylesByID` not mutating `styleUpdates`.
+      setValueForStyles(domElement, nextProp, getStack);
+    } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+      var nextHtml = nextProp ? nextProp[HTML] : undefined;
+      if (nextHtml != null) {
+        setInnerHTML(domElement, nextHtml);
+      }
+    } else if (propKey === CHILDREN) {
+      if (typeof nextProp === 'string') {
+        // Avoid setting initial textContent when the text is empty. In IE11 setting
+        // textContent on a <textarea> will cause the placeholder to not
+        // show within the <textarea> until it has been focused and blurred again.
+        // https://github.com/facebook/react/issues/6731#issuecomment-254874553
+        var canSetTextContent = tag !== 'textarea' || nextProp !== '';
+        if (canSetTextContent) {
+          setTextContent(domElement, nextProp);
+        }
+      } else if (typeof nextProp === 'number') {
+        setTextContent(domElement, '' + nextProp);
+      }
+    } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING$1) {
+      // Noop
+    } else if (propKey === AUTOFOCUS) {
+      // We polyfill it separately on the client during commit.
+      // We blacklist it here rather than in the property list because we emit it in SSR.
+    } else if (registrationNameModules.hasOwnProperty(propKey)) {
+      if (nextProp != null) {
+        if (true && typeof nextProp !== 'function') {
+          warnForInvalidEventListener(propKey, nextProp);
+        }
+        ensureListeningTo(rootContainerElement, propKey);
+      }
+    } else if (nextProp != null) {
+      setValueForProperty(domElement, propKey, nextProp, isCustomComponentTag);
+    }
+  }
+}
+
+function updateDOMProperties(domElement, updatePayload, wasCustomComponentTag, isCustomComponentTag) {
+  // TODO: Handle wasCustomComponentTag
+  for (var i = 0; i < updatePayload.length; i += 2) {
+    var propKey = updatePayload[i];
+    var propValue = updatePayload[i + 1];
+    if (propKey === STYLE) {
+      setValueForStyles(domElement, propValue, getStack);
+    } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+      setInnerHTML(domElement, propValue);
+    } else if (propKey === CHILDREN) {
+      setTextContent(domElement, propValue);
+    } else {
+      setValueForProperty(domElement, propKey, propValue, isCustomComponentTag);
+    }
+  }
+}
+
+function createElement$1(type, props, rootContainerElement, parentNamespace) {
+  var isCustomComponentTag = void 0;
+
+  // We create tags in the namespace of their parent container, except HTML
+  // tags get no namespace.
+  var ownerDocument = getOwnerDocumentFromRootContainer(rootContainerElement);
+  var domElement = void 0;
+  var namespaceURI = parentNamespace;
+  if (namespaceURI === HTML_NAMESPACE) {
+    namespaceURI = getIntrinsicNamespace(type);
+  }
+  if (namespaceURI === HTML_NAMESPACE) {
+    {
+      isCustomComponentTag = isCustomComponent(type, props);
+      // Should this check be gated by parent namespace? Not sure we want to
+      // allow <SVG> or <mATH>.
+      warning_1(isCustomComponentTag || type === type.toLowerCase(), '<%s /> is using uppercase HTML. Always use lowercase HTML tags ' + 'in React.', type);
+    }
+
+    if (type === 'script') {
+      // Create the script via .innerHTML so its "parser-inserted" flag is
+      // set to true and it does not execute
+      var div = ownerDocument.createElement('div');
+      div.innerHTML = '<script><' + '/script>'; // eslint-disable-line
+      // This is guaranteed to yield a script element.
+      var firstChild = div.firstChild;
+      domElement = div.removeChild(firstChild);
+    } else if (typeof props.is === 'string') {
+      // $FlowIssue `createElement` should be updated for Web Components
+      domElement = ownerDocument.createElement(type, { is: props.is });
+    } else {
+      // Separate else branch instead of using `props.is || undefined` above because of a Firefox bug.
+      // See discussion in https://github.com/facebook/react/pull/6896
+      // and discussion in https://bugzilla.mozilla.org/show_bug.cgi?id=1276240
+      domElement = ownerDocument.createElement(type);
+    }
+  } else {
+    domElement = ownerDocument.createElementNS(namespaceURI, type);
+  }
+
+  {
+    if (namespaceURI === HTML_NAMESPACE) {
+      if (!isCustomComponentTag && Object.prototype.toString.call(domElement) === '[object HTMLUnknownElement]' && !Object.prototype.hasOwnProperty.call(warnedUnknownTags, type)) {
+        warnedUnknownTags[type] = true;
+        warning_1(false, 'The tag <%s> is unrecognized in this browser. ' + 'If you meant to render a React component, start its name with ' + 'an uppercase letter.', type);
+      }
+    }
+  }
+
+  return domElement;
+}
+
+function createTextNode$1(text, rootContainerElement) {
+  return getOwnerDocumentFromRootContainer(rootContainerElement).createTextNode(text);
+}
+
+function setInitialProperties$1(domElement, tag, rawProps, rootContainerElement) {
+  var isCustomComponentTag = isCustomComponent(tag, rawProps);
+  {
+    validatePropertiesInDevelopment(tag, rawProps);
+    if (isCustomComponentTag && !didWarnShadyDOM && domElement.shadyRoot) {
+      warning_1(false, '%s is using shady DOM. Using shady DOM with React can ' + 'cause things to break subtly.', getCurrentFiberOwnerName$2() || 'A component');
+      didWarnShadyDOM = true;
+    }
+  }
+
+  // TODO: Make sure that we check isMounted before firing any of these events.
+  var props = void 0;
+  switch (tag) {
+    case 'iframe':
+    case 'object':
+      trapBubbledEvent('topLoad', 'load', domElement);
+      props = rawProps;
+      break;
+    case 'video':
+    case 'audio':
+      // Create listener for each media event
+      for (var event in mediaEventTypes) {
+        if (mediaEventTypes.hasOwnProperty(event)) {
+          trapBubbledEvent(event, mediaEventTypes[event], domElement);
+        }
+      }
+      props = rawProps;
+      break;
+    case 'source':
+      trapBubbledEvent('topError', 'error', domElement);
+      props = rawProps;
+      break;
+    case 'img':
+    case 'image':
+    case 'link':
+      trapBubbledEvent('topError', 'error', domElement);
+      trapBubbledEvent('topLoad', 'load', domElement);
+      props = rawProps;
+      break;
+    case 'form':
+      trapBubbledEvent('topReset', 'reset', domElement);
+      trapBubbledEvent('topSubmit', 'submit', domElement);
+      props = rawProps;
+      break;
+    case 'details':
+      trapBubbledEvent('topToggle', 'toggle', domElement);
+      props = rawProps;
+      break;
+    case 'input':
+      initWrapperState(domElement, rawProps);
+      props = getHostProps(domElement, rawProps);
+      trapBubbledEvent('topInvalid', 'invalid', domElement);
+      // For controlled components we always need to ensure we're listening
+      // to onChange. Even if there is no listener.
+      ensureListeningTo(rootContainerElement, 'onChange');
+      break;
+    case 'option':
+      validateProps(domElement, rawProps);
+      props = getHostProps$1(domElement, rawProps);
+      break;
+    case 'select':
+      initWrapperState$1(domElement, rawProps);
+      props = getHostProps$2(domElement, rawProps);
+      trapBubbledEvent('topInvalid', 'invalid', domElement);
+      // For controlled components we always need to ensure we're listening
+      // to onChange. Even if there is no listener.
+      ensureListeningTo(rootContainerElement, 'onChange');
+      break;
+    case 'textarea':
+      initWrapperState$2(domElement, rawProps);
+      props = getHostProps$3(domElement, rawProps);
+      trapBubbledEvent('topInvalid', 'invalid', domElement);
+      // For controlled components we always need to ensure we're listening
+      // to onChange. Even if there is no listener.
+      ensureListeningTo(rootContainerElement, 'onChange');
+      break;
+    default:
+      props = rawProps;
+  }
+
+  assertValidProps(tag, props, getStack);
+
+  setInitialDOMProperties(tag, domElement, rootContainerElement, props, isCustomComponentTag);
+
+  switch (tag) {
+    case 'input':
+      // TODO: Make sure we check if this is still unmounted or do any clean
+      // up necessary since we never stop tracking anymore.
+      track(domElement);
+      postMountWrapper(domElement, rawProps);
+      break;
+    case 'textarea':
+      // TODO: Make sure we check if this is still unmounted or do any clean
+      // up necessary since we never stop tracking anymore.
+      track(domElement);
+      postMountWrapper$3(domElement, rawProps);
+      break;
+    case 'option':
+      postMountWrapper$1(domElement, rawProps);
+      break;
+    case 'select':
+      postMountWrapper$2(domElement, rawProps);
+      break;
+    default:
+      if (typeof props.onClick === 'function') {
+        // TODO: This cast may not be sound for SVG, MathML or custom elements.
+        trapClickOnNonInteractiveElement(domElement);
+      }
+      break;
+  }
+}
+
+// Calculate the diff between the two objects.
+function diffProperties$1(domElement, tag, lastRawProps, nextRawProps, rootContainerElement) {
+  {
+    validatePropertiesInDevelopment(tag, nextRawProps);
+  }
+
+  var updatePayload = null;
+
+  var lastProps = void 0;
+  var nextProps = void 0;
+  switch (tag) {
+    case 'input':
+      lastProps = getHostProps(domElement, lastRawProps);
+      nextProps = getHostProps(domElement, nextRawProps);
+      updatePayload = [];
+      break;
+    case 'option':
+      lastProps = getHostProps$1(domElement, lastRawProps);
+      nextProps = getHostProps$1(domElement, nextRawProps);
+      updatePayload = [];
+      break;
+    case 'select':
+      lastProps = getHostProps$2(domElement, lastRawProps);
+      nextProps = getHostProps$2(domElement, nextRawProps);
+      updatePayload = [];
+      break;
+    case 'textarea':
+      lastProps = getHostProps$3(domElement, lastRawProps);
+      nextProps = getHostProps$3(domElement, nextRawProps);
+      updatePayload = [];
+      break;
+    default:
+      lastProps = lastRawProps;
+      nextProps = nextRawProps;
+      if (typeof lastProps.onClick !== 'function' && typeof nextProps.onClick === 'function') {
+        // TODO: This cast may not be sound for SVG, MathML or custom elements.
+        trapClickOnNonInteractiveElement(domElement);
+      }
+      break;
+  }
+
+  assertValidProps(tag, nextProps, getStack);
+
+  var propKey = void 0;
+  var styleName = void 0;
+  var styleUpdates = null;
+  for (propKey in lastProps) {
+    if (nextProps.hasOwnProperty(propKey) || !lastProps.hasOwnProperty(propKey) || lastProps[propKey] == null) {
+      continue;
+    }
+    if (propKey === STYLE) {
+      var lastStyle = lastProps[propKey];
+      for (styleName in lastStyle) {
+        if (lastStyle.hasOwnProperty(styleName)) {
+          if (!styleUpdates) {
+            styleUpdates = {};
+          }
+          styleUpdates[styleName] = '';
+        }
+      }
+    } else if (propKey === DANGEROUSLY_SET_INNER_HTML || propKey === CHILDREN) {
+      // Noop. This is handled by the clear text mechanism.
+    } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING$1) {
+      // Noop
+    } else if (propKey === AUTOFOCUS) {
+      // Noop. It doesn't work on updates anyway.
+    } else if (registrationNameModules.hasOwnProperty(propKey)) {
+      // This is a special case. If any listener updates we need to ensure
+      // that the "current" fiber pointer gets updated so we need a commit
+      // to update this element.
+      if (!updatePayload) {
+        updatePayload = [];
+      }
+    } else {
+      // For all other deleted properties we add it to the queue. We use
+      // the whitelist in the commit phase instead.
+      (updatePayload = updatePayload || []).push(propKey, null);
+    }
+  }
+  for (propKey in nextProps) {
+    var nextProp = nextProps[propKey];
+    var lastProp = lastProps != null ? lastProps[propKey] : undefined;
+    if (!nextProps.hasOwnProperty(propKey) || nextProp === lastProp || nextProp == null && lastProp == null) {
+      continue;
+    }
+    if (propKey === STYLE) {
+      {
+        if (nextProp) {
+          // Freeze the next style object so that we can assume it won't be
+          // mutated. We have already warned for this in the past.
+          Object.freeze(nextProp);
+        }
+      }
+      if (lastProp) {
+        // Unset styles on `lastProp` but not on `nextProp`.
+        for (styleName in lastProp) {
+          if (lastProp.hasOwnProperty(styleName) && (!nextProp || !nextProp.hasOwnProperty(styleName))) {
+            if (!styleUpdates) {
+              styleUpdates = {};
+            }
+            styleUpdates[styleName] = '';
+          }
+        }
+        // Update styles that changed since `lastProp`.
+        for (styleName in nextProp) {
+          if (nextProp.hasOwnProperty(styleName) && lastProp[styleName] !== nextProp[styleName]) {
+            if (!styleUpdates) {
+              styleUpdates = {};
+            }
+            styleUpdates[styleName] = nextProp[styleName];
+          }
+        }
+      } else {
+        // Relies on `updateStylesByID` not mutating `styleUpdates`.
+        if (!styleUpdates) {
+          if (!updatePayload) {
+            updatePayload = [];
+          }
+          updatePayload.push(propKey, styleUpdates);
+        }
+        styleUpdates = nextProp;
+      }
+    } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+      var nextHtml = nextProp ? nextProp[HTML] : undefined;
+      var lastHtml = lastProp ? lastProp[HTML] : undefined;
+      if (nextHtml != null) {
+        if (lastHtml !== nextHtml) {
+          (updatePayload = updatePayload || []).push(propKey, '' + nextHtml);
+        }
+      } else {
+        // TODO: It might be too late to clear this if we have children
+        // inserted already.
+      }
+    } else if (propKey === CHILDREN) {
+      if (lastProp !== nextProp && (typeof nextProp === 'string' || typeof nextProp === 'number')) {
+        (updatePayload = updatePayload || []).push(propKey, '' + nextProp);
+      }
+    } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING$1) {
+      // Noop
+    } else if (registrationNameModules.hasOwnProperty(propKey)) {
+      if (nextProp != null) {
+        // We eagerly listen to this even though we haven't committed yet.
+        if (true && typeof nextProp !== 'function') {
+          warnForInvalidEventListener(propKey, nextProp);
+        }
+        ensureListeningTo(rootContainerElement, propKey);
+      }
+      if (!updatePayload && lastProp !== nextProp) {
+        // This is a special case. If any listener updates we need to ensure
+        // that the "current" props pointer gets updated so we need a commit
+        // to update this element.
+        updatePayload = [];
+      }
+    } else {
+      // For any other property we always add it to the queue and then we
+      // filter it out using the whitelist during the commit.
+      (updatePayload = updatePayload || []).push(propKey, nextProp);
+    }
+  }
+  if (styleUpdates) {
+    (updatePayload = updatePayload || []).push(STYLE, styleUpdates);
+  }
+  return updatePayload;
+}
+
+// Apply the diff.
+function updateProperties$1(domElement, updatePayload, tag, lastRawProps, nextRawProps) {
+  // Update checked *before* name.
+  // In the middle of an update, it is possible to have multiple checked.
+  // When a checked radio tries to change name, browser makes another radio's checked false.
+  if (tag === 'input' && nextRawProps.type === 'radio' && nextRawProps.name != null) {
+    updateChecked(domElement, nextRawProps);
+  }
+
+  var wasCustomComponentTag = isCustomComponent(tag, lastRawProps);
+  var isCustomComponentTag = isCustomComponent(tag, nextRawProps);
+  // Apply the diff.
+  updateDOMProperties(domElement, updatePayload, wasCustomComponentTag, isCustomComponentTag);
+
+  // TODO: Ensure that an update gets scheduled if any of the special props
+  // changed.
+  switch (tag) {
+    case 'input':
+      // Update the wrapper around inputs *after* updating props. This has to
+      // happen after `updateDOMProperties`. Otherwise HTML5 input validations
+      // raise warnings and prevent the new value from being assigned.
+      updateWrapper(domElement, nextRawProps);
+      break;
+    case 'textarea':
+      updateWrapper$1(domElement, nextRawProps);
+      break;
+    case 'select':
+      // <select> value update needs to occur after <option> children
+      // reconciliation
+      postUpdateWrapper(domElement, nextRawProps);
+      break;
+  }
+}
+
+function getPossibleStandardName(propName) {
+  {
+    var lowerCasedName = propName.toLowerCase();
+    if (!possibleStandardNames.hasOwnProperty(lowerCasedName)) {
+      return null;
+    }
+    return possibleStandardNames[lowerCasedName] || null;
+  }
+  return null;
+}
+
+function diffHydratedProperties$1(domElement, tag, rawProps, parentNamespace, rootContainerElement) {
+  var isCustomComponentTag = void 0;
+  var extraAttributeNames = void 0;
+
+  {
+    suppressHydrationWarning = rawProps[SUPPRESS_HYDRATION_WARNING$1] === true;
+    isCustomComponentTag = isCustomComponent(tag, rawProps);
+    validatePropertiesInDevelopment(tag, rawProps);
+    if (isCustomComponentTag && !didWarnShadyDOM && domElement.shadyRoot) {
+      warning_1(false, '%s is using shady DOM. Using shady DOM with React can ' + 'cause things to break subtly.', getCurrentFiberOwnerName$2() || 'A component');
+      didWarnShadyDOM = true;
+    }
+  }
+
+  // TODO: Make sure that we check isMounted before firing any of these events.
+  switch (tag) {
+    case 'iframe':
+    case 'object':
+      trapBubbledEvent('topLoad', 'load', domElement);
+      break;
+    case 'video':
+    case 'audio':
+      // Create listener for each media event
+      for (var event in mediaEventTypes) {
+        if (mediaEventTypes.hasOwnProperty(event)) {
+          trapBubbledEvent(event, mediaEventTypes[event], domElement);
+        }
+      }
+      break;
+    case 'source':
+      trapBubbledEvent('topError', 'error', domElement);
+      break;
+    case 'img':
+    case 'image':
+    case 'link':
+      trapBubbledEvent('topError', 'error', domElement);
+      trapBubbledEvent('topLoad', 'load', domElement);
+      break;
+    case 'form':
+      trapBubbledEvent('topReset', 'reset', domElement);
+      trapBubbledEvent('topSubmit', 'submit', domElement);
+      break;
+    case 'details':
+      trapBubbledEvent('topToggle', 'toggle', domElement);
+      break;
+    case 'input':
+      initWrapperState(domElement, rawProps);
+      trapBubbledEvent('topInvalid', 'invalid', domElement);
+      // For controlled components we always need to ensure we're listening
+      // to onChange. Even if there is no listener.
+      ensureListeningTo(rootContainerElement, 'onChange');
+      break;
+    case 'option':
+      validateProps(domElement, rawProps);
+      break;
+    case 'select':
+      initWrapperState$1(domElement, rawProps);
+      trapBubbledEvent('topInvalid', 'invalid', domElement);
+      // For controlled components we always need to ensure we're listening
+      // to onChange. Even if there is no listener.
+      ensureListeningTo(rootContainerElement, 'onChange');
+      break;
+    case 'textarea':
+      initWrapperState$2(domElement, rawProps);
+      trapBubbledEvent('topInvalid', 'invalid', domElement);
+      // For controlled components we always need to ensure we're listening
+      // to onChange. Even if there is no listener.
+      ensureListeningTo(rootContainerElement, 'onChange');
+      break;
+  }
+
+  assertValidProps(tag, rawProps, getStack);
+
+  {
+    extraAttributeNames = new Set();
+    var attributes = domElement.attributes;
+    for (var i = 0; i < attributes.length; i++) {
+      var name = attributes[i].name.toLowerCase();
+      switch (name) {
+        // Built-in SSR attribute is whitelisted
+        case 'data-reactroot':
+          break;
+        // Controlled attributes are not validated
+        // TODO: Only ignore them on controlled tags.
+        case 'value':
+          break;
+        case 'checked':
+          break;
+        case 'selected':
+          break;
+        default:
+          // Intentionally use the original name.
+          // See discussion in https://github.com/facebook/react/pull/10676.
+          extraAttributeNames.add(attributes[i].name);
+      }
+    }
+  }
+
+  var updatePayload = null;
+  for (var propKey in rawProps) {
+    if (!rawProps.hasOwnProperty(propKey)) {
+      continue;
+    }
+    var nextProp = rawProps[propKey];
+    if (propKey === CHILDREN) {
+      // For text content children we compare against textContent. This
+      // might match additional HTML that is hidden when we read it using
+      // textContent. E.g. "foo" will match "f<span>oo</span>" but that still
+      // satisfies our requirement. Our requirement is not to produce perfect
+      // HTML and attributes. Ideally we should preserve structure but it's
+      // ok not to if the visible content is still enough to indicate what
+      // even listeners these nodes might be wired up to.
+      // TODO: Warn if there is more than a single textNode as a child.
+      // TODO: Should we use domElement.firstChild.nodeValue to compare?
+      if (typeof nextProp === 'string') {
+        if (domElement.textContent !== nextProp) {
+          if (true && !suppressHydrationWarning) {
+            warnForTextDifference(domElement.textContent, nextProp);
+          }
+          updatePayload = [CHILDREN, nextProp];
+        }
+      } else if (typeof nextProp === 'number') {
+        if (domElement.textContent !== '' + nextProp) {
+          if (true && !suppressHydrationWarning) {
+            warnForTextDifference(domElement.textContent, nextProp);
+          }
+          updatePayload = [CHILDREN, '' + nextProp];
+        }
+      }
+    } else if (registrationNameModules.hasOwnProperty(propKey)) {
+      if (nextProp != null) {
+        if (true && typeof nextProp !== 'function') {
+          warnForInvalidEventListener(propKey, nextProp);
+        }
+        ensureListeningTo(rootContainerElement, propKey);
+      }
+    } else if (true &&
+    // Convince Flow we've calculated it (it's DEV-only in this method.)
+    typeof isCustomComponentTag === 'boolean') {
+      // Validate that the properties correspond to their expected values.
+      var serverValue = void 0;
+      var propertyInfo = getPropertyInfo(propKey);
+      if (suppressHydrationWarning) {
+        // Don't bother comparing. We're ignoring all these warnings.
+      } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING$1 ||
+      // Controlled attributes are not validated
+      // TODO: Only ignore them on controlled tags.
+      propKey === 'value' || propKey === 'checked' || propKey === 'selected') {
+        // Noop
+      } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+        var rawHtml = nextProp ? nextProp[HTML] || '' : '';
+        var serverHTML = domElement.innerHTML;
+        var expectedHTML = normalizeHTML(domElement, rawHtml);
+        if (expectedHTML !== serverHTML) {
+          warnForPropDifference(propKey, serverHTML, expectedHTML);
+        }
+      } else if (propKey === STYLE) {
+        // $FlowFixMe - Should be inferred as not undefined.
+        extraAttributeNames['delete'](propKey);
+        var expectedStyle = createDangerousStringForStyles(nextProp);
+        serverValue = domElement.getAttribute('style');
+        if (expectedStyle !== serverValue) {
+          warnForPropDifference(propKey, serverValue, expectedStyle);
+        }
+      } else if (isCustomComponentTag) {
+        // $FlowFixMe - Should be inferred as not undefined.
+        extraAttributeNames['delete'](propKey.toLowerCase());
+        serverValue = getValueForAttribute(domElement, propKey, nextProp);
+
+        if (nextProp !== serverValue) {
+          warnForPropDifference(propKey, serverValue, nextProp);
+        }
+      } else if (!shouldIgnoreAttribute(propKey, propertyInfo, isCustomComponentTag) && !shouldRemoveAttribute(propKey, nextProp, propertyInfo, isCustomComponentTag)) {
+        var isMismatchDueToBadCasing = false;
+        if (propertyInfo !== null) {
+          // $FlowFixMe - Should be inferred as not undefined.
+          extraAttributeNames['delete'](propertyInfo.attributeName);
+          serverValue = getValueForProperty(domElement, propKey, nextProp, propertyInfo);
+        } else {
+          var ownNamespace = parentNamespace;
+          if (ownNamespace === HTML_NAMESPACE) {
+            ownNamespace = getIntrinsicNamespace(tag);
+          }
+          if (ownNamespace === HTML_NAMESPACE) {
+            // $FlowFixMe - Should be inferred as not undefined.
+            extraAttributeNames['delete'](propKey.toLowerCase());
+          } else {
+            var standardName = getPossibleStandardName(propKey);
+            if (standardName !== null && standardName !== propKey) {
+              // If an SVG prop is supplied with bad casing, it will
+              // be successfully parsed from HTML, but will produce a mismatch
+              // (and would be incorrectly rendered on the client).
+              // However, we already warn about bad casing elsewhere.
+              // So we'll skip the misleading extra mismatch warning in this case.
+              isMismatchDueToBadCasing = true;
+              // $FlowFixMe - Should be inferred as not undefined.
+              extraAttributeNames['delete'](standardName);
+            }
+            // $FlowFixMe - Should be inferred as not undefined.
+            extraAttributeNames['delete'](propKey);
+          }
+          serverValue = getValueForAttribute(domElement, propKey, nextProp);
+        }
+
+        if (nextProp !== serverValue && !isMismatchDueToBadCasing) {
+          warnForPropDifference(propKey, serverValue, nextProp);
+        }
+      }
+    }
+  }
+
+  {
+    // $FlowFixMe - Should be inferred as not undefined.
+    if (extraAttributeNames.size > 0 && !suppressHydrationWarning) {
+      // $FlowFixMe - Should be inferred as not undefined.
+      warnForExtraAttributes(extraAttributeNames);
+    }
+  }
+
+  switch (tag) {
+    case 'input':
+      // TODO: Make sure we check if this is still unmounted or do any clean
+      // up necessary since we never stop tracking anymore.
+      track(domElement);
+      postMountWrapper(domElement, rawProps);
+      break;
+    case 'textarea':
+      // TODO: Make sure we check if this is still unmounted or do any clean
+      // up necessary since we never stop tracking anymore.
+      track(domElement);
+      postMountWrapper$3(domElement, rawProps);
+      break;
+    case 'select':
+    case 'option':
+      // For input and textarea we current always set the value property at
+      // post mount to force it to diverge from attributes. However, for
+      // option and select we don't quite do the same thing and select
+      // is not resilient to the DOM state changing so we don't do that here.
+      // TODO: Consider not doing this for input and textarea.
+      break;
+    default:
+      if (typeof rawProps.onClick === 'function') {
+        // TODO: This cast may not be sound for SVG, MathML or custom elements.
+        trapClickOnNonInteractiveElement(domElement);
+      }
+      break;
+  }
+
+  return updatePayload;
+}
+
+function diffHydratedText$1(textNode, text) {
+  var isDifferent = textNode.nodeValue !== text;
+  return isDifferent;
+}
+
+function warnForUnmatchedText$1(textNode, text) {
+  {
+    warnForTextDifference(textNode.nodeValue, text);
+  }
+}
+
+function warnForDeletedHydratableElement$1(parentNode, child) {
+  {
+    if (didWarnInvalidHydration) {
+      return;
+    }
+    didWarnInvalidHydration = true;
+    warning_1(false, 'Did not expect server HTML to contain a <%s> in <%s>.', child.nodeName.toLowerCase(), parentNode.nodeName.toLowerCase());
+  }
+}
+
+function warnForDeletedHydratableText$1(parentNode, child) {
+  {
+    if (didWarnInvalidHydration) {
+      return;
+    }
+    didWarnInvalidHydration = true;
+    warning_1(false, 'Did not expect server HTML to contain the text node "%s" in <%s>.', child.nodeValue, parentNode.nodeName.toLowerCase());
+  }
+}
+
+function warnForInsertedHydratedElement$1(parentNode, tag, props) {
+  {
+    if (didWarnInvalidHydration) {
+      return;
+    }
+    didWarnInvalidHydration = true;
+    warning_1(false, 'Expected server HTML to contain a matching <%s> in <%s>.', tag, parentNode.nodeName.toLowerCase());
+  }
+}
+
+function warnForInsertedHydratedText$1(parentNode, text) {
+  {
+    if (text === '') {
+      // We expect to insert empty text nodes since they're not represented in
+      // the HTML.
+      // TODO: Remove this special case if we can just avoid inserting empty
+      // text nodes.
+      return;
+    }
+    if (didWarnInvalidHydration) {
+      return;
+    }
+    didWarnInvalidHydration = true;
+    warning_1(false, 'Expected server HTML to contain a matching text node for "%s" in <%s>.', text, parentNode.nodeName.toLowerCase());
+  }
+}
+
+function restoreControlledState$1(domElement, tag, props) {
+  switch (tag) {
+    case 'input':
+      restoreControlledState(domElement, props);
+      return;
+    case 'textarea':
+      restoreControlledState$3(domElement, props);
+      return;
+    case 'select':
+      restoreControlledState$2(domElement, props);
+      return;
+  }
+}
+
+var ReactDOMFiberComponent = Object.freeze({
+	createElement: createElement$1,
+	createTextNode: createTextNode$1,
+	setInitialProperties: setInitialProperties$1,
+	diffProperties: diffProperties$1,
+	updateProperties: updateProperties$1,
+	diffHydratedProperties: diffHydratedProperties$1,
+	diffHydratedText: diffHydratedText$1,
+	warnForUnmatchedText: warnForUnmatchedText$1,
+	warnForDeletedHydratableElement: warnForDeletedHydratableElement$1,
+	warnForDeletedHydratableText: warnForDeletedHydratableText$1,
+	warnForInsertedHydratedElement: warnForInsertedHydratedElement$1,
+	warnForInsertedHydratedText: warnForInsertedHydratedText$1,
+	restoreControlledState: restoreControlledState$1
+});
+
+// TODO: direct imports like some-package/src/* are bad. Fix me.
+var getCurrentFiberStackAddendum$6 = ReactDebugCurrentFiber.getCurrentFiberStackAddendum;
+
+var validateDOMNesting = emptyFunction_1;
+
+{
+  // This validation code was written based on the HTML5 parsing spec:
+  // https://html.spec.whatwg.org/multipage/syntax.html#has-an-element-in-scope
+  //
+  // Note: this does not catch all invalid nesting, nor does it try to (as it's
+  // not clear what practical benefit doing so provides); instead, we warn only
+  // for cases where the parser will give a parse tree differing from what React
+  // intended. For example, <b><div></div></b> is invalid but we don't warn
+  // because it still parses correctly; we do warn for other cases like nested
+  // <p> tags where the beginning of the second element implicitly closes the
+  // first, causing a confusing mess.
+
+  // https://html.spec.whatwg.org/multipage/syntax.html#special
+  var specialTags = ['address', 'applet', 'area', 'article', 'aside', 'base', 'basefont', 'bgsound', 'blockquote', 'body', 'br', 'button', 'caption', 'center', 'col', 'colgroup', 'dd', 'details', 'dir', 'div', 'dl', 'dt', 'embed', 'fieldset', 'figcaption', 'figure', 'footer', 'form', 'frame', 'frameset', 'h1', 'h2', 'h3', 'h4', 'h5', 'h6', 'head', 'header', 'hgroup', 'hr', 'html', 'iframe', 'img', 'input', 'isindex', 'li', 'link', 'listing', 'main', 'marquee', 'menu', 'menuitem', 'meta', 'nav', 'noembed', 'noframes', 'noscript', 'object', 'ol', 'p', 'param', 'plaintext', 'pre', 'script', 'section', 'select', 'source', 'style', 'summary', 'table', 'tbody', 'td', 'template', 'textarea', 'tfoot', 'th', 'thead', 'title', 'tr', 'track', 'ul', 'wbr', 'xmp'];
+
+  // https://html.spec.whatwg.org/multipage/syntax.html#has-an-element-in-scope
+  var inScopeTags = ['applet', 'caption', 'html', 'table', 'td', 'th', 'marquee', 'object', 'template',
+
+  // https://html.spec.whatwg.org/multipage/syntax.html#html-integration-point
+  // TODO: Distinguish by namespace here -- for <title>, including it here
+  // errs on the side of fewer warnings
+  'foreignObject', 'desc', 'title'];
+
+  // https://html.spec.whatwg.org/multipage/syntax.html#has-an-element-in-button-scope
+  var buttonScopeTags = inScopeTags.concat(['button']);
+
+  // https://html.spec.whatwg.org/multipage/syntax.html#generate-implied-end-tags
+  var impliedEndTags = ['dd', 'dt', 'li', 'option', 'optgroup', 'p', 'rp', 'rt'];
+
+  var emptyAncestorInfo = {
+    current: null,
+
+    formTag: null,
+    aTagInScope: null,
+    buttonTagInScope: null,
+    nobrTagInScope: null,
+    pTagInButtonScope: null,
+
+    listItemTagAutoclosing: null,
+    dlItemTagAutoclosing: null
+  };
+
+  var updatedAncestorInfo$1 = function (oldInfo, tag, instance) {
+    var ancestorInfo = _assign({}, oldInfo || emptyAncestorInfo);
+    var info = { tag: tag, instance: instance };
+
+    if (inScopeTags.indexOf(tag) !== -1) {
+      ancestorInfo.aTagInScope = null;
+      ancestorInfo.buttonTagInScope = null;
+      ancestorInfo.nobrTagInScope = null;
+    }
+    if (buttonScopeTags.indexOf(tag) !== -1) {
+      ancestorInfo.pTagInButtonScope = null;
+    }
+
+    // See rules for 'li', 'dd', 'dt' start tags in
+    // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inbody
+    if (specialTags.indexOf(tag) !== -1 && tag !== 'address' && tag !== 'div' && tag !== 'p') {
+      ancestorInfo.listItemTagAutoclosing = null;
+      ancestorInfo.dlItemTagAutoclosing = null;
+    }
+
+    ancestorInfo.current = info;
+
+    if (tag === 'form') {
+      ancestorInfo.formTag = info;
+    }
+    if (tag === 'a') {
+      ancestorInfo.aTagInScope = info;
+    }
+    if (tag === 'button') {
+      ancestorInfo.buttonTagInScope = info;
+    }
+    if (tag === 'nobr') {
+      ancestorInfo.nobrTagInScope = info;
+    }
+    if (tag === 'p') {
+      ancestorInfo.pTagInButtonScope = info;
+    }
+    if (tag === 'li') {
+      ancestorInfo.listItemTagAutoclosing = info;
+    }
+    if (tag === 'dd' || tag === 'dt') {
+      ancestorInfo.dlItemTagAutoclosing = info;
+    }
+
+    return ancestorInfo;
+  };
+
+  /**
+   * Returns whether
+   */
+  var isTagValidWithParent = function (tag, parentTag) {
+    // First, let's check if we're in an unusual parsing mode...
+    switch (parentTag) {
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inselect
+      case 'select':
+        return tag === 'option' || tag === 'optgroup' || tag === '#text';
+      case 'optgroup':
+        return tag === 'option' || tag === '#text';
+      // Strictly speaking, seeing an <option> doesn't mean we're in a <select>
+      // but
+      case 'option':
+        return tag === '#text';
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intd
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-incaption
+      // No special behavior since these rules fall back to "in body" mode for
+      // all except special table nodes which cause bad parsing behavior anyway.
+
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intr
+      case 'tr':
+        return tag === 'th' || tag === 'td' || tag === 'style' || tag === 'script' || tag === 'template';
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intbody
+      case 'tbody':
+      case 'thead':
+      case 'tfoot':
+        return tag === 'tr' || tag === 'style' || tag === 'script' || tag === 'template';
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-incolgroup
+      case 'colgroup':
+        return tag === 'col' || tag === 'template';
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intable
+      case 'table':
+        return tag === 'caption' || tag === 'colgroup' || tag === 'tbody' || tag === 'tfoot' || tag === 'thead' || tag === 'style' || tag === 'script' || tag === 'template';
+      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inhead
+      case 'head':
+        return tag === 'base' || tag === 'basefont' || tag === 'bgsound' || tag === 'link' || tag === 'meta' || tag === 'title' || tag === 'noscript' || tag === 'noframes' || tag === 'style' || tag === 'script' || tag === 'template';
+      // https://html.spec.whatwg.org/multipage/semantics.html#the-html-element
+      case 'html':
+        return tag === 'head' || tag === 'body';
+      case '#document':
+        return tag === 'html';
+    }
+
+    // Probably in the "in body" parsing mode, so we outlaw only tag combos
+    // where the parsing rules cause implicit opens or closes to be added.
+    // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inbody
+    switch (tag) {
+      case 'h1':
+      case 'h2':
+      case 'h3':
+      case 'h4':
+      case 'h5':
+      case 'h6':
+        return parentTag !== 'h1' && parentTag !== 'h2' && parentTag !== 'h3' && parentTag !== 'h4' && parentTag !== 'h5' && parentTag !== 'h6';
+
+      case 'rp':
+      case 'rt':
+        return impliedEndTags.indexOf(parentTag) === -1;
+
+      case 'body':
+      case 'caption':
+      case 'col':
+      case 'colgroup':
+      case 'frame':
+      case 'head':
+      case 'html':
+      case 'tbody':
+      case 'td':
+      case 'tfoot':
+      case 'th':
+      case 'thead':
+      case 'tr':
+        // These tags are only valid with a few parents that have special child
+        // parsing rules -- if we're down here, then none of those matched and
+        // so we allow it only if we don't know what the parent is, as all other
+        // cases are invalid.
+        return parentTag == null;
+    }
+
+    return true;
+  };
+
+  /**
+   * Returns whether
+   */
+  var findInvalidAncestorForTag = function (tag, ancestorInfo) {
+    switch (tag) {
+      case 'address':
+      case 'article':
+      case 'aside':
+      case 'blockquote':
+      case 'center':
+      case 'details':
+      case 'dialog':
+      case 'dir':
+      case 'div':
+      case 'dl':
+      case 'fieldset':
+      case 'figcaption':
+      case 'figure':
+      case 'footer':
+      case 'header':
+      case 'hgroup':
+      case 'main':
+      case 'menu':
+      case 'nav':
+      case 'ol':
+      case 'p':
+      case 'section':
+      case 'summary':
+      case 'ul':
+      case 'pre':
+      case 'listing':
+      case 'table':
+      case 'hr':
+      case 'xmp':
+      case 'h1':
+      case 'h2':
+      case 'h3':
+      case 'h4':
+      case 'h5':
+      case 'h6':
+        return ancestorInfo.pTagInButtonScope;
+
+      case 'form':
+        return ancestorInfo.formTag || ancestorInfo.pTagInButtonScope;
+
+      case 'li':
+        return ancestorInfo.listItemTagAutoclosing;
+
+      case 'dd':
+      case 'dt':
+        return ancestorInfo.dlItemTagAutoclosing;
+
+      case 'button':
+        return ancestorInfo.buttonTagInScope;
+
+      case 'a':
+        // Spec says something about storing a list of markers, but it sounds
+        // equivalent to this check.
+        return ancestorInfo.aTagInScope;
+
+      case 'nobr':
+        return ancestorInfo.nobrTagInScope;
+    }
+
+    return null;
+  };
+
+  var didWarn = {};
+
+  validateDOMNesting = function (childTag, childText, ancestorInfo) {
+    ancestorInfo = ancestorInfo || emptyAncestorInfo;
+    var parentInfo = ancestorInfo.current;
+    var parentTag = parentInfo && parentInfo.tag;
+
+    if (childText != null) {
+      warning_1(childTag == null, 'validateDOMNesting: when childText is passed, childTag should be null');
+      childTag = '#text';
+    }
+
+    var invalidParent = isTagValidWithParent(childTag, parentTag) ? null : parentInfo;
+    var invalidAncestor = invalidParent ? null : findInvalidAncestorForTag(childTag, ancestorInfo);
+    var invalidParentOrAncestor = invalidParent || invalidAncestor;
+    if (!invalidParentOrAncestor) {
+      return;
+    }
+
+    var ancestorTag = invalidParentOrAncestor.tag;
+    var addendum = getCurrentFiberStackAddendum$6();
+
+    var warnKey = !!invalidParent + '|' + childTag + '|' + ancestorTag + '|' + addendum;
+    if (didWarn[warnKey]) {
+      return;
+    }
+    didWarn[warnKey] = true;
+
+    var tagDisplayName = childTag;
+    var whitespaceInfo = '';
+    if (childTag === '#text') {
+      if (/\S/.test(childText)) {
+        tagDisplayName = 'Text nodes';
+      } else {
+        tagDisplayName = 'Whitespace text nodes';
+        whitespaceInfo = " Make sure you don't have any extra whitespace between tags on " + 'each line of your source code.';
+      }
+    } else {
+      tagDisplayName = '<' + childTag + '>';
+    }
+
+    if (invalidParent) {
+      var info = '';
+      if (ancestorTag === 'table' && childTag === 'tr') {
+        info += ' Add a <tbody> to your code to match the DOM tree generated by ' + 'the browser.';
+      }
+      warning_1(false, 'validateDOMNesting(...): %s cannot appear as a child of <%s>.%s%s%s', tagDisplayName, ancestorTag, whitespaceInfo, info, addendum);
+    } else {
+      warning_1(false, 'validateDOMNesting(...): %s cannot appear as a descendant of ' + '<%s>.%s', tagDisplayName, ancestorTag, addendum);
+    }
+  };
+
+  // TODO: turn this into a named export
+  validateDOMNesting.updatedAncestorInfo = updatedAncestorInfo$1;
+}
+
+var validateDOMNesting$1 = validateDOMNesting;
+
+// TODO: This type is shared between the reconciler and ReactDOM, but will
+// eventually be lifted out to the renderer.
+
+// TODO: direct imports like some-package/src/* are bad. Fix me.
+var createElement = createElement$1;
+var createTextNode = createTextNode$1;
+var setInitialProperties = setInitialProperties$1;
+var diffProperties = diffProperties$1;
+var updateProperties = updateProperties$1;
+var diffHydratedProperties = diffHydratedProperties$1;
+var diffHydratedText = diffHydratedText$1;
+var warnForUnmatchedText = warnForUnmatchedText$1;
+var warnForDeletedHydratableElement = warnForDeletedHydratableElement$1;
+var warnForDeletedHydratableText = warnForDeletedHydratableText$1;
+var warnForInsertedHydratedElement = warnForInsertedHydratedElement$1;
+var warnForInsertedHydratedText = warnForInsertedHydratedText$1;
+var updatedAncestorInfo = validateDOMNesting$1.updatedAncestorInfo;
+var precacheFiberNode = precacheFiberNode$1;
+var updateFiberProps = updateFiberProps$1;
+
+
+var SUPPRESS_HYDRATION_WARNING = void 0;
+var topLevelUpdateWarnings = void 0;
+var warnOnInvalidCallback = void 0;
+var didWarnAboutUnstableCreatePortal = false;
+
+{
+  SUPPRESS_HYDRATION_WARNING = 'suppressHydrationWarning';
+  if (typeof Map !== 'function' || Map.prototype == null || typeof Map.prototype.forEach !== 'function' || typeof Set !== 'function' || Set.prototype == null || typeof Set.prototype.clear !== 'function' || typeof Set.prototype.forEach !== 'function') {
+    warning_1(false, 'React depends on Map and Set built-in types. Make sure that you load a ' + 'polyfill in older browsers. https://fb.me/react-polyfills');
+  }
+
+  topLevelUpdateWarnings = function (container) {
+    if (container._reactRootContainer && container.nodeType !== COMMENT_NODE) {
+      var hostInstance = DOMRenderer.findHostInstanceWithNoPortals(container._reactRootContainer._internalRoot.current);
+      if (hostInstance) {
+        warning_1(hostInstance.parentNode === container, 'render(...): It looks like the React-rendered content of this ' + 'container was removed without using React. This is not ' + 'supported and will cause errors. Instead, call ' + 'ReactDOM.unmountComponentAtNode to empty a container.');
+      }
+    }
+
+    var isRootRenderedBySomeReact = !!container._reactRootContainer;
+    var rootEl = getReactRootElementInContainer(container);
+    var hasNonRootReactChild = !!(rootEl && getInstanceFromNode$1(rootEl));
+
+    warning_1(!hasNonRootReactChild || isRootRenderedBySomeReact, 'render(...): Replacing React-rendered children with a new root ' + 'component. If you intended to update the children of this node, ' + 'you should instead have the existing children update their state ' + 'and render the new components instead of calling ReactDOM.render.');
+
+    warning_1(container.nodeType !== ELEMENT_NODE || !container.tagName || container.tagName.toUpperCase() !== 'BODY', 'render(): Rendering components directly into document.body is ' + 'discouraged, since its children are often manipulated by third-party ' + 'scripts and browser extensions. This may lead to subtle ' + 'reconciliation issues. Try rendering into a container element created ' + 'for your app.');
+  };
+
+  warnOnInvalidCallback = function (callback, callerName) {
+    warning_1(callback === null || typeof callback === 'function', '%s(...): Expected the last optional `callback` argument to be a ' + 'function. Instead received: %s.', callerName, callback);
+  };
+}
+
+injection$2.injectFiberControlledHostComponent(ReactDOMFiberComponent);
+
+var eventsEnabled = null;
+var selectionInformation = null;
+
+function ReactBatch(root) {
+  var expirationTime = DOMRenderer.computeUniqueAsyncExpiration();
+  this._expirationTime = expirationTime;
+  this._root = root;
+  this._next = null;
+  this._callbacks = null;
+  this._didComplete = false;
+  this._hasChildren = false;
+  this._children = null;
+  this._defer = true;
+}
+ReactBatch.prototype.render = function (children) {
+  !this._defer ? invariant_1(false, 'batch.render: Cannot render a batch that already committed.') : void 0;
+  this._hasChildren = true;
+  this._children = children;
+  var internalRoot = this._root._internalRoot;
+  var expirationTime = this._expirationTime;
+  var work = new ReactWork();
+  DOMRenderer.updateContainerAtExpirationTime(children, internalRoot, null, expirationTime, work._onCommit);
+  return work;
+};
+ReactBatch.prototype.then = function (onComplete) {
+  if (this._didComplete) {
+    onComplete();
+    return;
+  }
+  var callbacks = this._callbacks;
+  if (callbacks === null) {
+    callbacks = this._callbacks = [];
+  }
+  callbacks.push(onComplete);
+};
+ReactBatch.prototype.commit = function () {
+  var internalRoot = this._root._internalRoot;
+  var firstBatch = internalRoot.firstBatch;
+  !(this._defer && firstBatch !== null) ? invariant_1(false, 'batch.commit: Cannot commit a batch multiple times.') : void 0;
+
+  if (!this._hasChildren) {
+    // This batch is empty. Return.
+    this._next = null;
+    this._defer = false;
+    return;
+  }
+
+  var expirationTime = this._expirationTime;
+
+  // Ensure this is the first batch in the list.
+  if (firstBatch !== this) {
+    // This batch is not the earliest batch. We need to move it to the front.
+    // Update its expiration time to be the expiration time of the earliest
+    // batch, so that we can flush it without flushing the other batches.
+    if (this._hasChildren) {
+      expirationTime = this._expirationTime = firstBatch._expirationTime;
+      // Rendering this batch again ensures its children will be the final state
+      // when we flush (updates are processed in insertion order: last
+      // update wins).
+      // TODO: This forces a restart. Should we print a warning?
+      this.render(this._children);
+    }
+
+    // Remove the batch from the list.
+    var previous = null;
+    var batch = firstBatch;
+    while (batch !== this) {
+      previous = batch;
+      batch = batch._next;
+    }
+    !(previous !== null) ? invariant_1(false, 'batch.commit: Cannot commit a batch multiple times.') : void 0;
+    previous._next = batch._next;
+
+    // Add it to the front.
+    this._next = firstBatch;
+    firstBatch = internalRoot.firstBatch = this;
+  }
+
+  // Synchronously flush all the work up to this batch's expiration time.
+  this._defer = false;
+  DOMRenderer.flushRoot(internalRoot, expirationTime);
+
+  // Pop the batch from the list.
+  var next = this._next;
+  this._next = null;
+  firstBatch = internalRoot.firstBatch = next;
+
+  // Append the next earliest batch's children to the update queue.
+  if (firstBatch !== null && firstBatch._hasChildren) {
+    firstBatch.render(firstBatch._children);
+  }
+};
+ReactBatch.prototype._onComplete = function () {
+  if (this._didComplete) {
+    return;
+  }
+  this._didComplete = true;
+  var callbacks = this._callbacks;
+  if (callbacks === null) {
+    return;
+  }
+  // TODO: Error handling.
+  for (var i = 0; i < callbacks.length; i++) {
+    var _callback = callbacks[i];
+    _callback();
+  }
+};
+
+function ReactWork() {
+  this._callbacks = null;
+  this._didCommit = false;
+  // TODO: Avoid need to bind by replacing callbacks in the update queue with
+  // list of Work objects.
+  this._onCommit = this._onCommit.bind(this);
+}
+ReactWork.prototype.then = function (onCommit) {
+  if (this._didCommit) {
+    onCommit();
+    return;
+  }
+  var callbacks = this._callbacks;
+  if (callbacks === null) {
+    callbacks = this._callbacks = [];
+  }
+  callbacks.push(onCommit);
+};
+ReactWork.prototype._onCommit = function () {
+  if (this._didCommit) {
+    return;
+  }
+  this._didCommit = true;
+  var callbacks = this._callbacks;
+  if (callbacks === null) {
+    return;
+  }
+  // TODO: Error handling.
+  for (var i = 0; i < callbacks.length; i++) {
+    var _callback2 = callbacks[i];
+    !(typeof _callback2 === 'function') ? invariant_1(false, 'Invalid argument passed as callback. Expected a function. Instead received: %s', _callback2) : void 0;
+    _callback2();
+  }
+};
+
+function ReactRoot(container, isAsync, hydrate) {
+  var root = DOMRenderer.createContainer(container, isAsync, hydrate);
+  this._internalRoot = root;
+}
+ReactRoot.prototype.render = function (children, callback) {
+  var root = this._internalRoot;
+  var work = new ReactWork();
+  callback = callback === undefined ? null : callback;
+  {
+    warnOnInvalidCallback(callback, 'render');
+  }
+  if (callback !== null) {
+    work.then(callback);
+  }
+  DOMRenderer.updateContainer(children, root, null, work._onCommit);
+  return work;
+};
+ReactRoot.prototype.unmount = function (callback) {
+  var root = this._internalRoot;
+  var work = new ReactWork();
+  callback = callback === undefined ? null : callback;
+  {
+    warnOnInvalidCallback(callback, 'render');
+  }
+  if (callback !== null) {
+    work.then(callback);
+  }
+  DOMRenderer.updateContainer(null, root, null, work._onCommit);
+  return work;
+};
+ReactRoot.prototype.legacy_renderSubtreeIntoContainer = function (parentComponent, children, callback) {
+  var root = this._internalRoot;
+  var work = new ReactWork();
+  callback = callback === undefined ? null : callback;
+  {
+    warnOnInvalidCallback(callback, 'render');
+  }
+  if (callback !== null) {
+    work.then(callback);
+  }
+  DOMRenderer.updateContainer(children, root, parentComponent, work._onCommit);
+  return work;
+};
+ReactRoot.prototype.createBatch = function () {
+  var batch = new ReactBatch(this);
+  var expirationTime = batch._expirationTime;
+
+  var internalRoot = this._internalRoot;
+  var firstBatch = internalRoot.firstBatch;
+  if (firstBatch === null) {
+    internalRoot.firstBatch = batch;
+    batch._next = null;
+  } else {
+    // Insert sorted by expiration time then insertion order
+    var insertAfter = null;
+    var insertBefore = firstBatch;
+    while (insertBefore !== null && insertBefore._expirationTime <= expirationTime) {
+      insertAfter = insertBefore;
+      insertBefore = insertBefore._next;
+    }
+    batch._next = insertBefore;
+    if (insertAfter !== null) {
+      insertAfter._next = batch;
+    }
+  }
+
+  return batch;
+};
+
+/**
+ * True if the supplied DOM node is a valid node element.
+ *
+ * @param {?DOMElement} node The candidate DOM node.
+ * @return {boolean} True if the DOM is a valid DOM node.
+ * @internal
+ */
+function isValidContainer(node) {
+  return !!(node && (node.nodeType === ELEMENT_NODE || node.nodeType === DOCUMENT_NODE || node.nodeType === DOCUMENT_FRAGMENT_NODE || node.nodeType === COMMENT_NODE && node.nodeValue === ' react-mount-point-unstable '));
+}
+
+function getReactRootElementInContainer(container) {
+  if (!container) {
+    return null;
+  }
+
+  if (container.nodeType === DOCUMENT_NODE) {
+    return container.documentElement;
+  } else {
+    return container.firstChild;
+  }
+}
+
+function shouldHydrateDueToLegacyHeuristic(container) {
+  var rootElement = getReactRootElementInContainer(container);
+  return !!(rootElement && rootElement.nodeType === ELEMENT_NODE && rootElement.hasAttribute(ROOT_ATTRIBUTE_NAME));
+}
+
+function shouldAutoFocusHostComponent(type, props) {
+  switch (type) {
+    case 'button':
+    case 'input':
+    case 'select':
+    case 'textarea':
+      return !!props.autoFocus;
+  }
+  return false;
+}
+
+var DOMRenderer = reactReconciler({
+  getRootHostContext: function (rootContainerInstance) {
+    var type = void 0;
+    var namespace = void 0;
+    var nodeType = rootContainerInstance.nodeType;
+    switch (nodeType) {
+      case DOCUMENT_NODE:
+      case DOCUMENT_FRAGMENT_NODE:
+        {
+          type = nodeType === DOCUMENT_NODE ? '#document' : '#fragment';
+          var root = rootContainerInstance.documentElement;
+          namespace = root ? root.namespaceURI : getChildNamespace(null, '');
+          break;
+        }
+      default:
+        {
+          var container = nodeType === COMMENT_NODE ? rootContainerInstance.parentNode : rootContainerInstance;
+          var ownNamespace = container.namespaceURI || null;
+          type = container.tagName;
+          namespace = getChildNamespace(ownNamespace, type);
+          break;
+        }
+    }
+    {
+      var validatedTag = type.toLowerCase();
+      var _ancestorInfo = updatedAncestorInfo(null, validatedTag, null);
+      return { namespace: namespace, ancestorInfo: _ancestorInfo };
+    }
+    return namespace;
+  },
+  getChildHostContext: function (parentHostContext, type) {
+    {
+      var parentHostContextDev = parentHostContext;
+      var _namespace = getChildNamespace(parentHostContextDev.namespace, type);
+      var _ancestorInfo2 = updatedAncestorInfo(parentHostContextDev.ancestorInfo, type, null);
+      return { namespace: _namespace, ancestorInfo: _ancestorInfo2 };
+    }
+    var parentNamespace = parentHostContext;
+    return getChildNamespace(parentNamespace, type);
+  },
+  getPublicInstance: function (instance) {
+    return instance;
+  },
+  prepareForCommit: function () {
+    eventsEnabled = isEnabled();
+    selectionInformation = getSelectionInformation();
+    setEnabled(false);
+  },
+  resetAfterCommit: function () {
+    restoreSelection(selectionInformation);
+    selectionInformation = null;
+    setEnabled(eventsEnabled);
+    eventsEnabled = null;
+  },
+  createInstance: function (type, props, rootContainerInstance, hostContext, internalInstanceHandle) {
+    var parentNamespace = void 0;
+    {
+      // TODO: take namespace into account when validating.
+      var hostContextDev = hostContext;
+      validateDOMNesting$1(type, null, hostContextDev.ancestorInfo);
+      if (typeof props.children === 'string' || typeof props.children === 'number') {
+        var string = '' + props.children;
+        var ownAncestorInfo = updatedAncestorInfo(hostContextDev.ancestorInfo, type, null);
+        validateDOMNesting$1(null, string, ownAncestorInfo);
+      }
+      parentNamespace = hostContextDev.namespace;
+    }
+    var domElement = createElement(type, props, rootContainerInstance, parentNamespace);
+    precacheFiberNode(internalInstanceHandle, domElement);
+    updateFiberProps(domElement, props);
+    return domElement;
+  },
+  appendInitialChild: function (parentInstance, child) {
+    parentInstance.appendChild(child);
+  },
+  finalizeInitialChildren: function (domElement, type, props, rootContainerInstance) {
+    setInitialProperties(domElement, type, props, rootContainerInstance);
+    return shouldAutoFocusHostComponent(type, props);
+  },
+  prepareUpdate: function (domElement, type, oldProps, newProps, rootContainerInstance, hostContext) {
+    {
+      var hostContextDev = hostContext;
+      if (typeof newProps.children !== typeof oldProps.children && (typeof newProps.children === 'string' || typeof newProps.children === 'number')) {
+        var string = '' + newProps.children;
+        var ownAncestorInfo = updatedAncestorInfo(hostContextDev.ancestorInfo, type, null);
+        validateDOMNesting$1(null, string, ownAncestorInfo);
+      }
+    }
+    return diffProperties(domElement, type, oldProps, newProps, rootContainerInstance);
+  },
+  shouldSetTextContent: function (type, props) {
+    return type === 'textarea' || typeof props.children === 'string' || typeof props.children === 'number' || typeof props.dangerouslySetInnerHTML === 'object' && props.dangerouslySetInnerHTML !== null && typeof props.dangerouslySetInnerHTML.__html === 'string';
+  },
+  shouldDeprioritizeSubtree: function (type, props) {
+    return !!props.hidden;
+  },
+  createTextInstance: function (text, rootContainerInstance, hostContext, internalInstanceHandle) {
+    {
+      var hostContextDev = hostContext;
+      validateDOMNesting$1(null, text, hostContextDev.ancestorInfo);
+    }
+    var textNode = createTextNode(text, rootContainerInstance);
+    precacheFiberNode(internalInstanceHandle, textNode);
+    return textNode;
+  },
+
+
+  now: now,
+
+  mutation: {
+    commitMount: function (domElement, type, newProps, internalInstanceHandle) {
+      // Despite the naming that might imply otherwise, this method only
+      // fires if there is an `Update` effect scheduled during mounting.
+      // This happens if `finalizeInitialChildren` returns `true` (which it
+      // does to implement the `autoFocus` attribute on the client). But
+      // there are also other cases when this might happen (such as patching
+      // up text content during hydration mismatch). So we'll check this again.
+      if (shouldAutoFocusHostComponent(type, newProps)) {
+        domElement.focus();
+      }
+    },
+    commitUpdate: function (domElement, updatePayload, type, oldProps, newProps, internalInstanceHandle) {
+      // Update the props handle so that we know which props are the ones with
+      // with current event handlers.
+      updateFiberProps(domElement, newProps);
+      // Apply the diff to the DOM node.
+      updateProperties(domElement, updatePayload, type, oldProps, newProps);
+    },
+    resetTextContent: function (domElement) {
+      setTextContent(domElement, '');
+    },
+    commitTextUpdate: function (textInstance, oldText, newText) {
+      textInstance.nodeValue = newText;
+    },
+    appendChild: function (parentInstance, child) {
+      parentInstance.appendChild(child);
+    },
+    appendChildToContainer: function (container, child) {
+      if (container.nodeType === COMMENT_NODE) {
+        container.parentNode.insertBefore(child, container);
+      } else {
+        container.appendChild(child);
+      }
+    },
+    insertBefore: function (parentInstance, child, beforeChild) {
+      parentInstance.insertBefore(child, beforeChild);
+    },
+    insertInContainerBefore: function (container, child, beforeChild) {
+      if (container.nodeType === COMMENT_NODE) {
+        container.parentNode.insertBefore(child, beforeChild);
+      } else {
+        container.insertBefore(child, beforeChild);
+      }
+    },
+    removeChild: function (parentInstance, child) {
+      parentInstance.removeChild(child);
+    },
+    removeChildFromContainer: function (container, child) {
+      if (container.nodeType === COMMENT_NODE) {
+        container.parentNode.removeChild(child);
+      } else {
+        container.removeChild(child);
+      }
+    }
+  },
+
+  hydration: {
+    canHydrateInstance: function (instance, type, props) {
+      if (instance.nodeType !== ELEMENT_NODE || type.toLowerCase() !== instance.nodeName.toLowerCase()) {
+        return null;
+      }
+      // This has now been refined to an element node.
+      return instance;
+    },
+    canHydrateTextInstance: function (instance, text) {
+      if (text === '' || instance.nodeType !== TEXT_NODE) {
+        // Empty strings are not parsed by HTML so there won't be a correct match here.
+        return null;
+      }
+      // This has now been refined to a text node.
+      return instance;
+    },
+    getNextHydratableSibling: function (instance) {
+      var node = instance.nextSibling;
+      // Skip non-hydratable nodes.
+      while (node && node.nodeType !== ELEMENT_NODE && node.nodeType !== TEXT_NODE) {
+        node = node.nextSibling;
+      }
+      return node;
+    },
+    getFirstHydratableChild: function (parentInstance) {
+      var next = parentInstance.firstChild;
+      // Skip non-hydratable nodes.
+      while (next && next.nodeType !== ELEMENT_NODE && next.nodeType !== TEXT_NODE) {
+        next = next.nextSibling;
+      }
+      return next;
+    },
+    hydrateInstance: function (instance, type, props, rootContainerInstance, hostContext, internalInstanceHandle) {
+      precacheFiberNode(internalInstanceHandle, instance);
+      // TODO: Possibly defer this until the commit phase where all the events
+      // get attached.
+      updateFiberProps(instance, props);
+      var parentNamespace = void 0;
+      {
+        var hostContextDev = hostContext;
+        parentNamespace = hostContextDev.namespace;
+      }
+      return diffHydratedProperties(instance, type, props, parentNamespace, rootContainerInstance);
+    },
+    hydrateTextInstance: function (textInstance, text, internalInstanceHandle) {
+      precacheFiberNode(internalInstanceHandle, textInstance);
+      return diffHydratedText(textInstance, text);
+    },
+    didNotMatchHydratedContainerTextInstance: function (parentContainer, textInstance, text) {
+      {
+        warnForUnmatchedText(textInstance, text);
+      }
+    },
+    didNotMatchHydratedTextInstance: function (parentType, parentProps, parentInstance, textInstance, text) {
+      if (true && parentProps[SUPPRESS_HYDRATION_WARNING] !== true) {
+        warnForUnmatchedText(textInstance, text);
+      }
+    },
+    didNotHydrateContainerInstance: function (parentContainer, instance) {
+      {
+        if (instance.nodeType === 1) {
+          warnForDeletedHydratableElement(parentContainer, instance);
+        } else {
+          warnForDeletedHydratableText(parentContainer, instance);
+        }
+      }
+    },
+    didNotHydrateInstance: function (parentType, parentProps, parentInstance, instance) {
+      if (true && parentProps[SUPPRESS_HYDRATION_WARNING] !== true) {
+        if (instance.nodeType === 1) {
+          warnForDeletedHydratableElement(parentInstance, instance);
+        } else {
+          warnForDeletedHydratableText(parentInstance, instance);
+        }
+      }
+    },
+    didNotFindHydratableContainerInstance: function (parentContainer, type, props) {
+      {
+        warnForInsertedHydratedElement(parentContainer, type, props);
+      }
+    },
+    didNotFindHydratableContainerTextInstance: function (parentContainer, text) {
+      {
+        warnForInsertedHydratedText(parentContainer, text);
+      }
+    },
+    didNotFindHydratableInstance: function (parentType, parentProps, parentInstance, type, props) {
+      if (true && parentProps[SUPPRESS_HYDRATION_WARNING] !== true) {
+        warnForInsertedHydratedElement(parentInstance, type, props);
+      }
+    },
+    didNotFindHydratableTextInstance: function (parentType, parentProps, parentInstance, text) {
+      if (true && parentProps[SUPPRESS_HYDRATION_WARNING] !== true) {
+        warnForInsertedHydratedText(parentInstance, text);
+      }
+    }
+  },
+
+  scheduleDeferredCallback: rIC,
+  cancelDeferredCallback: cIC
+});
+
+injection$3.injectRenderer(DOMRenderer);
+
+var warnedAboutHydrateAPI = false;
+
+function legacyCreateRootFromDOMContainer(container, forceHydrate) {
+  var shouldHydrate = forceHydrate || shouldHydrateDueToLegacyHeuristic(container);
+  // First clear any existing content.
+  if (!shouldHydrate) {
+    var warned = false;
+    var rootSibling = void 0;
+    while (rootSibling = container.lastChild) {
+      {
+        if (!warned && rootSibling.nodeType === ELEMENT_NODE && rootSibling.hasAttribute(ROOT_ATTRIBUTE_NAME)) {
+          warned = true;
+          warning_1(false, 'render(): Target node has markup rendered by React, but there ' + 'are unrelated nodes as well. This is most commonly caused by ' + 'white-space inserted around server-rendered markup.');
+        }
+      }
+      container.removeChild(rootSibling);
+    }
+  }
+  {
+    if (shouldHydrate && !forceHydrate && !warnedAboutHydrateAPI) {
+      warnedAboutHydrateAPI = true;
+      lowPriorityWarning$1(false, 'render(): Calling ReactDOM.render() to hydrate server-rendered markup ' + 'will stop working in React v17. Replace the ReactDOM.render() call ' + 'with ReactDOM.hydrate() if you want React to attach to the server HTML.');
+    }
+  }
+  // Legacy roots are not async by default.
+  var isAsync = false;
+  return new ReactRoot(container, isAsync, shouldHydrate);
+}
+
+function legacyRenderSubtreeIntoContainer(parentComponent, children, container, forceHydrate, callback) {
+  // TODO: Ensure all entry points contain this check
+  !isValidContainer(container) ? invariant_1(false, 'Target container is not a DOM element.') : void 0;
+
+  {
+    topLevelUpdateWarnings(container);
+  }
+
+  // TODO: Without `any` type, Flow says "Property cannot be accessed on any
+  // member of intersection type." Whyyyyyy.
+  var root = container._reactRootContainer;
+  if (!root) {
+    // Initial mount
+    root = container._reactRootContainer = legacyCreateRootFromDOMContainer(container, forceHydrate);
+    if (typeof callback === 'function') {
+      var originalCallback = callback;
+      callback = function () {
+        var instance = DOMRenderer.getPublicRootInstance(root._internalRoot);
+        originalCallback.call(instance);
+      };
+    }
+    // Initial mount should not be batched.
+    DOMRenderer.unbatchedUpdates(function () {
+      if (parentComponent != null) {
+        root.legacy_renderSubtreeIntoContainer(parentComponent, children, callback);
+      } else {
+        root.render(children, callback);
+      }
+    });
+  } else {
+    if (typeof callback === 'function') {
+      var _originalCallback = callback;
+      callback = function () {
+        var instance = DOMRenderer.getPublicRootInstance(root._internalRoot);
+        _originalCallback.call(instance);
+      };
+    }
+    // Update
+    if (parentComponent != null) {
+      root.legacy_renderSubtreeIntoContainer(parentComponent, children, callback);
+    } else {
+      root.render(children, callback);
+    }
+  }
+  return DOMRenderer.getPublicRootInstance(root._internalRoot);
+}
+
+function createPortal(children, container) {
+  var key = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;
+
+  !isValidContainer(container) ? invariant_1(false, 'Target container is not a DOM element.') : void 0;
+  // TODO: pass ReactDOM portal implementation as third argument
+  return createPortal$1(children, container, null, key);
+}
+
+var ReactDOM = {
+  createPortal: createPortal,
+
+  findDOMNode: function (componentOrElement) {
+    {
+      var owner = ReactCurrentOwner.current;
+      if (owner !== null && owner.stateNode !== null) {
+        var warnedAboutRefsInRender = owner.stateNode._warnedAboutRefsInRender;
+        warning_1(warnedAboutRefsInRender, '%s is accessing findDOMNode inside its render(). ' + 'render() should be a pure function of props and state. It should ' + 'never access something that requires stale data from the previous ' + 'render, such as refs. Move this logic to componentDidMount and ' + 'componentDidUpdate instead.', getComponentName(owner) || 'A component');
+        owner.stateNode._warnedAboutRefsInRender = true;
+      }
+    }
+    if (componentOrElement == null) {
+      return null;
+    }
+    if (componentOrElement.nodeType === ELEMENT_NODE) {
+      return componentOrElement;
+    }
+
+    var inst = get(componentOrElement);
+    if (inst) {
+      return DOMRenderer.findHostInstance(inst);
+    }
+
+    if (typeof componentOrElement.render === 'function') {
+      invariant_1(false, 'Unable to find node on an unmounted component.');
+    } else {
+      invariant_1(false, 'Element appears to be neither ReactComponent nor DOMNode. Keys: %s', Object.keys(componentOrElement));
+    }
+  },
+  hydrate: function (element, container, callback) {
+    // TODO: throw or warn if we couldn't hydrate?
+    return legacyRenderSubtreeIntoContainer(null, element, container, true, callback);
+  },
+  render: function (element, container, callback) {
+    return legacyRenderSubtreeIntoContainer(null, element, container, false, callback);
+  },
+  unstable_renderSubtreeIntoContainer: function (parentComponent, element, containerNode, callback) {
+    !(parentComponent != null && has(parentComponent)) ? invariant_1(false, 'parentComponent must be a valid React Component') : void 0;
+    return legacyRenderSubtreeIntoContainer(parentComponent, element, containerNode, false, callback);
+  },
+  unmountComponentAtNode: function (container) {
+    !isValidContainer(container) ? invariant_1(false, 'unmountComponentAtNode(...): Target container is not a DOM element.') : void 0;
+
+    if (container._reactRootContainer) {
+      {
+        var rootEl = getReactRootElementInContainer(container);
+        var renderedByDifferentReact = rootEl && !getInstanceFromNode$1(rootEl);
+        warning_1(!renderedByDifferentReact, "unmountComponentAtNode(): The node you're attempting to unmount " + 'was rendered by another copy of React.');
+      }
+
+      // Unmount should not be batched.
+      DOMRenderer.unbatchedUpdates(function () {
+        legacyRenderSubtreeIntoContainer(null, null, container, false, function () {
+          container._reactRootContainer = null;
+        });
+      });
+      // If you call unmountComponentAtNode twice in quick succession, you'll
+      // get `true` twice. That's probably fine?
+      return true;
+    } else {
+      {
+        var _rootEl = getReactRootElementInContainer(container);
+        var hasNonRootReactChild = !!(_rootEl && getInstanceFromNode$1(_rootEl));
+
+        // Check if the container itself is a React root node.
+        var isContainerReactRoot = container.nodeType === 1 && isValidContainer(container.parentNode) && !!container.parentNode._reactRootContainer;
+
+        warning_1(!hasNonRootReactChild, "unmountComponentAtNode(): The node you're attempting to unmount " + 'was rendered by React and is not a top-level container. %s', isContainerReactRoot ? 'You may have accidentally passed in a React root node instead ' + 'of its container.' : 'Instead, have the parent component update its state and ' + 'rerender in order to remove this component.');
+      }
+
+      return false;
+    }
+  },
+
+
+  // Temporary alias since we already shipped React 16 RC with it.
+  // TODO: remove in React 17.
+  unstable_createPortal: function () {
+    if (!didWarnAboutUnstableCreatePortal) {
+      didWarnAboutUnstableCreatePortal = true;
+      lowPriorityWarning$1(false, 'The ReactDOM.unstable_createPortal() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactDOM.createPortal() instead. It has the exact same API, ' + 'but without the "unstable_" prefix.');
+    }
+    return createPortal.apply(undefined, arguments);
+  },
+
+
+  unstable_batchedUpdates: DOMRenderer.batchedUpdates,
+
+  unstable_deferredUpdates: DOMRenderer.deferredUpdates,
+
+  flushSync: DOMRenderer.flushSync,
+
+  unstable_flushControlled: DOMRenderer.flushControlled,
+
+  __SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED: {
+    // For TapEventPlugin which is popular in open source
+    EventPluginHub: EventPluginHub,
+    // Used by test-utils
+    EventPluginRegistry: EventPluginRegistry,
+    EventPropagators: EventPropagators,
+    ReactControlledComponent: ReactControlledComponent,
+    ReactDOMComponentTree: ReactDOMComponentTree,
+    ReactDOMEventListener: ReactDOMEventListener
+  }
+};
+
+ReactDOM.unstable_createRoot = function createRoot(container, options) {
+  var hydrate = options != null && options.hydrate === true;
+  return new ReactRoot(container, true, hydrate);
+};
+
+var foundDevTools = DOMRenderer.injectIntoDevTools({
+  findFiberByHostInstance: getClosestInstanceFromNode,
+  bundleType: 1,
+  version: ReactVersion,
+  rendererPackageName: 'react-dom'
+});
+
+{
+  if (!foundDevTools && ExecutionEnvironment_1.canUseDOM && window.top === window.self) {
+    // If we're in Chrome or Firefox, provide a download link if not installed.
+    if (navigator.userAgent.indexOf('Chrome') > -1 && navigator.userAgent.indexOf('Edge') === -1 || navigator.userAgent.indexOf('Firefox') > -1) {
+      var protocol = window.location.protocol;
+      // Don't warn in exotic cases like chrome-extension://.
+      if (/^(https?|file):$/.test(protocol)) {
+        console.info('%cDownload the React DevTools ' + 'for a better development experience: ' + 'https://fb.me/react-devtools' + (protocol === 'file:' ? '\nYou might need to use a local HTTP server (instead of file://): ' + 'https://fb.me/react-devtools-faq' : ''), 'font-weight:bold');
+      }
+    }
+  }
+}
+
+
+
+var ReactDOM$2 = Object.freeze({
+	default: ReactDOM
+});
+
+var ReactDOM$3 = ( ReactDOM$2 && ReactDOM ) || ReactDOM$2;
+
+// TODO: decide on the top-level export form.
+// This is hacky but makes it work with both Rollup and Jest.
+var reactDom = ReactDOM$3['default'] ? ReactDOM$3['default'] : ReactDOM$3;
+
+return reactDom;
+
+})));
diff --git a/js/cljsjs/react/production/react.min.inc.js b/js/cljsjs/react/production/react.min.inc.js
new file mode 100644
index 0000000..6760221
--- /dev/null
+++ b/js/cljsjs/react/production/react.min.inc.js
@@ -0,0 +1,1740 @@
+/** @license React v16.3.0
+ * react.development.js
+ *
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+'use strict';
+
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
+	typeof define === 'function' && define.amd ? define(factory) :
+	(global.React = factory());
+}(this, (function () { 'use strict';
+
+/*
+object-assign
+(c) Sindre Sorhus
+@license MIT
+*/
+
+
+/* eslint-disable no-unused-vars */
+var getOwnPropertySymbols = Object.getOwnPropertySymbols;
+var hasOwnProperty = Object.prototype.hasOwnProperty;
+var propIsEnumerable = Object.prototype.propertyIsEnumerable;
+
+function toObject(val) {
+	if (val === null || val === undefined) {
+		throw new TypeError('Object.assign cannot be called with null or undefined');
+	}
+
+	return Object(val);
+}
+
+function shouldUseNative() {
+	try {
+		if (!Object.assign) {
+			return false;
+		}
+
+		// Detect buggy property enumeration order in older V8 versions.
+
+		// https://bugs.chromium.org/p/v8/issues/detail?id=4118
+		var test1 = new String('abc');  // eslint-disable-line no-new-wrappers
+		test1[5] = 'de';
+		if (Object.getOwnPropertyNames(test1)[0] === '5') {
+			return false;
+		}
+
+		// https://bugs.chromium.org/p/v8/issues/detail?id=3056
+		var test2 = {};
+		for (var i = 0; i < 10; i++) {
+			test2['_' + String.fromCharCode(i)] = i;
+		}
+		var order2 = Object.getOwnPropertyNames(test2).map(function (n) {
+			return test2[n];
+		});
+		if (order2.join('') !== '0123456789') {
+			return false;
+		}
+
+		// https://bugs.chromium.org/p/v8/issues/detail?id=3056
+		var test3 = {};
+		'abcdefghijklmnopqrst'.split('').forEach(function (letter) {
+			test3[letter] = letter;
+		});
+		if (Object.keys(Object.assign({}, test3)).join('') !==
+				'abcdefghijklmnopqrst') {
+			return false;
+		}
+
+		return true;
+	} catch (err) {
+		// We don't expect any of the above to throw, but better to be safe.
+		return false;
+	}
+}
+
+var objectAssign = shouldUseNative() ? Object.assign : function (target, source) {
+	var from;
+	var to = toObject(target);
+	var symbols;
+
+	for (var s = 1; s < arguments.length; s++) {
+		from = Object(arguments[s]);
+
+		for (var key in from) {
+			if (hasOwnProperty.call(from, key)) {
+				to[key] = from[key];
+			}
+		}
+
+		if (getOwnPropertySymbols) {
+			symbols = getOwnPropertySymbols(from);
+			for (var i = 0; i < symbols.length; i++) {
+				if (propIsEnumerable.call(from, symbols[i])) {
+					to[symbols[i]] = from[symbols[i]];
+				}
+			}
+		}
+	}
+
+	return to;
+};
+
+// TODO: this is special because it gets imported during build.
+
+var ReactVersion = '16.3.0';
+
+// The Symbol used to tag the ReactElement-like types. If there is no native Symbol
+// nor polyfill, then a plain number is used for performance.
+var hasSymbol = typeof Symbol === 'function' && Symbol['for'];
+
+var REACT_ELEMENT_TYPE = hasSymbol ? Symbol['for']('react.element') : 0xeac7;
+var REACT_CALL_TYPE = hasSymbol ? Symbol['for']('react.call') : 0xeac8;
+var REACT_RETURN_TYPE = hasSymbol ? Symbol['for']('react.return') : 0xeac9;
+var REACT_PORTAL_TYPE = hasSymbol ? Symbol['for']('react.portal') : 0xeaca;
+var REACT_FRAGMENT_TYPE = hasSymbol ? Symbol['for']('react.fragment') : 0xeacb;
+var REACT_STRICT_MODE_TYPE = hasSymbol ? Symbol['for']('react.strict_mode') : 0xeacc;
+var REACT_PROVIDER_TYPE = hasSymbol ? Symbol['for']('react.provider') : 0xeacd;
+var REACT_CONTEXT_TYPE = hasSymbol ? Symbol['for']('react.context') : 0xeace;
+var REACT_ASYNC_MODE_TYPE = hasSymbol ? Symbol['for']('react.async_mode') : 0xeacf;
+var REACT_FORWARD_REF_TYPE = hasSymbol ? Symbol['for']('react.forward_ref') : 0xead0;
+
+var MAYBE_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;
+var FAUX_ITERATOR_SYMBOL = '@@iterator';
+
+function getIteratorFn(maybeIterable) {
+  if (maybeIterable === null || typeof maybeIterable === 'undefined') {
+    return null;
+  }
+  var maybeIterator = MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL];
+  if (typeof maybeIterator === 'function') {
+    return maybeIterator;
+  }
+  return null;
+}
+
+/**
+ * WARNING: DO NOT manually require this module.
+ * This is a replacement for `invariant(...)` used by the error code system
+ * and will _only_ be required by the corresponding babel pass.
+ * It always throws.
+ */
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+var emptyObject = {};
+
+{
+  Object.freeze(emptyObject);
+}
+
+var emptyObject_1 = emptyObject;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+/**
+ * Use invariant() to assert state which your program assumes to be true.
+ *
+ * Provide sprintf-style format (only %s is supported) and arguments
+ * to provide information about what broke and what you were
+ * expecting.
+ *
+ * The invariant message will be stripped in production, but the invariant
+ * will remain to ensure logic does not differ in production.
+ */
+
+var validateFormat = function validateFormat(format) {};
+
+{
+  validateFormat = function validateFormat(format) {
+    if (format === undefined) {
+      throw new Error('invariant requires an error message argument');
+    }
+  };
+}
+
+function invariant(condition, format, a, b, c, d, e, f) {
+  validateFormat(format);
+
+  if (!condition) {
+    var error;
+    if (format === undefined) {
+      error = new Error('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.');
+    } else {
+      var args = [a, b, c, d, e, f];
+      var argIndex = 0;
+      error = new Error(format.replace(/%s/g, function () {
+        return args[argIndex++];
+      }));
+      error.name = 'Invariant Violation';
+    }
+
+    error.framesToPop = 1; // we don't care about invariant's own frame
+    throw error;
+  }
+}
+
+var invariant_1 = invariant;
+
+/**
+ * Forked from fbjs/warning:
+ * https://github.com/facebook/fbjs/blob/e66ba20ad5be433eb54423f2b097d829324d9de6/packages/fbjs/src/__forks__/warning.js
+ *
+ * Only change is we use console.warn instead of console.error,
+ * and do nothing when 'console' is not supported.
+ * This really simplifies the code.
+ * ---
+ * Similar to invariant but only logs a warning if the condition is not met.
+ * This can be used to log issues in development environments in critical
+ * paths. Removing the logging code for production environments will keep the
+ * same logic and follow the same code paths.
+ */
+
+var lowPriorityWarning = function () {};
+
+{
+  var printWarning = function (format) {
+    for (var _len = arguments.length, args = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+      args[_key - 1] = arguments[_key];
+    }
+
+    var argIndex = 0;
+    var message = 'Warning: ' + format.replace(/%s/g, function () {
+      return args[argIndex++];
+    });
+    if (typeof console !== 'undefined') {
+      console.warn(message);
+    }
+    try {
+      // --- Welcome to debugging React ---
+      // This error was thrown as a convenience so that you can use this stack
+      // to find the callsite that caused this warning to fire.
+      throw new Error(message);
+    } catch (x) {}
+  };
+
+  lowPriorityWarning = function (condition, format) {
+    if (format === undefined) {
+      throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument');
+    }
+    if (!condition) {
+      for (var _len2 = arguments.length, args = Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) {
+        args[_key2 - 2] = arguments[_key2];
+      }
+
+      printWarning.apply(undefined, [format].concat(args));
+    }
+  };
+}
+
+var lowPriorityWarning$1 = lowPriorityWarning;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * 
+ */
+
+function makeEmptyFunction(arg) {
+  return function () {
+    return arg;
+  };
+}
+
+/**
+ * This function accepts and discards inputs; it has no side effects. This is
+ * primarily useful idiomatically for overridable function endpoints which
+ * always need to be callable, since JS lacks a null-call idiom ala Cocoa.
+ */
+var emptyFunction = function emptyFunction() {};
+
+emptyFunction.thatReturns = makeEmptyFunction;
+emptyFunction.thatReturnsFalse = makeEmptyFunction(false);
+emptyFunction.thatReturnsTrue = makeEmptyFunction(true);
+emptyFunction.thatReturnsNull = makeEmptyFunction(null);
+emptyFunction.thatReturnsThis = function () {
+  return this;
+};
+emptyFunction.thatReturnsArgument = function (arg) {
+  return arg;
+};
+
+var emptyFunction_1 = emptyFunction;
+
+/**
+ * Copyright (c) 2014-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+
+
+
+
+/**
+ * Similar to invariant but only logs a warning if the condition is not met.
+ * This can be used to log issues in development environments in critical
+ * paths. Removing the logging code for production environments will keep the
+ * same logic and follow the same code paths.
+ */
+
+var warning = emptyFunction_1;
+
+{
+  var printWarning$1 = function printWarning(format) {
+    for (var _len = arguments.length, args = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+      args[_key - 1] = arguments[_key];
+    }
+
+    var argIndex = 0;
+    var message = 'Warning: ' + format.replace(/%s/g, function () {
+      return args[argIndex++];
+    });
+    if (typeof console !== 'undefined') {
+      console.error(message);
+    }
+    try {
+      // --- Welcome to debugging React ---
+      // This error was thrown as a convenience so that you can use this stack
+      // to find the callsite that caused this warning to fire.
+      throw new Error(message);
+    } catch (x) {}
+  };
+
+  warning = function warning(condition, format) {
+    if (format === undefined) {
+      throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument');
+    }
+
+    if (format.indexOf('Failed Composite propType: ') === 0) {
+      return; // Ignore CompositeComponent proptype check.
+    }
+
+    if (!condition) {
+      for (var _len2 = arguments.length, args = Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) {
+        args[_key2 - 2] = arguments[_key2];
+      }
+
+      printWarning$1.apply(undefined, [format].concat(args));
+    }
+  };
+}
+
+var warning_1 = warning;
+
+var didWarnStateUpdateForUnmountedComponent = {};
+
+function warnNoop(publicInstance, callerName) {
+  {
+    var _constructor = publicInstance.constructor;
+    var componentName = _constructor && (_constructor.displayName || _constructor.name) || 'ReactClass';
+    var warningKey = componentName + '.' + callerName;
+    if (didWarnStateUpdateForUnmountedComponent[warningKey]) {
+      return;
+    }
+    warning_1(false, '%s(...): Can only update a mounted or mounting component. ' + 'This usually means you called %s() on an unmounted component. ' + 'This is a no-op.\n\nPlease check the code for the %s component.', callerName, callerName, componentName);
+    didWarnStateUpdateForUnmountedComponent[warningKey] = true;
+  }
+}
+
+/**
+ * This is the abstract API for an update queue.
+ */
+var ReactNoopUpdateQueue = {
+  /**
+   * Checks whether or not this composite component is mounted.
+   * @param {ReactClass} publicInstance The instance we want to test.
+   * @return {boolean} True if mounted, false otherwise.
+   * @protected
+   * @final
+   */
+  isMounted: function (publicInstance) {
+    return false;
+  },
+
+  /**
+   * Forces an update. This should only be invoked when it is known with
+   * certainty that we are **not** in a DOM transaction.
+   *
+   * You may want to call this when you know that some deeper aspect of the
+   * component's state has changed but `setState` was not called.
+   *
+   * This will not invoke `shouldComponentUpdate`, but it will invoke
+   * `componentWillUpdate` and `componentDidUpdate`.
+   *
+   * @param {ReactClass} publicInstance The instance that should rerender.
+   * @param {?function} callback Called after component is updated.
+   * @param {?string} callerName name of the calling function in the public API.
+   * @internal
+   */
+  enqueueForceUpdate: function (publicInstance, callback, callerName) {
+    warnNoop(publicInstance, 'forceUpdate');
+  },
+
+  /**
+   * Replaces all of the state. Always use this or `setState` to mutate state.
+   * You should treat `this.state` as immutable.
+   *
+   * There is no guarantee that `this.state` will be immediately updated, so
+   * accessing `this.state` after calling this method may return the old value.
+   *
+   * @param {ReactClass} publicInstance The instance that should rerender.
+   * @param {object} completeState Next state.
+   * @param {?function} callback Called after component is updated.
+   * @param {?string} callerName name of the calling function in the public API.
+   * @internal
+   */
+  enqueueReplaceState: function (publicInstance, completeState, callback, callerName) {
+    warnNoop(publicInstance, 'replaceState');
+  },
+
+  /**
+   * Sets a subset of the state. This only exists because _pendingState is
+   * internal. This provides a merging strategy that is not available to deep
+   * properties which is confusing. TODO: Expose pendingState or don't use it
+   * during the merge.
+   *
+   * @param {ReactClass} publicInstance The instance that should rerender.
+   * @param {object} partialState Next partial state to be merged with state.
+   * @param {?function} callback Called after component is updated.
+   * @param {?string} Name of the calling function in the public API.
+   * @internal
+   */
+  enqueueSetState: function (publicInstance, partialState, callback, callerName) {
+    warnNoop(publicInstance, 'setState');
+  }
+};
+
+/**
+ * Base class helpers for the updating state of a component.
+ */
+function Component(props, context, updater) {
+  this.props = props;
+  this.context = context;
+  this.refs = emptyObject_1;
+  // We initialize the default updater but the real one gets injected by the
+  // renderer.
+  this.updater = updater || ReactNoopUpdateQueue;
+}
+
+Component.prototype.isReactComponent = {};
+
+/**
+ * Sets a subset of the state. Always use this to mutate
+ * state. You should treat `this.state` as immutable.
+ *
+ * There is no guarantee that `this.state` will be immediately updated, so
+ * accessing `this.state` after calling this method may return the old value.
+ *
+ * There is no guarantee that calls to `setState` will run synchronously,
+ * as they may eventually be batched together.  You can provide an optional
+ * callback that will be executed when the call to setState is actually
+ * completed.
+ *
+ * When a function is provided to setState, it will be called at some point in
+ * the future (not synchronously). It will be called with the up to date
+ * component arguments (state, props, context). These values can be different
+ * from this.* because your function may be called after receiveProps but before
+ * shouldComponentUpdate, and this new state, props, and context will not yet be
+ * assigned to this.
+ *
+ * @param {object|function} partialState Next partial state or function to
+ *        produce next partial state to be merged with current state.
+ * @param {?function} callback Called after state is updated.
+ * @final
+ * @protected
+ */
+Component.prototype.setState = function (partialState, callback) {
+  !(typeof partialState === 'object' || typeof partialState === 'function' || partialState == null) ? invariant_1(false, 'setState(...): takes an object of state variables to update or a function which returns an object of state variables.') : void 0;
+  this.updater.enqueueSetState(this, partialState, callback, 'setState');
+};
+
+/**
+ * Forces an update. This should only be invoked when it is known with
+ * certainty that we are **not** in a DOM transaction.
+ *
+ * You may want to call this when you know that some deeper aspect of the
+ * component's state has changed but `setState` was not called.
+ *
+ * This will not invoke `shouldComponentUpdate`, but it will invoke
+ * `componentWillUpdate` and `componentDidUpdate`.
+ *
+ * @param {?function} callback Called after update is complete.
+ * @final
+ * @protected
+ */
+Component.prototype.forceUpdate = function (callback) {
+  this.updater.enqueueForceUpdate(this, callback, 'forceUpdate');
+};
+
+/**
+ * Deprecated APIs. These APIs used to exist on classic React classes but since
+ * we would like to deprecate them, we're not going to move them over to this
+ * modern base class. Instead, we define a getter that warns if it's accessed.
+ */
+{
+  var deprecatedAPIs = {
+    isMounted: ['isMounted', 'Instead, make sure to clean up subscriptions and pending requests in ' + 'componentWillUnmount to prevent memory leaks.'],
+    replaceState: ['replaceState', 'Refactor your code to use setState instead (see ' + 'https://github.com/facebook/react/issues/3236).']
+  };
+  var defineDeprecationWarning = function (methodName, info) {
+    Object.defineProperty(Component.prototype, methodName, {
+      get: function () {
+        lowPriorityWarning$1(false, '%s(...) is deprecated in plain JavaScript React classes. %s', info[0], info[1]);
+        return undefined;
+      }
+    });
+  };
+  for (var fnName in deprecatedAPIs) {
+    if (deprecatedAPIs.hasOwnProperty(fnName)) {
+      defineDeprecationWarning(fnName, deprecatedAPIs[fnName]);
+    }
+  }
+}
+
+function ComponentDummy() {}
+ComponentDummy.prototype = Component.prototype;
+
+/**
+ * Convenience component with default shallow equality check for sCU.
+ */
+function PureComponent(props, context, updater) {
+  this.props = props;
+  this.context = context;
+  this.refs = emptyObject_1;
+  this.updater = updater || ReactNoopUpdateQueue;
+}
+
+var pureComponentPrototype = PureComponent.prototype = new ComponentDummy();
+pureComponentPrototype.constructor = PureComponent;
+// Avoid an extra prototype jump for these methods.
+objectAssign(pureComponentPrototype, Component.prototype);
+pureComponentPrototype.isPureReactComponent = true;
+
+// an immutable object with a single mutable value
+function createRef() {
+  var refObject = {
+    current: null
+  };
+  {
+    Object.seal(refObject);
+  }
+  return refObject;
+}
+
+/**
+ * Keeps track of the current owner.
+ *
+ * The current owner is the component who should own any components that are
+ * currently being constructed.
+ */
+var ReactCurrentOwner = {
+  /**
+   * @internal
+   * @type {ReactComponent}
+   */
+  current: null
+};
+
+var hasOwnProperty$1 = Object.prototype.hasOwnProperty;
+
+var RESERVED_PROPS = {
+  key: true,
+  ref: true,
+  __self: true,
+  __source: true
+};
+
+var specialPropKeyWarningShown = void 0;
+var specialPropRefWarningShown = void 0;
+
+function hasValidRef(config) {
+  {
+    if (hasOwnProperty$1.call(config, 'ref')) {
+      var getter = Object.getOwnPropertyDescriptor(config, 'ref').get;
+      if (getter && getter.isReactWarning) {
+        return false;
+      }
+    }
+  }
+  return config.ref !== undefined;
+}
+
+function hasValidKey(config) {
+  {
+    if (hasOwnProperty$1.call(config, 'key')) {
+      var getter = Object.getOwnPropertyDescriptor(config, 'key').get;
+      if (getter && getter.isReactWarning) {
+        return false;
+      }
+    }
+  }
+  return config.key !== undefined;
+}
+
+function defineKeyPropWarningGetter(props, displayName) {
+  var warnAboutAccessingKey = function () {
+    if (!specialPropKeyWarningShown) {
+      specialPropKeyWarningShown = true;
+      warning_1(false, '%s: `key` is not a prop. Trying to access it will result ' + 'in `undefined` being returned. If you need to access the same ' + 'value within the child component, you should pass it as a different ' + 'prop. (https://fb.me/react-special-props)', displayName);
+    }
+  };
+  warnAboutAccessingKey.isReactWarning = true;
+  Object.defineProperty(props, 'key', {
+    get: warnAboutAccessingKey,
+    configurable: true
+  });
+}
+
+function defineRefPropWarningGetter(props, displayName) {
+  var warnAboutAccessingRef = function () {
+    if (!specialPropRefWarningShown) {
+      specialPropRefWarningShown = true;
+      warning_1(false, '%s: `ref` is not a prop. Trying to access it will result ' + 'in `undefined` being returned. If you need to access the same ' + 'value within the child component, you should pass it as a different ' + 'prop. (https://fb.me/react-special-props)', displayName);
+    }
+  };
+  warnAboutAccessingRef.isReactWarning = true;
+  Object.defineProperty(props, 'ref', {
+    get: warnAboutAccessingRef,
+    configurable: true
+  });
+}
+
+/**
+ * Factory method to create a new React element. This no longer adheres to
+ * the class pattern, so do not use new to call it. Also, no instanceof check
+ * will work. Instead test $$typeof field against Symbol.for('react.element') to check
+ * if something is a React Element.
+ *
+ * @param {*} type
+ * @param {*} key
+ * @param {string|object} ref
+ * @param {*} self A *temporary* helper to detect places where `this` is
+ * different from the `owner` when React.createElement is called, so that we
+ * can warn. We want to get rid of owner and replace string `ref`s with arrow
+ * functions, and as long as `this` and owner are the same, there will be no
+ * change in behavior.
+ * @param {*} source An annotation object (added by a transpiler or otherwise)
+ * indicating filename, line number, and/or other information.
+ * @param {*} owner
+ * @param {*} props
+ * @internal
+ */
+var ReactElement = function (type, key, ref, self, source, owner, props) {
+  var element = {
+    // This tag allows us to uniquely identify this as a React Element
+    $$typeof: REACT_ELEMENT_TYPE,
+
+    // Built-in properties that belong on the element
+    type: type,
+    key: key,
+    ref: ref,
+    props: props,
+
+    // Record the component responsible for creating this element.
+    _owner: owner
+  };
+
+  {
+    // The validation flag is currently mutative. We put it on
+    // an external backing store so that we can freeze the whole object.
+    // This can be replaced with a WeakMap once they are implemented in
+    // commonly used development environments.
+    element._store = {};
+
+    // To make comparing ReactElements easier for testing purposes, we make
+    // the validation flag non-enumerable (where possible, which should
+    // include every environment we run tests in), so the test framework
+    // ignores it.
+    Object.defineProperty(element._store, 'validated', {
+      configurable: false,
+      enumerable: false,
+      writable: true,
+      value: false
+    });
+    // self and source are DEV only properties.
+    Object.defineProperty(element, '_self', {
+      configurable: false,
+      enumerable: false,
+      writable: false,
+      value: self
+    });
+    // Two elements created in two different places should be considered
+    // equal for testing purposes and therefore we hide it from enumeration.
+    Object.defineProperty(element, '_source', {
+      configurable: false,
+      enumerable: false,
+      writable: false,
+      value: source
+    });
+    if (Object.freeze) {
+      Object.freeze(element.props);
+      Object.freeze(element);
+    }
+  }
+
+  return element;
+};
+
+/**
+ * Create and return a new ReactElement of the given type.
+ * See https://reactjs.org/docs/react-api.html#createelement
+ */
+function createElement(type, config, children) {
+  var propName = void 0;
+
+  // Reserved names are extracted
+  var props = {};
+
+  var key = null;
+  var ref = null;
+  var self = null;
+  var source = null;
+
+  if (config != null) {
+    if (hasValidRef(config)) {
+      ref = config.ref;
+    }
+    if (hasValidKey(config)) {
+      key = '' + config.key;
+    }
+
+    self = config.__self === undefined ? null : config.__self;
+    source = config.__source === undefined ? null : config.__source;
+    // Remaining properties are added to a new props object
+    for (propName in config) {
+      if (hasOwnProperty$1.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {
+        props[propName] = config[propName];
+      }
+    }
+  }
+
+  // Children can be more than one argument, and those are transferred onto
+  // the newly allocated props object.
+  var childrenLength = arguments.length - 2;
+  if (childrenLength === 1) {
+    props.children = children;
+  } else if (childrenLength > 1) {
+    var childArray = Array(childrenLength);
+    for (var i = 0; i < childrenLength; i++) {
+      childArray[i] = arguments[i + 2];
+    }
+    {
+      if (Object.freeze) {
+        Object.freeze(childArray);
+      }
+    }
+    props.children = childArray;
+  }
+
+  // Resolve default props
+  if (type && type.defaultProps) {
+    var defaultProps = type.defaultProps;
+    for (propName in defaultProps) {
+      if (props[propName] === undefined) {
+        props[propName] = defaultProps[propName];
+      }
+    }
+  }
+  {
+    if (key || ref) {
+      if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {
+        var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;
+        if (key) {
+          defineKeyPropWarningGetter(props, displayName);
+        }
+        if (ref) {
+          defineRefPropWarningGetter(props, displayName);
+        }
+      }
+    }
+  }
+  return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);
+}
+
+/**
+ * Return a function that produces ReactElements of a given type.
+ * See https://reactjs.org/docs/react-api.html#createfactory
+ */
+
+
+function cloneAndReplaceKey(oldElement, newKey) {
+  var newElement = ReactElement(oldElement.type, newKey, oldElement.ref, oldElement._self, oldElement._source, oldElement._owner, oldElement.props);
+
+  return newElement;
+}
+
+/**
+ * Clone and return a new ReactElement using element as the starting point.
+ * See https://reactjs.org/docs/react-api.html#cloneelement
+ */
+function cloneElement(element, config, children) {
+  var propName = void 0;
+
+  // Original props are copied
+  var props = objectAssign({}, element.props);
+
+  // Reserved names are extracted
+  var key = element.key;
+  var ref = element.ref;
+  // Self is preserved since the owner is preserved.
+  var self = element._self;
+  // Source is preserved since cloneElement is unlikely to be targeted by a
+  // transpiler, and the original source is probably a better indicator of the
+  // true owner.
+  var source = element._source;
+
+  // Owner will be preserved, unless ref is overridden
+  var owner = element._owner;
+
+  if (config != null) {
+    if (hasValidRef(config)) {
+      // Silently steal the ref from the parent.
+      ref = config.ref;
+      owner = ReactCurrentOwner.current;
+    }
+    if (hasValidKey(config)) {
+      key = '' + config.key;
+    }
+
+    // Remaining properties override existing props
+    var defaultProps = void 0;
+    if (element.type && element.type.defaultProps) {
+      defaultProps = element.type.defaultProps;
+    }
+    for (propName in config) {
+      if (hasOwnProperty$1.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {
+        if (config[propName] === undefined && defaultProps !== undefined) {
+          // Resolve default props
+          props[propName] = defaultProps[propName];
+        } else {
+          props[propName] = config[propName];
+        }
+      }
+    }
+  }
+
+  // Children can be more than one argument, and those are transferred onto
+  // the newly allocated props object.
+  var childrenLength = arguments.length - 2;
+  if (childrenLength === 1) {
+    props.children = children;
+  } else if (childrenLength > 1) {
+    var childArray = Array(childrenLength);
+    for (var i = 0; i < childrenLength; i++) {
+      childArray[i] = arguments[i + 2];
+    }
+    props.children = childArray;
+  }
+
+  return ReactElement(element.type, key, ref, self, source, owner, props);
+}
+
+/**
+ * Verifies the object is a ReactElement.
+ * See https://reactjs.org/docs/react-api.html#isvalidelement
+ * @param {?object} object
+ * @return {boolean} True if `object` is a valid component.
+ * @final
+ */
+function isValidElement(object) {
+  return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;
+}
+
+var ReactDebugCurrentFrame = {};
+
+{
+  // Component that is being worked on
+  ReactDebugCurrentFrame.getCurrentStack = null;
+
+  ReactDebugCurrentFrame.getStackAddendum = function () {
+    var impl = ReactDebugCurrentFrame.getCurrentStack;
+    if (impl) {
+      return impl();
+    }
+    return null;
+  };
+}
+
+var SEPARATOR = '.';
+var SUBSEPARATOR = ':';
+
+/**
+ * Escape and wrap key so it is safe to use as a reactid
+ *
+ * @param {string} key to be escaped.
+ * @return {string} the escaped key.
+ */
+function escape(key) {
+  var escapeRegex = /[=:]/g;
+  var escaperLookup = {
+    '=': '=0',
+    ':': '=2'
+  };
+  var escapedString = ('' + key).replace(escapeRegex, function (match) {
+    return escaperLookup[match];
+  });
+
+  return '$' + escapedString;
+}
+
+/**
+ * TODO: Test that a single child and an array with one item have the same key
+ * pattern.
+ */
+
+var didWarnAboutMaps = false;
+
+var userProvidedKeyEscapeRegex = /\/+/g;
+function escapeUserProvidedKey(text) {
+  return ('' + text).replace(userProvidedKeyEscapeRegex, '$&/');
+}
+
+var POOL_SIZE = 10;
+var traverseContextPool = [];
+function getPooledTraverseContext(mapResult, keyPrefix, mapFunction, mapContext) {
+  if (traverseContextPool.length) {
+    var traverseContext = traverseContextPool.pop();
+    traverseContext.result = mapResult;
+    traverseContext.keyPrefix = keyPrefix;
+    traverseContext.func = mapFunction;
+    traverseContext.context = mapContext;
+    traverseContext.count = 0;
+    return traverseContext;
+  } else {
+    return {
+      result: mapResult,
+      keyPrefix: keyPrefix,
+      func: mapFunction,
+      context: mapContext,
+      count: 0
+    };
+  }
+}
+
+function releaseTraverseContext(traverseContext) {
+  traverseContext.result = null;
+  traverseContext.keyPrefix = null;
+  traverseContext.func = null;
+  traverseContext.context = null;
+  traverseContext.count = 0;
+  if (traverseContextPool.length < POOL_SIZE) {
+    traverseContextPool.push(traverseContext);
+  }
+}
+
+/**
+ * @param {?*} children Children tree container.
+ * @param {!string} nameSoFar Name of the key path so far.
+ * @param {!function} callback Callback to invoke with each child found.
+ * @param {?*} traverseContext Used to pass information throughout the traversal
+ * process.
+ * @return {!number} The number of children in this subtree.
+ */
+function traverseAllChildrenImpl(children, nameSoFar, callback, traverseContext) {
+  var type = typeof children;
+
+  if (type === 'undefined' || type === 'boolean') {
+    // All of the above are perceived as null.
+    children = null;
+  }
+
+  var invokeCallback = false;
+
+  if (children === null) {
+    invokeCallback = true;
+  } else {
+    switch (type) {
+      case 'string':
+      case 'number':
+        invokeCallback = true;
+        break;
+      case 'object':
+        switch (children.$$typeof) {
+          case REACT_ELEMENT_TYPE:
+          case REACT_PORTAL_TYPE:
+            invokeCallback = true;
+        }
+    }
+  }
+
+  if (invokeCallback) {
+    callback(traverseContext, children,
+    // If it's the only child, treat the name as if it was wrapped in an array
+    // so that it's consistent if the number of children grows.
+    nameSoFar === '' ? SEPARATOR + getComponentKey(children, 0) : nameSoFar);
+    return 1;
+  }
+
+  var child = void 0;
+  var nextName = void 0;
+  var subtreeCount = 0; // Count of children found in the current subtree.
+  var nextNamePrefix = nameSoFar === '' ? SEPARATOR : nameSoFar + SUBSEPARATOR;
+
+  if (Array.isArray(children)) {
+    for (var i = 0; i < children.length; i++) {
+      child = children[i];
+      nextName = nextNamePrefix + getComponentKey(child, i);
+      subtreeCount += traverseAllChildrenImpl(child, nextName, callback, traverseContext);
+    }
+  } else {
+    var iteratorFn = getIteratorFn(children);
+    if (typeof iteratorFn === 'function') {
+      {
+        // Warn about using Maps as children
+        if (iteratorFn === children.entries) {
+          warning_1(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', ReactDebugCurrentFrame.getStackAddendum());
+          didWarnAboutMaps = true;
+        }
+      }
+
+      var iterator = iteratorFn.call(children);
+      var step = void 0;
+      var ii = 0;
+      while (!(step = iterator.next()).done) {
+        child = step.value;
+        nextName = nextNamePrefix + getComponentKey(child, ii++);
+        subtreeCount += traverseAllChildrenImpl(child, nextName, callback, traverseContext);
+      }
+    } else if (type === 'object') {
+      var addendum = '';
+      {
+        addendum = ' If you meant to render a collection of children, use an array ' + 'instead.' + ReactDebugCurrentFrame.getStackAddendum();
+      }
+      var childrenString = '' + children;
+      invariant_1(false, 'Objects are not valid as a React child (found: %s).%s', childrenString === '[object Object]' ? 'object with keys {' + Object.keys(children).join(', ') + '}' : childrenString, addendum);
+    }
+  }
+
+  return subtreeCount;
+}
+
+/**
+ * Traverses children that are typically specified as `props.children`, but
+ * might also be specified through attributes:
+ *
+ * - `traverseAllChildren(this.props.children, ...)`
+ * - `traverseAllChildren(this.props.leftPanelChildren, ...)`
+ *
+ * The `traverseContext` is an optional argument that is passed through the
+ * entire traversal. It can be used to store accumulations or anything else that
+ * the callback might find relevant.
+ *
+ * @param {?*} children Children tree object.
+ * @param {!function} callback To invoke upon traversing each child.
+ * @param {?*} traverseContext Context for traversal.
+ * @return {!number} The number of children in this subtree.
+ */
+function traverseAllChildren(children, callback, traverseContext) {
+  if (children == null) {
+    return 0;
+  }
+
+  return traverseAllChildrenImpl(children, '', callback, traverseContext);
+}
+
+/**
+ * Generate a key string that identifies a component within a set.
+ *
+ * @param {*} component A component that could contain a manual key.
+ * @param {number} index Index that is used if a manual key is not provided.
+ * @return {string}
+ */
+function getComponentKey(component, index) {
+  // Do some typechecking here since we call this blindly. We want to ensure
+  // that we don't block potential future ES APIs.
+  if (typeof component === 'object' && component !== null && component.key != null) {
+    // Explicit key
+    return escape(component.key);
+  }
+  // Implicit key determined by the index in the set
+  return index.toString(36);
+}
+
+function forEachSingleChild(bookKeeping, child, name) {
+  var func = bookKeeping.func,
+      context = bookKeeping.context;
+
+  func.call(context, child, bookKeeping.count++);
+}
+
+/**
+ * Iterates through children that are typically specified as `props.children`.
+ *
+ * See https://reactjs.org/docs/react-api.html#react.children.foreach
+ *
+ * The provided forEachFunc(child, index) will be called for each
+ * leaf child.
+ *
+ * @param {?*} children Children tree container.
+ * @param {function(*, int)} forEachFunc
+ * @param {*} forEachContext Context for forEachContext.
+ */
+function forEachChildren(children, forEachFunc, forEachContext) {
+  if (children == null) {
+    return children;
+  }
+  var traverseContext = getPooledTraverseContext(null, null, forEachFunc, forEachContext);
+  traverseAllChildren(children, forEachSingleChild, traverseContext);
+  releaseTraverseContext(traverseContext);
+}
+
+function mapSingleChildIntoContext(bookKeeping, child, childKey) {
+  var result = bookKeeping.result,
+      keyPrefix = bookKeeping.keyPrefix,
+      func = bookKeeping.func,
+      context = bookKeeping.context;
+
+
+  var mappedChild = func.call(context, child, bookKeeping.count++);
+  if (Array.isArray(mappedChild)) {
+    mapIntoWithKeyPrefixInternal(mappedChild, result, childKey, emptyFunction_1.thatReturnsArgument);
+  } else if (mappedChild != null) {
+    if (isValidElement(mappedChild)) {
+      mappedChild = cloneAndReplaceKey(mappedChild,
+      // Keep both the (mapped) and old keys if they differ, just as
+      // traverseAllChildren used to do for objects as children
+      keyPrefix + (mappedChild.key && (!child || child.key !== mappedChild.key) ? escapeUserProvidedKey(mappedChild.key) + '/' : '') + childKey);
+    }
+    result.push(mappedChild);
+  }
+}
+
+function mapIntoWithKeyPrefixInternal(children, array, prefix, func, context) {
+  var escapedPrefix = '';
+  if (prefix != null) {
+    escapedPrefix = escapeUserProvidedKey(prefix) + '/';
+  }
+  var traverseContext = getPooledTraverseContext(array, escapedPrefix, func, context);
+  traverseAllChildren(children, mapSingleChildIntoContext, traverseContext);
+  releaseTraverseContext(traverseContext);
+}
+
+/**
+ * Maps children that are typically specified as `props.children`.
+ *
+ * See https://reactjs.org/docs/react-api.html#react.children.map
+ *
+ * The provided mapFunction(child, key, index) will be called for each
+ * leaf child.
+ *
+ * @param {?*} children Children tree container.
+ * @param {function(*, int)} func The map function.
+ * @param {*} context Context for mapFunction.
+ * @return {object} Object containing the ordered map of results.
+ */
+function mapChildren(children, func, context) {
+  if (children == null) {
+    return children;
+  }
+  var result = [];
+  mapIntoWithKeyPrefixInternal(children, result, null, func, context);
+  return result;
+}
+
+/**
+ * Count the number of children that are typically specified as
+ * `props.children`.
+ *
+ * See https://reactjs.org/docs/react-api.html#react.children.count
+ *
+ * @param {?*} children Children tree container.
+ * @return {number} The number of children.
+ */
+function countChildren(children, context) {
+  return traverseAllChildren(children, emptyFunction_1.thatReturnsNull, null);
+}
+
+/**
+ * Flatten a children object (typically specified as `props.children`) and
+ * return an array with appropriately re-keyed children.
+ *
+ * See https://reactjs.org/docs/react-api.html#react.children.toarray
+ */
+function toArray(children) {
+  var result = [];
+  mapIntoWithKeyPrefixInternal(children, result, null, emptyFunction_1.thatReturnsArgument);
+  return result;
+}
+
+/**
+ * Returns the first child in a collection of children and verifies that there
+ * is only one child in the collection.
+ *
+ * See https://reactjs.org/docs/react-api.html#react.children.only
+ *
+ * The current implementation of this function assumes that a single child gets
+ * passed without a wrapper, but the purpose of this helper function is to
+ * abstract away the particular structure of children.
+ *
+ * @param {?object} children Child collection structure.
+ * @return {ReactElement} The first and only `ReactElement` contained in the
+ * structure.
+ */
+function onlyChild(children) {
+  !isValidElement(children) ? invariant_1(false, 'React.Children.only expected to receive a single React element child.') : void 0;
+  return children;
+}
+
+function createContext(defaultValue, calculateChangedBits) {
+  if (calculateChangedBits === undefined) {
+    calculateChangedBits = null;
+  } else {
+    {
+      warning_1(calculateChangedBits === null || typeof calculateChangedBits === 'function', 'createContext: Expected the optional second argument to be a ' + 'function. Instead received: %s', calculateChangedBits);
+    }
+  }
+
+  var context = {
+    $$typeof: REACT_CONTEXT_TYPE,
+    _calculateChangedBits: calculateChangedBits,
+    _defaultValue: defaultValue,
+    _currentValue: defaultValue,
+    _changedBits: 0,
+    // These are circular
+    Provider: null,
+    Consumer: null
+  };
+
+  context.Provider = {
+    $$typeof: REACT_PROVIDER_TYPE,
+    context: context
+  };
+  context.Consumer = context;
+
+  {
+    context._currentRenderer = null;
+  }
+
+  return context;
+}
+
+function forwardRef(render) {
+  {
+    warning_1(typeof render === 'function', 'forwardRef requires a render function but was given %s.', render === null ? 'null' : typeof render);
+  }
+
+  return {
+    $$typeof: REACT_FORWARD_REF_TYPE,
+    render: render
+  };
+}
+
+var describeComponentFrame = function (name, source, ownerName) {
+  return '\n    in ' + (name || 'Unknown') + (source ? ' (at ' + source.fileName.replace(/^.*[\\\/]/, '') + ':' + source.lineNumber + ')' : ownerName ? ' (created by ' + ownerName + ')' : '');
+};
+
+function isValidElementType(type) {
+  return typeof type === 'string' || typeof type === 'function' ||
+  // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.
+  type === REACT_FRAGMENT_TYPE || type === REACT_ASYNC_MODE_TYPE || type === REACT_STRICT_MODE_TYPE || typeof type === 'object' && type !== null && (type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE);
+}
+
+function getComponentName(fiber) {
+  var type = fiber.type;
+
+  if (typeof type === 'function') {
+    return type.displayName || type.name;
+  }
+  if (typeof type === 'string') {
+    return type;
+  }
+  switch (type) {
+    case REACT_FRAGMENT_TYPE:
+      return 'ReactFragment';
+    case REACT_PORTAL_TYPE:
+      return 'ReactPortal';
+    case REACT_CALL_TYPE:
+      return 'ReactCall';
+    case REACT_RETURN_TYPE:
+      return 'ReactReturn';
+  }
+  return null;
+}
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+
+
+var ReactPropTypesSecret$1 = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';
+
+var ReactPropTypesSecret_1 = ReactPropTypesSecret$1;
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+
+
+{
+  var invariant$2 = invariant_1;
+  var warning$2 = warning_1;
+  var ReactPropTypesSecret = ReactPropTypesSecret_1;
+  var loggedTypeFailures = {};
+}
+
+/**
+ * Assert that the values match with the type specs.
+ * Error messages are memorized and will only be shown once.
+ *
+ * @param {object} typeSpecs Map of name to a ReactPropType
+ * @param {object} values Runtime values that need to be type-checked
+ * @param {string} location e.g. "prop", "context", "child context"
+ * @param {string} componentName Name of the component for error messages.
+ * @param {?Function} getStack Returns the component stack.
+ * @private
+ */
+function checkPropTypes(typeSpecs, values, location, componentName, getStack) {
+  {
+    for (var typeSpecName in typeSpecs) {
+      if (typeSpecs.hasOwnProperty(typeSpecName)) {
+        var error;
+        // Prop type validation may throw. In case they do, we don't want to
+        // fail the render phase where it didn't fail before. So we log it.
+        // After these have been cleaned up, we'll let them throw.
+        try {
+          // This is intentionally an invariant that gets caught. It's the same
+          // behavior as without this statement except with a better message.
+          invariant$2(typeof typeSpecs[typeSpecName] === 'function', '%s: %s type `%s` is invalid; it must be a function, usually from ' + 'the `prop-types` package, but received `%s`.', componentName || 'React class', location, typeSpecName, typeof typeSpecs[typeSpecName]);
+          error = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, ReactPropTypesSecret);
+        } catch (ex) {
+          error = ex;
+        }
+        warning$2(!error || error instanceof Error, '%s: type specification of %s `%s` is invalid; the type checker ' + 'function must return `null` or an `Error` but returned a %s. ' + 'You may have forgotten to pass an argument to the type checker ' + 'creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and ' + 'shape all require an argument).', componentName || 'React class', location, typeSpecName, typeof error);
+        if (error instanceof Error && !(error.message in loggedTypeFailures)) {
+          // Only monitor this failure once because there tends to be a lot of the
+          // same error.
+          loggedTypeFailures[error.message] = true;
+
+          var stack = getStack ? getStack() : '';
+
+          warning$2(false, 'Failed %s type: %s%s', location, error.message, stack != null ? stack : '');
+        }
+      }
+    }
+  }
+}
+
+var checkPropTypes_1 = checkPropTypes;
+
+/**
+ * ReactElementValidator provides a wrapper around a element factory
+ * which validates the props passed to the element. This is intended to be
+ * used only in DEV and could be replaced by a static type checker for languages
+ * that support it.
+ */
+
+var currentlyValidatingElement = void 0;
+var propTypesMisspellWarningShown = void 0;
+
+var getDisplayName = function () {};
+var getStackAddendum = function () {};
+
+var VALID_FRAGMENT_PROPS = void 0;
+
+{
+  currentlyValidatingElement = null;
+
+  propTypesMisspellWarningShown = false;
+
+  getDisplayName = function (element) {
+    if (element == null) {
+      return '#empty';
+    } else if (typeof element === 'string' || typeof element === 'number') {
+      return '#text';
+    } else if (typeof element.type === 'string') {
+      return element.type;
+    } else if (element.type === REACT_FRAGMENT_TYPE) {
+      return 'React.Fragment';
+    } else {
+      return element.type.displayName || element.type.name || 'Unknown';
+    }
+  };
+
+  getStackAddendum = function () {
+    var stack = '';
+    if (currentlyValidatingElement) {
+      var name = getDisplayName(currentlyValidatingElement);
+      var owner = currentlyValidatingElement._owner;
+      stack += describeComponentFrame(name, currentlyValidatingElement._source, owner && getComponentName(owner));
+    }
+    stack += ReactDebugCurrentFrame.getStackAddendum() || '';
+    return stack;
+  };
+
+  VALID_FRAGMENT_PROPS = new Map([['children', true], ['key', true]]);
+}
+
+function getDeclarationErrorAddendum() {
+  if (ReactCurrentOwner.current) {
+    var name = getComponentName(ReactCurrentOwner.current);
+    if (name) {
+      return '\n\nCheck the render method of `' + name + '`.';
+    }
+  }
+  return '';
+}
+
+function getSourceInfoErrorAddendum(elementProps) {
+  if (elementProps !== null && elementProps !== undefined && elementProps.__source !== undefined) {
+    var source = elementProps.__source;
+    var fileName = source.fileName.replace(/^.*[\\\/]/, '');
+    var lineNumber = source.lineNumber;
+    return '\n\nCheck your code at ' + fileName + ':' + lineNumber + '.';
+  }
+  return '';
+}
+
+/**
+ * Warn if there's no key explicitly set on dynamic arrays of children or
+ * object keys are not valid. This allows us to keep track of children between
+ * updates.
+ */
+var ownerHasKeyUseWarning = {};
+
+function getCurrentComponentErrorInfo(parentType) {
+  var info = getDeclarationErrorAddendum();
+
+  if (!info) {
+    var parentName = typeof parentType === 'string' ? parentType : parentType.displayName || parentType.name;
+    if (parentName) {
+      info = '\n\nCheck the top-level render call using <' + parentName + '>.';
+    }
+  }
+  return info;
+}
+
+/**
+ * Warn if the element doesn't have an explicit key assigned to it.
+ * This element is in an array. The array could grow and shrink or be
+ * reordered. All children that haven't already been validated are required to
+ * have a "key" property assigned to it. Error statuses are cached so a warning
+ * will only be shown once.
+ *
+ * @internal
+ * @param {ReactElement} element Element that requires a key.
+ * @param {*} parentType element's parent's type.
+ */
+function validateExplicitKey(element, parentType) {
+  if (!element._store || element._store.validated || element.key != null) {
+    return;
+  }
+  element._store.validated = true;
+
+  var currentComponentErrorInfo = getCurrentComponentErrorInfo(parentType);
+  if (ownerHasKeyUseWarning[currentComponentErrorInfo]) {
+    return;
+  }
+  ownerHasKeyUseWarning[currentComponentErrorInfo] = true;
+
+  // Usually the current owner is the offender, but if it accepts children as a
+  // property, it may be the creator of the child that's responsible for
+  // assigning it a key.
+  var childOwner = '';
+  if (element && element._owner && element._owner !== ReactCurrentOwner.current) {
+    // Give the component that originally created this child.
+    childOwner = ' It was passed a child from ' + getComponentName(element._owner) + '.';
+  }
+
+  currentlyValidatingElement = element;
+  {
+    warning_1(false, 'Each child in an array or iterator should have a unique "key" prop.' + '%s%s See https://fb.me/react-warning-keys for more information.%s', currentComponentErrorInfo, childOwner, getStackAddendum());
+  }
+  currentlyValidatingElement = null;
+}
+
+/**
+ * Ensure that every element either is passed in a static location, in an
+ * array with an explicit keys property defined, or in an object literal
+ * with valid key property.
+ *
+ * @internal
+ * @param {ReactNode} node Statically passed child of any type.
+ * @param {*} parentType node's parent's type.
+ */
+function validateChildKeys(node, parentType) {
+  if (typeof node !== 'object') {
+    return;
+  }
+  if (Array.isArray(node)) {
+    for (var i = 0; i < node.length; i++) {
+      var child = node[i];
+      if (isValidElement(child)) {
+        validateExplicitKey(child, parentType);
+      }
+    }
+  } else if (isValidElement(node)) {
+    // This element was passed in a valid location.
+    if (node._store) {
+      node._store.validated = true;
+    }
+  } else if (node) {
+    var iteratorFn = getIteratorFn(node);
+    if (typeof iteratorFn === 'function') {
+      // Entry iterators used to provide implicit keys,
+      // but now we print a separate warning for them later.
+      if (iteratorFn !== node.entries) {
+        var iterator = iteratorFn.call(node);
+        var step = void 0;
+        while (!(step = iterator.next()).done) {
+          if (isValidElement(step.value)) {
+            validateExplicitKey(step.value, parentType);
+          }
+        }
+      }
+    }
+  }
+}
+
+/**
+ * Given an element, validate that its props follow the propTypes definition,
+ * provided by the type.
+ *
+ * @param {ReactElement} element
+ */
+function validatePropTypes(element) {
+  var componentClass = element.type;
+  if (typeof componentClass !== 'function') {
+    return;
+  }
+  var name = componentClass.displayName || componentClass.name;
+  var propTypes = componentClass.propTypes;
+  if (propTypes) {
+    currentlyValidatingElement = element;
+    checkPropTypes_1(propTypes, element.props, 'prop', name, getStackAddendum);
+    currentlyValidatingElement = null;
+  } else if (componentClass.PropTypes !== undefined && !propTypesMisspellWarningShown) {
+    propTypesMisspellWarningShown = true;
+    warning_1(false, 'Component %s declared `PropTypes` instead of `propTypes`. Did you misspell the property assignment?', name || 'Unknown');
+  }
+  if (typeof componentClass.getDefaultProps === 'function') {
+    warning_1(componentClass.getDefaultProps.isReactClassApproved, 'getDefaultProps is only used on classic React.createClass ' + 'definitions. Use a static property named `defaultProps` instead.');
+  }
+}
+
+/**
+ * Given a fragment, validate that it can only be provided with fragment props
+ * @param {ReactElement} fragment
+ */
+function validateFragmentProps(fragment) {
+  currentlyValidatingElement = fragment;
+
+  var keys = Object.keys(fragment.props);
+  for (var i = 0; i < keys.length; i++) {
+    var key = keys[i];
+    if (!VALID_FRAGMENT_PROPS.has(key)) {
+      warning_1(false, 'Invalid prop `%s` supplied to `React.Fragment`. ' + 'React.Fragment can only have `key` and `children` props.%s', key, getStackAddendum());
+      break;
+    }
+  }
+
+  if (fragment.ref !== null) {
+    warning_1(false, 'Invalid attribute `ref` supplied to `React.Fragment`.%s', getStackAddendum());
+  }
+
+  currentlyValidatingElement = null;
+}
+
+function createElementWithValidation(type, props, children) {
+  var validType = isValidElementType(type);
+
+  // We warn in this case but don't throw. We expect the element creation to
+  // succeed and there will likely be errors in render.
+  if (!validType) {
+    var info = '';
+    if (type === undefined || typeof type === 'object' && type !== null && Object.keys(type).length === 0) {
+      info += ' You likely forgot to export your component from the file ' + "it's defined in, or you might have mixed up default and named imports.";
+    }
+
+    var sourceInfo = getSourceInfoErrorAddendum(props);
+    if (sourceInfo) {
+      info += sourceInfo;
+    } else {
+      info += getDeclarationErrorAddendum();
+    }
+
+    info += getStackAddendum() || '';
+
+    var typeString = void 0;
+    if (type === null) {
+      typeString = 'null';
+    } else if (Array.isArray(type)) {
+      typeString = 'array';
+    } else {
+      typeString = typeof type;
+    }
+
+    warning_1(false, 'React.createElement: type is invalid -- expected a string (for ' + 'built-in components) or a class/function (for composite ' + 'components) but got: %s.%s', typeString, info);
+  }
+
+  var element = createElement.apply(this, arguments);
+
+  // The result can be nullish if a mock or a custom function is used.
+  // TODO: Drop this when these are no longer allowed as the type argument.
+  if (element == null) {
+    return element;
+  }
+
+  // Skip key warning if the type isn't valid since our key validation logic
+  // doesn't expect a non-string/function type and can throw confusing errors.
+  // We don't want exception behavior to differ between dev and prod.
+  // (Rendering will throw with a helpful message and as soon as the type is
+  // fixed, the key warnings will appear.)
+  if (validType) {
+    for (var i = 2; i < arguments.length; i++) {
+      validateChildKeys(arguments[i], type);
+    }
+  }
+
+  if (type === REACT_FRAGMENT_TYPE) {
+    validateFragmentProps(element);
+  } else {
+    validatePropTypes(element);
+  }
+
+  return element;
+}
+
+function createFactoryWithValidation(type) {
+  var validatedFactory = createElementWithValidation.bind(null, type);
+  validatedFactory.type = type;
+  // Legacy hook: remove it
+  {
+    Object.defineProperty(validatedFactory, 'type', {
+      enumerable: false,
+      get: function () {
+        lowPriorityWarning$1(false, 'Factory.type is deprecated. Access the class directly ' + 'before passing it to createFactory.');
+        Object.defineProperty(this, 'type', {
+          value: type
+        });
+        return type;
+      }
+    });
+  }
+
+  return validatedFactory;
+}
+
+function cloneElementWithValidation(element, props, children) {
+  var newElement = cloneElement.apply(this, arguments);
+  for (var i = 2; i < arguments.length; i++) {
+    validateChildKeys(arguments[i], newElement.type);
+  }
+  validatePropTypes(newElement);
+  return newElement;
+}
+
+var React = {
+  Children: {
+    map: mapChildren,
+    forEach: forEachChildren,
+    count: countChildren,
+    toArray: toArray,
+    only: onlyChild
+  },
+
+  createRef: createRef,
+  Component: Component,
+  PureComponent: PureComponent,
+
+  createContext: createContext,
+  forwardRef: forwardRef,
+
+  Fragment: REACT_FRAGMENT_TYPE,
+  StrictMode: REACT_STRICT_MODE_TYPE,
+  unstable_AsyncMode: REACT_ASYNC_MODE_TYPE,
+
+  createElement: createElementWithValidation,
+  cloneElement: cloneElementWithValidation,
+  createFactory: createFactoryWithValidation,
+  isValidElement: isValidElement,
+
+  version: ReactVersion,
+
+  __SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED: {
+    ReactCurrentOwner: ReactCurrentOwner,
+    // Used by renderers to avoid bundling object-assign twice in UMD bundles:
+    assign: objectAssign
+  }
+};
+
+{
+  objectAssign(React.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED, {
+    // These should not be included in production.
+    ReactDebugCurrentFrame: ReactDebugCurrentFrame,
+    // Shim for React DOM 16.0.0 which still destructured (but not used) this.
+    // TODO: remove in React 17.0.
+    ReactComponentTreeHook: {}
+  });
+}
+
+
+
+var React$2 = Object.freeze({
+	default: React
+});
+
+var React$3 = ( React$2 && React ) || React$2;
+
+// TODO: decide on the top-level export form.
+// This is hacky but makes it work with both Rollup and Jest.
+var react = React$3['default'] ? React$3['default'] : React$3;
+
+return react;
+
+})));
diff --git a/js/clojure/data.cljs b/js/clojure/data.cljs
new file mode 100644
index 0000000..80a608c
--- /dev/null
+++ b/js/clojure/data.cljs
@@ -0,0 +1,162 @@
+;   Copyright (c) Rich Hickey. All rights reserved.
+;   The use and distribution terms for this software are covered by the
+;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;   which can be found in the file epl-v10.html at the root of this distribution.
+;   By using this software in any fashion, you are agreeing to be bound by
+;   the terms of this license.
+;   You must not remove this notice, or any other, from this software.
+
+(ns 
+  ^{:author "Stuart Halloway",
+    :doc "Non-core data functions."}
+  clojure.data
+  (:require [clojure.set :as set]))
+
+(declare ^{:arglists '([a b])} diff)
+
+(defn- atom-diff
+  "Internal helper for diff."
+  [a b]
+  (if (= a b) [nil nil a] [a b nil]))
+
+;; for big things a sparse vector class would be better
+(defn- vectorize
+  "Convert an associative-by-numeric-index collection into
+   an equivalent vector, with nil for any missing keys"
+  [m]
+  (when (seq m)
+    (reduce
+     (fn [result [k v]] (assoc result k v))
+     (vec (repeat (apply max (keys m))  nil))
+     m)))
+
+(defn- diff-associative-key
+  "Diff associative things a and b, comparing only the key k."
+  [a b k]
+  (let [va (get a k)
+        vb (get b k)
+        [a* b* ab] (diff va vb)
+        in-a (contains? a k)
+        in-b (contains? b k)
+        same (and in-a in-b
+                  (or (not (nil? ab))
+                      (and (nil? va) (nil? vb))))]
+    [(when (and in-a (or (not (nil? a*)) (not same))) {k a*})
+     (when (and in-b (or (not (nil? b*)) (not same))) {k b*})
+     (when same {k ab})
+     ]))
+
+(defn- diff-associative
+  "Diff associative things a and b, comparing only keys in ks (if supplied)."
+  ([a b]
+     (diff-associative a b (set/union (keys a) (keys b))))
+  ([a b ks]
+     (reduce
+      (fn [diff1 diff2]
+        (doall (map merge diff1 diff2)))
+      [nil nil nil]
+      (map
+       (partial diff-associative-key a b)
+       ks))))
+
+(defn- diff-sequential
+  [a b]
+  (vec (map vectorize (diff-associative
+                       (if (vector? a) a (vec a))
+                       (if (vector? b) b (vec b))
+                       (range (max (count a) (count b)))))))
+
+(defn- diff-set
+  [a b]
+  [(not-empty (set/difference a b))
+   (not-empty (set/difference b a))
+   (not-empty (set/intersection a b))])
+
+(defprotocol EqualityPartition
+  "Implementation detail. Subject to change."
+  (equality-partition [x] "Implementation detail. Subject to change."))
+
+(defprotocol Diff
+  "Implementation detail. Subject to change."
+  (diff-similar [a b] "Implementation detail. Subject to change."))
+
+(extend-protocol EqualityPartition
+  nil
+  (equality-partition [x] :atom)
+
+  string
+  (equality-partition [x] :atom)
+
+  number
+  (equality-partition [x] :atom)
+
+  array
+  (equality-partition [x] :sequential)
+
+  function
+  (equality-partition [x] :atom)
+
+  boolean
+  (equality-partition [x] :atom)
+
+  default
+  (equality-partition [x]
+    (cond
+     (satisfies? IMap x) :map
+     (satisfies? ISet x) :set
+     (satisfies? ISequential x) :sequential
+     :default :atom)))
+
+(extend-protocol Diff
+  nil
+  (diff-similar [a b]
+    (atom-diff a b))
+
+  string
+  (diff-similar [a b]
+    (atom-diff a b))
+
+  number
+  (diff-similar [a b]
+    (atom-diff a b))
+
+  array
+  (diff-similar [a b]
+    (diff-sequential a b))
+
+  function
+  (diff-similar [a b]
+    (atom-diff a b))
+
+  boolean
+  (diff-similar [a b]
+    (atom-diff a b))
+
+  default
+  (diff-similar [a b]
+    ((case (equality-partition a)
+       :atom atom-diff
+       :set diff-set
+       :sequential diff-sequential
+       :map diff-associative)
+     a b)))
+
+(defn diff
+  "Recursively compares a and b, returning a tuple of
+  [things-only-in-a things-only-in-b things-in-both].
+  Comparison rules:
+
+  * For equal a and b, return [nil nil a].
+  * Maps are subdiffed where keys match and values differ.
+  * Sets are never subdiffed.
+  * All sequential things are treated as associative collections
+    by their indexes, with results returned as vectors.
+  * Everything else (including strings!) is treated as
+    an atom and compared for equality."
+  [a b]
+  (if (= a b)
+    [nil nil a]
+    (if (= (equality-partition a) (equality-partition b))
+      (diff-similar a b)
+      (atom-diff a b))))
+  
diff --git a/js/clojure/data.cljs.cache.json b/js/clojure/data.cljs.cache.json
new file mode 100644
index 0000000..7957057
--- /dev/null
+++ b/js/clojure/data.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$clojure.data","~:imports",null,"~:requires",["^ ","~$set","~$clojure.set","^<","^<"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$vectorize",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","~:line",23,"~:column",8,"~:end-line",23,"~:end-column",17,"~:private",true,"~:arglists",["~#list",["~$quote",["^J",[["~$m"]]]]],"~:doc","Convert an associative-by-numeric-index collection into\n   an equivalent vector, with nil for any missing keys"],"^H",true,"^7","~$clojure.data/vectorize","~:variadic",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",17,"~:method-params",["^J",[["~$m"]]],"~:protocol-impl",null,"~:arglists-meta",["^J",[null,null]],"^E",1,"^D",23,"^F",23,"~:max-fixed-arity",1,"~:fn-var",true,"^I",["^J",["^K",["^J",[["~$m"]]]]],"^L","Convert an associative-by-numeric-index collection into\n   an equivalent vector, with nil for any missing keys"],"~$diff",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",144,"^E",7,"^F",144,"^G",11,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]],"^L","Recursively compares a and b, returning a tuple of\n  [things-only-in-a things-only-in-b things-in-both].\n  Comparison rules:\n\n  * For equal a and b, return [nil nil a].\n  * Maps are subdiffed where keys match and values differ.\n  * Sets are never subdiffed.\n  * All sequential things are treated as associative collections\n    by their indexes, with results returned as vectors.\n  * Everything else (including strings!) is treated as\n    an atom and compared for equality."],"^7","~$clojure.data/diff","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",11,"^O",["^J",[["~$a","~$b"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",144,"^F",144,"^R",2,"^S",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]],"^L","Recursively compares a and b, returning a tuple of\n  [things-only-in-a things-only-in-b things-in-both].\n  Comparison rules:\n\n  * For equal a and b, return [nil nil a].\n  * Maps are subdiffed where keys match and values differ.\n  * Sets are never subdiffed.\n  * All sequential things are treated as associative collections\n    by their indexes, with results returned as vectors.\n  * Everything else (including strings!) is treated as\n    an atom and compared for equality."],"~$atom-diff",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",17,"^E",8,"^F",17,"^G",17,"^H",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]],"^L","Internal helper for diff."],"^H",true,"^7","~$clojure.data/atom-diff","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",17,"^O",["^J",[["~$a","~$b"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",17,"^F",17,"^R",2,"^S",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]],"^L","Internal helper for diff."],"~$diff-set",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",69,"^E",8,"^F",69,"^G",16,"^H",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]]],"^H",true,"^7","~$clojure.data/diff-set","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",16,"^O",["^J",[["~$a","~$b"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",69,"^F",69,"^R",2,"^S",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]]],"~$equality-partition",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",77,"^E",4,"^F",77,"^G",22,"~:protocol","~$clojure.data/EqualityPartition","^L","Implementation detail. Subject to change.","^I",["^J",["^K",["^J",[["~$x"]]]]]],"^[","^10","^7","~$clojure.data/equality-partition","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",22,"^O",["^J",[["~$x"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",75,"^F",77,"^R",1,"^S",true,"^I",["^J",["^K",["^J",[["~$x"]]]]],"^L","Implementation detail. Subject to change."],"~$EqualityPartition",["^ ","^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",75,"^E",14,"^F",75,"^G",31,"^L","Implementation detail. Subject to change.","~:protocol-symbol",true,"~:jsdoc",["^J",["@interface"]],"~:protocol-info",["^ ","~:methods",["^ ","^Z",[["~$x"]]]]],"^13",true,"^7","^10","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",31,"^E",1,"^D",75,"^15",["^ ","^16",["^ ","^Z",[["~$x"]]]],"~:info",null,"^F",75,"~:tag","~$any","~:impls",["^6",[null,"~$boolean","~$number","~$default","~$array","~$string","~$function"]],"^L","Implementation detail. Subject to change.","^14",["^J",["@interface"]]],"~$diff-associative",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",49,"^E",8,"^F",49,"^G",24,"^H",true,"^I",["^J",["^K",["^J",[["~$a","~$b"],["~$a","~$b","~$ks"]]]]],"^L","Diff associative things a and b, comparing only keys in ks (if supplied).","~:top-fn",["^ ","^N",false,"^R",3,"^O",["^J",[["~$a","~$b"],["~$a","~$b","^1B"]]],"^I",["^J",[["~$a","~$b"],["~$a","~$b","^1B"]]],"^Q",["^J",[null,null]]]],"^H",true,"^7","~$clojure.data/diff-associative","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",24,"^1C",["^ ","^N",false,"^R",3,"^O",["^J",[["~$a","~$b"],["~$a","~$b","^1B"]]],"^I",["^J",[["~$a","~$b"],["~$a","~$b","^1B"]]],"^Q",["^J",[null,null]]],"^O",["^J",[["~$a","~$b"],["~$a","~$b","^1B"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",49,"^F",49,"^R",3,"^S",true,"^I",["^J",[["~$a","~$b"],["~$a","~$b","^1B"]]],"^L","Diff associative things a and b, comparing only keys in ks (if supplied)."],"~$diff-associative-key",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",33,"^E",8,"^F",33,"^G",28,"^H",true,"^I",["^J",["^K",["^J",[["~$a","~$b","~$k"]]]]],"^L","Diff associative things a and b, comparing only the key k."],"^H",true,"^7","~$clojure.data/diff-associative-key","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",28,"^O",["^J",[["~$a","~$b","~$k"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",33,"^F",33,"^R",3,"^S",true,"^I",["^J",["^K",["^J",[["~$a","~$b","~$k"]]]]],"^L","Diff associative things a and b, comparing only the key k."],"~$diff-similar",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",81,"^E",4,"^F",81,"^G",16,"^[","~$clojure.data/Diff","^L","Implementation detail. Subject to change.","^I",["^J",["^K",["^J",[["~$a","~$b"]]]]]],"^[","^1H","^7","~$clojure.data/diff-similar","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",16,"^O",["^J",[["~$a","~$b"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",79,"^F",81,"^R",2,"^S",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]],"^L","Implementation detail. Subject to change."],"~$Diff",["^ ","^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",79,"^E",14,"^F",79,"^G",18,"^L","Implementation detail. Subject to change.","^13",true,"^14",["^J",["@interface"]],"^15",["^ ","^16",["^ ","^1G",[["~$a","~$b"]]]]],"^13",true,"^7","^1H","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",18,"^E",1,"^D",79,"^15",["^ ","^16",["^ ","^1G",[["~$a","~$b"]]]],"^17",null,"^F",79,"^18","^19","^1:",["^6",[null,"^1;","^1<","^1=","^1>","^1?","^1@"]],"^L","Implementation detail. Subject to change.","^14",["^J",["@interface"]]],"~$diff-sequential",["^ ","^A",null,"^B",["^ ","^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^D",62,"^E",8,"^F",62,"^G",23,"^H",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]]],"^H",true,"^7","~$clojure.data/diff-sequential","^N",false,"^C","/home/julien/.cljs/.aot_cache/1.10.329/A9F46FA/clojure/data.cljs","^G",23,"^O",["^J",[["~$a","~$b"]]],"^P",null,"^Q",["^J",[null,null]],"^E",1,"^D",62,"^F",62,"^R",2,"^S",true,"^I",["^J",["^K",["^J",[["~$a","~$b"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["~:default","~:sequential","~:set","~:atom","~:map"]],"~:order",["^1T","^1R","^1U","^1S","^1Q"]],"^L","Non-core data functions."]
\ No newline at end of file
diff --git a/js/clojure/data.js b/js/clojure/data.js
new file mode 100644
index 0000000..96323ec
--- /dev/null
+++ b/js/clojure/data.js
@@ -0,0 +1,358 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('clojure.data');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.set');
+/**
+ * Internal helper for diff.
+ */
+clojure.data.atom_diff = (function clojure$data$atom_diff(a,b){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(a,b)){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,null,a], null);
+} else {
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [a,b,null], null);
+}
+});
+/**
+ * Convert an associative-by-numeric-index collection into
+ * an equivalent vector, with nil for any missing keys
+ */
+clojure.data.vectorize = (function clojure$data$vectorize(m){
+if(cljs.core.seq(m)){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (result,p__5045){
+var vec__5046 = p__5045;
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5046,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5046,(1),null);
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(result,k,v);
+}),cljs.core.vec(cljs.core.repeat.cljs$core$IFn$_invoke$arity$2(cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.max,cljs.core.keys(m)),null)),m);
+} else {
+return null;
+}
+});
+/**
+ * Diff associative things a and b, comparing only the key k.
+ */
+clojure.data.diff_associative_key = (function clojure$data$diff_associative_key(a,b,k){
+var va = cljs.core.get.cljs$core$IFn$_invoke$arity$2(a,k);
+var vb = cljs.core.get.cljs$core$IFn$_invoke$arity$2(b,k);
+var vec__5049 = clojure.data.diff(va,vb);
+var a_STAR_ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5049,(0),null);
+var b_STAR_ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5049,(1),null);
+var ab = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5049,(2),null);
+var in_a = cljs.core.contains_QMARK_(a,k);
+var in_b = cljs.core.contains_QMARK_(b,k);
+var same = ((in_a) && (in_b) && (((!((ab == null))) || ((((va == null)) && ((vb == null)))))));
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [((((in_a) && (((!((a_STAR_ == null))) || (!(same))))))?cljs.core.PersistentArrayMap.createAsIfByAssoc([k,a_STAR_]):null),((((in_b) && (((!((b_STAR_ == null))) || (!(same))))))?cljs.core.PersistentArrayMap.createAsIfByAssoc([k,b_STAR_]):null),((same)?cljs.core.PersistentArrayMap.createAsIfByAssoc([k,ab]):null)], null);
+});
+/**
+ * Diff associative things a and b, comparing only keys in ks (if supplied).
+ */
+clojure.data.diff_associative = (function clojure$data$diff_associative(var_args){
+var G__5053 = arguments.length;
+switch (G__5053) {
+case 2:
+return clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
+return clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$3(a,b,clojure.set.union.cljs$core$IFn$_invoke$arity$2(cljs.core.keys(a),cljs.core.keys(b)));
+});
+
+clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$3 = (function (a,b,ks){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (diff1,diff2){
+return cljs.core.doall.cljs$core$IFn$_invoke$arity$1(cljs.core.map.cljs$core$IFn$_invoke$arity$3(cljs.core.merge,diff1,diff2));
+}),new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,null,null], null),cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.partial.cljs$core$IFn$_invoke$arity$3(clojure.data.diff_associative_key,a,b),ks));
+});
+
+clojure.data.diff_associative.cljs$lang$maxFixedArity = 3;
+
+clojure.data.diff_sequential = (function clojure$data$diff_sequential(a,b){
+return cljs.core.vec(cljs.core.map.cljs$core$IFn$_invoke$arity$2(clojure.data.vectorize,clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$3(((cljs.core.vector_QMARK_(a))?a:cljs.core.vec(a)),((cljs.core.vector_QMARK_(b))?b:cljs.core.vec(b)),cljs.core.range.cljs$core$IFn$_invoke$arity$1((function (){var x__4024__auto__ = cljs.core.count(a);
+var y__4025__auto__ = cljs.core.count(b);
+return ((x__4024__auto__ > y__4025__auto__) ? x__4024__auto__ : y__4025__auto__);
+})()))));
+});
+clojure.data.diff_set = (function clojure$data$diff_set(a,b){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.not_empty(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(a,b)),cljs.core.not_empty(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(b,a)),cljs.core.not_empty(clojure.set.intersection.cljs$core$IFn$_invoke$arity$2(a,b))], null);
+});
+
+/**
+ * Implementation detail. Subject to change.
+ * @interface
+ */
+clojure.data.EqualityPartition = function(){};
+
+/**
+ * Implementation detail. Subject to change.
+ */
+clojure.data.equality_partition = (function clojure$data$equality_partition(x){
+if(((!((x == null))) && (!((x.clojure$data$EqualityPartition$equality_partition$arity$1 == null))))){
+return x.clojure$data$EqualityPartition$equality_partition$arity$1(x);
+} else {
+var x__4230__auto__ = (((x == null))?null:x);
+var m__4231__auto__ = (clojure.data.equality_partition[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto__.call(null,x));
+} else {
+var m__4231__auto____$1 = (clojure.data.equality_partition["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4231__auto____$1.call(null,x));
+} else {
+throw cljs.core.missing_protocol("EqualityPartition.equality-partition",x);
+}
+}
+}
+});
+
+
+/**
+ * Implementation detail. Subject to change.
+ * @interface
+ */
+clojure.data.Diff = function(){};
+
+/**
+ * Implementation detail. Subject to change.
+ */
+clojure.data.diff_similar = (function clojure$data$diff_similar(a,b){
+if(((!((a == null))) && (!((a.clojure$data$Diff$diff_similar$arity$2 == null))))){
+return a.clojure$data$Diff$diff_similar$arity$2(a,b);
+} else {
+var x__4230__auto__ = (((a == null))?null:a);
+var m__4231__auto__ = (clojure.data.diff_similar[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(a,b) : m__4231__auto__.call(null,a,b));
+} else {
+var m__4231__auto____$1 = (clojure.data.diff_similar["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(a,b) : m__4231__auto____$1.call(null,a,b));
+} else {
+throw cljs.core.missing_protocol("Diff.diff-similar",a);
+}
+}
+}
+});
+
+goog.object.set(clojure.data.EqualityPartition,"null",true);
+
+var G__5055_5079 = clojure.data.equality_partition;
+var G__5056_5080 = "null";
+var G__5057_5081 = ((function (G__5055_5079,G__5056_5080){
+return (function (x){
+return cljs.core.cst$kw$atom;
+});})(G__5055_5079,G__5056_5080))
+;
+goog.object.set(G__5055_5079,G__5056_5080,G__5057_5081);
+
+goog.object.set(clojure.data.EqualityPartition,"string",true);
+
+var G__5058_5082 = clojure.data.equality_partition;
+var G__5059_5083 = "string";
+var G__5060_5084 = ((function (G__5058_5082,G__5059_5083){
+return (function (x){
+return cljs.core.cst$kw$atom;
+});})(G__5058_5082,G__5059_5083))
+;
+goog.object.set(G__5058_5082,G__5059_5083,G__5060_5084);
+
+goog.object.set(clojure.data.EqualityPartition,"number",true);
+
+var G__5061_5085 = clojure.data.equality_partition;
+var G__5062_5086 = "number";
+var G__5063_5087 = ((function (G__5061_5085,G__5062_5086){
+return (function (x){
+return cljs.core.cst$kw$atom;
+});})(G__5061_5085,G__5062_5086))
+;
+goog.object.set(G__5061_5085,G__5062_5086,G__5063_5087);
+
+goog.object.set(clojure.data.EqualityPartition,"array",true);
+
+var G__5064_5088 = clojure.data.equality_partition;
+var G__5065_5089 = "array";
+var G__5066_5090 = ((function (G__5064_5088,G__5065_5089){
+return (function (x){
+return cljs.core.cst$kw$sequential;
+});})(G__5064_5088,G__5065_5089))
+;
+goog.object.set(G__5064_5088,G__5065_5089,G__5066_5090);
+
+goog.object.set(clojure.data.EqualityPartition,"function",true);
+
+var G__5067_5091 = clojure.data.equality_partition;
+var G__5068_5092 = "function";
+var G__5069_5093 = ((function (G__5067_5091,G__5068_5092){
+return (function (x){
+return cljs.core.cst$kw$atom;
+});})(G__5067_5091,G__5068_5092))
+;
+goog.object.set(G__5067_5091,G__5068_5092,G__5069_5093);
+
+goog.object.set(clojure.data.EqualityPartition,"boolean",true);
+
+var G__5070_5094 = clojure.data.equality_partition;
+var G__5071_5095 = "boolean";
+var G__5072_5096 = ((function (G__5070_5094,G__5071_5095){
+return (function (x){
+return cljs.core.cst$kw$atom;
+});})(G__5070_5094,G__5071_5095))
+;
+goog.object.set(G__5070_5094,G__5071_5095,G__5072_5096);
+
+goog.object.set(clojure.data.EqualityPartition,"_",true);
+
+var G__5073_5097 = clojure.data.equality_partition;
+var G__5074_5098 = "_";
+var G__5075_5099 = ((function (G__5073_5097,G__5074_5098){
+return (function (x){
+if(((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition0$ & (1024))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IMap$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x))){
+return cljs.core.cst$kw$map;
+} else {
+if(((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition0$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISet$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x))){
+return cljs.core.cst$kw$set;
+} else {
+if(((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISequential$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x))){
+return cljs.core.cst$kw$sequential;
+} else {
+return cljs.core.cst$kw$atom;
+
+}
+}
+}
+});})(G__5073_5097,G__5074_5098))
+;
+goog.object.set(G__5073_5097,G__5074_5098,G__5075_5099);
+goog.object.set(clojure.data.Diff,"null",true);
+
+var G__5100_5124 = clojure.data.diff_similar;
+var G__5101_5125 = "null";
+var G__5102_5126 = ((function (G__5100_5124,G__5101_5125){
+return (function (a,b){
+return clojure.data.atom_diff(a,b);
+});})(G__5100_5124,G__5101_5125))
+;
+goog.object.set(G__5100_5124,G__5101_5125,G__5102_5126);
+
+goog.object.set(clojure.data.Diff,"string",true);
+
+var G__5103_5127 = clojure.data.diff_similar;
+var G__5104_5128 = "string";
+var G__5105_5129 = ((function (G__5103_5127,G__5104_5128){
+return (function (a,b){
+return clojure.data.atom_diff(a,b);
+});})(G__5103_5127,G__5104_5128))
+;
+goog.object.set(G__5103_5127,G__5104_5128,G__5105_5129);
+
+goog.object.set(clojure.data.Diff,"number",true);
+
+var G__5106_5130 = clojure.data.diff_similar;
+var G__5107_5131 = "number";
+var G__5108_5132 = ((function (G__5106_5130,G__5107_5131){
+return (function (a,b){
+return clojure.data.atom_diff(a,b);
+});})(G__5106_5130,G__5107_5131))
+;
+goog.object.set(G__5106_5130,G__5107_5131,G__5108_5132);
+
+goog.object.set(clojure.data.Diff,"array",true);
+
+var G__5109_5133 = clojure.data.diff_similar;
+var G__5110_5134 = "array";
+var G__5111_5135 = ((function (G__5109_5133,G__5110_5134){
+return (function (a,b){
+return clojure.data.diff_sequential(a,b);
+});})(G__5109_5133,G__5110_5134))
+;
+goog.object.set(G__5109_5133,G__5110_5134,G__5111_5135);
+
+goog.object.set(clojure.data.Diff,"function",true);
+
+var G__5112_5136 = clojure.data.diff_similar;
+var G__5113_5137 = "function";
+var G__5114_5138 = ((function (G__5112_5136,G__5113_5137){
+return (function (a,b){
+return clojure.data.atom_diff(a,b);
+});})(G__5112_5136,G__5113_5137))
+;
+goog.object.set(G__5112_5136,G__5113_5137,G__5114_5138);
+
+goog.object.set(clojure.data.Diff,"boolean",true);
+
+var G__5115_5139 = clojure.data.diff_similar;
+var G__5116_5140 = "boolean";
+var G__5117_5141 = ((function (G__5115_5139,G__5116_5140){
+return (function (a,b){
+return clojure.data.atom_diff(a,b);
+});})(G__5115_5139,G__5116_5140))
+;
+goog.object.set(G__5115_5139,G__5116_5140,G__5117_5141);
+
+goog.object.set(clojure.data.Diff,"_",true);
+
+var G__5118_5142 = clojure.data.diff_similar;
+var G__5119_5143 = "_";
+var G__5120_5144 = ((function (G__5118_5142,G__5119_5143){
+return (function (a,b){
+var fexpr__5122 = (function (){var G__5123 = clojure.data.equality_partition(a);
+var G__5123__$1 = (((G__5123 instanceof cljs.core.Keyword))?G__5123.fqn:null);
+switch (G__5123__$1) {
+case "atom":
+return clojure.data.atom_diff;
+
+break;
+case "set":
+return clojure.data.diff_set;
+
+break;
+case "sequential":
+return clojure.data.diff_sequential;
+
+break;
+case "map":
+return clojure.data.diff_associative;
+
+break;
+default:
+throw (new Error(["No matching clause: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__5123__$1)].join('')));
+
+}
+})();
+return (fexpr__5122.cljs$core$IFn$_invoke$arity$2 ? fexpr__5122.cljs$core$IFn$_invoke$arity$2(a,b) : fexpr__5122.call(null,a,b));
+});})(G__5118_5142,G__5119_5143))
+;
+goog.object.set(G__5118_5142,G__5119_5143,G__5120_5144);
+/**
+ * Recursively compares a and b, returning a tuple of
+ *   [things-only-in-a things-only-in-b things-in-both].
+ *   Comparison rules:
+ * 
+ *   * For equal a and b, return [nil nil a].
+ *   * Maps are subdiffed where keys match and values differ.
+ *   * Sets are never subdiffed.
+ *   * All sequential things are treated as associative collections
+ *  by their indexes, with results returned as vectors.
+ *   * Everything else (including strings!) is treated as
+ *  an atom and compared for equality.
+ */
+clojure.data.diff = (function clojure$data$diff(a,b){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(a,b)){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,null,a], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(clojure.data.equality_partition(a),clojure.data.equality_partition(b))){
+return clojure.data.diff_similar(a,b);
+} else {
+return clojure.data.atom_diff(a,b);
+}
+}
+});
diff --git a/js/clojure/set.cljs b/js/clojure/set.cljs
new file mode 100644
index 0000000..b9ba41f
--- /dev/null
+++ b/js/clojure/set.cljs
@@ -0,0 +1,161 @@
+;   Copyright (c) Rich Hickey. All rights reserved.
+;   The use and distribution terms for this software are covered by the
+;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;   which can be found in the file epl-v10.html at the root of this distribution.
+;   By using this software in any fashion, you are agreeing to be bound by
+;   the terms of this license.
+;   You must not remove this notice, or any other, from this software.
+
+(ns ^{:doc "Set operations such as union/intersection."
+       :author "Rich Hickey"}
+       clojure.set)
+
+(defn- bubble-max-key [k coll]
+  "Move a maximal element of coll according to fn k (which returns a number) 
+   to the front of coll."
+  (let [max (apply max-key k coll)]
+    (cons max (remove #(identical? max %) coll))))
+
+(defn union
+  "Return a set that is the union of the input sets"
+  ([] #{})
+  ([s1] s1)
+  ([s1 s2]
+     (if (< (count s1) (count s2))
+       (reduce conj s2 s1)
+       (reduce conj s1 s2)))
+  ([s1 s2 & sets]
+     (let [bubbled-sets (bubble-max-key count (conj sets s2 s1))]
+       (reduce into (first bubbled-sets) (rest bubbled-sets)))))
+
+(defn intersection
+  "Return a set that is the intersection of the input sets"
+  ([s1] s1)
+  ([s1 s2]
+     (if (< (count s2) (count s1))
+       (recur s2 s1)
+       (reduce (fn [result item]
+                   (if (contains? s2 item)
+		     result
+                     (disj result item)))
+	       s1 s1)))
+  ([s1 s2 & sets] 
+     (let [bubbled-sets (bubble-max-key #(- (count %)) (conj sets s2 s1))]
+       (reduce intersection (first bubbled-sets) (rest bubbled-sets)))))
+
+(defn difference
+  "Return a set that is the first set without elements of the remaining sets"
+  ([s1] s1)
+  ([s1 s2] 
+     (if (< (count s1) (count s2))
+       (reduce (fn [result item] 
+                   (if (contains? s2 item) 
+                     (disj result item) 
+                     result))
+               s1 s1)
+       (reduce disj s1 s2)))
+  ([s1 s2 & sets] 
+     (reduce difference s1 (conj sets s2))))
+
+
+(defn select
+  "Returns a set of the elements for which pred is true"
+  [pred xset]
+    (reduce (fn [s k] (if (pred k) s (disj s k)))
+            xset xset))
+
+(defn project
+  "Returns a rel of the elements of xrel with only the keys in ks"
+  [xrel ks]
+    (set (map #(select-keys % ks) xrel)))
+
+(defn rename-keys
+  "Returns the map with the keys in kmap renamed to the vals in kmap"
+  [map kmap]
+    (reduce
+     (fn [m [old new]]
+       (if (contains? map old)
+         (assoc m new (get map old))
+         m))
+     (apply dissoc map (keys kmap)) kmap))
+
+(defn rename
+  "Returns a rel of the maps in xrel with the keys in kmap renamed to the vals in kmap"
+  [xrel kmap]
+    (set (map #(rename-keys % kmap) xrel)))
+
+(defn index
+  "Returns a map of the distinct values of ks in the xrel mapped to a
+  set of the maps in xrel with the corresponding values of ks."
+  [xrel ks]
+    (reduce
+     (fn [m x]
+       (let [ik (select-keys x ks)]
+         (assoc m ik (conj (get m ik #{}) x))))
+     {} xrel))
+   
+(defn map-invert
+  "Returns the map with the vals mapped to the keys."
+  [m] (reduce (fn [m [k v]] (assoc m v k)) {} m))
+
+(defn join
+  "When passed 2 rels, returns the rel corresponding to the natural
+  join. When passed an additional keymap, joins on the corresponding
+  keys."
+  ([xrel yrel] ;natural join
+   (if (and (seq xrel) (seq yrel))
+     (let [ks (intersection (set (keys (first xrel))) (set (keys (first yrel))))
+           [r s] (if (<= (count xrel) (count yrel))
+                   [xrel yrel]
+                   [yrel xrel])
+           idx (index r ks)]
+       (reduce (fn [ret x]
+                 (let [found (idx (select-keys x ks))]
+                   (if found
+                     (reduce #(conj %1 (merge %2 x)) ret found)
+                     ret)))
+               #{} s))
+     #{}))
+  ([xrel yrel km] ;arbitrary key mapping
+   (let [[r s k] (if (<= (count xrel) (count yrel))
+                   [xrel yrel (map-invert km)]
+                   [yrel xrel km])
+         idx (index r (vals k))]
+     (reduce (fn [ret x]
+               (let [found (idx (rename-keys (select-keys x (keys k)) k))]
+                 (if found
+                   (reduce #(conj %1 (merge %2 x)) ret found)
+                   ret)))
+             #{} s))))
+
+(defn subset? 
+  "Is set1 a subset of set2?"
+  [set1 set2]
+  (and (<= (count set1) (count set2))
+       (every? #(contains? set2 %) set1)))
+
+(defn superset? 
+  "Is set1 a superset of set2?"
+  [set1 set2]
+  (and (>= (count set1) (count set2))
+       (every? #(contains? set1 %) set2)))
+
+(comment
+(refer 'set)
+(def xs #{{:a 11 :b 1 :c 1 :d 4}
+         {:a 2 :b 12 :c 2 :d 6}
+         {:a 3 :b 3 :c 3 :d 8 :f 42}})
+
+(def ys #{{:a 11 :b 11 :c 11 :e 5}
+         {:a 12 :b 11 :c 12 :e 3}
+         {:a 3 :b 3 :c 3 :e 7 }})
+
+(join xs ys)
+(join xs (rename ys {:b :yb :c :yc}) {:a :a})
+
+(union #{:a :b :c} #{:c :d :e })
+(difference #{:a :b :c} #{:c :d :e})
+(intersection #{:a :b :c} #{:c :d :e})
+
+(index ys [:b]))
+
diff --git a/js/clojure/set.cljs.cache.json b/js/clojure/set.cljs.cache.json
new file mode 100644
index 0000000..4ca2236
--- /dev/null
+++ b/js/clojure/set.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$clojure.set","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$union",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","~:line",19,"~:column",7,"~:end-line",19,"~:end-column",12,"~:arglists",["~#list",["~$quote",["^G",[[],["~$s1"],["^I","~$s2"],["^I","^J","~$&","~$sets"]]]]],"~:doc","Return a set that is the union of the input sets","~:top-fn",["^ ","~:variadic",true,"~:max-fixed-arity",2,"~:method-params",["^G",[[],["^I"],["^I","^J"]]],"^F",["^G",[[],["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"~:arglists-meta",["^G",[null,null,null,null]]]],"^7","~$clojure.set/union","^N",true,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",12,"^M",["^ ","^N",true,"^O",2,"^P",["^G",[[],["^I"],["^I","^J"]]],"^F",["^G",[[],["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^Q",["^G",[null,null,null,null]]],"^P",["^G",[[],["^I"],["^I","^J"]]],"~:protocol-impl",null,"^Q",["^G",[null,null,null,null]],"^C",1,"^B",19,"^D",19,"^O",2,"~:fn-var",true,"^F",["^G",[[],["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^L","Return a set that is the union of the input sets"],"~$map-invert",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",97,"^C",7,"^D",97,"^E",17,"^F",["^G",["^H",["^G",[["~$m"]]]]],"^L","Returns the map with the vals mapped to the keys."],"^7","~$clojure.set/map-invert","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",17,"^P",["^G",[["~$m"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",97,"^D",97,"^O",1,"^T",true,"^F",["^G",["^H",["^G",[["~$m"]]]]],"^L","Returns the map with the vals mapped to the keys."],"~$join",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",101,"^C",7,"^D",101,"^E",11,"^F",["^G",["^H",["^G",[["~$xrel","~$yrel"],["^X","^Y","~$km"]]]]],"^L","When passed 2 rels, returns the rel corresponding to the natural\n  join. When passed an additional keymap, joins on the corresponding\n  keys.","^M",["^ ","^N",false,"^O",3,"^P",["^G",[["^X","^Y"],["^X","^Y","^Z"]]],"^F",["^G",[["^X","^Y"],["^X","^Y","^Z"]]],"^Q",["^G",[null,null]]]],"^7","~$clojure.set/join","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",11,"^M",["^ ","^N",false,"^O",3,"^P",["^G",[["^X","^Y"],["^X","^Y","^Z"]]],"^F",["^G",[["^X","^Y"],["^X","^Y","^Z"]]],"^Q",["^G",[null,null]]],"^P",["^G",[["^X","^Y"],["^X","^Y","^Z"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",101,"^D",101,"^O",3,"^T",true,"^F",["^G",[["^X","^Y"],["^X","^Y","^Z"]]],"^L","When passed 2 rels, returns the rel corresponding to the natural\n  join. When passed an additional keymap, joins on the corresponding\n  keys."],"~$select",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",61,"^C",7,"^D",61,"^E",13,"^F",["^G",["^H",["^G",[["~$pred","~$xset"]]]]],"^L","Returns a set of the elements for which pred is true"],"^7","~$clojure.set/select","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",13,"^P",["^G",[["^11","^12"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",61,"^D",61,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["^11","^12"]]]]],"^L","Returns a set of the elements for which pred is true"],"~$intersection",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",31,"^C",7,"^D",31,"^E",19,"^F",["^G",["^H",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]]]],"^L","Return a set that is the intersection of the input sets","^M",["^ ","^N",true,"^O",2,"^P",["^G",[["^I"],["^I","^J"]]],"^F",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^Q",["^G",[null,null,null]]]],"^7","~$clojure.set/intersection","^N",true,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",19,"^M",["^ ","^N",true,"^O",2,"^P",["^G",[["^I"],["^I","^J"]]],"^F",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^Q",["^G",[null,null,null]]],"^P",["^G",[["^I"],["^I","^J"]]],"^S",null,"^Q",["^G",[null,null,null]],"^C",1,"^B",31,"^D",31,"^O",2,"^T",true,"^F",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^L","Return a set that is the intersection of the input sets"],"~$superset?",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",137,"^C",7,"^D",137,"^E",16,"^F",["^G",["^H",["^G",[["~$set1","~$set2"]]]]],"^L","Is set1 a superset of set2?"],"^7","~$clojure.set/superset?","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",16,"^P",["^G",[["^17","^18"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",137,"^D",137,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["^17","^18"]]]]],"^L","Is set1 a superset of set2?"],"~$index",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",87,"^C",7,"^D",87,"^E",12,"^F",["^G",["^H",["^G",[["^X","~$ks"]]]]],"^L","Returns a map of the distinct values of ks in the xrel mapped to a\n  set of the maps in xrel with the corresponding values of ks."],"^7","~$clojure.set/index","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",12,"^P",["^G",[["^X","^1;"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",87,"^D",87,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["^X","^1;"]]]]],"^L","Returns a map of the distinct values of ks in the xrel mapped to a\n  set of the maps in xrel with the corresponding values of ks."],"~$bubble-max-key",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",13,"^C",8,"^D",13,"^E",22,"~:private",true,"^F",["^G",["^H",["^G",[["~$k","~$coll"]]]]]],"^1>",true,"^7","~$clojure.set/bubble-max-key","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",22,"^P",["^G",[["~$k","^1?"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",13,"^D",13,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["~$k","^1?"]]]]]],"~$subset?",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",131,"^C",7,"^D",131,"^E",14,"^F",["^G",["^H",["^G",[["^17","^18"]]]]],"^L","Is set1 a subset of set2?"],"^7","~$clojure.set/subset?","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",14,"^P",["^G",[["^17","^18"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",131,"^D",131,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["^17","^18"]]]]],"^L","Is set1 a subset of set2?"],"~$rename",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",82,"^C",7,"^D",82,"^E",13,"^F",["^G",["^H",["^G",[["^X","~$kmap"]]]]],"^L","Returns a rel of the maps in xrel with the keys in kmap renamed to the vals in kmap"],"^7","~$clojure.set/rename","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",13,"^P",["^G",[["^X","^1D"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",82,"^D",82,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["^X","^1D"]]]]],"^L","Returns a rel of the maps in xrel with the keys in kmap renamed to the vals in kmap"],"~$rename-keys",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",72,"^C",7,"^D",72,"^E",18,"^F",["^G",["^H",["^G",[["~$map","^1D"]]]]],"^L","Returns the map with the keys in kmap renamed to the vals in kmap"],"^7","~$clojure.set/rename-keys","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",18,"^P",["^G",[["^1G","^1D"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",72,"^D",72,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["^1G","^1D"]]]]],"^L","Returns the map with the keys in kmap renamed to the vals in kmap"],"~$project",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",67,"^C",7,"^D",67,"^E",14,"^F",["^G",["^H",["^G",[["^X","^1;"]]]]],"^L","Returns a rel of the elements of xrel with only the keys in ks"],"^7","~$clojure.set/project","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",14,"^P",["^G",[["^X","^1;"]]],"^S",null,"^Q",["^G",[null,null]],"^C",1,"^B",67,"^D",67,"^O",2,"^T",true,"^F",["^G",["^H",["^G",[["^X","^1;"]]]]],"^L","Returns a rel of the elements of xrel with only the keys in ks"],"~$difference",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^B",46,"^C",7,"^D",46,"^E",17,"^F",["^G",["^H",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]]]],"^L","Return a set that is the first set without elements of the remaining sets","^M",["^ ","^N",true,"^O",2,"^P",["^G",[["^I"],["^I","^J"]]],"^F",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^Q",["^G",[null,null,null]]]],"^7","~$clojure.set/difference","^N",true,"^A","/home/julien/.cljs/.aot_cache/1.10.329/3EFCBF0/clojure/set.cljs","^E",17,"^M",["^ ","^N",true,"^O",2,"^P",["^G",[["^I"],["^I","^J"]]],"^F",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^Q",["^G",[null,null,null]]],"^P",["^G",[["^I"],["^I","^J"]]],"^S",null,"^Q",["^G",[null,null,null]],"^C",1,"^B",46,"^D",46,"^O",2,"^T",true,"^F",["^G",[["^I"],["^I","^J"],["^I","^J","~$&","^K"]]],"^L","Return a set that is the first set without elements of the remaining sets"]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"^L","Set operations such as union/intersection."]
\ No newline at end of file
diff --git a/js/clojure/set.js b/js/clojure/set.js
new file mode 100644
index 0000000..5b00c03
--- /dev/null
+++ b/js/clojure/set.js
@@ -0,0 +1,394 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('clojure.set');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+clojure.set.bubble_max_key = (function clojure$set$bubble_max_key(k,coll){
+
+var max = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.max_key,k,coll);
+return cljs.core.cons(max,cljs.core.remove.cljs$core$IFn$_invoke$arity$2(((function (max){
+return (function (p1__3504_SHARP_){
+return (max === p1__3504_SHARP_);
+});})(max))
+,coll));
+});
+/**
+ * Return a set that is the union of the input sets
+ */
+clojure.set.union = (function clojure$set$union(var_args){
+var G__3509 = arguments.length;
+switch (G__3509) {
+case 0:
+return clojure.set.union.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return clojure.set.union.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return clojure.set.union.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3511 = arguments.length;
+var i__4519__auto___3512 = (0);
+while(true){
+if((i__4519__auto___3512 < len__4518__auto___3511)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3512]));
+
+var G__3513 = (i__4519__auto___3512 + (1));
+i__4519__auto___3512 = G__3513;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+clojure.set.union.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.PersistentHashSet.EMPTY;
+});
+
+clojure.set.union.cljs$core$IFn$_invoke$arity$1 = (function (s1){
+return s1;
+});
+
+clojure.set.union.cljs$core$IFn$_invoke$arity$2 = (function (s1,s2){
+if((cljs.core.count(s1) < cljs.core.count(s2))){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,s2,s1);
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,s1,s2);
+}
+});
+
+clojure.set.union.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
+var bubbled_sets = clojure.set.bubble_max_key(cljs.core.count,cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(sets,s2,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([s1], 0)));
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.into,cljs.core.first(bubbled_sets),cljs.core.rest(bubbled_sets));
+});
+
+/** @this {Function} */
+clojure.set.union.cljs$lang$applyTo = (function (seq3506){
+var G__3507 = cljs.core.first(seq3506);
+var seq3506__$1 = cljs.core.next(seq3506);
+var G__3508 = cljs.core.first(seq3506__$1);
+var seq3506__$2 = cljs.core.next(seq3506__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3507,G__3508,seq3506__$2);
+});
+
+clojure.set.union.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Return a set that is the intersection of the input sets
+ */
+clojure.set.intersection = (function clojure$set$intersection(var_args){
+var G__3519 = arguments.length;
+switch (G__3519) {
+case 1:
+return clojure.set.intersection.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return clojure.set.intersection.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3521 = arguments.length;
+var i__4519__auto___3522 = (0);
+while(true){
+if((i__4519__auto___3522 < len__4518__auto___3521)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3522]));
+
+var G__3523 = (i__4519__auto___3522 + (1));
+i__4519__auto___3522 = G__3523;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+clojure.set.intersection.cljs$core$IFn$_invoke$arity$1 = (function (s1){
+return s1;
+});
+
+clojure.set.intersection.cljs$core$IFn$_invoke$arity$2 = (function (s1,s2){
+while(true){
+if((cljs.core.count(s2) < cljs.core.count(s1))){
+var G__3524 = s2;
+var G__3525 = s1;
+s1 = G__3524;
+s2 = G__3525;
+continue;
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (s1,s2){
+return (function (result,item){
+if(cljs.core.contains_QMARK_(s2,item)){
+return result;
+} else {
+return cljs.core.disj.cljs$core$IFn$_invoke$arity$2(result,item);
+}
+});})(s1,s2))
+,s1,s1);
+}
+break;
+}
+});
+
+clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
+var bubbled_sets = clojure.set.bubble_max_key((function (p1__3514_SHARP_){
+return (- cljs.core.count(p1__3514_SHARP_));
+}),cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(sets,s2,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([s1], 0)));
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(clojure.set.intersection,cljs.core.first(bubbled_sets),cljs.core.rest(bubbled_sets));
+});
+
+/** @this {Function} */
+clojure.set.intersection.cljs$lang$applyTo = (function (seq3516){
+var G__3517 = cljs.core.first(seq3516);
+var seq3516__$1 = cljs.core.next(seq3516);
+var G__3518 = cljs.core.first(seq3516__$1);
+var seq3516__$2 = cljs.core.next(seq3516__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3517,G__3518,seq3516__$2);
+});
+
+clojure.set.intersection.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Return a set that is the first set without elements of the remaining sets
+ */
+clojure.set.difference = (function clojure$set$difference(var_args){
+var G__3530 = arguments.length;
+switch (G__3530) {
+case 1:
+return clojure.set.difference.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return clojure.set.difference.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3532 = arguments.length;
+var i__4519__auto___3533 = (0);
+while(true){
+if((i__4519__auto___3533 < len__4518__auto___3532)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3533]));
+
+var G__3534 = (i__4519__auto___3533 + (1));
+i__4519__auto___3533 = G__3534;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((2)),(0),null));
+return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4534__auto__);
+
+}
+});
+
+clojure.set.difference.cljs$core$IFn$_invoke$arity$1 = (function (s1){
+return s1;
+});
+
+clojure.set.difference.cljs$core$IFn$_invoke$arity$2 = (function (s1,s2){
+if((cljs.core.count(s1) < cljs.core.count(s2))){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (result,item){
+if(cljs.core.contains_QMARK_(s2,item)){
+return cljs.core.disj.cljs$core$IFn$_invoke$arity$2(result,item);
+} else {
+return result;
+}
+}),s1,s1);
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.disj,s1,s2);
+}
+});
+
+clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(clojure.set.difference,s1,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(sets,s2));
+});
+
+/** @this {Function} */
+clojure.set.difference.cljs$lang$applyTo = (function (seq3527){
+var G__3528 = cljs.core.first(seq3527);
+var seq3527__$1 = cljs.core.next(seq3527);
+var G__3529 = cljs.core.first(seq3527__$1);
+var seq3527__$2 = cljs.core.next(seq3527__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3528,G__3529,seq3527__$2);
+});
+
+clojure.set.difference.cljs$lang$maxFixedArity = (2);
+
+/**
+ * Returns a set of the elements for which pred is true
+ */
+clojure.set.select = (function clojure$set$select(pred,xset){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (s,k){
+if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(k) : pred.call(null,k)))){
+return s;
+} else {
+return cljs.core.disj.cljs$core$IFn$_invoke$arity$2(s,k);
+}
+}),xset,xset);
+});
+/**
+ * Returns a rel of the elements of xrel with only the keys in ks
+ */
+clojure.set.project = (function clojure$set$project(xrel,ks){
+return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__3535_SHARP_){
+return cljs.core.select_keys(p1__3535_SHARP_,ks);
+}),xrel));
+});
+/**
+ * Returns the map with the keys in kmap renamed to the vals in kmap
+ */
+clojure.set.rename_keys = (function clojure$set$rename_keys(map,kmap){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m,p__3536){
+var vec__3537 = p__3536;
+var old = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3537,(0),null);
+var new$ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3537,(1),null);
+if(cljs.core.contains_QMARK_(map,old)){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,new$,cljs.core.get.cljs$core$IFn$_invoke$arity$2(map,old));
+} else {
+return m;
+}
+}),cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.dissoc,map,cljs.core.keys(kmap)),kmap);
+});
+/**
+ * Returns a rel of the maps in xrel with the keys in kmap renamed to the vals in kmap
+ */
+clojure.set.rename = (function clojure$set$rename(xrel,kmap){
+return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__3540_SHARP_){
+return clojure.set.rename_keys(p1__3540_SHARP_,kmap);
+}),xrel));
+});
+/**
+ * Returns a map of the distinct values of ks in the xrel mapped to a
+ *   set of the maps in xrel with the corresponding values of ks.
+ */
+clojure.set.index = (function clojure$set$index(xrel,ks){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m,x){
+var ik = cljs.core.select_keys(x,ks);
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,ik,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(m,ik,cljs.core.PersistentHashSet.EMPTY),x));
+}),cljs.core.PersistentArrayMap.EMPTY,xrel);
+});
+/**
+ * Returns the map with the vals mapped to the keys.
+ */
+clojure.set.map_invert = (function clojure$set$map_invert(m){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m__$1,p__3541){
+var vec__3542 = p__3541;
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3542,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3542,(1),null);
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m__$1,v,k);
+}),cljs.core.PersistentArrayMap.EMPTY,m);
+});
+/**
+ * When passed 2 rels, returns the rel corresponding to the natural
+ *   join. When passed an additional keymap, joins on the corresponding
+ *   keys.
+ */
+clojure.set.join = (function clojure$set$join(var_args){
+var G__3550 = arguments.length;
+switch (G__3550) {
+case 2:
+return clojure.set.join.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return clojure.set.join.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+clojure.set.join.cljs$core$IFn$_invoke$arity$2 = (function (xrel,yrel){
+if(((cljs.core.seq(xrel)) && (cljs.core.seq(yrel)))){
+var ks = clojure.set.intersection.cljs$core$IFn$_invoke$arity$2(cljs.core.set(cljs.core.keys(cljs.core.first(xrel))),cljs.core.set(cljs.core.keys(cljs.core.first(yrel))));
+var vec__3551 = (((cljs.core.count(xrel) <= cljs.core.count(yrel)))?new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [xrel,yrel], null):new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [yrel,xrel], null));
+var r = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3551,(0),null);
+var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3551,(1),null);
+var idx = clojure.set.index(r,ks);
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (ks,vec__3551,r,s,idx){
+return (function (ret,x){
+var found = (function (){var G__3554 = cljs.core.select_keys(x,ks);
+return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__3554) : idx.call(null,G__3554));
+})();
+if(cljs.core.truth_(found)){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (found,ks,vec__3551,r,s,idx){
+return (function (p1__3545_SHARP_,p2__3546_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__3545_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__3546_SHARP_,x], 0)));
+});})(found,ks,vec__3551,r,s,idx))
+,ret,found);
+} else {
+return ret;
+}
+});})(ks,vec__3551,r,s,idx))
+,cljs.core.PersistentHashSet.EMPTY,s);
+} else {
+return cljs.core.PersistentHashSet.EMPTY;
+}
+});
+
+clojure.set.join.cljs$core$IFn$_invoke$arity$3 = (function (xrel,yrel,km){
+var vec__3555 = (((cljs.core.count(xrel) <= cljs.core.count(yrel)))?new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [xrel,yrel,clojure.set.map_invert(km)], null):new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [yrel,xrel,km], null));
+var r = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3555,(0),null);
+var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3555,(1),null);
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3555,(2),null);
+var idx = clojure.set.index(r,cljs.core.vals(k));
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (vec__3555,r,s,k,idx){
+return (function (ret,x){
+var found = (function (){var G__3558 = clojure.set.rename_keys(cljs.core.select_keys(x,cljs.core.keys(k)),k);
+return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__3558) : idx.call(null,G__3558));
+})();
+if(cljs.core.truth_(found)){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (found,vec__3555,r,s,k,idx){
+return (function (p1__3547_SHARP_,p2__3548_SHARP_){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__3547_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__3548_SHARP_,x], 0)));
+});})(found,vec__3555,r,s,k,idx))
+,ret,found);
+} else {
+return ret;
+}
+});})(vec__3555,r,s,k,idx))
+,cljs.core.PersistentHashSet.EMPTY,s);
+});
+
+clojure.set.join.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Is set1 a subset of set2?
+ */
+clojure.set.subset_QMARK_ = (function clojure$set$subset_QMARK_(set1,set2){
+return (((cljs.core.count(set1) <= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__3560_SHARP_){
+return cljs.core.contains_QMARK_(set2,p1__3560_SHARP_);
+}),set1)));
+});
+/**
+ * Is set1 a superset of set2?
+ */
+clojure.set.superset_QMARK_ = (function clojure$set$superset_QMARK_(set1,set2){
+return (((cljs.core.count(set1) >= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__3561_SHARP_){
+return cljs.core.contains_QMARK_(set1,p1__3561_SHARP_);
+}),set2)));
+});
diff --git a/js/clojure/string.cljs b/js/clojure/string.cljs
new file mode 100644
index 0000000..26f63f2
--- /dev/null
+++ b/js/clojure/string.cljs
@@ -0,0 +1,289 @@
+;   Copyright (c) Rich Hickey. All rights reserved.
+;   The use and distribution terms for this software are covered by the
+;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;   which can be found in the file epl-v10.html at the root of this distribution.
+;   By using this software in any fashion, you are agreeing to be bound by
+;   the terms of this license.
+;   You must not remove this notice, or any other, from this software.
+
+(ns clojure.string
+  (:refer-clojure :exclude [replace reverse])
+  (:require [goog.string :as gstring])
+  (:import [goog.string StringBuffer]))
+
+(defn- seq-reverse
+  [coll]
+  (reduce conj () coll))
+
+(def ^:private re-surrogate-pair
+  (js/RegExp. "([\\uD800-\\uDBFF])([\\uDC00-\\uDFFF])" "g"))
+
+(defn reverse
+  "Returns s with its characters reversed."
+  [s]
+  (-> (.replace s re-surrogate-pair "$2$1")
+      (.. (split "") (reverse) (join ""))))
+
+(defn- replace-all
+  [s re replacement]
+  (let [r (js/RegExp. (.-source re)
+                      (cond-> "g"
+                        (.-ignoreCase re) (str "i")
+                        (.-multiline re) (str "m")
+                        (.-unicode re) (str "u")))]
+    (.replace s r replacement)))
+
+(defn- replace-with
+  [f]
+  (fn [& args]
+    (let [matches (drop-last 2 args)]
+      (if (= (count matches) 1)
+        (f (first matches))
+        (f (vec matches))))))
+
+(defn replace
+  "Replaces all instance of match with replacement in s.
+
+   match/replacement can be:
+
+   string / string
+   pattern / (string or function of match).
+
+   See also replace-first.
+
+   The replacement is literal (i.e. none of its characters are treated
+   specially) for all cases above except pattern / string.
+
+   For pattern / string, $1, $2, etc. in the replacement string are
+   substituted with the string that matched the corresponding
+   parenthesized group in the pattern.
+
+   Example:
+   (clojure.string/replace \"Almost Pig Latin\" #\"\\b(\\w)(\\w+)\\b\" \"$2$1ay\")
+   -> \"lmostAay igPay atinLay\""
+  [s match replacement]
+  (cond
+    (string? match)
+    (.replace s (js/RegExp. (gstring/regExpEscape match) "g") replacement)
+
+    (instance? js/RegExp match)
+    (if (string? replacement)
+      (replace-all s match replacement)
+      (replace-all s match (replace-with replacement)))
+
+    :else (throw (str "Invalid match arg: " match))))
+
+(defn replace-first
+  "Replaces the first instance of match with replacement in s.
+
+   match/replacement can be:
+
+   string / string
+   pattern / (string or function of match).
+
+   See also replace.
+
+   The replacement is literal (i.e. none of its characters are treated
+   specially) for all cases above except pattern / string.
+
+   For pattern / string, $1, $2, etc. in the replacement string are
+   substituted with the string that matched the corresponding
+   parenthesized group in the pattern.
+
+   Example:
+   (clojure.string/replace-first \"swap first two words\"
+                                 #\"(\\w+)(\\s+)(\\w+)\" \"$3$2$1\")
+   -> \"first swap two words\""
+  [s match replacement]
+  (.replace s match replacement))
+
+(defn join
+  "Returns a string of all elements in coll, as returned by (seq coll),
+  separated by an optional separator."
+  ([coll]
+   (loop [sb (StringBuffer.) coll (seq coll)]
+     (if-not (nil? coll)
+       (recur (. sb (append (str (first coll)))) (next coll))
+       (.toString sb))))
+  ([separator coll]
+   (loop [sb (StringBuffer.) coll (seq coll)]
+     (if-not (nil? coll)
+       (do
+         (. sb (append (str (first coll))))
+         (let [coll (next coll)]
+           (when-not (nil? coll)
+             (. sb (append separator)))
+           (recur sb coll)))
+       (.toString sb)))))
+
+(defn upper-case
+  "Converts string to all upper-case."
+  [s]
+  (.toUpperCase s))
+
+(defn lower-case
+  "Converts string to all lower-case."
+  [s]
+  (.toLowerCase s))
+
+(defn capitalize
+  "Converts first character of the string to upper-case, all other
+  characters to lower-case."
+  [s]
+  (gstring/capitalize s))
+
+;; The JavaScript split function takes a limit argument but the return
+;; value is not the same as the Java split function.
+;;
+;; Java: (.split "a-b-c" #"-" 2) => ["a" "b-c"]
+;; JavaScript: (.split "a-b-c" #"-" 2) => ["a" "b"]
+;;
+;; For consistency, the three arg version has been implemented to
+;; mimic Java's behavior.
+
+(defn- pop-last-while-empty
+  [v]
+  (loop [v v]
+    (if (identical? "" (peek v))
+      (recur (pop v))
+      v)))
+
+(defn- discard-trailing-if-needed
+  [limit v]
+  (if (and (== 0 limit) (< 1 (count v)))
+    (pop-last-while-empty v)
+    v))
+
+(defn- split-with-empty-regex
+  [s limit]
+  (if (or (<= limit 0) (>= limit (+ 2 (count s))))
+    (conj (vec (cons "" (map str (seq s)))) "")
+    (condp == limit
+      1 (vector s)
+      2 (vector "" s)
+      (let [c (- limit 2)]
+        (conj (vec (cons "" (subvec (vec (map str (seq s))) 0 c))) (subs s c))))))
+
+(defn split
+  "Splits string on a regular expression. Optional argument limit is
+  the maximum number of splits. Not lazy. Returns vector of the splits."
+  ([s re]
+     (split s re 0))
+    ([s re limit]
+     (discard-trailing-if-needed limit
+       (if (identical? "/(?:)/" (str re))
+         (split-with-empty-regex s limit)
+         (if (< limit 1)
+           (vec (.split (str s) re))
+           (loop [s s
+                  limit limit
+                  parts []]
+             (if (== 1 limit)
+               (conj parts s)
+               (let [m (re-find re s)]
+                 (if-not (nil? m)
+                   (let [index (.indexOf s m)]
+                     (recur (.substring s (+ index (count m)))
+                       (dec limit)
+                       (conj parts (.substring s 0 index))))
+                   (conj parts s))))))))))
+
+(defn split-lines
+  "Splits s on \\n or \\r\\n."
+  [s]
+  (split s #"\n|\r\n"))
+
+(defn trim
+  "Removes whitespace from both ends of string."
+  [s]
+  (gstring/trim s))
+
+(defn triml
+  "Removes whitespace from the left side of string."
+  [s]
+  (gstring/trimLeft s))
+
+(defn trimr
+  "Removes whitespace from the right side of string."
+  [s]
+  (gstring/trimRight s))
+
+(defn trim-newline
+  "Removes all trailing newline \\n or return \\r characters from
+  string.  Similar to Perl's chomp."
+  [s]
+  (loop [index (.-length s)]
+    (if (zero? index)
+      ""
+      (let [ch (get s (dec index))]
+        (if (or (identical? \newline ch)
+                (identical? \return ch))
+          (recur (dec index))
+          (.substring s 0 index))))))
+
+(defn ^boolean blank?
+  "True is s is nil, empty, or contains only whitespace."
+  [s]
+  (gstring/isEmptySafe s))
+
+(defn escape
+  "Return a new string, using cmap to escape each character ch
+   from s as follows:
+
+   If (cmap ch) is nil, append ch to the new string.
+   If (cmap ch) is non-nil, append (str (cmap ch)) instead."
+  [s cmap]
+  (let [buffer (StringBuffer.)
+        length (.-length s)]
+    (loop [index 0]
+      (if (== length index)
+        (. buffer (toString))
+        (let [ch (.charAt s index)
+              replacement (get cmap ch)]
+          (if-not (nil? replacement)
+            (.append buffer (str replacement))
+            (.append buffer ch))
+          (recur (inc index)))))))
+
+(defn index-of
+  "Return index of value (string or char) in s, optionally searching
+  forward from from-index or nil if not found."
+  ([s value]
+   (let [result (.indexOf s value)]
+     (if (neg? result)
+       nil
+       result)))
+  ([s value from-index]
+   (let [result (.indexOf s value from-index)]
+     (if (neg? result)
+       nil
+       result))))
+
+(defn last-index-of
+  "Return last index of value (string or char) in s, optionally
+  searching backward from from-index or nil if not found."
+  ([s value]
+   (let [result (.lastIndexOf s value)]
+     (if (neg? result)
+       nil
+       result)))
+  ([s value from-index]
+   (let [result (.lastIndexOf s value from-index)]
+     (if (neg? result)
+       nil
+       result))))
+
+(defn ^boolean starts-with?
+  "True if s starts with substr."
+  [s substr]
+  (gstring/startsWith s substr))
+
+(defn ^boolean ends-with?
+  "True if s ends with substr."
+  [s substr]
+  (gstring/endsWith s substr))
+
+(defn ^boolean includes?
+  "True if s includes substr."
+  [s substr]
+  (gstring/contains s substr))
diff --git a/js/clojure/string.cljs.cache.json b/js/clojure/string.cljs.cache.json
new file mode 100644
index 0000000..60bd9f1
--- /dev/null
+++ b/js/clojure/string.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$RegExp",["^ "],"~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",["~$reverse","~$replace"]],"~:name","~$clojure.string","~:imports",["^ ","~$StringBuffer","~$goog.string.StringBuffer"],"~:requires",["^ ","~$gstring","~$goog.string","^A","^A","^=","^>"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$ends-with?",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","~:line",281,"~:column",16,"~:end-line",281,"~:end-column",26,"~:tag","~$boolean","~:arglists",["~#list",["~$quote",["^P",[["~$s","~$substr"]]]]],"~:doc","True if s ends with substr."],"^:","~$clojure.string/ends-with?","~:variadic",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",26,"~:method-params",["^P",[["~$s","^R"]]],"~:protocol-impl",null,"~:arglists-meta",["^P",[null,null]],"^J",1,"^I",281,"~:ret-tag","^N","^K",281,"~:max-fixed-arity",2,"^M","^N","~:fn-var",true,"^O",["^P",["^Q",["^P",[["~$s","^R"]]]]],"^S","True if s ends with substr."],"~$seq-reverse",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",14,"^J",8,"^K",14,"^L",19,"~:private",true,"^O",["^P",["^Q",["^P",[["~$coll"]]]]]],"^11",true,"^:","~$clojure.string/seq-reverse","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",19,"^V",["^P",[["^12"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",14,"^K",14,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["^12"]]]]]],"~$replace-with",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",36,"^J",8,"^K",36,"^L",20,"^11",true,"^O",["^P",["^Q",["^P",[["~$f"]]]]]],"^11",true,"^:","~$clojure.string/replace-with","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",20,"^V",["^P",[["~$f"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",36,"^K",36,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$f"]]]]]],"~$capitalize",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",129,"^J",7,"^K",129,"^L",17,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Converts first character of the string to upper-case, all other\n  characters to lower-case."],"^:","~$clojure.string/capitalize","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",17,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",129,"^K",129,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Converts first character of the string to upper-case, all other\n  characters to lower-case."],"^8",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",21,"^J",7,"^K",21,"^L",14,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Returns s with its characters reversed."],"^:","~$clojure.string/reverse","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",14,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",21,"^K",21,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Returns s with its characters reversed."],"~$join",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",100,"^J",7,"^K",100,"^L",11,"^O",["^P",["^Q",["^P",[["^12"],["~$separator","^12"]]]]],"^S","Returns a string of all elements in coll, as returned by (seq coll),\n  separated by an optional separator.","~:top-fn",["^ ","^U",false,"^Z",2,"^V",["^P",[["^12"],["^1:","^12"]]],"^O",["^P",[["^12"],["^1:","^12"]]],"^X",["^P",[null,null]]]],"^:","~$clojure.string/join","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",11,"^1;",["^ ","^U",false,"^Z",2,"^V",["^P",[["^12"],["^1:","^12"]]],"^O",["^P",[["^12"],["^1:","^12"]]],"^X",["^P",[null,null]]],"^V",["^P",[["^12"],["^1:","^12"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",100,"^K",100,"^Z",2,"^[",true,"^O",["^P",[["^12"],["^1:","^12"]]],"^S","Returns a string of all elements in coll, as returned by (seq coll),\n  separated by an optional separator."],"~$replace-first",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",76,"^J",7,"^K",76,"^L",20,"^O",["^P",["^Q",["^P",[["~$s","~$match","~$replacement"]]]]],"^S","Replaces the first instance of match with replacement in s.\n\n   match/replacement can be:\n\n   string / string\n   pattern / (string or function of match).\n\n   See also replace.\n\n   The replacement is literal (i.e. none of its characters are treated\n   specially) for all cases above except pattern / string.\n\n   For pattern / string, $1, $2, etc. in the replacement string are\n   substituted with the string that matched the corresponding\n   parenthesized group in the pattern.\n\n   Example:\n   (clojure.string/replace-first \"swap first two words\"\n                                 #\"(\\w+)(\\s+)(\\w+)\" \"$3$2$1\")\n   -> \"first swap two words\""],"^:","~$clojure.string/replace-first","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",20,"^V",["^P",[["~$s","^1>","^1?"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",76,"^K",76,"^Z",3,"^[",true,"^O",["^P",["^Q",["^P",[["~$s","^1>","^1?"]]]]],"^S","Replaces the first instance of match with replacement in s.\n\n   match/replacement can be:\n\n   string / string\n   pattern / (string or function of match).\n\n   See also replace.\n\n   The replacement is literal (i.e. none of its characters are treated\n   specially) for all cases above except pattern / string.\n\n   For pattern / string, $1, $2, etc. in the replacement string are\n   substituted with the string that matched the corresponding\n   parenthesized group in the pattern.\n\n   Example:\n   (clojure.string/replace-first \"swap first two words\"\n                                 #\"(\\w+)(\\s+)(\\w+)\" \"$3$2$1\")\n   -> \"first swap two words\""],"~$starts-with?",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",276,"^J",16,"^K",276,"^L",28,"^M","^N","^O",["^P",["^Q",["^P",[["~$s","^R"]]]]],"^S","True if s starts with substr."],"^:","~$clojure.string/starts-with?","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",28,"^V",["^P",[["~$s","^R"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",276,"^Y","^N","^K",276,"^Z",2,"^M","^N","^[",true,"^O",["^P",["^Q",["^P",[["~$s","^R"]]]]],"^S","True if s starts with substr."],"~$escape",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",229,"^J",7,"^K",229,"^L",13,"^O",["^P",["^Q",["^P",[["~$s","~$cmap"]]]]],"^S","Return a new string, using cmap to escape each character ch\n   from s as follows:\n\n   If (cmap ch) is nil, append ch to the new string.\n   If (cmap ch) is non-nil, append (str (cmap ch)) instead."],"^:","~$clojure.string/escape","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",13,"^V",["^P",[["~$s","^1D"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",229,"^K",229,"^Z",2,"^[",true,"^O",["^P",["^Q",["^P",[["~$s","^1D"]]]]],"^S","Return a new string, using cmap to escape each character ch\n   from s as follows:\n\n   If (cmap ch) is nil, append ch to the new string.\n   If (cmap ch) is non-nil, append (str (cmap ch)) instead."],"~$replace-all",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",27,"^J",8,"^K",27,"^L",19,"^11",true,"^O",["^P",["^Q",["^P",[["~$s","~$re","^1?"]]]]]],"^11",true,"^:","~$clojure.string/replace-all","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",19,"^V",["^P",[["~$s","^1G","^1?"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",27,"^K",27,"^Z",3,"^[",true,"^O",["^P",["^Q",["^P",[["~$s","^1G","^1?"]]]]]],"~$discard-trailing-if-needed",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",151,"^J",8,"^K",151,"^L",34,"^11",true,"^O",["^P",["^Q",["^P",[["~$limit","~$v"]]]]]],"^11",true,"^:","~$clojure.string/discard-trailing-if-needed","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",34,"^V",["^P",[["^1J","~$v"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",151,"^K",151,"^Z",2,"^[",true,"^O",["^P",["^Q",["^P",[["^1J","~$v"]]]]]],"~$last-index-of",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",262,"^J",7,"^K",262,"^L",20,"^O",["^P",["^Q",["^P",[["~$s","~$value"],["~$s","^1M","~$from-index"]]]]],"^S","Return last index of value (string or char) in s, optionally\n  searching backward from from-index or nil if not found.","^1;",["^ ","^U",false,"^Z",3,"^V",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^O",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^X",["^P",[null,null]]]],"^:","~$clojure.string/last-index-of","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",20,"^1;",["^ ","^U",false,"^Z",3,"^V",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^O",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^X",["^P",[null,null]]],"^V",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",262,"^K",262,"^Z",3,"^[",true,"^O",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^S","Return last index of value (string or char) in s, optionally\n  searching backward from from-index or nil if not found."],"~$pop-last-while-empty",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",144,"^J",8,"^K",144,"^L",28,"^11",true,"^O",["^P",["^Q",["^P",[["~$v"]]]]]],"^11",true,"^:","~$clojure.string/pop-last-while-empty","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",28,"^V",["^P",[["~$v"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",144,"^K",144,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$v"]]]]]],"~$includes?",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",286,"^J",16,"^K",286,"^L",25,"^M","^N","^O",["^P",["^Q",["^P",[["~$s","^R"]]]]],"^S","True if s includes substr."],"^:","~$clojure.string/includes?","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",25,"^V",["^P",[["~$s","^R"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",286,"^Y","^N","^K",286,"^Z",2,"^M","^N","^[",true,"^O",["^P",["^Q",["^P",[["~$s","^R"]]]]],"^S","True if s includes substr."],"^9",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",44,"^J",7,"^K",44,"^L",14,"^O",["^P",["^Q",["^P",[["~$s","^1>","^1?"]]]]],"^S","Replaces all instance of match with replacement in s.\n\n   match/replacement can be:\n\n   string / string\n   pattern / (string or function of match).\n\n   See also replace-first.\n\n   The replacement is literal (i.e. none of its characters are treated\n   specially) for all cases above except pattern / string.\n\n   For pattern / string, $1, $2, etc. in the replacement string are\n   substituted with the string that matched the corresponding\n   parenthesized group in the pattern.\n\n   Example:\n   (clojure.string/replace \"Almost Pig Latin\" #\"\\b(\\w)(\\w+)\\b\" \"$2$1ay\")\n   -> \"lmostAay igPay atinLay\""],"^:","~$clojure.string/replace","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",14,"^V",["^P",[["~$s","^1>","^1?"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",44,"^K",44,"^Z",3,"^[",true,"^O",["^P",["^Q",["^P",[["~$s","^1>","^1?"]]]]],"^S","Replaces all instance of match with replacement in s.\n\n   match/replacement can be:\n\n   string / string\n   pattern / (string or function of match).\n\n   See also replace-first.\n\n   The replacement is literal (i.e. none of its characters are treated\n   specially) for all cases above except pattern / string.\n\n   For pattern / string, $1, $2, etc. in the replacement string are\n   substituted with the string that matched the corresponding\n   parenthesized group in the pattern.\n\n   Example:\n   (clojure.string/replace \"Almost Pig Latin\" #\"\\b(\\w)(\\w+)\\b\" \"$2$1ay\")\n   -> \"lmostAay igPay atinLay\""],"~$split-lines",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",191,"^J",7,"^K",191,"^L",18,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Splits s on \\n or \\r\\n."],"^:","~$clojure.string/split-lines","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",18,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",191,"^K",191,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Splits s on \\n or \\r\\n."],"~$lower-case",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",124,"^J",7,"^K",124,"^L",17,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Converts string to all lower-case."],"^:","~$clojure.string/lower-case","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",17,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",124,"^K",124,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Converts string to all lower-case."],"~$trim-newline",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",211,"^J",7,"^K",211,"^L",19,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes all trailing newline \\n or return \\r characters from\n  string.  Similar to Perl's chomp."],"^:","~$clojure.string/trim-newline","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",19,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",211,"^K",211,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes all trailing newline \\n or return \\r characters from\n  string.  Similar to Perl's chomp."],"~$upper-case",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",119,"^J",7,"^K",119,"^L",17,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Converts string to all upper-case."],"^:","~$clojure.string/upper-case","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",17,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",119,"^K",119,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Converts string to all upper-case."],"~$split",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",167,"^J",7,"^K",167,"^L",12,"^O",["^P",["^Q",["^P",[["~$s","^1G"],["~$s","^1G","^1J"]]]]],"^S","Splits string on a regular expression. Optional argument limit is\n  the maximum number of splits. Not lazy. Returns vector of the splits.","^1;",["^ ","^U",false,"^Z",3,"^V",["^P",[["~$s","^1G"],["~$s","^1G","^1J"]]],"^O",["^P",[["~$s","^1G"],["~$s","^1G","^1J"]]],"^X",["^P",[null,null]]]],"^:","~$clojure.string/split","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",12,"^1;",["^ ","^U",false,"^Z",3,"^V",["^P",[["~$s","^1G"],["~$s","^1G","^1J"]]],"^O",["^P",[["~$s","^1G"],["~$s","^1G","^1J"]]],"^X",["^P",[null,null]]],"^V",["^P",[["~$s","^1G"],["~$s","^1G","^1J"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",167,"^K",167,"^Z",3,"^[",true,"^O",["^P",[["~$s","^1G"],["~$s","^1G","^1J"]]],"^S","Splits string on a regular expression. Optional argument limit is\n  the maximum number of splits. Not lazy. Returns vector of the splits."],"~$trimr",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",206,"^J",7,"^K",206,"^L",12,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes whitespace from the right side of string."],"^:","~$clojure.string/trimr","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",12,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",206,"^K",206,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes whitespace from the right side of string."],"~$index-of",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",248,"^J",7,"^K",248,"^L",15,"^O",["^P",["^Q",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]]]],"^S","Return index of value (string or char) in s, optionally searching\n  forward from from-index or nil if not found.","^1;",["^ ","^U",false,"^Z",3,"^V",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^O",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^X",["^P",[null,null]]]],"^:","~$clojure.string/index-of","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",15,"^1;",["^ ","^U",false,"^Z",3,"^V",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^O",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^X",["^P",[null,null]]],"^V",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",248,"^K",248,"^Z",3,"^[",true,"^O",["^P",[["~$s","^1M"],["~$s","^1M","^1N"]]],"^S","Return index of value (string or char) in s, optionally searching\n  forward from from-index or nil if not found."],"~$trim",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",196,"^J",7,"^K",196,"^L",11,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes whitespace from both ends of string."],"^:","~$clojure.string/trim","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",11,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",196,"^K",196,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes whitespace from both ends of string."],"~$triml",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",201,"^J",7,"^K",201,"^L",12,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes whitespace from the left side of string."],"^:","~$clojure.string/triml","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",12,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",201,"^K",201,"^Z",1,"^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","Removes whitespace from the left side of string."],"~$blank?",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",224,"^J",16,"^K",224,"^L",22,"^M","^N","^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","True is s is nil, empty, or contains only whitespace."],"^:","~$clojure.string/blank?","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",22,"^V",["^P",[["~$s"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",224,"^Y","^N","^K",224,"^Z",1,"^M","^N","^[",true,"^O",["^P",["^Q",["^P",[["~$s"]]]]],"^S","True is s is nil, empty, or contains only whitespace."],"~$re-surrogate-pair",["^ ","^:","~$clojure.string/re-surrogate-pair","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",18,"^J",1,"^K",18,"^L",33,"^11",true,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",18,"^J",16,"^K",18,"^L",33,"^11",true],"^M","~$js/RegExp"],"~$split-with-empty-regex",["^ ","^F",null,"^G",["^ ","^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^I",157,"^J",8,"^K",157,"^L",30,"^11",true,"^O",["^P",["^Q",["^P",[["~$s","^1J"]]]]]],"^11",true,"^:","~$clojure.string/split-with-empty-regex","^U",false,"^H","/home/julien/.cljs/.aot_cache/1.10.329/5381E3F/clojure/string.cljs","^L",30,"^V",["^P",[["~$s","^1J"]]],"^W",null,"^X",["^P",[null,null]],"^J",1,"^I",157,"^K",157,"^Z",2,"^[",true,"^O",["^P",["^Q",["^P",[["~$s","^1J"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^7",["~:else"]],"~:order",["^2F"]],"^S",null]
\ No newline at end of file
diff --git a/js/clojure/string.js b/js/clojure/string.js
new file mode 100644
index 0000000..82e8aef
--- /dev/null
+++ b/js/clojure/string.js
@@ -0,0 +1,478 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('clojure.string');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('goog.string');
+goog.require('goog.string.StringBuffer');
+clojure.string.seq_reverse = (function clojure$string$seq_reverse(coll){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,cljs.core.List.EMPTY,coll);
+});
+clojure.string.re_surrogate_pair = (new RegExp("([\\uD800-\\uDBFF])([\\uDC00-\\uDFFF])","g"));
+/**
+ * Returns s with its characters reversed.
+ */
+clojure.string.reverse = (function clojure$string$reverse(s){
+return s.replace(clojure.string.re_surrogate_pair,"$2$1").split("").reverse().join("");
+});
+clojure.string.replace_all = (function clojure$string$replace_all(s,re,replacement){
+var r = (new RegExp(re.source,(function (){var G__3449 = "g";
+var G__3449__$1 = (cljs.core.truth_(re.ignoreCase)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__3449),"i"].join(''):G__3449);
+var G__3449__$2 = (cljs.core.truth_(re.multiline)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__3449__$1),"m"].join(''):G__3449__$1);
+if(cljs.core.truth_(re.unicode)){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__3449__$2),"u"].join('');
+} else {
+return G__3449__$2;
+}
+})()));
+return s.replace(r,replacement);
+});
+clojure.string.replace_with = (function clojure$string$replace_with(f){
+return (function() { 
+var G__3452__delegate = function (args){
+var matches = cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2((2),args);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(matches),(1))){
+var G__3450 = cljs.core.first(matches);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__3450) : f.call(null,G__3450));
+} else {
+var G__3451 = cljs.core.vec(matches);
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__3451) : f.call(null,G__3451));
+}
+};
+var G__3452 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__3453__i = 0, G__3453__a = new Array(arguments.length -  0);
+while (G__3453__i < G__3453__a.length) {G__3453__a[G__3453__i] = arguments[G__3453__i + 0]; ++G__3453__i;}
+  args = new cljs.core.IndexedSeq(G__3453__a,0,null);
+} 
+return G__3452__delegate.call(this,args);};
+G__3452.cljs$lang$maxFixedArity = 0;
+G__3452.cljs$lang$applyTo = (function (arglist__3454){
+var args = cljs.core.seq(arglist__3454);
+return G__3452__delegate(args);
+});
+G__3452.cljs$core$IFn$_invoke$arity$variadic = G__3452__delegate;
+return G__3452;
+})()
+;
+});
+/**
+ * Replaces all instance of match with replacement in s.
+ * 
+ * match/replacement can be:
+ * 
+ * string / string
+ * pattern / (string or function of match).
+ * 
+ * See also replace-first.
+ * 
+ * The replacement is literal (i.e. none of its characters are treated
+ * specially) for all cases above except pattern / string.
+ * 
+ * For pattern / string, $1, $2, etc. in the replacement string are
+ * substituted with the string that matched the corresponding
+ * parenthesized group in the pattern.
+ * 
+ * Example:
+ * (clojure.string/replace "Almost Pig Latin" #"\b(\w)(\w+)\b" "$2$1ay")
+ * -> "lmostAay igPay atinLay"
+ */
+clojure.string.replace = (function clojure$string$replace(s,match,replacement){
+if(typeof match === 'string'){
+return s.replace((new RegExp(goog.string.regExpEscape(match),"g")),replacement);
+} else {
+if((match instanceof RegExp)){
+if(typeof replacement === 'string'){
+return clojure.string.replace_all(s,match,replacement);
+} else {
+return clojure.string.replace_all(s,match,clojure.string.replace_with(replacement));
+}
+} else {
+throw ["Invalid match arg: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(match)].join('');
+
+}
+}
+});
+/**
+ * Replaces the first instance of match with replacement in s.
+ * 
+ * match/replacement can be:
+ * 
+ * string / string
+ * pattern / (string or function of match).
+ * 
+ * See also replace.
+ * 
+ * The replacement is literal (i.e. none of its characters are treated
+ * specially) for all cases above except pattern / string.
+ * 
+ * For pattern / string, $1, $2, etc. in the replacement string are
+ * substituted with the string that matched the corresponding
+ * parenthesized group in the pattern.
+ * 
+ * Example:
+ * (clojure.string/replace-first "swap first two words"
+ *                               #"(\w+)(\s+)(\w+)" "$3$2$1")
+ * -> "first swap two words"
+ */
+clojure.string.replace_first = (function clojure$string$replace_first(s,match,replacement){
+return s.replace(match,replacement);
+});
+/**
+ * Returns a string of all elements in coll, as returned by (seq coll),
+ *   separated by an optional separator.
+ */
+clojure.string.join = (function clojure$string$join(var_args){
+var G__3456 = arguments.length;
+switch (G__3456) {
+case 1:
+return clojure.string.join.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return clojure.string.join.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+clojure.string.join.cljs$core$IFn$_invoke$arity$1 = (function (coll){
+var sb = (new goog.string.StringBuffer());
+var coll__$1 = cljs.core.seq(coll);
+while(true){
+if(!((coll__$1 == null))){
+var G__3458 = sb.append([cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(coll__$1))].join(''));
+var G__3459 = cljs.core.next(coll__$1);
+sb = G__3458;
+coll__$1 = G__3459;
+continue;
+} else {
+return sb.toString();
+}
+break;
+}
+});
+
+clojure.string.join.cljs$core$IFn$_invoke$arity$2 = (function (separator,coll){
+var sb = (new goog.string.StringBuffer());
+var coll__$1 = cljs.core.seq(coll);
+while(true){
+if(!((coll__$1 == null))){
+sb.append([cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(coll__$1))].join(''));
+
+var coll__$2 = cljs.core.next(coll__$1);
+if((coll__$2 == null)){
+} else {
+sb.append(separator);
+}
+
+var G__3460 = sb;
+var G__3461 = coll__$2;
+sb = G__3460;
+coll__$1 = G__3461;
+continue;
+} else {
+return sb.toString();
+}
+break;
+}
+});
+
+clojure.string.join.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Converts string to all upper-case.
+ */
+clojure.string.upper_case = (function clojure$string$upper_case(s){
+return s.toUpperCase();
+});
+/**
+ * Converts string to all lower-case.
+ */
+clojure.string.lower_case = (function clojure$string$lower_case(s){
+return s.toLowerCase();
+});
+/**
+ * Converts first character of the string to upper-case, all other
+ *   characters to lower-case.
+ */
+clojure.string.capitalize = (function clojure$string$capitalize(s){
+return goog.string.capitalize(s);
+});
+clojure.string.pop_last_while_empty = (function clojure$string$pop_last_while_empty(v){
+var v__$1 = v;
+while(true){
+if(("" === cljs.core.peek(v__$1))){
+var G__3462 = cljs.core.pop(v__$1);
+v__$1 = G__3462;
+continue;
+} else {
+return v__$1;
+}
+break;
+}
+});
+clojure.string.discard_trailing_if_needed = (function clojure$string$discard_trailing_if_needed(limit,v){
+if(((((0) === limit)) && (((1) < cljs.core.count(v))))){
+return clojure.string.pop_last_while_empty(v);
+} else {
+return v;
+}
+});
+clojure.string.split_with_empty_regex = (function clojure$string$split_with_empty_regex(s,limit){
+if((((limit <= (0))) || ((limit >= ((2) + cljs.core.count(s)))))){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.vec(cljs.core.cons("",cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.str,cljs.core.seq(s)))),"");
+} else {
+var pred__3463 = cljs.core._EQ__EQ_;
+var expr__3464 = limit;
+if(cljs.core.truth_((pred__3463.cljs$core$IFn$_invoke$arity$2 ? pred__3463.cljs$core$IFn$_invoke$arity$2((1),expr__3464) : pred__3463.call(null,(1),expr__3464)))){
+return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[s],null));
+} else {
+if(cljs.core.truth_((pred__3463.cljs$core$IFn$_invoke$arity$2 ? pred__3463.cljs$core$IFn$_invoke$arity$2((2),expr__3464) : pred__3463.call(null,(2),expr__3464)))){
+return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,["",s],null));
+} else {
+var c = (limit - (2));
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.vec(cljs.core.cons("",cljs.core.subvec.cljs$core$IFn$_invoke$arity$3(cljs.core.vec(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.str,cljs.core.seq(s))),(0),c))),cljs.core.subs.cljs$core$IFn$_invoke$arity$2(s,c));
+}
+}
+}
+});
+/**
+ * Splits string on a regular expression. Optional argument limit is
+ *   the maximum number of splits. Not lazy. Returns vector of the splits.
+ */
+clojure.string.split = (function clojure$string$split(var_args){
+var G__3467 = arguments.length;
+switch (G__3467) {
+case 2:
+return clojure.string.split.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return clojure.string.split.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+clojure.string.split.cljs$core$IFn$_invoke$arity$2 = (function (s,re){
+return clojure.string.split.cljs$core$IFn$_invoke$arity$3(s,re,(0));
+});
+
+clojure.string.split.cljs$core$IFn$_invoke$arity$3 = (function (s,re,limit){
+return clojure.string.discard_trailing_if_needed(limit,((("/(?:)/" === [cljs.core.str.cljs$core$IFn$_invoke$arity$1(re)].join('')))?clojure.string.split_with_empty_regex(s,limit):(((limit < (1)))?cljs.core.vec([cljs.core.str.cljs$core$IFn$_invoke$arity$1(s)].join('').split(re)):(function (){var s__$1 = s;
+var limit__$1 = limit;
+var parts = cljs.core.PersistentVector.EMPTY;
+while(true){
+if(((1) === limit__$1)){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(parts,s__$1);
+} else {
+var m = cljs.core.re_find(re,s__$1);
+if(!((m == null))){
+var index = s__$1.indexOf(m);
+var G__3469 = s__$1.substring((index + cljs.core.count(m)));
+var G__3470 = (limit__$1 - (1));
+var G__3471 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(parts,s__$1.substring((0),index));
+s__$1 = G__3469;
+limit__$1 = G__3470;
+parts = G__3471;
+continue;
+} else {
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(parts,s__$1);
+}
+}
+break;
+}
+})())));
+});
+
+clojure.string.split.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Splits s on \n or \r\n.
+ */
+clojure.string.split_lines = (function clojure$string$split_lines(s){
+return clojure.string.split.cljs$core$IFn$_invoke$arity$2(s,/\n|\r\n/);
+});
+/**
+ * Removes whitespace from both ends of string.
+ */
+clojure.string.trim = (function clojure$string$trim(s){
+return goog.string.trim(s);
+});
+/**
+ * Removes whitespace from the left side of string.
+ */
+clojure.string.triml = (function clojure$string$triml(s){
+return goog.string.trimLeft(s);
+});
+/**
+ * Removes whitespace from the right side of string.
+ */
+clojure.string.trimr = (function clojure$string$trimr(s){
+return goog.string.trimRight(s);
+});
+/**
+ * Removes all trailing newline \n or return \r characters from
+ *   string.  Similar to Perl's chomp.
+ */
+clojure.string.trim_newline = (function clojure$string$trim_newline(s){
+var index = s.length;
+while(true){
+if((index === (0))){
+return "";
+} else {
+var ch = cljs.core.get.cljs$core$IFn$_invoke$arity$2(s,(index - (1)));
+if(((("\n" === ch)) || (("\r" === ch)))){
+var G__3472 = (index - (1));
+index = G__3472;
+continue;
+} else {
+return s.substring((0),index);
+}
+}
+break;
+}
+});
+/**
+ * True is s is nil, empty, or contains only whitespace.
+ */
+clojure.string.blank_QMARK_ = (function clojure$string$blank_QMARK_(s){
+return goog.string.isEmptySafe(s);
+});
+/**
+ * Return a new string, using cmap to escape each character ch
+ * from s as follows:
+ * 
+ * If (cmap ch) is nil, append ch to the new string.
+ * If (cmap ch) is non-nil, append (str (cmap ch)) instead.
+ */
+clojure.string.escape = (function clojure$string$escape(s,cmap){
+var buffer = (new goog.string.StringBuffer());
+var length = s.length;
+var index = (0);
+while(true){
+if((length === index)){
+return buffer.toString();
+} else {
+var ch = s.charAt(index);
+var replacement = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cmap,ch);
+if(!((replacement == null))){
+buffer.append([cljs.core.str.cljs$core$IFn$_invoke$arity$1(replacement)].join(''));
+} else {
+buffer.append(ch);
+}
+
+var G__3473 = (index + (1));
+index = G__3473;
+continue;
+}
+break;
+}
+});
+/**
+ * Return index of value (string or char) in s, optionally searching
+ *   forward from from-index or nil if not found.
+ */
+clojure.string.index_of = (function clojure$string$index_of(var_args){
+var G__3475 = arguments.length;
+switch (G__3475) {
+case 2:
+return clojure.string.index_of.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return clojure.string.index_of.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+clojure.string.index_of.cljs$core$IFn$_invoke$arity$2 = (function (s,value){
+var result = s.indexOf(value);
+if((result < (0))){
+return null;
+} else {
+return result;
+}
+});
+
+clojure.string.index_of.cljs$core$IFn$_invoke$arity$3 = (function (s,value,from_index){
+var result = s.indexOf(value,from_index);
+if((result < (0))){
+return null;
+} else {
+return result;
+}
+});
+
+clojure.string.index_of.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Return last index of value (string or char) in s, optionally
+ *   searching backward from from-index or nil if not found.
+ */
+clojure.string.last_index_of = (function clojure$string$last_index_of(var_args){
+var G__3478 = arguments.length;
+switch (G__3478) {
+case 2:
+return clojure.string.last_index_of.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return clojure.string.last_index_of.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+clojure.string.last_index_of.cljs$core$IFn$_invoke$arity$2 = (function (s,value){
+var result = s.lastIndexOf(value);
+if((result < (0))){
+return null;
+} else {
+return result;
+}
+});
+
+clojure.string.last_index_of.cljs$core$IFn$_invoke$arity$3 = (function (s,value,from_index){
+var result = s.lastIndexOf(value,from_index);
+if((result < (0))){
+return null;
+} else {
+return result;
+}
+});
+
+clojure.string.last_index_of.cljs$lang$maxFixedArity = 3;
+
+/**
+ * True if s starts with substr.
+ */
+clojure.string.starts_with_QMARK_ = (function clojure$string$starts_with_QMARK_(s,substr){
+return goog.string.startsWith(s,substr);
+});
+/**
+ * True if s ends with substr.
+ */
+clojure.string.ends_with_QMARK_ = (function clojure$string$ends_with_QMARK_(s,substr){
+return goog.string.endsWith(s,substr);
+});
+/**
+ * True if s includes substr.
+ */
+clojure.string.includes_QMARK_ = (function clojure$string$includes_QMARK_(s,substr){
+return goog.string.contains(s,substr);
+});
diff --git a/js/clojure/walk.cljs b/js/clojure/walk.cljs
new file mode 100644
index 0000000..ffbb6a7
--- /dev/null
+++ b/js/clojure/walk.cljs
@@ -0,0 +1,97 @@
+;   Copyright (c) Rich Hickey. All rights reserved.
+;   The use and distribution terms for this software are covered by the
+;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;   which can be found in the file epl-v10.html at the root of this distribution.
+;   By using this software in any fashion, you are agreeing to be bound by
+;   the terms of this license.
+;   You must not remove this notice, or any other, from this software.
+
+;;; walk.cljs - generic tree walker with replacement
+
+;; by Stuart Sierra
+;; Jul5 17, 2011
+
+;; CHANGE LOG:
+;;
+;; * July 17, 2011: Port to ClojureScript
+;; 
+;; * December 15, 2008: replaced 'walk' with 'prewalk' & 'postwalk'
+;;
+;; * December 9, 2008: first version
+
+
+(ns 
+  ^{:author "Stuart Sierra",
+     :doc "This file defines a generic tree walker for Clojure data
+structures.  It takes any data structure (list, vector, map, set,
+seq), calls a function on every element, and uses the return value
+of the function in place of the original.  This makes it fairly
+easy to write recursive search-and-replace functions, as shown in
+the examples.
+
+Note: \"walk\" supports all Clojure data structures EXCEPT maps
+created with sorted-map-by.  There is no (obvious) way to retrieve
+the sorting function."}
+  clojure.walk)
+
+(defn walk
+  "Traverses form, an arbitrary data structure.  inner and outer are
+  functions.  Applies inner to each element of form, building up a
+  data structure of the same type, then applies outer to the result.
+  Recognizes all Clojure data structures. Consumes seqs as with doall."
+
+  {:added "1.1"}
+  [inner outer form]
+  (cond
+    (list? form)      (outer (apply list (map inner form)))
+    (map-entry? form) (outer (vec (map inner form)))
+    (seq? form)       (outer (doall (map inner form)))
+    (record? form)    (outer (reduce (fn [r x] (conj r (inner x))) form form))
+    (coll? form)      (outer (into (empty form) (map inner form)))
+    :else             (outer form)))
+
+(defn postwalk
+  "Performs a depth-first, post-order traversal of form.  Calls f on
+  each sub-form, uses f's return value in place of the original.
+  Recognizes all Clojure data structures. Consumes seqs as with doall."
+  {:added "1.1"}
+  [f form]
+  (walk (partial postwalk f) f form))
+
+(defn prewalk
+  "Like postwalk, but does pre-order traversal."
+  {:added "1.1"}
+  [f form]
+  (walk (partial prewalk f) identity (f form)))
+
+(defn keywordize-keys
+  "Recursively transforms all map keys from strings to keywords."
+  {:added "1.1"}
+  [m]
+  (let [f (fn [[k v]] (if (string? k) [(keyword k) v] [k v]))]
+    ;; only apply to maps
+    (postwalk (fn [x] (if (map? x) (into {} (map f x)) x)) m)))
+
+(defn stringify-keys
+  "Recursively transforms all map keys from keywords to strings."
+  {:added "1.1"}
+  [m]
+  (let [f (fn [[k v]] (if (keyword? k) [(name k) v] [k v]))]
+    ;; only apply to maps
+    (postwalk (fn [x] (if (map? x) (into {} (map f x)) x)) m)))
+
+(defn prewalk-replace
+  "Recursively transforms form by replacing keys in smap with their
+  values.  Like clojure/replace but works on any data structure.  Does
+  replacement at the root of the tree first."
+  {:added "1.1"}
+  [smap form]
+  (prewalk (fn [x] (if (contains? smap x) (smap x) x)) form))
+
+(defn postwalk-replace
+  "Recursively transforms form by replacing keys in smap with their
+  values.  Like clojure/replace but works on any data structure.  Does
+  replacement at the leaves of the tree first."
+  {:added "1.1"}
+  [smap form]
+  (postwalk (fn [x] (if (contains? smap x) (smap x) x)) form))
diff --git a/js/clojure/walk.cljs.cache.json b/js/clojure/walk.cljs.cache.json
new file mode 100644
index 0000000..036c968
--- /dev/null
+++ b/js/clojure/walk.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$clojure.walk","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$walk",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","~:line",37,"~:column",7,"~:end-line",37,"~:end-column",11,"~:arglists",["~#list",["~$quote",["^E",[["~$inner","~$outer","~$form"]]]]],"~:doc","Traverses form, an arbitrary data structure.  inner and outer are\n  functions.  Applies inner to each element of form, building up a\n  data structure of the same type, then applies outer to the result.\n  Recognizes all Clojure data structures. Consumes seqs as with doall.","~:added","1.1"],"^K","1.1","^5","~$clojure.walk/walk","~:variadic",false,"^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^C",11,"~:method-params",["^E",[["^G","^H","^I"]]],"~:protocol-impl",null,"~:arglists-meta",["^E",[null,null]],"^A",1,"^@",37,"^B",37,"~:max-fixed-arity",3,"~:fn-var",true,"^D",["^E",["^F",["^E",[["^G","^H","^I"]]]]],"^J","Traverses form, an arbitrary data structure.  inner and outer are\n  functions.  Applies inner to each element of form, building up a\n  data structure of the same type, then applies outer to the result.\n  Recognizes all Clojure data structures. Consumes seqs as with doall."],"~$postwalk",["^ ","^=",null,"^>",["^ ","^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^@",53,"^A",7,"^B",53,"^C",15,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Performs a depth-first, post-order traversal of form.  Calls f on\n  each sub-form, uses f's return value in place of the original.\n  Recognizes all Clojure data structures. Consumes seqs as with doall.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/postwalk","^M",false,"^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^C",15,"^N",["^E",[["~$f","^I"]]],"^O",null,"^P",["^E",[null,null]],"^A",1,"^@",53,"^B",53,"^Q",2,"^R",true,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Performs a depth-first, post-order traversal of form.  Calls f on\n  each sub-form, uses f's return value in place of the original.\n  Recognizes all Clojure data structures. Consumes seqs as with doall."],"~$prewalk",["^ ","^=",null,"^>",["^ ","^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^@",61,"^A",7,"^B",61,"^C",14,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Like postwalk, but does pre-order traversal.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/prewalk","^M",false,"^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^C",14,"^N",["^E",[["~$f","^I"]]],"^O",null,"^P",["^E",[null,null]],"^A",1,"^@",61,"^B",61,"^Q",2,"^R",true,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Like postwalk, but does pre-order traversal."],"~$keywordize-keys",["^ ","^=",null,"^>",["^ ","^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^@",67,"^A",7,"^B",67,"^C",22,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from strings to keywords.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/keywordize-keys","^M",false,"^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^C",22,"^N",["^E",[["~$m"]]],"^O",null,"^P",["^E",[null,null]],"^A",1,"^@",67,"^B",67,"^Q",1,"^R",true,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from strings to keywords."],"~$stringify-keys",["^ ","^=",null,"^>",["^ ","^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^@",75,"^A",7,"^B",75,"^C",21,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from keywords to strings.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/stringify-keys","^M",false,"^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^C",21,"^N",["^E",[["~$m"]]],"^O",null,"^P",["^E",[null,null]],"^A",1,"^@",75,"^B",75,"^Q",1,"^R",true,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from keywords to strings."],"~$prewalk-replace",["^ ","^=",null,"^>",["^ ","^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^@",83,"^A",7,"^B",83,"^C",22,"^D",["^E",["^F",["^E",[["~$smap","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the root of the tree first.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/prewalk-replace","^M",false,"^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^C",22,"^N",["^E",[["^10","^I"]]],"^O",null,"^P",["^E",[null,null]],"^A",1,"^@",83,"^B",83,"^Q",2,"^R",true,"^D",["^E",["^F",["^E",[["^10","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the root of the tree first."],"~$postwalk-replace",["^ ","^=",null,"^>",["^ ","^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^@",91,"^A",7,"^B",91,"^C",23,"^D",["^E",["^F",["^E",[["^10","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the leaves of the tree first.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/postwalk-replace","^M",false,"^?","/home/julien/.cljs/.aot_cache/1.10.329/20E4724/clojure/walk.cljs","^C",23,"^N",["^E",[["^10","^I"]]],"^O",null,"^P",["^E",[null,null]],"^A",1,"^@",91,"^B",91,"^Q",2,"^R",true,"^D",["^E",["^F",["^E",[["^10","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the leaves of the tree first."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^4",["~:else"]],"~:order",["^18"]],"^J","This file defines a generic tree walker for Clojure data\nstructures.  It takes any data structure (list, vector, map, set,\nseq), calls a function on every element, and uses the return value\nof the function in place of the original.  This makes it fairly\neasy to write recursive search-and-replace functions, as shown in\nthe examples.\n\nNote: \"walk\" supports all Clojure data structures EXCEPT maps\ncreated with sorted-map-by.  There is no (obvious) way to retrieve\nthe sorting function."]
\ No newline at end of file
diff --git a/js/clojure/walk.js b/js/clojure/walk.js
new file mode 100644
index 0000000..d6a7f75
--- /dev/null
+++ b/js/clojure/walk.js
@@ -0,0 +1,131 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('clojure.walk');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+/**
+ * Traverses form, an arbitrary data structure.  inner and outer are
+ *   functions.  Applies inner to each element of form, building up a
+ *   data structure of the same type, then applies outer to the result.
+ *   Recognizes all Clojure data structures. Consumes seqs as with doall.
+ */
+clojure.walk.walk = (function clojure$walk$walk(inner,outer,form){
+if(cljs.core.list_QMARK_(form)){
+var G__3794 = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.list,cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));
+return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__3794) : outer.call(null,G__3794));
+} else {
+if(cljs.core.map_entry_QMARK_(form)){
+var G__3795 = cljs.core.vec(cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));
+return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__3795) : outer.call(null,G__3795));
+} else {
+if(cljs.core.seq_QMARK_(form)){
+var G__3796 = cljs.core.doall.cljs$core$IFn$_invoke$arity$1(cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));
+return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__3796) : outer.call(null,G__3796));
+} else {
+if(cljs.core.record_QMARK_(form)){
+var G__3797 = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (r,x){
+return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(r,(inner.cljs$core$IFn$_invoke$arity$1 ? inner.cljs$core$IFn$_invoke$arity$1(x) : inner.call(null,x)));
+}),form,form);
+return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__3797) : outer.call(null,G__3797));
+} else {
+if(cljs.core.coll_QMARK_(form)){
+var G__3798 = cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.empty(form),cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));
+return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__3798) : outer.call(null,G__3798));
+} else {
+return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(form) : outer.call(null,form));
+
+}
+}
+}
+}
+}
+});
+/**
+ * Performs a depth-first, post-order traversal of form.  Calls f on
+ *   each sub-form, uses f's return value in place of the original.
+ *   Recognizes all Clojure data structures. Consumes seqs as with doall.
+ */
+clojure.walk.postwalk = (function clojure$walk$postwalk(f,form){
+return clojure.walk.walk(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(clojure.walk.postwalk,f),f,form);
+});
+/**
+ * Like postwalk, but does pre-order traversal.
+ */
+clojure.walk.prewalk = (function clojure$walk$prewalk(f,form){
+return clojure.walk.walk(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(clojure.walk.prewalk,f),cljs.core.identity,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(form) : f.call(null,form)));
+});
+/**
+ * Recursively transforms all map keys from strings to keywords.
+ */
+clojure.walk.keywordize_keys = (function clojure$walk$keywordize_keys(m){
+var f = (function (p__3799){
+var vec__3800 = p__3799;
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3800,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3800,(1),null);
+if(typeof k === 'string'){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(k),v], null);
+} else {
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,v], null);
+}
+});
+return clojure.walk.postwalk(((function (f){
+return (function (x){
+if(cljs.core.map_QMARK_(x)){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,x));
+} else {
+return x;
+}
+});})(f))
+,m);
+});
+/**
+ * Recursively transforms all map keys from keywords to strings.
+ */
+clojure.walk.stringify_keys = (function clojure$walk$stringify_keys(m){
+var f = (function (p__3803){
+var vec__3804 = p__3803;
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3804,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3804,(1),null);
+if((k instanceof cljs.core.Keyword)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.name(k),v], null);
+} else {
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,v], null);
+}
+});
+return clojure.walk.postwalk(((function (f){
+return (function (x){
+if(cljs.core.map_QMARK_(x)){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,x));
+} else {
+return x;
+}
+});})(f))
+,m);
+});
+/**
+ * Recursively transforms form by replacing keys in smap with their
+ *   values.  Like clojure/replace but works on any data structure.  Does
+ *   replacement at the root of the tree first.
+ */
+clojure.walk.prewalk_replace = (function clojure$walk$prewalk_replace(smap,form){
+return clojure.walk.prewalk((function (x){
+if(cljs.core.contains_QMARK_(smap,x)){
+return (smap.cljs$core$IFn$_invoke$arity$1 ? smap.cljs$core$IFn$_invoke$arity$1(x) : smap.call(null,x));
+} else {
+return x;
+}
+}),form);
+});
+/**
+ * Recursively transforms form by replacing keys in smap with their
+ *   values.  Like clojure/replace but works on any data structure.  Does
+ *   replacement at the leaves of the tree first.
+ */
+clojure.walk.postwalk_replace = (function clojure$walk$postwalk_replace(smap,form){
+return clojure.walk.postwalk((function (x){
+if(cljs.core.contains_QMARK_(smap,x)){
+return (smap.cljs$core$IFn$_invoke$arity$1 ? smap.cljs$core$IFn$_invoke$arity$1(x) : smap.call(null,x));
+} else {
+return x;
+}
+}),form);
+});
diff --git a/js/goog/array/array.js b/js/goog/array/array.js
new file mode 100644
index 0000000..47e0dbb
--- /dev/null
+++ b/js/goog/array/array.js
@@ -0,0 +1,1665 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Utilities for manipulating arrays.
+ *
+ * @author arv@google.com (Erik Arvidsson)
+ */
+
+
+goog.provide('goog.array');
+
+goog.require('goog.asserts');
+
+
+/**
+ * @define {boolean} NATIVE_ARRAY_PROTOTYPES indicates whether the code should
+ * rely on Array.prototype functions, if available.
+ *
+ * The Array.prototype functions can be defined by external libraries like
+ * Prototype and setting this flag to false forces closure to use its own
+ * goog.array implementation.
+ *
+ * If your javascript can be loaded by a third party site and you are wary about
+ * relying on the prototype functions, specify
+ * "--define goog.NATIVE_ARRAY_PROTOTYPES=false" to the JSCompiler.
+ *
+ * Setting goog.TRUSTED_SITE to false will automatically set
+ * NATIVE_ARRAY_PROTOTYPES to false.
+ */
+goog.define('goog.NATIVE_ARRAY_PROTOTYPES', goog.TRUSTED_SITE);
+
+
+/**
+ * @define {boolean} If true, JSCompiler will use the native implementation of
+ * array functions where appropriate (e.g., {@code Array#filter}) and remove the
+ * unused pure JS implementation.
+ */
+goog.define('goog.array.ASSUME_NATIVE_FUNCTIONS', false);
+
+
+/**
+ * Returns the last element in an array without removing it.
+ * Same as goog.array.last.
+ * @param {IArrayLike<T>|string} array The array.
+ * @return {T} Last item in array.
+ * @template T
+ */
+goog.array.peek = function(array) {
+  return array[array.length - 1];
+};
+
+
+/**
+ * Returns the last element in an array without removing it.
+ * Same as goog.array.peek.
+ * @param {IArrayLike<T>|string} array The array.
+ * @return {T} Last item in array.
+ * @template T
+ */
+goog.array.last = goog.array.peek;
+
+// NOTE(arv): Since most of the array functions are generic it allows you to
+// pass an array-like object. Strings have a length and are considered array-
+// like. However, the 'in' operator does not work on strings so we cannot just
+// use the array path even if the browser supports indexing into strings. We
+// therefore end up splitting the string.
+
+
+/**
+ * Returns the index of the first element of an array with a specified value, or
+ * -1 if the element is not present in the array.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-indexof}
+ *
+ * @param {IArrayLike<T>|string} arr The array to be searched.
+ * @param {T} obj The object for which we are searching.
+ * @param {number=} opt_fromIndex The index at which to start the search. If
+ *     omitted the search starts at index 0.
+ * @return {number} The index of the first matching array element.
+ * @template T
+ */
+goog.array.indexOf = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.indexOf) ?
+    function(arr, obj, opt_fromIndex) {
+      goog.asserts.assert(arr.length != null);
+
+      return Array.prototype.indexOf.call(arr, obj, opt_fromIndex);
+    } :
+    function(arr, obj, opt_fromIndex) {
+      var fromIndex = opt_fromIndex == null ?
+          0 :
+          (opt_fromIndex < 0 ? Math.max(0, arr.length + opt_fromIndex) :
+                               opt_fromIndex);
+
+      if (goog.isString(arr)) {
+        // Array.prototype.indexOf uses === so only strings should be found.
+        if (!goog.isString(obj) || obj.length != 1) {
+          return -1;
+        }
+        return arr.indexOf(obj, fromIndex);
+      }
+
+      for (var i = fromIndex; i < arr.length; i++) {
+        if (i in arr && arr[i] === obj) return i;
+      }
+      return -1;
+    };
+
+
+/**
+ * Returns the index of the last element of an array with a specified value, or
+ * -1 if the element is not present in the array.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-lastindexof}
+ *
+ * @param {!IArrayLike<T>|string} arr The array to be searched.
+ * @param {T} obj The object for which we are searching.
+ * @param {?number=} opt_fromIndex The index at which to start the search. If
+ *     omitted the search starts at the end of the array.
+ * @return {number} The index of the last matching array element.
+ * @template T
+ */
+goog.array.lastIndexOf = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.lastIndexOf) ?
+    function(arr, obj, opt_fromIndex) {
+      goog.asserts.assert(arr.length != null);
+
+      // Firefox treats undefined and null as 0 in the fromIndex argument which
+      // leads it to always return -1
+      var fromIndex = opt_fromIndex == null ? arr.length - 1 : opt_fromIndex;
+      return Array.prototype.lastIndexOf.call(arr, obj, fromIndex);
+    } :
+    function(arr, obj, opt_fromIndex) {
+      var fromIndex = opt_fromIndex == null ? arr.length - 1 : opt_fromIndex;
+
+      if (fromIndex < 0) {
+        fromIndex = Math.max(0, arr.length + fromIndex);
+      }
+
+      if (goog.isString(arr)) {
+        // Array.prototype.lastIndexOf uses === so only strings should be found.
+        if (!goog.isString(obj) || obj.length != 1) {
+          return -1;
+        }
+        return arr.lastIndexOf(obj, fromIndex);
+      }
+
+      for (var i = fromIndex; i >= 0; i--) {
+        if (i in arr && arr[i] === obj) return i;
+      }
+      return -1;
+    };
+
+
+/**
+ * Calls a function for each element in an array. Skips holes in the array.
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-foreach}
+ *
+ * @param {IArrayLike<T>|string} arr Array or array like object over
+ *     which to iterate.
+ * @param {?function(this: S, T, number, ?): ?} f The function to call for every
+ *     element. This function takes 3 arguments (the element, the index and the
+ *     array). The return value is ignored.
+ * @param {S=} opt_obj The object to be used as the value of 'this' within f.
+ * @template T,S
+ */
+goog.array.forEach = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.forEach) ?
+    function(arr, f, opt_obj) {
+      goog.asserts.assert(arr.length != null);
+
+      Array.prototype.forEach.call(arr, f, opt_obj);
+    } :
+    function(arr, f, opt_obj) {
+      var l = arr.length;  // must be fixed during loop... see docs
+      var arr2 = goog.isString(arr) ? arr.split('') : arr;
+      for (var i = 0; i < l; i++) {
+        if (i in arr2) {
+          f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr);
+        }
+      }
+    };
+
+
+/**
+ * Calls a function for each element in an array, starting from the last
+ * element rather than the first.
+ *
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this: S, T, number, ?): ?} f The function to call for every
+ *     element. This function
+ *     takes 3 arguments (the element, the index and the array). The return
+ *     value is ignored.
+ * @param {S=} opt_obj The object to be used as the value of 'this'
+ *     within f.
+ * @template T,S
+ */
+goog.array.forEachRight = function(arr, f, opt_obj) {
+  var l = arr.length;  // must be fixed during loop... see docs
+  var arr2 = goog.isString(arr) ? arr.split('') : arr;
+  for (var i = l - 1; i >= 0; --i) {
+    if (i in arr2) {
+      f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr);
+    }
+  }
+};
+
+
+/**
+ * Calls a function for each element in an array, and if the function returns
+ * true adds the element to a new array.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-filter}
+ *
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?):boolean} f The function to call for
+ *     every element. This function
+ *     takes 3 arguments (the element, the index and the array) and must
+ *     return a Boolean. If the return value is true the element is added to the
+ *     result array. If it is false the element is not included.
+ * @param {S=} opt_obj The object to be used as the value of 'this'
+ *     within f.
+ * @return {!Array<T>} a new array in which only elements that passed the test
+ *     are present.
+ * @template T,S
+ */
+goog.array.filter = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.filter) ?
+    function(arr, f, opt_obj) {
+      goog.asserts.assert(arr.length != null);
+
+      return Array.prototype.filter.call(arr, f, opt_obj);
+    } :
+    function(arr, f, opt_obj) {
+      var l = arr.length;  // must be fixed during loop... see docs
+      var res = [];
+      var resLength = 0;
+      var arr2 = goog.isString(arr) ? arr.split('') : arr;
+      for (var i = 0; i < l; i++) {
+        if (i in arr2) {
+          var val = arr2[i];  // in case f mutates arr2
+          if (f.call(/** @type {?} */ (opt_obj), val, i, arr)) {
+            res[resLength++] = val;
+          }
+        }
+      }
+      return res;
+    };
+
+
+/**
+ * Calls a function for each element in an array and inserts the result into a
+ * new array.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-map}
+ *
+ * @param {IArrayLike<VALUE>|string} arr Array or array like object
+ *     over which to iterate.
+ * @param {function(this:THIS, VALUE, number, ?): RESULT} f The function to call
+ *     for every element. This function takes 3 arguments (the element,
+ *     the index and the array) and should return something. The result will be
+ *     inserted into a new array.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within f.
+ * @return {!Array<RESULT>} a new array with the results from f.
+ * @template THIS, VALUE, RESULT
+ */
+goog.array.map = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.map) ?
+    function(arr, f, opt_obj) {
+      goog.asserts.assert(arr.length != null);
+
+      return Array.prototype.map.call(arr, f, opt_obj);
+    } :
+    function(arr, f, opt_obj) {
+      var l = arr.length;  // must be fixed during loop... see docs
+      var res = new Array(l);
+      var arr2 = goog.isString(arr) ? arr.split('') : arr;
+      for (var i = 0; i < l; i++) {
+        if (i in arr2) {
+          res[i] = f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr);
+        }
+      }
+      return res;
+    };
+
+
+/**
+ * Passes every element of an array into a function and accumulates the result.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-reduce}
+ *
+ * For example:
+ * var a = [1, 2, 3, 4];
+ * goog.array.reduce(a, function(r, v, i, arr) {return r + v;}, 0);
+ * returns 10
+ *
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {function(this:S, R, T, number, ?) : R} f The function to call for
+ *     every element. This function
+ *     takes 4 arguments (the function's previous result or the initial value,
+ *     the value of the current array element, the current array index, and the
+ *     array itself)
+ *     function(previousValue, currentValue, index, array).
+ * @param {?} val The initial value to pass into the function on the first call.
+ * @param {S=} opt_obj  The object to be used as the value of 'this'
+ *     within f.
+ * @return {R} Result of evaluating f repeatedly across the values of the array.
+ * @template T,S,R
+ */
+goog.array.reduce = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.reduce) ?
+    function(arr, f, val, opt_obj) {
+      goog.asserts.assert(arr.length != null);
+      if (opt_obj) {
+        f = goog.bind(f, opt_obj);
+      }
+      return Array.prototype.reduce.call(arr, f, val);
+    } :
+    function(arr, f, val, opt_obj) {
+      var rval = val;
+      goog.array.forEach(arr, function(val, index) {
+        rval = f.call(/** @type {?} */ (opt_obj), rval, val, index, arr);
+      });
+      return rval;
+    };
+
+
+/**
+ * Passes every element of an array into a function and accumulates the result,
+ * starting from the last element and working towards the first.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-reduceright}
+ *
+ * For example:
+ * var a = ['a', 'b', 'c'];
+ * goog.array.reduceRight(a, function(r, v, i, arr) {return r + v;}, '');
+ * returns 'cba'
+ *
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, R, T, number, ?) : R} f The function to call for
+ *     every element. This function
+ *     takes 4 arguments (the function's previous result or the initial value,
+ *     the value of the current array element, the current array index, and the
+ *     array itself)
+ *     function(previousValue, currentValue, index, array).
+ * @param {?} val The initial value to pass into the function on the first call.
+ * @param {S=} opt_obj The object to be used as the value of 'this'
+ *     within f.
+ * @return {R} Object returned as a result of evaluating f repeatedly across the
+ *     values of the array.
+ * @template T,S,R
+ */
+goog.array.reduceRight = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.reduceRight) ?
+    function(arr, f, val, opt_obj) {
+      goog.asserts.assert(arr.length != null);
+      goog.asserts.assert(f != null);
+      if (opt_obj) {
+        f = goog.bind(f, opt_obj);
+      }
+      return Array.prototype.reduceRight.call(arr, f, val);
+    } :
+    function(arr, f, val, opt_obj) {
+      var rval = val;
+      goog.array.forEachRight(arr, function(val, index) {
+        rval = f.call(/** @type {?} */ (opt_obj), rval, val, index, arr);
+      });
+      return rval;
+    };
+
+
+/**
+ * Calls f for each element of an array. If any call returns true, some()
+ * returns true (without checking the remaining elements). If all calls
+ * return false, some() returns false.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-some}
+ *
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call for
+ *     for every element. This function takes 3 arguments (the element, the
+ *     index and the array) and should return a boolean.
+ * @param {S=} opt_obj  The object to be used as the value of 'this'
+ *     within f.
+ * @return {boolean} true if any element passes the test.
+ * @template T,S
+ */
+goog.array.some = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.some) ?
+    function(arr, f, opt_obj) {
+      goog.asserts.assert(arr.length != null);
+
+      return Array.prototype.some.call(arr, f, opt_obj);
+    } :
+    function(arr, f, opt_obj) {
+      var l = arr.length;  // must be fixed during loop... see docs
+      var arr2 = goog.isString(arr) ? arr.split('') : arr;
+      for (var i = 0; i < l; i++) {
+        if (i in arr2 && f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {
+          return true;
+        }
+      }
+      return false;
+    };
+
+
+/**
+ * Call f for each element of an array. If all calls return true, every()
+ * returns true. If any call returns false, every() returns false and
+ * does not continue to check the remaining elements.
+ *
+ * See {@link http://tinyurl.com/developer-mozilla-org-array-every}
+ *
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call for
+ *     for every element. This function takes 3 arguments (the element, the
+ *     index and the array) and should return a boolean.
+ * @param {S=} opt_obj The object to be used as the value of 'this'
+ *     within f.
+ * @return {boolean} false if any element fails the test.
+ * @template T,S
+ */
+goog.array.every = goog.NATIVE_ARRAY_PROTOTYPES &&
+        (goog.array.ASSUME_NATIVE_FUNCTIONS || Array.prototype.every) ?
+    function(arr, f, opt_obj) {
+      goog.asserts.assert(arr.length != null);
+
+      return Array.prototype.every.call(arr, f, opt_obj);
+    } :
+    function(arr, f, opt_obj) {
+      var l = arr.length;  // must be fixed during loop... see docs
+      var arr2 = goog.isString(arr) ? arr.split('') : arr;
+      for (var i = 0; i < l; i++) {
+        if (i in arr2 && !f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {
+          return false;
+        }
+      }
+      return true;
+    };
+
+
+/**
+ * Counts the array elements that fulfill the predicate, i.e. for which the
+ * callback function returns true. Skips holes in the array.
+ *
+ * @param {!IArrayLike<T>|string} arr Array or array like object
+ *     over which to iterate.
+ * @param {function(this: S, T, number, ?): boolean} f The function to call for
+ *     every element. Takes 3 arguments (the element, the index and the array).
+ * @param {S=} opt_obj The object to be used as the value of 'this' within f.
+ * @return {number} The number of the matching elements.
+ * @template T,S
+ */
+goog.array.count = function(arr, f, opt_obj) {
+  var count = 0;
+  goog.array.forEach(arr, function(element, index, arr) {
+    if (f.call(/** @type {?} */ (opt_obj), element, index, arr)) {
+      ++count;
+    }
+  }, opt_obj);
+  return count;
+};
+
+
+/**
+ * Search an array for the first element that satisfies a given condition and
+ * return that element.
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call
+ *     for every element. This function takes 3 arguments (the element, the
+ *     index and the array) and should return a boolean.
+ * @param {S=} opt_obj An optional "this" context for the function.
+ * @return {T|null} The first array element that passes the test, or null if no
+ *     element is found.
+ * @template T,S
+ */
+goog.array.find = function(arr, f, opt_obj) {
+  var i = goog.array.findIndex(arr, f, opt_obj);
+  return i < 0 ? null : goog.isString(arr) ? arr.charAt(i) : arr[i];
+};
+
+
+/**
+ * Search an array for the first element that satisfies a given condition and
+ * return its index.
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call for
+ *     every element. This function
+ *     takes 3 arguments (the element, the index and the array) and should
+ *     return a boolean.
+ * @param {S=} opt_obj An optional "this" context for the function.
+ * @return {number} The index of the first array element that passes the test,
+ *     or -1 if no element is found.
+ * @template T,S
+ */
+goog.array.findIndex = function(arr, f, opt_obj) {
+  var l = arr.length;  // must be fixed during loop... see docs
+  var arr2 = goog.isString(arr) ? arr.split('') : arr;
+  for (var i = 0; i < l; i++) {
+    if (i in arr2 && f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {
+      return i;
+    }
+  }
+  return -1;
+};
+
+
+/**
+ * Search an array (in reverse order) for the last element that satisfies a
+ * given condition and return that element.
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call
+ *     for every element. This function
+ *     takes 3 arguments (the element, the index and the array) and should
+ *     return a boolean.
+ * @param {S=} opt_obj An optional "this" context for the function.
+ * @return {T|null} The last array element that passes the test, or null if no
+ *     element is found.
+ * @template T,S
+ */
+goog.array.findRight = function(arr, f, opt_obj) {
+  var i = goog.array.findIndexRight(arr, f, opt_obj);
+  return i < 0 ? null : goog.isString(arr) ? arr.charAt(i) : arr[i];
+};
+
+
+/**
+ * Search an array (in reverse order) for the last element that satisfies a
+ * given condition and return its index.
+ * @param {IArrayLike<T>|string} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call
+ *     for every element. This function
+ *     takes 3 arguments (the element, the index and the array) and should
+ *     return a boolean.
+ * @param {S=} opt_obj An optional "this" context for the function.
+ * @return {number} The index of the last array element that passes the test,
+ *     or -1 if no element is found.
+ * @template T,S
+ */
+goog.array.findIndexRight = function(arr, f, opt_obj) {
+  var l = arr.length;  // must be fixed during loop... see docs
+  var arr2 = goog.isString(arr) ? arr.split('') : arr;
+  for (var i = l - 1; i >= 0; i--) {
+    if (i in arr2 && f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {
+      return i;
+    }
+  }
+  return -1;
+};
+
+
+/**
+ * Whether the array contains the given object.
+ * @param {IArrayLike<?>|string} arr The array to test for the presence of the
+ *     element.
+ * @param {*} obj The object for which to test.
+ * @return {boolean} true if obj is present.
+ */
+goog.array.contains = function(arr, obj) {
+  return goog.array.indexOf(arr, obj) >= 0;
+};
+
+
+/**
+ * Whether the array is empty.
+ * @param {IArrayLike<?>|string} arr The array to test.
+ * @return {boolean} true if empty.
+ */
+goog.array.isEmpty = function(arr) {
+  return arr.length == 0;
+};
+
+
+/**
+ * Clears the array.
+ * @param {IArrayLike<?>} arr Array or array like object to clear.
+ */
+goog.array.clear = function(arr) {
+  // For non real arrays we don't have the magic length so we delete the
+  // indices.
+  if (!goog.isArray(arr)) {
+    for (var i = arr.length - 1; i >= 0; i--) {
+      delete arr[i];
+    }
+  }
+  arr.length = 0;
+};
+
+
+/**
+ * Pushes an item into an array, if it's not already in the array.
+ * @param {Array<T>} arr Array into which to insert the item.
+ * @param {T} obj Value to add.
+ * @template T
+ */
+goog.array.insert = function(arr, obj) {
+  if (!goog.array.contains(arr, obj)) {
+    arr.push(obj);
+  }
+};
+
+
+/**
+ * Inserts an object at the given index of the array.
+ * @param {IArrayLike<?>} arr The array to modify.
+ * @param {*} obj The object to insert.
+ * @param {number=} opt_i The index at which to insert the object. If omitted,
+ *      treated as 0. A negative index is counted from the end of the array.
+ */
+goog.array.insertAt = function(arr, obj, opt_i) {
+  goog.array.splice(arr, opt_i, 0, obj);
+};
+
+
+/**
+ * Inserts at the given index of the array, all elements of another array.
+ * @param {IArrayLike<?>} arr The array to modify.
+ * @param {IArrayLike<?>} elementsToAdd The array of elements to add.
+ * @param {number=} opt_i The index at which to insert the object. If omitted,
+ *      treated as 0. A negative index is counted from the end of the array.
+ */
+goog.array.insertArrayAt = function(arr, elementsToAdd, opt_i) {
+  goog.partial(goog.array.splice, arr, opt_i, 0).apply(null, elementsToAdd);
+};
+
+
+/**
+ * Inserts an object into an array before a specified object.
+ * @param {Array<T>} arr The array to modify.
+ * @param {T} obj The object to insert.
+ * @param {T=} opt_obj2 The object before which obj should be inserted. If obj2
+ *     is omitted or not found, obj is inserted at the end of the array.
+ * @template T
+ */
+goog.array.insertBefore = function(arr, obj, opt_obj2) {
+  var i;
+  if (arguments.length == 2 || (i = goog.array.indexOf(arr, opt_obj2)) < 0) {
+    arr.push(obj);
+  } else {
+    goog.array.insertAt(arr, obj, i);
+  }
+};
+
+
+/**
+ * Removes the first occurrence of a particular value from an array.
+ * @param {IArrayLike<T>} arr Array from which to remove
+ *     value.
+ * @param {T} obj Object to remove.
+ * @return {boolean} True if an element was removed.
+ * @template T
+ */
+goog.array.remove = function(arr, obj) {
+  var i = goog.array.indexOf(arr, obj);
+  var rv;
+  if ((rv = i >= 0)) {
+    goog.array.removeAt(arr, i);
+  }
+  return rv;
+};
+
+
+/**
+ * Removes the last occurrence of a particular value from an array.
+ * @param {!IArrayLike<T>} arr Array from which to remove value.
+ * @param {T} obj Object to remove.
+ * @return {boolean} True if an element was removed.
+ * @template T
+ */
+goog.array.removeLast = function(arr, obj) {
+  var i = goog.array.lastIndexOf(arr, obj);
+  if (i >= 0) {
+    goog.array.removeAt(arr, i);
+    return true;
+  }
+  return false;
+};
+
+
+/**
+ * Removes from an array the element at index i
+ * @param {IArrayLike<?>} arr Array or array like object from which to
+ *     remove value.
+ * @param {number} i The index to remove.
+ * @return {boolean} True if an element was removed.
+ */
+goog.array.removeAt = function(arr, i) {
+  goog.asserts.assert(arr.length != null);
+
+  // use generic form of splice
+  // splice returns the removed items and if successful the length of that
+  // will be 1
+  return Array.prototype.splice.call(arr, i, 1).length == 1;
+};
+
+
+/**
+ * Removes the first value that satisfies the given condition.
+ * @param {IArrayLike<T>} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call
+ *     for every element. This function
+ *     takes 3 arguments (the element, the index and the array) and should
+ *     return a boolean.
+ * @param {S=} opt_obj An optional "this" context for the function.
+ * @return {boolean} True if an element was removed.
+ * @template T,S
+ */
+goog.array.removeIf = function(arr, f, opt_obj) {
+  var i = goog.array.findIndex(arr, f, opt_obj);
+  if (i >= 0) {
+    goog.array.removeAt(arr, i);
+    return true;
+  }
+  return false;
+};
+
+
+/**
+ * Removes all values that satisfy the given condition.
+ * @param {IArrayLike<T>} arr Array or array
+ *     like object over which to iterate.
+ * @param {?function(this:S, T, number, ?) : boolean} f The function to call
+ *     for every element. This function
+ *     takes 3 arguments (the element, the index and the array) and should
+ *     return a boolean.
+ * @param {S=} opt_obj An optional "this" context for the function.
+ * @return {number} The number of items removed
+ * @template T,S
+ */
+goog.array.removeAllIf = function(arr, f, opt_obj) {
+  var removedCount = 0;
+  goog.array.forEachRight(arr, function(val, index) {
+    if (f.call(/** @type {?} */ (opt_obj), val, index, arr)) {
+      if (goog.array.removeAt(arr, index)) {
+        removedCount++;
+      }
+    }
+  });
+  return removedCount;
+};
+
+
+/**
+ * Returns a new array that is the result of joining the arguments.  If arrays
+ * are passed then their items are added, however, if non-arrays are passed they
+ * will be added to the return array as is.
+ *
+ * Note that ArrayLike objects will be added as is, rather than having their
+ * items added.
+ *
+ * goog.array.concat([1, 2], [3, 4]) -> [1, 2, 3, 4]
+ * goog.array.concat(0, [1, 2]) -> [0, 1, 2]
+ * goog.array.concat([1, 2], null) -> [1, 2, null]
+ *
+ * There is bug in all current versions of IE (6, 7 and 8) where arrays created
+ * in an iframe become corrupted soon (not immediately) after the iframe is
+ * destroyed. This is common if loading data via goog.net.IframeIo, for example.
+ * This corruption only affects the concat method which will start throwing
+ * Catastrophic Errors (#-2147418113).
+ *
+ * See http://endoflow.com/scratch/corrupted-arrays.html for a test case.
+ *
+ * Internally goog.array should use this, so that all methods will continue to
+ * work on these broken array objects.
+ *
+ * @param {...*} var_args Items to concatenate.  Arrays will have each item
+ *     added, while primitives and objects will be added as is.
+ * @return {!Array<?>} The new resultant array.
+ */
+goog.array.concat = function(var_args) {
+  return Array.prototype.concat.apply([], arguments);
+};
+
+
+/**
+ * Returns a new array that contains the contents of all the arrays passed.
+ * @param {...!Array<T>} var_args
+ * @return {!Array<T>}
+ * @template T
+ */
+goog.array.join = function(var_args) {
+  return Array.prototype.concat.apply([], arguments);
+};
+
+
+/**
+ * Converts an object to an array.
+ * @param {IArrayLike<T>|string} object  The object to convert to an
+ *     array.
+ * @return {!Array<T>} The object converted into an array. If object has a
+ *     length property, every property indexed with a non-negative number
+ *     less than length will be included in the result. If object does not
+ *     have a length property, an empty array will be returned.
+ * @template T
+ */
+goog.array.toArray = function(object) {
+  var length = object.length;
+
+  // If length is not a number the following it false. This case is kept for
+  // backwards compatibility since there are callers that pass objects that are
+  // not array like.
+  if (length > 0) {
+    var rv = new Array(length);
+    for (var i = 0; i < length; i++) {
+      rv[i] = object[i];
+    }
+    return rv;
+  }
+  return [];
+};
+
+
+/**
+ * Does a shallow copy of an array.
+ * @param {IArrayLike<T>|string} arr  Array or array-like object to
+ *     clone.
+ * @return {!Array<T>} Clone of the input array.
+ * @template T
+ */
+goog.array.clone = goog.array.toArray;
+
+
+/**
+ * Extends an array with another array, element, or "array like" object.
+ * This function operates 'in-place', it does not create a new Array.
+ *
+ * Example:
+ * var a = [];
+ * goog.array.extend(a, [0, 1]);
+ * a; // [0, 1]
+ * goog.array.extend(a, 2);
+ * a; // [0, 1, 2]
+ *
+ * @param {Array<VALUE>} arr1  The array to modify.
+ * @param {...(Array<VALUE>|VALUE)} var_args The elements or arrays of elements
+ *     to add to arr1.
+ * @template VALUE
+ */
+goog.array.extend = function(arr1, var_args) {
+  for (var i = 1; i < arguments.length; i++) {
+    var arr2 = arguments[i];
+    if (goog.isArrayLike(arr2)) {
+      var len1 = arr1.length || 0;
+      var len2 = arr2.length || 0;
+      arr1.length = len1 + len2;
+      for (var j = 0; j < len2; j++) {
+        arr1[len1 + j] = arr2[j];
+      }
+    } else {
+      arr1.push(arr2);
+    }
+  }
+};
+
+
+/**
+ * Adds or removes elements from an array. This is a generic version of Array
+ * splice. This means that it might work on other objects similar to arrays,
+ * such as the arguments object.
+ *
+ * @param {IArrayLike<T>} arr The array to modify.
+ * @param {number|undefined} index The index at which to start changing the
+ *     array. If not defined, treated as 0.
+ * @param {number} howMany How many elements to remove (0 means no removal. A
+ *     value below 0 is treated as zero and so is any other non number. Numbers
+ *     are floored).
+ * @param {...T} var_args Optional, additional elements to insert into the
+ *     array.
+ * @return {!Array<T>} the removed elements.
+ * @template T
+ */
+goog.array.splice = function(arr, index, howMany, var_args) {
+  goog.asserts.assert(arr.length != null);
+
+  return Array.prototype.splice.apply(arr, goog.array.slice(arguments, 1));
+};
+
+
+/**
+ * Returns a new array from a segment of an array. This is a generic version of
+ * Array slice. This means that it might work on other objects similar to
+ * arrays, such as the arguments object.
+ *
+ * @param {IArrayLike<T>|string} arr The array from
+ * which to copy a segment.
+ * @param {number} start The index of the first element to copy.
+ * @param {number=} opt_end The index after the last element to copy.
+ * @return {!Array<T>} A new array containing the specified segment of the
+ *     original array.
+ * @template T
+ */
+goog.array.slice = function(arr, start, opt_end) {
+  goog.asserts.assert(arr.length != null);
+
+  // passing 1 arg to slice is not the same as passing 2 where the second is
+  // null or undefined (in that case the second argument is treated as 0).
+  // we could use slice on the arguments object and then use apply instead of
+  // testing the length
+  if (arguments.length <= 2) {
+    return Array.prototype.slice.call(arr, start);
+  } else {
+    return Array.prototype.slice.call(arr, start, opt_end);
+  }
+};
+
+
+/**
+ * Removes all duplicates from an array (retaining only the first
+ * occurrence of each array element).  This function modifies the
+ * array in place and doesn't change the order of the non-duplicate items.
+ *
+ * For objects, duplicates are identified as having the same unique ID as
+ * defined by {@link goog.getUid}.
+ *
+ * Alternatively you can specify a custom hash function that returns a unique
+ * value for each item in the array it should consider unique.
+ *
+ * Runtime: N,
+ * Worstcase space: 2N (no dupes)
+ *
+ * @param {IArrayLike<T>} arr The array from which to remove
+ *     duplicates.
+ * @param {Array=} opt_rv An optional array in which to return the results,
+ *     instead of performing the removal inplace.  If specified, the original
+ *     array will remain unchanged.
+ * @param {function(T):string=} opt_hashFn An optional function to use to
+ *     apply to every item in the array. This function should return a unique
+ *     value for each item in the array it should consider unique.
+ * @template T
+ */
+goog.array.removeDuplicates = function(arr, opt_rv, opt_hashFn) {
+  var returnArray = opt_rv || arr;
+  var defaultHashFn = function(item) {
+    // Prefix each type with a single character representing the type to
+    // prevent conflicting keys (e.g. true and 'true').
+    return goog.isObject(item) ? 'o' + goog.getUid(item) :
+                                 (typeof item).charAt(0) + item;
+  };
+  var hashFn = opt_hashFn || defaultHashFn;
+
+  var seen = {}, cursorInsert = 0, cursorRead = 0;
+  while (cursorRead < arr.length) {
+    var current = arr[cursorRead++];
+    var key = hashFn(current);
+    if (!Object.prototype.hasOwnProperty.call(seen, key)) {
+      seen[key] = true;
+      returnArray[cursorInsert++] = current;
+    }
+  }
+  returnArray.length = cursorInsert;
+};
+
+
+/**
+ * Searches the specified array for the specified target using the binary
+ * search algorithm.  If no opt_compareFn is specified, elements are compared
+ * using <code>goog.array.defaultCompare</code>, which compares the elements
+ * using the built in < and > operators.  This will produce the expected
+ * behavior for homogeneous arrays of String(s) and Number(s). The array
+ * specified <b>must</b> be sorted in ascending order (as defined by the
+ * comparison function).  If the array is not sorted, results are undefined.
+ * If the array contains multiple instances of the specified target value, any
+ * of these instances may be found.
+ *
+ * Runtime: O(log n)
+ *
+ * @param {IArrayLike<VALUE>} arr The array to be searched.
+ * @param {TARGET} target The sought value.
+ * @param {function(TARGET, VALUE): number=} opt_compareFn Optional comparison
+ *     function by which the array is ordered. Should take 2 arguments to
+ *     compare, and return a negative number, zero, or a positive number
+ *     depending on whether the first argument is less than, equal to, or
+ *     greater than the second.
+ * @return {number} Lowest index of the target value if found, otherwise
+ *     (-(insertion point) - 1). The insertion point is where the value should
+ *     be inserted into arr to preserve the sorted property.  Return value >= 0
+ *     iff target is found.
+ * @template TARGET, VALUE
+ */
+goog.array.binarySearch = function(arr, target, opt_compareFn) {
+  return goog.array.binarySearch_(
+      arr, opt_compareFn || goog.array.defaultCompare, false /* isEvaluator */,
+      target);
+};
+
+
+/**
+ * Selects an index in the specified array using the binary search algorithm.
+ * The evaluator receives an element and determines whether the desired index
+ * is before, at, or after it.  The evaluator must be consistent (formally,
+ * goog.array.map(goog.array.map(arr, evaluator, opt_obj), goog.math.sign)
+ * must be monotonically non-increasing).
+ *
+ * Runtime: O(log n)
+ *
+ * @param {IArrayLike<VALUE>} arr The array to be searched.
+ * @param {function(this:THIS, VALUE, number, ?): number} evaluator
+ *     Evaluator function that receives 3 arguments (the element, the index and
+ *     the array). Should return a negative number, zero, or a positive number
+ *     depending on whether the desired index is before, at, or after the
+ *     element passed to it.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this'
+ *     within evaluator.
+ * @return {number} Index of the leftmost element matched by the evaluator, if
+ *     such exists; otherwise (-(insertion point) - 1). The insertion point is
+ *     the index of the first element for which the evaluator returns negative,
+ *     or arr.length if no such element exists. The return value is non-negative
+ *     iff a match is found.
+ * @template THIS, VALUE
+ */
+goog.array.binarySelect = function(arr, evaluator, opt_obj) {
+  return goog.array.binarySearch_(
+      arr, evaluator, true /* isEvaluator */, undefined /* opt_target */,
+      opt_obj);
+};
+
+
+/**
+ * Implementation of a binary search algorithm which knows how to use both
+ * comparison functions and evaluators. If an evaluator is provided, will call
+ * the evaluator with the given optional data object, conforming to the
+ * interface defined in binarySelect. Otherwise, if a comparison function is
+ * provided, will call the comparison function against the given data object.
+ *
+ * This implementation purposefully does not use goog.bind or goog.partial for
+ * performance reasons.
+ *
+ * Runtime: O(log n)
+ *
+ * @param {IArrayLike<?>} arr The array to be searched.
+ * @param {function(?, ?, ?): number | function(?, ?): number} compareFn
+ *     Either an evaluator or a comparison function, as defined by binarySearch
+ *     and binarySelect above.
+ * @param {boolean} isEvaluator Whether the function is an evaluator or a
+ *     comparison function.
+ * @param {?=} opt_target If the function is a comparison function, then
+ *     this is the target to binary search for.
+ * @param {Object=} opt_selfObj If the function is an evaluator, this is an
+ *     optional this object for the evaluator.
+ * @return {number} Lowest index of the target value if found, otherwise
+ *     (-(insertion point) - 1). The insertion point is where the value should
+ *     be inserted into arr to preserve the sorted property.  Return value >= 0
+ *     iff target is found.
+ * @private
+ */
+goog.array.binarySearch_ = function(
+    arr, compareFn, isEvaluator, opt_target, opt_selfObj) {
+  var left = 0;            // inclusive
+  var right = arr.length;  // exclusive
+  var found;
+  while (left < right) {
+    var middle = (left + right) >> 1;
+    var compareResult;
+    if (isEvaluator) {
+      compareResult = compareFn.call(opt_selfObj, arr[middle], middle, arr);
+    } else {
+      // NOTE(dimvar): To avoid this cast, we'd have to use function overloading
+      // for the type of binarySearch_, which the type system can't express yet.
+      compareResult = /** @type {function(?, ?): number} */ (compareFn)(
+          opt_target, arr[middle]);
+    }
+    if (compareResult > 0) {
+      left = middle + 1;
+    } else {
+      right = middle;
+      // We are looking for the lowest index so we can't return immediately.
+      found = !compareResult;
+    }
+  }
+  // left is the index if found, or the insertion point otherwise.
+  // ~left is a shorthand for -left - 1.
+  return found ? left : ~left;
+};
+
+
+/**
+ * Sorts the specified array into ascending order.  If no opt_compareFn is
+ * specified, elements are compared using
+ * <code>goog.array.defaultCompare</code>, which compares the elements using
+ * the built in < and > operators.  This will produce the expected behavior
+ * for homogeneous arrays of String(s) and Number(s), unlike the native sort,
+ * but will give unpredictable results for heterogeneous lists of strings and
+ * numbers with different numbers of digits.
+ *
+ * This sort is not guaranteed to be stable.
+ *
+ * Runtime: Same as <code>Array.prototype.sort</code>
+ *
+ * @param {Array<T>} arr The array to be sorted.
+ * @param {?function(T,T):number=} opt_compareFn Optional comparison
+ *     function by which the
+ *     array is to be ordered. Should take 2 arguments to compare, and return a
+ *     negative number, zero, or a positive number depending on whether the
+ *     first argument is less than, equal to, or greater than the second.
+ * @template T
+ */
+goog.array.sort = function(arr, opt_compareFn) {
+  // TODO(arv): Update type annotation since null is not accepted.
+  arr.sort(opt_compareFn || goog.array.defaultCompare);
+};
+
+
+/**
+ * Sorts the specified array into ascending order in a stable way.  If no
+ * opt_compareFn is specified, elements are compared using
+ * <code>goog.array.defaultCompare</code>, which compares the elements using
+ * the built in < and > operators.  This will produce the expected behavior
+ * for homogeneous arrays of String(s) and Number(s).
+ *
+ * Runtime: Same as <code>Array.prototype.sort</code>, plus an additional
+ * O(n) overhead of copying the array twice.
+ *
+ * @param {Array<T>} arr The array to be sorted.
+ * @param {?function(T, T): number=} opt_compareFn Optional comparison function
+ *     by which the array is to be ordered. Should take 2 arguments to compare,
+ *     and return a negative number, zero, or a positive number depending on
+ *     whether the first argument is less than, equal to, or greater than the
+ *     second.
+ * @template T
+ */
+goog.array.stableSort = function(arr, opt_compareFn) {
+  var compArr = new Array(arr.length);
+  for (var i = 0; i < arr.length; i++) {
+    compArr[i] = {index: i, value: arr[i]};
+  }
+  var valueCompareFn = opt_compareFn || goog.array.defaultCompare;
+  function stableCompareFn(obj1, obj2) {
+    return valueCompareFn(obj1.value, obj2.value) || obj1.index - obj2.index;
+  }
+  goog.array.sort(compArr, stableCompareFn);
+  for (var i = 0; i < arr.length; i++) {
+    arr[i] = compArr[i].value;
+  }
+};
+
+
+/**
+ * Sort the specified array into ascending order based on item keys
+ * returned by the specified key function.
+ * If no opt_compareFn is specified, the keys are compared in ascending order
+ * using <code>goog.array.defaultCompare</code>.
+ *
+ * Runtime: O(S(f(n)), where S is runtime of <code>goog.array.sort</code>
+ * and f(n) is runtime of the key function.
+ *
+ * @param {Array<T>} arr The array to be sorted.
+ * @param {function(T): K} keyFn Function taking array element and returning
+ *     a key used for sorting this element.
+ * @param {?function(K, K): number=} opt_compareFn Optional comparison function
+ *     by which the keys are to be ordered. Should take 2 arguments to compare,
+ *     and return a negative number, zero, or a positive number depending on
+ *     whether the first argument is less than, equal to, or greater than the
+ *     second.
+ * @template T,K
+ */
+goog.array.sortByKey = function(arr, keyFn, opt_compareFn) {
+  var keyCompareFn = opt_compareFn || goog.array.defaultCompare;
+  goog.array.sort(
+      arr, function(a, b) { return keyCompareFn(keyFn(a), keyFn(b)); });
+};
+
+
+/**
+ * Sorts an array of objects by the specified object key and compare
+ * function. If no compare function is provided, the key values are
+ * compared in ascending order using <code>goog.array.defaultCompare</code>.
+ * This won't work for keys that get renamed by the compiler. So use
+ * {'foo': 1, 'bar': 2} rather than {foo: 1, bar: 2}.
+ * @param {Array<Object>} arr An array of objects to sort.
+ * @param {string} key The object key to sort by.
+ * @param {Function=} opt_compareFn The function to use to compare key
+ *     values.
+ */
+goog.array.sortObjectsByKey = function(arr, key, opt_compareFn) {
+  goog.array.sortByKey(arr, function(obj) { return obj[key]; }, opt_compareFn);
+};
+
+
+/**
+ * Tells if the array is sorted.
+ * @param {!Array<T>} arr The array.
+ * @param {?function(T,T):number=} opt_compareFn Function to compare the
+ *     array elements.
+ *     Should take 2 arguments to compare, and return a negative number, zero,
+ *     or a positive number depending on whether the first argument is less
+ *     than, equal to, or greater than the second.
+ * @param {boolean=} opt_strict If true no equal elements are allowed.
+ * @return {boolean} Whether the array is sorted.
+ * @template T
+ */
+goog.array.isSorted = function(arr, opt_compareFn, opt_strict) {
+  var compare = opt_compareFn || goog.array.defaultCompare;
+  for (var i = 1; i < arr.length; i++) {
+    var compareResult = compare(arr[i - 1], arr[i]);
+    if (compareResult > 0 || compareResult == 0 && opt_strict) {
+      return false;
+    }
+  }
+  return true;
+};
+
+
+/**
+ * Compares two arrays for equality. Two arrays are considered equal if they
+ * have the same length and their corresponding elements are equal according to
+ * the comparison function.
+ *
+ * @param {IArrayLike<?>} arr1 The first array to compare.
+ * @param {IArrayLike<?>} arr2 The second array to compare.
+ * @param {Function=} opt_equalsFn Optional comparison function.
+ *     Should take 2 arguments to compare, and return true if the arguments
+ *     are equal. Defaults to {@link goog.array.defaultCompareEquality} which
+ *     compares the elements using the built-in '===' operator.
+ * @return {boolean} Whether the two arrays are equal.
+ */
+goog.array.equals = function(arr1, arr2, opt_equalsFn) {
+  if (!goog.isArrayLike(arr1) || !goog.isArrayLike(arr2) ||
+      arr1.length != arr2.length) {
+    return false;
+  }
+  var l = arr1.length;
+  var equalsFn = opt_equalsFn || goog.array.defaultCompareEquality;
+  for (var i = 0; i < l; i++) {
+    if (!equalsFn(arr1[i], arr2[i])) {
+      return false;
+    }
+  }
+  return true;
+};
+
+
+/**
+ * 3-way array compare function.
+ * @param {!IArrayLike<VALUE>} arr1 The first array to
+ *     compare.
+ * @param {!IArrayLike<VALUE>} arr2 The second array to
+ *     compare.
+ * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison
+ *     function by which the array is to be ordered. Should take 2 arguments to
+ *     compare, and return a negative number, zero, or a positive number
+ *     depending on whether the first argument is less than, equal to, or
+ *     greater than the second.
+ * @return {number} Negative number, zero, or a positive number depending on
+ *     whether the first argument is less than, equal to, or greater than the
+ *     second.
+ * @template VALUE
+ */
+goog.array.compare3 = function(arr1, arr2, opt_compareFn) {
+  var compare = opt_compareFn || goog.array.defaultCompare;
+  var l = Math.min(arr1.length, arr2.length);
+  for (var i = 0; i < l; i++) {
+    var result = compare(arr1[i], arr2[i]);
+    if (result != 0) {
+      return result;
+    }
+  }
+  return goog.array.defaultCompare(arr1.length, arr2.length);
+};
+
+
+/**
+ * Compares its two arguments for order, using the built in < and >
+ * operators.
+ * @param {VALUE} a The first object to be compared.
+ * @param {VALUE} b The second object to be compared.
+ * @return {number} A negative number, zero, or a positive number as the first
+ *     argument is less than, equal to, or greater than the second,
+ *     respectively.
+ * @template VALUE
+ */
+goog.array.defaultCompare = function(a, b) {
+  return a > b ? 1 : a < b ? -1 : 0;
+};
+
+
+/**
+ * Compares its two arguments for inverse order, using the built in < and >
+ * operators.
+ * @param {VALUE} a The first object to be compared.
+ * @param {VALUE} b The second object to be compared.
+ * @return {number} A negative number, zero, or a positive number as the first
+ *     argument is greater than, equal to, or less than the second,
+ *     respectively.
+ * @template VALUE
+ */
+goog.array.inverseDefaultCompare = function(a, b) {
+  return -goog.array.defaultCompare(a, b);
+};
+
+
+/**
+ * Compares its two arguments for equality, using the built in === operator.
+ * @param {*} a The first object to compare.
+ * @param {*} b The second object to compare.
+ * @return {boolean} True if the two arguments are equal, false otherwise.
+ */
+goog.array.defaultCompareEquality = function(a, b) {
+  return a === b;
+};
+
+
+/**
+ * Inserts a value into a sorted array. The array is not modified if the
+ * value is already present.
+ * @param {IArrayLike<VALUE>} array The array to modify.
+ * @param {VALUE} value The object to insert.
+ * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison
+ *     function by which the array is ordered. Should take 2 arguments to
+ *     compare, and return a negative number, zero, or a positive number
+ *     depending on whether the first argument is less than, equal to, or
+ *     greater than the second.
+ * @return {boolean} True if an element was inserted.
+ * @template VALUE
+ */
+goog.array.binaryInsert = function(array, value, opt_compareFn) {
+  var index = goog.array.binarySearch(array, value, opt_compareFn);
+  if (index < 0) {
+    goog.array.insertAt(array, value, -(index + 1));
+    return true;
+  }
+  return false;
+};
+
+
+/**
+ * Removes a value from a sorted array.
+ * @param {!IArrayLike<VALUE>} array The array to modify.
+ * @param {VALUE} value The object to remove.
+ * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison
+ *     function by which the array is ordered. Should take 2 arguments to
+ *     compare, and return a negative number, zero, or a positive number
+ *     depending on whether the first argument is less than, equal to, or
+ *     greater than the second.
+ * @return {boolean} True if an element was removed.
+ * @template VALUE
+ */
+goog.array.binaryRemove = function(array, value, opt_compareFn) {
+  var index = goog.array.binarySearch(array, value, opt_compareFn);
+  return (index >= 0) ? goog.array.removeAt(array, index) : false;
+};
+
+
+/**
+ * Splits an array into disjoint buckets according to a splitting function.
+ * @param {Array<T>} array The array.
+ * @param {function(this:S, T, number, !Array<T>):?} sorter Function to call for
+ *     every element.  This takes 3 arguments (the element, the index and the
+ *     array) and must return a valid object key (a string, number, etc), or
+ *     undefined, if that object should not be placed in a bucket.
+ * @param {S=} opt_obj The object to be used as the value of 'this' within
+ *     sorter.
+ * @return {!Object<!Array<T>>} An object, with keys being all of the unique
+ *     return values of sorter, and values being arrays containing the items for
+ *     which the splitter returned that key.
+ * @template T,S
+ */
+goog.array.bucket = function(array, sorter, opt_obj) {
+  var buckets = {};
+
+  for (var i = 0; i < array.length; i++) {
+    var value = array[i];
+    var key = sorter.call(/** @type {?} */ (opt_obj), value, i, array);
+    if (goog.isDef(key)) {
+      // Push the value to the right bucket, creating it if necessary.
+      var bucket = buckets[key] || (buckets[key] = []);
+      bucket.push(value);
+    }
+  }
+
+  return buckets;
+};
+
+
+/**
+ * Creates a new object built from the provided array and the key-generation
+ * function.
+ * @param {IArrayLike<T>} arr Array or array like object over
+ *     which to iterate whose elements will be the values in the new object.
+ * @param {?function(this:S, T, number, ?) : string} keyFunc The function to
+ *     call for every element. This function takes 3 arguments (the element, the
+ *     index and the array) and should return a string that will be used as the
+ *     key for the element in the new object. If the function returns the same
+ *     key for more than one element, the value for that key is
+ *     implementation-defined.
+ * @param {S=} opt_obj The object to be used as the value of 'this'
+ *     within keyFunc.
+ * @return {!Object<T>} The new object.
+ * @template T,S
+ */
+goog.array.toObject = function(arr, keyFunc, opt_obj) {
+  var ret = {};
+  goog.array.forEach(arr, function(element, index) {
+    ret[keyFunc.call(/** @type {?} */ (opt_obj), element, index, arr)] =
+        element;
+  });
+  return ret;
+};
+
+
+/**
+ * Creates a range of numbers in an arithmetic progression.
+ *
+ * Range takes 1, 2, or 3 arguments:
+ * <pre>
+ * range(5) is the same as range(0, 5, 1) and produces [0, 1, 2, 3, 4]
+ * range(2, 5) is the same as range(2, 5, 1) and produces [2, 3, 4]
+ * range(-2, -5, -1) produces [-2, -3, -4]
+ * range(-2, -5, 1) produces [], since stepping by 1 wouldn't ever reach -5.
+ * </pre>
+ *
+ * @param {number} startOrEnd The starting value of the range if an end argument
+ *     is provided. Otherwise, the start value is 0, and this is the end value.
+ * @param {number=} opt_end The optional end value of the range.
+ * @param {number=} opt_step The step size between range values. Defaults to 1
+ *     if opt_step is undefined or 0.
+ * @return {!Array<number>} An array of numbers for the requested range. May be
+ *     an empty array if adding the step would not converge toward the end
+ *     value.
+ */
+goog.array.range = function(startOrEnd, opt_end, opt_step) {
+  var array = [];
+  var start = 0;
+  var end = startOrEnd;
+  var step = opt_step || 1;
+  if (opt_end !== undefined) {
+    start = startOrEnd;
+    end = opt_end;
+  }
+
+  if (step * (end - start) < 0) {
+    // Sign mismatch: start + step will never reach the end value.
+    return [];
+  }
+
+  if (step > 0) {
+    for (var i = start; i < end; i += step) {
+      array.push(i);
+    }
+  } else {
+    for (var i = start; i > end; i += step) {
+      array.push(i);
+    }
+  }
+  return array;
+};
+
+
+/**
+ * Returns an array consisting of the given value repeated N times.
+ *
+ * @param {VALUE} value The value to repeat.
+ * @param {number} n The repeat count.
+ * @return {!Array<VALUE>} An array with the repeated value.
+ * @template VALUE
+ */
+goog.array.repeat = function(value, n) {
+  var array = [];
+  for (var i = 0; i < n; i++) {
+    array[i] = value;
+  }
+  return array;
+};
+
+
+/**
+ * Returns an array consisting of every argument with all arrays
+ * expanded in-place recursively.
+ *
+ * @param {...*} var_args The values to flatten.
+ * @return {!Array<?>} An array containing the flattened values.
+ */
+goog.array.flatten = function(var_args) {
+  var CHUNK_SIZE = 8192;
+
+  var result = [];
+  for (var i = 0; i < arguments.length; i++) {
+    var element = arguments[i];
+    if (goog.isArray(element)) {
+      for (var c = 0; c < element.length; c += CHUNK_SIZE) {
+        var chunk = goog.array.slice(element, c, c + CHUNK_SIZE);
+        var recurseResult = goog.array.flatten.apply(null, chunk);
+        for (var r = 0; r < recurseResult.length; r++) {
+          result.push(recurseResult[r]);
+        }
+      }
+    } else {
+      result.push(element);
+    }
+  }
+  return result;
+};
+
+
+/**
+ * Rotates an array in-place. After calling this method, the element at
+ * index i will be the element previously at index (i - n) %
+ * array.length, for all values of i between 0 and array.length - 1,
+ * inclusive.
+ *
+ * For example, suppose list comprises [t, a, n, k, s]. After invoking
+ * rotate(array, 1) (or rotate(array, -4)), array will comprise [s, t, a, n, k].
+ *
+ * @param {!Array<T>} array The array to rotate.
+ * @param {number} n The amount to rotate.
+ * @return {!Array<T>} The array.
+ * @template T
+ */
+goog.array.rotate = function(array, n) {
+  goog.asserts.assert(array.length != null);
+
+  if (array.length) {
+    n %= array.length;
+    if (n > 0) {
+      Array.prototype.unshift.apply(array, array.splice(-n, n));
+    } else if (n < 0) {
+      Array.prototype.push.apply(array, array.splice(0, -n));
+    }
+  }
+  return array;
+};
+
+
+/**
+ * Moves one item of an array to a new position keeping the order of the rest
+ * of the items. Example use case: keeping a list of JavaScript objects
+ * synchronized with the corresponding list of DOM elements after one of the
+ * elements has been dragged to a new position.
+ * @param {!IArrayLike<?>} arr The array to modify.
+ * @param {number} fromIndex Index of the item to move between 0 and
+ *     {@code arr.length - 1}.
+ * @param {number} toIndex Target index between 0 and {@code arr.length - 1}.
+ */
+goog.array.moveItem = function(arr, fromIndex, toIndex) {
+  goog.asserts.assert(fromIndex >= 0 && fromIndex < arr.length);
+  goog.asserts.assert(toIndex >= 0 && toIndex < arr.length);
+  // Remove 1 item at fromIndex.
+  var removedItems = Array.prototype.splice.call(arr, fromIndex, 1);
+  // Insert the removed item at toIndex.
+  Array.prototype.splice.call(arr, toIndex, 0, removedItems[0]);
+  // We don't use goog.array.insertAt and goog.array.removeAt, because they're
+  // significantly slower than splice.
+};
+
+
+/**
+ * Creates a new array for which the element at position i is an array of the
+ * ith element of the provided arrays.  The returned array will only be as long
+ * as the shortest array provided; additional values are ignored.  For example,
+ * the result of zipping [1, 2] and [3, 4, 5] is [[1,3], [2, 4]].
+ *
+ * This is similar to the zip() function in Python.  See {@link
+ * http://docs.python.org/library/functions.html#zip}
+ *
+ * @param {...!IArrayLike<?>} var_args Arrays to be combined.
+ * @return {!Array<!Array<?>>} A new array of arrays created from
+ *     provided arrays.
+ */
+goog.array.zip = function(var_args) {
+  if (!arguments.length) {
+    return [];
+  }
+  var result = [];
+  var minLen = arguments[0].length;
+  for (var i = 1; i < arguments.length; i++) {
+    if (arguments[i].length < minLen) {
+      minLen = arguments[i].length;
+    }
+  }
+  for (var i = 0; i < minLen; i++) {
+    var value = [];
+    for (var j = 0; j < arguments.length; j++) {
+      value.push(arguments[j][i]);
+    }
+    result.push(value);
+  }
+  return result;
+};
+
+
+/**
+ * Shuffles the values in the specified array using the Fisher-Yates in-place
+ * shuffle (also known as the Knuth Shuffle). By default, calls Math.random()
+ * and so resets the state of that random number generator. Similarly, may reset
+ * the state of the any other specified random number generator.
+ *
+ * Runtime: O(n)
+ *
+ * @param {!Array<?>} arr The array to be shuffled.
+ * @param {function():number=} opt_randFn Optional random function to use for
+ *     shuffling.
+ *     Takes no arguments, and returns a random number on the interval [0, 1).
+ *     Defaults to Math.random() using JavaScript's built-in Math library.
+ */
+goog.array.shuffle = function(arr, opt_randFn) {
+  var randFn = opt_randFn || Math.random;
+
+  for (var i = arr.length - 1; i > 0; i--) {
+    // Choose a random array index in [0, i] (inclusive with i).
+    var j = Math.floor(randFn() * (i + 1));
+
+    var tmp = arr[i];
+    arr[i] = arr[j];
+    arr[j] = tmp;
+  }
+};
+
+
+/**
+ * Returns a new array of elements from arr, based on the indexes of elements
+ * provided by index_arr. For example, the result of index copying
+ * ['a', 'b', 'c'] with index_arr [1,0,0,2] is ['b', 'a', 'a', 'c'].
+ *
+ * @param {!Array<T>} arr The array to get a indexed copy from.
+ * @param {!Array<number>} index_arr An array of indexes to get from arr.
+ * @return {!Array<T>} A new array of elements from arr in index_arr order.
+ * @template T
+ */
+goog.array.copyByIndex = function(arr, index_arr) {
+  var result = [];
+  goog.array.forEach(index_arr, function(index) { result.push(arr[index]); });
+  return result;
+};
+
+
+/**
+ * Maps each element of the input array into zero or more elements of the output
+ * array.
+ *
+ * @param {!IArrayLike<VALUE>|string} arr Array or array like object
+ *     over which to iterate.
+ * @param {function(this:THIS, VALUE, number, ?): !Array<RESULT>} f The function
+ *     to call for every element. This function takes 3 arguments (the element,
+ *     the index and the array) and should return an array. The result will be
+ *     used to extend a new array.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within f.
+ * @return {!Array<RESULT>} a new array with the concatenation of all arrays
+ *     returned from f.
+ * @template THIS, VALUE, RESULT
+ */
+goog.array.concatMap = function(arr, f, opt_obj) {
+  return goog.array.concat.apply([], goog.array.map(arr, f, opt_obj));
+};
diff --git a/js/goog/asserts/asserts.js b/js/goog/asserts/asserts.js
new file mode 100644
index 0000000..1f4b653
--- /dev/null
+++ b/js/goog/asserts/asserts.js
@@ -0,0 +1,369 @@
+// Copyright 2008 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Utilities to check the preconditions, postconditions and
+ * invariants runtime.
+ *
+ * Methods in this package should be given special treatment by the compiler
+ * for type-inference. For example, <code>goog.asserts.assert(foo)</code>
+ * will restrict <code>foo</code> to a truthy value.
+ *
+ * The compiler has an option to disable asserts. So code like:
+ * <code>
+ * var x = goog.asserts.assert(foo()); goog.asserts.assert(bar());
+ * </code>
+ * will be transformed into:
+ * <code>
+ * var x = foo();
+ * </code>
+ * The compiler will leave in foo() (because its return value is used),
+ * but it will remove bar() because it assumes it does not have side-effects.
+ *
+ * @author agrieve@google.com (Andrew Grieve)
+ */
+
+goog.provide('goog.asserts');
+goog.provide('goog.asserts.AssertionError');
+
+goog.require('goog.debug.Error');
+goog.require('goog.dom.NodeType');
+goog.require('goog.string');
+
+
+/**
+ * @define {boolean} Whether to strip out asserts or to leave them in.
+ */
+goog.define('goog.asserts.ENABLE_ASSERTS', goog.DEBUG);
+
+
+
+/**
+ * Error object for failed assertions.
+ * @param {string} messagePattern The pattern that was used to form message.
+ * @param {!Array<*>} messageArgs The items to substitute into the pattern.
+ * @constructor
+ * @extends {goog.debug.Error}
+ * @final
+ */
+goog.asserts.AssertionError = function(messagePattern, messageArgs) {
+  messageArgs.unshift(messagePattern);
+  goog.debug.Error.call(this, goog.string.subs.apply(null, messageArgs));
+  // Remove the messagePattern afterwards to avoid permanently modifying the
+  // passed in array.
+  messageArgs.shift();
+
+  /**
+   * The message pattern used to format the error message. Error handlers can
+   * use this to uniquely identify the assertion.
+   * @type {string}
+   */
+  this.messagePattern = messagePattern;
+};
+goog.inherits(goog.asserts.AssertionError, goog.debug.Error);
+
+
+/** @override */
+goog.asserts.AssertionError.prototype.name = 'AssertionError';
+
+
+/**
+ * The default error handler.
+ * @param {!goog.asserts.AssertionError} e The exception to be handled.
+ */
+goog.asserts.DEFAULT_ERROR_HANDLER = function(e) {
+  throw e;
+};
+
+
+/**
+ * The handler responsible for throwing or logging assertion errors.
+ * @private {function(!goog.asserts.AssertionError)}
+ */
+goog.asserts.errorHandler_ = goog.asserts.DEFAULT_ERROR_HANDLER;
+
+
+/**
+ * Throws an exception with the given message and "Assertion failed" prefixed
+ * onto it.
+ * @param {string} defaultMessage The message to use if givenMessage is empty.
+ * @param {Array<*>} defaultArgs The substitution arguments for defaultMessage.
+ * @param {string|undefined} givenMessage Message supplied by the caller.
+ * @param {Array<*>} givenArgs The substitution arguments for givenMessage.
+ * @throws {goog.asserts.AssertionError} When the value is not a number.
+ * @private
+ */
+goog.asserts.doAssertFailure_ = function(
+    defaultMessage, defaultArgs, givenMessage, givenArgs) {
+  var message = 'Assertion failed';
+  if (givenMessage) {
+    message += ': ' + givenMessage;
+    var args = givenArgs;
+  } else if (defaultMessage) {
+    message += ': ' + defaultMessage;
+    args = defaultArgs;
+  }
+  // The '' + works around an Opera 10 bug in the unit tests. Without it,
+  // a stack trace is added to var message above. With this, a stack trace is
+  // not added until this line (it causes the extra garbage to be added after
+  // the assertion message instead of in the middle of it).
+  var e = new goog.asserts.AssertionError('' + message, args || []);
+  goog.asserts.errorHandler_(e);
+};
+
+
+/**
+ * Sets a custom error handler that can be used to customize the behavior of
+ * assertion failures, for example by turning all assertion failures into log
+ * messages.
+ * @param {function(!goog.asserts.AssertionError)} errorHandler
+ */
+goog.asserts.setErrorHandler = function(errorHandler) {
+  if (goog.asserts.ENABLE_ASSERTS) {
+    goog.asserts.errorHandler_ = errorHandler;
+  }
+};
+
+
+/**
+ * Checks if the condition evaluates to true if goog.asserts.ENABLE_ASSERTS is
+ * true.
+ * @template T
+ * @param {T} condition The condition to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {T} The value of the condition.
+ * @throws {goog.asserts.AssertionError} When the condition evaluates to false.
+ */
+goog.asserts.assert = function(condition, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !condition) {
+    goog.asserts.doAssertFailure_(
+        '', null, opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return condition;
+};
+
+
+/**
+ * Fails if goog.asserts.ENABLE_ASSERTS is true. This function is useful in case
+ * when we want to add a check in the unreachable area like switch-case
+ * statement:
+ *
+ * <pre>
+ *  switch(type) {
+ *    case FOO: doSomething(); break;
+ *    case BAR: doSomethingElse(); break;
+ *    default: goog.asserts.fail('Unrecognized type: ' + type);
+ *      // We have only 2 types - "default:" section is unreachable code.
+ *  }
+ * </pre>
+ *
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @throws {goog.asserts.AssertionError} Failure.
+ */
+goog.asserts.fail = function(opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS) {
+    goog.asserts.errorHandler_(
+        new goog.asserts.AssertionError(
+            'Failure' + (opt_message ? ': ' + opt_message : ''),
+            Array.prototype.slice.call(arguments, 1)));
+  }
+};
+
+
+/**
+ * Checks if the value is a number if goog.asserts.ENABLE_ASSERTS is true.
+ * @param {*} value The value to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {number} The value, guaranteed to be a number when asserts enabled.
+ * @throws {goog.asserts.AssertionError} When the value is not a number.
+ */
+goog.asserts.assertNumber = function(value, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !goog.isNumber(value)) {
+    goog.asserts.doAssertFailure_(
+        'Expected number but got %s: %s.', [goog.typeOf(value), value],
+        opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return /** @type {number} */ (value);
+};
+
+
+/**
+ * Checks if the value is a string if goog.asserts.ENABLE_ASSERTS is true.
+ * @param {*} value The value to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {string} The value, guaranteed to be a string when asserts enabled.
+ * @throws {goog.asserts.AssertionError} When the value is not a string.
+ */
+goog.asserts.assertString = function(value, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !goog.isString(value)) {
+    goog.asserts.doAssertFailure_(
+        'Expected string but got %s: %s.', [goog.typeOf(value), value],
+        opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return /** @type {string} */ (value);
+};
+
+
+/**
+ * Checks if the value is a function if goog.asserts.ENABLE_ASSERTS is true.
+ * @param {*} value The value to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {!Function} The value, guaranteed to be a function when asserts
+ *     enabled.
+ * @throws {goog.asserts.AssertionError} When the value is not a function.
+ */
+goog.asserts.assertFunction = function(value, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !goog.isFunction(value)) {
+    goog.asserts.doAssertFailure_(
+        'Expected function but got %s: %s.', [goog.typeOf(value), value],
+        opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return /** @type {!Function} */ (value);
+};
+
+
+/**
+ * Checks if the value is an Object if goog.asserts.ENABLE_ASSERTS is true.
+ * @param {*} value The value to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {!Object} The value, guaranteed to be a non-null object.
+ * @throws {goog.asserts.AssertionError} When the value is not an object.
+ */
+goog.asserts.assertObject = function(value, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !goog.isObject(value)) {
+    goog.asserts.doAssertFailure_(
+        'Expected object but got %s: %s.', [goog.typeOf(value), value],
+        opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return /** @type {!Object} */ (value);
+};
+
+
+/**
+ * Checks if the value is an Array if goog.asserts.ENABLE_ASSERTS is true.
+ * @param {*} value The value to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {!Array<?>} The value, guaranteed to be a non-null array.
+ * @throws {goog.asserts.AssertionError} When the value is not an array.
+ */
+goog.asserts.assertArray = function(value, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !goog.isArray(value)) {
+    goog.asserts.doAssertFailure_(
+        'Expected array but got %s: %s.', [goog.typeOf(value), value],
+        opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return /** @type {!Array<?>} */ (value);
+};
+
+
+/**
+ * Checks if the value is a boolean if goog.asserts.ENABLE_ASSERTS is true.
+ * @param {*} value The value to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {boolean} The value, guaranteed to be a boolean when asserts are
+ *     enabled.
+ * @throws {goog.asserts.AssertionError} When the value is not a boolean.
+ */
+goog.asserts.assertBoolean = function(value, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !goog.isBoolean(value)) {
+    goog.asserts.doAssertFailure_(
+        'Expected boolean but got %s: %s.', [goog.typeOf(value), value],
+        opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return /** @type {boolean} */ (value);
+};
+
+
+/**
+ * Checks if the value is a DOM Element if goog.asserts.ENABLE_ASSERTS is true.
+ * @param {*} value The value to check.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @return {!Element} The value, likely to be a DOM Element when asserts are
+ *     enabled.
+ * @throws {goog.asserts.AssertionError} When the value is not an Element.
+ */
+goog.asserts.assertElement = function(value, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS &&
+      (!goog.isObject(value) || value.nodeType != goog.dom.NodeType.ELEMENT)) {
+    goog.asserts.doAssertFailure_(
+        'Expected Element but got %s: %s.', [goog.typeOf(value), value],
+        opt_message, Array.prototype.slice.call(arguments, 2));
+  }
+  return /** @type {!Element} */ (value);
+};
+
+
+/**
+ * Checks if the value is an instance of the user-defined type if
+ * goog.asserts.ENABLE_ASSERTS is true.
+ *
+ * The compiler may tighten the type returned by this function.
+ *
+ * @param {?} value The value to check.
+ * @param {function(new: T, ...)} type A user-defined constructor.
+ * @param {string=} opt_message Error message in case of failure.
+ * @param {...*} var_args The items to substitute into the failure message.
+ * @throws {goog.asserts.AssertionError} When the value is not an instance of
+ *     type.
+ * @return {T}
+ * @template T
+ */
+goog.asserts.assertInstanceof = function(value, type, opt_message, var_args) {
+  if (goog.asserts.ENABLE_ASSERTS && !(value instanceof type)) {
+    goog.asserts.doAssertFailure_(
+        'Expected instanceof %s but got %s.',
+        [goog.asserts.getType_(type), goog.asserts.getType_(value)],
+        opt_message, Array.prototype.slice.call(arguments, 3));
+  }
+  return value;
+};
+
+
+/**
+ * Checks that no enumerable keys are present in Object.prototype. Such keys
+ * would break most code that use {@code for (var ... in ...)} loops.
+ */
+goog.asserts.assertObjectPrototypeIsIntact = function() {
+  for (var key in Object.prototype) {
+    goog.asserts.fail(key + ' should not be enumerable in Object.prototype.');
+  }
+};
+
+
+/**
+ * Returns the type of a value. If a constructor is passed, and a suitable
+ * string cannot be found, 'unknown type name' will be returned.
+ * @param {*} value A constructor, object, or primitive.
+ * @return {string} The best display name for the value, or 'unknown type name'.
+ * @private
+ */
+goog.asserts.getType_ = function(value) {
+  if (value instanceof Function) {
+    return value.displayName || value.name || 'unknown type name';
+  } else if (value instanceof Object) {
+    return value.constructor.displayName || value.constructor.name ||
+        Object.prototype.toString.call(value);
+  } else {
+    return value === null ? 'null' : typeof value;
+  }
+};
diff --git a/js/goog/async/nexttick.js b/js/goog/async/nexttick.js
new file mode 100644
index 0000000..67823a3
--- /dev/null
+++ b/js/goog/async/nexttick.js
@@ -0,0 +1,265 @@
+// Copyright 2013 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Provides a function to schedule running a function as soon
+ * as possible after the current JS execution stops and yields to the event
+ * loop.
+ *
+ */
+
+goog.provide('goog.async.nextTick');
+goog.provide('goog.async.throwException');
+
+goog.require('goog.debug.entryPointRegistry');
+goog.require('goog.dom.TagName');
+goog.require('goog.functions');
+goog.require('goog.labs.userAgent.browser');
+goog.require('goog.labs.userAgent.engine');
+
+
+/**
+ * Throw an item without interrupting the current execution context.  For
+ * example, if processing a group of items in a loop, sometimes it is useful
+ * to report an error while still allowing the rest of the batch to be
+ * processed.
+ * @param {*} exception
+ */
+goog.async.throwException = function(exception) {
+  // Each throw needs to be in its own context.
+  goog.global.setTimeout(function() { throw exception; }, 0);
+};
+
+
+/**
+ * Fires the provided callbacks as soon as possible after the current JS
+ * execution context. setTimeout(…, 0) takes at least 4ms when called from
+ * within another setTimeout(…, 0) for legacy reasons.
+ *
+ * This will not schedule the callback as a microtask (i.e. a task that can
+ * preempt user input or networking callbacks). It is meant to emulate what
+ * setTimeout(_, 0) would do if it were not throttled. If you desire microtask
+ * behavior, use {@see goog.Promise} instead.
+ *
+ * @param {function(this:SCOPE)} callback Callback function to fire as soon as
+ *     possible.
+ * @param {SCOPE=} opt_context Object in whose scope to call the listener.
+ * @param {boolean=} opt_useSetImmediate Avoid the IE workaround that
+ *     ensures correctness at the cost of speed. See comments for details.
+ * @template SCOPE
+ */
+goog.async.nextTick = function(callback, opt_context, opt_useSetImmediate) {
+  var cb = callback;
+  if (opt_context) {
+    cb = goog.bind(callback, opt_context);
+  }
+  cb = goog.async.nextTick.wrapCallback_(cb);
+  // Note we do allow callers to also request setImmediate if they are willing
+  // to accept the possible tradeoffs of incorrectness in exchange for speed.
+  // The IE fallback of readystate change is much slower. See useSetImmediate_
+  // for details.
+  if (goog.isFunction(goog.global.setImmediate) &&
+      (opt_useSetImmediate || goog.async.nextTick.useSetImmediate_())) {
+    goog.global.setImmediate(cb);
+    return;
+  }
+
+  // Look for and cache the custom fallback version of setImmediate.
+  if (!goog.async.nextTick.setImmediate_) {
+    goog.async.nextTick.setImmediate_ =
+        goog.async.nextTick.getSetImmediateEmulator_();
+  }
+  goog.async.nextTick.setImmediate_(cb);
+};
+
+
+/**
+ * Returns whether should use setImmediate implementation currently on window.
+ *
+ * window.setImmediate was introduced and currently only supported by IE10+,
+ * but due to a bug in the implementation it is not guaranteed that
+ * setImmediate is faster than setTimeout nor that setImmediate N is before
+ * setImmediate N+1. That is why we do not use the native version if
+ * available. We do, however, call setImmediate if it is a non-native function
+ * because that indicates that it has been replaced by goog.testing.MockClock
+ * which we do want to support.
+ * See
+ * http://connect.microsoft.com/IE/feedback/details/801823/setimmediate-and-messagechannel-are-broken-in-ie10
+ *
+ * @return {boolean} Whether to use the implementation of setImmediate defined
+ *     on Window.
+ * @private
+ */
+goog.async.nextTick.useSetImmediate_ = function() {
+  // Not a browser environment.
+  if (!goog.global.Window || !goog.global.Window.prototype) {
+    return true;
+  }
+
+  // MS Edge has window.setImmediate natively, but it's not on Window.prototype.
+  // Also, there's no clean way to detect if the goog.global.setImmediate has
+  // been replaced by mockClock as its replacement also shows up as "[native
+  // code]" when using toString. Therefore, just always use
+  // goog.global.setImmediate for Edge. It's unclear if it suffers the same
+  // issues as IE10/11, but based on
+  // https://dev.modern.ie/testdrive/demos/setimmediatesorting/
+  // it seems they've been working to ensure it's WAI.
+  if (goog.labs.userAgent.browser.isEdge() ||
+      goog.global.Window.prototype.setImmediate != goog.global.setImmediate) {
+    // Something redefined setImmediate in which case we decide to use it (This
+    // is so that we use the mockClock setImmediate).
+    return true;
+  }
+
+  return false;
+};
+
+
+/**
+ * Cache for the setImmediate implementation.
+ * @type {function(function())}
+ * @private
+ */
+goog.async.nextTick.setImmediate_;
+
+
+/**
+ * Determines the best possible implementation to run a function as soon as
+ * the JS event loop is idle.
+ * @return {function(function())} The "setImmediate" implementation.
+ * @private
+ */
+goog.async.nextTick.getSetImmediateEmulator_ = function() {
+  // Create a private message channel and use it to postMessage empty messages
+  // to ourselves.
+  /** @type {!Function|undefined} */
+  var Channel = goog.global['MessageChannel'];
+  // If MessageChannel is not available and we are in a browser, implement
+  // an iframe based polyfill in browsers that have postMessage and
+  // document.addEventListener. The latter excludes IE8 because it has a
+  // synchronous postMessage implementation.
+  if (typeof Channel === 'undefined' && typeof window !== 'undefined' &&
+      window.postMessage && window.addEventListener &&
+      // Presto (The old pre-blink Opera engine) has problems with iframes
+      // and contentWindow.
+      !goog.labs.userAgent.engine.isPresto()) {
+    /** @constructor */
+    Channel = function() {
+      // Make an empty, invisible iframe.
+      var iframe = /** @type {!HTMLIFrameElement} */ (
+          document.createElement(String(goog.dom.TagName.IFRAME)));
+      iframe.style.display = 'none';
+      iframe.src = '';
+      document.documentElement.appendChild(iframe);
+      var win = iframe.contentWindow;
+      var doc = win.document;
+      doc.open();
+      doc.write('');
+      doc.close();
+      // Do not post anything sensitive over this channel, as the workaround for
+      // pages with file: origin could allow that information to be modified or
+      // intercepted.
+      var message = 'callImmediate' + Math.random();
+      // The same origin policy rejects attempts to postMessage from file: urls
+      // unless the origin is '*'.
+      var origin = win.location.protocol == 'file:' ?
+          '*' :
+          win.location.protocol + '//' + win.location.host;
+      var onmessage = goog.bind(function(e) {
+        // Validate origin and message to make sure that this message was
+        // intended for us. If the origin is set to '*' (see above) only the
+        // message needs to match since, for example, '*' != 'file://'. Allowing
+        // the wildcard is ok, as we are not concerned with security here.
+        if ((origin != '*' && e.origin != origin) || e.data != message) {
+          return;
+        }
+        this['port1'].onmessage();
+      }, this);
+      win.addEventListener('message', onmessage, false);
+      this['port1'] = {};
+      this['port2'] = {
+        postMessage: function() { win.postMessage(message, origin); }
+      };
+    };
+  }
+  if (typeof Channel !== 'undefined' && !goog.labs.userAgent.browser.isIE()) {
+    // Exclude all of IE due to
+    // http://codeforhire.com/2013/09/21/setimmediate-and-messagechannel-broken-on-internet-explorer-10/
+    // which allows starving postMessage with a busy setTimeout loop.
+    // This currently affects IE10 and IE11 which would otherwise be able
+    // to use the postMessage based fallbacks.
+    var channel = new Channel();
+    // Use a fifo linked list to call callbacks in the right order.
+    var head = {};
+    var tail = head;
+    channel['port1'].onmessage = function() {
+      if (goog.isDef(head.next)) {
+        head = head.next;
+        var cb = head.cb;
+        head.cb = null;
+        cb();
+      }
+    };
+    return function(cb) {
+      tail.next = {cb: cb};
+      tail = tail.next;
+      channel['port2'].postMessage(0);
+    };
+  }
+  // Implementation for IE6 to IE10: Script elements fire an asynchronous
+  // onreadystatechange event when inserted into the DOM.
+  if (typeof document !== 'undefined' &&
+      'onreadystatechange' in
+          document.createElement(String(goog.dom.TagName.SCRIPT))) {
+    return function(cb) {
+      var script = document.createElement(String(goog.dom.TagName.SCRIPT));
+      script.onreadystatechange = function() {
+        // Clean up and call the callback.
+        script.onreadystatechange = null;
+        script.parentNode.removeChild(script);
+        script = null;
+        cb();
+        cb = null;
+      };
+      document.documentElement.appendChild(script);
+    };
+  }
+  // Fall back to setTimeout with 0. In browsers this creates a delay of 5ms
+  // or more.
+  // NOTE(user): This fallback is used for IE11.
+  return function(cb) {
+    goog.global.setTimeout(/** @type {function()} */ (cb), 0);
+  };
+};
+
+
+/**
+ * Helper function that is overrided to protect callbacks with entry point
+ * monitor if the application monitors entry points.
+ * @param {function()} callback Callback function to fire as soon as possible.
+ * @return {function()} The wrapped callback.
+ * @private
+ */
+goog.async.nextTick.wrapCallback_ = goog.functions.identity;
+
+
+// Register the callback function as an entry point, so that it can be
+// monitored for exception handling, etc. This has to be done in this file
+// since it requires special code to handle all browsers.
+goog.debug.entryPointRegistry.register(
+    /**
+     * @param {function(!Function): !Function} transformer The transforming
+     *     function.
+     */
+    function(transformer) { goog.async.nextTick.wrapCallback_ = transformer; });
diff --git a/js/goog/base.js b/js/goog/base.js
new file mode 100644
index 0000000..46b2f09
--- /dev/null
+++ b/js/goog/base.js
@@ -0,0 +1,2921 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Bootstrap for the Google JS Library (Closure).
+ *
+ * In uncompiled mode base.js will attempt to load Closure's deps file, unless
+ * the global <code>CLOSURE_NO_DEPS</code> is set to true.  This allows projects
+ * to include their own deps file(s) from different locations.
+ *
+ * Avoid including base.js more than once. This is strictly discouraged and not
+ * supported. goog.require(...) won't work properly in that case.
+ *
+ * @provideGoog
+ */
+
+
+/**
+ * @define {boolean} Overridden to true by the compiler.
+ */
+var COMPILED = false;
+
+
+/**
+ * Base namespace for the Closure library.  Checks to see goog is already
+ * defined in the current scope before assigning to prevent clobbering if
+ * base.js is loaded more than once.
+ *
+ * @const
+ */
+var goog = goog || {};
+
+
+/**
+ * Reference to the global context.  In most cases this will be 'window'.
+ */
+goog.global = this;
+
+
+/**
+ * A hook for overriding the define values in uncompiled mode.
+ *
+ * In uncompiled mode, {@code CLOSURE_UNCOMPILED_DEFINES} may be defined before
+ * loading base.js.  If a key is defined in {@code CLOSURE_UNCOMPILED_DEFINES},
+ * {@code goog.define} will use the value instead of the default value.  This
+ * allows flags to be overwritten without compilation (this is normally
+ * accomplished with the compiler's "define" flag).
+ *
+ * Example:
+ * <pre>
+ *   var CLOSURE_UNCOMPILED_DEFINES = {'goog.DEBUG': false};
+ * </pre>
+ *
+ * @type {Object<string, (string|number|boolean)>|undefined}
+ */
+goog.global.CLOSURE_UNCOMPILED_DEFINES;
+
+
+/**
+ * A hook for overriding the define values in uncompiled or compiled mode,
+ * like CLOSURE_UNCOMPILED_DEFINES but effective in compiled code.  In
+ * uncompiled code CLOSURE_UNCOMPILED_DEFINES takes precedence.
+ *
+ * Also unlike CLOSURE_UNCOMPILED_DEFINES the values must be number, boolean or
+ * string literals or the compiler will emit an error.
+ *
+ * While any @define value may be set, only those set with goog.define will be
+ * effective for uncompiled code.
+ *
+ * Example:
+ * <pre>
+ *   var CLOSURE_DEFINES = {'goog.DEBUG': false} ;
+ * </pre>
+ *
+ * @type {Object<string, (string|number|boolean)>|undefined}
+ */
+goog.global.CLOSURE_DEFINES;
+
+
+/**
+ * Returns true if the specified value is not undefined.
+ *
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is defined.
+ */
+goog.isDef = function(val) {
+  // void 0 always evaluates to undefined and hence we do not need to depend on
+  // the definition of the global variable named 'undefined'.
+  return val !== void 0;
+};
+
+/**
+ * Returns true if the specified value is a string.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is a string.
+ */
+goog.isString = function(val) {
+  return typeof val == 'string';
+};
+
+
+/**
+ * Returns true if the specified value is a boolean.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is boolean.
+ */
+goog.isBoolean = function(val) {
+  return typeof val == 'boolean';
+};
+
+
+/**
+ * Returns true if the specified value is a number.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is a number.
+ */
+goog.isNumber = function(val) {
+  return typeof val == 'number';
+};
+
+
+/**
+ * Builds an object structure for the provided namespace path, ensuring that
+ * names that already exist are not overwritten. For example:
+ * "a.b.c" -> a = {};a.b={};a.b.c={};
+ * Used by goog.provide and goog.exportSymbol.
+ * @param {string} name name of the object that this file defines.
+ * @param {*=} opt_object the object to expose at the end of the path.
+ * @param {Object=} opt_objectToExportTo The object to add the path to; default
+ *     is `goog.global`.
+ * @private
+ */
+goog.exportPath_ = function(name, opt_object, opt_objectToExportTo) {
+  var parts = name.split('.');
+  var cur = opt_objectToExportTo || goog.global;
+
+  // Internet Explorer exhibits strange behavior when throwing errors from
+  // methods externed in this manner.  See the testExportSymbolExceptions in
+  // base_test.html for an example.
+  if (!(parts[0] in cur) && cur.execScript) {
+    cur.execScript('var ' + parts[0]);
+  }
+
+  for (var part; parts.length && (part = parts.shift());) {
+    if (!parts.length && goog.isDef(opt_object)) {
+      // last part and we have an object; use it
+      cur[part] = opt_object;
+    } else if (cur[part] && cur[part] !== Object.prototype[part]) {
+      cur = cur[part];
+    } else {
+      cur = cur[part] = {};
+    }
+  }
+};
+
+
+/**
+ * Defines a named value. In uncompiled mode, the value is retrieved from
+ * CLOSURE_DEFINES or CLOSURE_UNCOMPILED_DEFINES if the object is defined and
+ * has the property specified, and otherwise used the defined defaultValue.
+ * When compiled the default can be overridden using the compiler
+ * options or the value set in the CLOSURE_DEFINES object.
+ *
+ * @param {string} name The distinguished name to provide.
+ * @param {string|number|boolean} defaultValue
+ */
+goog.define = function(name, defaultValue) {
+  var value = defaultValue;
+  if (!COMPILED) {
+    if (goog.global.CLOSURE_UNCOMPILED_DEFINES &&
+        // Anti DOM-clobbering runtime check (b/37736576).
+        /** @type {?} */ (goog.global.CLOSURE_UNCOMPILED_DEFINES).nodeType ===
+            undefined &&
+        Object.prototype.hasOwnProperty.call(
+            goog.global.CLOSURE_UNCOMPILED_DEFINES, name)) {
+      value = goog.global.CLOSURE_UNCOMPILED_DEFINES[name];
+    } else if (
+        goog.global.CLOSURE_DEFINES &&
+        // Anti DOM-clobbering runtime check (b/37736576).
+        /** @type {?} */ (goog.global.CLOSURE_DEFINES).nodeType === undefined &&
+        Object.prototype.hasOwnProperty.call(
+            goog.global.CLOSURE_DEFINES, name)) {
+      value = goog.global.CLOSURE_DEFINES[name];
+    }
+  }
+  goog.exportPath_(name, value);
+};
+
+
+/**
+ * @define {boolean} DEBUG is provided as a convenience so that debugging code
+ * that should not be included in a production. It can be easily stripped
+ * by specifying --define goog.DEBUG=false to the Closure Compiler aka
+ * JSCompiler. For example, most toString() methods should be declared inside an
+ * "if (goog.DEBUG)" conditional because they are generally used for debugging
+ * purposes and it is difficult for the JSCompiler to statically determine
+ * whether they are used.
+ */
+goog.define('goog.DEBUG', true);
+
+
+/**
+ * @define {string} LOCALE defines the locale being used for compilation. It is
+ * used to select locale specific data to be compiled in js binary. BUILD rule
+ * can specify this value by "--define goog.LOCALE=<locale_name>" as a compiler
+ * option.
+ *
+ * Take into account that the locale code format is important. You should use
+ * the canonical Unicode format with hyphen as a delimiter. Language must be
+ * lowercase, Language Script - Capitalized, Region - UPPERCASE.
+ * There are few examples: pt-BR, en, en-US, sr-Latin-BO, zh-Hans-CN.
+ *
+ * See more info about locale codes here:
+ * http://www.unicode.org/reports/tr35/#Unicode_Language_and_Locale_Identifiers
+ *
+ * For language codes you should use values defined by ISO 693-1. See it here
+ * http://www.w3.org/WAI/ER/IG/ert/iso639.htm. There is only one exception from
+ * this rule: the Hebrew language. For legacy reasons the old code (iw) should
+ * be used instead of the new code (he).
+ *
+ */
+goog.define('goog.LOCALE', 'en');  // default to en
+
+
+/**
+ * @define {boolean} Whether this code is running on trusted sites.
+ *
+ * On untrusted sites, several native functions can be defined or overridden by
+ * external libraries like Prototype, Datejs, and JQuery and setting this flag
+ * to false forces closure to use its own implementations when possible.
+ *
+ * If your JavaScript can be loaded by a third party site and you are wary about
+ * relying on non-standard implementations, specify
+ * "--define goog.TRUSTED_SITE=false" to the compiler.
+ */
+goog.define('goog.TRUSTED_SITE', true);
+
+
+/**
+ * @define {boolean} Whether a project is expected to be running in strict mode.
+ *
+ * This define can be used to trigger alternate implementations compatible with
+ * running in EcmaScript Strict mode or warn about unavailable functionality.
+ * @see https://goo.gl/PudQ4y
+ *
+ */
+goog.define('goog.STRICT_MODE_COMPATIBLE', false);
+
+
+/**
+ * @define {boolean} Whether code that calls {@link goog.setTestOnly} should
+ *     be disallowed in the compilation unit.
+ */
+goog.define('goog.DISALLOW_TEST_ONLY_CODE', COMPILED && !goog.DEBUG);
+
+
+/**
+ * @define {boolean} Whether to use a Chrome app CSP-compliant method for
+ *     loading scripts via goog.require. @see appendScriptSrcNode_.
+ */
+goog.define('goog.ENABLE_CHROME_APP_SAFE_SCRIPT_LOADING', false);
+
+
+/**
+ * Defines a namespace in Closure.
+ *
+ * A namespace may only be defined once in a codebase. It may be defined using
+ * goog.provide() or goog.module().
+ *
+ * The presence of one or more goog.provide() calls in a file indicates
+ * that the file defines the given objects/namespaces.
+ * Provided symbols must not be null or undefined.
+ *
+ * In addition, goog.provide() creates the object stubs for a namespace
+ * (for example, goog.provide("goog.foo.bar") will create the object
+ * goog.foo.bar if it does not already exist).
+ *
+ * Build tools also scan for provide/require/module statements
+ * to discern dependencies, build dependency files (see deps.js), etc.
+ *
+ * @see goog.require
+ * @see goog.module
+ * @param {string} name Namespace provided by this file in the form
+ *     "goog.package.part".
+ */
+goog.provide = function(name) {
+  if (goog.isInModuleLoader_()) {
+    throw Error('goog.provide can not be used within a goog.module.');
+  }
+  if (!COMPILED) {
+    // Ensure that the same namespace isn't provided twice.
+    // A goog.module/goog.provide maps a goog.require to a specific file
+    if (goog.isProvided_(name)) {
+      throw Error('Namespace "' + name + '" already declared.');
+    }
+  }
+
+  goog.constructNamespace_(name);
+};
+
+
+/**
+ * @param {string} name Namespace provided by this file in the form
+ *     "goog.package.part".
+ * @param {Object=} opt_obj The object to embed in the namespace.
+ * @private
+ */
+goog.constructNamespace_ = function(name, opt_obj) {
+  if (!COMPILED) {
+    delete goog.implicitNamespaces_[name];
+
+    var namespace = name;
+    while ((namespace = namespace.substring(0, namespace.lastIndexOf('.')))) {
+      if (goog.getObjectByName(namespace)) {
+        break;
+      }
+      goog.implicitNamespaces_[namespace] = true;
+    }
+  }
+
+  goog.exportPath_(name, opt_obj);
+};
+
+
+/**
+ * Module identifier validation regexp.
+ * Note: This is a conservative check, it is very possible to be more lenient,
+ *   the primary exclusion here is "/" and "\" and a leading ".", these
+ *   restrictions are intended to leave the door open for using goog.require
+ *   with relative file paths rather than module identifiers.
+ * @private
+ */
+goog.VALID_MODULE_RE_ = /^[a-zA-Z_$][a-zA-Z0-9._$]*$/;
+
+
+/**
+ * Defines a module in Closure.
+ *
+ * Marks that this file must be loaded as a module and claims the namespace.
+ *
+ * A namespace may only be defined once in a codebase. It may be defined using
+ * goog.provide() or goog.module().
+ *
+ * goog.module() has three requirements:
+ * - goog.module may not be used in the same file as goog.provide.
+ * - goog.module must be the first statement in the file.
+ * - only one goog.module is allowed per file.
+ *
+ * When a goog.module annotated file is loaded, it is enclosed in
+ * a strict function closure. This means that:
+ * - any variables declared in a goog.module file are private to the file
+ * (not global), though the compiler is expected to inline the module.
+ * - The code must obey all the rules of "strict" JavaScript.
+ * - the file will be marked as "use strict"
+ *
+ * NOTE: unlike goog.provide, goog.module does not declare any symbols by
+ * itself. If declared symbols are desired, use
+ * goog.module.declareLegacyNamespace().
+ *
+ *
+ * See the public goog.module proposal: http://goo.gl/Va1hin
+ *
+ * @param {string} name Namespace provided by this file in the form
+ *     "goog.package.part", is expected but not required.
+ * @return {void}
+ */
+goog.module = function(name) {
+  if (!goog.isString(name) || !name ||
+      name.search(goog.VALID_MODULE_RE_) == -1) {
+    throw Error('Invalid module identifier');
+  }
+  if (!goog.isInModuleLoader_()) {
+    throw Error(
+        'Module ' + name + ' has been loaded incorrectly. Note, ' +
+        'modules cannot be loaded as normal scripts. They require some kind of ' +
+        'pre-processing step. You\'re likely trying to load a module via a ' +
+        'script tag or as a part of a concatenated bundle without rewriting the ' +
+        'module. For more info see: ' +
+        'https://github.com/google/closure-library/wiki/goog.module:-an-ES6-module-like-alternative-to-goog.provide.');
+  }
+  if (goog.moduleLoaderState_.moduleName) {
+    throw Error('goog.module may only be called once per module.');
+  }
+
+  // Store the module name for the loader.
+  goog.moduleLoaderState_.moduleName = name;
+  if (!COMPILED) {
+    // Ensure that the same namespace isn't provided twice.
+    // A goog.module/goog.provide maps a goog.require to a specific file
+    if (goog.isProvided_(name)) {
+      throw Error('Namespace "' + name + '" already declared.');
+    }
+    delete goog.implicitNamespaces_[name];
+  }
+};
+
+
+/**
+ * @param {string} name The module identifier.
+ * @return {?} The module exports for an already loaded module or null.
+ *
+ * Note: This is not an alternative to goog.require, it does not
+ * indicate a hard dependency, instead it is used to indicate
+ * an optional dependency or to access the exports of a module
+ * that has already been loaded.
+ * @suppress {missingProvide}
+ */
+goog.module.get = function(name) {
+  return goog.module.getInternal_(name);
+};
+
+
+/**
+ * @param {string} name The module identifier.
+ * @return {?} The module exports for an already loaded module or null.
+ * @private
+ */
+goog.module.getInternal_ = function(name) {
+  if (!COMPILED) {
+    if (name in goog.loadedModules_) {
+      return goog.loadedModules_[name];
+    } else if (!goog.implicitNamespaces_[name]) {
+      var ns = goog.getObjectByName(name);
+      return ns != null ? ns : null;
+    }
+  }
+  return null;
+};
+
+
+/**
+ * @private {?{moduleName: (string|undefined), declareLegacyNamespace:boolean}}
+ */
+goog.moduleLoaderState_ = null;
+
+
+/**
+ * @private
+ * @return {boolean} Whether a goog.module is currently being initialized.
+ */
+goog.isInModuleLoader_ = function() {
+  return goog.moduleLoaderState_ != null;
+};
+
+
+/**
+ * Provide the module's exports as a globally accessible object under the
+ * module's declared name.  This is intended to ease migration to goog.module
+ * for files that have existing usages.
+ * @suppress {missingProvide}
+ */
+goog.module.declareLegacyNamespace = function() {
+  if (!COMPILED && !goog.isInModuleLoader_()) {
+    throw new Error(
+        'goog.module.declareLegacyNamespace must be called from ' +
+        'within a goog.module');
+  }
+  if (!COMPILED && !goog.moduleLoaderState_.moduleName) {
+    throw Error(
+        'goog.module must be called prior to ' +
+        'goog.module.declareLegacyNamespace.');
+  }
+  goog.moduleLoaderState_.declareLegacyNamespace = true;
+};
+
+
+/**
+ * Marks that the current file should only be used for testing, and never for
+ * live code in production.
+ *
+ * In the case of unit tests, the message may optionally be an exact namespace
+ * for the test (e.g. 'goog.stringTest'). The linter will then ignore the extra
+ * provide (if not explicitly defined in the code).
+ *
+ * @param {string=} opt_message Optional message to add to the error that's
+ *     raised when used in production code.
+ */
+goog.setTestOnly = function(opt_message) {
+  if (goog.DISALLOW_TEST_ONLY_CODE) {
+    opt_message = opt_message || '';
+    throw Error(
+        'Importing test-only code into non-debug environment' +
+        (opt_message ? ': ' + opt_message : '.'));
+  }
+};
+
+
+/**
+ * Forward declares a symbol. This is an indication to the compiler that the
+ * symbol may be used in the source yet is not required and may not be provided
+ * in compilation.
+ *
+ * The most common usage of forward declaration is code that takes a type as a
+ * function parameter but does not need to require it. By forward declaring
+ * instead of requiring, no hard dependency is made, and (if not required
+ * elsewhere) the namespace may never be required and thus, not be pulled
+ * into the JavaScript binary. If it is required elsewhere, it will be type
+ * checked as normal.
+ *
+ * Before using goog.forwardDeclare, please read the documentation at
+ * https://github.com/google/closure-compiler/wiki/Bad-Type-Annotation to
+ * understand the options and tradeoffs when working with forward declarations.
+ *
+ * @param {string} name The namespace to forward declare in the form of
+ *     "goog.package.part".
+ */
+goog.forwardDeclare = function(name) {};
+
+
+/**
+ * Forward declare type information. Used to assign types to goog.global
+ * referenced object that would otherwise result in unknown type references
+ * and thus block property disambiguation.
+ */
+goog.forwardDeclare('Document');
+goog.forwardDeclare('HTMLScriptElement');
+goog.forwardDeclare('XMLHttpRequest');
+
+
+if (!COMPILED) {
+  /**
+   * Check if the given name has been goog.provided. This will return false for
+   * names that are available only as implicit namespaces.
+   * @param {string} name name of the object to look for.
+   * @return {boolean} Whether the name has been provided.
+   * @private
+   */
+  goog.isProvided_ = function(name) {
+    return (name in goog.loadedModules_) ||
+        (!goog.implicitNamespaces_[name] &&
+         goog.isDefAndNotNull(goog.getObjectByName(name)));
+  };
+
+  /**
+   * Namespaces implicitly defined by goog.provide. For example,
+   * goog.provide('goog.events.Event') implicitly declares that 'goog' and
+   * 'goog.events' must be namespaces.
+   *
+   * @type {!Object<string, (boolean|undefined)>}
+   * @private
+   */
+  goog.implicitNamespaces_ = {'goog.module': true};
+
+  // NOTE: We add goog.module as an implicit namespace as goog.module is defined
+  // here and because the existing module package has not been moved yet out of
+  // the goog.module namespace. This satisifies both the debug loader and
+  // ahead-of-time dependency management.
+}
+
+
+/**
+ * Returns an object based on its fully qualified external name.  The object
+ * is not found if null or undefined.  If you are using a compilation pass that
+ * renames property names beware that using this function will not find renamed
+ * properties.
+ *
+ * @param {string} name The fully qualified name.
+ * @param {Object=} opt_obj The object within which to look; default is
+ *     |goog.global|.
+ * @return {?} The value (object or primitive) or, if not found, null.
+ */
+goog.getObjectByName = function(name, opt_obj) {
+  var parts = name.split('.');
+  var cur = opt_obj || goog.global;
+  for (var part; part = parts.shift();) {
+    if (goog.isDefAndNotNull(cur[part])) {
+      cur = cur[part];
+    } else {
+      return null;
+    }
+  }
+  return cur;
+};
+
+
+/**
+ * Globalizes a whole namespace, such as goog or goog.lang.
+ *
+ * @param {!Object} obj The namespace to globalize.
+ * @param {Object=} opt_global The object to add the properties to.
+ * @deprecated Properties may be explicitly exported to the global scope, but
+ *     this should no longer be done in bulk.
+ */
+goog.globalize = function(obj, opt_global) {
+  var global = opt_global || goog.global;
+  for (var x in obj) {
+    global[x] = obj[x];
+  }
+};
+
+
+/**
+ * Adds a dependency from a file to the files it requires.
+ * @param {string} relPath The path to the js file.
+ * @param {!Array<string>} provides An array of strings with
+ *     the names of the objects this file provides.
+ * @param {!Array<string>} requires An array of strings with
+ *     the names of the objects this file requires.
+ * @param {boolean|!Object<string>=} opt_loadFlags Parameters indicating
+ *     how the file must be loaded.  The boolean 'true' is equivalent
+ *     to {'module': 'goog'} for backwards-compatibility.  Valid properties
+ *     and values include {'module': 'goog'} and {'lang': 'es6'}.
+ */
+goog.addDependency = function(relPath, provides, requires, opt_loadFlags) {
+  if (goog.DEPENDENCIES_ENABLED) {
+    var provide, require;
+    var path = relPath.replace(/\\/g, '/');
+    var deps = goog.dependencies_;
+    if (!opt_loadFlags || typeof opt_loadFlags === 'boolean') {
+      opt_loadFlags = opt_loadFlags ? {'module': 'goog'} : {};
+    }
+    for (var i = 0; provide = provides[i]; i++) {
+      deps.nameToPath[provide] = path;
+      deps.loadFlags[path] = opt_loadFlags;
+    }
+    for (var j = 0; require = requires[j]; j++) {
+      if (!(path in deps.requires)) {
+        deps.requires[path] = {};
+      }
+      deps.requires[path][require] = true;
+    }
+  }
+};
+
+
+
+
+// NOTE(nnaze): The debug DOM loader was included in base.js as an original way
+// to do "debug-mode" development.  The dependency system can sometimes be
+// confusing, as can the debug DOM loader's asynchronous nature.
+//
+// With the DOM loader, a call to goog.require() is not blocking -- the script
+// will not load until some point after the current script.  If a namespace is
+// needed at runtime, it needs to be defined in a previous script, or loaded via
+// require() with its registered dependencies.
+//
+// User-defined namespaces may need their own deps file. For a reference on
+// creating a deps file, see:
+// Externally: https://developers.google.com/closure/library/docs/depswriter
+//
+// Because of legacy clients, the DOM loader can't be easily removed from
+// base.js.  Work was done to make it disableable or replaceable for
+// different environments (DOM-less JavaScript interpreters like Rhino or V8,
+// for example). See bootstrap/ for more information.
+
+
+/**
+ * @define {boolean} Whether to enable the debug loader.
+ *
+ * If enabled, a call to goog.require() will attempt to load the namespace by
+ * appending a script tag to the DOM (if the namespace has been registered).
+ *
+ * If disabled, goog.require() will simply assert that the namespace has been
+ * provided (and depend on the fact that some outside tool correctly ordered
+ * the script).
+ */
+goog.define('goog.ENABLE_DEBUG_LOADER', true);
+
+
+/**
+ * @param {string} msg
+ * @private
+ */
+goog.logToConsole_ = function(msg) {
+  if (goog.global.console) {
+    goog.global.console['error'](msg);
+  }
+};
+
+
+/**
+ * Implements a system for the dynamic resolution of dependencies that works in
+ * parallel with the BUILD system. Note that all calls to goog.require will be
+ * stripped by the compiler.
+ * @see goog.provide
+ * @param {string} name Namespace to include (as was given in goog.provide()) in
+ *     the form "goog.package.part".
+ * @return {?} If called within a goog.module file, the associated namespace or
+ *     module otherwise null.
+ */
+goog.require = function(name) {
+  // If the object already exists we do not need to do anything.
+  if (!COMPILED) {
+    if (goog.ENABLE_DEBUG_LOADER && goog.IS_OLD_IE_) {
+      goog.maybeProcessDeferredDep_(name);
+    }
+
+    if (goog.isProvided_(name)) {
+      if (goog.isInModuleLoader_()) {
+        return goog.module.getInternal_(name);
+      }
+    } else if (goog.ENABLE_DEBUG_LOADER) {
+      var path = goog.getPathFromDeps_(name);
+      if (path) {
+        goog.writeScripts_(path);
+      } else {
+        var errorMessage = 'goog.require could not find: ' + name;
+        goog.logToConsole_(errorMessage);
+
+        throw Error(errorMessage);
+      }
+    }
+
+    return null;
+  }
+};
+
+
+/**
+ * Path for included scripts.
+ * @type {string}
+ */
+goog.basePath = '';
+
+
+/**
+ * A hook for overriding the base path.
+ * @type {string|undefined}
+ */
+goog.global.CLOSURE_BASE_PATH;
+
+
+/**
+ * Whether to attempt to load Closure's deps file. By default, when uncompiled,
+ * deps files will attempt to be loaded.
+ * @type {boolean|undefined}
+ */
+goog.global.CLOSURE_NO_DEPS;
+
+
+/**
+ * A function to import a single script. This is meant to be overridden when
+ * Closure is being run in non-HTML contexts, such as web workers. It's defined
+ * in the global scope so that it can be set before base.js is loaded, which
+ * allows deps.js to be imported properly.
+ *
+ * The function is passed the script source, which is a relative URI. It should
+ * return true if the script was imported, false otherwise.
+ * @type {(function(string): boolean)|undefined}
+ */
+goog.global.CLOSURE_IMPORT_SCRIPT;
+
+
+/**
+ * Null function used for default values of callbacks, etc.
+ * @return {void} Nothing.
+ */
+goog.nullFunction = function() {};
+
+
+/**
+ * When defining a class Foo with an abstract method bar(), you can do:
+ * Foo.prototype.bar = goog.abstractMethod
+ *
+ * Now if a subclass of Foo fails to override bar(), an error will be thrown
+ * when bar() is invoked.
+ *
+ * @type {!Function}
+ * @throws {Error} when invoked to indicate the method should be overridden.
+ */
+goog.abstractMethod = function() {
+  throw Error('unimplemented abstract method');
+};
+
+
+/**
+ * Adds a {@code getInstance} static method that always returns the same
+ * instance object.
+ * @param {!Function} ctor The constructor for the class to add the static
+ *     method to.
+ */
+goog.addSingletonGetter = function(ctor) {
+  // instance_ is immediately set to prevent issues with sealed constructors
+  // such as are encountered when a constructor is returned as the export object
+  // of a goog.module in unoptimized code.
+  ctor.instance_ = undefined;
+  ctor.getInstance = function() {
+    if (ctor.instance_) {
+      return ctor.instance_;
+    }
+    if (goog.DEBUG) {
+      // NOTE: JSCompiler can't optimize away Array#push.
+      goog.instantiatedSingletons_[goog.instantiatedSingletons_.length] = ctor;
+    }
+    return ctor.instance_ = new ctor;
+  };
+};
+
+
+/**
+ * All singleton classes that have been instantiated, for testing. Don't read
+ * it directly, use the {@code goog.testing.singleton} module. The compiler
+ * removes this variable if unused.
+ * @type {!Array<!Function>}
+ * @private
+ */
+goog.instantiatedSingletons_ = [];
+
+
+/**
+ * @define {boolean} Whether to load goog.modules using {@code eval} when using
+ * the debug loader.  This provides a better debugging experience as the
+ * source is unmodified and can be edited using Chrome Workspaces or similar.
+ * However in some environments the use of {@code eval} is banned
+ * so we provide an alternative.
+ */
+goog.define('goog.LOAD_MODULE_USING_EVAL', true);
+
+
+/**
+ * @define {boolean} Whether the exports of goog.modules should be sealed when
+ * possible.
+ */
+goog.define('goog.SEAL_MODULE_EXPORTS', goog.DEBUG);
+
+
+/**
+ * The registry of initialized modules:
+ * the module identifier to module exports map.
+ * @private @const {!Object<string, ?>}
+ */
+goog.loadedModules_ = {};
+
+
+/**
+ * True if goog.dependencies_ is available.
+ * @const {boolean}
+ */
+goog.DEPENDENCIES_ENABLED = !COMPILED && goog.ENABLE_DEBUG_LOADER;
+
+
+/**
+ * @define {string} How to decide whether to transpile.  Valid values
+ * are 'always', 'never', and 'detect'.  The default ('detect') is to
+ * use feature detection to determine which language levels need
+ * transpilation.
+ */
+// NOTE(user): we could expand this to accept a language level to bypass
+// detection: e.g. goog.TRANSPILE == 'es5' would transpile ES6 files but
+// would leave ES3 and ES5 files alone.
+goog.define('goog.TRANSPILE', 'detect');
+
+
+/**
+ * @define {string} Path to the transpiler.  Executing the script at this
+ * path (relative to base.js) should define a function $jscomp.transpile.
+ */
+goog.define('goog.TRANSPILER', 'transpile.js');
+
+
+if (goog.DEPENDENCIES_ENABLED) {
+  /**
+   * This object is used to keep track of dependencies and other data that is
+   * used for loading scripts.
+   * @private
+   * @type {{
+   *   loadFlags: !Object<string, !Object<string, string>>,
+   *   nameToPath: !Object<string, string>,
+   *   requires: !Object<string, !Object<string, boolean>>,
+   *   visited: !Object<string, boolean>,
+   *   written: !Object<string, boolean>,
+   *   deferred: !Object<string, string>
+   * }}
+   */
+  goog.dependencies_ = {
+    loadFlags: {},  // 1 to 1
+
+    nameToPath: {},  // 1 to 1
+
+    requires: {},  // 1 to many
+
+    // Used when resolving dependencies to prevent us from visiting file twice.
+    visited: {},
+
+    written: {},  // Used to keep track of script files we have written.
+
+    deferred: {}  // Used to track deferred module evaluations in old IEs
+  };
+
+
+  /**
+   * Tries to detect whether is in the context of an HTML document.
+   * @return {boolean} True if it looks like HTML document.
+   * @private
+   */
+  goog.inHtmlDocument_ = function() {
+    /** @type {Document} */
+    var doc = goog.global.document;
+    return doc != null && 'write' in doc;  // XULDocument misses write.
+  };
+
+
+  /**
+   * Tries to detect the base path of base.js script that bootstraps Closure.
+   * @private
+   */
+  goog.findBasePath_ = function() {
+    if (goog.isDef(goog.global.CLOSURE_BASE_PATH) &&
+        // Anti DOM-clobbering runtime check (b/37736576).
+        goog.isString(goog.global.CLOSURE_BASE_PATH)) {
+      goog.basePath = goog.global.CLOSURE_BASE_PATH;
+      return;
+    } else if (!goog.inHtmlDocument_()) {
+      return;
+    }
+    /** @type {Document} */
+    var doc = goog.global.document;
+    // If we have a currentScript available, use it exclusively.
+    var currentScript = doc.currentScript;
+    if (currentScript) {
+      var scripts = [currentScript];
+    } else {
+      var scripts = doc.getElementsByTagName('SCRIPT');
+    }
+    // Search backwards since the current script is in almost all cases the one
+    // that has base.js.
+    for (var i = scripts.length - 1; i >= 0; --i) {
+      var script = /** @type {!HTMLScriptElement} */ (scripts[i]);
+      var src = script.src;
+      var qmark = src.lastIndexOf('?');
+      var l = qmark == -1 ? src.length : qmark;
+      if (src.substr(l - 7, 7) == 'base.js') {
+        goog.basePath = src.substr(0, l - 7);
+        return;
+      }
+    }
+  };
+
+
+  /**
+   * Imports a script if, and only if, that script hasn't already been imported.
+   * (Must be called at execution time)
+   * @param {string} src Script source.
+   * @param {string=} opt_sourceText The optionally source text to evaluate
+   * @private
+   */
+  goog.importScript_ = function(src, opt_sourceText) {
+    var importScript =
+        goog.global.CLOSURE_IMPORT_SCRIPT || goog.writeScriptTag_;
+    if (importScript(src, opt_sourceText)) {
+      goog.dependencies_.written[src] = true;
+    }
+  };
+
+
+  /**
+   * Whether the browser is IE9 or earlier, which needs special handling
+   * for deferred modules.
+   * @const @private {boolean}
+   */
+  goog.IS_OLD_IE_ =
+      !!(!goog.global.atob && goog.global.document && goog.global.document.all);
+
+
+  /**
+   * Whether IE9 or earlier is waiting on a dependency.  This ensures that
+   * deferred modules that have no non-deferred dependencies actually get
+   * loaded, since if we defer them and then never pull in a non-deferred
+   * script, then `goog.loadQueuedModules_` will never be called.  Instead,
+   * if not waiting on anything we simply don't defer in the first place.
+   * @private {boolean}
+   */
+  goog.oldIeWaiting_ = false;
+
+
+  /**
+   * Given a URL initiate retrieval and execution of a script that needs
+   * pre-processing.
+   * @param {string} src Script source URL.
+   * @param {boolean} isModule Whether this is a goog.module.
+   * @param {boolean} needsTranspile Whether this source needs transpilation.
+   * @private
+   */
+  goog.importProcessedScript_ = function(src, isModule, needsTranspile) {
+    // In an attempt to keep browsers from timing out loading scripts using
+    // synchronous XHRs, put each load in its own script block.
+    var bootstrap = 'goog.retrieveAndExec_("' + src + '", ' + isModule + ', ' +
+        needsTranspile + ');';
+
+    goog.importScript_('', bootstrap);
+  };
+
+
+  /** @private {!Array<string>} */
+  goog.queuedModules_ = [];
+
+
+  /**
+   * Return an appropriate module text. Suitable to insert into
+   * a script tag (that is unescaped).
+   * @param {string} srcUrl
+   * @param {string} scriptText
+   * @return {string}
+   * @private
+   */
+  goog.wrapModule_ = function(srcUrl, scriptText) {
+    if (!goog.LOAD_MODULE_USING_EVAL || !goog.isDef(goog.global.JSON)) {
+      return '' +
+          'goog.loadModule(function(exports) {' +
+          '"use strict";' + scriptText +
+          '\n' +  // terminate any trailing single line comment.
+          ';return exports' +
+          '});' +
+          '\n//# sourceURL=' + srcUrl + '\n';
+    } else {
+      return '' +
+          'goog.loadModule(' +
+          goog.global.JSON.stringify(
+              scriptText + '\n//# sourceURL=' + srcUrl + '\n') +
+          ');';
+    }
+  };
+
+  // On IE9 and earlier, it is necessary to handle
+  // deferred module loads. In later browsers, the
+  // code to be evaluated is simply inserted as a script
+  // block in the correct order. To eval deferred
+  // code at the right time, we piggy back on goog.require to call
+  // goog.maybeProcessDeferredDep_.
+  //
+  // The goog.requires are used both to bootstrap
+  // the loading process (when no deps are available) and
+  // declare that they should be available.
+  //
+  // Here we eval the sources, if all the deps are available
+  // either already eval'd or goog.require'd.  This will
+  // be the case when all the dependencies have already
+  // been loaded, and the dependent module is loaded.
+  //
+  // But this alone isn't sufficient because it is also
+  // necessary to handle the case where there is no root
+  // that is not deferred.  For that there we register for an event
+  // and trigger goog.loadQueuedModules_ handle any remaining deferred
+  // evaluations.
+
+  /**
+   * Handle any remaining deferred goog.module evals.
+   * @private
+   */
+  goog.loadQueuedModules_ = function() {
+    var count = goog.queuedModules_.length;
+    if (count > 0) {
+      var queue = goog.queuedModules_;
+      goog.queuedModules_ = [];
+      for (var i = 0; i < count; i++) {
+        var path = queue[i];
+        goog.maybeProcessDeferredPath_(path);
+      }
+    }
+    goog.oldIeWaiting_ = false;
+  };
+
+
+  /**
+   * Eval the named module if its dependencies are
+   * available.
+   * @param {string} name The module to load.
+   * @private
+   */
+  goog.maybeProcessDeferredDep_ = function(name) {
+    if (goog.isDeferredModule_(name) && goog.allDepsAreAvailable_(name)) {
+      var path = goog.getPathFromDeps_(name);
+      goog.maybeProcessDeferredPath_(goog.basePath + path);
+    }
+  };
+
+  /**
+   * @param {string} name The module to check.
+   * @return {boolean} Whether the name represents a
+   *     module whose evaluation has been deferred.
+   * @private
+   */
+  goog.isDeferredModule_ = function(name) {
+    var path = goog.getPathFromDeps_(name);
+    var loadFlags = path && goog.dependencies_.loadFlags[path] || {};
+    var languageLevel = loadFlags['lang'] || 'es3';
+    if (path && (loadFlags['module'] == 'goog' ||
+                 goog.needsTranspile_(languageLevel))) {
+      var abspath = goog.basePath + path;
+      return (abspath) in goog.dependencies_.deferred;
+    }
+    return false;
+  };
+
+  /**
+   * @param {string} name The module to check.
+   * @return {boolean} Whether the name represents a
+   *     module whose declared dependencies have all been loaded
+   *     (eval'd or a deferred module load)
+   * @private
+   */
+  goog.allDepsAreAvailable_ = function(name) {
+    var path = goog.getPathFromDeps_(name);
+    if (path && (path in goog.dependencies_.requires)) {
+      for (var requireName in goog.dependencies_.requires[path]) {
+        if (!goog.isProvided_(requireName) &&
+            !goog.isDeferredModule_(requireName)) {
+          return false;
+        }
+      }
+    }
+    return true;
+  };
+
+
+  /**
+   * @param {string} abspath
+   * @private
+   */
+  goog.maybeProcessDeferredPath_ = function(abspath) {
+    if (abspath in goog.dependencies_.deferred) {
+      var src = goog.dependencies_.deferred[abspath];
+      delete goog.dependencies_.deferred[abspath];
+      goog.globalEval(src);
+    }
+  };
+
+
+  /**
+   * Load a goog.module from the provided URL.  This is not a general purpose
+   * code loader and does not support late loading code, that is it should only
+   * be used during page load. This method exists to support unit tests and
+   * "debug" loaders that would otherwise have inserted script tags. Under the
+   * hood this needs to use a synchronous XHR and is not recommeneded for
+   * production code.
+   *
+   * The module's goog.requires must have already been satisified; an exception
+   * will be thrown if this is not the case. This assumption is that no
+   * "deps.js" file exists, so there is no way to discover and locate the
+   * module-to-be-loaded's dependencies and no attempt is made to do so.
+   *
+   * There should only be one attempt to load a module.  If
+   * "goog.loadModuleFromUrl" is called for an already loaded module, an
+   * exception will be throw.
+   *
+   * @param {string} url The URL from which to attempt to load the goog.module.
+   */
+  goog.loadModuleFromUrl = function(url) {
+    // Because this executes synchronously, we don't need to do any additional
+    // bookkeeping. When "goog.loadModule" the namespace will be marked as
+    // having been provided which is sufficient.
+    goog.retrieveAndExec_(url, true, false);
+  };
+
+
+  /**
+   * Writes a new script pointing to {@code src} directly into the DOM.
+   *
+   * NOTE: This method is not CSP-compliant. @see goog.appendScriptSrcNode_ for
+   * the fallback mechanism.
+   *
+   * @param {string} src The script URL.
+   * @private
+   */
+  goog.writeScriptSrcNode_ = function(src) {
+    goog.global.document.write(
+        '<script type="text/javascript" src="' + src + '"></' +
+        'script>');
+  };
+
+
+  /**
+   * Appends a new script node to the DOM using a CSP-compliant mechanism. This
+   * method exists as a fallback for document.write (which is not allowed in a
+   * strict CSP context, e.g., Chrome apps).
+   *
+   * NOTE: This method is not analogous to using document.write to insert a
+   * <script> tag; specifically, the user agent will execute a script added by
+   * document.write immediately after the current script block finishes
+   * executing, whereas the DOM-appended script node will not be executed until
+   * the entire document is parsed and executed. That is to say, this script is
+   * added to the end of the script execution queue.
+   *
+   * The page must not attempt to call goog.required entities until after the
+   * document has loaded, e.g., in or after the window.onload callback.
+   *
+   * @param {string} src The script URL.
+   * @private
+   */
+  goog.appendScriptSrcNode_ = function(src) {
+    /** @type {Document} */
+    var doc = goog.global.document;
+    var scriptEl =
+        /** @type {HTMLScriptElement} */ (doc.createElement('script'));
+    scriptEl.type = 'text/javascript';
+    scriptEl.src = src;
+    scriptEl.defer = false;
+    scriptEl.async = false;
+    doc.head.appendChild(scriptEl);
+  };
+
+
+  /**
+   * The default implementation of the import function. Writes a script tag to
+   * import the script.
+   *
+   * @param {string} src The script url.
+   * @param {string=} opt_sourceText The optionally source text to evaluate
+   * @return {boolean} True if the script was imported, false otherwise.
+   * @private
+   */
+  goog.writeScriptTag_ = function(src, opt_sourceText) {
+    if (goog.inHtmlDocument_()) {
+      /** @type {!HTMLDocument} */
+      var doc = goog.global.document;
+
+      // If the user tries to require a new symbol after document load,
+      // something has gone terribly wrong. Doing a document.write would
+      // wipe out the page. This does not apply to the CSP-compliant method
+      // of writing script tags.
+      if (!goog.ENABLE_CHROME_APP_SAFE_SCRIPT_LOADING &&
+          doc.readyState == 'complete') {
+        // Certain test frameworks load base.js multiple times, which tries
+        // to write deps.js each time. If that happens, just fail silently.
+        // These frameworks wipe the page between each load of base.js, so this
+        // is OK.
+        var isDeps = /\bdeps.js$/.test(src);
+        if (isDeps) {
+          return false;
+        } else {
+          throw Error('Cannot write "' + src + '" after document load');
+        }
+      }
+
+      if (opt_sourceText === undefined) {
+        if (!goog.IS_OLD_IE_) {
+          if (goog.ENABLE_CHROME_APP_SAFE_SCRIPT_LOADING) {
+            goog.appendScriptSrcNode_(src);
+          } else {
+            goog.writeScriptSrcNode_(src);
+          }
+        } else {
+          goog.oldIeWaiting_ = true;
+          var state = ' onreadystatechange=\'goog.onScriptLoad_(this, ' +
+              ++goog.lastNonModuleScriptIndex_ + ')\' ';
+          doc.write(
+              '<script type="text/javascript" src="' + src + '"' + state +
+              '></' +
+              'script>');
+        }
+      } else {
+        doc.write(
+            '<script type="text/javascript">' +
+            goog.protectScriptTag_(opt_sourceText) + '</' +
+            'script>');
+      }
+      return true;
+    } else {
+      return false;
+    }
+  };
+
+  /**
+   * Rewrites closing script tags in input to avoid ending an enclosing script
+   * tag.
+   *
+   * @param {string} str
+   * @return {string}
+   * @private
+   */
+  goog.protectScriptTag_ = function(str) {
+    return str.replace(/<\/(SCRIPT)/ig, '\\x3c/$1');
+  };
+
+  /**
+   * Determines whether the given language needs to be transpiled.
+   * @param {string} lang
+   * @return {boolean}
+   * @private
+   */
+  goog.needsTranspile_ = function(lang) {
+    if (goog.TRANSPILE == 'always') {
+      return true;
+    } else if (goog.TRANSPILE == 'never') {
+      return false;
+    } else if (!goog.requiresTranspilation_) {
+      goog.requiresTranspilation_ = goog.createRequiresTranspilation_();
+    }
+    if (lang in goog.requiresTranspilation_) {
+      return goog.requiresTranspilation_[lang];
+    } else {
+      throw new Error('Unknown language mode: ' + lang);
+    }
+  };
+
+  /** @private {?Object<string, boolean>} */
+  goog.requiresTranspilation_ = null;
+
+
+  /** @private {number} */
+  goog.lastNonModuleScriptIndex_ = 0;
+
+
+  /**
+   * A readystatechange handler for legacy IE
+   * @param {?} script
+   * @param {number} scriptIndex
+   * @return {boolean}
+   * @private
+   */
+  goog.onScriptLoad_ = function(script, scriptIndex) {
+    // for now load the modules when we reach the last script,
+    // later allow more inter-mingling.
+    if (script.readyState == 'complete' &&
+        goog.lastNonModuleScriptIndex_ == scriptIndex) {
+      goog.loadQueuedModules_();
+    }
+    return true;
+  };
+
+  /**
+   * Resolves dependencies based on the dependencies added using addDependency
+   * and calls importScript_ in the correct order.
+   * @param {string} pathToLoad The path from which to start discovering
+   *     dependencies.
+   * @private
+   */
+  goog.writeScripts_ = function(pathToLoad) {
+    /** @type {!Array<string>} The scripts we need to write this time. */
+    var scripts = [];
+    var seenScript = {};
+    var deps = goog.dependencies_;
+
+    /** @param {string} path */
+    function visitNode(path) {
+      if (path in deps.written) {
+        return;
+      }
+
+      // We have already visited this one. We can get here if we have cyclic
+      // dependencies.
+      if (path in deps.visited) {
+        return;
+      }
+
+      deps.visited[path] = true;
+
+      if (path in deps.requires) {
+        for (var requireName in deps.requires[path]) {
+          // If the required name is defined, we assume that it was already
+          // bootstrapped by other means.
+          if (!goog.isProvided_(requireName)) {
+            if (requireName in deps.nameToPath) {
+              visitNode(deps.nameToPath[requireName]);
+            } else {
+              throw Error('Undefined nameToPath for ' + requireName);
+            }
+          }
+        }
+      }
+
+      if (!(path in seenScript)) {
+        seenScript[path] = true;
+        scripts.push(path);
+      }
+    }
+
+    visitNode(pathToLoad);
+
+    // record that we are going to load all these scripts.
+    for (var i = 0; i < scripts.length; i++) {
+      var path = scripts[i];
+      goog.dependencies_.written[path] = true;
+    }
+
+    // If a module is loaded synchronously then we need to
+    // clear the current inModuleLoader value, and restore it when we are
+    // done loading the current "requires".
+    var moduleState = goog.moduleLoaderState_;
+    goog.moduleLoaderState_ = null;
+
+    for (var i = 0; i < scripts.length; i++) {
+      var path = scripts[i];
+      if (path) {
+        var loadFlags = deps.loadFlags[path] || {};
+        var languageLevel = loadFlags['lang'] || 'es3';
+        var needsTranspile = goog.needsTranspile_(languageLevel);
+        if (loadFlags['module'] == 'goog' || needsTranspile) {
+          goog.importProcessedScript_(
+              goog.basePath + path, loadFlags['module'] == 'goog',
+              needsTranspile);
+        } else {
+          goog.importScript_(goog.basePath + path);
+        }
+      } else {
+        goog.moduleLoaderState_ = moduleState;
+        throw Error('Undefined script input');
+      }
+    }
+
+    // restore the current "module loading state"
+    goog.moduleLoaderState_ = moduleState;
+  };
+
+
+  /**
+   * Looks at the dependency rules and tries to determine the script file that
+   * fulfills a particular rule.
+   * @param {string} rule In the form goog.namespace.Class or project.script.
+   * @return {?string} Url corresponding to the rule, or null.
+   * @private
+   */
+  goog.getPathFromDeps_ = function(rule) {
+    if (rule in goog.dependencies_.nameToPath) {
+      return goog.dependencies_.nameToPath[rule];
+    } else {
+      return null;
+    }
+  };
+
+  goog.findBasePath_();
+
+  // Allow projects to manage the deps files themselves.
+  if (!goog.global.CLOSURE_NO_DEPS) {
+    goog.importScript_(goog.basePath + 'deps.js');
+  }
+}
+
+
+/**
+ * @package {?boolean}
+ * Visible for testing.
+ */
+goog.hasBadLetScoping = null;
+
+
+/**
+ * @return {boolean}
+ * @package Visible for testing.
+ */
+goog.useSafari10Workaround = function() {
+  if (goog.hasBadLetScoping == null) {
+    var hasBadLetScoping;
+    try {
+      hasBadLetScoping = !eval(
+          '"use strict";' +
+          'let x = 1; function f() { return typeof x; };' +
+          'f() == "number";');
+    } catch (e) {
+      // Assume that ES6 syntax isn't supported.
+      hasBadLetScoping = false;
+    }
+    goog.hasBadLetScoping = hasBadLetScoping;
+  }
+  return goog.hasBadLetScoping;
+};
+
+
+/**
+ * @param {string} moduleDef
+ * @return {string}
+ * @package Visible for testing.
+ */
+goog.workaroundSafari10EvalBug = function(moduleDef) {
+  return '(function(){' + moduleDef +
+      '\n' +  // Terminate any trailing single line comment.
+      ';' +   // Terminate any trailing expression.
+      '})();\n';
+};
+
+
+/**
+ * @param {function(?):?|string} moduleDef The module definition.
+ */
+goog.loadModule = function(moduleDef) {
+  // NOTE: we allow function definitions to be either in the from
+  // of a string to eval (which keeps the original source intact) or
+  // in a eval forbidden environment (CSP) we allow a function definition
+  // which in its body must call {@code goog.module}, and return the exports
+  // of the module.
+  var previousState = goog.moduleLoaderState_;
+  try {
+    goog.moduleLoaderState_ = {
+      moduleName: undefined,
+      declareLegacyNamespace: false
+    };
+    var exports;
+    if (goog.isFunction(moduleDef)) {
+      exports = moduleDef.call(undefined, {});
+    } else if (goog.isString(moduleDef)) {
+      if (goog.useSafari10Workaround()) {
+        moduleDef = goog.workaroundSafari10EvalBug(moduleDef);
+      }
+
+      exports = goog.loadModuleFromSource_.call(undefined, moduleDef);
+    } else {
+      throw Error('Invalid module definition');
+    }
+
+    var moduleName = goog.moduleLoaderState_.moduleName;
+    if (!goog.isString(moduleName) || !moduleName) {
+      throw Error('Invalid module name \"' + moduleName + '\"');
+    }
+
+    // Don't seal legacy namespaces as they may be uses as a parent of
+    // another namespace
+    if (goog.moduleLoaderState_.declareLegacyNamespace) {
+      goog.constructNamespace_(moduleName, exports);
+    } else if (
+        goog.SEAL_MODULE_EXPORTS && Object.seal && typeof exports == 'object' &&
+        exports != null) {
+      Object.seal(exports);
+    }
+
+    goog.loadedModules_[moduleName] = exports;
+  } finally {
+    goog.moduleLoaderState_ = previousState;
+  }
+};
+
+
+/**
+ * @private @const
+ */
+goog.loadModuleFromSource_ = /** @type {function(string):?} */ (function() {
+  // NOTE: we avoid declaring parameters or local variables here to avoid
+  // masking globals or leaking values into the module definition.
+  'use strict';
+  var exports = {};
+  eval(arguments[0]);
+  return exports;
+});
+
+
+/**
+ * Normalize a file path by removing redundant ".." and extraneous "." file
+ * path components.
+ * @param {string} path
+ * @return {string}
+ * @private
+ */
+goog.normalizePath_ = function(path) {
+  var components = path.split('/');
+  var i = 0;
+  while (i < components.length) {
+    if (components[i] == '.') {
+      components.splice(i, 1);
+    } else if (
+        i && components[i] == '..' && components[i - 1] &&
+        components[i - 1] != '..') {
+      components.splice(--i, 2);
+    } else {
+      i++;
+    }
+  }
+  return components.join('/');
+};
+
+
+/**
+ * Provides a hook for loading a file when using Closure's goog.require() API
+ * with goog.modules.  In particular this hook is provided to support Node.js.
+ *
+ * @type {(function(string):string)|undefined}
+ */
+goog.global.CLOSURE_LOAD_FILE_SYNC;
+
+
+/**
+ * Loads file by synchronous XHR. Should not be used in production environments.
+ * @param {string} src Source URL.
+ * @return {?string} File contents, or null if load failed.
+ * @private
+ */
+goog.loadFileSync_ = function(src) {
+  if (goog.global.CLOSURE_LOAD_FILE_SYNC) {
+    return goog.global.CLOSURE_LOAD_FILE_SYNC(src);
+  } else {
+    try {
+      /** @type {XMLHttpRequest} */
+      var xhr = new goog.global['XMLHttpRequest']();
+      xhr.open('get', src, false);
+      xhr.send();
+      // NOTE: Successful http: requests have a status of 200, but successful
+      // file: requests may have a status of zero.  Any other status, or a
+      // thrown exception (particularly in case of file: requests) indicates
+      // some sort of error, which we treat as a missing or unavailable file.
+      return xhr.status == 0 || xhr.status == 200 ? xhr.responseText : null;
+    } catch (err) {
+      // No need to rethrow or log, since errors should show up on their own.
+      return null;
+    }
+  }
+};
+
+
+/**
+ * Retrieve and execute a script that needs some sort of wrapping.
+ * @param {string} src Script source URL.
+ * @param {boolean} isModule Whether to load as a module.
+ * @param {boolean} needsTranspile Whether to transpile down to ES3.
+ * @private
+ */
+goog.retrieveAndExec_ = function(src, isModule, needsTranspile) {
+  if (!COMPILED) {
+    // The full but non-canonicalized URL for later use.
+    var originalPath = src;
+    // Canonicalize the path, removing any /./ or /../ since Chrome's debugging
+    // console doesn't auto-canonicalize XHR loads as it does <script> srcs.
+    src = goog.normalizePath_(src);
+
+    var importScript =
+        goog.global.CLOSURE_IMPORT_SCRIPT || goog.writeScriptTag_;
+
+    var scriptText = goog.loadFileSync_(src);
+    if (scriptText == null) {
+      throw new Error('Load of "' + src + '" failed');
+    }
+
+    if (needsTranspile) {
+      scriptText = goog.transpile_.call(goog.global, scriptText, src);
+    }
+
+    if (isModule) {
+      scriptText = goog.wrapModule_(src, scriptText);
+    } else {
+      scriptText += '\n//# sourceURL=' + src;
+    }
+    var isOldIE = goog.IS_OLD_IE_;
+    if (isOldIE && goog.oldIeWaiting_) {
+      goog.dependencies_.deferred[originalPath] = scriptText;
+      goog.queuedModules_.push(originalPath);
+    } else {
+      importScript(src, scriptText);
+    }
+  }
+};
+
+
+/**
+ * Lazily retrieves the transpiler and applies it to the source.
+ * @param {string} code JS code.
+ * @param {string} path Path to the code.
+ * @return {string} The transpiled code.
+ * @private
+ */
+goog.transpile_ = function(code, path) {
+  var jscomp = goog.global['$jscomp'];
+  if (!jscomp) {
+    goog.global['$jscomp'] = jscomp = {};
+  }
+  var transpile = jscomp.transpile;
+  if (!transpile) {
+    var transpilerPath = goog.basePath + goog.TRANSPILER;
+    var transpilerCode = goog.loadFileSync_(transpilerPath);
+    if (transpilerCode) {
+      // This must be executed synchronously, since by the time we know we
+      // need it, we're about to load and write the ES6 code synchronously,
+      // so a normal script-tag load will be too slow.
+      eval(transpilerCode + '\n//# sourceURL=' + transpilerPath);
+      // Even though the transpiler is optional, if $gwtExport is found, it's
+      // a sign the transpiler was loaded and the $jscomp.transpile *should*
+      // be there.
+      if (goog.global['$gwtExport'] && goog.global['$gwtExport']['$jscomp'] &&
+          !goog.global['$gwtExport']['$jscomp']['transpile']) {
+        throw new Error(
+            'The transpiler did not properly export the "transpile" ' +
+            'method. $gwtExport: ' + JSON.stringify(goog.global['$gwtExport']));
+      }
+      // transpile.js only exports a single $jscomp function, transpile. We
+      // grab just that and add it to the existing definition of $jscomp which
+      // contains the polyfills.
+      goog.global['$jscomp'].transpile =
+          goog.global['$gwtExport']['$jscomp']['transpile'];
+      jscomp = goog.global['$jscomp'];
+      transpile = jscomp.transpile;
+    }
+  }
+  if (!transpile) {
+    // The transpiler is an optional component.  If it's not available then
+    // replace it with a pass-through function that simply logs.
+    var suffix = ' requires transpilation but no transpiler was found.';
+    transpile = jscomp.transpile = function(code, path) {
+      // TODO(user): figure out some way to get this error to show up
+      // in test results, noting that the failure may occur in many
+      // different ways, including in loadModule() before the test
+      // runner even comes up.
+      goog.logToConsole_(path + suffix);
+      return code;
+    };
+  }
+  // Note: any transpilation errors/warnings will be logged to the console.
+  return transpile(code, path);
+};
+
+
+//==============================================================================
+// Language Enhancements
+//==============================================================================
+
+
+/**
+ * This is a "fixed" version of the typeof operator.  It differs from the typeof
+ * operator in such a way that null returns 'null' and arrays return 'array'.
+ * @param {?} value The value to get the type of.
+ * @return {string} The name of the type.
+ */
+goog.typeOf = function(value) {
+  var s = typeof value;
+  if (s == 'object') {
+    if (value) {
+      // Check these first, so we can avoid calling Object.prototype.toString if
+      // possible.
+      //
+      // IE improperly marshals typeof across execution contexts, but a
+      // cross-context object will still return false for "instanceof Object".
+      if (value instanceof Array) {
+        return 'array';
+      } else if (value instanceof Object) {
+        return s;
+      }
+
+      // HACK: In order to use an Object prototype method on the arbitrary
+      //   value, the compiler requires the value be cast to type Object,
+      //   even though the ECMA spec explicitly allows it.
+      var className = Object.prototype.toString.call(
+          /** @type {!Object} */ (value));
+      // In Firefox 3.6, attempting to access iframe window objects' length
+      // property throws an NS_ERROR_FAILURE, so we need to special-case it
+      // here.
+      if (className == '[object Window]') {
+        return 'object';
+      }
+
+      // We cannot always use constructor == Array or instanceof Array because
+      // different frames have different Array objects. In IE6, if the iframe
+      // where the array was created is destroyed, the array loses its
+      // prototype. Then dereferencing val.splice here throws an exception, so
+      // we can't use goog.isFunction. Calling typeof directly returns 'unknown'
+      // so that will work. In this case, this function will return false and
+      // most array functions will still work because the array is still
+      // array-like (supports length and []) even though it has lost its
+      // prototype.
+      // Mark Miller noticed that Object.prototype.toString
+      // allows access to the unforgeable [[Class]] property.
+      //  15.2.4.2 Object.prototype.toString ( )
+      //  When the toString method is called, the following steps are taken:
+      //      1. Get the [[Class]] property of this object.
+      //      2. Compute a string value by concatenating the three strings
+      //         "[object ", Result(1), and "]".
+      //      3. Return Result(2).
+      // and this behavior survives the destruction of the execution context.
+      if ((className == '[object Array]' ||
+           // In IE all non value types are wrapped as objects across window
+           // boundaries (not iframe though) so we have to do object detection
+           // for this edge case.
+           typeof value.length == 'number' &&
+               typeof value.splice != 'undefined' &&
+               typeof value.propertyIsEnumerable != 'undefined' &&
+               !value.propertyIsEnumerable('splice')
+
+               )) {
+        return 'array';
+      }
+      // HACK: There is still an array case that fails.
+      //     function ArrayImpostor() {}
+      //     ArrayImpostor.prototype = [];
+      //     var impostor = new ArrayImpostor;
+      // this can be fixed by getting rid of the fast path
+      // (value instanceof Array) and solely relying on
+      // (value && Object.prototype.toString.vall(value) === '[object Array]')
+      // but that would require many more function calls and is not warranted
+      // unless closure code is receiving objects from untrusted sources.
+
+      // IE in cross-window calls does not correctly marshal the function type
+      // (it appears just as an object) so we cannot use just typeof val ==
+      // 'function'. However, if the object has a call property, it is a
+      // function.
+      if ((className == '[object Function]' ||
+           typeof value.call != 'undefined' &&
+               typeof value.propertyIsEnumerable != 'undefined' &&
+               !value.propertyIsEnumerable('call'))) {
+        return 'function';
+      }
+
+    } else {
+      return 'null';
+    }
+
+  } else if (s == 'function' && typeof value.call == 'undefined') {
+    // In Safari typeof nodeList returns 'function', and on Firefox typeof
+    // behaves similarly for HTML{Applet,Embed,Object}, Elements and RegExps. We
+    // would like to return object for those and we can detect an invalid
+    // function by making sure that the function object has a call method.
+    return 'object';
+  }
+  return s;
+};
+
+
+/**
+ * Returns true if the specified value is null.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is null.
+ */
+goog.isNull = function(val) {
+  return val === null;
+};
+
+
+/**
+ * Returns true if the specified value is defined and not null.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is defined and not null.
+ */
+goog.isDefAndNotNull = function(val) {
+  // Note that undefined == null.
+  return val != null;
+};
+
+
+/**
+ * Returns true if the specified value is an array.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is an array.
+ */
+goog.isArray = function(val) {
+  return goog.typeOf(val) == 'array';
+};
+
+
+/**
+ * Returns true if the object looks like an array. To qualify as array like
+ * the value needs to be either a NodeList or an object with a Number length
+ * property. As a special case, a function value is not array like, because its
+ * length property is fixed to correspond to the number of expected arguments.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is an array.
+ */
+goog.isArrayLike = function(val) {
+  var type = goog.typeOf(val);
+  // We do not use goog.isObject here in order to exclude function values.
+  return type == 'array' || type == 'object' && typeof val.length == 'number';
+};
+
+
+/**
+ * Returns true if the object looks like a Date. To qualify as Date-like the
+ * value needs to be an object and have a getFullYear() function.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is a like a Date.
+ */
+goog.isDateLike = function(val) {
+  return goog.isObject(val) && typeof val.getFullYear == 'function';
+};
+
+
+/**
+ * Returns true if the specified value is a function.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is a function.
+ */
+goog.isFunction = function(val) {
+  return goog.typeOf(val) == 'function';
+};
+
+
+/**
+ * Returns true if the specified value is an object.  This includes arrays and
+ * functions.
+ * @param {?} val Variable to test.
+ * @return {boolean} Whether variable is an object.
+ */
+goog.isObject = function(val) {
+  var type = typeof val;
+  return type == 'object' && val != null || type == 'function';
+  // return Object(val) === val also works, but is slower, especially if val is
+  // not an object.
+};
+
+
+/**
+ * Gets a unique ID for an object. This mutates the object so that further calls
+ * with the same object as a parameter returns the same value. The unique ID is
+ * guaranteed to be unique across the current session amongst objects that are
+ * passed into {@code getUid}. There is no guarantee that the ID is unique or
+ * consistent across sessions. It is unsafe to generate unique ID for function
+ * prototypes.
+ *
+ * @param {Object} obj The object to get the unique ID for.
+ * @return {number} The unique ID for the object.
+ */
+goog.getUid = function(obj) {
+  // TODO(arv): Make the type stricter, do not accept null.
+
+  // In Opera window.hasOwnProperty exists but always returns false so we avoid
+  // using it. As a consequence the unique ID generated for BaseClass.prototype
+  // and SubClass.prototype will be the same.
+  return obj[goog.UID_PROPERTY_] ||
+      (obj[goog.UID_PROPERTY_] = ++goog.uidCounter_);
+};
+
+
+/**
+ * Whether the given object is already assigned a unique ID.
+ *
+ * This does not modify the object.
+ *
+ * @param {!Object} obj The object to check.
+ * @return {boolean} Whether there is an assigned unique id for the object.
+ */
+goog.hasUid = function(obj) {
+  return !!obj[goog.UID_PROPERTY_];
+};
+
+
+/**
+ * Removes the unique ID from an object. This is useful if the object was
+ * previously mutated using {@code goog.getUid} in which case the mutation is
+ * undone.
+ * @param {Object} obj The object to remove the unique ID field from.
+ */
+goog.removeUid = function(obj) {
+  // TODO(arv): Make the type stricter, do not accept null.
+
+  // In IE, DOM nodes are not instances of Object and throw an exception if we
+  // try to delete.  Instead we try to use removeAttribute.
+  if (obj !== null && 'removeAttribute' in obj) {
+    obj.removeAttribute(goog.UID_PROPERTY_);
+  }
+
+  try {
+    delete obj[goog.UID_PROPERTY_];
+  } catch (ex) {
+  }
+};
+
+
+/**
+ * Name for unique ID property. Initialized in a way to help avoid collisions
+ * with other closure JavaScript on the same page.
+ * @type {string}
+ * @private
+ */
+goog.UID_PROPERTY_ = 'closure_uid_' + ((Math.random() * 1e9) >>> 0);
+
+
+/**
+ * Counter for UID.
+ * @type {number}
+ * @private
+ */
+goog.uidCounter_ = 0;
+
+
+/**
+ * Adds a hash code field to an object. The hash code is unique for the
+ * given object.
+ * @param {Object} obj The object to get the hash code for.
+ * @return {number} The hash code for the object.
+ * @deprecated Use goog.getUid instead.
+ */
+goog.getHashCode = goog.getUid;
+
+
+/**
+ * Removes the hash code field from an object.
+ * @param {Object} obj The object to remove the field from.
+ * @deprecated Use goog.removeUid instead.
+ */
+goog.removeHashCode = goog.removeUid;
+
+
+/**
+ * Clones a value. The input may be an Object, Array, or basic type. Objects and
+ * arrays will be cloned recursively.
+ *
+ * WARNINGS:
+ * <code>goog.cloneObject</code> does not detect reference loops. Objects that
+ * refer to themselves will cause infinite recursion.
+ *
+ * <code>goog.cloneObject</code> is unaware of unique identifiers, and copies
+ * UIDs created by <code>getUid</code> into cloned results.
+ *
+ * @param {*} obj The value to clone.
+ * @return {*} A clone of the input value.
+ * @deprecated goog.cloneObject is unsafe. Prefer the goog.object methods.
+ */
+goog.cloneObject = function(obj) {
+  var type = goog.typeOf(obj);
+  if (type == 'object' || type == 'array') {
+    if (obj.clone) {
+      return obj.clone();
+    }
+    var clone = type == 'array' ? [] : {};
+    for (var key in obj) {
+      clone[key] = goog.cloneObject(obj[key]);
+    }
+    return clone;
+  }
+
+  return obj;
+};
+
+
+/**
+ * A native implementation of goog.bind.
+ * @param {?function(this:T, ...)} fn A function to partially apply.
+ * @param {T} selfObj Specifies the object which this should point to when the
+ *     function is run.
+ * @param {...*} var_args Additional arguments that are partially applied to the
+ *     function.
+ * @return {!Function} A partially-applied form of the function goog.bind() was
+ *     invoked as a method of.
+ * @template T
+ * @private
+ */
+goog.bindNative_ = function(fn, selfObj, var_args) {
+  return /** @type {!Function} */ (fn.call.apply(fn.bind, arguments));
+};
+
+
+/**
+ * A pure-JS implementation of goog.bind.
+ * @param {?function(this:T, ...)} fn A function to partially apply.
+ * @param {T} selfObj Specifies the object which this should point to when the
+ *     function is run.
+ * @param {...*} var_args Additional arguments that are partially applied to the
+ *     function.
+ * @return {!Function} A partially-applied form of the function goog.bind() was
+ *     invoked as a method of.
+ * @template T
+ * @private
+ */
+goog.bindJs_ = function(fn, selfObj, var_args) {
+  if (!fn) {
+    throw new Error();
+  }
+
+  if (arguments.length > 2) {
+    var boundArgs = Array.prototype.slice.call(arguments, 2);
+    return function() {
+      // Prepend the bound arguments to the current arguments.
+      var newArgs = Array.prototype.slice.call(arguments);
+      Array.prototype.unshift.apply(newArgs, boundArgs);
+      return fn.apply(selfObj, newArgs);
+    };
+
+  } else {
+    return function() {
+      return fn.apply(selfObj, arguments);
+    };
+  }
+};
+
+
+/**
+ * Partially applies this function to a particular 'this object' and zero or
+ * more arguments. The result is a new function with some arguments of the first
+ * function pre-filled and the value of this 'pre-specified'.
+ *
+ * Remaining arguments specified at call-time are appended to the pre-specified
+ * ones.
+ *
+ * Also see: {@link #partial}.
+ *
+ * Usage:
+ * <pre>var barMethBound = goog.bind(myFunction, myObj, 'arg1', 'arg2');
+ * barMethBound('arg3', 'arg4');</pre>
+ *
+ * @param {?function(this:T, ...)} fn A function to partially apply.
+ * @param {T} selfObj Specifies the object which this should point to when the
+ *     function is run.
+ * @param {...*} var_args Additional arguments that are partially applied to the
+ *     function.
+ * @return {!Function} A partially-applied form of the function goog.bind() was
+ *     invoked as a method of.
+ * @template T
+ * @suppress {deprecated} See above.
+ */
+goog.bind = function(fn, selfObj, var_args) {
+  // TODO(nicksantos): narrow the type signature.
+  if (Function.prototype.bind &&
+      // NOTE(nicksantos): Somebody pulled base.js into the default Chrome
+      // extension environment. This means that for Chrome extensions, they get
+      // the implementation of Function.prototype.bind that calls goog.bind
+      // instead of the native one. Even worse, we don't want to introduce a
+      // circular dependency between goog.bind and Function.prototype.bind, so
+      // we have to hack this to make sure it works correctly.
+      Function.prototype.bind.toString().indexOf('native code') != -1) {
+    goog.bind = goog.bindNative_;
+  } else {
+    goog.bind = goog.bindJs_;
+  }
+  return goog.bind.apply(null, arguments);
+};
+
+
+/**
+ * Like goog.bind(), except that a 'this object' is not required. Useful when
+ * the target function is already bound.
+ *
+ * Usage:
+ * var g = goog.partial(f, arg1, arg2);
+ * g(arg3, arg4);
+ *
+ * @param {Function} fn A function to partially apply.
+ * @param {...*} var_args Additional arguments that are partially applied to fn.
+ * @return {!Function} A partially-applied form of the function goog.partial()
+ *     was invoked as a method of.
+ */
+goog.partial = function(fn, var_args) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  return function() {
+    // Clone the array (with slice()) and append additional arguments
+    // to the existing arguments.
+    var newArgs = args.slice();
+    newArgs.push.apply(newArgs, arguments);
+    return fn.apply(this, newArgs);
+  };
+};
+
+
+/**
+ * Copies all the members of a source object to a target object. This method
+ * does not work on all browsers for all objects that contain keys such as
+ * toString or hasOwnProperty. Use goog.object.extend for this purpose.
+ * @param {Object} target Target.
+ * @param {Object} source Source.
+ */
+goog.mixin = function(target, source) {
+  for (var x in source) {
+    target[x] = source[x];
+  }
+
+  // For IE7 or lower, the for-in-loop does not contain any properties that are
+  // not enumerable on the prototype object (for example, isPrototypeOf from
+  // Object.prototype) but also it will not include 'replace' on objects that
+  // extend String and change 'replace' (not that it is common for anyone to
+  // extend anything except Object).
+};
+
+
+/**
+ * @return {number} An integer value representing the number of milliseconds
+ *     between midnight, January 1, 1970 and the current time.
+ */
+goog.now = (goog.TRUSTED_SITE && Date.now) || (function() {
+             // Unary plus operator converts its operand to a number which in
+             // the case of
+             // a date is done by calling getTime().
+             return +new Date();
+           });
+
+
+/**
+ * Evals JavaScript in the global scope.  In IE this uses execScript, other
+ * browsers use goog.global.eval. If goog.global.eval does not evaluate in the
+ * global scope (for example, in Safari), appends a script tag instead.
+ * Throws an exception if neither execScript or eval is defined.
+ * @param {string} script JavaScript string.
+ */
+goog.globalEval = function(script) {
+  if (goog.global.execScript) {
+    goog.global.execScript(script, 'JavaScript');
+  } else if (goog.global.eval) {
+    // Test to see if eval works
+    if (goog.evalWorksForGlobals_ == null) {
+      goog.global.eval('var _evalTest_ = 1;');
+      if (typeof goog.global['_evalTest_'] != 'undefined') {
+        try {
+          delete goog.global['_evalTest_'];
+        } catch (ignore) {
+          // Microsoft edge fails the deletion above in strict mode.
+        }
+        goog.evalWorksForGlobals_ = true;
+      } else {
+        goog.evalWorksForGlobals_ = false;
+      }
+    }
+
+    if (goog.evalWorksForGlobals_) {
+      goog.global.eval(script);
+    } else {
+      /** @type {Document} */
+      var doc = goog.global.document;
+      var scriptElt =
+          /** @type {!HTMLScriptElement} */ (doc.createElement('SCRIPT'));
+      scriptElt.type = 'text/javascript';
+      scriptElt.defer = false;
+      // Note(user): can't use .innerHTML since "t('<test>')" will fail and
+      // .text doesn't work in Safari 2.  Therefore we append a text node.
+      scriptElt.appendChild(doc.createTextNode(script));
+      doc.body.appendChild(scriptElt);
+      doc.body.removeChild(scriptElt);
+    }
+  } else {
+    throw Error('goog.globalEval not available');
+  }
+};
+
+
+/**
+ * Indicates whether or not we can call 'eval' directly to eval code in the
+ * global scope. Set to a Boolean by the first call to goog.globalEval (which
+ * empirically tests whether eval works for globals). @see goog.globalEval
+ * @type {?boolean}
+ * @private
+ */
+goog.evalWorksForGlobals_ = null;
+
+
+/**
+ * Optional map of CSS class names to obfuscated names used with
+ * goog.getCssName().
+ * @private {!Object<string, string>|undefined}
+ * @see goog.setCssNameMapping
+ */
+goog.cssNameMapping_;
+
+
+/**
+ * Optional obfuscation style for CSS class names. Should be set to either
+ * 'BY_WHOLE' or 'BY_PART' if defined.
+ * @type {string|undefined}
+ * @private
+ * @see goog.setCssNameMapping
+ */
+goog.cssNameMappingStyle_;
+
+
+
+/**
+ * A hook for modifying the default behavior goog.getCssName. The function
+ * if present, will recieve the standard output of the goog.getCssName as
+ * its input.
+ *
+ * @type {(function(string):string)|undefined}
+ */
+goog.global.CLOSURE_CSS_NAME_MAP_FN;
+
+
+/**
+ * Handles strings that are intended to be used as CSS class names.
+ *
+ * This function works in tandem with @see goog.setCssNameMapping.
+ *
+ * Without any mapping set, the arguments are simple joined with a hyphen and
+ * passed through unaltered.
+ *
+ * When there is a mapping, there are two possible styles in which these
+ * mappings are used. In the BY_PART style, each part (i.e. in between hyphens)
+ * of the passed in css name is rewritten according to the map. In the BY_WHOLE
+ * style, the full css name is looked up in the map directly. If a rewrite is
+ * not specified by the map, the compiler will output a warning.
+ *
+ * When the mapping is passed to the compiler, it will replace calls to
+ * goog.getCssName with the strings from the mapping, e.g.
+ *     var x = goog.getCssName('foo');
+ *     var y = goog.getCssName(this.baseClass, 'active');
+ *  becomes:
+ *     var x = 'foo';
+ *     var y = this.baseClass + '-active';
+ *
+ * If one argument is passed it will be processed, if two are passed only the
+ * modifier will be processed, as it is assumed the first argument was generated
+ * as a result of calling goog.getCssName.
+ *
+ * @param {string} className The class name.
+ * @param {string=} opt_modifier A modifier to be appended to the class name.
+ * @return {string} The class name or the concatenation of the class name and
+ *     the modifier.
+ */
+goog.getCssName = function(className, opt_modifier) {
+  // String() is used for compatibility with compiled soy where the passed
+  // className can be non-string objects.
+  if (String(className).charAt(0) == '.') {
+    throw new Error(
+        'className passed in goog.getCssName must not start with ".".' +
+        ' You passed: ' + className);
+  }
+
+  var getMapping = function(cssName) {
+    return goog.cssNameMapping_[cssName] || cssName;
+  };
+
+  var renameByParts = function(cssName) {
+    // Remap all the parts individually.
+    var parts = cssName.split('-');
+    var mapped = [];
+    for (var i = 0; i < parts.length; i++) {
+      mapped.push(getMapping(parts[i]));
+    }
+    return mapped.join('-');
+  };
+
+  var rename;
+  if (goog.cssNameMapping_) {
+    rename =
+        goog.cssNameMappingStyle_ == 'BY_WHOLE' ? getMapping : renameByParts;
+  } else {
+    rename = function(a) {
+      return a;
+    };
+  }
+
+  var result =
+      opt_modifier ? className + '-' + rename(opt_modifier) : rename(className);
+
+  // The special CLOSURE_CSS_NAME_MAP_FN allows users to specify further
+  // processing of the class name.
+  if (goog.global.CLOSURE_CSS_NAME_MAP_FN) {
+    return goog.global.CLOSURE_CSS_NAME_MAP_FN(result);
+  }
+
+  return result;
+};
+
+
+/**
+ * Sets the map to check when returning a value from goog.getCssName(). Example:
+ * <pre>
+ * goog.setCssNameMapping({
+ *   "goog": "a",
+ *   "disabled": "b",
+ * });
+ *
+ * var x = goog.getCssName('goog');
+ * // The following evaluates to: "a a-b".
+ * goog.getCssName('goog') + ' ' + goog.getCssName(x, 'disabled')
+ * </pre>
+ * When declared as a map of string literals to string literals, the JSCompiler
+ * will replace all calls to goog.getCssName() using the supplied map if the
+ * --process_closure_primitives flag is set.
+ *
+ * @param {!Object} mapping A map of strings to strings where keys are possible
+ *     arguments to goog.getCssName() and values are the corresponding values
+ *     that should be returned.
+ * @param {string=} opt_style The style of css name mapping. There are two valid
+ *     options: 'BY_PART', and 'BY_WHOLE'.
+ * @see goog.getCssName for a description.
+ */
+goog.setCssNameMapping = function(mapping, opt_style) {
+  goog.cssNameMapping_ = mapping;
+  goog.cssNameMappingStyle_ = opt_style;
+};
+
+
+/**
+ * To use CSS renaming in compiled mode, one of the input files should have a
+ * call to goog.setCssNameMapping() with an object literal that the JSCompiler
+ * can extract and use to replace all calls to goog.getCssName(). In uncompiled
+ * mode, JavaScript code should be loaded before this base.js file that declares
+ * a global variable, CLOSURE_CSS_NAME_MAPPING, which is used below. This is
+ * to ensure that the mapping is loaded before any calls to goog.getCssName()
+ * are made in uncompiled mode.
+ *
+ * A hook for overriding the CSS name mapping.
+ * @type {!Object<string, string>|undefined}
+ */
+goog.global.CLOSURE_CSS_NAME_MAPPING;
+
+
+if (!COMPILED && goog.global.CLOSURE_CSS_NAME_MAPPING) {
+  // This does not call goog.setCssNameMapping() because the JSCompiler
+  // requires that goog.setCssNameMapping() be called with an object literal.
+  goog.cssNameMapping_ = goog.global.CLOSURE_CSS_NAME_MAPPING;
+}
+
+
+/**
+ * Gets a localized message.
+ *
+ * This function is a compiler primitive. If you give the compiler a localized
+ * message bundle, it will replace the string at compile-time with a localized
+ * version, and expand goog.getMsg call to a concatenated string.
+ *
+ * Messages must be initialized in the form:
+ * <code>
+ * var MSG_NAME = goog.getMsg('Hello {$placeholder}', {'placeholder': 'world'});
+ * </code>
+ *
+ * This function produces a string which should be treated as plain text. Use
+ * {@link goog.html.SafeHtmlFormatter} in conjunction with goog.getMsg to
+ * produce SafeHtml.
+ *
+ * @param {string} str Translatable string, places holders in the form {$foo}.
+ * @param {Object<string, string>=} opt_values Maps place holder name to value.
+ * @return {string} message with placeholders filled.
+ */
+goog.getMsg = function(str, opt_values) {
+  if (opt_values) {
+    str = str.replace(/\{\$([^}]+)}/g, function(match, key) {
+      return (opt_values != null && key in opt_values) ? opt_values[key] :
+                                                         match;
+    });
+  }
+  return str;
+};
+
+
+/**
+ * Gets a localized message. If the message does not have a translation, gives a
+ * fallback message.
+ *
+ * This is useful when introducing a new message that has not yet been
+ * translated into all languages.
+ *
+ * This function is a compiler primitive. Must be used in the form:
+ * <code>var x = goog.getMsgWithFallback(MSG_A, MSG_B);</code>
+ * where MSG_A and MSG_B were initialized with goog.getMsg.
+ *
+ * @param {string} a The preferred message.
+ * @param {string} b The fallback message.
+ * @return {string} The best translated message.
+ */
+goog.getMsgWithFallback = function(a, b) {
+  return a;
+};
+
+
+/**
+ * Exposes an unobfuscated global namespace path for the given object.
+ * Note that fields of the exported object *will* be obfuscated, unless they are
+ * exported in turn via this function or goog.exportProperty.
+ *
+ * Also handy for making public items that are defined in anonymous closures.
+ *
+ * ex. goog.exportSymbol('public.path.Foo', Foo);
+ *
+ * ex. goog.exportSymbol('public.path.Foo.staticFunction', Foo.staticFunction);
+ *     public.path.Foo.staticFunction();
+ *
+ * ex. goog.exportSymbol('public.path.Foo.prototype.myMethod',
+ *                       Foo.prototype.myMethod);
+ *     new public.path.Foo().myMethod();
+ *
+ * @param {string} publicPath Unobfuscated name to export.
+ * @param {*} object Object the name should point to.
+ * @param {Object=} opt_objectToExportTo The object to add the path to; default
+ *     is goog.global.
+ */
+goog.exportSymbol = function(publicPath, object, opt_objectToExportTo) {
+  goog.exportPath_(publicPath, object, opt_objectToExportTo);
+};
+
+
+/**
+ * Exports a property unobfuscated into the object's namespace.
+ * ex. goog.exportProperty(Foo, 'staticFunction', Foo.staticFunction);
+ * ex. goog.exportProperty(Foo.prototype, 'myMethod', Foo.prototype.myMethod);
+ * @param {Object} object Object whose static property is being exported.
+ * @param {string} publicName Unobfuscated name to export.
+ * @param {*} symbol Object the name should point to.
+ */
+goog.exportProperty = function(object, publicName, symbol) {
+  object[publicName] = symbol;
+};
+
+
+/**
+ * Inherit the prototype methods from one constructor into another.
+ *
+ * Usage:
+ * <pre>
+ * function ParentClass(a, b) { }
+ * ParentClass.prototype.foo = function(a) { };
+ *
+ * function ChildClass(a, b, c) {
+ *   ChildClass.base(this, 'constructor', a, b);
+ * }
+ * goog.inherits(ChildClass, ParentClass);
+ *
+ * var child = new ChildClass('a', 'b', 'see');
+ * child.foo(); // This works.
+ * </pre>
+ *
+ * @param {!Function} childCtor Child class.
+ * @param {!Function} parentCtor Parent class.
+ */
+goog.inherits = function(childCtor, parentCtor) {
+  /** @constructor */
+  function tempCtor() {}
+  tempCtor.prototype = parentCtor.prototype;
+  childCtor.superClass_ = parentCtor.prototype;
+  childCtor.prototype = new tempCtor();
+  /** @override */
+  childCtor.prototype.constructor = childCtor;
+
+  /**
+   * Calls superclass constructor/method.
+   *
+   * This function is only available if you use goog.inherits to
+   * express inheritance relationships between classes.
+   *
+   * NOTE: This is a replacement for goog.base and for superClass_
+   * property defined in childCtor.
+   *
+   * @param {!Object} me Should always be "this".
+   * @param {string} methodName The method name to call. Calling
+   *     superclass constructor can be done with the special string
+   *     'constructor'.
+   * @param {...*} var_args The arguments to pass to superclass
+   *     method/constructor.
+   * @return {*} The return value of the superclass method/constructor.
+   */
+  childCtor.base = function(me, methodName, var_args) {
+    // Copying using loop to avoid deop due to passing arguments object to
+    // function. This is faster in many JS engines as of late 2014.
+    var args = new Array(arguments.length - 2);
+    for (var i = 2; i < arguments.length; i++) {
+      args[i - 2] = arguments[i];
+    }
+    return parentCtor.prototype[methodName].apply(me, args);
+  };
+};
+
+
+/**
+ * Call up to the superclass.
+ *
+ * If this is called from a constructor, then this calls the superclass
+ * constructor with arguments 1-N.
+ *
+ * If this is called from a prototype method, then you must pass the name of the
+ * method as the second argument to this function. If you do not, you will get a
+ * runtime error. This calls the superclass' method with arguments 2-N.
+ *
+ * This function only works if you use goog.inherits to express inheritance
+ * relationships between your classes.
+ *
+ * This function is a compiler primitive. At compile-time, the compiler will do
+ * macro expansion to remove a lot of the extra overhead that this function
+ * introduces. The compiler will also enforce a lot of the assumptions that this
+ * function makes, and treat it as a compiler error if you break them.
+ *
+ * @param {!Object} me Should always be "this".
+ * @param {*=} opt_methodName The method name if calling a super method.
+ * @param {...*} var_args The rest of the arguments.
+ * @return {*} The return value of the superclass method.
+ * @suppress {es5Strict} This method can not be used in strict mode, but
+ *     all Closure Library consumers must depend on this file.
+ * @deprecated goog.base is not strict mode compatible.  Prefer the static
+ *     "base" method added to the constructor by goog.inherits
+ *     or ES6 classes and the "super" keyword.
+ */
+goog.base = function(me, opt_methodName, var_args) {
+  var caller = arguments.callee.caller;
+
+  if (goog.STRICT_MODE_COMPATIBLE || (goog.DEBUG && !caller)) {
+    throw Error(
+        'arguments.caller not defined.  goog.base() cannot be used ' +
+        'with strict mode code. See ' +
+        'http://www.ecma-international.org/ecma-262/5.1/#sec-C');
+  }
+
+  if (caller.superClass_) {
+    // Copying using loop to avoid deop due to passing arguments object to
+    // function. This is faster in many JS engines as of late 2014.
+    var ctorArgs = new Array(arguments.length - 1);
+    for (var i = 1; i < arguments.length; i++) {
+      ctorArgs[i - 1] = arguments[i];
+    }
+    // This is a constructor. Call the superclass constructor.
+    return caller.superClass_.constructor.apply(me, ctorArgs);
+  }
+
+  // Copying using loop to avoid deop due to passing arguments object to
+  // function. This is faster in many JS engines as of late 2014.
+  var args = new Array(arguments.length - 2);
+  for (var i = 2; i < arguments.length; i++) {
+    args[i - 2] = arguments[i];
+  }
+  var foundCaller = false;
+  for (var ctor = me.constructor; ctor;
+       ctor = ctor.superClass_ && ctor.superClass_.constructor) {
+    if (ctor.prototype[opt_methodName] === caller) {
+      foundCaller = true;
+    } else if (foundCaller) {
+      return ctor.prototype[opt_methodName].apply(me, args);
+    }
+  }
+
+  // If we did not find the caller in the prototype chain, then one of two
+  // things happened:
+  // 1) The caller is an instance method.
+  // 2) This method was not called by the right caller.
+  if (me[opt_methodName] === caller) {
+    return me.constructor.prototype[opt_methodName].apply(me, args);
+  } else {
+    throw Error(
+        'goog.base called from a method of one name ' +
+        'to a method of a different name');
+  }
+};
+
+
+/**
+ * Allow for aliasing within scope functions.  This function exists for
+ * uncompiled code - in compiled code the calls will be inlined and the aliases
+ * applied.  In uncompiled code the function is simply run since the aliases as
+ * written are valid JavaScript.
+ *
+ *
+ * @param {function()} fn Function to call.  This function can contain aliases
+ *     to namespaces (e.g. "var dom = goog.dom") or classes
+ *     (e.g. "var Timer = goog.Timer").
+ */
+goog.scope = function(fn) {
+  if (goog.isInModuleLoader_()) {
+    throw Error('goog.scope is not supported within a goog.module.');
+  }
+  fn.call(goog.global);
+};
+
+
+/*
+ * To support uncompiled, strict mode bundles that use eval to divide source
+ * like so:
+ *    eval('someSource;//# sourceUrl sourcefile.js');
+ * We need to export the globally defined symbols "goog" and "COMPILED".
+ * Exporting "goog" breaks the compiler optimizations, so we required that
+ * be defined externally.
+ * NOTE: We don't use goog.exportSymbol here because we don't want to trigger
+ * extern generation when that compiler option is enabled.
+ */
+if (!COMPILED) {
+  goog.global['COMPILED'] = COMPILED;
+}
+
+
+//==============================================================================
+// goog.defineClass implementation
+//==============================================================================
+
+
+/**
+ * Creates a restricted form of a Closure "class":
+ *   - from the compiler's perspective, the instance returned from the
+ *     constructor is sealed (no new properties may be added).  This enables
+ *     better checks.
+ *   - the compiler will rewrite this definition to a form that is optimal
+ *     for type checking and optimization (initially this will be a more
+ *     traditional form).
+ *
+ * @param {Function} superClass The superclass, Object or null.
+ * @param {goog.defineClass.ClassDescriptor} def
+ *     An object literal describing
+ *     the class.  It may have the following properties:
+ *     "constructor": the constructor function
+ *     "statics": an object literal containing methods to add to the constructor
+ *        as "static" methods or a function that will receive the constructor
+ *        function as its only parameter to which static properties can
+ *        be added.
+ *     all other properties are added to the prototype.
+ * @return {!Function} The class constructor.
+ */
+goog.defineClass = function(superClass, def) {
+  // TODO(johnlenz): consider making the superClass an optional parameter.
+  var constructor = def.constructor;
+  var statics = def.statics;
+  // Wrap the constructor prior to setting up the prototype and static methods.
+  if (!constructor || constructor == Object.prototype.constructor) {
+    constructor = function() {
+      throw Error('cannot instantiate an interface (no constructor defined).');
+    };
+  }
+
+  var cls = goog.defineClass.createSealingConstructor_(constructor, superClass);
+  if (superClass) {
+    goog.inherits(cls, superClass);
+  }
+
+  // Remove all the properties that should not be copied to the prototype.
+  delete def.constructor;
+  delete def.statics;
+
+  goog.defineClass.applyProperties_(cls.prototype, def);
+  if (statics != null) {
+    if (statics instanceof Function) {
+      statics(cls);
+    } else {
+      goog.defineClass.applyProperties_(cls, statics);
+    }
+  }
+
+  return cls;
+};
+
+
+/**
+ * @typedef {{
+ *   constructor: (!Function|undefined),
+ *   statics: (Object|undefined|function(Function):void)
+ * }}
+ */
+goog.defineClass.ClassDescriptor;
+
+
+/**
+ * @define {boolean} Whether the instances returned by goog.defineClass should
+ *     be sealed when possible.
+ *
+ * When sealing is disabled the constructor function will not be wrapped by
+ * goog.defineClass, making it incompatible with ES6 class methods.
+ */
+goog.define('goog.defineClass.SEAL_CLASS_INSTANCES', goog.DEBUG);
+
+
+/**
+ * If goog.defineClass.SEAL_CLASS_INSTANCES is enabled and Object.seal is
+ * defined, this function will wrap the constructor in a function that seals the
+ * results of the provided constructor function.
+ *
+ * @param {!Function} ctr The constructor whose results maybe be sealed.
+ * @param {Function} superClass The superclass constructor.
+ * @return {!Function} The replacement constructor.
+ * @private
+ */
+goog.defineClass.createSealingConstructor_ = function(ctr, superClass) {
+  if (!goog.defineClass.SEAL_CLASS_INSTANCES) {
+    // Do now wrap the constructor when sealing is disabled. Angular code
+    // depends on this for injection to work properly.
+    return ctr;
+  }
+
+  // Compute whether the constructor is sealable at definition time, rather
+  // than when the instance is being constructed.
+  var superclassSealable = !goog.defineClass.isUnsealable_(superClass);
+
+  /**
+   * @this {Object}
+   * @return {?}
+   */
+  var wrappedCtr = function() {
+    // Don't seal an instance of a subclass when it calls the constructor of
+    // its super class as there is most likely still setup to do.
+    var instance = ctr.apply(this, arguments) || this;
+    instance[goog.UID_PROPERTY_] = instance[goog.UID_PROPERTY_];
+
+    if (this.constructor === wrappedCtr && superclassSealable &&
+        Object.seal instanceof Function) {
+      Object.seal(instance);
+    }
+    return instance;
+  };
+
+  return wrappedCtr;
+};
+
+
+/**
+ * @param {Function} ctr The constructor to test.
+ * @return {boolean} Whether the constructor has been tagged as unsealable
+ *     using goog.tagUnsealableClass.
+ * @private
+ */
+goog.defineClass.isUnsealable_ = function(ctr) {
+  return ctr && ctr.prototype &&
+      ctr.prototype[goog.UNSEALABLE_CONSTRUCTOR_PROPERTY_];
+};
+
+
+// TODO(johnlenz): share these values with the goog.object
+/**
+ * The names of the fields that are defined on Object.prototype.
+ * @type {!Array<string>}
+ * @private
+ * @const
+ */
+goog.defineClass.OBJECT_PROTOTYPE_FIELDS_ = [
+  'constructor', 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable',
+  'toLocaleString', 'toString', 'valueOf'
+];
+
+
+// TODO(johnlenz): share this function with the goog.object
+/**
+ * @param {!Object} target The object to add properties to.
+ * @param {!Object} source The object to copy properties from.
+ * @private
+ */
+goog.defineClass.applyProperties_ = function(target, source) {
+  // TODO(johnlenz): update this to support ES5 getters/setters
+
+  var key;
+  for (key in source) {
+    if (Object.prototype.hasOwnProperty.call(source, key)) {
+      target[key] = source[key];
+    }
+  }
+
+  // For IE the for-in-loop does not contain any properties that are not
+  // enumerable on the prototype object (for example isPrototypeOf from
+  // Object.prototype) and it will also not include 'replace' on objects that
+  // extend String and change 'replace' (not that it is common for anyone to
+  // extend anything except Object).
+  for (var i = 0; i < goog.defineClass.OBJECT_PROTOTYPE_FIELDS_.length; i++) {
+    key = goog.defineClass.OBJECT_PROTOTYPE_FIELDS_[i];
+    if (Object.prototype.hasOwnProperty.call(source, key)) {
+      target[key] = source[key];
+    }
+  }
+};
+
+
+/**
+ * Sealing classes breaks the older idiom of assigning properties on the
+ * prototype rather than in the constructor. As such, goog.defineClass
+ * must not seal subclasses of these old-style classes until they are fixed.
+ * Until then, this marks a class as "broken", instructing defineClass
+ * not to seal subclasses.
+ * @param {!Function} ctr The legacy constructor to tag as unsealable.
+ */
+goog.tagUnsealableClass = function(ctr) {
+  if (!COMPILED && goog.defineClass.SEAL_CLASS_INSTANCES) {
+    ctr.prototype[goog.UNSEALABLE_CONSTRUCTOR_PROPERTY_] = true;
+  }
+};
+
+
+/**
+ * Name for unsealable tag property.
+ * @const @private {string}
+ */
+goog.UNSEALABLE_CONSTRUCTOR_PROPERTY_ = 'goog_defineClass_legacy_unsealable';
+
+
+/**
+ * Returns a newly created map from language mode string to a boolean
+ * indicating whether transpilation should be done for that mode.
+ *
+ * Guaranteed invariant:
+ * For any two modes, l1 and l2 where l2 is a newer mode than l1,
+ * `map[l1] == true` implies that `map[l2] == true`.
+ * @private
+ * @return {!Object<string, boolean>}
+ */
+goog.createRequiresTranspilation_ = function() {
+  var /** !Object<string, boolean> */ requiresTranspilation = {'es3': false};
+  var transpilationRequiredForAllLaterModes = false;
+
+  /**
+   * Adds an entry to requiresTranspliation for the given language mode.
+   *
+   * IMPORTANT: Calls must be made in order from oldest to newest language
+   * mode.
+   * @param {string} modeName
+   * @param {function(): boolean} isSupported Returns true if the JS engine
+   *     supports the given mode.
+   */
+  function addNewerLanguageTranspilationCheck(modeName, isSupported) {
+    if (transpilationRequiredForAllLaterModes) {
+      requiresTranspilation[modeName] = true;
+    } else if (isSupported()) {
+      requiresTranspilation[modeName] = false;
+    } else {
+      requiresTranspilation[modeName] = true;
+      transpilationRequiredForAllLaterModes = true;
+    }
+  }
+
+  /**
+   * Does the given code evaluate without syntax errors and return a truthy
+   * result?
+   */
+  function /** boolean */ evalCheck(/** string */ code) {
+    try {
+      return !!eval(code);
+    } catch (ignored) {
+      return false;
+    }
+  }
+
+  var userAgent = goog.global.navigator && goog.global.navigator.userAgent ?
+      goog.global.navigator.userAgent :
+      '';
+
+  // Identify ES3-only browsers by their incorrect treatment of commas.
+  addNewerLanguageTranspilationCheck('es5', function() {
+    return evalCheck('[1,].length==1');
+  });
+  addNewerLanguageTranspilationCheck('es6', function() {
+    // Edge has a non-deterministic (i.e., not reproducible) bug with ES6:
+    // https://github.com/Microsoft/ChakraCore/issues/1496.
+    var re = /Edge\/(\d+)(\.\d)*/i;
+    var edgeUserAgent = userAgent.match(re);
+    if (edgeUserAgent && Number(edgeUserAgent[1]) < 15) {
+      return false;
+    }
+    // Test es6: [FF50 (?), Edge 14 (?), Chrome 50]
+    //   (a) default params (specifically shadowing locals),
+    //   (b) destructuring, (c) block-scoped functions,
+    //   (d) for-of (const), (e) new.target/Reflect.construct
+    var es6fullTest =
+        'class X{constructor(){if(new.target!=String)throw 1;this.x=42}}' +
+        'let q=Reflect.construct(X,[],String);if(q.x!=42||!(q instanceof ' +
+        'String))throw 1;for(const a of[2,3]){if(a==2)continue;function ' +
+        'f(z={a}){let a=0;return z.a}{function f(){return 0;}}return f()' +
+        '==3}';
+
+    return evalCheck('(()=>{"use strict";' + es6fullTest + '})()');
+  });
+  // TODO(joeltine): Remove es6-impl references for b/31340605.
+  // Consider es6-impl (widely-implemented es6 features) to be supported
+  // whenever es6 is supported. Technically es6-impl is a lower level of
+  // support than es6, but we don't have tests specifically for it.
+  addNewerLanguageTranspilationCheck('es6-impl', function() {
+    return true;
+  });
+  // ** and **= are the only new features in 'es7'
+  addNewerLanguageTranspilationCheck('es7', function() {
+    return evalCheck('2 ** 2 == 4');
+  });
+  // async functions are the only new features in 'es8'
+  addNewerLanguageTranspilationCheck('es8', function() {
+    return evalCheck('async () => 1, true');
+  });
+  return requiresTranspilation;
+};
diff --git a/js/goog/debug/entrypointregistry.js b/js/goog/debug/entrypointregistry.js
new file mode 100644
index 0000000..336e146
--- /dev/null
+++ b/js/goog/debug/entrypointregistry.js
@@ -0,0 +1,159 @@
+// Copyright 2010 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview A global registry for entry points into a program,
+ * so that they can be instrumented. Each module should register their
+ * entry points with this registry. Designed to be compiled out
+ * if no instrumentation is requested.
+ *
+ * Entry points may be registered before or after a call to
+ * goog.debug.entryPointRegistry.monitorAll. If an entry point is registered
+ * later, the existing monitor will instrument the new entry point.
+ *
+ * @author nicksantos@google.com (Nick Santos)
+ */
+
+goog.provide('goog.debug.EntryPointMonitor');
+goog.provide('goog.debug.entryPointRegistry');
+
+goog.require('goog.asserts');
+
+
+
+/**
+ * @interface
+ */
+goog.debug.EntryPointMonitor = function() {};
+
+
+/**
+ * Instruments a function.
+ *
+ * @param {!Function} fn A function to instrument.
+ * @return {!Function} The instrumented function.
+ */
+goog.debug.EntryPointMonitor.prototype.wrap;
+
+
+/**
+ * Try to remove an instrumentation wrapper created by this monitor.
+ * If the function passed to unwrap is not a wrapper created by this
+ * monitor, then we will do nothing.
+ *
+ * Notice that some wrappers may not be unwrappable. For example, if other
+ * monitors have applied their own wrappers, then it will be impossible to
+ * unwrap them because their wrappers will have captured our wrapper.
+ *
+ * So it is important that entry points are unwrapped in the reverse
+ * order that they were wrapped.
+ *
+ * @param {!Function} fn A function to unwrap.
+ * @return {!Function} The unwrapped function, or {@code fn} if it was not
+ *     a wrapped function created by this monitor.
+ */
+goog.debug.EntryPointMonitor.prototype.unwrap;
+
+
+/**
+ * An array of entry point callbacks.
+ * @type {!Array<function(!Function)>}
+ * @private
+ */
+goog.debug.entryPointRegistry.refList_ = [];
+
+
+/**
+ * Monitors that should wrap all the entry points.
+ * @type {!Array<!goog.debug.EntryPointMonitor>}
+ * @private
+ */
+goog.debug.entryPointRegistry.monitors_ = [];
+
+
+/**
+ * Whether goog.debug.entryPointRegistry.monitorAll has ever been called.
+ * Checking this allows the compiler to optimize out the registrations.
+ * @type {boolean}
+ * @private
+ */
+goog.debug.entryPointRegistry.monitorsMayExist_ = false;
+
+
+/**
+ * Register an entry point with this module.
+ *
+ * The entry point will be instrumented when a monitor is passed to
+ * goog.debug.entryPointRegistry.monitorAll. If this has already occurred, the
+ * entry point is instrumented immediately.
+ *
+ * @param {function(!Function)} callback A callback function which is called
+ *     with a transforming function to instrument the entry point. The callback
+ *     is responsible for wrapping the relevant entry point with the
+ *     transforming function.
+ */
+goog.debug.entryPointRegistry.register = function(callback) {
+  // Don't use push(), so that this can be compiled out.
+  goog.debug.entryPointRegistry
+      .refList_[goog.debug.entryPointRegistry.refList_.length] = callback;
+  // If no one calls monitorAll, this can be compiled out.
+  if (goog.debug.entryPointRegistry.monitorsMayExist_) {
+    var monitors = goog.debug.entryPointRegistry.monitors_;
+    for (var i = 0; i < monitors.length; i++) {
+      callback(goog.bind(monitors[i].wrap, monitors[i]));
+    }
+  }
+};
+
+
+/**
+ * Configures a monitor to wrap all entry points.
+ *
+ * Entry points that have already been registered are immediately wrapped by
+ * the monitor. When an entry point is registered in the future, it will also
+ * be wrapped by the monitor when it is registered.
+ *
+ * @param {!goog.debug.EntryPointMonitor} monitor An entry point monitor.
+ */
+goog.debug.entryPointRegistry.monitorAll = function(monitor) {
+  goog.debug.entryPointRegistry.monitorsMayExist_ = true;
+  var transformer = goog.bind(monitor.wrap, monitor);
+  for (var i = 0; i < goog.debug.entryPointRegistry.refList_.length; i++) {
+    goog.debug.entryPointRegistry.refList_[i](transformer);
+  }
+  goog.debug.entryPointRegistry.monitors_.push(monitor);
+};
+
+
+/**
+ * Try to unmonitor all the entry points that have already been registered. If
+ * an entry point is registered in the future, it will not be wrapped by the
+ * monitor when it is registered. Note that this may fail if the entry points
+ * have additional wrapping.
+ *
+ * @param {!goog.debug.EntryPointMonitor} monitor The last monitor to wrap
+ *     the entry points.
+ * @throws {Error} If the monitor is not the most recently configured monitor.
+ */
+goog.debug.entryPointRegistry.unmonitorAllIfPossible = function(monitor) {
+  var monitors = goog.debug.entryPointRegistry.monitors_;
+  goog.asserts.assert(
+      monitor == monitors[monitors.length - 1],
+      'Only the most recent monitor can be unwrapped.');
+  var transformer = goog.bind(monitor.unwrap, monitor);
+  for (var i = 0; i < goog.debug.entryPointRegistry.refList_.length; i++) {
+    goog.debug.entryPointRegistry.refList_[i](transformer);
+  }
+  monitors.length--;
+};
diff --git a/js/goog/debug/error.js b/js/goog/debug/error.js
new file mode 100644
index 0000000..5f1bd3e
--- /dev/null
+++ b/js/goog/debug/error.js
@@ -0,0 +1,63 @@
+// Copyright 2009 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Provides a base class for custom Error objects such that the
+ * stack is correctly maintained.
+ *
+ * You should never need to throw goog.debug.Error(msg) directly, Error(msg) is
+ * sufficient.
+ *
+ */
+
+goog.provide('goog.debug.Error');
+
+
+
+/**
+ * Base class for custom error objects.
+ * @param {*=} opt_msg The message associated with the error.
+ * @constructor
+ * @extends {Error}
+ */
+goog.debug.Error = function(opt_msg) {
+
+  // Attempt to ensure there is a stack trace.
+  if (Error.captureStackTrace) {
+    Error.captureStackTrace(this, goog.debug.Error);
+  } else {
+    var stack = new Error().stack;
+    if (stack) {
+      this.stack = stack;
+    }
+  }
+
+  if (opt_msg) {
+    this.message = String(opt_msg);
+  }
+
+  /**
+   * Whether to report this error to the server. Setting this to false will
+   * cause the error reporter to not report the error back to the server,
+   * which can be useful if the client knows that the error has already been
+   * logged on the server.
+   * @type {boolean}
+   */
+  this.reportErrorToServer = true;
+};
+goog.inherits(goog.debug.Error, Error);
+
+
+/** @override */
+goog.debug.Error.prototype.name = 'CustomError';
diff --git a/js/goog/dom/htmlelement.js b/js/goog/dom/htmlelement.js
new file mode 100644
index 0000000..c48f753
--- /dev/null
+++ b/js/goog/dom/htmlelement.js
@@ -0,0 +1,29 @@
+// Copyright 2017 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+goog.provide('goog.dom.HtmlElement');
+
+
+
+/**
+ * This subclass of HTMLElement is used when only a HTMLElement is possible and
+ * not any of its subclasses. Normally, a type can refer to an instance of
+ * itself or an instance of any subtype. More concretely, if HTMLElement is used
+ * then the compiler must assume that it might still be e.g. HTMLScriptElement.
+ * With this, the type check knows that it couldn't be any special element.
+ *
+ * @constructor
+ * @extends {HTMLElement}
+ */
+goog.dom.HtmlElement = function() {};
diff --git a/js/goog/dom/nodetype.js b/js/goog/dom/nodetype.js
new file mode 100644
index 0000000..cccb470
--- /dev/null
+++ b/js/goog/dom/nodetype.js
@@ -0,0 +1,48 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Definition of goog.dom.NodeType.
+ */
+
+goog.provide('goog.dom.NodeType');
+
+
+/**
+ * Constants for the nodeType attribute in the Node interface.
+ *
+ * These constants match those specified in the Node interface. These are
+ * usually present on the Node object in recent browsers, but not in older
+ * browsers (specifically, early IEs) and thus are given here.
+ *
+ * In some browsers (early IEs), these are not defined on the Node object,
+ * so they are provided here.
+ *
+ * See http://www.w3.org/TR/DOM-Level-2-Core/core.html#ID-1950641247
+ * @enum {number}
+ */
+goog.dom.NodeType = {
+  ELEMENT: 1,
+  ATTRIBUTE: 2,
+  TEXT: 3,
+  CDATA_SECTION: 4,
+  ENTITY_REFERENCE: 5,
+  ENTITY: 6,
+  PROCESSING_INSTRUCTION: 7,
+  COMMENT: 8,
+  DOCUMENT: 9,
+  DOCUMENT_TYPE: 10,
+  DOCUMENT_FRAGMENT: 11,
+  NOTATION: 12
+};
diff --git a/js/goog/dom/tagname.js b/js/goog/dom/tagname.js
new file mode 100644
index 0000000..b3808ad
--- /dev/null
+++ b/js/goog/dom/tagname.js
@@ -0,0 +1,562 @@
+// Copyright 2007 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Defines the goog.dom.TagName class. Its constants enumerate
+ * all HTML tag names specified in either the the W3C HTML 4.01 index of
+ * elements or the HTML5 draft specification.
+ *
+ * References:
+ * http://www.w3.org/TR/html401/index/elements.html
+ * http://dev.w3.org/html5/spec/section-index.html
+ */
+goog.provide('goog.dom.TagName');
+
+goog.require('goog.dom.HtmlElement');
+
+
+/**
+ * A tag name with the type of the element stored in the generic.
+ * @param {string} tagName
+ * @constructor
+ * @template T
+ */
+goog.dom.TagName = function(tagName) {
+  /** @private {string} */
+  this.tagName_ = tagName;
+};
+
+
+/**
+ * Returns the tag name.
+ * @return {string}
+ * @override
+ */
+goog.dom.TagName.prototype.toString = function() {
+  return this.tagName_;
+};
+
+
+// Closure Compiler unconditionally converts the following constants to their
+// string value (goog.dom.TagName.A -> 'A'). These are the consequences:
+// 1. Don't add any members or static members to goog.dom.TagName as they
+//    couldn't be accessed after this optimization.
+// 2. Keep the constant name and its string value the same:
+//    goog.dom.TagName.X = new goog.dom.TagName('Y');
+//    is converted to 'X', not 'Y'.
+
+
+/** @type {!goog.dom.TagName<!HTMLAnchorElement>} */
+goog.dom.TagName.A = new goog.dom.TagName('A');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.ABBR = new goog.dom.TagName('ABBR');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.ACRONYM = new goog.dom.TagName('ACRONYM');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.ADDRESS = new goog.dom.TagName('ADDRESS');
+
+
+/** @type {!goog.dom.TagName<!HTMLAppletElement>} */
+goog.dom.TagName.APPLET = new goog.dom.TagName('APPLET');
+
+
+/** @type {!goog.dom.TagName<!HTMLAreaElement>} */
+goog.dom.TagName.AREA = new goog.dom.TagName('AREA');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.ARTICLE = new goog.dom.TagName('ARTICLE');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.ASIDE = new goog.dom.TagName('ASIDE');
+
+
+/** @type {!goog.dom.TagName<!HTMLAudioElement>} */
+goog.dom.TagName.AUDIO = new goog.dom.TagName('AUDIO');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.B = new goog.dom.TagName('B');
+
+
+/** @type {!goog.dom.TagName<!HTMLBaseElement>} */
+goog.dom.TagName.BASE = new goog.dom.TagName('BASE');
+
+
+/** @type {!goog.dom.TagName<!HTMLBaseFontElement>} */
+goog.dom.TagName.BASEFONT = new goog.dom.TagName('BASEFONT');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.BDI = new goog.dom.TagName('BDI');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.BDO = new goog.dom.TagName('BDO');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.BIG = new goog.dom.TagName('BIG');
+
+
+/** @type {!goog.dom.TagName<!HTMLQuoteElement>} */
+goog.dom.TagName.BLOCKQUOTE = new goog.dom.TagName('BLOCKQUOTE');
+
+
+/** @type {!goog.dom.TagName<!HTMLBodyElement>} */
+goog.dom.TagName.BODY = new goog.dom.TagName('BODY');
+
+
+/** @type {!goog.dom.TagName<!HTMLBRElement>} */
+goog.dom.TagName.BR = new goog.dom.TagName('BR');
+
+
+/** @type {!goog.dom.TagName<!HTMLButtonElement>} */
+goog.dom.TagName.BUTTON = new goog.dom.TagName('BUTTON');
+
+
+/** @type {!goog.dom.TagName<!HTMLCanvasElement>} */
+goog.dom.TagName.CANVAS = new goog.dom.TagName('CANVAS');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableCaptionElement>} */
+goog.dom.TagName.CAPTION = new goog.dom.TagName('CAPTION');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.CENTER = new goog.dom.TagName('CENTER');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.CITE = new goog.dom.TagName('CITE');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.CODE = new goog.dom.TagName('CODE');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableColElement>} */
+goog.dom.TagName.COL = new goog.dom.TagName('COL');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableColElement>} */
+goog.dom.TagName.COLGROUP = new goog.dom.TagName('COLGROUP');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.COMMAND = new goog.dom.TagName('COMMAND');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.DATA = new goog.dom.TagName('DATA');
+
+
+/** @type {!goog.dom.TagName<!HTMLDataListElement>} */
+goog.dom.TagName.DATALIST = new goog.dom.TagName('DATALIST');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.DD = new goog.dom.TagName('DD');
+
+
+/** @type {!goog.dom.TagName<!HTMLModElement>} */
+goog.dom.TagName.DEL = new goog.dom.TagName('DEL');
+
+
+/** @type {!goog.dom.TagName<!HTMLDetailsElement>} */
+goog.dom.TagName.DETAILS = new goog.dom.TagName('DETAILS');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.DFN = new goog.dom.TagName('DFN');
+
+
+/** @type {!goog.dom.TagName<!HTMLDialogElement>} */
+goog.dom.TagName.DIALOG = new goog.dom.TagName('DIALOG');
+
+
+/** @type {!goog.dom.TagName<!HTMLDirectoryElement>} */
+goog.dom.TagName.DIR = new goog.dom.TagName('DIR');
+
+
+/** @type {!goog.dom.TagName<!HTMLDivElement>} */
+goog.dom.TagName.DIV = new goog.dom.TagName('DIV');
+
+
+/** @type {!goog.dom.TagName<!HTMLDListElement>} */
+goog.dom.TagName.DL = new goog.dom.TagName('DL');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.DT = new goog.dom.TagName('DT');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.EM = new goog.dom.TagName('EM');
+
+
+/** @type {!goog.dom.TagName<!HTMLEmbedElement>} */
+goog.dom.TagName.EMBED = new goog.dom.TagName('EMBED');
+
+
+/** @type {!goog.dom.TagName<!HTMLFieldSetElement>} */
+goog.dom.TagName.FIELDSET = new goog.dom.TagName('FIELDSET');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.FIGCAPTION = new goog.dom.TagName('FIGCAPTION');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.FIGURE = new goog.dom.TagName('FIGURE');
+
+
+/** @type {!goog.dom.TagName<!HTMLFontElement>} */
+goog.dom.TagName.FONT = new goog.dom.TagName('FONT');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.FOOTER = new goog.dom.TagName('FOOTER');
+
+
+/** @type {!goog.dom.TagName<!HTMLFormElement>} */
+goog.dom.TagName.FORM = new goog.dom.TagName('FORM');
+
+
+/** @type {!goog.dom.TagName<!HTMLFrameElement>} */
+goog.dom.TagName.FRAME = new goog.dom.TagName('FRAME');
+
+
+/** @type {!goog.dom.TagName<!HTMLFrameSetElement>} */
+goog.dom.TagName.FRAMESET = new goog.dom.TagName('FRAMESET');
+
+
+/** @type {!goog.dom.TagName<!HTMLHeadingElement>} */
+goog.dom.TagName.H1 = new goog.dom.TagName('H1');
+
+
+/** @type {!goog.dom.TagName<!HTMLHeadingElement>} */
+goog.dom.TagName.H2 = new goog.dom.TagName('H2');
+
+
+/** @type {!goog.dom.TagName<!HTMLHeadingElement>} */
+goog.dom.TagName.H3 = new goog.dom.TagName('H3');
+
+
+/** @type {!goog.dom.TagName<!HTMLHeadingElement>} */
+goog.dom.TagName.H4 = new goog.dom.TagName('H4');
+
+
+/** @type {!goog.dom.TagName<!HTMLHeadingElement>} */
+goog.dom.TagName.H5 = new goog.dom.TagName('H5');
+
+
+/** @type {!goog.dom.TagName<!HTMLHeadingElement>} */
+goog.dom.TagName.H6 = new goog.dom.TagName('H6');
+
+
+/** @type {!goog.dom.TagName<!HTMLHeadElement>} */
+goog.dom.TagName.HEAD = new goog.dom.TagName('HEAD');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.HEADER = new goog.dom.TagName('HEADER');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.HGROUP = new goog.dom.TagName('HGROUP');
+
+
+/** @type {!goog.dom.TagName<!HTMLHRElement>} */
+goog.dom.TagName.HR = new goog.dom.TagName('HR');
+
+
+/** @type {!goog.dom.TagName<!HTMLHtmlElement>} */
+goog.dom.TagName.HTML = new goog.dom.TagName('HTML');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.I = new goog.dom.TagName('I');
+
+
+/** @type {!goog.dom.TagName<!HTMLIFrameElement>} */
+goog.dom.TagName.IFRAME = new goog.dom.TagName('IFRAME');
+
+
+/** @type {!goog.dom.TagName<!HTMLImageElement>} */
+goog.dom.TagName.IMG = new goog.dom.TagName('IMG');
+
+
+/** @type {!goog.dom.TagName<!HTMLInputElement>} */
+goog.dom.TagName.INPUT = new goog.dom.TagName('INPUT');
+
+
+/** @type {!goog.dom.TagName<!HTMLModElement>} */
+goog.dom.TagName.INS = new goog.dom.TagName('INS');
+
+
+/** @type {!goog.dom.TagName<!HTMLIsIndexElement>} */
+goog.dom.TagName.ISINDEX = new goog.dom.TagName('ISINDEX');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.KBD = new goog.dom.TagName('KBD');
+
+
+// HTMLKeygenElement is deprecated.
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.KEYGEN = new goog.dom.TagName('KEYGEN');
+
+
+/** @type {!goog.dom.TagName<!HTMLLabelElement>} */
+goog.dom.TagName.LABEL = new goog.dom.TagName('LABEL');
+
+
+/** @type {!goog.dom.TagName<!HTMLLegendElement>} */
+goog.dom.TagName.LEGEND = new goog.dom.TagName('LEGEND');
+
+
+/** @type {!goog.dom.TagName<!HTMLLIElement>} */
+goog.dom.TagName.LI = new goog.dom.TagName('LI');
+
+
+/** @type {!goog.dom.TagName<!HTMLLinkElement>} */
+goog.dom.TagName.LINK = new goog.dom.TagName('LINK');
+
+
+/** @type {!goog.dom.TagName<!HTMLMapElement>} */
+goog.dom.TagName.MAP = new goog.dom.TagName('MAP');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.MARK = new goog.dom.TagName('MARK');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.MATH = new goog.dom.TagName('MATH');
+
+
+/** @type {!goog.dom.TagName<!HTMLMenuElement>} */
+goog.dom.TagName.MENU = new goog.dom.TagName('MENU');
+
+
+/** @type {!goog.dom.TagName<!HTMLMetaElement>} */
+goog.dom.TagName.META = new goog.dom.TagName('META');
+
+
+/** @type {!goog.dom.TagName<!HTMLMeterElement>} */
+goog.dom.TagName.METER = new goog.dom.TagName('METER');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.NAV = new goog.dom.TagName('NAV');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.NOFRAMES = new goog.dom.TagName('NOFRAMES');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.NOSCRIPT = new goog.dom.TagName('NOSCRIPT');
+
+
+/** @type {!goog.dom.TagName<!HTMLObjectElement>} */
+goog.dom.TagName.OBJECT = new goog.dom.TagName('OBJECT');
+
+
+/** @type {!goog.dom.TagName<!HTMLOListElement>} */
+goog.dom.TagName.OL = new goog.dom.TagName('OL');
+
+
+/** @type {!goog.dom.TagName<!HTMLOptGroupElement>} */
+goog.dom.TagName.OPTGROUP = new goog.dom.TagName('OPTGROUP');
+
+
+/** @type {!goog.dom.TagName<!HTMLOptionElement>} */
+goog.dom.TagName.OPTION = new goog.dom.TagName('OPTION');
+
+
+/** @type {!goog.dom.TagName<!HTMLOutputElement>} */
+goog.dom.TagName.OUTPUT = new goog.dom.TagName('OUTPUT');
+
+
+/** @type {!goog.dom.TagName<!HTMLParagraphElement>} */
+goog.dom.TagName.P = new goog.dom.TagName('P');
+
+
+/** @type {!goog.dom.TagName<!HTMLParamElement>} */
+goog.dom.TagName.PARAM = new goog.dom.TagName('PARAM');
+
+
+/** @type {!goog.dom.TagName<!HTMLPreElement>} */
+goog.dom.TagName.PRE = new goog.dom.TagName('PRE');
+
+
+/** @type {!goog.dom.TagName<!HTMLProgressElement>} */
+goog.dom.TagName.PROGRESS = new goog.dom.TagName('PROGRESS');
+
+
+/** @type {!goog.dom.TagName<!HTMLQuoteElement>} */
+goog.dom.TagName.Q = new goog.dom.TagName('Q');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.RP = new goog.dom.TagName('RP');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.RT = new goog.dom.TagName('RT');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.RUBY = new goog.dom.TagName('RUBY');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.S = new goog.dom.TagName('S');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.SAMP = new goog.dom.TagName('SAMP');
+
+
+/** @type {!goog.dom.TagName<!HTMLScriptElement>} */
+goog.dom.TagName.SCRIPT = new goog.dom.TagName('SCRIPT');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.SECTION = new goog.dom.TagName('SECTION');
+
+
+/** @type {!goog.dom.TagName<!HTMLSelectElement>} */
+goog.dom.TagName.SELECT = new goog.dom.TagName('SELECT');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.SMALL = new goog.dom.TagName('SMALL');
+
+
+/** @type {!goog.dom.TagName<!HTMLSourceElement>} */
+goog.dom.TagName.SOURCE = new goog.dom.TagName('SOURCE');
+
+
+/** @type {!goog.dom.TagName<!HTMLSpanElement>} */
+goog.dom.TagName.SPAN = new goog.dom.TagName('SPAN');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.STRIKE = new goog.dom.TagName('STRIKE');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.STRONG = new goog.dom.TagName('STRONG');
+
+
+/** @type {!goog.dom.TagName<!HTMLStyleElement>} */
+goog.dom.TagName.STYLE = new goog.dom.TagName('STYLE');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.SUB = new goog.dom.TagName('SUB');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.SUMMARY = new goog.dom.TagName('SUMMARY');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.SUP = new goog.dom.TagName('SUP');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.SVG = new goog.dom.TagName('SVG');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableElement>} */
+goog.dom.TagName.TABLE = new goog.dom.TagName('TABLE');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableSectionElement>} */
+goog.dom.TagName.TBODY = new goog.dom.TagName('TBODY');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableCellElement>} */
+goog.dom.TagName.TD = new goog.dom.TagName('TD');
+
+
+/** @type {!goog.dom.TagName<!HTMLTemplateElement>} */
+goog.dom.TagName.TEMPLATE = new goog.dom.TagName('TEMPLATE');
+
+
+/** @type {!goog.dom.TagName<!HTMLTextAreaElement>} */
+goog.dom.TagName.TEXTAREA = new goog.dom.TagName('TEXTAREA');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableSectionElement>} */
+goog.dom.TagName.TFOOT = new goog.dom.TagName('TFOOT');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableCellElement>} */
+goog.dom.TagName.TH = new goog.dom.TagName('TH');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableSectionElement>} */
+goog.dom.TagName.THEAD = new goog.dom.TagName('THEAD');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.TIME = new goog.dom.TagName('TIME');
+
+
+/** @type {!goog.dom.TagName<!HTMLTitleElement>} */
+goog.dom.TagName.TITLE = new goog.dom.TagName('TITLE');
+
+
+/** @type {!goog.dom.TagName<!HTMLTableRowElement>} */
+goog.dom.TagName.TR = new goog.dom.TagName('TR');
+
+
+/** @type {!goog.dom.TagName<!HTMLTrackElement>} */
+goog.dom.TagName.TRACK = new goog.dom.TagName('TRACK');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.TT = new goog.dom.TagName('TT');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.U = new goog.dom.TagName('U');
+
+
+/** @type {!goog.dom.TagName<!HTMLUListElement>} */
+goog.dom.TagName.UL = new goog.dom.TagName('UL');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.VAR = new goog.dom.TagName('VAR');
+
+
+/** @type {!goog.dom.TagName<!HTMLVideoElement>} */
+goog.dom.TagName.VIDEO = new goog.dom.TagName('VIDEO');
+
+
+/** @type {!goog.dom.TagName<!goog.dom.HtmlElement>} */
+goog.dom.TagName.WBR = new goog.dom.TagName('WBR');
diff --git a/js/goog/functions/functions.js b/js/goog/functions/functions.js
new file mode 100644
index 0000000..61849e9
--- /dev/null
+++ b/js/goog/functions/functions.js
@@ -0,0 +1,483 @@
+// Copyright 2008 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Utilities for creating functions. Loosely inspired by the
+ * java classes: http://goo.gl/GM0Hmu and http://goo.gl/6k7nI8.
+ *
+ * @author nicksantos@google.com (Nick Santos)
+ */
+
+
+goog.provide('goog.functions');
+
+
+/**
+ * Creates a function that always returns the same value.
+ * @param {T} retValue The value to return.
+ * @return {function():T} The new function.
+ * @template T
+ */
+goog.functions.constant = function(retValue) {
+  return function() { return retValue; };
+};
+
+
+/**
+ * Always returns false.
+ * @type {function(...): boolean}
+ */
+goog.functions.FALSE = goog.functions.constant(false);
+
+
+/**
+ * Always returns true.
+ * @type {function(...): boolean}
+ */
+goog.functions.TRUE = goog.functions.constant(true);
+
+
+/**
+ * Always returns NULL.
+ * @type {function(...): null}
+ */
+goog.functions.NULL = goog.functions.constant(null);
+
+
+/**
+ * A simple function that returns the first argument of whatever is passed
+ * into it.
+ * @param {T=} opt_returnValue The single value that will be returned.
+ * @param {...*} var_args Optional trailing arguments. These are ignored.
+ * @return {T} The first argument passed in, or undefined if nothing was passed.
+ * @template T
+ */
+goog.functions.identity = function(opt_returnValue, var_args) {
+  return opt_returnValue;
+};
+
+
+/**
+ * Creates a function that always throws an error with the given message.
+ * @param {string} message The error message.
+ * @return {!Function} The error-throwing function.
+ */
+goog.functions.error = function(message) {
+  return function() { throw Error(message); };
+};
+
+
+/**
+ * Creates a function that throws the given object.
+ * @param {*} err An object to be thrown.
+ * @return {!Function} The error-throwing function.
+ */
+goog.functions.fail = function(err) {
+  return function() { throw err; };
+};
+
+
+/**
+ * Given a function, create a function that keeps opt_numArgs arguments and
+ * silently discards all additional arguments.
+ * @param {Function} f The original function.
+ * @param {number=} opt_numArgs The number of arguments to keep. Defaults to 0.
+ * @return {!Function} A version of f that only keeps the first opt_numArgs
+ *     arguments.
+ */
+goog.functions.lock = function(f, opt_numArgs) {
+  opt_numArgs = opt_numArgs || 0;
+  return function() {
+    return f.apply(this, Array.prototype.slice.call(arguments, 0, opt_numArgs));
+  };
+};
+
+
+/**
+ * Creates a function that returns its nth argument.
+ * @param {number} n The position of the return argument.
+ * @return {!Function} A new function.
+ */
+goog.functions.nth = function(n) {
+  return function() { return arguments[n]; };
+};
+
+
+/**
+ * Like goog.partial(), except that arguments are added after arguments to the
+ * returned function.
+ *
+ * Usage:
+ * function f(arg1, arg2, arg3, arg4) { ... }
+ * var g = goog.functions.partialRight(f, arg3, arg4);
+ * g(arg1, arg2);
+ *
+ * @param {!Function} fn A function to partially apply.
+ * @param {...*} var_args Additional arguments that are partially applied to fn
+ *     at the end.
+ * @return {!Function} A partially-applied form of the function goog.partial()
+ *     was invoked as a method of.
+ */
+goog.functions.partialRight = function(fn, var_args) {
+  var rightArgs = Array.prototype.slice.call(arguments, 1);
+  return function() {
+    var newArgs = Array.prototype.slice.call(arguments);
+    newArgs.push.apply(newArgs, rightArgs);
+    return fn.apply(this, newArgs);
+  };
+};
+
+
+/**
+ * Given a function, create a new function that swallows its return value
+ * and replaces it with a new one.
+ * @param {Function} f A function.
+ * @param {T} retValue A new return value.
+ * @return {function(...?):T} A new function.
+ * @template T
+ */
+goog.functions.withReturnValue = function(f, retValue) {
+  return goog.functions.sequence(f, goog.functions.constant(retValue));
+};
+
+
+/**
+ * Creates a function that returns whether its argument equals the given value.
+ *
+ * Example:
+ * var key = goog.object.findKey(obj, goog.functions.equalTo('needle'));
+ *
+ * @param {*} value The value to compare to.
+ * @param {boolean=} opt_useLooseComparison Whether to use a loose (==)
+ *     comparison rather than a strict (===) one. Defaults to false.
+ * @return {function(*):boolean} The new function.
+ */
+goog.functions.equalTo = function(value, opt_useLooseComparison) {
+  return function(other) {
+    return opt_useLooseComparison ? (value == other) : (value === other);
+  };
+};
+
+
+/**
+ * Creates the composition of the functions passed in.
+ * For example, (goog.functions.compose(f, g))(a) is equivalent to f(g(a)).
+ * @param {function(...?):T} fn The final function.
+ * @param {...Function} var_args A list of functions.
+ * @return {function(...?):T} The composition of all inputs.
+ * @template T
+ */
+goog.functions.compose = function(fn, var_args) {
+  var functions = arguments;
+  var length = functions.length;
+  return function() {
+    var result;
+    if (length) {
+      result = functions[length - 1].apply(this, arguments);
+    }
+
+    for (var i = length - 2; i >= 0; i--) {
+      result = functions[i].call(this, result);
+    }
+    return result;
+  };
+};
+
+
+/**
+ * Creates a function that calls the functions passed in in sequence, and
+ * returns the value of the last function. For example,
+ * (goog.functions.sequence(f, g))(x) is equivalent to f(x),g(x).
+ * @param {...Function} var_args A list of functions.
+ * @return {!Function} A function that calls all inputs in sequence.
+ */
+goog.functions.sequence = function(var_args) {
+  var functions = arguments;
+  var length = functions.length;
+  return function() {
+    var result;
+    for (var i = 0; i < length; i++) {
+      result = functions[i].apply(this, arguments);
+    }
+    return result;
+  };
+};
+
+
+/**
+ * Creates a function that returns true if each of its components evaluates
+ * to true. The components are evaluated in order, and the evaluation will be
+ * short-circuited as soon as a function returns false.
+ * For example, (goog.functions.and(f, g))(x) is equivalent to f(x) && g(x).
+ * @param {...Function} var_args A list of functions.
+ * @return {function(...?):boolean} A function that ANDs its component
+ *      functions.
+ */
+goog.functions.and = function(var_args) {
+  var functions = arguments;
+  var length = functions.length;
+  return function() {
+    for (var i = 0; i < length; i++) {
+      if (!functions[i].apply(this, arguments)) {
+        return false;
+      }
+    }
+    return true;
+  };
+};
+
+
+/**
+ * Creates a function that returns true if any of its components evaluates
+ * to true. The components are evaluated in order, and the evaluation will be
+ * short-circuited as soon as a function returns true.
+ * For example, (goog.functions.or(f, g))(x) is equivalent to f(x) || g(x).
+ * @param {...Function} var_args A list of functions.
+ * @return {function(...?):boolean} A function that ORs its component
+ *    functions.
+ */
+goog.functions.or = function(var_args) {
+  var functions = arguments;
+  var length = functions.length;
+  return function() {
+    for (var i = 0; i < length; i++) {
+      if (functions[i].apply(this, arguments)) {
+        return true;
+      }
+    }
+    return false;
+  };
+};
+
+
+/**
+ * Creates a function that returns the Boolean opposite of a provided function.
+ * For example, (goog.functions.not(f))(x) is equivalent to !f(x).
+ * @param {!Function} f The original function.
+ * @return {function(...?):boolean} A function that delegates to f and returns
+ * opposite.
+ */
+goog.functions.not = function(f) {
+  return function() { return !f.apply(this, arguments); };
+};
+
+
+/**
+ * Generic factory function to construct an object given the constructor
+ * and the arguments. Intended to be bound to create object factories.
+ *
+ * Example:
+ *
+ * var factory = goog.partial(goog.functions.create, Class);
+ *
+ * @param {function(new:T, ...)} constructor The constructor for the Object.
+ * @param {...*} var_args The arguments to be passed to the constructor.
+ * @return {T} A new instance of the class given in {@code constructor}.
+ * @template T
+ */
+goog.functions.create = function(constructor, var_args) {
+  /**
+   * @constructor
+   * @final
+   */
+  var temp = function() {};
+  temp.prototype = constructor.prototype;
+
+  // obj will have constructor's prototype in its chain and
+  // 'obj instanceof constructor' will be true.
+  var obj = new temp();
+
+  // obj is initialized by constructor.
+  // arguments is only array-like so lacks shift(), but can be used with
+  // the Array prototype function.
+  constructor.apply(obj, Array.prototype.slice.call(arguments, 1));
+  return obj;
+};
+
+
+/**
+ * @define {boolean} Whether the return value cache should be used.
+ *    This should only be used to disable caches when testing.
+ */
+goog.define('goog.functions.CACHE_RETURN_VALUE', true);
+
+
+/**
+ * Gives a wrapper function that caches the return value of a parameterless
+ * function when first called.
+ *
+ * When called for the first time, the given function is called and its
+ * return value is cached (thus this is only appropriate for idempotent
+ * functions).  Subsequent calls will return the cached return value. This
+ * allows the evaluation of expensive functions to be delayed until first used.
+ *
+ * To cache the return values of functions with parameters, see goog.memoize.
+ *
+ * @param {function():T} fn A function to lazily evaluate.
+ * @return {function():T} A wrapped version the function.
+ * @template T
+ */
+goog.functions.cacheReturnValue = function(fn) {
+  var called = false;
+  var value;
+
+  return function() {
+    if (!goog.functions.CACHE_RETURN_VALUE) {
+      return fn();
+    }
+
+    if (!called) {
+      value = fn();
+      called = true;
+    }
+
+    return value;
+  };
+};
+
+
+/**
+ * Wraps a function to allow it to be called, at most, once. All
+ * additional calls are no-ops.
+ *
+ * This is particularly useful for initialization functions
+ * that should be called, at most, once.
+ *
+ * @param {function():*} f Function to call.
+ * @return {function():undefined} Wrapped function.
+ */
+goog.functions.once = function(f) {
+  // Keep a reference to the function that we null out when we're done with
+  // it -- that way, the function can be GC'd when we're done with it.
+  var inner = f;
+  return function() {
+    if (inner) {
+      var tmp = inner;
+      inner = null;
+      tmp();
+    }
+  };
+};
+
+
+/**
+ * Wraps a function to allow it to be called, at most, once per interval
+ * (specified in milliseconds). If the wrapper function is called N times within
+ * that interval, only the Nth call will go through.
+ *
+ * This is particularly useful for batching up repeated actions where the
+ * last action should win. This can be used, for example, for refreshing an
+ * autocomplete pop-up every so often rather than updating with every keystroke,
+ * since the final text typed by the user is the one that should produce the
+ * final autocomplete results. For more stateful debouncing with support for
+ * pausing, resuming, and canceling debounced actions, use {@code
+ * goog.async.Debouncer}.
+ *
+ * @param {function(this:SCOPE, ...?)} f Function to call.
+ * @param {number} interval Interval over which to debounce. The function will
+ *     only be called after the full interval has elapsed since the last call.
+ * @param {SCOPE=} opt_scope Object in whose scope to call the function.
+ * @return {function(...?): undefined} Wrapped function.
+ * @template SCOPE
+ */
+goog.functions.debounce = function(f, interval, opt_scope) {
+  var timeout = 0;
+  return /** @type {function(...?)} */ (function(var_args) {
+    goog.global.clearTimeout(timeout);
+    var args = arguments;
+    timeout = goog.global.setTimeout(function() {
+      f.apply(opt_scope, args);
+    }, interval);
+  });
+};
+
+
+/**
+ * Wraps a function to allow it to be called, at most, once per interval
+ * (specified in milliseconds). If the wrapper function is called N times in
+ * that interval, both the 1st and the Nth calls will go through.
+ *
+ * This is particularly useful for limiting repeated user requests where the
+ * the last action should win, but you also don't want to wait until the end of
+ * the interval before sending a request out, as it leads to a perception of
+ * slowness for the user.
+ *
+ * @param {function(this:SCOPE, ...?)} f Function to call.
+ * @param {number} interval Interval over which to throttle. The function can
+ *     only be called once per interval.
+ * @param {SCOPE=} opt_scope Object in whose scope to call the function.
+ * @return {function(...?): undefined} Wrapped function.
+ * @template SCOPE
+ */
+goog.functions.throttle = function(f, interval, opt_scope) {
+  var timeout = 0;
+  var shouldFire = false;
+  var args = [];
+
+  var handleTimeout = function() {
+    timeout = 0;
+    if (shouldFire) {
+      shouldFire = false;
+      fire();
+    }
+  };
+
+  var fire = function() {
+    timeout = goog.global.setTimeout(handleTimeout, interval);
+    f.apply(opt_scope, args);
+  };
+
+  return /** @type {function(...?)} */ (function(var_args) {
+    args = arguments;
+    if (!timeout) {
+      fire();
+    } else {
+      shouldFire = true;
+    }
+  });
+};
+
+
+/**
+ * Wraps a function to allow it to be called, at most, once per interval
+ * (specified in milliseconds). If the wrapper function is called N times within
+ * that interval, only the 1st call will go through.
+ *
+ * This is particularly useful for limiting repeated user requests where the
+ * first request is guaranteed to have all the data required to perform the
+ * final action, so there's no need to wait until the end of the interval before
+ * sending the request out.
+ *
+ * @param {function(this:SCOPE, ...?)} f Function to call.
+ * @param {number} interval Interval over which to rate-limit. The function will
+ *     only be called once per interval, and ignored for the remainer of the
+ *     interval.
+ * @param {SCOPE=} opt_scope Object in whose scope to call the function.
+ * @return {function(...?): undefined} Wrapped function.
+ * @template SCOPE
+ */
+goog.functions.rateLimit = function(f, interval, opt_scope) {
+  var timeout = 0;
+
+  var handleTimeout = function() {
+    timeout = 0;
+  };
+
+  return /** @type {function(...?)} */ (function(var_args) {
+    if (!timeout) {
+      timeout = goog.global.setTimeout(handleTimeout, interval);
+      f.apply(opt_scope, arguments);
+    }
+  });
+};
diff --git a/js/goog/iter/iter.js b/js/goog/iter/iter.js
new file mode 100644
index 0000000..5bbb0bb
--- /dev/null
+++ b/js/goog/iter/iter.js
@@ -0,0 +1,1284 @@
+// Copyright 2007 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Python style iteration utilities.
+ * @author arv@google.com (Erik Arvidsson)
+ */
+
+
+goog.provide('goog.iter');
+goog.provide('goog.iter.Iterable');
+goog.provide('goog.iter.Iterator');
+goog.provide('goog.iter.StopIteration');
+
+goog.require('goog.array');
+goog.require('goog.asserts');
+goog.require('goog.functions');
+goog.require('goog.math');
+
+
+/**
+ * @typedef {goog.iter.Iterator|{length:number}|{__iterator__}}
+ */
+goog.iter.Iterable;
+
+
+/**
+ * Singleton Error object that is used to terminate iterations.
+ * @const {!Error}
+ */
+goog.iter.StopIteration = ('StopIteration' in goog.global) ?
+    // For script engines that support legacy iterators.
+    goog.global['StopIteration'] :
+    {message: 'StopIteration', stack: ''};
+
+
+
+/**
+ * Class/interface for iterators.  An iterator needs to implement a {@code next}
+ * method and it needs to throw a {@code goog.iter.StopIteration} when the
+ * iteration passes beyond the end.  Iterators have no {@code hasNext} method.
+ * It is recommended to always use the helper functions to iterate over the
+ * iterator or in case you are only targeting JavaScript 1.7 for in loops.
+ * @constructor
+ * @template VALUE
+ */
+goog.iter.Iterator = function() {};
+
+
+/**
+ * Returns the next value of the iteration.  This will throw the object
+ * {@see goog.iter#StopIteration} when the iteration passes the end.
+ * @return {VALUE} Any object or value.
+ */
+goog.iter.Iterator.prototype.next = function() {
+  throw goog.iter.StopIteration;
+};
+
+
+/**
+ * Returns the {@code Iterator} object itself.  This is used to implement
+ * the iterator protocol in JavaScript 1.7
+ * @param {boolean=} opt_keys  Whether to return the keys or values. Default is
+ *     to only return the values.  This is being used by the for-in loop (true)
+ *     and the for-each-in loop (false).  Even though the param gives a hint
+ *     about what the iterator will return there is no guarantee that it will
+ *     return the keys when true is passed.
+ * @return {!goog.iter.Iterator<VALUE>} The object itself.
+ */
+goog.iter.Iterator.prototype.__iterator__ = function(opt_keys) {
+  return this;
+};
+
+
+/**
+ * Returns an iterator that knows how to iterate over the values in the object.
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable  If the
+ *     object is an iterator it will be returned as is.  If the object has an
+ *     {@code __iterator__} method that will be called to get the value
+ *     iterator.  If the object is an array-like object we create an iterator
+ *     for that.
+ * @return {!goog.iter.Iterator<VALUE>} An iterator that knows how to iterate
+ *     over the values in {@code iterable}.
+ * @template VALUE
+ */
+goog.iter.toIterator = function(iterable) {
+  if (iterable instanceof goog.iter.Iterator) {
+    return iterable;
+  }
+  if (typeof iterable.__iterator__ == 'function') {
+    return iterable.__iterator__(false);
+  }
+  if (goog.isArrayLike(iterable)) {
+    var i = 0;
+    var newIter = new goog.iter.Iterator;
+    newIter.next = function() {
+      while (true) {
+        if (i >= iterable.length) {
+          throw goog.iter.StopIteration;
+        }
+        // Don't include deleted elements.
+        if (!(i in iterable)) {
+          i++;
+          continue;
+        }
+        return iterable[i++];
+      }
+    };
+    return newIter;
+  }
+
+
+  // TODO(arv): Should we fall back on goog.structs.getValues()?
+  throw Error('Not implemented');
+};
+
+
+/**
+ * Calls a function for each element in the iterator with the element of the
+ * iterator passed as argument.
+ *
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable  The iterator
+ *     to iterate over. If the iterable is an object {@code toIterator} will be
+ *     called on it.
+ * @param {function(this:THIS,VALUE,?,!goog.iter.Iterator<VALUE>)} f
+ *     The function to call for every element.  This function takes 3 arguments
+ *     (the element, undefined, and the iterator) and the return value is
+ *     irrelevant.  The reason for passing undefined as the second argument is
+ *     so that the same function can be used in {@see goog.array#forEach} as
+ *     well as others.  The third parameter is of type "number" for
+ *     arraylike objects, undefined, otherwise.
+ * @param {THIS=} opt_obj  The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @template THIS, VALUE
+ */
+goog.iter.forEach = function(iterable, f, opt_obj) {
+  if (goog.isArrayLike(iterable)) {
+
+    try {
+      // NOTES: this passes the index number to the second parameter
+      // of the callback contrary to the documentation above.
+      goog.array.forEach(
+          /** @type {IArrayLike<?>} */ (iterable), f, opt_obj);
+    } catch (ex) {
+      if (ex !== goog.iter.StopIteration) {
+        throw ex;
+      }
+    }
+  } else {
+    iterable = goog.iter.toIterator(iterable);
+
+    try {
+      while (true) {
+        f.call(opt_obj, iterable.next(), undefined, iterable);
+      }
+    } catch (ex) {
+      if (ex !== goog.iter.StopIteration) {
+        throw ex;
+      }
+    }
+  }
+};
+
+
+/**
+ * Calls a function for every element in the iterator, and if the function
+ * returns true adds the element to a new iterator.
+ *
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     to iterate over.
+ * @param {
+ *     function(this:THIS,VALUE,undefined,!goog.iter.Iterator<VALUE>):boolean} f
+ *     The function to call for every element. This function takes 3 arguments
+ *     (the element, undefined, and the iterator) and should return a boolean.
+ *     If the return value is true the element will be included in the returned
+ *     iterator.  If it is false the element is not included.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator in which only elements
+ *     that passed the test are present.
+ * @template THIS, VALUE
+ */
+goog.iter.filter = function(iterable, f, opt_obj) {
+  var iterator = goog.iter.toIterator(iterable);
+  var newIter = new goog.iter.Iterator;
+  newIter.next = function() {
+    while (true) {
+      var val = iterator.next();
+      if (f.call(opt_obj, val, undefined, iterator)) {
+        return val;
+      }
+    }
+  };
+  return newIter;
+};
+
+
+/**
+ * Calls a function for every element in the iterator, and if the function
+ * returns false adds the element to a new iterator.
+ *
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     to iterate over.
+ * @param {
+ *     function(this:THIS,VALUE,undefined,!goog.iter.Iterator<VALUE>):boolean} f
+ *     The function to call for every element. This function takes 3 arguments
+ *     (the element, undefined, and the iterator) and should return a boolean.
+ *     If the return value is false the element will be included in the returned
+ *     iterator.  If it is true the element is not included.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator in which only elements
+ *     that did not pass the test are present.
+ * @template THIS, VALUE
+ */
+goog.iter.filterFalse = function(iterable, f, opt_obj) {
+  return goog.iter.filter(iterable, goog.functions.not(f), opt_obj);
+};
+
+
+/**
+ * Creates a new iterator that returns the values in a range.  This function
+ * can take 1, 2 or 3 arguments:
+ * <pre>
+ * range(5) same as range(0, 5, 1)
+ * range(2, 5) same as range(2, 5, 1)
+ * </pre>
+ *
+ * @param {number} startOrStop  The stop value if only one argument is provided.
+ *     The start value if 2 or more arguments are provided.  If only one
+ *     argument is used the start value is 0.
+ * @param {number=} opt_stop  The stop value.  If left out then the first
+ *     argument is used as the stop value.
+ * @param {number=} opt_step  The number to increment with between each call to
+ *     next.  This can be negative.
+ * @return {!goog.iter.Iterator<number>} A new iterator that returns the values
+ *     in the range.
+ */
+goog.iter.range = function(startOrStop, opt_stop, opt_step) {
+  var start = 0;
+  var stop = startOrStop;
+  var step = opt_step || 1;
+  if (arguments.length > 1) {
+    start = startOrStop;
+    stop = opt_stop;
+  }
+  if (step == 0) {
+    throw Error('Range step argument must not be zero');
+  }
+
+  var newIter = new goog.iter.Iterator;
+  newIter.next = function() {
+    if (step > 0 && start >= stop || step < 0 && start <= stop) {
+      throw goog.iter.StopIteration;
+    }
+    var rv = start;
+    start += step;
+    return rv;
+  };
+  return newIter;
+};
+
+
+/**
+ * Joins the values in a iterator with a delimiter.
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     to get the values from.
+ * @param {string} deliminator  The text to put between the values.
+ * @return {string} The joined value string.
+ * @template VALUE
+ */
+goog.iter.join = function(iterable, deliminator) {
+  return goog.iter.toArray(iterable).join(deliminator);
+};
+
+
+/**
+ * For every element in the iterator call a function and return a new iterator
+ * with that value.
+ *
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterator to iterate over.
+ * @param {
+ *     function(this:THIS,VALUE,undefined,!goog.iter.Iterator<VALUE>):RESULT} f
+ *     The function to call for every element.  This function takes 3 arguments
+ *     (the element, undefined, and the iterator) and should return a new value.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @return {!goog.iter.Iterator<RESULT>} A new iterator that returns the
+ *     results of applying the function to each element in the original
+ *     iterator.
+ * @template THIS, VALUE, RESULT
+ */
+goog.iter.map = function(iterable, f, opt_obj) {
+  var iterator = goog.iter.toIterator(iterable);
+  var newIter = new goog.iter.Iterator;
+  newIter.next = function() {
+    var val = iterator.next();
+    return f.call(opt_obj, val, undefined, iterator);
+  };
+  return newIter;
+};
+
+
+/**
+ * Passes every element of an iterator into a function and accumulates the
+ * result.
+ *
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     to iterate over.
+ * @param {function(this:THIS,VALUE,VALUE):VALUE} f The function to call for
+ *     every element. This function takes 2 arguments (the function's previous
+ *     result or the initial value, and the value of the current element).
+ *     function(previousValue, currentElement) : newValue.
+ * @param {VALUE} val The initial value to pass into the function on the first
+ *     call.
+ * @param {THIS=} opt_obj  The object to be used as the value of 'this' within
+ *     f.
+ * @return {VALUE} Result of evaluating f repeatedly across the values of
+ *     the iterator.
+ * @template THIS, VALUE
+ */
+goog.iter.reduce = function(iterable, f, val, opt_obj) {
+  var rval = val;
+  goog.iter.forEach(
+      iterable, function(val) { rval = f.call(opt_obj, rval, val); });
+  return rval;
+};
+
+
+/**
+ * Goes through the values in the iterator. Calls f for each of these, and if
+ * any of them returns true, this returns true (without checking the rest). If
+ * all return false this will return false.
+ *
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     object.
+ * @param {
+ *     function(this:THIS,VALUE,undefined,!goog.iter.Iterator<VALUE>):boolean} f
+ *     The function to call for every value. This function takes 3 arguments
+ *     (the value, undefined, and the iterator) and should return a boolean.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @return {boolean} true if any value passes the test.
+ * @template THIS, VALUE
+ */
+goog.iter.some = function(iterable, f, opt_obj) {
+  iterable = goog.iter.toIterator(iterable);
+
+  try {
+    while (true) {
+      if (f.call(opt_obj, iterable.next(), undefined, iterable)) {
+        return true;
+      }
+    }
+  } catch (ex) {
+    if (ex !== goog.iter.StopIteration) {
+      throw ex;
+    }
+  }
+  return false;
+};
+
+
+/**
+ * Goes through the values in the iterator. Calls f for each of these and if any
+ * of them returns false this returns false (without checking the rest). If all
+ * return true this will return true.
+ *
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     object.
+ * @param {
+ *     function(this:THIS,VALUE,undefined,!goog.iter.Iterator<VALUE>):boolean} f
+ *     The function to call for every value. This function takes 3 arguments
+ *     (the value, undefined, and the iterator) and should return a boolean.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @return {boolean} true if every value passes the test.
+ * @template THIS, VALUE
+ */
+goog.iter.every = function(iterable, f, opt_obj) {
+  iterable = goog.iter.toIterator(iterable);
+
+  try {
+    while (true) {
+      if (!f.call(opt_obj, iterable.next(), undefined, iterable)) {
+        return false;
+      }
+    }
+  } catch (ex) {
+    if (ex !== goog.iter.StopIteration) {
+      throw ex;
+    }
+  }
+  return true;
+};
+
+
+/**
+ * Takes zero or more iterables and returns one iterator that will iterate over
+ * them in the order chained.
+ * @param {...!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} var_args Any
+ *     number of iterable objects.
+ * @return {!goog.iter.Iterator<VALUE>} Returns a new iterator that will
+ *     iterate over all the given iterables' contents.
+ * @template VALUE
+ */
+goog.iter.chain = function(var_args) {
+  return goog.iter.chainFromIterable(arguments);
+};
+
+
+/**
+ * Takes a single iterable containing zero or more iterables and returns one
+ * iterator that will iterate over each one in the order given.
+ * @see https://goo.gl/5NRp5d
+ * @param {goog.iter.Iterable} iterable The iterable of iterables to chain.
+ * @return {!goog.iter.Iterator<VALUE>} Returns a new iterator that will
+ *     iterate over all the contents of the iterables contained within
+ *     {@code iterable}.
+ * @template VALUE
+ */
+goog.iter.chainFromIterable = function(iterable) {
+  var iterator = goog.iter.toIterator(iterable);
+  var iter = new goog.iter.Iterator();
+  var current = null;
+
+  iter.next = function() {
+    while (true) {
+      if (current == null) {
+        var it = iterator.next();
+        current = goog.iter.toIterator(it);
+      }
+      try {
+        return current.next();
+      } catch (ex) {
+        if (ex !== goog.iter.StopIteration) {
+          throw ex;
+        }
+        current = null;
+      }
+    }
+  };
+
+  return iter;
+};
+
+
+/**
+ * Builds a new iterator that iterates over the original, but skips elements as
+ * long as a supplied function returns true.
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     object.
+ * @param {
+ *     function(this:THIS,VALUE,undefined,!goog.iter.Iterator<VALUE>):boolean} f
+ *     The function to call for every value. This function takes 3 arguments
+ *     (the value, undefined, and the iterator) and should return a boolean.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator that drops elements from
+ *     the original iterator as long as {@code f} is true.
+ * @template THIS, VALUE
+ */
+goog.iter.dropWhile = function(iterable, f, opt_obj) {
+  var iterator = goog.iter.toIterator(iterable);
+  var newIter = new goog.iter.Iterator;
+  var dropping = true;
+  newIter.next = function() {
+    while (true) {
+      var val = iterator.next();
+      if (dropping && f.call(opt_obj, val, undefined, iterator)) {
+        continue;
+      } else {
+        dropping = false;
+      }
+      return val;
+    }
+  };
+  return newIter;
+};
+
+
+/**
+ * Builds a new iterator that iterates over the original, but only as long as a
+ * supplied function returns true.
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     object.
+ * @param {
+ *     function(this:THIS,VALUE,undefined,!goog.iter.Iterator<VALUE>):boolean} f
+ *     The function to call for every value. This function takes 3 arguments
+ *     (the value, undefined, and the iterator) and should return a boolean.
+ * @param {THIS=} opt_obj This is used as the 'this' object in f when called.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator that keeps elements in
+ *     the original iterator as long as the function is true.
+ * @template THIS, VALUE
+ */
+goog.iter.takeWhile = function(iterable, f, opt_obj) {
+  var iterator = goog.iter.toIterator(iterable);
+  var iter = new goog.iter.Iterator();
+  iter.next = function() {
+    var val = iterator.next();
+    if (f.call(opt_obj, val, undefined, iterator)) {
+      return val;
+    }
+    throw goog.iter.StopIteration;
+  };
+  return iter;
+};
+
+
+/**
+ * Converts the iterator to an array
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterator
+ *     to convert to an array.
+ * @return {!Array<VALUE>} An array of the elements the iterator iterates over.
+ * @template VALUE
+ */
+goog.iter.toArray = function(iterable) {
+  // Fast path for array-like.
+  if (goog.isArrayLike(iterable)) {
+    return goog.array.toArray(/** @type {!IArrayLike<?>} */ (iterable));
+  }
+  iterable = goog.iter.toIterator(iterable);
+  var array = [];
+  goog.iter.forEach(iterable, function(val) { array.push(val); });
+  return array;
+};
+
+
+/**
+ * Iterates over two iterables and returns true if they contain the same
+ * sequence of elements and have the same length.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable1 The first
+ *     iterable object.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable2 The second
+ *     iterable object.
+ * @param {function(VALUE,VALUE):boolean=} opt_equalsFn Optional comparison
+ *     function.
+ *     Should take two arguments to compare, and return true if the arguments
+ *     are equal. Defaults to {@link goog.array.defaultCompareEquality} which
+ *     compares the elements using the built-in '===' operator.
+ * @return {boolean} true if the iterables contain the same sequence of elements
+ *     and have the same length.
+ * @template VALUE
+ */
+goog.iter.equals = function(iterable1, iterable2, opt_equalsFn) {
+  var fillValue = {};
+  var pairs = goog.iter.zipLongest(fillValue, iterable1, iterable2);
+  var equalsFn = opt_equalsFn || goog.array.defaultCompareEquality;
+  return goog.iter.every(
+      pairs, function(pair) { return equalsFn(pair[0], pair[1]); });
+};
+
+
+/**
+ * Advances the iterator to the next position, returning the given default value
+ * instead of throwing an exception if the iterator has no more entries.
+ * @param {goog.iter.Iterator<VALUE>|goog.iter.Iterable} iterable The iterable
+ *     object.
+ * @param {VALUE} defaultValue The value to return if the iterator is empty.
+ * @return {VALUE} The next item in the iteration, or defaultValue if the
+ *     iterator was empty.
+ * @template VALUE
+ */
+goog.iter.nextOrValue = function(iterable, defaultValue) {
+  try {
+    return goog.iter.toIterator(iterable).next();
+  } catch (e) {
+    if (e != goog.iter.StopIteration) {
+      throw e;
+    }
+    return defaultValue;
+  }
+};
+
+
+/**
+ * Cartesian product of zero or more sets.  Gives an iterator that gives every
+ * combination of one element chosen from each set.  For example,
+ * ([1, 2], [3, 4]) gives ([1, 3], [1, 4], [2, 3], [2, 4]).
+ * @see http://docs.python.org/library/itertools.html#itertools.product
+ * @param {...!IArrayLike<VALUE>} var_args Zero or more sets, as
+ *     arrays.
+ * @return {!goog.iter.Iterator<!Array<VALUE>>} An iterator that gives each
+ *     n-tuple (as an array).
+ * @template VALUE
+ */
+goog.iter.product = function(var_args) {
+  var someArrayEmpty =
+      goog.array.some(arguments, function(arr) { return !arr.length; });
+
+  // An empty set in a cartesian product gives an empty set.
+  if (someArrayEmpty || !arguments.length) {
+    return new goog.iter.Iterator();
+  }
+
+  var iter = new goog.iter.Iterator();
+  var arrays = arguments;
+
+  // The first indices are [0, 0, ...]
+  var indicies = goog.array.repeat(0, arrays.length);
+
+  iter.next = function() {
+
+    if (indicies) {
+      var retVal = goog.array.map(indicies, function(valueIndex, arrayIndex) {
+        return arrays[arrayIndex][valueIndex];
+      });
+
+      // Generate the next-largest indices for the next call.
+      // Increase the rightmost index. If it goes over, increase the next
+      // rightmost (like carry-over addition).
+      for (var i = indicies.length - 1; i >= 0; i--) {
+        // Assertion prevents compiler warning below.
+        goog.asserts.assert(indicies);
+        if (indicies[i] < arrays[i].length - 1) {
+          indicies[i]++;
+          break;
+        }
+
+        // We're at the last indices (the last element of every array), so
+        // the iteration is over on the next call.
+        if (i == 0) {
+          indicies = null;
+          break;
+        }
+        // Reset the index in this column and loop back to increment the
+        // next one.
+        indicies[i] = 0;
+      }
+      return retVal;
+    }
+
+    throw goog.iter.StopIteration;
+  };
+
+  return iter;
+};
+
+
+/**
+ * Create an iterator to cycle over the iterable's elements indefinitely.
+ * For example, ([1, 2, 3]) would return : 1, 2, 3, 1, 2, 3, ...
+ * @see: http://docs.python.org/library/itertools.html#itertools.cycle.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable object.
+ * @return {!goog.iter.Iterator<VALUE>} An iterator that iterates indefinitely
+ *     over the values in {@code iterable}.
+ * @template VALUE
+ */
+goog.iter.cycle = function(iterable) {
+  var baseIterator = goog.iter.toIterator(iterable);
+
+  // We maintain a cache to store the iterable elements as we iterate
+  // over them. The cache is used to return elements once we have
+  // iterated over the iterable once.
+  var cache = [];
+  var cacheIndex = 0;
+
+  var iter = new goog.iter.Iterator();
+
+  // This flag is set after the iterable is iterated over once
+  var useCache = false;
+
+  iter.next = function() {
+    var returnElement = null;
+
+    // Pull elements off the original iterator if not using cache
+    if (!useCache) {
+      try {
+        // Return the element from the iterable
+        returnElement = baseIterator.next();
+        cache.push(returnElement);
+        return returnElement;
+      } catch (e) {
+        // If an exception other than StopIteration is thrown
+        // or if there are no elements to iterate over (the iterable was empty)
+        // throw an exception
+        if (e != goog.iter.StopIteration || goog.array.isEmpty(cache)) {
+          throw e;
+        }
+        // set useCache to true after we know that a 'StopIteration' exception
+        // was thrown and the cache is not empty (to handle the 'empty iterable'
+        // use case)
+        useCache = true;
+      }
+    }
+
+    returnElement = cache[cacheIndex];
+    cacheIndex = (cacheIndex + 1) % cache.length;
+
+    return returnElement;
+  };
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that counts indefinitely from a starting value.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.count
+ * @param {number=} opt_start The starting value. Default is 0.
+ * @param {number=} opt_step The number to increment with between each call to
+ *     next. Negative and floating point numbers are allowed. Default is 1.
+ * @return {!goog.iter.Iterator<number>} A new iterator that returns the values
+ *     in the series.
+ */
+goog.iter.count = function(opt_start, opt_step) {
+  var counter = opt_start || 0;
+  var step = goog.isDef(opt_step) ? opt_step : 1;
+  var iter = new goog.iter.Iterator();
+
+  iter.next = function() {
+    var returnValue = counter;
+    counter += step;
+    return returnValue;
+  };
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that returns the same object or value repeatedly.
+ * @param {VALUE} value Any object or value to repeat.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator that returns the
+ *     repeated value.
+ * @template VALUE
+ */
+goog.iter.repeat = function(value) {
+  var iter = new goog.iter.Iterator();
+
+  iter.next = goog.functions.constant(value);
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that returns running totals from the numbers in
+ * {@code iterable}. For example, the array {@code [1, 2, 3, 4, 5]} yields
+ * {@code 1 -> 3 -> 6 -> 10 -> 15}.
+ * @see http://docs.python.org/3.2/library/itertools.html#itertools.accumulate
+ * @param {!goog.iter.Iterable} iterable The iterable of numbers to
+ *     accumulate.
+ * @return {!goog.iter.Iterator<number>} A new iterator that returns the
+ *     numbers in the series.
+ */
+goog.iter.accumulate = function(iterable) {
+  var iterator = goog.iter.toIterator(iterable);
+  var total = 0;
+  var iter = new goog.iter.Iterator();
+
+  iter.next = function() {
+    total += iterator.next();
+    return total;
+  };
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that returns arrays containing the ith elements from the
+ * provided iterables. The returned arrays will be the same size as the number
+ * of iterables given in {@code var_args}. Once the shortest iterable is
+ * exhausted, subsequent calls to {@code next()} will throw
+ * {@code goog.iter.StopIteration}.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.izip
+ * @param {...!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} var_args Any
+ *     number of iterable objects.
+ * @return {!goog.iter.Iterator<!Array<VALUE>>} A new iterator that returns
+ *     arrays of elements from the provided iterables.
+ * @template VALUE
+ */
+goog.iter.zip = function(var_args) {
+  var args = arguments;
+  var iter = new goog.iter.Iterator();
+
+  if (args.length > 0) {
+    var iterators = goog.array.map(args, goog.iter.toIterator);
+    iter.next = function() {
+      var arr = goog.array.map(iterators, function(it) { return it.next(); });
+      return arr;
+    };
+  }
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that returns arrays containing the ith elements from the
+ * provided iterables. The returned arrays will be the same size as the number
+ * of iterables given in {@code var_args}. Shorter iterables will be extended
+ * with {@code fillValue}. Once the longest iterable is exhausted, subsequent
+ * calls to {@code next()} will throw {@code goog.iter.StopIteration}.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.izip_longest
+ * @param {VALUE} fillValue The object or value used to fill shorter iterables.
+ * @param {...!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} var_args Any
+ *     number of iterable objects.
+ * @return {!goog.iter.Iterator<!Array<VALUE>>} A new iterator that returns
+ *     arrays of elements from the provided iterables.
+ * @template VALUE
+ */
+goog.iter.zipLongest = function(fillValue, var_args) {
+  var args = goog.array.slice(arguments, 1);
+  var iter = new goog.iter.Iterator();
+
+  if (args.length > 0) {
+    var iterators = goog.array.map(args, goog.iter.toIterator);
+
+    iter.next = function() {
+      var iteratorsHaveValues = false;  // false when all iterators are empty.
+      var arr = goog.array.map(iterators, function(it) {
+        var returnValue;
+        try {
+          returnValue = it.next();
+          // Iterator had a value, so we've not exhausted the iterators.
+          // Set flag accordingly.
+          iteratorsHaveValues = true;
+        } catch (ex) {
+          if (ex !== goog.iter.StopIteration) {
+            throw ex;
+          }
+          returnValue = fillValue;
+        }
+        return returnValue;
+      });
+
+      if (!iteratorsHaveValues) {
+        throw goog.iter.StopIteration;
+      }
+      return arr;
+    };
+  }
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that filters {@code iterable} based on a series of
+ * {@code selectors}. On each call to {@code next()}, one item is taken from
+ * both the {@code iterable} and {@code selectors} iterators. If the item from
+ * {@code selectors} evaluates to true, the item from {@code iterable} is given.
+ * Otherwise, it is skipped. Once either {@code iterable} or {@code selectors}
+ * is exhausted, subsequent calls to {@code next()} will throw
+ * {@code goog.iter.StopIteration}.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.compress
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to filter.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} selectors An
+ *     iterable of items to be evaluated in a boolean context to determine if
+ *     the corresponding element in {@code iterable} should be included in the
+ *     result.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator that returns the
+ *     filtered values.
+ * @template VALUE
+ */
+goog.iter.compress = function(iterable, selectors) {
+  var selectorIterator = goog.iter.toIterator(selectors);
+
+  return goog.iter.filter(
+      iterable, function() { return !!selectorIterator.next(); });
+};
+
+
+
+/**
+ * Implements the {@code goog.iter.groupBy} iterator.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to group.
+ * @param {function(VALUE): KEY=} opt_keyFunc  Optional function for
+ *     determining the key value for each group in the {@code iterable}. Default
+ *     is the identity function.
+ * @constructor
+ * @extends {goog.iter.Iterator<!Array<?>>}
+ * @template KEY, VALUE
+ * @private
+ */
+goog.iter.GroupByIterator_ = function(iterable, opt_keyFunc) {
+
+  /**
+   * The iterable to group, coerced to an iterator.
+   * @type {!goog.iter.Iterator}
+   */
+  this.iterator = goog.iter.toIterator(iterable);
+
+  /**
+   * A function for determining the key value for each element in the iterable.
+   * If no function is provided, the identity function is used and returns the
+   * element unchanged.
+   * @type {function(VALUE): KEY}
+   */
+  this.keyFunc = opt_keyFunc || goog.functions.identity;
+
+  /**
+   * The target key for determining the start of a group.
+   * @type {KEY}
+   */
+  this.targetKey;
+
+  /**
+   * The current key visited during iteration.
+   * @type {KEY}
+   */
+  this.currentKey;
+
+  /**
+   * The current value being added to the group.
+   * @type {VALUE}
+   */
+  this.currentValue;
+};
+goog.inherits(goog.iter.GroupByIterator_, goog.iter.Iterator);
+
+
+/** @override */
+goog.iter.GroupByIterator_.prototype.next = function() {
+  while (this.currentKey == this.targetKey) {
+    this.currentValue = this.iterator.next();  // Exits on StopIteration
+    this.currentKey = this.keyFunc(this.currentValue);
+  }
+  this.targetKey = this.currentKey;
+  return [this.currentKey, this.groupItems_(this.targetKey)];
+};
+
+
+/**
+ * Performs the grouping of objects using the given key.
+ * @param {KEY} targetKey  The target key object for the group.
+ * @return {!Array<VALUE>} An array of grouped objects.
+ * @private
+ */
+goog.iter.GroupByIterator_.prototype.groupItems_ = function(targetKey) {
+  var arr = [];
+  while (this.currentKey == targetKey) {
+    arr.push(this.currentValue);
+    try {
+      this.currentValue = this.iterator.next();
+    } catch (ex) {
+      if (ex !== goog.iter.StopIteration) {
+        throw ex;
+      }
+      break;
+    }
+    this.currentKey = this.keyFunc(this.currentValue);
+  }
+  return arr;
+};
+
+
+/**
+ * Creates an iterator that returns arrays containing elements from the
+ * {@code iterable} grouped by a key value. For iterables with repeated
+ * elements (i.e. sorted according to a particular key function), this function
+ * has a {@code uniq}-like effect. For example, grouping the array:
+ * {@code [A, B, B, C, C, A]} produces
+ * {@code [A, [A]], [B, [B, B]], [C, [C, C]], [A, [A]]}.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.groupby
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to group.
+ * @param {function(VALUE): KEY=} opt_keyFunc  Optional function for
+ *     determining the key value for each group in the {@code iterable}. Default
+ *     is the identity function.
+ * @return {!goog.iter.Iterator<!Array<?>>} A new iterator that returns
+ *     arrays of consecutive key and groups.
+ * @template KEY, VALUE
+ */
+goog.iter.groupBy = function(iterable, opt_keyFunc) {
+  return new goog.iter.GroupByIterator_(iterable, opt_keyFunc);
+};
+
+
+/**
+ * Gives an iterator that gives the result of calling the given function
+ * <code>f</code> with the arguments taken from the next element from
+ * <code>iterable</code> (the elements are expected to also be iterables).
+ *
+ * Similar to {@see goog.iter#map} but allows the function to accept multiple
+ * arguments from the iterable.
+ *
+ * @param {!goog.iter.Iterable} iterable The iterable of
+ *     iterables to iterate over.
+ * @param {function(this:THIS,...*):RESULT} f The function to call for every
+ *     element.  This function takes N+2 arguments, where N represents the
+ *     number of items from the next element of the iterable. The two
+ *     additional arguments passed to the function are undefined and the
+ *     iterator itself. The function should return a new value.
+ * @param {THIS=} opt_obj The object to be used as the value of 'this' within
+ *     {@code f}.
+ * @return {!goog.iter.Iterator<RESULT>} A new iterator that returns the
+ *     results of applying the function to each element in the original
+ *     iterator.
+ * @template THIS, RESULT
+ */
+goog.iter.starMap = function(iterable, f, opt_obj) {
+  var iterator = goog.iter.toIterator(iterable);
+  var iter = new goog.iter.Iterator();
+
+  iter.next = function() {
+    var args = goog.iter.toArray(iterator.next());
+    return f.apply(opt_obj, goog.array.concat(args, undefined, iterator));
+  };
+
+  return iter;
+};
+
+
+/**
+ * Returns an array of iterators each of which can iterate over the values in
+ * {@code iterable} without advancing the others.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.tee
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to tee.
+ * @param {number=} opt_num  The number of iterators to create. Default is 2.
+ * @return {!Array<goog.iter.Iterator<VALUE>>} An array of iterators.
+ * @template VALUE
+ */
+goog.iter.tee = function(iterable, opt_num) {
+  var iterator = goog.iter.toIterator(iterable);
+  var num = goog.isNumber(opt_num) ? opt_num : 2;
+  var buffers =
+      goog.array.map(goog.array.range(num), function() { return []; });
+
+  var addNextIteratorValueToBuffers = function() {
+    var val = iterator.next();
+    goog.array.forEach(buffers, function(buffer) { buffer.push(val); });
+  };
+
+  var createIterator = function(buffer) {
+    // Each tee'd iterator has an associated buffer (initially empty). When a
+    // tee'd iterator's buffer is empty, it calls
+    // addNextIteratorValueToBuffers(), adding the next value to all tee'd
+    // iterators' buffers, and then returns that value. This allows each
+    // iterator to be advanced independently.
+    var iter = new goog.iter.Iterator();
+
+    iter.next = function() {
+      if (goog.array.isEmpty(buffer)) {
+        addNextIteratorValueToBuffers();
+      }
+      goog.asserts.assert(!goog.array.isEmpty(buffer));
+      return buffer.shift();
+    };
+
+    return iter;
+  };
+
+  return goog.array.map(buffers, createIterator);
+};
+
+
+/**
+ * Creates an iterator that returns arrays containing a count and an element
+ * obtained from the given {@code iterable}.
+ * @see http://docs.python.org/2/library/functions.html#enumerate
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to enumerate.
+ * @param {number=} opt_start  Optional starting value. Default is 0.
+ * @return {!goog.iter.Iterator<!Array<?>>} A new iterator containing
+ *     count/item pairs.
+ * @template VALUE
+ */
+goog.iter.enumerate = function(iterable, opt_start) {
+  return goog.iter.zip(goog.iter.count(opt_start), iterable);
+};
+
+
+/**
+ * Creates an iterator that returns the first {@code limitSize} elements from an
+ * iterable. If this number is greater than the number of elements in the
+ * iterable, all the elements are returned.
+ * @see http://goo.gl/V0sihp Inspired by the limit iterator in Guava.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to limit.
+ * @param {number} limitSize  The maximum number of elements to return.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator containing
+ *     {@code limitSize} elements.
+ * @template VALUE
+ */
+goog.iter.limit = function(iterable, limitSize) {
+  goog.asserts.assert(goog.math.isInt(limitSize) && limitSize >= 0);
+
+  var iterator = goog.iter.toIterator(iterable);
+
+  var iter = new goog.iter.Iterator();
+  var remaining = limitSize;
+
+  iter.next = function() {
+    if (remaining-- > 0) {
+      return iterator.next();
+    }
+    throw goog.iter.StopIteration;
+  };
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that is advanced {@code count} steps ahead. Consumed
+ * values are silently discarded. If {@code count} is greater than the number
+ * of elements in {@code iterable}, an empty iterator is returned. Subsequent
+ * calls to {@code next()} will throw {@code goog.iter.StopIteration}.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to consume.
+ * @param {number} count  The number of elements to consume from the iterator.
+ * @return {!goog.iter.Iterator<VALUE>} An iterator advanced zero or more steps
+ *     ahead.
+ * @template VALUE
+ */
+goog.iter.consume = function(iterable, count) {
+  goog.asserts.assert(goog.math.isInt(count) && count >= 0);
+
+  var iterator = goog.iter.toIterator(iterable);
+
+  while (count-- > 0) {
+    goog.iter.nextOrValue(iterator, null);
+  }
+
+  return iterator;
+};
+
+
+/**
+ * Creates an iterator that returns a range of elements from an iterable.
+ * Similar to {@see goog.array#slice} but does not support negative indexes.
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to slice.
+ * @param {number} start  The index of the first element to return.
+ * @param {number=} opt_end  The index after the last element to return. If
+ *     defined, must be greater than or equal to {@code start}.
+ * @return {!goog.iter.Iterator<VALUE>} A new iterator containing a slice of
+ *     the original.
+ * @template VALUE
+ */
+goog.iter.slice = function(iterable, start, opt_end) {
+  goog.asserts.assert(goog.math.isInt(start) && start >= 0);
+
+  var iterator = goog.iter.consume(iterable, start);
+
+  if (goog.isNumber(opt_end)) {
+    goog.asserts.assert(goog.math.isInt(opt_end) && opt_end >= start);
+    iterator = goog.iter.limit(iterator, opt_end - start /* limitSize */);
+  }
+
+  return iterator;
+};
+
+
+/**
+ * Checks an array for duplicate elements.
+ * @param {?IArrayLike<VALUE>} arr The array to check for
+ *     duplicates.
+ * @return {boolean} True, if the array contains duplicates, false otherwise.
+ * @private
+ * @template VALUE
+ */
+// TODO(user): Consider moving this into goog.array as a public function.
+goog.iter.hasDuplicates_ = function(arr) {
+  var deduped = [];
+  goog.array.removeDuplicates(arr, deduped);
+  return arr.length != deduped.length;
+};
+
+
+/**
+ * Creates an iterator that returns permutations of elements in
+ * {@code iterable}.
+ *
+ * Permutations are obtained by taking the Cartesian product of
+ * {@code opt_length} iterables and filtering out those with repeated
+ * elements. For example, the permutations of {@code [1,2,3]} are
+ * {@code [[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]}.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.permutations
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable from which to generate permutations.
+ * @param {number=} opt_length Length of each permutation. If omitted, defaults
+ *     to the length of {@code iterable}.
+ * @return {!goog.iter.Iterator<!Array<VALUE>>} A new iterator containing the
+ *     permutations of {@code iterable}.
+ * @template VALUE
+ */
+goog.iter.permutations = function(iterable, opt_length) {
+  var elements = goog.iter.toArray(iterable);
+  var length = goog.isNumber(opt_length) ? opt_length : elements.length;
+
+  var sets = goog.array.repeat(elements, length);
+  var product = goog.iter.product.apply(undefined, sets);
+
+  return goog.iter.filter(
+      product, function(arr) { return !goog.iter.hasDuplicates_(arr); });
+};
+
+
+/**
+ * Creates an iterator that returns combinations of elements from
+ * {@code iterable}.
+ *
+ * Combinations are obtained by taking the {@see goog.iter#permutations} of
+ * {@code iterable} and filtering those whose elements appear in the order they
+ * are encountered in {@code iterable}. For example, the 3-length combinations
+ * of {@code [0,1,2,3]} are {@code [[0,1,2], [0,1,3], [0,2,3], [1,2,3]]}.
+ * @see http://docs.python.org/2/library/itertools.html#itertools.combinations
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable from which to generate combinations.
+ * @param {number} length The length of each combination.
+ * @return {!goog.iter.Iterator<!Array<VALUE>>} A new iterator containing
+ *     combinations from the {@code iterable}.
+ * @template VALUE
+ */
+goog.iter.combinations = function(iterable, length) {
+  var elements = goog.iter.toArray(iterable);
+  var indexes = goog.iter.range(elements.length);
+  var indexIterator = goog.iter.permutations(indexes, length);
+  // sortedIndexIterator will now give arrays of with the given length that
+  // indicate what indexes into "elements" should be returned on each iteration.
+  var sortedIndexIterator = goog.iter.filter(
+      indexIterator, function(arr) { return goog.array.isSorted(arr); });
+
+  var iter = new goog.iter.Iterator();
+
+  function getIndexFromElements(index) { return elements[index]; }
+
+  iter.next = function() {
+    return goog.array.map(sortedIndexIterator.next(), getIndexFromElements);
+  };
+
+  return iter;
+};
+
+
+/**
+ * Creates an iterator that returns combinations of elements from
+ * {@code iterable}, with repeated elements possible.
+ *
+ * Combinations are obtained by taking the Cartesian product of {@code length}
+ * iterables and filtering those whose elements appear in the order they are
+ * encountered in {@code iterable}. For example, the 2-length combinations of
+ * {@code [1,2,3]} are {@code [[1,1], [1,2], [1,3], [2,2], [2,3], [3,3]]}.
+ * @see https://goo.gl/C0yXe4
+ * @see https://goo.gl/djOCsk
+ * @param {!goog.iter.Iterator<VALUE>|!goog.iter.Iterable} iterable The
+ *     iterable to combine.
+ * @param {number} length The length of each combination.
+ * @return {!goog.iter.Iterator<!Array<VALUE>>} A new iterator containing
+ *     combinations from the {@code iterable}.
+ * @template VALUE
+ */
+goog.iter.combinationsWithReplacement = function(iterable, length) {
+  var elements = goog.iter.toArray(iterable);
+  var indexes = goog.array.range(elements.length);
+  var sets = goog.array.repeat(indexes, length);
+  var indexIterator = goog.iter.product.apply(undefined, sets);
+  // sortedIndexIterator will now give arrays of with the given length that
+  // indicate what indexes into "elements" should be returned on each iteration.
+  var sortedIndexIterator = goog.iter.filter(
+      indexIterator, function(arr) { return goog.array.isSorted(arr); });
+
+  var iter = new goog.iter.Iterator();
+
+  function getIndexFromElements(index) { return elements[index]; }
+
+  iter.next = function() {
+    return goog.array.map(
+        /** @type {!Array<number>} */
+        (sortedIndexIterator.next()), getIndexFromElements);
+  };
+
+  return iter;
+};
diff --git a/js/goog/labs/useragent/browser.js b/js/goog/labs/useragent/browser.js
new file mode 100644
index 0000000..a7dd638
--- /dev/null
+++ b/js/goog/labs/useragent/browser.js
@@ -0,0 +1,338 @@
+// Copyright 2013 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Closure user agent detection (Browser).
+ * @see <a href="http://www.useragentstring.com/">User agent strings</a>
+ * For more information on rendering engine, platform, or device see the other
+ * sub-namespaces in goog.labs.userAgent, goog.labs.userAgent.platform,
+ * goog.labs.userAgent.device respectively.)
+ *
+ * @author martone@google.com (Andy Martone)
+ */
+
+goog.provide('goog.labs.userAgent.browser');
+
+goog.require('goog.array');
+goog.require('goog.labs.userAgent.util');
+goog.require('goog.object');
+goog.require('goog.string');
+
+
+// TODO(nnaze): Refactor to remove excessive exclusion logic in matching
+// functions.
+
+
+/**
+ * @return {boolean} Whether the user's browser is Opera.  Note: Chromium
+ *     based Opera (Opera 15+) is detected as Chrome to avoid unnecessary
+ *     special casing.
+ * @private
+ */
+goog.labs.userAgent.browser.matchOpera_ = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Opera');
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is IE.
+ * @private
+ */
+goog.labs.userAgent.browser.matchIE_ = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Trident') ||
+      goog.labs.userAgent.util.matchUserAgent('MSIE');
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is Edge.
+ * @private
+ */
+goog.labs.userAgent.browser.matchEdge_ = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Edge');
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is Firefox.
+ * @private
+ */
+goog.labs.userAgent.browser.matchFirefox_ = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Firefox');
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is Safari.
+ * @private
+ */
+goog.labs.userAgent.browser.matchSafari_ = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Safari') &&
+      !(goog.labs.userAgent.browser.matchChrome_() ||
+        goog.labs.userAgent.browser.matchCoast_() ||
+        goog.labs.userAgent.browser.matchOpera_() ||
+        goog.labs.userAgent.browser.matchEdge_() ||
+        goog.labs.userAgent.browser.isSilk() ||
+        goog.labs.userAgent.util.matchUserAgent('Android'));
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is Coast (Opera's Webkit-based
+ *     iOS browser).
+ * @private
+ */
+goog.labs.userAgent.browser.matchCoast_ = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Coast');
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is iOS Webview.
+ * @private
+ */
+goog.labs.userAgent.browser.matchIosWebview_ = function() {
+  // iOS Webview does not show up as Chrome or Safari. Also check for Opera's
+  // WebKit-based iOS browser, Coast.
+  return (goog.labs.userAgent.util.matchUserAgent('iPad') ||
+          goog.labs.userAgent.util.matchUserAgent('iPhone')) &&
+      !goog.labs.userAgent.browser.matchSafari_() &&
+      !goog.labs.userAgent.browser.matchChrome_() &&
+      !goog.labs.userAgent.browser.matchCoast_() &&
+      goog.labs.userAgent.util.matchUserAgent('AppleWebKit');
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is Chrome.
+ * @private
+ */
+goog.labs.userAgent.browser.matchChrome_ = function() {
+  return (goog.labs.userAgent.util.matchUserAgent('Chrome') ||
+          goog.labs.userAgent.util.matchUserAgent('CriOS')) &&
+      !goog.labs.userAgent.browser.matchEdge_();
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is the Android browser.
+ * @private
+ */
+goog.labs.userAgent.browser.matchAndroidBrowser_ = function() {
+  // Android can appear in the user agent string for Chrome on Android.
+  // This is not the Android standalone browser if it does.
+  return goog.labs.userAgent.util.matchUserAgent('Android') &&
+      !(goog.labs.userAgent.browser.isChrome() ||
+        goog.labs.userAgent.browser.isFirefox() ||
+        goog.labs.userAgent.browser.isOpera() ||
+        goog.labs.userAgent.browser.isSilk());
+};
+
+
+/**
+ * @return {boolean} Whether the user's browser is Opera.
+ */
+goog.labs.userAgent.browser.isOpera = goog.labs.userAgent.browser.matchOpera_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is IE.
+ */
+goog.labs.userAgent.browser.isIE = goog.labs.userAgent.browser.matchIE_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is Edge.
+ */
+goog.labs.userAgent.browser.isEdge = goog.labs.userAgent.browser.matchEdge_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is Firefox.
+ */
+goog.labs.userAgent.browser.isFirefox =
+    goog.labs.userAgent.browser.matchFirefox_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is Safari.
+ */
+goog.labs.userAgent.browser.isSafari = goog.labs.userAgent.browser.matchSafari_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is Coast (Opera's Webkit-based
+ *     iOS browser).
+ */
+goog.labs.userAgent.browser.isCoast = goog.labs.userAgent.browser.matchCoast_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is iOS Webview.
+ */
+goog.labs.userAgent.browser.isIosWebview =
+    goog.labs.userAgent.browser.matchIosWebview_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is Chrome.
+ */
+goog.labs.userAgent.browser.isChrome = goog.labs.userAgent.browser.matchChrome_;
+
+
+/**
+ * @return {boolean} Whether the user's browser is the Android browser.
+ */
+goog.labs.userAgent.browser.isAndroidBrowser =
+    goog.labs.userAgent.browser.matchAndroidBrowser_;
+
+
+/**
+ * For more information, see:
+ * http://docs.aws.amazon.com/silk/latest/developerguide/user-agent.html
+ * @return {boolean} Whether the user's browser is Silk.
+ */
+goog.labs.userAgent.browser.isSilk = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Silk');
+};
+
+
+/**
+ * @return {string} The browser version or empty string if version cannot be
+ *     determined. Note that for Internet Explorer, this returns the version of
+ *     the browser, not the version of the rendering engine. (IE 8 in
+ *     compatibility mode will return 8.0 rather than 7.0. To determine the
+ *     rendering engine version, look at document.documentMode instead. See
+ *     http://msdn.microsoft.com/en-us/library/cc196988(v=vs.85).aspx for more
+ *     details.)
+ */
+goog.labs.userAgent.browser.getVersion = function() {
+  var userAgentString = goog.labs.userAgent.util.getUserAgent();
+  // Special case IE since IE's version is inside the parenthesis and
+  // without the '/'.
+  if (goog.labs.userAgent.browser.isIE()) {
+    return goog.labs.userAgent.browser.getIEVersion_(userAgentString);
+  }
+
+  var versionTuples =
+      goog.labs.userAgent.util.extractVersionTuples(userAgentString);
+
+  // Construct a map for easy lookup.
+  var versionMap = {};
+  goog.array.forEach(versionTuples, function(tuple) {
+    // Note that the tuple is of length three, but we only care about the
+    // first two.
+    var key = tuple[0];
+    var value = tuple[1];
+    versionMap[key] = value;
+  });
+
+  var versionMapHasKey = goog.partial(goog.object.containsKey, versionMap);
+
+  // Gives the value with the first key it finds, otherwise empty string.
+  function lookUpValueWithKeys(keys) {
+    var key = goog.array.find(keys, versionMapHasKey);
+    return versionMap[key] || '';
+  }
+
+  // Check Opera before Chrome since Opera 15+ has "Chrome" in the string.
+  // See
+  // http://my.opera.com/ODIN/blog/2013/07/15/opera-user-agent-strings-opera-15-and-beyond
+  if (goog.labs.userAgent.browser.isOpera()) {
+    // Opera 10 has Version/10.0 but Opera/9.8, so look for "Version" first.
+    // Opera uses 'OPR' for more recent UAs.
+    return lookUpValueWithKeys(['Version', 'Opera']);
+  }
+
+  // Check Edge before Chrome since it has Chrome in the string.
+  if (goog.labs.userAgent.browser.isEdge()) {
+    return lookUpValueWithKeys(['Edge']);
+  }
+
+  if (goog.labs.userAgent.browser.isChrome()) {
+    return lookUpValueWithKeys(['Chrome', 'CriOS']);
+  }
+
+  // Usually products browser versions are in the third tuple after "Mozilla"
+  // and the engine.
+  var tuple = versionTuples[2];
+  return tuple && tuple[1] || '';
+};
+
+
+/**
+ * @param {string|number} version The version to check.
+ * @return {boolean} Whether the browser version is higher or the same as the
+ *     given version.
+ */
+goog.labs.userAgent.browser.isVersionOrHigher = function(version) {
+  return goog.string.compareVersions(
+             goog.labs.userAgent.browser.getVersion(), version) >= 0;
+};
+
+
+/**
+ * Determines IE version. More information:
+ * http://msdn.microsoft.com/en-us/library/ie/bg182625(v=vs.85).aspx#uaString
+ * http://msdn.microsoft.com/en-us/library/hh869301(v=vs.85).aspx
+ * http://blogs.msdn.com/b/ie/archive/2010/03/23/introducing-ie9-s-user-agent-string.aspx
+ * http://blogs.msdn.com/b/ie/archive/2009/01/09/the-internet-explorer-8-user-agent-string-updated-edition.aspx
+ *
+ * @param {string} userAgent the User-Agent.
+ * @return {string}
+ * @private
+ */
+goog.labs.userAgent.browser.getIEVersion_ = function(userAgent) {
+  // IE11 may identify itself as MSIE 9.0 or MSIE 10.0 due to an IE 11 upgrade
+  // bug. Example UA:
+  // Mozilla/5.0 (MSIE 9.0; Windows NT 6.1; WOW64; Trident/7.0; rv:11.0)
+  // like Gecko.
+  // See http://www.whatismybrowser.com/developers/unknown-user-agent-fragments.
+  var rv = /rv: *([\d\.]*)/.exec(userAgent);
+  if (rv && rv[1]) {
+    return rv[1];
+  }
+
+  var version = '';
+  var msie = /MSIE +([\d\.]+)/.exec(userAgent);
+  if (msie && msie[1]) {
+    // IE in compatibility mode usually identifies itself as MSIE 7.0; in this
+    // case, use the Trident version to determine the version of IE. For more
+    // details, see the links above.
+    var tridentVersion = /Trident\/(\d.\d)/.exec(userAgent);
+    if (msie[1] == '7.0') {
+      if (tridentVersion && tridentVersion[1]) {
+        switch (tridentVersion[1]) {
+          case '4.0':
+            version = '8.0';
+            break;
+          case '5.0':
+            version = '9.0';
+            break;
+          case '6.0':
+            version = '10.0';
+            break;
+          case '7.0':
+            version = '11.0';
+            break;
+        }
+      } else {
+        version = '7.0';
+      }
+    } else {
+      version = msie[1];
+    }
+  }
+  return version;
+};
diff --git a/js/goog/labs/useragent/engine.js b/js/goog/labs/useragent/engine.js
new file mode 100644
index 0000000..31c5667
--- /dev/null
+++ b/js/goog/labs/useragent/engine.js
@@ -0,0 +1,156 @@
+// Copyright 2013 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Closure user agent detection.
+ * @see http://en.wikipedia.org/wiki/User_agent
+ * For more information on browser brand, platform, or device see the other
+ * sub-namespaces in goog.labs.userAgent (browser, platform, and device).
+ *
+ */
+
+goog.provide('goog.labs.userAgent.engine');
+
+goog.require('goog.array');
+goog.require('goog.labs.userAgent.util');
+goog.require('goog.string');
+
+
+/**
+ * @return {boolean} Whether the rendering engine is Presto.
+ */
+goog.labs.userAgent.engine.isPresto = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Presto');
+};
+
+
+/**
+ * @return {boolean} Whether the rendering engine is Trident.
+ */
+goog.labs.userAgent.engine.isTrident = function() {
+  // IE only started including the Trident token in IE8.
+  return goog.labs.userAgent.util.matchUserAgent('Trident') ||
+      goog.labs.userAgent.util.matchUserAgent('MSIE');
+};
+
+
+/**
+ * @return {boolean} Whether the rendering engine is Edge.
+ */
+goog.labs.userAgent.engine.isEdge = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Edge');
+};
+
+
+/**
+ * @return {boolean} Whether the rendering engine is WebKit.
+ */
+goog.labs.userAgent.engine.isWebKit = function() {
+  return goog.labs.userAgent.util.matchUserAgentIgnoreCase('WebKit') &&
+      !goog.labs.userAgent.engine.isEdge();
+};
+
+
+/**
+ * @return {boolean} Whether the rendering engine is Gecko.
+ */
+goog.labs.userAgent.engine.isGecko = function() {
+  return goog.labs.userAgent.util.matchUserAgent('Gecko') &&
+      !goog.labs.userAgent.engine.isWebKit() &&
+      !goog.labs.userAgent.engine.isTrident() &&
+      !goog.labs.userAgent.engine.isEdge();
+};
+
+
+/**
+ * @return {string} The rendering engine's version or empty string if version
+ *     can't be determined.
+ */
+goog.labs.userAgent.engine.getVersion = function() {
+  var userAgentString = goog.labs.userAgent.util.getUserAgent();
+  if (userAgentString) {
+    var tuples = goog.labs.userAgent.util.extractVersionTuples(userAgentString);
+
+    var engineTuple = goog.labs.userAgent.engine.getEngineTuple_(tuples);
+    if (engineTuple) {
+      // In Gecko, the version string is either in the browser info or the
+      // Firefox version.  See Gecko user agent string reference:
+      // http://goo.gl/mULqa
+      if (engineTuple[0] == 'Gecko') {
+        return goog.labs.userAgent.engine.getVersionForKey_(tuples, 'Firefox');
+      }
+
+      return engineTuple[1];
+    }
+
+    // MSIE has only one version identifier, and the Trident version is
+    // specified in the parenthetical. IE Edge is covered in the engine tuple
+    // detection.
+    var browserTuple = tuples[0];
+    var info;
+    if (browserTuple && (info = browserTuple[2])) {
+      var match = /Trident\/([^\s;]+)/.exec(info);
+      if (match) {
+        return match[1];
+      }
+    }
+  }
+  return '';
+};
+
+
+/**
+ * @param {!Array<!Array<string>>} tuples Extracted version tuples.
+ * @return {!Array<string>|undefined} The engine tuple or undefined if not
+ *     found.
+ * @private
+ */
+goog.labs.userAgent.engine.getEngineTuple_ = function(tuples) {
+  if (!goog.labs.userAgent.engine.isEdge()) {
+    return tuples[1];
+  }
+  for (var i = 0; i < tuples.length; i++) {
+    var tuple = tuples[i];
+    if (tuple[0] == 'Edge') {
+      return tuple;
+    }
+  }
+};
+
+
+/**
+ * @param {string|number} version The version to check.
+ * @return {boolean} Whether the rendering engine version is higher or the same
+ *     as the given version.
+ */
+goog.labs.userAgent.engine.isVersionOrHigher = function(version) {
+  return goog.string.compareVersions(
+             goog.labs.userAgent.engine.getVersion(), version) >= 0;
+};
+
+
+/**
+ * @param {!Array<!Array<string>>} tuples Version tuples.
+ * @param {string} key The key to look for.
+ * @return {string} The version string of the given key, if present.
+ *     Otherwise, the empty string.
+ * @private
+ */
+goog.labs.userAgent.engine.getVersionForKey_ = function(tuples, key) {
+  // TODO(nnaze): Move to util if useful elsewhere.
+
+  var pair = goog.array.find(tuples, function(pair) { return key == pair[0]; });
+
+  return pair && pair[1] || '';
+};
diff --git a/js/goog/labs/useragent/util.js b/js/goog/labs/useragent/util.js
new file mode 100644
index 0000000..26d4847
--- /dev/null
+++ b/js/goog/labs/useragent/util.js
@@ -0,0 +1,147 @@
+// Copyright 2013 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Utilities used by goog.labs.userAgent tools. These functions
+ * should not be used outside of goog.labs.userAgent.*.
+ *
+ *
+ * @author nnaze@google.com (Nathan Naze)
+ */
+
+goog.provide('goog.labs.userAgent.util');
+
+goog.require('goog.string');
+
+
+/**
+ * Gets the native userAgent string from navigator if it exists.
+ * If navigator or navigator.userAgent string is missing, returns an empty
+ * string.
+ * @return {string}
+ * @private
+ */
+goog.labs.userAgent.util.getNativeUserAgentString_ = function() {
+  var navigator = goog.labs.userAgent.util.getNavigator_();
+  if (navigator) {
+    var userAgent = navigator.userAgent;
+    if (userAgent) {
+      return userAgent;
+    }
+  }
+  return '';
+};
+
+
+/**
+ * Getter for the native navigator.
+ * This is a separate function so it can be stubbed out in testing.
+ * @return {Navigator}
+ * @private
+ */
+goog.labs.userAgent.util.getNavigator_ = function() {
+  return goog.global.navigator;
+};
+
+
+/**
+ * A possible override for applications which wish to not check
+ * navigator.userAgent but use a specified value for detection instead.
+ * @private {string}
+ */
+goog.labs.userAgent.util.userAgent_ =
+    goog.labs.userAgent.util.getNativeUserAgentString_();
+
+
+/**
+ * Applications may override browser detection on the built in
+ * navigator.userAgent object by setting this string. Set to null to use the
+ * browser object instead.
+ * @param {?string=} opt_userAgent The User-Agent override.
+ */
+goog.labs.userAgent.util.setUserAgent = function(opt_userAgent) {
+  goog.labs.userAgent.util.userAgent_ =
+      opt_userAgent || goog.labs.userAgent.util.getNativeUserAgentString_();
+};
+
+
+/**
+ * @return {string} The user agent string.
+ */
+goog.labs.userAgent.util.getUserAgent = function() {
+  return goog.labs.userAgent.util.userAgent_;
+};
+
+
+/**
+ * @param {string} str
+ * @return {boolean} Whether the user agent contains the given string.
+ */
+goog.labs.userAgent.util.matchUserAgent = function(str) {
+  var userAgent = goog.labs.userAgent.util.getUserAgent();
+  return goog.string.contains(userAgent, str);
+};
+
+
+/**
+ * @param {string} str
+ * @return {boolean} Whether the user agent contains the given string, ignoring
+ *     case.
+ */
+goog.labs.userAgent.util.matchUserAgentIgnoreCase = function(str) {
+  var userAgent = goog.labs.userAgent.util.getUserAgent();
+  return goog.string.caseInsensitiveContains(userAgent, str);
+};
+
+
+/**
+ * Parses the user agent into tuples for each section.
+ * @param {string} userAgent
+ * @return {!Array<!Array<string>>} Tuples of key, version, and the contents
+ *     of the parenthetical.
+ */
+goog.labs.userAgent.util.extractVersionTuples = function(userAgent) {
+  // Matches each section of a user agent string.
+  // Example UA:
+  // Mozilla/5.0 (iPad; U; CPU OS 3_2_1 like Mac OS X; en-us)
+  // AppleWebKit/531.21.10 (KHTML, like Gecko) Mobile/7B405
+  // This has three version tuples: Mozilla, AppleWebKit, and Mobile.
+
+  var versionRegExp = new RegExp(
+      // Key. Note that a key may have a space.
+      // (i.e. 'Mobile Safari' in 'Mobile Safari/5.0')
+      '(\\w[\\w ]+)' +
+
+          '/' +                // slash
+          '([^\\s]+)' +        // version (i.e. '5.0b')
+          '\\s*' +             // whitespace
+          '(?:\\((.*?)\\))?',  // parenthetical info. parentheses not matched.
+      'g');
+
+  var data = [];
+  var match;
+
+  // Iterate and collect the version tuples.  Each iteration will be the
+  // next regex match.
+  while (match = versionRegExp.exec(userAgent)) {
+    data.push([
+      match[1],  // key
+      match[2],  // value
+      // || undefined as this is not undefined in IE7 and IE8
+      match[3] || undefined  // info
+    ]);
+  }
+
+  return data;
+};
diff --git a/js/goog/math/integer.js b/js/goog/math/integer.js
new file mode 100644
index 0000000..6907546
--- /dev/null
+++ b/js/goog/math/integer.js
@@ -0,0 +1,808 @@
+// Copyright 2009 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Defines an Integer class for representing (potentially)
+ * infinite length two's-complement integer values.
+ *
+ * For the specific case of 64-bit integers, use goog.math.Long, which is more
+ * efficient.
+ *
+ */
+
+goog.provide('goog.math.Integer');
+
+
+
+/**
+ * Constructs a two's-complement integer an array containing bits of the
+ * integer in 32-bit (signed) pieces, given in little-endian order (i.e.,
+ * lowest-order bits in the first piece), and the sign of -1 or 0.
+ *
+ * See the from* functions below for other convenient ways of constructing
+ * Integers.
+ *
+ * The internal representation of an integer is an array of 32-bit signed
+ * pieces, along with a sign (0 or -1) that indicates the contents of all the
+ * other 32-bit pieces out to infinity.  We use 32-bit pieces because these are
+ * the size of integers on which Javascript performs bit-operations.  For
+ * operations like addition and multiplication, we split each number into 16-bit
+ * pieces, which can easily be multiplied within Javascript's floating-point
+ * representation without overflow or change in sign.
+ *
+ * @struct
+ * @constructor
+ * @param {Array<number>} bits Array containing the bits of the number.
+ * @param {number} sign The sign of the number: -1 for negative and 0 positive.
+ * @final
+ */
+goog.math.Integer = function(bits, sign) {
+  /**
+   * @type {!Array<number>}
+   * @private
+   */
+  this.bits_ = [];
+
+  /**
+   * @type {number}
+   * @private
+   */
+  this.sign_ = sign;
+
+  // Copy the 32-bit signed integer values passed in.  We prune out those at the
+  // top that equal the sign since they are redundant.
+  var top = true;
+  for (var i = bits.length - 1; i >= 0; i--) {
+    var val = bits[i] | 0;
+    if (!top || val != sign) {
+      this.bits_[i] = val;
+      top = false;
+    }
+  }
+};
+
+
+// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+// from* methods on which they depend.
+
+
+/**
+ * A cache of the Integer representations of small integer values.
+ * @type {!Object}
+ * @private
+ */
+goog.math.Integer.IntCache_ = {};
+
+
+/**
+ * Returns an Integer representing the given (32-bit) integer value.
+ * @param {number} value A 32-bit integer value.
+ * @return {!goog.math.Integer} The corresponding Integer value.
+ */
+goog.math.Integer.fromInt = function(value) {
+  if (-128 <= value && value < 128) {
+    var cachedObj = goog.math.Integer.IntCache_[value];
+    if (cachedObj) {
+      return cachedObj;
+    }
+  }
+
+  var obj = new goog.math.Integer([value | 0], value < 0 ? -1 : 0);
+  if (-128 <= value && value < 128) {
+    goog.math.Integer.IntCache_[value] = obj;
+  }
+  return obj;
+};
+
+
+/**
+ * Returns an Integer representing the given value, provided that it is a finite
+ * number.  Otherwise, zero is returned.
+ * @param {number} value The value in question.
+ * @return {!goog.math.Integer} The corresponding Integer value.
+ */
+goog.math.Integer.fromNumber = function(value) {
+  if (isNaN(value) || !isFinite(value)) {
+    return goog.math.Integer.ZERO;
+  } else if (value < 0) {
+    return goog.math.Integer.fromNumber(-value).negate();
+  } else {
+    var bits = [];
+    var pow = 1;
+    for (var i = 0; value >= pow; i++) {
+      bits[i] = (value / pow) | 0;
+      pow *= goog.math.Integer.TWO_PWR_32_DBL_;
+    }
+    return new goog.math.Integer(bits, 0);
+  }
+};
+
+
+/**
+ * Returns a Integer representing the value that comes by concatenating the
+ * given entries, each is assumed to be 32 signed bits, given in little-endian
+ * order (lowest order bits in the lowest index), and sign-extending the highest
+ * order 32-bit value.
+ * @param {Array<number>} bits The bits of the number, in 32-bit signed pieces,
+ *     in little-endian order.
+ * @return {!goog.math.Integer} The corresponding Integer value.
+ */
+goog.math.Integer.fromBits = function(bits) {
+  var high = bits[bits.length - 1];
+  return new goog.math.Integer(bits, high & (1 << 31) ? -1 : 0);
+};
+
+
+/**
+ * Returns an Integer representation of the given string, written using the
+ * given radix.
+ * @param {string} str The textual representation of the Integer.
+ * @param {number=} opt_radix The radix in which the text is written.
+ * @return {!goog.math.Integer} The corresponding Integer value.
+ */
+goog.math.Integer.fromString = function(str, opt_radix) {
+  if (str.length == 0) {
+    throw Error('number format error: empty string');
+  }
+
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (str.charAt(0) == '-') {
+    return goog.math.Integer.fromString(str.substring(1), radix).negate();
+  } else if (str.indexOf('-') >= 0) {
+    throw Error('number format error: interior "-" character');
+  }
+
+  // Do several (8) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = goog.math.Integer.fromNumber(Math.pow(radix, 8));
+
+  var result = goog.math.Integer.ZERO;
+  for (var i = 0; i < str.length; i += 8) {
+    var size = Math.min(8, str.length - i);
+    var value = parseInt(str.substring(i, i + size), radix);
+    if (size < 8) {
+      var power = goog.math.Integer.fromNumber(Math.pow(radix, size));
+      result = result.multiply(power).add(goog.math.Integer.fromNumber(value));
+    } else {
+      result = result.multiply(radixToPower);
+      result = result.add(goog.math.Integer.fromNumber(value));
+    }
+  }
+  return result;
+};
+
+
+/**
+ * A number used repeatedly in calculations.  This must appear before the first
+ * call to the from* functions below.
+ * @type {number}
+ * @private
+ */
+goog.math.Integer.TWO_PWR_32_DBL_ = (1 << 16) * (1 << 16);
+
+
+/** @type {!goog.math.Integer} */
+goog.math.Integer.ZERO = goog.math.Integer.fromInt(0);
+
+
+/** @type {!goog.math.Integer} */
+goog.math.Integer.ONE = goog.math.Integer.fromInt(1);
+
+
+/**
+ * @type {!goog.math.Integer}
+ * @private
+ */
+goog.math.Integer.TWO_PWR_24_ = goog.math.Integer.fromInt(1 << 24);
+
+
+/**
+ * Returns the value, assuming it is a 32-bit integer.
+ * @return {number} The corresponding int value.
+ */
+goog.math.Integer.prototype.toInt = function() {
+  return this.bits_.length > 0 ? this.bits_[0] : this.sign_;
+};
+
+
+/** @return {number} The closest floating-point representation to this value. */
+goog.math.Integer.prototype.toNumber = function() {
+  if (this.isNegative()) {
+    return -this.negate().toNumber();
+  } else {
+    var val = 0;
+    var pow = 1;
+    for (var i = 0; i < this.bits_.length; i++) {
+      val += this.getBitsUnsigned(i) * pow;
+      pow *= goog.math.Integer.TWO_PWR_32_DBL_;
+    }
+    return val;
+  }
+};
+
+
+/**
+ * @param {number=} opt_radix The radix in which the text should be written.
+ * @return {string} The textual representation of this value.
+ * @override
+ */
+goog.math.Integer.prototype.toString = function(opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (this.isZero()) {
+    return '0';
+  } else if (this.isNegative()) {
+    return '-' + this.negate().toString(radix);
+  }
+
+  // Do several (6) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = goog.math.Integer.fromNumber(Math.pow(radix, 6));
+
+  var rem = this;
+  var result = '';
+  while (true) {
+    var remDiv = rem.divide(radixToPower);
+    // The right shifting fixes negative values in the case when
+    // intval >= 2^31; for more details see
+    // https://github.com/google/closure-library/pull/498
+    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt() >>> 0;
+    var digits = intval.toString(radix);
+
+    rem = remDiv;
+    if (rem.isZero()) {
+      return digits + result;
+    } else {
+      while (digits.length < 6) {
+        digits = '0' + digits;
+      }
+      result = '' + digits + result;
+    }
+  }
+};
+
+
+/**
+ * Returns the index-th 32-bit (signed) piece of the Integer according to
+ * little-endian order (i.e., index 0 contains the smallest bits).
+ * @param {number} index The index in question.
+ * @return {number} The requested 32-bits as a signed number.
+ */
+goog.math.Integer.prototype.getBits = function(index) {
+  if (index < 0) {
+    return 0;  // Allowing this simplifies bit shifting operations below...
+  } else if (index < this.bits_.length) {
+    return this.bits_[index];
+  } else {
+    return this.sign_;
+  }
+};
+
+
+/**
+ * Returns the index-th 32-bit piece as an unsigned number.
+ * @param {number} index The index in question.
+ * @return {number} The requested 32-bits as an unsigned number.
+ */
+goog.math.Integer.prototype.getBitsUnsigned = function(index) {
+  var val = this.getBits(index);
+  return val >= 0 ? val : goog.math.Integer.TWO_PWR_32_DBL_ + val;
+};
+
+
+/** @return {number} The sign bit of this number, -1 or 0. */
+goog.math.Integer.prototype.getSign = function() {
+  return this.sign_;
+};
+
+
+/** @return {boolean} Whether this value is zero. */
+goog.math.Integer.prototype.isZero = function() {
+  if (this.sign_ != 0) {
+    return false;
+  }
+  for (var i = 0; i < this.bits_.length; i++) {
+    if (this.bits_[i] != 0) {
+      return false;
+    }
+  }
+  return true;
+};
+
+
+/** @return {boolean} Whether this value is negative. */
+goog.math.Integer.prototype.isNegative = function() {
+  return this.sign_ == -1;
+};
+
+
+/** @return {boolean} Whether this value is odd. */
+goog.math.Integer.prototype.isOdd = function() {
+  return (this.bits_.length == 0) && (this.sign_ == -1) ||
+      (this.bits_.length > 0) && ((this.bits_[0] & 1) != 0);
+};
+
+
+/**
+ * @param {goog.math.Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer equals the other.
+ */
+goog.math.Integer.prototype.equals = function(other) {
+  if (this.sign_ != other.sign_) {
+    return false;
+  }
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  for (var i = 0; i < len; i++) {
+    if (this.getBits(i) != other.getBits(i)) {
+      return false;
+    }
+  }
+  return true;
+};
+
+
+/**
+ * @param {goog.math.Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer does not equal the other.
+ */
+goog.math.Integer.prototype.notEquals = function(other) {
+  return !this.equals(other);
+};
+
+
+/**
+ * @param {goog.math.Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is greater than the other.
+ */
+goog.math.Integer.prototype.greaterThan = function(other) {
+  return this.compare(other) > 0;
+};
+
+
+/**
+ * @param {goog.math.Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is greater than or equal to the other.
+ */
+goog.math.Integer.prototype.greaterThanOrEqual = function(other) {
+  return this.compare(other) >= 0;
+};
+
+
+/**
+ * @param {goog.math.Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is less than the other.
+ */
+goog.math.Integer.prototype.lessThan = function(other) {
+  return this.compare(other) < 0;
+};
+
+
+/**
+ * @param {goog.math.Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is less than or equal to the other.
+ */
+goog.math.Integer.prototype.lessThanOrEqual = function(other) {
+  return this.compare(other) <= 0;
+};
+
+
+/**
+ * Compares this Integer with the given one.
+ * @param {goog.math.Integer} other Integer to compare against.
+ * @return {number} 0 if they are the same, 1 if the this is greater, and -1
+ *     if the given one is greater.
+ */
+goog.math.Integer.prototype.compare = function(other) {
+  var diff = this.subtract(other);
+  if (diff.isNegative()) {
+    return -1;
+  } else if (diff.isZero()) {
+    return 0;
+  } else {
+    return +1;
+  }
+};
+
+
+/**
+ * Returns an integer with only the first numBits bits of this value, sign
+ * extended from the final bit.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Integer} The shorted integer value.
+ */
+goog.math.Integer.prototype.shorten = function(numBits) {
+  var arr_index = (numBits - 1) >> 5;
+  var bit_index = (numBits - 1) % 32;
+  var bits = [];
+  for (var i = 0; i < arr_index; i++) {
+    bits[i] = this.getBits(i);
+  }
+  var sigBits = bit_index == 31 ? 0xFFFFFFFF : (1 << (bit_index + 1)) - 1;
+  var val = this.getBits(arr_index) & sigBits;
+  if (val & (1 << bit_index)) {
+    val |= 0xFFFFFFFF - sigBits;
+    bits[arr_index] = val;
+    return new goog.math.Integer(bits, -1);
+  } else {
+    bits[arr_index] = val;
+    return new goog.math.Integer(bits, 0);
+  }
+};
+
+
+/** @return {!goog.math.Integer} The negation of this value. */
+goog.math.Integer.prototype.negate = function() {
+  return this.not().add(goog.math.Integer.ONE);
+};
+
+
+/**
+ * Returns the sum of this and the given Integer.
+ * @param {goog.math.Integer} other The Integer to add to this.
+ * @return {!goog.math.Integer} The Integer result.
+ */
+goog.math.Integer.prototype.add = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  var carry = 0;
+
+  for (var i = 0; i <= len; i++) {
+    var a1 = this.getBits(i) >>> 16;
+    var a0 = this.getBits(i) & 0xFFFF;
+
+    var b1 = other.getBits(i) >>> 16;
+    var b0 = other.getBits(i) & 0xFFFF;
+
+    var c0 = carry + a0 + b0;
+    var c1 = (c0 >>> 16) + a1 + b1;
+    carry = c1 >>> 16;
+    c0 &= 0xFFFF;
+    c1 &= 0xFFFF;
+    arr[i] = (c1 << 16) | c0;
+  }
+  return goog.math.Integer.fromBits(arr);
+};
+
+
+/**
+ * Returns the difference of this and the given Integer.
+ * @param {goog.math.Integer} other The Integer to subtract from this.
+ * @return {!goog.math.Integer} The Integer result.
+ */
+goog.math.Integer.prototype.subtract = function(other) {
+  return this.add(other.negate());
+};
+
+
+/**
+ * Returns the product of this and the given Integer.
+ * @param {goog.math.Integer} other The Integer to multiply against this.
+ * @return {!goog.math.Integer} The product of this and the other.
+ */
+goog.math.Integer.prototype.multiply = function(other) {
+  if (this.isZero()) {
+    return goog.math.Integer.ZERO;
+  } else if (other.isZero()) {
+    return goog.math.Integer.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().multiply(other.negate());
+    } else {
+      return this.negate().multiply(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.multiply(other.negate()).negate();
+  }
+
+  // If both numbers are small, use float multiplication
+  if (this.lessThan(goog.math.Integer.TWO_PWR_24_) &&
+      other.lessThan(goog.math.Integer.TWO_PWR_24_)) {
+    return goog.math.Integer.fromNumber(this.toNumber() * other.toNumber());
+  }
+
+  // Fill in an array of 16-bit products.
+  var len = this.bits_.length + other.bits_.length;
+  var arr = [];
+  for (var i = 0; i < 2 * len; i++) {
+    arr[i] = 0;
+  }
+  for (var i = 0; i < this.bits_.length; i++) {
+    for (var j = 0; j < other.bits_.length; j++) {
+      var a1 = this.getBits(i) >>> 16;
+      var a0 = this.getBits(i) & 0xFFFF;
+
+      var b1 = other.getBits(j) >>> 16;
+      var b0 = other.getBits(j) & 0xFFFF;
+
+      arr[2 * i + 2 * j] += a0 * b0;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j);
+      arr[2 * i + 2 * j + 1] += a1 * b0;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 1);
+      arr[2 * i + 2 * j + 1] += a0 * b1;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 1);
+      arr[2 * i + 2 * j + 2] += a1 * b1;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 2);
+    }
+  }
+
+  // Combine the 16-bit values into 32-bit values.
+  for (var i = 0; i < len; i++) {
+    arr[i] = (arr[2 * i + 1] << 16) | arr[2 * i];
+  }
+  for (var i = len; i < 2 * len; i++) {
+    arr[i] = 0;
+  }
+  return new goog.math.Integer(arr, 0);
+};
+
+
+/**
+ * Carries any overflow from the given index into later entries.
+ * @param {Array<number>} bits Array of 16-bit values in little-endian order.
+ * @param {number} index The index in question.
+ * @private
+ */
+goog.math.Integer.carry16_ = function(bits, index) {
+  while ((bits[index] & 0xFFFF) != bits[index]) {
+    bits[index + 1] += bits[index] >>> 16;
+    bits[index] &= 0xFFFF;
+    index++;
+  }
+};
+
+
+/**
+ * Returns "this" Integer divided by the given one. Both "this" and the given
+ * Integer MUST be positive.
+ *
+ * This method is only needed for very large numbers (>10^308),
+ * for which the original division algorithm gets into an infinite
+ * loop (see https://github.com/google/closure-library/issues/500).
+ *
+ * The algorithm has some possible performance enhancements (or
+ * could be rewritten entirely), it's just an initial solution for
+ * the issue linked above.
+ *
+ * @param {!goog.math.Integer} other The Integer to divide "this" by.
+ * @return {!goog.math.Integer} "this" value divided by the given one.
+ * @private
+ */
+goog.math.Integer.prototype.slowDivide_ = function(other) {
+  if (this.isNegative() || other.isNegative()) {
+    throw Error('slowDivide_ only works with positive integers.');
+  }
+
+  var twoPower = goog.math.Integer.ONE;
+  var multiple = other;
+
+  // First we have to figure out what the highest bit of the result
+  // is, so we increase "twoPower" and "multiple" until "multiple"
+  // exceeds "this".
+  while (multiple.lessThanOrEqual(this)) {
+    twoPower = twoPower.shiftLeft(1);
+    multiple = multiple.shiftLeft(1);
+  }
+
+  // Rewind by one power of two, giving us the highest bit of the
+  // result.
+  var res = twoPower.shiftRight(1);
+  var total = multiple.shiftRight(1);
+
+  // Now we starting decreasing "multiple" and "twoPower" to find the
+  // rest of the bits of the result.
+  var total2;
+  multiple = multiple.shiftRight(2);
+  twoPower = twoPower.shiftRight(2);
+  while (!multiple.isZero()) {
+    // whenever we can add "multiple" to the total and not exceed
+    // "this", that means we've found a 1 bit. Else we've found a 0
+    // and don't need to add to the result.
+    total2 = total.add(multiple);
+    if (total2.lessThanOrEqual(this)) {
+      res = res.add(twoPower);
+      total = total2;
+    }
+    multiple = multiple.shiftRight(1);
+    twoPower = twoPower.shiftRight(1);
+  }
+  return res;
+};
+
+
+/**
+ * Returns this Integer divided by the given one.
+ * @param {!goog.math.Integer} other The Integer to divide this by.
+ * @return {!goog.math.Integer} This value divided by the given one.
+ */
+goog.math.Integer.prototype.divide = function(other) {
+  if (other.isZero()) {
+    throw Error('division by zero');
+  } else if (this.isZero()) {
+    return goog.math.Integer.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().divide(other.negate());
+    } else {
+      return this.negate().divide(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.divide(other.negate()).negate();
+  }
+
+  // Have to degrade to slowDivide for Very Large Numbers, because
+  // they're out of range for the floating-point approximation
+  // technique used below.
+  if (this.bits_.length > 30) {
+    return this.slowDivide_(other);
+  }
+
+  // Repeat the following until the remainder is less than other:  find a
+  // floating-point that approximates remainder / other *from below*, add this
+  // into the result, and subtract it from the remainder.  It is critical that
+  // the approximate value is less than or equal to the real value so that the
+  // remainder never becomes negative.
+  var res = goog.math.Integer.ZERO;
+  var rem = this;
+  while (rem.greaterThanOrEqual(other)) {
+    // Approximate the result of division. This may be a little greater or
+    // smaller than the actual value.
+    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+
+    // We will tweak the approximate result by changing it in the 48-th digit or
+    // the smallest non-fractional digit, whichever is larger.
+    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
+
+    // Decrease the approximation until it is smaller than the remainder.  Note
+    // that if it is too large, the product overflows and is negative.
+    var approxRes = goog.math.Integer.fromNumber(approx);
+    var approxRem = approxRes.multiply(other);
+    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+      approx -= delta;
+      approxRes = goog.math.Integer.fromNumber(approx);
+      approxRem = approxRes.multiply(other);
+    }
+
+    // We know the answer can't be zero... and actually, zero would cause
+    // infinite recursion since we would make no progress.
+    if (approxRes.isZero()) {
+      approxRes = goog.math.Integer.ONE;
+    }
+
+    res = res.add(approxRes);
+    rem = rem.subtract(approxRem);
+  }
+  return res;
+};
+
+
+/**
+ * Returns this Integer modulo the given one.
+ * @param {!goog.math.Integer} other The Integer by which to mod.
+ * @return {!goog.math.Integer} This value modulo the given one.
+ */
+goog.math.Integer.prototype.modulo = function(other) {
+  return this.subtract(this.divide(other).multiply(other));
+};
+
+
+/** @return {!goog.math.Integer} The bitwise-NOT of this value. */
+goog.math.Integer.prototype.not = function() {
+  var len = this.bits_.length;
+  var arr = [];
+  for (var i = 0; i < len; i++) {
+    arr[i] = ~this.bits_[i];
+  }
+  return new goog.math.Integer(arr, ~this.sign_);
+};
+
+
+/**
+ * Returns the bitwise-AND of this Integer and the given one.
+ * @param {goog.math.Integer} other The Integer to AND with this.
+ * @return {!goog.math.Integer} The bitwise-AND of this and the other.
+ */
+goog.math.Integer.prototype.and = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  for (var i = 0; i < len; i++) {
+    arr[i] = this.getBits(i) & other.getBits(i);
+  }
+  return new goog.math.Integer(arr, this.sign_ & other.sign_);
+};
+
+
+/**
+ * Returns the bitwise-OR of this Integer and the given one.
+ * @param {goog.math.Integer} other The Integer to OR with this.
+ * @return {!goog.math.Integer} The bitwise-OR of this and the other.
+ */
+goog.math.Integer.prototype.or = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  for (var i = 0; i < len; i++) {
+    arr[i] = this.getBits(i) | other.getBits(i);
+  }
+  return new goog.math.Integer(arr, this.sign_ | other.sign_);
+};
+
+
+/**
+ * Returns the bitwise-XOR of this Integer and the given one.
+ * @param {goog.math.Integer} other The Integer to XOR with this.
+ * @return {!goog.math.Integer} The bitwise-XOR of this and the other.
+ */
+goog.math.Integer.prototype.xor = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  for (var i = 0; i < len; i++) {
+    arr[i] = this.getBits(i) ^ other.getBits(i);
+  }
+  return new goog.math.Integer(arr, this.sign_ ^ other.sign_);
+};
+
+
+/**
+ * Returns this value with bits shifted to the left by the given amount.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Integer} This shifted to the left by the given amount.
+ */
+goog.math.Integer.prototype.shiftLeft = function(numBits) {
+  var arr_delta = numBits >> 5;
+  var bit_delta = numBits % 32;
+  var len = this.bits_.length + arr_delta + (bit_delta > 0 ? 1 : 0);
+  var arr = [];
+  for (var i = 0; i < len; i++) {
+    if (bit_delta > 0) {
+      arr[i] = (this.getBits(i - arr_delta) << bit_delta) |
+          (this.getBits(i - arr_delta - 1) >>> (32 - bit_delta));
+    } else {
+      arr[i] = this.getBits(i - arr_delta);
+    }
+  }
+  return new goog.math.Integer(arr, this.sign_);
+};
+
+
+/**
+ * Returns this value with bits shifted to the right by the given amount.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Integer} This shifted to the right by the given amount.
+ */
+goog.math.Integer.prototype.shiftRight = function(numBits) {
+  var arr_delta = numBits >> 5;
+  var bit_delta = numBits % 32;
+  var len = this.bits_.length - arr_delta;
+  var arr = [];
+  for (var i = 0; i < len; i++) {
+    if (bit_delta > 0) {
+      arr[i] = (this.getBits(i + arr_delta) >>> bit_delta) |
+          (this.getBits(i + arr_delta + 1) << (32 - bit_delta));
+    } else {
+      arr[i] = this.getBits(i + arr_delta);
+    }
+  }
+  return new goog.math.Integer(arr, this.sign_);
+};
diff --git a/js/goog/math/long.js b/js/goog/math/long.js
new file mode 100644
index 0000000..5212caf
--- /dev/null
+++ b/js/goog/math/long.js
@@ -0,0 +1,965 @@
+// Copyright 2009 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Defines a Long class for representing a 64-bit two's-complement
+ * integer value, which faithfully simulates the behavior of a Java "long". This
+ * implementation is derived from LongLib in GWT.
+ *
+ */
+
+goog.provide('goog.math.Long');
+
+goog.require('goog.asserts');
+goog.require('goog.reflect');
+
+
+
+/**
+ * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
+ * values as *signed* integers.  See the from* functions below for more
+ * convenient ways of constructing Longs.
+ *
+ * The internal representation of a long is the two given signed, 32-bit values.
+ * We use 32-bit pieces because these are the size of integers on which
+ * Javascript performs bit-operations.  For operations like addition and
+ * multiplication, we split each number into 16-bit pieces, which can easily be
+ * multiplied within Javascript's floating-point representation without overflow
+ * or change in sign.
+ *
+ * In the algorithms below, we frequently reduce the negative case to the
+ * positive case by negating the input(s) and then post-processing the result.
+ * Note that we must ALWAYS check specially whether those values are MIN_VALUE
+ * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+ * a positive number, it overflows back into a negative).  Not handling this
+ * case would often result in infinite recursion.
+ *
+ * @param {number} low  The low (signed) 32 bits of the long.
+ * @param {number} high  The high (signed) 32 bits of the long.
+ * @struct
+ * @constructor
+ * @final
+ */
+goog.math.Long = function(low, high) {
+  /**
+   * @type {number}
+   * @private
+   */
+  this.low_ = low | 0;  // force into 32 signed bits.
+
+  /**
+   * @type {number}
+   * @private
+   */
+  this.high_ = high | 0;  // force into 32 signed bits.
+};
+
+
+// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+// from* methods on which they depend.
+
+
+/**
+ * A cache of the Long representations of small integer values.
+ * @type {!Object<number, !goog.math.Long>}
+ * @private
+ */
+goog.math.Long.IntCache_ = {};
+
+
+/**
+ * A cache of the Long representations of common values.
+ * @type {!Object<goog.math.Long.ValueCacheId_, !goog.math.Long>}
+ * @private
+ */
+goog.math.Long.valueCache_ = {};
+
+/**
+ * Returns a cached long number representing the given (32-bit) integer value.
+ * @param {number} value The 32-bit integer in question.
+ * @return {!goog.math.Long} The corresponding Long value.
+ * @private
+ */
+goog.math.Long.getCachedIntValue_ = function(value) {
+  return goog.reflect.cache(goog.math.Long.IntCache_, value, function(val) {
+    return new goog.math.Long(val, val < 0 ? -1 : 0);
+  });
+};
+
+/**
+ * The array of maximum values of a Long in string representation for a given
+ * radix between 2 and 36, inclusive.
+ * @private @const {!Array<string>}
+ */
+goog.math.Long.MAX_VALUE_FOR_RADIX_ = [
+  '', '',  // unused
+  '111111111111111111111111111111111111111111111111111111111111111',
+  // base 2
+  '2021110011022210012102010021220101220221',  // base 3
+  '13333333333333333333333333333333',          // base 4
+  '1104332401304422434310311212',              // base 5
+  '1540241003031030222122211',                 // base 6
+  '22341010611245052052300',                   // base 7
+  '777777777777777777777',                     // base 8
+  '67404283172107811827',                      // base 9
+  '9223372036854775807',                       // base 10
+  '1728002635214590697',                       // base 11
+  '41a792678515120367',                        // base 12
+  '10b269549075433c37',                        // base 13
+  '4340724c6c71dc7a7',                         // base 14
+  '160e2ad3246366807',                         // base 15
+  '7fffffffffffffff',                          // base 16
+  '33d3d8307b214008',                          // base 17
+  '16agh595df825fa7',                          // base 18
+  'ba643dci0ffeehh',                           // base 19
+  '5cbfjia3fh26ja7',                           // base 20
+  '2heiciiie82dh97',                           // base 21
+  '1adaibb21dckfa7',                           // base 22
+  'i6k448cf4192c2',                            // base 23
+  'acd772jnc9l0l7',                            // base 24
+  '64ie1focnn5g77',                            // base 25
+  '3igoecjbmca687',                            // base 26
+  '27c48l5b37oaop',                            // base 27
+  '1bk39f3ah3dmq7',                            // base 28
+  'q1se8f0m04isb',                             // base 29
+  'hajppbc1fc207',                             // base 30
+  'bm03i95hia437',                             // base 31
+  '7vvvvvvvvvvvv',                             // base 32
+  '5hg4ck9jd4u37',                             // base 33
+  '3tdtk1v8j6tpp',                             // base 34
+  '2pijmikexrxp7',                             // base 35
+  '1y2p0ij32e8e7'                              // base 36
+];
+
+
+/**
+ * The array of minimum values of a Long in string representation for a given
+ * radix between 2 and 36, inclusive.
+ * @private @const {!Array<string>}
+ */
+goog.math.Long.MIN_VALUE_FOR_RADIX_ = [
+  '', '',  // unused
+  '-1000000000000000000000000000000000000000000000000000000000000000',
+  // base 2
+  '-2021110011022210012102010021220101220222',  // base 3
+  '-20000000000000000000000000000000',          // base 4
+  '-1104332401304422434310311213',              // base 5
+  '-1540241003031030222122212',                 // base 6
+  '-22341010611245052052301',                   // base 7
+  '-1000000000000000000000',                    // base 8
+  '-67404283172107811828',                      // base 9
+  '-9223372036854775808',                       // base 10
+  '-1728002635214590698',                       // base 11
+  '-41a792678515120368',                        // base 12
+  '-10b269549075433c38',                        // base 13
+  '-4340724c6c71dc7a8',                         // base 14
+  '-160e2ad3246366808',                         // base 15
+  '-8000000000000000',                          // base 16
+  '-33d3d8307b214009',                          // base 17
+  '-16agh595df825fa8',                          // base 18
+  '-ba643dci0ffeehi',                           // base 19
+  '-5cbfjia3fh26ja8',                           // base 20
+  '-2heiciiie82dh98',                           // base 21
+  '-1adaibb21dckfa8',                           // base 22
+  '-i6k448cf4192c3',                            // base 23
+  '-acd772jnc9l0l8',                            // base 24
+  '-64ie1focnn5g78',                            // base 25
+  '-3igoecjbmca688',                            // base 26
+  '-27c48l5b37oaoq',                            // base 27
+  '-1bk39f3ah3dmq8',                            // base 28
+  '-q1se8f0m04isc',                             // base 29
+  '-hajppbc1fc208',                             // base 30
+  '-bm03i95hia438',                             // base 31
+  '-8000000000000',                             // base 32
+  '-5hg4ck9jd4u38',                             // base 33
+  '-3tdtk1v8j6tpq',                             // base 34
+  '-2pijmikexrxp8',                             // base 35
+  '-1y2p0ij32e8e8'                              // base 36
+];
+
+
+/**
+ * Returns a Long representing the given (32-bit) integer value.
+ * @param {number} value The 32-bit integer in question.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+goog.math.Long.fromInt = function(value) {
+  var intValue = value | 0;
+  goog.asserts.assert(value === intValue, 'value should be a 32-bit integer');
+
+  if (-128 <= intValue && intValue < 128) {
+    return goog.math.Long.getCachedIntValue_(intValue);
+  } else {
+    return new goog.math.Long(intValue, intValue < 0 ? -1 : 0);
+  }
+};
+
+
+/**
+ * Returns a Long representing the given value.
+ * NaN will be returned as zero. Infinity is converted to max value and
+ * -Infinity to min value.
+ * @param {number} value The number in question.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+goog.math.Long.fromNumber = function(value) {
+  if (isNaN(value)) {
+    return goog.math.Long.getZero();
+  } else if (value <= -goog.math.Long.TWO_PWR_63_DBL_) {
+    return goog.math.Long.getMinValue();
+  } else if (value + 1 >= goog.math.Long.TWO_PWR_63_DBL_) {
+    return goog.math.Long.getMaxValue();
+  } else if (value < 0) {
+    return goog.math.Long.fromNumber(-value).negate();
+  } else {
+    return new goog.math.Long(
+        (value % goog.math.Long.TWO_PWR_32_DBL_) | 0,
+        (value / goog.math.Long.TWO_PWR_32_DBL_) | 0);
+  }
+};
+
+
+/**
+ * Returns a Long representing the 64-bit integer that comes by concatenating
+ * the given high and low bits.  Each is assumed to use 32 bits.
+ * @param {number} lowBits The low 32-bits.
+ * @param {number} highBits The high 32-bits.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+goog.math.Long.fromBits = function(lowBits, highBits) {
+  return new goog.math.Long(lowBits, highBits);
+};
+
+
+/**
+ * Returns a Long representation of the given string, written using the given
+ * radix.
+ * @param {string} str The textual representation of the Long.
+ * @param {number=} opt_radix The radix in which the text is written.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+goog.math.Long.fromString = function(str, opt_radix) {
+  if (str.length == 0) {
+    throw Error('number format error: empty string');
+  }
+
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (str.charAt(0) == '-') {
+    return goog.math.Long.fromString(str.substring(1), radix).negate();
+  } else if (str.indexOf('-') >= 0) {
+    throw Error('number format error: interior "-" character: ' + str);
+  }
+
+  // Do several (8) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = goog.math.Long.fromNumber(Math.pow(radix, 8));
+
+  var result = goog.math.Long.getZero();
+  for (var i = 0; i < str.length; i += 8) {
+    var size = Math.min(8, str.length - i);
+    var value = parseInt(str.substring(i, i + size), radix);
+    if (size < 8) {
+      var power = goog.math.Long.fromNumber(Math.pow(radix, size));
+      result = result.multiply(power).add(goog.math.Long.fromNumber(value));
+    } else {
+      result = result.multiply(radixToPower);
+      result = result.add(goog.math.Long.fromNumber(value));
+    }
+  }
+  return result;
+};
+
+/**
+ * Returns the boolean value of whether the input string is within a Long's
+ * range. Assumes an input string containing only numeric characters with an
+ * optional preceding '-'.
+ * @param {string} str The textual representation of the Long.
+ * @param {number=} opt_radix The radix in which the text is written.
+ * @return {boolean} Whether the string is within the range of a Long.
+ */
+goog.math.Long.isStringInRange = function(str, opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  var extremeValue = (str.charAt(0) == '-') ?
+      goog.math.Long.MIN_VALUE_FOR_RADIX_[radix] :
+      goog.math.Long.MAX_VALUE_FOR_RADIX_[radix];
+
+  if (str.length < extremeValue.length) {
+    return true;
+  } else if (str.length == extremeValue.length && str <= extremeValue) {
+    return true;
+  } else {
+    return false;
+  }
+};
+
+// NOTE: the compiler should inline these constant values below and then remove
+// these variables, so there should be no runtime penalty for these.
+
+
+/**
+ * Number used repeated below in calculations.  This must appear before the
+ * first call to any from* function below.
+ * @type {number}
+ * @private
+ */
+goog.math.Long.TWO_PWR_16_DBL_ = 1 << 16;
+
+
+/**
+ * @type {number}
+ * @private
+ */
+goog.math.Long.TWO_PWR_32_DBL_ =
+    goog.math.Long.TWO_PWR_16_DBL_ * goog.math.Long.TWO_PWR_16_DBL_;
+
+
+/**
+ * @type {number}
+ * @private
+ */
+goog.math.Long.TWO_PWR_64_DBL_ =
+    goog.math.Long.TWO_PWR_32_DBL_ * goog.math.Long.TWO_PWR_32_DBL_;
+
+
+/**
+ * @type {number}
+ * @private
+ */
+goog.math.Long.TWO_PWR_63_DBL_ = goog.math.Long.TWO_PWR_64_DBL_ / 2;
+
+
+/**
+ * @return {!goog.math.Long}
+ * @public
+ */
+goog.math.Long.getZero = function() {
+  return goog.math.Long.getCachedIntValue_(0);
+};
+
+
+/**
+ * @return {!goog.math.Long}
+ * @public
+ */
+goog.math.Long.getOne = function() {
+  return goog.math.Long.getCachedIntValue_(1);
+};
+
+
+/**
+ * @return {!goog.math.Long}
+ * @public
+ */
+goog.math.Long.getNegOne = function() {
+  return goog.math.Long.getCachedIntValue_(-1);
+};
+
+
+/**
+ * @return {!goog.math.Long}
+ * @public
+ */
+goog.math.Long.getMaxValue = function() {
+  return goog.reflect.cache(
+      goog.math.Long.valueCache_, goog.math.Long.ValueCacheId_.MAX_VALUE,
+      function() {
+        return goog.math.Long.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
+      });
+};
+
+
+/**
+ * @return {!goog.math.Long}
+ * @public
+ */
+goog.math.Long.getMinValue = function() {
+  return goog.reflect.cache(
+      goog.math.Long.valueCache_, goog.math.Long.ValueCacheId_.MIN_VALUE,
+      function() { return goog.math.Long.fromBits(0, 0x80000000 | 0); });
+};
+
+
+/**
+ * @return {!goog.math.Long}
+ * @public
+ */
+goog.math.Long.getTwoPwr24 = function() {
+  return goog.reflect.cache(
+      goog.math.Long.valueCache_, goog.math.Long.ValueCacheId_.TWO_PWR_24,
+      function() { return goog.math.Long.fromInt(1 << 24); });
+};
+
+
+/** @return {number} The value, assuming it is a 32-bit integer. */
+goog.math.Long.prototype.toInt = function() {
+  return this.low_;
+};
+
+
+/** @return {number} The closest floating-point representation to this value. */
+goog.math.Long.prototype.toNumber = function() {
+  return this.high_ * goog.math.Long.TWO_PWR_32_DBL_ +
+      this.getLowBitsUnsigned();
+};
+
+
+/**
+ * @param {number=} opt_radix The radix in which the text should be written.
+ * @return {string} The textual representation of this value.
+ * @override
+ */
+goog.math.Long.prototype.toString = function(opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (this.isZero()) {
+    return '0';
+  }
+
+  if (this.isNegative()) {
+    if (this.equals(goog.math.Long.getMinValue())) {
+      // We need to change the Long value before it can be negated, so we remove
+      // the bottom-most digit in this base and then recurse to do the rest.
+      var radixLong = goog.math.Long.fromNumber(radix);
+      var div = this.div(radixLong);
+      var rem = div.multiply(radixLong).subtract(this);
+      return div.toString(radix) + rem.toInt().toString(radix);
+    } else {
+      return '-' + this.negate().toString(radix);
+    }
+  }
+
+  // Do several (6) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = goog.math.Long.fromNumber(Math.pow(radix, 6));
+
+  var rem = this;
+  var result = '';
+  while (true) {
+    var remDiv = rem.div(radixToPower);
+    // The right shifting fixes negative values in the case when
+    // intval >= 2^31; for more details see
+    // https://github.com/google/closure-library/pull/498
+    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt() >>> 0;
+    var digits = intval.toString(radix);
+
+    rem = remDiv;
+    if (rem.isZero()) {
+      return digits + result;
+    } else {
+      while (digits.length < 6) {
+        digits = '0' + digits;
+      }
+      result = '' + digits + result;
+    }
+  }
+};
+
+
+/** @return {number} The high 32-bits as a signed value. */
+goog.math.Long.prototype.getHighBits = function() {
+  return this.high_;
+};
+
+
+/** @return {number} The low 32-bits as a signed value. */
+goog.math.Long.prototype.getLowBits = function() {
+  return this.low_;
+};
+
+
+/** @return {number} The low 32-bits as an unsigned value. */
+goog.math.Long.prototype.getLowBitsUnsigned = function() {
+  return (this.low_ >= 0) ? this.low_ :
+                            goog.math.Long.TWO_PWR_32_DBL_ + this.low_;
+};
+
+
+/**
+ * @return {number} Returns the number of bits needed to represent the absolute
+ *     value of this Long.
+ */
+goog.math.Long.prototype.getNumBitsAbs = function() {
+  if (this.isNegative()) {
+    if (this.equals(goog.math.Long.getMinValue())) {
+      return 64;
+    } else {
+      return this.negate().getNumBitsAbs();
+    }
+  } else {
+    var val = this.high_ != 0 ? this.high_ : this.low_;
+    for (var bit = 31; bit > 0; bit--) {
+      if ((val & (1 << bit)) != 0) {
+        break;
+      }
+    }
+    return this.high_ != 0 ? bit + 33 : bit + 1;
+  }
+};
+
+
+/** @return {boolean} Whether this value is zero. */
+goog.math.Long.prototype.isZero = function() {
+  return this.high_ == 0 && this.low_ == 0;
+};
+
+
+/** @return {boolean} Whether this value is negative. */
+goog.math.Long.prototype.isNegative = function() {
+  return this.high_ < 0;
+};
+
+
+/** @return {boolean} Whether this value is odd. */
+goog.math.Long.prototype.isOdd = function() {
+  return (this.low_ & 1) == 1;
+};
+
+
+/**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long equals the other.
+ */
+goog.math.Long.prototype.equals = function(other) {
+  return (this.high_ == other.high_) && (this.low_ == other.low_);
+};
+
+
+/**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long does not equal the other.
+ */
+goog.math.Long.prototype.notEquals = function(other) {
+  return (this.high_ != other.high_) || (this.low_ != other.low_);
+};
+
+
+/**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is less than the other.
+ */
+goog.math.Long.prototype.lessThan = function(other) {
+  return this.compare(other) < 0;
+};
+
+
+/**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is less than or equal to the other.
+ */
+goog.math.Long.prototype.lessThanOrEqual = function(other) {
+  return this.compare(other) <= 0;
+};
+
+
+/**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is greater than the other.
+ */
+goog.math.Long.prototype.greaterThan = function(other) {
+  return this.compare(other) > 0;
+};
+
+
+/**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is greater than or equal to the other.
+ */
+goog.math.Long.prototype.greaterThanOrEqual = function(other) {
+  return this.compare(other) >= 0;
+};
+
+
+/**
+ * Compares this Long with the given one.
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {number} 0 if they are the same, 1 if the this is greater, and -1
+ *     if the given one is greater.
+ */
+goog.math.Long.prototype.compare = function(other) {
+  if (this.equals(other)) {
+    return 0;
+  }
+
+  var thisNeg = this.isNegative();
+  var otherNeg = other.isNegative();
+  if (thisNeg && !otherNeg) {
+    return -1;
+  }
+  if (!thisNeg && otherNeg) {
+    return 1;
+  }
+
+  // at this point, the signs are the same, so subtraction will not overflow
+  if (this.subtract(other).isNegative()) {
+    return -1;
+  } else {
+    return 1;
+  }
+};
+
+
+/** @return {!goog.math.Long} The negation of this value. */
+goog.math.Long.prototype.negate = function() {
+  if (this.equals(goog.math.Long.getMinValue())) {
+    return goog.math.Long.getMinValue();
+  } else {
+    return this.not().add(goog.math.Long.getOne());
+  }
+};
+
+
+/**
+ * Returns the sum of this and the given Long.
+ * @param {goog.math.Long} other Long to add to this one.
+ * @return {!goog.math.Long} The sum of this and the given Long.
+ */
+goog.math.Long.prototype.add = function(other) {
+  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 + b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 + b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 + b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 + b48;
+  c48 &= 0xFFFF;
+  return goog.math.Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+
+/**
+ * Returns the difference of this and the given Long.
+ * @param {goog.math.Long} other Long to subtract from this.
+ * @return {!goog.math.Long} The difference of this and the given Long.
+ */
+goog.math.Long.prototype.subtract = function(other) {
+  return this.add(other.negate());
+};
+
+
+/**
+ * Returns the product of this and the given long.
+ * @param {goog.math.Long} other Long to multiply with this.
+ * @return {!goog.math.Long} The product of this and the other.
+ */
+goog.math.Long.prototype.multiply = function(other) {
+  if (this.isZero()) {
+    return goog.math.Long.getZero();
+  } else if (other.isZero()) {
+    return goog.math.Long.getZero();
+  }
+
+  if (this.equals(goog.math.Long.getMinValue())) {
+    return other.isOdd() ? goog.math.Long.getMinValue() :
+                           goog.math.Long.getZero();
+  } else if (other.equals(goog.math.Long.getMinValue())) {
+    return this.isOdd() ? goog.math.Long.getMinValue() :
+                          goog.math.Long.getZero();
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().multiply(other.negate());
+    } else {
+      return this.negate().multiply(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.multiply(other.negate()).negate();
+  }
+
+  // If both longs are small, use float multiplication
+  if (this.lessThan(goog.math.Long.getTwoPwr24()) &&
+      other.lessThan(goog.math.Long.getTwoPwr24())) {
+    return goog.math.Long.fromNumber(this.toNumber() * other.toNumber());
+  }
+
+  // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.
+  // We can skip products that would overflow.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 * b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 * b00;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c16 += a00 * b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 * b00;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a16 * b16;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a00 * b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+  c48 &= 0xFFFF;
+  return goog.math.Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+
+/**
+ * Returns this Long divided by the given one.
+ * @param {goog.math.Long} other Long by which to divide.
+ * @return {!goog.math.Long} This Long divided by the given one.
+ */
+goog.math.Long.prototype.div = function(other) {
+  if (other.isZero()) {
+    throw Error('division by zero');
+  } else if (this.isZero()) {
+    return goog.math.Long.getZero();
+  }
+
+  if (this.equals(goog.math.Long.getMinValue())) {
+    if (other.equals(goog.math.Long.getOne()) ||
+        other.equals(goog.math.Long.getNegOne())) {
+      return goog.math.Long.getMinValue();  // recall -MIN_VALUE == MIN_VALUE
+    } else if (other.equals(goog.math.Long.getMinValue())) {
+      return goog.math.Long.getOne();
+    } else {
+      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+      var halfThis = this.shiftRight(1);
+      var approx = halfThis.div(other).shiftLeft(1);
+      if (approx.equals(goog.math.Long.getZero())) {
+        return other.isNegative() ? goog.math.Long.getOne() :
+                                    goog.math.Long.getNegOne();
+      } else {
+        var rem = this.subtract(other.multiply(approx));
+        var result = approx.add(rem.div(other));
+        return result;
+      }
+    }
+  } else if (other.equals(goog.math.Long.getMinValue())) {
+    return goog.math.Long.getZero();
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().div(other.negate());
+    } else {
+      return this.negate().div(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.div(other.negate()).negate();
+  }
+
+  // Repeat the following until the remainder is less than other:  find a
+  // floating-point that approximates remainder / other *from below*, add this
+  // into the result, and subtract it from the remainder.  It is critical that
+  // the approximate value is less than or equal to the real value so that the
+  // remainder never becomes negative.
+  var res = goog.math.Long.getZero();
+  var rem = this;
+  while (rem.greaterThanOrEqual(other)) {
+    // Approximate the result of division. This may be a little greater or
+    // smaller than the actual value.
+    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+
+    // We will tweak the approximate result by changing it in the 48-th digit or
+    // the smallest non-fractional digit, whichever is larger.
+    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
+
+    // Decrease the approximation until it is smaller than the remainder.  Note
+    // that if it is too large, the product overflows and is negative.
+    var approxRes = goog.math.Long.fromNumber(approx);
+    var approxRem = approxRes.multiply(other);
+    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+      approx -= delta;
+      approxRes = goog.math.Long.fromNumber(approx);
+      approxRem = approxRes.multiply(other);
+    }
+
+    // We know the answer can't be zero... and actually, zero would cause
+    // infinite recursion since we would make no progress.
+    if (approxRes.isZero()) {
+      approxRes = goog.math.Long.getOne();
+    }
+
+    res = res.add(approxRes);
+    rem = rem.subtract(approxRem);
+  }
+  return res;
+};
+
+
+/**
+ * Returns this Long modulo the given one.
+ * @param {goog.math.Long} other Long by which to mod.
+ * @return {!goog.math.Long} This Long modulo the given one.
+ */
+goog.math.Long.prototype.modulo = function(other) {
+  return this.subtract(this.div(other).multiply(other));
+};
+
+
+/** @return {!goog.math.Long} The bitwise-NOT of this value. */
+goog.math.Long.prototype.not = function() {
+  return goog.math.Long.fromBits(~this.low_, ~this.high_);
+};
+
+
+/**
+ * Returns the bitwise-AND of this Long and the given one.
+ * @param {goog.math.Long} other The Long with which to AND.
+ * @return {!goog.math.Long} The bitwise-AND of this and the other.
+ */
+goog.math.Long.prototype.and = function(other) {
+  return goog.math.Long.fromBits(
+      this.low_ & other.low_, this.high_ & other.high_);
+};
+
+
+/**
+ * Returns the bitwise-OR of this Long and the given one.
+ * @param {goog.math.Long} other The Long with which to OR.
+ * @return {!goog.math.Long} The bitwise-OR of this and the other.
+ */
+goog.math.Long.prototype.or = function(other) {
+  return goog.math.Long.fromBits(
+      this.low_ | other.low_, this.high_ | other.high_);
+};
+
+
+/**
+ * Returns the bitwise-XOR of this Long and the given one.
+ * @param {goog.math.Long} other The Long with which to XOR.
+ * @return {!goog.math.Long} The bitwise-XOR of this and the other.
+ */
+goog.math.Long.prototype.xor = function(other) {
+  return goog.math.Long.fromBits(
+      this.low_ ^ other.low_, this.high_ ^ other.high_);
+};
+
+
+/**
+ * Returns this Long with bits shifted to the left by the given amount.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Long} This shifted to the left by the given amount.
+ */
+goog.math.Long.prototype.shiftLeft = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var low = this.low_;
+    if (numBits < 32) {
+      var high = this.high_;
+      return goog.math.Long.fromBits(
+          low << numBits, (high << numBits) | (low >>> (32 - numBits)));
+    } else {
+      return goog.math.Long.fromBits(0, low << (numBits - 32));
+    }
+  }
+};
+
+
+/**
+ * Returns this Long with bits shifted to the right by the given amount.
+ * The new leading bits match the current sign bit.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Long} This shifted to the right by the given amount.
+ */
+goog.math.Long.prototype.shiftRight = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return goog.math.Long.fromBits(
+          (low >>> numBits) | (high << (32 - numBits)), high >> numBits);
+    } else {
+      return goog.math.Long.fromBits(
+          high >> (numBits - 32), high >= 0 ? 0 : -1);
+    }
+  }
+};
+
+
+/**
+ * Returns this Long with bits shifted to the right by the given amount, with
+ * zeros placed into the new leading bits.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Long} This shifted to the right by the given amount, with
+ *     zeros placed into the new leading bits.
+ */
+goog.math.Long.prototype.shiftRightUnsigned = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return goog.math.Long.fromBits(
+          (low >>> numBits) | (high << (32 - numBits)), high >>> numBits);
+    } else if (numBits == 32) {
+      return goog.math.Long.fromBits(high, 0);
+    } else {
+      return goog.math.Long.fromBits(high >>> (numBits - 32), 0);
+    }
+  }
+};
+
+
+/**
+ * @enum {number} Ids of commonly requested Long instances.
+ * @private
+ */
+goog.math.Long.ValueCacheId_ = {
+  MAX_VALUE: 1,
+  MIN_VALUE: 2,
+  TWO_PWR_24: 6
+};
diff --git a/js/goog/math/math.js b/js/goog/math/math.js
new file mode 100644
index 0000000..b8dbfb0
--- /dev/null
+++ b/js/goog/math/math.js
@@ -0,0 +1,448 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Additional mathematical functions.
+ */
+
+goog.provide('goog.math');
+
+goog.require('goog.array');
+goog.require('goog.asserts');
+
+
+/**
+ * Returns a random integer greater than or equal to 0 and less than {@code a}.
+ * @param {number} a  The upper bound for the random integer (exclusive).
+ * @return {number} A random integer N such that 0 <= N < a.
+ */
+goog.math.randomInt = function(a) {
+  return Math.floor(Math.random() * a);
+};
+
+
+/**
+ * Returns a random number greater than or equal to {@code a} and less than
+ * {@code b}.
+ * @param {number} a  The lower bound for the random number (inclusive).
+ * @param {number} b  The upper bound for the random number (exclusive).
+ * @return {number} A random number N such that a <= N < b.
+ */
+goog.math.uniformRandom = function(a, b) {
+  return a + Math.random() * (b - a);
+};
+
+
+/**
+ * Takes a number and clamps it to within the provided bounds.
+ * @param {number} value The input number.
+ * @param {number} min The minimum value to return.
+ * @param {number} max The maximum value to return.
+ * @return {number} The input number if it is within bounds, or the nearest
+ *     number within the bounds.
+ */
+goog.math.clamp = function(value, min, max) {
+  return Math.min(Math.max(value, min), max);
+};
+
+
+/**
+ * The % operator in JavaScript returns the remainder of a / b, but differs from
+ * some other languages in that the result will have the same sign as the
+ * dividend. For example, -1 % 8 == -1, whereas in some other languages
+ * (such as Python) the result would be 7. This function emulates the more
+ * correct modulo behavior, which is useful for certain applications such as
+ * calculating an offset index in a circular list.
+ *
+ * @param {number} a The dividend.
+ * @param {number} b The divisor.
+ * @return {number} a % b where the result is between 0 and b (either 0 <= x < b
+ *     or b < x <= 0, depending on the sign of b).
+ */
+goog.math.modulo = function(a, b) {
+  var r = a % b;
+  // If r and b differ in sign, add b to wrap the result to the correct sign.
+  return (r * b < 0) ? r + b : r;
+};
+
+
+/**
+ * Performs linear interpolation between values a and b. Returns the value
+ * between a and b proportional to x (when x is between 0 and 1. When x is
+ * outside this range, the return value is a linear extrapolation).
+ * @param {number} a A number.
+ * @param {number} b A number.
+ * @param {number} x The proportion between a and b.
+ * @return {number} The interpolated value between a and b.
+ */
+goog.math.lerp = function(a, b, x) {
+  return a + x * (b - a);
+};
+
+
+/**
+ * Tests whether the two values are equal to each other, within a certain
+ * tolerance to adjust for floating point errors.
+ * @param {number} a A number.
+ * @param {number} b A number.
+ * @param {number=} opt_tolerance Optional tolerance range. Defaults
+ *     to 0.000001. If specified, should be greater than 0.
+ * @return {boolean} Whether {@code a} and {@code b} are nearly equal.
+ */
+goog.math.nearlyEquals = function(a, b, opt_tolerance) {
+  return Math.abs(a - b) <= (opt_tolerance || 0.000001);
+};
+
+
+// TODO(user): Rename to normalizeAngle, retaining old name as deprecated
+// alias.
+/**
+ * Normalizes an angle to be in range [0-360). Angles outside this range will
+ * be normalized to be the equivalent angle with that range.
+ * @param {number} angle Angle in degrees.
+ * @return {number} Standardized angle.
+ */
+goog.math.standardAngle = function(angle) {
+  return goog.math.modulo(angle, 360);
+};
+
+
+/**
+ * Normalizes an angle to be in range [0-2*PI). Angles outside this range will
+ * be normalized to be the equivalent angle with that range.
+ * @param {number} angle Angle in radians.
+ * @return {number} Standardized angle.
+ */
+goog.math.standardAngleInRadians = function(angle) {
+  return goog.math.modulo(angle, 2 * Math.PI);
+};
+
+
+/**
+ * Converts degrees to radians.
+ * @param {number} angleDegrees Angle in degrees.
+ * @return {number} Angle in radians.
+ */
+goog.math.toRadians = function(angleDegrees) {
+  return angleDegrees * Math.PI / 180;
+};
+
+
+/**
+ * Converts radians to degrees.
+ * @param {number} angleRadians Angle in radians.
+ * @return {number} Angle in degrees.
+ */
+goog.math.toDegrees = function(angleRadians) {
+  return angleRadians * 180 / Math.PI;
+};
+
+
+/**
+ * For a given angle and radius, finds the X portion of the offset.
+ * @param {number} degrees Angle in degrees (zero points in +X direction).
+ * @param {number} radius Radius.
+ * @return {number} The x-distance for the angle and radius.
+ */
+goog.math.angleDx = function(degrees, radius) {
+  return radius * Math.cos(goog.math.toRadians(degrees));
+};
+
+
+/**
+ * For a given angle and radius, finds the Y portion of the offset.
+ * @param {number} degrees Angle in degrees (zero points in +X direction).
+ * @param {number} radius Radius.
+ * @return {number} The y-distance for the angle and radius.
+ */
+goog.math.angleDy = function(degrees, radius) {
+  return radius * Math.sin(goog.math.toRadians(degrees));
+};
+
+
+/**
+ * Computes the angle between two points (x1,y1) and (x2,y2).
+ * Angle zero points in the +X direction, 90 degrees points in the +Y
+ * direction (down) and from there we grow clockwise towards 360 degrees.
+ * @param {number} x1 x of first point.
+ * @param {number} y1 y of first point.
+ * @param {number} x2 x of second point.
+ * @param {number} y2 y of second point.
+ * @return {number} Standardized angle in degrees of the vector from
+ *     x1,y1 to x2,y2.
+ */
+goog.math.angle = function(x1, y1, x2, y2) {
+  return goog.math.standardAngle(
+      goog.math.toDegrees(Math.atan2(y2 - y1, x2 - x1)));
+};
+
+
+/**
+ * Computes the difference between startAngle and endAngle (angles in degrees).
+ * @param {number} startAngle  Start angle in degrees.
+ * @param {number} endAngle  End angle in degrees.
+ * @return {number} The number of degrees that when added to
+ *     startAngle will result in endAngle. Positive numbers mean that the
+ *     direction is clockwise. Negative numbers indicate a counter-clockwise
+ *     direction.
+ *     The shortest route (clockwise vs counter-clockwise) between the angles
+ *     is used.
+ *     When the difference is 180 degrees, the function returns 180 (not -180)
+ *     angleDifference(30, 40) is 10, and angleDifference(40, 30) is -10.
+ *     angleDifference(350, 10) is 20, and angleDifference(10, 350) is -20.
+ */
+goog.math.angleDifference = function(startAngle, endAngle) {
+  var d =
+      goog.math.standardAngle(endAngle) - goog.math.standardAngle(startAngle);
+  if (d > 180) {
+    d = d - 360;
+  } else if (d <= -180) {
+    d = 360 + d;
+  }
+  return d;
+};
+
+
+/**
+ * Returns the sign of a number as per the "sign" or "signum" function.
+ * @param {number} x The number to take the sign of.
+ * @return {number} -1 when negative, 1 when positive, 0 when 0. Preserves
+ *     signed zeros and NaN.
+ */
+goog.math.sign = function(x) {
+  if (x > 0) {
+    return 1;
+  }
+  if (x < 0) {
+    return -1;
+  }
+  return x;  // Preserves signed zeros and NaN.
+};
+
+
+/**
+ * JavaScript implementation of Longest Common Subsequence problem.
+ * http://en.wikipedia.org/wiki/Longest_common_subsequence
+ *
+ * Returns the longest possible array that is subarray of both of given arrays.
+ *
+ * @param {IArrayLike<S>} array1 First array of objects.
+ * @param {IArrayLike<T>} array2 Second array of objects.
+ * @param {Function=} opt_compareFn Function that acts as a custom comparator
+ *     for the array ojects. Function should return true if objects are equal,
+ *     otherwise false.
+ * @param {Function=} opt_collectorFn Function used to decide what to return
+ *     as a result subsequence. It accepts 2 arguments: index of common element
+ *     in the first array and index in the second. The default function returns
+ *     element from the first array.
+ * @return {!Array<S|T>} A list of objects that are common to both arrays
+ *     such that there is no common subsequence with size greater than the
+ *     length of the list.
+ * @template S,T
+ */
+goog.math.longestCommonSubsequence = function(
+    array1, array2, opt_compareFn, opt_collectorFn) {
+
+  var compare = opt_compareFn || function(a, b) { return a == b; };
+
+  var collect = opt_collectorFn || function(i1, i2) { return array1[i1]; };
+
+  var length1 = array1.length;
+  var length2 = array2.length;
+
+  var arr = [];
+  for (var i = 0; i < length1 + 1; i++) {
+    arr[i] = [];
+    arr[i][0] = 0;
+  }
+
+  for (var j = 0; j < length2 + 1; j++) {
+    arr[0][j] = 0;
+  }
+
+  for (i = 1; i <= length1; i++) {
+    for (j = 1; j <= length2; j++) {
+      if (compare(array1[i - 1], array2[j - 1])) {
+        arr[i][j] = arr[i - 1][j - 1] + 1;
+      } else {
+        arr[i][j] = Math.max(arr[i - 1][j], arr[i][j - 1]);
+      }
+    }
+  }
+
+  // Backtracking
+  var result = [];
+  var i = length1, j = length2;
+  while (i > 0 && j > 0) {
+    if (compare(array1[i - 1], array2[j - 1])) {
+      result.unshift(collect(i - 1, j - 1));
+      i--;
+      j--;
+    } else {
+      if (arr[i - 1][j] > arr[i][j - 1]) {
+        i--;
+      } else {
+        j--;
+      }
+    }
+  }
+
+  return result;
+};
+
+
+/**
+ * Returns the sum of the arguments.
+ * @param {...number} var_args Numbers to add.
+ * @return {number} The sum of the arguments (0 if no arguments were provided,
+ *     {@code NaN} if any of the arguments is not a valid number).
+ */
+goog.math.sum = function(var_args) {
+  return /** @type {number} */ (
+      goog.array.reduce(
+          arguments, function(sum, value) { return sum + value; }, 0));
+};
+
+
+/**
+ * Returns the arithmetic mean of the arguments.
+ * @param {...number} var_args Numbers to average.
+ * @return {number} The average of the arguments ({@code NaN} if no arguments
+ *     were provided or any of the arguments is not a valid number).
+ */
+goog.math.average = function(var_args) {
+  return goog.math.sum.apply(null, arguments) / arguments.length;
+};
+
+
+/**
+ * Returns the unbiased sample variance of the arguments. For a definition,
+ * see e.g. http://en.wikipedia.org/wiki/Variance
+ * @param {...number} var_args Number samples to analyze.
+ * @return {number} The unbiased sample variance of the arguments (0 if fewer
+ *     than two samples were provided, or {@code NaN} if any of the samples is
+ *     not a valid number).
+ */
+goog.math.sampleVariance = function(var_args) {
+  var sampleSize = arguments.length;
+  if (sampleSize < 2) {
+    return 0;
+  }
+
+  var mean = goog.math.average.apply(null, arguments);
+  var variance =
+      goog.math.sum.apply(null, goog.array.map(arguments, function(val) {
+        return Math.pow(val - mean, 2);
+      })) / (sampleSize - 1);
+
+  return variance;
+};
+
+
+/**
+ * Returns the sample standard deviation of the arguments.  For a definition of
+ * sample standard deviation, see e.g.
+ * http://en.wikipedia.org/wiki/Standard_deviation
+ * @param {...number} var_args Number samples to analyze.
+ * @return {number} The sample standard deviation of the arguments (0 if fewer
+ *     than two samples were provided, or {@code NaN} if any of the samples is
+ *     not a valid number).
+ */
+goog.math.standardDeviation = function(var_args) {
+  return Math.sqrt(goog.math.sampleVariance.apply(null, arguments));
+};
+
+
+/**
+ * Returns whether the supplied number represents an integer, i.e. that is has
+ * no fractional component.  No range-checking is performed on the number.
+ * @param {number} num The number to test.
+ * @return {boolean} Whether {@code num} is an integer.
+ */
+goog.math.isInt = function(num) {
+  return isFinite(num) && num % 1 == 0;
+};
+
+
+/**
+ * Returns whether the supplied number is finite and not NaN.
+ * @param {number} num The number to test.
+ * @return {boolean} Whether {@code num} is a finite number.
+ * @deprecated Use {@link isFinite} instead.
+ */
+goog.math.isFiniteNumber = function(num) {
+  return isFinite(num);
+};
+
+
+/**
+ * @param {number} num The number to test.
+ * @return {boolean} Whether it is negative zero.
+ */
+goog.math.isNegativeZero = function(num) {
+  return num == 0 && 1 / num < 0;
+};
+
+
+/**
+ * Returns the precise value of floor(log10(num)).
+ * Simpler implementations didn't work because of floating point rounding
+ * errors. For example
+ * <ul>
+ * <li>Math.floor(Math.log(num) / Math.LN10) is off by one for num == 1e+3.
+ * <li>Math.floor(Math.log(num) * Math.LOG10E) is off by one for num == 1e+15.
+ * <li>Math.floor(Math.log10(num)) is off by one for num == 1e+15 - 1.
+ * </ul>
+ * @param {number} num A floating point number.
+ * @return {number} Its logarithm to base 10 rounded down to the nearest
+ *     integer if num > 0. -Infinity if num == 0. NaN if num < 0.
+ */
+goog.math.log10Floor = function(num) {
+  if (num > 0) {
+    var x = Math.round(Math.log(num) * Math.LOG10E);
+    return x - (parseFloat('1e' + x) > num ? 1 : 0);
+  }
+  return num == 0 ? -Infinity : NaN;
+};
+
+
+/**
+ * A tweaked variant of {@code Math.floor} which tolerates if the passed number
+ * is infinitesimally smaller than the closest integer. It often happens with
+ * the results of floating point calculations because of the finite precision
+ * of the intermediate results. For example {@code Math.floor(Math.log(1000) /
+ * Math.LN10) == 2}, not 3 as one would expect.
+ * @param {number} num A number.
+ * @param {number=} opt_epsilon An infinitesimally small positive number, the
+ *     rounding error to tolerate.
+ * @return {number} The largest integer less than or equal to {@code num}.
+ */
+goog.math.safeFloor = function(num, opt_epsilon) {
+  goog.asserts.assert(!goog.isDef(opt_epsilon) || opt_epsilon > 0);
+  return Math.floor(num + (opt_epsilon || 2e-15));
+};
+
+
+/**
+ * A tweaked variant of {@code Math.ceil}. See {@code goog.math.safeFloor} for
+ * details.
+ * @param {number} num A number.
+ * @param {number=} opt_epsilon An infinitesimally small positive number, the
+ *     rounding error to tolerate.
+ * @return {number} The smallest integer greater than or equal to {@code num}.
+ */
+goog.math.safeCeil = function(num, opt_epsilon) {
+  goog.asserts.assert(!goog.isDef(opt_epsilon) || opt_epsilon > 0);
+  return Math.ceil(num - (opt_epsilon || 2e-15));
+};
diff --git a/js/goog/object/object.js b/js/goog/object/object.js
new file mode 100644
index 0000000..2f26c2b
--- /dev/null
+++ b/js/goog/object/object.js
@@ -0,0 +1,751 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Utilities for manipulating objects/maps/hashes.
+ * @author arv@google.com (Erik Arvidsson)
+ */
+
+goog.provide('goog.object');
+
+
+/**
+ * Whether two values are not observably distinguishable. This
+ * correctly detects that 0 is not the same as -0 and two NaNs are
+ * practically equivalent.
+ *
+ * The implementation is as suggested by harmony:egal proposal.
+ *
+ * @param {*} v The first value to compare.
+ * @param {*} v2 The second value to compare.
+ * @return {boolean} Whether two values are not observably distinguishable.
+ * @see http://wiki.ecmascript.org/doku.php?id=harmony:egal
+ */
+goog.object.is = function(v, v2) {
+  if (v === v2) {
+    // 0 === -0, but they are not identical.
+    // We need the cast because the compiler requires that v2 is a
+    // number (although 1/v2 works with non-number). We cast to ? to
+    // stop the compiler from type-checking this statement.
+    return v !== 0 || 1 / v === 1 / /** @type {?} */ (v2);
+  }
+
+  // NaN is non-reflexive: NaN !== NaN, although they are identical.
+  return v !== v && v2 !== v2;
+};
+
+
+/**
+ * Calls a function for each element in an object/map/hash.
+ *
+ * @param {Object<K,V>} obj The object over which to iterate.
+ * @param {function(this:T,V,?,Object<K,V>):?} f The function to call
+ *     for every element. This function takes 3 arguments (the value, the
+ *     key and the object) and the return value is ignored.
+ * @param {T=} opt_obj This is used as the 'this' object within f.
+ * @template T,K,V
+ */
+goog.object.forEach = function(obj, f, opt_obj) {
+  for (var key in obj) {
+    f.call(/** @type {?} */ (opt_obj), obj[key], key, obj);
+  }
+};
+
+
+/**
+ * Calls a function for each element in an object/map/hash. If that call returns
+ * true, adds the element to a new object.
+ *
+ * @param {Object<K,V>} obj The object over which to iterate.
+ * @param {function(this:T,V,?,Object<K,V>):boolean} f The function to call
+ *     for every element. This
+ *     function takes 3 arguments (the value, the key and the object)
+ *     and should return a boolean. If the return value is true the
+ *     element is added to the result object. If it is false the
+ *     element is not included.
+ * @param {T=} opt_obj This is used as the 'this' object within f.
+ * @return {!Object<K,V>} a new object in which only elements that passed the
+ *     test are present.
+ * @template T,K,V
+ */
+goog.object.filter = function(obj, f, opt_obj) {
+  var res = {};
+  for (var key in obj) {
+    if (f.call(/** @type {?} */ (opt_obj), obj[key], key, obj)) {
+      res[key] = obj[key];
+    }
+  }
+  return res;
+};
+
+
+/**
+ * For every element in an object/map/hash calls a function and inserts the
+ * result into a new object.
+ *
+ * @param {Object<K,V>} obj The object over which to iterate.
+ * @param {function(this:T,V,?,Object<K,V>):R} f The function to call
+ *     for every element. This function
+ *     takes 3 arguments (the value, the key and the object)
+ *     and should return something. The result will be inserted
+ *     into a new object.
+ * @param {T=} opt_obj This is used as the 'this' object within f.
+ * @return {!Object<K,R>} a new object with the results from f.
+ * @template T,K,V,R
+ */
+goog.object.map = function(obj, f, opt_obj) {
+  var res = {};
+  for (var key in obj) {
+    res[key] = f.call(/** @type {?} */ (opt_obj), obj[key], key, obj);
+  }
+  return res;
+};
+
+
+/**
+ * Calls a function for each element in an object/map/hash. If any
+ * call returns true, returns true (without checking the rest). If
+ * all calls return false, returns false.
+ *
+ * @param {Object<K,V>} obj The object to check.
+ * @param {function(this:T,V,?,Object<K,V>):boolean} f The function to
+ *     call for every element. This function
+ *     takes 3 arguments (the value, the key and the object) and should
+ *     return a boolean.
+ * @param {T=} opt_obj This is used as the 'this' object within f.
+ * @return {boolean} true if any element passes the test.
+ * @template T,K,V
+ */
+goog.object.some = function(obj, f, opt_obj) {
+  for (var key in obj) {
+    if (f.call(/** @type {?} */ (opt_obj), obj[key], key, obj)) {
+      return true;
+    }
+  }
+  return false;
+};
+
+
+/**
+ * Calls a function for each element in an object/map/hash. If
+ * all calls return true, returns true. If any call returns false, returns
+ * false at this point and does not continue to check the remaining elements.
+ *
+ * @param {Object<K,V>} obj The object to check.
+ * @param {?function(this:T,V,?,Object<K,V>):boolean} f The function to
+ *     call for every element. This function
+ *     takes 3 arguments (the value, the key and the object) and should
+ *     return a boolean.
+ * @param {T=} opt_obj This is used as the 'this' object within f.
+ * @return {boolean} false if any element fails the test.
+ * @template T,K,V
+ */
+goog.object.every = function(obj, f, opt_obj) {
+  for (var key in obj) {
+    if (!f.call(/** @type {?} */ (opt_obj), obj[key], key, obj)) {
+      return false;
+    }
+  }
+  return true;
+};
+
+
+/**
+ * Returns the number of key-value pairs in the object map.
+ *
+ * @param {Object} obj The object for which to get the number of key-value
+ *     pairs.
+ * @return {number} The number of key-value pairs in the object map.
+ */
+goog.object.getCount = function(obj) {
+  var rv = 0;
+  for (var key in obj) {
+    rv++;
+  }
+  return rv;
+};
+
+
+/**
+ * Returns one key from the object map, if any exists.
+ * For map literals the returned key will be the first one in most of the
+ * browsers (a know exception is Konqueror).
+ *
+ * @param {Object} obj The object to pick a key from.
+ * @return {string|undefined} The key or undefined if the object is empty.
+ */
+goog.object.getAnyKey = function(obj) {
+  for (var key in obj) {
+    return key;
+  }
+};
+
+
+/**
+ * Returns one value from the object map, if any exists.
+ * For map literals the returned value will be the first one in most of the
+ * browsers (a know exception is Konqueror).
+ *
+ * @param {Object<K,V>} obj The object to pick a value from.
+ * @return {V|undefined} The value or undefined if the object is empty.
+ * @template K,V
+ */
+goog.object.getAnyValue = function(obj) {
+  for (var key in obj) {
+    return obj[key];
+  }
+};
+
+
+/**
+ * Whether the object/hash/map contains the given object as a value.
+ * An alias for goog.object.containsValue(obj, val).
+ *
+ * @param {Object<K,V>} obj The object in which to look for val.
+ * @param {V} val The object for which to check.
+ * @return {boolean} true if val is present.
+ * @template K,V
+ */
+goog.object.contains = function(obj, val) {
+  return goog.object.containsValue(obj, val);
+};
+
+
+/**
+ * Returns the values of the object/map/hash.
+ *
+ * @param {Object<K,V>} obj The object from which to get the values.
+ * @return {!Array<V>} The values in the object/map/hash.
+ * @template K,V
+ */
+goog.object.getValues = function(obj) {
+  var res = [];
+  var i = 0;
+  for (var key in obj) {
+    res[i++] = obj[key];
+  }
+  return res;
+};
+
+
+/**
+ * Returns the keys of the object/map/hash.
+ *
+ * @param {Object} obj The object from which to get the keys.
+ * @return {!Array<string>} Array of property keys.
+ */
+goog.object.getKeys = function(obj) {
+  var res = [];
+  var i = 0;
+  for (var key in obj) {
+    res[i++] = key;
+  }
+  return res;
+};
+
+
+/**
+ * Get a value from an object multiple levels deep.  This is useful for
+ * pulling values from deeply nested objects, such as JSON responses.
+ * Example usage: getValueByKeys(jsonObj, 'foo', 'entries', 3)
+ *
+ * @param {!Object} obj An object to get the value from.  Can be array-like.
+ * @param {...(string|number|!IArrayLike<number|string>)}
+ *     var_args A number of keys
+ *     (as strings, or numbers, for array-like objects).  Can also be
+ *     specified as a single array of keys.
+ * @return {*} The resulting value.  If, at any point, the value for a key
+ *     is undefined, returns undefined.
+ */
+goog.object.getValueByKeys = function(obj, var_args) {
+  var isArrayLike = goog.isArrayLike(var_args);
+  var keys = isArrayLike ? var_args : arguments;
+
+  // Start with the 2nd parameter for the variable parameters syntax.
+  for (var i = isArrayLike ? 0 : 1; i < keys.length; i++) {
+    obj = obj[keys[i]];
+    if (!goog.isDef(obj)) {
+      break;
+    }
+  }
+
+  return obj;
+};
+
+
+/**
+ * Whether the object/map/hash contains the given key.
+ *
+ * @param {Object} obj The object in which to look for key.
+ * @param {?} key The key for which to check.
+ * @return {boolean} true If the map contains the key.
+ */
+goog.object.containsKey = function(obj, key) {
+  return obj !== null && key in obj;
+};
+
+
+/**
+ * Whether the object/map/hash contains the given value. This is O(n).
+ *
+ * @param {Object<K,V>} obj The object in which to look for val.
+ * @param {V} val The value for which to check.
+ * @return {boolean} true If the map contains the value.
+ * @template K,V
+ */
+goog.object.containsValue = function(obj, val) {
+  for (var key in obj) {
+    if (obj[key] == val) {
+      return true;
+    }
+  }
+  return false;
+};
+
+
+/**
+ * Searches an object for an element that satisfies the given condition and
+ * returns its key.
+ * @param {Object<K,V>} obj The object to search in.
+ * @param {function(this:T,V,string,Object<K,V>):boolean} f The
+ *      function to call for every element. Takes 3 arguments (the value,
+ *     the key and the object) and should return a boolean.
+ * @param {T=} opt_this An optional "this" context for the function.
+ * @return {string|undefined} The key of an element for which the function
+ *     returns true or undefined if no such element is found.
+ * @template T,K,V
+ */
+goog.object.findKey = function(obj, f, opt_this) {
+  for (var key in obj) {
+    if (f.call(/** @type {?} */ (opt_this), obj[key], key, obj)) {
+      return key;
+    }
+  }
+  return undefined;
+};
+
+
+/**
+ * Searches an object for an element that satisfies the given condition and
+ * returns its value.
+ * @param {Object<K,V>} obj The object to search in.
+ * @param {function(this:T,V,string,Object<K,V>):boolean} f The function
+ *     to call for every element. Takes 3 arguments (the value, the key
+ *     and the object) and should return a boolean.
+ * @param {T=} opt_this An optional "this" context for the function.
+ * @return {V} The value of an element for which the function returns true or
+ *     undefined if no such element is found.
+ * @template T,K,V
+ */
+goog.object.findValue = function(obj, f, opt_this) {
+  var key = goog.object.findKey(obj, f, opt_this);
+  return key && obj[key];
+};
+
+
+/**
+ * Whether the object/map/hash is empty.
+ *
+ * @param {Object} obj The object to test.
+ * @return {boolean} true if obj is empty.
+ */
+goog.object.isEmpty = function(obj) {
+  for (var key in obj) {
+    return false;
+  }
+  return true;
+};
+
+
+/**
+ * Removes all key value pairs from the object/map/hash.
+ *
+ * @param {Object} obj The object to clear.
+ */
+goog.object.clear = function(obj) {
+  for (var i in obj) {
+    delete obj[i];
+  }
+};
+
+
+/**
+ * Removes a key-value pair based on the key.
+ *
+ * @param {Object} obj The object from which to remove the key.
+ * @param {?} key The key to remove.
+ * @return {boolean} Whether an element was removed.
+ */
+goog.object.remove = function(obj, key) {
+  var rv;
+  if (rv = key in /** @type {!Object} */ (obj)) {
+    delete obj[key];
+  }
+  return rv;
+};
+
+
+/**
+ * Adds a key-value pair to the object. Throws an exception if the key is
+ * already in use. Use set if you want to change an existing pair.
+ *
+ * @param {Object<K,V>} obj The object to which to add the key-value pair.
+ * @param {string} key The key to add.
+ * @param {V} val The value to add.
+ * @template K,V
+ */
+goog.object.add = function(obj, key, val) {
+  if (obj !== null && key in obj) {
+    throw Error('The object already contains the key "' + key + '"');
+  }
+  goog.object.set(obj, key, val);
+};
+
+
+/**
+ * Returns the value for the given key.
+ *
+ * @param {Object<K,V>} obj The object from which to get the value.
+ * @param {string} key The key for which to get the value.
+ * @param {R=} opt_val The value to return if no item is found for the given
+ *     key (default is undefined).
+ * @return {V|R|undefined} The value for the given key.
+ * @template K,V,R
+ */
+goog.object.get = function(obj, key, opt_val) {
+  if (obj !== null && key in obj) {
+    return obj[key];
+  }
+  return opt_val;
+};
+
+
+/**
+ * Adds a key-value pair to the object/map/hash.
+ *
+ * @param {Object<K,V>} obj The object to which to add the key-value pair.
+ * @param {string} key The key to add.
+ * @param {V} value The value to add.
+ * @template K,V
+ */
+goog.object.set = function(obj, key, value) {
+  obj[key] = value;
+};
+
+
+/**
+ * Adds a key-value pair to the object/map/hash if it doesn't exist yet.
+ *
+ * @param {Object<K,V>} obj The object to which to add the key-value pair.
+ * @param {string} key The key to add.
+ * @param {V} value The value to add if the key wasn't present.
+ * @return {V} The value of the entry at the end of the function.
+ * @template K,V
+ */
+goog.object.setIfUndefined = function(obj, key, value) {
+  return key in /** @type {!Object} */ (obj) ? obj[key] : (obj[key] = value);
+};
+
+
+/**
+ * Sets a key and value to an object if the key is not set. The value will be
+ * the return value of the given function. If the key already exists, the
+ * object will not be changed and the function will not be called (the function
+ * will be lazily evaluated -- only called if necessary).
+ *
+ * This function is particularly useful for use with a map used a as a cache.
+ *
+ * @param {!Object<K,V>} obj The object to which to add the key-value pair.
+ * @param {string} key The key to add.
+ * @param {function():V} f The value to add if the key wasn't present.
+ * @return {V} The value of the entry at the end of the function.
+ * @template K,V
+ */
+goog.object.setWithReturnValueIfNotSet = function(obj, key, f) {
+  if (key in obj) {
+    return obj[key];
+  }
+
+  var val = f();
+  obj[key] = val;
+  return val;
+};
+
+
+/**
+ * Compares two objects for equality using === on the values.
+ *
+ * @param {!Object<K,V>} a
+ * @param {!Object<K,V>} b
+ * @return {boolean}
+ * @template K,V
+ */
+goog.object.equals = function(a, b) {
+  for (var k in a) {
+    if (!(k in b) || a[k] !== b[k]) {
+      return false;
+    }
+  }
+  for (var k in b) {
+    if (!(k in a)) {
+      return false;
+    }
+  }
+  return true;
+};
+
+
+/**
+ * Returns a shallow clone of the object.
+ *
+ * @param {Object<K,V>} obj Object to clone.
+ * @return {!Object<K,V>} Clone of the input object.
+ * @template K,V
+ */
+goog.object.clone = function(obj) {
+  // We cannot use the prototype trick because a lot of methods depend on where
+  // the actual key is set.
+
+  var res = {};
+  for (var key in obj) {
+    res[key] = obj[key];
+  }
+  return res;
+  // We could also use goog.mixin but I wanted this to be independent from that.
+};
+
+
+/**
+ * Clones a value. The input may be an Object, Array, or basic type. Objects and
+ * arrays will be cloned recursively.
+ *
+ * WARNINGS:
+ * <code>goog.object.unsafeClone</code> does not detect reference loops. Objects
+ * that refer to themselves will cause infinite recursion.
+ *
+ * <code>goog.object.unsafeClone</code> is unaware of unique identifiers, and
+ * copies UIDs created by <code>getUid</code> into cloned results.
+ *
+ * @param {T} obj The value to clone.
+ * @return {T} A clone of the input value.
+ * @template T
+ */
+goog.object.unsafeClone = function(obj) {
+  var type = goog.typeOf(obj);
+  if (type == 'object' || type == 'array') {
+    if (goog.isFunction(obj.clone)) {
+      return obj.clone();
+    }
+    var clone = type == 'array' ? [] : {};
+    for (var key in obj) {
+      clone[key] = goog.object.unsafeClone(obj[key]);
+    }
+    return clone;
+  }
+
+  return obj;
+};
+
+
+/**
+ * Returns a new object in which all the keys and values are interchanged
+ * (keys become values and values become keys). If multiple keys map to the
+ * same value, the chosen transposed value is implementation-dependent.
+ *
+ * @param {Object} obj The object to transpose.
+ * @return {!Object} The transposed object.
+ */
+goog.object.transpose = function(obj) {
+  var transposed = {};
+  for (var key in obj) {
+    transposed[obj[key]] = key;
+  }
+  return transposed;
+};
+
+
+/**
+ * The names of the fields that are defined on Object.prototype.
+ * @type {Array<string>}
+ * @private
+ */
+goog.object.PROTOTYPE_FIELDS_ = [
+  'constructor', 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable',
+  'toLocaleString', 'toString', 'valueOf'
+];
+
+
+/**
+ * Extends an object with another object.
+ * This operates 'in-place'; it does not create a new Object.
+ *
+ * Example:
+ * var o = {};
+ * goog.object.extend(o, {a: 0, b: 1});
+ * o; // {a: 0, b: 1}
+ * goog.object.extend(o, {b: 2, c: 3});
+ * o; // {a: 0, b: 2, c: 3}
+ *
+ * @param {Object} target The object to modify. Existing properties will be
+ *     overwritten if they are also present in one of the objects in
+ *     {@code var_args}.
+ * @param {...Object} var_args The objects from which values will be copied.
+ */
+goog.object.extend = function(target, var_args) {
+  var key, source;
+  for (var i = 1; i < arguments.length; i++) {
+    source = arguments[i];
+    for (key in source) {
+      target[key] = source[key];
+    }
+
+    // For IE the for-in-loop does not contain any properties that are not
+    // enumerable on the prototype object (for example isPrototypeOf from
+    // Object.prototype) and it will also not include 'replace' on objects that
+    // extend String and change 'replace' (not that it is common for anyone to
+    // extend anything except Object).
+
+    for (var j = 0; j < goog.object.PROTOTYPE_FIELDS_.length; j++) {
+      key = goog.object.PROTOTYPE_FIELDS_[j];
+      if (Object.prototype.hasOwnProperty.call(source, key)) {
+        target[key] = source[key];
+      }
+    }
+  }
+};
+
+
+/**
+ * Creates a new object built from the key-value pairs provided as arguments.
+ * @param {...*} var_args If only one argument is provided and it is an array
+ *     then this is used as the arguments, otherwise even arguments are used as
+ *     the property names and odd arguments are used as the property values.
+ * @return {!Object} The new object.
+ * @throws {Error} If there are uneven number of arguments or there is only one
+ *     non array argument.
+ */
+goog.object.create = function(var_args) {
+  var argLength = arguments.length;
+  if (argLength == 1 && goog.isArray(arguments[0])) {
+    return goog.object.create.apply(null, arguments[0]);
+  }
+
+  if (argLength % 2) {
+    throw Error('Uneven number of arguments');
+  }
+
+  var rv = {};
+  for (var i = 0; i < argLength; i += 2) {
+    rv[arguments[i]] = arguments[i + 1];
+  }
+  return rv;
+};
+
+
+/**
+ * Creates a new object where the property names come from the arguments but
+ * the value is always set to true
+ * @param {...*} var_args If only one argument is provided and it is an array
+ *     then this is used as the arguments, otherwise the arguments are used
+ *     as the property names.
+ * @return {!Object} The new object.
+ */
+goog.object.createSet = function(var_args) {
+  var argLength = arguments.length;
+  if (argLength == 1 && goog.isArray(arguments[0])) {
+    return goog.object.createSet.apply(null, arguments[0]);
+  }
+
+  var rv = {};
+  for (var i = 0; i < argLength; i++) {
+    rv[arguments[i]] = true;
+  }
+  return rv;
+};
+
+
+/**
+ * Creates an immutable view of the underlying object, if the browser
+ * supports immutable objects.
+ *
+ * In default mode, writes to this view will fail silently. In strict mode,
+ * they will throw an error.
+ *
+ * @param {!Object<K,V>} obj An object.
+ * @return {!Object<K,V>} An immutable view of that object, or the
+ *     original object if this browser does not support immutables.
+ * @template K,V
+ */
+goog.object.createImmutableView = function(obj) {
+  var result = obj;
+  if (Object.isFrozen && !Object.isFrozen(obj)) {
+    result = Object.create(obj);
+    Object.freeze(result);
+  }
+  return result;
+};
+
+
+/**
+ * @param {!Object} obj An object.
+ * @return {boolean} Whether this is an immutable view of the object.
+ */
+goog.object.isImmutableView = function(obj) {
+  return !!Object.isFrozen && Object.isFrozen(obj);
+};
+
+
+/**
+ * Get all properties names on a given Object regardless of enumerability.
+ *
+ * <p> If the browser does not support {@code Object.getOwnPropertyNames} nor
+ * {@code Object.getPrototypeOf} then this is equivalent to using {@code
+ * goog.object.getKeys}
+ *
+ * @param {?Object} obj The object to get the properties of.
+ * @param {boolean=} opt_includeObjectPrototype Whether properties defined on
+ *     {@code Object.prototype} should be included in the result.
+ * @param {boolean=} opt_includeFunctionPrototype Whether properties defined on
+ *     {@code Function.prototype} should be included in the result.
+ * @return {!Array<string>}
+ * @public
+ */
+goog.object.getAllPropertyNames = function(
+    obj, opt_includeObjectPrototype, opt_includeFunctionPrototype) {
+  if (!obj) {
+    return [];
+  }
+
+  // Naively use a for..in loop to get the property names if the browser doesn't
+  // support any other APIs for getting it.
+  if (!Object.getOwnPropertyNames || !Object.getPrototypeOf) {
+    return goog.object.getKeys(obj);
+  }
+
+  var visitedSet = {};
+
+  // Traverse the prototype chain and add all properties to the visited set.
+  var proto = obj;
+  while (proto &&
+         (proto !== Object.prototype || !!opt_includeObjectPrototype) &&
+         (proto !== Function.prototype || !!opt_includeFunctionPrototype)) {
+    var names = Object.getOwnPropertyNames(proto);
+    for (var i = 0; i < names.length; i++) {
+      visitedSet[names[i]] = true;
+    }
+    proto = Object.getPrototypeOf(proto);
+  }
+
+  return goog.object.getKeys(visitedSet);
+};
diff --git a/js/goog/reflect/reflect.js b/js/goog/reflect/reflect.js
new file mode 100644
index 0000000..a737324
--- /dev/null
+++ b/js/goog/reflect/reflect.js
@@ -0,0 +1,138 @@
+// Copyright 2009 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Useful compiler idioms.
+ *
+ * @author johnlenz@google.com (John Lenz)
+ */
+
+goog.provide('goog.reflect');
+
+
+/**
+ * Syntax for object literal casts.
+ * @see http://go/jscompiler-renaming
+ * @see https://goo.gl/CRs09P
+ *
+ * Use this if you have an object literal whose keys need to have the same names
+ * as the properties of some class even after they are renamed by the compiler.
+ *
+ * @param {!Function} type Type to cast to.
+ * @param {Object} object Object literal to cast.
+ * @return {Object} The object literal.
+ */
+goog.reflect.object = function(type, object) {
+  return object;
+};
+
+/**
+ * Syntax for renaming property strings.
+ * @see http://go/jscompiler-renaming
+ * @see https://goo.gl/CRs09P
+ *
+ * Use this if you have an need to access a property as a string, but want
+ * to also have the property renamed by the compiler. In contrast to
+ * goog.reflect.object, this method takes an instance of an object.
+ *
+ * Properties must be simple names (not qualified names).
+ *
+ * @param {string} prop Name of the property
+ * @param {!Object} object Instance of the object whose type will be used
+ *     for renaming
+ * @return {string} The renamed property.
+ */
+goog.reflect.objectProperty = function(prop, object) {
+  return prop;
+};
+
+/**
+ * To assert to the compiler that an operation is needed when it would
+ * otherwise be stripped. For example:
+ * <code>
+ *     // Force a layout
+ *     goog.reflect.sinkValue(dialog.offsetHeight);
+ * </code>
+ * @param {T} x
+ * @return {T}
+ * @template T
+ */
+goog.reflect.sinkValue = function(x) {
+  goog.reflect.sinkValue[' '](x);
+  return x;
+};
+
+
+/**
+ * The compiler should optimize this function away iff no one ever uses
+ * goog.reflect.sinkValue.
+ */
+goog.reflect.sinkValue[' '] = goog.nullFunction;
+
+
+/**
+ * Check if a property can be accessed without throwing an exception.
+ * @param {Object} obj The owner of the property.
+ * @param {string} prop The property name.
+ * @return {boolean} Whether the property is accessible. Will also return true
+ *     if obj is null.
+ */
+goog.reflect.canAccessProperty = function(obj, prop) {
+
+  try {
+    goog.reflect.sinkValue(obj[prop]);
+    return true;
+  } catch (e) {
+  }
+  return false;
+};
+
+
+/**
+ * Retrieves a value from a cache given a key. The compiler provides special
+ * consideration for this call such that it is generally considered side-effect
+ * free. However, if the {@code opt_keyFn} or {@code valueFn} have side-effects
+ * then the entire call is considered to have side-effects.
+ *
+ * Conventionally storing the value on the cache would be considered a
+ * side-effect and preclude unused calls from being pruned, ie. even if
+ * the value was never used, it would still always be stored in the cache.
+ *
+ * Providing a side-effect free {@code valueFn} and {@code opt_keyFn}
+ * allows unused calls to {@code goog.reflect.cache} to be pruned.
+ *
+ * @param {!Object<K, V>} cacheObj The object that contains the cached values.
+ * @param {?} key The key to lookup in the cache. If it is not string or number
+ *     then a {@code opt_keyFn} should be provided. The key is also used as the
+ *     parameter to the {@code valueFn}.
+ * @param {function(?):V} valueFn The value provider to use to calculate the
+ *     value to store in the cache. This function should be side-effect free
+ *     to take advantage of the optimization.
+ * @param {function(?):K=} opt_keyFn The key provider to determine the cache
+ *     map key. This should be used if the given key is not a string or number.
+ *     If not provided then the given key is used. This function should be
+ *     side-effect free to take advantage of the optimization.
+ * @return {V} The cached or calculated value.
+ * @template K
+ * @template V
+ */
+goog.reflect.cache = function(cacheObj, key, valueFn, opt_keyFn) {
+  var storedKey = opt_keyFn ? opt_keyFn(key) : key;
+
+  if (Object.prototype.hasOwnProperty.call(cacheObj, storedKey)) {
+    return cacheObj[storedKey];
+  }
+
+  return (cacheObj[storedKey] = valueFn(key));
+};
diff --git a/js/goog/string/string.js b/js/goog/string/string.js
new file mode 100644
index 0000000..7a10ae0
--- /dev/null
+++ b/js/goog/string/string.js
@@ -0,0 +1,1641 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Utilities for string manipulation.
+ * @author arv@google.com (Erik Arvidsson)
+ */
+
+
+/**
+ * Namespace for string utilities
+ */
+goog.provide('goog.string');
+goog.provide('goog.string.Unicode');
+
+
+/**
+ * @define {boolean} Enables HTML escaping of lowercase letter "e" which helps
+ * with detection of double-escaping as this letter is frequently used.
+ */
+goog.define('goog.string.DETECT_DOUBLE_ESCAPING', false);
+
+
+/**
+ * @define {boolean} Whether to force non-dom html unescaping.
+ */
+goog.define('goog.string.FORCE_NON_DOM_HTML_UNESCAPING', false);
+
+
+/**
+ * Common Unicode string characters.
+ * @enum {string}
+ */
+goog.string.Unicode = {
+  NBSP: '\xa0'
+};
+
+
+/**
+ * Fast prefix-checker.
+ * @param {string} str The string to check.
+ * @param {string} prefix A string to look for at the start of {@code str}.
+ * @return {boolean} True if {@code str} begins with {@code prefix}.
+ */
+goog.string.startsWith = function(str, prefix) {
+  return str.lastIndexOf(prefix, 0) == 0;
+};
+
+
+/**
+ * Fast suffix-checker.
+ * @param {string} str The string to check.
+ * @param {string} suffix A string to look for at the end of {@code str}.
+ * @return {boolean} True if {@code str} ends with {@code suffix}.
+ */
+goog.string.endsWith = function(str, suffix) {
+  var l = str.length - suffix.length;
+  return l >= 0 && str.indexOf(suffix, l) == l;
+};
+
+
+/**
+ * Case-insensitive prefix-checker.
+ * @param {string} str The string to check.
+ * @param {string} prefix  A string to look for at the end of {@code str}.
+ * @return {boolean} True if {@code str} begins with {@code prefix} (ignoring
+ *     case).
+ */
+goog.string.caseInsensitiveStartsWith = function(str, prefix) {
+  return goog.string.caseInsensitiveCompare(
+             prefix, str.substr(0, prefix.length)) == 0;
+};
+
+
+/**
+ * Case-insensitive suffix-checker.
+ * @param {string} str The string to check.
+ * @param {string} suffix A string to look for at the end of {@code str}.
+ * @return {boolean} True if {@code str} ends with {@code suffix} (ignoring
+ *     case).
+ */
+goog.string.caseInsensitiveEndsWith = function(str, suffix) {
+  return (
+      goog.string.caseInsensitiveCompare(
+          suffix, str.substr(str.length - suffix.length, suffix.length)) == 0);
+};
+
+
+/**
+ * Case-insensitive equality checker.
+ * @param {string} str1 First string to check.
+ * @param {string} str2 Second string to check.
+ * @return {boolean} True if {@code str1} and {@code str2} are the same string,
+ *     ignoring case.
+ */
+goog.string.caseInsensitiveEquals = function(str1, str2) {
+  return str1.toLowerCase() == str2.toLowerCase();
+};
+
+
+/**
+ * Does simple python-style string substitution.
+ * subs("foo%s hot%s", "bar", "dog") becomes "foobar hotdog".
+ * @param {string} str The string containing the pattern.
+ * @param {...*} var_args The items to substitute into the pattern.
+ * @return {string} A copy of {@code str} in which each occurrence of
+ *     {@code %s} has been replaced an argument from {@code var_args}.
+ */
+goog.string.subs = function(str, var_args) {
+  var splitParts = str.split('%s');
+  var returnString = '';
+
+  var subsArguments = Array.prototype.slice.call(arguments, 1);
+  while (subsArguments.length &&
+         // Replace up to the last split part. We are inserting in the
+         // positions between split parts.
+         splitParts.length > 1) {
+    returnString += splitParts.shift() + subsArguments.shift();
+  }
+
+  return returnString + splitParts.join('%s');  // Join unused '%s'
+};
+
+
+/**
+ * Converts multiple whitespace chars (spaces, non-breaking-spaces, new lines
+ * and tabs) to a single space, and strips leading and trailing whitespace.
+ * @param {string} str Input string.
+ * @return {string} A copy of {@code str} with collapsed whitespace.
+ */
+goog.string.collapseWhitespace = function(str) {
+  // Since IE doesn't include non-breaking-space (0xa0) in their \s character
+  // class (as required by section 7.2 of the ECMAScript spec), we explicitly
+  // include it in the regexp to enforce consistent cross-browser behavior.
+  return str.replace(/[\s\xa0]+/g, ' ').replace(/^\s+|\s+$/g, '');
+};
+
+
+/**
+ * Checks if a string is empty or contains only whitespaces.
+ * @param {string} str The string to check.
+ * @return {boolean} Whether {@code str} is empty or whitespace only.
+ */
+goog.string.isEmptyOrWhitespace = function(str) {
+  // testing length == 0 first is actually slower in all browsers (about the
+  // same in Opera).
+  // Since IE doesn't include non-breaking-space (0xa0) in their \s character
+  // class (as required by section 7.2 of the ECMAScript spec), we explicitly
+  // include it in the regexp to enforce consistent cross-browser behavior.
+  return /^[\s\xa0]*$/.test(str);
+};
+
+
+/**
+ * Checks if a string is empty.
+ * @param {string} str The string to check.
+ * @return {boolean} Whether {@code str} is empty.
+ */
+goog.string.isEmptyString = function(str) {
+  return str.length == 0;
+};
+
+
+/**
+ * Checks if a string is empty or contains only whitespaces.
+ *
+ * @param {string} str The string to check.
+ * @return {boolean} Whether {@code str} is empty or whitespace only.
+ * @deprecated Use goog.string.isEmptyOrWhitespace instead.
+ */
+goog.string.isEmpty = goog.string.isEmptyOrWhitespace;
+
+
+/**
+ * Checks if a string is null, undefined, empty or contains only whitespaces.
+ * @param {*} str The string to check.
+ * @return {boolean} Whether {@code str} is null, undefined, empty, or
+ *     whitespace only.
+ * @deprecated Use goog.string.isEmptyOrWhitespace(goog.string.makeSafe(str))
+ *     instead.
+ */
+goog.string.isEmptyOrWhitespaceSafe = function(str) {
+  return goog.string.isEmptyOrWhitespace(goog.string.makeSafe(str));
+};
+
+
+/**
+ * Checks if a string is null, undefined, empty or contains only whitespaces.
+ *
+ * @param {*} str The string to check.
+ * @return {boolean} Whether {@code str} is null, undefined, empty, or
+ *     whitespace only.
+ * @deprecated Use goog.string.isEmptyOrWhitespace instead.
+ */
+goog.string.isEmptySafe = goog.string.isEmptyOrWhitespaceSafe;
+
+
+/**
+ * Checks if a string is all breaking whitespace.
+ * @param {string} str The string to check.
+ * @return {boolean} Whether the string is all breaking whitespace.
+ */
+goog.string.isBreakingWhitespace = function(str) {
+  return !/[^\t\n\r ]/.test(str);
+};
+
+
+/**
+ * Checks if a string contains all letters.
+ * @param {string} str string to check.
+ * @return {boolean} True if {@code str} consists entirely of letters.
+ */
+goog.string.isAlpha = function(str) {
+  return !/[^a-zA-Z]/.test(str);
+};
+
+
+/**
+ * Checks if a string contains only numbers.
+ * @param {*} str string to check. If not a string, it will be
+ *     casted to one.
+ * @return {boolean} True if {@code str} is numeric.
+ */
+goog.string.isNumeric = function(str) {
+  return !/[^0-9]/.test(str);
+};
+
+
+/**
+ * Checks if a string contains only numbers or letters.
+ * @param {string} str string to check.
+ * @return {boolean} True if {@code str} is alphanumeric.
+ */
+goog.string.isAlphaNumeric = function(str) {
+  return !/[^a-zA-Z0-9]/.test(str);
+};
+
+
+/**
+ * Checks if a character is a space character.
+ * @param {string} ch Character to check.
+ * @return {boolean} True if {@code ch} is a space.
+ */
+goog.string.isSpace = function(ch) {
+  return ch == ' ';
+};
+
+
+/**
+ * Checks if a character is a valid unicode character.
+ * @param {string} ch Character to check.
+ * @return {boolean} True if {@code ch} is a valid unicode character.
+ */
+goog.string.isUnicodeChar = function(ch) {
+  return ch.length == 1 && ch >= ' ' && ch <= '~' ||
+      ch >= '\u0080' && ch <= '\uFFFD';
+};
+
+
+/**
+ * Takes a string and replaces newlines with a space. Multiple lines are
+ * replaced with a single space.
+ * @param {string} str The string from which to strip newlines.
+ * @return {string} A copy of {@code str} stripped of newlines.
+ */
+goog.string.stripNewlines = function(str) {
+  return str.replace(/(\r\n|\r|\n)+/g, ' ');
+};
+
+
+/**
+ * Replaces Windows and Mac new lines with unix style: \r or \r\n with \n.
+ * @param {string} str The string to in which to canonicalize newlines.
+ * @return {string} {@code str} A copy of {@code} with canonicalized newlines.
+ */
+goog.string.canonicalizeNewlines = function(str) {
+  return str.replace(/(\r\n|\r|\n)/g, '\n');
+};
+
+
+/**
+ * Normalizes whitespace in a string, replacing all whitespace chars with
+ * a space.
+ * @param {string} str The string in which to normalize whitespace.
+ * @return {string} A copy of {@code str} with all whitespace normalized.
+ */
+goog.string.normalizeWhitespace = function(str) {
+  return str.replace(/\xa0|\s/g, ' ');
+};
+
+
+/**
+ * Normalizes spaces in a string, replacing all consecutive spaces and tabs
+ * with a single space. Replaces non-breaking space with a space.
+ * @param {string} str The string in which to normalize spaces.
+ * @return {string} A copy of {@code str} with all consecutive spaces and tabs
+ *    replaced with a single space.
+ */
+goog.string.normalizeSpaces = function(str) {
+  return str.replace(/\xa0|[ \t]+/g, ' ');
+};
+
+
+/**
+ * Removes the breaking spaces from the left and right of the string and
+ * collapses the sequences of breaking spaces in the middle into single spaces.
+ * The original and the result strings render the same way in HTML.
+ * @param {string} str A string in which to collapse spaces.
+ * @return {string} Copy of the string with normalized breaking spaces.
+ */
+goog.string.collapseBreakingSpaces = function(str) {
+  return str.replace(/[\t\r\n ]+/g, ' ')
+      .replace(/^[\t\r\n ]+|[\t\r\n ]+$/g, '');
+};
+
+
+/**
+ * Trims white spaces to the left and right of a string.
+ * @param {string} str The string to trim.
+ * @return {string} A trimmed copy of {@code str}.
+ */
+goog.string.trim =
+    (goog.TRUSTED_SITE && String.prototype.trim) ? function(str) {
+      return str.trim();
+    } : function(str) {
+      // Since IE doesn't include non-breaking-space (0xa0) in their \s
+      // character class (as required by section 7.2 of the ECMAScript spec),
+      // we explicitly include it in the regexp to enforce consistent
+      // cross-browser behavior.
+      return str.replace(/^[\s\xa0]+|[\s\xa0]+$/g, '');
+    };
+
+
+/**
+ * Trims whitespaces at the left end of a string.
+ * @param {string} str The string to left trim.
+ * @return {string} A trimmed copy of {@code str}.
+ */
+goog.string.trimLeft = function(str) {
+  // Since IE doesn't include non-breaking-space (0xa0) in their \s character
+  // class (as required by section 7.2 of the ECMAScript spec), we explicitly
+  // include it in the regexp to enforce consistent cross-browser behavior.
+  return str.replace(/^[\s\xa0]+/, '');
+};
+
+
+/**
+ * Trims whitespaces at the right end of a string.
+ * @param {string} str The string to right trim.
+ * @return {string} A trimmed copy of {@code str}.
+ */
+goog.string.trimRight = function(str) {
+  // Since IE doesn't include non-breaking-space (0xa0) in their \s character
+  // class (as required by section 7.2 of the ECMAScript spec), we explicitly
+  // include it in the regexp to enforce consistent cross-browser behavior.
+  return str.replace(/[\s\xa0]+$/, '');
+};
+
+
+/**
+ * A string comparator that ignores case.
+ * -1 = str1 less than str2
+ *  0 = str1 equals str2
+ *  1 = str1 greater than str2
+ *
+ * @param {string} str1 The string to compare.
+ * @param {string} str2 The string to compare {@code str1} to.
+ * @return {number} The comparator result, as described above.
+ */
+goog.string.caseInsensitiveCompare = function(str1, str2) {
+  var test1 = String(str1).toLowerCase();
+  var test2 = String(str2).toLowerCase();
+
+  if (test1 < test2) {
+    return -1;
+  } else if (test1 == test2) {
+    return 0;
+  } else {
+    return 1;
+  }
+};
+
+
+/**
+ * Compares two strings interpreting their numeric substrings as numbers.
+ *
+ * @param {string} str1 First string.
+ * @param {string} str2 Second string.
+ * @param {!RegExp} tokenizerRegExp Splits a string into substrings of
+ *     non-negative integers, non-numeric characters and optionally fractional
+ *     numbers starting with a decimal point.
+ * @return {number} Negative if str1 < str2, 0 is str1 == str2, positive if
+ *     str1 > str2.
+ * @private
+ */
+goog.string.numberAwareCompare_ = function(str1, str2, tokenizerRegExp) {
+  if (str1 == str2) {
+    return 0;
+  }
+  if (!str1) {
+    return -1;
+  }
+  if (!str2) {
+    return 1;
+  }
+
+  // Using match to split the entire string ahead of time turns out to be faster
+  // for most inputs than using RegExp.exec or iterating over each character.
+  var tokens1 = str1.toLowerCase().match(tokenizerRegExp);
+  var tokens2 = str2.toLowerCase().match(tokenizerRegExp);
+
+  var count = Math.min(tokens1.length, tokens2.length);
+
+  for (var i = 0; i < count; i++) {
+    var a = tokens1[i];
+    var b = tokens2[i];
+
+    // Compare pairs of tokens, returning if one token sorts before the other.
+    if (a != b) {
+      // Only if both tokens are integers is a special comparison required.
+      // Decimal numbers are sorted as strings (e.g., '.09' < '.1').
+      var num1 = parseInt(a, 10);
+      if (!isNaN(num1)) {
+        var num2 = parseInt(b, 10);
+        if (!isNaN(num2) && num1 - num2) {
+          return num1 - num2;
+        }
+      }
+      return a < b ? -1 : 1;
+    }
+  }
+
+  // If one string is a substring of the other, the shorter string sorts first.
+  if (tokens1.length != tokens2.length) {
+    return tokens1.length - tokens2.length;
+  }
+
+  // The two strings must be equivalent except for case (perfect equality is
+  // tested at the head of the function.) Revert to default ASCII string
+  // comparison to stabilize the sort.
+  return str1 < str2 ? -1 : 1;
+};
+
+
+/**
+ * String comparison function that handles non-negative integer numbers in a
+ * way humans might expect. Using this function, the string 'File 2.jpg' sorts
+ * before 'File 10.jpg', and 'Version 1.9' before 'Version 1.10'. The comparison
+ * is mostly case-insensitive, though strings that are identical except for case
+ * are sorted with the upper-case strings before lower-case.
+ *
+ * This comparison function is up to 50x slower than either the default or the
+ * case-insensitive compare. It should not be used in time-critical code, but
+ * should be fast enough to sort several hundred short strings (like filenames)
+ * with a reasonable delay.
+ *
+ * @param {string} str1 The string to compare in a numerically sensitive way.
+ * @param {string} str2 The string to compare {@code str1} to.
+ * @return {number} less than 0 if str1 < str2, 0 if str1 == str2, greater than
+ *     0 if str1 > str2.
+ */
+goog.string.intAwareCompare = function(str1, str2) {
+  return goog.string.numberAwareCompare_(str1, str2, /\d+|\D+/g);
+};
+
+
+/**
+ * String comparison function that handles non-negative integer and fractional
+ * numbers in a way humans might expect. Using this function, the string
+ * 'File 2.jpg' sorts before 'File 10.jpg', and '3.14' before '3.2'. Equivalent
+ * to {@link goog.string.intAwareCompare} apart from the way how it interprets
+ * dots.
+ *
+ * @param {string} str1 The string to compare in a numerically sensitive way.
+ * @param {string} str2 The string to compare {@code str1} to.
+ * @return {number} less than 0 if str1 < str2, 0 if str1 == str2, greater than
+ *     0 if str1 > str2.
+ */
+goog.string.floatAwareCompare = function(str1, str2) {
+  return goog.string.numberAwareCompare_(str1, str2, /\d+|\.\d+|\D+/g);
+};
+
+
+/**
+ * Alias for {@link goog.string.floatAwareCompare}.
+ *
+ * @param {string} str1
+ * @param {string} str2
+ * @return {number}
+ */
+goog.string.numerateCompare = goog.string.floatAwareCompare;
+
+
+/**
+ * URL-encodes a string
+ * @param {*} str The string to url-encode.
+ * @return {string} An encoded copy of {@code str} that is safe for urls.
+ *     Note that '#', ':', and other characters used to delimit portions
+ *     of URLs *will* be encoded.
+ */
+goog.string.urlEncode = function(str) {
+  return encodeURIComponent(String(str));
+};
+
+
+/**
+ * URL-decodes the string. We need to specially handle '+'s because
+ * the javascript library doesn't convert them to spaces.
+ * @param {string} str The string to url decode.
+ * @return {string} The decoded {@code str}.
+ */
+goog.string.urlDecode = function(str) {
+  return decodeURIComponent(str.replace(/\+/g, ' '));
+};
+
+
+/**
+ * Converts \n to <br>s or <br />s.
+ * @param {string} str The string in which to convert newlines.
+ * @param {boolean=} opt_xml Whether to use XML compatible tags.
+ * @return {string} A copy of {@code str} with converted newlines.
+ */
+goog.string.newLineToBr = function(str, opt_xml) {
+  return str.replace(/(\r\n|\r|\n)/g, opt_xml ? '<br />' : '<br>');
+};
+
+
+/**
+ * Escapes double quote '"' and single quote '\'' characters in addition to
+ * '&', '<', and '>' so that a string can be included in an HTML tag attribute
+ * value within double or single quotes.
+ *
+ * It should be noted that > doesn't need to be escaped for the HTML or XML to
+ * be valid, but it has been decided to escape it for consistency with other
+ * implementations.
+ *
+ * With goog.string.DETECT_DOUBLE_ESCAPING, this function escapes also the
+ * lowercase letter "e".
+ *
+ * NOTE(user):
+ * HtmlEscape is often called during the generation of large blocks of HTML.
+ * Using statics for the regular expressions and strings is an optimization
+ * that can more than half the amount of time IE spends in this function for
+ * large apps, since strings and regexes both contribute to GC allocations.
+ *
+ * Testing for the presence of a character before escaping increases the number
+ * of function calls, but actually provides a speed increase for the average
+ * case -- since the average case often doesn't require the escaping of all 4
+ * characters and indexOf() is much cheaper than replace().
+ * The worst case does suffer slightly from the additional calls, therefore the
+ * opt_isLikelyToContainHtmlChars option has been included for situations
+ * where all 4 HTML entities are very likely to be present and need escaping.
+ *
+ * Some benchmarks (times tended to fluctuate +-0.05ms):
+ *                                     FireFox                     IE6
+ * (no chars / average (mix of cases) / all 4 chars)
+ * no checks                     0.13 / 0.22 / 0.22         0.23 / 0.53 / 0.80
+ * indexOf                       0.08 / 0.17 / 0.26         0.22 / 0.54 / 0.84
+ * indexOf + re test             0.07 / 0.17 / 0.28         0.19 / 0.50 / 0.85
+ *
+ * An additional advantage of checking if replace actually needs to be called
+ * is a reduction in the number of object allocations, so as the size of the
+ * application grows the difference between the various methods would increase.
+ *
+ * @param {string} str string to be escaped.
+ * @param {boolean=} opt_isLikelyToContainHtmlChars Don't perform a check to see
+ *     if the character needs replacing - use this option if you expect each of
+ *     the characters to appear often. Leave false if you expect few html
+ *     characters to occur in your strings, such as if you are escaping HTML.
+ * @return {string} An escaped copy of {@code str}.
+ */
+goog.string.htmlEscape = function(str, opt_isLikelyToContainHtmlChars) {
+
+  if (opt_isLikelyToContainHtmlChars) {
+    str = str.replace(goog.string.AMP_RE_, '&amp;')
+              .replace(goog.string.LT_RE_, '&lt;')
+              .replace(goog.string.GT_RE_, '&gt;')
+              .replace(goog.string.QUOT_RE_, '&quot;')
+              .replace(goog.string.SINGLE_QUOTE_RE_, '&#39;')
+              .replace(goog.string.NULL_RE_, '&#0;');
+    if (goog.string.DETECT_DOUBLE_ESCAPING) {
+      str = str.replace(goog.string.E_RE_, '&#101;');
+    }
+    return str;
+
+  } else {
+    // quick test helps in the case when there are no chars to replace, in
+    // worst case this makes barely a difference to the time taken
+    if (!goog.string.ALL_RE_.test(str)) return str;
+
+    // str.indexOf is faster than regex.test in this case
+    if (str.indexOf('&') != -1) {
+      str = str.replace(goog.string.AMP_RE_, '&amp;');
+    }
+    if (str.indexOf('<') != -1) {
+      str = str.replace(goog.string.LT_RE_, '&lt;');
+    }
+    if (str.indexOf('>') != -1) {
+      str = str.replace(goog.string.GT_RE_, '&gt;');
+    }
+    if (str.indexOf('"') != -1) {
+      str = str.replace(goog.string.QUOT_RE_, '&quot;');
+    }
+    if (str.indexOf('\'') != -1) {
+      str = str.replace(goog.string.SINGLE_QUOTE_RE_, '&#39;');
+    }
+    if (str.indexOf('\x00') != -1) {
+      str = str.replace(goog.string.NULL_RE_, '&#0;');
+    }
+    if (goog.string.DETECT_DOUBLE_ESCAPING && str.indexOf('e') != -1) {
+      str = str.replace(goog.string.E_RE_, '&#101;');
+    }
+    return str;
+  }
+};
+
+
+/**
+ * Regular expression that matches an ampersand, for use in escaping.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.AMP_RE_ = /&/g;
+
+
+/**
+ * Regular expression that matches a less than sign, for use in escaping.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.LT_RE_ = /</g;
+
+
+/**
+ * Regular expression that matches a greater than sign, for use in escaping.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.GT_RE_ = />/g;
+
+
+/**
+ * Regular expression that matches a double quote, for use in escaping.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.QUOT_RE_ = /"/g;
+
+
+/**
+ * Regular expression that matches a single quote, for use in escaping.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.SINGLE_QUOTE_RE_ = /'/g;
+
+
+/**
+ * Regular expression that matches null character, for use in escaping.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.NULL_RE_ = /\x00/g;
+
+
+/**
+ * Regular expression that matches a lowercase letter "e", for use in escaping.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.E_RE_ = /e/g;
+
+
+/**
+ * Regular expression that matches any character that needs to be escaped.
+ * @const {!RegExp}
+ * @private
+ */
+goog.string.ALL_RE_ =
+    (goog.string.DETECT_DOUBLE_ESCAPING ? /[\x00&<>"'e]/ : /[\x00&<>"']/);
+
+
+/**
+ * Unescapes an HTML string.
+ *
+ * @param {string} str The string to unescape.
+ * @return {string} An unescaped copy of {@code str}.
+ */
+goog.string.unescapeEntities = function(str) {
+  if (goog.string.contains(str, '&')) {
+    // We are careful not to use a DOM if we do not have one or we explicitly
+    // requested non-DOM html unescaping.
+    if (!goog.string.FORCE_NON_DOM_HTML_UNESCAPING &&
+        'document' in goog.global) {
+      return goog.string.unescapeEntitiesUsingDom_(str);
+    } else {
+      // Fall back on pure XML entities
+      return goog.string.unescapePureXmlEntities_(str);
+    }
+  }
+  return str;
+};
+
+
+/**
+ * Unescapes a HTML string using the provided document.
+ *
+ * @param {string} str The string to unescape.
+ * @param {!Document} document A document to use in escaping the string.
+ * @return {string} An unescaped copy of {@code str}.
+ */
+goog.string.unescapeEntitiesWithDocument = function(str, document) {
+  if (goog.string.contains(str, '&')) {
+    return goog.string.unescapeEntitiesUsingDom_(str, document);
+  }
+  return str;
+};
+
+
+/**
+ * Unescapes an HTML string using a DOM to resolve non-XML, non-numeric
+ * entities. This function is XSS-safe and whitespace-preserving.
+ * @private
+ * @param {string} str The string to unescape.
+ * @param {Document=} opt_document An optional document to use for creating
+ *     elements. If this is not specified then the default window.document
+ *     will be used.
+ * @return {string} The unescaped {@code str} string.
+ */
+goog.string.unescapeEntitiesUsingDom_ = function(str, opt_document) {
+  /** @type {!Object<string, string>} */
+  var seen = {'&amp;': '&', '&lt;': '<', '&gt;': '>', '&quot;': '"'};
+  var div;
+  if (opt_document) {
+    div = opt_document.createElement('div');
+  } else {
+    div = goog.global.document.createElement('div');
+  }
+  // Match as many valid entity characters as possible. If the actual entity
+  // happens to be shorter, it will still work as innerHTML will return the
+  // trailing characters unchanged. Since the entity characters do not include
+  // open angle bracket, there is no chance of XSS from the innerHTML use.
+  // Since no whitespace is passed to innerHTML, whitespace is preserved.
+  return str.replace(goog.string.HTML_ENTITY_PATTERN_, function(s, entity) {
+    // Check for cached entity.
+    var value = seen[s];
+    if (value) {
+      return value;
+    }
+    // Check for numeric entity.
+    if (entity.charAt(0) == '#') {
+      // Prefix with 0 so that hex entities (e.g. &#x10) parse as hex numbers.
+      var n = Number('0' + entity.substr(1));
+      if (!isNaN(n)) {
+        value = String.fromCharCode(n);
+      }
+    }
+    // Fall back to innerHTML otherwise.
+    if (!value) {
+      // Append a non-entity character to avoid a bug in Webkit that parses
+      // an invalid entity at the end of innerHTML text as the empty string.
+      div.innerHTML = s + ' ';
+      // Then remove the trailing character from the result.
+      value = div.firstChild.nodeValue.slice(0, -1);
+    }
+    // Cache and return.
+    return seen[s] = value;
+  });
+};
+
+
+/**
+ * Unescapes XML entities.
+ * @private
+ * @param {string} str The string to unescape.
+ * @return {string} An unescaped copy of {@code str}.
+ */
+goog.string.unescapePureXmlEntities_ = function(str) {
+  return str.replace(/&([^;]+);/g, function(s, entity) {
+    switch (entity) {
+      case 'amp':
+        return '&';
+      case 'lt':
+        return '<';
+      case 'gt':
+        return '>';
+      case 'quot':
+        return '"';
+      default:
+        if (entity.charAt(0) == '#') {
+          // Prefix with 0 so that hex entities (e.g. &#x10) parse as hex.
+          var n = Number('0' + entity.substr(1));
+          if (!isNaN(n)) {
+            return String.fromCharCode(n);
+          }
+        }
+        // For invalid entities we just return the entity
+        return s;
+    }
+  });
+};
+
+
+/**
+ * Regular expression that matches an HTML entity.
+ * See also HTML5: Tokenization / Tokenizing character references.
+ * @private
+ * @type {!RegExp}
+ */
+goog.string.HTML_ENTITY_PATTERN_ = /&([^;\s<&]+);?/g;
+
+
+/**
+ * Do escaping of whitespace to preserve spatial formatting. We use character
+ * entity #160 to make it safer for xml.
+ * @param {string} str The string in which to escape whitespace.
+ * @param {boolean=} opt_xml Whether to use XML compatible tags.
+ * @return {string} An escaped copy of {@code str}.
+ */
+goog.string.whitespaceEscape = function(str, opt_xml) {
+  // This doesn't use goog.string.preserveSpaces for backwards compatibility.
+  return goog.string.newLineToBr(str.replace(/  /g, ' &#160;'), opt_xml);
+};
+
+
+/**
+ * Preserve spaces that would be otherwise collapsed in HTML by replacing them
+ * with non-breaking space Unicode characters.
+ * @param {string} str The string in which to preserve whitespace.
+ * @return {string} A copy of {@code str} with preserved whitespace.
+ */
+goog.string.preserveSpaces = function(str) {
+  return str.replace(/(^|[\n ]) /g, '$1' + goog.string.Unicode.NBSP);
+};
+
+
+/**
+ * Strip quote characters around a string.  The second argument is a string of
+ * characters to treat as quotes.  This can be a single character or a string of
+ * multiple character and in that case each of those are treated as possible
+ * quote characters. For example:
+ *
+ * <pre>
+ * goog.string.stripQuotes('"abc"', '"`') --> 'abc'
+ * goog.string.stripQuotes('`abc`', '"`') --> 'abc'
+ * </pre>
+ *
+ * @param {string} str The string to strip.
+ * @param {string} quoteChars The quote characters to strip.
+ * @return {string} A copy of {@code str} without the quotes.
+ */
+goog.string.stripQuotes = function(str, quoteChars) {
+  var length = quoteChars.length;
+  for (var i = 0; i < length; i++) {
+    var quoteChar = length == 1 ? quoteChars : quoteChars.charAt(i);
+    if (str.charAt(0) == quoteChar && str.charAt(str.length - 1) == quoteChar) {
+      return str.substring(1, str.length - 1);
+    }
+  }
+  return str;
+};
+
+
+/**
+ * Truncates a string to a certain length and adds '...' if necessary.  The
+ * length also accounts for the ellipsis, so a maximum length of 10 and a string
+ * 'Hello World!' produces 'Hello W...'.
+ * @param {string} str The string to truncate.
+ * @param {number} chars Max number of characters.
+ * @param {boolean=} opt_protectEscapedCharacters Whether to protect escaped
+ *     characters from being cut off in the middle.
+ * @return {string} The truncated {@code str} string.
+ */
+goog.string.truncate = function(str, chars, opt_protectEscapedCharacters) {
+  if (opt_protectEscapedCharacters) {
+    str = goog.string.unescapeEntities(str);
+  }
+
+  if (str.length > chars) {
+    str = str.substring(0, chars - 3) + '...';
+  }
+
+  if (opt_protectEscapedCharacters) {
+    str = goog.string.htmlEscape(str);
+  }
+
+  return str;
+};
+
+
+/**
+ * Truncate a string in the middle, adding "..." if necessary,
+ * and favoring the beginning of the string.
+ * @param {string} str The string to truncate the middle of.
+ * @param {number} chars Max number of characters.
+ * @param {boolean=} opt_protectEscapedCharacters Whether to protect escaped
+ *     characters from being cutoff in the middle.
+ * @param {number=} opt_trailingChars Optional number of trailing characters to
+ *     leave at the end of the string, instead of truncating as close to the
+ *     middle as possible.
+ * @return {string} A truncated copy of {@code str}.
+ */
+goog.string.truncateMiddle = function(
+    str, chars, opt_protectEscapedCharacters, opt_trailingChars) {
+  if (opt_protectEscapedCharacters) {
+    str = goog.string.unescapeEntities(str);
+  }
+
+  if (opt_trailingChars && str.length > chars) {
+    if (opt_trailingChars > chars) {
+      opt_trailingChars = chars;
+    }
+    var endPoint = str.length - opt_trailingChars;
+    var startPoint = chars - opt_trailingChars;
+    str = str.substring(0, startPoint) + '...' + str.substring(endPoint);
+  } else if (str.length > chars) {
+    // Favor the beginning of the string:
+    var half = Math.floor(chars / 2);
+    var endPos = str.length - half;
+    half += chars % 2;
+    str = str.substring(0, half) + '...' + str.substring(endPos);
+  }
+
+  if (opt_protectEscapedCharacters) {
+    str = goog.string.htmlEscape(str);
+  }
+
+  return str;
+};
+
+
+/**
+ * Special chars that need to be escaped for goog.string.quote.
+ * @private {!Object<string, string>}
+ */
+goog.string.specialEscapeChars_ = {
+  '\0': '\\0',
+  '\b': '\\b',
+  '\f': '\\f',
+  '\n': '\\n',
+  '\r': '\\r',
+  '\t': '\\t',
+  '\x0B': '\\x0B',  // '\v' is not supported in JScript
+  '"': '\\"',
+  '\\': '\\\\',
+  // To support the use case of embedding quoted strings inside of script
+  // tags, we have to make sure HTML comments and opening/closing script tags do
+  // not appear in the resulting string. The specific strings that must be
+  // escaped are documented at:
+  // http://www.w3.org/TR/html51/semantics.html#restrictions-for-contents-of-script-elements
+  '<': '\x3c'
+};
+
+
+/**
+ * Character mappings used internally for goog.string.escapeChar.
+ * @private {!Object<string, string>}
+ */
+goog.string.jsEscapeCache_ = {
+  '\'': '\\\''
+};
+
+
+/**
+ * Encloses a string in double quotes and escapes characters so that the
+ * string is a valid JS string. The resulting string is safe to embed in
+ * `<script>` tags as "<" is escaped.
+ * @param {string} s The string to quote.
+ * @return {string} A copy of {@code s} surrounded by double quotes.
+ */
+goog.string.quote = function(s) {
+  s = String(s);
+  var sb = ['"'];
+  for (var i = 0; i < s.length; i++) {
+    var ch = s.charAt(i);
+    var cc = ch.charCodeAt(0);
+    sb[i + 1] = goog.string.specialEscapeChars_[ch] ||
+        ((cc > 31 && cc < 127) ? ch : goog.string.escapeChar(ch));
+  }
+  sb.push('"');
+  return sb.join('');
+};
+
+
+/**
+ * Takes a string and returns the escaped string for that input string.
+ * @param {string} str The string to escape.
+ * @return {string} An escaped string representing {@code str}.
+ */
+goog.string.escapeString = function(str) {
+  var sb = [];
+  for (var i = 0; i < str.length; i++) {
+    sb[i] = goog.string.escapeChar(str.charAt(i));
+  }
+  return sb.join('');
+};
+
+
+/**
+ * Takes a character and returns the escaped string for that character. For
+ * example escapeChar(String.fromCharCode(15)) -> "\\x0E".
+ * @param {string} c The character to escape.
+ * @return {string} An escaped string representing {@code c}.
+ */
+goog.string.escapeChar = function(c) {
+  if (c in goog.string.jsEscapeCache_) {
+    return goog.string.jsEscapeCache_[c];
+  }
+
+  if (c in goog.string.specialEscapeChars_) {
+    return goog.string.jsEscapeCache_[c] = goog.string.specialEscapeChars_[c];
+  }
+
+  var rv = c;
+  var cc = c.charCodeAt(0);
+  if (cc > 31 && cc < 127) {
+    rv = c;
+  } else {
+    // tab is 9 but handled above
+    if (cc < 256) {
+      rv = '\\x';
+      if (cc < 16 || cc > 256) {
+        rv += '0';
+      }
+    } else {
+      rv = '\\u';
+      if (cc < 4096) {  // \u1000
+        rv += '0';
+      }
+    }
+    rv += cc.toString(16).toUpperCase();
+  }
+
+  return goog.string.jsEscapeCache_[c] = rv;
+};
+
+
+/**
+ * Determines whether a string contains a substring.
+ * @param {string} str The string to search.
+ * @param {string} subString The substring to search for.
+ * @return {boolean} Whether {@code str} contains {@code subString}.
+ */
+goog.string.contains = function(str, subString) {
+  return str.indexOf(subString) != -1;
+};
+
+
+/**
+ * Determines whether a string contains a substring, ignoring case.
+ * @param {string} str The string to search.
+ * @param {string} subString The substring to search for.
+ * @return {boolean} Whether {@code str} contains {@code subString}.
+ */
+goog.string.caseInsensitiveContains = function(str, subString) {
+  return goog.string.contains(str.toLowerCase(), subString.toLowerCase());
+};
+
+
+/**
+ * Returns the non-overlapping occurrences of ss in s.
+ * If either s or ss evalutes to false, then returns zero.
+ * @param {string} s The string to look in.
+ * @param {string} ss The string to look for.
+ * @return {number} Number of occurrences of ss in s.
+ */
+goog.string.countOf = function(s, ss) {
+  return s && ss ? s.split(ss).length - 1 : 0;
+};
+
+
+/**
+ * Removes a substring of a specified length at a specific
+ * index in a string.
+ * @param {string} s The base string from which to remove.
+ * @param {number} index The index at which to remove the substring.
+ * @param {number} stringLength The length of the substring to remove.
+ * @return {string} A copy of {@code s} with the substring removed or the full
+ *     string if nothing is removed or the input is invalid.
+ */
+goog.string.removeAt = function(s, index, stringLength) {
+  var resultStr = s;
+  // If the index is greater or equal to 0 then remove substring
+  if (index >= 0 && index < s.length && stringLength > 0) {
+    resultStr = s.substr(0, index) +
+        s.substr(index + stringLength, s.length - index - stringLength);
+  }
+  return resultStr;
+};
+
+
+/**
+ * Removes the first occurrence of a substring from a string.
+ * @param {string} str The base string from which to remove.
+ * @param {string} substr The string to remove.
+ * @return {string} A copy of {@code str} with {@code substr} removed or the
+ *     full string if nothing is removed.
+ */
+goog.string.remove = function(str, substr) {
+  return str.replace(substr, '');
+};
+
+
+/**
+ *  Removes all occurrences of a substring from a string.
+ *  @param {string} s The base string from which to remove.
+ *  @param {string} ss The string to remove.
+ *  @return {string} A copy of {@code s} with {@code ss} removed or the full
+ *      string if nothing is removed.
+ */
+goog.string.removeAll = function(s, ss) {
+  var re = new RegExp(goog.string.regExpEscape(ss), 'g');
+  return s.replace(re, '');
+};
+
+
+/**
+ *  Replaces all occurrences of a substring of a string with a new substring.
+ *  @param {string} s The base string from which to remove.
+ *  @param {string} ss The string to replace.
+ *  @param {string} replacement The replacement string.
+ *  @return {string} A copy of {@code s} with {@code ss} replaced by
+ *      {@code replacement} or the original string if nothing is replaced.
+ */
+goog.string.replaceAll = function(s, ss, replacement) {
+  var re = new RegExp(goog.string.regExpEscape(ss), 'g');
+  return s.replace(re, replacement.replace(/\$/g, '$$$$'));
+};
+
+
+/**
+ * Escapes characters in the string that are not safe to use in a RegExp.
+ * @param {*} s The string to escape. If not a string, it will be casted
+ *     to one.
+ * @return {string} A RegExp safe, escaped copy of {@code s}.
+ */
+goog.string.regExpEscape = function(s) {
+  return String(s)
+      .replace(/([-()\[\]{}+?*.$\^|,:#<!\\])/g, '\\$1')
+      .replace(/\x08/g, '\\x08');
+};
+
+
+/**
+ * Repeats a string n times.
+ * @param {string} string The string to repeat.
+ * @param {number} length The number of times to repeat.
+ * @return {string} A string containing {@code length} repetitions of
+ *     {@code string}.
+ */
+goog.string.repeat = (String.prototype.repeat) ? function(string, length) {
+  // The native method is over 100 times faster than the alternative.
+  return string.repeat(length);
+} : function(string, length) {
+  return new Array(length + 1).join(string);
+};
+
+
+/**
+ * Pads number to given length and optionally rounds it to a given precision.
+ * For example:
+ * <pre>padNumber(1.25, 2, 3) -> '01.250'
+ * padNumber(1.25, 2) -> '01.25'
+ * padNumber(1.25, 2, 1) -> '01.3'
+ * padNumber(1.25, 0) -> '1.25'</pre>
+ *
+ * @param {number} num The number to pad.
+ * @param {number} length The desired length.
+ * @param {number=} opt_precision The desired precision.
+ * @return {string} {@code num} as a string with the given options.
+ */
+goog.string.padNumber = function(num, length, opt_precision) {
+  var s = goog.isDef(opt_precision) ? num.toFixed(opt_precision) : String(num);
+  var index = s.indexOf('.');
+  if (index == -1) {
+    index = s.length;
+  }
+  return goog.string.repeat('0', Math.max(0, length - index)) + s;
+};
+
+
+/**
+ * Returns a string representation of the given object, with
+ * null and undefined being returned as the empty string.
+ *
+ * @param {*} obj The object to convert.
+ * @return {string} A string representation of the {@code obj}.
+ */
+goog.string.makeSafe = function(obj) {
+  return obj == null ? '' : String(obj);
+};
+
+
+/**
+ * Concatenates string expressions. This is useful
+ * since some browsers are very inefficient when it comes to using plus to
+ * concat strings. Be careful when using null and undefined here since
+ * these will not be included in the result. If you need to represent these
+ * be sure to cast the argument to a String first.
+ * For example:
+ * <pre>buildString('a', 'b', 'c', 'd') -> 'abcd'
+ * buildString(null, undefined) -> ''
+ * </pre>
+ * @param {...*} var_args A list of strings to concatenate. If not a string,
+ *     it will be casted to one.
+ * @return {string} The concatenation of {@code var_args}.
+ */
+goog.string.buildString = function(var_args) {
+  return Array.prototype.join.call(arguments, '');
+};
+
+
+/**
+ * Returns a string with at least 64-bits of randomness.
+ *
+ * Doesn't trust Javascript's random function entirely. Uses a combination of
+ * random and current timestamp, and then encodes the string in base-36 to
+ * make it shorter.
+ *
+ * @return {string} A random string, e.g. sn1s7vb4gcic.
+ */
+goog.string.getRandomString = function() {
+  var x = 2147483648;
+  return Math.floor(Math.random() * x).toString(36) +
+      Math.abs(Math.floor(Math.random() * x) ^ goog.now()).toString(36);
+};
+
+
+/**
+ * Compares two version numbers.
+ *
+ * @param {string|number} version1 Version of first item.
+ * @param {string|number} version2 Version of second item.
+ *
+ * @return {number}  1 if {@code version1} is higher.
+ *                   0 if arguments are equal.
+ *                  -1 if {@code version2} is higher.
+ */
+goog.string.compareVersions = function(version1, version2) {
+  var order = 0;
+  // Trim leading and trailing whitespace and split the versions into
+  // subversions.
+  var v1Subs = goog.string.trim(String(version1)).split('.');
+  var v2Subs = goog.string.trim(String(version2)).split('.');
+  var subCount = Math.max(v1Subs.length, v2Subs.length);
+
+  // Iterate over the subversions, as long as they appear to be equivalent.
+  for (var subIdx = 0; order == 0 && subIdx < subCount; subIdx++) {
+    var v1Sub = v1Subs[subIdx] || '';
+    var v2Sub = v2Subs[subIdx] || '';
+
+    do {
+      // Split the subversions into pairs of numbers and qualifiers (like 'b').
+      // Two different RegExp objects are use to make it clear the code
+      // is side-effect free
+      var v1Comp = /(\d*)(\D*)(.*)/.exec(v1Sub) || ['', '', '', ''];
+      var v2Comp = /(\d*)(\D*)(.*)/.exec(v2Sub) || ['', '', '', ''];
+      // Break if there are no more matches.
+      if (v1Comp[0].length == 0 && v2Comp[0].length == 0) {
+        break;
+      }
+
+      // Parse the numeric part of the subversion. A missing number is
+      // equivalent to 0.
+      var v1CompNum = v1Comp[1].length == 0 ? 0 : parseInt(v1Comp[1], 10);
+      var v2CompNum = v2Comp[1].length == 0 ? 0 : parseInt(v2Comp[1], 10);
+
+      // Compare the subversion components. The number has the highest
+      // precedence. Next, if the numbers are equal, a subversion without any
+      // qualifier is always higher than a subversion with any qualifier. Next,
+      // the qualifiers are compared as strings.
+      order = goog.string.compareElements_(v1CompNum, v2CompNum) ||
+          goog.string.compareElements_(
+              v1Comp[2].length == 0, v2Comp[2].length == 0) ||
+          goog.string.compareElements_(v1Comp[2], v2Comp[2]);
+      // Stop as soon as an inequality is discovered.
+
+      v1Sub = v1Comp[3];
+      v2Sub = v2Comp[3];
+    } while (order == 0);
+  }
+
+  return order;
+};
+
+
+/**
+ * Compares elements of a version number.
+ *
+ * @param {string|number|boolean} left An element from a version number.
+ * @param {string|number|boolean} right An element from a version number.
+ *
+ * @return {number}  1 if {@code left} is higher.
+ *                   0 if arguments are equal.
+ *                  -1 if {@code right} is higher.
+ * @private
+ */
+goog.string.compareElements_ = function(left, right) {
+  if (left < right) {
+    return -1;
+  } else if (left > right) {
+    return 1;
+  }
+  return 0;
+};
+
+
+/**
+ * String hash function similar to java.lang.String.hashCode().
+ * The hash code for a string is computed as
+ * s[0] * 31 ^ (n - 1) + s[1] * 31 ^ (n - 2) + ... + s[n - 1],
+ * where s[i] is the ith character of the string and n is the length of
+ * the string. We mod the result to make it between 0 (inclusive) and 2^32
+ * (exclusive).
+ * @param {string} str A string.
+ * @return {number} Hash value for {@code str}, between 0 (inclusive) and 2^32
+ *  (exclusive). The empty string returns 0.
+ */
+goog.string.hashCode = function(str) {
+  var result = 0;
+  for (var i = 0; i < str.length; ++i) {
+    // Normalize to 4 byte range, 0 ... 2^32.
+    result = (31 * result + str.charCodeAt(i)) >>> 0;
+  }
+  return result;
+};
+
+
+/**
+ * The most recent unique ID. |0 is equivalent to Math.floor in this case.
+ * @type {number}
+ * @private
+ */
+goog.string.uniqueStringCounter_ = Math.random() * 0x80000000 | 0;
+
+
+/**
+ * Generates and returns a string which is unique in the current document.
+ * This is useful, for example, to create unique IDs for DOM elements.
+ * @return {string} A unique id.
+ */
+goog.string.createUniqueString = function() {
+  return 'goog_' + goog.string.uniqueStringCounter_++;
+};
+
+
+/**
+ * Converts the supplied string to a number, which may be Infinity or NaN.
+ * This function strips whitespace: (toNumber(' 123') === 123)
+ * This function accepts scientific notation: (toNumber('1e1') === 10)
+ *
+ * This is better than Javascript's built-in conversions because, sadly:
+ *     (Number(' ') === 0) and (parseFloat('123a') === 123)
+ *
+ * @param {string} str The string to convert.
+ * @return {number} The number the supplied string represents, or NaN.
+ */
+goog.string.toNumber = function(str) {
+  var num = Number(str);
+  if (num == 0 && goog.string.isEmptyOrWhitespace(str)) {
+    return NaN;
+  }
+  return num;
+};
+
+
+/**
+ * Returns whether the given string is lower camel case (e.g. "isFooBar").
+ *
+ * Note that this assumes the string is entirely letters.
+ * @see http://en.wikipedia.org/wiki/CamelCase#Variations_and_synonyms
+ *
+ * @param {string} str String to test.
+ * @return {boolean} Whether the string is lower camel case.
+ */
+goog.string.isLowerCamelCase = function(str) {
+  return /^[a-z]+([A-Z][a-z]*)*$/.test(str);
+};
+
+
+/**
+ * Returns whether the given string is upper camel case (e.g. "FooBarBaz").
+ *
+ * Note that this assumes the string is entirely letters.
+ * @see http://en.wikipedia.org/wiki/CamelCase#Variations_and_synonyms
+ *
+ * @param {string} str String to test.
+ * @return {boolean} Whether the string is upper camel case.
+ */
+goog.string.isUpperCamelCase = function(str) {
+  return /^([A-Z][a-z]*)+$/.test(str);
+};
+
+
+/**
+ * Converts a string from selector-case to camelCase (e.g. from
+ * "multi-part-string" to "multiPartString"), useful for converting
+ * CSS selectors and HTML dataset keys to their equivalent JS properties.
+ * @param {string} str The string in selector-case form.
+ * @return {string} The string in camelCase form.
+ */
+goog.string.toCamelCase = function(str) {
+  return String(str).replace(
+      /\-([a-z])/g, function(all, match) { return match.toUpperCase(); });
+};
+
+
+/**
+ * Converts a string from camelCase to selector-case (e.g. from
+ * "multiPartString" to "multi-part-string"), useful for converting JS
+ * style and dataset properties to equivalent CSS selectors and HTML keys.
+ * @param {string} str The string in camelCase form.
+ * @return {string} The string in selector-case form.
+ */
+goog.string.toSelectorCase = function(str) {
+  return String(str).replace(/([A-Z])/g, '-$1').toLowerCase();
+};
+
+
+/**
+ * Converts a string into TitleCase. First character of the string is always
+ * capitalized in addition to the first letter of every subsequent word.
+ * Words are delimited by one or more whitespaces by default. Custom delimiters
+ * can optionally be specified to replace the default, which doesn't preserve
+ * whitespace delimiters and instead must be explicitly included if needed.
+ *
+ * Default delimiter => " ":
+ *    goog.string.toTitleCase('oneTwoThree')    => 'OneTwoThree'
+ *    goog.string.toTitleCase('one two three')  => 'One Two Three'
+ *    goog.string.toTitleCase('  one   two   ') => '  One   Two   '
+ *    goog.string.toTitleCase('one_two_three')  => 'One_two_three'
+ *    goog.string.toTitleCase('one-two-three')  => 'One-two-three'
+ *
+ * Custom delimiter => "_-.":
+ *    goog.string.toTitleCase('oneTwoThree', '_-.')       => 'OneTwoThree'
+ *    goog.string.toTitleCase('one two three', '_-.')     => 'One two three'
+ *    goog.string.toTitleCase('  one   two   ', '_-.')    => '  one   two   '
+ *    goog.string.toTitleCase('one_two_three', '_-.')     => 'One_Two_Three'
+ *    goog.string.toTitleCase('one-two-three', '_-.')     => 'One-Two-Three'
+ *    goog.string.toTitleCase('one...two...three', '_-.') => 'One...Two...Three'
+ *    goog.string.toTitleCase('one. two. three', '_-.')   => 'One. two. three'
+ *    goog.string.toTitleCase('one-two.three', '_-.')     => 'One-Two.Three'
+ *
+ * @param {string} str String value in camelCase form.
+ * @param {string=} opt_delimiters Custom delimiter character set used to
+ *      distinguish words in the string value. Each character represents a
+ *      single delimiter. When provided, default whitespace delimiter is
+ *      overridden and must be explicitly included if needed.
+ * @return {string} String value in TitleCase form.
+ */
+goog.string.toTitleCase = function(str, opt_delimiters) {
+  var delimiters = goog.isString(opt_delimiters) ?
+      goog.string.regExpEscape(opt_delimiters) :
+      '\\s';
+
+  // For IE8, we need to prevent using an empty character set. Otherwise,
+  // incorrect matching will occur.
+  delimiters = delimiters ? '|[' + delimiters + ']+' : '';
+
+  var regexp = new RegExp('(^' + delimiters + ')([a-z])', 'g');
+  return str.replace(
+      regexp, function(all, p1, p2) { return p1 + p2.toUpperCase(); });
+};
+
+
+/**
+ * Capitalizes a string, i.e. converts the first letter to uppercase
+ * and all other letters to lowercase, e.g.:
+ *
+ * goog.string.capitalize('one')     => 'One'
+ * goog.string.capitalize('ONE')     => 'One'
+ * goog.string.capitalize('one two') => 'One two'
+ *
+ * Note that this function does not trim initial whitespace.
+ *
+ * @param {string} str String value to capitalize.
+ * @return {string} String value with first letter in uppercase.
+ */
+goog.string.capitalize = function(str) {
+  return String(str.charAt(0)).toUpperCase() +
+      String(str.substr(1)).toLowerCase();
+};
+
+
+/**
+ * Parse a string in decimal or hexidecimal ('0xFFFF') form.
+ *
+ * To parse a particular radix, please use parseInt(string, radix) directly. See
+ * https://developer.mozilla.org/en/JavaScript/Reference/Global_Objects/parseInt
+ *
+ * This is a wrapper for the built-in parseInt function that will only parse
+ * numbers as base 10 or base 16.  Some JS implementations assume strings
+ * starting with "0" are intended to be octal. ES3 allowed but discouraged
+ * this behavior. ES5 forbids it.  This function emulates the ES5 behavior.
+ *
+ * For more information, see Mozilla JS Reference: http://goo.gl/8RiFj
+ *
+ * @param {string|number|null|undefined} value The value to be parsed.
+ * @return {number} The number, parsed. If the string failed to parse, this
+ *     will be NaN.
+ */
+goog.string.parseInt = function(value) {
+  // Force finite numbers to strings.
+  if (isFinite(value)) {
+    value = String(value);
+  }
+
+  if (goog.isString(value)) {
+    // If the string starts with '0x' or '-0x', parse as hex.
+    return /^\s*-?0x/i.test(value) ? parseInt(value, 16) : parseInt(value, 10);
+  }
+
+  return NaN;
+};
+
+
+/**
+ * Splits a string on a separator a limited number of times.
+ *
+ * This implementation is more similar to Python or Java, where the limit
+ * parameter specifies the maximum number of splits rather than truncating
+ * the number of results.
+ *
+ * See http://docs.python.org/2/library/stdtypes.html#str.split
+ * See JavaDoc: http://goo.gl/F2AsY
+ * See Mozilla reference: http://goo.gl/dZdZs
+ *
+ * @param {string} str String to split.
+ * @param {string} separator The separator.
+ * @param {number} limit The limit to the number of splits. The resulting array
+ *     will have a maximum length of limit+1.  Negative numbers are the same
+ *     as zero.
+ * @return {!Array<string>} The string, split.
+ */
+goog.string.splitLimit = function(str, separator, limit) {
+  var parts = str.split(separator);
+  var returnVal = [];
+
+  // Only continue doing this while we haven't hit the limit and we have
+  // parts left.
+  while (limit > 0 && parts.length) {
+    returnVal.push(parts.shift());
+    limit--;
+  }
+
+  // If there are remaining parts, append them to the end.
+  if (parts.length) {
+    returnVal.push(parts.join(separator));
+  }
+
+  return returnVal;
+};
+
+
+/**
+ * Finds the characters to the right of the last instance of any separator
+ *
+ * This function is similar to goog.string.path.baseName, except it can take a
+ * list of characters to split the string on. It will return the rightmost
+ * grouping of characters to the right of any separator as a left-to-right
+ * oriented string.
+ *
+ * @see goog.string.path.baseName
+ * @param {string} str The string
+ * @param {string|!Array<string>} separators A list of separator characters
+ * @return {string} The last part of the string with respect to the separators
+ */
+goog.string.lastComponent = function(str, separators) {
+  if (!separators) {
+    return str;
+  } else if (typeof separators == 'string') {
+    separators = [separators];
+  }
+
+  var lastSeparatorIndex = -1;
+  for (var i = 0; i < separators.length; i++) {
+    if (separators[i] == '') {
+      continue;
+    }
+    var currentSeparatorIndex = str.lastIndexOf(separators[i]);
+    if (currentSeparatorIndex > lastSeparatorIndex) {
+      lastSeparatorIndex = currentSeparatorIndex;
+    }
+  }
+  if (lastSeparatorIndex == -1) {
+    return str;
+  }
+  return str.slice(lastSeparatorIndex + 1);
+};
+
+
+/**
+ * Computes the Levenshtein edit distance between two strings.
+ * @param {string} a
+ * @param {string} b
+ * @return {number} The edit distance between the two strings.
+ */
+goog.string.editDistance = function(a, b) {
+  var v0 = [];
+  var v1 = [];
+
+  if (a == b) {
+    return 0;
+  }
+
+  if (!a.length || !b.length) {
+    return Math.max(a.length, b.length);
+  }
+
+  for (var i = 0; i < b.length + 1; i++) {
+    v0[i] = i;
+  }
+
+  for (var i = 0; i < a.length; i++) {
+    v1[0] = i + 1;
+
+    for (var j = 0; j < b.length; j++) {
+      var cost = Number(a[i] != b[j]);
+      // Cost for the substring is the minimum of adding one character, removing
+      // one character, or a swap.
+      v1[j + 1] = Math.min(v1[j] + 1, v0[j + 1] + 1, v0[j] + cost);
+    }
+
+    for (var j = 0; j < v0.length; j++) {
+      v0[j] = v1[j];
+    }
+  }
+
+  return v1[b.length];
+};
diff --git a/js/goog/string/stringbuffer.js b/js/goog/string/stringbuffer.js
new file mode 100644
index 0000000..478b08b
--- /dev/null
+++ b/js/goog/string/stringbuffer.js
@@ -0,0 +1,103 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Utility for fast string concatenation.
+ */
+
+goog.provide('goog.string.StringBuffer');
+
+
+
+/**
+ * Utility class to facilitate string concatenation.
+ *
+ * @param {*=} opt_a1 Optional first initial item to append.
+ * @param {...*} var_args Other initial items to
+ *     append, e.g., new goog.string.StringBuffer('foo', 'bar').
+ * @constructor
+ */
+goog.string.StringBuffer = function(opt_a1, var_args) {
+  if (opt_a1 != null) {
+    this.append.apply(this, arguments);
+  }
+};
+
+
+/**
+ * Internal buffer for the string to be concatenated.
+ * @type {string}
+ * @private
+ */
+goog.string.StringBuffer.prototype.buffer_ = '';
+
+
+/**
+ * Sets the contents of the string buffer object, replacing what's currently
+ * there.
+ *
+ * @param {*} s String to set.
+ */
+goog.string.StringBuffer.prototype.set = function(s) {
+  this.buffer_ = '' + s;
+};
+
+
+/**
+ * Appends one or more items to the buffer.
+ *
+ * Calling this with null, undefined, or empty arguments is an error.
+ *
+ * @param {*} a1 Required first string.
+ * @param {*=} opt_a2 Optional second string.
+ * @param {...?} var_args Other items to append,
+ *     e.g., sb.append('foo', 'bar', 'baz').
+ * @return {!goog.string.StringBuffer} This same StringBuffer object.
+ * @suppress {duplicate}
+ */
+goog.string.StringBuffer.prototype.append = function(a1, opt_a2, var_args) {
+  // Use a1 directly to avoid arguments instantiation for single-arg case.
+  this.buffer_ += String(a1);
+  if (opt_a2 != null) {  // second argument is undefined (null == undefined)
+    for (var i = 1; i < arguments.length; i++) {
+      this.buffer_ += arguments[i];
+    }
+  }
+  return this;
+};
+
+
+/**
+ * Clears the internal buffer.
+ */
+goog.string.StringBuffer.prototype.clear = function() {
+  this.buffer_ = '';
+};
+
+
+/**
+ * @return {number} the length of the current contents of the buffer.
+ */
+goog.string.StringBuffer.prototype.getLength = function() {
+  return this.buffer_.length;
+};
+
+
+/**
+ * @return {string} The concatenated string.
+ * @override
+ */
+goog.string.StringBuffer.prototype.toString = function() {
+  return this.buffer_;
+};
diff --git a/js/goog/structs/map.js b/js/goog/structs/map.js
new file mode 100644
index 0000000..1cb4bcc
--- /dev/null
+++ b/js/goog/structs/map.js
@@ -0,0 +1,458 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Datastructure: Hash Map.
+ *
+ * @author arv@google.com (Erik Arvidsson)
+ *
+ * This file contains an implementation of a Map structure. It implements a lot
+ * of the methods used in goog.structs so those functions work on hashes. This
+ * is best suited for complex key types. For simple keys such as numbers and
+ * strings consider using the lighter-weight utilities in goog.object.
+ */
+
+
+goog.provide('goog.structs.Map');
+
+goog.require('goog.iter.Iterator');
+goog.require('goog.iter.StopIteration');
+goog.require('goog.object');
+
+
+
+/**
+ * Class for Hash Map datastructure.
+ * @param {*=} opt_map Map or Object to initialize the map with.
+ * @param {...*} var_args If 2 or more arguments are present then they
+ *     will be used as key-value pairs.
+ * @constructor
+ * @template K, V
+ * @deprecated This type is misleading: use ES6 Map instead.
+ */
+goog.structs.Map = function(opt_map, var_args) {
+
+  /**
+   * Underlying JS object used to implement the map.
+   * @private {!Object}
+   */
+  this.map_ = {};
+
+  /**
+   * An array of keys. This is necessary for two reasons:
+   *   1. Iterating the keys using for (var key in this.map_) allocates an
+   *      object for every key in IE which is really bad for IE6 GC perf.
+   *   2. Without a side data structure, we would need to escape all the keys
+   *      as that would be the only way we could tell during iteration if the
+   *      key was an internal key or a property of the object.
+   *
+   * This array can contain deleted keys so it's necessary to check the map
+   * as well to see if the key is still in the map (this doesn't require a
+   * memory allocation in IE).
+   * @private {!Array<string>}
+   */
+  this.keys_ = [];
+
+  /**
+   * The number of key value pairs in the map.
+   * @private {number}
+   */
+  this.count_ = 0;
+
+  /**
+   * Version used to detect changes while iterating.
+   * @private {number}
+   */
+  this.version_ = 0;
+
+  var argLength = arguments.length;
+
+  if (argLength > 1) {
+    if (argLength % 2) {
+      throw Error('Uneven number of arguments');
+    }
+    for (var i = 0; i < argLength; i += 2) {
+      this.set(arguments[i], arguments[i + 1]);
+    }
+  } else if (opt_map) {
+    this.addAll(/** @type {Object} */ (opt_map));
+  }
+};
+
+
+/**
+ * @return {number} The number of key-value pairs in the map.
+ */
+goog.structs.Map.prototype.getCount = function() {
+  return this.count_;
+};
+
+
+/**
+ * Returns the values of the map.
+ * @return {!Array<V>} The values in the map.
+ */
+goog.structs.Map.prototype.getValues = function() {
+  this.cleanupKeysArray_();
+
+  var rv = [];
+  for (var i = 0; i < this.keys_.length; i++) {
+    var key = this.keys_[i];
+    rv.push(this.map_[key]);
+  }
+  return rv;
+};
+
+
+/**
+ * Returns the keys of the map.
+ * @return {!Array<string>} Array of string values.
+ */
+goog.structs.Map.prototype.getKeys = function() {
+  this.cleanupKeysArray_();
+  return /** @type {!Array<string>} */ (this.keys_.concat());
+};
+
+
+/**
+ * Whether the map contains the given key.
+ * @param {*} key The key to check for.
+ * @return {boolean} Whether the map contains the key.
+ */
+goog.structs.Map.prototype.containsKey = function(key) {
+  return goog.structs.Map.hasKey_(this.map_, key);
+};
+
+
+/**
+ * Whether the map contains the given value. This is O(n).
+ * @param {V} val The value to check for.
+ * @return {boolean} Whether the map contains the value.
+ */
+goog.structs.Map.prototype.containsValue = function(val) {
+  for (var i = 0; i < this.keys_.length; i++) {
+    var key = this.keys_[i];
+    if (goog.structs.Map.hasKey_(this.map_, key) && this.map_[key] == val) {
+      return true;
+    }
+  }
+  return false;
+};
+
+
+/**
+ * Whether this map is equal to the argument map.
+ * @param {goog.structs.Map} otherMap The map against which to test equality.
+ * @param {function(V, V): boolean=} opt_equalityFn Optional equality function
+ *     to test equality of values. If not specified, this will test whether
+ *     the values contained in each map are identical objects.
+ * @return {boolean} Whether the maps are equal.
+ */
+goog.structs.Map.prototype.equals = function(otherMap, opt_equalityFn) {
+  if (this === otherMap) {
+    return true;
+  }
+
+  if (this.count_ != otherMap.getCount()) {
+    return false;
+  }
+
+  var equalityFn = opt_equalityFn || goog.structs.Map.defaultEquals;
+
+  this.cleanupKeysArray_();
+  for (var key, i = 0; key = this.keys_[i]; i++) {
+    if (!equalityFn(this.get(key), otherMap.get(key))) {
+      return false;
+    }
+  }
+
+  return true;
+};
+
+
+/**
+ * Default equality test for values.
+ * @param {*} a The first value.
+ * @param {*} b The second value.
+ * @return {boolean} Whether a and b reference the same object.
+ */
+goog.structs.Map.defaultEquals = function(a, b) {
+  return a === b;
+};
+
+
+/**
+ * @return {boolean} Whether the map is empty.
+ */
+goog.structs.Map.prototype.isEmpty = function() {
+  return this.count_ == 0;
+};
+
+
+/**
+ * Removes all key-value pairs from the map.
+ */
+goog.structs.Map.prototype.clear = function() {
+  this.map_ = {};
+  this.keys_.length = 0;
+  this.count_ = 0;
+  this.version_ = 0;
+};
+
+
+/**
+ * Removes a key-value pair based on the key. This is O(logN) amortized due to
+ * updating the keys array whenever the count becomes half the size of the keys
+ * in the keys array.
+ * @param {*} key  The key to remove.
+ * @return {boolean} Whether object was removed.
+ */
+goog.structs.Map.prototype.remove = function(key) {
+  if (goog.structs.Map.hasKey_(this.map_, key)) {
+    delete this.map_[key];
+    this.count_--;
+    this.version_++;
+
+    // clean up the keys array if the threshold is hit
+    if (this.keys_.length > 2 * this.count_) {
+      this.cleanupKeysArray_();
+    }
+
+    return true;
+  }
+  return false;
+};
+
+
+/**
+ * Cleans up the temp keys array by removing entries that are no longer in the
+ * map.
+ * @private
+ */
+goog.structs.Map.prototype.cleanupKeysArray_ = function() {
+  if (this.count_ != this.keys_.length) {
+    // First remove keys that are no longer in the map.
+    var srcIndex = 0;
+    var destIndex = 0;
+    while (srcIndex < this.keys_.length) {
+      var key = this.keys_[srcIndex];
+      if (goog.structs.Map.hasKey_(this.map_, key)) {
+        this.keys_[destIndex++] = key;
+      }
+      srcIndex++;
+    }
+    this.keys_.length = destIndex;
+  }
+
+  if (this.count_ != this.keys_.length) {
+    // If the count still isn't correct, that means we have duplicates. This can
+    // happen when the same key is added and removed multiple times. Now we have
+    // to allocate one extra Object to remove the duplicates. This could have
+    // been done in the first pass, but in the common case, we can avoid
+    // allocating an extra object by only doing this when necessary.
+    var seen = {};
+    var srcIndex = 0;
+    var destIndex = 0;
+    while (srcIndex < this.keys_.length) {
+      var key = this.keys_[srcIndex];
+      if (!(goog.structs.Map.hasKey_(seen, key))) {
+        this.keys_[destIndex++] = key;
+        seen[key] = 1;
+      }
+      srcIndex++;
+    }
+    this.keys_.length = destIndex;
+  }
+};
+
+
+/**
+ * Returns the value for the given key.  If the key is not found and the default
+ * value is not given this will return {@code undefined}.
+ * @param {*} key The key to get the value for.
+ * @param {DEFAULT=} opt_val The value to return if no item is found for the
+ *     given key, defaults to undefined.
+ * @return {V|DEFAULT} The value for the given key.
+ * @template DEFAULT
+ */
+goog.structs.Map.prototype.get = function(key, opt_val) {
+  if (goog.structs.Map.hasKey_(this.map_, key)) {
+    return this.map_[key];
+  }
+  return opt_val;
+};
+
+
+/**
+ * Adds a key-value pair to the map.
+ * @param {*} key The key.
+ * @param {V} value The value to add.
+ * @return {*} Some subclasses return a value.
+ */
+goog.structs.Map.prototype.set = function(key, value) {
+  if (!(goog.structs.Map.hasKey_(this.map_, key))) {
+    this.count_++;
+    // TODO(johnlenz): This class lies, it claims to return an array of string
+    // keys, but instead returns the original object used.
+    this.keys_.push(/** @type {?} */ (key));
+    // Only change the version if we add a new key.
+    this.version_++;
+  }
+  this.map_[key] = value;
+};
+
+
+/**
+ * Adds multiple key-value pairs from another goog.structs.Map or Object.
+ * @param {Object} map  Object containing the data to add.
+ */
+goog.structs.Map.prototype.addAll = function(map) {
+  var keys, values;
+  if (map instanceof goog.structs.Map) {
+    keys = map.getKeys();
+    values = map.getValues();
+  } else {
+    keys = goog.object.getKeys(map);
+    values = goog.object.getValues(map);
+  }
+  // we could use goog.array.forEach here but I don't want to introduce that
+  // dependency just for this.
+  for (var i = 0; i < keys.length; i++) {
+    this.set(keys[i], values[i]);
+  }
+};
+
+
+/**
+ * Calls the given function on each entry in the map.
+ * @param {function(this:T, V, K, goog.structs.Map<K,V>)} f
+ * @param {T=} opt_obj The value of "this" inside f.
+ * @template T
+ */
+goog.structs.Map.prototype.forEach = function(f, opt_obj) {
+  var keys = this.getKeys();
+  for (var i = 0; i < keys.length; i++) {
+    var key = keys[i];
+    var value = this.get(key);
+    f.call(opt_obj, value, key, this);
+  }
+};
+
+
+/**
+ * Clones a map and returns a new map.
+ * @return {!goog.structs.Map} A new map with the same key-value pairs.
+ */
+goog.structs.Map.prototype.clone = function() {
+  return new goog.structs.Map(this);
+};
+
+
+/**
+ * Returns a new map in which all the keys and values are interchanged
+ * (keys become values and values become keys). If multiple keys map to the
+ * same value, the chosen transposed value is implementation-dependent.
+ *
+ * It acts very similarly to {goog.object.transpose(Object)}.
+ *
+ * @return {!goog.structs.Map} The transposed map.
+ */
+goog.structs.Map.prototype.transpose = function() {
+  var transposed = new goog.structs.Map();
+  for (var i = 0; i < this.keys_.length; i++) {
+    var key = this.keys_[i];
+    var value = this.map_[key];
+    transposed.set(value, key);
+  }
+
+  return transposed;
+};
+
+
+/**
+ * @return {!Object} Object representation of the map.
+ */
+goog.structs.Map.prototype.toObject = function() {
+  this.cleanupKeysArray_();
+  var obj = {};
+  for (var i = 0; i < this.keys_.length; i++) {
+    var key = this.keys_[i];
+    obj[key] = this.map_[key];
+  }
+  return obj;
+};
+
+
+/**
+ * Returns an iterator that iterates over the keys in the map.  Removal of keys
+ * while iterating might have undesired side effects.
+ * @return {!goog.iter.Iterator} An iterator over the keys in the map.
+ */
+goog.structs.Map.prototype.getKeyIterator = function() {
+  return this.__iterator__(true);
+};
+
+
+/**
+ * Returns an iterator that iterates over the values in the map.  Removal of
+ * keys while iterating might have undesired side effects.
+ * @return {!goog.iter.Iterator} An iterator over the values in the map.
+ */
+goog.structs.Map.prototype.getValueIterator = function() {
+  return this.__iterator__(false);
+};
+
+
+/**
+ * Returns an iterator that iterates over the values or the keys in the map.
+ * This throws an exception if the map was mutated since the iterator was
+ * created.
+ * @param {boolean=} opt_keys True to iterate over the keys. False to iterate
+ *     over the values.  The default value is false.
+ * @return {!goog.iter.Iterator} An iterator over the values or keys in the map.
+ */
+goog.structs.Map.prototype.__iterator__ = function(opt_keys) {
+  // Clean up keys to minimize the risk of iterating over dead keys.
+  this.cleanupKeysArray_();
+
+  var i = 0;
+  var version = this.version_;
+  var selfObj = this;
+
+  var newIter = new goog.iter.Iterator;
+  newIter.next = function() {
+    if (version != selfObj.version_) {
+      throw Error('The map has changed since the iterator was created');
+    }
+    if (i >= selfObj.keys_.length) {
+      throw goog.iter.StopIteration;
+    }
+    var key = selfObj.keys_[i++];
+    return opt_keys ? key : selfObj.map_[key];
+  };
+  return newIter;
+};
+
+
+/**
+ * Safe way to test for hasOwnProperty.  It even allows testing for
+ * 'hasOwnProperty'.
+ * @param {Object} obj The object to test for presence of the given key.
+ * @param {*} key The key to check for.
+ * @return {boolean} Whether the object has the key.
+ * @private
+ */
+goog.structs.Map.hasKey_ = function(obj, key) {
+  return Object.prototype.hasOwnProperty.call(obj, key);
+};
diff --git a/js/goog/structs/structs.js b/js/goog/structs/structs.js
new file mode 100644
index 0000000..684ddfe
--- /dev/null
+++ b/js/goog/structs/structs.js
@@ -0,0 +1,354 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Generics method for collection-like classes and objects.
+ *
+ * @author arv@google.com (Erik Arvidsson)
+ *
+ * This file contains functions to work with collections. It supports using
+ * Map, Set, Array and Object and other classes that implement collection-like
+ * methods.
+ */
+
+
+goog.provide('goog.structs');
+
+goog.require('goog.array');
+goog.require('goog.object');
+
+
+// We treat an object as a dictionary if it has getKeys or it is an object that
+// isn't arrayLike.
+
+
+/**
+ * Returns the number of values in the collection-like object.
+ * @param {Object} col The collection-like object.
+ * @return {number} The number of values in the collection-like object.
+ */
+goog.structs.getCount = function(col) {
+  if (col.getCount && typeof col.getCount == 'function') {
+    return col.getCount();
+  }
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    return col.length;
+  }
+  return goog.object.getCount(col);
+};
+
+
+/**
+ * Returns the values of the collection-like object.
+ * @param {Object} col The collection-like object.
+ * @return {!Array<?>} The values in the collection-like object.
+ */
+goog.structs.getValues = function(col) {
+  if (col.getValues && typeof col.getValues == 'function') {
+    return col.getValues();
+  }
+  if (goog.isString(col)) {
+    return col.split('');
+  }
+  if (goog.isArrayLike(col)) {
+    var rv = [];
+    var l = col.length;
+    for (var i = 0; i < l; i++) {
+      rv.push(col[i]);
+    }
+    return rv;
+  }
+  return goog.object.getValues(col);
+};
+
+
+/**
+ * Returns the keys of the collection. Some collections have no notion of
+ * keys/indexes and this function will return undefined in those cases.
+ * @param {Object} col The collection-like object.
+ * @return {!Array|undefined} The keys in the collection.
+ */
+goog.structs.getKeys = function(col) {
+  if (col.getKeys && typeof col.getKeys == 'function') {
+    return col.getKeys();
+  }
+  // if we have getValues but no getKeys we know this is a key-less collection
+  if (col.getValues && typeof col.getValues == 'function') {
+    return undefined;
+  }
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    var rv = [];
+    var l = col.length;
+    for (var i = 0; i < l; i++) {
+      rv.push(i);
+    }
+    return rv;
+  }
+
+  return goog.object.getKeys(col);
+};
+
+
+/**
+ * Whether the collection contains the given value. This is O(n) and uses
+ * equals (==) to test the existence.
+ * @param {Object} col The collection-like object.
+ * @param {*} val The value to check for.
+ * @return {boolean} True if the map contains the value.
+ */
+goog.structs.contains = function(col, val) {
+  if (col.contains && typeof col.contains == 'function') {
+    return col.contains(val);
+  }
+  if (col.containsValue && typeof col.containsValue == 'function') {
+    return col.containsValue(val);
+  }
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    return goog.array.contains(/** @type {!Array<?>} */ (col), val);
+  }
+  return goog.object.containsValue(col, val);
+};
+
+
+/**
+ * Whether the collection is empty.
+ * @param {Object} col The collection-like object.
+ * @return {boolean} True if empty.
+ */
+goog.structs.isEmpty = function(col) {
+  if (col.isEmpty && typeof col.isEmpty == 'function') {
+    return col.isEmpty();
+  }
+
+  // We do not use goog.string.isEmptyOrWhitespace because here we treat the
+  // string as
+  // collection and as such even whitespace matters
+
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    return goog.array.isEmpty(/** @type {!Array<?>} */ (col));
+  }
+  return goog.object.isEmpty(col);
+};
+
+
+/**
+ * Removes all the elements from the collection.
+ * @param {Object} col The collection-like object.
+ */
+goog.structs.clear = function(col) {
+  // NOTE(arv): This should not contain strings because strings are immutable
+  if (col.clear && typeof col.clear == 'function') {
+    col.clear();
+  } else if (goog.isArrayLike(col)) {
+    goog.array.clear(/** @type {IArrayLike<?>} */ (col));
+  } else {
+    goog.object.clear(col);
+  }
+};
+
+
+/**
+ * Calls a function for each value in a collection. The function takes
+ * three arguments; the value, the key and the collection.
+ *
+ * @param {S} col The collection-like object.
+ * @param {function(this:T,?,?,S):?} f The function to call for every value.
+ *     This function takes
+ *     3 arguments (the value, the key or undefined if the collection has no
+ *     notion of keys, and the collection) and the return value is irrelevant.
+ * @param {T=} opt_obj The object to be used as the value of 'this'
+ *     within {@code f}.
+ * @template T,S
+ * @deprecated Use a more specific method, e.g. goog.array.forEach,
+ *     goog.object.forEach, or for-of.
+ */
+goog.structs.forEach = function(col, f, opt_obj) {
+  if (col.forEach && typeof col.forEach == 'function') {
+    col.forEach(f, opt_obj);
+  } else if (goog.isArrayLike(col) || goog.isString(col)) {
+    goog.array.forEach(/** @type {!Array<?>} */ (col), f, opt_obj);
+  } else {
+    var keys = goog.structs.getKeys(col);
+    var values = goog.structs.getValues(col);
+    var l = values.length;
+    for (var i = 0; i < l; i++) {
+      f.call(/** @type {?} */ (opt_obj), values[i], keys && keys[i], col);
+    }
+  }
+};
+
+
+/**
+ * Calls a function for every value in the collection. When a call returns true,
+ * adds the value to a new collection (Array is returned by default).
+ *
+ * @param {S} col The collection-like object.
+ * @param {function(this:T,?,?,S):boolean} f The function to call for every
+ *     value. This function takes
+ *     3 arguments (the value, the key or undefined if the collection has no
+ *     notion of keys, and the collection) and should return a Boolean. If the
+ *     return value is true the value is added to the result collection. If it
+ *     is false the value is not included.
+ * @param {T=} opt_obj The object to be used as the value of 'this'
+ *     within {@code f}.
+ * @return {!Object|!Array<?>} A new collection where the passed values are
+ *     present. If col is a key-less collection an array is returned.  If col
+ *     has keys and values a plain old JS object is returned.
+ * @template T,S
+ */
+goog.structs.filter = function(col, f, opt_obj) {
+  if (typeof col.filter == 'function') {
+    return col.filter(f, opt_obj);
+  }
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    return goog.array.filter(/** @type {!Array<?>} */ (col), f, opt_obj);
+  }
+
+  var rv;
+  var keys = goog.structs.getKeys(col);
+  var values = goog.structs.getValues(col);
+  var l = values.length;
+  if (keys) {
+    rv = {};
+    for (var i = 0; i < l; i++) {
+      if (f.call(/** @type {?} */ (opt_obj), values[i], keys[i], col)) {
+        rv[keys[i]] = values[i];
+      }
+    }
+  } else {
+    // We should not use goog.array.filter here since we want to make sure that
+    // the index is undefined as well as make sure that col is passed to the
+    // function.
+    rv = [];
+    for (var i = 0; i < l; i++) {
+      if (f.call(opt_obj, values[i], undefined, col)) {
+        rv.push(values[i]);
+      }
+    }
+  }
+  return rv;
+};
+
+
+/**
+ * Calls a function for every value in the collection and adds the result into a
+ * new collection (defaults to creating a new Array).
+ *
+ * @param {S} col The collection-like object.
+ * @param {function(this:T,?,?,S):V} f The function to call for every value.
+ *     This function takes 3 arguments (the value, the key or undefined if the
+ *     collection has no notion of keys, and the collection) and should return
+ *     something. The result will be used as the value in the new collection.
+ * @param {T=} opt_obj  The object to be used as the value of 'this'
+ *     within {@code f}.
+ * @return {!Object<V>|!Array<V>} A new collection with the new values.  If
+ *     col is a key-less collection an array is returned.  If col has keys and
+ *     values a plain old JS object is returned.
+ * @template T,S,V
+ */
+goog.structs.map = function(col, f, opt_obj) {
+  if (typeof col.map == 'function') {
+    return col.map(f, opt_obj);
+  }
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    return goog.array.map(/** @type {!Array<?>} */ (col), f, opt_obj);
+  }
+
+  var rv;
+  var keys = goog.structs.getKeys(col);
+  var values = goog.structs.getValues(col);
+  var l = values.length;
+  if (keys) {
+    rv = {};
+    for (var i = 0; i < l; i++) {
+      rv[keys[i]] = f.call(/** @type {?} */ (opt_obj), values[i], keys[i], col);
+    }
+  } else {
+    // We should not use goog.array.map here since we want to make sure that
+    // the index is undefined as well as make sure that col is passed to the
+    // function.
+    rv = [];
+    for (var i = 0; i < l; i++) {
+      rv[i] = f.call(/** @type {?} */ (opt_obj), values[i], undefined, col);
+    }
+  }
+  return rv;
+};
+
+
+/**
+ * Calls f for each value in a collection. If any call returns true this returns
+ * true (without checking the rest). If all returns false this returns false.
+ *
+ * @param {S} col The collection-like object.
+ * @param {function(this:T,?,?,S):boolean} f The function to call for every
+ *     value. This function takes 3 arguments (the value, the key or undefined
+ *     if the collection has no notion of keys, and the collection) and should
+ *     return a boolean.
+ * @param {T=} opt_obj  The object to be used as the value of 'this'
+ *     within {@code f}.
+ * @return {boolean} True if any value passes the test.
+ * @template T,S
+ */
+goog.structs.some = function(col, f, opt_obj) {
+  if (typeof col.some == 'function') {
+    return col.some(f, opt_obj);
+  }
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    return goog.array.some(/** @type {!Array<?>} */ (col), f, opt_obj);
+  }
+  var keys = goog.structs.getKeys(col);
+  var values = goog.structs.getValues(col);
+  var l = values.length;
+  for (var i = 0; i < l; i++) {
+    if (f.call(/** @type {?} */ (opt_obj), values[i], keys && keys[i], col)) {
+      return true;
+    }
+  }
+  return false;
+};
+
+
+/**
+ * Calls f for each value in a collection. If all calls return true this return
+ * true this returns true. If any returns false this returns false at this point
+ *  and does not continue to check the remaining values.
+ *
+ * @param {S} col The collection-like object.
+ * @param {function(this:T,?,?,S):boolean} f The function to call for every
+ *     value. This function takes 3 arguments (the value, the key or
+ *     undefined if the collection has no notion of keys, and the collection)
+ *     and should return a boolean.
+ * @param {T=} opt_obj  The object to be used as the value of 'this'
+ *     within {@code f}.
+ * @return {boolean} True if all key-value pairs pass the test.
+ * @template T,S
+ */
+goog.structs.every = function(col, f, opt_obj) {
+  if (typeof col.every == 'function') {
+    return col.every(f, opt_obj);
+  }
+  if (goog.isArrayLike(col) || goog.isString(col)) {
+    return goog.array.every(/** @type {!Array<?>} */ (col), f, opt_obj);
+  }
+  var keys = goog.structs.getKeys(col);
+  var values = goog.structs.getValues(col);
+  var l = values.length;
+  for (var i = 0; i < l; i++) {
+    if (!f.call(/** @type {?} */ (opt_obj), values[i], keys && keys[i], col)) {
+      return false;
+    }
+  }
+  return true;
+};
diff --git a/js/goog/uri/uri.js b/js/goog/uri/uri.js
new file mode 100644
index 0000000..7873de9
--- /dev/null
+++ b/js/goog/uri/uri.js
@@ -0,0 +1,1547 @@
+// Copyright 2006 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Class for parsing and formatting URIs.
+ *
+ * Use goog.Uri(string) to parse a URI string.  Use goog.Uri.create(...) to
+ * create a new instance of the goog.Uri object from Uri parts.
+ *
+ * e.g: <code>var myUri = new goog.Uri(window.location);</code>
+ *
+ * Implements RFC 3986 for parsing/formatting URIs.
+ * http://www.ietf.org/rfc/rfc3986.txt
+ *
+ * Some changes have been made to the interface (more like .NETs), though the
+ * internal representation is now of un-encoded parts, this will change the
+ * behavior slightly.
+ *
+ * @author msamuel@google.com (Mike Samuel)
+ */
+
+goog.provide('goog.Uri');
+goog.provide('goog.Uri.QueryData');
+
+goog.require('goog.array');
+goog.require('goog.asserts');
+goog.require('goog.string');
+goog.require('goog.structs');
+goog.require('goog.structs.Map');
+goog.require('goog.uri.utils');
+goog.require('goog.uri.utils.ComponentIndex');
+goog.require('goog.uri.utils.StandardQueryParam');
+
+
+
+/**
+ * This class contains setters and getters for the parts of the URI.
+ * The <code>getXyz</code>/<code>setXyz</code> methods return the decoded part
+ * -- so<code>goog.Uri.parse('/foo%20bar').getPath()</code> will return the
+ * decoded path, <code>/foo bar</code>.
+ *
+ * Reserved characters (see RFC 3986 section 2.2) can be present in
+ * their percent-encoded form in scheme, domain, and path URI components and
+ * will not be auto-decoded. For example:
+ * <code>goog.Uri.parse('rel%61tive/path%2fto/resource').getPath()</code> will
+ * return <code>relative/path%2fto/resource</code>.
+ *
+ * The constructor accepts an optional unparsed, raw URI string.  The parser
+ * is relaxed, so special characters that aren't escaped but don't cause
+ * ambiguities will not cause parse failures.
+ *
+ * All setters return <code>this</code> and so may be chained, a la
+ * <code>goog.Uri.parse('/foo').setFragment('part').toString()</code>.
+ *
+ * @param {*=} opt_uri Optional string URI to parse
+ *        (use goog.Uri.create() to create a URI from parts), or if
+ *        a goog.Uri is passed, a clone is created.
+ * @param {boolean=} opt_ignoreCase If true, #getParameterValue will ignore
+ * the case of the parameter name.
+ *
+ * @throws URIError If opt_uri is provided and URI is malformed (that is,
+ *     if decodeURIComponent fails on any of the URI components).
+ * @constructor
+ * @struct
+ */
+goog.Uri = function(opt_uri, opt_ignoreCase) {
+  /**
+   * Scheme such as "http".
+   * @private {string}
+   */
+  this.scheme_ = '';
+
+  /**
+   * User credentials in the form "username:password".
+   * @private {string}
+   */
+  this.userInfo_ = '';
+
+  /**
+   * Domain part, e.g. "www.google.com".
+   * @private {string}
+   */
+  this.domain_ = '';
+
+  /**
+   * Port, e.g. 8080.
+   * @private {?number}
+   */
+  this.port_ = null;
+
+  /**
+   * Path, e.g. "/tests/img.png".
+   * @private {string}
+   */
+  this.path_ = '';
+
+  /**
+   * The fragment without the #.
+   * @private {string}
+   */
+  this.fragment_ = '';
+
+  /**
+   * Whether or not this Uri should be treated as Read Only.
+   * @private {boolean}
+   */
+  this.isReadOnly_ = false;
+
+  /**
+   * Whether or not to ignore case when comparing query params.
+   * @private {boolean}
+   */
+  this.ignoreCase_ = false;
+
+  /**
+   * Object representing query data.
+   * @private {!goog.Uri.QueryData}
+   */
+  this.queryData_;
+
+  // Parse in the uri string
+  var m;
+  if (opt_uri instanceof goog.Uri) {
+    this.ignoreCase_ =
+        goog.isDef(opt_ignoreCase) ? opt_ignoreCase : opt_uri.getIgnoreCase();
+    this.setScheme(opt_uri.getScheme());
+    this.setUserInfo(opt_uri.getUserInfo());
+    this.setDomain(opt_uri.getDomain());
+    this.setPort(opt_uri.getPort());
+    this.setPath(opt_uri.getPath());
+    this.setQueryData(opt_uri.getQueryData().clone());
+    this.setFragment(opt_uri.getFragment());
+  } else if (opt_uri && (m = goog.uri.utils.split(String(opt_uri)))) {
+    this.ignoreCase_ = !!opt_ignoreCase;
+
+    // Set the parts -- decoding as we do so.
+    // COMPATIBILITY NOTE - In IE, unmatched fields may be empty strings,
+    // whereas in other browsers they will be undefined.
+    this.setScheme(m[goog.uri.utils.ComponentIndex.SCHEME] || '', true);
+    this.setUserInfo(m[goog.uri.utils.ComponentIndex.USER_INFO] || '', true);
+    this.setDomain(m[goog.uri.utils.ComponentIndex.DOMAIN] || '', true);
+    this.setPort(m[goog.uri.utils.ComponentIndex.PORT]);
+    this.setPath(m[goog.uri.utils.ComponentIndex.PATH] || '', true);
+    this.setQueryData(m[goog.uri.utils.ComponentIndex.QUERY_DATA] || '', true);
+    this.setFragment(m[goog.uri.utils.ComponentIndex.FRAGMENT] || '', true);
+
+  } else {
+    this.ignoreCase_ = !!opt_ignoreCase;
+    this.queryData_ = new goog.Uri.QueryData(null, null, this.ignoreCase_);
+  }
+};
+
+
+/**
+ * If true, we preserve the type of query parameters set programmatically.
+ *
+ * This means that if you set a parameter to a boolean, and then call
+ * getParameterValue, you will get a boolean back.
+ *
+ * If false, we will coerce parameters to strings, just as they would
+ * appear in real URIs.
+ *
+ * TODO(nicksantos): Remove this once people have time to fix all tests.
+ *
+ * @type {boolean}
+ */
+goog.Uri.preserveParameterTypesCompatibilityFlag = false;
+
+
+/**
+ * Parameter name added to stop caching.
+ * @type {string}
+ */
+goog.Uri.RANDOM_PARAM = goog.uri.utils.StandardQueryParam.RANDOM;
+
+
+/**
+ * @return {string} The string form of the url.
+ * @override
+ */
+goog.Uri.prototype.toString = function() {
+  var out = [];
+
+  var scheme = this.getScheme();
+  if (scheme) {
+    out.push(
+        goog.Uri.encodeSpecialChars_(
+            scheme, goog.Uri.reDisallowedInSchemeOrUserInfo_, true),
+        ':');
+  }
+
+  var domain = this.getDomain();
+  if (domain || scheme == 'file') {
+    out.push('//');
+
+    var userInfo = this.getUserInfo();
+    if (userInfo) {
+      out.push(
+          goog.Uri.encodeSpecialChars_(
+              userInfo, goog.Uri.reDisallowedInSchemeOrUserInfo_, true),
+          '@');
+    }
+
+    out.push(goog.Uri.removeDoubleEncoding_(goog.string.urlEncode(domain)));
+
+    var port = this.getPort();
+    if (port != null) {
+      out.push(':', String(port));
+    }
+  }
+
+  var path = this.getPath();
+  if (path) {
+    if (this.hasDomain() && path.charAt(0) != '/') {
+      out.push('/');
+    }
+    out.push(
+        goog.Uri.encodeSpecialChars_(
+            path, path.charAt(0) == '/' ? goog.Uri.reDisallowedInAbsolutePath_ :
+                                          goog.Uri.reDisallowedInRelativePath_,
+            true));
+  }
+
+  var query = this.getEncodedQuery();
+  if (query) {
+    out.push('?', query);
+  }
+
+  var fragment = this.getFragment();
+  if (fragment) {
+    out.push(
+        '#', goog.Uri.encodeSpecialChars_(
+                 fragment, goog.Uri.reDisallowedInFragment_));
+  }
+  return out.join('');
+};
+
+
+/**
+ * Resolves the given relative URI (a goog.Uri object), using the URI
+ * represented by this instance as the base URI.
+ *
+ * There are several kinds of relative URIs:<br>
+ * 1. foo - replaces the last part of the path, the whole query and fragment<br>
+ * 2. /foo - replaces the the path, the query and fragment<br>
+ * 3. //foo - replaces everything from the domain on.  foo is a domain name<br>
+ * 4. ?foo - replace the query and fragment<br>
+ * 5. #foo - replace the fragment only
+ *
+ * Additionally, if relative URI has a non-empty path, all ".." and "."
+ * segments will be resolved, as described in RFC 3986.
+ *
+ * @param {!goog.Uri} relativeUri The relative URI to resolve.
+ * @return {!goog.Uri} The resolved URI.
+ */
+goog.Uri.prototype.resolve = function(relativeUri) {
+
+  var absoluteUri = this.clone();
+
+  // we satisfy these conditions by looking for the first part of relativeUri
+  // that is not blank and applying defaults to the rest
+
+  var overridden = relativeUri.hasScheme();
+
+  if (overridden) {
+    absoluteUri.setScheme(relativeUri.getScheme());
+  } else {
+    overridden = relativeUri.hasUserInfo();
+  }
+
+  if (overridden) {
+    absoluteUri.setUserInfo(relativeUri.getUserInfo());
+  } else {
+    overridden = relativeUri.hasDomain();
+  }
+
+  if (overridden) {
+    absoluteUri.setDomain(relativeUri.getDomain());
+  } else {
+    overridden = relativeUri.hasPort();
+  }
+
+  var path = relativeUri.getPath();
+  if (overridden) {
+    absoluteUri.setPort(relativeUri.getPort());
+  } else {
+    overridden = relativeUri.hasPath();
+    if (overridden) {
+      // resolve path properly
+      if (path.charAt(0) != '/') {
+        // path is relative
+        if (this.hasDomain() && !this.hasPath()) {
+          // RFC 3986, section 5.2.3, case 1
+          path = '/' + path;
+        } else {
+          // RFC 3986, section 5.2.3, case 2
+          var lastSlashIndex = absoluteUri.getPath().lastIndexOf('/');
+          if (lastSlashIndex != -1) {
+            path = absoluteUri.getPath().substr(0, lastSlashIndex + 1) + path;
+          }
+        }
+      }
+      path = goog.Uri.removeDotSegments(path);
+    }
+  }
+
+  if (overridden) {
+    absoluteUri.setPath(path);
+  } else {
+    overridden = relativeUri.hasQuery();
+  }
+
+  if (overridden) {
+    absoluteUri.setQueryData(relativeUri.getQueryData().clone());
+  } else {
+    overridden = relativeUri.hasFragment();
+  }
+
+  if (overridden) {
+    absoluteUri.setFragment(relativeUri.getFragment());
+  }
+
+  return absoluteUri;
+};
+
+
+/**
+ * Clones the URI instance.
+ * @return {!goog.Uri} New instance of the URI object.
+ */
+goog.Uri.prototype.clone = function() {
+  return new goog.Uri(this);
+};
+
+
+/**
+ * @return {string} The encoded scheme/protocol for the URI.
+ */
+goog.Uri.prototype.getScheme = function() {
+  return this.scheme_;
+};
+
+
+/**
+ * Sets the scheme/protocol.
+ * @throws URIError If opt_decode is true and newScheme is malformed (that is,
+ *     if decodeURIComponent fails).
+ * @param {string} newScheme New scheme value.
+ * @param {boolean=} opt_decode Optional param for whether to decode new value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setScheme = function(newScheme, opt_decode) {
+  this.enforceReadOnly();
+  this.scheme_ =
+      opt_decode ? goog.Uri.decodeOrEmpty_(newScheme, true) : newScheme;
+
+  // remove an : at the end of the scheme so somebody can pass in
+  // window.location.protocol
+  if (this.scheme_) {
+    this.scheme_ = this.scheme_.replace(/:$/, '');
+  }
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether the scheme has been set.
+ */
+goog.Uri.prototype.hasScheme = function() {
+  return !!this.scheme_;
+};
+
+
+/**
+ * @return {string} The decoded user info.
+ */
+goog.Uri.prototype.getUserInfo = function() {
+  return this.userInfo_;
+};
+
+
+/**
+ * Sets the userInfo.
+ * @throws URIError If opt_decode is true and newUserInfo is malformed (that is,
+ *     if decodeURIComponent fails).
+ * @param {string} newUserInfo New userInfo value.
+ * @param {boolean=} opt_decode Optional param for whether to decode new value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setUserInfo = function(newUserInfo, opt_decode) {
+  this.enforceReadOnly();
+  this.userInfo_ =
+      opt_decode ? goog.Uri.decodeOrEmpty_(newUserInfo) : newUserInfo;
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether the user info has been set.
+ */
+goog.Uri.prototype.hasUserInfo = function() {
+  return !!this.userInfo_;
+};
+
+
+/**
+ * @return {string} The decoded domain.
+ */
+goog.Uri.prototype.getDomain = function() {
+  return this.domain_;
+};
+
+
+/**
+ * Sets the domain.
+ * @throws URIError If opt_decode is true and newDomain is malformed (that is,
+ *     if decodeURIComponent fails).
+ * @param {string} newDomain New domain value.
+ * @param {boolean=} opt_decode Optional param for whether to decode new value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setDomain = function(newDomain, opt_decode) {
+  this.enforceReadOnly();
+  this.domain_ =
+      opt_decode ? goog.Uri.decodeOrEmpty_(newDomain, true) : newDomain;
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether the domain has been set.
+ */
+goog.Uri.prototype.hasDomain = function() {
+  return !!this.domain_;
+};
+
+
+/**
+ * @return {?number} The port number.
+ */
+goog.Uri.prototype.getPort = function() {
+  return this.port_;
+};
+
+
+/**
+ * Sets the port number.
+ * @param {*} newPort Port number. Will be explicitly casted to a number.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setPort = function(newPort) {
+  this.enforceReadOnly();
+
+  if (newPort) {
+    newPort = Number(newPort);
+    if (isNaN(newPort) || newPort < 0) {
+      throw Error('Bad port number ' + newPort);
+    }
+    this.port_ = newPort;
+  } else {
+    this.port_ = null;
+  }
+
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether the port has been set.
+ */
+goog.Uri.prototype.hasPort = function() {
+  return this.port_ != null;
+};
+
+
+/**
+  * @return {string} The decoded path.
+ */
+goog.Uri.prototype.getPath = function() {
+  return this.path_;
+};
+
+
+/**
+ * Sets the path.
+ * @throws URIError If opt_decode is true and newPath is malformed (that is,
+ *     if decodeURIComponent fails).
+ * @param {string} newPath New path value.
+ * @param {boolean=} opt_decode Optional param for whether to decode new value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setPath = function(newPath, opt_decode) {
+  this.enforceReadOnly();
+  this.path_ = opt_decode ? goog.Uri.decodeOrEmpty_(newPath, true) : newPath;
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether the path has been set.
+ */
+goog.Uri.prototype.hasPath = function() {
+  return !!this.path_;
+};
+
+
+/**
+ * @return {boolean} Whether the query string has been set.
+ */
+goog.Uri.prototype.hasQuery = function() {
+  return this.queryData_.toString() !== '';
+};
+
+
+/**
+ * Sets the query data.
+ * @param {goog.Uri.QueryData|string|undefined} queryData QueryData object.
+ * @param {boolean=} opt_decode Optional param for whether to decode new value.
+ *     Applies only if queryData is a string.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setQueryData = function(queryData, opt_decode) {
+  this.enforceReadOnly();
+
+  if (queryData instanceof goog.Uri.QueryData) {
+    this.queryData_ = queryData;
+    this.queryData_.setIgnoreCase(this.ignoreCase_);
+  } else {
+    if (!opt_decode) {
+      // QueryData accepts encoded query string, so encode it if
+      // opt_decode flag is not true.
+      queryData = goog.Uri.encodeSpecialChars_(
+          queryData, goog.Uri.reDisallowedInQuery_);
+    }
+    this.queryData_ = new goog.Uri.QueryData(queryData, null, this.ignoreCase_);
+  }
+
+  return this;
+};
+
+
+/**
+ * Sets the URI query.
+ * @param {string} newQuery New query value.
+ * @param {boolean=} opt_decode Optional param for whether to decode new value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setQuery = function(newQuery, opt_decode) {
+  return this.setQueryData(newQuery, opt_decode);
+};
+
+
+/**
+ * @return {string} The encoded URI query, not including the ?.
+ */
+goog.Uri.prototype.getEncodedQuery = function() {
+  return this.queryData_.toString();
+};
+
+
+/**
+ * @return {string} The decoded URI query, not including the ?.
+ */
+goog.Uri.prototype.getDecodedQuery = function() {
+  return this.queryData_.toDecodedString();
+};
+
+
+/**
+ * Returns the query data.
+ * @return {!goog.Uri.QueryData} QueryData object.
+ */
+goog.Uri.prototype.getQueryData = function() {
+  return this.queryData_;
+};
+
+
+/**
+ * @return {string} The encoded URI query, not including the ?.
+ *
+ * Warning: This method, unlike other getter methods, returns encoded
+ * value, instead of decoded one.
+ */
+goog.Uri.prototype.getQuery = function() {
+  return this.getEncodedQuery();
+};
+
+
+/**
+ * Sets the value of the named query parameters, clearing previous values for
+ * that key.
+ *
+ * @param {string} key The parameter to set.
+ * @param {*} value The new value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setParameterValue = function(key, value) {
+  this.enforceReadOnly();
+  this.queryData_.set(key, value);
+  return this;
+};
+
+
+/**
+ * Sets the values of the named query parameters, clearing previous values for
+ * that key.  Not new values will currently be moved to the end of the query
+ * string.
+ *
+ * So, <code>goog.Uri.parse('foo?a=b&c=d&e=f').setParameterValues('c', ['new'])
+ * </code> yields <tt>foo?a=b&e=f&c=new</tt>.</p>
+ *
+ * @param {string} key The parameter to set.
+ * @param {*} values The new values. If values is a single
+ *     string then it will be treated as the sole value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setParameterValues = function(key, values) {
+  this.enforceReadOnly();
+
+  if (!goog.isArray(values)) {
+    values = [String(values)];
+  }
+
+  this.queryData_.setValues(key, values);
+
+  return this;
+};
+
+
+/**
+ * Returns the value<b>s</b> for a given cgi parameter as a list of decoded
+ * query parameter values.
+ * @param {string} name The parameter to get values for.
+ * @return {!Array<?>} The values for a given cgi parameter as a list of
+ *     decoded query parameter values.
+ */
+goog.Uri.prototype.getParameterValues = function(name) {
+  return this.queryData_.getValues(name);
+};
+
+
+/**
+ * Returns the first value for a given cgi parameter or undefined if the given
+ * parameter name does not appear in the query string.
+ * @param {string} paramName Unescaped parameter name.
+ * @return {string|undefined} The first value for a given cgi parameter or
+ *     undefined if the given parameter name does not appear in the query
+ *     string.
+ */
+goog.Uri.prototype.getParameterValue = function(paramName) {
+  // NOTE(nicksantos): This type-cast is a lie when
+  // preserveParameterTypesCompatibilityFlag is set to true.
+  // But this should only be set to true in tests.
+  return /** @type {string|undefined} */ (this.queryData_.get(paramName));
+};
+
+
+/**
+ * @return {string} The URI fragment, not including the #.
+ */
+goog.Uri.prototype.getFragment = function() {
+  return this.fragment_;
+};
+
+
+/**
+ * Sets the URI fragment.
+ * @throws URIError If opt_decode is true and newFragment is malformed (that is,
+ *     if decodeURIComponent fails).
+ * @param {string} newFragment New fragment value.
+ * @param {boolean=} opt_decode Optional param for whether to decode new value.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.setFragment = function(newFragment, opt_decode) {
+  this.enforceReadOnly();
+  this.fragment_ =
+      opt_decode ? goog.Uri.decodeOrEmpty_(newFragment) : newFragment;
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether the URI has a fragment set.
+ */
+goog.Uri.prototype.hasFragment = function() {
+  return !!this.fragment_;
+};
+
+
+/**
+ * Returns true if this has the same domain as that of uri2.
+ * @param {!goog.Uri} uri2 The URI object to compare to.
+ * @return {boolean} true if same domain; false otherwise.
+ */
+goog.Uri.prototype.hasSameDomainAs = function(uri2) {
+  return ((!this.hasDomain() && !uri2.hasDomain()) ||
+          this.getDomain() == uri2.getDomain()) &&
+      ((!this.hasPort() && !uri2.hasPort()) ||
+       this.getPort() == uri2.getPort());
+};
+
+
+/**
+ * Adds a random parameter to the Uri.
+ * @return {!goog.Uri} Reference to this Uri object.
+ */
+goog.Uri.prototype.makeUnique = function() {
+  this.enforceReadOnly();
+  this.setParameterValue(goog.Uri.RANDOM_PARAM, goog.string.getRandomString());
+
+  return this;
+};
+
+
+/**
+ * Removes the named query parameter.
+ *
+ * @param {string} key The parameter to remove.
+ * @return {!goog.Uri} Reference to this URI object.
+ */
+goog.Uri.prototype.removeParameter = function(key) {
+  this.enforceReadOnly();
+  this.queryData_.remove(key);
+  return this;
+};
+
+
+/**
+ * Sets whether Uri is read only. If this goog.Uri is read-only,
+ * enforceReadOnly_ will be called at the start of any function that may modify
+ * this Uri.
+ * @param {boolean} isReadOnly whether this goog.Uri should be read only.
+ * @return {!goog.Uri} Reference to this Uri object.
+ */
+goog.Uri.prototype.setReadOnly = function(isReadOnly) {
+  this.isReadOnly_ = isReadOnly;
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether the URI is read only.
+ */
+goog.Uri.prototype.isReadOnly = function() {
+  return this.isReadOnly_;
+};
+
+
+/**
+ * Checks if this Uri has been marked as read only, and if so, throws an error.
+ * This should be called whenever any modifying function is called.
+ */
+goog.Uri.prototype.enforceReadOnly = function() {
+  if (this.isReadOnly_) {
+    throw Error('Tried to modify a read-only Uri');
+  }
+};
+
+
+/**
+ * Sets whether to ignore case.
+ * NOTE: If there are already key/value pairs in the QueryData, and
+ * ignoreCase_ is set to false, the keys will all be lower-cased.
+ * @param {boolean} ignoreCase whether this goog.Uri should ignore case.
+ * @return {!goog.Uri} Reference to this Uri object.
+ */
+goog.Uri.prototype.setIgnoreCase = function(ignoreCase) {
+  this.ignoreCase_ = ignoreCase;
+  if (this.queryData_) {
+    this.queryData_.setIgnoreCase(ignoreCase);
+  }
+  return this;
+};
+
+
+/**
+ * @return {boolean} Whether to ignore case.
+ */
+goog.Uri.prototype.getIgnoreCase = function() {
+  return this.ignoreCase_;
+};
+
+
+//==============================================================================
+// Static members
+//==============================================================================
+
+
+/**
+ * Creates a uri from the string form.  Basically an alias of new goog.Uri().
+ * If a Uri object is passed to parse then it will return a clone of the object.
+ *
+ * @throws URIError If parsing the URI is malformed. The passed URI components
+ *     should all be parseable by decodeURIComponent.
+ * @param {*} uri Raw URI string or instance of Uri
+ *     object.
+ * @param {boolean=} opt_ignoreCase Whether to ignore the case of parameter
+ * names in #getParameterValue.
+ * @return {!goog.Uri} The new URI object.
+ */
+goog.Uri.parse = function(uri, opt_ignoreCase) {
+  return uri instanceof goog.Uri ? uri.clone() :
+                                   new goog.Uri(uri, opt_ignoreCase);
+};
+
+
+/**
+ * Creates a new goog.Uri object from unencoded parts.
+ *
+ * @param {?string=} opt_scheme Scheme/protocol or full URI to parse.
+ * @param {?string=} opt_userInfo username:password.
+ * @param {?string=} opt_domain www.google.com.
+ * @param {?number=} opt_port 9830.
+ * @param {?string=} opt_path /some/path/to/a/file.html.
+ * @param {string|goog.Uri.QueryData=} opt_query a=1&b=2.
+ * @param {?string=} opt_fragment The fragment without the #.
+ * @param {boolean=} opt_ignoreCase Whether to ignore parameter name case in
+ *     #getParameterValue.
+ *
+ * @return {!goog.Uri} The new URI object.
+ */
+goog.Uri.create = function(
+    opt_scheme, opt_userInfo, opt_domain, opt_port, opt_path, opt_query,
+    opt_fragment, opt_ignoreCase) {
+
+  var uri = new goog.Uri(null, opt_ignoreCase);
+
+  // Only set the parts if they are defined and not empty strings.
+  opt_scheme && uri.setScheme(opt_scheme);
+  opt_userInfo && uri.setUserInfo(opt_userInfo);
+  opt_domain && uri.setDomain(opt_domain);
+  opt_port && uri.setPort(opt_port);
+  opt_path && uri.setPath(opt_path);
+  opt_query && uri.setQueryData(opt_query);
+  opt_fragment && uri.setFragment(opt_fragment);
+
+  return uri;
+};
+
+
+/**
+ * Resolves a relative Uri against a base Uri, accepting both strings and
+ * Uri objects.
+ *
+ * @param {*} base Base Uri.
+ * @param {*} rel Relative Uri.
+ * @return {!goog.Uri} Resolved uri.
+ */
+goog.Uri.resolve = function(base, rel) {
+  if (!(base instanceof goog.Uri)) {
+    base = goog.Uri.parse(base);
+  }
+
+  if (!(rel instanceof goog.Uri)) {
+    rel = goog.Uri.parse(rel);
+  }
+
+  return base.resolve(rel);
+};
+
+
+/**
+ * Removes dot segments in given path component, as described in
+ * RFC 3986, section 5.2.4.
+ *
+ * @param {string} path A non-empty path component.
+ * @return {string} Path component with removed dot segments.
+ */
+goog.Uri.removeDotSegments = function(path) {
+  if (path == '..' || path == '.') {
+    return '';
+
+  } else if (
+      !goog.string.contains(path, './') && !goog.string.contains(path, '/.')) {
+    // This optimization detects uris which do not contain dot-segments,
+    // and as a consequence do not require any processing.
+    return path;
+
+  } else {
+    var leadingSlash = goog.string.startsWith(path, '/');
+    var segments = path.split('/');
+    var out = [];
+
+    for (var pos = 0; pos < segments.length;) {
+      var segment = segments[pos++];
+
+      if (segment == '.') {
+        if (leadingSlash && pos == segments.length) {
+          out.push('');
+        }
+      } else if (segment == '..') {
+        if (out.length > 1 || out.length == 1 && out[0] != '') {
+          out.pop();
+        }
+        if (leadingSlash && pos == segments.length) {
+          out.push('');
+        }
+      } else {
+        out.push(segment);
+        leadingSlash = true;
+      }
+    }
+
+    return out.join('/');
+  }
+};
+
+
+/**
+ * Decodes a value or returns the empty string if it isn't defined or empty.
+ * @throws URIError If decodeURIComponent fails to decode val.
+ * @param {string|undefined} val Value to decode.
+ * @param {boolean=} opt_preserveReserved If true, restricted characters will
+ *     not be decoded.
+ * @return {string} Decoded value.
+ * @private
+ */
+goog.Uri.decodeOrEmpty_ = function(val, opt_preserveReserved) {
+  // Don't use UrlDecode() here because val is not a query parameter.
+  if (!val) {
+    return '';
+  }
+
+  // decodeURI has the same output for '%2f' and '%252f'. We double encode %25
+  // so that we can distinguish between the 2 inputs. This is later undone by
+  // removeDoubleEncoding_.
+  return opt_preserveReserved ? decodeURI(val.replace(/%25/g, '%2525')) :
+                                decodeURIComponent(val);
+};
+
+
+/**
+ * If unescapedPart is non null, then escapes any characters in it that aren't
+ * valid characters in a url and also escapes any special characters that
+ * appear in extra.
+ *
+ * @param {*} unescapedPart The string to encode.
+ * @param {RegExp} extra A character set of characters in [\01-\177].
+ * @param {boolean=} opt_removeDoubleEncoding If true, remove double percent
+ *     encoding.
+ * @return {?string} null iff unescapedPart == null.
+ * @private
+ */
+goog.Uri.encodeSpecialChars_ = function(
+    unescapedPart, extra, opt_removeDoubleEncoding) {
+  if (goog.isString(unescapedPart)) {
+    var encoded = encodeURI(unescapedPart).replace(extra, goog.Uri.encodeChar_);
+    if (opt_removeDoubleEncoding) {
+      // encodeURI double-escapes %XX sequences used to represent restricted
+      // characters in some URI components, remove the double escaping here.
+      encoded = goog.Uri.removeDoubleEncoding_(encoded);
+    }
+    return encoded;
+  }
+  return null;
+};
+
+
+/**
+ * Converts a character in [\01-\177] to its unicode character equivalent.
+ * @param {string} ch One character string.
+ * @return {string} Encoded string.
+ * @private
+ */
+goog.Uri.encodeChar_ = function(ch) {
+  var n = ch.charCodeAt(0);
+  return '%' + ((n >> 4) & 0xf).toString(16) + (n & 0xf).toString(16);
+};
+
+
+/**
+ * Removes double percent-encoding from a string.
+ * @param  {string} doubleEncodedString String
+ * @return {string} String with double encoding removed.
+ * @private
+ */
+goog.Uri.removeDoubleEncoding_ = function(doubleEncodedString) {
+  return doubleEncodedString.replace(/%25([0-9a-fA-F]{2})/g, '%$1');
+};
+
+
+/**
+ * Regular expression for characters that are disallowed in the scheme or
+ * userInfo part of the URI.
+ * @type {RegExp}
+ * @private
+ */
+goog.Uri.reDisallowedInSchemeOrUserInfo_ = /[#\/\?@]/g;
+
+
+/**
+ * Regular expression for characters that are disallowed in a relative path.
+ * Colon is included due to RFC 3986 3.3.
+ * @type {RegExp}
+ * @private
+ */
+goog.Uri.reDisallowedInRelativePath_ = /[\#\?:]/g;
+
+
+/**
+ * Regular expression for characters that are disallowed in an absolute path.
+ * @type {RegExp}
+ * @private
+ */
+goog.Uri.reDisallowedInAbsolutePath_ = /[\#\?]/g;
+
+
+/**
+ * Regular expression for characters that are disallowed in the query.
+ * @type {RegExp}
+ * @private
+ */
+goog.Uri.reDisallowedInQuery_ = /[\#\?@]/g;
+
+
+/**
+ * Regular expression for characters that are disallowed in the fragment.
+ * @type {RegExp}
+ * @private
+ */
+goog.Uri.reDisallowedInFragment_ = /#/g;
+
+
+/**
+ * Checks whether two URIs have the same domain.
+ * @param {string} uri1String First URI string.
+ * @param {string} uri2String Second URI string.
+ * @return {boolean} true if the two URIs have the same domain; false otherwise.
+ */
+goog.Uri.haveSameDomain = function(uri1String, uri2String) {
+  // Differs from goog.uri.utils.haveSameDomain, since this ignores scheme.
+  // TODO(gboyer): Have this just call goog.uri.util.haveSameDomain.
+  var pieces1 = goog.uri.utils.split(uri1String);
+  var pieces2 = goog.uri.utils.split(uri2String);
+  return pieces1[goog.uri.utils.ComponentIndex.DOMAIN] ==
+      pieces2[goog.uri.utils.ComponentIndex.DOMAIN] &&
+      pieces1[goog.uri.utils.ComponentIndex.PORT] ==
+      pieces2[goog.uri.utils.ComponentIndex.PORT];
+};
+
+
+
+/**
+ * Class used to represent URI query parameters.  It is essentially a hash of
+ * name-value pairs, though a name can be present more than once.
+ *
+ * Has the same interface as the collections in goog.structs.
+ *
+ * @param {?string=} opt_query Optional encoded query string to parse into
+ *     the object.
+ * @param {goog.Uri=} opt_uri Optional uri object that should have its
+ *     cache invalidated when this object updates. Deprecated -- this
+ *     is no longer required.
+ * @param {boolean=} opt_ignoreCase If true, ignore the case of the parameter
+ *     name in #get.
+ * @constructor
+ * @struct
+ * @final
+ */
+goog.Uri.QueryData = function(opt_query, opt_uri, opt_ignoreCase) {
+  /**
+   * The map containing name/value or name/array-of-values pairs.
+   * May be null if it requires parsing from the query string.
+   *
+   * We need to use a Map because we cannot guarantee that the key names will
+   * not be problematic for IE.
+   *
+   * @private {goog.structs.Map<string, !Array<*>>}
+   */
+  this.keyMap_ = null;
+
+  /**
+   * The number of params, or null if it requires computing.
+   * @private {?number}
+   */
+  this.count_ = null;
+
+  /**
+   * Encoded query string, or null if it requires computing from the key map.
+   * @private {?string}
+   */
+  this.encodedQuery_ = opt_query || null;
+
+  /**
+   * If true, ignore the case of the parameter name in #get.
+   * @private {boolean}
+   */
+  this.ignoreCase_ = !!opt_ignoreCase;
+};
+
+
+/**
+ * If the underlying key map is not yet initialized, it parses the
+ * query string and fills the map with parsed data.
+ * @private
+ */
+goog.Uri.QueryData.prototype.ensureKeyMapInitialized_ = function() {
+  if (!this.keyMap_) {
+    this.keyMap_ = new goog.structs.Map();
+    this.count_ = 0;
+    if (this.encodedQuery_) {
+      var self = this;
+      goog.uri.utils.parseQueryData(this.encodedQuery_, function(name, value) {
+        self.add(goog.string.urlDecode(name), value);
+      });
+    }
+  }
+};
+
+
+/**
+ * Creates a new query data instance from a map of names and values.
+ *
+ * @param {!goog.structs.Map<string, ?>|!Object} map Map of string parameter
+ *     names to parameter value. If parameter value is an array, it is
+ *     treated as if the key maps to each individual value in the
+ *     array.
+ * @param {goog.Uri=} opt_uri URI object that should have its cache
+ *     invalidated when this object updates.
+ * @param {boolean=} opt_ignoreCase If true, ignore the case of the parameter
+ *     name in #get.
+ * @return {!goog.Uri.QueryData} The populated query data instance.
+ */
+goog.Uri.QueryData.createFromMap = function(map, opt_uri, opt_ignoreCase) {
+  var keys = goog.structs.getKeys(map);
+  if (typeof keys == 'undefined') {
+    throw Error('Keys are undefined');
+  }
+
+  var queryData = new goog.Uri.QueryData(null, null, opt_ignoreCase);
+  var values = goog.structs.getValues(map);
+  for (var i = 0; i < keys.length; i++) {
+    var key = keys[i];
+    var value = values[i];
+    if (!goog.isArray(value)) {
+      queryData.add(key, value);
+    } else {
+      queryData.setValues(key, value);
+    }
+  }
+  return queryData;
+};
+
+
+/**
+ * Creates a new query data instance from parallel arrays of parameter names
+ * and values. Allows for duplicate parameter names. Throws an error if the
+ * lengths of the arrays differ.
+ *
+ * @param {!Array<string>} keys Parameter names.
+ * @param {!Array<?>} values Parameter values.
+ * @param {goog.Uri=} opt_uri URI object that should have its cache
+ *     invalidated when this object updates.
+ * @param {boolean=} opt_ignoreCase If true, ignore the case of the parameter
+ *     name in #get.
+ * @return {!goog.Uri.QueryData} The populated query data instance.
+ */
+goog.Uri.QueryData.createFromKeysValues = function(
+    keys, values, opt_uri, opt_ignoreCase) {
+  if (keys.length != values.length) {
+    throw Error('Mismatched lengths for keys/values');
+  }
+  var queryData = new goog.Uri.QueryData(null, null, opt_ignoreCase);
+  for (var i = 0; i < keys.length; i++) {
+    queryData.add(keys[i], values[i]);
+  }
+  return queryData;
+};
+
+
+/**
+ * @return {?number} The number of parameters.
+ */
+goog.Uri.QueryData.prototype.getCount = function() {
+  this.ensureKeyMapInitialized_();
+  return this.count_;
+};
+
+
+/**
+ * Adds a key value pair.
+ * @param {string} key Name.
+ * @param {*} value Value.
+ * @return {!goog.Uri.QueryData} Instance of this object.
+ */
+goog.Uri.QueryData.prototype.add = function(key, value) {
+  this.ensureKeyMapInitialized_();
+  this.invalidateCache_();
+
+  key = this.getKeyName_(key);
+  var values = this.keyMap_.get(key);
+  if (!values) {
+    this.keyMap_.set(key, (values = []));
+  }
+  values.push(value);
+  this.count_ = goog.asserts.assertNumber(this.count_) + 1;
+  return this;
+};
+
+
+/**
+ * Removes all the params with the given key.
+ * @param {string} key Name.
+ * @return {boolean} Whether any parameter was removed.
+ */
+goog.Uri.QueryData.prototype.remove = function(key) {
+  this.ensureKeyMapInitialized_();
+
+  key = this.getKeyName_(key);
+  if (this.keyMap_.containsKey(key)) {
+    this.invalidateCache_();
+
+    // Decrement parameter count.
+    this.count_ =
+        goog.asserts.assertNumber(this.count_) - this.keyMap_.get(key).length;
+    return this.keyMap_.remove(key);
+  }
+  return false;
+};
+
+
+/**
+ * Clears the parameters.
+ */
+goog.Uri.QueryData.prototype.clear = function() {
+  this.invalidateCache_();
+  this.keyMap_ = null;
+  this.count_ = 0;
+};
+
+
+/**
+ * @return {boolean} Whether we have any parameters.
+ */
+goog.Uri.QueryData.prototype.isEmpty = function() {
+  this.ensureKeyMapInitialized_();
+  return this.count_ == 0;
+};
+
+
+/**
+ * Whether there is a parameter with the given name
+ * @param {string} key The parameter name to check for.
+ * @return {boolean} Whether there is a parameter with the given name.
+ */
+goog.Uri.QueryData.prototype.containsKey = function(key) {
+  this.ensureKeyMapInitialized_();
+  key = this.getKeyName_(key);
+  return this.keyMap_.containsKey(key);
+};
+
+
+/**
+ * Whether there is a parameter with the given value.
+ * @param {*} value The value to check for.
+ * @return {boolean} Whether there is a parameter with the given value.
+ */
+goog.Uri.QueryData.prototype.containsValue = function(value) {
+  // NOTE(arv): This solution goes through all the params even if it was the
+  // first param. We can get around this by not reusing code or by switching to
+  // iterators.
+  var vals = this.getValues();
+  return goog.array.contains(vals, value);
+};
+
+
+/**
+ * Runs a callback on every key-value pair in the map, including duplicate keys.
+ * This won't maintain original order when duplicate keys are interspersed (like
+ * getKeys() / getValues()).
+ * @param {function(this:SCOPE, ?, string, !goog.Uri.QueryData)} f
+ * @param {SCOPE=} opt_scope The value of "this" inside f.
+ * @template SCOPE
+ */
+goog.Uri.QueryData.prototype.forEach = function(f, opt_scope) {
+  this.ensureKeyMapInitialized_();
+  this.keyMap_.forEach(function(values, key) {
+    goog.array.forEach(values, function(value) {
+      f.call(opt_scope, value, key, this);
+    }, this);
+  }, this);
+};
+
+
+/**
+ * Returns all the keys of the parameters. If a key is used multiple times
+ * it will be included multiple times in the returned array
+ * @return {!Array<string>} All the keys of the parameters.
+ */
+goog.Uri.QueryData.prototype.getKeys = function() {
+  this.ensureKeyMapInitialized_();
+  // We need to get the values to know how many keys to add.
+  var vals = this.keyMap_.getValues();
+  var keys = this.keyMap_.getKeys();
+  var rv = [];
+  for (var i = 0; i < keys.length; i++) {
+    var val = vals[i];
+    for (var j = 0; j < val.length; j++) {
+      rv.push(keys[i]);
+    }
+  }
+  return rv;
+};
+
+
+/**
+ * Returns all the values of the parameters with the given name. If the query
+ * data has no such key this will return an empty array. If no key is given
+ * all values wil be returned.
+ * @param {string=} opt_key The name of the parameter to get the values for.
+ * @return {!Array<?>} All the values of the parameters with the given name.
+ */
+goog.Uri.QueryData.prototype.getValues = function(opt_key) {
+  this.ensureKeyMapInitialized_();
+  var rv = [];
+  if (goog.isString(opt_key)) {
+    if (this.containsKey(opt_key)) {
+      rv = goog.array.concat(rv, this.keyMap_.get(this.getKeyName_(opt_key)));
+    }
+  } else {
+    // Return all values.
+    var values = this.keyMap_.getValues();
+    for (var i = 0; i < values.length; i++) {
+      rv = goog.array.concat(rv, values[i]);
+    }
+  }
+  return rv;
+};
+
+
+/**
+ * Sets a key value pair and removes all other keys with the same value.
+ *
+ * @param {string} key Name.
+ * @param {*} value Value.
+ * @return {!goog.Uri.QueryData} Instance of this object.
+ */
+goog.Uri.QueryData.prototype.set = function(key, value) {
+  this.ensureKeyMapInitialized_();
+  this.invalidateCache_();
+
+  // TODO(chrishenry): This could be better written as
+  // this.remove(key), this.add(key, value), but that would reorder
+  // the key (since the key is first removed and then added at the
+  // end) and we would have to fix unit tests that depend on key
+  // ordering.
+  key = this.getKeyName_(key);
+  if (this.containsKey(key)) {
+    this.count_ =
+        goog.asserts.assertNumber(this.count_) - this.keyMap_.get(key).length;
+  }
+  this.keyMap_.set(key, [value]);
+  this.count_ = goog.asserts.assertNumber(this.count_) + 1;
+  return this;
+};
+
+
+/**
+ * Returns the first value associated with the key. If the query data has no
+ * such key this will return undefined or the optional default.
+ * @param {string} key The name of the parameter to get the value for.
+ * @param {*=} opt_default The default value to return if the query data
+ *     has no such key.
+ * @return {*} The first string value associated with the key, or opt_default
+ *     if there's no value.
+ */
+goog.Uri.QueryData.prototype.get = function(key, opt_default) {
+  var values = key ? this.getValues(key) : [];
+  if (goog.Uri.preserveParameterTypesCompatibilityFlag) {
+    return values.length > 0 ? values[0] : opt_default;
+  } else {
+    return values.length > 0 ? String(values[0]) : opt_default;
+  }
+};
+
+
+/**
+ * Sets the values for a key. If the key already exists, this will
+ * override all of the existing values that correspond to the key.
+ * @param {string} key The key to set values for.
+ * @param {!Array<?>} values The values to set.
+ */
+goog.Uri.QueryData.prototype.setValues = function(key, values) {
+  this.remove(key);
+
+  if (values.length > 0) {
+    this.invalidateCache_();
+    this.keyMap_.set(this.getKeyName_(key), goog.array.clone(values));
+    this.count_ = goog.asserts.assertNumber(this.count_) + values.length;
+  }
+};
+
+
+/**
+ * @return {string} Encoded query string.
+ * @override
+ */
+goog.Uri.QueryData.prototype.toString = function() {
+  if (this.encodedQuery_) {
+    return this.encodedQuery_;
+  }
+
+  if (!this.keyMap_) {
+    return '';
+  }
+
+  var sb = [];
+
+  // In the past, we use this.getKeys() and this.getVals(), but that
+  // generates a lot of allocations as compared to simply iterating
+  // over the keys.
+  var keys = this.keyMap_.getKeys();
+  for (var i = 0; i < keys.length; i++) {
+    var key = keys[i];
+    var encodedKey = goog.string.urlEncode(key);
+    var val = this.getValues(key);
+    for (var j = 0; j < val.length; j++) {
+      var param = encodedKey;
+      // Ensure that null and undefined are encoded into the url as
+      // literal strings.
+      if (val[j] !== '') {
+        param += '=' + goog.string.urlEncode(val[j]);
+      }
+      sb.push(param);
+    }
+  }
+
+  return this.encodedQuery_ = sb.join('&');
+};
+
+
+/**
+ * @throws URIError If URI is malformed (that is, if decodeURIComponent fails on
+ *     any of the URI components).
+ * @return {string} Decoded query string.
+ */
+goog.Uri.QueryData.prototype.toDecodedString = function() {
+  return goog.Uri.decodeOrEmpty_(this.toString());
+};
+
+
+/**
+ * Invalidate the cache.
+ * @private
+ */
+goog.Uri.QueryData.prototype.invalidateCache_ = function() {
+  this.encodedQuery_ = null;
+};
+
+
+/**
+ * Removes all keys that are not in the provided list. (Modifies this object.)
+ * @param {Array<string>} keys The desired keys.
+ * @return {!goog.Uri.QueryData} a reference to this object.
+ */
+goog.Uri.QueryData.prototype.filterKeys = function(keys) {
+  this.ensureKeyMapInitialized_();
+  this.keyMap_.forEach(function(value, key) {
+    if (!goog.array.contains(keys, key)) {
+      this.remove(key);
+    }
+  }, this);
+  return this;
+};
+
+
+/**
+ * Clone the query data instance.
+ * @return {!goog.Uri.QueryData} New instance of the QueryData object.
+ */
+goog.Uri.QueryData.prototype.clone = function() {
+  var rv = new goog.Uri.QueryData();
+  rv.encodedQuery_ = this.encodedQuery_;
+  if (this.keyMap_) {
+    rv.keyMap_ = this.keyMap_.clone();
+    rv.count_ = this.count_;
+  }
+  return rv;
+};
+
+
+/**
+ * Helper function to get the key name from a JavaScript object. Converts
+ * the object to a string, and to lower case if necessary.
+ * @private
+ * @param {*} arg The object to get a key name from.
+ * @return {string} valid key name which can be looked up in #keyMap_.
+ */
+goog.Uri.QueryData.prototype.getKeyName_ = function(arg) {
+  var keyName = String(arg);
+  if (this.ignoreCase_) {
+    keyName = keyName.toLowerCase();
+  }
+  return keyName;
+};
+
+
+/**
+ * Ignore case in parameter names.
+ * NOTE: If there are already key/value pairs in the QueryData, and
+ * ignoreCase_ is set to false, the keys will all be lower-cased.
+ * @param {boolean} ignoreCase whether this goog.Uri should ignore case.
+ */
+goog.Uri.QueryData.prototype.setIgnoreCase = function(ignoreCase) {
+  var resetKeys = ignoreCase && !this.ignoreCase_;
+  if (resetKeys) {
+    this.ensureKeyMapInitialized_();
+    this.invalidateCache_();
+    this.keyMap_.forEach(function(value, key) {
+      var lowerCase = key.toLowerCase();
+      if (key != lowerCase) {
+        this.remove(key);
+        this.setValues(lowerCase, value);
+      }
+    }, this);
+  }
+  this.ignoreCase_ = ignoreCase;
+};
+
+
+/**
+ * Extends a query data object with another query data or map like object. This
+ * operates 'in-place', it does not create a new QueryData object.
+ *
+ * @param {...(?goog.Uri.QueryData|?goog.structs.Map<?, ?>|?Object)} var_args
+ *     The object from which key value pairs will be copied.
+ * @suppress {deprecated} Use deprecated goog.structs.forEach to allow different
+ * types of parameters.
+ */
+goog.Uri.QueryData.prototype.extend = function(var_args) {
+  for (var i = 0; i < arguments.length; i++) {
+    var data = arguments[i];
+    goog.structs.forEach(
+        data, function(value, key) { this.add(key, value); }, this);
+  }
+};
diff --git a/js/goog/uri/utils.js b/js/goog/uri/utils.js
new file mode 100644
index 0000000..3b8917a
--- /dev/null
+++ b/js/goog/uri/utils.js
@@ -0,0 +1,1103 @@
+// Copyright 2008 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Simple utilities for dealing with URI strings.
+ *
+ * This is intended to be a lightweight alternative to constructing goog.Uri
+ * objects.  Whereas goog.Uri adds several kilobytes to the binary regardless
+ * of how much of its functionality you use, this is designed to be a set of
+ * mostly-independent utilities so that the compiler includes only what is
+ * necessary for the task.  Estimated savings of porting is 5k pre-gzip and
+ * 1.5k post-gzip.  To ensure the savings remain, future developers should
+ * avoid adding new functionality to existing functions, but instead create
+ * new ones and factor out shared code.
+ *
+ * Many of these utilities have limited functionality, tailored to common
+ * cases.  The query parameter utilities assume that the parameter keys are
+ * already encoded, since most keys are compile-time alphanumeric strings.  The
+ * query parameter mutation utilities also do not tolerate fragment identifiers.
+ *
+ * By design, these functions can be slower than goog.Uri equivalents.
+ * Repeated calls to some of functions may be quadratic in behavior for IE,
+ * although the effect is somewhat limited given the 2kb limit.
+ *
+ * One advantage of the limited functionality here is that this approach is
+ * less sensitive to differences in URI encodings than goog.Uri, since these
+ * functions operate on strings directly, rather than decoding them and
+ * then re-encoding.
+ *
+ * Uses features of RFC 3986 for parsing/formatting URIs:
+ *   http://www.ietf.org/rfc/rfc3986.txt
+ *
+ * @author gboyer@google.com (Garrett Boyer) - The "lightened" design.
+ * @author msamuel@google.com (Mike Samuel) - Domain knowledge and regexes.
+ */
+
+goog.provide('goog.uri.utils');
+goog.provide('goog.uri.utils.ComponentIndex');
+goog.provide('goog.uri.utils.QueryArray');
+goog.provide('goog.uri.utils.QueryValue');
+goog.provide('goog.uri.utils.StandardQueryParam');
+
+goog.require('goog.array');
+goog.require('goog.asserts');
+goog.require('goog.string');
+
+
+/**
+ * Character codes inlined to avoid object allocations due to charCode.
+ * @enum {number}
+ * @private
+ */
+goog.uri.utils.CharCode_ = {
+  AMPERSAND: 38,
+  EQUAL: 61,
+  HASH: 35,
+  QUESTION: 63
+};
+
+
+/**
+ * Builds a URI string from already-encoded parts.
+ *
+ * No encoding is performed.  Any component may be omitted as either null or
+ * undefined.
+ *
+ * @param {?string=} opt_scheme The scheme such as 'http'.
+ * @param {?string=} opt_userInfo The user name before the '@'.
+ * @param {?string=} opt_domain The domain such as 'www.google.com', already
+ *     URI-encoded.
+ * @param {(string|number|null)=} opt_port The port number.
+ * @param {?string=} opt_path The path, already URI-encoded.  If it is not
+ *     empty, it must begin with a slash.
+ * @param {?string=} opt_queryData The URI-encoded query data.
+ * @param {?string=} opt_fragment The URI-encoded fragment identifier.
+ * @return {string} The fully combined URI.
+ */
+goog.uri.utils.buildFromEncodedParts = function(
+    opt_scheme, opt_userInfo, opt_domain, opt_port, opt_path, opt_queryData,
+    opt_fragment) {
+  var out = '';
+
+  if (opt_scheme) {
+    out += opt_scheme + ':';
+  }
+
+  if (opt_domain) {
+    out += '//';
+
+    if (opt_userInfo) {
+      out += opt_userInfo + '@';
+    }
+
+    out += opt_domain;
+
+    if (opt_port) {
+      out += ':' + opt_port;
+    }
+  }
+
+  if (opt_path) {
+    out += opt_path;
+  }
+
+  if (opt_queryData) {
+    out += '?' + opt_queryData;
+  }
+
+  if (opt_fragment) {
+    out += '#' + opt_fragment;
+  }
+
+  return out;
+};
+
+
+/**
+ * A regular expression for breaking a URI into its component parts.
+ *
+ * {@link http://www.ietf.org/rfc/rfc3986.txt} says in Appendix B
+ * As the "first-match-wins" algorithm is identical to the "greedy"
+ * disambiguation method used by POSIX regular expressions, it is natural and
+ * commonplace to use a regular expression for parsing the potential five
+ * components of a URI reference.
+ *
+ * The following line is the regular expression for breaking-down a
+ * well-formed URI reference into its components.
+ *
+ * <pre>
+ * ^(([^:/?#]+):)?(//([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?
+ *  12            3  4          5       6  7        8 9
+ * </pre>
+ *
+ * The numbers in the second line above are only to assist readability; they
+ * indicate the reference points for each subexpression (i.e., each paired
+ * parenthesis). We refer to the value matched for subexpression <n> as $<n>.
+ * For example, matching the above expression to
+ * <pre>
+ *     http://www.ics.uci.edu/pub/ietf/uri/#Related
+ * </pre>
+ * results in the following subexpression matches:
+ * <pre>
+ *    $1 = http:
+ *    $2 = http
+ *    $3 = //www.ics.uci.edu
+ *    $4 = www.ics.uci.edu
+ *    $5 = /pub/ietf/uri/
+ *    $6 = <undefined>
+ *    $7 = <undefined>
+ *    $8 = #Related
+ *    $9 = Related
+ * </pre>
+ * where <undefined> indicates that the component is not present, as is the
+ * case for the query component in the above example. Therefore, we can
+ * determine the value of the five components as
+ * <pre>
+ *    scheme    = $2
+ *    authority = $4
+ *    path      = $5
+ *    query     = $7
+ *    fragment  = $9
+ * </pre>
+ *
+ * The regular expression has been modified slightly to expose the
+ * userInfo, domain, and port separately from the authority.
+ * The modified version yields
+ * <pre>
+ *    $1 = http              scheme
+ *    $2 = <undefined>       userInfo -\
+ *    $3 = www.ics.uci.edu   domain     | authority
+ *    $4 = <undefined>       port     -/
+ *    $5 = /pub/ietf/uri/    path
+ *    $6 = <undefined>       query without ?
+ *    $7 = Related           fragment without #
+ * </pre>
+ * @type {!RegExp}
+ * @private
+ */
+goog.uri.utils.splitRe_ = new RegExp(
+    '^' +
+    '(?:' +
+    '([^:/?#.]+)' +  // scheme - ignore special characters
+                     // used by other URL parts such as :,
+                     // ?, /, #, and .
+    ':)?' +
+    '(?://' +
+    '(?:([^/?#]*)@)?' +  // userInfo
+    '([^/#?]*?)' +       // domain
+    '(?::([0-9]+))?' +   // port
+    '(?=[/#?]|$)' +      // authority-terminating character
+    ')?' +
+    '([^?#]+)?' +          // path
+    '(?:\\?([^#]*))?' +    // query
+    '(?:#([\\s\\S]*))?' +  // fragment
+    '$');
+
+
+/**
+ * The index of each URI component in the return value of goog.uri.utils.split.
+ * @enum {number}
+ */
+goog.uri.utils.ComponentIndex = {
+  SCHEME: 1,
+  USER_INFO: 2,
+  DOMAIN: 3,
+  PORT: 4,
+  PATH: 5,
+  QUERY_DATA: 6,
+  FRAGMENT: 7
+};
+
+
+/**
+ * Splits a URI into its component parts.
+ *
+ * Each component can be accessed via the component indices; for example:
+ * <pre>
+ * goog.uri.utils.split(someStr)[goog.uri.utils.ComponentIndex.QUERY_DATA];
+ * </pre>
+ *
+ * @param {string} uri The URI string to examine.
+ * @return {!Array<string|undefined>} Each component still URI-encoded.
+ *     Each component that is present will contain the encoded value, whereas
+ *     components that are not present will be undefined or empty, depending
+ *     on the browser's regular expression implementation.  Never null, since
+ *     arbitrary strings may still look like path names.
+ */
+goog.uri.utils.split = function(uri) {
+  // See @return comment -- never null.
+  return /** @type {!Array<string|undefined>} */ (
+      uri.match(goog.uri.utils.splitRe_));
+};
+
+
+/**
+ * @param {?string} uri A possibly null string.
+ * @param {boolean=} opt_preserveReserved If true, percent-encoding of RFC-3986
+ *     reserved characters will not be removed.
+ * @return {?string} The string URI-decoded, or null if uri is null.
+ * @private
+ */
+goog.uri.utils.decodeIfPossible_ = function(uri, opt_preserveReserved) {
+  if (!uri) {
+    return uri;
+  }
+
+  return opt_preserveReserved ? decodeURI(uri) : decodeURIComponent(uri);
+};
+
+
+/**
+ * Gets a URI component by index.
+ *
+ * It is preferred to use the getPathEncoded() variety of functions ahead,
+ * since they are more readable.
+ *
+ * @param {goog.uri.utils.ComponentIndex} componentIndex The component index.
+ * @param {string} uri The URI to examine.
+ * @return {?string} The still-encoded component, or null if the component
+ *     is not present.
+ * @private
+ */
+goog.uri.utils.getComponentByIndex_ = function(componentIndex, uri) {
+  // Convert undefined, null, and empty string into null.
+  return goog.uri.utils.split(uri)[componentIndex] || null;
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The protocol or scheme, or null if none.  Does not
+ *     include trailing colons or slashes.
+ */
+goog.uri.utils.getScheme = function(uri) {
+  return goog.uri.utils.getComponentByIndex_(
+      goog.uri.utils.ComponentIndex.SCHEME, uri);
+};
+
+
+/**
+ * Gets the effective scheme for the URL.  If the URL is relative then the
+ * scheme is derived from the page's location.
+ * @param {string} uri The URI to examine.
+ * @return {string} The protocol or scheme, always lower case.
+ */
+goog.uri.utils.getEffectiveScheme = function(uri) {
+  var scheme = goog.uri.utils.getScheme(uri);
+  if (!scheme && goog.global.self && goog.global.self.location) {
+    var protocol = goog.global.self.location.protocol;
+    scheme = protocol.substr(0, protocol.length - 1);
+  }
+  // NOTE: When called from a web worker in Firefox 3.5, location maybe null.
+  // All other browsers with web workers support self.location from the worker.
+  return scheme ? scheme.toLowerCase() : '';
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The user name still encoded, or null if none.
+ */
+goog.uri.utils.getUserInfoEncoded = function(uri) {
+  return goog.uri.utils.getComponentByIndex_(
+      goog.uri.utils.ComponentIndex.USER_INFO, uri);
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The decoded user info, or null if none.
+ */
+goog.uri.utils.getUserInfo = function(uri) {
+  return goog.uri.utils.decodeIfPossible_(
+      goog.uri.utils.getUserInfoEncoded(uri));
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The domain name still encoded, or null if none.
+ */
+goog.uri.utils.getDomainEncoded = function(uri) {
+  return goog.uri.utils.getComponentByIndex_(
+      goog.uri.utils.ComponentIndex.DOMAIN, uri);
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The decoded domain, or null if none.
+ */
+goog.uri.utils.getDomain = function(uri) {
+  return goog.uri.utils.decodeIfPossible_(
+      goog.uri.utils.getDomainEncoded(uri), true /* opt_preserveReserved */);
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?number} The port number, or null if none.
+ */
+goog.uri.utils.getPort = function(uri) {
+  // Coerce to a number.  If the result of getComponentByIndex_ is null or
+  // non-numeric, the number coersion yields NaN.  This will then return
+  // null for all non-numeric cases (though also zero, which isn't a relevant
+  // port number).
+  return Number(
+             goog.uri.utils.getComponentByIndex_(
+                 goog.uri.utils.ComponentIndex.PORT, uri)) ||
+      null;
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The path still encoded, or null if none. Includes the
+ *     leading slash, if any.
+ */
+goog.uri.utils.getPathEncoded = function(uri) {
+  return goog.uri.utils.getComponentByIndex_(
+      goog.uri.utils.ComponentIndex.PATH, uri);
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The decoded path, or null if none.  Includes the leading
+ *     slash, if any.
+ */
+goog.uri.utils.getPath = function(uri) {
+  return goog.uri.utils.decodeIfPossible_(
+      goog.uri.utils.getPathEncoded(uri), true /* opt_preserveReserved */);
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The query data still encoded, or null if none.  Does not
+ *     include the question mark itself.
+ */
+goog.uri.utils.getQueryData = function(uri) {
+  return goog.uri.utils.getComponentByIndex_(
+      goog.uri.utils.ComponentIndex.QUERY_DATA, uri);
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The fragment identifier, or null if none.  Does not
+ *     include the hash mark itself.
+ */
+goog.uri.utils.getFragmentEncoded = function(uri) {
+  // The hash mark may not appear in any other part of the URL.
+  var hashIndex = uri.indexOf('#');
+  return hashIndex < 0 ? null : uri.substr(hashIndex + 1);
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @param {?string} fragment The encoded fragment identifier, or null if none.
+ *     Does not include the hash mark itself.
+ * @return {string} The URI with the fragment set.
+ */
+goog.uri.utils.setFragmentEncoded = function(uri, fragment) {
+  return goog.uri.utils.removeFragment(uri) + (fragment ? '#' + fragment : '');
+};
+
+
+/**
+ * @param {string} uri The URI to examine.
+ * @return {?string} The decoded fragment identifier, or null if none.  Does
+ *     not include the hash mark.
+ */
+goog.uri.utils.getFragment = function(uri) {
+  return goog.uri.utils.decodeIfPossible_(
+      goog.uri.utils.getFragmentEncoded(uri));
+};
+
+
+/**
+ * Extracts everything up to the port of the URI.
+ * @param {string} uri The URI string.
+ * @return {string} Everything up to and including the port.
+ */
+goog.uri.utils.getHost = function(uri) {
+  var pieces = goog.uri.utils.split(uri);
+  return goog.uri.utils.buildFromEncodedParts(
+      pieces[goog.uri.utils.ComponentIndex.SCHEME],
+      pieces[goog.uri.utils.ComponentIndex.USER_INFO],
+      pieces[goog.uri.utils.ComponentIndex.DOMAIN],
+      pieces[goog.uri.utils.ComponentIndex.PORT]);
+};
+
+
+/**
+ * Returns the origin for a given URL.
+ * @param {string} uri The URI string.
+ * @return {string} Everything up to and including the port.
+ */
+goog.uri.utils.getOrigin = function(uri) {
+  var pieces = goog.uri.utils.split(uri);
+  return goog.uri.utils.buildFromEncodedParts(
+      pieces[goog.uri.utils.ComponentIndex.SCHEME], null /* opt_userInfo */,
+      pieces[goog.uri.utils.ComponentIndex.DOMAIN],
+      pieces[goog.uri.utils.ComponentIndex.PORT]);
+};
+
+
+/**
+ * Extracts the path of the URL and everything after.
+ * @param {string} uri The URI string.
+ * @return {string} The URI, starting at the path and including the query
+ *     parameters and fragment identifier.
+ */
+goog.uri.utils.getPathAndAfter = function(uri) {
+  var pieces = goog.uri.utils.split(uri);
+  return goog.uri.utils.buildFromEncodedParts(
+      null, null, null, null, pieces[goog.uri.utils.ComponentIndex.PATH],
+      pieces[goog.uri.utils.ComponentIndex.QUERY_DATA],
+      pieces[goog.uri.utils.ComponentIndex.FRAGMENT]);
+};
+
+
+/**
+ * Gets the URI with the fragment identifier removed.
+ * @param {string} uri The URI to examine.
+ * @return {string} Everything preceding the hash mark.
+ */
+goog.uri.utils.removeFragment = function(uri) {
+  // The hash mark may not appear in any other part of the URL.
+  var hashIndex = uri.indexOf('#');
+  return hashIndex < 0 ? uri : uri.substr(0, hashIndex);
+};
+
+
+/**
+ * Ensures that two URI's have the exact same domain, scheme, and port.
+ *
+ * Unlike the version in goog.Uri, this checks protocol, and therefore is
+ * suitable for checking against the browser's same-origin policy.
+ *
+ * @param {string} uri1 The first URI.
+ * @param {string} uri2 The second URI.
+ * @return {boolean} Whether they have the same scheme, domain and port.
+ */
+goog.uri.utils.haveSameDomain = function(uri1, uri2) {
+  var pieces1 = goog.uri.utils.split(uri1);
+  var pieces2 = goog.uri.utils.split(uri2);
+  return pieces1[goog.uri.utils.ComponentIndex.DOMAIN] ==
+      pieces2[goog.uri.utils.ComponentIndex.DOMAIN] &&
+      pieces1[goog.uri.utils.ComponentIndex.SCHEME] ==
+      pieces2[goog.uri.utils.ComponentIndex.SCHEME] &&
+      pieces1[goog.uri.utils.ComponentIndex.PORT] ==
+      pieces2[goog.uri.utils.ComponentIndex.PORT];
+};
+
+
+/**
+ * Asserts that there are no fragment or query identifiers, only in uncompiled
+ * mode.
+ * @param {string} uri The URI to examine.
+ * @private
+ */
+goog.uri.utils.assertNoFragmentsOrQueries_ = function(uri) {
+  goog.asserts.assert(
+      uri.indexOf('#') < 0 && uri.indexOf('?') < 0,
+      'goog.uri.utils: Fragment or query identifiers are not supported: [%s]',
+      uri);
+};
+
+
+/**
+ * Supported query parameter values by the parameter serializing utilities.
+ *
+ * If a value is null or undefined, the key-value pair is skipped, as an easy
+ * way to omit parameters conditionally.  Non-array parameters are converted
+ * to a string and URI encoded.  Array values are expanded into multiple
+ * &key=value pairs, with each element stringized and URI-encoded.
+ *
+ * @typedef {*}
+ */
+goog.uri.utils.QueryValue;
+
+
+/**
+ * An array representing a set of query parameters with alternating keys
+ * and values.
+ *
+ * Keys are assumed to be URI encoded already and live at even indices.  See
+ * goog.uri.utils.QueryValue for details on how parameter values are encoded.
+ *
+ * Example:
+ * <pre>
+ * var data = [
+ *   // Simple param: ?name=BobBarker
+ *   'name', 'BobBarker',
+ *   // Conditional param -- may be omitted entirely.
+ *   'specialDietaryNeeds', hasDietaryNeeds() ? getDietaryNeeds() : null,
+ *   // Multi-valued param: &house=LosAngeles&house=NewYork&house=null
+ *   'house', ['LosAngeles', 'NewYork', null]
+ * ];
+ * </pre>
+ *
+ * @typedef {!Array<string|goog.uri.utils.QueryValue>}
+ */
+goog.uri.utils.QueryArray;
+
+
+/**
+ * Parses encoded query parameters and calls callback function for every
+ * parameter found in the string.
+ *
+ * Missing value of parameter (e.g. “…&key&…”) is treated as if the value was an
+ * empty string.  Keys may be empty strings (e.g. “…&=value&…”) which also means
+ * that “…&=&…” and “…&&…” will result in an empty key and value.
+ *
+ * @param {string} encodedQuery Encoded query string excluding question mark at
+ *     the beginning.
+ * @param {function(string, string)} callback Function called for every
+ *     parameter found in query string.  The first argument (name) will not be
+ *     urldecoded (so the function is consistent with buildQueryData), but the
+ *     second will.  If the parameter has no value (i.e. “=” was not present)
+ *     the second argument (value) will be an empty string.
+ */
+goog.uri.utils.parseQueryData = function(encodedQuery, callback) {
+  if (!encodedQuery) {
+    return;
+  }
+  var pairs = encodedQuery.split('&');
+  for (var i = 0; i < pairs.length; i++) {
+    var indexOfEquals = pairs[i].indexOf('=');
+    var name = null;
+    var value = null;
+    if (indexOfEquals >= 0) {
+      name = pairs[i].substring(0, indexOfEquals);
+      value = pairs[i].substring(indexOfEquals + 1);
+    } else {
+      name = pairs[i];
+    }
+    callback(name, value ? goog.string.urlDecode(value) : '');
+  }
+};
+
+
+/**
+ * Split the URI into 3 parts where the [1] is the queryData without a leading
+ * '?'. For example, the URI http://foo.com/bar?a=b#abc returns
+ * ['http://foo.com/bar','a=b','#abc'].
+ * @param {string} uri The URI to parse.
+ * @return {!Array<string>} An array representation of uri of length 3 where the
+ *     middle value is the queryData without a leading '?'.
+ * @private
+ */
+goog.uri.utils.splitQueryData_ = function(uri) {
+  // Find the query data and and hash.
+  var hashIndex = uri.indexOf('#');
+  if (hashIndex < 0) {
+    hashIndex = uri.length;
+  }
+  var questionIndex = uri.indexOf('?');
+  var queryData;
+  if (questionIndex < 0 || questionIndex > hashIndex) {
+    questionIndex = hashIndex;
+    queryData = '';
+  } else {
+    queryData = uri.substring(questionIndex + 1, hashIndex);
+  }
+  return [uri.substr(0, questionIndex), queryData, uri.substr(hashIndex)];
+};
+
+
+/**
+ * Join an array created by splitQueryData_ back into a URI.
+ * @param {!Array<string>} parts A URI in the form generated by splitQueryData_.
+ * @return {string} The joined URI.
+ * @private
+ */
+goog.uri.utils.joinQueryData_ = function(parts) {
+  return parts[0] + (parts[1] ? '?' + parts[1] : '') + parts[2];
+};
+
+
+/**
+ * @param {string} queryData
+ * @param {string} newData
+ * @return {string}
+ * @private
+ */
+goog.uri.utils.appendQueryData_ = function(queryData, newData) {
+  if (!newData) {
+    return queryData;
+  }
+  return queryData ? queryData + '&' + newData : newData;
+};
+
+
+/**
+ * @param {string} uri
+ * @param {string} queryData
+ * @return {string}
+ * @private
+ */
+goog.uri.utils.appendQueryDataToUri_ = function(uri, queryData) {
+  if (!queryData) {
+    return uri;
+  }
+  var parts = goog.uri.utils.splitQueryData_(uri);
+  parts[1] = goog.uri.utils.appendQueryData_(parts[1], queryData);
+  return goog.uri.utils.joinQueryData_(parts);
+};
+
+
+/**
+ * Appends key=value pairs to an array, supporting multi-valued objects.
+ * @param {*} key The key prefix.
+ * @param {goog.uri.utils.QueryValue} value The value to serialize.
+ * @param {!Array<string>} pairs The array to which the 'key=value' strings
+ *     should be appended.
+ * @private
+ */
+goog.uri.utils.appendKeyValuePairs_ = function(key, value, pairs) {
+  goog.asserts.assertString(key);
+  if (goog.isArray(value)) {
+    // Convince the compiler it's an array.
+    goog.asserts.assertArray(value);
+    for (var j = 0; j < value.length; j++) {
+      // Convert to string explicitly, to short circuit the null and array
+      // logic in this function -- this ensures that null and undefined get
+      // written as literal 'null' and 'undefined', and arrays don't get
+      // expanded out but instead encoded in the default way.
+      goog.uri.utils.appendKeyValuePairs_(key, String(value[j]), pairs);
+    }
+  } else if (value != null) {
+    // Skip a top-level null or undefined entirely.
+    pairs.push(
+        key +
+        // Check for empty string. Zero gets encoded into the url as literal
+        // strings.  For empty string, skip the equal sign, to be consistent
+        // with UriBuilder.java.
+        (value === '' ? '' : '=' + goog.string.urlEncode(value)));
+  }
+};
+
+
+/**
+ * Builds a query data string from a sequence of alternating keys and values.
+ * Currently generates "&key&" for empty args.
+ *
+ * @param {!IArrayLike<string|goog.uri.utils.QueryValue>} keysAndValues
+ *     Alternating keys and values. See the QueryArray typedef.
+ * @param {number=} opt_startIndex A start offset into the arary, defaults to 0.
+ * @return {string} The encoded query string, in the form 'a=1&b=2'.
+ */
+goog.uri.utils.buildQueryData = function(keysAndValues, opt_startIndex) {
+  goog.asserts.assert(
+      Math.max(keysAndValues.length - (opt_startIndex || 0), 0) % 2 == 0,
+      'goog.uri.utils: Key/value lists must be even in length.');
+
+  var params = [];
+  for (var i = opt_startIndex || 0; i < keysAndValues.length; i += 2) {
+    var key = /** @type {string} */ (keysAndValues[i]);
+    goog.uri.utils.appendKeyValuePairs_(key, keysAndValues[i + 1], params);
+  }
+  return params.join('&');
+};
+
+
+/**
+ * Builds a query data string from a map.
+ * Currently generates "&key&" for empty args.
+ *
+ * @param {!Object<string, goog.uri.utils.QueryValue>} map An object where keys
+ *     are URI-encoded parameter keys, and the values are arbitrary types
+ *     or arrays. Keys with a null value are dropped.
+ * @return {string} The encoded query string, in the form 'a=1&b=2'.
+ */
+goog.uri.utils.buildQueryDataFromMap = function(map) {
+  var params = [];
+  for (var key in map) {
+    goog.uri.utils.appendKeyValuePairs_(key, map[key], params);
+  }
+  return params.join('&');
+};
+
+
+/**
+ * Appends URI parameters to an existing URI.
+ *
+ * The variable arguments may contain alternating keys and values.  Keys are
+ * assumed to be already URI encoded.  The values should not be URI-encoded,
+ * and will instead be encoded by this function.
+ * <pre>
+ * appendParams('http://www.foo.com?existing=true',
+ *     'key1', 'value1',
+ *     'key2', 'value?willBeEncoded',
+ *     'key3', ['valueA', 'valueB', 'valueC'],
+ *     'key4', null);
+ * result: 'http://www.foo.com?existing=true&' +
+ *     'key1=value1&' +
+ *     'key2=value%3FwillBeEncoded&' +
+ *     'key3=valueA&key3=valueB&key3=valueC'
+ * </pre>
+ *
+ * A single call to this function will not exhibit quadratic behavior in IE,
+ * whereas multiple repeated calls may, although the effect is limited by
+ * fact that URL's generally can't exceed 2kb.
+ *
+ * @param {string} uri The original URI, which may already have query data.
+ * @param {...(goog.uri.utils.QueryArray|goog.uri.utils.QueryValue)}
+ * var_args
+ *     An array or argument list conforming to goog.uri.utils.QueryArray.
+ * @return {string} The URI with all query parameters added.
+ */
+goog.uri.utils.appendParams = function(uri, var_args) {
+  var queryData = arguments.length == 2 ?
+      goog.uri.utils.buildQueryData(arguments[1], 0) :
+      goog.uri.utils.buildQueryData(arguments, 1);
+  return goog.uri.utils.appendQueryDataToUri_(uri, queryData);
+};
+
+
+/**
+ * Appends query parameters from a map.
+ *
+ * @param {string} uri The original URI, which may already have query data.
+ * @param {!Object<goog.uri.utils.QueryValue>} map An object where keys are
+ *     URI-encoded parameter keys, and the values are arbitrary types or arrays.
+ *     Keys with a null value are dropped.
+ * @return {string} The new parameters.
+ */
+goog.uri.utils.appendParamsFromMap = function(uri, map) {
+  var queryData = goog.uri.utils.buildQueryDataFromMap(map);
+  return goog.uri.utils.appendQueryDataToUri_(uri, queryData);
+};
+
+
+/**
+ * Appends a single URI parameter.
+ *
+ * Repeated calls to this can exhibit quadratic behavior in IE6 due to the
+ * way string append works, though it should be limited given the 2kb limit.
+ *
+ * @param {string} uri The original URI, which may already have query data.
+ * @param {string} key The key, which must already be URI encoded.
+ * @param {*=} opt_value The value, which will be stringized and encoded
+ *     (assumed not already to be encoded).  If omitted, undefined, or null, the
+ *     key will be added as a valueless parameter.
+ * @return {string} The URI with the query parameter added.
+ */
+goog.uri.utils.appendParam = function(uri, key, opt_value) {
+  var value = goog.isDefAndNotNull(opt_value) ?
+      '=' + goog.string.urlEncode(opt_value) :
+      '';
+  return goog.uri.utils.appendQueryDataToUri_(uri, key + value);
+};
+
+
+/**
+ * Finds the next instance of a query parameter with the specified name.
+ *
+ * Does not instantiate any objects.
+ *
+ * @param {string} uri The URI to search.  May contain a fragment identifier
+ *     if opt_hashIndex is specified.
+ * @param {number} startIndex The index to begin searching for the key at.  A
+ *     match may be found even if this is one character after the ampersand.
+ * @param {string} keyEncoded The URI-encoded key.
+ * @param {number} hashOrEndIndex Index to stop looking at.  If a hash
+ *     mark is present, it should be its index, otherwise it should be the
+ *     length of the string.
+ * @return {number} The position of the first character in the key's name,
+ *     immediately after either a question mark or a dot.
+ * @private
+ */
+goog.uri.utils.findParam_ = function(
+    uri, startIndex, keyEncoded, hashOrEndIndex) {
+  var index = startIndex;
+  var keyLength = keyEncoded.length;
+
+  // Search for the key itself and post-filter for surronuding punctuation,
+  // rather than expensively building a regexp.
+  while ((index = uri.indexOf(keyEncoded, index)) >= 0 &&
+         index < hashOrEndIndex) {
+    var precedingChar = uri.charCodeAt(index - 1);
+    // Ensure that the preceding character is '&' or '?'.
+    if (precedingChar == goog.uri.utils.CharCode_.AMPERSAND ||
+        precedingChar == goog.uri.utils.CharCode_.QUESTION) {
+      // Ensure the following character is '&', '=', '#', or NaN
+      // (end of string).
+      var followingChar = uri.charCodeAt(index + keyLength);
+      if (!followingChar || followingChar == goog.uri.utils.CharCode_.EQUAL ||
+          followingChar == goog.uri.utils.CharCode_.AMPERSAND ||
+          followingChar == goog.uri.utils.CharCode_.HASH) {
+        return index;
+      }
+    }
+    index += keyLength + 1;
+  }
+
+  return -1;
+};
+
+
+/**
+ * Regular expression for finding a hash mark or end of string.
+ * @type {RegExp}
+ * @private
+ */
+goog.uri.utils.hashOrEndRe_ = /#|$/;
+
+
+/**
+ * Determines if the URI contains a specific key.
+ *
+ * Performs no object instantiations.
+ *
+ * @param {string} uri The URI to process.  May contain a fragment
+ *     identifier.
+ * @param {string} keyEncoded The URI-encoded key.  Case-sensitive.
+ * @return {boolean} Whether the key is present.
+ */
+goog.uri.utils.hasParam = function(uri, keyEncoded) {
+  return goog.uri.utils.findParam_(
+             uri, 0, keyEncoded, uri.search(goog.uri.utils.hashOrEndRe_)) >= 0;
+};
+
+
+/**
+ * Gets the first value of a query parameter.
+ * @param {string} uri The URI to process.  May contain a fragment.
+ * @param {string} keyEncoded The URI-encoded key.  Case-sensitive.
+ * @return {?string} The first value of the parameter (URI-decoded), or null
+ *     if the parameter is not found.
+ */
+goog.uri.utils.getParamValue = function(uri, keyEncoded) {
+  var hashOrEndIndex = uri.search(goog.uri.utils.hashOrEndRe_);
+  var foundIndex =
+      goog.uri.utils.findParam_(uri, 0, keyEncoded, hashOrEndIndex);
+
+  if (foundIndex < 0) {
+    return null;
+  } else {
+    var endPosition = uri.indexOf('&', foundIndex);
+    if (endPosition < 0 || endPosition > hashOrEndIndex) {
+      endPosition = hashOrEndIndex;
+    }
+    // Progress forth to the end of the "key=" or "key&" substring.
+    foundIndex += keyEncoded.length + 1;
+    // Use substr, because it (unlike substring) will return empty string
+    // if foundIndex > endPosition.
+    return goog.string.urlDecode(
+        uri.substr(foundIndex, endPosition - foundIndex));
+  }
+};
+
+
+/**
+ * Gets all values of a query parameter.
+ * @param {string} uri The URI to process.  May contain a fragment.
+ * @param {string} keyEncoded The URI-encoded key.  Case-sensitive.
+ * @return {!Array<string>} All URI-decoded values with the given key.
+ *     If the key is not found, this will have length 0, but never be null.
+ */
+goog.uri.utils.getParamValues = function(uri, keyEncoded) {
+  var hashOrEndIndex = uri.search(goog.uri.utils.hashOrEndRe_);
+  var position = 0;
+  var foundIndex;
+  var result = [];
+
+  while ((foundIndex = goog.uri.utils.findParam_(
+              uri, position, keyEncoded, hashOrEndIndex)) >= 0) {
+    // Find where this parameter ends, either the '&' or the end of the
+    // query parameters.
+    position = uri.indexOf('&', foundIndex);
+    if (position < 0 || position > hashOrEndIndex) {
+      position = hashOrEndIndex;
+    }
+
+    // Progress forth to the end of the "key=" or "key&" substring.
+    foundIndex += keyEncoded.length + 1;
+    // Use substr, because it (unlike substring) will return empty string
+    // if foundIndex > position.
+    result.push(
+        goog.string.urlDecode(uri.substr(foundIndex, position - foundIndex)));
+  }
+
+  return result;
+};
+
+
+/**
+ * Regexp to find trailing question marks and ampersands.
+ * @type {RegExp}
+ * @private
+ */
+goog.uri.utils.trailingQueryPunctuationRe_ = /[?&]($|#)/;
+
+
+/**
+ * Removes all instances of a query parameter.
+ * @param {string} uri The URI to process.  Must not contain a fragment.
+ * @param {string} keyEncoded The URI-encoded key.
+ * @return {string} The URI with all instances of the parameter removed.
+ */
+goog.uri.utils.removeParam = function(uri, keyEncoded) {
+  var hashOrEndIndex = uri.search(goog.uri.utils.hashOrEndRe_);
+  var position = 0;
+  var foundIndex;
+  var buffer = [];
+
+  // Look for a query parameter.
+  while ((foundIndex = goog.uri.utils.findParam_(
+              uri, position, keyEncoded, hashOrEndIndex)) >= 0) {
+    // Get the portion of the query string up to, but not including, the ?
+    // or & starting the parameter.
+    buffer.push(uri.substring(position, foundIndex));
+    // Progress to immediately after the '&'.  If not found, go to the end.
+    // Avoid including the hash mark.
+    position = Math.min(
+        (uri.indexOf('&', foundIndex) + 1) || hashOrEndIndex, hashOrEndIndex);
+  }
+
+  // Append everything that is remaining.
+  buffer.push(uri.substr(position));
+
+  // Join the buffer, and remove trailing punctuation that remains.
+  return buffer.join('').replace(
+      goog.uri.utils.trailingQueryPunctuationRe_, '$1');
+};
+
+
+/**
+ * Replaces all existing definitions of a parameter with a single definition.
+ *
+ * Repeated calls to this can exhibit quadratic behavior due to the need to
+ * find existing instances and reconstruct the string, though it should be
+ * limited given the 2kb limit.  Consider using appendParams or setParamsFromMap
+ * to update multiple parameters in bulk.
+ *
+ * @param {string} uri The original URI, which may already have query data.
+ * @param {string} keyEncoded The key, which must already be URI encoded.
+ * @param {*} value The value, which will be stringized and encoded (assumed
+ *     not already to be encoded).
+ * @return {string} The URI with the query parameter added.
+ */
+goog.uri.utils.setParam = function(uri, keyEncoded, value) {
+  return goog.uri.utils.appendParam(
+      goog.uri.utils.removeParam(uri, keyEncoded), keyEncoded, value);
+};
+
+
+/**
+ * Effeciently set or remove multiple query parameters in a URI. Order of
+ * unchanged parameters will not be modified, all updated parameters will be
+ * appended to the end of the query. Params with values of null or undefined are
+ * removed.
+ *
+ * @param {string} uri The URI to process.
+ * @param {!Object<string, goog.uri.utils.QueryValue>} params A list of
+ *     parameters to update. If null or undefined, the param will be removed.
+ * @return {string} An updated URI where the query data has been updated with
+ *     the params.
+ */
+goog.uri.utils.setParamsFromMap = function(uri, params) {
+  var parts = goog.uri.utils.splitQueryData_(uri);
+  var queryData = parts[1];
+  var buffer = [];
+  if (queryData) {
+    goog.array.forEach(queryData.split('&'), function(pair) {
+      var indexOfEquals = pair.indexOf('=');
+      var name = indexOfEquals >= 0 ? pair.substr(0, indexOfEquals) : pair;
+      if (!params.hasOwnProperty(name)) {
+        buffer.push(pair);
+      }
+    });
+  }
+  parts[1] = goog.uri.utils.appendQueryData_(
+      buffer.join('&'), goog.uri.utils.buildQueryDataFromMap(params));
+  return goog.uri.utils.joinQueryData_(parts);
+};
+
+
+/**
+ * Generates a URI path using a given URI and a path with checks to
+ * prevent consecutive "//". The baseUri passed in must not contain
+ * query or fragment identifiers. The path to append may not contain query or
+ * fragment identifiers.
+ *
+ * @param {string} baseUri URI to use as the base.
+ * @param {string} path Path to append.
+ * @return {string} Updated URI.
+ */
+goog.uri.utils.appendPath = function(baseUri, path) {
+  goog.uri.utils.assertNoFragmentsOrQueries_(baseUri);
+
+  // Remove any trailing '/'
+  if (goog.string.endsWith(baseUri, '/')) {
+    baseUri = baseUri.substr(0, baseUri.length - 1);
+  }
+  // Remove any leading '/'
+  if (goog.string.startsWith(path, '/')) {
+    path = path.substr(1);
+  }
+  return goog.string.buildString(baseUri, '/', path);
+};
+
+
+/**
+ * Replaces the path.
+ * @param {string} uri URI to use as the base.
+ * @param {string} path New path.
+ * @return {string} Updated URI.
+ */
+goog.uri.utils.setPath = function(uri, path) {
+  // Add any missing '/'.
+  if (!goog.string.startsWith(path, '/')) {
+    path = '/' + path;
+  }
+  var parts = goog.uri.utils.split(uri);
+  return goog.uri.utils.buildFromEncodedParts(
+      parts[goog.uri.utils.ComponentIndex.SCHEME],
+      parts[goog.uri.utils.ComponentIndex.USER_INFO],
+      parts[goog.uri.utils.ComponentIndex.DOMAIN],
+      parts[goog.uri.utils.ComponentIndex.PORT], path,
+      parts[goog.uri.utils.ComponentIndex.QUERY_DATA],
+      parts[goog.uri.utils.ComponentIndex.FRAGMENT]);
+};
+
+
+/**
+ * Standard supported query parameters.
+ * @enum {string}
+ */
+goog.uri.utils.StandardQueryParam = {
+
+  /** Unused parameter for unique-ifying. */
+  RANDOM: 'zx'
+};
+
+
+/**
+ * Sets the zx parameter of a URI to a random value.
+ * @param {string} uri Any URI.
+ * @return {string} That URI with the "zx" parameter added or replaced to
+ *     contain a random string.
+ */
+goog.uri.utils.makeUnique = function(uri) {
+  return goog.uri.utils.setParam(
+      uri, goog.uri.utils.StandardQueryParam.RANDOM,
+      goog.string.getRandomString());
+};
diff --git a/js/pluto.js b/js/pluto.js
new file mode 100644
index 0000000..c11e1f4
--- /dev/null
+++ b/js/pluto.js
@@ -0,0 +1,886 @@
+if(typeof Math.imul == "undefined" || (Math.imul(0xffffffff,5) == 0)) {
+    Math.imul = function (a, b) {
+        var ah  = (a >>> 16) & 0xffff;
+        var al = a & 0xffff;
+        var bh  = (b >>> 16) & 0xffff;
+        var bl = b & 0xffff;
+        // the shift by 0 fixes the sign on the high part
+        // the final |0 converts the unsigned value into a signed value
+        return ((al * bl) + (((ah * bl + al * bh) << 16) >>> 0)|0);
+    }
+}
+
+/** @license React v16.3.0
+ * react.production.min.js
+ *
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+            ;(function(q,h){"object"===typeof exports&&"undefined"!==typeof module?module.exports=h():"function"===typeof define&&define.amd?define(h):q.React=h()})(this,function(){function q(a){for(var b=arguments.length-1,e="Minified React error #"+a+"; visit http://facebook.github.io/react/docs/error-decoder.html?invariant\x3d"+a,c=0;c<b;c++)e+="\x26args[]\x3d"+encodeURIComponent(arguments[c+1]);b=Error(e+" for the full message or use the non-minified dev environment for full errors and additional helpful warnings.");
+b.name="Invariant Violation";b.framesToPop=1;throw b;}function h(a){return function(){return a}}function p(a,b,e){this.props=a;this.context=b;this.refs=D;this.updater=e||E}function F(){}function v(a,b,e){this.props=a;this.context=b;this.refs=D;this.updater=e||E}function G(a,b,e){var c=void 0,f={},k=null,d=null;if(null!=b)for(c in void 0!==b.ref&&(d=b.ref),void 0!==b.key&&(k=""+b.key),b)H.call(b,c)&&!I.hasOwnProperty(c)&&(f[c]=b[c]);var g=arguments.length-2;if(1===g)f.children=e;else if(1<g){for(var l=
+Array(g),m=0;m<g;m++)l[m]=arguments[m+2];f.children=l}if(a&&a.defaultProps)for(c in g=a.defaultProps,g)void 0===f[c]&&(f[c]=g[c]);return{$$typeof:r,type:a,key:k,ref:d,props:f,_owner:w.current}}function x(a){return"object"===typeof a&&null!==a&&a.$$typeof===r}function O(a){var b={"\x3d":"\x3d0",":":"\x3d2"};return"$"+(""+a).replace(/[=:]/g,function(a){return b[a]})}function J(a,b,e,c){if(u.length){var f=u.pop();f.result=a;f.keyPrefix=b;f.func=e;f.context=c;f.count=0;return f}return{result:a,keyPrefix:b,
+func:e,context:c,count:0}}function K(a){a.result=null;a.keyPrefix=null;a.func=null;a.context=null;a.count=0;10>u.length&&u.push(a)}function t(a,b,e,c){var f=typeof a;if("undefined"===f||"boolean"===f)a=null;var k=!1;if(null===a)k=!0;else switch(f){case "string":case "number":k=!0;break;case "object":switch(a.$$typeof){case r:case P:k=!0}}if(k)return e(c,a,""===b?"."+y(a,0):b),1;k=0;b=""===b?".":b+":";if(Array.isArray(a))for(var d=0;d<a.length;d++){f=a[d];var g=b+y(f,d);k+=t(f,g,e,c)}else if(null===
+a||"undefined"===typeof a?g=null:(g=L&&a[L]||a["@@iterator"],g="function"===typeof g?g:null),"function"===typeof g)for(a=g.call(a),d=0;!(f=a.next()).done;)f=f.value,g=b+y(f,d++),k+=t(f,g,e,c);else"object"===f&&(e=""+a,q("31","[object Object]"===e?"object with keys {"+Object.keys(a).join(", ")+"}":e,""));return k}function y(a,b){return"object"===typeof a&&null!==a&&null!=a.key?O(a.key):b.toString(36)}function Q(a,b,e){a.func.call(a.context,b,a.count++)}function R(a,b,e){var c=a.result,f=a.keyPrefix;
+a=a.func.call(a.context,b,a.count++);Array.isArray(a)?z(a,c,e,A.thatReturnsArgument):null!=a&&(x(a)&&(b=f+(!a.key||b&&b.key===a.key?"":(""+a.key).replace(M,"$\x26/")+"/")+e,a={$$typeof:r,type:a.type,key:b,ref:a.ref,props:a.props,_owner:a._owner}),c.push(a))}function z(a,b,e,c,f){var d="";null!=e&&(d=(""+e).replace(M,"$\x26/")+"/");b=J(b,d,c,f);null==a||t(a,"",R,b);K(b)}var N=Object.getOwnPropertySymbols,S=Object.prototype.hasOwnProperty,T=Object.prototype.propertyIsEnumerable,B=function(){try{if(!Object.assign)return!1;
+var a=new String("abc");a[5]="de";if("5"===Object.getOwnPropertyNames(a)[0])return!1;var b={};for(a=0;10>a;a++)b["_"+String.fromCharCode(a)]=a;if("0123456789"!==Object.getOwnPropertyNames(b).map(function(a){return b[a]}).join(""))return!1;var e={};"abcdefghijklmnopqrst".split("").forEach(function(a){e[a]=a});return"abcdefghijklmnopqrst"!==Object.keys(Object.assign({},e)).join("")?!1:!0}catch(c){return!1}}()?Object.assign:function(a,b){if(null===a||void 0===a)throw new TypeError("Object.assign cannot be called with null or undefined");
+var e=Object(a);for(var c,f=1;f<arguments.length;f++){var d=Object(arguments[f]);for(var h in d)S.call(d,h)&&(e[h]=d[h]);if(N){c=N(d);for(var g=0;g<c.length;g++)T.call(d,c[g])&&(e[c[g]]=d[c[g]])}}return e},d="function"===typeof Symbol&&Symbol["for"],r=d?Symbol["for"]("react.element"):60103,P=d?Symbol["for"]("react.portal"):60106,n=d?Symbol["for"]("react.fragment"):60107,C=d?Symbol["for"]("react.strict_mode"):60108,U=d?Symbol["for"]("react.provider"):60109,V=d?Symbol["for"]("react.context"):60110,
+W=d?Symbol["for"]("react.async_mode"):60111,X=d?Symbol["for"]("react.forward_ref"):60112,L="function"===typeof Symbol&&Symbol.iterator,D={};d=function(){};d.thatReturns=h;d.thatReturnsFalse=h(!1);d.thatReturnsTrue=h(!0);d.thatReturnsNull=h(null);d.thatReturnsThis=function(){return this};d.thatReturnsArgument=function(a){return a};var A=d,E={isMounted:function(a){return!1},enqueueForceUpdate:function(a,b,e){},enqueueReplaceState:function(a,b,e,c){},enqueueSetState:function(a,b,e,c){}};p.prototype.isReactComponent=
+{};p.prototype.setState=function(a,b){"object"!==typeof a&&"function"!==typeof a&&null!=a?q("85"):void 0;this.updater.enqueueSetState(this,a,b,"setState")};p.prototype.forceUpdate=function(a){this.updater.enqueueForceUpdate(this,a,"forceUpdate")};F.prototype=p.prototype;d=v.prototype=new F;d.constructor=v;B(d,p.prototype);d.isPureReactComponent=!0;var w={current:null},H=Object.prototype.hasOwnProperty,I={key:!0,ref:!0,__self:!0,__source:!0},M=/\/+/g,u=[];n={Children:{map:function(a,b,e){if(null==
+a)return a;var c=[];z(a,c,null,b,e);return c},forEach:function(a,b,e){if(null==a)return a;b=J(null,null,b,e);null==a||t(a,"",Q,b);K(b)},count:function(a,b){return null==a?0:t(a,"",A.thatReturnsNull,null)},toArray:function(a){var b=[];z(a,b,null,A.thatReturnsArgument);return b},only:function(a){x(a)?void 0:q("143");return a}},createRef:function(){return{current:null}},Component:p,PureComponent:v,createContext:function(a,b){void 0===b&&(b=null);a={$$typeof:V,_calculateChangedBits:b,_defaultValue:a,
+_currentValue:a,_changedBits:0,Provider:null,Consumer:null};a.Provider={$$typeof:U,context:a};return a.Consumer=a},forwardRef:function(a){return{$$typeof:X,render:a}},Fragment:n,StrictMode:C,unstable_AsyncMode:W,createElement:G,cloneElement:function(a,b,e){var c=void 0,d=B({},a.props),k=a.key,h=a.ref,g=a._owner;if(null!=b){void 0!==b.ref&&(h=b.ref,g=w.current);void 0!==b.key&&(k=""+b.key);var l=void 0;a.type&&a.type.defaultProps&&(l=a.type.defaultProps);for(c in b)H.call(b,c)&&!I.hasOwnProperty(c)&&
+(d[c]=void 0===b[c]&&void 0!==l?l[c]:b[c])}c=arguments.length-2;if(1===c)d.children=e;else if(1<c){l=Array(c);for(var m=0;m<c;m++)l[m]=arguments[m+2];d.children=l}return{$$typeof:r,type:a.type,key:k,ref:h,props:d,_owner:g}},createFactory:function(a){var b=G.bind(null,a);b.type=a;return b},isValidElement:x,version:"16.3.0",__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED:{ReactCurrentOwner:w,assign:B}};n=(C=Object.freeze({default:n}))&&n||C;return n["default"]?n["default"]:n});
+
+!function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e(require("react")):"function"==typeof define&&define.amd?define(["react"],e):"object"==typeof exports?exports.createReactClass=e(require("react")):t.createReactClass=e(t.React)}(this,function(t){return function(t){function e(o){if(n[o])return n[o].exports;var r=n[o]={i:o,l:!1,exports:{}};return t[o].call(r.exports,r,r.exports,e),r.l=!0,r.exports}var n={};return e.m=t,e.c=n,e.i=function(t){return t},e.d=function(t,n,o){e.o(t,n)||Object.defineProperty(t,n,{configurable:!1,enumerable:!0,get:o})},e.n=function(t){var n=t&&t.__esModule?function(){return t.default}:function(){return t};return e.d(n,"a",n),n},e.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},e.p="",e(e.s=2)}([function(t,e,n){"use strict";function o(t){return t}function r(t,e,n){function r(t,e){var n=g.hasOwnProperty(e)?g[e]:null;_.hasOwnProperty(e)&&s("OVERRIDE_BASE"===n,"ReactClassInterface: You are attempting to override `%s` from your class specification. Ensure that your method names do not overlap with React methods.",e),t&&s("DEFINE_MANY"===n||"DEFINE_MANY_MERGED"===n,"ReactClassInterface: You are attempting to define `%s` on your component more than once. This conflict may be due to a mixin.",e)}function u(t,n){if(n){s("function"!=typeof n,"ReactClass: You're attempting to use a component class or function as a mixin. Instead, just use a regular object."),s(!e(n),"ReactClass: You're attempting to use a component as a mixin. Instead, just use a regular object.");var o=t.prototype,i=o.__reactAutoBindPairs;n.hasOwnProperty(c)&&N.mixins(t,n.mixins);for(var a in n)if(n.hasOwnProperty(a)&&a!==c){var u=n[a],p=o.hasOwnProperty(a);if(r(p,a),N.hasOwnProperty(a))N[a](t,u);else{var f=g.hasOwnProperty(a),m="function"==typeof u,h=m&&!f&&!p&&!1!==n.autobind;if(h)i.push(a,u),o[a]=u;else if(p){var y=g[a];s(f&&("DEFINE_MANY_MERGED"===y||"DEFINE_MANY"===y),"ReactClass: Unexpected spec policy %s for key %s when mixing in component specs.",y,a),"DEFINE_MANY_MERGED"===y?o[a]=l(o[a],u):"DEFINE_MANY"===y&&(o[a]=d(o[a],u))}else o[a]=u}}}else;}function p(t,e){if(e)for(var n in e){var o=e[n];if(e.hasOwnProperty(n)){var r=n in N;s(!r,'ReactClass: You are attempting to define a reserved property, `%s`, that shouldn\'t be on the "statics" key. Define it as an instance property instead; it will still be accessible on the constructor.',n);var i=n in t;s(!i,"ReactClass: You are attempting to define `%s` on your component more than once. This conflict may be due to a mixin.",n),t[n]=o}}}function f(t,e){s(t&&e&&"object"==typeof t&&"object"==typeof e,"mergeIntoWithNoDuplicateKeys(): Cannot merge non-objects.");for(var n in e)e.hasOwnProperty(n)&&(s(void 0===t[n],"mergeIntoWithNoDuplicateKeys(): Tried to merge two objects with the same key: `%s`. This conflict may be due to a mixin; in particular, this may be caused by two getInitialState() or getDefaultProps() methods returning objects with clashing keys.",n),t[n]=e[n]);return t}function l(t,e){return function(){var n=t.apply(this,arguments),o=e.apply(this,arguments);if(null==n)return o;if(null==o)return n;var r={};return f(r,n),f(r,o),r}}function d(t,e){return function(){t.apply(this,arguments),e.apply(this,arguments)}}function m(t,e){var n=e.bind(t);return n}function h(t){for(var e=t.__reactAutoBindPairs,n=0;n<e.length;n+=2){var o=e[n],r=e[n+1];t[o]=m(t,r)}}function y(t){var e=o(function(t,o,r){this.__reactAutoBindPairs.length&&h(this),this.props=t,this.context=o,this.refs=a,this.updater=r||n,this.state=null;var i=this.getInitialState?this.getInitialState():null;s("object"==typeof i&&!Array.isArray(i),"%s.getInitialState(): must return an object or null",e.displayName||"ReactCompositeComponent"),this.state=i});e.prototype=new D,e.prototype.constructor=e,e.prototype.__reactAutoBindPairs=[],E.forEach(u.bind(null,e)),u(e,b),u(e,t),u(e,v),e.getDefaultProps&&(e.defaultProps=e.getDefaultProps()),s(e.prototype.render,"createClass(...): Class specification must implement a `render` method.");for(var r in g)e.prototype[r]||(e.prototype[r]=null);return e}var E=[],g={mixins:"DEFINE_MANY",statics:"DEFINE_MANY",propTypes:"DEFINE_MANY",contextTypes:"DEFINE_MANY",childContextTypes:"DEFINE_MANY",getDefaultProps:"DEFINE_MANY_MERGED",getInitialState:"DEFINE_MANY_MERGED",getChildContext:"DEFINE_MANY_MERGED",render:"DEFINE_ONCE",componentWillMount:"DEFINE_MANY",componentDidMount:"DEFINE_MANY",componentWillReceiveProps:"DEFINE_MANY",shouldComponentUpdate:"DEFINE_ONCE",componentWillUpdate:"DEFINE_MANY",componentDidUpdate:"DEFINE_MANY",componentWillUnmount:"DEFINE_MANY",updateComponent:"OVERRIDE_BASE"},N={displayName:function(t,e){t.displayName=e},mixins:function(t,e){if(e)for(var n=0;n<e.length;n++)u(t,e[n])},childContextTypes:function(t,e){t.childContextTypes=i({},t.childContextTypes,e)},contextTypes:function(t,e){t.contextTypes=i({},t.contextTypes,e)},getDefaultProps:function(t,e){t.getDefaultProps?t.getDefaultProps=l(t.getDefaultProps,e):t.getDefaultProps=e},propTypes:function(t,e){t.propTypes=i({},t.propTypes,e)},statics:function(t,e){p(t,e)},autobind:function(){}},b={componentDidMount:function(){this.__isMounted=!0}},v={componentWillUnmount:function(){this.__isMounted=!1}},_={replaceState:function(t,e){this.updater.enqueueReplaceState(this,t,e)},isMounted:function(){return!!this.__isMounted}},D=function(){};return i(D.prototype,t.prototype,_),y}var i=n(5),a=n(3),s=n(4),c="mixins";t.exports=r},function(e,n){e.exports=t},function(t,e,n){"use strict";var o=n(1),r=n(0);if(void 0===o)throw Error("create-react-class could not find the React object. If you are using script tags, make sure that React is being loaded before create-react-class.");var i=(new o.Component).updater;t.exports=r(o.Component,o.isValidElement,i)},function(t,e,n){"use strict";var o={};t.exports=o},function(t,e,n){"use strict";function o(t,e,n,o,i,a,s,c){if(r(e),!t){var u;if(void 0===e)u=new Error("Minified exception occurred; use the non-minified dev environment for the full error message and additional helpful warnings.");else{var p=[n,o,i,a,s,c],f=0;u=new Error(e.replace(/%s/g,function(){return p[f++]})),u.name="Invariant Violation"}throw u.framesToPop=1,u}}var r=function(t){};t.exports=o},function(t,e,n){"use strict";function o(t){if(null===t||void 0===t)throw new TypeError("Object.assign cannot be called with null or undefined");return Object(t)}var r=Object.getOwnPropertySymbols,i=Object.prototype.hasOwnProperty,a=Object.prototype.propertyIsEnumerable;t.exports=function(){try{if(!Object.assign)return!1;var t=new String("abc");if(t[5]="de","5"===Object.getOwnPropertyNames(t)[0])return!1;for(var e={},n=0;n<10;n++)e["_"+String.fromCharCode(n)]=n;if("0123456789"!==Object.getOwnPropertyNames(e).map(function(t){return e[t]}).join(""))return!1;var o={};return"abcdefghijklmnopqrst".split("").forEach(function(t){o[t]=t}),"abcdefghijklmnopqrst"===Object.keys(Object.assign({},o)).join("")}catch(t){return!1}}()?Object.assign:function(t,e){for(var n,s,c=o(t),u=1;u<arguments.length;u++){n=Object(arguments[u]);for(var p in n)i.call(n,p)&&(c[p]=n[p]);if(r){s=r(n);for(var f=0;f<s.length;f++)a.call(n,s[f])&&(c[s[f]]=n[s[f]])}}return c}}])});
+/** @license React v16.3.0
+ * react-dom.production.min.js
+ *
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/*
+ Modernizr 3.0.0pre (Custom Build) | MIT
+*/
+            ;(function(qa,l){"object"===typeof exports&&"undefined"!==typeof module?module.exports=l(require("react")):"function"===typeof define&&define.amd?define(["react"],l):qa.ReactDOM=l(qa.React)})(this,function(qa){function l(a){for(var b=arguments.length-1,c="Minified React error #"+a+"; visit http://facebook.github.io/react/docs/error-decoder.html?invariant\x3d"+a,d=0;d<b;d++)c+="\x26args[]\x3d"+encodeURIComponent(arguments[d+1]);b=Error(c+" for the full message or use the non-minified dev environment for full errors and additional helpful warnings.");
+b.name="Invariant Violation";b.framesToPop=1;throw b;}function Dc(){if($a)for(var a in wa){var b=wa[a],c=$a.indexOf(a);-1<c?void 0:l("96",a);if(!ea[c]){b.extractEvents?void 0:l("97",a);ea[c]=b;c=b.eventTypes;for(var d in c){var e=void 0;var f=c[d],g=b,h=d;Fb.hasOwnProperty(h)?l("99",h):void 0;Fb[h]=f;var k=f.phasedRegistrationNames;if(k){for(e in k)k.hasOwnProperty(e)&&Ec(k[e],g,h);e=!0}else f.registrationName?(Ec(f.registrationName,g,h),e=!0):e=!1;e?void 0:l("98",d,a)}}}}function Ec(a,b,c){ra[a]?
+l("100",a):void 0;ra[a]=b;ab[a]=b.eventTypes[c].dependencies}function Fc(a){$a?l("101"):void 0;$a=Array.prototype.slice.call(a);Dc()}function Gc(a){var b=!1,c;for(c in a)if(a.hasOwnProperty(c)){var d=a[c];wa.hasOwnProperty(c)&&wa[c]===d||(wa[c]?l("102",c):void 0,wa[c]=d,b=!0)}b&&Dc()}function bb(a){return function(){return a}}function Hc(a,b,c,d){b=a.type||"unknown-event";a.currentTarget=Ic(d);y.invokeGuardedCallbackAndCatchFirstError(b,c,void 0,a);a.currentTarget=null}function xa(a,b){null==b?l("30"):
+void 0;if(null==a)return b;if(Array.isArray(a)){if(Array.isArray(b))return a.push.apply(a,b),a;a.push(b);return a}return Array.isArray(b)?[a].concat(b):[a,b]}function Y(a,b,c){Array.isArray(a)?a.forEach(b,c):a&&b.call(c,a)}function Gb(a,b){var c=a.stateNode;if(!c)return null;var d=Hb(c);if(!d)return null;c=d[b];a:switch(b){case "onClick":case "onClickCapture":case "onDoubleClick":case "onDoubleClickCapture":case "onMouseDown":case "onMouseDownCapture":case "onMouseMove":case "onMouseMoveCapture":case "onMouseUp":case "onMouseUpCapture":(d=
+!d.disabled)||(a=a.type,d=!("button"===a||"input"===a||"select"===a||"textarea"===a));a=!d;break a;default:a=!1}if(a)return null;c&&"function"!==typeof c?l("231",b,typeof c):void 0;return c}function Ib(a,b){null!==a&&(fa=xa(fa,a));a=fa;fa=null;a&&(b?Y(a,we):Y(a,xe),fa?l("95"):void 0,y.rethrowCaughtError())}function Jc(a,b,c,d){for(var e=null,f=0;f<ea.length;f++){var g=ea[f];g&&(g=g.extractEvents(a,b,c,d))&&(e=xa(e,g))}Ib(e,!1)}function Ca(a){if(a[R])return a[R];for(;!a[R];)if(a.parentNode)a=a.parentNode;
+else return null;a=a[R];return 5===a.tag||6===a.tag?a:null}function ya(a){if(5===a.tag||6===a.tag)return a.stateNode;l("33")}function Kc(a){return a[ha]||null}function S(a){do a=a["return"];while(a&&5!==a.tag);return a?a:null}function Lc(a,b,c){for(var d=[];a;)d.push(a),a=S(a);for(a=d.length;0<a--;)b(d[a],"captured",c);for(a=0;a<d.length;a++)b(d[a],"bubbled",c)}function Mc(a,b,c){if(b=Gb(a,c.dispatchConfig.phasedRegistrationNames[b]))c._dispatchListeners=xa(c._dispatchListeners,b),c._dispatchInstances=
+xa(c._dispatchInstances,a)}function ye(a){a&&a.dispatchConfig.phasedRegistrationNames&&Lc(a._targetInst,Mc,a)}function ze(a){if(a&&a.dispatchConfig.phasedRegistrationNames){var b=a._targetInst;b=b?S(b):null;Lc(b,Mc,a)}}function Jb(a,b,c){a&&c&&c.dispatchConfig.registrationName&&(b=Gb(a,c.dispatchConfig.registrationName))&&(c._dispatchListeners=xa(c._dispatchListeners,b),c._dispatchInstances=xa(c._dispatchInstances,a))}function Ae(a){a&&a.dispatchConfig.registrationName&&Jb(a._targetInst,null,a)}function ia(a){Y(a,
+ye)}function Nc(a,b,c,d){if(c&&d)a:{var e=c;for(var f=d,g=0,h=e;h;h=S(h))g++;h=0;for(var k=f;k;k=S(k))h++;for(;0<g-h;)e=S(e),g--;for(;0<h-g;)f=S(f),h--;for(;g--;){if(e===f||e===f.alternate)break a;e=S(e);f=S(f)}e=null}else e=null;f=e;for(e=[];c&&c!==f;){g=c.alternate;if(null!==g&&g===f)break;e.push(c);c=S(c)}for(c=[];d&&d!==f;){g=d.alternate;if(null!==g&&g===f)break;c.push(d);d=S(d)}for(d=0;d<e.length;d++)Jb(e[d],"bubbled",a);for(a=c.length;0<a--;)Jb(c[a],"captured",b)}function Oc(){!Kb&&T.canUseDOM&&
+(Kb="textContent"in document.documentElement?"textContent":"innerText");return Kb}function Pc(){if(H._fallbackText)return H._fallbackText;var a,b=H._startText,c=b.length,d,e=Qc(),f=e.length;for(a=0;a<c&&b[a]===e[a];a++);var g=c-a;for(d=1;d<=g&&b[c-d]===e[f-d];d++);H._fallbackText=e.slice(a,1<d?1-d:void 0);return H._fallbackText}function Qc(){return"value"in H._root?H._root.value:H._root[Oc()]}function I(a,b,c,d){this.dispatchConfig=a;this._targetInst=b;this.nativeEvent=c;a=this.constructor.Interface;
+for(var e in a)a.hasOwnProperty(e)&&((b=a[e])?this[e]=b(c):"target"===e?this.target=d:this[e]=c[e]);this.isDefaultPrevented=(null!=c.defaultPrevented?c.defaultPrevented:!1===c.returnValue)?M.thatReturnsTrue:M.thatReturnsFalse;this.isPropagationStopped=M.thatReturnsFalse;return this}function Be(a,b,c,d){if(this.eventPool.length){var e=this.eventPool.pop();this.call(e,a,b,c,d);return e}return new this(a,b,c,d)}function Ce(a){a instanceof this?void 0:l("223");a.destructor();10>this.eventPool.length&&
+this.eventPool.push(a)}function Rc(a){a.eventPool=[];a.getPooled=Be;a.release=Ce}function Sc(a,b){switch(a){case "topKeyUp":return-1!==De.indexOf(b.keyCode);case "topKeyDown":return 229!==b.keyCode;case "topKeyPress":case "topMouseDown":case "topBlur":return!0;default:return!1}}function Tc(a){a=a.detail;return"object"===typeof a&&"data"in a?a.data:null}function Ee(a,b){switch(a){case "topCompositionEnd":return Tc(b);case "topKeyPress":if(32!==b.which)return null;Uc=!0;return Vc;case "topTextInput":return a=
+b.data,a===Vc&&Uc?null:a;default:return null}}function Fe(a,b){if(za)return"topCompositionEnd"===a||!Lb&&Sc(a,b)?(a=Pc(),H._root=null,H._startText=null,H._fallbackText=null,za=!1,a):null;switch(a){case "topPaste":return null;case "topKeyPress":if(!(b.ctrlKey||b.altKey||b.metaKey)||b.ctrlKey&&b.altKey){if(b.char&&1<b.char.length)return b.char;if(b.which)return String.fromCharCode(b.which)}return null;case "topCompositionEnd":return Wc?null:b.data;default:return null}}function Xc(a){if(a=Yc(a)){cb&&
+"function"===typeof cb.restoreControlledState?void 0:l("194");var b=Hb(a.stateNode);cb.restoreControlledState(a.stateNode,a.type,b)}}function Zc(a){sa?ja?ja.push(a):ja=[a]:sa=a}function $c(){return null!==sa||null!==ja}function ad(){if(sa){var a=sa,b=ja;ja=sa=null;Xc(a);if(b)for(a=0;a<b.length;a++)Xc(b[a])}}function bd(a,b){if(Mb)return a(b);Mb=!0;try{return cd(a,b)}finally{Mb=!1,$c()&&(dd(),ad())}}function ed(a){var b=a&&a.nodeName&&a.nodeName.toLowerCase();return"input"===b?!!Ge[a.type]:"textarea"===
+b?!0:!1}function Nb(a){a=a.target||window;a.correspondingUseElement&&(a=a.correspondingUseElement);return 3===a.nodeType?a.parentNode:a}function Ob(a,b){if(!T.canUseDOM||b&&!("addEventListener"in document))return!1;a="on"+a;b=a in document;b||(b=document.createElement("div"),b.setAttribute(a,"return;"),b="function"===typeof b[a]);return b}function fd(a){var b=a.type;return(a=a.nodeName)&&"input"===a.toLowerCase()&&("checkbox"===b||"radio"===b)}function He(a){var b=fd(a)?"checked":"value",c=Object.getOwnPropertyDescriptor(a.constructor.prototype,
+b),d=""+a[b];if(!a.hasOwnProperty(b)&&"function"===typeof c.get&&"function"===typeof c.set)return Object.defineProperty(a,b,{configurable:!0,get:function(){return c.get.call(this)},set:function(a){d=""+a;c.set.call(this,a)}}),Object.defineProperty(a,b,{enumerable:c.enumerable}),{getValue:function(){return d},setValue:function(a){d=""+a},stopTracking:function(){a._valueTracker=null;delete a[b]}}}function db(a){a._valueTracker||(a._valueTracker=He(a))}function gd(a){if(!a)return!1;var b=a._valueTracker;
+if(!b)return!0;var c=b.getValue();var d="";a&&(d=fd(a)?a.checked?"true":"false":a.value);a=d;return a!==c?(b.setValue(a),!0):!1}function Da(a){if(null===a||"undefined"===typeof a)return null;a=hd&&a[hd]||a["@@iterator"];return"function"===typeof a?a:null}function Ha(a){a=a.type;if("function"===typeof a)return a.displayName||a.name;if("string"===typeof a)return a;switch(a){case ka:return"ReactFragment";case U:return"ReactPortal";case id:return"ReactCall";case jd:return"ReactReturn"}return null}function Pb(a){var b=
+"";do{a:switch(a.tag){case 0:case 1:case 2:case 5:var c=a._debugOwner,d=a._debugSource;var e=Ha(a);var f=null;c&&(f=Ha(c));c=d;e="\n    in "+(e||"Unknown")+(c?" (at "+c.fileName.replace(/^.*[\\\/]/,"")+":"+c.lineNumber+")":f?" (created by "+f+")":"");break a;default:e=""}b+=e;a=a["return"]}while(a);return b}function Ie(a){if(kd.hasOwnProperty(a))return!0;if(ld.hasOwnProperty(a))return!1;if(Je.test(a))return kd[a]=!0;ld[a]=!0;return!1}function Ke(a,b,c,d){if(null!==c&&0===c.type)return!1;switch(typeof b){case "function":case "symbol":return!0;
+case "boolean":if(d)return!1;if(null!==c)return!c.acceptsBooleans;a=a.toLowerCase().slice(0,5);return"data-"!==a&&"aria-"!==a;default:return!1}}function Le(a,b,c,d){if(null===b||"undefined"===typeof b||Ke(a,b,c,d))return!0;if(null!==c)switch(c.type){case 3:return!b;case 4:return!1===b;case 5:return isNaN(b);case 6:return isNaN(b)||1>b}return!1}function J(a,b,c,d,e){this.acceptsBooleans=2===b||3===b||4===b;this.attributeName=d;this.attributeNamespace=e;this.mustUseProperty=c;this.propertyName=a;this.type=
+b}function Qb(a,b,c,d){var e=F.hasOwnProperty(b)?F[b]:null;var f=null!==e?0===e.type:d?!1:!(2<b.length)||"o"!==b[0]&&"O"!==b[0]||"n"!==b[1]&&"N"!==b[1]?!1:!0;f||(Le(b,c,e,d)&&(c=null),d||null===e?Ie(b)&&(null===c?a.removeAttribute(b):a.setAttribute(b,""+c)):e.mustUseProperty?a[e.propertyName]=null===c?3===e.type?!1:"":c:(b=e.attributeName,d=e.attributeNamespace,null===c?a.removeAttribute(b):(e=e.type,c=3===e||4===e&&!0===c?"":""+c,d?a.setAttributeNS(d,b,c):a.setAttribute(b,c))))}function Rb(a,b){var c=
+b.checked;return E({},b,{defaultChecked:void 0,defaultValue:void 0,value:void 0,checked:null!=c?c:a._wrapperState.initialChecked})}function md(a,b){var c=null==b.defaultValue?"":b.defaultValue,d=null!=b.checked?b.checked:b.defaultChecked;c=Sb(null!=b.value?b.value:c);a._wrapperState={initialChecked:d,initialValue:c,controlled:"checkbox"===b.type||"radio"===b.type?null!=b.checked:null!=b.value}}function nd(a,b){b=b.checked;null!=b&&Qb(a,"checked",b,!1)}function Tb(a,b){nd(a,b);var c=Sb(b.value);if(null!=
+c)if("number"===b.type){if(0===c&&""===a.value||a.value!=c)a.value=""+c}else a.value!==""+c&&(a.value=""+c);b.hasOwnProperty("value")?Ub(a,b.type,c):b.hasOwnProperty("defaultValue")&&Ub(a,b.type,Sb(b.defaultValue));null==b.checked&&null!=b.defaultChecked&&(a.defaultChecked=!!b.defaultChecked)}function od(a,b){if(b.hasOwnProperty("value")||b.hasOwnProperty("defaultValue"))""===a.value&&(a.value=""+a._wrapperState.initialValue),a.defaultValue=""+a._wrapperState.initialValue;b=a.name;""!==b&&(a.name=
+"");a.defaultChecked=!a.defaultChecked;a.defaultChecked=!a.defaultChecked;""!==b&&(a.name=b)}function Ub(a,b,c){if("number"!==b||a.ownerDocument.activeElement!==a)null==c?a.defaultValue=""+a._wrapperState.initialValue:a.defaultValue!==""+c&&(a.defaultValue=""+c)}function Sb(a){switch(typeof a){case "boolean":case "number":case "object":case "string":case "undefined":return a;default:return""}}function pd(a,b,c){a=I.getPooled(qd.change,a,b,c);a.type="change";Zc(c);ia(a);return a}function Me(a){Ib(a,
+!1)}function eb(a){var b=ya(a);if(gd(b))return a}function Ne(a,b){if("topChange"===a)return b}function rd(){Ia&&(Ia.detachEvent("onpropertychange",sd),Ja=Ia=null)}function sd(a){"value"===a.propertyName&&eb(Ja)&&(a=pd(Ja,a,Nb(a)),bd(Me,a))}function Oe(a,b,c){"topFocus"===a?(rd(),Ia=b,Ja=c,Ia.attachEvent("onpropertychange",sd)):"topBlur"===a&&rd()}function Pe(a,b){if("topSelectionChange"===a||"topKeyUp"===a||"topKeyDown"===a)return eb(Ja)}function Qe(a,b){if("topClick"===a)return eb(b)}function Re(a,
+b){if("topInput"===a||"topChange"===a)return eb(b)}function Se(a){var b=this.nativeEvent;return b.getModifierState?b.getModifierState(a):(a=Te[a])?!!b[a]:!1}function Vb(a){return Se}function td(a,b){return a===b?0!==a||0!==b||1/a===1/b:a!==a&&b!==b}function Ka(a){var b=a;if(a.alternate)for(;b["return"];)b=b["return"];else{if(0!==(b.effectTag&2))return 1;for(;b["return"];)if(b=b["return"],0!==(b.effectTag&2))return 1}return 3===b.tag?2:3}function Ue(a){return(a=a._reactInternalFiber)?2===Ka(a):!1}
+function ud(a){2!==Ka(a)?l("188"):void 0}function vd(a){var b=a.alternate;if(!b)return b=Ka(a),3===b?l("188"):void 0,1===b?null:a;for(var c=a,d=b;;){var e=c["return"],f=e?e.alternate:null;if(!e||!f)break;if(e.child===f.child){for(var g=e.child;g;){if(g===c)return ud(e),a;if(g===d)return ud(e),b;g=g.sibling}l("188")}if(c["return"]!==d["return"])c=e,d=f;else{g=!1;for(var h=e.child;h;){if(h===c){g=!0;c=e;d=f;break}if(h===d){g=!0;d=e;c=f;break}h=h.sibling}if(!g){for(h=f.child;h;){if(h===c){g=!0;c=f;d=
+e;break}if(h===d){g=!0;d=f;c=e;break}h=h.sibling}g?void 0:l("189")}}c.alternate!==d?l("190"):void 0}3!==c.tag?l("188"):void 0;return c.stateNode.current===c?a:b}function Ve(a){a=vd(a);if(!a)return null;for(var b=a;;){if(5===b.tag||6===b.tag)return b;if(b.child)b.child["return"]=b,b=b.child;else{if(b===a)break;for(;!b.sibling;){if(!b["return"]||b["return"]===a)return null;b=b["return"]}b.sibling["return"]=b["return"];b=b.sibling}}return null}function We(a){a=vd(a);if(!a)return null;for(var b=a;;){if(5===
+b.tag||6===b.tag)return b;if(b.child&&4!==b.tag)b.child["return"]=b,b=b.child;else{if(b===a)break;for(;!b.sibling;){if(!b["return"]||b["return"]===a)return null;b=b["return"]}b.sibling["return"]=b["return"];b=b.sibling}}return null}function fb(a){var b=a.keyCode;"charCode"in a?(a=a.charCode,0===a&&13===b&&(a=13)):a=b;10===a&&(a=13);return 32<=a||13===a?a:0}function wd(a,b){var c=a[0].toUpperCase()+a.slice(1),d="on"+c;c="top"+c;b={phasedRegistrationNames:{bubbled:d,captured:d+"Capture"},dependencies:[c],
+isInteractive:b};xd[a]=b;Wb[c]=b}function Xe(a){var b=a.targetInst;do{if(!b){a.ancestors.push(b);break}var c;for(c=b;c["return"];)c=c["return"];c=3!==c.tag?null:c.stateNode.containerInfo;if(!c)break;a.ancestors.push(b);b=Ca(c)}while(b);for(c=0;c<a.ancestors.length;c++)b=a.ancestors[c],Jc(a.topLevelType,b,a.nativeEvent,Nb(a.nativeEvent))}function Xb(a){La=!!a}function z(a,b,c){if(!c)return null;a=(yd(a)?zd:gb).bind(null,a);c.addEventListener(b,a,!1)}function V(a,b,c){if(!c)return null;a=(yd(a)?zd:
+gb).bind(null,a);c.addEventListener(b,a,!0)}function zd(a,b){Ad(gb,a,b)}function gb(a,b){if(La){var c=Nb(b);c=Ca(c);null!==c&&"number"===typeof c.tag&&2!==Ka(c)&&(c=null);if(hb.length){var d=hb.pop();d.topLevelType=a;d.nativeEvent=b;d.targetInst=c;a=d}else a={topLevelType:a,nativeEvent:b,targetInst:c,ancestors:[]};try{bd(Xe,a)}finally{a.topLevelType=null,a.nativeEvent=null,a.targetInst=null,a.ancestors.length=0,10>hb.length&&hb.push(a)}}}function ib(a,b){var c={};c[a.toLowerCase()]=b.toLowerCase();
+c["Webkit"+a]="webkit"+b;c["Moz"+a]="moz"+b;c["ms"+a]="MS"+b;c["O"+a]="o"+b.toLowerCase();return c}function jb(a){if(Yb[a])return Yb[a];if(!la[a])return a;var b=la[a],c;for(c in b)if(b.hasOwnProperty(c)&&c in Bd)return Yb[a]=b[c];return a}function Cd(a){Object.prototype.hasOwnProperty.call(a,kb)||(a[kb]=Ye++,Dd[a[kb]]={});return Dd[a[kb]]}function Ed(a,b){return a&&b?a===b?!0:Fd(a)?!1:Fd(b)?Ed(a,b.parentNode):"contains"in a?a.contains(b):a.compareDocumentPosition?!!(a.compareDocumentPosition(b)&16):
+!1:!1}function Gd(a){for(;a&&a.firstChild;)a=a.firstChild;return a}function Hd(a,b){var c=Gd(a);a=0;for(var d;c;){if(3===c.nodeType){d=a+c.textContent.length;if(a<=b&&d>=b)return{node:c,offset:b-a};a=d}a:{for(;c;){if(c.nextSibling){c=c.nextSibling;break a}c=c.parentNode}c=void 0}c=Gd(c)}}function Zb(a){var b=a&&a.nodeName&&a.nodeName.toLowerCase();return b&&("input"===b&&"text"===a.type||"textarea"===b||"true"===a.contentEditable)}function Id(a,b){if($b||null==O||O!==ac())return null;var c=O;"selectionStart"in
+c&&Zb(c)?c={start:c.selectionStart,end:c.selectionEnd}:window.getSelection?(c=window.getSelection(),c={anchorNode:c.anchorNode,anchorOffset:c.anchorOffset,focusNode:c.focusNode,focusOffset:c.focusOffset}):c=void 0;return Ma&&bc(Ma,c)?null:(Ma=c,a=I.getPooled(Jd.select,cc,a,b),a.type="select",a.target=O,ia(a),a)}function Z(a,b,c,d){this.tag=a;this.key=c;this.stateNode=this.type=null;this.sibling=this.child=this["return"]=null;this.index=0;this.ref=null;this.pendingProps=b;this.memoizedState=this.updateQueue=
+this.memoizedProps=null;this.mode=d;this.effectTag=0;this.lastEffect=this.firstEffect=this.nextEffect=null;this.expirationTime=0;this.alternate=null}function lb(a,b,c){var d=a.alternate;null===d?(d=new Z(a.tag,b,a.key,a.mode),d.type=a.type,d.stateNode=a.stateNode,d.alternate=a,a.alternate=d):(d.pendingProps=b,d.effectTag=0,d.nextEffect=null,d.firstEffect=null,d.lastEffect=null);d.expirationTime=c;d.child=a.child;d.memoizedProps=a.memoizedProps;d.memoizedState=a.memoizedState;d.updateQueue=a.updateQueue;
+d.sibling=a.sibling;d.index=a.index;d.ref=a.ref;return d}function dc(a,b,c){var d=a.type,e=a.key;a=a.props;var f=void 0;if("function"===typeof d)f=d.prototype&&d.prototype.isReactComponent?2:0;else if("string"===typeof d)f=5;else switch(d){case ka:return mb(a.children,b,c,e);case Ze:f=11;b|=3;break;case $e:f=11;b|=2;break;case id:f=7;break;case jd:f=9;break;default:if("object"===typeof d&&null!==d)switch(d.$$typeof){case af:f=13;break;case bf:f=12;break;case cf:f=14;break;default:if("number"===typeof d.tag)return b=
+d,b.pendingProps=a,b.expirationTime=c,b;l("130",null==d?d:typeof d,"")}else l("130",null==d?d:typeof d,"")}b=new Z(f,a,e,b);b.type=d;b.expirationTime=c;return b}function mb(a,b,c,d){a=new Z(10,a,d,b);a.expirationTime=c;return a}function ec(a,b,c){a=new Z(6,a,null,b);a.expirationTime=c;return a}function fc(a,b,c){b=new Z(4,null!==a.children?a.children:[],a.key,b);b.expirationTime=c;b.stateNode={containerInfo:a.containerInfo,pendingChildren:null,implementation:a.implementation};return b}function Kd(a){return function(b){try{return a(b)}catch(c){}}}
+function df(a){if("undefined"===typeof __REACT_DEVTOOLS_GLOBAL_HOOK__)return!1;var b=__REACT_DEVTOOLS_GLOBAL_HOOK__;if(b.isDisabled||!b.supportsFiber)return!0;try{var c=b.inject(a);gc=Kd(function(a){return b.onCommitFiberRoot(c,a)});hc=Kd(function(a){return b.onCommitFiberUnmount(c,a)})}catch(d){}return!0}function Ld(a){"function"===typeof gc&&gc(a)}function Md(a){"function"===typeof hc&&hc(a)}function Nd(a){return{baseState:a,expirationTime:0,first:null,last:null,callbackList:null,hasForceUpdate:!1,
+isInitialized:!1,capturedValues:null}}function nb(a,b){null===a.last?a.first=a.last=b:(a.last.next=b,a.last=b);if(0===a.expirationTime||a.expirationTime>b.expirationTime)a.expirationTime=b.expirationTime}function ic(a){jc=kc=null;var b=a.alternate,c=a.updateQueue;null===c&&(c=a.updateQueue=Nd(null));null!==b?(a=b.updateQueue,null===a&&(a=b.updateQueue=Nd(null))):a=null;jc=c;kc=a!==c?a:null}function Na(a,b){ic(a);a=jc;var c=kc;null===c?nb(a,b):null===a.last||null===c.last?(nb(a,b),nb(c,b)):(nb(a,b),
+c.last=b)}function Od(a,b,c,d){a=a.partialState;return"function"===typeof a?a.call(b,c,d):a}function ob(a,b,c,d,e,f){null!==a&&a.updateQueue===c&&(c=b.updateQueue={baseState:c.baseState,expirationTime:c.expirationTime,first:c.first,last:c.last,isInitialized:c.isInitialized,capturedValues:c.capturedValues,callbackList:null,hasForceUpdate:!1});c.expirationTime=0;c.isInitialized?a=c.baseState:(a=c.baseState=b.memoizedState,c.isInitialized=!0);for(var g=!0,h=c.first,k=!1;null!==h;){var l=h.expirationTime;
+if(l>f){var m=c.expirationTime;if(0===m||m>l)c.expirationTime=l;k||(k=!0,c.baseState=a)}else{k||(c.first=h.next,null===c.first&&(c.last=null));if(h.isReplace)a=Od(h,d,a,e),g=!0;else if(l=Od(h,d,a,e))a=g?E({},a,l):E(a,l),g=!1;h.isForced&&(c.hasForceUpdate=!0);null!==h.callback&&(l=c.callbackList,null===l&&(l=c.callbackList=[]),l.push(h));null!==h.capturedValue&&(l=c.capturedValues,null===l?c.capturedValues=[h.capturedValue]:l.push(h.capturedValue))}h=h.next}null!==c.callbackList?b.effectTag|=32:null!==
+c.first||c.hasForceUpdate||null!==c.capturedValues||(b.updateQueue=null);k||(c.baseState=a);return a}function Pd(a,b){var c=a.callbackList;if(null!==c)for(a.callbackList=null,a=0;a<c.length;a++){var d=c[a],e=d.callback;d.callback=null;"function"!==typeof e?l("191",e):void 0;e.call(b)}}function Oa(a,b,c){a=c.ref;if(null!==a&&"function"!==typeof a&&"object"!==typeof a){if(c._owner){c=c._owner;var d=void 0;c&&(2!==c.tag?l("110"):void 0,d=c.stateNode);d?void 0:l("147",a);var e=""+a;if(null!==b&&null!==
+b.ref&&b.ref._stringRef===e)return b.ref;b=function(a){var b=d.refs===ma?d.refs={}:d.refs;null===a?delete b[e]:b[e]=a};b._stringRef=e;return b}"string"!==typeof a?l("148"):void 0;c._owner?void 0:l("254",a)}return a}function pb(a,b){"textarea"!==a.type&&l("31","[object Object]"===Object.prototype.toString.call(b)?"object with keys {"+Object.keys(b).join(", ")+"}":b,"")}function Qd(a){function b(b,c){if(a){var d=b.lastEffect;null!==d?(d.nextEffect=c,b.lastEffect=c):b.firstEffect=b.lastEffect=c;c.nextEffect=
+null;c.effectTag=8}}function c(c,d){if(!a)return null;for(;null!==d;)b(c,d),d=d.sibling;return null}function d(a,b){for(a=new Map;null!==b;)null!==b.key?a.set(b.key,b):a.set(b.index,b),b=b.sibling;return a}function e(a,b,c){a=lb(a,b,c);a.index=0;a.sibling=null;return a}function f(b,c,d){b.index=d;if(!a)return c;d=b.alternate;if(null!==d)return d=d.index,d<c?(b.effectTag=2,c):d;b.effectTag=2;return c}function g(b){a&&null===b.alternate&&(b.effectTag=2);return b}function h(a,b,c,d){if(null===b||6!==
+b.tag)return b=ec(c,a.mode,d),b["return"]=a,b;b=e(b,c,d);b["return"]=a;return b}function k(a,b,c,d){if(null!==b&&b.type===c.type)return d=e(b,c.props,d),d.ref=Oa(a,b,c),d["return"]=a,d;d=dc(c,a.mode,d);d.ref=Oa(a,b,c);d["return"]=a;return d}function C(a,b,c,d){if(null===b||4!==b.tag||b.stateNode.containerInfo!==c.containerInfo||b.stateNode.implementation!==c.implementation)return b=fc(c,a.mode,d),b["return"]=a,b;b=e(b,c.children||[],d);b["return"]=a;return b}function m(a,b,c,d,f){if(null===b||10!==
+b.tag)return b=mb(c,a.mode,d,f),b["return"]=a,b;b=e(b,c,d);b["return"]=a;return b}function w(a,b,c){if("string"===typeof b||"number"===typeof b)return b=ec(""+b,a.mode,c),b["return"]=a,b;if("object"===typeof b&&null!==b){switch(b.$$typeof){case qb:return c=dc(b,a.mode,c),c.ref=Oa(a,null,b),c["return"]=a,c;case U:return b=fc(b,a.mode,c),b["return"]=a,b}if(rb(b)||Da(b))return b=mb(b,a.mode,c,null),b["return"]=a,b;pb(a,b)}return null}function p(a,b,c,d){var e=null!==b?b.key:null;if("string"===typeof c||
+"number"===typeof c)return null!==e?null:h(a,b,""+c,d);if("object"===typeof c&&null!==c){switch(c.$$typeof){case qb:return c.key===e?c.type===ka?m(a,b,c.props.children,d,e):k(a,b,c,d):null;case U:return c.key===e?C(a,b,c,d):null}if(rb(c)||Da(c))return null!==e?null:m(a,b,c,d,null);pb(a,c)}return null}function G(a,b,c,d,e){if("string"===typeof d||"number"===typeof d)return a=a.get(c)||null,h(b,a,""+d,e);if("object"===typeof d&&null!==d){switch(d.$$typeof){case qb:return a=a.get(null===d.key?c:d.key)||
+null,d.type===ka?m(b,a,d.props.children,e,d.key):k(b,a,d,e);case U:return a=a.get(null===d.key?c:d.key)||null,C(b,a,d,e)}if(rb(d)||Da(d))return a=a.get(c)||null,m(b,a,d,e,null);pb(b,d)}return null}function v(e,h,m,B){for(var x=null,g=null,q=h,r=h=0,u=null;null!==q&&r<m.length;r++){q.index>r?(u=q,q=null):u=q.sibling;var n=p(e,q,m[r],B);if(null===n){null===q&&(q=u);break}a&&q&&null===n.alternate&&b(e,q);h=f(n,h,r);null===g?x=n:g.sibling=n;g=n;q=u}if(r===m.length)return c(e,q),x;if(null===q){for(;r<
+m.length;r++)if(q=w(e,m[r],B))h=f(q,h,r),null===g?x=q:g.sibling=q,g=q;return x}for(q=d(e,q);r<m.length;r++)if(u=G(q,e,r,m[r],B)){if(a&&null!==u.alternate)q["delete"](null===u.key?r:u.key);h=f(u,h,r);null===g?x=u:g.sibling=u;g=u}a&&q.forEach(function(a){return b(e,a)});return x}function B(e,h,m,B){var g=Da(m);"function"!==typeof g?l("150"):void 0;m=g.call(m);null==m?l("151"):void 0;for(var x=g=null,q=h,r=h=0,u=null,n=m.next();null!==q&&!n.done;r++,n=m.next()){q.index>r?(u=q,q=null):u=q.sibling;var k=
+p(e,q,n.value,B);if(null===k){q||(q=u);break}a&&q&&null===k.alternate&&b(e,q);h=f(k,h,r);null===x?g=k:x.sibling=k;x=k;q=u}if(n.done)return c(e,q),g;if(null===q){for(;!n.done;r++,n=m.next())n=w(e,n.value,B),null!==n&&(h=f(n,h,r),null===x?g=n:x.sibling=n,x=n);return g}for(q=d(e,q);!n.done;r++,n=m.next())if(n=G(q,e,r,n.value,B),null!==n){if(a&&null!==n.alternate)q["delete"](null===n.key?r:n.key);h=f(n,h,r);null===x?g=n:x.sibling=n;x=n}a&&q.forEach(function(a){return b(e,a)});return g}return function(a,
+d,f,h){"object"===typeof f&&null!==f&&f.type===ka&&null===f.key&&(f=f.props.children);var m="object"===typeof f&&null!==f;if(m)switch(f.$$typeof){case qb:a:{var x=f.key;for(m=d;null!==m;){if(m.key===x)if(10===m.tag?f.type===ka:m.type===f.type){c(a,m.sibling);d=e(m,f.type===ka?f.props.children:f.props,h);d.ref=Oa(a,m,f);d["return"]=a;a=d;break a}else{c(a,m);break}else b(a,m);m=m.sibling}f.type===ka?(d=mb(f.props.children,a.mode,h,f.key),d["return"]=a,a=d):(h=dc(f,a.mode,h),h.ref=Oa(a,d,f),h["return"]=
+a,a=h)}return g(a);case U:a:{for(m=f.key;null!==d;){if(d.key===m)if(4===d.tag&&d.stateNode.containerInfo===f.containerInfo&&d.stateNode.implementation===f.implementation){c(a,d.sibling);d=e(d,f.children||[],h);d["return"]=a;a=d;break a}else{c(a,d);break}else b(a,d);d=d.sibling}d=fc(f,a.mode,h);d["return"]=a;a=d}return g(a)}if("string"===typeof f||"number"===typeof f)return f=""+f,null!==d&&6===d.tag?(c(a,d.sibling),d=e(d,f,h)):(c(a,d),d=ec(f,a.mode,h)),d["return"]=a,a=d,g(a);if(rb(f))return v(a,d,
+f,h);if(Da(f))return B(a,d,f,h);m&&pb(a,f);if("undefined"===typeof f)switch(a.tag){case 2:case 1:h=a.type,l("152",h.displayName||h.name||"Component")}return c(a,d)}}function Rd(a,b){var c=b.source;null===b.stack&&Pb(c);null!==c&&Ha(c);b=b.value;null!==a&&2===a.tag&&Ha(a);try{b&&b.suppressReactErrorLogging||console.error(b)}catch(d){d&&d.suppressReactErrorLogging||console.error(d)}}function ff(a,b,c){var d=3<arguments.length&&void 0!==arguments[3]?arguments[3]:null;return{$$typeof:U,key:null==d?null:
+""+d,children:a,containerInfo:b,implementation:c}}function gf(a){var b="";qa.Children.forEach(a,function(a){null==a||"string"!==typeof a&&"number"!==typeof a||(b+=a)});return b}function lc(a,b){a=E({children:void 0},b);if(b=gf(b.children))a.children=b;return a}function aa(a,b,c,d){a=a.options;if(b){b={};for(var e=0;e<c.length;e++)b["$"+c[e]]=!0;for(c=0;c<a.length;c++)e=b.hasOwnProperty("$"+a[c].value),a[c].selected!==e&&(a[c].selected=e),e&&d&&(a[c].defaultSelected=!0)}else{c=""+c;b=null;for(e=0;e<
+a.length;e++){if(a[e].value===c){a[e].selected=!0;d&&(a[e].defaultSelected=!0);return}null!==b||a[e].disabled||(b=a[e])}null!==b&&(b.selected=!0)}}function Sd(a,b){var c=b.value;a._wrapperState={initialValue:null!=c?c:b.defaultValue,wasMultiple:!!b.multiple}}function mc(a,b){null!=b.dangerouslySetInnerHTML?l("91"):void 0;return E({},b,{value:void 0,defaultValue:void 0,children:""+a._wrapperState.initialValue})}function Td(a,b){var c=b.value;null==c&&(c=b.defaultValue,b=b.children,null!=b&&(null!=
+c?l("92"):void 0,Array.isArray(b)&&(1>=b.length?void 0:l("93"),b=b[0]),c=""+b),null==c&&(c=""));a._wrapperState={initialValue:""+c}}function Ud(a,b){var c=b.value;null!=c&&(c=""+c,c!==a.value&&(a.value=c),null==b.defaultValue&&(a.defaultValue=c));null!=b.defaultValue&&(a.defaultValue=b.defaultValue)}function Vd(a){switch(a){case "svg":return"http://www.w3.org/2000/svg";case "math":return"http://www.w3.org/1998/Math/MathML";default:return"http://www.w3.org/1999/xhtml"}}function nc(a,b){return null==
+a||"http://www.w3.org/1999/xhtml"===a?Vd(b):"http://www.w3.org/2000/svg"===a&&"foreignObject"===b?"http://www.w3.org/1999/xhtml":a}function Wd(a,b,c){a=a.style;for(var d in b)if(b.hasOwnProperty(d)){c=0===d.indexOf("--");var e=d;var f=b[d];e=null==f||"boolean"===typeof f||""===f?"":c||"number"!==typeof f||0===f||Pa.hasOwnProperty(e)&&Pa[e]?(""+f).trim():f+"px";"float"===d&&(d="cssFloat");c?a.setProperty(d,e):a[d]=e}}function oc(a,b,c){b&&(hf[a]&&(null!=b.children||null!=b.dangerouslySetInnerHTML?
+l("137",a,c()):void 0),null!=b.dangerouslySetInnerHTML&&(null!=b.children?l("60"):void 0,"object"===typeof b.dangerouslySetInnerHTML&&"__html"in b.dangerouslySetInnerHTML?void 0:l("61")),null!=b.style&&"object"!==typeof b.style?l("62",c()):void 0)}function pc(a,b){if(-1===a.indexOf("-"))return"string"===typeof b.is;switch(a){case "annotation-xml":case "color-profile":case "font-face":case "font-face-src":case "font-face-uri":case "font-face-format":case "font-face-name":case "missing-glyph":return!1;
+default:return!0}}function ba(a,b){a=9===a.nodeType||11===a.nodeType?a:a.ownerDocument;var c=Cd(a);b=ab[b];for(var d=0;d<b.length;d++){var e=b[d];c.hasOwnProperty(e)&&c[e]||("topScroll"===e?V("topScroll","scroll",a):"topFocus"===e||"topBlur"===e?(V("topFocus","focus",a),V("topBlur","blur",a),c.topBlur=!0,c.topFocus=!0):"topCancel"===e?(Ob("cancel",!0)&&V("topCancel","cancel",a),c.topCancel=!0):"topClose"===e?(Ob("close",!0)&&V("topClose","close",a),c.topClose=!0):Xd.hasOwnProperty(e)&&z(e,Xd[e],a),
+c[e]=!0)}}function Yd(a,b,c,d){c=9===c.nodeType?c:c.ownerDocument;"http://www.w3.org/1999/xhtml"===d&&(d=Vd(a));"http://www.w3.org/1999/xhtml"===d?"script"===a?(a=c.createElement("div"),a.innerHTML="\x3cscript\x3e\x3c/script\x3e",a=a.removeChild(a.firstChild)):a="string"===typeof b.is?c.createElement(a,{is:b.is}):c.createElement(a):a=c.createElementNS(d,a);return a}function Zd(a,b){return(9===b.nodeType?b:b.ownerDocument).createTextNode(a)}function $d(a,b,c,d){var e=pc(b,c);switch(b){case "iframe":case "object":z("topLoad",
+"load",a);var f=c;break;case "video":case "audio":for(f in na)na.hasOwnProperty(f)&&z(f,na[f],a);f=c;break;case "source":z("topError","error",a);f=c;break;case "img":case "image":case "link":z("topError","error",a);z("topLoad","load",a);f=c;break;case "form":z("topReset","reset",a);z("topSubmit","submit",a);f=c;break;case "details":z("topToggle","toggle",a);f=c;break;case "input":md(a,c);f=Rb(a,c);z("topInvalid","invalid",a);ba(d,"onChange");break;case "option":f=lc(a,c);break;case "select":Sd(a,
+c);f=E({},c,{value:void 0});z("topInvalid","invalid",a);ba(d,"onChange");break;case "textarea":Td(a,c);f=mc(a,c);z("topInvalid","invalid",a);ba(d,"onChange");break;default:f=c}oc(b,f,Qa);var g=f,h;for(h in g)if(g.hasOwnProperty(h)){var k=g[h];"style"===h?Wd(a,k,Qa):"dangerouslySetInnerHTML"===h?(k=k?k.__html:void 0,null!=k&&ae(a,k)):"children"===h?"string"===typeof k?("textarea"!==b||""!==k)&&sb(a,k):"number"===typeof k&&sb(a,""+k):"suppressContentEditableWarning"!==h&&"suppressHydrationWarning"!==
+h&&"autoFocus"!==h&&(ra.hasOwnProperty(h)?null!=k&&ba(d,h):null!=k&&Qb(a,h,k,e))}switch(b){case "input":db(a);od(a,c);break;case "textarea":db(a);c=a.textContent;c===a._wrapperState.initialValue&&(a.value=c);break;case "option":null!=c.value&&a.setAttribute("value",c.value);break;case "select":a.multiple=!!c.multiple;b=c.value;null!=b?aa(a,!!c.multiple,b,!1):null!=c.defaultValue&&aa(a,!!c.multiple,c.defaultValue,!0);break;default:"function"===typeof f.onClick&&(a.onclick=M)}}function be(a,b,c,d,e){var f=
+null;switch(b){case "input":c=Rb(a,c);d=Rb(a,d);f=[];break;case "option":c=lc(a,c);d=lc(a,d);f=[];break;case "select":c=E({},c,{value:void 0});d=E({},d,{value:void 0});f=[];break;case "textarea":c=mc(a,c);d=mc(a,d);f=[];break;default:"function"!==typeof c.onClick&&"function"===typeof d.onClick&&(a.onclick=M)}oc(b,d,Qa);b=a=void 0;var g=null;for(a in c)if(!d.hasOwnProperty(a)&&c.hasOwnProperty(a)&&null!=c[a])if("style"===a){var h=c[a];for(b in h)h.hasOwnProperty(b)&&(g||(g={}),g[b]="")}else"dangerouslySetInnerHTML"!==
+a&&"children"!==a&&"suppressContentEditableWarning"!==a&&"suppressHydrationWarning"!==a&&"autoFocus"!==a&&(ra.hasOwnProperty(a)?f||(f=[]):(f=f||[]).push(a,null));for(a in d){var k=d[a];h=null!=c?c[a]:void 0;if(d.hasOwnProperty(a)&&k!==h&&(null!=k||null!=h))if("style"===a)if(h){for(b in h)!h.hasOwnProperty(b)||k&&k.hasOwnProperty(b)||(g||(g={}),g[b]="");for(b in k)k.hasOwnProperty(b)&&h[b]!==k[b]&&(g||(g={}),g[b]=k[b])}else g||(f||(f=[]),f.push(a,g)),g=k;else"dangerouslySetInnerHTML"===a?(k=k?k.__html:
+void 0,h=h?h.__html:void 0,null!=k&&h!==k&&(f=f||[]).push(a,""+k)):"children"===a?h===k||"string"!==typeof k&&"number"!==typeof k||(f=f||[]).push(a,""+k):"suppressContentEditableWarning"!==a&&"suppressHydrationWarning"!==a&&(ra.hasOwnProperty(a)?(null!=k&&ba(e,a),f||h===k||(f=[])):(f=f||[]).push(a,k))}g&&(f=f||[]).push("style",g);return f}function ce(a,b,c,d,e){"input"===c&&"radio"===e.type&&null!=e.name&&nd(a,e);pc(c,d);d=pc(c,e);for(var f=0;f<b.length;f+=2){var g=b[f],h=b[f+1];"style"===g?Wd(a,
+h,Qa):"dangerouslySetInnerHTML"===g?ae(a,h):"children"===g?sb(a,h):Qb(a,g,h,d)}switch(c){case "input":Tb(a,e);break;case "textarea":Ud(a,e);break;case "select":a._wrapperState.initialValue=void 0,b=a._wrapperState.wasMultiple,a._wrapperState.wasMultiple=!!e.multiple,c=e.value,null!=c?aa(a,!!e.multiple,c,!1):b!==!!e.multiple&&(null!=e.defaultValue?aa(a,!!e.multiple,e.defaultValue,!0):aa(a,!!e.multiple,e.multiple?[]:"",!1))}}function de(a,b,c,d,e){switch(b){case "iframe":case "object":z("topLoad","load",
+a);break;case "video":case "audio":for(var f in na)na.hasOwnProperty(f)&&z(f,na[f],a);break;case "source":z("topError","error",a);break;case "img":case "image":case "link":z("topError","error",a);z("topLoad","load",a);break;case "form":z("topReset","reset",a);z("topSubmit","submit",a);break;case "details":z("topToggle","toggle",a);break;case "input":md(a,c);z("topInvalid","invalid",a);ba(e,"onChange");break;case "select":Sd(a,c);z("topInvalid","invalid",a);ba(e,"onChange");break;case "textarea":Td(a,
+c),z("topInvalid","invalid",a),ba(e,"onChange")}oc(b,c,Qa);d=null;for(var g in c)c.hasOwnProperty(g)&&(f=c[g],"children"===g?"string"===typeof f?a.textContent!==f&&(d=["children",f]):"number"===typeof f&&a.textContent!==""+f&&(d=["children",""+f]):ra.hasOwnProperty(g)&&null!=f&&ba(e,g));switch(b){case "input":db(a);od(a,c);break;case "textarea":db(a);b=a.textContent;b===a._wrapperState.initialValue&&(a.value=b);break;case "select":case "option":break;default:"function"===typeof c.onClick&&(a.onclick=
+M)}return d}function ee(a,b){return a.nodeValue!==b}function Ra(a){this._expirationTime=A.computeUniqueAsyncExpiration();this._root=a;this._callbacks=this._next=null;this._hasChildren=this._didComplete=!1;this._children=null;this._defer=!0}function ca(){this._callbacks=null;this._didCommit=!1;this._onCommit=this._onCommit.bind(this)}function P(a,b,c){this._internalRoot=A.createContainer(a,b,c)}function qc(a){return!(!a||1!==a.nodeType&&9!==a.nodeType&&11!==a.nodeType&&(8!==a.nodeType||" react-mount-point-unstable "!==
+a.nodeValue))}function fe(a,b){switch(a){case "button":case "input":case "select":case "textarea":return!!b.autoFocus}return!1}function jf(a,b){b||(b=a?9===a.nodeType?a.documentElement:a.firstChild:null,b=!(!b||1!==b.nodeType||!b.hasAttribute("data-reactroot")));if(!b)for(var c;c=a.lastChild;)a.removeChild(c);return new P(a,!1,b)}function tb(a,b,c,d,e){qc(c)?void 0:l("200");var f=c._reactRootContainer;if(f){if("function"===typeof e){var g=e;e=function(){var a=A.getPublicRootInstance(f._internalRoot);
+g.call(a)}}null!=a?f.legacy_renderSubtreeIntoContainer(a,b,e):f.render(b,e)}else{f=c._reactRootContainer=jf(c,d);if("function"===typeof e){var h=e;e=function(){var a=A.getPublicRootInstance(f._internalRoot);h.call(a)}}A.unbatchedUpdates(function(){null!=a?f.legacy_renderSubtreeIntoContainer(a,b,e):f.render(b,e)})}return A.getPublicRootInstance(f._internalRoot)}function ge(a,b){var c=2<arguments.length&&void 0!==arguments[2]?arguments[2]:null;qc(b)?void 0:l("200");return ff(a,b,null,c)}qa?void 0:l("227");
+var kf=function(a,b,c,d,e,f,g,h,k){this._hasCaughtError=!1;this._caughtError=null;var l=Array.prototype.slice.call(arguments,3);try{b.apply(c,l)}catch(m){this._caughtError=m,this._hasCaughtError=!0}},y={_caughtError:null,_hasCaughtError:!1,_rethrowError:null,_hasRethrowError:!1,invokeGuardedCallback:function(a,b,c,d,e,f,g,h,l){kf.apply(y,arguments)},invokeGuardedCallbackAndCatchFirstError:function(a,b,c,d,e,f,g,h,l){y.invokeGuardedCallback.apply(this,arguments);if(y.hasCaughtError()){var k=y.clearCaughtError();
+y._hasRethrowError||(y._hasRethrowError=!0,y._rethrowError=k)}},rethrowCaughtError:function(){return lf.apply(y,arguments)},hasCaughtError:function(){return y._hasCaughtError},clearCaughtError:function(){if(y._hasCaughtError){var a=y._caughtError;y._caughtError=null;y._hasCaughtError=!1;return a}l("198")}},lf=function(){if(y._hasRethrowError){var a=y._rethrowError;y._rethrowError=null;y._hasRethrowError=!1;throw a;}},$a=null,wa={},ea=[],Fb={},ra={},ab={},mf=Object.freeze({plugins:ea,eventNameDispatchConfigs:Fb,
+registrationNameModules:ra,registrationNameDependencies:ab,possibleRegistrationNames:null,injectEventPluginOrder:Fc,injectEventPluginsByName:Gc}),ta=function(){};ta.thatReturns=bb;ta.thatReturnsFalse=bb(!1);ta.thatReturnsTrue=bb(!0);ta.thatReturnsNull=bb(null);ta.thatReturnsThis=function(){return this};ta.thatReturnsArgument=function(a){return a};var M=ta,Hb=null,Yc=null,Ic=null,fa=null,he=function(a,b){if(a){var c=a._dispatchListeners,d=a._dispatchInstances;if(Array.isArray(c))for(var e=0;e<c.length&&
+!a.isPropagationStopped();e++)Hc(a,b,c[e],d[e]);else c&&Hc(a,b,c,d);a._dispatchListeners=null;a._dispatchInstances=null;a.isPersistent()||a.constructor.release(a)}},we=function(a){return he(a,!0)},xe=function(a){return he(a,!1)},rc={injectEventPluginOrder:Fc,injectEventPluginsByName:Gc},nf=Object.freeze({injection:rc,getListener:Gb,runEventsInBatch:Ib,runExtractedEventsInBatch:Jc}),ie=Math.random().toString(36).slice(2),R="__reactInternalInstance$"+ie,ha="__reactEventHandlers$"+ie,je=Object.freeze({precacheFiberNode:function(a,
+b){b[R]=a},getClosestInstanceFromNode:Ca,getInstanceFromNode:function(a){a=a[R];return!a||5!==a.tag&&6!==a.tag?null:a},getNodeFromInstance:ya,getFiberCurrentPropsFromNode:Kc,updateFiberProps:function(a,b){a[ha]=b}}),of=Object.freeze({accumulateTwoPhaseDispatches:ia,accumulateTwoPhaseDispatchesSkipTarget:function(a){Y(a,ze)},accumulateEnterLeaveDispatches:Nc,accumulateDirectDispatches:function(a){Y(a,Ae)}}),ub=!("undefined"===typeof window||!window.document||!window.document.createElement),T={canUseDOM:ub,
+canUseWorkers:"undefined"!==typeof Worker,canUseEventListeners:ub&&!(!window.addEventListener&&!window.attachEvent),canUseViewport:ub&&!!window.screen,isInWorker:!ub},Kb=null,H={_root:null,_startText:null,_fallbackText:null},E=qa.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.assign,ke="dispatchConfig _targetInst nativeEvent isDefaultPrevented isPropagationStopped _dispatchListeners _dispatchInstances".split(" "),pf={type:null,target:null,currentTarget:M.thatReturnsNull,eventPhase:null,bubbles:null,
+cancelable:null,timeStamp:function(a){return a.timeStamp||Date.now()},defaultPrevented:null,isTrusted:null};E(I.prototype,{preventDefault:function(){this.defaultPrevented=!0;var a=this.nativeEvent;a&&(a.preventDefault?a.preventDefault():"unknown"!==typeof a.returnValue&&(a.returnValue=!1),this.isDefaultPrevented=M.thatReturnsTrue)},stopPropagation:function(){var a=this.nativeEvent;a&&(a.stopPropagation?a.stopPropagation():"unknown"!==typeof a.cancelBubble&&(a.cancelBubble=!0),this.isPropagationStopped=
+M.thatReturnsTrue)},persist:function(){this.isPersistent=M.thatReturnsTrue},isPersistent:M.thatReturnsFalse,destructor:function(){var a=this.constructor.Interface,b;for(b in a)this[b]=null;for(a=0;a<ke.length;a++)this[ke[a]]=null}});I.Interface=pf;I.extend=function(a){function b(){return c.apply(this,arguments)}var c=this,d=function(){};d.prototype=c.prototype;d=new d;E(d,b.prototype);b.prototype=d;b.prototype.constructor=b;b.Interface=E({},c.Interface,a);b.extend=c.extend;Rc(b);return b};Rc(I);var qf=
+I.extend({data:null}),rf=I.extend({data:null}),De=[9,13,27,32],Lb=T.canUseDOM&&"CompositionEvent"in window,Sa=null;T.canUseDOM&&"documentMode"in document&&(Sa=document.documentMode);var sf=T.canUseDOM&&"TextEvent"in window&&!Sa,Wc=T.canUseDOM&&(!Lb||Sa&&8<Sa&&11>=Sa),Vc=String.fromCharCode(32),W={beforeInput:{phasedRegistrationNames:{bubbled:"onBeforeInput",captured:"onBeforeInputCapture"},dependencies:["topCompositionEnd","topKeyPress","topTextInput","topPaste"]},compositionEnd:{phasedRegistrationNames:{bubbled:"onCompositionEnd",
+captured:"onCompositionEndCapture"},dependencies:"topBlur topCompositionEnd topKeyDown topKeyPress topKeyUp topMouseDown".split(" ")},compositionStart:{phasedRegistrationNames:{bubbled:"onCompositionStart",captured:"onCompositionStartCapture"},dependencies:"topBlur topCompositionStart topKeyDown topKeyPress topKeyUp topMouseDown".split(" ")},compositionUpdate:{phasedRegistrationNames:{bubbled:"onCompositionUpdate",captured:"onCompositionUpdateCapture"},dependencies:"topBlur topCompositionUpdate topKeyDown topKeyPress topKeyUp topMouseDown".split(" ")}},
+Uc=!1,za=!1,tf={eventTypes:W,extractEvents:function(a,b,c,d){var e=void 0;var f=void 0;if(Lb)b:{switch(a){case "topCompositionStart":e=W.compositionStart;break b;case "topCompositionEnd":e=W.compositionEnd;break b;case "topCompositionUpdate":e=W.compositionUpdate;break b}e=void 0}else za?Sc(a,c)&&(e=W.compositionEnd):"topKeyDown"===a&&229===c.keyCode&&(e=W.compositionStart);e?(Wc&&(za||e!==W.compositionStart?e===W.compositionEnd&&za&&(f=Pc()):(H._root=d,H._startText=Qc(),za=!0)),e=qf.getPooled(e,
+b,c,d),f?e.data=f:(f=Tc(c),null!==f&&(e.data=f)),ia(e),f=e):f=null;(a=sf?Ee(a,c):Fe(a,c))?(b=rf.getPooled(W.beforeInput,b,c,d),b.data=a,ia(b)):b=null;return null===f?b:null===b?f:[f,b]}},cb=null,sa=null,ja=null,le={injectFiberControlledHostComponent:function(a){cb=a}},uf=Object.freeze({injection:le,enqueueStateRestore:Zc,needsStateRestore:$c,restoreStateIfNeeded:ad}),cd=function(a,b){return a(b)},Ad=function(a,b,c){return a(b,c)},dd=function(){},Mb=!1,Ge={color:!0,date:!0,datetime:!0,"datetime-local":!0,
+email:!0,month:!0,number:!0,password:!0,range:!0,search:!0,tel:!0,text:!0,time:!0,url:!0,week:!0},sc=qa.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner,Q="function"===typeof Symbol&&Symbol["for"],qb=Q?Symbol["for"]("react.element"):60103,id=Q?Symbol["for"]("react.call"):60104,jd=Q?Symbol["for"]("react.return"):60105,U=Q?Symbol["for"]("react.portal"):60106,ka=Q?Symbol["for"]("react.fragment"):60107,$e=Q?Symbol["for"]("react.strict_mode"):60108,af=Q?Symbol["for"]("react.provider"):
+60109,bf=Q?Symbol["for"]("react.context"):60110,Ze=Q?Symbol["for"]("react.async_mode"):60111,cf=Q?Symbol["for"]("react.forward_ref"):60112,hd="function"===typeof Symbol&&Symbol.iterator,Je=/^[:A-Z_a-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD][:A-Z_a-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD\-.0-9\u00B7\u0300-\u036F\u203F-\u2040]*$/,
+ld={},kd={},F={};"children dangerouslySetInnerHTML defaultValue defaultChecked innerHTML suppressContentEditableWarning suppressHydrationWarning style".split(" ").forEach(function(a){F[a]=new J(a,0,!1,a,null)});[["acceptCharset","accept-charset"],["className","class"],["htmlFor","for"],["httpEquiv","http-equiv"]].forEach(function(a){var b=a[0];F[b]=new J(b,1,!1,a[1],null)});["contentEditable","draggable","spellCheck","value"].forEach(function(a){F[a]=new J(a,2,!1,a.toLowerCase(),null)});["autoReverse",
+"externalResourcesRequired","preserveAlpha"].forEach(function(a){F[a]=new J(a,2,!1,a,null)});"allowFullScreen async autoFocus autoPlay controls default defer disabled formNoValidate hidden loop noModule noValidate open playsInline readOnly required reversed scoped seamless itemScope".split(" ").forEach(function(a){F[a]=new J(a,3,!1,a.toLowerCase(),null)});["checked","multiple","muted","selected"].forEach(function(a){F[a]=new J(a,3,!0,a.toLowerCase(),null)});["capture","download"].forEach(function(a){F[a]=
+new J(a,4,!1,a.toLowerCase(),null)});["cols","rows","size","span"].forEach(function(a){F[a]=new J(a,6,!1,a.toLowerCase(),null)});["rowSpan","start"].forEach(function(a){F[a]=new J(a,5,!1,a.toLowerCase(),null)});var tc=/[\-\:]([a-z])/g,uc=function(a){return a[1].toUpperCase()};"accent-height alignment-baseline arabic-form baseline-shift cap-height clip-path clip-rule color-interpolation color-interpolation-filters color-profile color-rendering dominant-baseline enable-background fill-opacity fill-rule flood-color flood-opacity font-family font-size font-size-adjust font-stretch font-style font-variant font-weight glyph-name glyph-orientation-horizontal glyph-orientation-vertical horiz-adv-x horiz-origin-x image-rendering letter-spacing lighting-color marker-end marker-mid marker-start overline-position overline-thickness paint-order panose-1 pointer-events rendering-intent shape-rendering stop-color stop-opacity strikethrough-position strikethrough-thickness stroke-dasharray stroke-dashoffset stroke-linecap stroke-linejoin stroke-miterlimit stroke-opacity stroke-width text-anchor text-decoration text-rendering underline-position underline-thickness unicode-bidi unicode-range units-per-em v-alphabetic v-hanging v-ideographic v-mathematical vector-effect vert-adv-y vert-origin-x vert-origin-y word-spacing writing-mode xmlns:xlink x-height".split(" ").forEach(function(a){var b=
+a.replace(tc,uc);F[b]=new J(b,1,!1,a,null)});"xlink:actuate xlink:arcrole xlink:href xlink:role xlink:show xlink:title xlink:type".split(" ").forEach(function(a){var b=a.replace(tc,uc);F[b]=new J(b,1,!1,a,"http://www.w3.org/1999/xlink")});["xml:base","xml:lang","xml:space"].forEach(function(a){var b=a.replace(tc,uc);F[b]=new J(b,1,!1,a,"http://www.w3.org/XML/1998/namespace")});F.tabIndex=new J("tabIndex",1,!1,"tabindex",null);var qd={change:{phasedRegistrationNames:{bubbled:"onChange",captured:"onChangeCapture"},
+dependencies:"topBlur topChange topClick topFocus topInput topKeyDown topKeyUp topSelectionChange".split(" ")}},Ia=null,Ja=null,vc=!1;T.canUseDOM&&(vc=Ob("input")&&(!document.documentMode||9<document.documentMode));var vf={eventTypes:qd,_isInputEventSupported:vc,extractEvents:function(a,b,c,d){var e=b?ya(b):window,f=void 0,g=void 0,h=e.nodeName&&e.nodeName.toLowerCase();"select"===h||"input"===h&&"file"===e.type?f=Ne:ed(e)?vc?f=Re:(f=Pe,g=Oe):(h=e.nodeName,!h||"input"!==h.toLowerCase()||"checkbox"!==
+e.type&&"radio"!==e.type||(f=Qe));if(f&&(f=f(a,b)))return pd(f,c,d);g&&g(a,e,b);"topBlur"===a&&null!=b&&(a=b._wrapperState||e._wrapperState)&&a.controlled&&"number"===e.type&&Ub(e,"number",e.value)}},Ta=I.extend({view:null,detail:null}),Te={Alt:"altKey",Control:"ctrlKey",Meta:"metaKey",Shift:"shiftKey"},Ua=Ta.extend({screenX:null,screenY:null,clientX:null,clientY:null,pageX:null,pageY:null,ctrlKey:null,shiftKey:null,altKey:null,metaKey:null,getModifierState:Vb,button:null,buttons:null,relatedTarget:function(a){return a.relatedTarget||
+(a.fromElement===a.srcElement?a.toElement:a.fromElement)}}),wc={mouseEnter:{registrationName:"onMouseEnter",dependencies:["topMouseOut","topMouseOver"]},mouseLeave:{registrationName:"onMouseLeave",dependencies:["topMouseOut","topMouseOver"]}},wf={eventTypes:wc,extractEvents:function(a,b,c,d){if("topMouseOver"===a&&(c.relatedTarget||c.fromElement)||"topMouseOut"!==a&&"topMouseOver"!==a)return null;var e=d.window===d?d:(e=d.ownerDocument)?e.defaultView||e.parentWindow:window;"topMouseOut"===a?(a=b,
+b=(b=c.relatedTarget||c.toElement)?Ca(b):null):a=null;if(a===b)return null;var f=null==a?e:ya(a);e=null==b?e:ya(b);var g=Ua.getPooled(wc.mouseLeave,a,c,d);g.type="mouseleave";g.target=f;g.relatedTarget=e;c=Ua.getPooled(wc.mouseEnter,b,c,d);c.type="mouseenter";c.target=e;c.relatedTarget=f;Nc(g,c,a,b);return[g,c]}},ac=function(a){a=a||("undefined"!==typeof document?document:void 0);if("undefined"===typeof a)return null;try{return a.activeElement||a.body}catch(b){return a.body}},xf=Object.prototype.hasOwnProperty,
+bc=function(a,b){if(td(a,b))return!0;if("object"!==typeof a||null===a||"object"!==typeof b||null===b)return!1;var c=Object.keys(a),d=Object.keys(b);if(c.length!==d.length)return!1;for(d=0;d<c.length;d++)if(!xf.call(b,c[d])||!td(a[c[d]],b[c[d]]))return!1;return!0},yf=I.extend({animationName:null,elapsedTime:null,pseudoElement:null}),zf=I.extend({clipboardData:function(a){return"clipboardData"in a?a.clipboardData:window.clipboardData}}),Af=Ta.extend({relatedTarget:null}),Bf={Esc:"Escape",Spacebar:" ",
+Left:"ArrowLeft",Up:"ArrowUp",Right:"ArrowRight",Down:"ArrowDown",Del:"Delete",Win:"OS",Menu:"ContextMenu",Apps:"ContextMenu",Scroll:"ScrollLock",MozPrintableKey:"Unidentified"},Cf={8:"Backspace",9:"Tab",12:"Clear",13:"Enter",16:"Shift",17:"Control",18:"Alt",19:"Pause",20:"CapsLock",27:"Escape",32:" ",33:"PageUp",34:"PageDown",35:"End",36:"Home",37:"ArrowLeft",38:"ArrowUp",39:"ArrowRight",40:"ArrowDown",45:"Insert",46:"Delete",112:"F1",113:"F2",114:"F3",115:"F4",116:"F5",117:"F6",118:"F7",119:"F8",
+120:"F9",121:"F10",122:"F11",123:"F12",144:"NumLock",145:"ScrollLock",224:"Meta"},Df=Ta.extend({key:function(a){if(a.key){var b=Bf[a.key]||a.key;if("Unidentified"!==b)return b}return"keypress"===a.type?(a=fb(a),13===a?"Enter":String.fromCharCode(a)):"keydown"===a.type||"keyup"===a.type?Cf[a.keyCode]||"Unidentified":""},location:null,ctrlKey:null,shiftKey:null,altKey:null,metaKey:null,repeat:null,locale:null,getModifierState:Vb,charCode:function(a){return"keypress"===a.type?fb(a):0},keyCode:function(a){return"keydown"===
+a.type||"keyup"===a.type?a.keyCode:0},which:function(a){return"keypress"===a.type?fb(a):"keydown"===a.type||"keyup"===a.type?a.keyCode:0}}),Ef=Ua.extend({dataTransfer:null}),Ff=Ta.extend({touches:null,targetTouches:null,changedTouches:null,altKey:null,metaKey:null,ctrlKey:null,shiftKey:null,getModifierState:Vb}),Gf=I.extend({propertyName:null,elapsedTime:null,pseudoElement:null}),Hf=Ua.extend({deltaX:function(a){return"deltaX"in a?a.deltaX:"wheelDeltaX"in a?-a.wheelDeltaX:0},deltaY:function(a){return"deltaY"in
+a?a.deltaY:"wheelDeltaY"in a?-a.wheelDeltaY:"wheelDelta"in a?-a.wheelDelta:0},deltaZ:null,deltaMode:null}),xd={},Wb={};"blur cancel click close contextMenu copy cut doubleClick dragEnd dragStart drop focus input invalid keyDown keyPress keyUp mouseDown mouseUp paste pause play rateChange reset seeked submit touchCancel touchEnd touchStart volumeChange".split(" ").forEach(function(a){wd(a,!0)});"abort animationEnd animationIteration animationStart canPlay canPlayThrough drag dragEnter dragExit dragLeave dragOver durationChange emptied encrypted ended error load loadedData loadedMetadata loadStart mouseMove mouseOut mouseOver playing progress scroll seeking stalled suspend timeUpdate toggle touchMove transitionEnd waiting wheel".split(" ").forEach(function(a){wd(a,
+!1)});var me={eventTypes:xd,isInteractiveTopLevelEventType:function(a){a=Wb[a];return void 0!==a&&!0===a.isInteractive},extractEvents:function(a,b,c,d){var e=Wb[a];if(!e)return null;switch(a){case "topKeyPress":if(0===fb(c))return null;case "topKeyDown":case "topKeyUp":a=Df;break;case "topBlur":case "topFocus":a=Af;break;case "topClick":if(2===c.button)return null;case "topDoubleClick":case "topMouseDown":case "topMouseMove":case "topMouseUp":case "topMouseOut":case "topMouseOver":case "topContextMenu":a=
+Ua;break;case "topDrag":case "topDragEnd":case "topDragEnter":case "topDragExit":case "topDragLeave":case "topDragOver":case "topDragStart":case "topDrop":a=Ef;break;case "topTouchCancel":case "topTouchEnd":case "topTouchMove":case "topTouchStart":a=Ff;break;case "topAnimationEnd":case "topAnimationIteration":case "topAnimationStart":a=yf;break;case "topTransitionEnd":a=Gf;break;case "topScroll":a=Ta;break;case "topWheel":a=Hf;break;case "topCopy":case "topCut":case "topPaste":a=zf;break;default:a=
+I}b=a.getPooled(e,b,c,d);ia(b);return b}},yd=me.isInteractiveTopLevelEventType,hb=[],La=!0,If=Object.freeze({get _enabled(){return La},setEnabled:Xb,isEnabled:function(){return La},trapBubbledEvent:z,trapCapturedEvent:V,dispatchEvent:gb}),la={animationend:ib("Animation","AnimationEnd"),animationiteration:ib("Animation","AnimationIteration"),animationstart:ib("Animation","AnimationStart"),transitionend:ib("Transition","TransitionEnd")},Yb={},Bd={};T.canUseDOM&&(Bd=document.createElement("div").style,
+"AnimationEvent"in window||(delete la.animationend.animation,delete la.animationiteration.animation,delete la.animationstart.animation),"TransitionEvent"in window||delete la.transitionend.transition);var Xd={topAnimationEnd:jb("animationend"),topAnimationIteration:jb("animationiteration"),topAnimationStart:jb("animationstart"),topBlur:"blur",topCancel:"cancel",topChange:"change",topClick:"click",topClose:"close",topCompositionEnd:"compositionend",topCompositionStart:"compositionstart",topCompositionUpdate:"compositionupdate",
+topContextMenu:"contextmenu",topCopy:"copy",topCut:"cut",topDoubleClick:"dblclick",topDrag:"drag",topDragEnd:"dragend",topDragEnter:"dragenter",topDragExit:"dragexit",topDragLeave:"dragleave",topDragOver:"dragover",topDragStart:"dragstart",topDrop:"drop",topFocus:"focus",topInput:"input",topKeyDown:"keydown",topKeyPress:"keypress",topKeyUp:"keyup",topLoad:"load",topLoadStart:"loadstart",topMouseDown:"mousedown",topMouseMove:"mousemove",topMouseOut:"mouseout",topMouseOver:"mouseover",topMouseUp:"mouseup",
+topPaste:"paste",topScroll:"scroll",topSelectionChange:"selectionchange",topTextInput:"textInput",topToggle:"toggle",topTouchCancel:"touchcancel",topTouchEnd:"touchend",topTouchMove:"touchmove",topTouchStart:"touchstart",topTransitionEnd:jb("transitionend"),topWheel:"wheel"},na={topAbort:"abort",topCanPlay:"canplay",topCanPlayThrough:"canplaythrough",topDurationChange:"durationchange",topEmptied:"emptied",topEncrypted:"encrypted",topEnded:"ended",topError:"error",topLoadedData:"loadeddata",topLoadedMetadata:"loadedmetadata",
+topLoadStart:"loadstart",topPause:"pause",topPlay:"play",topPlaying:"playing",topProgress:"progress",topRateChange:"ratechange",topSeeked:"seeked",topSeeking:"seeking",topStalled:"stalled",topSuspend:"suspend",topTimeUpdate:"timeupdate",topVolumeChange:"volumechange",topWaiting:"waiting"},Dd={},Ye=0,kb="_reactListenersID"+(""+Math.random()).slice(2),Fd=function(a){var b=(a?a.ownerDocument||a:document).defaultView||window;return!!(a&&("function"===typeof b.Node?a instanceof b.Node:"object"===typeof a&&
+"number"===typeof a.nodeType&&"string"===typeof a.nodeName))&&3==a.nodeType},Jf=T.canUseDOM&&"documentMode"in document&&11>=document.documentMode,Jd={select:{phasedRegistrationNames:{bubbled:"onSelect",captured:"onSelectCapture"},dependencies:"topBlur topContextMenu topFocus topKeyDown topKeyUp topMouseDown topMouseUp topSelectionChange".split(" ")}},O=null,cc=null,Ma=null,$b=!1,Kf={eventTypes:Jd,extractEvents:function(a,b,c,d){var e=d.window===d?d.document:9===d.nodeType?d:d.ownerDocument,f;if(!(f=
+!e)){a:{e=Cd(e);f=ab.onSelect;for(var g=0;g<f.length;g++){var h=f[g];if(!e.hasOwnProperty(h)||!e[h]){e=!1;break a}}e=!0}f=!e}if(f)return null;e=b?ya(b):window;switch(a){case "topFocus":if(ed(e)||"true"===e.contentEditable)O=e,cc=b,Ma=null;break;case "topBlur":Ma=cc=O=null;break;case "topMouseDown":$b=!0;break;case "topContextMenu":case "topMouseUp":return $b=!1,Id(c,d);case "topSelectionChange":if(Jf)break;case "topKeyDown":case "topKeyUp":return Id(c,d)}return null}};rc.injectEventPluginOrder("ResponderEventPlugin SimpleEventPlugin TapEventPlugin EnterLeaveEventPlugin ChangeEventPlugin SelectEventPlugin BeforeInputEventPlugin".split(" "));
+(function(a){Hb=a.getFiberCurrentPropsFromNode;Yc=a.getInstanceFromNode;Ic=a.getNodeFromInstance})(je);rc.injectEventPluginsByName({SimpleEventPlugin:me,EnterLeaveEventPlugin:wf,ChangeEventPlugin:vf,SelectEventPlugin:Kf,BeforeInputEventPlugin:tf});var ma={},gc=null,hc=null;new Set;var jc=void 0,kc=void 0,Lf=function(a,b,c,d,e){function f(a,b,c,d,e,f){if(null===b||null!==a.updateQueue&&a.updateQueue.hasForceUpdate)return!0;var h=a.stateNode;a=a.type;return"function"===typeof h.shouldComponentUpdate?
+h.shouldComponentUpdate(c,e,f):a.prototype&&a.prototype.isPureReactComponent?!bc(b,c)||!bc(d,e):!0}function g(a,b){b.updater=v;a.stateNode=b;b._reactInternalFiber=a}function h(a,b,c,d){a=b.state;"function"===typeof b.componentWillReceiveProps&&b.componentWillReceiveProps(c,d);"function"===typeof b.UNSAFE_componentWillReceiveProps&&b.UNSAFE_componentWillReceiveProps(c,d);b.state!==a&&v.enqueueReplaceState(b,b.state,null)}function l(a,b,c,d){a=a.type;if("function"===typeof a.getDerivedStateFromProps)return a.getDerivedStateFromProps.call(null,
+c,d)}var C=a.cacheContext,m=a.getMaskedContext,w=a.getUnmaskedContext,p=a.isContextConsumer,G=a.hasContextChanged,v={isMounted:Ue,enqueueSetState:function(a,d,e){a=a._reactInternalFiber;e=void 0===e?null:e;var f=c(a);Na(a,{expirationTime:f,partialState:d,callback:e,isReplace:!1,isForced:!1,capturedValue:null,next:null});b(a,f)},enqueueReplaceState:function(a,d,e){a=a._reactInternalFiber;e=void 0===e?null:e;var f=c(a);Na(a,{expirationTime:f,partialState:d,callback:e,isReplace:!0,isForced:!1,capturedValue:null,
+next:null});b(a,f)},enqueueForceUpdate:function(a,d){a=a._reactInternalFiber;d=void 0===d?null:d;var e=c(a);Na(a,{expirationTime:e,partialState:null,callback:d,isReplace:!1,isForced:!0,capturedValue:null,next:null});b(a,e)}};return{adoptClassInstance:g,callGetDerivedStateFromProps:l,constructClassInstance:function(a,b){var c=a.type,d=w(a),e=p(a),f=e?m(a,d):ma;c=new c(b,f);var h=null!==c.state&&void 0!==c.state?c.state:null;g(a,c);a.memoizedState=h;b=l(a,c,b,h);null!==b&&void 0!==b&&(a.memoizedState=
+E({},a.memoizedState,b));e&&C(a,d,f);return c},mountClassInstance:function(a,b){var c=a.type,d=a.alternate,e=a.stateNode,f=a.pendingProps,h=w(a);e.props=f;e.state=a.memoizedState;e.refs=ma;e.context=m(a,h);"function"===typeof c.getDerivedStateFromProps||"function"===typeof e.getSnapshotBeforeUpdate||"function"!==typeof e.UNSAFE_componentWillMount&&"function"!==typeof e.componentWillMount||(c=e.state,"function"===typeof e.componentWillMount&&e.componentWillMount(),"function"===typeof e.UNSAFE_componentWillMount&&
+e.UNSAFE_componentWillMount(),c!==e.state&&v.enqueueReplaceState(e,e.state,null),c=a.updateQueue,null!==c&&(e.state=ob(d,a,c,e,f,b)));"function"===typeof e.componentDidMount&&(a.effectTag|=4)},resumeMountClassInstance:function(a,b){var c=a.type,g=a.stateNode;g.props=a.memoizedProps;g.state=a.memoizedState;var k=a.memoizedProps,v=a.pendingProps,p=g.context,x=w(a);x=m(a,x);(c="function"===typeof c.getDerivedStateFromProps||"function"===typeof g.getSnapshotBeforeUpdate)||"function"!==typeof g.UNSAFE_componentWillReceiveProps&&
+"function"!==typeof g.componentWillReceiveProps||(k!==v||p!==x)&&h(a,g,v,x);p=a.memoizedState;b=null!==a.updateQueue?ob(null,a,a.updateQueue,g,v,b):p;var r=void 0;k!==v&&(r=l(a,g,v,b));null!==r&&void 0!==r&&(b=null===b||void 0===b?r:E({},b,r));if(!(k!==v||p!==b||G()||null!==a.updateQueue&&a.updateQueue.hasForceUpdate))return"function"===typeof g.componentDidMount&&(a.effectTag|=4),!1;(k=f(a,k,v,p,b,x))?(c||"function"!==typeof g.UNSAFE_componentWillMount&&"function"!==typeof g.componentWillMount||
+("function"===typeof g.componentWillMount&&g.componentWillMount(),"function"===typeof g.UNSAFE_componentWillMount&&g.UNSAFE_componentWillMount()),"function"===typeof g.componentDidMount&&(a.effectTag|=4)):("function"===typeof g.componentDidMount&&(a.effectTag|=4),d(a,v),e(a,b));g.props=v;g.state=b;g.context=x;return k},updateClassInstance:function(a,b,c){var g=b.type,k=b.stateNode;k.props=b.memoizedProps;k.state=b.memoizedState;var v=b.memoizedProps,p=b.pendingProps,B=k.context,r=w(b);r=m(b,r);(g=
+"function"===typeof g.getDerivedStateFromProps||"function"===typeof k.getSnapshotBeforeUpdate)||"function"!==typeof k.UNSAFE_componentWillReceiveProps&&"function"!==typeof k.componentWillReceiveProps||(v!==p||B!==r)&&h(b,k,p,r);B=b.memoizedState;c=null!==b.updateQueue?ob(a,b,b.updateQueue,k,p,c):B;var u=void 0;v!==p&&(u=l(b,k,p,c));null!==u&&void 0!==u&&(c=null===c||void 0===c?u:E({},c,u));if(!(v!==p||B!==c||G()||null!==b.updateQueue&&b.updateQueue.hasForceUpdate))return"function"!==typeof k.componentDidUpdate||
+v===a.memoizedProps&&B===a.memoizedState||(b.effectTag|=4),"function"!==typeof k.getSnapshotBeforeUpdate||v===a.memoizedProps&&B===a.memoizedState||(b.effectTag|=2048),!1;(u=f(b,v,p,B,c,r))?(g||"function"!==typeof k.UNSAFE_componentWillUpdate&&"function"!==typeof k.componentWillUpdate||("function"===typeof k.componentWillUpdate&&k.componentWillUpdate(p,c,r),"function"===typeof k.UNSAFE_componentWillUpdate&&k.UNSAFE_componentWillUpdate(p,c,r)),"function"===typeof k.componentDidUpdate&&(b.effectTag|=
+4),"function"===typeof k.getSnapshotBeforeUpdate&&(b.effectTag|=2048)):("function"!==typeof k.componentDidUpdate||v===a.memoizedProps&&B===a.memoizedState||(b.effectTag|=4),"function"!==typeof k.getSnapshotBeforeUpdate||v===a.memoizedProps&&B===a.memoizedState||(b.effectTag|=2048),d(b,p),e(b,c));k.props=p;k.state=c;k.context=r;return u}}},rb=Array.isArray,vb=Qd(!0),xc=Qd(!1),Of=function(a,b,c,d,e,f,g){function h(a,b,c){k(a,b,c,b.expirationTime)}function k(a,b,c,d){b.child=null===a?xc(b,null,c,d):
+vb(b,a.child,c,d)}function C(a,b){var c=b.ref;if(null===a&&null!==c||null!==a&&a.ref!==c)b.effectTag|=128}function m(a,b,c,d,e,f){C(a,b);if(!c&&!e)return d&&n(b,!1),v(a,b);c=b.stateNode;sc.current=b;var h=e?null:c.render();b.effectTag|=1;e&&(k(a,b,null,f),b.child=null);k(a,b,h,f);b.memoizedState=c.state;b.memoizedProps=c.props;d&&n(b,!0);return b.child}function w(a){var b=a.stateNode;b.pendingContext?u(a,b.pendingContext,b.pendingContext!==b.context):b.context&&u(a,b.context,!1);z(a,b.containerInfo)}
+function p(a,b,c,d){var e=a.child;for(null!==e&&(e["return"]=a);null!==e;){switch(e.tag){case 12:var f=e.stateNode|0;if(e.type===b&&0!==(f&c)){for(f=e;null!==f;){var h=f.alternate;if(0===f.expirationTime||f.expirationTime>d)f.expirationTime=d,null!==h&&(0===h.expirationTime||h.expirationTime>d)&&(h.expirationTime=d);else if(null!==h&&(0===h.expirationTime||h.expirationTime>d))h.expirationTime=d;else break;f=f["return"]}f=null}else f=e.child;break;case 13:f=e.type===a.type?null:e.child;break;default:f=
+e.child}if(null!==f)f["return"]=e;else for(f=e;null!==f;){if(f===a){f=null;break}e=f.sibling;if(null!==e){f=e;break}f=f["return"]}e=f}}function G(a,b,c){var d=b.type.context,e=b.pendingProps,f=b.memoizedProps;if(!Aa()&&f===e)return b.stateNode=0,y(b),v(a,b);var m=e.value;b.memoizedProps=e;if(null===f)m=1073741823;else if(f.value===e.value){if(f.children===e.children)return b.stateNode=0,y(b),v(a,b);m=0}else{var g=f.value;if(g===m&&(0!==g||1/g===1/m)||g!==g&&m!==m){if(f.children===e.children)return b.stateNode=
+0,y(b),v(a,b);m=0}else if(m="function"===typeof d._calculateChangedBits?d._calculateChangedBits(g,m):1073741823,m|=0,0===m){if(f.children===e.children)return b.stateNode=0,y(b),v(a,b)}else p(b,d,m,c)}b.stateNode=m;y(b);h(a,b,e.children);return b.child}function v(a,b){null!==a&&b.child!==a.child?l("153"):void 0;if(null!==b.child){a=b.child;var c=lb(a,a.pendingProps,a.expirationTime);b.child=c;for(c["return"]=b;null!==a.sibling;)a=a.sibling,c=c.sibling=lb(a,a.pendingProps,a.expirationTime),c["return"]=
+b;c.sibling=null}return b.child}var B=a.shouldSetTextContent,x=a.shouldDeprioritizeSubtree,q=b.pushHostContext,z=b.pushHostContainer,y=d.pushProvider,A=c.getMaskedContext,F=c.getUnmaskedContext,Aa=c.hasContextChanged,r=c.pushContextProvider,u=c.pushTopLevelContextObject,n=c.invalidateContextProvider,ef=e.enterHydrationState,D=e.resetHydrationState,ne=e.tryToClaimNextHydratableInstance;a=Lf(c,f,g,function(a,b){a.memoizedProps=b},function(a,b){a.memoizedState=b});var Mf=a.adoptClassInstance,Nf=a.callGetDerivedStateFromProps,
+H=a.constructClassInstance,oe=a.mountClassInstance,I=a.resumeMountClassInstance,J=a.updateClassInstance;return{beginWork:function(a,b,c){if(0===b.expirationTime||b.expirationTime>c){switch(b.tag){case 3:w(b);break;case 2:r(b);break;case 4:z(b,b.stateNode.containerInfo);break;case 13:y(b)}return null}switch(b.tag){case 0:null!==a?l("155"):void 0;var d=b.type,e=b.pendingProps,f=F(b);f=A(b,f);d=d(e,f);b.effectTag|=1;"object"===typeof d&&null!==d&&"function"===typeof d.render&&void 0===d.$$typeof?(f=
+b.type,b.tag=2,b.memoizedState=null!==d.state&&void 0!==d.state?d.state:null,"function"===typeof f.getDerivedStateFromProps&&(e=Nf(b,d,e,b.memoizedState),null!==e&&void 0!==e&&(b.memoizedState=E({},b.memoizedState,e))),e=r(b),Mf(b,d),oe(b,c),a=m(a,b,!0,e,!1,c)):(b.tag=1,h(a,b,d),b.memoizedProps=e,a=b.child);return a;case 1:return e=b.type,c=b.pendingProps,Aa()||b.memoizedProps!==c?(d=F(b),d=A(b,d),e=e(c,d),b.effectTag|=1,h(a,b,e),b.memoizedProps=c,a=b.child):a=v(a,b),a;case 2:e=r(b);null===a?null===
+b.stateNode?(H(b,b.pendingProps),oe(b,c),d=!0):d=I(b,c):d=J(a,b,c);f=!1;var g=b.updateQueue;null!==g&&null!==g.capturedValues&&(f=d=!0);return m(a,b,d,e,f,c);case 3:a:if(w(b),d=b.updateQueue,null!==d){f=b.memoizedState;e=ob(a,b,d,null,null,c);b.memoizedState=e;d=b.updateQueue;if(null!==d&&null!==d.capturedValues)d=null;else if(f===e){D();a=v(a,b);break a}else d=e.element;f=b.stateNode;(null===a||null===a.child)&&f.hydrate&&ef(b)?(b.effectTag|=2,b.child=xc(b,null,d,c)):(D(),h(a,b,d));b.memoizedState=
+e;a=b.child}else D(),a=v(a,b);return a;case 5:a:{q(b);null===a&&ne(b);e=b.type;g=b.memoizedProps;d=b.pendingProps;f=null!==a?a.memoizedProps:null;if(!Aa()&&g===d){if(g=b.mode&1&&x(e,d))b.expirationTime=1073741823;if(!g||1073741823!==c){a=v(a,b);break a}}g=d.children;B(e,d)?g=null:f&&B(e,f)&&(b.effectTag|=16);C(a,b);1073741823!==c&&b.mode&1&&x(e,d)?(b.expirationTime=1073741823,b.memoizedProps=d,a=null):(h(a,b,g),b.memoizedProps=d,a=b.child)}return a;case 6:return null===a&&ne(b),b.memoizedProps=b.pendingProps,
+null;case 8:b.tag=7;case 7:return e=b.pendingProps,Aa()||b.memoizedProps!==e||(e=b.memoizedProps),d=e.children,b.stateNode=null===a?xc(b,b.stateNode,d,c):vb(b,a.stateNode,d,c),b.memoizedProps=e,b.stateNode;case 9:return null;case 4:return z(b,b.stateNode.containerInfo),e=b.pendingProps,Aa()||b.memoizedProps!==e?(null===a?b.child=vb(b,null,e,c):h(a,b,e),b.memoizedProps=e,a=b.child):a=v(a,b),a;case 14:return c=b.type.render,c=c(b.pendingProps,b.ref),h(a,b,c),b.memoizedProps=c,b.child;case 10:return c=
+b.pendingProps,Aa()||b.memoizedProps!==c?(h(a,b,c),b.memoizedProps=c,a=b.child):a=v(a,b),a;case 11:return c=b.pendingProps.children,Aa()||null!==c&&b.memoizedProps!==c?(h(a,b,c),b.memoizedProps=c,a=b.child):a=v(a,b),a;case 13:return G(a,b,c);case 12:d=b.type;f=b.pendingProps;var n=b.memoizedProps;e=d._currentValue;g=d._changedBits;if(Aa()||0!==g||n!==f){b.memoizedProps=f;n=f.unstable_observedBits;if(void 0===n||null===n)n=1073741823;b.stateNode=n;0!==(g&n)&&p(b,d,g,c);c=f.children;c=c(e);h(a,b,c);
+a=b.child}else a=v(a,b);return a;default:l("156")}}}},Pf=function(a,b,c,d,e){function f(a){a.effectTag|=4}var g=a.createInstance,h=a.createTextInstance,k=a.appendInitialChild,C=a.finalizeInitialChildren,m=a.prepareUpdate,w=a.persistence,p=b.getRootHostContainer,G=b.popHostContext,v=b.getHostContext,B=b.popHostContainer,x=c.popContextProvider,q=c.popTopLevelContextObject,z=d.popProvider,y=e.prepareToHydrateHostInstance,A=e.prepareToHydrateHostTextInstance,F=e.popHydrationState,E=void 0,r=void 0,u=
+void 0;a.mutation?(E=function(a){},r=function(a,b,c,d,e,h,m,g){(b.updateQueue=c)&&f(b)},u=function(a,b,c,d){c!==d&&f(b)}):w?l("235"):l("236");return{completeWork:function(a,b,c){var d=b.pendingProps;switch(b.tag){case 1:return null;case 2:return x(b),a=b.stateNode,d=b.updateQueue,null!==d&&null!==d.capturedValues&&(b.effectTag&=-65,"function"===typeof a.componentDidCatch?b.effectTag|=256:d.capturedValues=null),null;case 3:B(b);q(b);d=b.stateNode;d.pendingContext&&(d.context=d.pendingContext,d.pendingContext=
+null);if(null===a||null===a.child)F(b),b.effectTag&=-3;E(b);a=b.updateQueue;null!==a&&null!==a.capturedValues&&(b.effectTag|=256);return null;case 5:G(b);c=p();var e=b.type;if(null!==a&&null!=b.stateNode){var n=a.memoizedProps,w=b.stateNode,D=v();w=m(w,e,n,d,c,D);r(a,b,w,e,n,d,c,D);a.ref!==b.ref&&(b.effectTag|=128)}else{if(!d)return null===b.stateNode?l("166"):void 0,null;a=v();if(F(b))y(b,c,a)&&f(b);else{n=g(e,d,c,a,b);a:for(D=b.child;null!==D;){if(5===D.tag||6===D.tag)k(n,D.stateNode);else if(4!==
+D.tag&&null!==D.child){D.child["return"]=D;D=D.child;continue}if(D===b)break;for(;null===D.sibling;){if(null===D["return"]||D["return"]===b)break a;D=D["return"]}D.sibling["return"]=D["return"];D=D.sibling}C(n,e,d,c,a)&&f(b);b.stateNode=n}null!==b.ref&&(b.effectTag|=128)}return null;case 6:if(a&&null!=b.stateNode)u(a,b,a.memoizedProps,d);else{if("string"!==typeof d)return null===b.stateNode?l("166"):void 0,null;a=p();c=v();F(b)?A(b)&&f(b):b.stateNode=h(d,a,c,b)}return null;case 7:(d=b.memoizedProps)?
+void 0:l("165");b.tag=8;e=[];a:for((n=b.stateNode)&&(n["return"]=b);null!==n;){if(5===n.tag||6===n.tag||4===n.tag)l("247");else if(9===n.tag)e.push(n.pendingProps.value);else if(null!==n.child){n.child["return"]=n;n=n.child;continue}for(;null===n.sibling;){if(null===n["return"]||n["return"]===b)break a;n=n["return"]}n.sibling["return"]=n["return"];n=n.sibling}n=d.handler;d=n(d.props,e);b.child=vb(b,null!==a?a.child:null,d,c);return b.child;case 8:return b.tag=7,null;case 9:return null;case 14:return null;
+case 10:return null;case 11:return null;case 4:return B(b),E(b),null;case 13:return z(b),null;case 12:return null;case 0:l("167");default:l("156")}}}},Qf=function(a,b,c,d,e){var f=a.popHostContainer,g=a.popHostContext,h=b.popContextProvider,k=b.popTopLevelContextObject,l=c.popProvider;return{throwException:function(a,b,c){b.effectTag|=512;b.firstEffect=b.lastEffect=null;b={value:c,source:b,stack:Pb(b)};do{switch(a.tag){case 3:ic(a);a.updateQueue.capturedValues=[b];a.effectTag|=1024;return;case 2:if(c=
+a.stateNode,0===(a.effectTag&64)&&null!==c&&"function"===typeof c.componentDidCatch&&!e(c)){ic(a);c=a.updateQueue;var d=c.capturedValues;null===d?c.capturedValues=[b]:d.push(b);a.effectTag|=1024;return}}a=a["return"]}while(null!==a)},unwindWork:function(a){switch(a.tag){case 2:h(a);var b=a.effectTag;return b&1024?(a.effectTag=b&-1025|64,a):null;case 3:return f(a),k(a),b=a.effectTag,b&1024?(a.effectTag=b&-1025|64,a):null;case 5:return g(a),null;case 4:return f(a),null;case 13:return l(a),null;default:return null}},
+unwindInterruptedWork:function(a){switch(a.tag){case 2:h(a);break;case 3:f(a);k(a);break;case 5:g(a);break;case 4:f(a);break;case 13:l(a)}}}},Rf=function(a,b,c,d,e,f){function g(a){var c=a.ref;if(null!==c)if("function"===typeof c)try{c(null)}catch(n){b(a,n)}else c.current=null}function h(a){"function"===typeof Md&&Md(a);switch(a.tag){case 2:g(a);var c=a.stateNode;if("function"===typeof c.componentWillUnmount)try{c.props=a.memoizedProps,c.state=a.memoizedState,c.componentWillUnmount()}catch(n){b(a,
+n)}break;case 5:g(a);break;case 7:k(a.stateNode);break;case 4:p&&m(a)}}function k(a){for(var b=a;;)if(h(b),null===b.child||p&&4===b.tag){if(b===a)break;for(;null===b.sibling;){if(null===b["return"]||b["return"]===a)return;b=b["return"]}b.sibling["return"]=b["return"];b=b.sibling}else b.child["return"]=b,b=b.child}function C(a){return 5===a.tag||3===a.tag||4===a.tag}function m(a){for(var b=a,c=!1,d=void 0,e=void 0;;){if(!c){c=b["return"];a:for(;;){null===c?l("160"):void 0;switch(c.tag){case 5:d=c.stateNode;
+e=!1;break a;case 3:d=c.stateNode.containerInfo;e=!0;break a;case 4:d=c.stateNode.containerInfo;e=!0;break a}c=c["return"]}c=!0}if(5===b.tag||6===b.tag)k(b),e?E(d,b.stateNode):F(d,b.stateNode);else if(4===b.tag?d=b.stateNode.containerInfo:h(b),null!==b.child){b.child["return"]=b;b=b.child;continue}if(b===a)break;for(;null===b.sibling;){if(null===b["return"]||b["return"]===a)return;b=b["return"];4===b.tag&&(c=!1)}b.sibling["return"]=b["return"];b=b.sibling}}var w=a.getPublicInstance,p=a.mutation;a=
+a.persistence;p||(a?l("235"):l("236"));var G=p.commitMount,v=p.commitUpdate,B=p.resetTextContent,x=p.commitTextUpdate,q=p.appendChild,z=p.appendChildToContainer,y=p.insertBefore,A=p.insertInContainerBefore,F=p.removeChild,E=p.removeChildFromContainer;return{commitBeforeMutationLifeCycles:function(a,b){switch(b.tag){case 2:if(b.effectTag&2048&&null!==a){var c=a.memoizedProps,d=a.memoizedState;a=b.stateNode;a.props=b.memoizedProps;a.state=b.memoizedState;b=a.getSnapshotBeforeUpdate(c,d);a.__reactInternalSnapshotBeforeUpdate=
+b}break;case 3:case 5:case 6:case 4:break;default:l("163")}},commitResetTextContent:function(a){B(a.stateNode)},commitPlacement:function(a){a:{for(var b=a["return"];null!==b;){if(C(b)){var c=b;break a}b=b["return"]}l("160");c=void 0}var d=b=void 0;switch(c.tag){case 5:b=c.stateNode;d=!1;break;case 3:b=c.stateNode.containerInfo;d=!0;break;case 4:b=c.stateNode.containerInfo;d=!0;break;default:l("161")}c.effectTag&16&&(B(b),c.effectTag&=-17);a:b:for(c=a;;){for(;null===c.sibling;){if(null===c["return"]||
+C(c["return"])){c=null;break a}c=c["return"]}c.sibling["return"]=c["return"];for(c=c.sibling;5!==c.tag&&6!==c.tag;){if(c.effectTag&2)continue b;if(null===c.child||4===c.tag)continue b;else c.child["return"]=c,c=c.child}if(!(c.effectTag&2)){c=c.stateNode;break a}}for(var e=a;;){if(5===e.tag||6===e.tag)c?d?A(b,e.stateNode,c):y(b,e.stateNode,c):d?z(b,e.stateNode):q(b,e.stateNode);else if(4!==e.tag&&null!==e.child){e.child["return"]=e;e=e.child;continue}if(e===a)break;for(;null===e.sibling;){if(null===
+e["return"]||e["return"]===a)return;e=e["return"]}e.sibling["return"]=e["return"];e=e.sibling}},commitDeletion:function(a){m(a);a["return"]=null;a.child=null;a.alternate&&(a.alternate.child=null,a.alternate["return"]=null)},commitWork:function(a,b){switch(b.tag){case 2:break;case 5:var c=b.stateNode;if(null!=c){var d=b.memoizedProps;a=null!==a?a.memoizedProps:d;var e=b.type,f=b.updateQueue;b.updateQueue=null;null!==f&&v(c,f,e,a,d,b)}break;case 6:null===b.stateNode?l("162"):void 0;c=b.memoizedProps;
+x(b.stateNode,null!==a?a.memoizedProps:c,c);break;case 3:break;default:l("163")}},commitLifeCycles:function(a,b,c,d,e){switch(c.tag){case 2:a=c.stateNode;c.effectTag&4&&(null===b?(a.props=c.memoizedProps,a.state=c.memoizedState,a.componentDidMount()):(d=b.memoizedProps,b=b.memoizedState,a.props=c.memoizedProps,a.state=c.memoizedState,a.componentDidUpdate(d,b,a.__reactInternalSnapshotBeforeUpdate)));c=c.updateQueue;null!==c&&Pd(c,a);break;case 3:b=c.updateQueue;if(null!==b){a=null;if(null!==c.child)switch(c.child.tag){case 5:a=
+w(c.child.stateNode);break;case 2:a=c.child.stateNode}Pd(b,a)}break;case 5:a=c.stateNode;null===b&&c.effectTag&4&&G(a,c.type,c.memoizedProps,c);break;case 6:break;case 4:break;default:l("163")}},commitErrorLogging:function(a,b){switch(a.tag){case 2:var c=a.type;b=a.stateNode;var d=a.updateQueue;null===d||null===d.capturedValues?l("264"):void 0;var f=d.capturedValues;d.capturedValues=null;"function"!==typeof c.getDerivedStateFromCatch&&e(b);b.props=a.memoizedProps;b.state=a.memoizedState;for(c=0;c<
+f.length;c++){d=f[c];var h=d.value,g=d.stack;Rd(a,d);b.componentDidCatch(h,{componentStack:null!==g?g:""})}break;case 3:c=a.updateQueue;null===c||null===c.capturedValues?l("264"):void 0;f=c.capturedValues;c.capturedValues=null;for(c=0;c<f.length;c++)d=f[c],Rd(a,d),b(d.value);break;default:l("265")}},commitAttachRef:function(a){var b=a.ref;if(null!==b){var c=a.stateNode;switch(a.tag){case 5:a=w(c);break;default:a=c}"function"===typeof b?b(a):b.current=a}},commitDetachRef:function(a){a=a.ref;null!==
+a&&("function"===typeof a?a(null):a.current=null)}}},wb={},Sf=function(a,b){function c(a){a===wb?l("174"):void 0;return a}var d=a.getChildHostContext,e=a.getRootHostContext;a=b.createCursor;var f=b.push,g=b.pop,h=a(wb),k=a(wb),C=a(wb);return{getHostContext:function(){return c(h.current)},getRootHostContainer:function(){return c(C.current)},popHostContainer:function(a){g(h,a);g(k,a);g(C,a)},popHostContext:function(a){k.current===a&&(g(h,a),g(k,a))},pushHostContainer:function(a,b){f(C,b,a);b=e(b);f(k,
+a,a);f(h,b,a)},pushHostContext:function(a){var b=c(C.current),e=c(h.current);b=d(e,a.type,b);e!==b&&(f(k,a,a),f(h,b,a))}}},Tf=function(a){function b(a,b){var c=new Z(5,null,null,0);c.type="DELETED";c.stateNode=b;c["return"]=a;c.effectTag=8;null!==a.lastEffect?(a.lastEffect.nextEffect=c,a.lastEffect=c):a.firstEffect=a.lastEffect=c}function c(a,b){switch(a.tag){case 5:return b=f(b,a.type,a.pendingProps),null!==b?(a.stateNode=b,!0):!1;case 6:return b=g(b,a.pendingProps),null!==b?(a.stateNode=b,!0):!1;
+default:return!1}}function d(a){for(a=a["return"];null!==a&&5!==a.tag&&3!==a.tag;)a=a["return"];w=a}var e=a.shouldSetTextContent;a=a.hydration;if(!a)return{enterHydrationState:function(){return!1},resetHydrationState:function(){},tryToClaimNextHydratableInstance:function(){},prepareToHydrateHostInstance:function(){l("175")},prepareToHydrateHostTextInstance:function(){l("176")},popHydrationState:function(a){return!1}};var f=a.canHydrateInstance,g=a.canHydrateTextInstance,h=a.getNextHydratableSibling,
+k=a.getFirstHydratableChild,C=a.hydrateInstance,m=a.hydrateTextInstance,w=null,p=null,G=!1;return{enterHydrationState:function(a){p=k(a.stateNode.containerInfo);w=a;return G=!0},resetHydrationState:function(){p=w=null;G=!1},tryToClaimNextHydratableInstance:function(a){if(G){var d=p;if(d){if(!c(a,d)){d=h(d);if(!d||!c(a,d)){a.effectTag|=2;G=!1;w=a;return}b(w,p)}w=a;p=k(d)}else a.effectTag|=2,G=!1,w=a}},prepareToHydrateHostInstance:function(a,b,c){b=C(a.stateNode,a.type,a.memoizedProps,b,c,a);a.updateQueue=
+b;return null!==b?!0:!1},prepareToHydrateHostTextInstance:function(a){return m(a.stateNode,a.memoizedProps,a)},popHydrationState:function(a){if(a!==w)return!1;if(!G)return d(a),G=!0,!1;var c=a.type;if(5!==a.tag||"head"!==c&&"body"!==c&&!e(c,a.memoizedProps))for(c=p;c;)b(a,c),c=h(c);d(a);p=w?h(a.stateNode):null;return!0}}},Uf=function(a){function b(a,b,c){a=a.stateNode;a.__reactInternalMemoizedUnmaskedChildContext=b;a.__reactInternalMemoizedMaskedChildContext=c}function c(a){return 2===a.tag&&null!=
+a.type.childContextTypes}function d(a,b){var c=a.stateNode,d=a.type.childContextTypes;if("function"!==typeof c.getChildContext)return b;c=c.getChildContext();for(var e in c)e in d?void 0:l("108",Ha(a)||"Unknown",e);return E({},b,c)}var e=a.createCursor,f=a.push,g=a.pop,h=e(ma),k=e(!1),C=ma;return{getUnmaskedContext:function(a){return c(a)?C:h.current},cacheContext:b,getMaskedContext:function(a,c){var d=a.type.contextTypes;if(!d)return ma;var e=a.stateNode;if(e&&e.__reactInternalMemoizedUnmaskedChildContext===
+c)return e.__reactInternalMemoizedMaskedChildContext;var f={},h;for(h in d)f[h]=c[h];e&&b(a,c,f);return f},hasContextChanged:function(){return k.current},isContextConsumer:function(a){return 2===a.tag&&null!=a.type.contextTypes},isContextProvider:c,popContextProvider:function(a){c(a)&&(g(k,a),g(h,a))},popTopLevelContextObject:function(a){g(k,a);g(h,a)},pushTopLevelContextObject:function(a,b,c){null!=h.cursor?l("168"):void 0;f(h,b,a);f(k,c,a)},processChildContext:d,pushContextProvider:function(a){if(!c(a))return!1;
+var b=a.stateNode;b=b&&b.__reactInternalMemoizedMergedChildContext||ma;C=h.current;f(h,b,a);f(k,k.current,a);return!0},invalidateContextProvider:function(a,b){var c=a.stateNode;c?void 0:l("169");if(b){var e=d(a,C);c.__reactInternalMemoizedMergedChildContext=e;g(k,a);g(h,a);f(h,e,a)}else g(k,a);f(k,b,a)},findCurrentUnmaskedContext:function(a){for(2!==Ka(a)||2!==a.tag?l("170"):void 0;3!==a.tag;){if(c(a))return a.stateNode.__reactInternalMemoizedMergedChildContext;(a=a["return"])?void 0:l("171")}return a.stateNode.context}}},
+Vf=function(a){var b=a.createCursor,c=a.push,d=a.pop,e=b(null),f=b(null),g=b(0);return{pushProvider:function(a){var b=a.type.context;c(g,b._changedBits,a);c(f,b._currentValue,a);c(e,a,a);b._currentValue=a.pendingProps.value;b._changedBits=a.stateNode},popProvider:function(a){var b=g.current,c=f.current;d(e,a);d(f,a);d(g,a);a=a.type.context;a._currentValue=c;a._changedBits=b}}},Wf=function(){var a=[],b=-1;return{createCursor:function(a){return{current:a}},isEmpty:function(){return-1===b},pop:function(c,
+d){0>b||(c.current=a[b],a[b]=null,b--)},push:function(c,d,e){b++;a[b]=c.current;c.current=d},checkThatStackIsEmpty:function(){},resetStackAfterFatalErrorInDev:function(){}}},Yf=function(a){function b(){if(null!==K)for(var a=K["return"];null!==a;)R(a),a=a["return"];U=null;oa=0;K=null;la=!1}function c(a){return null!==O&&O.has(a)}function d(a){for(;;){var b=a.alternate,c=a["return"],d=a.sibling;if(0===(a.effectTag&512)){b=I(b,a,oa);var e=a;if(1073741823===oa||1073741823!==e.expirationTime){b:switch(e.tag){case 3:case 2:var f=
+e.updateQueue;f=null===f?0:f.expirationTime;break b;default:f=0}for(var g=e.child;null!==g;)0!==g.expirationTime&&(0===f||f>g.expirationTime)&&(f=g.expirationTime),g=g.sibling;e.expirationTime=f}if(null!==b)return b;null!==c&&0===(c.effectTag&512)&&(null===c.firstEffect&&(c.firstEffect=a.firstEffect),null!==a.lastEffect&&(null!==c.lastEffect&&(c.lastEffect.nextEffect=a.firstEffect),c.lastEffect=a.lastEffect),1<a.effectTag&&(null!==c.lastEffect?c.lastEffect.nextEffect=a:c.firstEffect=a,c.lastEffect=
+a));if(null!==d)return d;if(null!==c)a=c;else{la=!0;break}}else{a=M(a);if(null!==a)return a.effectTag&=2559,a;null!==c&&(c.firstEffect=c.lastEffect=null,c.effectTag|=512);if(null!==d)return d;if(null!==c)a=c;else break}}return null}function e(a){var b=D(a.alternate,a,oa);null===b&&(b=d(a));sc.current=null;return b}function f(a,c,f){ua?l("243"):void 0;ua=!0;if(c!==oa||a!==U||null===K)b(),U=a,oa=c,K=lb(U.current,null,oa),a.pendingCommitExpirationTime=0;var g=!1;do{try{if(f)for(;null!==K&&!F();)K=e(K);
+else for(;null!==K;)K=e(K)}catch(yc){if(null===K){g=!0;E(yc);break}f=K;var h=f["return"];if(null===h){g=!0;E(yc);break}J(h,f,yc);K=d(f)}break}while(1);ua=!1;if(g||null!==K)return null;if(la)return a.pendingCommitExpirationTime=c,a.current.alternate;l("262")}function g(a,b,c,d){a={value:c,source:a,stack:Pb(a)};Na(b,{expirationTime:d,partialState:null,callback:null,isReplace:!1,isForced:!1,capturedValue:a,next:null});C(b,d)}function h(a,b){a:{ua&&!V?l("263"):void 0;for(var d=a["return"];null!==d;){switch(d.tag){case 2:var e=
+d.stateNode;if("function"===typeof d.type.getDerivedStateFromCatch||"function"===typeof e.componentDidCatch&&!c(e)){g(a,d,b,1);a=void 0;break a}break;case 3:g(a,d,b,1);a=void 0;break a}d=d["return"]}3===a.tag&&g(a,a,b,1);a=void 0}return a}function k(a){a=0!==Ba?Ba:ua?V?1:oa:a.mode&1?Fa?10*(((m()+50)/10|0)+1):25*(((m()+500)/25|0)+1):1;Fa&&(0===va||a>va)&&(va=a);return a}function C(a,c){a:{for(;null!==a;){if(0===a.expirationTime||a.expirationTime>c)a.expirationTime=c;null!==a.alternate&&(0===a.alternate.expirationTime||
+a.alternate.expirationTime>c)&&(a.alternate.expirationTime=c);if(null===a["return"])if(3===a.tag){var d=a.stateNode;!ua&&0!==oa&&c<oa&&b();ua&&!V&&U===d||G(d,c);ha>Ca&&l("185")}else{c=void 0;break a}a=a["return"]}c=void 0}return c}function m(){sa=Z()-ia;return za=(sa/10|0)+2}function w(a,b,c,d,e){var f=Ba;Ba=1;try{return a(b,c,d,e)}finally{Ba=f}}function p(a){if(0!==aa){if(a>aa)return;wa(na)}var b=Z()-ia;aa=a;na=ta(B,{timeout:10*(a-2)-b})}function G(a,b){if(null===a.nextScheduledRoot)a.remainingExpirationTime=
+b,null===N?(Ea=N=a,a.nextScheduledRoot=a):(N=N.nextScheduledRoot=a,N.nextScheduledRoot=Ea);else{var c=a.remainingExpirationTime;if(0===c||b<c)a.remainingExpirationTime=b}da||(L?fa&&(pa=a,X=1,y(a,1,!1)):1===b?x():p(b))}function v(){var a=0,b=null;if(null!==N)for(var c=N,d=Ea;null!==d;){var e=d.remainingExpirationTime;if(0===e){null===c||null===N?l("244"):void 0;if(d===d.nextScheduledRoot){Ea=N=d.nextScheduledRoot=null;break}else if(d===Ea)Ea=e=d.nextScheduledRoot,N.nextScheduledRoot=e,d.nextScheduledRoot=
+null;else if(d===N){N=c;N.nextScheduledRoot=Ea;d.nextScheduledRoot=null;break}else c.nextScheduledRoot=d.nextScheduledRoot,d.nextScheduledRoot=null;d=c.nextScheduledRoot}else{if(0===a||e<a)a=e,b=d;if(d===N)break;c=d;d=d.nextScheduledRoot}}c=pa;null!==c&&c===b&&1===a?ha++:ha=0;pa=b;X=a}function B(a){q(0,!0,a)}function x(){q(1,!1,null)}function q(a,b,c){Y=c;v();if(b)for(;null!==pa&&0!==X&&(0===a||a>=X)&&(!ca||m()>=X);)y(pa,X,!ca),v();else for(;null!==pa&&0!==X&&(0===a||a>=X);)y(pa,X,!1),v();null!==
+Y&&(aa=0,na=-1);0!==X&&p(X);Y=null;ca=!1;z()}function z(){ha=0;if(null!==Ga){var a=Ga;Ga=null;for(var b=0;b<a.length;b++){var c=a[b];try{c._onComplete()}catch(Xf){P||(P=!0,ea=Xf)}}}if(P)throw a=ea,ea=null,P=!1,a;}function y(a,b,c){da?l("245"):void 0;da=!0;c?(c=a.finishedWork,null!==c?A(a,c,b):(a.finishedWork=null,c=f(a,b,!0),null!==c&&(F()?a.finishedWork=c:A(a,c,b)))):(c=a.finishedWork,null!==c?A(a,c,b):(a.finishedWork=null,c=f(a,b,!1),null!==c&&A(a,c,b)));da=!1}function A(a,b,c){var d=a.firstBatch;
+if(null!==d&&d._expirationTime<=c&&(null===Ga?Ga=[d]:Ga.push(d),d._defer)){a.finishedWork=b;a.remainingExpirationTime=0;return}a.finishedWork=null;V=ua=!0;c=b.stateNode;c.current===b?l("177"):void 0;d=c.pendingCommitExpirationTime;0===d?l("261"):void 0;c.pendingCommitExpirationTime=0;var e=m();sc.current=null;if(1<b.effectTag)if(null!==b.lastEffect){b.lastEffect.nextEffect=b;var f=b.firstEffect}else f=b;else f=b.firstEffect;xa(c.containerInfo);for(t=f;null!==t;){var g=!1,k=void 0;try{for(;null!==
+t;)t.effectTag&2048&&S(t.alternate,t),t=t.nextEffect}catch(Va){g=!0,k=Va}g&&(null===t?l("178"):void 0,h(t,k),null!==t&&(t=t.nextEffect))}for(t=f;null!==t;){g=!1;k=void 0;try{for(;null!==t;){var n=t.effectTag;n&16&&T(t);if(n&128){var p=t.alternate;null!==p&&ra(p)}switch(n&14){case 2:Q(t);t.effectTag&=-3;break;case 6:Q(t);t.effectTag&=-3;W(t.alternate,t);break;case 4:W(t.alternate,t);break;case 8:ba(t)}t=t.nextEffect}}catch(Va){g=!0,k=Va}g&&(null===t?l("178"):void 0,h(t,k),null!==t&&(t=t.nextEffect))}ya(c.containerInfo);
+c.current=b;for(t=f;null!==t;){n=!1;p=void 0;try{for(f=c,g=e,k=d;null!==t;){var w=t.effectTag;w&36&&ka(f,t.alternate,t,g,k);w&256&&ma(t,E);w&128&&qa(t);var q=t.nextEffect;t.nextEffect=null;t=q}}catch(Va){n=!0,p=Va}n&&(null===t?l("178"):void 0,h(t,p),null!==t&&(t=t.nextEffect))}ua=V=!1;"function"===typeof Ld&&Ld(b.stateNode);b=c.current.expirationTime;0===b&&(O=null);a.remainingExpirationTime=b}function F(){return null===Y||Y.timeRemaining()>Da?!1:ca=!0}function E(a){null===pa?l("246"):void 0;pa.remainingExpirationTime=
+0;P||(P=!0,ea=a)}var r=Wf(),u=Sf(a,r),n=Uf(r);r=Vf(r);var H=Tf(a),D=Of(a,u,n,r,H,C,k).beginWork,I=Pf(a,u,n,r,H).completeWork;u=Qf(u,n,r,C,c);var J=u.throwException,M=u.unwindWork,R=u.unwindInterruptedWork;u=Rf(a,h,C,k,function(a){null===O?O=new Set([a]):O.add(a)},m);var S=u.commitBeforeMutationLifeCycles,T=u.commitResetTextContent,Q=u.commitPlacement,ba=u.commitDeletion,W=u.commitWork,ka=u.commitLifeCycles,ma=u.commitErrorLogging,qa=u.commitAttachRef,ra=u.commitDetachRef,Z=a.now,ta=a.scheduleDeferredCallback,
+wa=a.cancelDeferredCallback,xa=a.prepareForCommit,ya=a.resetAfterCommit,ia=Z(),za=2,sa=ia,ja=0,Ba=0,ua=!1,K=null,U=null,oa=0,t=null,V=!1,la=!1,O=null,Ea=null,N=null,aa=0,na=-1,da=!1,pa=null,X=0,va=0,ca=!1,P=!1,ea=null,Y=null,L=!1,fa=!1,Fa=!1,Ga=null,Ca=1E3,ha=0,Da=1;return{recalculateCurrentTime:m,computeExpirationForFiber:k,scheduleWork:C,requestWork:G,flushRoot:function(a,b){da?l("253"):void 0;pa=a;X=b;y(a,b,!1);x();z()},batchedUpdates:function(a,b){var c=L;L=!0;try{return a(b)}finally{(L=c)||da||
+x()}},unbatchedUpdates:function(a,b){if(L&&!fa){fa=!0;try{return a(b)}finally{fa=!1}}return a(b)},flushSync:function(a,b){da?l("187"):void 0;var c=L;L=!0;try{return w(a,b)}finally{L=c,x()}},flushControlled:function(a){var b=L;L=!0;try{w(a)}finally{(L=b)||da||q(1,!1,null)}},deferredUpdates:function(a){var b=Ba;Ba=25*(((m()+500)/25|0)+1);try{return a()}finally{Ba=b}},syncUpdates:w,interactiveUpdates:function(a,b,c){if(Fa)return a(b,c);L||da||0===va||(q(va,!1,null),va=0);var d=Fa,e=L;L=Fa=!0;try{return a(b,
+c)}finally{Fa=d,(L=e)||da||x()}},flushInteractiveUpdates:function(){da||0===va||(q(va,!1,null),va=0)},computeUniqueAsyncExpiration:function(){var a=25*(((m()+500)/25|0)+1);a<=ja&&(a=ja+1);return ja=a},legacyContext:n}},pe=function(a){function b(a,b,c,d,e,f){d=b.current;if(c){c=c._reactInternalFiber;var h=k(c);c=l(c)?m(c,h):h}else c=ma;null===b.context?b.context=c:b.pendingContext=c;b=f;Na(d,{expirationTime:e,partialState:{element:a},callback:void 0===b?null:b,isReplace:!1,isForced:!1,capturedValue:null,
+next:null});g(d,e);return e}function c(a){a=Ve(a);return null===a?null:a.stateNode}var d=a.getPublicInstance;a=Yf(a);var e=a.recalculateCurrentTime,f=a.computeExpirationForFiber,g=a.scheduleWork,h=a.legacyContext,k=h.findCurrentUnmaskedContext,l=h.isContextProvider,m=h.processChildContext;return{createContainer:function(a,b,c){b=new Z(3,null,null,b?3:0);a={current:b,containerInfo:a,pendingChildren:null,pendingCommitExpirationTime:0,finishedWork:null,context:null,pendingContext:null,hydrate:c,remainingExpirationTime:0,
+firstBatch:null,nextScheduledRoot:null};return b.stateNode=a},updateContainer:function(a,c,d,g){var h=c.current,k=e();h=f(h);return b(a,c,d,k,h,g)},updateContainerAtExpirationTime:function(a,c,d,f,g){var h=e();return b(a,c,d,h,f,g)},flushRoot:a.flushRoot,requestWork:a.requestWork,computeUniqueAsyncExpiration:a.computeUniqueAsyncExpiration,batchedUpdates:a.batchedUpdates,unbatchedUpdates:a.unbatchedUpdates,deferredUpdates:a.deferredUpdates,syncUpdates:a.syncUpdates,interactiveUpdates:a.interactiveUpdates,
+flushInteractiveUpdates:a.flushInteractiveUpdates,flushControlled:a.flushControlled,flushSync:a.flushSync,getPublicRootInstance:function(a){a=a.current;if(!a.child)return null;switch(a.child.tag){case 5:return d(a.child.stateNode);default:return a.child.stateNode}},findHostInstance:c,findHostInstanceWithNoPortals:function(a){a=We(a);return null===a?null:a.stateNode},injectIntoDevTools:function(a){var b=a.findFiberByHostInstance;return df(E({},a,{findHostInstanceByFiber:function(a){return c(a)},findFiberByHostInstance:function(a){return b?
+b(a):null}}))}}},qe=Object.freeze({default:pe}),zc=qe&&pe||qe,Zf=zc["default"]?zc["default"]:zc,re="object"===typeof performance&&"function"===typeof performance.now,xb=void 0;xb=re?function(){return performance.now()}:function(){return Date.now()};var yb=void 0,zb=void 0;if(T.canUseDOM)if("function"!==typeof requestIdleCallback||"function"!==typeof cancelIdleCallback){var Ab=null,Bb=!1,Wa=-1,Xa=!1,Ya=0,Cb=33,Za=33,Db=void 0;Db=re?{didTimeout:!1,timeRemaining:function(){var a=Ya-performance.now();
+return 0<a?a:0}}:{didTimeout:!1,timeRemaining:function(){var a=Ya-Date.now();return 0<a?a:0}};var se="__reactIdleCallback$"+Math.random().toString(36).slice(2);window.addEventListener("message",function(a){if(a.source===window&&a.data===se){Bb=!1;a=xb();if(0>=Ya-a)if(-1!==Wa&&Wa<=a)Db.didTimeout=!0;else{Xa||(Xa=!0,requestAnimationFrame(te));return}else Db.didTimeout=!1;Wa=-1;a=Ab;Ab=null;null!==a&&a(Db)}},!1);var te=function(a){Xa=!1;var b=a-Ya+Za;b<Za&&Cb<Za?(8>b&&(b=8),Za=b<Cb?Cb:b):Cb=b;Ya=a+Za;
+Bb||(Bb=!0,window.postMessage(se,"*"))};yb=function(a,b){Ab=a;null!=b&&"number"===typeof b.timeout&&(Wa=xb()+b.timeout);Xa||(Xa=!0,requestAnimationFrame(te));return 0};zb=function(){Ab=null;Bb=!1;Wa=-1}}else yb=window.requestIdleCallback,zb=window.cancelIdleCallback;else yb=function(a){return setTimeout(function(){a({timeRemaining:function(){return Infinity},didTimeout:!1})})},zb=function(a){clearTimeout(a)};var Eb=void 0,ae=function(a){return"undefined"!==typeof MSApp&&MSApp.execUnsafeLocalFunction?
+function(b,c,d,e){MSApp.execUnsafeLocalFunction(function(){return a(b,c,d,e)})}:a}(function(a,b){if("http://www.w3.org/2000/svg"!==a.namespaceURI||"innerHTML"in a)a.innerHTML=b;else{Eb=Eb||document.createElement("div");Eb.innerHTML="\x3csvg\x3e"+b+"\x3c/svg\x3e";for(b=Eb.firstChild;a.firstChild;)a.removeChild(a.firstChild);for(;b.firstChild;)a.appendChild(b.firstChild)}}),sb=function(a,b){if(b){var c=a.firstChild;if(c&&c===a.lastChild&&3===c.nodeType){c.nodeValue=b;return}}a.textContent=b},Pa={animationIterationCount:!0,
+borderImageOutset:!0,borderImageSlice:!0,borderImageWidth:!0,boxFlex:!0,boxFlexGroup:!0,boxOrdinalGroup:!0,columnCount:!0,columns:!0,flex:!0,flexGrow:!0,flexPositive:!0,flexShrink:!0,flexNegative:!0,flexOrder:!0,gridRow:!0,gridRowEnd:!0,gridRowSpan:!0,gridRowStart:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnSpan:!0,gridColumnStart:!0,fontWeight:!0,lineClamp:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,tabSize:!0,widows:!0,zIndex:!0,zoom:!0,fillOpacity:!0,floodOpacity:!0,stopOpacity:!0,strokeDasharray:!0,
+strokeDashoffset:!0,strokeMiterlimit:!0,strokeOpacity:!0,strokeWidth:!0},$f=["Webkit","ms","Moz","O"];Object.keys(Pa).forEach(function(a){$f.forEach(function(b){b=b+a.charAt(0).toUpperCase()+a.substring(1);Pa[b]=Pa[a]})});var hf=E({menuitem:!0},{area:!0,base:!0,br:!0,col:!0,embed:!0,hr:!0,img:!0,input:!0,keygen:!0,link:!0,meta:!0,param:!0,source:!0,track:!0,wbr:!0}),Qa=M.thatReturns(""),ag=Object.freeze({createElement:Yd,createTextNode:Zd,setInitialProperties:$d,diffProperties:be,updateProperties:ce,
+diffHydratedProperties:de,diffHydratedText:ee,warnForUnmatchedText:function(a,b){},warnForDeletedHydratableElement:function(a,b){},warnForDeletedHydratableText:function(a,b){},warnForInsertedHydratedElement:function(a,b,c){},warnForInsertedHydratedText:function(a,b){},restoreControlledState:function(a,b,c){switch(b){case "input":Tb(a,c);b=c.name;if("radio"===c.type&&null!=b){for(c=a;c.parentNode;)c=c.parentNode;c=c.querySelectorAll("input[name\x3d"+JSON.stringify(""+b)+'][type\x3d"radio"]');for(b=
+0;b<c.length;b++){var d=c[b];if(d!==a&&d.form===a.form){var e=Kc(d);e?void 0:l("90");gd(d);Tb(d,e)}}}break;case "textarea":Ud(a,c);break;case "select":b=c.value,null!=b&&aa(a,!!c.multiple,b,!1)}}});le.injectFiberControlledHostComponent(ag);var Ac=null,Bc=null;Ra.prototype.render=function(a){this._defer?void 0:l("250");this._hasChildren=!0;this._children=a;var b=this._root._internalRoot,c=this._expirationTime,d=new ca;A.updateContainerAtExpirationTime(a,b,null,c,d._onCommit);return d};Ra.prototype.then=
+function(a){if(this._didComplete)a();else{var b=this._callbacks;null===b&&(b=this._callbacks=[]);b.push(a)}};Ra.prototype.commit=function(){var a=this._root._internalRoot,b=a.firstBatch;this._defer&&null!==b?void 0:l("251");if(this._hasChildren){var c=this._expirationTime;if(b!==this){this._hasChildren&&(c=this._expirationTime=b._expirationTime,this.render(this._children));for(var d=null,e=b;e!==this;)d=e,e=e._next;null===d?l("251"):void 0;d._next=e._next;this._next=b;a.firstBatch=this}this._defer=
+!1;A.flushRoot(a,c);b=this._next;this._next=null;b=a.firstBatch=b;null!==b&&b._hasChildren&&b.render(b._children)}else this._next=null,this._defer=!1};Ra.prototype._onComplete=function(){if(!this._didComplete){this._didComplete=!0;var a=this._callbacks;if(null!==a)for(var b=0;b<a.length;b++)(0,a[b])()}};ca.prototype.then=function(a){if(this._didCommit)a();else{var b=this._callbacks;null===b&&(b=this._callbacks=[]);b.push(a)}};ca.prototype._onCommit=function(){if(!this._didCommit){this._didCommit=
+!0;var a=this._callbacks;if(null!==a)for(var b=0;b<a.length;b++){var c=a[b];"function"!==typeof c?l("191",c):void 0;c()}}};P.prototype.render=function(a,b){var c=this._internalRoot,d=new ca;b=void 0===b?null:b;null!==b&&d.then(b);A.updateContainer(a,c,null,d._onCommit);return d};P.prototype.unmount=function(a){var b=this._internalRoot,c=new ca;a=void 0===a?null:a;null!==a&&c.then(a);A.updateContainer(null,b,null,c._onCommit);return c};P.prototype.legacy_renderSubtreeIntoContainer=function(a,b,c){var d=
+this._internalRoot,e=new ca;c=void 0===c?null:c;null!==c&&e.then(c);A.updateContainer(b,d,a,e._onCommit);return e};P.prototype.createBatch=function(){var a=new Ra(this),b=a._expirationTime,c=this._internalRoot,d=c.firstBatch;if(null===d)c.firstBatch=a,a._next=null;else{for(c=null;null!==d&&d._expirationTime<=b;)c=d,d=d._next;a._next=d;null!==c&&(c._next=a)}return a};var A=Zf({getRootHostContext:function(a){var b=a.nodeType;switch(b){case 9:case 11:a=(a=a.documentElement)?a.namespaceURI:nc(null,"");
+break;default:b=8===b?a.parentNode:a,a=b.namespaceURI||null,b=b.tagName,a=nc(a,b)}return a},getChildHostContext:function(a,b){return nc(a,b)},getPublicInstance:function(a){return a},prepareForCommit:function(){Ac=La;var a=ac();if(Zb(a)){if("selectionStart"in a)var b={start:a.selectionStart,end:a.selectionEnd};else a:{var c=window.getSelection&&window.getSelection();if(c&&0!==c.rangeCount){b=c.anchorNode;var d=c.anchorOffset,e=c.focusNode;c=c.focusOffset;try{b.nodeType,e.nodeType}catch(G){b=null;break a}var f=
+0,g=-1,h=-1,k=0,l=0,m=a,w=null;b:for(;;){for(var p;;){m!==b||0!==d&&3!==m.nodeType||(g=f+d);m!==e||0!==c&&3!==m.nodeType||(h=f+c);3===m.nodeType&&(f+=m.nodeValue.length);if(null===(p=m.firstChild))break;w=m;m=p}for(;;){if(m===a)break b;w===b&&++k===d&&(g=f);w===e&&++l===c&&(h=f);if(null!==(p=m.nextSibling))break;m=w;w=m.parentNode}m=p}b=-1===g||-1===h?null:{start:g,end:h}}else b=null}b=b||{start:0,end:0}}else b=null;Bc={focusedElem:a,selectionRange:b};Xb(!1)},resetAfterCommit:function(){var a=Bc,
+b=ac(),c=a.focusedElem,d=a.selectionRange;if(b!==c&&Ed(document.documentElement,c)){if(Zb(c))if(b=d.start,a=d.end,void 0===a&&(a=b),"selectionStart"in c)c.selectionStart=b,c.selectionEnd=Math.min(a,c.value.length);else if(window.getSelection){b=window.getSelection();var e=c[Oc()].length;a=Math.min(d.start,e);d=void 0===d.end?a:Math.min(d.end,e);!b.extend&&a>d&&(e=d,d=a,a=e);e=Hd(c,a);var f=Hd(c,d);if(e&&f&&(1!==b.rangeCount||b.anchorNode!==e.node||b.anchorOffset!==e.offset||b.focusNode!==f.node||
+b.focusOffset!==f.offset)){var g=document.createRange();g.setStart(e.node,e.offset);b.removeAllRanges();a>d?(b.addRange(g),b.extend(f.node,f.offset)):(g.setEnd(f.node,f.offset),b.addRange(g))}}b=[];for(a=c;a=a.parentNode;)1===a.nodeType&&b.push({element:a,left:a.scrollLeft,top:a.scrollTop});c.focus();for(c=0;c<b.length;c++)a=b[c],a.element.scrollLeft=a.left,a.element.scrollTop=a.top}Bc=null;Xb(Ac);Ac=null},createInstance:function(a,b,c,d,e){a=Yd(a,b,c,d);a[R]=e;a[ha]=b;return a},appendInitialChild:function(a,
+b){a.appendChild(b)},finalizeInitialChildren:function(a,b,c,d){$d(a,b,c,d);return fe(b,c)},prepareUpdate:function(a,b,c,d,e,f){return be(a,b,c,d,e)},shouldSetTextContent:function(a,b){return"textarea"===a||"string"===typeof b.children||"number"===typeof b.children||"object"===typeof b.dangerouslySetInnerHTML&&null!==b.dangerouslySetInnerHTML&&"string"===typeof b.dangerouslySetInnerHTML.__html},shouldDeprioritizeSubtree:function(a,b){return!!b.hidden},createTextInstance:function(a,b,c,d){a=Zd(a,b);
+a[R]=d;return a},now:xb,mutation:{commitMount:function(a,b,c,d){fe(b,c)&&a.focus()},commitUpdate:function(a,b,c,d,e,f){a[ha]=e;ce(a,b,c,d,e)},resetTextContent:function(a){sb(a,"")},commitTextUpdate:function(a,b,c){a.nodeValue=c},appendChild:function(a,b){a.appendChild(b)},appendChildToContainer:function(a,b){8===a.nodeType?a.parentNode.insertBefore(b,a):a.appendChild(b)},insertBefore:function(a,b,c){a.insertBefore(b,c)},insertInContainerBefore:function(a,b,c){8===a.nodeType?a.parentNode.insertBefore(b,
+c):a.insertBefore(b,c)},removeChild:function(a,b){a.removeChild(b)},removeChildFromContainer:function(a,b){8===a.nodeType?a.parentNode.removeChild(b):a.removeChild(b)}},hydration:{canHydrateInstance:function(a,b,c){return 1!==a.nodeType||b.toLowerCase()!==a.nodeName.toLowerCase()?null:a},canHydrateTextInstance:function(a,b){return""===b||3!==a.nodeType?null:a},getNextHydratableSibling:function(a){for(a=a.nextSibling;a&&1!==a.nodeType&&3!==a.nodeType;)a=a.nextSibling;return a},getFirstHydratableChild:function(a){for(a=
+a.firstChild;a&&1!==a.nodeType&&3!==a.nodeType;)a=a.nextSibling;return a},hydrateInstance:function(a,b,c,d,e,f){a[R]=f;a[ha]=c;return de(a,b,c,e,d)},hydrateTextInstance:function(a,b,c){a[R]=c;return ee(a,b)},didNotMatchHydratedContainerTextInstance:function(a,b,c){},didNotMatchHydratedTextInstance:function(a,b,c,d,e){},didNotHydrateContainerInstance:function(a,b){},didNotHydrateInstance:function(a,b,c,d){},didNotFindHydratableContainerInstance:function(a,b,c){},didNotFindHydratableContainerTextInstance:function(a,
+b){},didNotFindHydratableInstance:function(a,b,c,d,e){},didNotFindHydratableTextInstance:function(a,b,c,d){}},scheduleDeferredCallback:yb,cancelDeferredCallback:zb});(function(a){cd=a.batchedUpdates;Ad=a.interactiveUpdates;dd=a.flushInteractiveUpdates})(A);var ue={createPortal:ge,findDOMNode:function(a){if(null==a)return null;if(1===a.nodeType)return a;var b=a._reactInternalFiber;if(b)return A.findHostInstance(b);"function"===typeof a.render?l("188"):l("213",Object.keys(a))},hydrate:function(a,b,
+c){return tb(null,a,b,!0,c)},render:function(a,b,c){return tb(null,a,b,!1,c)},unstable_renderSubtreeIntoContainer:function(a,b,c,d){null==a||void 0===a._reactInternalFiber?l("38"):void 0;return tb(a,b,c,!1,d)},unmountComponentAtNode:function(a){qc(a)?void 0:l("40");return a._reactRootContainer?(A.unbatchedUpdates(function(){tb(null,null,a,!1,function(){a._reactRootContainer=null})}),!0):!1},unstable_createPortal:function(){return ge.apply(void 0,arguments)},unstable_batchedUpdates:A.batchedUpdates,
+unstable_deferredUpdates:A.deferredUpdates,flushSync:A.flushSync,unstable_flushControlled:A.flushControlled,__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED:{EventPluginHub:nf,EventPluginRegistry:mf,EventPropagators:of,ReactControlledComponent:uf,ReactDOMComponentTree:je,ReactDOMEventListener:If},unstable_createRoot:function(a,b){return new P(a,!0,null!=b&&!0===b.hydrate)}};A.injectIntoDevTools({findFiberByHostInstance:Ca,bundleType:0,version:"16.3.0",rendererPackageName:"react-dom"});var ve=Object.freeze({default:ue}),
+Cc=ve&&ue||ve;return Cc["default"]?Cc["default"]:Cc});
+
+var g,aa=this;function ba(a,b){a=a.split(".");var c=aa;a[0]in c||!c.execScript||c.execScript("var "+a[0]);for(var d;a.length&&(d=a.shift());)a.length||void 0===b?c=c[d]&&c[d]!==Object.prototype[d]?c[d]:c[d]={}:c[d]=b}
+function p(a){var b=typeof a;if("object"==b)if(a){if(a instanceof Array)return"array";if(a instanceof Object)return b;var c=Object.prototype.toString.call(a);if("[object Window]"==c)return"object";if("[object Array]"==c||"number"==typeof a.length&&"undefined"!=typeof a.splice&&"undefined"!=typeof a.propertyIsEnumerable&&!a.propertyIsEnumerable("splice"))return"array";if("[object Function]"==c||"undefined"!=typeof a.call&&"undefined"!=typeof a.propertyIsEnumerable&&!a.propertyIsEnumerable("call"))return"function"}else return"null";
+else if("function"==b&&"undefined"==typeof a.call)return"object";return b}function ca(a){return"function"==p(a)}function da(a){return a[fa]||(a[fa]=++ha)}var fa="closure_uid_"+(1E9*Math.random()>>>0),ha=0;function ia(a,b,c){return a.call.apply(a.bind,arguments)}
+function ja(a,b,c){if(!a)throw Error();if(2<arguments.length){var d=Array.prototype.slice.call(arguments,2);return function(){var c=Array.prototype.slice.call(arguments);Array.prototype.unshift.apply(c,d);return a.apply(b,c)}}return function(){return a.apply(b,arguments)}}function ka(a,b,c){ka=Function.prototype.bind&&-1!=Function.prototype.bind.toString().indexOf("native code")?ia:ja;return ka.apply(null,arguments)}
+function la(a,b){var c=Array.prototype.slice.call(arguments,1);return function(){var b=c.slice();b.push.apply(b,arguments);return a.apply(this,b)}};function pa(a,b){var c=a.length-b.length;return 0<=c&&a.indexOf(b,c)==c}function qa(a){return String(a.charAt(0)).toUpperCase()+String(a.substr(1)).toLowerCase()};function ra(a){var b=a.length;if(0<b){for(var c=Array(b),d=0;d<b;d++)c[d]=a[d];return c}return[]}function sa(a,b,c,d){return Array.prototype.splice.apply(a,ua(arguments,1))}function ua(a,b,c){return 2>=arguments.length?Array.prototype.slice.call(a,b):Array.prototype.slice.call(a,b,c)}function va(a,b){return a>b?1:a<b?-1:0};function xa(a){var b=[],c=0,d;for(d in a)b[c++]=d;return b}function ya(a,b){return null!==a&&b in a?a[b]:void 0};function za(a,b){this.ea=[];this.ka=b;for(var c=!0,d=a.length-1;0<=d;d--){var e=a[d]|0;c&&e==b||(this.ea[d]=e,c=!1)}}var Aa={};function Ca(a){if(-128<=a&&128>a){var b=Aa[a];if(b)return b}b=new za([a|0],0>a?-1:0);-128<=a&&128>a&&(Aa[a]=b);return b}function Da(a){if(isNaN(a)||!isFinite(a))return Fa;if(0>a)return Ga(Da(-a));for(var b=[],c=1,d=0;a>=c;d++)b[d]=a/c|0,c*=Ha;return new za(b,0)}var Ha=4294967296,Fa=Ca(0),Ja=Ca(1),Ka=Ca(16777216);
+function La(a){if(-1==a.ka)return-La(Ga(a));for(var b=0,c=1,d=0;d<a.ea.length;d++){var e=Ma(a,d);b+=(0<=e?e:Ha+e)*c;c*=Ha}return b}g=za.prototype;g.toString=function(a){a=a||10;if(2>a||36<a)throw Error("radix out of range: "+a);if(Na(this))return"0";if(-1==this.ka)return"-"+Ga(this).toString(a);for(var b=Da(Math.pow(a,6)),c=this,d="";;){var e=Oa(c,b),f=e.multiply(b);c=c.add(Ga(f));f=((0<c.ea.length?c.ea[0]:c.ka)>>>0).toString(a);c=e;if(Na(c))return f+d;for(;6>f.length;)f="0"+f;d=""+f+d}};
+function Ma(a,b){return 0>b?0:b<a.ea.length?a.ea[b]:a.ka}function Na(a){if(0!=a.ka)return!1;for(var b=0;b<a.ea.length;b++)if(0!=a.ea[b])return!1;return!0}g.compare=function(a){a=this.add(Ga(a));return-1==a.ka?-1:Na(a)?0:1};function Ga(a){for(var b=a.ea.length,c=[],d=0;d<b;d++)c[d]=~a.ea[d];return(new za(c,~a.ka)).add(Ja)}
+g.add=function(a){for(var b=Math.max(this.ea.length,a.ea.length),c=[],d=0,e=0;e<=b;e++){var f=d+(Ma(this,e)&65535)+(Ma(a,e)&65535),h=(f>>>16)+(Ma(this,e)>>>16)+(Ma(a,e)>>>16);d=h>>>16;f&=65535;h&=65535;c[e]=h<<16|f}return new za(c,c[c.length-1]&-2147483648?-1:0)};
+g.multiply=function(a){if(Na(this)||Na(a))return Fa;if(-1==this.ka)return-1==a.ka?Ga(this).multiply(Ga(a)):Ga(Ga(this).multiply(a));if(-1==a.ka)return Ga(this.multiply(Ga(a)));if(0>this.compare(Ka)&&0>a.compare(Ka))return Da(La(this)*La(a));for(var b=this.ea.length+a.ea.length,c=[],d=0;d<2*b;d++)c[d]=0;for(d=0;d<this.ea.length;d++)for(var e=0;e<a.ea.length;e++){var f=Ma(this,d)>>>16,h=Ma(this,d)&65535,k=Ma(a,e)>>>16,l=Ma(a,e)&65535;c[2*d+2*e]+=h*l;Pa(c,2*d+2*e);c[2*d+2*e+1]+=f*l;Pa(c,2*d+2*e+1);c[2*
+d+2*e+1]+=h*k;Pa(c,2*d+2*e+1);c[2*d+2*e+2]+=f*k;Pa(c,2*d+2*e+2)}for(d=0;d<b;d++)c[d]=c[2*d+1]<<16|c[2*d];for(d=b;d<2*b;d++)c[d]=0;return new za(c,0)};function Pa(a,b){for(;(a[b]&65535)!=a[b];)a[b+1]+=a[b]>>>16,a[b]&=65535,b++}
+function Oa(a,b){if(Na(b))throw Error("division by zero");if(Na(a))return Fa;if(-1==a.ka)return-1==b.ka?Oa(Ga(a),Ga(b)):Ga(Oa(Ga(a),b));if(-1==b.ka)return Ga(Oa(a,Ga(b)));if(30<a.ea.length){if(-1==a.ka||-1==b.ka)throw Error("slowDivide_ only works with positive integers.");for(var c=Ja;0>=b.compare(a);)c=c.shiftLeft(1),b=b.shiftLeft(1);var d=Ra(c,1),e=Ra(b,1);b=Ra(b,2);for(c=Ra(c,2);!Na(b);){var f=e.add(b);0>=f.compare(a)&&(d=d.add(c),e=f);b=Ra(b,1);c=Ra(c,1)}return d}for(c=Fa;0<=a.compare(b);){d=
+Math.max(1,Math.floor(La(a)/La(b)));e=Math.ceil(Math.log(d)/Math.LN2);e=48>=e?1:Math.pow(2,e-48);f=Da(d);for(var h=f.multiply(b);-1==h.ka||0<h.compare(a);)d-=e,f=Da(d),h=f.multiply(b);Na(f)&&(f=Ja);c=c.add(f);a=a.add(Ga(h))}return c}g.and=function(a){for(var b=Math.max(this.ea.length,a.ea.length),c=[],d=0;d<b;d++)c[d]=Ma(this,d)&Ma(a,d);return new za(c,this.ka&a.ka)};g.or=function(a){for(var b=Math.max(this.ea.length,a.ea.length),c=[],d=0;d<b;d++)c[d]=Ma(this,d)|Ma(a,d);return new za(c,this.ka|a.ka)};
+g.xor=function(a){for(var b=Math.max(this.ea.length,a.ea.length),c=[],d=0;d<b;d++)c[d]=Ma(this,d)^Ma(a,d);return new za(c,this.ka^a.ka)};g.shiftLeft=function(a){var b=a>>5;a%=32;for(var c=this.ea.length+b+(0<a?1:0),d=[],e=0;e<c;e++)d[e]=0<a?Ma(this,e-b)<<a|Ma(this,e-b-1)>>>32-a:Ma(this,e-b);return new za(d,this.ka)};function Ra(a,b){var c=b>>5;b%=32;for(var d=a.ea.length-c,e=[],f=0;f<d;f++)e[f]=0<b?Ma(a,f+c)>>>b|Ma(a,f+c+1)<<32-b:Ma(a,f+c);return new za(e,a.ka)};function Sa(a,b){null!=a&&this.append.apply(this,arguments)}g=Sa.prototype;g.xb="";g.set=function(a){this.xb=""+a};g.append=function(a,b,c){this.xb+=String(a);if(null!=b)for(var d=1;d<arguments.length;d++)this.xb+=arguments[d];return this};g.clear=function(){this.xb=""};g.toString=function(){return this.xb};var Ta={},Va={},Wa;if("undefined"===typeof Ta||"undefined"===typeof Va||"undefined"===typeof t)var t={};if("undefined"===typeof Ta||"undefined"===typeof Va||"undefined"===typeof Xa)var Xa=null;if("undefined"===typeof Ta||"undefined"===typeof Va||"undefined"===typeof Ya)var Ya=null;var $a=null;if("undefined"===typeof Ta||"undefined"===typeof Va||"undefined"===typeof ab)var ab=null;function bb(){return new u(null,5,[db,!0,eb,!0,fb,!1,gb,!1,hb,null],null)}function w(a){return null!=a&&!1!==a}
+function ib(a){return null==a}function jb(a){return a instanceof Array}function kb(a){return null==a?!0:!1===a?!0:!1}function x(a,b){return a[p(null==b?null:b)]?!0:a._?!0:!1}function lb(a){return null==a?null:a.constructor}function z(a,b){var c=lb(b);c=w(w(c)?c.Zc:c)?c.qc:p(b);return Error(["No protocol method ",a," defined for type ",c,": ",b].join(""))}function mb(a){var b=a.qc;return w(b)?b:[B.c(a)].join("")}
+var nb="undefined"!==typeof Symbol&&"function"===p(Symbol)?Symbol.iterator:"@@iterator",pb={"]":"_RBRACK_","'":"_SINGLEQUOTE_","\x3d":"_EQ_",'"':"_DOUBLEQUOTE_","!":"_BANG_","*":"_STAR_","%":"_PERCENT_","|":"_BAR_","~":"_TILDE_","/":"_SLASH_","\\":"_BSLASH_","-":"_","?":"_QMARK_","\x26":"_AMPERSAND_",":":"_COLON_","\x3c":"_LT_","{":"_LBRACE_","}":"_RBRACE_","[":"_LBRACK_","#":"_SHARP_","^":"_CARET_","+":"_PLUS_","@":"_CIRCA_","\x3e":"_GT_"};
+function qb(a){for(var b=a.length,c=Array(b),d=0;;)if(d<b)c[d]=a[d],d+=1;else break;return c}function rb(a){return sb(function(a,c){a.push(c);return a},[],a)}function tb(){}function ub(){}function vb(){}
+var wb=function wb(a){if(null!=a&&null!=a.X)return a.X(a);var c=wb[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=wb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("ICounted.-count",a);},xb=function xb(a){if(null!=a&&null!=a.Z)return a.Z(a);var c=xb[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=xb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IEmptyableCollection.-empty",a);};function yb(){}
+var zb=function zb(a,b){if(null!=a&&null!=a.W)return a.W(a,b);var d=zb[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=zb._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("ICollection.-conj",a);};function Ab(){}var Bb=function Bb(a){switch(arguments.length){case 2:return Bb.f(arguments[0],arguments[1]);case 3:return Bb.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};
+Bb.f=function(a,b){if(null!=a&&null!=a.K)return a.K(a,b);var c=Bb[p(null==a?null:a)];if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);c=Bb._;if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);throw z("IIndexed.-nth",a);};Bb.h=function(a,b,c){if(null!=a&&null!=a.S)return a.S(a,b,c);var d=Bb[p(null==a?null:a)];if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);d=Bb._;if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);throw z("IIndexed.-nth",a);};Bb.G=3;function Cb(){}
+var Eb=function Eb(a){if(null!=a&&null!=a.ja)return a.ja(a);var c=Eb[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Eb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("ISeq.-first",a);},Fb=function Fb(a){if(null!=a&&null!=a.ma)return a.ma(a);var c=Fb[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Fb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("ISeq.-rest",a);};function Gb(){}function Hb(){}
+var Jb=function Jb(a){switch(arguments.length){case 2:return Jb.f(arguments[0],arguments[1]);case 3:return Jb.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};Jb.f=function(a,b){if(null!=a&&null!=a.R)return a.R(a,b);var c=Jb[p(null==a?null:a)];if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);c=Jb._;if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);throw z("ILookup.-lookup",a);};
+Jb.h=function(a,b,c){if(null!=a&&null!=a.J)return a.J(a,b,c);var d=Jb[p(null==a?null:a)];if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);d=Jb._;if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);throw z("ILookup.-lookup",a);};Jb.G=3;
+var Kb=function Kb(a,b,c){if(null!=a&&null!=a.qa)return a.qa(a,b,c);var e=Kb[p(null==a?null:a)];if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);e=Kb._;if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);throw z("IAssociative.-assoc",a);},Lb=function Lb(a,b){if(null!=a&&null!=a.ib)return a.ib(a,b);var d=Lb[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=Lb._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IFind.-find",a);};function Mb(){}
+var Nb=function Nb(a,b){if(null!=a&&null!=a.Ib)return a.Ib(a,b);var d=Nb[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=Nb._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IMap.-dissoc",a);},Ob=function Ob(a){if(null!=a&&null!=a.Dc)return a.key;var c=Ob[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Ob._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IMapEntry.-key",a);},Pb=function Pb(a){if(null!=a&&null!=a.Ec)return a.A;var c=Pb[p(null==a?
+null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Pb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IMapEntry.-val",a);};function Qb(){}
+var Rb=function Rb(a,b){if(null!=a&&null!=a.Xc)return a.Xc(a,b);var d=Rb[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=Rb._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("ISet.-disjoin",a);},Sb=function Sb(a){if(null!=a&&null!=a.jb)return a.jb(a);var c=Sb[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Sb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IStack.-peek",a);},Tb=function Tb(a){if(null!=a&&null!=a.kb)return a.kb(a);var c=Tb[p(null==
+a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Tb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IStack.-pop",a);};function Ub(){}var Vb=function Vb(a,b,c){if(null!=a&&null!=a.Wa)return a.Wa(a,b,c);var e=Vb[p(null==a?null:a)];if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);e=Vb._;if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);throw z("IVector.-assoc-n",a);};function Wb(){}
+var C=function C(a){if(null!=a&&null!=a.hb)return a.hb(a);var c=C[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=C._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IDeref.-deref",a);};function Xb(){}
+var Yb=function Yb(a){if(null!=a&&null!=a.T)return a.T(a);var c=Yb[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Yb._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IMeta.-meta",a);},Zb=function Zb(a,b){if(null!=a&&null!=a.V)return a.V(a,b);var d=Zb[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=Zb._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IWithMeta.-with-meta",a);};function $b(){}
+var ac=function ac(a){switch(arguments.length){case 2:return ac.f(arguments[0],arguments[1]);case 3:return ac.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};ac.f=function(a,b){if(null!=a&&null!=a.ha)return a.ha(a,b);var c=ac[p(null==a?null:a)];if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);c=ac._;if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);throw z("IReduce.-reduce",a);};
+ac.h=function(a,b,c){if(null!=a&&null!=a.ia)return a.ia(a,b,c);var d=ac[p(null==a?null:a)];if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);d=ac._;if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);throw z("IReduce.-reduce",a);};ac.G=3;function cc(){}
+var dc=function dc(a,b,c){if(null!=a&&null!=a.Hb)return a.Hb(a,b,c);var e=dc[p(null==a?null:a)];if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);e=dc._;if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);throw z("IKVReduce.-kv-reduce",a);},ec=function ec(a,b){if(null!=a&&null!=a.H)return a.H(a,b);var d=ec[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=ec._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IEquiv.-equiv",a);},fc=function fc(a){if(null!=a&&null!=a.L)return a.L(a);
+var c=fc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=fc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IHash.-hash",a);};function gc(){}var hc=function hc(a){if(null!=a&&null!=a.O)return a.O(a);var c=hc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=hc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("ISeqable.-seq",a);};function ic(){}function jc(){}function kc(){}function lc(){}
+var mc=function mc(a){if(null!=a&&null!=a.sb)return a.sb(a);var c=mc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=mc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IReversible.-rseq",a);},nc=function nc(a,b){if(null!=a&&null!=a.Yc)return a.Yc(a,b);var d=nc[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=nc._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IWriter.-write",a);};function oc(){}
+var pc=function pc(a,b,c){if(null!=a&&null!=a.Ub)return a.Ub(a,b,c);var e=pc[p(null==a?null:a)];if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);e=pc._;if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);throw z("IWatchable.-notify-watches",a);},qc=function qc(a,b,c){if(null!=a&&null!=a.Tb)return a.Tb(a,b,c);var e=qc[p(null==a?null:a)];if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);e=qc._;if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);throw z("IWatchable.-add-watch",a);},rc=function rc(a,
+b){if(null!=a&&null!=a.Vb)return a.Vb(a,b);var d=rc[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=rc._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IWatchable.-remove-watch",a);},sc=function sc(a){if(null!=a&&null!=a.Gb)return a.Gb(a);var c=sc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=sc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IEditableCollection.-as-transient",a);},tc=function tc(a,b){if(null!=a&&null!=a.zb)return a.zb(a,b);
+var d=tc[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=tc._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("ITransientCollection.-conj!",a);},uc=function uc(a){if(null!=a&&null!=a.Sb)return a.Sb(a);var c=uc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=uc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("ITransientCollection.-persistent!",a);},vc=function vc(a,b,c){if(null!=a&&null!=a.yb)return a.yb(a,b,c);var e=vc[p(null==a?null:a)];if(null!=
+e)return e.h?e.h(a,b,c):e.call(null,a,b,c);e=vc._;if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);throw z("ITransientAssociative.-assoc!",a);};function wc(){}
+var xc=function xc(a,b){if(null!=a&&null!=a.gb)return a.gb(a,b);var d=xc[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=xc._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IComparable.-compare",a);},yc=function yc(a){if(null!=a&&null!=a.Rc)return a.Rc(a);var c=yc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=yc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IChunk.-drop-first",a);},zc=function zc(a){if(null!=a&&null!=a.Bc)return a.Bc(a);var c=
+zc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=zc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IChunkedSeq.-chunked-first",a);},Bc=function Bc(a){if(null!=a&&null!=a.jc)return a.jc(a);var c=Bc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Bc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IChunkedSeq.-chunked-rest",a);},Cc=function Cc(a){if(null!=a&&null!=a.Qb)return a.Qb(a);var c=Cc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,
+a);c=Cc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("INamed.-name",a);},Dc=function Dc(a){if(null!=a&&null!=a.Rb)return a.Rb(a);var c=Dc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Dc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("INamed.-namespace",a);},Ec=function Ec(a,b){if(null!=a&&null!=a.Na)return a.Na(a,b);var d=Ec[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=Ec._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IReset.-reset!",
+a);},Fc=function Fc(a){switch(arguments.length){case 2:return Fc.f(arguments[0],arguments[1]);case 3:return Fc.h(arguments[0],arguments[1],arguments[2]);case 4:return Fc.C(arguments[0],arguments[1],arguments[2],arguments[3]);case 5:return Fc.N(arguments[0],arguments[1],arguments[2],arguments[3],arguments[4]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};
+Fc.f=function(a,b){if(null!=a&&null!=a.mc)return a.mc(a,b);var c=Fc[p(null==a?null:a)];if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);c=Fc._;if(null!=c)return c.f?c.f(a,b):c.call(null,a,b);throw z("ISwap.-swap!",a);};Fc.h=function(a,b,c){if(null!=a&&null!=a.nc)return a.nc(a,b,c);var d=Fc[p(null==a?null:a)];if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);d=Fc._;if(null!=d)return d.h?d.h(a,b,c):d.call(null,a,b,c);throw z("ISwap.-swap!",a);};
+Fc.C=function(a,b,c,d){if(null!=a&&null!=a.oc)return a.oc(a,b,c,d);var e=Fc[p(null==a?null:a)];if(null!=e)return e.C?e.C(a,b,c,d):e.call(null,a,b,c,d);e=Fc._;if(null!=e)return e.C?e.C(a,b,c,d):e.call(null,a,b,c,d);throw z("ISwap.-swap!",a);};Fc.N=function(a,b,c,d,e){if(null!=a&&null!=a.pc)return a.pc(a,b,c,d,e);var f=Fc[p(null==a?null:a)];if(null!=f)return f.N?f.N(a,b,c,d,e):f.call(null,a,b,c,d,e);f=Fc._;if(null!=f)return f.N?f.N(a,b,c,d,e):f.call(null,a,b,c,d,e);throw z("ISwap.-swap!",a);};
+Fc.G=5;function Gc(){}var Hc=function Hc(a){if(null!=a&&null!=a.Pa)return a.Pa(a);var c=Hc[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Hc._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IIterable.-iterator",a);};function Ic(a){this.Ld=a;this.m=1073741824;this.I=0}Ic.prototype.Yc=function(a,b){return this.Ld.append(b)};function Jc(a){var b=new Sa;a.M(new Ic(b),bb());return[B.c(b)].join("")}
+var Kc="undefined"!==typeof Math&&"undefined"!==typeof Math.imul&&0!==Math.imul(4294967295,5)?function(a,b){return Math.imul(a,b)}:function(a,b){var c=a&65535,d=b&65535;return c*d+((a>>>16&65535)*d+c*(b>>>16&65535)<<16>>>0)|0};function Lc(a){a=Kc(a|0,-862048943);return Kc(a<<15|a>>>-15,461845907)}function Mc(a,b){a=(a|0)^(b|0);return Kc(a<<13|a>>>-13,5)+-430675100|0}function Nc(a,b){a=(a|0)^b;a=Kc(a^a>>>16,-2048144789);a=Kc(a^a>>>13,-1028477387);return a^a>>>16}
+function Oc(a){a:{var b=1;for(var c=0;;)if(b<a.length){var d=b+2;c=Mc(c,Lc(a.charCodeAt(b-1)|a.charCodeAt(b)<<16));b=d}else{b=c;break a}}b=1===(a.length&1)?b^Lc(a.charCodeAt(a.length-1)):b;return Nc(b,Kc(2,a.length))}var Pc={},Qc=0;function Rc(a){255<Qc&&(Pc={},Qc=0);if(null==a)return 0;var b=Pc[a];if("number"===typeof b)a=b;else{a:if(null!=a)if(b=a.length,0<b)for(var c=0,d=0;;)if(c<b){var e=c+1;d=Kc(31,d)+a.charCodeAt(c);c=e}else{b=d;break a}else b=0;else b=0;Pc[a]=b;Qc+=1;a=b}return a}
+function Sc(a){if(null!=a&&(a.m&4194304||t===a.Wd))return a.L(null)^0;if("number"===typeof a){if(w(isFinite(a)))return Math.floor(a)%2147483647;switch(a){case Infinity:return 2146435072;case -Infinity:return-1048576;default:return 2146959360}}else return!0===a?a=1231:!1===a?a=1237:"string"===typeof a?(a=Rc(a),0!==a&&(a=Lc(a),a=Mc(0,a),a=Nc(a,4))):a=a instanceof Date?a.valueOf()^0:null==a?0:fc(a)^0,a}function Tc(a,b){return a^b+2654435769+(a<<6)+(a>>2)}function Uc(a,b){return b instanceof a}
+function Vc(a,b){if(a.eb===b.eb)return 0;var c=kb(a.Ja);if(w(c?b.Ja:c))return-1;if(w(a.Ja)){if(kb(b.Ja))return 1;c=va(a.Ja,b.Ja);return 0===c?va(a.name,b.name):c}return va(a.name,b.name)}function D(a,b,c,d,e){this.Ja=a;this.name=b;this.eb=c;this.Fb=d;this.Ma=e;this.m=2154168321;this.I=4096}g=D.prototype;g.toString=function(){return this.eb};g.equiv=function(a){return this.H(null,a)};g.H=function(a,b){return b instanceof D?this.eb===b.eb:!1};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return F.f(c,this);case 3:return F.h(c,this,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return F.f(c,this)};a.h=function(a,c,d){return F.h(c,this,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return F.f(a,this)};g.f=function(a,b){return F.h(a,this,b)};g.T=function(){return this.Ma};
+g.V=function(a,b){return new D(this.Ja,this.name,this.eb,this.Fb,b)};g.L=function(){var a=this.Fb;return null!=a?a:this.Fb=a=Tc(Oc(this.name),Rc(this.Ja))};g.Qb=function(){return this.name};g.Rb=function(){return this.Ja};g.M=function(a){return nc(a,this.eb)};var Wc=function Wc(a){switch(arguments.length){case 1:return Wc.c(arguments[0]);case 2:return Wc.f(arguments[0],arguments[1]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};
+Wc.c=function(a){if(a instanceof D)return a;var b=a.indexOf("/");return 1>b?Wc.f(null,a):Wc.f(a.substring(0,b),a.substring(b+1,a.length))};Wc.f=function(a,b){var c=null!=a?[B.c(a),"/",B.c(b)].join(""):b;return new D(a,b,c,null,null)};Wc.G=2;function Xc(a){return null!=a?a.I&131072||t===a.Xd?!0:a.I?!1:x(Gc,a):x(Gc,a)}
+function G(a){if(null==a)return null;if(null!=a&&(a.m&8388608||t===a.yd))return a.O(null);if(jb(a)||"string"===typeof a)return 0===a.length?null:new H(a,0,null);if(x(gc,a))return hc(a);throw Error([B.c(a)," is not ISeqable"].join(""));}function K(a){if(null==a)return null;if(null!=a&&(a.m&64||t===a.U))return a.ja(null);a=G(a);return null==a?null:Eb(a)}function Yc(a){return null!=a?null!=a&&(a.m&64||t===a.U)?a.ma(null):(a=G(a))?a.ma(null):Zc:Zc}
+function L(a){return null==a?null:null!=a&&(a.m&128||t===a.kc)?a.la():G(Yc(a))}var M=function M(a){switch(arguments.length){case 1:return M.c(arguments[0]);case 2:return M.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return M.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};M.c=function(){return!0};M.f=function(a,b){return null==a?null==b:a===b||ec(a,b)};
+M.l=function(a,b,c){for(;;)if(M.f(a,b))if(L(c))a=b,b=K(c),c=L(c);else return M.f(b,K(c));else return!1};M.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};M.G=2;function $c(a){this.s=a}$c.prototype.next=function(){if(null!=this.s){var a=K(this.s);this.s=L(this.s);return{value:a,done:!1}}return{value:null,done:!0}};function ad(a){return new $c(G(a))}function bd(a,b){a=Lc(a);a=Mc(0,a);return Nc(a,b)}
+function cd(a){var b=0,c=1;for(a=G(a);;)if(null!=a)b+=1,c=Kc(31,c)+Sc(K(a))|0,a=L(a);else return bd(c,b)}var dd=bd(1,0);function ed(a){var b=0,c=0;for(a=G(a);;)if(null!=a)b+=1,c=c+Sc(K(a))|0,a=L(a);else return bd(c,b)}var fd=bd(0,0);vb["null"]=!0;wb["null"]=function(){return 0};Date.prototype.H=function(a,b){return b instanceof Date&&this.valueOf()===b.valueOf()};Date.prototype.rb=t;
+Date.prototype.gb=function(a,b){if(b instanceof Date)return va(this.valueOf(),b.valueOf());throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};ec.number=function(a,b){return a===b};tb["function"]=!0;Xb["function"]=!0;Yb["function"]=function(){return null};fc._=function(a){return da(a)};function gd(a){return a+1}function hd(){this.A=!1;this.m=32768;this.I=0}hd.prototype.hb=function(){return this.A};function kd(a){return a instanceof hd}function ld(a){return kd(a)?C(a):a}
+function md(a){return C(a)}function nd(a,b){var c=wb(a);if(0===c)return b.D?b.D():b.call(null);for(var d=Bb.f(a,0),e=1;;)if(e<c){var f=Bb.f(a,e);d=b.f?b.f(d,f):b.call(null,d,f);if(kd(d))return C(d);e+=1}else return d}function od(a,b,c){var d=wb(a),e=c;for(c=0;;)if(c<d){var f=Bb.f(a,c);e=b.f?b.f(e,f):b.call(null,e,f);if(kd(e))return C(e);c+=1}else return e}
+function pd(a,b){var c=a.length;if(0===a.length)return b.D?b.D():b.call(null);for(var d=a[0],e=1;;)if(e<c){var f=a[e];d=b.f?b.f(d,f):b.call(null,d,f);if(kd(d))return C(d);e+=1}else return d}function qd(a,b,c){var d=a.length,e=c;for(c=0;;)if(c<d){var f=a[c];e=b.f?b.f(e,f):b.call(null,e,f);if(kd(e))return C(e);c+=1}else return e}function rd(a,b,c,d){for(var e=a.length;;)if(d<e){var f=a[d];c=b.f?b.f(c,f):b.call(null,c,f);if(kd(c))return C(c);d+=1}else return c}
+function sd(a){return null!=a?a.m&2||t===a.nd?!0:a.m?!1:x(vb,a):x(vb,a)}function td(a){return null!=a?a.m&16||t===a.Uc?!0:a.m?!1:x(Ab,a):x(Ab,a)}function N(a,b,c){var d=P(a);if(c>=d)return-1;!(0<c)&&0>c&&(c+=d,c=0>c?0:c);for(;;)if(c<d){if(M.f(ud(a,c),b))return c;c+=1}else return-1}function R(a,b,c){var d=P(a);if(0===d)return-1;0<c?(--d,c=d<c?d:c):c=0>c?d+c:c;for(;;)if(0<=c){if(M.f(ud(a,c),b))return c;--c}else return-1}function vd(a,b){this.j=a;this.i=b}vd.prototype.da=function(){return this.i<this.j.length};
+vd.prototype.next=function(){var a=this.j[this.i];this.i+=1;return a};function H(a,b,c){this.j=a;this.i=b;this.meta=c;this.m=166592766;this.I=139264}g=H.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.K=function(a,b){a=b+this.i;if(0<=a&&a<this.j.length)return this.j[a];throw Error("Index out of bounds");};g.S=function(a,b,c){a=b+this.i;return 0<=a&&a<this.j.length?this.j[a]:c};g.Pa=function(){return new vd(this.j,this.i)};
+g.T=function(){return this.meta};g.la=function(){return this.i+1<this.j.length?new H(this.j,this.i+1,null):null};g.X=function(){var a=this.j.length-this.i;return 0>a?0:a};g.sb=function(){var a=this.X(null);return 0<a?new wd(this,a-1,null):null};g.L=function(){return cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zc};g.ha=function(a,b){return rd(this.j,b,this.j[this.i],this.i+1)};g.ia=function(a,b,c){return rd(this.j,b,c,this.i)};g.ja=function(){return this.j[this.i]};
+g.ma=function(){return this.i+1<this.j.length?new H(this.j,this.i+1,null):Zc};g.O=function(){return this.i<this.j.length?this:null};g.V=function(a,b){return new H(this.j,this.i,b)};g.W=function(a,b){return yd(b,this)};H.prototype[nb]=function(){return ad(this)};function S(a){return 0<a.length?new H(a,0,null):null}function wd(a,b,c){this.ic=a;this.i=b;this.meta=c;this.m=32374990;this.I=8192}g=wd.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){return 0<this.i?new wd(this.ic,this.i-1,null):null};g.X=function(){return this.i+1};g.L=function(){return cd(this)};g.H=function(a,b){return xd(this,b)};
+g.Z=function(){return Zb(Zc,this.meta)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return Bb.f(this.ic,this.i)};g.ma=function(){return 0<this.i?new wd(this.ic,this.i-1,null):Zc};g.O=function(){return this};g.V=function(a,b){return new wd(this.ic,this.i,b)};g.W=function(a,b){return yd(b,this)};wd.prototype[nb]=function(){return ad(this)};function Bd(a){return K(L(a))}function Cd(a){for(;;){var b=L(a);if(null!=b)a=b;else return K(a)}}
+ec._=function(a,b){return a===b};var Dd=function Dd(a){switch(arguments.length){case 0:return Dd.D();case 1:return Dd.c(arguments[0]);case 2:return Dd.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Dd.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};Dd.D=function(){return Ed};Dd.c=function(a){return a};Dd.f=function(a,b){return null!=a?zb(a,b):new Fd(null,b,null,1,null)};
+Dd.l=function(a,b,c){for(;;)if(w(c))a=Dd.f(a,b),b=K(c),c=L(c);else return Dd.f(a,b)};Dd.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};Dd.G=2;function P(a){if(null!=a)if(null!=a&&(a.m&2||t===a.nd))a=a.X(null);else if(jb(a))a=a.length;else if("string"===typeof a)a=a.length;else if(null!=a&&(a.m&8388608||t===a.yd))a:{a=G(a);for(var b=0;;){if(sd(a)){a=b+wb(a);break a}a=L(a);b+=1}}else a=wb(a);else a=0;return a}
+function Gd(a,b){for(var c=null;;){if(null==a)return c;if(0===b)return G(a)?K(a):c;if(td(a))return Bb.h(a,b,c);if(G(a))a=L(a),--b;else return c}}
+function ud(a,b){if("number"!==typeof b)throw Error("Index argument to nth must be a number");if(null==a)return a;if(null!=a&&(a.m&16||t===a.Uc))return a.K(null,b);if(jb(a)){if(0<=b&&b<a.length)return a[b];throw Error("Index out of bounds");}if("string"===typeof a){if(0<=b&&b<a.length)return a.charAt(b);throw Error("Index out of bounds");}if(null!=a&&(a.m&64||t===a.U)||null!=a&&(a.m&16777216||t===a.lc)){a:for(;;){if(null==a)throw Error("Index out of bounds");if(0===b){if(G(a)){a=K(a);break a}throw Error("Index out of bounds");
+}if(td(a)){a=Bb.f(a,b);break a}if(G(a))a=L(a),--b;else throw Error("Index out of bounds");}return a}if(x(Ab,a))return Bb.f(a,b);throw Error(["nth not supported on this type ",B.c(mb(lb(a)))].join(""));}
+function T(a,b){if("number"!==typeof b)throw Error("Index argument to nth must be a number.");if(null==a)return null;if(null!=a&&(a.m&16||t===a.Uc))return a.S(null,b,null);if(jb(a))return 0<=b&&b<a.length?a[b]:null;if("string"===typeof a)return 0<=b&&b<a.length?a.charAt(b):null;if(null!=a&&(a.m&64||t===a.U)||null!=a&&(a.m&16777216||t===a.lc))return Gd(a,b);if(x(Ab,a))return Bb.h(a,b,null);throw Error(["nth not supported on this type ",B.c(mb(lb(a)))].join(""));}
+var F=function F(a){switch(arguments.length){case 2:return F.f(arguments[0],arguments[1]);case 3:return F.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};F.f=function(a,b){return null==a?null:null!=a&&(a.m&256||t===a.ud)?a.R(null,b):jb(a)?null!=b&&b<a.length?a[b|0]:null:"string"===typeof a?null!=b&&b<a.length?a.charAt(b|0):null:x(Hb,a)?Jb.f(a,b):null};
+F.h=function(a,b,c){return null!=a?null!=a&&(a.m&256||t===a.ud)?a.J(null,b,c):jb(a)?null!=b&&0<=b&&b<a.length?a[b|0]:c:"string"===typeof a?null!=b&&0<=b&&b<a.length?a.charAt(b|0):c:x(Hb,a)?Jb.h(a,b,c):c:c};F.G=3;var U=function U(a){switch(arguments.length){case 3:return U.h(arguments[0],arguments[1],arguments[2]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return U.l(arguments[0],arguments[1],arguments[2],new H(c.slice(3),0,null))}};
+U.h=function(a,b,c){return null!=a?Kb(a,b,c):Hd([b,c])};U.l=function(a,b,c,d){for(;;)if(a=U.h(a,b,c),w(d))b=K(d),c=Bd(d),d=L(L(d));else return a};U.F=function(a){var b=K(a),c=L(a);a=K(c);var d=L(c);c=K(d);d=L(d);return this.l(b,a,c,d)};U.G=3;
+var Id=function Id(a){switch(arguments.length){case 1:return Id.c(arguments[0]);case 2:return Id.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Id.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};Id.c=function(a){return a};Id.f=function(a,b){return null==a?null:Nb(a,b)};Id.l=function(a,b,c){for(;;){if(null==a)return null;a=Id.f(a,b);if(w(c))b=K(c),c=L(c);else return a}};
+Id.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};Id.G=2;function Jd(a){var b=ca(a);return b?b:null!=a?t===a.md?!0:a.rc?!1:x(tb,a):x(tb,a)}function Kd(a,b){this.o=a;this.meta=b;this.m=393217;this.I=0}g=Kd.prototype;g.T=function(){return this.meta};g.V=function(a,b){return new Kd(this.o,b)};g.md=t;
+g.call=function(){function a(a,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O,J,Y,oa){return Ld(this.o,b,c,d,e,S([f,h,k,m,l,q,n,r,v,y,A,E,I,O,J,Y,oa]))}function b(a,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O,J,Y){a=this;return a.o.Ba?a.o.Ba(b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O,J,Y):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O,J,Y)}function c(a,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O,J){a=this;return a.o.Aa?a.o.Aa(b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O,J):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O,J)}function d(a,
+b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O){a=this;return a.o.za?a.o.za(b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I,O)}function e(a,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I){a=this;return a.o.ya?a.o.ya(b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E,I)}function f(a,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E){a=this;return a.o.xa?a.o.xa(b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A,E)}function h(a,b,c,d,e,f,h,k,m,l,q,n,
+r,v,y,A){a=this;return a.o.wa?a.o.wa(b,c,d,e,f,h,k,m,l,q,n,r,v,y,A):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v,y,A)}function k(a,b,c,d,e,f,h,k,m,l,q,n,r,v,y){a=this;return a.o.va?a.o.va(b,c,d,e,f,h,k,m,l,q,n,r,v,y):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v,y)}function l(a,b,c,d,e,f,h,k,m,l,q,n,r,v){a=this;return a.o.ua?a.o.ua(b,c,d,e,f,h,k,m,l,q,n,r,v):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n,r,v)}function m(a,b,c,d,e,f,h,k,m,l,q,n,r){a=this;return a.o.ta?a.o.ta(b,c,d,e,f,h,k,m,l,q,n,r):a.o.call(null,b,c,d,
+e,f,h,k,m,l,q,n,r)}function n(a,b,c,d,e,f,h,k,m,l,q,n){a=this;return a.o.sa?a.o.sa(b,c,d,e,f,h,k,m,l,q,n):a.o.call(null,b,c,d,e,f,h,k,m,l,q,n)}function q(a,b,c,d,e,f,h,k,m,l,q){a=this;return a.o.ra?a.o.ra(b,c,d,e,f,h,k,m,l,q):a.o.call(null,b,c,d,e,f,h,k,m,l,q)}function r(a,b,c,d,e,f,h,k,m,l){a=this;return a.o.Da?a.o.Da(b,c,d,e,f,h,k,m,l):a.o.call(null,b,c,d,e,f,h,k,m,l)}function v(a,b,c,d,e,f,h,k,m){a=this;return a.o.oa?a.o.oa(b,c,d,e,f,h,k,m):a.o.call(null,b,c,d,e,f,h,k,m)}function y(a,b,c,d,e,f,
+h,k){a=this;return a.o.Ca?a.o.Ca(b,c,d,e,f,h,k):a.o.call(null,b,c,d,e,f,h,k)}function A(a,b,c,d,e,f,h){a=this;return a.o.ga?a.o.ga(b,c,d,e,f,h):a.o.call(null,b,c,d,e,f,h)}function E(a,b,c,d,e,f){a=this;return a.o.N?a.o.N(b,c,d,e,f):a.o.call(null,b,c,d,e,f)}function I(a,b,c,d,e){a=this;return a.o.C?a.o.C(b,c,d,e):a.o.call(null,b,c,d,e)}function O(a,b,c,d){a=this;return a.o.h?a.o.h(b,c,d):a.o.call(null,b,c,d)}function Y(a,b,c){a=this;return a.o.f?a.o.f(b,c):a.o.call(null,b,c)}function oa(a,b){a=this;
+return a.o.c?a.o.c(b):a.o.call(null,b)}function Ua(a){a=this;return a.o.D?a.o.D():a.o.call(null)}var J=null;J=function(ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db,Ib,bc,Ac,jd,oe,Qf,Ri){switch(arguments.length){case 1:return Ua.call(this,ea);case 2:return oa.call(this,ea,Q);case 3:return Y.call(this,ea,Q,ma);case 4:return O.call(this,ea,Q,ma,na);case 5:return I.call(this,ea,Q,ma,na,ta);case 6:return E.call(this,ea,Q,ma,na,ta,wa);case 7:return A.call(this,ea,Q,ma,na,ta,wa,Ba);case 8:return y.call(this,
+ea,Q,ma,na,ta,wa,Ba,Ea);case 9:return v.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia);case 10:return r.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa);case 11:return q.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za);case 12:return n.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb);case 13:return m.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob);case 14:return l.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J);case 15:return k.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db);case 16:return h.call(this,ea,Q,ma,na,ta,
+wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db,Ib);case 17:return f.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db,Ib,bc);case 18:return e.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db,Ib,bc,Ac);case 19:return d.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db,Ib,bc,Ac,jd);case 20:return c.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db,Ib,bc,Ac,jd,oe);case 21:return b.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,J,Db,Ib,bc,Ac,jd,oe,Qf);case 22:return a.call(this,ea,Q,ma,na,ta,wa,Ba,Ea,Ia,
+Qa,Za,cb,ob,J,Db,Ib,bc,Ac,jd,oe,Qf,Ri)}throw Error("Invalid arity: "+(arguments.length-1));};J.c=Ua;J.f=oa;J.h=Y;J.C=O;J.N=I;J.ga=E;J.Ca=A;J.oa=y;J.Da=v;J.ra=r;J.sa=q;J.ta=n;J.ua=m;J.va=l;J.wa=k;J.xa=h;J.ya=f;J.za=e;J.Aa=d;J.Ba=c;J.Cc=b;J.sd=a;return J}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.D=function(){return this.o.D?this.o.D():this.o.call(null)};g.c=function(a){return this.o.c?this.o.c(a):this.o.call(null,a)};
+g.f=function(a,b){return this.o.f?this.o.f(a,b):this.o.call(null,a,b)};g.h=function(a,b,c){return this.o.h?this.o.h(a,b,c):this.o.call(null,a,b,c)};g.C=function(a,b,c,d){return this.o.C?this.o.C(a,b,c,d):this.o.call(null,a,b,c,d)};g.N=function(a,b,c,d,e){return this.o.N?this.o.N(a,b,c,d,e):this.o.call(null,a,b,c,d,e)};g.ga=function(a,b,c,d,e,f){return this.o.ga?this.o.ga(a,b,c,d,e,f):this.o.call(null,a,b,c,d,e,f)};
+g.Ca=function(a,b,c,d,e,f,h){return this.o.Ca?this.o.Ca(a,b,c,d,e,f,h):this.o.call(null,a,b,c,d,e,f,h)};g.oa=function(a,b,c,d,e,f,h,k){return this.o.oa?this.o.oa(a,b,c,d,e,f,h,k):this.o.call(null,a,b,c,d,e,f,h,k)};g.Da=function(a,b,c,d,e,f,h,k,l){return this.o.Da?this.o.Da(a,b,c,d,e,f,h,k,l):this.o.call(null,a,b,c,d,e,f,h,k,l)};g.ra=function(a,b,c,d,e,f,h,k,l,m){return this.o.ra?this.o.ra(a,b,c,d,e,f,h,k,l,m):this.o.call(null,a,b,c,d,e,f,h,k,l,m)};
+g.sa=function(a,b,c,d,e,f,h,k,l,m,n){return this.o.sa?this.o.sa(a,b,c,d,e,f,h,k,l,m,n):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n)};g.ta=function(a,b,c,d,e,f,h,k,l,m,n,q){return this.o.ta?this.o.ta(a,b,c,d,e,f,h,k,l,m,n,q):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q)};g.ua=function(a,b,c,d,e,f,h,k,l,m,n,q,r){return this.o.ua?this.o.ua(a,b,c,d,e,f,h,k,l,m,n,q,r):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r)};
+g.va=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v){return this.o.va?this.o.va(a,b,c,d,e,f,h,k,l,m,n,q,r,v):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v)};g.wa=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y){return this.o.wa?this.o.wa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y)};g.xa=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A){return this.o.xa?this.o.xa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A)};
+g.ya=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E){return this.o.ya?this.o.ya(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E)};g.za=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I){return this.o.za?this.o.za(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I)};
+g.Aa=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O){return this.o.Aa?this.o.Aa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O)};g.Ba=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y){return this.o.Ba?this.o.Ba(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y):this.o.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y)};g.Cc=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa){return Ld(this.o,a,b,c,d,S([e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa]))};
+function Md(a,b){return ca(a)?new Kd(a,b):null==a?null:Zb(a,b)}function Nd(a){var b=null!=a;return(b?null!=a?a.m&131072||t===a.Vc||(a.m?0:x(Xb,a)):x(Xb,a):b)?Yb(a):null}function Od(a){return null==a?null:Sb(a)}var Pd=function Pd(a){switch(arguments.length){case 1:return Pd.c(arguments[0]);case 2:return Pd.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Pd.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};Pd.c=function(a){return a};
+Pd.f=function(a,b){return null==a?null:Rb(a,b)};Pd.l=function(a,b,c){for(;;){if(null==a)return null;a=Pd.f(a,b);if(w(c))b=K(c),c=L(c);else return a}};Pd.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};Pd.G=2;function Qd(a){return null==a||kb(G(a))}function Rd(a){return null==a?!1:null!=a?a.m&8||t===a.Td?!0:a.m?!1:x(yb,a):x(yb,a)}function Sd(a){return null==a?!1:null!=a?a.m&4096||t===a.zd?!0:a.m?!1:x(Qb,a):x(Qb,a)}
+function Td(a){return null!=a?a.m&16777216||t===a.lc?!0:a.m?!1:x(ic,a):x(ic,a)}function Ud(a){return null==a?!1:null!=a?a.m&1024||t===a.vd?!0:a.m?!1:x(Mb,a):x(Mb,a)}function Vd(a){return null!=a?a.m&67108864||t===a.wd?!0:a.m?!1:x(kc,a):x(kc,a)}function Wd(a){return null!=a?a.m&16384||t===a.be?!0:a.m?!1:x(Ub,a):x(Ub,a)}function Xd(a){return null!=a?a.I&512||t===a.Sd?!0:!1:!1}function Yd(a,b,c,d,e){for(;0!==e;)c[d]=a[b],d+=1,--e,b+=1}var Zd={};
+function $d(a){return null==a?!1:null!=a?a.m&64||t===a.U?!0:a.m?!1:x(Cb,a):x(Cb,a)}function ae(a){return null==a?!1:!1===a?!1:!0}function be(a){var b=Jd(a);return b?b:null!=a?a.m&1||t===a.Vd?!0:a.m?!1:x(ub,a):x(ub,a)}function ce(a){return"number"===typeof a&&!isNaN(a)&&Infinity!==a&&parseFloat(a)===parseInt(a,10)}function de(a,b){return F.h(a,b,Zd)===Zd?!1:!0}
+function ee(a,b){if(a===b)return 0;if(null==a)return-1;if(null==b)return 1;if("number"===typeof a){if("number"===typeof b)return va(a,b);throw Error(["Cannot compare ",B.c(a)," to ",B.c(b)].join(""));}if(null!=a?a.I&2048||t===a.rb||(a.I?0:x(wc,a)):x(wc,a))return xc(a,b);if("string"!==typeof a&&!jb(a)&&!0!==a&&!1!==a||lb(a)!==lb(b))throw Error(["Cannot compare ",B.c(a)," to ",B.c(b)].join(""));return va(a,b)}
+function fe(a,b){var c=P(a),d=P(b);if(c<d)a=-1;else if(c>d)a=1;else if(0===c)a=0;else a:for(d=0;;){var e=ee(ud(a,d),ud(b,d));if(0===e&&d+1<c)d+=1;else{a=e;break a}}return a}function zd(a,b){return(b=G(b))?sb(a,K(b),L(b)):a.D?a.D():a.call(null)}function Ad(a,b,c){for(c=G(c);;)if(c){var d=K(c);b=a.f?a.f(b,d):a.call(null,b,d);if(kd(b))return C(b);c=L(c)}else return b}
+function ge(a,b){a=Hc(a);if(w(a.da()))for(var c=a.next();;)if(a.da()){var d=a.next();c=b.f?b.f(c,d):b.call(null,c,d);if(kd(c))return C(c)}else return c;else return b.D?b.D():b.call(null)}function he(a,b,c){for(a=Hc(a);;)if(a.da()){var d=a.next();c=b.f?b.f(c,d):b.call(null,c,d);if(kd(c))return C(c)}else return c}function ie(a,b){return null!=b&&(b.m&524288||t===b.xd)?b.ha(null,a):jb(b)?pd(b,a):"string"===typeof b?pd(b,a):x($b,b)?ac.f(b,a):Xc(b)?ge(b,a):zd(a,b)}
+function sb(a,b,c){return null!=c&&(c.m&524288||t===c.xd)?c.ia(null,a,b):jb(c)?qd(c,a,b):"string"===typeof c?qd(c,a,b):x($b,c)?ac.h(c,a,b):Xc(c)?he(c,a,b):Ad(a,b,c)}function je(a,b,c){return null!=c?dc(c,a,b):b}function ke(a){return a}function le(a,b,c,d){a=a.c?a.c(b):a.call(null,b);c=sb(a,c,d);return a.c?a.c(c):a.call(null,c)}
+var me=function me(a){switch(arguments.length){case 0:return me.D();case 1:return me.c(arguments[0]);case 2:return me.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return me.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};me.D=function(){return 0};me.c=function(a){return a};me.f=function(a,b){return a+b};me.l=function(a,b,c){return sb(me,a+b,c)};me.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};
+me.G=2;function ne(a){return a-1}var pe=function pe(a){switch(arguments.length){case 1:return pe.c(arguments[0]);case 2:return pe.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return pe.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};pe.c=function(a){return a};pe.f=function(a,b){return a>b?a:b};pe.l=function(a,b,c){return sb(pe,a>b?a:b,c)};pe.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};pe.G=2;
+function qe(a){if("number"===typeof a)return String.fromCharCode(a);if("string"===typeof a&&1===a.length)return a;throw Error("Argument to char must be a character or number");}function re(a){a=(a-a%2)/2;return 0<=a?Math.floor(a):Math.ceil(a)}function se(a){a-=a>>1&1431655765;a=(a&858993459)+(a>>2&858993459);return 16843009*(a+(a>>4)&252645135)>>24}
+var B=function B(a){switch(arguments.length){case 0:return B.D();case 1:return B.c(arguments[0]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return B.l(arguments[0],new H(c.slice(1),0,null))}};B.D=function(){return""};B.c=function(a){return null==a?"":[a].join("")};B.l=function(a,b){for(a=new Sa([B.c(a)].join(""));;)if(w(b))a=a.append([B.c(K(b))].join("")),b=L(b);else return a.toString()};B.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};B.G=1;
+function te(a,b){return a.substring(0,b)}function xd(a,b){if(Td(b))if(sd(a)&&sd(b)&&P(a)!==P(b))a=!1;else a:for(a=G(a),b=G(b);;){if(null==a){a=null==b;break a}if(null!=b&&M.f(K(a),K(b)))a=L(a),b=L(b);else{a=!1;break a}}else a=null;return ae(a)}function Fd(a,b,c,d,e){this.meta=a;this.first=b;this.nb=c;this.count=d;this.B=e;this.m=65937646;this.I=8192}g=Fd.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,this.count)}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){return 1===this.count?null:this.nb};g.X=function(){return this.count};g.jb=function(){return this.first};g.kb=function(){return this.ma(null)};
+g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return this.first};g.ma=function(){return 1===this.count?Zc:this.nb};g.O=function(){return this};g.V=function(a,b){return new Fd(b,this.first,this.nb,this.count,this.B)};g.W=function(a,b){return new Fd(this.meta,b,this,this.count+1,null)};
+function ue(a){return null!=a?a.m&33554432||t===a.Zd?!0:a.m?!1:x(jc,a):x(jc,a)}Fd.prototype[nb]=function(){return ad(this)};function ve(a){this.meta=a;this.m=65937614;this.I=8192}g=ve.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){return null};g.X=function(){return 0};g.jb=function(){return null};g.kb=function(){throw Error("Can't pop empty list");};g.L=function(){return dd};
+g.H=function(a,b){return ue(b)||Td(b)?null==G(b):!1};g.Z=function(){return this};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return null};g.ma=function(){return Zc};g.O=function(){return null};g.V=function(a,b){return new ve(b)};g.W=function(a,b){return new Fd(this.meta,b,null,1,null)};var Zc=new ve(null);ve.prototype[nb]=function(){return ad(this)};
+function we(a){return(null!=a?a.m&134217728||t===a.ae||(a.m?0:x(lc,a)):x(lc,a))?(a=mc(a))?a:Zc:sb(Dd,Zc,a)}var xe=function xe(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return xe.l(0<c.length?new H(c.slice(0),0,null):null)};xe.l=function(a){if(a instanceof H&&0===a.i)var b=a.j;else a:for(b=[];;)if(null!=a)b.push(a.ja(null)),a=a.la();else break a;a=b.length;for(var c=Zc;;)if(0<a){var d=a-1;c=c.W(null,b[a-1]);a=d}else return c};xe.G=0;xe.F=function(a){return this.l(G(a))};
+function ye(a,b,c,d){this.meta=a;this.first=b;this.nb=c;this.B=d;this.m=65929452;this.I=8192}g=ye.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){return null==this.nb?null:G(this.nb)};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};
+g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return this.first};g.ma=function(){return null==this.nb?Zc:this.nb};g.O=function(){return this};g.V=function(a,b){return new ye(b,this.first,this.nb,this.B)};g.W=function(a,b){return new ye(null,b,this,null)};ye.prototype[nb]=function(){return ad(this)};function yd(a,b){return null==b||null!=b&&(b.m&64||t===b.U)?new ye(null,a,b,null):new ye(null,a,G(b),null)}
+function ze(a,b){if(a.Ka===b.Ka)return 0;var c=kb(a.Ja);if(w(c?b.Ja:c))return-1;if(w(a.Ja)){if(kb(b.Ja))return 1;c=va(a.Ja,b.Ja);return 0===c?va(a.name,b.name):c}return va(a.name,b.name)}function V(a,b,c,d){this.Ja=a;this.name=b;this.Ka=c;this.Fb=d;this.m=2153775105;this.I=4096}g=V.prototype;g.toString=function(){return[":",B.c(this.Ka)].join("")};g.equiv=function(a){return this.H(null,a)};g.H=function(a,b){return b instanceof V?this.Ka===b.Ka:!1};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return F.f(c,this);case 3:return F.h(c,this,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return F.f(c,this)};a.h=function(a,c,d){return F.h(c,this,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return F.f(a,this)};g.f=function(a,b){return F.h(a,this,b)};
+g.L=function(){var a=this.Fb;return null!=a?a:this.Fb=a=Tc(Oc(this.name),Rc(this.Ja))+2654435769|0};g.Qb=function(){return this.name};g.Rb=function(){return this.Ja};g.M=function(a){return nc(a,[":",B.c(this.Ka)].join(""))};function Ae(a,b){return a===b?!0:a instanceof V&&b instanceof V?a.Ka===b.Ka:!1}function Be(a){if(null!=a&&(a.I&4096||t===a.Wc))return a.Rb(null);throw Error(["Doesn't support namespace: ",B.c(a)].join(""));}
+var Ce=function Ce(a){switch(arguments.length){case 1:return Ce.c(arguments[0]);case 2:return Ce.f(arguments[0],arguments[1]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};Ce.c=function(a){if(a instanceof V)return a;if(a instanceof D)return new V(Be(a),De(a),a.eb,null);if("string"===typeof a){var b=a.split("/");return 2===b.length?new V(b[0],b[1],a,null):new V(null,b[0],a,null)}return null};
+Ce.f=function(a,b){a=a instanceof V?De(a):a instanceof D?De(a):a;b=b instanceof V?De(b):b instanceof D?De(b):b;return new V(a,b,[B.c(w(a)?[B.c(a),"/"].join(""):null),B.c(b)].join(""),null)};Ce.G=2;function Ee(a,b,c,d){this.meta=a;this.Zb=b;this.s=c;this.B=d;this.m=32374988;this.I=1}g=Ee.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};function Fe(a){null!=a.Zb&&(a.s=a.Zb.D?a.Zb.D():a.Zb.call(null),a.Zb=null);return a.s}
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){this.O(null);return null==this.s?null:L(this.s)};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};
+g.Z=function(){return Zb(Zc,this.meta)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){this.O(null);return null==this.s?null:K(this.s)};g.ma=function(){this.O(null);return null!=this.s?Yc(this.s):Zc};g.O=function(){Fe(this);if(null==this.s)return null;for(var a=this.s;;)if(a instanceof Ee)a=Fe(a);else return this.s=a,G(this.s)};g.V=function(a,b){return new Ee(b,function(a){return function(){return a.O(null)}}(this),null,this.B)};
+g.W=function(a,b){return yd(b,this)};Ee.prototype[nb]=function(){return ad(this)};function Ge(a){this.wb=a;this.end=0;this.m=2;this.I=0}Ge.prototype.add=function(a){this.wb[this.end]=a;return this.end+=1};Ge.prototype.Ha=function(){var a=new He(this.wb,0,this.end);this.wb=null;return a};Ge.prototype.X=function(){return this.end};function Ie(a){return new Ge(Array(a))}function He(a,b,c){this.j=a;this.Fa=b;this.end=c;this.m=524306;this.I=0}g=He.prototype;g.X=function(){return this.end-this.Fa};
+g.K=function(a,b){return this.j[this.Fa+b]};g.S=function(a,b,c){return 0<=b&&b<this.end-this.Fa?this.j[this.Fa+b]:c};g.Rc=function(){if(this.Fa===this.end)throw Error("-drop-first of empty chunk");return new He(this.j,this.Fa+1,this.end)};g.ha=function(a,b){return rd(this.j,b,this.j[this.Fa],this.Fa+1)};g.ia=function(a,b,c){return rd(this.j,b,c,this.Fa)};function Je(a,b,c,d){this.Ha=a;this.cb=b;this.meta=c;this.B=d;this.m=31850732;this.I=1536}g=Je.prototype;g.toString=function(){return Jc(this)};
+g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){if(1<wb(this.Ha))return new Je(yc(this.Ha),this.cb,this.meta,null);var a=hc(this.cb);return null==a?null:a};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};
+g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};g.ja=function(){return Bb.f(this.Ha,0)};g.ma=function(){return 1<wb(this.Ha)?new Je(yc(this.Ha),this.cb,this.meta,null):null==this.cb?Zc:this.cb};g.O=function(){return this};g.Bc=function(){return this.Ha};g.jc=function(){return null==this.cb?Zc:this.cb};g.V=function(a,b){return new Je(this.Ha,this.cb,b,this.B)};g.W=function(a,b){return yd(b,this)};g.Sc=function(){return null==this.cb?null:this.cb};Je.prototype[nb]=function(){return ad(this)};
+function Ke(a,b){return 0===wb(a)?b:new Je(a,b,null,null)}function Le(a,b){a.add(b)}function Me(a){var b=[];for(a=G(a);;)if(null!=a)b.push(K(a)),a=L(a);else return b}function Ne(a,b){if(sd(b))return P(b);var c=0;for(b=G(b);;)if(null!=b&&c<a)c+=1,b=L(b);else return c}
+var Oe=function Oe(a){if(null==a)return null;var c=L(a);return null==c?G(K(a)):yd(K(a),Oe.c?Oe.c(c):Oe.call(null,c))},Pe=function Pe(a){switch(arguments.length){case 0:return Pe.D();case 1:return Pe.c(arguments[0]);case 2:return Pe.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Pe.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};Pe.D=function(){return new Ee(null,function(){return null},null,null)};
+Pe.c=function(a){return new Ee(null,function(){return a},null,null)};Pe.f=function(a,b){return new Ee(null,function(){var c=G(a);return c?Xd(c)?Ke(zc(c),Pe.f(Bc(c),b)):yd(K(c),Pe.f(Yc(c),b)):b},null,null)};Pe.l=function(a,b,c){return function h(a,b){return new Ee(null,function(){var c=G(a);return c?Xd(c)?Ke(zc(c),h(Bc(c),b)):yd(K(c),h(Yc(c),b)):w(b)?h(K(b),L(b)):null},null,null)}(Pe.f(a,b),c)};Pe.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};Pe.G=2;
+var Qe=function Qe(a){switch(arguments.length){case 0:return Qe.D();case 1:return Qe.c(arguments[0]);case 2:return Qe.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Qe.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};Qe.D=function(){return sc(Ed)};Qe.c=function(a){return a};Qe.f=function(a,b){return tc(a,b)};Qe.l=function(a,b,c){for(;;)if(a=tc(a,b),w(c))b=K(c),c=L(c);else return a};
+Qe.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};Qe.G=2;
+function Re(a,b,c){var d=G(c);if(0===b)return a.D?a.D():a.call(null);c=Eb(d);var e=Fb(d);if(1===b)return a.c?a.c(c):a.call(null,c);d=Eb(e);var f=Fb(e);if(2===b)return a.f?a.f(c,d):a.call(null,c,d);e=Eb(f);var h=Fb(f);if(3===b)return a.h?a.h(c,d,e):a.call(null,c,d,e);f=Eb(h);var k=Fb(h);if(4===b)return a.C?a.C(c,d,e,f):a.call(null,c,d,e,f);h=Eb(k);var l=Fb(k);if(5===b)return a.N?a.N(c,d,e,f,h):a.call(null,c,d,e,f,h);k=Eb(l);var m=Fb(l);if(6===b)return a.ga?a.ga(c,d,e,f,h,k):a.call(null,c,d,e,f,h,k);
+l=Eb(m);var n=Fb(m);if(7===b)return a.Ca?a.Ca(c,d,e,f,h,k,l):a.call(null,c,d,e,f,h,k,l);m=Eb(n);var q=Fb(n);if(8===b)return a.oa?a.oa(c,d,e,f,h,k,l,m):a.call(null,c,d,e,f,h,k,l,m);n=Eb(q);var r=Fb(q);if(9===b)return a.Da?a.Da(c,d,e,f,h,k,l,m,n):a.call(null,c,d,e,f,h,k,l,m,n);q=Eb(r);var v=Fb(r);if(10===b)return a.ra?a.ra(c,d,e,f,h,k,l,m,n,q):a.call(null,c,d,e,f,h,k,l,m,n,q);r=Eb(v);var y=Fb(v);if(11===b)return a.sa?a.sa(c,d,e,f,h,k,l,m,n,q,r):a.call(null,c,d,e,f,h,k,l,m,n,q,r);v=Eb(y);var A=Fb(y);
+if(12===b)return a.ta?a.ta(c,d,e,f,h,k,l,m,n,q,r,v):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v);y=Eb(A);var E=Fb(A);if(13===b)return a.ua?a.ua(c,d,e,f,h,k,l,m,n,q,r,v,y):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y);A=Eb(E);var I=Fb(E);if(14===b)return a.va?a.va(c,d,e,f,h,k,l,m,n,q,r,v,y,A):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y,A);E=Eb(I);var O=Fb(I);if(15===b)return a.wa?a.wa(c,d,e,f,h,k,l,m,n,q,r,v,y,A,E):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E);I=Eb(O);var Y=Fb(O);if(16===b)return a.xa?a.xa(c,d,e,f,h,k,l,
+m,n,q,r,v,y,A,E,I):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I);O=Eb(Y);var oa=Fb(Y);if(17===b)return a.ya?a.ya(c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O);Y=Eb(oa);var Ua=Fb(oa);if(18===b)return a.za?a.za(c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y);oa=Eb(Ua);Ua=Fb(Ua);if(19===b)return a.Aa?a.Aa(c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa);var J=Eb(Ua);Fb(Ua);if(20===b)return a.Ba?
+a.Ba(c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa,J):a.call(null,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa,J);throw Error("Only up to 20 arguments supported on functions");}function Se(a,b,c){return null==c?a.c?a.c(b):a.call(a,b):Te(a,b,Eb(c),L(c))}function Te(a,b,c,d){return null==d?a.f?a.f(b,c):a.call(a,b,c):Ue(a,b,c,Eb(d),L(d))}function Ue(a,b,c,d,e){return null==e?a.h?a.h(b,c,d):a.call(a,b,c,d):Ve(a,b,c,d,Eb(e),L(e))}
+function Ve(a,b,c,d,e,f){if(null==f)return a.C?a.C(b,c,d,e):a.call(a,b,c,d,e);var h=Eb(f),k=L(f);if(null==k)return a.N?a.N(b,c,d,e,h):a.call(a,b,c,d,e,h);f=Eb(k);var l=L(k);if(null==l)return a.ga?a.ga(b,c,d,e,h,f):a.call(a,b,c,d,e,h,f);k=Eb(l);var m=L(l);if(null==m)return a.Ca?a.Ca(b,c,d,e,h,f,k):a.call(a,b,c,d,e,h,f,k);l=Eb(m);var n=L(m);if(null==n)return a.oa?a.oa(b,c,d,e,h,f,k,l):a.call(a,b,c,d,e,h,f,k,l);m=Eb(n);var q=L(n);if(null==q)return a.Da?a.Da(b,c,d,e,h,f,k,l,m):a.call(a,b,c,d,e,h,f,k,
+l,m);n=Eb(q);var r=L(q);if(null==r)return a.ra?a.ra(b,c,d,e,h,f,k,l,m,n):a.call(a,b,c,d,e,h,f,k,l,m,n);q=Eb(r);var v=L(r);if(null==v)return a.sa?a.sa(b,c,d,e,h,f,k,l,m,n,q):a.call(a,b,c,d,e,h,f,k,l,m,n,q);r=Eb(v);var y=L(v);if(null==y)return a.ta?a.ta(b,c,d,e,h,f,k,l,m,n,q,r):a.call(a,b,c,d,e,h,f,k,l,m,n,q,r);v=Eb(y);var A=L(y);if(null==A)return a.ua?a.ua(b,c,d,e,h,f,k,l,m,n,q,r,v):a.call(a,b,c,d,e,h,f,k,l,m,n,q,r,v);y=Eb(A);var E=L(A);if(null==E)return a.va?a.va(b,c,d,e,h,f,k,l,m,n,q,r,v,y):a.call(a,
+b,c,d,e,h,f,k,l,m,n,q,r,v,y);A=Eb(E);var I=L(E);if(null==I)return a.wa?a.wa(b,c,d,e,h,f,k,l,m,n,q,r,v,y,A):a.call(a,b,c,d,e,h,f,k,l,m,n,q,r,v,y,A);E=Eb(I);var O=L(I);if(null==O)return a.xa?a.xa(b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E):a.call(a,b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E);I=Eb(O);var Y=L(O);if(null==Y)return a.ya?a.ya(b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I):a.call(a,b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I);O=Eb(Y);var oa=L(Y);if(null==oa)return a.za?a.za(b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I,O):a.call(a,b,c,d,e,h,f,
+k,l,m,n,q,r,v,y,A,E,I,O);Y=Eb(oa);var Ua=L(oa);if(null==Ua)return a.Aa?a.Aa(b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I,O,Y):a.call(a,b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I,O,Y);oa=Eb(Ua);Ua=L(Ua);if(null==Ua)return a.Ba?a.Ba(b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa):a.call(a,b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa);b=[b,c,d,e,h,f,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa];for(c=Ua;;)if(c)b.push(Eb(c)),c=L(c);else break;return a.apply(a,b)}
+function We(a,b){if(a.F){var c=a.G,d=Ne(c+1,b);return d<=c?Re(a,d,b):a.F(b)}b=G(b);return null==b?a.D?a.D():a.call(a):Se(a,Eb(b),L(b))}function Xe(a,b,c){if(a.F){b=yd(b,c);var d=a.G;c=Ne(d,c)+1;return c<=d?Re(a,c,b):a.F(b)}return Se(a,b,G(c))}function Ye(a,b,c,d,e){return a.F?(b=yd(b,yd(c,yd(d,e))),c=a.G,e=3+Ne(c-2,e),e<=c?Re(a,e,b):a.F(b)):Ue(a,b,c,d,G(e))}function Ld(a,b,c,d,e,f){return a.F?(f=Oe(f),b=yd(b,yd(c,yd(d,yd(e,f)))),c=a.G,f=4+Ne(c-3,f),f<=c?Re(a,f,b):a.F(b)):Ve(a,b,c,d,e,Oe(f))}
+function Ze(a){return G(a)?a:null}
+function $e(){if("undefined"===typeof Ta||"undefined"===typeof Va||"undefined"===typeof Wa)Wa=function(a){this.Hd=a;this.m=393216;this.I=0},Wa.prototype.V=function(a,b){return new Wa(b)},Wa.prototype.T=function(){return this.Hd},Wa.prototype.da=function(){return!1},Wa.prototype.next=function(){return Error("No such element")},Wa.prototype.remove=function(){return Error("Unsupported operation")},Wa.ee=function(){return new W(null,1,5,X,[Va.de],null)},Wa.Zc=!0,Wa.qc="cljs.core/t_cljs$core1500",Wa.Bd=
+function(a){return nc(a,"cljs.core/t_cljs$core1500")};return new Wa(Z)}var af={},bf={};function cf(a){this.Ob=af;this.ub=a}cf.prototype.da=function(){this.Ob===af?(this.Ob=bf,this.ub=G(this.ub)):this.Ob===this.ub&&(this.ub=L(this.Ob));return null!=this.ub};cf.prototype.next=function(){if(this.da())return this.Ob=this.ub,K(this.ub);throw Error("No such element");};cf.prototype.remove=function(){return Error("Unsupported operation")};
+function df(a,b){for(;;){if(null==G(b))return!0;var c=K(b);c=a.c?a.c(c):a.call(null,c);if(w(c))b=L(b);else return!1}}function ef(a,b){for(;;)if(G(b)){var c=K(b);c=a.c?a.c(c):a.call(null,c);if(w(c))return c;b=L(b)}else return null}function ff(a){if(ce(a))return 0===(a&1);throw Error(["Argument must be an integer: ",B.c(a)].join(""));}
+function gf(a){return function(){function b(b,c){return kb(a.f?a.f(b,c):a.call(null,b,c))}function c(b){return kb(a.c?a.c(b):a.call(null,b))}function d(){return kb(a.D?a.D():a.call(null))}var e=null,f=function(){function b(a,b,d){var e=null;if(2<arguments.length){e=0;for(var f=Array(arguments.length-2);e<f.length;)f[e]=arguments[e+2],++e;e=new H(f,0,null)}return c.call(this,a,b,e)}function c(b,c,d){a.F?(b=yd(b,yd(c,d)),c=a.G,d=2+Ne(c-1,d),d=d<=c?Re(a,d,b):a.F(b)):d=Te(a,b,c,G(d));return kb(d)}b.G=
+2;b.F=function(a){var b=K(a);a=L(a);var d=K(a);a=Yc(a);return c(b,d,a)};b.l=c;return b}();e=function(a,e,l){switch(arguments.length){case 0:return d.call(this);case 1:return c.call(this,a);case 2:return b.call(this,a,e);default:var h=null;if(2<arguments.length){h=0;for(var k=Array(arguments.length-2);h<k.length;)k[h]=arguments[h+2],++h;h=new H(k,0,null)}return f.l(a,e,h)}throw Error("Invalid arity: "+arguments.length);};e.G=2;e.F=f.F;e.D=d;e.c=c;e.f=b;e.l=f.l;return e}()}
+var hf=function hf(a){switch(arguments.length){case 0:return hf.D();case 1:return hf.c(arguments[0]);case 2:return hf.f(arguments[0],arguments[1]);case 3:return hf.h(arguments[0],arguments[1],arguments[2]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return hf.l(arguments[0],arguments[1],arguments[2],new H(c.slice(3),0,null))}};hf.D=function(){return ke};hf.c=function(a){return a};
+hf.f=function(a,b){return function(){function c(c,d,e){c=b.h?b.h(c,d,e):b.call(null,c,d,e);return a.c?a.c(c):a.call(null,c)}function d(c,d){c=b.f?b.f(c,d):b.call(null,c,d);return a.c?a.c(c):a.call(null,c)}function e(c){c=b.c?b.c(c):b.call(null,c);return a.c?a.c(c):a.call(null,c)}function f(){var c=b.D?b.D():b.call(null);return a.c?a.c(c):a.call(null,c)}var h=null,k=function(){function c(a,b,c,e){var f=null;if(3<arguments.length){f=0;for(var h=Array(arguments.length-3);f<h.length;)h[f]=arguments[f+
+3],++f;f=new H(h,0,null)}return d.call(this,a,b,c,f)}function d(c,d,e,f){c=Ye(b,c,d,e,f);return a.c?a.c(c):a.call(null,c)}c.G=3;c.F=function(a){var b=K(a);a=L(a);var c=K(a);a=L(a);var e=K(a);a=Yc(a);return d(b,c,e,a)};c.l=d;return c}();h=function(a,b,h,q){switch(arguments.length){case 0:return f.call(this);case 1:return e.call(this,a);case 2:return d.call(this,a,b);case 3:return c.call(this,a,b,h);default:var m=null;if(3<arguments.length){m=0;for(var l=Array(arguments.length-3);m<l.length;)l[m]=arguments[m+
+3],++m;m=new H(l,0,null)}return k.l(a,b,h,m)}throw Error("Invalid arity: "+arguments.length);};h.G=3;h.F=k.F;h.D=f;h.c=e;h.f=d;h.h=c;h.l=k.l;return h}()};
+hf.h=function(a,b,c){return function(){function d(d,e,f){d=c.h?c.h(d,e,f):c.call(null,d,e,f);d=b.c?b.c(d):b.call(null,d);return a.c?a.c(d):a.call(null,d)}function e(d,e){d=c.f?c.f(d,e):c.call(null,d,e);d=b.c?b.c(d):b.call(null,d);return a.c?a.c(d):a.call(null,d)}function f(d){d=c.c?c.c(d):c.call(null,d);d=b.c?b.c(d):b.call(null,d);return a.c?a.c(d):a.call(null,d)}function h(){var d=c.D?c.D():c.call(null);d=b.c?b.c(d):b.call(null,d);return a.c?a.c(d):a.call(null,d)}var k=null,l=function(){function d(a,
+b,c,d){var f=null;if(3<arguments.length){f=0;for(var h=Array(arguments.length-3);f<h.length;)h[f]=arguments[f+3],++f;f=new H(h,0,null)}return e.call(this,a,b,c,f)}function e(d,e,f,h){d=Ye(c,d,e,f,h);d=b.c?b.c(d):b.call(null,d);return a.c?a.c(d):a.call(null,d)}d.G=3;d.F=function(a){var b=K(a);a=L(a);var c=K(a);a=L(a);var d=K(a);a=Yc(a);return e(b,c,d,a)};d.l=e;return d}();k=function(a,b,c,k){switch(arguments.length){case 0:return h.call(this);case 1:return f.call(this,a);case 2:return e.call(this,
+a,b);case 3:return d.call(this,a,b,c);default:var m=null;if(3<arguments.length){m=0;for(var q=Array(arguments.length-3);m<q.length;)q[m]=arguments[m+3],++m;m=new H(q,0,null)}return l.l(a,b,c,m)}throw Error("Invalid arity: "+arguments.length);};k.G=3;k.F=l.F;k.D=h;k.c=f;k.f=e;k.h=d;k.l=l.l;return k}()};
+hf.l=function(a,b,c,d){return function(a){return function(){function b(a){var b=null;if(0<arguments.length){b=0;for(var d=Array(arguments.length-0);b<d.length;)d[b]=arguments[b+0],++b;b=new H(d,0,null)}return c.call(this,b)}function c(b){b=We(K(a),b);for(var c=L(a);;)if(c){var d=K(c);b=d.c?d.c(b):d.call(null,b);c=L(c)}else return b}b.G=0;b.F=function(a){a=G(a);return c(a)};b.l=c;return b}()}(we(yd(a,yd(b,yd(c,d)))))};
+hf.F=function(a){var b=K(a),c=L(a);a=K(c);var d=L(c);c=K(d);d=L(d);return this.l(b,a,c,d)};hf.G=3;
+var jf=function jf(a){switch(arguments.length){case 1:return jf.c(arguments[0]);case 2:return jf.f(arguments[0],arguments[1]);case 3:return jf.h(arguments[0],arguments[1],arguments[2]);case 4:return jf.C(arguments[0],arguments[1],arguments[2],arguments[3]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return jf.l(arguments[0],arguments[1],arguments[2],arguments[3],new H(c.slice(4),0,null))}};jf.c=function(a){return a};
+jf.f=function(a,b){return function(){function c(c,d,e){return a.C?a.C(b,c,d,e):a.call(null,b,c,d,e)}function d(c,d){return a.h?a.h(b,c,d):a.call(null,b,c,d)}function e(c){return a.f?a.f(b,c):a.call(null,b,c)}function f(){return a.c?a.c(b):a.call(null,b)}var h=null,k=function(){function c(a,b,c,e){var f=null;if(3<arguments.length){f=0;for(var h=Array(arguments.length-3);f<h.length;)h[f]=arguments[f+3],++f;f=new H(h,0,null)}return d.call(this,a,b,c,f)}function d(c,d,e,f){return Ld(a,b,c,d,e,S([f]))}
+c.G=3;c.F=function(a){var b=K(a);a=L(a);var c=K(a);a=L(a);var e=K(a);a=Yc(a);return d(b,c,e,a)};c.l=d;return c}();h=function(a,b,h,q){switch(arguments.length){case 0:return f.call(this);case 1:return e.call(this,a);case 2:return d.call(this,a,b);case 3:return c.call(this,a,b,h);default:var m=null;if(3<arguments.length){m=0;for(var l=Array(arguments.length-3);m<l.length;)l[m]=arguments[m+3],++m;m=new H(l,0,null)}return k.l(a,b,h,m)}throw Error("Invalid arity: "+arguments.length);};h.G=3;h.F=k.F;h.D=
+f;h.c=e;h.f=d;h.h=c;h.l=k.l;return h}()};
+jf.h=function(a,b,c){return function(){function d(d,e,f){return a.N?a.N(b,c,d,e,f):a.call(null,b,c,d,e,f)}function e(d,e){return a.C?a.C(b,c,d,e):a.call(null,b,c,d,e)}function f(d){return a.h?a.h(b,c,d):a.call(null,b,c,d)}function h(){return a.f?a.f(b,c):a.call(null,b,c)}var k=null,l=function(){function d(a,b,c,d){var f=null;if(3<arguments.length){f=0;for(var h=Array(arguments.length-3);f<h.length;)h[f]=arguments[f+3],++f;f=new H(h,0,null)}return e.call(this,a,b,c,f)}function e(d,e,f,h){return Ld(a,
+b,c,d,e,S([f,h]))}d.G=3;d.F=function(a){var b=K(a);a=L(a);var c=K(a);a=L(a);var d=K(a);a=Yc(a);return e(b,c,d,a)};d.l=e;return d}();k=function(a,b,c,k){switch(arguments.length){case 0:return h.call(this);case 1:return f.call(this,a);case 2:return e.call(this,a,b);case 3:return d.call(this,a,b,c);default:var m=null;if(3<arguments.length){m=0;for(var q=Array(arguments.length-3);m<q.length;)q[m]=arguments[m+3],++m;m=new H(q,0,null)}return l.l(a,b,c,m)}throw Error("Invalid arity: "+arguments.length);
+};k.G=3;k.F=l.F;k.D=h;k.c=f;k.f=e;k.h=d;k.l=l.l;return k}()};
+jf.C=function(a,b,c,d){return function(){function e(e,f,h){return a.ga?a.ga(b,c,d,e,f,h):a.call(null,b,c,d,e,f,h)}function f(e,f){return a.N?a.N(b,c,d,e,f):a.call(null,b,c,d,e,f)}function h(e){return a.C?a.C(b,c,d,e):a.call(null,b,c,d,e)}function k(){return a.h?a.h(b,c,d):a.call(null,b,c,d)}var l=null,m=function(){function e(a,b,c,d){var e=null;if(3<arguments.length){e=0;for(var h=Array(arguments.length-3);e<h.length;)h[e]=arguments[e+3],++e;e=new H(h,0,null)}return f.call(this,a,b,c,e)}function f(e,
+f,h,k){return Ld(a,b,c,d,e,S([f,h,k]))}e.G=3;e.F=function(a){var b=K(a);a=L(a);var c=K(a);a=L(a);var d=K(a);a=Yc(a);return f(b,c,d,a)};e.l=f;return e}();l=function(a,b,c,d){switch(arguments.length){case 0:return k.call(this);case 1:return h.call(this,a);case 2:return f.call(this,a,b);case 3:return e.call(this,a,b,c);default:var l=null;if(3<arguments.length){l=0;for(var q=Array(arguments.length-3);l<q.length;)q[l]=arguments[l+3],++l;l=new H(q,0,null)}return m.l(a,b,c,l)}throw Error("Invalid arity: "+
+arguments.length);};l.G=3;l.F=m.F;l.D=k;l.c=h;l.f=f;l.h=e;l.l=m.l;return l}()};jf.l=function(a,b,c,d,e){return function(){function f(a){var b=null;if(0<arguments.length){b=0;for(var c=Array(arguments.length-0);b<c.length;)c[b]=arguments[b+0],++b;b=new H(c,0,null)}return h.call(this,b)}function h(f){return Ye(a,b,c,d,Pe.f(e,f))}f.G=0;f.F=function(a){a=G(a);return h(a)};f.l=h;return f}()};jf.F=function(a){var b=K(a),c=L(a);a=K(c);var d=L(c);c=K(d);var e=L(d);d=K(e);e=L(e);return this.l(b,a,c,d,e)};
+jf.G=4;
+function kf(){var a=lf,b=mf;return function(){function c(c,d,e){c=null==c?b:c;return a.h?a.h(c,d,e):a.call(null,c,d,e)}function d(c,d){c=null==c?b:c;return a.f?a.f(c,d):a.call(null,c,d)}function e(c){c=null==c?b:c;return a.c?a.c(c):a.call(null,c)}var f=null,h=function(){function c(a,b,c,e){var f=null;if(3<arguments.length){f=0;for(var h=Array(arguments.length-3);f<h.length;)h[f]=arguments[f+3],++f;f=new H(h,0,null)}return d.call(this,a,b,c,f)}function d(c,d,e,f){return Ye(a,null==c?b:c,d,e,f)}c.G=
+3;c.F=function(a){var b=K(a);a=L(a);var c=K(a);a=L(a);var e=K(a);a=Yc(a);return d(b,c,e,a)};c.l=d;return c}();f=function(a,b,f,n){switch(arguments.length){case 1:return e.call(this,a);case 2:return d.call(this,a,b);case 3:return c.call(this,a,b,f);default:var k=null;if(3<arguments.length){k=0;for(var m=Array(arguments.length-3);k<m.length;)m[k]=arguments[k+3],++k;k=new H(m,0,null)}return h.l(a,b,f,k)}throw Error("Invalid arity: "+arguments.length);};f.G=3;f.F=h.F;f.c=e;f.f=d;f.h=c;f.l=h.l;return f}()}
+function nf(a){this.state=a;this.pa=this.Db=this.meta=null;this.I=16386;this.m=6455296}g=nf.prototype;g.equiv=function(a){return this.H(null,a)};g.H=function(a,b){return this===b};g.hb=function(){return this.state};g.T=function(){return this.meta};
+g.Ub=function(a,b,c){a=G(this.pa);for(var d=null,e=0,f=0;;)if(f<e){var h=d.K(null,f),k=T(h,0);h=T(h,1);h.C?h.C(k,this,b,c):h.call(null,k,this,b,c);f+=1}else if(a=G(a))Xd(a)?(d=zc(a),a=Bc(a),k=d,e=P(d),d=k):(d=K(a),k=T(d,0),h=T(d,1),h.C?h.C(k,this,b,c):h.call(null,k,this,b,c),a=L(a),d=null,e=0),f=0;else return null};g.Tb=function(a,b,c){this.pa=U.h(this.pa,b,c);return this};g.Vb=function(a,b){return this.pa=Id.f(this.pa,b)};g.L=function(){return da(this)};function of(a){return new nf(a)}
+function pf(a,b){if(a instanceof nf){var c=a.Db;if(null!=c&&!w(c.c?c.c(b):c.call(null,b)))throw Error("Validator rejected reference state");c=a.state;a.state=b;null!=a.pa&&pc(a,c,b);return b}return Ec(a,b)}
+var qf=function qf(a){switch(arguments.length){case 2:return qf.f(arguments[0],arguments[1]);case 3:return qf.h(arguments[0],arguments[1],arguments[2]);case 4:return qf.C(arguments[0],arguments[1],arguments[2],arguments[3]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return qf.l(arguments[0],arguments[1],arguments[2],arguments[3],new H(c.slice(4),0,null))}};
+qf.f=function(a,b){if(a instanceof nf){var c=a.state;b=b.c?b.c(c):b.call(null,c);a=pf(a,b)}else a=Fc.f(a,b);return a};qf.h=function(a,b,c){if(a instanceof nf){var d=a.state;b=b.f?b.f(d,c):b.call(null,d,c);a=pf(a,b)}else a=Fc.h(a,b,c);return a};qf.C=function(a,b,c,d){if(a instanceof nf){var e=a.state;b=b.h?b.h(e,c,d):b.call(null,e,c,d);a=pf(a,b)}else a=Fc.C(a,b,c,d);return a};qf.l=function(a,b,c,d,e){return a instanceof nf?pf(a,Ye(b,a.state,c,d,e)):Fc.N(a,b,c,d,e)};
+qf.F=function(a){var b=K(a),c=L(a);a=K(c);var d=L(c);c=K(d);var e=L(d);d=K(e);e=L(e);return this.l(b,a,c,d,e)};qf.G=4;
+var rf=function rf(a){switch(arguments.length){case 1:return rf.c(arguments[0]);case 2:return rf.f(arguments[0],arguments[1]);case 3:return rf.h(arguments[0],arguments[1],arguments[2]);case 4:return rf.C(arguments[0],arguments[1],arguments[2],arguments[3]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return rf.l(arguments[0],arguments[1],arguments[2],arguments[3],new H(c.slice(4),0,null))}};
+rf.c=function(a){return function(b){return function(){function c(c,d){d=a.c?a.c(d):a.call(null,d);return b.f?b.f(c,d):b.call(null,c,d)}function d(a){return b.c?b.c(a):b.call(null,a)}function e(){return b.D?b.D():b.call(null)}var f=null,h=function(){function c(a,b,c){var e=null;if(2<arguments.length){e=0;for(var f=Array(arguments.length-2);e<f.length;)f[e]=arguments[e+2],++e;e=new H(f,0,null)}return d.call(this,a,b,e)}function d(c,d,e){d=Xe(a,d,e);return b.f?b.f(c,d):b.call(null,c,d)}c.G=2;c.F=function(a){var b=
+K(a);a=L(a);var c=K(a);a=Yc(a);return d(b,c,a)};c.l=d;return c}();f=function(a,b,f){switch(arguments.length){case 0:return e.call(this);case 1:return d.call(this,a);case 2:return c.call(this,a,b);default:var k=null;if(2<arguments.length){k=0;for(var m=Array(arguments.length-2);k<m.length;)m[k]=arguments[k+2],++k;k=new H(m,0,null)}return h.l(a,b,k)}throw Error("Invalid arity: "+arguments.length);};f.G=2;f.F=h.F;f.D=e;f.c=d;f.f=c;f.l=h.l;return f}()}};
+rf.f=function(a,b){return new Ee(null,function(){var c=G(b);if(c){if(Xd(c)){for(var d=zc(c),e=P(d),f=Ie(e),h=0;;)if(h<e)Le(f,function(){var b=Bb.f(d,h);return a.c?a.c(b):a.call(null,b)}()),h+=1;else break;return Ke(f.Ha(),rf.f(a,Bc(c)))}return yd(function(){var b=K(c);return a.c?a.c(b):a.call(null,b)}(),rf.f(a,Yc(c)))}return null},null,null)};
+rf.h=function(a,b,c){return new Ee(null,function(){var d=G(b),e=G(c);if(d&&e){var f=yd;var h=K(d);var k=K(e);h=a.f?a.f(h,k):a.call(null,h,k);d=f(h,rf.h(a,Yc(d),Yc(e)))}else d=null;return d},null,null)};rf.C=function(a,b,c,d){return new Ee(null,function(){var e=G(b),f=G(c),h=G(d);if(e&&f&&h){var k=yd;var l=K(e);var m=K(f),n=K(h);l=a.h?a.h(l,m,n):a.call(null,l,m,n);e=k(l,rf.C(a,Yc(e),Yc(f),Yc(h)))}else e=null;return e},null,null)};
+rf.l=function(a,b,c,d,e){var f=function l(a){return new Ee(null,function(){var b=rf.f(G,a);return df(ke,b)?yd(rf.f(K,b),l(rf.f(Yc,b))):null},null,null)};return rf.f(function(){return function(b){return We(a,b)}}(f),f(Dd.l(e,d,S([c,b]))))};rf.F=function(a){var b=K(a),c=L(a);a=K(c);var d=L(c);c=K(d);var e=L(d);d=K(e);e=L(e);return this.l(b,a,c,d,e)};rf.G=4;
+function sf(a,b){if("number"!==typeof a)throw Error("Assert failed: (number? n)");return new Ee(null,function(){if(0<a){var c=G(b);return c?yd(K(c),sf(a-1,Yc(c))):null}return null},null,null)}function tf(a,b){if("number"!==typeof a)throw Error("Assert failed: (number? n)");return new Ee(null,function(c){return function(){return c(a,b)}}(function(a,b){for(;;)if(b=G(b),0<a&&b)--a,b=Yc(b);else return b}),null,null)}function uf(a){return rf.h(function(a){return a},a,tf(2,a))}
+function vf(a,b,c,d){this.meta=a;this.count=b;this.A=c;this.next=d;this.B=null;this.m=32374988;this.I=1}g=vf.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,this.count)}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){return null==this.next?1<this.count?this.next=new vf(null,this.count-1,this.A,null):-1===this.count?this:null:this.next};
+g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};g.ha=function(a,b){if(-1===this.count)for(var c=b.f?b.f(this.A,this.A):b.call(null,this.A,this.A);;){if(kd(c))return C(c);c=b.f?b.f(c,this.A):b.call(null,c,this.A)}else for(a=1,c=this.A;;)if(a<this.count){c=b.f?b.f(c,this.A):b.call(null,c,this.A);if(kd(c))return C(c);a+=1}else return c};
+g.ia=function(a,b,c){if(-1===this.count)for(c=b.f?b.f(c,this.A):b.call(null,c,this.A);;){if(kd(c))return C(c);c=b.f?b.f(c,this.A):b.call(null,c,this.A)}else for(a=0;;)if(a<this.count){c=b.f?b.f(c,this.A):b.call(null,c,this.A);if(kd(c))return C(c);a+=1}else return c};g.ja=function(){return this.A};g.ma=function(){return null==this.next?1<this.count?this.next=new vf(null,this.count-1,this.A,null):-1===this.count?this:Zc:this.next};g.O=function(){return this};
+g.V=function(a,b){return new vf(b,this.count,this.A,this.next)};g.W=function(a,b){return yd(b,this)};function wf(a){return 0<a?new vf(null,a,null,null):Zc}var xf=function xf(a){switch(arguments.length){case 0:return xf.D();case 1:return xf.c(arguments[0]);case 2:return xf.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return xf.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};xf.D=function(){return Zc};
+xf.c=function(a){return new Ee(null,function(){return a},null,null)};xf.f=function(a,b){return new Ee(null,function(){var c=G(a),d=G(b);return c&&d?yd(K(c),yd(K(d),xf.f(Yc(c),Yc(d)))):null},null,null)};xf.l=function(a,b,c){return new Ee(null,function(){var d=rf.f(G,Dd.l(c,b,S([a])));return df(ke,d)?Pe.f(rf.f(K,d),We(xf,rf.f(Yc,d))):null},null,null)};xf.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};xf.G=2;
+function yf(a,b){return new Ee(null,function(){var c=G(b);if(c){if(Xd(c)){for(var d=zc(c),e=P(d),f=Ie(e),h=0;;)if(h<e){var k=Bb.f(d,h);k=a.c?a.c(k):a.call(null,k);w(k)&&(k=Bb.f(d,h),f.add(k));h+=1}else break;return Ke(f.Ha(),yf(a,Bc(c)))}d=K(c);c=Yc(c);return w(a.c?a.c(d):a.call(null,d))?yd(d,yf(a,c)):yf(a,c)}return null},null,null)}function zf(a,b){return yf(gf(a),b)}
+function Af(a){return function d(a){return new Ee(null,function(){var c=yd;if(w(Td.c?Td.c(a):Td.call(null,a))){var f=S([G.c?G.c(a):G.call(null,a)]);f=We(Pe,Xe(rf,d,f))}else f=null;return c(a,f)},null,null)}(a)}function Bf(a){return yf(function(a){return!Td(a)},Yc(Af(a)))}
+var lf=function lf(a){switch(arguments.length){case 0:return lf.D();case 1:return lf.c(arguments[0]);case 2:return lf.f(arguments[0],arguments[1]);case 3:return lf.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};lf.D=function(){return Ed};lf.c=function(a){return a};lf.f=function(a,b){return null!=a?null!=a&&(a.I&4||t===a.od)?Zb(uc(sb(tc,sc(a),b)),Nd(a)):sb(zb,a,b):sb(Dd,Zc,b)};
+lf.h=function(a,b,c){return null!=a&&(a.I&4||t===a.od)?Zb(uc(le(b,Qe,sc(a),c)),Nd(a)):le(b,Dd,a,c)};lf.G=3;function Cf(a,b){return uc(sb(function(b,d){return Qe.f(b,a.c?a.c(d):a.call(null,d))},sc(Ed),b))}function Df(a,b,c){return new Ee(null,function(){var d=G(c);if(d){var e=sf(a,d);return a===P(e)?yd(e,Df(a,b,tf(b,d))):null}return null},null,null)}
+var Ef=function Ef(a,b,c){b=G(b);var e=K(b),f=L(b);return f?U.h(a,e,function(){var b=F.f(a,e);return Ef.h?Ef.h(b,f,c):Ef.call(null,b,f,c)}()):U.h(a,e,c)},Ff=function Ff(a){switch(arguments.length){case 3:return Ff.h(arguments[0],arguments[1],arguments[2]);case 4:return Ff.C(arguments[0],arguments[1],arguments[2],arguments[3]);case 5:return Ff.N(arguments[0],arguments[1],arguments[2],arguments[3],arguments[4]);case 6:return Ff.ga(arguments[0],arguments[1],arguments[2],arguments[3],arguments[4],arguments[5]);
+default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Ff.l(arguments[0],arguments[1],arguments[2],arguments[3],arguments[4],arguments[5],new H(c.slice(6),0,null))}};Ff.h=function(a,b,c){b=G(b);var d=K(b);return(b=L(b))?U.h(a,d,Ff.h(F.f(a,d),b,c)):U.h(a,d,function(){var b=F.f(a,d);return c.c?c.c(b):c.call(null,b)}())};
+Ff.C=function(a,b,c,d){b=G(b);var e=K(b);return(b=L(b))?U.h(a,e,Ff.C(F.f(a,e),b,c,d)):U.h(a,e,function(){var b=F.f(a,e);return c.f?c.f(b,d):c.call(null,b,d)}())};Ff.N=function(a,b,c,d,e){b=G(b);var f=K(b);return(b=L(b))?U.h(a,f,Ff.N(F.f(a,f),b,c,d,e)):U.h(a,f,function(){var b=F.f(a,f);return c.h?c.h(b,d,e):c.call(null,b,d,e)}())};
+Ff.ga=function(a,b,c,d,e,f){b=G(b);var h=K(b);return(b=L(b))?U.h(a,h,Ff.ga(F.f(a,h),b,c,d,e,f)):U.h(a,h,function(){var b=F.f(a,h);return c.C?c.C(b,d,e,f):c.call(null,b,d,e,f)}())};Ff.l=function(a,b,c,d,e,f,h){var k=G(b);b=K(k);return(k=L(k))?U.h(a,b,Ld(Ff,F.f(a,b),k,c,d,S([e,f,h]))):U.h(a,b,Ld(c,F.f(a,b),d,e,f,S([h])))};Ff.F=function(a){var b=K(a),c=L(a);a=K(c);var d=L(c);c=K(d);var e=L(d);d=K(e);var f=L(e);e=K(f);var h=L(f);f=K(h);h=L(h);return this.l(b,a,c,d,e,f,h)};Ff.G=6;
+function Gf(a,b,c){return U.h(a,b,function(){var d=F.f(a,b);return c.c?c.c(d):c.call(null,d)}())}function Hf(a,b,c,d){return U.h(a,b,function(){var e=F.f(a,b);return c.f?c.f(e,d):c.call(null,e,d)}())}function If(a,b){this.$=a;this.j=b}function Jf(a){return new If(a,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null])}function Kf(a){return new If(a.$,qb(a.j))}
+function Lf(a){a=a.w;return 32>a?0:a-1>>>5<<5}function Mf(a,b,c){for(;;){if(0===b)return c;var d=Jf(a);d.j[0]=c;c=d;b-=5}}var Nf=function Nf(a,b,c,d){var f=Kf(c),h=a.w-1>>>b&31;5===b?f.j[h]=d:(c=c.j[h],null!=c?(b-=5,a=Nf.C?Nf.C(a,b,c,d):Nf.call(null,a,b,c,d)):a=Mf(null,b-5,d),f.j[h]=a);return f};function Of(a,b){throw Error(["No item ",B.c(a)," in vector of length ",B.c(b)].join(""));}
+function Pf(a,b){if(b>=Lf(a))return a.La;var c=a.root;for(a=a.shift;;)if(0<a){var d=a-5;c=c.j[b>>>a&31];a=d}else return c.j}var Rf=function Rf(a,b,c,d,e){var h=Kf(c);if(0===b)h.j[d&31]=e;else{var k=d>>>b&31;b-=5;c=c.j[k];a=Rf.N?Rf.N(a,b,c,d,e):Rf.call(null,a,b,c,d,e);h.j[k]=a}return h},Sf=function Sf(a,b,c){var e=a.w-2>>>b&31;if(5<b){b-=5;var f=c.j[e];a=Sf.h?Sf.h(a,b,f):Sf.call(null,a,b,f);if(null==a&&0===e)return null;c=Kf(c);c.j[e]=a;return c}if(0===e)return null;c=Kf(c);c.j[e]=null;return c};
+function Tf(a,b,c,d,e,f){this.i=a;this.base=b;this.j=c;this.na=d;this.start=e;this.end=f}Tf.prototype.da=function(){return this.i<this.end};Tf.prototype.next=function(){32===this.i-this.base&&(this.j=Pf(this.na,this.i),this.base+=32);var a=this.j[this.i&31];this.i+=1;return a};function Uf(a,b,c){return new Tf(b,b-b%32,b<P(a)?Pf(a,b):null,a,b,c)}function Vf(a,b,c,d){return c<d?Wf(a,b,ud(a,c),c+1,d):b.D?b.D():b.call(null)}
+function Wf(a,b,c,d,e){var f=c;c=d;for(d=Pf(a,d);;)if(c<e){var h=c&31;d=0===h?Pf(a,c):d;h=d[h];f=b.f?b.f(f,h):b.call(null,f,h);if(kd(f))return C(f);c+=1}else return f}function W(a,b,c,d,e,f){this.meta=a;this.w=b;this.shift=c;this.root=d;this.La=e;this.B=f;this.m=167666463;this.I=139268}g=W.prototype;g.ib=function(a,b){return 0<=b&&b<this.w?new Xf(b,Pf(this,b)[b&31]):null};g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){return"number"===typeof b?this.S(null,b,c):c};
+g.Hb=function(a,b,c){a=0;for(var d=c;;)if(a<this.w){var e=Pf(this,a);c=e.length;a:for(var f=0;;)if(f<c){var h=f+a,k=e[f];d=b.h?b.h(d,h,k):b.call(null,d,h,k);if(kd(d)){e=d;break a}f+=1}else{e=d;break a}if(kd(e))return C(e);a+=c;d=e}else return d};g.Ac=t;g.K=function(a,b){return(0<=b&&b<this.w?Pf(this,b):Of(b,this.w))[b&31]};g.S=function(a,b,c){return 0<=b&&b<this.w?Pf(this,b)[b&31]:c};
+g.Wa=function(a,b,c){if(0<=b&&b<this.w)return Lf(this)<=b?(a=qb(this.La),a[b&31]=c,new W(this.meta,this.w,this.shift,this.root,a,null)):new W(this.meta,this.w,this.shift,Rf(this,this.shift,this.root,b,c),this.La,null);if(b===this.w)return this.W(null,c);throw Error(["Index ",B.c(b)," out of bounds  [0,",B.c(this.w),"]"].join(""));};g.Pa=function(){return Uf(this,0,this.w)};g.T=function(){return this.meta};g.X=function(){return this.w};g.jb=function(){return 0<this.w?this.K(null,this.w-1):null};
+g.kb=function(){if(0===this.w)throw Error("Can't pop empty vector");if(1===this.w)return Zb(Ed,this.meta);if(1<this.w-Lf(this))return new W(this.meta,this.w-1,this.shift,this.root,this.La.slice(0,-1),null);var a=Pf(this,this.w-2),b=Sf(this,this.shift,this.root);b=null==b?X:b;var c=this.w-1;return 5<this.shift&&null==b.j[1]?new W(this.meta,c,this.shift-5,b.j[0],a,null):new W(this.meta,c,this.shift,b,a,null)};g.sb=function(){return 0<this.w?new wd(this,this.w-1,null):null};
+g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){if(b instanceof W)if(this.w===P(b))for(a=this.Pa(null),b=Hc(b);;)if(a.da()){var c=a.next(),d=b.next();if(!M.f(c,d))return!1}else return!0;else return!1;else return xd(this,b)};
+g.Gb=function(){var a=this.w,b=this.shift,c=new If({},qb(this.root.j)),d=this.La,e=[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];Yd(d,0,e,0,d.length);return new Yf(a,b,c,e)};g.Z=function(){return Zb(Ed,this.meta)};g.ha=function(a,b){return Vf(this,b,0,this.w)};
+g.ia=function(a,b,c){a=0;for(var d=c;;)if(a<this.w){var e=Pf(this,a);c=e.length;a:for(var f=0;;)if(f<c){var h=e[f];d=b.f?b.f(d,h):b.call(null,d,h);if(kd(d)){e=d;break a}f+=1}else{e=d;break a}if(kd(e))return C(e);a+=c;d=e}else return d};g.qa=function(a,b,c){if("number"===typeof b)return this.Wa(null,b,c);throw Error("Vector's key for assoc must be a number.");};
+g.O=function(){if(0===this.w)var a=null;else if(32>=this.w)a=new H(this.La,0,null);else{a:{a=this.root;for(var b=this.shift;;)if(0<b)b-=5,a=a.j[0];else{a=a.j;break a}}a=new Zf(this,a,0,0,null)}return a};g.V=function(a,b){return new W(b,this.w,this.shift,this.root,this.La,this.B)};
+g.W=function(a,b){if(32>this.w-Lf(this)){a=this.La.length;for(var c=Array(a+1),d=0;;)if(d<a)c[d]=this.La[d],d+=1;else break;c[a]=b;return new W(this.meta,this.w+1,this.shift,this.root,c,null)}a=(c=this.w>>>5>1<<this.shift)?this.shift+5:this.shift;c?(c=Jf(null),c.j[0]=this.root,d=Mf(null,this.shift,new If(null,this.La)),c.j[1]=d):c=Nf(this,this.shift,this.root,new If(null,this.La));return new W(this.meta,this.w+1,a,c,[b],null)};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.K(null,c);case 3:return this.S(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.K(null,c)};a.h=function(a,c,d){return this.S(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.K(null,a)};g.f=function(a,b){return this.S(null,a,b)};
+var X=new If(null,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]),Ed=new W(null,0,5,X,[],dd);function $f(a){var b=a.length;if(32>b)return new W(null,b,5,X,a,null);for(var c=32,d=(new W(null,32,5,X,a.slice(0,32),null)).Gb(null);;)if(c<b){var e=c+1;d=Qe.f(d,a[c]);c=e}else return uc(d)}W.prototype[nb]=function(){return ad(this)};function ag(a){return jb(a)?$f(a):uc(sb(tc,sc(Ed),a))}
+var bg=function bg(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return bg.l(0<c.length?new H(c.slice(0),0,null):null)};bg.l=function(a){return a instanceof H&&0===a.i?$f(a.j):ag(a)};bg.G=0;bg.F=function(a){return this.l(G(a))};function Zf(a,b,c,d,e){this.Ra=a;this.node=b;this.i=c;this.Fa=d;this.meta=e;this.B=null;this.m=32375020;this.I=1536}g=Zf.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){if(this.Fa+1<this.node.length){var a=new Zf(this.Ra,this.node,this.i,this.Fa+1,null);return null==a?null:a}return this.Sc()};
+g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zc};g.ha=function(a,b){return Vf(this.Ra,b,this.i+this.Fa,P(this.Ra))};g.ia=function(a,b,c){return Wf(this.Ra,b,c,this.i+this.Fa,P(this.Ra))};g.ja=function(){return this.node[this.Fa]};g.ma=function(){if(this.Fa+1<this.node.length){var a=new Zf(this.Ra,this.node,this.i,this.Fa+1,null);return null==a?Zc:a}return this.jc(null)};g.O=function(){return this};
+g.Bc=function(){var a=this.node;return new He(a,this.Fa,a.length)};g.jc=function(){var a=this.i+this.node.length;return a<wb(this.Ra)?new Zf(this.Ra,Pf(this.Ra,a),a,0,null):Zc};g.V=function(a,b){return new Zf(this.Ra,this.node,this.i,this.Fa,b)};g.W=function(a,b){return yd(b,this)};g.Sc=function(){var a=this.i+this.node.length;return a<wb(this.Ra)?new Zf(this.Ra,Pf(this.Ra,a),a,0,null):null};Zf.prototype[nb]=function(){return ad(this)};
+function cg(a,b,c,d,e){this.meta=a;this.na=b;this.start=c;this.end=d;this.B=e;this.m=167666463;this.I=139264}g=cg.prototype;g.ib=function(a,b){if(0>b)return null;a=this.start+b;return a<this.end?new Xf(b,Jb.f(this.na,a)):null};g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){return"number"===typeof b?this.S(null,b,c):c};
+g.Hb=function(a,b,c){a=this.start;for(var d=0;;)if(a<this.end){var e=d,f=Bb.f(this.na,a);c=b.h?b.h(c,e,f):b.call(null,c,e,f);if(kd(c))return C(c);d+=1;a+=1}else return c};g.K=function(a,b){return 0>b||this.end<=this.start+b?Of(b,this.end-this.start):Bb.f(this.na,this.start+b)};g.S=function(a,b,c){return 0>b||this.end<=this.start+b?c:Bb.h(this.na,this.start+b,c)};
+g.Wa=function(a,b,c){a=this.start+b;if(0>b||this.end+1<=a)throw Error(["Index ",B.c(b)," out of bounds [0,",B.c(this.X(null)),"]"].join(""));b=this.meta;c=U.h(this.na,a,c);var d=this.end;a+=1;return dg(b,c,this.start,d>a?d:a,null)};g.Pa=function(){return null!=this.na&&t===this.na.Ac?Uf(this.na,this.start,this.end):new cf(this)};g.T=function(){return this.meta};g.X=function(){return this.end-this.start};g.jb=function(){return Bb.f(this.na,this.end-1)};
+g.kb=function(){if(this.start===this.end)throw Error("Can't pop empty vector");return dg(this.meta,this.na,this.start,this.end-1,null)};g.sb=function(){return this.start!==this.end?new wd(this,this.end-this.start-1,null):null};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Ed,this.meta)};g.ha=function(a,b){return null!=this.na&&t===this.na.Ac?Vf(this.na,b,this.start,this.end):nd(this,b)};
+g.ia=function(a,b,c){return null!=this.na&&t===this.na.Ac?Wf(this.na,b,c,this.start,this.end):od(this,b,c)};g.qa=function(a,b,c){if("number"===typeof b)return this.Wa(null,b,c);throw Error("Subvec's key for assoc must be a number.");};g.O=function(){var a=this;return function(b){return function e(d){return d===a.end?null:yd(Bb.f(a.na,d),new Ee(null,function(){return function(){return e(d+1)}}(b),null,null))}}(this)(a.start)};g.V=function(a,b){return dg(b,this.na,this.start,this.end,this.B)};
+g.W=function(a,b){return dg(this.meta,Vb(this.na,this.end,b),this.start,this.end+1,null)};g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.K(null,c);case 3:return this.S(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.K(null,c)};a.h=function(a,c,d){return this.S(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.K(null,a)};
+g.f=function(a,b){return this.S(null,a,b)};cg.prototype[nb]=function(){return ad(this)};function dg(a,b,c,d,e){for(;;)if(b instanceof cg)c=b.start+c,d=b.start+d,b=b.na;else{if(!Wd(b))throw Error("v must satisfy IVector");var f=P(b);if(0>c||0>d||c>f||d>f)throw Error("Index out of bounds");return new cg(a,b,c,d,e)}}
+var eg=function eg(a){switch(arguments.length){case 2:return eg.f(arguments[0],arguments[1]);case 3:return eg.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};eg.f=function(a,b){return eg.h(a,b,P(a))};eg.h=function(a,b,c){if(null==b||null==c)throw Error("Assert failed: (and (not (nil? start)) (not (nil? end)))");return dg(null,a,b|0,c|0,null)};eg.G=3;function fg(a,b){return a===b.$?b:new If(a,qb(b.j))}
+var gg=function gg(a,b,c,d){c=fg(a.root.$,c);var f=a.w-1>>>b&31;if(5===b)a=d;else{var h=c.j[f];null!=h?(b-=5,a=gg.C?gg.C(a,b,h,d):gg.call(null,a,b,h,d)):a=Mf(a.root.$,b-5,d)}c.j[f]=a;return c};function Yf(a,b,c,d){this.w=a;this.shift=b;this.root=c;this.La=d;this.I=88;this.m=275}g=Yf.prototype;
+g.zb=function(a,b){if(this.root.$){if(32>this.w-Lf(this))this.La[this.w&31]=b;else{a=new If(this.root.$,this.La);var c=[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];c[0]=b;this.La=c;this.w>>>5>1<<this.shift?(b=[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],c=this.shift+
+5,b[0]=this.root,b[1]=Mf(this.root.$,this.shift,a),this.root=new If(this.root.$,b),this.shift=c):this.root=gg(this,this.shift,this.root,a)}this.w+=1;return this}throw Error("conj! after persistent!");};g.Sb=function(){if(this.root.$){this.root.$=null;var a=this.w-Lf(this),b=Array(a);Yd(this.La,0,b,0,a);return new W(null,this.w,this.shift,this.root,b,null)}throw Error("persistent! called twice");};
+g.yb=function(a,b,c){if("number"===typeof b)return hg(this,b,c);throw Error("TransientVector's key for assoc! must be a number.");};
+function hg(a,b,c){if(a.root.$){if(0<=b&&b<a.w){if(Lf(a)<=b)a.La[b&31]=c;else{var d=function(){return function(){return function k(d,h){h=fg(a.root.$,h);if(0===d)h.j[b&31]=c;else{var f=b>>>d&31;d=k(d-5,h.j[f]);h.j[f]=d}return h}}(a)(a.shift,a.root)}();a.root=d}return a}if(b===a.w)return a.zb(null,c);throw Error(["Index ",B.c(b)," out of bounds for TransientVector of length",B.c(a.w)].join(""));}throw Error("assoc! after persistent!");}
+g.X=function(){if(this.root.$)return this.w;throw Error("count after persistent!");};g.K=function(a,b){if(this.root.$)return(0<=b&&b<this.w?Pf(this,b):Of(b,this.w))[b&31];throw Error("nth after persistent!");};g.S=function(a,b,c){return 0<=b&&b<this.w?this.K(null,b):c};g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){return"number"===typeof b?this.S(null,b,c):c};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.R(null,c);case 3:return this.J(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.R(null,c)};a.h=function(a,c,d){return this.J(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.R(null,a)};g.f=function(a,b){return this.J(null,a,b)};function ig(a,b){this.Lb=a;this.gc=b}
+ig.prototype.da=function(){var a=null!=this.Lb&&G(this.Lb);return a?a:(a=null!=this.gc)?this.gc.da():a};ig.prototype.next=function(){if(null!=this.Lb){var a=K(this.Lb);this.Lb=L(this.Lb);return a}if(null!=this.gc&&this.gc.da())return this.gc.next();throw Error("No such element");};ig.prototype.remove=function(){return Error("Unsupported operation")};function jg(a,b,c,d){this.meta=a;this.Oa=b;this.Qa=c;this.B=d;this.m=31850700;this.I=0}g=jg.prototype;g.toString=function(){return Jc(this)};
+g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){var a=L(this.Oa);return a?new jg(this.meta,a,this.Qa,null):null!=this.Qa?new jg(this.meta,this.Qa,null,null):null};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};
+g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};g.ja=function(){return K(this.Oa)};g.ma=function(){var a=L(this.Oa);return a?new jg(this.meta,a,this.Qa,null):null==this.Qa?this.Z(null):new jg(this.meta,this.Qa,null,null)};g.O=function(){return this};g.V=function(a,b){return new jg(b,this.Oa,this.Qa,this.B)};g.W=function(a,b){return yd(b,this)};jg.prototype[nb]=function(){return ad(this)};
+function kg(a,b,c,d,e){this.meta=a;this.count=b;this.Oa=c;this.Qa=d;this.B=e;this.I=139264;this.m=31858766}g=kg.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,this.count.c?this.count.c(this):this.count.call(null,this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.Pa=function(){return new ig(this.Oa,Hc(this.Qa))};g.T=function(){return this.meta};g.X=function(){return this.count};g.jb=function(){return K(this.Oa)};
+g.kb=function(){if(w(this.Oa)){var a=L(this.Oa);return a?new kg(this.meta,this.count-1,a,this.Qa,null):new kg(this.meta,this.count-1,G(this.Qa),Ed,null)}return this};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(lg,this.meta)};g.ja=function(){return K(this.Oa)};g.ma=function(){return Yc(G(this))};g.O=function(){var a=G(this.Qa),b=this.Oa;return w(w(b)?b:a)?new jg(null,this.Oa,G(a),null):null};
+g.V=function(a,b){return new kg(b,this.count,this.Oa,this.Qa,this.B)};g.W=function(a,b){w(this.Oa)?(a=this.Qa,b=new kg(this.meta,this.count+1,this.Oa,Dd.f(w(a)?a:Ed,b),null)):b=new kg(this.meta,this.count+1,Dd.f(this.Oa,b),Ed,null);return b};var lg=new kg(null,0,null,Ed,dd);kg.prototype[nb]=function(){return ad(this)};function mg(){this.m=2097152;this.I=0}mg.prototype.equiv=function(a){return this.H(null,a)};mg.prototype.H=function(){return!1};var ng=new mg;
+function og(a,b){return ae(Ud(b)&&!Vd(b)?P(a)===P(b)?(null!=a?a.m&1048576||t===a.Yd||(a.m?0:x(cc,a)):x(cc,a))?je(function(a,d,e){return M.f(F.h(b,d,ng),e)?!0:new hd},!0,a):df(function(a){return M.f(F.h(b,K(a),ng),Bd(a))},a):null:null)}function pg(a,b,c,d){this.i=0;this.Kd=a;this.Pc=b;this.Fd=c;this.$c=d}pg.prototype.da=function(){var a=this.i<this.Pc;return a?a:this.$c.da()};pg.prototype.next=function(){if(this.i<this.Pc){var a=ud(this.Fd,this.i);this.i+=1;return new Xf(a,Jb.f(this.Kd,a))}return this.$c.next()};
+pg.prototype.remove=function(){return Error("Unsupported operation")};function qg(a){this.s=a}qg.prototype.next=function(){if(null!=this.s){var a=K(this.s),b=T(a,0);a=T(a,1);this.s=L(this.s);return{value:[b,a],done:!1}}return{value:null,done:!0}};function rg(a){this.s=a}rg.prototype.next=function(){if(null!=this.s){var a=K(this.s);this.s=L(this.s);return{value:[a,a],done:!1}}return{value:null,done:!0}};
+function sg(a,b){if(b instanceof V)a:{var c=a.length;b=b.Ka;for(var d=0;;){if(c<=d){a=-1;break a}if(a[d]instanceof V&&b===a[d].Ka){a=d;break a}d+=2}}else if("string"==typeof b||"number"===typeof b)a:for(c=a.length,d=0;;){if(c<=d){a=-1;break a}if(b===a[d]){a=d;break a}d+=2}else if(b instanceof D)a:for(c=a.length,b=b.eb,d=0;;){if(c<=d){a=-1;break a}if(a[d]instanceof D&&b===a[d].eb){a=d;break a}d+=2}else if(null==b)a:for(b=a.length,c=0;;){if(b<=c){a=-1;break a}if(null==a[c]){a=c;break a}c+=2}else a:for(c=
+a.length,d=0;;){if(c<=d){a=-1;break a}if(M.f(b,a[d])){a=d;break a}d+=2}return a}function Xf(a,b){this.key=a;this.A=b;this.B=null;this.m=166619935;this.I=0}g=Xf.prototype;g.ib=function(a,b){switch(b){case 0:return new Xf(0,this.key);case 1:return new Xf(1,this.A);default:return null}};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.R=function(a,b){return this.S(null,b,null)};g.J=function(a,b,c){return this.S(null,b,c)};g.K=function(a,b){if(0===b)return this.key;if(1===b)return this.A;throw Error("Index out of bounds");};
+g.S=function(a,b,c){return 0===b?this.key:1===b?this.A:c};g.Wa=function(a,b,c){return(new W(null,2,5,X,[this.key,this.A],null)).Wa(null,b,c)};g.T=function(){return null};g.X=function(){return 2};g.Dc=function(){return this.key};g.Ec=function(){return this.A};g.jb=function(){return this.A};g.kb=function(){return new W(null,1,5,X,[this.key],null)};g.sb=function(){return new H([this.A,this.key],0,null)};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};
+g.H=function(a,b){return xd(this,b)};g.Z=function(){return null};g.ha=function(a,b){return nd(this,b)};g.ia=function(a,b,c){return od(this,b,c)};g.qa=function(a,b,c){return U.h(new W(null,2,5,X,[this.key,this.A],null),b,c)};g.O=function(){return new H([this.key,this.A],0,null)};g.V=function(a,b){return Md(new W(null,2,5,X,[this.key,this.A],null),b)};g.W=function(a,b){return new W(null,3,5,X,[this.key,this.A,b],null)};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.K(null,c);case 3:return this.S(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.K(null,c)};a.h=function(a,c,d){return this.S(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.K(null,a)};g.f=function(a,b){return this.S(null,a,b)};function tg(a){return null!=a?a.m&2048||t===a.$d?!0:!1:!1}
+function ug(a,b,c){this.j=a;this.i=b;this.Ma=c;this.m=32374990;this.I=0}g=ug.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.Ma};g.la=function(){return this.i<this.j.length-2?new ug(this.j,this.i+2,this.Ma):null};g.X=function(){return(this.j.length-this.i)/2};g.L=function(){return cd(this)};
+g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.Ma)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return new Xf(this.j[this.i],this.j[this.i+1])};g.ma=function(){return this.i<this.j.length-2?new ug(this.j,this.i+2,this.Ma):Zc};g.O=function(){return this};g.V=function(a,b){return new ug(this.j,this.i,b)};g.W=function(a,b){return yd(b,this)};ug.prototype[nb]=function(){return ad(this)};
+function vg(a,b){this.j=a;this.i=0;this.w=b}vg.prototype.da=function(){return this.i<this.w};vg.prototype.next=function(){var a=new Xf(this.j[this.i],this.j[this.i+1]);this.i+=2;return a};function u(a,b,c,d){this.meta=a;this.w=b;this.j=c;this.B=d;this.m=16647951;this.I=139268}g=u.prototype;g.ib=function(a,b){a=sg(this.j,b);return-1===a?null:new Xf(this.j[a],this.j[a+1])};g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.keys=function(){return ad(wg(this))};
+g.entries=function(){return new qg(G(G(this)))};g.values=function(){return ad(xg(this))};g.has=function(a){return de(this,a)};g.get=function(a,b){return this.J(null,a,b)};g.forEach=function(a){for(var b=G(this),c=null,d=0,e=0;;)if(e<d){var f=c.K(null,e),h=T(f,0);f=T(f,1);a.f?a.f(f,h):a.call(null,f,h);e+=1}else if(b=G(b))Xd(b)?(c=zc(b),b=Bc(b),h=c,d=P(c),c=h):(c=K(b),h=T(c,0),f=T(c,1),a.f?a.f(f,h):a.call(null,f,h),b=L(b),c=null,d=0),e=0;else return null};g.R=function(a,b){return this.J(null,b,null)};
+g.J=function(a,b,c){a=sg(this.j,b);return-1===a?c:this.j[a+1]};g.Hb=function(a,b,c){a=this.j.length;for(var d=0;;)if(d<a){var e=this.j[d],f=this.j[d+1];c=b.h?b.h(c,e,f):b.call(null,c,e,f);if(kd(c))return C(c);d+=2}else return c};g.Pa=function(){return new vg(this.j,2*this.w)};g.T=function(){return this.meta};g.X=function(){return this.w};g.L=function(){var a=this.B;return null!=a?a:this.B=a=ed(this)};
+g.H=function(a,b){if(Ud(b)&&!Vd(b))if(a=this.j.length,this.w===b.X(null))for(var c=0;;)if(c<a){var d=b.J(null,this.j[c],Zd);if(d!==Zd)if(M.f(this.j[c+1],d))c+=2;else return!1;else return!1}else return!0;else return!1;else return!1};g.Gb=function(){return new yg(this.j.length,qb(this.j))};g.Z=function(){return Zb(Z,this.meta)};g.ha=function(a,b){return ge(this,b)};g.ia=function(a,b,c){return he(this,b,c)};
+g.Ib=function(a,b){if(0<=sg(this.j,b)){a=this.j.length;var c=a-2;if(0===c)return this.Z(null);c=Array(c);for(var d=0,e=0;;){if(d>=a)return new u(this.meta,this.w-1,c,null);M.f(b,this.j[d])?d+=2:(c[e]=this.j[d],c[e+1]=this.j[d+1],e+=2,d+=2)}}else return this};
+g.qa=function(a,b,c){a=sg(this.j,b);if(-1===a){if(this.w<zg){a=this.j;for(var d=a.length,e=Array(d+2),f=0;;)if(f<d)e[f]=a[f],f+=1;else break;e[d]=b;e[d+1]=c;return new u(this.meta,this.w+1,e,null)}return Zb(Kb(lf.f(Ag,this),b,c),this.meta)}if(c===this.j[a+1])return this;b=qb(this.j);b[a+1]=c;return new u(this.meta,this.w,b,null)};g.O=function(){var a=this.j;return 0<=a.length-2?new ug(a,0,null):null};g.V=function(a,b){return new u(b,this.w,this.j,this.B)};
+g.W=function(a,b){if(Wd(b))return this.qa(null,Bb.f(b,0),Bb.f(b,1));a=this;for(b=G(b);;){if(null==b)return a;var c=K(b);if(Wd(c))a=a.qa(null,Bb.f(c,0),Bb.f(c,1)),b=L(b);else throw Error("conj on a map takes map entries or seqables of map entries");}};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.R(null,c);case 3:return this.J(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.R(null,c)};a.h=function(a,c,d){return this.J(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.R(null,a)};g.f=function(a,b){return this.J(null,a,b)};var Z=new u(null,0,[],fd),zg=8;
+function Bg(a){return new u(null,a.length/2,a,null)}function Hd(a){for(var b=[],c=0;;)if(c<a.length){var d=a[c],e=a[c+1],f=sg(b,d);-1===f?(f=b,f.push(d),f.push(e)):b[f+1]=e;c+=2}else break;return new u(null,b.length/2,b,null)}u.prototype[nb]=function(){return ad(this)};function yg(a,b){this.Kb={};this.Mb=a;this.j=b;this.m=259;this.I=56}g=yg.prototype;g.X=function(){if(w(this.Kb))return re(this.Mb);throw Error("count after persistent!");};g.R=function(a,b){return this.J(null,b,null)};
+g.J=function(a,b,c){if(w(this.Kb))return a=sg(this.j,b),-1===a?c:this.j[a+1];throw Error("lookup after persistent!");};g.zb=function(a,b){if(w(this.Kb)){if(tg(b))return this.yb(null,Ob(b),Pb(b));if(Wd(b))return this.yb(null,b.c?b.c(0):b.call(null,0),b.c?b.c(1):b.call(null,1));a=G(b);for(b=this;;){var c=K(a);if(w(c))a=L(a),b=b.yb(null,Ob(c),Pb(c));else return b}}else throw Error("conj! after persistent!");};
+g.Sb=function(){if(w(this.Kb))return this.Kb=!1,new u(null,re(this.Mb),this.j,null);throw Error("persistent! called twice");};g.yb=function(a,b,c){if(w(this.Kb)){a=sg(this.j,b);if(-1===a){if(this.Mb+2<=2*zg)return this.Mb+=2,this.j.push(b),this.j.push(c),this;a:{a=this.Mb;for(var d=this.j,e=sc(Ag),f=0;;)if(f<a)e=vc(e,d[f],d[f+1]),f+=2;else break a}return vc(e,b,c)}c!==this.j[a+1]&&(this.j[a+1]=c);return this}throw Error("assoc! after persistent!");};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.J(null,c,null);case 3:return this.J(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.J(null,c,null)};a.h=function(a,c,d){return this.J(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.J(null,a,null)};g.f=function(a,b){return this.J(null,a,b)};function Cg(){this.A=!1}
+function Dg(a,b){return a===b?!0:Ae(a,b)?!0:M.f(a,b)}function Eg(a,b,c){a=qb(a);a[b]=c;return a}function Fg(a,b){var c=Array(a.length-2);Yd(a,0,c,0,2*b);Yd(a,2*(b+1),c,2*b,c.length-2*b);return c}function Gg(a,b,c,d){a=a.Ab(b);a.j[c]=d;return a}function Hg(a,b,c){for(var d=a.length,e=0,f=c;;)if(e<d){c=a[e];if(null!=c){var h=a[e+1];c=b.h?b.h(f,c,h):b.call(null,f,c,h)}else c=a[e+1],c=null!=c?c.Cb(b,f):f;if(kd(c))return c;e+=2;f=c}else return f}function Ig(a){this.j=a;this.i=0;this.Za=this.cc=null}
+Ig.prototype.advance=function(){for(var a=this.j.length;;)if(this.i<a){var b=this.j[this.i],c=this.j[this.i+1];null!=b?b=this.cc=new Xf(b,c):null!=c?(b=Hc(c),b=b.da()?this.Za=b:!1):b=!1;this.i+=2;if(b)return!0}else return!1};Ig.prototype.da=function(){var a=null!=this.cc;return a?a:(a=null!=this.Za)?a:this.advance()};
+Ig.prototype.next=function(){if(null!=this.cc){var a=this.cc;this.cc=null;return a}if(null!=this.Za)return a=this.Za.next(),this.Za.da()||(this.Za=null),a;if(this.advance())return this.next();throw Error("No such element");};Ig.prototype.remove=function(){return Error("Unsupported operation")};function Jg(a,b,c){this.$=a;this.aa=b;this.j=c;this.I=131072;this.m=0}g=Jg.prototype;
+g.Ab=function(a){if(a===this.$)return this;var b=se(this.aa),c=Array(0>b?4:2*(b+1));Yd(this.j,0,c,0,2*b);return new Jg(a,this.aa,c)};g.ac=function(){return Kg(this.j,0,null)};g.Cb=function(a,b){return Hg(this.j,a,b)};g.Bb=function(a,b,c,d){var e=1<<(b>>>a&31);if(0===(this.aa&e))return d;var f=se(this.aa&e-1);e=this.j[2*f];f=this.j[2*f+1];return null==e?f.Bb(a+5,b,c,d):Dg(c,e)?f:d};
+g.Ya=function(a,b,c,d,e,f){var h=1<<(c>>>b&31),k=se(this.aa&h-1);if(0===(this.aa&h)){var l=se(this.aa);if(2*l<this.j.length){a=this.Ab(a);b=a.j;f.A=!0;a:for(c=2*(l-k),f=2*k+(c-1),l=2*(k+1)+(c-1);;){if(0===c)break a;b[l]=b[f];--l;--c;--f}b[2*k]=d;b[2*k+1]=e;a.aa|=h;return a}if(16<=l){k=[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];k[c>>>b&31]=Lg.Ya(a,b+5,c,d,e,f);for(e=d=0;;)if(32>d)0===
+(this.aa>>>d&1)?d+=1:(k[d]=null!=this.j[e]?Lg.Ya(a,b+5,Sc(this.j[e]),this.j[e],this.j[e+1],f):this.j[e+1],e+=2,d+=1);else break;return new Mg(a,l+1,k)}b=Array(2*(l+4));Yd(this.j,0,b,0,2*k);b[2*k]=d;b[2*k+1]=e;Yd(this.j,2*k,b,2*(k+1),2*(l-k));f.A=!0;a=this.Ab(a);a.j=b;a.aa|=h;return a}l=this.j[2*k];h=this.j[2*k+1];if(null==l)return l=h.Ya(a,b+5,c,d,e,f),l===h?this:Gg(this,a,2*k+1,l);if(Dg(d,l))return e===h?this:Gg(this,a,2*k+1,e);f.A=!0;f=b+5;b=Sc(l);if(b===c)e=new Ng(null,b,2,[l,h,d,e]);else{var m=
+new Cg;e=Lg.Ya(a,f,b,l,h,m).Ya(a,f,c,d,e,m)}d=2*k;k=2*k+1;a=this.Ab(a);a.j[d]=null;a.j[k]=e;return a};
+g.Xa=function(a,b,c,d,e){var f=1<<(b>>>a&31),h=se(this.aa&f-1);if(0===(this.aa&f)){var k=se(this.aa);if(16<=k){h=[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];h[b>>>a&31]=Lg.Xa(a+5,b,c,d,e);for(d=c=0;;)if(32>c)0===(this.aa>>>c&1)?c+=1:(h[c]=null!=this.j[d]?Lg.Xa(a+5,Sc(this.j[d]),this.j[d],this.j[d+1],e):this.j[d+1],d+=2,c+=1);else break;return new Mg(null,k+1,h)}a=Array(2*(k+1));Yd(this.j,
+0,a,0,2*h);a[2*h]=c;a[2*h+1]=d;Yd(this.j,2*h,a,2*(h+1),2*(k-h));e.A=!0;return new Jg(null,this.aa|f,a)}var l=this.j[2*h];f=this.j[2*h+1];if(null==l)return k=f.Xa(a+5,b,c,d,e),k===f?this:new Jg(null,this.aa,Eg(this.j,2*h+1,k));if(Dg(c,l))return d===f?this:new Jg(null,this.aa,Eg(this.j,2*h+1,d));e.A=!0;e=this.aa;k=this.j;a+=5;var m=Sc(l);if(m===b)c=new Ng(null,m,2,[l,f,c,d]);else{var n=new Cg;c=Lg.Xa(a,m,l,f,n).Xa(a,b,c,d,n)}a=2*h;h=2*h+1;d=qb(k);d[a]=null;d[h]=c;return new Jg(null,e,d)};
+g.$b=function(a,b,c,d){var e=1<<(b>>>a&31);if(0===(this.aa&e))return d;var f=se(this.aa&e-1);e=this.j[2*f];f=this.j[2*f+1];return null==e?f.$b(a+5,b,c,d):Dg(c,e)?new Xf(e,f):d};g.bc=function(a,b,c){var d=1<<(b>>>a&31);if(0===(this.aa&d))return this;var e=se(this.aa&d-1),f=this.j[2*e],h=this.j[2*e+1];return null==f?(a=h.bc(a+5,b,c),a===h?this:null!=a?new Jg(null,this.aa,Eg(this.j,2*e+1,a)):this.aa===d?null:new Jg(null,this.aa^d,Fg(this.j,e))):Dg(c,f)?new Jg(null,this.aa^d,Fg(this.j,e)):this};
+g.Pa=function(){return new Ig(this.j)};var Lg=new Jg(null,0,[]);function Og(a){this.j=a;this.i=0;this.Za=null}Og.prototype.da=function(){for(var a=this.j.length;;){if(null!=this.Za&&this.Za.da())return!0;if(this.i<a){var b=this.j[this.i];this.i+=1;null!=b&&(this.Za=Hc(b))}else return!1}};Og.prototype.next=function(){if(this.da())return this.Za.next();throw Error("No such element");};Og.prototype.remove=function(){return Error("Unsupported operation")};
+function Mg(a,b,c){this.$=a;this.w=b;this.j=c;this.I=131072;this.m=0}g=Mg.prototype;g.Ab=function(a){return a===this.$?this:new Mg(a,this.w,qb(this.j))};g.ac=function(){return Pg(this.j,0,null)};g.Cb=function(a,b){for(var c=this.j.length,d=0;;)if(d<c){var e=this.j[d];if(null!=e){b=e.Cb(a,b);if(kd(b))return b;d+=1}else d+=1}else return b};g.Bb=function(a,b,c,d){var e=this.j[b>>>a&31];return null!=e?e.Bb(a+5,b,c,d):d};
+g.Ya=function(a,b,c,d,e,f){var h=c>>>b&31,k=this.j[h];if(null==k)return a=Gg(this,a,h,Lg.Ya(a,b+5,c,d,e,f)),a.w+=1,a;b=k.Ya(a,b+5,c,d,e,f);return b===k?this:Gg(this,a,h,b)};g.Xa=function(a,b,c,d,e){var f=b>>>a&31,h=this.j[f];if(null==h)return new Mg(null,this.w+1,Eg(this.j,f,Lg.Xa(a+5,b,c,d,e)));a=h.Xa(a+5,b,c,d,e);return a===h?this:new Mg(null,this.w,Eg(this.j,f,a))};g.$b=function(a,b,c,d){var e=this.j[b>>>a&31];return null!=e?e.$b(a+5,b,c,d):d};
+g.bc=function(a,b,c){var d=b>>>a&31,e=this.j[d];if(null!=e){a=e.bc(a+5,b,c);if(a===e)d=this;else if(null==a)if(8>=this.w)a:{e=this.j;a=e.length;b=Array(2*(this.w-1));c=0;for(var f=1,h=0;;)if(c<a)c!==d&&null!=e[c]?(b[f]=e[c],f+=2,h|=1<<c,c+=1):c+=1;else{d=new Jg(null,h,b);break a}}else d=new Mg(null,this.w-1,Eg(this.j,d,a));else d=new Mg(null,this.w,Eg(this.j,d,a));return d}return this};g.Pa=function(){return new Og(this.j)};
+function Qg(a,b,c){b*=2;for(var d=0;;)if(d<b){if(Dg(c,a[d]))return d;d+=2}else return-1}function Ng(a,b,c,d){this.$=a;this.lb=b;this.w=c;this.j=d;this.I=131072;this.m=0}g=Ng.prototype;g.Ab=function(a){if(a===this.$)return this;var b=Array(2*(this.w+1));Yd(this.j,0,b,0,2*this.w);return new Ng(a,this.lb,this.w,b)};g.ac=function(){return Kg(this.j,0,null)};g.Cb=function(a,b){return Hg(this.j,a,b)};g.Bb=function(a,b,c,d){a=Qg(this.j,this.w,c);return 0>a?d:Dg(c,this.j[a])?this.j[a+1]:d};
+g.Ya=function(a,b,c,d,e,f){if(c===this.lb){b=Qg(this.j,this.w,d);if(-1===b){if(this.j.length>2*this.w)return b=2*this.w,c=2*this.w+1,a=this.Ab(a),a.j[b]=d,a.j[c]=e,f.A=!0,a.w+=1,a;c=this.j.length;b=Array(c+2);Yd(this.j,0,b,0,c);b[c]=d;b[c+1]=e;f.A=!0;d=this.w+1;a===this.$?(this.j=b,this.w=d,a=this):a=new Ng(this.$,this.lb,d,b);return a}return this.j[b+1]===e?this:Gg(this,a,b+1,e)}return(new Jg(a,1<<(this.lb>>>b&31),[null,this,null,null])).Ya(a,b,c,d,e,f)};
+g.Xa=function(a,b,c,d,e){return b===this.lb?(a=Qg(this.j,this.w,c),-1===a?(a=2*this.w,b=Array(a+2),Yd(this.j,0,b,0,a),b[a]=c,b[a+1]=d,e.A=!0,new Ng(null,this.lb,this.w+1,b)):M.f(this.j[a+1],d)?this:new Ng(null,this.lb,this.w,Eg(this.j,a+1,d))):(new Jg(null,1<<(this.lb>>>a&31),[null,this])).Xa(a,b,c,d,e)};g.$b=function(a,b,c,d){a=Qg(this.j,this.w,c);return 0>a?d:Dg(c,this.j[a])?new Xf(this.j[a],this.j[a+1]):d};
+g.bc=function(a,b,c){a=Qg(this.j,this.w,c);return-1===a?this:1===this.w?null:new Ng(null,this.lb,this.w-1,Fg(this.j,re(a)))};g.Pa=function(){return new Ig(this.j)};function Rg(a,b,c,d,e){this.meta=a;this.$a=b;this.i=c;this.s=d;this.B=e;this.m=32374988;this.I=0}g=Rg.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){return null==this.s?Kg(this.$a,this.i+2,null):Kg(this.$a,this.i,L(this.s))};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};
+g.Z=function(){return Zb(Zc,this.meta)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return null==this.s?new Xf(this.$a[this.i],this.$a[this.i+1]):K(this.s)};g.ma=function(){var a=null==this.s?Kg(this.$a,this.i+2,null):Kg(this.$a,this.i,L(this.s));return null!=a?a:Zc};g.O=function(){return this};g.V=function(a,b){return new Rg(b,this.$a,this.i,this.s,this.B)};g.W=function(a,b){return yd(b,this)};Rg.prototype[nb]=function(){return ad(this)};
+function Kg(a,b,c){if(null==c)for(c=a.length;;)if(b<c){if(null!=a[b])return new Rg(null,a,b,null,null);var d=a[b+1];if(w(d)&&(d=d.ac(),w(d)))return new Rg(null,a,b+2,d,null);b+=2}else return null;else return new Rg(null,a,b,c,null)}function Sg(a,b,c,d,e){this.meta=a;this.$a=b;this.i=c;this.s=d;this.B=e;this.m=32374988;this.I=0}g=Sg.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){return Pg(this.$a,this.i,L(this.s))};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};
+g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return K(this.s)};g.ma=function(){var a=Pg(this.$a,this.i,L(this.s));return null!=a?a:Zc};g.O=function(){return this};g.V=function(a,b){return new Sg(b,this.$a,this.i,this.s,this.B)};g.W=function(a,b){return yd(b,this)};Sg.prototype[nb]=function(){return ad(this)};
+function Pg(a,b,c){if(null==c)for(c=a.length;;)if(b<c){var d=a[b];if(w(d)&&(d=d.ac(),w(d)))return new Sg(null,a,b+1,d,null);b+=1}else return null;else return new Sg(null,a,b,c,null)}function Tg(a,b){this.Ea=a;this.jd=b;this.Jc=!1}Tg.prototype.da=function(){return!this.Jc||this.jd.da()};Tg.prototype.next=function(){if(this.Jc)return this.jd.next();this.Jc=!0;return new Xf(null,this.Ea)};Tg.prototype.remove=function(){return Error("Unsupported operation")};
+function Ug(a,b,c,d,e,f){this.meta=a;this.w=b;this.root=c;this.Ia=d;this.Ea=e;this.B=f;this.m=16123663;this.I=139268}g=Ug.prototype;g.ib=function(a,b){return null==b?this.Ia?new Xf(null,this.Ea):null:null==this.root?null:this.root.$b(0,Sc(b),b,null)};g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.keys=function(){return ad(wg(this))};g.entries=function(){return new qg(G(G(this)))};g.values=function(){return ad(xg(this))};g.has=function(a){return de(this,a)};
+g.get=function(a,b){return this.J(null,a,b)};g.forEach=function(a){for(var b=G(this),c=null,d=0,e=0;;)if(e<d){var f=c.K(null,e),h=T(f,0);f=T(f,1);a.f?a.f(f,h):a.call(null,f,h);e+=1}else if(b=G(b))Xd(b)?(c=zc(b),b=Bc(b),h=c,d=P(c),c=h):(c=K(b),h=T(c,0),f=T(c,1),a.f?a.f(f,h):a.call(null,f,h),b=L(b),c=null,d=0),e=0;else return null};g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){return null==b?this.Ia?this.Ea:c:null==this.root?c:this.root.Bb(0,Sc(b),b,c)};
+g.Hb=function(a,b,c){a=this.Ia?b.h?b.h(c,null,this.Ea):b.call(null,c,null,this.Ea):c;return kd(a)?C(a):null!=this.root?ld(this.root.Cb(b,a)):a};g.Pa=function(){var a=this.root?Hc(this.root):$e();return this.Ia?new Tg(this.Ea,a):a};g.T=function(){return this.meta};g.X=function(){return this.w};g.L=function(){var a=this.B;return null!=a?a:this.B=a=ed(this)};g.H=function(a,b){return og(this,b)};g.Gb=function(){return new Vg(this.root,this.w,this.Ia,this.Ea)};g.Z=function(){return Zb(Ag,this.meta)};
+g.Ib=function(a,b){if(null==b)return this.Ia?new Ug(this.meta,this.w-1,this.root,!1,null,null):this;if(null==this.root)return this;a=this.root.bc(0,Sc(b),b);return a===this.root?this:new Ug(this.meta,this.w-1,a,this.Ia,this.Ea,null)};
+g.qa=function(a,b,c){if(null==b)return this.Ia&&c===this.Ea?this:new Ug(this.meta,this.Ia?this.w:this.w+1,this.root,!0,c,null);a=new Cg;b=(null==this.root?Lg:this.root).Xa(0,Sc(b),b,c,a);return b===this.root?this:new Ug(this.meta,a.A?this.w+1:this.w,b,this.Ia,this.Ea,null)};g.O=function(){if(0<this.w){var a=null!=this.root?this.root.ac():null;return this.Ia?yd(new Xf(null,this.Ea),a):a}return null};g.V=function(a,b){return new Ug(b,this.w,this.root,this.Ia,this.Ea,this.B)};
+g.W=function(a,b){if(Wd(b))return this.qa(null,Bb.f(b,0),Bb.f(b,1));a=this;for(b=G(b);;){if(null==b)return a;var c=K(b);if(Wd(c))a=a.qa(null,Bb.f(c,0),Bb.f(c,1)),b=L(b);else throw Error("conj on a map takes map entries or seqables of map entries");}};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.R(null,c);case 3:return this.J(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.R(null,c)};a.h=function(a,c,d){return this.J(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.R(null,a)};g.f=function(a,b){return this.J(null,a,b)};var Ag=new Ug(null,0,null,!1,null,fd);
+function Wg(a){for(var b=a.length,c=0,d=sc(Ag);;)if(c<b){var e=c+2;d=vc(d,a[c],a[c+1]);c=e}else return uc(d)}Ug.prototype[nb]=function(){return ad(this)};function Vg(a,b,c,d){this.$={};this.root=a;this.count=b;this.Ia=c;this.Ea=d;this.m=259;this.I=56}function Xg(a,b,c){if(a.$){if(null==b)a.Ea!==c&&(a.Ea=c),a.Ia||(a.count+=1,a.Ia=!0);else{var d=new Cg;b=(null==a.root?Lg:a.root).Ya(a.$,0,Sc(b),b,c,d);b!==a.root&&(a.root=b);d.A&&(a.count+=1)}return a}throw Error("assoc! after persistent!");}g=Vg.prototype;
+g.X=function(){if(this.$)return this.count;throw Error("count after persistent!");};g.R=function(a,b){return null==b?this.Ia?this.Ea:null:null==this.root?null:this.root.Bb(0,Sc(b),b)};g.J=function(a,b,c){return null==b?this.Ia?this.Ea:c:null==this.root?c:this.root.Bb(0,Sc(b),b,c)};
+g.zb=function(a,b){a:if(this.$)if(tg(b))a=Xg(this,Ob(b),Pb(b));else if(Wd(b))a=Xg(this,b.c?b.c(0):b.call(null,0),b.c?b.c(1):b.call(null,1));else for(a=G(b),b=this;;){var c=K(a);if(w(c))a=L(a),b=Xg(b,Ob(c),Pb(c));else{a=b;break a}}else throw Error("conj! after persistent");return a};g.Sb=function(){if(this.$){this.$=null;var a=new Ug(null,this.count,this.root,this.Ia,this.Ea,null)}else throw Error("persistent! called twice");return a};g.yb=function(a,b,c){return Xg(this,b,c)};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.R(null,c);case 3:return this.J(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.R(null,c)};a.h=function(a,c,d){return this.J(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.R(null,a)};g.f=function(a,b){return this.J(null,a,b)};
+function Yg(a,b,c){for(var d=b;;)if(null!=a)b=c?a.left:a.right,d=Dd.f(d,a),a=b;else return d}function Zg(a,b,c,d,e){this.meta=a;this.stack=b;this.vb=c;this.w=d;this.B=e;this.m=32374990;this.I=0}g=Zg.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.meta};g.la=function(){var a=K(this.stack);a=Yg(this.vb?a.right:a.left,L(this.stack),this.vb);return null==a?null:new Zg(null,a,this.vb,this.w-1,null)};g.X=function(){return 0>this.w?P(L(this))+1:this.w};
+g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return Od(this.stack)};g.ma=function(){var a=K(this.stack);a=Yg(this.vb?a.right:a.left,L(this.stack),this.vb);return null!=a?new Zg(null,a,this.vb,this.w-1,null):Zc};g.O=function(){return this};g.V=function(a,b){return new Zg(b,this.stack,this.vb,this.w,this.B)};
+g.W=function(a,b){return yd(b,this)};Zg.prototype[nb]=function(){return ad(this)};function $g(a,b,c){return new Zg(null,Yg(a,null,b),b,c,null)}function ah(a,b,c,d){return c instanceof bh?c.left instanceof bh?new bh(c.key,c.A,c.left.fb(),new ch(a,b,c.right,d)):c.right instanceof bh?new bh(c.right.key,c.right.A,new ch(c.key,c.A,c.left,c.right.left),new ch(a,b,c.right.right,d)):new ch(a,b,c,d):new ch(a,b,c,d)}
+function dh(a,b,c,d){return d instanceof bh?d.right instanceof bh?new bh(d.key,d.A,new ch(a,b,c,d.left),d.right.fb()):d.left instanceof bh?new bh(d.left.key,d.left.A,new ch(a,b,c,d.left.left),new ch(d.key,d.A,d.left.right,d.right)):new ch(a,b,c,d):new ch(a,b,c,d)}
+function eh(a,b,c,d){if(c instanceof bh)return new bh(a,b,c.fb(),d);if(d instanceof ch)return dh(a,b,c,d.fc());if(d instanceof bh&&d.left instanceof ch)return new bh(d.left.key,d.left.A,new ch(a,b,c,d.left.left),dh(d.key,d.A,d.left.right,d.right.fc()));throw Error("red-black tree invariant violation");}
+function fh(a,b,c,d){if(d instanceof bh)return new bh(a,b,c,d.fb());if(c instanceof ch)return ah(a,b,c.fc(),d);if(c instanceof bh&&c.right instanceof ch)return new bh(c.right.key,c.right.A,ah(c.key,c.A,c.left.fc(),c.right.left),new ch(a,b,c.right.right,d));throw Error("red-black tree invariant violation");}
+var gh=function gh(a,b,c){var e=null!=a.left?function(){var e=a.left;return gh.h?gh.h(e,b,c):gh.call(null,e,b,c)}():c;if(kd(e))return e;var f=function(){var c=a.key,f=a.A;return b.h?b.h(e,c,f):b.call(null,e,c,f)}();if(kd(f))return f;if(null!=a.right){var h=a.right;return gh.h?gh.h(h,b,f):gh.call(null,h,b,f)}return f};function ch(a,b,c,d){this.key=a;this.A=b;this.left=c;this.right=d;this.B=null;this.m=166619935;this.I=0}g=ch.prototype;
+g.ib=function(a,b){switch(b){case 0:return new Xf(0,this.key);case 1:return new Xf(1,this.A);default:return null}};g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();g.Mc=function(a){return a.Oc(this)};g.fc=function(){return new bh(this.key,this.A,this.left,this.right)};g.fb=function(){return this};g.Lc=function(a){return a.Nc(this)};g.replace=function(a,b,c,d){return new ch(a,b,c,d)};
+g.Nc=function(a){return new ch(a.key,a.A,this,a.right)};g.Oc=function(a){return new ch(a.key,a.A,a.left,this)};g.Cb=function(a,b){return gh(this,a,b)};g.R=function(a,b){return this.S(null,b,null)};g.J=function(a,b,c){return this.S(null,b,c)};g.K=function(a,b){if(0===b)return this.key;if(1===b)return this.A;throw Error("Index out of bounds");};g.S=function(a,b,c){return 0===b?this.key:1===b?this.A:c};g.Wa=function(a,b,c){return(new W(null,2,5,X,[this.key,this.A],null)).Wa(null,b,c)};g.T=function(){return null};
+g.X=function(){return 2};g.Dc=function(){return this.key};g.Ec=function(){return this.A};g.jb=function(){return this.A};g.kb=function(){return new W(null,1,5,X,[this.key],null)};g.sb=function(){return new H([this.A,this.key],0,null)};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return null};g.ha=function(a,b){return nd(this,b)};g.ia=function(a,b,c){return od(this,b,c)};
+g.qa=function(a,b,c){return U.h(new W(null,2,5,X,[this.key,this.A],null),b,c)};g.O=function(){return new H([this.key,this.A],0,null)};g.V=function(a,b){return Zb(new W(null,2,5,X,[this.key,this.A],null),b)};g.W=function(a,b){return new W(null,3,5,X,[this.key,this.A,b],null)};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.K(null,c);case 3:return this.S(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.K(null,c)};a.h=function(a,c,d){return this.S(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.K(null,a)};g.f=function(a,b){return this.S(null,a,b)};ch.prototype[nb]=function(){return ad(this)};
+function bh(a,b,c,d){this.key=a;this.A=b;this.left=c;this.right=d;this.B=null;this.m=166619935;this.I=0}g=bh.prototype;g.ib=function(a,b){switch(b){case 0:return new Xf(0,this.key);case 1:return new Xf(1,this.A);default:return null}};g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();g.Mc=function(a){return new bh(this.key,this.A,this.left,a)};g.fc=function(){throw Error("red-black tree invariant violation");};g.fb=function(){return new ch(this.key,this.A,this.left,this.right)};
+g.Lc=function(a){return new bh(this.key,this.A,a,this.right)};g.replace=function(a,b,c,d){return new bh(a,b,c,d)};g.Nc=function(a){return this.left instanceof bh?new bh(this.key,this.A,this.left.fb(),new ch(a.key,a.A,this.right,a.right)):this.right instanceof bh?new bh(this.right.key,this.right.A,new ch(this.key,this.A,this.left,this.right.left),new ch(a.key,a.A,this.right.right,a.right)):new ch(a.key,a.A,this,a.right)};
+g.Oc=function(a){return this.right instanceof bh?new bh(this.key,this.A,new ch(a.key,a.A,a.left,this.left),this.right.fb()):this.left instanceof bh?new bh(this.left.key,this.left.A,new ch(a.key,a.A,a.left,this.left.left),new ch(this.key,this.A,this.left.right,this.right)):new ch(a.key,a.A,a.left,this)};g.Cb=function(a,b){return gh(this,a,b)};g.R=function(a,b){return this.S(null,b,null)};g.J=function(a,b,c){return this.S(null,b,c)};
+g.K=function(a,b){if(0===b)return this.key;if(1===b)return this.A;throw Error("Index out of bounds");};g.S=function(a,b,c){return 0===b?this.key:1===b?this.A:c};g.Wa=function(a,b,c){return(new W(null,2,5,X,[this.key,this.A],null)).Wa(null,b,c)};g.T=function(){return null};g.X=function(){return 2};g.Dc=function(){return this.key};g.Ec=function(){return this.A};g.jb=function(){return this.A};g.kb=function(){return new W(null,1,5,X,[this.key],null)};g.sb=function(){return new H([this.A,this.key],0,null)};
+g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return null};g.ha=function(a,b){return nd(this,b)};g.ia=function(a,b,c){return od(this,b,c)};g.qa=function(a,b,c){return U.h(new W(null,2,5,X,[this.key,this.A],null),b,c)};g.O=function(){return new H([this.key,this.A],0,null)};g.V=function(a,b){return Zb(new W(null,2,5,X,[this.key,this.A],null),b)};g.W=function(a,b){return new W(null,3,5,X,[this.key,this.A,b],null)};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.K(null,c);case 3:return this.S(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.K(null,c)};a.h=function(a,c,d){return this.S(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.K(null,a)};g.f=function(a,b){return this.S(null,a,b)};bh.prototype[nb]=function(){return ad(this)};
+var hh=function hh(a,b,c,d,e){if(null==b)return new bh(c,d,null,null);var h=function(){var d=b.key;return a.f?a.f(c,d):a.call(null,c,d)}();if(0===h)return e[0]=b,null;if(0>h)return h=function(){var h=b.left;return hh.N?hh.N(a,h,c,d,e):hh.call(null,a,h,c,d,e)}(),null!=h?b.Lc(h):null;h=function(){var h=b.right;return hh.N?hh.N(a,h,c,d,e):hh.call(null,a,h,c,d,e)}();return null!=h?b.Mc(h):null},ih=function ih(a,b){if(null==a)return b;if(null==b)return a;if(a instanceof bh){if(b instanceof bh){var d=function(){var d=
+a.right,f=b.left;return ih.f?ih.f(d,f):ih.call(null,d,f)}();return d instanceof bh?new bh(d.key,d.A,new bh(a.key,a.A,a.left,d.left),new bh(b.key,b.A,d.right,b.right)):new bh(a.key,a.A,a.left,new bh(b.key,b.A,d,b.right))}return new bh(a.key,a.A,a.left,function(){var d=a.right;return ih.f?ih.f(d,b):ih.call(null,d,b)}())}if(b instanceof bh)return new bh(b.key,b.A,function(){var d=b.left;return ih.f?ih.f(a,d):ih.call(null,a,d)}(),b.right);d=function(){var d=a.right,f=b.left;return ih.f?ih.f(d,f):ih.call(null,
+d,f)}();return d instanceof bh?new bh(d.key,d.A,new ch(a.key,a.A,a.left,d.left),new ch(b.key,b.A,d.right,b.right)):eh(a.key,a.A,a.left,new ch(b.key,b.A,d,b.right))},jh=function jh(a,b,c,d){if(null!=b){var f=function(){var d=b.key;return a.f?a.f(c,d):a.call(null,c,d)}();if(0===f)return d[0]=b,ih(b.left,b.right);if(0>f)return f=function(){var f=b.left;return jh.C?jh.C(a,f,c,d):jh.call(null,a,f,c,d)}(),null!=f||null!=d[0]?b.left instanceof ch?eh(b.key,b.A,f,b.right):new bh(b.key,b.A,f,b.right):null;
+f=function(){var f=b.right;return jh.C?jh.C(a,f,c,d):jh.call(null,a,f,c,d)}();return null!=f||null!=d[0]?b.right instanceof ch?fh(b.key,b.A,b.left,f):new bh(b.key,b.A,b.left,f):null}return null},kh=function kh(a,b,c,d){var f=b.key,h=a.f?a.f(c,f):a.call(null,c,f);return 0===h?b.replace(f,d,b.left,b.right):0>h?b.replace(f,b.A,function(){var f=b.left;return kh.C?kh.C(a,f,c,d):kh.call(null,a,f,c,d)}(),b.right):b.replace(f,b.A,b.left,function(){var f=b.right;return kh.C?kh.C(a,f,c,d):kh.call(null,a,f,
+c,d)}())};function lh(a,b,c,d,e){this.Ta=a;this.qb=b;this.w=c;this.meta=d;this.B=e;this.m=418776847;this.I=8192}g=lh.prototype;g.ib=function(a,b){return mh(this,b)};g.forEach=function(a){for(var b=G(this),c=null,d=0,e=0;;)if(e<d){var f=c.K(null,e),h=T(f,0);f=T(f,1);a.f?a.f(f,h):a.call(null,f,h);e+=1}else if(b=G(b))Xd(b)?(c=zc(b),b=Bc(b),h=c,d=P(c),c=h):(c=K(b),h=T(c,0),f=T(c,1),a.f?a.f(f,h):a.call(null,f,h),b=L(b),c=null,d=0),e=0;else return null};g.get=function(a,b){return this.J(null,a,b)};
+g.entries=function(){return new qg(G(G(this)))};g.toString=function(){return Jc(this)};g.keys=function(){return ad(wg(this))};g.values=function(){return ad(xg(this))};g.equiv=function(a){return this.H(null,a)};function mh(a,b){for(var c=a.qb;;)if(null!=c){var d=c.key;d=a.Ta.f?a.Ta.f(b,d):a.Ta.call(null,b,d);if(0===d)return c;c=0>d?c.left:c.right}else return null}g.has=function(a){return de(this,a)};g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){a=mh(this,b);return null!=a?a.A:c};
+g.Hb=function(a,b,c){return null!=this.qb?ld(gh(this.qb,b,c)):c};g.T=function(){return this.meta};g.X=function(){return this.w};g.sb=function(){return 0<this.w?$g(this.qb,!1,this.w):null};g.L=function(){var a=this.B;return null!=a?a:this.B=a=ed(this)};g.H=function(a,b){return og(this,b)};g.Z=function(){return new lh(this.Ta,null,0,this.meta,0)};
+g.Ib=function(a,b){a=[null];b=jh(this.Ta,this.qb,b,a);return null==b?null==ud(a,0)?this:new lh(this.Ta,null,0,this.meta,null):new lh(this.Ta,b.fb(),this.w-1,this.meta,null)};g.qa=function(a,b,c){a=[null];var d=hh(this.Ta,this.qb,b,c,a);return null==d?(a=ud(a,0),M.f(c,a.A)?this:new lh(this.Ta,kh(this.Ta,this.qb,b,c),this.w,this.meta,null)):new lh(this.Ta,d.fb(),this.w+1,this.meta,null)};g.O=function(){return 0<this.w?$g(this.qb,!0,this.w):null};
+g.V=function(a,b){return new lh(this.Ta,this.qb,this.w,b,this.B)};g.W=function(a,b){if(Wd(b))return this.qa(null,Bb.f(b,0),Bb.f(b,1));a=this;for(b=G(b);;){if(null==b)return a;var c=K(b);if(Wd(c))a=a.qa(null,Bb.f(c,0),Bb.f(c,1)),b=L(b);else throw Error("conj on a map takes map entries or seqables of map entries");}};
+g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.R(null,c);case 3:return this.J(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.R(null,c)};a.h=function(a,c,d){return this.J(null,c,d)};return a}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.R(null,a)};g.f=function(a,b){return this.J(null,a,b)};var nh=new lh(ee,null,0,null,fd);lh.prototype[nb]=function(){return ad(this)};
+var oh=function oh(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return oh.l(0<c.length?new H(c.slice(0),0,null):null)};oh.l=function(a){for(var b=G(a),c=sc(Ag);;)if(b){a=L(L(b));var d=K(b);b=Bd(b);c=vc(c,d,b);b=a}else return uc(c)};oh.G=0;oh.F=function(a){return this.l(G(a))};var ph=function ph(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return ph.l(0<c.length?new H(c.slice(0),0,null):null)};
+ph.l=function(a){a=a instanceof H&&0===a.i?a.j:rb(a);return Hd(a)};ph.G=0;ph.F=function(a){return this.l(G(a))};function qh(a){for(var b=[],c=arguments.length,d=0;;)if(d<c)b.push(arguments[d]),d+=1;else break;a:for(b=G(0<b.length?new H(b.slice(0),0,null):null),d=nh;;)if(b)c=L(L(b)),d=U.h(d,K(b),Bd(b)),b=c;else break a;return d}function rh(a,b){this.P=a;this.Ma=b;this.m=32374988;this.I=0}g=rh.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};
+g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.Ma};g.la=function(){var a=(null!=this.P?this.P.m&128||t===this.P.kc||(this.P.m?0:x(Gb,this.P)):x(Gb,this.P))?this.P.la():L(this.P);return null==a?null:new rh(a,this.Ma)};g.L=function(){return cd(this)};
+g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.Ma)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return this.P.ja(null).key};g.ma=function(){var a=(null!=this.P?this.P.m&128||t===this.P.kc||(this.P.m?0:x(Gb,this.P)):x(Gb,this.P))?this.P.la():L(this.P);return null!=a?new rh(a,this.Ma):Zc};g.O=function(){return this};g.V=function(a,b){return new rh(this.P,b)};g.W=function(a,b){return yd(b,this)};rh.prototype[nb]=function(){return ad(this)};
+function wg(a){return(a=G(a))?new rh(a,null):null}function sh(a){return Ob(a)}function th(a,b){this.P=a;this.Ma=b;this.m=32374988;this.I=0}g=th.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.T=function(){return this.Ma};g.la=function(){var a=(null!=this.P?this.P.m&128||t===this.P.kc||(this.P.m?0:x(Gb,this.P)):x(Gb,this.P))?this.P.la():L(this.P);return null==a?null:new th(a,this.Ma)};g.L=function(){return cd(this)};
+g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.Ma)};g.ha=function(a,b){return zd(b,this)};g.ia=function(a,b,c){return Ad(b,c,this)};g.ja=function(){return this.P.ja(null).A};g.ma=function(){var a=(null!=this.P?this.P.m&128||t===this.P.kc||(this.P.m?0:x(Gb,this.P)):x(Gb,this.P))?this.P.la():L(this.P);return null!=a?new th(a,this.Ma):Zc};g.O=function(){return this};g.V=function(a,b){return new th(this.P,b)};g.W=function(a,b){return yd(b,this)};th.prototype[nb]=function(){return ad(this)};
+function xg(a){return(a=G(a))?new th(a,null):null}var uh=function uh(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return uh.l(0<c.length?new H(c.slice(0),0,null):null)};uh.l=function(a){return w(ef(ke,a))?ie(function(a,c){return Dd.f(w(a)?a:Z,c)},a):null};uh.G=0;uh.F=function(a){return this.l(G(a))};function vh(a){for(var b=Z,c=G(new W(null,3,5,X,[wh,xh,yh],null));;)if(c){var d=K(c),e=F.h(a,d,zh);b=M.f(e,zh)?b:U.h(b,d,e);c=L(c)}else return Zb(b,Nd(a))}
+function Ah(a){this.Gc=a}Ah.prototype.da=function(){return this.Gc.da()};Ah.prototype.next=function(){if(this.Gc.da())return this.Gc.next().key;throw Error("No such element");};Ah.prototype.remove=function(){return Error("Unsupported operation")};function Bh(a,b,c){this.meta=a;this.mb=b;this.B=c;this.m=15077647;this.I=139268}g=Bh.prototype;g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.keys=function(){return ad(G(this))};g.entries=function(){return new rg(G(G(this)))};
+g.values=function(){return ad(G(this))};g.has=function(a){return de(this,a)};g.forEach=function(a){for(var b=G(this),c=null,d=0,e=0;;)if(e<d){var f=c.K(null,e),h=T(f,0);f=T(f,1);a.f?a.f(f,h):a.call(null,f,h);e+=1}else if(b=G(b))Xd(b)?(c=zc(b),b=Bc(b),h=c,d=P(c),c=h):(c=K(b),h=T(c,0),f=T(c,1),a.f?a.f(f,h):a.call(null,f,h),b=L(b),c=null,d=0),e=0;else return null};g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){a=Lb(this.mb,b);return w(a)?Ob(a):c};g.Pa=function(){return new Ah(Hc(this.mb))};
+g.T=function(){return this.meta};g.X=function(){return wb(this.mb)};g.L=function(){var a=this.B;return null!=a?a:this.B=a=ed(this)};g.H=function(a,b){if(a=Sd(b)){var c=P(this)===P(b);if(c)try{return je(function(){return function(a,c){return(a=de(b,c))?a:new hd}}(c,a,this),!0,this.mb)}catch(d){if(d instanceof Error)return!1;throw d;}else return c}else return a};g.Gb=function(){return new Ch(sc(this.mb))};g.Z=function(){return Zb(Dh,this.meta)};
+g.Xc=function(a,b){return new Bh(this.meta,Nb(this.mb,b),null)};g.O=function(){return wg(this.mb)};g.V=function(a,b){return new Bh(b,this.mb,this.B)};g.W=function(a,b){return new Bh(this.meta,U.h(this.mb,b,null),null)};g.call=function(){var a=null;a=function(a,c,d){switch(arguments.length){case 2:return this.R(null,c);case 3:return this.J(null,c,d)}throw Error("Invalid arity: "+(arguments.length-1));};a.f=function(a,c){return this.R(null,c)};a.h=function(a,c,d){return this.J(null,c,d)};return a}();
+g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};g.c=function(a){return this.R(null,a)};g.f=function(a,b){return this.J(null,a,b)};var Dh=new Bh(null,Z,fd);Bh.prototype[nb]=function(){return ad(this)};function Ch(a){this.pb=a;this.I=136;this.m=259}g=Ch.prototype;g.zb=function(a,b){this.pb=vc(this.pb,b,null);return this};g.Sb=function(){return new Bh(null,uc(this.pb),null)};g.X=function(){return P(this.pb)};g.R=function(a,b){return this.J(null,b,null)};
+g.J=function(a,b,c){return Jb.h(this.pb,b,Zd)===Zd?c:b};g.call=function(){function a(a,b,c){return Jb.h(this.pb,b,Zd)===Zd?c:b}function b(a,b){return Jb.h(this.pb,b,Zd)===Zd?null:b}var c=null;c=function(c,e,f){switch(arguments.length){case 2:return b.call(this,c,e);case 3:return a.call(this,c,e,f)}throw Error("Invalid arity: "+(arguments.length-1));};c.f=b;c.h=a;return c}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};
+g.c=function(a){return Jb.h(this.pb,a,Zd)===Zd?null:a};g.f=function(a,b){return Jb.h(this.pb,a,Zd)===Zd?b:a};function Eh(a){a=G(a);if(null==a)return Dh;if(a instanceof H&&0===a.i){a=a.j;for(var b=a.length,c=sc(Dh),d=0;;)if(d<b)tc(c,a[d]),d+=1;else break;return uc(c)}for(c=sc(Dh);;)if(null!=a)b=L(a),c=c.zb(null,a.ja(null)),a=b;else return uc(c)}function Fh(a){for(var b=Ed;;)if(L(a))b=Dd.f(b,K(a)),a=L(a);else return G(b)}
+function De(a){if(null!=a&&(a.I&4096||t===a.Wc))return a.Qb(null);if("string"===typeof a)return a;throw Error(["Doesn't support name: ",B.c(a)].join(""));}function Gh(a,b){var c=sc(Z);a=G(a);for(b=G(b);;)if(a&&b){var d=K(a),e=K(b);c=vc(c,d,e);a=L(a);b=L(b)}else return uc(c)}
+var Hh=function Hh(a){switch(arguments.length){case 2:return Hh.f(arguments[0],arguments[1]);case 3:return Hh.h(arguments[0],arguments[1],arguments[2]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Hh.l(arguments[0],arguments[1],arguments[2],new H(c.slice(3),0,null))}};Hh.f=function(a,b){return b};Hh.h=function(a,b,c){return(a.c?a.c(b):a.call(null,b))>(a.c?a.c(c):a.call(null,c))?b:c};
+Hh.l=function(a,b,c,d){return sb(function(b,c){return Hh.h(a,b,c)},Hh.h(a,b,c),d)};Hh.F=function(a){var b=K(a),c=L(a);a=K(c);var d=L(c);c=K(d);d=L(d);return this.l(b,a,c,d)};Hh.G=3;function Ih(a,b,c){this.i=a;this.end=b;this.step=c}Ih.prototype.da=function(){return 0<this.step?this.i<this.end:this.i>this.end};Ih.prototype.next=function(){var a=this.i;this.i+=this.step;return a};function Jh(a,b,c,d,e){this.meta=a;this.start=b;this.end=c;this.step=d;this.B=e;this.m=32375006;this.I=139264}g=Jh.prototype;
+g.toString=function(){return Jc(this)};g.equiv=function(a){return this.H(null,a)};g.indexOf=function(){var a=null;a=function(a,c){switch(arguments.length){case 1:return N(this,a,0);case 2:return N(this,a,c)}throw Error("Invalid arity: "+arguments.length);};a.c=function(a){return N(this,a,0)};a.f=function(a,c){return N(this,a,c)};return a}();
+g.lastIndexOf=function(){function a(a){return R(this,a,P(this))}var b=null;b=function(b,d){switch(arguments.length){case 1:return a.call(this,b);case 2:return R(this,b,d)}throw Error("Invalid arity: "+arguments.length);};b.c=a;b.f=function(a,b){return R(this,a,b)};return b}();g.K=function(a,b){if(0<=b&&b<this.X(null))return this.start+b*this.step;if(0<=b&&this.start>this.end&&0===this.step)return this.start;throw Error("Index out of bounds");};
+g.S=function(a,b,c){return 0<=b&&b<this.X(null)?this.start+b*this.step:0<=b&&this.start>this.end&&0===this.step?this.start:c};g.Pa=function(){return new Ih(this.start,this.end,this.step)};g.T=function(){return this.meta};g.la=function(){return 0<this.step?this.start+this.step<this.end?new Jh(this.meta,this.start+this.step,this.end,this.step,null):null:this.start+this.step>this.end?new Jh(this.meta,this.start+this.step,this.end,this.step,null):null};
+g.X=function(){return kb(this.O(null))?0:Math.ceil((this.end-this.start)/this.step)};g.L=function(){var a=this.B;return null!=a?a:this.B=a=cd(this)};g.H=function(a,b){return xd(this,b)};g.Z=function(){return Zb(Zc,this.meta)};g.ha=function(a,b){return nd(this,b)};g.ia=function(a,b,c){for(a=this.start;;)if(0<this.step?a<this.end:a>this.end){c=b.f?b.f(c,a):b.call(null,c,a);if(kd(c))return C(c);a+=this.step}else return c};g.ja=function(){return null==this.O(null)?null:this.start};
+g.ma=function(){return null!=this.O(null)?new Jh(this.meta,this.start+this.step,this.end,this.step,null):Zc};g.O=function(){return 0<this.step?this.start<this.end?this:null:0>this.step?this.start>this.end?this:null:this.start===this.end?null:this};g.V=function(a,b){return new Jh(b,this.start,this.end,this.step,this.B)};g.W=function(a,b){return yd(b,this)};Jh.prototype[nb]=function(){return ad(this)};
+function Kh(a,b){if("number"!==typeof a)throw Error("Assert failed: (number? n)");return new Ee(null,function(){var c=G(b);return c?yd(K(c),Kh(a,tf(a,c))):null},null,null)}function Lh(a){return uc(sb(function(a,c){var b=F.h(a,c,0)+1;return vc(a,c,b)},sc(Z),a))}
+function Mh(){var a=De;return function(){function b(b,c,d){return new W(null,2,5,X,[Be.h?Be.h(b,c,d):Be.call(null,b,c,d),a.h?a.h(b,c,d):a.call(null,b,c,d)],null)}function c(b,c){return new W(null,2,5,X,[Be.f?Be.f(b,c):Be.call(null,b,c),a.f?a.f(b,c):a.call(null,b,c)],null)}function d(b){return new W(null,2,5,X,[Be.c?Be.c(b):Be.call(null,b),a.c?a.c(b):a.call(null,b)],null)}function e(){return new W(null,2,5,X,[Be.D?Be.D():Be.call(null),a.D?a.D():a.call(null)],null)}var f=null,h=function(){function b(a,
+b,d,e){var f=null;if(3<arguments.length){f=0;for(var h=Array(arguments.length-3);f<h.length;)h[f]=arguments[f+3],++f;f=new H(h,0,null)}return c.call(this,a,b,d,f)}function c(b,c,d,e){return new W(null,2,5,X,[Ye(Be,b,c,d,e),Ye(a,b,c,d,e)],null)}b.G=3;b.F=function(a){var b=K(a);a=L(a);var d=K(a);a=L(a);var e=K(a);a=Yc(a);return c(b,d,e,a)};b.l=c;return b}();f=function(a,f,m,n){switch(arguments.length){case 0:return e.call(this);case 1:return d.call(this,a);case 2:return c.call(this,a,f);case 3:return b.call(this,
+a,f,m);default:var k=null;if(3<arguments.length){k=0;for(var l=Array(arguments.length-3);k<l.length;)l[k]=arguments[k+3],++k;k=new H(l,0,null)}return h.l(a,f,m,k)}throw Error("Invalid arity: "+arguments.length);};f.G=3;f.F=h.F;f.D=e;f.c=d;f.f=c;f.h=b;f.l=h.l;return f}()}function Nh(a){a:for(var b=a;;)if(b=G(b))b=L(b);else break a;return a}
+function Oh(a,b){if("string"===typeof b)return a=a.exec(b),M.f(K(a),b)?1===P(a)?K(a):ag(a):null;throw new TypeError("re-matches must match against a string.");}function Ph(a,b){if("string"===typeof b)return a=a.exec(b),null==a?null:1===P(a)?K(a):ag(a);throw new TypeError("re-find must match against a string.");}
+function Qh(a,b,c,d,e,f,h){var k=$a;$a=null==$a?null:$a-1;try{if(null!=$a&&0>$a)return nc(a,"#");nc(a,c);if(0===hb.c(f))G(h)&&nc(a,function(){var a=Rh.c(f);return w(a)?a:"..."}());else{if(G(h)){var l=K(h);b.h?b.h(l,a,f):b.call(null,l,a,f)}for(var m=L(h),n=hb.c(f)-1;;)if(!m||null!=n&&0===n){G(m)&&0===n&&(nc(a,d),nc(a,function(){var a=Rh.c(f);return w(a)?a:"..."}()));break}else{nc(a,d);var q=K(m);c=a;h=f;b.h?b.h(q,c,h):b.call(null,q,c,h);var r=L(m);c=n-1;m=r;n=c}}return nc(a,e)}finally{$a=k}}
+function Sh(a,b){b=G(b);for(var c=null,d=0,e=0;;)if(e<d){var f=c.K(null,e);nc(a,f);e+=1}else if(b=G(b))c=b,Xd(c)?(b=zc(c),d=Bc(c),c=b,f=P(b),b=d,d=f):(f=K(c),nc(a,f),b=L(c),c=null,d=0),e=0;else return null}var Th={'"':'\\"',"\\":"\\\\","\b":"\\b","\f":"\\f","\n":"\\n","\r":"\\r","\t":"\\t"};function Uh(a){return[B.c('"'),B.c(a.replace(/[\\"\b\f\n\r\t]/g,function(a){return Th[a]})),B.c('"')].join("")}
+function Vh(a,b){return(a=ae(F.f(a,fb)))?(a=null!=b?b.m&131072||t===b.Vc?!0:!1:!1)?null!=Nd(b):a:a}
+function Wh(a,b,c){if(null==a)return nc(b,"nil");Vh(c,a)&&(nc(b,"^"),Xh(Nd(a),b,c),nc(b," "));if(a.Zc)return a.Bd(b);if(null!=a&&(a.m&2147483648||t===a.Y))return a.M(b,c);if(!0===a||!1===a)return nc(b,[B.c(a)].join(""));if("number"===typeof a)return nc(b,isNaN(a)?"##NaN":a===Number.POSITIVE_INFINITY?"##Inf":a===Number.NEGATIVE_INFINITY?"##-Inf":[B.c(a)].join(""));if(null!=a&&a.constructor===Object)return nc(b,"#js "),Yh(rf.f(function(b){return new Xf(null!=Oh(/[A-Za-z_\*\+\?!\-'][\w\*\+\?!\-']*/,
+b)?Ce.c(b):b,a[b])},xa(a)),b,c);if(jb(a))return Qh(b,Xh,"#js ["," ","]",c,a);if("string"==typeof a)return w(eb.c(c))?nc(b,Uh(a)):nc(b,a);if(ca(a)){var d=a.name;c=w(function(){var a=null==d;return a?a:/^[\s\xa0]*$/.test(d)}())?"Function":d;return Sh(b,S(["#object[",c,"","]"]))}if(a instanceof Date)return c=function(a,b){for(a=[B.c(a)].join("");;)if(P(a)<b)a=["0",B.c(a)].join("");else return a},Sh(b,S(['#inst "',[B.c(a.getUTCFullYear())].join(""),"-",c(a.getUTCMonth()+1,2),"-",c(a.getUTCDate(),2),"T",
+c(a.getUTCHours(),2),":",c(a.getUTCMinutes(),2),":",c(a.getUTCSeconds(),2),".",c(a.getUTCMilliseconds(),3),"-",'00:00"']));if(a instanceof RegExp)return Sh(b,S(['#"',a.source,'"']));if(w(function(){var b=null==a?null:a.constructor;return null==b?null:b.qc}()))return Sh(b,S(["#object[",a.constructor.qc.replace(/\//g,"."),"]"]));d=function(){var b=null==a?null:a.constructor;return null==b?null:b.name}();c=w(function(){var a=null==d;return a?a:/^[\s\xa0]*$/.test(d)}())?"Object":d;return null==a.constructor?
+Sh(b,S(["#object[",c,"]"])):Sh(b,S(["#object[",c," ",[B.c(a)].join(""),"]"]))}function Xh(a,b,c){var d=Zh.c(c);return w(d)?(c=U.h(c,$h,Wh),d.h?d.h(a,b,c):d.call(null,a,b,c)):Wh(a,b,c)}function ai(a,b){var c=new Sa;a:{var d=new Ic(c);Xh(K(a),d,b);a=G(L(a));for(var e=null,f=0,h=0;;)if(h<f){var k=e.K(null,h);nc(d," ");Xh(k,d,b);h+=1}else if(a=G(a))e=a,Xd(e)?(a=zc(e),f=Bc(e),e=a,k=P(a),a=f,f=k):(k=K(e),nc(d," "),Xh(k,d,b),a=L(e),e=null,f=0),h=0;else break a}return c}
+function bi(a){var b=bb();return Qd(a)?"":[B.c(ai(a,b))].join("")}function ci(a,b,c,d,e){return Qh(d,function(a,b,d){var e=Ob(a);c.h?c.h(e,b,d):c.call(null,e,b,d);nc(b," ");a=Pb(a);return c.h?c.h(a,b,d):c.call(null,a,b,d)},[B.c(a),"{"].join(""),", ","}",e,G(b))}function Yh(a,b,c){var d=Xh,e=(Ud(a),null),f=T(e,0);e=T(e,1);return w(f)?ci(["#:",B.c(f)].join(""),e,d,b,c):ci(null,a,d,b,c)}H.prototype.Y=t;H.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};Ee.prototype.Y=t;
+Ee.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};Xf.prototype.Y=t;Xf.prototype.M=function(a,b){return Qh(a,Xh,"["," ","]",b,this)};Zg.prototype.Y=t;Zg.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};Rg.prototype.Y=t;Rg.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};ch.prototype.Y=t;ch.prototype.M=function(a,b){return Qh(a,Xh,"["," ","]",b,this)};ug.prototype.Y=t;ug.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};Zf.prototype.Y=t;
+Zf.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};ye.prototype.Y=t;ye.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};wd.prototype.Y=t;wd.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};Ug.prototype.Y=t;Ug.prototype.M=function(a,b){return Yh(this,a,b)};Sg.prototype.Y=t;Sg.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};cg.prototype.Y=t;cg.prototype.M=function(a,b){return Qh(a,Xh,"["," ","]",b,this)};lh.prototype.Y=t;
+lh.prototype.M=function(a,b){return Yh(this,a,b)};Bh.prototype.Y=t;Bh.prototype.M=function(a,b){return Qh(a,Xh,"#{"," ","}",b,this)};Je.prototype.Y=t;Je.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};nf.prototype.Y=t;nf.prototype.M=function(a,b){nc(a,"#object [cljs.core.Atom ");Xh(new u(null,1,[di,this.state],null),a,b);return nc(a,"]")};th.prototype.Y=t;th.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};bh.prototype.Y=t;
+bh.prototype.M=function(a,b){return Qh(a,Xh,"["," ","]",b,this)};vf.prototype.Y=t;vf.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};W.prototype.Y=t;W.prototype.M=function(a,b){return Qh(a,Xh,"["," ","]",b,this)};jg.prototype.Y=t;jg.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};ve.prototype.Y=t;ve.prototype.M=function(a){return nc(a,"()")};kg.prototype.Y=t;kg.prototype.M=function(a,b){return Qh(a,Xh,"#queue ["," ","]",b,G(this))};u.prototype.Y=t;
+u.prototype.M=function(a,b){return Yh(this,a,b)};Jh.prototype.Y=t;Jh.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};rh.prototype.Y=t;rh.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};Fd.prototype.Y=t;Fd.prototype.M=function(a,b){return Qh(a,Xh,"("," ",")",b,this)};D.prototype.rb=t;D.prototype.gb=function(a,b){if(b instanceof D)return Vc(this,b);throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};V.prototype.rb=t;
+V.prototype.gb=function(a,b){if(b instanceof V)return ze(this,b);throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};cg.prototype.rb=t;cg.prototype.gb=function(a,b){if(Wd(b))return fe(this,b);throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};W.prototype.rb=t;W.prototype.gb=function(a,b){if(Wd(b))return fe(this,b);throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};Xf.prototype.rb=t;
+Xf.prototype.gb=function(a,b){if(Wd(b))return fe(this,b);throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};ch.prototype.rb=t;ch.prototype.gb=function(a,b){if(Wd(b))return fe(this,b);throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};bh.prototype.rb=t;bh.prototype.gb=function(a,b){if(Wd(b))return fe(this,b);throw Error(["Cannot compare ",B.c(this)," to ",B.c(b)].join(""));};var ei=null;
+function fi(){null==ei&&(ei=of(0));return Wc.c([B.c("reagent"),B.c(qf.f(ei,gd))].join(""))}function gi(){}var hi=function hi(a){if(null!=a&&null!=a.rd)return a.rd(a);var c=hi[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=hi._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IEncodeJS.-clj-\x3ejs",a);},ii=function ii(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return ii.l(arguments[0],1<c.length?new H(c.slice(1),0,null):null)};
+ii.l=function(a,b){var c=null!=b&&(b.m&64||t===b.U)?We(oh,b):b,d=F.h(c,ji,De),e=function(){return function(a){var b=f;return(null!=a?t===a.qd||(a.rc?0:x(gi,a)):x(gi,a))?hi(a):"string"===typeof a||"number"===typeof a||a instanceof V||a instanceof D?b.c?b.c(a):b.call(null,a):bi(S([a]))}}(b,c,c,d),f=function(a,b,c,d){return function r(a){if(null==a)return null;if(null!=a?t===a.qd||(a.rc?0:x(gi,a)):x(gi,a))return hi(a);if(a instanceof V)return d.c?d.c(a):d.call(null,a);if(a instanceof D)return[B.c(a)].join("");
+if(Ud(a)){var b={};a=G(a);for(var c=null,f=0,h=0;;)if(h<f){var k=c.K(null,h),m=T(k,0),l=T(k,1);k=b;m=e(m);l=r(l);k[m]=l;h+=1}else if(a=G(a))Xd(a)?(f=zc(a),a=Bc(a),c=f,f=P(f)):(c=K(a),f=T(c,0),h=T(c,1),c=b,f=e(f),h=r(h),c[f]=h,a=L(a),c=null,f=0),h=0;else break;return b}if(Rd(a)){b=[];a=G(rf.f(r,a));c=null;for(h=f=0;;)if(h<f)k=c.K(null,h),b.push(k),h+=1;else if(a=G(a))c=a,Xd(c)?(a=zc(c),h=Bc(c),c=a,f=P(a),a=h):(a=K(c),b.push(a),a=L(c),c=null,f=0),h=0;else break;return b}return a}}(b,c,c,d);return f(a)};
+ii.G=1;ii.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};function ki(){}var li=function li(a,b){if(null!=a&&null!=a.pd)return a.pd(a,b);var d=li[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=li._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IEncodeClojure.-js-\x3eclj",a);};
+function mi(a){var b=S([ni,!0]),c=null!=b&&(b.m&64||t===b.U)?We(oh,b):b,d=F.f(c,ni);return function(a,c,d,k){return function n(e){return(null!=e?t===e.Ud||(e.rc?0:x(ki,e)):x(ki,e))?li(e,We(ph,b)):$d(e)?Nh(rf.f(n,e)):tg(e)?new Xf(n(Ob(e)),n(Pb(e))):Rd(e)?lf.f(null==e?null:xb(e),rf.f(n,e)):jb(e)?ag(rf.f(n,e)):lb(e)===Object?lf.f(Z,function(){return function(a,b,c,d){return function I(f){return new Ee(null,function(a,b,c,d){return function(){for(;;){var a=G(f);if(a){if(Xd(a)){var b=zc(a),c=P(b),h=Ie(c);
+a:for(var k=0;;)if(k<c){var m=Bb.f(b,k);m=new W(null,2,5,X,[d.c?d.c(m):d.call(null,m),n(e[m])],null);h.add(m);k+=1}else{b=!0;break a}return b?Ke(h.Ha(),I(Bc(a))):Ke(h.Ha(),null)}h=K(a);return yd(new W(null,2,5,X,[d.c?d.c(h):d.call(null,h),n(e[h])],null),I(Yc(a)))}return null}}}(a,b,c,d),null,null)}}(a,c,d,k)(xa(e))}()):e}}(b,c,d,w(d)?Ce:B)(a)}var oi=null;function pi(){null==oi&&(oi=of(new u(null,3,[qi,Z,ri,Z,si,Z],null)));return oi}
+function ti(a,b,c){var d=M.f(b,c);if(d)return d;d=si.c(a);d=d.c?d.c(b):d.call(null,b);if(!(d=de(d,c))&&(d=Wd(c)))if(d=Wd(b))if(d=P(c)===P(b)){d=!0;for(var e=0;;)if(d&&e!==P(c))d=ti(a,b.c?b.c(e):b.call(null,e),c.c?c.c(e):c.call(null,e)),e+=1;else return d}else return d;else return d;else return d}function ui(a){var b=C(pi());return Ze(F.f(qi.c(b),a))}function vi(a,b,c,d){qf.f(a,function(){return C(b)});qf.f(c,function(){return C(d)})}
+var wi=function wi(a,b,c){var e=function(){var b=C(c);return b.c?b.c(a):b.call(null,a)}();e=w(w(e)?e.c?e.c(b):e.call(null,b):e)?!0:null;if(w(e))return e;e=function(){for(var e=ui(b);;)if(0<P(e)){var h=K(e);wi.h?wi.h(a,h,c):wi.call(null,a,h,c);e=Yc(e)}else return null}();if(w(e))return e;e=function(){for(var e=ui(a);;)if(0<P(e)){var h=K(e);wi.h?wi.h(h,b,c):wi.call(null,h,b,c);e=Yc(e)}else return null}();return w(e)?e:!1};function xi(a,b,c,d){c=wi(a,b,c);return w(c)?c:ti(d,a,b)}
+var yi=function yi(a,b,c,d,e,f,h,k){var m=sb(function(d,f){var h=T(f,0);T(f,1);if(ti(C(c),b,h)){var k=(k=null==d)?k:xi(h,K(d),e,C(c));d=w(k)?f:d;if(!w(xi(K(d),h,e,C(c))))throw Error(["Multiple methods in multimethod '",B.c(a),"' match dispatch value: ",B.c(b)," -\x3e ",B.c(h)," and ",B.c(K(d)),", and neither is preferred"].join(""));}return d},null,C(d)),n=function(){var a;if(a=null==m)a=C(d),a=a.c?a.c(k):a.call(null,k);return w(a)?new W(null,2,5,X,[k,a],null):m}();if(w(n)){if(M.f(C(h),C(c)))return qf.C(f,
+U,b,Bd(n)),Bd(n);vi(f,d,h,c);return yi.oa?yi.oa(a,b,c,d,e,f,h,k):yi.call(null,a,b,c,d,e,f,h,k)}return null};function zi(a,b){throw Error(["No method in multimethod '",B.c(a),"' for dispatch value: ",B.c(b)].join(""));}function Ai(a,b,c,d,e,f,h){var k=Bi;this.name=a;this.v=b;this.Ed=k;this.tc=c;this.vc=d;this.Jd=e;this.uc=f;this.hc=h;this.m=4194305;this.I=4352}g=Ai.prototype;
+g.call=function(){function a(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J,Y,oa){a=this;var ea=Ld(a.v,b,c,d,e,S([f,h,k,l,m,n,q,r,v,y,A,E,I,O,J,Y,oa])),Q=Ci(this,ea);w(Q)||zi(a.name,ea);return Ld(Q,b,c,d,e,S([f,h,k,l,m,n,q,r,v,y,A,E,I,O,J,Y,oa]))}function b(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J,Y){a=this;var ea=a.v.Ba?a.v.Ba(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J,Y):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J,Y),Q=Ci(this,ea);w(Q)||zi(a.name,ea);return Q.Ba?Q.Ba(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,
+I,O,J,Y):Q.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J,Y)}function c(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J){a=this;var ea=a.v.Aa?a.v.Aa(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J),Q=Ci(this,ea);w(Q)||zi(a.name,ea);return Q.Aa?Q.Aa(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J):Q.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,J)}function d(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O){a=this;var ea=a.v.za?a.v.za(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O):a.v.call(null,
+b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O),Q=Ci(this,ea);w(Q)||zi(a.name,ea);return Q.za?Q.za(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O):Q.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O)}function e(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I){a=this;var ea=a.v.ya?a.v.ya(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I),Q=Ci(this,ea);w(Q)||zi(a.name,ea);return Q.ya?Q.ya(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I):Q.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I)}function f(a,b,c,d,e,f,h,k,l,m,n,q,
+r,v,y,A,E){a=this;var ea=a.v.xa?a.v.xa(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E),Q=Ci(this,ea);w(Q)||zi(a.name,ea);return Q.xa?Q.xa(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E):Q.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E)}function h(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A){a=this;var ea=a.v.wa?a.v.wa(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A),Q=Ci(this,ea);w(Q)||zi(a.name,ea);return Q.wa?Q.wa(b,c,d,e,f,h,k,l,m,n,q,r,v,y,A):Q.call(null,b,c,d,e,f,h,
+k,l,m,n,q,r,v,y,A)}function k(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y){a=this;var A=a.v.va?a.v.va(b,c,d,e,f,h,k,l,m,n,q,r,v,y):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y),ea=Ci(this,A);w(ea)||zi(a.name,A);return ea.va?ea.va(b,c,d,e,f,h,k,l,m,n,q,r,v,y):ea.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v,y)}function l(a,b,c,d,e,f,h,k,l,m,n,q,r,v){a=this;var y=a.v.ua?a.v.ua(b,c,d,e,f,h,k,l,m,n,q,r,v):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r,v),A=Ci(this,y);w(A)||zi(a.name,y);return A.ua?A.ua(b,c,d,e,f,h,k,l,m,n,q,r,v):A.call(null,
+b,c,d,e,f,h,k,l,m,n,q,r,v)}function m(a,b,c,d,e,f,h,k,l,m,n,q,r){a=this;var v=a.v.ta?a.v.ta(b,c,d,e,f,h,k,l,m,n,q,r):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q,r),y=Ci(this,v);w(y)||zi(a.name,v);return y.ta?y.ta(b,c,d,e,f,h,k,l,m,n,q,r):y.call(null,b,c,d,e,f,h,k,l,m,n,q,r)}function n(a,b,c,d,e,f,h,k,l,m,n,q){a=this;var r=a.v.sa?a.v.sa(b,c,d,e,f,h,k,l,m,n,q):a.v.call(null,b,c,d,e,f,h,k,l,m,n,q),v=Ci(this,r);w(v)||zi(a.name,r);return v.sa?v.sa(b,c,d,e,f,h,k,l,m,n,q):v.call(null,b,c,d,e,f,h,k,l,m,n,q)}function q(a,
+b,c,d,e,f,h,k,l,m,n){a=this;var q=a.v.ra?a.v.ra(b,c,d,e,f,h,k,l,m,n):a.v.call(null,b,c,d,e,f,h,k,l,m,n),r=Ci(this,q);w(r)||zi(a.name,q);return r.ra?r.ra(b,c,d,e,f,h,k,l,m,n):r.call(null,b,c,d,e,f,h,k,l,m,n)}function r(a,b,c,d,e,f,h,k,l,m){a=this;var n=a.v.Da?a.v.Da(b,c,d,e,f,h,k,l,m):a.v.call(null,b,c,d,e,f,h,k,l,m),q=Ci(this,n);w(q)||zi(a.name,n);return q.Da?q.Da(b,c,d,e,f,h,k,l,m):q.call(null,b,c,d,e,f,h,k,l,m)}function v(a,b,c,d,e,f,h,k,l){a=this;var m=a.v.oa?a.v.oa(b,c,d,e,f,h,k,l):a.v.call(null,
+b,c,d,e,f,h,k,l),n=Ci(this,m);w(n)||zi(a.name,m);return n.oa?n.oa(b,c,d,e,f,h,k,l):n.call(null,b,c,d,e,f,h,k,l)}function y(a,b,c,d,e,f,h,k){a=this;var l=a.v.Ca?a.v.Ca(b,c,d,e,f,h,k):a.v.call(null,b,c,d,e,f,h,k),m=Ci(this,l);w(m)||zi(a.name,l);return m.Ca?m.Ca(b,c,d,e,f,h,k):m.call(null,b,c,d,e,f,h,k)}function A(a,b,c,d,e,f,h){a=this;var k=a.v.ga?a.v.ga(b,c,d,e,f,h):a.v.call(null,b,c,d,e,f,h),l=Ci(this,k);w(l)||zi(a.name,k);return l.ga?l.ga(b,c,d,e,f,h):l.call(null,b,c,d,e,f,h)}function E(a,b,c,d,
+e,f){a=this;var h=a.v.N?a.v.N(b,c,d,e,f):a.v.call(null,b,c,d,e,f),k=Ci(this,h);w(k)||zi(a.name,h);return k.N?k.N(b,c,d,e,f):k.call(null,b,c,d,e,f)}function I(a,b,c,d,e){a=this;var f=a.v.C?a.v.C(b,c,d,e):a.v.call(null,b,c,d,e),h=Ci(this,f);w(h)||zi(a.name,f);return h.C?h.C(b,c,d,e):h.call(null,b,c,d,e)}function O(a,b,c,d){a=this;var e=a.v.h?a.v.h(b,c,d):a.v.call(null,b,c,d),f=Ci(this,e);w(f)||zi(a.name,e);return f.h?f.h(b,c,d):f.call(null,b,c,d)}function Y(a,b,c){a=this;var d=a.v.f?a.v.f(b,c):a.v.call(null,
+b,c),e=Ci(this,d);w(e)||zi(a.name,d);return e.f?e.f(b,c):e.call(null,b,c)}function oa(a,b){a=this;var c=a.v.c?a.v.c(b):a.v.call(null,b),d=Ci(this,c);w(d)||zi(a.name,c);return d.c?d.c(b):d.call(null,b)}function Ua(a){a=this;var b=a.v.D?a.v.D():a.v.call(null),c=Ci(this,b);w(c)||zi(a.name,b);return c.D?c.D():c.call(null)}var J=null;J=function(J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib,bc,Ac,jd,oe,Qf,Ri){switch(arguments.length){case 1:return Ua.call(this,J);case 2:return oa.call(this,J,Q);case 3:return Y.call(this,
+J,Q,ma);case 4:return O.call(this,J,Q,ma,na);case 5:return I.call(this,J,Q,ma,na,ta);case 6:return E.call(this,J,Q,ma,na,ta,wa);case 7:return A.call(this,J,Q,ma,na,ta,wa,Ba);case 8:return y.call(this,J,Q,ma,na,ta,wa,Ba,Ea);case 9:return v.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia);case 10:return r.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa);case 11:return q.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za);case 12:return n.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb);case 13:return m.call(this,J,Q,ma,na,ta,wa,Ba,Ea,
+Ia,Qa,Za,cb,ob);case 14:return l.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id);case 15:return k.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db);case 16:return h.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib);case 17:return f.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib,bc);case 18:return e.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib,bc,Ac);case 19:return d.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib,bc,Ac,jd);case 20:return c.call(this,J,Q,ma,
+na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib,bc,Ac,jd,oe);case 21:return b.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib,bc,Ac,jd,oe,Qf);case 22:return a.call(this,J,Q,ma,na,ta,wa,Ba,Ea,Ia,Qa,Za,cb,ob,id,Db,Ib,bc,Ac,jd,oe,Qf,Ri)}throw Error("Invalid arity: "+(arguments.length-1));};J.c=Ua;J.f=oa;J.h=Y;J.C=O;J.N=I;J.ga=E;J.Ca=A;J.oa=y;J.Da=v;J.ra=r;J.sa=q;J.ta=n;J.ua=m;J.va=l;J.wa=k;J.xa=h;J.ya=f;J.za=e;J.Aa=d;J.Ba=c;J.Cc=b;J.sd=a;return J}();g.apply=function(a,b){return this.call.apply(this,[this].concat(qb(b)))};
+g.D=function(){var a=this.v.D?this.v.D():this.v.call(null),b=Ci(this,a);w(b)||zi(this.name,a);return b.D?b.D():b.call(null)};g.c=function(a){var b=this.v.c?this.v.c(a):this.v.call(null,a),c=Ci(this,b);w(c)||zi(this.name,b);return c.c?c.c(a):c.call(null,a)};g.f=function(a,b){var c=this.v.f?this.v.f(a,b):this.v.call(null,a,b),d=Ci(this,c);w(d)||zi(this.name,c);return d.f?d.f(a,b):d.call(null,a,b)};
+g.h=function(a,b,c){var d=this.v.h?this.v.h(a,b,c):this.v.call(null,a,b,c),e=Ci(this,d);w(e)||zi(this.name,d);return e.h?e.h(a,b,c):e.call(null,a,b,c)};g.C=function(a,b,c,d){var e=this.v.C?this.v.C(a,b,c,d):this.v.call(null,a,b,c,d),f=Ci(this,e);w(f)||zi(this.name,e);return f.C?f.C(a,b,c,d):f.call(null,a,b,c,d)};g.N=function(a,b,c,d,e){var f=this.v.N?this.v.N(a,b,c,d,e):this.v.call(null,a,b,c,d,e),h=Ci(this,f);w(h)||zi(this.name,f);return h.N?h.N(a,b,c,d,e):h.call(null,a,b,c,d,e)};
+g.ga=function(a,b,c,d,e,f){var h=this.v.ga?this.v.ga(a,b,c,d,e,f):this.v.call(null,a,b,c,d,e,f),k=Ci(this,h);w(k)||zi(this.name,h);return k.ga?k.ga(a,b,c,d,e,f):k.call(null,a,b,c,d,e,f)};g.Ca=function(a,b,c,d,e,f,h){var k=this.v.Ca?this.v.Ca(a,b,c,d,e,f,h):this.v.call(null,a,b,c,d,e,f,h),l=Ci(this,k);w(l)||zi(this.name,k);return l.Ca?l.Ca(a,b,c,d,e,f,h):l.call(null,a,b,c,d,e,f,h)};
+g.oa=function(a,b,c,d,e,f,h,k){var l=this.v.oa?this.v.oa(a,b,c,d,e,f,h,k):this.v.call(null,a,b,c,d,e,f,h,k),m=Ci(this,l);w(m)||zi(this.name,l);return m.oa?m.oa(a,b,c,d,e,f,h,k):m.call(null,a,b,c,d,e,f,h,k)};g.Da=function(a,b,c,d,e,f,h,k,l){var m=this.v.Da?this.v.Da(a,b,c,d,e,f,h,k,l):this.v.call(null,a,b,c,d,e,f,h,k,l),n=Ci(this,m);w(n)||zi(this.name,m);return n.Da?n.Da(a,b,c,d,e,f,h,k,l):n.call(null,a,b,c,d,e,f,h,k,l)};
+g.ra=function(a,b,c,d,e,f,h,k,l,m){var n=this.v.ra?this.v.ra(a,b,c,d,e,f,h,k,l,m):this.v.call(null,a,b,c,d,e,f,h,k,l,m),q=Ci(this,n);w(q)||zi(this.name,n);return q.ra?q.ra(a,b,c,d,e,f,h,k,l,m):q.call(null,a,b,c,d,e,f,h,k,l,m)};g.sa=function(a,b,c,d,e,f,h,k,l,m,n){var q=this.v.sa?this.v.sa(a,b,c,d,e,f,h,k,l,m,n):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n),r=Ci(this,q);w(r)||zi(this.name,q);return r.sa?r.sa(a,b,c,d,e,f,h,k,l,m,n):r.call(null,a,b,c,d,e,f,h,k,l,m,n)};
+g.ta=function(a,b,c,d,e,f,h,k,l,m,n,q){var r=this.v.ta?this.v.ta(a,b,c,d,e,f,h,k,l,m,n,q):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q),v=Ci(this,r);w(v)||zi(this.name,r);return v.ta?v.ta(a,b,c,d,e,f,h,k,l,m,n,q):v.call(null,a,b,c,d,e,f,h,k,l,m,n,q)};g.ua=function(a,b,c,d,e,f,h,k,l,m,n,q,r){var v=this.v.ua?this.v.ua(a,b,c,d,e,f,h,k,l,m,n,q,r):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r),y=Ci(this,v);w(y)||zi(this.name,v);return y.ua?y.ua(a,b,c,d,e,f,h,k,l,m,n,q,r):y.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r)};
+g.va=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v){var y=this.v.va?this.v.va(a,b,c,d,e,f,h,k,l,m,n,q,r,v):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v),A=Ci(this,y);w(A)||zi(this.name,y);return A.va?A.va(a,b,c,d,e,f,h,k,l,m,n,q,r,v):A.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v)};
+g.wa=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y){var A=this.v.wa?this.v.wa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y),E=Ci(this,A);w(E)||zi(this.name,A);return E.wa?E.wa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y):E.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y)};
+g.xa=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A){var E=this.v.xa?this.v.xa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A),I=Ci(this,E);w(I)||zi(this.name,E);return I.xa?I.xa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A):I.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A)};
+g.ya=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E){var I=this.v.ya?this.v.ya(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E),O=Ci(this,I);w(O)||zi(this.name,I);return O.ya?O.ya(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E):O.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E)};
+g.za=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I){var O=this.v.za?this.v.za(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I),Y=Ci(this,O);w(Y)||zi(this.name,O);return Y.za?Y.za(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I):Y.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I)};
+g.Aa=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O){var Y=this.v.Aa?this.v.Aa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O),oa=Ci(this,Y);w(oa)||zi(this.name,Y);return oa.Aa?oa.Aa(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O):oa.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O)};
+g.Ba=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y){var oa=this.v.Ba?this.v.Ba(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y):this.v.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y),Ua=Ci(this,oa);w(Ua)||zi(this.name,oa);return Ua.Ba?Ua.Ba(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y):Ua.call(null,a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y)};
+g.Cc=function(a,b,c,d,e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa){var Ua=Ld(this.v,a,b,c,d,S([e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa])),J=Ci(this,Ua);w(J)||zi(this.name,Ua);return Ld(J,a,b,c,d,S([e,f,h,k,l,m,n,q,r,v,y,A,E,I,O,Y,oa]))};function Di(a,b,c){qf.C(a.vc,U,b,c);vi(a.uc,a.vc,a.hc,a.tc)}function Ci(a,b){M.f(C(a.hc),C(a.tc))||vi(a.uc,a.vc,a.hc,a.tc);var c=C(a.uc);c=c.c?c.c(b):c.call(null,b);return w(c)?c:yi(a.name,b,a.tc,a.vc,a.Jd,a.uc,a.hc,a.Ed)}g.Qb=function(){return Cc(this.name)};g.Rb=function(){return Dc(this.name)};
+g.L=function(){return da(this)};function Ei(a,b,c){var d=Error(a);this.message=a;this.data=b;this.zc=c;this.name=d.name;this.description=d.description;this.number=d.number;this.fileName=d.fileName;this.lineNumber=d.lineNumber;this.columnNumber=d.columnNumber;this.stack=d.stack;return this}Ei.prototype.__proto__=Error.prototype;Ei.prototype.Y=t;
+Ei.prototype.M=function(a,b){nc(a,"#error {:message ");Xh(this.message,a,b);w(this.data)&&(nc(a,", :data "),Xh(this.data,a,b));w(this.zc)&&(nc(a,", :cause "),Xh(this.zc,a,b));return nc(a,"}")};Ei.prototype.toString=function(){return Jc(this)};function Fi(a,b){return new Ei(a,b,null)}function Gi(a,b){this.tag=a;this.form=b;this.m=2153775360;this.I=0}g=Gi.prototype;g.toString=function(){return Jc(this)};g.H=function(a,b){return b instanceof Gi&&M.f(this.tag,b.tag)&&M.f(this.form,b.form)};
+g.L=function(){return 31*Sc(this.tag)+Sc(this.form)};g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){switch(b instanceof V?b.Ka:null){case "tag":return this.tag;case "form":return this.form;default:return c}};g.M=function(a,b){nc(a,["#",B.c(this.tag)," "].join(""));return Xh(this.form,a,b)};
+var Hi="arguments abstract await boolean break byte case catch char class const continue debugger default delete do double else enum export extends final finally float for function goto if implements import in instanceof int interface let long native new package private protected public return short static super switch synchronized this throw throws transient try typeof var void volatile while with yield methods null constructor".split(" "),Ii=null;
+function Ji(a){null==Ii&&(Ii=sb(function(a,c){a[c]=!0;return a},{},Hi));return Ii.hasOwnProperty(a)}if("undefined"===typeof Ta||"undefined"===typeof Va||"undefined"===typeof Ki)var Ki=null;function Li(a){this.name=a;this.m=6291456;this.I=0}Li.prototype.getName=function(){return this.name};Li.prototype.toString=function(){return[B.c(this.name)].join("")};Li.prototype.H=function(a,b){return b instanceof Li?M.f(this.name,b.name):!1};Li.prototype.L=function(){return Sc(this.name)};var Mi=null;
+"undefined"!==typeof console&&(Xa=function(){return console.log.apply(console,ra(arguments))},Ya=function(){return console.error.apply(console,ra(arguments))});if("undefined"===typeof Ta||"undefined"===typeof Va||"undefined"===typeof Ni)var Ni=function(){throw Error("cljs.core/*eval* not bound");};var Oi=new D(null,"\x26","\x26",-2144855648,null),Pi=new V(null,"unnamed","unnamed",-26044928),Qi=new V(null,"features","features",-1146962336),Si=new V(null,"add-event","add-event",938429088),Ti=new D(null,"case*","case*",-1938255072,null),Ui=new V(null,"ex-kind","ex-kind",1581199296),Vi=new V(null,"yield","yield",177875009),Wi=new D(null,"defrecord*","defrecord*",-1936366207,null),Xi=new V(null,"reader-error","reader-error",1610253121),Yi=new V(null,"paused","paused",-1710376127),Zi=new D(null,
+"try","try",-1273693247,null),$i=new V(null,"errors","errors",-908790718),aj=new V(null,"on-set","on-set",-140953470),bj=new V(null,"block","block",664686210),cj=new D("clojure.core","list","clojure.core/list",-1119203325,null),dj=new V(null,"cljsLegacyRender","cljsLegacyRender",-1527295613),ej=new V(null,"idle","idle",-2007156861),fj=new V(null,"cause","cause",231901252),gj=new V(null,"namespaced-map","namespaced-map",1235665380),hj=new V(null,"group","group",582596132),fb=new V(null,"meta","meta",
+1499536964),ij=new V(null,"ul","ul",-1349521403),gb=new V(null,"dup","dup",556298533),jj=new D(null,"view","view",-1406440955,null),kj=new V(null,"key","key",-1516042587),lj=new V(null,"fsm-state","fsm-state",1656310533),mj=new D("cljs.core","array-map","cljs.core/array-map",-1519210683,null),nj=new D(null,"text","text",-150030170,null),oj=new V(null,"reader-exception","reader-exception",-1938323098),pj=new V(null,"else","else",-1508377146),qj=new V(null,"invalid-namespaces","invalid-namespaces",
+-935340538),rj=new V(null,"\x3c-","\x3c-",760412998),sj=new D(null,"ns*","ns*",1840949383,null),tj=new D("cljs.core","hash-map","cljs.core/hash-map",303385767,null),uj=new V(null,"button","button",1456579943),vj=new V(null,"db","db",993250759),wj=new V(null,"unknown-block-type","unknown-block-type",-507846201),xj=new V(null,"sub","sub",-2093760025),yj=new D("cljs.core","apply","cljs.core/apply",1757277831,null),zj=new V("re-frame.std-interceptors","not-found","re-frame.std-interceptors/not-found",
+-1614827865),Aj=new V(null,"queue","queue",1455835879),Bj=new V(null,"displayName","displayName",-809144601),Cj=new V(null,"validator","validator",-1966190681),Dj=new D(null,"finally","finally",-1065347064,null),Ej=new V(null,"content","content",15833224),Bi=new V(null,"default","default",-1987822328),Fj=new V(null,"sequential","sequential",-1082983960),Gj=new D(null,"loop*","loop*",615029416,null),Hj=new V(null,"symbol","symbol",-1038572696),Ij=new V(null,"warn","warn",-436710552),Jj=new V(null,
+"name","name",1843675177),Kj=new V(null,"events","events",1792552201),Lj=new D(null,"NaN","NaN",666918153,null),Mj=new V(null,"li","li",723558921),Nj=new V("views","main","views/main",-1995108663),Oj=new V(null,"value","value",305978217),Pj=new D(null,"let","let",358118826,null),Qj=new V(null,"file","file",-1269645878),Rj=new D("cljs.core","concat","cljs.core/concat",-1133584918,null),Sj=new V(null,"valid-hooks","valid-hooks",-1178341686),Tj=new V(null,"do-fx","do-fx",1194163050),Uj=new V(null,"end-column",
+"end-column",1425389514),Vj=new V("hooks","main","hooks/main",-1948863093),Wj=new V(null,"component-did-update","component-did-update",-1468549173),Xj=new V(null,"read-cond","read-cond",1056899244),di=new V(null,"val","val",128701612),Yj=new V(null,"dispatch-n","dispatch-n",-504469236),Zj=new V(null,"type","type",1174270348),ak=new V(null,"unknown-view","unknown-view",-324262388),bk=new D(null,"do","do",1686842252,null),ck=new V(null,"debug","debug",-1608172596),dk=new D(null,"when","when",1064114221,
+null),ek=new V(null,"preserve","preserve",1276846509),$h=new V(null,"fallback-impl","fallback-impl",-1501286995),ji=new V(null,"keyword-fn","keyword-fn",-64566675),fk=new D(null,"Inf","Inf",647172781,null),gk=new V(null,"source","source",-433931539),db=new V(null,"flush-on-newline","flush-on-newline",-151457939),hk=new V(null,"env","env",-1815813235),ik=new V(null,"componentWillUnmount","componentWillUnmount",1573788814),jk=new V(null,"string","string",-1989541586),kk=new V(null,"vector","vector",
+1902966158),lk=new V(null,"extra-properties","extra-properties",39412206),mk=new V(null,"illegal-argument","illegal-argument",-1845493170),nk=new D(null,"letfn*","letfn*",-110097810,null),ok=new V(null,"deregister-event-handler","deregister-event-handler",-1096518994),pk=new D(null,"if","if",1181717262,null),qk=new D("cljs.core","with-meta","cljs.core/with-meta",749126446,null),rk=new D(null,"button","button",-1197855826,null),sk=new D(null,"new","new",-444906321,null),tk=new V(null,"strable","strable",
+1877668047),ri=new V(null,"descendants","descendants",1824886031),uk=new V(null,"unknown-reference-type","unknown-reference-type",-472552113),vk=new V(null,"allow","allow",-1857325745),wk=new D(null,"ns","ns",2082130287,null),xk=new V(null,"running","running",1554969103),yk=new V(null,"sym","sym",-1444860305),zk=new V(null,"column","column",2078222095),Ak=new V(null,"shouldComponentUpdate","shouldComponentUpdate",1795750960),si=new V(null,"ancestors","ancestors",-776045424),Bk=new V(null,"invalid-hooks",
+"invalid-hooks",926439600),Ck=new V(null,"flush-dom","flush-dom",-933676816),Dk=new V(null,"div","div",1057191632),Ek=new V(null,"trim-v","trim-v",-1274938640),eb=new V(null,"readably","readably",1129599760),Fk=new V(null,"random-boolean","random-boolean",2015461168),Rh=new V(null,"more-marker","more-marker",-14717935),Gk=new V(null,"dispatch","dispatch",1319337009),xh=new V(null,"reagentRender","reagentRender",-358306383),Hk=new V(null,"Objects","Objects",-610644271),Ik=new V(null,"\x3c\x3e","\x3c\x3e",
+1280186386),Jk=new V(null,"no-cache","no-cache",1588056370),wh=new V(null,"render","render",-1408033454),Kk=new V(null,"illegal-state","illegal-state",-1519851182),Lk=new V(null,"db-handler","db-handler",579530098),Mk=new D("clojure.core","unquote-splicing","clojure.core/unquote-splicing",-552003150,null),Nk=new D(null,"deftype*","deftype*",962659890,null),Ok=new V(null,"event","event",301435442),Pk=new D(null,"let*","let*",1920721458,null),Qk=new V(null,"after","after",594996914),Rk=new V(null,"splicing?",
+"splicing?",-428596366),Sk=new V(null,"success","success",1890645906),Tk=new V(null,"components","components",-1073188942),Uk=new D(null,"js*","js*",-1134233646,null),Vk=new V(null,"reagent-render","reagent-render",-985383853),Wk=new V(null,"capacities","capacities",-1666536173),Xk=new V(null,"line","line",212345235),Yk=new V(null,"list","list",765357683),Zk=new D(null,"fn*","fn*",-752876845,null),$k=new V(null,"on-write","on-write",31519475),al=new V(null,"keyword","keyword",811389747),bl=new D(null,
+"recur","recur",1202958259,null),hb=new V(null,"print-length","print-length",1931866356),cl=new V(null,"col","col",-1959363084),dl=new V(null,"id","id",-1388402092),el=new V(null,"class","class",-2030961996),fl=new V(null,"effects","effects",-282369292),gl=new V(null,"Links","Links",1715516180),hl=new D("clojure.core","deref","clojure.core/deref",188719157,null),il=new V(null,"opts","opts",155075701),jl=new V(null,"nil","nil",99600501),kl=new V(null,"auto-run","auto-run",1958400437),qi=new V(null,
+"parents","parents",-2027538891),ll=new D(null,"/","/",-1371932971,null),ml=new V(null,"run-queue","run-queue",-1701798027),nl=new V(null,"component-will-unmount","component-will-unmount",-2058314698),ol=new V(null,"extension-id","extension-id",-629939786),pl=new V(null,"stack","stack",-793405930),ql=new D("clojure.core","unquote","clojure.core/unquote",843087510,null),rl=new V(null,"Hash","Hash",-72757482),sl=new V(null,"b","b",1482224470),tl=new V(null,"end-line","end-line",1837326455),ul=new V(null,
+"unknown-key","unknown-key",255305911),vl=new V(null,"display-name","display-name",694513143),wl=new V(null,"scheduled","scheduled",553898551),xl=new V(null,"random","random",-557811113),yl=new D("cljs.core","vec","cljs.core/vec",307622519,null),zl=new D(null,"-Inf","-Inf",-2123243689,null),Al=new V(null,"Name","Name",-131211369),Bl=new V(null,"on-dispose","on-dispose",2105306360),Cl=new D("cljs.core","sequence","cljs.core/sequence",1908459032,null),Dl=new V(null,"pause","pause",-2095325672),El=new V(null,
+"error","error",-978969032),Fl=new V(null,"regex","regex",939488856),yh=new V(null,"componentFunction","componentFunction",825866104),Gl=new V(null,"exception","exception",-335277064),Hl=new V(null,"coeffects","coeffects",497912985),Il=new D(null,"set!","set!",250714521,null),Jl=new V(null,"unsupported-operation","unsupported-operation",1890540953),Kl=new V(null,"form","form",-1624062471),Ll=new V(null,"tag","tag",-1290361223),Ml=new D(null,".",".",1975675962,null),Nl=new D(null,"var","var",870848730,
+null),Ol=new D(null,"quote","quote",1377916282,null),Pl=new V(null,"set","set",304602554),Ql=new V(null,"timeout","timeout",-318625318),Rl=new V(null,"groupEnd","groupEnd",-337721382),Sl=new V(null,"atom","atom",-397043653),Tl=new V(null,"trigger","trigger",103466139),Ul=new V(null,"unknown-component","unknown-component",-530928453),Vl=new V(null,"eof","eof",-489063237),Wl=new V(null,"autobind","autobind",-570650245),Xl=new V(null,"hierarchy","hierarchy",-1053470341),Yl=new D(null,"catch","catch",
+-1616370245,null),Zl=new V(null,"cofx","cofx",2013202907),$l=new V(null,"queries","queries",1446291995),Zh=new V(null,"alt-impl","alt-impl",670969595),am=new V(null,"resume","resume",-118572261),bm=new V(null,"ms","ms",-1152709733),cm=new V(null,"fx","fx",-1237829572),dm=new V(null,"before","before",-1633692388),ni=new V(null,"keywordize-keys","keywordize-keys",1310784252),em=new V(null,"log","log",-1595516004),fm=new V(null,"unsupported-type","unsupported-type",-734728196),gm=new V("re-frame.std-interceptors",
+"untrimmed-event","re-frame.std-interceptors/untrimmed-event",-840935075),hm=new D("cljs.core","hash-set","cljs.core/hash-set",1130426749,null),im=new V(null,"character","character",380652989),jm=new V(null,"map","map",1371690461),km=new D("cljs.core","list","cljs.core/list",-1331406371,null),lm=new V(null,"eofthrow","eofthrow",-334166531),mm=new V(null,"finish-run","finish-run",753148477),nm=new V(null,"componentWillMount","componentWillMount",-285327619),om=new V(null,"test","test",577538877),pm=
+new V(null,"runtime-exception","runtime-exception",-1495664514),qm=new D(null,"throw","throw",595905694,null),rm=new V(null,"none","none",1333468478),sm=new V(null,"invalid-extension-keys","invalid-extension-keys",-164289122),tm=new V(null,"gateway-url","gateway-url",1046231486),um=new V(null,"dispatch-later","dispatch-later",291951390),vm=new V(null,"message","message",-406056002),wm=new V(null,"view","view",1247994814),zh=new V("cljs.core","not-found","cljs.core/not-found",-1572889185),xm=new D(null,
+"def","def",597100991,null),ym=new V(null,"span","span",1394872991),zm=new V(null,"data","data",-232669377);var Am={},Bm=function Bm(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Bm.l(arguments[0],1<c.length?new H(c.slice(1),0,null):null)};Bm.l=function(a,b){return lf.f(new W(null,2,5,X,[Dk,a],null),b)};Bm.G=1;Bm.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};var Cm=function Cm(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Cm.l(arguments[0],1<c.length?new H(c.slice(1),0,null):null)};
+Cm.l=function(a,b){return lf.f(new W(null,2,5,X,[uj,a],null),b)};Cm.G=1;Cm.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};var Dm=function Dm(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Dm.l(arguments[0],1<c.length?new H(c.slice(1),0,null):null)};Dm.l=function(a,b){return lf.f(new W(null,2,5,X,[ym,a],null),b)};Dm.G=1;Dm.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};var Em=new u(null,3,[jj,Bm,rk,Cm,nj,Dm],null);var Fm={};var Gm={},Hm="undefined"!==typeof console;if("undefined"===typeof Fm||"undefined"===typeof Gm||"undefined"===typeof Im)var Im=of(null);
+if("undefined"===typeof Fm||"undefined"===typeof Gm||"undefined"===typeof Jm)var Jm=function(){var a={};a.warn=function(){return function(){function a(a){var b=null;if(0<arguments.length){b=0;for(var d=Array(arguments.length-0);b<d.length;)d[b]=arguments[b+0],++b;b=new H(d,0,null)}return c.call(this,b)}function c(a){return qf.l(Im,Ff,new W(null,1,5,X,[Ij],null),Dd,S([We(B,a)]))}a.G=0;a.F=function(a){a=G(a);return c(a)};a.l=c;return a}()}(a);a.error=function(){return function(){function a(a){var b=
+null;if(0<arguments.length){b=0;for(var d=Array(arguments.length-0);b<d.length;)d[b]=arguments[b+0],++b;b=new H(d,0,null)}return c.call(this,b)}function c(a){return qf.l(Im,Ff,new W(null,1,5,X,[El],null),Dd,S([We(B,a)]))}a.G=0;a.F=function(a){a=G(a);return c(a)};a.l=c;return a}()}(a);return a}();function Km(a,b,c){var d=RegExp,e=b.source,f=w(b.ignoreCase)?[B.c("g"),"i"].join(""):"g";f=w(b.multiline)?[B.c(f),"m"].join(""):f;b=w(b.ge)?[B.c(f),"u"].join(""):f;d=new d(e,b);return a.replace(d,c)}
+function Lm(a){return function(){function b(a){var b=null;if(0<arguments.length){b=0;for(var d=Array(arguments.length-0);b<d.length;)d[b]=arguments[b+0],++b;b=new H(d,0,null)}return c.call(this,b)}function c(b){b=uf(b);if(M.f(P(b),1))return b=K(b),a.c?a.c(b):a.call(null,b);b=ag(b);return a.c?a.c(b):a.call(null,b)}b.G=0;b.F=function(a){a=G(a);return c(a)};b.l=c;return b}()}
+function Mm(a,b,c){if("string"===typeof b)return a.replace(new RegExp(String(b).replace(/([-()\[\]{}+?*.$\^|,:#<!\\])/g,"\\$1").replace(/\x08/g,"\\x08"),"g"),c);if(b instanceof RegExp)return"string"===typeof c?Km(a,b,c):Km(a,b,Lm(c));throw["Invalid match arg: ",B.c(b)].join("");}function Nm(a){var b=new Sa;for(a=G(a);;)if(null!=a)b.append([B.c(K(a))].join("")),a=L(a),null!=a&&b.append(" ");else return b.toString()}
+function Om(a,b){a="/(?:)/"===[B.c(b)].join("")?Dd.f(ag(yd("",rf.f(B,G(a)))),""):ag([B.c(a)].join("").split(b));if(1<P(a))a:for(;;)if(""===Od(a))a=null==a?null:Tb(a);else break a;return a};var Pm={},Qm=new Bh(null,new u(null,2,["aria",null,"data",null],null),null);function Rm(a){return 2>P(a)?a.toUpperCase():[B.c(te(a,1).toUpperCase()),B.c(a.substring(1))].join("")}function Sm(a){if("string"===typeof a)return a;a=De(a);var b=Om(a,/-/);var c=G(b);b=K(c);c=L(c);return w(Qm.c?Qm.c(b):Qm.call(null,b))?a:Xe(B,b,rf.f(Rm,c))}
+function Tm(a){var b=function(){var b=function(){var b=Jd(a);return b?(b=a.displayName,w(b)?b:a.name):b}();if(w(b))return b;b=function(){var b=null!=a?a.I&4096||t===a.Wc?!0:!1:!1;return b?De(a):b}();if(w(b))return b;b=Nd(a);return Ud(b)?Jj.c(b):null}();return Mm([B.c(b)].join(""),"$",".")}var Um=!1;var Vm={};if("undefined"===typeof Fm||"undefined"===typeof Pm||"undefined"===typeof Vm||"undefined"===typeof Wm)var Wm=0;function Xm(a){return setTimeout(a,16)}var Ym="undefined"===typeof window||null==window.document?Xm:function(){var a=window,b=a.requestAnimationFrame;if(w(b))return b;b=a.webkitRequestAnimationFrame;if(w(b))return b;b=a.mozRequestAnimationFrame;if(w(b))return b;a=a.msRequestAnimationFrame;return w(a)?a:Xm}();function Zm(a,b){return a.cljsMountOrder-b.cljsMountOrder}
+if("undefined"===typeof Fm||"undefined"===typeof Pm||"undefined"===typeof Vm||"undefined"===typeof $m)var $m=function(){return null};function an(){this.wc=!1}function bn(a,b){var c=a[b];if(null==c)return null;a[b]=null;a=c.length;for(b=0;;)if(b<a){var d=c[b];d.D?d.D():d.call(null);b+=1}else return null}
+function cn(a){if(a.wc)return null;a.wc=!0;a=function(a){return function(){a.wc=!1;bn(a,"beforeFlush");$m();var b=a.componentQueue;if(null!=b){a.componentQueue=null;b.sort(Zm);for(var d=b.length,e=0;;)if(e<d){var f=b[e];!0===f.cljsIsDirty&&f.forceUpdate();e+=1}else break}return bn(a,"afterRender")}}(a);return Ym.c?Ym.c(a):Ym.call(null,a)}
+an.prototype.enqueue=function(a,b){if(!w(b))throw Error(["Assert failed: ",B.c("Enqueued function must not be nil"),"\nf"].join(""));null==this[a]&&(this[a]=[]);this[a].push(b);return cn(this)};function dn(a){return en.enqueue("afterRender",a)}if("undefined"===typeof Fm||"undefined"===typeof Pm||"undefined"===typeof Vm||"undefined"===typeof en){var en;en=new an}function fn(a){if(w(a.cljsIsDirty))return null;a.cljsIsDirty=!0;return en.enqueue("componentQueue",a)};function gn(a,b){a=Xe(Hh,a,b);return yd(a,zf(function(a){return function(b){return a===b}}(a),b))}function hn(a,b){return P(a)<P(b)?sb(Dd,b,a):sb(Dd,a,b)}var jn=function jn(a){switch(arguments.length){case 1:return jn.c(arguments[0]);case 2:return jn.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return jn.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};jn.c=function(a){return a};
+jn.f=function(a,b){for(;;)if(P(b)<P(a)){var c=a;a=b;b=c}else return sb(function(a,b){return function(a,c){return de(b,c)?a:Pd.f(a,c)}}(a,b),a,a)};jn.l=function(a,b,c){a=gn(function(a){return-P(a)},Dd.l(c,b,S([a])));return sb(jn,K(a),Yc(a))};jn.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};jn.G=2;
+var kn=function kn(a){switch(arguments.length){case 1:return kn.c(arguments[0]);case 2:return kn.f(arguments[0],arguments[1]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return kn.l(arguments[0],arguments[1],new H(c.slice(2),0,null))}};kn.c=function(a){return a};kn.f=function(a,b){return P(a)<P(b)?sb(function(a,d){return de(b,d)?Pd.f(a,d):a},a,a):sb(Pd,a,b)};kn.l=function(a,b,c){return sb(kn,a,Dd.f(c,b))};
+kn.F=function(a){var b=K(a),c=L(a);a=K(c);c=L(c);return this.l(b,a,c)};kn.G=2;var ln={},mn;if("undefined"===typeof Fm||"undefined"===typeof ln||"undefined"===typeof nn)var nn=!1;if("undefined"===typeof Fm||"undefined"===typeof ln||"undefined"===typeof on)var on=0;if("undefined"===typeof Fm||"undefined"===typeof ln||"undefined"===typeof pn)var pn=of(0);function qn(a,b){var c=mn;mn=a;try{return b.D?b.D():b.call(null)}finally{mn=c}}
+function rn(a,b){b.captured=null;b.fe=on+=1;a=qn(b,a);var c=b.captured;b.tb=!1;a:{var d=b.Eb;var e=null==c?0:c.length,f=e===(null==d?0:d.length);if(f)for(f=0;;){var h=f===e;if(h){d=h;break a}if(c[f]===d[f])f+=1;else{d=!1;break a}}else d=f}if(!d)a:{d=Eh(c);e=Eh(b.Eb);b.Eb=c;c=G(kn.f(d,e));f=null;for(var k=h=0;;)if(k<h){var l=f.K(null,k);qc(l,b,sn);k+=1}else if(c=G(c))f=c,Xd(f)?(c=zc(f),k=Bc(f),f=c,h=P(c),c=k):(c=K(f),qc(c,b,sn),c=L(f),f=null,h=0),k=0;else break;d=G(kn.f(e,d));e=null;for(h=f=0;;)if(h<
+f)c=e.K(null,h),rc(c,b),h+=1;else if(d=G(d))e=d,Xd(e)?(d=zc(e),f=Bc(e),e=d,c=P(d),d=f,f=c):(c=K(e),rc(c,b),d=L(e),e=null,f=0),h=0;else break a}return a}function tn(a){var b=mn;if(null!=b){var c=b.captured;null==c?b.captured=[a]:c.push(a)}}function un(a,b){nn&&qf.h(pn,me,P(b)-P(a));return b}function vn(a,b,c){var d=a.pa;a.pa=un(d,U.h(d,b,c));return a.Kc=null}function wn(a,b){var c=a.pa;a.pa=un(c,Id.f(c,b));return a.Kc=null}
+function xn(a,b,c){var d=a.Kc;d=null==d?a.Kc=je(function(){return function(a,b,c){a.push(b);a.push(c);return a}}(d),[],a.pa):d;for(var e=d.length,f=0;;)if(f<e){var h=d[f],k=d[f+1];k.C?k.C(h,a,b,c):k.call(null,h,a,b,c);f=2+f}else return null}function yn(a,b,c,d){nc(b,["#\x3c",B.c(d)," "].join(""));a:{d=mn;mn=null;try{var e=C(a);break a}finally{mn=d}e=void 0}Xh(e,b,c);return nc(b,"\x3e")}if("undefined"===typeof Fm||"undefined"===typeof ln||"undefined"===typeof zn)var zn=null;
+function An(){for(;;){var a=zn;if(null==a)return null;zn=null;for(var b=a.length,c=0;;)if(c<b){var d=a[c];d.tb&&null!=d.Eb&&Bn(d,!0);c+=1}else break}}$m=An;function Cn(){}function Dn(a,b,c,d){this.state=a;this.meta=b;this.Db=c;this.pa=d;this.m=2154201088;this.I=114690}g=Dn.prototype;g.ec=t;g.M=function(a,b){return yn(this,a,b,"Atom:")};g.T=function(){return this.meta};g.L=function(){return da(this)};g.H=function(a,b){return this===b};
+g.Na=function(a,b){if(null!=this.Db&&!w(this.Db.c?this.Db.c(b):this.Db.call(null,b)))throw Error("Assert failed: Validator rejected reference state\n(validator new-value)");a=this.state;this.state=b;null!=this.pa&&xn(this,a,b);return b};g.mc=function(a,b){return this.Na(null,b.c?b.c(this.state):b.call(null,this.state))};g.nc=function(a,b,c){return this.Na(null,b.f?b.f(this.state,c):b.call(null,this.state,c))};
+g.oc=function(a,b,c,d){return this.Na(null,b.h?b.h(this.state,c,d):b.call(null,this.state,c,d))};g.pc=function(a,b,c,d,e){return this.Na(null,Ye(b,this.state,c,d,e))};g.Ub=function(a,b,c){return xn(this,b,c)};g.Tb=function(a,b,c){return vn(this,b,c)};g.Vb=function(a,b){return wn(this,b)};g.V=function(a,b){return new Dn(this.state,b,this.Db,this.pa)};g.hb=function(){tn(this);return this.state};
+var En=function En(a){switch(arguments.length){case 1:return En.c(arguments[0]);default:for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return En.l(arguments[0],new H(c.slice(1),0,null))}};En.c=function(a){return new Dn(a,null,null,null)};En.l=function(a,b){var c=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;b=F.f(c,fb);c=F.f(c,Cj);return new Dn(a,b,c,null)};En.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};En.G=1;
+function Fn(a,b,c,d){var e=b.reagReactionCache,f=null==e?Z:e,h=f.f?f.f(c,null):f.call(null,c,null);if(null!=h)return C(h);if(null==mn)return a.D?a.D():a.call(null);var k=function(){var k=function(){return function(){nn&&qf.f(pn,ne);var a=Id.f(b.reagReactionCache,c);b.reagReactionCache=a;null!=d&&(d.dc=null);return null}}(a,Bl,e,f,h);return Gn.h?Gn.h(a,Bl,k):Gn.call(null,a,Bl,k)}(),l=C(k);b.reagReactionCache=U.h(f,c,k);nn&&qf.f(pn,gd);null!=d&&(d.dc=k);return l}
+function Hn(a,b,c){this.Ua=a;this.Pb=b;this.dc=c;this.m=2153807872;this.I=0}g=Hn.prototype;g.ec=t;g.hb=function(){var a=this,b=a.dc;return null==b?Fn(function(){return function(){return We(a.Ua,a.Pb)}}(b,this),a.Ua,a.Pb,this):C(b)};g.H=function(a,b){return b instanceof Hn&&M.f(this.Ua,b.Ua)&&M.f(this.Pb,b.Pb)};g.L=function(){return Sc(new W(null,2,5,X,[this.Ua,this.Pb],null))};g.M=function(a,b){return yn(this,a,b,"Track:")};
+function In(a,b,c,d,e){this.fa=a;this.path=b;this.dc=c;this.state=d;this.pa=e;this.m=2153807872;this.I=114690}function Jn(a){var b=mn;mn=null;try{return a.hb(null)}finally{mn=b}}function Kn(a,b,c){b!==c&&(a.state=c,null!=a.pa&&xn(a,b,c))}g=In.prototype;g.ec=t;g.M=function(a,b){return yn(this,a,b,["Cursor: ",B.c(this.path)].join(""))};g.L=function(){return Sc(new W(null,2,5,X,[this.fa,this.path],null))};g.H=function(a,b){return b instanceof In&&M.f(this.path,b.path)&&M.f(this.fa,b.fa)};
+g.Na=function(a,b){Kn(this,this.state,b);(null!=this.fa?this.fa.m&32768||t===this.fa.Tc||(this.fa.m?0:x(Wb,this.fa)):x(Wb,this.fa))?M.f(this.path,Ed)?pf(this.fa,b):qf.C(this.fa,Ef,this.path,b):this.fa.f?this.fa.f(this.path,b):this.fa.call(null,this.path,b);return b};g.mc=function(a,b){var c=this;return c.Na(null,function(){var a=Jn(c);return b.c?b.c(a):b.call(null,a)}())};g.nc=function(a,b,c){var d=this;return d.Na(null,function(){var a=Jn(d);return b.f?b.f(a,c):b.call(null,a,c)}())};
+g.oc=function(a,b,c,d){var e=this;return e.Na(null,function(){var a=Jn(e);return b.h?b.h(a,c,d):b.call(null,a,c,d)}())};g.pc=function(a,b,c,d,e){return this.Na(null,Ye(b,Jn(this),c,d,e))};g.Ub=function(a,b,c){return xn(this,b,c)};g.Tb=function(a,b,c){return vn(this,b,c)};g.Vb=function(a,b){return wn(this,b)};
+g.hb=function(){var a=this,b=this,c=a.state,d=function(){var d=a.dc;return null==d?(d=(null!=a.fa?a.fa.m&32768||t===a.fa.Tc||(a.fa.m?0:x(Wb,a.fa)):x(Wb,a.fa))?function(){return function(){var b=C(a.fa);return sb(F,b,a.path)}}(d,c,b):function(){return function(){return a.fa.c?a.fa.c(a.path):a.fa.call(null,a.path)}}(d,c,b),Fn(d,a.fa,a.path,b)):C(d)}();Kn(b,c,d);return d};
+var Ln=function Ln(a){if(null!=a&&null!=a.Ic)return a.Ic(a);var c=Ln[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=Ln._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IDisposable.dispose!",a);},Mn=function Mn(a,b){if(null!=a&&null!=a.hd)return a.hd(a,b);var d=Mn[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=Mn._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IDisposable.add-on-dispose!",a);};
+function sn(a,b,c,d){c===d||a.tb?a=null:null==a.ab?(a.tb=!0,null==zn&&(zn=[],!1===en.wc&&cn(en)),a=zn.push(a)):a=!0===a.ab?Bn(a,!1):a.ab.c?a.ab.c(a):a.ab.call(null,a);return a}function Nn(a,b,c,d,e,f,h,k){this.Ua=a;this.state=b;this.tb=c;this.ad=d;this.Eb=e;this.pa=f;this.ab=h;this.yc=k;this.m=2153807872;this.I=114690}function On(a){var b=mn;mn=null;try{return a.hb(null)}finally{mn=b}}
+function Bn(a,b){var c=a.state;if(w(b)){b=a.Ua;try{a.yc=null;var d=rn(b,a)}catch(e){d=e,a.state=d,a.yc=d,d=a.tb=!1}}else d=rn(a.Ua,a);a.ad||(a.state=d,null==a.pa||M.f(c,d)||xn(a,c,d));return d}function Pn(a,b){var c=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;b=F.f(c,kl);var d=F.f(c,aj),e=F.f(c,Bl);c=F.f(c,Jk);null!=b&&(a.ab=b);null!=d&&(a.ed=d);null!=e&&(a.bd=e);null!=c&&(a.ad=c)}g=Nn.prototype;g.ec=t;g.M=function(a,b){return yn(this,a,b,["Reaction ",B.c(Sc(this)),":"].join(""))};g.L=function(){return da(this)};
+g.H=function(a,b){return this===b};g.Ic=function(){var a=this.state,b=this.Eb;this.ab=this.state=this.Eb=null;this.tb=!0;b=G(Eh(b));for(var c=null,d=0,e=0;;)if(e<d){var f=c.K(null,e);rc(f,this);e+=1}else if(b=G(b))c=b,Xd(c)?(b=zc(c),e=Bc(c),c=b,d=P(b),b=e):(b=K(c),rc(b,this),b=L(c),c=null,d=0),e=0;else break;null!=this.bd&&this.bd(a);a=this.cd;if(null==a)return null;b=a.length;for(c=0;;)if(c<b)d=a[c],d.c?d.c(this):d.call(null,this),c+=1;else return null};
+g.hd=function(a,b){a=this.cd;return null==a?this.cd=[b]:a.push(b)};g.Na=function(a,b){if(!Jd(this.ed))throw Error("Assert failed: Reaction is read only; on-set is not allowed\n(fn? (.-on-set a))");a=this.state;this.state=b;this.ed(a,b);xn(this,a,b);return b};g.mc=function(a,b){var c=this;return c.Na(null,function(){var a=On(c);return b.c?b.c(a):b.call(null,a)}())};g.nc=function(a,b,c){var d=this;return d.Na(null,function(){var a=On(d);return b.f?b.f(a,c):b.call(null,a,c)}())};
+g.oc=function(a,b,c,d){var e=this;return e.Na(null,function(){var a=On(e);return b.h?b.h(a,c,d):b.call(null,a,c,d)}())};g.pc=function(a,b,c,d,e){return this.Na(null,Ye(b,On(this),c,d,e))};g.Ub=function(a,b,c){return xn(this,b,c)};g.Tb=function(a,b,c){return vn(this,b,c)};g.Vb=function(a,b){a=Qd(this.pa);wn(this,b);return!a&&Qd(this.pa)&&null==this.ab?this.Ic(null):null};
+g.hb=function(){var a=this.yc;if(null!=a)throw a;(a=null==mn)&&An();a&&null==this.ab?this.tb&&(a=this.state,this.state=this.Ua.D?this.Ua.D():this.Ua.call(null),null==this.pa||M.f(a,this.state)||xn(this,a,this.state)):(tn(this),this.tb&&Bn(this,!1));return this.state};
+function Gn(a){for(var b=[],c=arguments.length,d=0;;)if(d<c)b.push(arguments[d]),d+=1;else break;c=arguments[0];b=1<b.length?new H(b.slice(1),0,null):null;var e=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;b=F.f(e,kl);d=F.f(e,aj);e=F.f(e,Bl);c=new Nn(c,null,!0,!1,null,null,null,null);Pn(c,new u(null,3,[kl,b,aj,d,Bl,e],null));return c}var Qn=Gn(null);
+function Rn(a,b){var c=Sn,d=Qn,e=rn(a,d);null!=d.Eb&&(Qn=Gn(null),Pn(d,c),d.Ua=a,d.ab=function(){return function(){return fn.c?fn.c(b):fn.call(null,b)}}(d,e),b.cljsRatom=d);return e}function Tn(a){var b={};a=qn(b,a);return new W(null,2,5,X,[a,null!=b.captured],null)};var Un={},Vn,Wn=aa.createReactClass;function Xn(a,b){var c=b.argv;if(null==c){c=X;a=a.constructor;a:for(var d=xa(b),e=d.length,f=Z,h=0;;)if(h<e){var k=d[h];f=U.h(f,Ce.c(k),b[k]);h+=1}else break a;b=new W(null,2,5,c,[a,f],null)}else b=c;return b}function Yn(a){var b;if(b=Jd(a))a=null==a?null:a.prototype,b=null!=(null==a?null:a.reagentRender);return b}function Zn(a){var b;if(b=Jd(a))a=null==a?null:a.prototype,b=null!=(null==a?null:a.render);return b}
+if("undefined"===typeof Fm||"undefined"===typeof Pm||"undefined"===typeof Un||"undefined"===typeof $n)var $n=null;
+function ao(a){for(;;){var b=a.reagentRender;if(be(b))var c=null;else throw Error(["Assert failed: ",B.c(["Expected something callable, not ",B.c(bi(S([b])))].join("")),"\n(clojure.core/ifn? f)"].join(""));var d=!0===a.cljsLegacyRender?b.call(a,a):function(){var c=Xn(a,a.props);switch(P(c)){case 1:return b.call(a);case 2:return b.call(a,ud(c,1));case 3:return b.call(a,ud(c,1),ud(c,2));case 4:return b.call(a,ud(c,1),ud(c,2),ud(c,3));case 5:return b.call(a,ud(c,1),ud(c,2),ud(c,3),ud(c,4));default:return b.apply(a,
+rb(c).slice(1))}}();if(Wd(d))return $n.c?$n.c(d):$n.call(null,d);if(be(d))c=Yn(d)?function(a,b,c,d){return function(){function a(a){var c=null;if(0<arguments.length){c=0;for(var d=Array(arguments.length-0);c<d.length;)d[c]=arguments[c+0],++c;c=new H(d,0,null)}return b.call(this,c)}function b(a){a=Xe(bg,d,a);return $n.c?$n.c(a):$n.call(null,a)}a.G=0;a.F=function(a){a=G(a);return b(a)};a.l=b;return a}()}(a,b,c,d):d,a.reagentRender=c;else return d}}
+var Sn=new u(null,1,[Jk,!0],null),co=new u(null,1,[wh,function(){var a=this.cljsRatom;this.cljsIsDirty=!1;return null==a?Rn(function(a,c){return function(){a:{var a=Vn;Vn=c;try{var b=[!1];try{var f=ao(c);b[0]=!0;var h=f;break a}finally{w(b[0])||w(Hm)&&(w(!1)?Jm:console).error([B.c(["Error rendering component",B.c(bo.D?bo.D():bo.call(null))].join(""))].join(""))}}finally{Vn=a}h=void 0}return h}}(a,this),this):Bn(a,!1)}],null);
+function eo(a,b){var c=a instanceof V?a.Ka:null;switch(c){case "getDefaultProps":throw Error("getDefaultProps not supported");case "getInitialState":return function(){return function(){var a=this.cljsState;a=null!=a?a:this.cljsState=En.c(null);return pf(a,b.call(this,this))}}(a,c);case "componentWillReceiveProps":return function(){return function(a){return b.call(this,this,Xn(this,a))}}(a,c);case "shouldComponentUpdate":return function(){return function(a){var c=Um;if(c)return c;c=this.props.argv;
+var d=a.argv,h=null==c||null==d;return null==b?h||!M.f(c,d):h?b.call(this,this,Xn(this,this.props),Xn(this,a)):b.call(this,this,c,d)}}(a,c);case "componentWillUpdate":return function(){return function(a){return b.call(this,this,Xn(this,a))}}(a,c);case "componentDidUpdate":return function(){return function(a){return b.call(this,this,Xn(this,a))}}(a,c);case "componentWillMount":return function(){return function(){this.cljsMountOrder=Wm+=1;return null==b?null:b.call(this,this)}}(a,c);case "componentDidMount":return function(){return function(){return b.call(this,
+this)}}(a,c);case "componentWillUnmount":return function(){return function(){var a=this.cljsRatom;null!=a&&Ln(a);this.cljsIsDirty=!1;return null==b?null:b.call(this,this)}}(a,c);case "componentDidCatch":return function(){return function(a,c){return b.call(this,this,a,c)}}(a,c);default:return null}}
+function fo(a,b){a=eo(a,b);if(w(w(a)?b:a)&&!be(b))throw Error(["Assert failed: ",B.c(["Expected something callable, not ",B.c(bi(S([b])))].join("")),"\n(clojure.core/ifn? f)"].join(""));return w(a)?a:b}var go=new u(null,3,[Ak,null,nm,null,ik,null],null),ho=function(a){return function(b){return function(c){var d=F.f(C(b),c);if(null!=d)return d;d=a.c?a.c(c):a.call(null,c);qf.C(b,U,c,d);return d}}(of(Z))}(Sm);
+function io(a){return je(function(a,c,d){return U.h(a,Ce.c(ho.c?ho.c(c):ho.call(null,c)),d)},Z,a)}
+function jo(a){var b=vh(a),c=K(xg(b));if(!(0<P(b)))throw Error("Assert failed: Missing reagent-render\n(pos? (count renders))");if(1!==P(b))throw Error("Assert failed: Too many render functions supplied\n(\x3d\x3d 1 (count renders))");if(!be(c))throw Error(["Assert failed: ",B.c(["Expected something callable, not ",B.c(bi(S([c])))].join("")),"\n(clojure.core/ifn? render-fun)"].join(""));var d=function(){var b=xh.c(a);return w(b)?b:yh.c(a)}();b=null==d;var e=w(d)?d:wh.c(a),f=[B.c(function(){var b=
+Bj.c(a);return w(b)?b:Tm(e)}())].join("");a:switch(f){case "":c=[B.c(fi())].join("");break a;default:c=f}d=je(function(){return function(a,b,c){return U.h(a,b,fo(b,c))}}(d,b,e,f,c),Z,a);return U.l(d,Bj,c,S([Wl,!1,dj,b,xh,e,wh,wh.c(co)]))}function ko(a){return je(function(a,c,d){a[De(c)]=d;return a},{},a)}function lo(a){if(!Ud(a))throw Error("Assert failed: (map? body)");a=ko(jo(uh.l(S([go,io(a)]))));return Wn.c?Wn.c(a):Wn.call(null,a)}
+var mo=function mo(a){var c=function(){var c=null==a?null:a.type;return null==c?null:c.displayName}(),d=null==a?null:a["return"],e=function(){var a=null==d?null:mo.c?mo.c(d):mo.call(null,d);return null==a?null:[B.c(a)," \x3e "].join("")}();c=[B.c(e),B.c(c)].join("");return Qd(c)?null:c},no=function no(a){var c=function(){var c=null==a?null:a._reactInternalFiber;return w(c)?c:null==a?null:a.Qd}();if(w(c))return mo(c);var d=function(){var c=null==a?null:a._reactInternalInstance;if(w(c))return c;c=null==
+a?null:a.Rd;return w(c)?c:a}(),e=function(){var a=null==d?null:d._currentElement;return w(a)?a:null==d?null:d.Od}();c=function(){var a=null==e?null:e.type;return null==a?null:a.displayName}();var f=function(){var a=null==e?null:e._owner;return w(a)?a:null==e?null:e.Pd}(),h=function(){var a=null==f?null:no.c?no.c(f):no.call(null,f);return null==a?null:[B.c(a)," \x3e "].join("")}();c=[B.c(h),B.c(c)].join("");return Qd(c)?null:c};
+function bo(){var a=Vn;var b=no(a);w(b)?a=b:(a=null==a?null:a.constructor,a=null==a?null:Tm(a));return Qd(a)?"":[" (in ",B.c(a),")"].join("")}
+function oo(a){if(!be(a))throw Error(["Assert failed: ",B.c(["Expected something callable, not ",B.c(bi(S([a])))].join("")),"\n(clojure.core/ifn? f)"].join(""));Zn(a)&&!Yn(a)&&w(Hm)&&(w(!1)?Jm:console).warn(["Warning: Using native React classes directly in Hiccup forms is not supported. Use create-element or adapt-react-class instead: ",B.c(function(){var b=Tm(a);return Qd(b)?a:b}()),B.c(bo())].join(""));if(Yn(a))return a.cljsReactClass=a;var b=Nd(a);b=U.h(b,Vk,a);b=lo(b);return a.cljsReactClass=
+b};function po(a,b,c){if(ue(c))return c=We(xe,rf.f(a,c)),b.c?b.c(c):b.call(null,c);if(tg(c))return c=ag(rf.f(a,c)),b.c?b.c(c):b.call(null,c);if($d(c))return c=Nh(rf.f(a,c)),b.c?b.c(c):b.call(null,c);if(Vd(c))return c=sb(function(b,c){return Dd.f(b,a.c?a.c(c):a.call(null,c))},c,c),b.c?b.c(c):b.call(null,c);Rd(c)&&(c=lf.f(null==c?null:xb(c),rf.f(a,c)));return b.c?b.c(c):b.call(null,c)}var qo=function qo(a,b){return po(jf.f(qo,a),ke,a.c?a.c(b):a.call(null,b))};
+function ro(a,b){return qo(function(b){return de(a,b)?a.c?a.c(b):a.call(null,b):b},b)};var so={},to=aa.React,uo=/([^\s\.#]+)(?:#([^\s\.#]+))?(?:\.([^\s#]+))?/;function vo(a){return a instanceof V||a instanceof D}var wo={"class":"className","for":"htmlFor",charset:"charSet"};function xo(a,b){return a.hasOwnProperty(b)?a[b]:null}function yo(a,b,c){if(vo(b)){var d=xo(wo,De(b));b=null==d?wo[De(b)]=Sm(b):d}a[b]=zo.c?zo.c(c):zo.call(null,c);return a}
+function zo(a){return"object"!==p(a)?a:vo(a)?De(a):Ud(a)?je(yo,{},a):Rd(a)?ii(a):be(a)?function(){function b(a){var b=null;if(0<arguments.length){b=0;for(var d=Array(arguments.length-0);b<d.length;)d[b]=arguments[b+0],++b;b=new H(d,0,null)}return c.call(this,b)}function c(b){return We(a,b)}b.G=0;b.F=function(a){a=G(a);return c(a)};b.l=c;return b}():ii(a)}var Ao={};function Bo(a,b,c){if(vo(b)){var d=xo(Ao,De(b));b=null==d?wo[De(b)]=Sm(b):d}a[b]=zo(c);return a}
+function Co(a){return"object"!==p(a)?a:vo(a)?De(a):Ud(a)?je(Bo,{},a):Rd(a)?ii(a):be(a)?function(){function b(a){var b=null;if(0<arguments.length){b=0;for(var d=Array(arguments.length-0);b<d.length;)d[b]=arguments[b+0],++b;b=new H(d,0,null)}return c.call(this,b)}function c(b){return We(a,b)}b.G=0;b.F=function(a){a=G(a);return c(a)};b.l=c;return b}():ii(a)}function Do(a,b){a=null==a?{}:a;a.key=b;return a}
+function Eo(a,b){var c=b.id,d=b["class"];b=null!=c&&null==dl.c(a)?U.h(a,dl,c):a;return w(d)?U.h(b,el,function(){var b=el.c(a);return null==b?d:[B.c(d)," ",B.c(b)].join("")}()):b}if("undefined"===typeof Fm||"undefined"===typeof Pm||"undefined"===typeof so||"undefined"===typeof Fo)var Fo=null;var Go=new Bh(null,new u(null,6,["url",null,"tel",null,"text",null,"textarea",null,"password",null,"search",null],null),null);
+function Ho(a,b,c,d){var e=Z,f=null!=e&&(e.m&64||t===e.U)?We(oh,e):e,h=F.f(f,$k);if(a===document.activeElement&&de(Go,a.type)&&"string"===typeof b&&"string"===typeof c){var k=a.value;if(!M.f(k,c))return dn(function(){return function(){return Io.c?Io.c(d):Io.call(null,d)}}(k,e,f,h));c=P(k)-a.selectionStart;c=P(b)-c;d.cljsDOMValue=b;a.value=b;Jd(h)&&(h.c?h.c(b):h.call(null,b));a.selectionStart=c;return a.selectionEnd=c}d.cljsDOMValue=b;a.value=b;return Jd(h)?h.c?h.c(b):h.call(null,b):null}
+function Io(a){if(w(a.cljsInputLive)){a.cljsInputDirty=!1;var b=a.cljsRenderedValue,c=a.cljsDOMValue,d=Fo.c?Fo.c(a):Fo.call(null,a);return M.f(b,c)?null:Ho(d,b,c,a)}return null}function Jo(a,b,c){a.cljsDOMValue=c.target.value;w(a.cljsInputDirty)||(a.cljsInputDirty=!0,dn(function(){return Io(a)}));return b.c?b.c(c):b.call(null,c)}
+function Ko(a){var b=Vn;if(w(function(){var b=null!=a;return b?(b=a.hasOwnProperty("onChange"),w(b)?a.hasOwnProperty("value"):b):b}())){if(!w(Fo))throw Error("Assert failed: reagent.dom needs to be loaded for controlled input to work\nfind-dom-node");var c=a.value,d=null==c?"":c,e=a.onChange;w(b.cljsInputLive)||(b.cljsInputLive=!0,b.cljsDOMValue=d);b.cljsRenderedValue=d;delete a.value;a.defaultValue=d;a.onChange=function(a,c,d,e){return function(a){return Jo(b,e,a)}}(a,c,d,e)}}
+var Lo=null,No=new u(null,4,[vl,"ReagentInput",Wj,Io,nl,function(a){return a.cljsInputLive=null},Vk,function(a,b,c,d){Ko(c);return Mo.C?Mo.C(a,b,c,d):Mo.call(null,a,b,c,d)}],null);function Oo(a){if(Ud(a))try{var b=F.f(a,kj)}catch(c){b=null}else b=null;return b}function Po(a){var b=Oo(Nd(a));return null==b?Oo(T(a,1)):b}var Qo={};
+function Ro(a,b,c){var d=a.name,e=T(b,c),f=null==e||Ud(e);e=f?e:null;e=null!=e&&(e.m&64||t===e.U)?We(oh,e):e;var h=F.f(e,el);e=Rd(h)?U.h(e,el,Nm(yf(ke,h))):e;e=Eo(e,a);a=w(a.custom)?Co(e):zo(e);c+=f?1:0;a:switch(d){case "input":case "textarea":f=!0;break a;default:f=!1}if(f)return f=X,null==Lo&&(Lo=lo(No)),b=Md(new W(null,5,5,f,[Lo,b,d,a,c],null),Nd(b)),So.c?So.c(b):So.call(null,b);f=Oo(Nd(b));f=null==f?a:Do(a,f);return Mo.C?Mo.C(b,d,f,c):Mo.call(null,b,d,f,c)}
+function To(a){return[B.c(qo(function(a){if(Jd(a)){var b=Tm(a);switch(b){case "":return a;default:return Wc.c(b)}}else return a},a))].join("")}function Uo(a,b){return[B.c(We(B,b)),": ",B.c(To(a)),"\n",B.c(bo())].join("")}
+function Vo(a){for(;;){if(!(0<P(a)))throw Error(["Assert failed: ",B.c(Uo(a,S(["Hiccup form should not be empty"]))),"\n(pos? (count v))"].join(""));var b=T(a,0);if(!vo(b)&&"string"!==typeof b&&!be(b))throw Error(["Assert failed: ",B.c(Uo(a,S(["Invalid Hiccup form"]))),"\n(valid-tag? tag)"].join(""));if(Ae(Ik,b)){b=T(a,1);var c=null==b||Ud(b);b=zo(c?b:null);c=1+(c?1:0);var d=Po(a);null!=d&&Do(b,d);return Mo.C?Mo.C(a,to.Fragment,b,c):Mo.call(null,a,to.Fragment,b,c)}if(vo(b)||"string"===typeof b)switch(b=
+De(b),c=b.indexOf("\x3e"),c){case -1:c=b;b=xo(Qo,c);if(null==b){var e=b=c,f=L(Oh(uo,De(e)));c=T(f,0);d=T(f,1);f=T(f,2);f=null==f?null:Mm(f,/\./," ");if(!w(c))throw Error(["Assert failed: ",B.c(["Invalid tag: '",B.c(e),"'",B.c(bo())].join("")),"\ntag"].join(""));e=c.indexOf("-");e=!M.f(-1,e);b=Qo[b]={name:c,id:d,"class":f,custom:e}}return Ro(b,a,1);case 0:c=T(a,1);if(!M.f("\x3e",b))throw Error(["Assert failed: ",B.c(Uo(a,S(["Invalid Hiccup tag"]))),'\n(\x3d "\x3e" n)'].join(""));if("string"!==typeof c&&
+!Jd(c))throw Error(["Assert failed: ",B.c(Uo(a,S(["Expected React component in"]))),"\n(or (string? comp) (fn? comp))"].join(""));return Ro({name:c},a,2);default:a=Md(new W(null,2,5,X,[te(b,c),U.h(Md(a,null),0,b.substring(c+1))],null),Nd(a))}else return c=b.cljsReactClass,b=null==c?oo(b):c,c={argv:a},a=Po(a),null!=a&&(c.key=a),to.createElement.f?to.createElement.f(b,c):to.createElement.call(null,b,c)}}
+function So(a){return"object"!==p(a)?a:Wd(a)?Vo(a):$d(a)?Wo.c?Wo.c(a):Wo.call(null,a):vo(a)?De(a):(null!=a?a.m&2147483648||t===a.Y||(a.m?0:x(oc,a)):x(oc,a))?bi(S([a])):a}$n=So;
+function Wo(a){var b={},c=Tn(function(b){return function(){for(var c=rb(a),d=c.length,e=0;;)if(e<d){var l=c[e];Wd(l)&&null==Po(l)&&(b["no-key"]=!0);c[e]=So(l);e+=1}else break;return c}}(b)),d=T(c,0);c=T(c,1);w(c)&&w(Hm)&&(w(!1)?Jm:console).warn(["Warning: ",B.c(Uo(a,S(["Reactive deref not supported in lazy seq, ","it should be wrapped in doall"])))].join(""));w(b["no-key"])&&w(Hm)&&(w(!1)?Jm:console).warn(["Warning: ",B.c(Uo(a,S(["Every element in a seq should have a unique :key"])))].join(""));return d}
+function Mo(a,b,c,d){var e=P(a)-d;switch(e){case 0:return to.createElement.f?to.createElement.f(b,c):to.createElement.call(null,b,c);case 1:return a=So(T(a,d)),to.createElement.h?to.createElement.h(b,c,a):to.createElement.call(null,b,c,a);default:return to.createElement.apply(null,je(function(){return function(a,b,c){b>=d&&a.push(So(c));return a}}(e),[b,c],a))}};var Xo={},Yo=aa.ReactDOM;if("undefined"===typeof Fm||"undefined"===typeof Xo||"undefined"===typeof Zo)var Zo=null;if("undefined"===typeof Fm||"undefined"===typeof Xo||"undefined"===typeof $o)var $o=of(Z);function ap(a){qf.h($o,Id,a);Yo.unmountComponentAtNode.c?Yo.unmountComponentAtNode.c(a):Yo.unmountComponentAtNode.call(null,a)}
+function bp(a,b){var c=Um;Um=!0;try{var d=a.D?a.D():a.call(null),e=function(){return function(){var c=Um;Um=!1;try{return qf.C($o,U,b,new W(null,2,5,X,[a,b],null)),bn(en,"afterRender"),null}finally{Um=c}}}(d,b,c);return Yo.render.h?Yo.render.h(d,b,e):Yo.render.call(null,d,b,e)}finally{Um=c}}function cp(a,b){return bp(a,b)}function dp(a,b){An();return bp(function(){return So(Jd(a)?a.D?a.D():a.call(null):a)},b)}Fo=function(a){return Yo.findDOMNode.c?Yo.findDOMNode.c(a):Yo.findDOMNode.call(null,a)};ba("reagent.core.force_update_all",function(){An();An();for(var a=G(xg(C($o))),b=null,c=0,d=0;;)if(d<c){var e=b.K(null,d);We(cp,e);d+=1}else if(a=G(a))b=a,Xd(b)?(a=zc(b),d=Bc(b),b=a,c=P(a),a=d):(a=K(b),We(cp,a),a=L(b),b=null,c=0),d=0;else break;return bn(en,"afterRender")});function ep(a){return dn(a)};var fp={},gp={},hp={};function ip(a,b,c,d,e){this.ob=a;this.form=b;this.Sa=c;this.ca=d;this.B=e;this.m=2229667594;this.I=139264}g=ip.prototype;g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){switch(b instanceof V?b.Ka:null){case "splicing?":return this.ob;case "form":return this.form;default:return F.h(this.ca,b,c)}};
+g.M=function(a,b){return Qh(a,function(){return function(c){return Qh(a,Xh,""," ","",b,c)}}(this),"#cljs.tools.reader.impl.utils.ReaderConditional{",", ","}",b,Pe.f(new W(null,2,5,X,[new W(null,2,5,X,[Rk,this.ob],null),new W(null,2,5,X,[Kl,this.form],null)],null),this.ca))};g.Pa=function(){return new pg(this,2,new W(null,2,5,X,[Rk,Kl],null),w(this.ca)?Hc(this.ca):$e())};g.T=function(){return this.Sa};g.X=function(){return 2+P(this.ca)};
+g.L=function(){var a=this,b=this.B;if(null!=b)return b;var c=function(){return function(){return function(a){return-209062840^ed(a)}}(b,a)(a)}();return this.B=c};g.H=function(a,b){return null!=b&&this.constructor===b.constructor&&M.f(this.ob,b.ob)&&M.f(this.form,b.form)&&M.f(this.ca,b.ca)};g.Ib=function(a,b){return de(new Bh(null,new u(null,2,[Rk,null,Kl,null],null),null),b)?Id.f(Zb(lf.f(Z,this),this.Sa),b):new ip(this.ob,this.form,this.Sa,Ze(Id.f(this.ca,b)),null)};
+g.qa=function(a,b,c){return w(Ae.f?Ae.f(Rk,b):Ae.call(null,Rk,b))?new ip(c,this.form,this.Sa,this.ca,null):w(Ae.f?Ae.f(Kl,b):Ae.call(null,Kl,b))?new ip(this.ob,c,this.Sa,this.ca,null):new ip(this.ob,this.form,this.Sa,U.h(this.ca,b,c),null)};g.O=function(){return G(Pe.f(new W(null,2,5,X,[new Xf(Rk,this.ob),new Xf(Kl,this.form)],null),this.ca))};g.V=function(a,b){return new ip(this.ob,this.form,b,this.ca,this.B)};g.W=function(a,b){return Wd(b)?this.qa(null,Bb.f(b,0),Bb.f(b,1)):sb(zb,this,b)};
+function jp(a,b){return new ip(b,a,null,null,null)}g.Y=t;g.M=function(a,b){nc(a,["#?",B.c(w(Rk.c(this))?"@":null)].join(""));return Xh(Kl.c(this),a,b)};var kp=/[\s]/;function lp(a){return null==a?null:","===a?!0:kp.test(a)}function mp(a){return null==a?null:!/[^0-9]/.test(a)}var np=of(0);
+function op(a,b){return function e(b){return new Ee(null,function(){for(;;){var d=G(b);if(d){if(Xd(d)){var h=zc(d),k=P(h),l=Ie(k);return function(){for(var b=0;;)if(b<k){var d=Bb.f(h,b),e=l;if(d instanceof D||d instanceof V){var f=Mh();var m=f.c?f.c(d):f.call(null,d);f=T(m,0);m=T(m,1);var A=d instanceof D?Wc:Ce;d=null==f?A.f?A.f(a,m):A.call(null,a,m):M.f("_",f)?A.c?A.c(m):A.call(null,m):d}e.add(d);b+=1}else return!0}()?Ke(l.Ha(),e(Bc(d))):Ke(l.Ha(),null)}var m=K(d);return yd(m instanceof D||m instanceof
+V?function(){var b=Mh();var d=b.c?b.c(m):b.call(null,m);b=T(d,0);d=T(d,1);var e=m instanceof D?Wc:Ce;return null==b?e.f?e.f(a,d):e.call(null,a,d):M.f("_",b)?e.c?e.c(d):e.call(null,d):m}():m,e(Yc(d)))}return null}},null,null)}(b)}function pp(a){var b=T(a,0);a=T(a,1);return w(b)?null:a};var qp=function qp(a){if(null!=a&&null!=a.ba)return a.ba(a);var c=qp[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=qp._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("Reader.read-char",a);},rp=function rp(a,b){if(null!=a&&null!=a.Wb)return a.Wb(a,b);var d=rp[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=rp._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IPushbackReader.unread",a);},sp=function sp(a){if(null!=a&&null!=a.Yb)return a.Yb(a);var c=
+sp[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=sp._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IndexingReader.get-line-number",a);},tp=function tp(a){if(null!=a&&null!=a.Xb)return a.Xb(a);var c=tp[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=tp._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IndexingReader.get-column-number",a);},up=function up(a){if(null!=a&&null!=a.Fc)return a.Fc(a);var c=up[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):
+c.call(null,a);c=up._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("IndexingReader.get-file-name",a);};function vp(a,b){this.s=a;this.kd=b;this.Nb=0}vp.prototype.ba=function(){if(this.kd>this.Nb){var a=this.s.charAt(this.Nb);this.Nb+=1;return a}return null};vp.prototype.Jb=function(){return this.kd>this.Nb?this.s.charAt(this.Nb):null};function wp(a,b){this.fd=a;this.wb=b;this.Va=this.xc=1}
+wp.prototype.ba=function(){var a=this.Va<this.xc?this.wb[this.Va]:this.fd.ba(null);this.Va<this.xc&&(this.Va+=1);return null==a?null:qe(a)};wp.prototype.Jb=function(){var a=this.Va<this.xc?this.wb[this.Va]:this.fd.Jb();return null==a?null:qe(a)};wp.prototype.Wb=function(a,b){if(w(b)){if(0===this.Va)throw Error("Pushback buffer is full");--this.Va;return this.wb[this.Va]=b}return null};function xp(a){return null!=a?t===a.ce?!0:!1:!1};var yp={};function zp(a,b,c,d){var e=P(b);a=w(a)?0:10<e?10:e;b=rf.f(jf.f(Ap,!0),sf(a,b));b=We(B,tf(1,xf.f(new vf(null,-1," ",null),b)));e=a<e?"...":null;return[B.c(c),B.c(b),B.c(e),B.c(d)].join("")}function Bp(a,b){return null==b?jl:"string"===typeof b?jk:b instanceof V?tk:"number"===typeof b?tk:b instanceof D?tk:Wd(b)?kk:ue(b)?Yk:Ud(b)?jm:Sd(b)?Pl:M.f(b,!0)?tk:M.f(b,!1)?tk:lb(b)}
+if("undefined"===typeof Ta||"undefined"===typeof fp||"undefined"===typeof gp||"undefined"===typeof hp||"undefined"===typeof yp||"undefined"===typeof Ap){var Ap,Cp=of(Z),Dp=of(Z),Ep=of(Z),Fp=of(Z),Gp=F.h(Z,Xl,pi());Ap=new Ai(Wc.f("cljs.tools.reader.impl.inspect","inspect*"),Bp,Gp,Cp,Dp,Ep,Fp)}Di(Ap,jk,function(a,b){var c=w(a)?5:20;a=b.length>c?'..."':'"';return[B.c('"'),B.c(b.substring(0,function(){var a=b.length;return c<a?c:a}())),B.c(a)].join("")});Di(Ap,tk,function(a,b){return[B.c(b)].join("")});
+Di(Ap,H,function(){return"\x3cindexed seq\x3e"});Di(Ap,ug,function(){return"\x3cmap seq\x3e"});Di(Ap,Rg,function(){return"\x3cmap seq\x3e"});Di(Ap,ye,function(){return"\x3ccons\x3e"});Di(Ap,Ee,function(){return"\x3clazy seq\x3e"});Di(Ap,jl,function(){return"nil"});Di(Ap,Yk,function(a,b){return zp(a,b,"(",")")});Di(Ap,jm,function(a,b){var c=P(b),d=w(a)?0:c;b=We(Pe,sf(d,b));return zp(a,b,"{",c>d?"...}":"}")});Di(Ap,Pl,function(a,b){return zp(a,b,"#{","}")});
+Di(Ap,kk,function(a,b){return zp(a,b,"[","]")});Di(Ap,Bi,function(a,b){return bi(S([lb(b)]))});function Hp(a){return Ap.f?Ap.f(!1,a):Ap.call(null,!1,a)};function Ip(a,b,c){b=new u(null,2,[Zj,oj,Ui,b],null);a=w(xp(a))?U.l(b,Qj,up(a),S([Xk,sp(a),cl,tp(a)])):b;var d=Qj.c(a);b=Xk.c(a);var e=cl.c(a);d=w(d)?[B.c(d)," "].join(""):null;b=w(b)?["[line ",B.c(b),", col ",B.c(e),"]"].join(""):null;c=Ye(B,d,b,w(w(d)?d:b)?" ":null,c);throw Fi(c,a);}function Jp(a,b){return Ip(a,Xi,S([We(B,b)]))}function Kp(a,b){return Ip(a,mk,S([We(B,b)]))}function Lp(a,b){return Ip(a,Vl,S([We(B,b)]))}
+function Mp(a,b,c,d){Jp(a,S(["The map literal starting with ",Hp(K(d)),w(b)?[" on line ",B.c(b)," column ",B.c(c)].join(""):null," contains ",P(d)," form(s). Map literals must contain an even number of forms."]))}function Np(a,b,c){return Jp(a,S(["Invalid ",De(b),": ",c,"."]))}
+function Op(a,b,c){a:{var d=b instanceof V?b.Ka:null;switch(d){case "regex":d='#"';break a;case "string":d='"';break a;default:throw Error(["No matching clause: ",B.c(d)].join(""));}}return Lp(a,S(["Unexpected EOF reading ",De(b)," starting ",Xe(B,d,c),"."]))}function Pp(a,b){return Kp(a,S(["Invalid digit ",b," in unicode character."]))}function Qp(a){return Jp(a,S(["Octal escape sequence must be in range [0, 377]."]))}function Rp(a){return Lp(a,S(["Unexpected EOF while reading character."]))}
+function Sp(a,b){b=function(a){return function f(a){return new Ee(null,function(){for(var b=a;;)if(b=G(b)){if(Xd(b)){var c=zc(b),e=P(c),m=Ie(e);a:for(var n=0;;)if(n<e){var q=Bb.f(c,n),r=T(q,0);1<T(q,1)&&m.add(r);n+=1}else{c=!0;break a}return c?Ke(m.Ha(),f(Bc(b))):Ke(m.Ha(),null)}m=K(b);c=T(m,0);if(1<T(m,1))return yd(c,f(Yc(b)));b=Yc(b)}else return null},null,null)}(Lh(a))}(b);return Ye(B,a,1<P(b)?"s":null,": ",tf(1,xf.f(new vf(null,-1,", ",null),b)))}
+function Tp(a,b,c){return Jp(a,S([Sp([B.c(qa(De(b)))," literal contains duplicate key"].join(""),c)]))}function Up(a,b){return w(b)?Lp(a,S(["EOF while reading, starting at line ",b,"."])):Lp(a,S(["EOF while reading."]))};function Vp(a){for(var b=a.ba(null);;)if(lp.c?lp.c(b):lp.call(null,b))b=a.ba(null);else return b}var Wp=/^([-+]?)(?:(0)|([1-9][0-9]*)|0[xX]([0-9A-Fa-f]+)|0([0-7]+)|([1-9][0-9]?)[rR]([0-9A-Za-z]+)|0[0-9]+)(N)?$/,Xp=/([-+]?[0-9]+)\/([0-9]+)/,Yp=/([-+]?[0-9]+(\.[0-9]*)?([eE][-+]?[0-9]+)?)(M)?/;function Zp(a,b){a=Ph(a,b);return T(a,0)===b}
+function $p(a){if(Zp(Wp,a)){var b=ag(Ph(Wp,a));if(null!=(b.c?b.c(2):b.call(null,2)))a=0;else{a="-"===(b.c?b.c(1):b.call(null,1));b=null!=(b.c?b.c(3):b.call(null,3))?new W(null,2,5,X,[b.c?b.c(3):b.call(null,3),10],null):null!=(b.c?b.c(4):b.call(null,4))?new W(null,2,5,X,[b.c?b.c(4):b.call(null,4),16],null):null!=(b.c?b.c(5):b.call(null,5))?new W(null,2,5,X,[b.c?b.c(5):b.call(null,5),8],null):null!=(b.c?b.c(7):b.call(null,7))?new W(null,2,5,X,[b.c?b.c(7):b.call(null,7),parseInt(b.c?b.c(6):b.call(null,
+6))],null):new W(null,2,5,X,[null,null],null);var c=b.c?b.c(0):b.call(null,0);null==c?a=null:(b=parseInt(c,b.c?b.c(1):b.call(null,1)),a=a?-1*b:b,a=w(isNaN(a))?null:a)}}else Zp(Yp,a)?(b=ag(Ph(Yp,a)),a=null!=(b.c?b.c(4):b.call(null,4))?parseFloat(b.c?b.c(1):b.call(null,1)):parseFloat(a)):Zp(Xp,a)?(b=ag(Ph(Xp,a)),a=b.c?b.c(1):b.call(null,1),b=b.c?b.c(2):b.call(null,2),a=w(Ph(/^\+/,a))?a.substring(1):a,a=parseInt(a)/parseInt(b)):a=null;return a}
+function aq(a){if(""===a||!0===/:$/.test(a)||!0===/^::/.test(a))return null;var b=a.indexOf("/"),c=0<b?te(a,b):null;if(null!=c){b+=1;if(b===P(a))return null;a=a.substring(b);return mp(ud(a,0))||""===a||!1!==/:$/.test(c)||"/"!==a&&-1!==a.indexOf("/")?null:new W(null,2,5,X,[c,a],null)}return"/"===a||-1===a.indexOf("/")?new W(null,2,5,X,[null,a],null):null}
+var bq=function bq(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return bq.l(arguments[0],1<c.length?new H(c.slice(1),0,null):null)};bq.l=function(a){for(;;){var b=a.ba(null);if("\n"===b||"\n"===b||null==b)break}return a};bq.G=1;bq.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};
+function cq(a){return function(){function b(a,b){var d=null;if(1<arguments.length){d=0;for(var e=Array(arguments.length-1);d<e.length;)e[d]=arguments[d+1],++d;d=new H(e,0,null)}return c.call(this,a,d)}function c(b){return Jp(b,S([a]))}b.G=1;b.F=function(a){var b=K(a);a=Yc(a);return c(b,a)};b.l=c;return b}()};function dq(a){switch(a){case '"':case ";":case "@":case "^":case "`":case "~":case "(":case ")":case "[":case "]":case "{":case "}":case "\\":return!0;default:return!1}}var eq=new Sa;function fq(a,b,c){if(null==c)return Lp(a,S(["Unexpected EOF while reading start of ",De(b),"."]));eq.clear();for(b=c;;){if(lp(b)||dq(b)||null==b)return null!=b&&a.Wb(null,b),eq.toString();eq.append(b);b=a.ba(null)}}
+function gq(a,b,c,d){b=a.ba(null);if(w(b)){var e=hq.c?hq.c(b):hq.call(null,b);if(w(e))return e.C?e.C(a,b,c,d):e.call(null,a,b,c,d);a.Wb(null,b);return iq.C?iq.C(a,b,c,d):iq.call(null,a,b,c,d)}return Lp(a,S(["Unexpected EOF while reading dispatch character."]))}function jq(a,b){return Jp(a,S(["Unmatched delimiter ",b,"."]))}
+function kq(a){for(var b=new Sa,c=a.ba(null);;){if('"'===c)return a=[B.c(b)].join(""),a instanceof RegExp||(c=Ph(/^\(\?([idmsux]*)\)/,a),b=T(c,0),c=T(c,1),b=P(b),a=new RegExp(a.substring(b),w(c)?c:"")),a;if(null==c)return Op(a,Fl,S([b]));b.append(c);"\\"===c&&(c=a.ba(null),null==c&&Op(a,Fl,S([b])),b.append(c));c=a.ba(null)}}function lq(a,b){a=parseInt(a,b);return w(isNaN(a))?-1:a}
+function mq(a,b,c){b=1+b;if(P(a)!==b)throw Kp(null,S(["Invalid unicode literal: \\",a,"."]));for(var d=1,e=0;;){if(d===b)return String.fromCharCode(e);var f=lq(ud(a,d),c);if(-1===f)return c=ud(a,d),Kp(null,S(["Invalid digit ",c," in unicode character \\",a,"."]));e=f+e*c;d+=1}}
+function nq(a,b,c,d,e){for(var f=1,h=lq(b,c);;){if(-1===h)return Pp(a,b);if(f!==d){var k=a.Jb();var l=lp(k);l||(l=oq.c?oq.c(k):oq.call(null,k),l=w(l)?l:null==k);if(w(l))return w(e)?Kp(a,S(["Invalid unicode literal. Unicode literals should be ",d,"characters long.  ","value suppled is ",f,"characters long."])):String.fromCharCode(h);l=lq(k,c);a.ba(null);if(-1===l)return Pp(a,k);h=l+h*c;f+=1}else return String.fromCharCode(h)}}
+function pq(a){var b=a.ba(null);if(null!=b){b=dq(b)||lp(b)?[B.c(b)].join(""):fq(a,im,b);var c=b.length;if(1===c)return b.charAt(0);if(M.f(b,"newline"))return"\n";if(M.f(b,"space"))return" ";if(M.f(b,"tab"))return"\t";if(M.f(b,"backspace"))return"\b";if(M.f(b,"formfeed"))return"\f";if(M.f(b,"return"))return"\r";if(w(0==b.lastIndexOf("u",0)))return b=mq(b,4,16),c=b.charCodeAt(0),55295<c&&57344>c?(b=c.toString(16),a=Jp(a,S(["Invalid character literal \\u",b,"."]))):a=b,a;if(w(0==b.lastIndexOf("o",0))){--c;
+if(3<c)return Jp(a,S(["Invalid octal escape sequence in a character literal:",b,". Octal escape sequences must be 3 or fewer digits."]));c=mq(b,c,8);return kb(255>=parseInt(b.substring(1),8))?Qp(a):c}return Jp(a,S(["Unsupported character: ",b,"."]))}return Rp(a)}function qq(a){return w(xp(a))?new W(null,2,5,X,[a.Yb(null),a.Xb(null)-1|0],null):null}function rq(a){return w(xp(a))?new W(null,2,5,X,[a.Yb(null),a.Xb(null)],null):null}
+if("undefined"===typeof Ta||"undefined"===typeof fp||"undefined"===typeof gp||"undefined"===typeof sq)var sq={};if("undefined"===typeof Ta||"undefined"===typeof fp||"undefined"===typeof gp||"undefined"===typeof tq)var tq={};var uq=!1;
+function vq(a,b,c,d,e){var f=uq;uq=!0;try{a:for(var h=qq(c),k=T(h,0),l=T(h,1),m=null==b?null:qe(b),n=sc(Ed);;){var q=wq?wq(c,!1,sq,m,d,e):xq.call(null,c,!1,sq,m,d,e);if(q===tq){var r=uc(n);break a}if(q===sq){var v=P(n);r=Lp(c,S(["Unexpected EOF while reading ",w(v)?["item ",B.c(v)," of "].join(""):null,De(a),w(k)?[", starting at line ",B.c(k)," and column ",B.c(l)].join(""):null,"."]));break a}n=Qe.f(n,q)}return r}finally{uq=f}}
+function yq(a,b,c,d){var e=qq(a);b=T(e,0);e=T(e,1);c=vq(Yk,")",a,c,d);var f=rq(a);d=T(f,0);f=T(f,1);return Md(Qd(c)?Zc:We(xe,c),w(b)?uh.l(S([function(){var b=up(a);return w(b)?new u(null,1,[Qj,b],null):null}(),new u(null,4,[Xk,b,zk,e,tl,d,Uj,f],null)])):null)}
+function zq(a,b,c,d){var e=qq(a);b=T(e,0);e=T(e,1);c=vq(kk,"]",a,c,d);var f=rq(a);d=T(f,0);f=T(f,1);return Md(c,w(b)?uh.l(S([function(){var b=up(a);return w(b)?new u(null,1,[Qj,b],null):null}(),new u(null,4,[Xk,b,zk,e,tl,d,Uj,f],null)])):null)}
+function Aq(a,b,c,d){var e=qq(a);b=T(e,0);e=T(e,1);c=vq(jm,"}",a,c,d);d=P(c);var f=Kh(2,c),h=Eh(f),k=rq(a),l=T(k,0);k=T(k,1);!ff(d)&&Mp(a,b,e,c);M.f(P(h),P(f))||Tp(a,jm,f);return Md(d<=2*zg?Bg(Me(c)):Wg(Me(c)),w(b)?uh.l(S([function(){var b=up(a);return w(b)?new u(null,1,[Qj,b],null):null}(),new u(null,4,[Xk,b,zk,e,tl,l,Uj,k],null)])):null)}
+function Bq(a,b){for(var c=function(){var a=new Sa;a.append(b);return a}(),d=a.ba(null);;){if(w(function(){var a=lp(d);if(a)return a;a=oq.c?oq.c(d):oq.call(null,d);return w(a)?a:null==d}())){var e=[B.c(c)].join("");a.Wb(null,d);var f=$p(e);return w(f)?f:Jp(a,S(["Invalid number: ",e,"."]))}e=function(){var a=c;a.append(d);return a}();f=a.ba(null);c=e;d=f}}
+function Cq(a){var b=a.ba(null);switch(b){case "t":return"\t";case "r":return"\r";case "n":return"\n";case "\\":return"\\";case '"':return'"';case "b":return"\b";case "f":return"\f";case "u":return b=a.ba(null),-1===parseInt(b|0,16)?Jp(a,S(["Invalid unicode escape: \\u",b,"."])):nq(a,b,16,4,!0);default:return mp(b)?(b=nq(a,b,8,3,!1),255<(b|0)?Qp(a):b):Jp(a,S(["Unsupported escape character: \\",b,"."]))}}
+function Dq(a){for(var b=new Sa,c=a.ba(null);;){if(null==c)return Op(a,jk,S(['"',b]));switch(c){case "\\":var d=function(){var c=b;c.append(Cq(a));return c}(),e=a.ba(null);b=d;c=e;continue;case '"':return[B.c(b)].join("");default:d=function(){var a=b;a.append(c);return a}(),e=a.ba(null),b=d,c=e}}}function Eq(a,b,c){if(null==b)return null;var d=up(a);d=null==d?null:new u(null,1,[Qj,d],null);var e=rq(a);a=T(e,0);e=T(e,1);return uh.l(S([d,new u(null,4,[Xk,b,zk,c,tl,a,Uj,e],null)]))}
+function Fq(a,b){var c=qq(a),d=T(c,0);c=T(c,1);b=fq(a,Hj,b);if(null==b)return null;switch(b){case "nil":return null;case "true":return!0;case "false":return!1;case "/":return ll;default:var e=aq(b);return null!=e?Wc.f(e.K(null,0),e.K(null,1)).V(null,Eq(a,d,c)):Np(a,Hj,b)}}
+function Gq(a){var b=a.ba(null);if(lp(b))return Jp(a,S(["A single colon is not a valid keyword."]));b=fq(a,al,b);var c=aq(b);if(null!=c){var d=c.K(null,0);c=c.K(null,1);if(":"===b.charAt(0)){if(null!=d)return d=F.f(null,Wc.c(d.substring(1))),w(d)?Ce.f([B.c(d)].join(""),c):Np(a,al,[B.c(":"),B.c(b)].join(""));d=null;return w(d)?Ce.f([B.c(d)].join(""),c.substring(1)):Jp(a,S(["Invalid token: :",b]))}return Ce.f(d,c)}return Np(a,al,[B.c(":"),B.c(b)].join(""))}
+function Hq(a){return function(b,c,d,e){return new Fd(null,a,new Fd(null,Iq?Iq(b,!0,null,d,e):xq.call(null,b,!0,null,d,e),null,1,null),2,null)}}
+function Jq(a,b,c,d){var e=qq(a);b=T(e,0);e=T(e,1);var f=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);f=f instanceof V?Hd([f,!0]):f instanceof D?new u(null,1,[Ll,f],null):"string"===typeof f?new u(null,1,[Ll,f],null):f;Ud(f)||Jp(a,S(["Metadata cannot be ",Hp(f),". Metadata must be a Symbol, Keyword, String or Map."]));c=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);return null!=c&&(c.m&131072||t===c.Vc)?(a=w(w(b)?$d(c):b)?U.l(f,Xk,b,S([zk,e])):f,null!=c&&(c.m&262144||t===c.Ad)?Md(c,uh.l(S([Nd(c),
+a]))):c.meta=a):Jp(a,S(["Metadata can not be applied to ",Hp(c),". ","Metadata can only be applied to IMetas."]))}function Kq(a,b,c,d){var e=qq(a);b=T(e,0);e=T(e,1);e=w(e)?e-1|0:null;c=vq(Pl,"}",a,c,d);d=Eh(c);var f=rq(a),h=T(f,0);f=T(f,1);M.f(P(c),P(d))||Jp(a,S([Tp(a,Pl,c)]));return Md(d,w(b)?uh.l(S([function(){var b=up(a);return w(b)?new u(null,1,[Qj,b],null):null}(),new u(null,4,[Xk,b,zk,e,tl,h,Uj,f],null)])):null)}
+function Lq(a,b,c,d){Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);return a}function Mq(a,b,c,d){b=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);return M.f(Lj,b)?Number.NaN:M.f(zl,b)?Number.NEGATIVE_INFINITY:M.f(fk,b)?Number.POSITIVE_INFINITY:Jp(a,S([["Invalid token: ##",B.c(b)].join("")]))}var Nq=new Bh(null,new u(null,2,[pj,null,rm,null],null),null);function Oq(a,b,c){a===sq&&(a=0>c,Up(b,a?c:a))}
+function Pq(a,b,c,d){var e=Qq;Qq=!0;try{var f=wq?wq(b,!1,sq,")",c,d):xq.call(null,b,!1,sq,")",c,d);Oq(f,b,a);return f===tq?tq:null}finally{Qq=e}}if("undefined"===typeof Ta||"undefined"===typeof fp||"undefined"===typeof gp||"undefined"===typeof Rq)var Rq={};
+function Sq(a,b,c,d){var e=w(xp(a))?sp(a):-1;a:for(var f=Rq,h=null;;)if(f===Rq){f=e;h=a;var k=c,l=d,m=wq?wq(h,!1,sq,")",k,l):xq.call(null,h,!1,sq,")",k,l);Oq(m,h,f);if(M.f(m,tq))f=tq;else{var n=h,q=m;w(F.f(Nq,q))&&Jp(n,S(["Feature name ",q," is reserved"]));n=h;q=k;m=m instanceof V?M.f(Bi,m)||de(F.f(q,Qi),m):Jp(n,S(["Feature should be a keyword: ",m]));w(m)?(k=wq?wq(h,!1,sq,")",k,l):xq.call(null,h,!1,sq,")",k,l),Oq(k,h,f),k===tq&&(0>f?Jp(h,S(["read-cond requires an even number of forms"])):Jp(h,S(["read-cond starting on line ",
+f," requires an even number of forms"]))),f=k):(f=Pq(f,h,k,l),f=w(f)?f:Rq)}if(f===tq){c=tq;break a}h=null}else if(h!==tq)h=Pq(e,a,c,d);else{c=f;break a}return c===tq?a:w(b)?null!=c&&(c.m&16777216||t===c.lc)?(b=Me(c),la(sa,d,0,0).apply(null,b),a):Jp(a,S(["Spliced form list in read-cond-splicing must implement ISequential"])):c}
+function Tq(a,b,c,d){if(kb(function(){if(w(c)){var a=Xj.c(c),b=new Bh(null,new u(null,2,[ek,null,vk,null],null),null);return b.c?b.c(a):b.call(null,a)}return c}()))throw Fi("Conditional read not allowed",new u(null,1,[Zj,pm],null));var e=a.ba(null);if(w(e))if(e=(b=M.f(e,"@"))?a.ba(null):e,b&&(uq||Jp(a,S(["cond-splice not in list"]))),e=lp(e)?Vp(a):e,w(e)){if(!M.f(e,"("))throw Fi("read-cond body must be a list",new u(null,1,[Zj,pm],null));var f=Qq;Qq=function(){var a=Qq;return w(a)?a:M.f(ek,Xj.c(c))}();
+try{return w(Qq)?jp(yq(a,e,c,d),b):Sq(a,b,c,d)}finally{Qq=f}}else return Rp(a);else return Rp(a)}var Uq=null;function Vq(a){return Wc.c([B.c(-1===a?"rest":["p",B.c(a)].join("")),"__",B.c(qf.f(np,gd)),"#"].join(""))}
+function Wq(a,b,c,d){if(w(Uq))throw Fi("Nested #()s are not allowed",new u(null,1,[Zj,Kk],null));b=Uq;Uq=qh();try{rp(a,"(");var e=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);var f=mc(Uq),h=f?function(){var a=Ob(K(f)),b=function(){for(var b=1,c=sc(Ed);;){if(b>a)return uc(c);var d=b+1;c=Qe.f(c,function(){var a=F.f(Uq,b);return w(a)?a:Vq(b)}());b=d}}();return w(Uq.c?Uq.c(-1):Uq.call(null,-1))?Dd.l(b,Oi,S([Uq.c?Uq.c(-1):Uq.call(null,-1)])):b}():Ed;return new Fd(null,Zk,new Fd(null,h,new Fd(null,
+e,null,1,null),2,null),3,null)}finally{Uq=b}}function Xq(a){if(w(Uq)){var b=Uq.c?Uq.c(a):Uq.call(null,a);if(w(b))return b;b=Vq(a);Uq=U.h(Uq,a,b);return b}throw Fi("Arg literal not in #()",new u(null,1,[Zj,Kk],null));}
+function Yq(a,b,c,d){if(null==Uq)return Fq(a,b);b=a.Jb();if(lp(b)||dq(b)||null==b)return Xq(1);if(M.f(b,"\x26"))return a.ba(null),Xq(-1);a=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);if(ce(a))return Xq(a);throw Fi("Arg literal must be %, %\x26 or %integer",new u(null,1,[Zj,Kk],null));}var Zq=null;function $q(a,b,c,d){b=a.Jb();if(w(b)){if(M.f("@",b))return a.ba(null),b=Hq(Mk),b.C?b.C(a,"@",c,d):b.call(null,a,"@",c,d);b=Hq(ql);return b.C?b.C(a,"~",c,d):b.call(null,a,"~",c,d)}return null}
+function ar(a){return $d(a)&&M.f(K(a),Mk)}function br(a){return $d(a)&&M.f(K(a),ql)}function cr(a){a=G(a);for(var b=sc(Ed);;)if(a){var c=K(a);a=L(a);b=Qe.f(Qe.f(b,Ob(c)),Pb(c))}else return G(uc(b))}function dr(a){if(kb(Zq))throw Fi("Gensym literal not in syntax-quote",new u(null,1,[Zj,Kk],null));var b=F.f(Zq,a);if(w(b))return b;b=Wc.c([B.c(te(De(a),P(De(a))-1)),"__",B.c(qf.f(np,gd)),"__auto__"].join(""));Zq=U.h(Zq,a,b);return b}
+function er(a,b){return function(){var b=null!=a?a.m&262144||t===a.Ad?!0:!1:!1;return b?G(Id.l(Nd(a),Xk,S([zk,tl,Uj,Qj,gk]))):b}()?new Fd(null,qk,new Fd(null,b,new Fd(null,function(){var b=Nd(a);return fr.c?fr.c(b):fr.call(null,b)}(),null,1,null),2,null),3,null):b}
+function gr(a,b){var c=yd;a:{b=G(b);for(var d=sc(Ed);;)if(b){var e=K(b);d=Qe.f(d,w(br(e))?new Fd(null,cj,new Fd(null,Bd(e),null,1,null),2,null):w(ar(e))?Bd(e):new Fd(null,cj,new Fd(null,fr.c?fr.c(e):fr.call(null,e),null,1,null),2,null));b=L(b)}else{b=G(uc(d));break a}}c=new Fd(null,Cl,new Fd(null,c(Rj,b),null,1,null),2,null);return w(a)?new Fd(null,yj,new Fd(null,a,new Fd(null,c,null,1,null),2,null),3,null):c}
+function hr(a){throw Fi("resolve-symbol is not implemented",new u(null,1,[yk,a],null));}
+function fr(a){if(de(new Bh(null,new u(null,24,[Oi,null,Ti,null,Wi,null,Zi,null,sj,null,Dj,null,Gj,null,bk,null,nk,null,pk,null,sk,null,wk,null,Nk,null,Pk,null,Uk,null,Zk,null,bl,null,Il,null,Ml,null,Nl,null,Ol,null,Yl,null,qm,null,xm,null],null),null),a))var b=new Fd(null,Ol,new Fd(null,a,null,1,null),2,null);else if(a instanceof D)b=new Fd(null,Ol,new Fd(null,w(function(){var b=kb(Be(a));return b?(b=De(a),pa(b,"#")):b}())?dr(a):function(){var b=[B.c(a)].join("");return w(pa(b,"."))?(b=Wc.c(te(b,
+P(b)-1)),Wc.c([B.c(hr.c?hr.c(b):hr.call(null,b)),"."].join(""))):hr.c?hr.c(a):hr.call(null,a)}(),null,1,null),2,null);else if(w(br(a)))b=Bd(a);else{if(w(ar(a)))throw Fi("unquote-splice not in list",new u(null,1,[Zj,Kk],null));if(Rd(a))if(null!=a&&(a.m&67108864||t===a.wd))b=a;else if(Ud(a))b=gr(16<=P(a)?tj:mj,cr(a));else if(Wd(a))b=new Fd(null,yl,new Fd(null,gr(null,a),null,1,null),2,null);else if(Sd(a))b=gr(hm,a);else if($d(a)||ue(a))b=function(){var b=G(a);return b?gr(null,b):xe(km)}();else throw Fi("Unknown Collection type",
+new u(null,1,[Zj,Jl],null));else b=w(function(){var b=a instanceof V;if(b||(b="number"===typeof a)||(b="string"===typeof a)||(b=null==a))return b;b=a instanceof Boolean||!0===a||!1===a;return w(b)?b:a instanceof RegExp}())?a:new Fd(null,Ol,new Fd(null,a,null,1,null),2,null)}return er(a,b)}function ir(a,b,c,d){b=Zq;Zq=Z;try{return fr(Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d))}finally{Zq=b}}
+function jr(a,b,c,d){var e=fq(a,gj,qp(a));b=M.f(e,":")?null.name:M.f(":",K(e))?function(){var a=null==e?null:e.substring(1);a=null==a?null:aq(a);a=null==a?null:pp(a);a=null==a?null:Wc.c(a);if(null==a)a=null;else{var b=F.f(null,a);if(w(b))a=b;else{null==Mi&&(Mi=of(Z));b=F.f(C(Mi),a);if(null!=b)a=b;else{b=[B.c(a)].join("");var c=[B.c(b)].join("");for(var d=new Sa,m=0;;)if(m<c.length){var n=c.charAt(m),q=ya(pb,n);null!=q?d.append(q):d.append(n);m+=1}else break;c=d.toString();c=".."===c?"_DOT__DOT_":
+w(Ji(c))?[B.c(c),"$"].join(""):c;c:for(b=(b instanceof D?Wc.c(c):c).split("."),c=aa;;){if(null==c){b=null;break c}if(null==b){b=c;break c}d=K(b);c=ya(c,d);b=L(b)}null==b?a=null:(b=new Li(a),qf.C(Mi,U,a,b),a=b)}a=w(a)?Wc.c(a.name):null}}return a}():function(){var a=null==e?null:aq(e);return null==a?null:pp(a)}();return w(b)?"{"===Vp(a)?(c=vq(gj,"}",a,c,d),!ff(P(c))&&Mp(a,null,null,c),d=op([B.c(b)].join(""),Kh(2,c)),c=Kh(2,Yc(c)),M.f(P(Eh(d)),P(d))||Tp(a,gj,d),Gh(d,c)):Jp(a,S(["Namespaced map with namespace ",
+e," does not specify a map."])):Jp(a,S(["Invalid value used as namespace in namespaced map: ",e,"."]))}function oq(a){switch(a){case '"':return Dq;case ":":return Gq;case ";":return bq;case "'":return Hq(Ol);case "@":return Hq(hl);case "^":return Jq;case "`":return ir;case "~":return $q;case "(":return yq;case ")":return jq;case "[":return zq;case "]":return jq;case "{":return Aq;case "}":return jq;case "\\":return pq;case "%":return Yq;case "#":return gq;default:return null}}
+function hq(a){switch(a){case "^":return Jq;case "'":return Hq(Nl);case "(":return Wq;case "{":return Kq;case "\x3c":return cq("Unreadable form");case "\x3d":return cq("read-eval not supported");case '"':return kq;case "!":return bq;case "_":return Lq;case "?":return Tq;case ":":return jr;case "#":return Mq;default:return null}}
+function iq(a,b,c,d){b=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);b instanceof D||Jp(a,S(["Invalid reader tag: ",Hp(b),". Reader tags must be symbols."]));if(w(Qq)){a=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d);if(!(b instanceof D))throw Error("Assert failed: (symbol? tag)");return new Gi(b,a)}var e=Z.c?Z.c(b):Z.call(null,b);e=w(e)?e:Z.c?Z.c(b):Z.call(null,b);return w(e)?(b=Iq?Iq(a,!0,null,c,d):xq.call(null,a,!0,null,c,d),e.c?e.c(b):e.call(null,b)):w(kr)?(e=kr,a=Iq?Iq(a,!0,null,c,d):xq.call(null,
+a,!0,null,c,d),e.f?e.f(b,a):e.call(null,b,a)):Jp(a,S(["No reader function for tag ",Hp(b),"."]))}var kr=null,Qq=!1;function xq(a){switch(arguments.length){case 5:return Iq(arguments[0],arguments[1],arguments[2],arguments[3],arguments[4]);case 6:return wq(arguments[0],arguments[1],arguments[2],arguments[3],arguments[4],arguments[5]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}}function Iq(a,b,c,d,e){return wq(a,b,c,null,d,e)}
+function wq(a,b,c,d,e,f){try{a:for(;;)if(0==f.length){var h=a.ba(null);if(!lp(h)){if(null==h){var k=b?Up(a,null):c;break a}if(h===d){k=tq;break a}if(mp(h)||("+"===h||"-"===h)&&mp(a.Jb())){k=Bq(a,h);break a}var l=oq(h);if(null!=l){var m=l.C?l.C(a,h,e,f):l.call(null,a,h,e,f);if(m!==a){k=m;break a}}else{k=Fq(a,h);break a}}}else{var n=f[0];Array.prototype.splice.call(f,0,1);k=n;break a}return k}catch(q){if(q instanceof Error){b=q;if(b instanceof Ei){c=b instanceof Ei?b.data:null;if(M.f(oj,Zj.c(c)))throw b;
+a=uh.l(S([new u(null,1,[Zj,oj],null),c,w(xp(a))?new u(null,3,[Xk,a.Yb(null),zk,a.Xb(null),Qj,a.Fc(null)],null):null]));throw new Ei(b.message,a,b);}a=uh.l(S([new u(null,1,[Zj,oj],null),w(xp(a))?new u(null,3,[Xk,a.Yb(null),zk,a.Xb(null),Qj,a.Fc(null)],null):null]));throw new Ei(b.message,a,b);}throw q;}};var lr={},mr={};if("undefined"===typeof Am||"undefined"===typeof lr||"undefined"===typeof mr||"undefined"===typeof nr)var nr=function(){var a=of(Z),b=of(Z),c=of(Z),d=of(Z),e=F.h(Z,Xl,pi());return new Ai(Wc.f("pluto.reader.reference","resolve"),function(){return function(a,b){a=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;return F.f(a,Zj)}}(a,b,c,d,e),e,a,b,c,d)}();
+Di(nr,wm,function(a,b){b=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;b=F.f(b,Oj);a=F.f(a,b);return w(a)?new u(null,1,[zm,a],null):new u(null,1,[$i,new W(null,1,5,X,[new u(null,2,[Zj,ak,Oj,b],null)],null)],null)});Di(nr,Bi,function(a,b){a=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;F.f(a,Zj);a=F.f(a,Oj);return new u(null,1,[$i,new W(null,1,5,X,[new u(null,2,[Zj,uk,Oj,a],null)],null)],null)});var or;a:{var pr=aa.navigator;if(pr){var qr=pr.userAgent;if(qr){or=qr;break a}}or=""};function rr(a,b,c){var d=a;b&&(d=ka(a,b));d=rr.Nd(d);ca(aa.setImmediate)&&(c||rr.Md())?aa.setImmediate(d):(rr.ld||(rr.ld=rr.Gd()),rr.ld(d))}rr.Md=function(){return aa.Window&&aa.Window.prototype&&-1==or.indexOf("Edge")&&aa.Window.prototype.setImmediate==aa.setImmediate?!1:!0};
+rr.Gd=function(){var a=aa.MessageChannel;"undefined"===typeof a&&"undefined"!==typeof window&&window.postMessage&&window.addEventListener&&-1==or.indexOf("Presto")&&(a=function(){var a=document.createElement("IFRAME");a.style.display="none";a.src="";document.documentElement.appendChild(a);var b=a.contentWindow;a=b.document;a.open();a.write("");a.close();var c="callImmediate"+Math.random(),d="file:"==b.location.protocol?"*":b.location.protocol+"//"+b.location.host;a=ka(function(a){if(("*"==d||a.origin==
+d)&&a.data==c)this.port1.onmessage()},this);b.addEventListener("message",a,!1);this.port1={};this.port2={postMessage:function(){b.postMessage(c,d)}}});if("undefined"!==typeof a&&-1==or.indexOf("Trident")&&-1==or.indexOf("MSIE")){var b=new a,c={},d=c;b.port1.onmessage=function(){if(void 0!==c.next){c=c.next;var a=c.Qc;c.Qc=null;a()}};return function(a){d.next={Qc:a};d=d.next;b.port2.postMessage(0)}}return"undefined"!==typeof document&&"onreadystatechange"in document.createElement("SCRIPT")?function(a){var b=
+document.createElement("SCRIPT");b.onreadystatechange=function(){b.onreadystatechange=null;b.parentNode.removeChild(b);b=null;a();a=null};document.documentElement.appendChild(b)}:function(a){aa.setTimeout(a,0)}};rr.Nd=function(a){return a};var sr={},mf=lf.f(lg,Ed);function tr(a){return null!=a?t===a.ec?!0:a.rc?!1:x(Cn,a):x(Cn,a)}function ur(a){return null!=a?a.m&32768||t===a.Tc?!0:a.m?!1:x(Wb,a):x(Wb,a)}function vr(a,b){Mn(a,b)}function wr(a,b){setTimeout(a,b)}function xr(a){return null!=a&&t===a.ec?[B.c(w(Uc.f?Uc.f(Dn,a):Uc.call(null,Dn,a))?"ra":w(Uc.f?Uc.f(In,a):Uc.call(null,In,a))?"rc":w(Uc.f?Uc.f(Nn,a):Uc.call(null,Nn,a))?"rx":w(Uc.f?Uc.f(Hn,a):Uc.call(null,Hn,a))?"tr":"other"),B.c(Sc(a))].join(""):null};var yr=of(new u(null,5,[em,console.log.bind(console),Ij,console.warn.bind(console),El,console.error.bind(console),hj,w(console.group)?console.group.bind(console):console.log.bind(console),Rl,w(console.groupEnd)?console.groupEnd.bind(console):function(){return Zc}],null));function zr(a){for(var b=[],c=arguments.length,d=0;;)if(d<c)b.push(arguments[d]),d+=1;else break;Ar(arguments[0],1<b.length?new H(b.slice(1),0,null):null)}
+function Ar(a,b){if(!de(C(yr),a))throw Error(["Assert failed: ",B.c(["re-frame: log called with unknown level: ",B.c(a)].join("")),"\n(contains? (clojure.core/deref loggers) level)"].join(""));var c=C(yr);a=a.c?a.c(c):a.call(null,c);return We(a,b)};var Br={};if("undefined"===typeof sr||"undefined"===typeof Br||"undefined"===typeof Cr)var Cr=of(Ed);if("undefined"===typeof sr||"undefined"===typeof Br||"undefined"===typeof Dr)var Dr=of(0);var Er=new Bh(null,new u(null,3,[Qk,null,dl,null,dm,null],null),null);function Fr(a){return Ud(a)&&M.f(Er,Eh(wg(a)))}function Gr(a){a=null!=a&&(a.m&64||t===a.U)?We(oh,a):a;var b=F.f(a,dl),c=F.f(a,dm),d=F.f(a,Qk),e=G(kn.f(Eh(wg(a)),Er));e&&Ar(El,S(["re-frame: -\x3einterceptor",a,"has unknown keys:",e]));return new u(null,3,[dl,w(b)?b:Pi,dm,c,Qk,d],null)}function Hr(a,b){return sb(F,a,new W(null,2,5,X,[Hl,b],null))}
+function Ir(a,b){for(var c=a;;){var d=Aj.c(c);if(Qd(d))return c;a=Od(d);var e=pl.c(c);c=U.l(c,Aj,null==d?null:Tb(d),S([pl,Dd.f(e,a)]));a=F.f(a,b);c=w(a)?a.c?a.c(c):a.call(null,c):c}};var Jr=new Bh(null,new u(null,4,[xj,null,Ok,null,Zl,null,cm,null],null),null),Kr=of(Z);function Lr(a,b){return F.f(F.f(C(Kr),a),b)}function Mr(a,b,c){var d=Lr(a,b);w(w(c)?null==d:c)&&Ar(El,S(["re-frame: no",[B.c(a)].join(""),"handler registered for:",b]));return d}function Nr(a,b,c){w(Mr(a,b,!1))&&Ar(Ij,S(["re-frame: overwriting",[B.c(a)].join(""),"handler for:",b]));qf.C(Kr,Ef,new W(null,2,5,X,[a,b],null),c);return c}
+var Or=function Or(a){switch(arguments.length){case 0:return Or.D();case 1:return Or.c(arguments[0]);case 2:return Or.f(arguments[0],arguments[1]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};Or.D=function(){return pf(Kr,Z)};Or.c=function(a){if(!w(Jr.c?Jr.c(a):Jr.call(null,a)))throw Error("Assert failed: (kinds kind)");return qf.h(Kr,Id,a)};
+Or.f=function(a,b){if(!w(Jr.c?Jr.c(a):Jr.call(null,a)))throw Error("Assert failed: (kinds kind)");return w(Lr(a,b))?qf.l(Kr,Ff,new W(null,1,5,X,[a],null),Id,S([b])):Ar(Ij,S(["re-frame: can't clear",[B.c(a)].join(""),"handler for",[B.c(b),". Handler not found."].join("")]))};Or.G=2;var Pr=function Pr(a,b){var d=G(b);b=K(d);if(d=L(d)){var e=F.f(a,b);return w(e)?(d=Pr.f?Pr.f(e,d):Pr.call(null,e,d),G(d)?U.h(a,b,d):Id.f(a,b)):a}return Id.f(a,b)};function Qr(a){return Wd(a)?K(a):Ar(El,S(["re-frame: expected a vector, but got:",a]))};var Rr=En.c(Z);if(!w(Jr.c?Jr.c(Ok):Jr.call(null,Ok)))throw Error("Assert failed: (re-frame.registrar/kinds kind)");var Sr=null;var Tr=new u(null,2,[Ck,function(a){function b(){return rr.c?rr.c(a):rr.call(null,a)}return ep.c?ep.c(b):ep.call(null,b)},Vi,rr],null),Ur=function Ur(a,b){if(null!=a&&null!=a.gd)return a.gd(a,b);var d=Ur[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=Ur._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("IEventQueue.push",a);};function Vr(){var a=mf,b=Z;this.sc=ej;this.Ga=a;this.Id=b}
+function Wr(a){for(var b=P(a.Ga);;){if(0===b)return Xr(a,mm,null);var c=ef(Tr,wg(Nd(Od(a.Ga))));if(w(c))return Xr(a,Dl,c);Yr(a);--b}}Vr.prototype.gd=function(a,b){return Xr(this,Si,b)};function Zr(a){a=function(a){return function(){return Xr(a,ml,null)}}(a);return rr.c?rr.c(a):rr.call(null,a)}
+function Xr(a,b,c){var d=function(){var d=new W(null,2,5,X,[a.sc,b],null);if(M.f(new W(null,2,5,X,[ej,Si],null),d))return new W(null,2,5,X,[wl,function(a,b){return function(){b.Ga=Dd.f(b.Ga,c);return Zr(b)}}(d,a)],null);if(M.f(new W(null,2,5,X,[wl,Si],null),d))return new W(null,2,5,X,[wl,function(a,b){return function(){return b.Ga=Dd.f(b.Ga,c)}}(d,a)],null);if(M.f(new W(null,2,5,X,[wl,ml],null),d))return new W(null,2,5,X,[xk,function(a,b){return function(){return Wr(b)}}(d,a)],null);if(M.f(new W(null,
+2,5,X,[xk,Si],null),d))return new W(null,2,5,X,[xk,function(a,b){return function(){return b.Ga=Dd.f(b.Ga,c)}}(d,a)],null);if(M.f(new W(null,2,5,X,[xk,Dl],null),d))return new W(null,2,5,X,[Yi,function(a,b){return function(){return $r(b,c)}}(d,a)],null);if(M.f(new W(null,2,5,X,[xk,Gl],null),d))return new W(null,2,5,X,[ej,function(a,b){return function(){b.Ga=mf;throw c;}}(d,a)],null);if(M.f(new W(null,2,5,X,[xk,mm],null),d))return Qd(a.Ga)?new W(null,1,5,X,[ej],null):new W(null,2,5,X,[wl,function(a,
+b){return function(){return Zr(b)}}(d,a)],null);if(M.f(new W(null,2,5,X,[Yi,Si],null),d))return new W(null,2,5,X,[Yi,function(a,b){return function(){return b.Ga=Dd.f(b.Ga,c)}}(d,a)],null);if(M.f(new W(null,2,5,X,[Yi,am],null),d))return new W(null,2,5,X,[xk,function(a,b){return function(){Yr(b);return Wr(b)}}(d,a)],null);throw Fi(["re-frame: router state transition not found. ",B.c(a.sc)," ",B.c(b)].join(""),new u(null,2,[lj,a.sc,Tl,b],null));}();var e=T(d,0);d=T(d,1);a.sc=e;return w(d)?d.D?d.D():
+d.call(null):null}function $r(a,b){a=function(a){return function(){return Xr(a,am,null)}}(a);return b.c?b.c(a):b.call(null,a)}
+function Yr(a){var b=Od(a.Ga);try{var c=Qr(b),d=Mr(Ok,c,!0);if(w(d))if(w(Sr))Ar(El,S(["re-frame: while handling",Sr,", dispatch-sync was called for",b,". You can't call dispatch-sync within an event handler."]));else{c=Sr;Sr=b;try{var e=Ef(Z,new W(null,2,5,X,[Hl,Ok],null),b);var f=Hf(e,Aj,kf(),d);var h=Ir(f,dm),k=Id.f(h,Aj),l=pl.c(h);var m=Hf(k,Aj,kf(),l);Ir(m,Qk)}finally{Sr=c}}var n=a.Ga;var q=null==n?null:Tb(n);a.Ga=q;a:{var r=G(xg(a.Id));d=null;for(e=f=0;;)if(e<f){var v=d.K(null,e);v.f?v.f(b,a.Ga):
+v.call(null,b,a.Ga);e+=1}else{var y=G(r);if(y){m=y;if(Xd(m)){var A=zc(m),E=Bc(m);m=A;var I=P(A);r=E;d=m;f=I}else v=K(m),v.f?v.f(b,a.Ga):v.call(null,b,a.Ga),r=L(m),d=null,f=0;e=0}else break a}}}catch(O){Xr(a,Gl,O)}}var as=new Vr;function bs(a){if(null==a)throw Fi('re-frame: you called "dispatch" without an event vector.',Z);Ur(as,a);return null};if(!w(Jr.c?Jr.c(cm):Jr.call(null,cm)))throw Error("Assert failed: (re-frame.registrar/kinds kind)");
+var cs=Gr(S([dl,Tj,Qk,function(a){for(var b,c=G(fl.c(a)),d=null,e=0,f=0;;)if(f<e){a=d.K(null,f);b=T(a,0);a=T(a,1);var h=Mr(cm,b,!1);w(h)?(b=h,b.c?b.c(a):b.call(null,a)):Ar(El,S(["re-frame: no handler registered for effect:",b,". Ignoring."]));f+=1}else if(a=G(c))c=a,Xd(c)?(b=zc(c),c=Bc(c),a=b,b=P(b),d=a,e=b):(a=K(c),b=T(a,0),a=T(a,1),d=Mr(cm,b,!1),w(d)?(b=d,b.c?b.c(a):b.call(null,a)):Ar(El,S(["re-frame: no handler registered for effect:",b,". Ignoring."])),c=L(c),d=null,e=0),f=0;else return null}]));
+Nr(cm,um,function(a){a=G(a);for(var b=null,c=0,d=0;;)if(d<c){var e=b.K(null,d),f=null!=e&&(e.m&64||t===e.U)?We(oh,e):e,h=f,k=F.f(f,bm),l=F.f(f,Gk);Qd(l)||"number"!==typeof k?Ar(El,S(["re-frame: ignoring bad :dispatch-later value:",h])):wr(function(a,b,c,d,e,f,h,k,l){return function(){return bs(l)}}(a,b,c,d,e,f,h,k,l),k);d+=1}else if(f=G(a)){e=f;if(Xd(e))a=zc(e),d=Bc(e),b=a,c=P(a),a=d;else{var m=K(e),n=null!=m&&(m.m&64||t===m.U)?We(oh,m):m;h=n;k=F.f(n,bm);l=F.f(n,Gk);Qd(l)||"number"!==typeof k?Ar(El,
+S(["re-frame: ignoring bad :dispatch-later value:",h])):wr(function(a,b,c,d,e,f,h,k,l){return function(){return bs(l)}}(a,b,c,d,m,n,h,k,l,e,f),k);a=L(e);b=null;c=0}d=0}else return null});Nr(cm,Gk,function(a){return Wd(a)?bs(a):Ar(El,S(["re-frame: ignoring bad :dispatch value. Expected a vector, but got:",a]))});
+Nr(cm,Yj,function(a){if(Td(a)){a=G(zf(ib,a));for(var b=null,c=0,d=0;;)if(d<c){var e=b.K(null,d);bs(e);d+=1}else if(a=G(a))b=a,Xd(b)?(a=zc(b),c=Bc(b),b=a,e=P(a),a=c,c=e):(e=K(b),bs(e),a=L(b),b=null,c=0),d=0;else return null}else return Ar(El,S(["re-frame: ignoring bad :dispatch-n value. Expected a collection, got got:",a]))});
+Nr(cm,ok,function(a){var b=jf.f(Or,Ok);if(Td(a)){a=G(a);for(var c=null,d=0,e=0;;)if(e<d){var f=c.K(null,e);b.c?b.c(f):b.call(null,f);e+=1}else if(a=G(a))c=a,Xd(c)?(a=zc(c),d=Bc(c),c=a,f=P(a),a=d,d=f):(f=K(c),b.c?b.c(f):b.call(null,f),a=L(c),c=null,d=0),e=0;else return null}else return b.c?b.c(a):b.call(null,a)});Nr(cm,vj,function(a){return C(Rr)!==a?pf(Rr,a):null});if(!w(Jr.c?Jr.c(Zl):Jr.call(null,Zl)))throw Error("Assert failed: (re-frame.registrar/kinds kind)");Nr(Zl,vj,function(a){return U.h(a,vj,C(Rr))});var ds=function(a){return Gr(S([dl,Hl,dm,function(b){var c=Lr(Zl,a);return w(c)?Gf(b,Hl,c):Ar(El,S(["No cofx handler registered for",a]))}]))}(vj);function es(a,b){return M.f(a,b)?new W(null,3,5,X,[null,null,a],null):new W(null,3,5,X,[a,b,null],null)}function fs(a){return G(a)?sb(function(a,c){var b=T(c,0);c=T(c,1);return U.h(a,b,c)},ag(wf(We(pe,wg(a)))),a):null}function gs(a,b,c){var d=F.f(a,c),e=F.f(b,c),f=hs(d,e),h=T(f,0),k=T(f,1);f=T(f,2);a=de(a,c);b=de(b,c);d=a&&b&&(null!=f||null==d&&null==e);return new W(null,3,5,X,[!a||null==h&&d?null:Hd([c,h]),!b||null==k&&d?null:Hd([c,k]),d?Hd([c,f]):null],null)}
+var is=function is(a){switch(arguments.length){case 2:return is.f(arguments[0],arguments[1]);case 3:return is.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};is.f=function(a,b){return is.h(a,b,hn(wg(a),wg(b)))};is.h=function(a,b,c){return sb(function(a,b){return Nh(rf.h(uh,a,b))},new W(null,3,5,X,[null,null,null],null),rf.f(jf.h(gs,a,b),c))};is.G=3;
+function js(a,b){return ag(rf.f(fs,is.h(Wd(a)?a:ag(a),Wd(b)?b:ag(b),new Jh(null,0,function(){var c=P(a),d=P(b);return c>d?c:d}(),1,null))))}function ks(a,b){return new W(null,3,5,X,[Ze(kn.f(a,b)),Ze(kn.f(b,a)),Ze(jn.f(a,b))],null)}
+var ls=function ls(a){if(null!=a&&null!=a.Dd)return a.Dd(a);var c=ls[p(null==a?null:a)];if(null!=c)return c.c?c.c(a):c.call(null,a);c=ls._;if(null!=c)return c.c?c.c(a):c.call(null,a);throw z("EqualityPartition.equality-partition",a);},ms=function ms(a,b){if(null!=a&&null!=a.Cd)return a.Cd(a,b);var d=ms[p(null==a?null:a)];if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);d=ms._;if(null!=d)return d.f?d.f(a,b):d.call(null,a,b);throw z("Diff.diff-similar",a);};ls["null"]=function(){return Sl};
+ls.string=function(){return Sl};ls.number=function(){return Sl};ls.array=function(){return Fj};ls["function"]=function(){return Sl};ls["boolean"]=function(){return Sl};ls._=function(a){return(null!=a?a.m&1024||t===a.vd||(a.m?0:x(Mb,a)):x(Mb,a))?jm:(null!=a?a.m&4096||t===a.zd||(a.m?0:x(Qb,a)):x(Qb,a))?Pl:(null!=a?a.m&16777216||t===a.lc||(a.m?0:x(ic,a)):x(ic,a))?Fj:Sl};ms["null"]=function(a,b){return es(a,b)};ms.string=function(a,b){return es(a,b)};ms.number=function(a,b){return es(a,b)};
+ms.array=function(a,b){return js(a,b)};ms["function"]=function(a,b){return es(a,b)};ms["boolean"]=function(a,b){return es(a,b)};ms._=function(a,b){var c=function(){var b=ls(a);b=b instanceof V?b.Ka:null;switch(b){case "atom":return es;case "set":return ks;case "sequential":return js;case "map":return is;default:throw Error(["No matching clause: ",B.c(b)].join(""));}}();return c.f?c.f(a,b):c.call(null,a,b)};
+function hs(a,b){return M.f(a,b)?new W(null,3,5,X,[null,null,a],null):M.f(ls(a),ls(b))?ms(a,b):es(a,b)};Gr(S([dl,ck,dm,function(a){Ar(em,S(["Handling re-frame event:",Hr(a,Ok)]));return a},Qk,function(a){var b=Hr(a,Ok),c=Hr(a,vj);a:{var d=Zd;for(var e=a,f=G(new W(null,2,5,X,[fl,vj],null));;)if(null!=f){e=F.h(e,K(f),d);if(d===e){d=zj;break a}f=L(f)}else{d=e;break a}}M.f(d,zj)?Ar(em,S(["No :db changes caused by:",b])):(d=hs(c,d),c=T(d,0),d=T(d,1),null!=c||null!=d?(Ar(hj,S(["db clojure.data/diff for:",b])),Ar(em,S(["only before:",c])),Ar(em,S(["only after :",d])),zr(Rl)):Ar(em,S(["no app-db changes caused by:",
+b])));return a}]));Gr(S([dl,Ek,dm,function(a){return Ef(Ff.C(a,new W(null,2,5,X,[Hl,Ok],null),eg,1),new W(null,2,5,X,[Hl,gm],null),Hr(a,Ok))},Qk,function(a){return Ef(Pr(a,new W(null,2,5,X,[Hl,gm],null)),new W(null,2,5,X,[Hl,Ok],null),Hr(a,gm))}]));function ns(a){return Gr(S([dl,Lk,dm,function(b){var c=Hl.c(b),d=null!=c&&(c.m&64||t===c.U)?We(oh,c):c;c=F.f(d,vj);d=F.f(d,Ok);c=a.f?a.f(c,d):a.call(null,c,d);return Ef(b,new W(null,2,5,X,[fl,vj],null),c)}]))};if(!w(Jr.c?Jr.c(xj):Jr.call(null,xj)))throw Error("Assert failed: (re-frame.registrar/kinds kind)");var os=of(Z);function ps(a,b,c){a=new W(null,2,5,X,[a,b],null);vr(c,function(a){return function(){return qf.f(os,function(a){return function(b){return de(b,a)&&c===F.f(b,a)?Id.f(b,a):b}}(a))}}(a));qf.f(os,function(a){return function(b){de(b,a)&&Ar(Ij,S(["re-frame: Adding a new subscription to the cache while there is an existing subscription in the cache",a]));return U.h(b,a,c)}}(a));return c}
+function qs(a,b){return F.f(C(os),new W(null,2,5,X,[a,b],null))}var rs=function rs(a){switch(arguments.length){case 1:return rs.c(arguments[0]);case 2:return rs.f(arguments[0],arguments[1]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};
+rs.c=function(a){var b=qs(a,Ed);if(w(b))return b;var c=Qr(a);b=Lr(xj,c);return null==b?Ar(El,S([["re-frame: no subscription handler registered for: ",B.c(c),". Returning a nil subscription."].join("")])):ps(a,Ed,b.f?b.f(Rr,a):b.call(null,Rr,a))};
+rs.f=function(a,b){var c=qs(a,b);if(w(c))return c;var d=Qr(a);var e=Lr(xj,d);var f=Ze(zf(tr,b));w(f)&&Ar(Ij,S(["re-frame: your subscription's dynamic parameters that don't implement IReactiveAtom:",f]));if(null==e)return Ar(El,S([["re-frame: no subscription handler registered for: ",B.c(d),". Returning a nil subscription."].join("")]));var h=Gn(function(){return function(){return Cf(md,b)}}(d,e,c));f=Gn(function(b,c,d){return function(){var c=C(b);return d.h?d.h(Rr,a,c):d.call(null,Rr,a,c)}}(h,d,
+e,c));return ps(a,b,Gn(function(a,b){return function(){return C(C(b))}}(h,f,d,e,c)))};rs.G=2;function ss(a){return lf.h(null==a?null:xb(a),rf.c(function(a){var b=T(a,0);a=T(a,1);return new W(null,2,5,X,[b,md.c?md.c(a):md.call(null,a)],null)}),a)}function ts(a,b){var c=Td(a)?rf.f(md,a):Ud(a)?ss(a):w(ur(a))?md.c?md.c(a):md.call(null,a):Zc;Td(a)?rf.f(md,a):Ud(a)?ss(a):w(ur(a))?C(a):Ar(El,S(["re-frame: in the reg-sub for",b,", the input-signals function returns:",a]));return c}
+function us(a){for(var b=[],c=arguments.length,d=0;;)if(d<c)b.push(arguments[d]),d+=1;else break;return vs(arguments[0],1<b.length?new H(b.slice(1),0,null):null)}
+function vs(a,b){var c=Cd(b),d=Fh(b),e=["re-frame: reg-sub for ",B.c(a),", "].join("");b=function(){var a=P(d);switch(a){case 0:return function(){return function(){var a=null;a=function(a,b){switch(arguments.length){case 1:return Rr;case 2:return Rr}throw Error("Invalid arity: "+arguments.length);};a.c=function(){return Rr};a.f=function(){return Rr};return a}()}(a,c,d,e);case 1:return a=K(d),Jd(a)||Ar(El,S([e,"2nd argument expected to be an inputs function, got:",a])),a;case 2:var b=T(d,0),k=T(d,
+1);M.f(rj,b)||Ar(El,S([e,"expected :\x3c-, got:",b]));return function(a,b,c){return function(){function a(){return rs.c(c)}function b(){return rs.c(c)}var d=null;d=function(c,d){switch(arguments.length){case 1:return b.call(this,c);case 2:return a.call(this,c,d)}throw Error("Invalid arity: "+arguments.length);};d.c=b;d.f=a;return d}()}(d,b,k,a,c,d,e);default:b=Df(2,2,d);k=rf.f(K,b);var l=rf.f(Cd,b);df(new Bh(null,new u(null,1,[rj,null],null),null),k)&&df(Wd,l)||Ar(El,S([e,"expected pairs of :\x3c- and vectors, got:",
+b]));return function(a,b,c){return function(){function a(){return rf.f(rs,c)}function b(){return rf.f(rs,c)}var d=null;d=function(c,d){switch(arguments.length){case 1:return b.call(this,c);case 2:return a.call(this,c,d)}throw Error("Invalid arity: "+arguments.length);};d.c=b;d.f=a;return d}()}(b,k,l,a,c,d,e)}}();return Nr(xj,a,function(b,c,d,e){return function(){function f(f,h,k){var l=e.f?e.f(h,k):e.call(null,h,k);f=of(null);l=Gn(function(b,c,d){return function(){var c=ts(b,a);return d.h?d.h(c,h,
+k):d.call(null,c,h,k)}}(l,f,b,c,d,e));pf(f,xr(l));return l}function h(f,h){var k=e.c?e.c(h):e.call(null,h);f=of(null);k=Gn(function(b,c,d){return function(){var c=ts(b,a);return d.f?d.f(c,h):d.call(null,c,h)}}(k,f,b,c,d,e));pf(f,xr(k));return k}var k=null;k=function(a,b,c){switch(arguments.length){case 2:return h.call(this,a,b);case 3:return f.call(this,a,b,c)}throw Error("Invalid arity: "+arguments.length);};k.f=h;k.h=f;return k}()}(c,d,e,b))};jf.f(Or,xj);jf.f(Or,cm);jf.f(Or,Zl);var ws=function ws(a){switch(arguments.length){case 2:return ws.f(arguments[0],arguments[1]);case 3:return ws.h(arguments[0],arguments[1],arguments[2]);default:throw Error(["Invalid arity: ",B.c(arguments.length)].join(""));}};ws.f=function(a,b){return ws.h(a,null,b)};
+ws.h=function(a,b,c){b=new W(null,4,5,X,[ds,cs,b,ns(c)],null);Rd(b)||Ar(El,S(["re-frame: when registering",a,", expected a collection of interceptors, got:",b]));b=zf(ib,Bf(b));Qd(b)&&Ar(El,S(["re-frame: when registering",a,", given an empty interceptor chain"]));c=K(zf(Fr,b));w(c)&&(Jd(c)?Ar(El,S(["re-frame: when registering",a,", got a function instead of an interceptor. Did you provide old style middleware by mistake? Got:",c])):Ar(El,S(["re-frame: when registering",a,", expected interceptors, but got:",
+c])));return Nr(Ok,a,b)};ws.G=3;jf.f(Or,Ok);var xs={};if("undefined"===typeof Am||"undefined"===typeof lr||"undefined"===typeof xs||"undefined"===typeof ys)var ys=function(){var a=of(Z),b=of(Z),c=of(Z),d=of(Z),e=F.h(Z,Xl,pi());return new Ai(Wc.f("pluto.reader.blocks","parse"),function(){return function(a,b){return T(b,0)}}(a,b,c,d,e),e,a,b,c,d)}();function zs(a){var b=ue(a)&&M.f(hl,K(a));w(b)?(a=new W(null,1,5,X,[Ce.c(De(Bd(a)))],null),a=rs.c?rs.c(a):rs.call(null,a),a=C(a)):a=null;return a}
+function As(a){return je(function(a,c,d){return U.h(a,c,zs(d))},Z,a)}function Bs(a,b){a=null!=a&&(a.m&64||t===a.U)?We(oh,a):a;a=F.f(a,hk);return Rd(b)?ro(As(a),b):null}Di(ys,Pj,function(a,b){a=G(b);K(a);b=L(a);a=K(b);b=L(b);a=We(oh,a);b=Cd(b);return new u(null,1,[zm,new W(null,3,5,X,[Bs,new u(null,1,[hk,a],null),b],null)],null)});function Cs(a,b){a=null!=a&&(a.m&64||t===a.U)?We(oh,a):a;a=F.f(a,om);return w(a)?b:null}
+Di(ys,dk,function(a,b){a=G(b);K(a);b=L(a);a=K(b);b=L(b);return a instanceof D?new u(null,1,[zm,Xe(Dd,new W(null,2,5,X,[Cs,new u(null,1,[om,a],null)],null),b)],null):new u(null,1,[$i,new W(null,1,5,X,[new u(null,2,[Zj,fm,Oj,a],null)],null)],null)});var Ds=function Ds(a){for(var c=[],d=arguments.length,e=0;;)if(e<d)c.push(arguments[e]),e+=1;else break;return Ds.l(arguments[0],1<c.length?new H(c.slice(1),0,null):null)};
+Ds.l=function(a,b){a=null!=a&&(a.m&64||t===a.U)?We(oh,a):a;a=F.f(a,om);return w(a)?K(b):Bd(b)};Ds.G=1;Ds.F=function(a){var b=K(a);a=L(a);return this.l(b,a)};Di(ys,pk,function(a,b){T(b,0);a=T(b,1);var c=T(b,2);b=T(b,3);return a instanceof D?new u(null,1,[zm,Xe(Dd,new W(null,2,5,X,[Ds,new u(null,1,[om,a],null)],null),new Fd(null,c,new Fd(null,b,null,1,null),2,null))],null):new u(null,1,[$i,new W(null,1,5,X,[new u(null,2,[Zj,fm,Oj,a],null)],null)],null)});
+Di(ys,Bi,function(a,b){return new u(null,1,[$i,new W(null,1,5,X,[new u(null,3,[Zj,wj,il,a,bj,b],null)],null)],null)});function Es(a){var b=of(null);return uh.l(S([new u(null,1,[zm,function(){try{var c=Z;if(w(w(a)?""!==a:a)){var d=new vp(a,P(a));a:{var e=Array(1);if($d(null))for(var f=0,h=G(null);;)if(h&&1>f){e[f]=K(h);var k=f+1,l=L(h);f=k;h=l}else{var m=e;break a}else{for(f=0;;)if(1>f)e[f]=null,f+=1;else break;m=e}}var n=new wp(d,m);var q=null!=c&&(c.m&64||t===c.U)?We(oh,c):c,r=F.h(q,Vl,lm);var v=wq(n,M.f(r,lm),r,null,q,Me(Ed))}else v=null;return v}catch(y){return c=y instanceof Ei?y.zc:null,c=uh.l(S([y instanceof
+Ei?y.data:null,new u(null,1,[vm,y instanceof Error?y.message:null],null),w(c)?new u(null,1,[fj,c],null):null])),qf.h(b,Dd,c),null}}()],null),function(){var a=C(b);return w(a)?new u(null,1,[$i,a],null):null}()]))}var Fs=new Bh(null,new u(null,1,[fb,null],null),null),Gs=new Bh(null,new u(null,6,["queries",null,"i18n",null,"views",null,"styles",null,"events",null,"hooks",null],null),null);
+function Hs(a,b){var c=null!=a&&(a.m&64||t===a.U)?We(oh,a):a,d=F.f(c,Sj),e=Eh(yf(hf.f(Qd,Be),b)),f=kn.f(e,Fs),h=kn.f(Eh(b),e),k=Eh(rf.f(Be,h));b=kn.f(k,Gs);a=kn.f(Eh(yf(function(){return function(a){return M.f("hooks",Be(a))}}(e,f,h,k,b,a,c,d),h)),rf.f(sh,d));f=G(f)?U.l(null,Zj,sm,S([Oj,f])):null;f=G(b)?U.l(f,Zj,qj,S([Oj,b])):f;return G(a)?U.l(f,Zj,Bk,S([Oj,a])):f}function Is(a,b){return Hf(a,$i,Pe,b)}function Js(a,b){return G(b)?Is(a,b):a}
+function Ks(a,b){return sb(function(b,d){d=Ls.f?Ls.f(a,d):Ls.call(null,a,d);var c=null!=d&&(d.m&64||t===d.U)?We(oh,d):d;d=F.f(c,zm);c=F.f(c,$i);return Js(Hf(b,zm,Dd,d),c)},new u(null,1,[zm,Ed],null),b)}
+function Ms(a,b){var c=null!=a&&(a.m&64||t===a.U)?We(oh,a):a,d=F.f(c,Tk);if(w(function(){var a=b instanceof D;return a?a:!0===b||!1===b||ce(b)||b instanceof za||"number"===typeof b||"string"===typeof b}()))return new u(null,1,[zm,b],null);if(Wd(b)){var e=G(b),f=K(e),h=L(e),k=K(h),l=L(h),m=Jd(f)?f:F.f(d,f),n=function(){var n=Ks(c,l);return Gf(n,zm,function(a,b,c,d,e,f,h,k,l,m,n){return function(a){return Xe(Dd,new W(null,2,5,X,[w(n)?n:f,l],null),a)}}(n,b,e,f,h,f,k,l,k,l,m,a,c,c,d))}();return null==
+m?Is(n,new W(null,1,5,X,[new u(null,2,[Zj,Ul,Oj,f],null)],null)):n}return null}var Ls=function Ls(a,b){if(ue(b)){b=ys.f?ys.f(a,b):ys.call(null,a,b);var d=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;b=F.f(d,zm);d=F.f(d,$i);return w(d)?new u(null,1,[$i,d],null):Ls.f?Ls.f(a,b):Ls.call(null,a,b)}return Ms(a,b)};
+if("undefined"===typeof Am||"undefined"===typeof lr||"undefined"===typeof Ns)var Ns=function(){var a=of(Z),b=of(Z),c=of(Z),d=of(Z),e=F.h(Z,Xl,pi());return new Ai(Wc.f("pluto.reader","parse-value"),function(){return function(a,b){return Be(b)}}(a,b,c,d,e),e,a,b,c,d)}();Di(Ns,"hooks",function(a,b,c){return c});Di(Ns,"views",function(a,b,c){return Ls(a,c)});Di(Ns,Bi,function(){return new u(null,1,[$i,new W(null,1,5,X,[new u(null,1,[Zj,ul],null)],null)],null)});
+function Os(a,b,c,d){if(w(Be(c))){a=Ns.h?Ns.h(a,c,d):Ns.call(null,a,c,d);d=null!=a&&(a.m&64||t===a.U)?We(oh,a):a;var e=F.f(d,zm),f=F.f(d,$i);return Js(Ef(b,new W(null,2,5,X,[zm,c],null),e),rf.f(function(){return function(a){return U.h(a,kj,c)}}(a,d,e,f),f))}return b}
+function Ps(a){var b=new u(null,3,[Tk,Em,Wk,new u(null,2,[$l,new Bh(null,new u(null,1,[Fk,null],null),null),Kj,Dh],null),Sj,new u(null,1,[Vj,new u(null,2,[lk,Dh,Zj,wm],null)],null)],null),c=Hs(b,wg(a));return Js(je(function(){return function(a,c,f){return Os(b,a,c,f)}}(c),Z,a),c)};var Qs=function Qs(a,b,c){if(null!=a&&null!=a.Hc)return a.Hc(a,b,c);var e=Qs[p(null==a?null:a)];if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);e=Qs._;if(null!=e)return e.h?e.h(a,b,c):e.call(null,a,b,c);throw z("Storage.fetch",a);};function Rs(a){return new u(null,2,[ol,rl.c(a),Jj,Al.c(a)],null)}function Ss(a){return/^[\s\xa0]*$/.test(null==a?"":String(a))?null:rf.f(Rs,gl.c(K(Hk.c(mi(JSON.parse(a))))))}function Ts(a){return new Promise(function(b,c){var d=new XMLHttpRequest;d.open("GET",a,!0);d.timeout=2E3;d.ontimeout=function(){return function(){return c.c?c.c(Ql):c.call(null,Ql)}}(d);d.send(null);return d.onload=function(a){return function(){var c=a.responseText;return b.c?b.c(c):b.call(null,c)}}(d)})}
+function Us(a,b){return Ts([B.c(a),"/api/v0/ls?arg\x3d",B.c(b)].join(""))}function Vs(a,b){return Ts([B.c(a),"/api/v0/cat?arg\x3d",B.c(ol.c(b))].join("")).then(function(a){return U.h(b,Ej,a)})}function Ws(a,b){b=Promise.all(ii(Cf(function(b){return Vs(a,b)},b)));return b.then(function(){return function(a){return mi(a)}}(b))}function Xs(a,b,c,d){this.bb=a;this.Sa=b;this.ca=c;this.B=d;this.m=2229667594;this.I=139264}g=Xs.prototype;
+g.Hc=function(a,b,c){return Us(this.bb,Oj.c(b)).then(Ss).then(jf.f(Ws,this.bb)).then(function(){return function(a){a=new u(null,2,[Zj,Sk,Oj,a],null);return c.c?c.c(a):c.call(null,a)}}(this),function(){return function(a){a=new u(null,2,[Zj,El,Oj,a],null);return c.c?c.c(a):c.call(null,a)}}(this))};g.R=function(a,b){return this.J(null,b,null)};g.J=function(a,b,c){switch(b instanceof V?b.Ka:null){case "gateway-url":return this.bb;default:return F.h(this.ca,b,c)}};
+g.M=function(a,b){return Qh(a,function(){return function(c){return Qh(a,Xh,""," ","",b,c)}}(this),"#pluto.storage.ipfs.IPFSStorage{",", ","}",b,Pe.f(new W(null,1,5,X,[new W(null,2,5,X,[tm,this.bb],null)],null),this.ca))};g.Pa=function(){return new pg(this,1,new W(null,1,5,X,[tm],null),w(this.ca)?Hc(this.ca):$e())};g.T=function(){return this.Sa};g.X=function(){return 1+P(this.ca)};
+g.L=function(){var a=this,b=this.B;if(null!=b)return b;var c=function(){return function(){return function(a){return-122252959^ed(a)}}(b,a)(a)}();return this.B=c};g.H=function(a,b){return null!=b&&this.constructor===b.constructor&&M.f(this.bb,b.bb)&&M.f(this.ca,b.ca)};g.Ib=function(a,b){return de(new Bh(null,new u(null,1,[tm,null],null),null),b)?Id.f(Zb(lf.f(Z,this),this.Sa),b):new Xs(this.bb,this.Sa,Ze(Id.f(this.ca,b)),null)};
+g.qa=function(a,b,c){return w(Ae.f?Ae.f(tm,b):Ae.call(null,tm,b))?new Xs(c,this.Sa,this.ca,null):new Xs(this.bb,this.Sa,U.h(this.ca,b,c),null)};g.O=function(){return G(Pe.f(new W(null,1,5,X,[new Xf(tm,this.bb)],null),this.ca))};g.V=function(a,b){return new Xs(this.bb,b,this.ca,this.B)};g.W=function(a,b){return Wd(b)?this.qa(null,Bb.f(b,0),Bb.f(b,1)):sb(zb,this,b)};function Ys(){}Ys.prototype.Hc=function(a,b,c){a=null!=b&&(b.m&64||t===b.U)?We(oh,b):b;var d=F.f(a,Oj),e=new XMLHttpRequest;e.open("GET",[B.c(d),"/extension.edn"].join(""),!0);e.send(null);return e.onreadystatechange=function(a){return function(){if(M.f(a.readyState,4)){var b=a.status;b=M.f(404,b)?new u(null,2,[Zj,El,Oj,b],null):new u(null,2,[Zj,Sk,Oj,new W(null,1,5,X,[new u(null,1,[Ej,a.responseText],null)],null)],null);return c.c?c.c(b):c.call(null,b)}return null}}(e,this,b,a,d)};var Zs={},$s=console.warn.bind(console),at=new u(null,1,[Ij,function(){function a(a){var c=null;if(0<arguments.length){c=0;for(var e=Array(arguments.length-0);c<e.length;)e[c]=arguments[c+0],++c;c=new H(e,0,null)}return b.call(this,c)}function b(a){return M.f("re-frame: overwriting",K(a))?null:We($s,a)}a.G=0;a.F=function(a){a=G(a);return b(a)};a.l=b;return a}()],null);
+if(!Qd(kn.f(Eh(wg(at)),Eh(wg(C(yr))))))throw Error("Assert failed: Unknown keys in new-loggers\n(empty? (difference (set (keys new-loggers)) (-\x3e (clojure.core/deref loggers) keys set)))");qf.h(yr,uh,at);if("undefined"===typeof Am||"undefined"===typeof Zs||"undefined"===typeof bt)var bt=setInterval(function(){var a=new W(null,2,5,X,[xl,0===Math.floor(2*Math.random())],null);return bs.c?bs.c(a):bs.call(null,a)},1E3);ws.f(xl,function(a,b){T(b,0);b=T(b,1);return U.h(a,xl,b)});
+us.f?us.f(Fk,xl):us.call(null,Fk,xl);
+function ct(a){return new W(null,3,5,X,[Dk,new W(null,2,5,X,[Dk,"Errors"],null),lf.f(new W(null,1,5,X,[ij],null),function(){return function d(a){return new Ee(null,function(){for(;;){var c=G(a);if(c){if(Xd(c)){var f=zc(c),h=P(f),k=Ie(h);a:for(var l=0;;)if(l<h){var m=Bb.f(f,l),n=null!=m&&(m.m&64||t===m.U)?We(oh,m):m;m=n;n=F.f(n,Zj);m=new W(null,2,5,X,[Mj,new W(null,3,5,X,[ym,new W(null,2,5,X,[sl,[B.c(n)].join("")],null),bi(S([Id.f(m,Zj)]))],null)],null);k.add(m);l+=1}else{f=!0;break a}return f?Ke(k.Ha(),
+d(Bc(c))):Ke(k.Ha(),null)}k=K(c);k=f=null!=k&&(k.m&64||t===k.U)?We(oh,k):k;f=F.f(f,Zj);return yd(new W(null,2,5,X,[Mj,new W(null,3,5,X,[ym,new W(null,2,5,X,[sl,[B.c(f)].join("")],null),bi(S([Id.f(k,Zj)]))],null)],null),d(Yc(c)))}return null}},null,null)}(a)}())],null)}
+function dt(a,b){var c=Om(a,":");a=T(c,0);c=T(c,1);if(w(M.f?M.f("url",a):M.call(null,"url",a)))a=new Ys;else if(w(M.f?M.f("ipfs",a):M.call(null,"ipfs",a)))a=new Xs("https://cors.io/?https://gateway.ipfs.io",null,null,null);else throw Error(["No matching clause: ",B.c(a)].join(""));return Qs(a,new u(null,1,[Oj,c],null),b)}
+ba("pluto.examples.load_and_render",function(a,b,c){ap(b);ap(c);return dt(a,function(a){a:{var d=null!=a&&(a.m&64||t===a.U)?We(oh,a):a;a=F.f(d,Zj);d=F.f(d,Oj);switch(a instanceof V?a.Ka:null){case "error":a=c.innerHTML=d;break a;default:a=Es(Ej.c(K(d))),a=null!=a&&(a.m&64||t===a.U)?We(oh,a):a,d=F.f(a,zm),F.f(a,$i),a=Ps(d),d=null!=a&&(a.m&64||t===a.U)?We(oh,a):a,a=F.f(d,zm),d=F.f(d,$i),w(d)&&(d=ct(d),dp(d,c)),d=X,a=null!=a&&(a.m&64||t===a.U)?We(oh,a):a,a=F.f(a,Nj),a=dp(new W(null,2,5,d,[Dk,a],null),
+b)}}return a})});
\ No newline at end of file
diff --git a/js/pluto/components/html.cljs.cache.json b/js/pluto/components/html.cljs.cache.json
new file mode 100644
index 0000000..54e2c3f
--- /dev/null
+++ b/js/pluto/components/html.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$pluto.components.html","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$view",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","~:line",3,"~:column",7,"~:end-line",3,"~:end-column",11,"~:arglists",["~#list",["~$quote",["^E",[["~$props","~$&","~$content"]]]]],"~:top-fn",["^ ","~:variadic",true,"~:max-fixed-arity",1,"~:method-params",[["^E",["^G","^H"]]],"^D",["^E",[["^G","~$&","^H"]]],"~:arglists-meta",["^E",[null]]]],"^5","~$pluto.components.html/view","^J",true,"^?","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","^C",11,"^I",["^ ","^J",true,"^K",1,"^L",[["^E",["^G","^H"]]],"^D",["^E",[["^G","~$&","^H"]]],"^M",["^E",[null]]],"^L",[["^E",["^G","^H"]]],"~:protocol-impl",null,"^M",["^E",[null]],"^A",1,"^@",3,"^B",3,"^K",1,"~:fn-var",true,"^D",["^E",[["^G","~$&","^H"]]]],"~$button",["^ ","^=",null,"^>",["^ ","^?","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","^@",6,"^A",7,"^B",6,"^C",13,"^D",["^E",["^F",["^E",[["^G","~$&","^H"]]]]],"^I",["^ ","^J",true,"^K",1,"^L",[["^E",["^G","^H"]]],"^D",["^E",[["^G","~$&","^H"]]],"^M",["^E",[null]]]],"^5","~$pluto.components.html/button","^J",true,"^?","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","^C",13,"^I",["^ ","^J",true,"^K",1,"^L",[["^E",["^G","^H"]]],"^D",["^E",[["^G","~$&","^H"]]],"^M",["^E",[null]]],"^L",[["^E",["^G","^H"]]],"^O",null,"^M",["^E",[null]],"^A",1,"^@",6,"^B",6,"^K",1,"^P",true,"^D",["^E",[["^G","~$&","^H"]]]],"~$text",["^ ","^=",null,"^>",["^ ","^?","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","^@",9,"^A",7,"^B",9,"^C",11,"^D",["^E",["^F",["^E",[["^G","~$&","^H"]]]]],"^I",["^ ","^J",true,"^K",1,"^L",[["^E",["^G","^H"]]],"^D",["^E",[["^G","~$&","^H"]]],"^M",["^E",[null]]]],"^5","~$pluto.components.html/text","^J",true,"^?","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","^C",11,"^I",["^ ","^J",true,"^K",1,"^L",[["^E",["^G","^H"]]],"^D",["^E",[["^G","~$&","^H"]]],"^M",["^E",[null]]],"^L",[["^E",["^G","^H"]]],"^O",null,"^M",["^E",[null]],"^A",1,"^@",9,"^B",9,"^K",1,"^P",true,"^D",["^E",[["^G","~$&","^H"]]]],"~$components",["^ ","^5","~$pluto.components.html/components","^?","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","^@",12,"^A",1,"^B",12,"^C",16,"^>",["^ ","^?","/home/julien/Documents/Projects/pluto/src/pluto/components/html.cljs","^@",12,"^A",6,"^B",12,"^C",16],"~:tag","~$cljs.core/IMap"]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^4",["^<","^S","~:button","^Q","~:div","~:span"]],"~:order",["^12","^11","^13","^<","^Q","^S"]],"~:doc",null]
\ No newline at end of file
diff --git a/js/pluto/components/html.js b/js/pluto/components/html.js
new file mode 100644
index 0000000..38c90a1
--- /dev/null
+++ b/js/pluto/components/html.js
@@ -0,0 +1,107 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.components.html');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+pluto.components.html.view = (function pluto$components$html$view(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___1167 = arguments.length;
+var i__4519__auto___1168 = (0);
+while(true){
+if((i__4519__auto___1168 < len__4518__auto___1167)){
+args__4521__auto__.push((arguments[i__4519__auto___1168]));
+
+var G__1169 = (i__4519__auto___1168 + (1));
+i__4519__auto___1168 = G__1169;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return pluto.components.html.view.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+pluto.components.html.view.cljs$core$IFn$_invoke$arity$variadic = (function (props,content){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$div,props], null),content);
+});
+
+pluto.components.html.view.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+pluto.components.html.view.cljs$lang$applyTo = (function (seq1165){
+var G__1166 = cljs.core.first(seq1165);
+var seq1165__$1 = cljs.core.next(seq1165);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1166,seq1165__$1);
+});
+
+pluto.components.html.button = (function pluto$components$html$button(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___1172 = arguments.length;
+var i__4519__auto___1173 = (0);
+while(true){
+if((i__4519__auto___1173 < len__4518__auto___1172)){
+args__4521__auto__.push((arguments[i__4519__auto___1173]));
+
+var G__1174 = (i__4519__auto___1173 + (1));
+i__4519__auto___1173 = G__1174;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return pluto.components.html.button.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+pluto.components.html.button.cljs$core$IFn$_invoke$arity$variadic = (function (props,content){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$button,props], null),content);
+});
+
+pluto.components.html.button.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+pluto.components.html.button.cljs$lang$applyTo = (function (seq1170){
+var G__1171 = cljs.core.first(seq1170);
+var seq1170__$1 = cljs.core.next(seq1170);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1171,seq1170__$1);
+});
+
+pluto.components.html.text = (function pluto$components$html$text(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___1177 = arguments.length;
+var i__4519__auto___1178 = (0);
+while(true){
+if((i__4519__auto___1178 < len__4518__auto___1177)){
+args__4521__auto__.push((arguments[i__4519__auto___1178]));
+
+var G__1179 = (i__4519__auto___1178 + (1));
+i__4519__auto___1178 = G__1179;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return pluto.components.html.text.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+pluto.components.html.text.cljs$core$IFn$_invoke$arity$variadic = (function (props,content){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$span,props], null),content);
+});
+
+pluto.components.html.text.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+pluto.components.html.text.cljs$lang$applyTo = (function (seq1175){
+var G__1176 = cljs.core.first(seq1175);
+var seq1175__$1 = cljs.core.next(seq1175);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1176,seq1175__$1);
+});
+
+pluto.components.html.components = new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$sym$view,pluto.components.html.view,cljs.core.cst$sym$button,pluto.components.html.button,cljs.core.cst$sym$text,pluto.components.html.text], null);
diff --git a/js/pluto/examples.cljs.cache.json b/js/pluto/examples.cljs.cache.json
new file mode 100644
index 0000000..6154f2a
--- /dev/null
+++ b/js/pluto/examples.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$console",["^ ","~$warn",["^ ","~$bind",["^ "]]],"~$setInterval",["^ "],"~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$pluto.examples","~:imports",null,"~:requires",["^ ","~$reagent","~$reagent.core","~$pluto.components.html","^A","~$dom","~$reagent.dom","~$html","^A","^@","^@","~$pluto.reader","^E","~$pluto.storage.ipfs","^F","~$pluto.storage","^G","~$re-frame.loggers","^H","~$string","~$clojure.string","~$ipfs","^F","^J","^J","~$reader","^E","~$re-frame","~$re-frame.core","~$storage","^G","~$http","~$pluto.storage.http","^N","^N","^C","^C","^Q","^Q"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$fetch",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","~:line",54,"~:column",7,"~:end-line",54,"~:end-column",12,"~:arglists",["~#list",["~$quote",["^12",[["~$uri","~$cb"]]]]]],"^;","~$pluto.examples/fetch","~:variadic",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",12,"~:method-params",["^12",[["^14","^15"]]],"~:protocol-impl",null,"~:arglists-meta",["^12",[null,null]],"^Z",1,"^Y",54,"^[",54,"~:max-fixed-arity",2,"~:fn-var",true,"^11",["^12",["^13",["^12",[["^14","^15"]]]]]],"~$errors-list",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",41,"^Z",7,"^[",41,"^10",18,"^11",["^12",["^13",["^12",[["~$v"]]]]]],"^;","~$pluto.examples/errors-list","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",18,"^18",["^12",[["~$v"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",41,"^[",41,"^1;",1,"^1<",true,"^11",["^12",["^13",["^12",[["~$v"]]]]]],"~$main-hook",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",34,"^Z",7,"^[",34,"^10",16,"^11",["^12",["^13",["^12",[["~$m"]]]]],"~:doc","A simple hook for :hooks/main"],"^;","~$pluto.examples/main-hook","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",16,"^18",["^12",[["~$m"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",34,"^[",34,"^1;",1,"^1<",true,"^11",["^12",["^13",["^12",[["~$m"]]]]],"^1@","A simple hook for :hooks/main"],"~$render-extension",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",70,"^Z",7,"^[",70,"^10",23,"^11",["^12",["^13",["^12",[["~$m","~$el","~$el-errors"]]]]]],"^;","~$pluto.examples/render-extension","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",23,"^18",["^12",[["~$m","^1C","^1D"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",70,"^[",70,"^1;",3,"^1<",true,"^11",["^12",["^13",["^12",[["~$m","^1C","^1D"]]]]]],"~$load-and-render",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",85,"^Z",16,"^[",85,"^10",31,"~:export",true,"^11",["^12",["^13",["^12",[["~$s","^1C","^1D"]]]]]],"^;","~$pluto.examples/load-and-render","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",31,"^18",["^12",[["~$s","^1C","^1D"]]],"^19",null,"^1G",true,"^1:",["^12",[null,null]],"^Z",1,"^Y",85,"^[",85,"^1;",3,"^1<",true,"^11",["^12",["^13",["^12",[["~$s","^1C","^1D"]]]]]],"^4",["^ ","^;","~$pluto.examples/warn","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",13,"^Z",1,"^[",13,"^10",10,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",13,"^Z",6,"^[",13,"^10",10],"~:tag","~$js"],"~$read-extension",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",76,"^Z",7,"^[",76,"^10",21,"^11",["^12",["^13",["^12",[["~$o","^1C","^1D"]]]]]],"^;","~$pluto.examples/read-extension","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",21,"^18",["^12",[["~$o","^1C","^1D"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",76,"^[",76,"^1;",3,"^1<",true,"^11",["^12",["^13",["^12",[["~$o","^1C","^1D"]]]]]],"~$do-timer",["^ ","^;","~$pluto.examples/do-timer","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",20,"^Z",1,"^[",20,"^10",18,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",20,"^Z",10,"^[",20,"^10",18],"^1J","^1K"],"~$render",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",31,"^Z",7,"^[",31,"^10",13,"^11",["^12",["^13",["^12",[["~$h","^1C"]]]]]],"^;","~$pluto.examples/render","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",13,"^18",["^12",[["~$h","^1C"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",31,"^[",31,"^1;",2,"^1<",true,"^11",["^12",["^13",["^12",[["~$h","^1C"]]]]]],"~$storage-for",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",49,"^Z",7,"^[",49,"^10",18,"^11",["^12",["^13",["^12",[["~$type"]]]]]],"^;","~$pluto.examples/storage-for","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",18,"^18",["^12",[["^1S"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",49,"^[",49,"^1;",1,"^1<",true,"^11",["^12",["^13",["^12",[["^1S"]]]]]],"~$parse",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",60,"^Z",7,"^[",60,"^10",12,"^11",["^12",["^13",["^12",[["~$m"]]]]]],"^;","~$pluto.examples/parse","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",12,"^18",["^12",[["~$m"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",60,"^[",60,"^1;",1,"^1<",true,"^11",["^12",["^13",["^12",[["~$m"]]]]]],"~$render-result",["^ ","^V",null,"^W",["^ ","^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^Y",80,"^Z",7,"^[",80,"^10",20,"^11",["^12",["^13",["^12",[[["^ ","~:keys",["^1S","~$value"]],"^1C","^1D"]]]]]],"^;","~$pluto.examples/render-result","^17",false,"^X","/home/julien/Documents/Projects/pluto/examples/src/pluto/examples.cljs","^10",20,"^18",["^12",[["~$p__1340","^1C","^1D"]]],"^19",null,"^1:",["^12",[null,null]],"^Z",1,"^Y",80,"^[",80,"^1;",3,"^1<",true,"^11",["^12",["^13",["^12",[[["^ ","^1X",["^1S","^1Y"]],"^1C","^1D"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^?","^@","^@","^@"],"~:cljs.analyzer/constants",["^ ","~:seen",["^:",["~:errors","~:ul","~:else","~:content","~:warn","~:events","~:li","~:views/main","~:value","~:valid-hooks","~:hooks/main","~:type","~:extra-properties","~:div","~:random-boolean","~:components","~:capacities","~:b","~:random","~:queries","~:view","~:span","~:data"]],"~:order",["^28","^26","^2E","^2B","^2A","^2;","^25","^2?","^2:","^2H","~:b","^2<","^2C","^2D","^2=","^2F","^29","^2>","^2@","^2G","^2I","^24","^27"]],"^1@",null]
\ No newline at end of file
diff --git a/js/pluto/examples.js b/js/pluto/examples.js
new file mode 100644
index 0000000..c8bba1c
--- /dev/null
+++ b/js/pluto/examples.js
@@ -0,0 +1,189 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.examples');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.string');
+goog.require('pluto.components.html');
+goog.require('pluto.reader');
+goog.require('pluto.storage');
+goog.require('pluto.storage.http');
+goog.require('pluto.storage.ipfs');
+goog.require('reagent.core');
+goog.require('reagent.dom');
+goog.require('re_frame.core');
+goog.require('re_frame.loggers');
+pluto.examples.warn = console.warn.bind(console);
+re_frame.loggers.set_loggers_BANG_(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$warn,(function() { 
+var G__1307__delegate = function (args){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2("re-frame: overwriting",cljs.core.first(args))){
+return null;
+} else {
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(pluto.examples.warn,args);
+
+}
+};
+var G__1307 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__1308__i = 0, G__1308__a = new Array(arguments.length -  0);
+while (G__1308__i < G__1308__a.length) {G__1308__a[G__1308__i] = arguments[G__1308__i + 0]; ++G__1308__i;}
+  args = new cljs.core.IndexedSeq(G__1308__a,0,null);
+} 
+return G__1307__delegate.call(this,args);};
+G__1307.cljs$lang$maxFixedArity = 0;
+G__1307.cljs$lang$applyTo = (function (arglist__1309){
+var args = cljs.core.seq(arglist__1309);
+return G__1307__delegate(args);
+});
+G__1307.cljs$core$IFn$_invoke$arity$variadic = G__1307__delegate;
+return G__1307;
+})()
+], null));
+if((typeof pluto !== 'undefined') && (typeof pluto.examples !== 'undefined') && (typeof pluto.examples.do_timer !== 'undefined')){
+} else {
+pluto.examples.do_timer = setInterval((function (){
+var G__1310 = new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$random,(cljs.core.rand_int((2)) === (0))], null);
+return (re_frame.core.dispatch.cljs$core$IFn$_invoke$arity$1 ? re_frame.core.dispatch.cljs$core$IFn$_invoke$arity$1(G__1310) : re_frame.core.dispatch.call(null,G__1310));
+}),(1000));
+}
+re_frame.core.reg_event_db.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$random,(function (db,p__1311){
+var vec__1312 = p__1311;
+var _ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1312,(0),null);
+var b = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1312,(1),null);
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(db,cljs.core.cst$kw$random,b);
+}));
+var G__1315_1317 = cljs.core.cst$kw$random_DASH_boolean;
+var G__1316_1318 = cljs.core.cst$kw$random;
+(re_frame.core.reg_sub.cljs$core$IFn$_invoke$arity$2 ? re_frame.core.reg_sub.cljs$core$IFn$_invoke$arity$2(G__1315_1317,G__1316_1318) : re_frame.core.reg_sub.call(null,G__1315_1317,G__1316_1318));
+pluto.examples.render = (function pluto$examples$render(h,el){
+return reagent.core.render.cljs$core$IFn$_invoke$arity$2(h,el);
+});
+/**
+ * A simple hook for :hooks/main
+ */
+pluto.examples.main_hook = (function pluto$examples$main_hook(m){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$div,(function (){var map__1319 = m;
+var map__1319__$1 = ((((!((map__1319 == null)))?(((((map__1319.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1319.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1319):map__1319);
+var main = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1319__$1,cljs.core.cst$kw$views_SLASH_main);
+return main;
+})()], null);
+});
+pluto.examples.errors_list = (function pluto$examples$errors_list(v){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$div,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$div,"Errors"], null),cljs.core.into.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$ul], null),(function (){var iter__4311__auto__ = (function pluto$examples$errors_list_$_iter__1321(s__1322){
+return (new cljs.core.LazySeq(null,(function (){
+var s__1322__$1 = s__1322;
+while(true){
+var temp__5457__auto__ = cljs.core.seq(s__1322__$1);
+if(temp__5457__auto__){
+var s__1322__$2 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(s__1322__$2)){
+var c__4309__auto__ = cljs.core.chunk_first(s__1322__$2);
+var size__4310__auto__ = cljs.core.count(c__4309__auto__);
+var b__1324 = cljs.core.chunk_buffer(size__4310__auto__);
+if((function (){var i__1323 = (0);
+while(true){
+if((i__1323 < size__4310__auto__)){
+var map__1325 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c__4309__auto__,i__1323);
+var map__1325__$1 = ((((!((map__1325 == null)))?(((((map__1325.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1325.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1325):map__1325);
+var m = map__1325__$1;
+var type = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1325__$1,cljs.core.cst$kw$type);
+cljs.core.chunk_append(b__1324,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$li,new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$span,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$b,[cljs.core.str.cljs$core$IFn$_invoke$arity$1(type)].join('')], null),cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(m,cljs.core.cst$kw$type)], 0))], null)], null));
+
+var G__1329 = (i__1323 + (1));
+i__1323 = G__1329;
+continue;
+} else {
+return true;
+}
+break;
+}
+})()){
+return cljs.core.chunk_cons(cljs.core.chunk(b__1324),pluto$examples$errors_list_$_iter__1321(cljs.core.chunk_rest(s__1322__$2)));
+} else {
+return cljs.core.chunk_cons(cljs.core.chunk(b__1324),null);
+}
+} else {
+var map__1327 = cljs.core.first(s__1322__$2);
+var map__1327__$1 = ((((!((map__1327 == null)))?(((((map__1327.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1327.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1327):map__1327);
+var m = map__1327__$1;
+var type = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1327__$1,cljs.core.cst$kw$type);
+return cljs.core.cons(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$li,new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$span,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$b,[cljs.core.str.cljs$core$IFn$_invoke$arity$1(type)].join('')], null),cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(m,cljs.core.cst$kw$type)], 0))], null)], null),pluto$examples$errors_list_$_iter__1321(cljs.core.rest(s__1322__$2)));
+}
+} else {
+return null;
+}
+break;
+}
+}),null,null));
+});
+return iter__4311__auto__(v);
+})())], null);
+});
+pluto.examples.storage_for = (function pluto$examples$storage_for(type){
+var pred__1330 = cljs.core._EQ_;
+var expr__1331 = type;
+if(cljs.core.truth_((pred__1330.cljs$core$IFn$_invoke$arity$2 ? pred__1330.cljs$core$IFn$_invoke$arity$2("url",expr__1331) : pred__1330.call(null,"url",expr__1331)))){
+return (new pluto.storage.http.HTTPStorage());
+} else {
+if(cljs.core.truth_((pred__1330.cljs$core$IFn$_invoke$arity$2 ? pred__1330.cljs$core$IFn$_invoke$arity$2("ipfs",expr__1331) : pred__1330.call(null,"ipfs",expr__1331)))){
+return (new pluto.storage.ipfs.IPFSStorage("https://cors.io/?https://gateway.ipfs.io",null,null,null));
+} else {
+throw (new Error(["No matching clause: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(expr__1331)].join('')));
+}
+}
+});
+pluto.examples.fetch = (function pluto$examples$fetch(uri,cb){
+var vec__1333 = clojure.string.split.cljs$core$IFn$_invoke$arity$2(uri,":");
+var type = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1333,(0),null);
+var id = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1333,(1),null);
+return pluto.storage.fetch(pluto.examples.storage_for(type),new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,id], null),cb);
+});
+pluto.examples.parse = (function pluto$examples$parse(m){
+return pluto.reader.parse(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$components,pluto.components.html.components,cljs.core.cst$kw$capacities,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$queries,new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$random_DASH_boolean,null], null), null),cljs.core.cst$kw$events,cljs.core.PersistentHashSet.EMPTY], null),cljs.core.cst$kw$valid_DASH_hooks,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$hooks_SLASH_main,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$extra_DASH_properties,cljs.core.PersistentHashSet.EMPTY,cljs.core.cst$kw$type,cljs.core.cst$kw$view], null)], null)], null),m);
+});
+pluto.examples.render_extension = (function pluto$examples$render_extension(m,el,el_errors){
+var map__1336 = pluto.examples.parse(m);
+var map__1336__$1 = ((((!((map__1336 == null)))?(((((map__1336.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1336.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1336):map__1336);
+var data = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1336__$1,cljs.core.cst$kw$data);
+var errors = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1336__$1,cljs.core.cst$kw$errors);
+if(cljs.core.truth_(errors)){
+pluto.examples.render(pluto.examples.errors_list(errors),el_errors);
+} else {
+}
+
+return pluto.examples.render(pluto.examples.main_hook(data),el);
+});
+pluto.examples.read_extension = (function pluto$examples$read_extension(o,el,el_errors){
+var map__1338 = pluto.reader.read(cljs.core.cst$kw$content.cljs$core$IFn$_invoke$arity$1(cljs.core.first(o)));
+var map__1338__$1 = ((((!((map__1338 == null)))?(((((map__1338.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1338.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1338):map__1338);
+var data = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1338__$1,cljs.core.cst$kw$data);
+var errors = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1338__$1,cljs.core.cst$kw$errors);
+return pluto.examples.render_extension(data,el,el_errors);
+});
+pluto.examples.render_result = (function pluto$examples$render_result(p__1340,el,el_errors){
+var map__1341 = p__1340;
+var map__1341__$1 = ((((!((map__1341 == null)))?(((((map__1341.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1341.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1341):map__1341);
+var type = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1341__$1,cljs.core.cst$kw$type);
+var value = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1341__$1,cljs.core.cst$kw$value);
+var G__1343 = type;
+var G__1343__$1 = (((G__1343 instanceof cljs.core.Keyword))?G__1343.fqn:null);
+switch (G__1343__$1) {
+case "error":
+return el_errors.innerHTML = value;
+
+break;
+default:
+return pluto.examples.read_extension(value,el,el_errors);
+
+}
+});
+pluto.examples.load_and_render = (function pluto$examples$load_and_render(s,el,el_errors){
+reagent.dom.unmount_component_at_node(el);
+
+reagent.dom.unmount_component_at_node(el_errors);
+
+return pluto.examples.fetch(s,(function (p1__1345_SHARP_){
+return pluto.examples.render_result(p1__1345_SHARP_,el,el_errors);
+}));
+});
+goog.exportSymbol('pluto.examples.load_and_render', pluto.examples.load_and_render);
diff --git a/js/pluto/reader.cljc.cache.json b/js/pluto/reader.cljc.cache.json
new file mode 100644
index 0000000..932ae4c
--- /dev/null
+++ b/js/pluto/reader.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",["~$read"]],"~:name","~$pluto.reader","~:imports",null,"~:requires",["^ ","~$set","~$clojure.set","~$cljs.tools.reader","^<","^;","^;","~$clojure.tools.reader","^<","~$pluto.utils","^>","~$reference","~$pluto.reader.reference","~$pluto.reader.blocks","^A","~$utils","^>","~$reader","^<","^@","^@","~$blocks","^A"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$valid-namespaces",["^ ","^6","~$pluto.reader/valid-namespaces","~:file","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","~:line",58,"~:column",1,"~:end-line",58,"~:end-column",22,"~:meta",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",58,"^L",6,"^M",58,"^N",22],"~:tag","~$cljs.core/ISet"],"~$parse-value",["^ ","^6","~$pluto.reader/parse-value","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",110,"^L",1,"^M",110,"^N",22,"~:doc","Parse a definition element value.\n   Returns a map defining:\n    * :data the updated value\n    * :permissions \n    * :errors a collection of errors","^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",110,"^L",11,"^M",110,"^N",22,"^T","Parse a definition element value.\n   Returns a map defining:\n    * :data the updated value\n    * :permissions \n    * :errors a collection of errors"],"^P","~$cljs.core/MultiFn"],"~$parse-view",["^ ","~:protocol-inline",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",101,"^L",7,"^M",101,"^N",17,"~:arglists",["~#list",["~$quote",["^Y",[["~$opts","~$o"]]]]]],"^6","~$pluto.reader/parse-view","~:variadic",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",17,"~:method-params",["^Y",[["^[","~$o"]]],"~:protocol-impl",null,"~:arglists-meta",["^Y",[null,null]],"^L",1,"^K",101,"^M",101,"~:max-fixed-arity",2,"~:fn-var",true,"^X",["^Y",["^Z",["^Y",[["^[","~$o"]]]]]],"~$accumulate-reader-exception!",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",26,"^L",8,"^M",26,"^N",36,"~:private",true,"^X",["^Y",["^Z",["^Y",[["~$a","~$ex"]]]]]],"^18",true,"^6","~$pluto.reader/accumulate-reader-exception!","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",36,"^12",["^Y",[["~$a","^19"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",26,"^M",26,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["~$a","^19"]]]]]],"~$accumulate-reader-error!",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",23,"^L",8,"^M",23,"^N",32,"^18",true,"^X",["^Y",["^Z",["^Y",[["~$a","~$m"]]]]]],"^18",true,"^6","~$pluto.reader/accumulate-reader-error!","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",32,"^12",["^Y",[["~$a","~$m"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",23,"^M",23,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["~$a","~$m"]]]]]],"^5",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",32,"^L",7,"^M",32,"^N",11,"^X",["^Y",["^Z",["^Y",[["~$s"]]]]],"^T","Reads an extension definition as an EDN string. Valid tags are replaced by associated records.\n   All references (identified by tagged literals) are marked by records.\n   They reference keys in the definition map and are validated and replaced at parse time.\n  \n   No semantic validation is performed at this stage. \n\n   Returns a map defining:\n   * :data the extension definition as a map\n   * :errors a vector of errors map triggered during read"],"^6","~$pluto.reader/read","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",11,"^12",["^Y",[["~$s"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",32,"^M",32,"^15",1,"^16",true,"^X",["^Y",["^Z",["^Y",[["~$s"]]]]],"^T","Reads an extension definition as an EDN string. Valid tags are replaced by associated records.\n   All references (identified by tagged literals) are marked by records.\n   They reference keys in the definition map and are validated and replaced at parse time.\n  \n   No semantic validation is performed at this stage. \n\n   Returns a map defining:\n   * :data the extension definition as a map\n   * :errors a vector of errors map triggered during read"],"~$accumulate-errors",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",72,"^L",7,"^M",72,"^N",24,"^X",["^Y",["^Z",["^Y",[["~$m","~$s"]]]]]],"^6","~$pluto.reader/accumulate-errors","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",24,"^12",["^Y",[["~$m","~$s"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",72,"^M",72,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["~$m","~$s"]]]]]],"~$valid-extension-keys",["^ ","^6","~$pluto.reader/valid-extension-keys","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",57,"^L",1,"^M",57,"^N",26,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",57,"^L",6,"^M",57,"^N",26],"^P","^Q"],"~$parse-hiccup-element",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",87,"^L",7,"^M",87,"^N",27,"^X",["^Y",["^Z",["^Y",[[["^ ","~:keys",["~$components"],"~:as","^["],"~$o"]]]]]],"^6","~$pluto.reader/parse-hiccup-element","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",27,"^12",["^Y",[["~$p__1258","~$o"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",87,"^M",87,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[[["^ ","^1C",["^1D"],"^1E","^["],"~$o"]]]]]],"~$parse",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",139,"^L",7,"^M",139,"^N",12,"^X",["^Y",["^Z",["^Y",[["^[","~$m"]]]]],"^T","Parse an extension definition map as encapsulated in :data key of the map returned by read.\n   `opts` is a map defining:\n   * `valid-hooks` a map of valid hook definitions\n  \n   Returns a map defining:\n   * :data a map\n   * :permissions a vector of required permissions\n   * :errors a vector of errors maps triggered during parse"],"^6","~$pluto.reader/parse","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",12,"^12",["^Y",[["^[","~$m"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",139,"^M",139,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["^[","~$m"]]]]],"^T","Parse an extension definition map as encapsulated in :data key of the map returned by read.\n   `opts` is a map defining:\n   * `valid-hooks` a map of valid hook definitions\n  \n   Returns a map defining:\n   * :data a map\n   * :permissions a vector of required permissions\n   * :errors a vector of errors maps triggered during parse"],"~$merge-parsed-value",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",125,"^L",7,"^M",125,"^N",25,"^X",["^Y",["^Z",["^Y",[["^[","~$m","~$k","~$v"]]]]],"^T","Merge result of parse-value into a map.\n   :data is updated to its parsed value\n   :errors are accumulated"],"^6","~$pluto.reader/merge-parsed-value","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",25,"^12",["^Y",[["^[","~$m","~$k","~$v"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",125,"^M",125,"^15",4,"^16",true,"^X",["^Y",["^Z",["^Y",[["^[","~$m","~$k","~$v"]]]]],"^T","Merge result of parse-value into a map.\n   :data is updated to its parsed value\n   :errors are accumulated"],"~$parse-hiccup-children",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",81,"^L",7,"^M",81,"^N",28,"^X",["^Y",["^Z",["^Y",[["^[","~$children"]]]]]],"^6","~$pluto.reader/parse-hiccup-children","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",28,"^12",["^Y",[["^[","^1M"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",81,"^M",81,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["^[","^1M"]]]]]],"~$merge-errors",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",75,"^L",7,"^M",75,"^N",19,"^X",["^Y",["^Z",["^Y",[["~$m","~$errors"]]]]]],"^6","~$pluto.reader/merge-errors","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",19,"^12",["^Y",[["~$m","^1P"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",75,"^M",75,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["~$m","^1P"]]]]]],"~$validate-keys",["^ ","^W",null,"^O",["^ ","^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^K",60,"^L",7,"^M",60,"^N",20,"^X",["^Y",["^Z",["^Y",[[["^ ","^1C",["~$valid-hooks"]],"~$s"]]]]]],"^6","~$pluto.reader/validate-keys","^11",false,"^J","/home/julien/Documents/Projects/pluto/src/pluto/reader.cljc","^N",20,"^12",["^Y",[["~$p__1248","~$s"]]],"^13",null,"^14",["^Y",[null,null]],"^L",1,"^K",60,"^M",60,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[[["^ ","^1C",["^1S"]],"~$s"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^4",["~:errors","~:cause","^O","~:key","~:else","~:invalid-namespaces","~:default","~:value","~:valid-hooks","~:type","~:invalid-hooks","~:components","~:unknown-key","~:unknown-component","~:hierarchy","~:invalid-extension-keys","~:message","~:data"]],"~:order",["^2=","^1[","^2>","^1Z","^O","^25","^26","^2<","^24","^22","^27","^28","^2:","^21","^2;","^23","^29","^20"]],"^T","Overall idea\n   Read time: string to data structure, only tags are replaced by records\n   Parse time: validate all the things, produce hiccup than can be used as is\n   # Read\n     * tags are used as reference to other elements (views, events, queries). At read time they are replaced by records,\n       at parse time they are translated to point to concrete elements (error if non existent).\n       How this translation is done is type dependent (reagent component ref, subscribe call, dispatch, ..)\n   # Parse\n     * properties/children are defined as symbol only, can be defined in element having fn semantic (view, event, ..), are unified at parse time\n     * conditionals are defined as list with symbol as first element. Replaced at parse time by references to corresponding reagent component\n     * let (lexical scoping). No shadowing support (error). Resolve in local scope then delegate to :outer (chain collected from parents)\n     * permissions required are accumulated at parse time\n   # Activate\n    * based on hooks, inject views / trigger events"]
\ No newline at end of file
diff --git a/js/pluto/reader.js b/js/pluto/reader.js
new file mode 100644
index 0000000..b667078
--- /dev/null
+++ b/js/pluto/reader.js
@@ -0,0 +1,226 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.reader');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.set');
+goog.require('cljs.tools.reader');
+goog.require('pluto.reader.blocks');
+goog.require('pluto.reader.reference');
+goog.require('pluto.utils');
+pluto.reader.accumulate_reader_error_BANG_ = (function pluto$reader$accumulate_reader_error_BANG_(a,m){
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(a,cljs.core.conj,m);
+});
+pluto.reader.accumulate_reader_exception_BANG_ = (function pluto$reader$accumulate_reader_exception_BANG_(a,ex){
+return pluto.reader.accumulate_reader_error_BANG_(a,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.ex_data(ex),new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$message,pluto.utils.ex_message(ex)], null),(function (){var temp__5457__auto__ = pluto.utils.ex_cause(ex);
+if(cljs.core.truth_(temp__5457__auto__)){
+var c = temp__5457__auto__;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cause,c], null);
+} else {
+return null;
+}
+})()], 0)));
+});
+/**
+ * Reads an extension definition as an EDN string. Valid tags are replaced by associated records.
+ * All references (identified by tagged literals) are marked by records.
+ * They reference keys in the definition map and are validated and replaced at parse time.
+ *   
+ * No semantic validation is performed at this stage. 
+ * 
+ * Returns a map defining:
+ * * :data the extension definition as a map
+ * * :errors a vector of errors map triggered during read
+ */
+pluto.reader.read = (function pluto$reader$read(s){
+var errors = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(null);
+return cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$data,(function (){try{return cljs.tools.reader.read_string.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,s);
+}catch (e1246){var e = e1246;
+pluto.reader.accumulate_reader_exception_BANG_(errors,e);
+
+return null;
+}})()], null),(function (){var temp__5457__auto__ = cljs.core.deref(errors);
+if(cljs.core.truth_(temp__5457__auto__)){
+var v = temp__5457__auto__;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,v], null);
+} else {
+return null;
+}
+})()], 0));
+});
+pluto.reader.valid_extension_keys = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$meta,null], null), null);
+pluto.reader.valid_namespaces = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 6, ["queries",null,"i18n",null,"views",null,"styles",null,"events",null,"hooks",null], null), null);
+pluto.reader.validate_keys = (function pluto$reader$validate_keys(p__1248,s){
+var map__1249 = p__1248;
+var map__1249__$1 = ((((!((map__1249 == null)))?(((((map__1249.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1249.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1249):map__1249);
+var valid_hooks = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1249__$1,cljs.core.cst$kw$valid_DASH_hooks);
+var keys = cljs.core.set(cljs.core.filter.cljs$core$IFn$_invoke$arity$2(cljs.core.comp.cljs$core$IFn$_invoke$arity$2(cljs.core.empty_QMARK_,cljs.core.namespace),s));
+var extra_extension_keys = clojure.set.difference.cljs$core$IFn$_invoke$arity$2(keys,pluto.reader.valid_extension_keys);
+var keys_with_ns = clojure.set.difference.cljs$core$IFn$_invoke$arity$2(cljs.core.set(s),keys);
+var namespaces = cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.namespace,keys_with_ns));
+var extra_namespaces = clojure.set.difference.cljs$core$IFn$_invoke$arity$2(namespaces,pluto.reader.valid_namespaces);
+var hooks_keys = clojure.set.difference.cljs$core$IFn$_invoke$arity$2(cljs.core.set(cljs.core.filter.cljs$core$IFn$_invoke$arity$2(((function (keys,extra_extension_keys,keys_with_ns,namespaces,extra_namespaces,map__1249,map__1249__$1,valid_hooks){
+return (function (p1__1247_SHARP_){
+return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2("hooks",cljs.core.namespace(p1__1247_SHARP_));
+});})(keys,extra_extension_keys,keys_with_ns,namespaces,extra_namespaces,map__1249,map__1249__$1,valid_hooks))
+,keys_with_ns)),cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.key,valid_hooks));
+var G__1251 = null;
+var G__1251__$1 = ((cljs.core.seq(extra_extension_keys))?cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(G__1251,cljs.core.cst$kw$type,cljs.core.cst$kw$invalid_DASH_extension_DASH_keys,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$value,extra_extension_keys], 0)):G__1251);
+var G__1251__$2 = ((cljs.core.seq(extra_namespaces))?cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(G__1251__$1,cljs.core.cst$kw$type,cljs.core.cst$kw$invalid_DASH_namespaces,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$value,extra_namespaces], 0)):G__1251__$1);
+if(cljs.core.seq(hooks_keys)){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(G__1251__$2,cljs.core.cst$kw$type,cljs.core.cst$kw$invalid_DASH_hooks,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$value,hooks_keys], 0));
+} else {
+return G__1251__$2;
+}
+});
+pluto.reader.accumulate_errors = (function pluto$reader$accumulate_errors(m,s){
+return cljs.core.update.cljs$core$IFn$_invoke$arity$4(m,cljs.core.cst$kw$errors,cljs.core.concat,s);
+});
+pluto.reader.merge_errors = (function pluto$reader$merge_errors(m,errors){
+var G__1252 = m;
+if(cljs.core.seq(errors)){
+return pluto.reader.accumulate_errors(G__1252,errors);
+} else {
+return G__1252;
+}
+});
+pluto.reader.parse_hiccup_children = (function pluto$reader$parse_hiccup_children(opts,children){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__1254_SHARP_,p2__1253_SHARP_){
+var map__1255 = (pluto.reader.parse_view.cljs$core$IFn$_invoke$arity$2 ? pluto.reader.parse_view.cljs$core$IFn$_invoke$arity$2(opts,p2__1253_SHARP_) : pluto.reader.parse_view.call(null,opts,p2__1253_SHARP_));
+var map__1255__$1 = ((((!((map__1255 == null)))?(((((map__1255.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1255.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1255):map__1255);
+var data = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1255__$1,cljs.core.cst$kw$data);
+var errors = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1255__$1,cljs.core.cst$kw$errors);
+return pluto.reader.merge_errors(cljs.core.update.cljs$core$IFn$_invoke$arity$4(p1__1254_SHARP_,cljs.core.cst$kw$data,cljs.core.conj,data),errors);
+}),new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$data,cljs.core.PersistentVector.EMPTY], null),children);
+});
+pluto.reader.parse_hiccup_element = (function pluto$reader$parse_hiccup_element(p__1258,o){
+var map__1259 = p__1258;
+var map__1259__$1 = ((((!((map__1259 == null)))?(((((map__1259.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1259.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1259):map__1259);
+var opts = map__1259__$1;
+var components = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1259__$1,cljs.core.cst$kw$components);
+if(cljs.core.truth_((function (){var or__3936__auto__ = (o instanceof cljs.core.Symbol);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return pluto.utils.primitive_QMARK_(o);
+}
+})())){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$data,o], null);
+} else {
+if(cljs.core.vector_QMARK_(o)){
+var vec__1261 = o;
+var seq__1262 = cljs.core.seq(vec__1261);
+var first__1263 = cljs.core.first(seq__1262);
+var seq__1262__$1 = cljs.core.next(seq__1262);
+var element = first__1263;
+var first__1263__$1 = cljs.core.first(seq__1262__$1);
+var seq__1262__$2 = cljs.core.next(seq__1262__$1);
+var properties = first__1263__$1;
+var children = seq__1262__$2;
+var component = ((cljs.core.fn_QMARK_(element))?element:cljs.core.get.cljs$core$IFn$_invoke$arity$2(components,element));
+var G__1264 = (function (){var m = pluto.reader.parse_hiccup_children(opts,children);
+return cljs.core.update.cljs$core$IFn$_invoke$arity$3(m,cljs.core.cst$kw$data,((function (m,vec__1261,seq__1262,first__1263,seq__1262__$1,element,first__1263__$1,seq__1262__$2,properties,children,component,map__1259,map__1259__$1,opts,components){
+return (function (p1__1257_SHARP_){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [(function (){var or__3936__auto__ = component;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return element;
+}
+})(),properties], null),p1__1257_SHARP_);
+});})(m,vec__1261,seq__1262,first__1263,seq__1262__$1,element,first__1263__$1,seq__1262__$2,properties,children,component,map__1259,map__1259__$1,opts,components))
+);
+})();
+if((component == null)){
+return pluto.reader.accumulate_errors(G__1264,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$unknown_DASH_component,cljs.core.cst$kw$value,element], null)], null));
+} else {
+return G__1264;
+}
+} else {
+return null;
+}
+}
+});
+pluto.reader.parse_view = (function pluto$reader$parse_view(opts,o){
+if(cljs.core.list_QMARK_(o)){
+var map__1265 = (pluto.reader.blocks.parse.cljs$core$IFn$_invoke$arity$2 ? pluto.reader.blocks.parse.cljs$core$IFn$_invoke$arity$2(opts,o) : pluto.reader.blocks.parse.call(null,opts,o));
+var map__1265__$1 = ((((!((map__1265 == null)))?(((((map__1265.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1265.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1265):map__1265);
+var data = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1265__$1,cljs.core.cst$kw$data);
+var errors = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1265__$1,cljs.core.cst$kw$errors);
+if(cljs.core.truth_(errors)){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,errors], null);
+} else {
+return (pluto.reader.parse_view.cljs$core$IFn$_invoke$arity$2 ? pluto.reader.parse_view.cljs$core$IFn$_invoke$arity$2(opts,data) : pluto.reader.parse_view.call(null,opts,data));
+}
+} else {
+return pluto.reader.parse_hiccup_element(opts,o);
+
+}
+});
+if((typeof pluto !== 'undefined') && (typeof pluto.reader !== 'undefined') && (typeof pluto.reader.parse_value !== 'undefined')){
+} else {
+/**
+ * Parse a definition element value.
+ * Returns a map defining:
+ *  * :data the updated value
+ *  * :permissions 
+ *  * :errors a collection of errors
+ */
+pluto.reader.parse_value = (function (){var method_table__4401__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var prefer_table__4402__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var method_cache__4403__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var cached_hierarchy__4404__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var hierarchy__4405__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$3(cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$hierarchy,cljs.core.get_global_hierarchy());
+return (new cljs.core.MultiFn(cljs.core.symbol.cljs$core$IFn$_invoke$arity$2("pluto.reader","parse-value"),((function (method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__,hierarchy__4405__auto__){
+return (function (_,k,___$1){
+return cljs.core.namespace(k);
+});})(method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__,hierarchy__4405__auto__))
+,cljs.core.cst$kw$default,hierarchy__4405__auto__,method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__));
+})();
+}
+pluto.reader.parse_value.cljs$core$IMultiFn$_add_method$arity$3(null,"hooks",(function (_,___$1,v){
+return v;
+}));
+pluto.reader.parse_value.cljs$core$IMultiFn$_add_method$arity$3(null,"views",(function (opts,_,v){
+return pluto.reader.parse_view(opts,v);
+}));
+pluto.reader.parse_value.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$default,(function (_,___$1,___$2){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$type,cljs.core.cst$kw$unknown_DASH_key], null)], null)], null);
+}));
+/**
+ * Merge result of parse-value into a map.
+ * :data is updated to its parsed value
+ * :errors are accumulated
+ */
+pluto.reader.merge_parsed_value = (function pluto$reader$merge_parsed_value(opts,m,k,v){
+if(cljs.core.truth_(cljs.core.namespace(k))){
+var map__1268 = (pluto.reader.parse_value.cljs$core$IFn$_invoke$arity$3 ? pluto.reader.parse_value.cljs$core$IFn$_invoke$arity$3(opts,k,v) : pluto.reader.parse_value.call(null,opts,k,v));
+var map__1268__$1 = ((((!((map__1268 == null)))?(((((map__1268.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1268.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1268):map__1268);
+var data = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1268__$1,cljs.core.cst$kw$data);
+var errors = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1268__$1,cljs.core.cst$kw$errors);
+return pluto.reader.merge_errors(cljs.core.assoc_in(m,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$data,k], null),data),cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (map__1268,map__1268__$1,data,errors){
+return (function (p1__1267_SHARP_){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(p1__1267_SHARP_,cljs.core.cst$kw$key,k);
+});})(map__1268,map__1268__$1,data,errors))
+,errors));
+} else {
+return m;
+}
+});
+/**
+ * Parse an extension definition map as encapsulated in :data key of the map returned by read.
+ * `opts` is a map defining:
+ * * `valid-hooks` a map of valid hook definitions
+ *   
+ * Returns a map defining:
+ * * :data a map
+ * * :permissions a vector of required permissions
+ * * :errors a vector of errors maps triggered during parse
+ */
+pluto.reader.parse = (function pluto$reader$parse(opts,m){
+var errors = pluto.reader.validate_keys(opts,cljs.core.keys(m));
+return pluto.reader.merge_errors(cljs.core.reduce_kv(((function (errors){
+return (function (p1__1270_SHARP_,p2__1271_SHARP_,p3__1272_SHARP_){
+return pluto.reader.merge_parsed_value(opts,p1__1270_SHARP_,p2__1271_SHARP_,p3__1272_SHARP_);
+});})(errors))
+,cljs.core.PersistentArrayMap.EMPTY,m),errors);
+});
diff --git a/js/pluto/reader/blocks.cljc.cache.json b/js/pluto/reader/blocks.cljc.cache.json
new file mode 100644
index 0000000..ff69de5
--- /dev/null
+++ b/js/pluto/reader/blocks.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$pluto.reader.blocks","~:imports",null,"~:requires",["^ ","~$walk","~$clojure.walk","^:","^:","~$reference","~$pluto.reader.reference","^<","^<","~$re-frame","~$re-frame.core","^>","^>"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$parse",["^ ","^5","~$pluto.reader.blocks/parse","~:file","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","~:line",6,"~:column",1,"~:end-line",6,"~:end-column",16,"~:doc","","~:meta",["^ ","^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^E",6,"^F",11,"^G",6,"^H",16,"^I",""],"~:tag","~$cljs.core/MultiFn"],"~$resolve-query",["^ ","~:protocol-inline",null,"^J",["^ ","^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^E",10,"^F",7,"^G",10,"^H",20,"~:arglists",["~#list",["~$quote",["^P",[["~$o"]]]]]],"^5","~$pluto.reader.blocks/resolve-query","~:variadic",false,"^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^H",20,"~:method-params",["^P",[["~$o"]]],"~:protocol-impl",null,"~:arglists-meta",["^P",[null,null]],"^F",1,"^E",10,"^G",10,"~:max-fixed-arity",1,"~:fn-var",true,"^O",["^P",["^Q",["^P",[["~$o"]]]]]],"~$resolve-queries",["^ ","^N",null,"^J",["^ ","^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^E",15,"^F",7,"^G",15,"^H",22,"^O",["^P",["^Q",["^P",[["~$env"]]]]]],"^5","~$pluto.reader.blocks/resolve-queries","^S",false,"^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^H",22,"^T",["^P",[["^Z"]]],"^U",null,"^V",["^P",[null,null]],"^F",1,"^E",15,"^G",15,"^W",1,"^X",true,"^O",["^P",["^Q",["^P",[["^Z"]]]]]],"~$let-block",["^ ","^N",null,"^J",["^ ","^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^E",20,"^F",7,"^G",20,"^H",16,"^O",["^P",["^Q",["^P",[[["^ ","~:keys",["^Z"]],"~$child"]]]]]],"^5","~$pluto.reader.blocks/let-block","^S",false,"^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^H",16,"^T",["^P",[["~$p__1218","^12"]]],"^U",null,"^V",["^P",[null,null]],"^F",1,"^E",20,"^G",20,"^W",2,"^X",true,"^O",["^P",["^Q",["^P",[[["^ ","^11",["^Z"]],"^12"]]]]]],"~$bindings->env",["^ ","^N",null,"^J",["^ ","^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^E",24,"^F",7,"^G",24,"^H",20,"^O",["^P",["^Q",["^P",[["~$v"]]]]]],"^5","~$pluto.reader.blocks/bindings->env","^S",false,"^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^H",20,"^T",["^P",[["~$v"]]],"^U",null,"^V",["^P",[null,null]],"^F",1,"^E",24,"^G",24,"^W",1,"^X",true,"^O",["^P",["^Q",["^P",[["~$v"]]]]]],"~$when-block",["^ ","^N",null,"^J",["^ ","^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^E",37,"^F",7,"^G",37,"^H",17,"^O",["^P",["^Q",["^P",[[["^ ","^11",["~$test"]],"~$body"]]]]]],"^5","~$pluto.reader.blocks/when-block","^S",false,"^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^H",17,"^T",["^P",[["~$p__1225","^19"]]],"^U",null,"^V",["^P",[null,null]],"^F",1,"^E",37,"^G",37,"^W",2,"^X",true,"^O",["^P",["^Q",["^P",[[["^ ","^11",["^18"]],"^19"]]]]]],"~$if-block",["^ ","^N",null,"^J",["^ ","^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^E",49,"^F",7,"^G",49,"^H",15,"^O",["^P",["^Q",["^P",[[["^ ","^11",["^18"]],"~$&","^19"]]]]],"~:top-fn",["^ ","^S",true,"^W",1,"^T",[["^P",[["^ ","^11",["^18"]],"^19"]]],"^O",["^P",[[["^ ","^11",["^18"]],"~$&","^19"]]],"^V",["^P",[null]]]],"^5","~$pluto.reader.blocks/if-block","^S",true,"^D","/home/julien/Documents/Projects/pluto/src/pluto/reader/blocks.cljc","^H",15,"^1=",["^ ","^S",true,"^W",1,"^T",[["^P",[["^ ","^11",["^18"]],"^19"]]],"^O",["^P",[[["^ ","^11",["^18"]],"~$&","^19"]]],"^V",["^P",[null]]],"^T",[["^P",[["^ ","^11",["^18"]],"^19"]]],"^U",null,"^V",["^P",[null]],"^F",1,"^E",49,"^G",49,"^W",1,"^X",true,"^O",["^P",[[["^ ","^11",["^18"]],"~$&","^19"]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^4",["~:errors","~:block","~:else","~:unknown-block-type","~:default","~:value","~$let","~:type","~$when","~:env","~$if","~:opts","~:hierarchy","~:unsupported-type","~:test","~:data"]],"~:order",["^1O","^1G","^1L","^1I","^1R","^1Q","^1K","^1E","^1C","^1J","^1H","^1P","^1M","^1N","^1D","^1F"]],"^I",null]
\ No newline at end of file
diff --git a/js/pluto/reader/blocks.js b/js/pluto/reader/blocks.js
new file mode 100644
index 0000000..f5d45aa
--- /dev/null
+++ b/js/pluto/reader/blocks.js
@@ -0,0 +1,152 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.reader.blocks');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.walk');
+goog.require('pluto.reader.reference');
+goog.require('re_frame.core');
+if((typeof pluto !== 'undefined') && (typeof pluto.reader !== 'undefined') && (typeof pluto.reader.blocks !== 'undefined') && (typeof pluto.reader.blocks.parse !== 'undefined')){
+} else {
+/**
+ * 
+ */
+pluto.reader.blocks.parse = (function (){var method_table__4401__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var prefer_table__4402__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var method_cache__4403__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var cached_hierarchy__4404__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var hierarchy__4405__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$3(cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$hierarchy,cljs.core.get_global_hierarchy());
+return (new cljs.core.MultiFn(cljs.core.symbol.cljs$core$IFn$_invoke$arity$2("pluto.reader.blocks","parse"),((function (method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__,hierarchy__4405__auto__){
+return (function (_,p__1210){
+var vec__1211 = p__1210;
+var type = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1211,(0),null);
+return type;
+});})(method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__,hierarchy__4405__auto__))
+,cljs.core.cst$kw$default,hierarchy__4405__auto__,method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__));
+})();
+}
+pluto.reader.blocks.resolve_query = (function pluto$reader$blocks$resolve_query(o){
+if(cljs.core.truth_(pluto.reader.reference.reference_QMARK_(o))){
+return cljs.core.deref((function (){var G__1214 = new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(cljs.core.name(cljs.core.second(o)))], null);
+return (re_frame.core.subscribe.cljs$core$IFn$_invoke$arity$1 ? re_frame.core.subscribe.cljs$core$IFn$_invoke$arity$1(G__1214) : re_frame.core.subscribe.call(null,G__1214));
+})());
+} else {
+return null;
+}
+});
+pluto.reader.blocks.resolve_queries = (function pluto$reader$blocks$resolve_queries(env){
+return cljs.core.reduce_kv((function (p1__1215_SHARP_,p2__1216_SHARP_,p3__1217_SHARP_){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(p1__1215_SHARP_,p2__1216_SHARP_,pluto.reader.blocks.resolve_query(p3__1217_SHARP_));
+}),cljs.core.PersistentArrayMap.EMPTY,env);
+});
+pluto.reader.blocks.let_block = (function pluto$reader$blocks$let_block(p__1218,child){
+var map__1219 = p__1218;
+var map__1219__$1 = ((((!((map__1219 == null)))?(((((map__1219.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1219.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1219):map__1219);
+var env = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1219__$1,cljs.core.cst$kw$env);
+if(cljs.core.coll_QMARK_(child)){
+return clojure.walk.prewalk_replace(pluto.reader.blocks.resolve_queries(env),child);
+} else {
+return null;
+}
+});
+pluto.reader.blocks.bindings__GT_env = (function pluto$reader$blocks$bindings__GT_env(v){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,v);
+});
+pluto.reader.blocks.parse.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$sym$let,(function (_,p__1221){
+var vec__1222 = p__1221;
+var seq__1223 = cljs.core.seq(vec__1222);
+var first__1224 = cljs.core.first(seq__1223);
+var seq__1223__$1 = cljs.core.next(seq__1223);
+var ___$1 = first__1224;
+var first__1224__$1 = cljs.core.first(seq__1223__$1);
+var seq__1223__$2 = cljs.core.next(seq__1223__$1);
+var bindings = first__1224__$1;
+var body = seq__1223__$2;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$data,(function (){var m = pluto.reader.blocks.bindings__GT_env(bindings);
+var child = cljs.core.last(body);
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [pluto.reader.blocks.let_block,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$env,m], null),child], null);
+})()], null);
+}));
+pluto.reader.blocks.when_block = (function pluto$reader$blocks$when_block(p__1225,body){
+var map__1226 = p__1225;
+var map__1226__$1 = ((((!((map__1226 == null)))?(((((map__1226.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1226.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1226):map__1226);
+var test = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1226__$1,cljs.core.cst$kw$test);
+if(cljs.core.truth_(test)){
+return body;
+} else {
+return null;
+}
+});
+pluto.reader.blocks.parse.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$sym$when,(function (_,p__1228){
+var vec__1229 = p__1228;
+var seq__1230 = cljs.core.seq(vec__1229);
+var first__1231 = cljs.core.first(seq__1230);
+var seq__1230__$1 = cljs.core.next(seq__1230);
+var ___$1 = first__1231;
+var first__1231__$1 = cljs.core.first(seq__1230__$1);
+var seq__1230__$2 = cljs.core.next(seq__1230__$1);
+var test = first__1231__$1;
+var body = seq__1230__$2;
+if((test instanceof cljs.core.Symbol)){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$data,cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [pluto.reader.blocks.when_block,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$test,test], null)], null),body)], null);
+} else {
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$unsupported_DASH_type,cljs.core.cst$kw$value,test], null)], null)], null);
+
+}
+}));
+pluto.reader.blocks.if_block = (function pluto$reader$blocks$if_block(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___1237 = arguments.length;
+var i__4519__auto___1238 = (0);
+while(true){
+if((i__4519__auto___1238 < len__4518__auto___1237)){
+args__4521__auto__.push((arguments[i__4519__auto___1238]));
+
+var G__1239 = (i__4519__auto___1238 + (1));
+i__4519__auto___1238 = G__1239;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return pluto.reader.blocks.if_block.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+pluto.reader.blocks.if_block.cljs$core$IFn$_invoke$arity$variadic = (function (p__1234,body){
+var map__1235 = p__1234;
+var map__1235__$1 = ((((!((map__1235 == null)))?(((((map__1235.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1235.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1235):map__1235);
+var test = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1235__$1,cljs.core.cst$kw$test);
+if(cljs.core.truth_(test)){
+return cljs.core.first(body);
+} else {
+return cljs.core.second(body);
+}
+});
+
+pluto.reader.blocks.if_block.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+pluto.reader.blocks.if_block.cljs$lang$applyTo = (function (seq1232){
+var G__1233 = cljs.core.first(seq1232);
+var seq1232__$1 = cljs.core.next(seq1232);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1233,seq1232__$1);
+});
+
+pluto.reader.blocks.parse.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$sym$if,(function (_,p__1240){
+var vec__1241 = p__1240;
+var ___$1 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1241,(0),null);
+var test = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1241,(1),null);
+var then = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1241,(2),null);
+var else$ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1241,(3),null);
+if((test instanceof cljs.core.Symbol)){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$data,cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [pluto.reader.blocks.if_block,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$test,test], null)], null),(new cljs.core.List(null,then,(new cljs.core.List(null,else$,null,(1),null)),(2),null)))], null);
+} else {
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$unsupported_DASH_type,cljs.core.cst$kw$value,test], null)], null)], null);
+
+}
+}));
+pluto.reader.blocks.parse.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$default,(function (opts,block){
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$type,cljs.core.cst$kw$unknown_DASH_block_DASH_type,cljs.core.cst$kw$opts,opts,cljs.core.cst$kw$block,block], null)], null)], null);
+}));
diff --git a/js/pluto/reader/reference.cljc.cache.json b/js/pluto/reader/reference.cljc.cache.json
new file mode 100644
index 0000000..f87b203
--- /dev/null
+++ b/js/pluto/reader/reference.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",["~$resolve"]],"~:name","~$pluto.reader.reference","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$reference?",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/Documents/Projects/pluto/src/pluto/reader/reference.cljc","~:line",4,"~:column",7,"~:end-line",4,"~:end-column",17,"~:arglists",["~#list",["~$quote",["^F",[["~$o"]]]]]],"^6","~$pluto.reader.reference/reference?","~:variadic",false,"^@","/home/julien/Documents/Projects/pluto/src/pluto/reader/reference.cljc","^D",17,"~:method-params",["^F",[["~$o"]]],"~:protocol-impl",null,"~:arglists-meta",["^F",[null,null]],"^B",1,"^A",4,"^C",4,"~:max-fixed-arity",1,"~:fn-var",true,"^E",["^F",["^G",["^F",[["~$o"]]]]]],"^5",["^ ","^6","~$pluto.reader.reference/resolve","^@","/home/julien/Documents/Projects/pluto/src/pluto/reader/reference.cljc","^A",8,"^B",1,"^C",8,"^D",18,"~:doc","","^?",["^ ","^@","/home/julien/Documents/Projects/pluto/src/pluto/reader/reference.cljc","^A",8,"^B",11,"^C",8,"^D",18,"^P",""],"~:tag","~$cljs.core/MultiFn"]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^4",["~:errors","~:default","~:value","~:type","~:unknown-view","~:unknown-reference-type","~$clojure.core/deref","~:hierarchy","~:view","~:data"]],"~:order",["^11","^12","^Z","^X","^13","^Y","^14","^W","^[","^10"]],"^P",null]
\ No newline at end of file
diff --git a/js/pluto/reader/reference.js b/js/pluto/reader/reference.js
new file mode 100644
index 0000000..a4b508b
--- /dev/null
+++ b/js/pluto/reader/reference.js
@@ -0,0 +1,46 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.reader.reference');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+pluto.reader.reference.reference_QMARK_ = (function pluto$reader$reference$reference_QMARK_(o){
+return ((cljs.core.list_QMARK_(o)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$sym$clojure$core_SLASH_deref,cljs.core.first(o))));
+});
+if((typeof pluto !== 'undefined') && (typeof pluto.reader !== 'undefined') && (typeof pluto.reader.reference !== 'undefined') && (typeof pluto.reader.reference.resolve !== 'undefined')){
+} else {
+/**
+ * 
+ */
+pluto.reader.reference.resolve = (function (){var method_table__4401__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var prefer_table__4402__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var method_cache__4403__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var cached_hierarchy__4404__auto__ = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+var hierarchy__4405__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$3(cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$hierarchy,cljs.core.get_global_hierarchy());
+return (new cljs.core.MultiFn(cljs.core.symbol.cljs$core$IFn$_invoke$arity$2("pluto.reader.reference","resolve"),((function (method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__,hierarchy__4405__auto__){
+return (function (m,p__1199){
+var map__1200 = p__1199;
+var map__1200__$1 = ((((!((map__1200 == null)))?(((((map__1200.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1200.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1200):map__1200);
+var type = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1200__$1,cljs.core.cst$kw$type);
+return type;
+});})(method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__,hierarchy__4405__auto__))
+,cljs.core.cst$kw$default,hierarchy__4405__auto__,method_table__4401__auto__,prefer_table__4402__auto__,method_cache__4403__auto__,cached_hierarchy__4404__auto__));
+})();
+}
+pluto.reader.reference.resolve.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$view,(function (m,p__1202){
+var map__1203 = p__1202;
+var map__1203__$1 = ((((!((map__1203 == null)))?(((((map__1203.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1203.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1203):map__1203);
+var value = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1203__$1,cljs.core.cst$kw$value);
+var temp__5455__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,value);
+if(cljs.core.truth_(temp__5455__auto__)){
+var view = temp__5455__auto__;
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$data,view], null);
+} else {
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$unknown_DASH_view,cljs.core.cst$kw$value,value], null)], null)], null);
+}
+}));
+pluto.reader.reference.resolve.cljs$core$IMultiFn$_add_method$arity$3(null,cljs.core.cst$kw$default,(function (m,p__1205){
+var map__1206 = p__1205;
+var map__1206__$1 = ((((!((map__1206 == null)))?(((((map__1206.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1206.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1206):map__1206);
+var type = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1206__$1,cljs.core.cst$kw$type);
+var value = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1206__$1,cljs.core.cst$kw$value);
+return new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$errors,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$unknown_DASH_reference_DASH_type,cljs.core.cst$kw$value,value], null)], null)], null);
+}));
diff --git a/js/pluto/storage.cljc.cache.json b/js/pluto/storage.cljc.cache.json
new file mode 100644
index 0000000..29e4d10
--- /dev/null
+++ b/js/pluto/storage.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$pluto.storage","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$Storage",["^ ","~:meta",["^ ","~:file","/home/julien/Documents/Projects/pluto/src/pluto/storage.cljc","~:line",3,"~:column",14,"~:end-line",3,"~:end-column",21,"~:doc","","~:protocol-symbol",true,"~:jsdoc",["~#list",["@interface"]],"~:protocol-info",["^ ","~:methods",["^ ","~$fetch",[["~$this","~$id","~$callback"]]]]],"^D",true,"^5","~$pluto.storage/Storage","^>","/home/julien/Documents/Projects/pluto/src/pluto/storage.cljc","^B",21,"^@",1,"^?",3,"^G",["^ ","^H",["^ ","^I",[["^J","^K","^L"]]]],"~:info",null,"^A",3,"~:tag","~$any","~:impls",["^4",[]],"^C","","^E",["^F",["@interface"]]],"^I",["^ ","~:protocol-inline",null,"^=",["^ ","^>","/home/julien/Documents/Projects/pluto/src/pluto/storage.cljc","^?",5,"^@",4,"^A",5,"^B",9,"~:protocol","^M","^C",null,"~:arglists",["^F",["~$quote",["^F",[["^J","^K","^L"]]]]]],"^S","^M","^5","~$pluto.storage/fetch","~:variadic",false,"^>","/home/julien/Documents/Projects/pluto/src/pluto/storage.cljc","^B",9,"~:method-params",["^F",[["^J","^K","^L"]]],"~:protocol-impl",null,"~:arglists-meta",["^F",[null,null]],"^@",1,"^?",3,"^A",5,"~:max-fixed-arity",3,"~:fn-var",true,"^T",["^F",["^U",["^F",[["^J","^K","^L"]]]]],"^C",null]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"^C",null]
\ No newline at end of file
diff --git a/js/pluto/storage.js b/js/pluto/storage.js
new file mode 100644
index 0000000..f7689c7
--- /dev/null
+++ b/js/pluto/storage.js
@@ -0,0 +1,30 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.storage');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+
+/**
+ * 
+ * @interface
+ */
+pluto.storage.Storage = function(){};
+
+pluto.storage.fetch = (function pluto$storage$fetch(this$,id,callback){
+if(((!((this$ == null))) && (!((this$.pluto$storage$Storage$fetch$arity$3 == null))))){
+return this$.pluto$storage$Storage$fetch$arity$3(this$,id,callback);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (pluto.storage.fetch[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(this$,id,callback) : m__4231__auto__.call(null,this$,id,callback));
+} else {
+var m__4231__auto____$1 = (pluto.storage.fetch["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,id,callback) : m__4231__auto____$1.call(null,this$,id,callback));
+} else {
+throw cljs.core.missing_protocol("Storage.fetch",this$);
+}
+}
+}
+});
+
diff --git a/js/pluto/storage/http.cljs.cache.json b/js/pluto/storage/http.cljs.cache.json
new file mode 100644
index 0000000..ddc4c42
--- /dev/null
+++ b/js/pluto/storage/http.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$XMLHttpRequest",["^ ","~$prototype",["^ ","~$open",["^ "],"~$send",["^ "],"~$onreadystatechange",["^ "],"~$readyState",["^ "]]]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$pluto.storage.http","~:imports",null,"~:requires",["^ ","~$storage","~$pluto.storage","^A","^A"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$result",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/Documents/Projects/pluto/src/pluto/storage/http.cljs","~:line",4,"~:column",7,"~:end-line",4,"~:end-column",13,"~:arglists",["~#list",["~$quote",["^N",[["~$xhr"]]]]]],"^<","~$pluto.storage.http/result","~:variadic",false,"^H","/home/julien/Documents/Projects/pluto/src/pluto/storage/http.cljs","^L",13,"~:method-params",["^N",[["^P"]]],"~:protocol-impl",null,"~:arglists-meta",["^N",[null,null]],"^J",1,"^I",4,"^K",4,"~:max-fixed-arity",1,"~:fn-var",true,"^M",["^N",["^O",["^N",[["^P"]]]]]],"~$HTTPStorage",["^ ","~:num-fields",0,"~:protocols",["^;",["~$pluto.storage/Storage"]],"^<","~$pluto.storage.http/HTTPStorage","^H","/home/julien/Documents/Projects/pluto/src/pluto/storage/http.cljs","^L",21,"~:type",true,"^J",10,"^I",12,"~:record",false,"^K",12,"~:tag","~$function","~:skip-protocol-flag",null],"~$->HTTPStorage",["^ ","^F",null,"^G",["^ ","^Z",["^;",["^["]],"^H","/home/julien/Documents/Projects/pluto/src/pluto/storage/http.cljs","^L",21,"^J",10,"~:factory","~:positional","^I",12,"^K",12,"^M",["^N",["^O",["^N",[[]]]]],"^15",null,"~:doc","Positional factory function for pluto.storage.http/HTTPStorage."],"^Z",["^;",["^["]],"^<","~$pluto.storage.http/->HTTPStorage","^R",false,"^H","/home/julien/Documents/Projects/pluto/src/pluto/storage/http.cljs","^L",21,"^S",["^N",[[]]],"^T",null,"^U",["^N",[null,null]],"^J",1,"^17","^18","^I",12,"^K",12,"^V",0,"^W",true,"^M",["^N",["^O",["^N",[[]]]]],"^15",null,"^19","Positional factory function for pluto.storage.http/HTTPStorage."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^;",["~:content","~:value","^11","~:success","~:error"]],"~:order",["^11","^1@","^1B","^1A","^1?"]],"^19",null]
\ No newline at end of file
diff --git a/js/pluto/storage/http.js b/js/pluto/storage/http.js
new file mode 100644
index 0000000..7e55791
--- /dev/null
+++ b/js/pluto/storage/http.js
@@ -0,0 +1,64 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.storage.http');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('pluto.storage');
+pluto.storage.http.result = (function pluto$storage$http$result(xhr){
+var status = xhr.status;
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((404),status)){
+return new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$error,cljs.core.cst$kw$value,status], null);
+} else {
+return new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$success,cljs.core.cst$kw$value,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$content,xhr.responseText], null)], null)], null);
+}
+});
+
+/**
+* @constructor
+ * @implements {pluto.storage.Storage}
+*/
+pluto.storage.http.HTTPStorage = (function (){
+});
+pluto.storage.http.HTTPStorage.prototype.pluto$storage$Storage$ = cljs.core.PROTOCOL_SENTINEL;
+
+pluto.storage.http.HTTPStorage.prototype.pluto$storage$Storage$fetch$arity$3 = (function (_,p__1301,callback){
+var self__ = this;
+var map__1302 = p__1301;
+var map__1302__$1 = ((((!((map__1302 == null)))?(((((map__1302.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1302.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1302):map__1302);
+var value = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1302__$1,cljs.core.cst$kw$value);
+var ___$1 = this;
+var xhr = (new XMLHttpRequest());
+xhr.open("GET",[cljs.core.str.cljs$core$IFn$_invoke$arity$1(value),"/extension.edn"].join(''),true);
+
+xhr.send(null);
+
+return xhr.onreadystatechange = ((function (xhr,___$1,map__1302,map__1302__$1,value){
+return (function (){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(xhr.readyState,(4))){
+var G__1304 = pluto.storage.http.result(xhr);
+return (callback.cljs$core$IFn$_invoke$arity$1 ? callback.cljs$core$IFn$_invoke$arity$1(G__1304) : callback.call(null,G__1304));
+} else {
+return null;
+}
+});})(xhr,___$1,map__1302,map__1302__$1,value))
+;
+});
+
+pluto.storage.http.HTTPStorage.getBasis = (function (){
+return cljs.core.PersistentVector.EMPTY;
+});
+
+pluto.storage.http.HTTPStorage.cljs$lang$type = true;
+
+pluto.storage.http.HTTPStorage.cljs$lang$ctorStr = "pluto.storage.http/HTTPStorage";
+
+pluto.storage.http.HTTPStorage.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"pluto.storage.http/HTTPStorage");
+});
+
+/**
+ * Positional factory function for pluto.storage.http/HTTPStorage.
+ */
+pluto.storage.http.__GT_HTTPStorage = (function pluto$storage$http$__GT_HTTPStorage(){
+return (new pluto.storage.http.HTTPStorage());
+});
+
diff --git a/js/pluto/storage/ipfs.cljs.cache.json b/js/pluto/storage/ipfs.cljs.cache.json
new file mode 100644
index 0000000..a318630
--- /dev/null
+++ b/js/pluto/storage/ipfs.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$JSON",["^ ","~$parse",["^ "]],"~$Promise",["^ ","~$all",["^ "]],"~$XMLHttpRequest",["^ ","~$prototype",["^ ","~$open",["^ "],"~$timeout",["^ "],"~$ontimeout",["^ "],"~$send",["^ "],"~$onload",["^ "],"~$responseText",["^ "]]],"~$Object",["^ ","~$then",["^ "]]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$pluto.storage.ipfs","~:imports",null,"~:requires",["^ ","~$string","~$clojure.string","^I","^I","~$storage","~$pluto.storage","^K","^K"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$ipfs->extension",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","~:line",5,"~:column",8,"~:end-line",5,"~:end-column",23,"~:private",true,"~:arglists",["~#list",["~$quote",["^Y",[["~$ipfs-extension"]]]]]],"^W",true,"^D","~$pluto.storage.ipfs/ipfs->extension","~:variadic",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",23,"~:method-params",["^Y",[["^["]]],"~:protocol-impl",null,"~:arglists-meta",["^Y",[null,null]],"^T",1,"^S",5,"^U",5,"~:max-fixed-arity",1,"~:fn-var",true,"^X",["^Y",["^Z",["^Y",[["^["]]]]]],"~$parse-directory",["^ ","^P",null,"^Q",["^ ","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^S",9,"^T",7,"^U",9,"^V",22,"^X",["^Y",["^Z",["^Y",[["~$response"]]]]]],"^D","~$pluto.storage.ipfs/parse-directory","^11",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",22,"^12",["^Y",[["^18"]]],"^13",null,"^14",["^Y",[null,null]],"^T",1,"^S",9,"^U",9,"^15",1,"^16",true,"^X",["^Y",["^Z",["^Y",[["^18"]]]]]],"~$fetch-promise",["^ ","^P",null,"^Q",["^ ","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^S",17,"^T",7,"^U",17,"^V",20,"^X",["^Y",["^Z",["^Y",[["~$url"]]]]]],"^D","~$pluto.storage.ipfs/fetch-promise","^11",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",20,"^12",["^Y",[["^1;"]]],"^13",null,"^14",["^Y",[null,null]],"^T",1,"^S",17,"^U",17,"^15",1,"^16",true,"^X",["^Y",["^Z",["^Y",[["^1;"]]]]]],"~$list-all",["^ ","^P",null,"^Q",["^ ","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^S",27,"^T",7,"^U",27,"^V",15,"^X",["^Y",["^Z",["^Y",[["~$gateway-url","~$directory"]]]]]],"^D","~$pluto.storage.ipfs/list-all","^11",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",15,"^12",["^Y",[["^1>","^1?"]]],"^13",null,"^14",["^Y",[null,null]],"^T",1,"^S",27,"^U",27,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["^1>","^1?"]]]]]],"~$fetch",["^ ","^P",null,"^Q",["^ ","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^S",30,"^T",7,"^U",30,"^V",12,"^X",["^Y",["^Z",["^Y",[["^1>","~$extension"]]]]]],"^D","~$pluto.storage.ipfs/fetch","^11",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",12,"^12",["^Y",[["^1>","^1B"]]],"^13",null,"^14",["^Y",[null,null]],"^T",1,"^S",30,"^U",30,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["^1>","^1B"]]]]]],"~$fetch-all",["^ ","^P",null,"^Q",["^ ","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^S",37,"^T",7,"^U",37,"^V",16,"^X",["^Y",["^Z",["^Y",[["^1>","~$extensions"]]]]]],"^D","~$pluto.storage.ipfs/fetch-all","^11",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",16,"^12",["^Y",[["^1>","^1E"]]],"^13",null,"^14",["^Y",[null,null]],"^T",1,"^S",37,"^U",37,"^15",2,"^16",true,"^X",["^Y",["^Z",["^Y",[["^1>","^1E"]]]]]],"~$IPFSStorage",["^ ","~:num-fields",1,"~:protocols",["^C",["~$cljs.core/IRecord","~$cljs.core/IEquiv","~$cljs.core/IHash","~$cljs.core/ICollection","~$cljs.core/ICounted","~$cljs.core/ISeqable","~$cljs.core/IMeta","~$cljs.core/ICloneable","~$cljs.core/IPrintWithWriter","~$cljs.core/IIterable","~$pluto.storage/Storage","~$cljs.core/IWithMeta","~$cljs.core/IAssociative","~$cljs.core/IMap","~$cljs.core/ILookup"]],"^D","~$pluto.storage.ipfs/IPFSStorage","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",23,"~:type",true,"^T",12,"~:internal-ctor",true,"^S",43,"~:record",true,"^U",43,"~:tag","~$function","~:skip-protocol-flag",["^C",["^1J","^1K","^1L","^1M","^1N","^1O","^1P","^1Q","^1R","^1S","^1U","^1V","^1W","^1X"]]],"~$->IPFSStorage",["^ ","^P",null,"^Q",["^ ","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^S",43,"^T",12,"^U",43,"^V",23,"^1[",true,"~:factory","~:positional","^X",["^Y",["^Z",["^Y",[["^1>"]]]]],"~:doc","Positional factory function for pluto.storage.ipfs/IPFSStorage."],"^D","~$pluto.storage.ipfs/->IPFSStorage","^11",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",23,"^12",["^Y",[["^1>"]]],"^13",null,"^14",["^Y",[null,null]],"^T",1,"^1[",true,"^25","^26","^S",43,"^U",43,"^15",1,"^16",true,"^X",["^Y",["^Z",["^Y",[["^1>"]]]]],"^27","Positional factory function for pluto.storage.ipfs/IPFSStorage."],"~$map->IPFSStorage",["^ ","^P",null,"^Q",["^ ","^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^S",43,"^T",12,"^U",43,"^V",23,"^1[",true,"^25","~:map","^X",["^Y",["^Z",["^Y",[["~$G__1287"]]]]],"^27","Factory function for pluto.storage.ipfs/IPFSStorage, taking a map of keywords to field values."],"^D","~$pluto.storage.ipfs/map->IPFSStorage","^11",false,"^R","/home/julien/Documents/Projects/pluto/src/pluto/storage/ipfs.cljs","^V",23,"^12",["^Y",[["^2;"]]],"^13",null,"^14",["^Y",[null,null]],"^T",1,"^1[",true,"^25","^2:","^S",43,"^U",43,"^15",1,"^16",true,"^X",["^Y",["^Z",["^Y",[["^2;"]]]]],"^27","Factory function for pluto.storage.ipfs/IPFSStorage, taking a map of keywords to field values."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^C",["^1>","~:content","^D","~:value","^1Z","~:Objects","~:success","~:Links","~:extension-id","~:Hash","~:Name","~:error","~:timeout","~:keywordize-keys","~:gateway-url"]],"~:order",["^2F","^D","^2G","^2H","^2E","^2C","^2K","^2J","^2A","^2B","^1Z","^2D","^2I","^2L","^1>"]],"^27",null]
\ No newline at end of file
diff --git a/js/pluto/storage/ipfs.js b/js/pluto/storage/ipfs.js
new file mode 100644
index 0000000..baa5e5d
--- /dev/null
+++ b/js/pluto/storage/ipfs.js
@@ -0,0 +1,268 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.storage.ipfs');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.string');
+goog.require('pluto.storage');
+pluto.storage.ipfs.ipfs__GT_extension = (function pluto$storage$ipfs$ipfs__GT_extension(ipfs_extension){
+return new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$extension_DASH_id,cljs.core.cst$kw$Hash.cljs$core$IFn$_invoke$arity$1(ipfs_extension),cljs.core.cst$kw$name,cljs.core.cst$kw$Name.cljs$core$IFn$_invoke$arity$1(ipfs_extension)], null);
+});
+pluto.storage.ipfs.parse_directory = (function pluto$storage$ipfs$parse_directory(response){
+if(clojure.string.blank_QMARK_(response)){
+return null;
+} else {
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(pluto.storage.ipfs.ipfs__GT_extension,cljs.core.cst$kw$Links.cljs$core$IFn$_invoke$arity$1(cljs.core.first(cljs.core.cst$kw$Objects.cljs$core$IFn$_invoke$arity$1(cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic(JSON.parse(response),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$keywordize_DASH_keys,true], 0))))));
+}
+});
+pluto.storage.ipfs.fetch_promise = (function pluto$storage$ipfs$fetch_promise(url){
+return (new Promise((function (resolve,reject){
+var xhr = (new XMLHttpRequest());
+xhr.open("GET",url,true);
+
+xhr.timeout = (2000);
+
+xhr.ontimeout = ((function (xhr){
+return (function (){
+var G__1277 = cljs.core.cst$kw$timeout;
+return (reject.cljs$core$IFn$_invoke$arity$1 ? reject.cljs$core$IFn$_invoke$arity$1(G__1277) : reject.call(null,G__1277));
+});})(xhr))
+;
+
+xhr.send(null);
+
+return xhr.onload = ((function (xhr){
+return (function (){
+var G__1278 = xhr.responseText;
+return (resolve.cljs$core$IFn$_invoke$arity$1 ? resolve.cljs$core$IFn$_invoke$arity$1(G__1278) : resolve.call(null,G__1278));
+});})(xhr))
+;
+})));
+});
+pluto.storage.ipfs.list_all = (function pluto$storage$ipfs$list_all(gateway_url,directory){
+return pluto.storage.ipfs.fetch_promise([cljs.core.str.cljs$core$IFn$_invoke$arity$1(gateway_url),"/api/v0/ls?arg=",cljs.core.str.cljs$core$IFn$_invoke$arity$1(directory)].join(''));
+});
+pluto.storage.ipfs.fetch = (function pluto$storage$ipfs$fetch(gateway_url,extension){
+return pluto.storage.ipfs.fetch_promise([cljs.core.str.cljs$core$IFn$_invoke$arity$1(gateway_url),"/api/v0/cat?arg=",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.cst$kw$extension_DASH_id.cljs$core$IFn$_invoke$arity$1(extension))].join('')).then((function (content){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(extension,cljs.core.cst$kw$content,content);
+}));
+});
+pluto.storage.ipfs.fetch_all = (function pluto$storage$ipfs$fetch_all(gateway_url,extensions){
+var promises = Promise.all(cljs.core.clj__GT_js(cljs.core.mapv.cljs$core$IFn$_invoke$arity$2((function (p1__1279_SHARP_){
+return pluto.storage.ipfs.fetch(gateway_url,p1__1279_SHARP_);
+}),extensions)));
+return promises.then(((function (promises){
+return (function (p1__1280_SHARP_){
+return cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic(p1__1280_SHARP_,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$keywordize_DASH_keys,true], 0));
+});})(promises))
+);
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IRecord}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.ICollection}
+ * @implements {cljs.core.ICounted}
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.ICloneable}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {cljs.core.IIterable}
+ * @implements {pluto.storage.Storage}
+ * @implements {cljs.core.IWithMeta}
+ * @implements {cljs.core.IAssociative}
+ * @implements {cljs.core.IMap}
+ * @implements {cljs.core.ILookup}
+*/
+pluto.storage.ipfs.IPFSStorage = (function (gateway_url,__meta,__extmap,__hash){
+this.gateway_url = gateway_url;
+this.__meta = __meta;
+this.__extmap = __extmap;
+this.__hash = __hash;
+this.cljs$lang$protocol_mask$partition0$ = 2229667594;
+this.cljs$lang$protocol_mask$partition1$ = 139264;
+});
+pluto.storage.ipfs.IPFSStorage.prototype.pluto$storage$Storage$ = cljs.core.PROTOCOL_SENTINEL;
+
+pluto.storage.ipfs.IPFSStorage.prototype.pluto$storage$Storage$fetch$arity$3 = (function (_,extension,callback){
+var self__ = this;
+var ___$1 = this;
+return pluto.storage.ipfs.list_all(self__.gateway_url,cljs.core.cst$kw$value.cljs$core$IFn$_invoke$arity$1(extension)).then(pluto.storage.ipfs.parse_directory).then(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(pluto.storage.ipfs.fetch_all,self__.gateway_url)).then(((function (___$1){
+return (function (p1__1281_SHARP_){
+var G__1288 = new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$success,cljs.core.cst$kw$value,p1__1281_SHARP_], null);
+return (callback.cljs$core$IFn$_invoke$arity$1 ? callback.cljs$core$IFn$_invoke$arity$1(G__1288) : callback.call(null,G__1288));
+});})(___$1))
+,((function (___$1){
+return (function (p1__1282_SHARP_){
+var G__1289 = new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$type,cljs.core.cst$kw$error,cljs.core.cst$kw$value,p1__1282_SHARP_], null);
+return (callback.cljs$core$IFn$_invoke$arity$1 ? callback.cljs$core$IFn$_invoke$arity$1(G__1289) : callback.call(null,G__1289));
+});})(___$1))
+);
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (this__4190__auto__,k__4191__auto__){
+var self__ = this;
+var this__4190__auto____$1 = this;
+return this__4190__auto____$1.cljs$core$ILookup$_lookup$arity$3(null,k__4191__auto__,null);
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (this__4192__auto__,k1284,else__4193__auto__){
+var self__ = this;
+var this__4192__auto____$1 = this;
+var G__1290 = k1284;
+var G__1290__$1 = (((G__1290 instanceof cljs.core.Keyword))?G__1290.fqn:null);
+switch (G__1290__$1) {
+case "gateway-url":
+return self__.gateway_url;
+
+break;
+default:
+return cljs.core.get.cljs$core$IFn$_invoke$arity$3(self__.__extmap,k1284,else__4193__auto__);
+
+}
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (this__4204__auto__,writer__4205__auto__,opts__4206__auto__){
+var self__ = this;
+var this__4204__auto____$1 = this;
+var pr_pair__4207__auto__ = ((function (this__4204__auto____$1){
+return (function (keyval__4208__auto__){
+return cljs.core.pr_sequential_writer(writer__4205__auto__,cljs.core.pr_writer,""," ","",opts__4206__auto__,keyval__4208__auto__);
+});})(this__4204__auto____$1))
+;
+return cljs.core.pr_sequential_writer(writer__4205__auto__,pr_pair__4207__auto__,"#pluto.storage.ipfs.IPFSStorage{",", ","}",opts__4206__auto__,cljs.core.concat.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [(new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.cst$kw$gateway_DASH_url,self__.gateway_url],null))], null),self__.__extmap));
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (G__1283){
+var self__ = this;
+var G__1283__$1 = this;
+return (new cljs.core.RecordIter((0),G__1283__$1,1,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$gateway_DASH_url], null),(cljs.core.truth_(self__.__extmap)?cljs.core._iterator(self__.__extmap):cljs.core.nil_iter())));
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IMeta$_meta$arity$1 = (function (this__4188__auto__){
+var self__ = this;
+var this__4188__auto____$1 = this;
+return self__.__meta;
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (this__4185__auto__){
+var self__ = this;
+var this__4185__auto____$1 = this;
+return (new pluto.storage.ipfs.IPFSStorage(self__.gateway_url,self__.__meta,self__.__extmap,self__.__hash));
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$ICounted$_count$arity$1 = (function (this__4194__auto__){
+var self__ = this;
+var this__4194__auto____$1 = this;
+return (1 + cljs.core.count(self__.__extmap));
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IHash$_hash$arity$1 = (function (this__4186__auto__){
+var self__ = this;
+var this__4186__auto____$1 = this;
+var h__4048__auto__ = self__.__hash;
+if(!((h__4048__auto__ == null))){
+return h__4048__auto__;
+} else {
+var h__4048__auto____$1 = (function (){var fexpr__1291 = ((function (h__4048__auto__,this__4186__auto____$1){
+return (function (coll__4187__auto__){
+return (-122252959 ^ cljs.core.hash_unordered_coll(coll__4187__auto__));
+});})(h__4048__auto__,this__4186__auto____$1))
+;
+return fexpr__1291(this__4186__auto____$1);
+})();
+self__.__hash = h__4048__auto____$1;
+
+return h__4048__auto____$1;
+}
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (this1285,other1286){
+var self__ = this;
+var this1285__$1 = this;
+return ((!((other1286 == null))) && ((this1285__$1.constructor === other1286.constructor)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(this1285__$1.gateway_url,other1286.gateway_url)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(this1285__$1.__extmap,other1286.__extmap)));
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (this__4199__auto__,k__4200__auto__){
+var self__ = this;
+var this__4199__auto____$1 = this;
+if(cljs.core.contains_QMARK_(new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$gateway_DASH_url,null], null), null),k__4200__auto__)){
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(cljs.core._with_meta(cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,this__4199__auto____$1),self__.__meta),k__4200__auto__);
+} else {
+return (new pluto.storage.ipfs.IPFSStorage(self__.gateway_url,self__.__meta,cljs.core.not_empty(cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(self__.__extmap,k__4200__auto__)),null));
+}
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (this__4197__auto__,k__4198__auto__,G__1283){
+var self__ = this;
+var this__4197__auto____$1 = this;
+var pred__1292 = cljs.core.keyword_identical_QMARK_;
+var expr__1293 = k__4198__auto__;
+if(cljs.core.truth_((function (){var G__1295 = cljs.core.cst$kw$gateway_DASH_url;
+var G__1296 = expr__1293;
+return (pred__1292.cljs$core$IFn$_invoke$arity$2 ? pred__1292.cljs$core$IFn$_invoke$arity$2(G__1295,G__1296) : pred__1292.call(null,G__1295,G__1296));
+})())){
+return (new pluto.storage.ipfs.IPFSStorage(G__1283,self__.__meta,self__.__extmap,null));
+} else {
+return (new pluto.storage.ipfs.IPFSStorage(self__.gateway_url,self__.__meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.__extmap,k__4198__auto__,G__1283),null));
+}
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this__4202__auto__){
+var self__ = this;
+var this__4202__auto____$1 = this;
+return cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [(new cljs.core.MapEntry(cljs.core.cst$kw$gateway_DASH_url,self__.gateway_url,null))], null),self__.__extmap));
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (this__4189__auto__,G__1283){
+var self__ = this;
+var this__4189__auto____$1 = this;
+return (new pluto.storage.ipfs.IPFSStorage(self__.gateway_url,G__1283,self__.__extmap,self__.__hash));
+});
+
+pluto.storage.ipfs.IPFSStorage.prototype.cljs$core$ICollection$_conj$arity$2 = (function (this__4195__auto__,entry__4196__auto__){
+var self__ = this;
+var this__4195__auto____$1 = this;
+if(cljs.core.vector_QMARK_(entry__4196__auto__)){
+return this__4195__auto____$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry__4196__auto__,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry__4196__auto__,(1)));
+} else {
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,this__4195__auto____$1,entry__4196__auto__);
+}
+});
+
+pluto.storage.ipfs.IPFSStorage.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$gateway_DASH_url], null);
+});
+
+pluto.storage.ipfs.IPFSStorage.cljs$lang$type = true;
+
+pluto.storage.ipfs.IPFSStorage.cljs$lang$ctorPrSeq = (function (this__4227__auto__){
+return (new cljs.core.List(null,"pluto.storage.ipfs/IPFSStorage",null,(1),null));
+});
+
+pluto.storage.ipfs.IPFSStorage.cljs$lang$ctorPrWriter = (function (this__4227__auto__,writer__4228__auto__){
+return cljs.core._write(writer__4228__auto__,"pluto.storage.ipfs/IPFSStorage");
+});
+
+/**
+ * Positional factory function for pluto.storage.ipfs/IPFSStorage.
+ */
+pluto.storage.ipfs.__GT_IPFSStorage = (function pluto$storage$ipfs$__GT_IPFSStorage(gateway_url){
+return (new pluto.storage.ipfs.IPFSStorage(gateway_url,null,null,null));
+});
+
+/**
+ * Factory function for pluto.storage.ipfs/IPFSStorage, taking a map of keywords to field values.
+ */
+pluto.storage.ipfs.map__GT_IPFSStorage = (function pluto$storage$ipfs$map__GT_IPFSStorage(G__1287){
+var extmap__4223__auto__ = (function (){var G__1297 = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(G__1287,cljs.core.cst$kw$gateway_DASH_url);
+if(cljs.core.record_QMARK_(G__1287)){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,G__1297);
+} else {
+return G__1297;
+}
+})();
+return (new pluto.storage.ipfs.IPFSStorage(cljs.core.cst$kw$gateway_DASH_url.cljs$core$IFn$_invoke$arity$1(G__1287),null,cljs.core.not_empty(extmap__4223__auto__),null));
+});
+
diff --git a/js/pluto/utils.cljc.cache.json b/js/pluto/utils.cljc.cache.json
new file mode 100644
index 0000000..87a1602
--- /dev/null
+++ b/js/pluto/utils.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",["~$ex-cause","~$ex-message"]],"~:name","~$pluto.utils","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","^5",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/Documents/Projects/pluto/src/pluto/utils.cljc","~:line",4,"~:column",7,"~:end-line",4,"~:end-column",15,"~:arglists",["~#list",["~$quote",["^F",[["~$ex"]]]]]],"^7","~$pluto.utils/ex-cause","~:variadic",false,"^@","/home/julien/Documents/Projects/pluto/src/pluto/utils.cljc","^D",15,"~:method-params",["^F",[["^H"]]],"~:protocol-impl",null,"~:arglists-meta",["^F",[null,null]],"^B",1,"^A",4,"^C",4,"~:max-fixed-arity",1,"~:fn-var",true,"^E",["^F",["^G",["^F",[["^H"]]]]]],"^6",["^ ","^>",null,"^?",["^ ","^@","/home/julien/Documents/Projects/pluto/src/pluto/utils.cljc","^A",10,"^B",7,"^C",10,"^D",17,"^E",["^F",["^G",["^F",[["^H"]]]]]],"^7","~$pluto.utils/ex-message","^J",false,"^@","/home/julien/Documents/Projects/pluto/src/pluto/utils.cljc","^D",17,"^K",["^F",[["^H"]]],"^L",null,"^M",["^F",[null,null]],"^B",1,"^A",10,"^C",10,"^N",1,"^O",true,"^E",["^F",["^G",["^F",[["^H"]]]]]],"~$primitive?",["^ ","^>",null,"^?",["^ ","^@","/home/julien/Documents/Projects/pluto/src/pluto/utils.cljc","^A",16,"^B",7,"^C",16,"^D",17,"^E",["^F",["^G",["^F",[["~$o"]]]]]],"^7","~$pluto.utils/primitive?","^J",false,"^@","/home/julien/Documents/Projects/pluto/src/pluto/utils.cljc","^D",17,"^K",["^F",[["~$o"]]],"^L",null,"^M",["^F",[null,null]],"^B",1,"^A",16,"^C",16,"^N",1,"^O",true,"^E",["^F",["^G",["^F",[["~$o"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:doc",null]
\ No newline at end of file
diff --git a/js/pluto/utils.js b/js/pluto/utils.js
new file mode 100644
index 0000000..7d6d96a
--- /dev/null
+++ b/js/pluto/utils.js
@@ -0,0 +1,13 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('pluto.utils');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+pluto.utils.ex_cause = (function pluto$utils$ex_cause(ex){
+return cljs.core.ex_cause(ex);
+});
+pluto.utils.ex_message = (function pluto$utils$ex_message(ex){
+return cljs.core.ex_message(ex);
+});
+pluto.utils.primitive_QMARK_ = (function pluto$utils$primitive_QMARK_(o){
+return ((cljs.core.boolean_QMARK_(o)) || (cljs.core.int_QMARK_(o)) || (cljs.core.float_QMARK_(o)) || (typeof o === 'string'));
+});
diff --git a/js/process/env.cljs b/js/process/env.cljs
new file mode 100644
index 0000000..c8a6909
--- /dev/null
+++ b/js/process/env.cljs
@@ -0,0 +1,12 @@
+;; Copyright (c) Rich Hickey. All rights reserved.
+;; The use and distribution terms for this software are covered by the
+;; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
+;; which can be found in the file epl-v10.html at the root of this distribution.
+;; By using this software in any fashion, you are agreeing to be bound by
+;; the terms of this license.
+;; You must not remove this notice, or any other, from this software.
+
+(ns process.env
+  "A shim namespace for the Node.js process library")
+
+(goog-define NODE_ENV "development")
diff --git a/js/process/env.cljs.cache.json b/js/process/env.cljs.cache.json
new file mode 100644
index 0000000..75dbb6f
--- /dev/null
+++ b/js/process/env.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$process.env","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$NODE_ENV",["^ ","^5","~$process.env/NODE_ENV","~:file","/home/julien/.cljs/.aot_cache/1.10.329/7077492/process/env.cljs","~:line",12,"~:column",1,"~:end-line",12,"~:end-column",22,"~:tag","~$string","~:declared",true,"~:meta",["^ ","^>","/home/julien/.cljs/.aot_cache/1.10.329/7077492/process/env.cljs","^?",12,"^@",14,"^A",12,"^B",22,"^C","^D","^E",true]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:doc","A shim namespace for the Node.js process library"]
\ No newline at end of file
diff --git a/js/process/env.js b/js/process/env.js
new file mode 100644
index 0000000..4af4b3c
--- /dev/null
+++ b/js/process/env.js
@@ -0,0 +1,7 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('process.env');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+
+/** @define {string} */
+goog.define("process.env.NODE_ENV","development");
diff --git a/js/re_frame/cofx.cljc b/js/re_frame/cofx.cljc
new file mode 100644
index 0000000..75b727d
--- /dev/null
+++ b/js/re_frame/cofx.cljc
@@ -0,0 +1,114 @@
+(ns re-frame.cofx
+  (:require
+    [re-frame.db           :refer [app-db]]
+    [re-frame.interceptor  :refer [->interceptor]]
+    [re-frame.registrar    :refer [get-handler clear-handlers register-handler]]
+    [re-frame.loggers      :refer [console]]))
+
+
+;; -- Registration ------------------------------------------------------------
+
+(def kind :cofx)
+(assert (re-frame.registrar/kinds kind))
+
+(defn reg-cofx
+  "Register the given coeffect `handler` for the given `id`, for later use
+  within `inject-cofx`.
+
+  `id` is keyword, often namespaced.
+  `handler` is a function which takes either one or two arguements, the first of which is
+  always `coeffects` and which returns an updated `coeffects`.
+
+  See the docs for `inject-cofx` for example use."
+  [id handler]
+  (register-handler kind id handler))
+
+
+;; -- Interceptor -------------------------------------------------------------
+
+(defn inject-cofx
+  "Given an `id`, and an optional, arbitrary `value`, returns an interceptor
+   whose `:before` adds to the `:coeffects` (map) by calling a pre-registered
+   'coeffect handler' identified by the `id`.
+
+   The previous association of a `coeffect handler` with an `id` will have
+   happened via a call to `re-frame.core/reg-cofx` - generally on program startup.
+
+   Within the created interceptor, this 'looked up' `coeffect handler` will
+   be called (within the `:before`) with two arguments:
+     - the current value of `:coeffects`
+     - optionally, the originally supplied arbitrary `value`
+
+   This `coeffect handler` is expected to modify and return its first, `coeffects` argument.
+
+   Example Of how `inject-cofx` and `reg-cofx` work together
+   ---------------------------------------------------------
+
+   1. Early in app startup, you register a `coeffect handler` for `:datetime`:
+
+      (re-frame.core/reg-cofx
+        :datetime                        ;; usage  (inject-cofx :datetime)
+        (fn coeffect-handler
+          [coeffect]
+          (assoc coeffect :now (js/Date.))))   ;; modify and return first arg
+
+   2. Later, add an interceptor to an -fx event handler, using `inject-cofx`:
+
+      (re-frame.core/reg-event-fx        ;; we are registering an event handler
+         :event-id
+         [ ... (inject-cofx :datetime) ... ]    ;; <-- create an injecting interceptor
+         (fn event-handler
+           [coeffect event]
+           ... in here can access (:now coeffect) to obtain current datetime ... )))
+
+   Background
+   ----------
+
+   `coeffects` are the input resources required by an event handler
+   to perform its job. The two most obvious ones are `db` and `event`.
+   But sometimes an event handler might need other resources.
+
+   Perhaps an event handler needs a random number or a GUID or the current
+   datetime. Perhaps it needs access to a DataScript database connection.
+
+   If an event handler directly accesses these resources, it stops being
+   pure and, consequently, it becomes harder to test, etc. So we don't
+   want that.
+
+   Instead, the interceptor created by this function is a way to 'inject'
+   'necessary resources' into the `:coeffects` (map) subsequently given
+   to the event handler at call time."
+  ([id]
+  (->interceptor
+    :id      :coeffects
+    :before  (fn coeffects-before
+               [context]
+               (if-let [handler (get-handler kind id)]
+                 (update context :coeffects handler)
+                 (console :error "No cofx handler registered for" id)))))
+  ([id value]
+   (->interceptor
+     :id     :coeffects
+     :before  (fn coeffects-before
+                [context]
+                (if-let [handler (get-handler kind id)]
+                  (update context :coeffects handler value)
+                  (console :error "No cofx handler registered for" id))))))
+
+
+;; -- Builtin CoEffects Handlers  ---------------------------------------------
+
+;; :db
+;;
+;; Adds to coeffects the value in `app-db`, under the key `:db`
+(reg-cofx
+  :db
+  (fn db-coeffects-handler
+    [coeffects]
+    (assoc coeffects :db @app-db)))
+
+
+;; Because this interceptor is used so much, we reify it
+(def inject-db (inject-cofx :db))
+
+
diff --git a/js/re_frame/cofx.cljc.cache.json b/js/re_frame/cofx.cljc.cache.json
new file mode 100644
index 0000000..a290c30
--- /dev/null
+++ b/js/re_frame/cofx.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ ","~$console","~$re-frame.loggers"],"~:excludes",["~#set",[]],"~:name","~$re-frame.cofx","~:imports",null,"~:requires",["^ ","~$re-frame.db","^=","~$re-frame.interceptor","^>","~$re-frame.registrar","^?","^6","^6"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^5","^6","~$app-db","^=","~$->interceptor","^>","~$get-handler","^?","~$clear-handlers","^?","~$register-handler","^?"],"~:defs",["^ ","~$kind",["^ ","^9","~$re-frame.cofx/kind","~:file","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","~:line",11,"~:column",1,"~:end-line",11,"~:end-column",10,"~:meta",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","^K",11,"^L",6,"^M",11,"^N",10],"~:tag","~$cljs.core/Keyword"],"~$reg-cofx",["^ ","~:protocol-inline",null,"^O",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","^K",14,"^L",7,"^M",14,"^N",15,"~:arglists",["~#list",["~$quote",["^U",[["~$id","~$handler"]]]]],"~:doc","Register the given coeffect `handler` for the given `id`, for later use\n  within `inject-cofx`.\n\n  `id` is keyword, often namespaced.\n  `handler` is a function which takes either one or two arguements, the first of which is\n  always `coeffects` and which returns an updated `coeffects`.\n\n  See the docs for `inject-cofx` for example use."],"^9","~$re-frame.cofx/reg-cofx","~:variadic",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","^N",15,"~:method-params",["^U",[["^W","^X"]]],"~:protocol-impl",null,"~:arglists-meta",["^U",[null,null]],"^L",1,"^K",14,"^M",14,"~:max-fixed-arity",2,"~:fn-var",true,"^T",["^U",["^V",["^U",[["^W","^X"]]]]],"^Y","Register the given coeffect `handler` for the given `id`, for later use\n  within `inject-cofx`.\n\n  `id` is keyword, often namespaced.\n  `handler` is a function which takes either one or two arguements, the first of which is\n  always `coeffects` and which returns an updated `coeffects`.\n\n  See the docs for `inject-cofx` for example use."],"~$inject-cofx",["^ ","^S",null,"^O",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","^K",29,"^L",7,"^M",29,"^N",18,"^T",["^U",["^V",["^U",[["^W"],["^W","~$value"]]]]],"^Y","Given an `id`, and an optional, arbitrary `value`, returns an interceptor\n   whose `:before` adds to the `:coeffects` (map) by calling a pre-registered\n   'coeffect handler' identified by the `id`.\n\n   The previous association of a `coeffect handler` with an `id` will have\n   happened via a call to `re-frame.core/reg-cofx` - generally on program startup.\n\n   Within the created interceptor, this 'looked up' `coeffect handler` will\n   be called (within the `:before`) with two arguments:\n     - the current value of `:coeffects`\n     - optionally, the originally supplied arbitrary `value`\n\n   This `coeffect handler` is expected to modify and return its first, `coeffects` argument.\n\n   Example Of how `inject-cofx` and `reg-cofx` work together\n   ---------------------------------------------------------\n\n   1. Early in app startup, you register a `coeffect handler` for `:datetime`:\n\n      (re-frame.core/reg-cofx\n        :datetime                        ;; usage  (inject-cofx :datetime)\n        (fn coeffect-handler\n          [coeffect]\n          (assoc coeffect :now (js/Date.))))   ;; modify and return first arg\n\n   2. Later, add an interceptor to an -fx event handler, using `inject-cofx`:\n\n      (re-frame.core/reg-event-fx        ;; we are registering an event handler\n         :event-id\n         [ ... (inject-cofx :datetime) ... ]    ;; <-- create an injecting interceptor\n         (fn event-handler\n           [coeffect event]\n           ... in here can access (:now coeffect) to obtain current datetime ... )))\n\n   Background\n   ----------\n\n   `coeffects` are the input resources required by an event handler\n   to perform its job. The two most obvious ones are `db` and `event`.\n   But sometimes an event handler might need other resources.\n\n   Perhaps an event handler needs a random number or a GUID or the current\n   datetime. Perhaps it needs access to a DataScript database connection.\n\n   If an event handler directly accesses these resources, it stops being\n   pure and, consequently, it becomes harder to test, etc. So we don't\n   want that.\n\n   Instead, the interceptor created by this function is a way to 'inject'\n   'necessary resources' into the `:coeffects` (map) subsequently given\n   to the event handler at call time.","~:top-fn",["^ ","^[",false,"^13",2,"^10",["^U",[["^W"],["^W","^16"]]],"^T",["^U",[["^W"],["^W","^16"]]],"^12",["^U",[null,null]]]],"^9","~$re-frame.cofx/inject-cofx","^[",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","^N",18,"^17",["^ ","^[",false,"^13",2,"^10",["^U",[["^W"],["^W","^16"]]],"^T",["^U",[["^W"],["^W","^16"]]],"^12",["^U",[null,null]]],"^10",["^U",[["^W"],["^W","^16"]]],"^11",null,"^12",["^U",[null,null]],"^L",1,"^K",29,"^M",29,"^13",2,"^14",true,"^T",["^U",[["^W"],["^W","^16"]]],"^Y","Given an `id`, and an optional, arbitrary `value`, returns an interceptor\n   whose `:before` adds to the `:coeffects` (map) by calling a pre-registered\n   'coeffect handler' identified by the `id`.\n\n   The previous association of a `coeffect handler` with an `id` will have\n   happened via a call to `re-frame.core/reg-cofx` - generally on program startup.\n\n   Within the created interceptor, this 'looked up' `coeffect handler` will\n   be called (within the `:before`) with two arguments:\n     - the current value of `:coeffects`\n     - optionally, the originally supplied arbitrary `value`\n\n   This `coeffect handler` is expected to modify and return its first, `coeffects` argument.\n\n   Example Of how `inject-cofx` and `reg-cofx` work together\n   ---------------------------------------------------------\n\n   1. Early in app startup, you register a `coeffect handler` for `:datetime`:\n\n      (re-frame.core/reg-cofx\n        :datetime                        ;; usage  (inject-cofx :datetime)\n        (fn coeffect-handler\n          [coeffect]\n          (assoc coeffect :now (js/Date.))))   ;; modify and return first arg\n\n   2. Later, add an interceptor to an -fx event handler, using `inject-cofx`:\n\n      (re-frame.core/reg-event-fx        ;; we are registering an event handler\n         :event-id\n         [ ... (inject-cofx :datetime) ... ]    ;; <-- create an injecting interceptor\n         (fn event-handler\n           [coeffect event]\n           ... in here can access (:now coeffect) to obtain current datetime ... )))\n\n   Background\n   ----------\n\n   `coeffects` are the input resources required by an event handler\n   to perform its job. The two most obvious ones are `db` and `event`.\n   But sometimes an event handler might need other resources.\n\n   Perhaps an event handler needs a random number or a GUID or the current\n   datetime. Perhaps it needs access to a DataScript database connection.\n\n   If an event handler directly accesses these resources, it stops being\n   pure and, consequently, it becomes harder to test, etc. So we don't\n   want that.\n\n   Instead, the interceptor created by this function is a way to 'inject'\n   'necessary resources' into the `:coeffects` (map) subsequently given\n   to the event handler at call time."],"~$inject-db",["^ ","^9","~$re-frame.cofx/inject-db","^J","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","^K",112,"^L",1,"^M",112,"^N",15,"^O",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/64BC9AE/re_frame/cofx.cljc","^K",112,"^L",6,"^M",112,"^N",15],"^P","~$any"]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^8",["~:db","~:id","~:error","~:coeffects","~:cofx","~:before"]],"~:order",["^1D","^1A","^1C","^1E","^1B","^1@"]],"^Y",null]
\ No newline at end of file
diff --git a/js/re_frame/cofx.js b/js/re_frame/cofx.js
new file mode 100644
index 0000000..eae8c1d
--- /dev/null
+++ b/js/re_frame/cofx.js
@@ -0,0 +1,126 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.cofx');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.db');
+goog.require('re_frame.interceptor');
+goog.require('re_frame.registrar');
+goog.require('re_frame.loggers');
+re_frame.cofx.kind = cljs.core.cst$kw$cofx;
+if(cljs.core.truth_((re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1 ? re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1(re_frame.cofx.kind) : re_frame.registrar.kinds.call(null,re_frame.cofx.kind)))){
+} else {
+throw (new Error("Assert failed: (re-frame.registrar/kinds kind)"));
+}
+/**
+ * Register the given coeffect `handler` for the given `id`, for later use
+ *   within `inject-cofx`.
+ * 
+ *   `id` is keyword, often namespaced.
+ *   `handler` is a function which takes either one or two arguements, the first of which is
+ *   always `coeffects` and which returns an updated `coeffects`.
+ * 
+ *   See the docs for `inject-cofx` for example use.
+ */
+re_frame.cofx.reg_cofx = (function re_frame$cofx$reg_cofx(id,handler){
+return re_frame.registrar.register_handler(re_frame.cofx.kind,id,handler);
+});
+/**
+ * Given an `id`, and an optional, arbitrary `value`, returns an interceptor
+ * whose `:before` adds to the `:coeffects` (map) by calling a pre-registered
+ * 'coeffect handler' identified by the `id`.
+ * 
+ * The previous association of a `coeffect handler` with an `id` will have
+ * happened via a call to `re-frame.core/reg-cofx` - generally on program startup.
+ * 
+ * Within the created interceptor, this 'looked up' `coeffect handler` will
+ * be called (within the `:before`) with two arguments:
+ *   - the current value of `:coeffects`
+ *   - optionally, the originally supplied arbitrary `value`
+ * 
+ * This `coeffect handler` is expected to modify and return its first, `coeffects` argument.
+ * 
+ * Example Of how `inject-cofx` and `reg-cofx` work together
+ * ---------------------------------------------------------
+ * 
+ * 1. Early in app startup, you register a `coeffect handler` for `:datetime`:
+ * 
+ *    (re-frame.core/reg-cofx
+ *      :datetime                        ;; usage  (inject-cofx :datetime)
+ *      (fn coeffect-handler
+ *        [coeffect]
+ *        (assoc coeffect :now (js/Date.))))   ;; modify and return first arg
+ * 
+ * 2. Later, add an interceptor to an -fx event handler, using `inject-cofx`:
+ * 
+ *    (re-frame.core/reg-event-fx        ;; we are registering an event handler
+ *       :event-id
+ *       [ ... (inject-cofx :datetime) ... ]    ;; <-- create an injecting interceptor
+ *       (fn event-handler
+ *         [coeffect event]
+ *         ... in here can access (:now coeffect) to obtain current datetime ... )))
+ * 
+ * Background
+ * ----------
+ * 
+ * `coeffects` are the input resources required by an event handler
+ * to perform its job. The two most obvious ones are `db` and `event`.
+ * But sometimes an event handler might need other resources.
+ * 
+ * Perhaps an event handler needs a random number or a GUID or the current
+ * datetime. Perhaps it needs access to a DataScript database connection.
+ * 
+ * If an event handler directly accesses these resources, it stops being
+ * pure and, consequently, it becomes harder to test, etc. So we don't
+ * want that.
+ * 
+ * Instead, the interceptor created by this function is a way to 'inject'
+ * 'necessary resources' into the `:coeffects` (map) subsequently given
+ * to the event handler at call time.
+ */
+re_frame.cofx.inject_cofx = (function re_frame$cofx$inject_cofx(var_args){
+var G__5041 = arguments.length;
+switch (G__5041) {
+case 1:
+return re_frame.cofx.inject_cofx.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.cofx.inject_cofx.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.cofx.inject_cofx.cljs$core$IFn$_invoke$arity$1 = (function (id){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$coeffects,cljs.core.cst$kw$before,(function re_frame$cofx$coeffects_before(context){
+var temp__5455__auto__ = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(re_frame.cofx.kind,id);
+if(cljs.core.truth_(temp__5455__auto__)){
+var handler = temp__5455__auto__;
+return cljs.core.update.cljs$core$IFn$_invoke$arity$3(context,cljs.core.cst$kw$coeffects,handler);
+} else {
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["No cofx handler registered for",id], 0));
+}
+})], 0));
+});
+
+re_frame.cofx.inject_cofx.cljs$core$IFn$_invoke$arity$2 = (function (id,value){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$coeffects,cljs.core.cst$kw$before,(function re_frame$cofx$coeffects_before(context){
+var temp__5455__auto__ = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(re_frame.cofx.kind,id);
+if(cljs.core.truth_(temp__5455__auto__)){
+var handler = temp__5455__auto__;
+return cljs.core.update.cljs$core$IFn$_invoke$arity$4(context,cljs.core.cst$kw$coeffects,handler,value);
+} else {
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["No cofx handler registered for",id], 0));
+}
+})], 0));
+});
+
+re_frame.cofx.inject_cofx.cljs$lang$maxFixedArity = 2;
+
+re_frame.cofx.reg_cofx(cljs.core.cst$kw$db,(function re_frame$cofx$db_coeffects_handler(coeffects){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(coeffects,cljs.core.cst$kw$db,cljs.core.deref(re_frame.db.app_db));
+}));
+re_frame.cofx.inject_db = re_frame.cofx.inject_cofx.cljs$core$IFn$_invoke$arity$1(cljs.core.cst$kw$db);
diff --git a/js/re_frame/core.cljc b/js/re_frame/core.cljc
new file mode 100644
index 0000000..03c5744
--- /dev/null
+++ b/js/re_frame/core.cljc
@@ -0,0 +1,237 @@
+(ns re-frame.core
+  (:require
+    [re-frame.events           :as events]
+    [re-frame.subs             :as subs]
+    [re-frame.interop          :as interop]
+    [re-frame.db               :as db]
+    [re-frame.fx               :as fx]
+    [re-frame.cofx             :as cofx]
+    [re-frame.router           :as router]
+    [re-frame.loggers          :as loggers]
+    [re-frame.registrar        :as registrar]
+    [re-frame.interceptor      :as interceptor]
+    [re-frame.std-interceptors :as std-interceptors :refer [db-handler->interceptor
+                                                             fx-handler->interceptor
+                                                             ctx-handler->interceptor]]
+    [clojure.set               :as set]))
+
+
+;; -- API ---------------------------------------------------------------------
+;;
+;; This namespace represents the re-frame API
+;;
+;; Below, you'll see we've used this technique:
+;;   (def  api-name-for-fn    deeper.namespace/where-the-defn-is)
+;;
+;; So, we promote a `defn` in a deeper namespace "up" to the API
+;; via a `def` in this namespace.
+;;
+;; Turns out, this approach makes it hard:
+;;   - to auto-generate API docs
+;;   - for IDEs to provide code completion on functions in the API
+;;
+;; Which is annoying. But there are pros and cons and we haven't
+;; yet revisited the decision.  To compensate, we've added more nudity
+;; to the docs.
+;;
+
+
+;; -- dispatch ----------------------------------------------------------------
+(def dispatch       router/dispatch)
+(def dispatch-sync  router/dispatch-sync)
+
+
+;; -- subscriptions -----------------------------------------------------------
+(def reg-sub        subs/reg-sub)
+(def subscribe      subs/subscribe)
+
+(def clear-sub (partial registrar/clear-handlers subs/kind))  ;; think unreg-sub
+(def clear-subscription-cache! subs/clear-subscription-cache!)
+
+(defn reg-sub-raw
+  "This is a low level, advanced function.  You should probably be
+  using reg-sub instead.
+  Docs in https://github.com/Day8/re-frame/blob/master/docs/SubscriptionFlow.md"
+  [query-id handler-fn]
+  (registrar/register-handler subs/kind query-id handler-fn))
+
+
+;; -- effects -----------------------------------------------------------------
+(def reg-fx      fx/reg-fx)
+(def clear-fx    (partial registrar/clear-handlers fx/kind))  ;; think unreg-fx
+
+;; -- coeffects ---------------------------------------------------------------
+(def reg-cofx    cofx/reg-cofx)
+(def inject-cofx cofx/inject-cofx)
+(def clear-cofx (partial registrar/clear-handlers cofx/kind)) ;; think unreg-cofx
+
+
+;; -- Events ------------------------------------------------------------------
+
+(defn reg-event-db
+  "Register the given event `handler` (function) for the given `id`. Optionally, provide
+  an `interceptors` chain.
+  `id` is typically a namespaced keyword  (but can be anything)
+  `handler` is a function: (db event) -> db
+  `interceptors` is a collection of interceptors. Will be flattened and nils removed.
+  `handler` is wrapped in its own interceptor and added to the end of the interceptor
+   chain, so that, in the end, only a chain is registered.
+   Special effects and coeffects interceptors are added to the front of this
+   chain."
+  ([id handler]
+    (reg-event-db id nil handler))
+  ([id interceptors handler]
+   (events/register id [cofx/inject-db fx/do-fx interceptors (db-handler->interceptor handler)])))
+
+
+(defn reg-event-fx
+  "Register the given event `handler` (function) for the given `id`. Optionally, provide
+  an `interceptors` chain.
+  `id` is typically a namespaced keyword  (but can be anything)
+  `handler` is a function: (coeffects-map event-vector) -> effects-map
+  `interceptors` is a collection of interceptors. Will be flattened and nils removed.
+  `handler` is wrapped in its own interceptor and added to the end of the interceptor
+   chain, so that, in the end, only a chain is registered.
+   Special effects and coeffects interceptors are added to the front of the
+   interceptor chain.  These interceptors inject the value of app-db into coeffects,
+   and, later, action effects."
+  ([id handler]
+   (reg-event-fx id nil handler))
+  ([id interceptors handler]
+   (events/register id [cofx/inject-db fx/do-fx interceptors (fx-handler->interceptor handler)])))
+
+
+(defn reg-event-ctx
+  "Register the given event `handler` (function) for the given `id`. Optionally, provide
+  an `interceptors` chain.
+  `id` is typically a namespaced keyword  (but can be anything)
+  `handler` is a function: (context-map event-vector) -> context-map
+
+  This form of registration is almost never used. "
+  ([id handler]
+   (reg-event-ctx id nil handler))
+  ([id interceptors handler]
+   (events/register id [cofx/inject-db fx/do-fx interceptors (ctx-handler->interceptor handler)])))
+
+(def clear-event (partial registrar/clear-handlers events/kind)) ;; think unreg-event-*
+
+;; -- interceptors ------------------------------------------------------------
+
+;; Standard interceptors.
+;; Detailed docs on each in std-interceptors.cljs
+(def debug       std-interceptors/debug)
+(def path        std-interceptors/path)
+(def enrich      std-interceptors/enrich)
+(def trim-v      std-interceptors/trim-v)
+(def after       std-interceptors/after)
+(def on-changes  std-interceptors/on-changes)
+
+
+;; Utility functions for creating your own interceptors
+;;
+;;  (def my-interceptor
+;;     (->interceptor                ;; used to create an interceptor
+;;       :id     :my-interceptor     ;; an id - decorative only
+;;       :before (fn [context]                         ;; you normally want to change :coeffects
+;;                  ... use get-coeffect  and assoc-coeffect
+;;                       )
+;;       :after  (fn [context]                         ;; you normally want to change :effects
+;;                 (let [db (get-effect context :db)]  ;; (get-in context [:effects :db])
+;;                   (assoc-effect context :http-ajax {...}])))))
+;;
+(def ->interceptor   interceptor/->interceptor)
+(def get-coeffect    interceptor/get-coeffect)
+(def assoc-coeffect  interceptor/assoc-coeffect)
+(def get-effect      interceptor/get-effect)
+(def assoc-effect    interceptor/assoc-effect)
+(def enqueue         interceptor/enqueue)
+
+
+;; --  logging ----------------------------------------------------------------
+;; Internally, re-frame uses the logging functions: warn, log, error, group and groupEnd
+;; By default, these functions map directly to the js/console implementations,
+;; but you can override with your own fns (set or subset).
+;; Example Usage:
+;;   (defn my-fn [& args]  (post-it-somewhere (apply str args)))  ;; here is my alternative
+;;   (re-frame.core/set-loggers!  {:warn my-fn :log my-fn})       ;; override the defaults with mine
+(def set-loggers! loggers/set-loggers!)
+
+;; If you are writing an extension to re-frame, like perhaps
+;; an effects handler, you may want to use re-frame logging.
+;;
+;; usage: (console :error "Oh, dear God, it happened: " a-var " and " another)
+;;        (console :warn "Possible breach of containment wall at: " dt)
+(def console loggers/console)
+
+
+;; -- unit testing ------------------------------------------------------------
+
+(defn make-restore-fn
+  "Checkpoints the state of re-frame and returns a function which, when
+  later called, will restore re-frame to that checkpointed state.
+
+  Checkpoint includes app-db, all registered handlers and all subscriptions.
+  "
+  []
+  (let [handlers @registrar/kind->id->handler
+        app-db   @db/app-db
+				subs-cache @subs/query->reaction]
+    (fn []
+			;; call `dispose!` on all current subscriptions which
+			;; didn't originally exist.
+      (let [original-subs (set (vals subs-cache))
+            current-subs  (set (vals @subs/query->reaction))]
+        (doseq [sub (set/difference current-subs original-subs)]
+          (interop/dispose! sub)))
+
+      ;; Reset the atoms
+      ;; We don't need to reset subs/query->reaction, as
+      ;; disposing of the subs removes them from the cache anyway
+      (reset! registrar/kind->id->handler handlers)
+      (reset! db/app-db app-db)
+      nil)))
+
+(defn purge-event-queue
+  "Remove all events queued for processing"
+  []
+  (router/purge re-frame.router/event-queue))
+
+;; -- Event Processing Callbacks  ---------------------------------------------
+
+(defn add-post-event-callback
+  "Registers a function `f` to be called after each event is processed
+   `f` will be called with two arguments:
+    - `event`: a vector. The event just processed.
+    - `queue`: a PersistentQueue, possibly empty, of events yet to be processed.
+
+   This is useful in advanced cases like:
+     - you are implementing a complex bootstrap pipeline
+     - you want to create your own handling infrastructure, with perhaps multiple
+       handlers for the one event, etc.  Hook in here.
+     - libraries providing 'isomorphic javascript' rendering on  Nodejs or Nashorn.
+
+  'id' is typically a keyword. Supplied at \"add time\" so it can subsequently
+  be used at \"remove time\" to get rid of the right callback.
+  "
+  ([f]
+   (add-post-event-callback f f))   ;; use f as its own identifier
+  ([id f]
+   (router/add-post-event-callback re-frame.router/event-queue id f)))
+
+
+(defn remove-post-event-callback
+  [id]
+  (router/remove-post-event-callback re-frame.router/event-queue id))
+
+
+;; --  Deprecation ------------------------------------------------------------
+;; Assisting the v0.7.x ->  v0.8.x transition.
+(defn register-handler
+  [& args]
+  (console :warn  "re-frame:  \"register-handler\" has been renamed \"reg-event-db\" (look for registration of" (str (first args)) ")")
+  (apply reg-event-db args))
+
+(defn register-sub
+  [& args]
+  (console :warn  "re-frame:  \"register-sub\" is deprecated. Use \"reg-sub-raw\" (look for registration of" (str (first args)) ")")
+  (apply reg-sub-raw args))
diff --git a/js/re_frame/core.cljc.cache.json b/js/re_frame/core.cljc.cache.json
new file mode 100644
index 0000000..6c21f1f
--- /dev/null
+++ b/js/re_frame/core.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$re-frame.core","~:imports",null,"~:requires",["^ ","~$re-frame.interop","^;","~$subs","~$re-frame.subs","~$set","~$clojure.set","~$cofx","~$re-frame.cofx","~$re-frame.interceptor","^B","~$fx","~$re-frame.fx","~$re-frame.events","^E","~$loggers","~$re-frame.loggers","^D","^D","~$re-frame.registrar","^H","~$interceptor","^B","~$router","~$re-frame.router","~$db","~$re-frame.db","~$registrar","^H","^K","^K","^?","^?","~$events","^E","~$re-frame.std-interceptors","^P","^G","^G","^=","^=","~$interop","^;","~$std-interceptors","^P","^A","^A","^M","^M"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","~$ctx-handler->interceptor","^P","~$fx-handler->interceptor","^P","~$db-handler->interceptor","^P"],"~:defs",["^ ","~$console",["^ ","^7","~$re-frame.core/console","~:file","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","~:line",164,"~:column",1,"~:end-line",164,"~:end-column",13,"~:meta",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",164,"^11",6,"^12",164,"^13",13]],"~$on-changes",["^ ","^7","~$re-frame.core/on-changes","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",127,"^11",1,"^12",127,"^13",16,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",127,"^11",6,"^12",127,"^13",16]],"~$enrich",["^ ","^7","~$re-frame.core/enrich","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",124,"^11",1,"^12",124,"^13",12,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",124,"^11",6,"^12",124,"^13",12]],"~$reg-sub-raw",["^ ","~:protocol-inline",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",51,"^11",7,"^12",51,"^13",18,"~:arglists",["~#list",["~$quote",["^1<",[["~$query-id","~$handler-fn"]]]]],"~:doc","This is a low level, advanced function.  You should probably be\n  using reg-sub instead.\n  Docs in https://github.com/Day8/re-frame/blob/master/docs/SubscriptionFlow.md"],"^7","~$re-frame.core/reg-sub-raw","~:variadic",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",18,"~:method-params",["^1<",[["^1>","^1?"]]],"~:protocol-impl",null,"~:arglists-meta",["^1<",[null,null]],"^11",1,"^10",51,"^12",51,"~:max-fixed-arity",2,"~:fn-var",true,"^1;",["^1<",["^1=",["^1<",[["^1>","^1?"]]]]],"^1@","This is a low level, advanced function.  You should probably be\n  using reg-sub instead.\n  Docs in https://github.com/Day8/re-frame/blob/master/docs/SubscriptionFlow.md"],"~$subscribe",["^ ","^7","~$re-frame.core/subscribe","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",46,"^11",1,"^12",46,"^13",15,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",46,"^11",6,"^12",46,"^13",15]],"~$assoc-coeffect",["^ ","^7","~$re-frame.core/assoc-coeffect","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",144,"^11",1,"^12",144,"^13",20,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",144,"^11",6,"^12",144,"^13",20]],"~$register-sub",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",234,"^11",7,"^12",234,"^13",19,"^1;",["^1<",["^1=",["^1<",[["~$&","~$args"]]]]],"~:top-fn",["^ ","^1B",true,"^1F",0,"^1C",[["^1<",["^1M"]]],"^1;",["^1<",[["~$&","^1M"]]],"^1E",["^1<",[null]]]],"^7","~$re-frame.core/register-sub","^1B",true,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",19,"^1N",["^ ","^1B",true,"^1F",0,"^1C",[["^1<",["^1M"]]],"^1;",["^1<",[["~$&","^1M"]]],"^1E",["^1<",[null]]],"^1C",[["^1<",["^1M"]]],"^1D",null,"^1E",["^1<",[null]],"^11",1,"^10",234,"^12",234,"^1F",0,"^1G",true,"^1;",["^1<",[["~$&","^1M"]]]],"~$purge-event-queue",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",194,"^11",7,"^12",194,"^13",24,"^1;",["^1<",["^1=",["^1<",[[]]]]],"^1@","Remove all events queued for processing"],"^7","~$re-frame.core/purge-event-queue","^1B",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",24,"^1C",["^1<",[[]]],"^1D",null,"^1E",["^1<",[null,null]],"^11",1,"^10",194,"^12",194,"^1F",0,"^1G",true,"^1;",["^1<",["^1=",["^1<",[[]]]]],"^1@","Remove all events queued for processing"],"~$remove-post-event-callback",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",222,"^11",7,"^12",222,"^13",33,"^1;",["^1<",["^1=",["^1<",[["~$id"]]]]]],"^7","~$re-frame.core/remove-post-event-callback","^1B",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",33,"^1C",["^1<",[["^1S"]]],"^1D",null,"^1E",["^1<",[null,null]],"^11",1,"^10",222,"^12",222,"^1F",1,"^1G",true,"^1;",["^1<",["^1=",["^1<",[["^1S"]]]]]],"~$path",["^ ","^7","~$re-frame.core/path","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",123,"^11",1,"^12",123,"^13",10,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",123,"^11",6,"^12",123,"^13",10]],"~$reg-sub",["^ ","^7","~$re-frame.core/reg-sub","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",45,"^11",1,"^12",45,"^13",13,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",45,"^11",6,"^12",45,"^13",13]],"~$make-restore-fn",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",169,"^11",7,"^12",169,"^13",22,"^1;",["^1<",["^1=",["^1<",[[]]]]],"^1@","Checkpoints the state of re-frame and returns a function which, when\n  later called, will restore re-frame to that checkpointed state.\n\n  Checkpoint includes app-db, all registered handlers and all subscriptions.\n  "],"^7","~$re-frame.core/make-restore-fn","^1B",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",22,"^1C",["^1<",[[]]],"^1D",null,"^1E",["^1<",[null,null]],"^11",1,"^10",169,"^12",169,"^1F",0,"^1G",true,"^1;",["^1<",["^1=",["^1<",[[]]]]],"^1@","Checkpoints the state of re-frame and returns a function which, when\n  later called, will restore re-frame to that checkpointed state.\n\n  Checkpoint includes app-db, all registered handlers and all subscriptions.\n  "],"~$clear-fx",["^ ","^7","~$re-frame.core/clear-fx","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",61,"^11",1,"^12",61,"^13",14,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",61,"^11",6,"^12",61,"^13",14],"~:tag","~$any"],"~$get-effect",["^ ","^7","~$re-frame.core/get-effect","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",145,"^11",1,"^12",145,"^13",16,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",145,"^11",6,"^12",145,"^13",16]],"~$reg-event-db",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",71,"^11",7,"^12",71,"^13",19,"^1;",["^1<",["^1=",["^1<",[["^1S","~$handler"],["^1S","~$interceptors","^26"]]]]],"^1@","Register the given event `handler` (function) for the given `id`. Optionally, provide\n  an `interceptors` chain.\n  `id` is typically a namespaced keyword  (but can be anything)\n  `handler` is a function: (db event) -> db\n  `interceptors` is a collection of interceptors. Will be flattened and nils removed.\n  `handler` is wrapped in its own interceptor and added to the end of the interceptor\n   chain, so that, in the end, only a chain is registered.\n   Special effects and coeffects interceptors are added to the front of this\n   chain.","^1N",["^ ","^1B",false,"^1F",3,"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1E",["^1<",[null,null]]]],"^7","~$re-frame.core/reg-event-db","^1B",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",19,"^1N",["^ ","^1B",false,"^1F",3,"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1E",["^1<",[null,null]]],"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1D",null,"^1E",["^1<",[null,null]],"^11",1,"^10",71,"^12",71,"^1F",3,"^1G",true,"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1@","Register the given event `handler` (function) for the given `id`. Optionally, provide\n  an `interceptors` chain.\n  `id` is typically a namespaced keyword  (but can be anything)\n  `handler` is a function: (db event) -> db\n  `interceptors` is a collection of interceptors. Will be flattened and nils removed.\n  `handler` is wrapped in its own interceptor and added to the end of the interceptor\n   chain, so that, in the end, only a chain is registered.\n   Special effects and coeffects interceptors are added to the front of this\n   chain."],"~$dispatch-sync",["^ ","^7","~$re-frame.core/dispatch-sync","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",41,"^11",1,"^12",41,"^13",19,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",41,"^11",6,"^12",41,"^13",19]],"~$clear-event",["^ ","^7","~$re-frame.core/clear-event","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",116,"^11",1,"^12",116,"^13",17,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",116,"^11",6,"^12",116,"^13",17],"^21","^22"],"~$->interceptor",["^ ","^7","~$re-frame.core/->interceptor","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",142,"^11",1,"^12",142,"^13",19,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",142,"^11",6,"^12",142,"^13",19]],"~$set-loggers!",["^ ","^7","~$re-frame.core/set-loggers!","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",157,"^11",1,"^12",157,"^13",18,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",157,"^11",6,"^12",157,"^13",18]],"~$inject-cofx",["^ ","^7","~$re-frame.core/inject-cofx","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",65,"^11",1,"^12",65,"^13",17,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",65,"^11",6,"^12",65,"^13",17]],"~$get-coeffect",["^ ","^7","~$re-frame.core/get-coeffect","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",143,"^11",1,"^12",143,"^13",18,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",143,"^11",6,"^12",143,"^13",18]],"~$debug",["^ ","^7","~$re-frame.core/debug","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",122,"^11",1,"^12",122,"^13",11,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",122,"^11",6,"^12",122,"^13",11],"^21","^22"],"~$assoc-effect",["^ ","^7","~$re-frame.core/assoc-effect","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",146,"^11",1,"^12",146,"^13",18,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",146,"^11",6,"^12",146,"^13",18]],"~$enqueue",["^ ","^7","~$re-frame.core/enqueue","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",147,"^11",1,"^12",147,"^13",13,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",147,"^11",6,"^12",147,"^13",13]],"~$clear-cofx",["^ ","^7","~$re-frame.core/clear-cofx","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",66,"^11",1,"^12",66,"^13",16,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",66,"^11",6,"^12",66,"^13",16],"^21","^22"],"~$reg-event-ctx",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",104,"^11",7,"^12",104,"^13",20,"^1;",["^1<",["^1=",["^1<",[["^1S","^26"],["^1S","^27","^26"]]]]],"^1@","Register the given event `handler` (function) for the given `id`. Optionally, provide\n  an `interceptors` chain.\n  `id` is typically a namespaced keyword  (but can be anything)\n  `handler` is a function: (context-map event-vector) -> context-map\n\n  This form of registration is almost never used. ","^1N",["^ ","^1B",false,"^1F",3,"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1E",["^1<",[null,null]]]],"^7","~$re-frame.core/reg-event-ctx","^1B",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",20,"^1N",["^ ","^1B",false,"^1F",3,"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1E",["^1<",[null,null]]],"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1D",null,"^1E",["^1<",[null,null]],"^11",1,"^10",104,"^12",104,"^1F",3,"^1G",true,"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1@","Register the given event `handler` (function) for the given `id`. Optionally, provide\n  an `interceptors` chain.\n  `id` is typically a namespaced keyword  (but can be anything)\n  `handler` is a function: (context-map event-vector) -> context-map\n\n  This form of registration is almost never used. "],"~$reg-fx",["^ ","^7","~$re-frame.core/reg-fx","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",60,"^11",1,"^12",60,"^13",12,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",60,"^11",6,"^12",60,"^13",12]],"~$trim-v",["^ ","^7","~$re-frame.core/trim-v","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",125,"^11",1,"^12",125,"^13",12,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",125,"^11",6,"^12",125,"^13",12],"^21","^22"],"~$clear-sub",["^ ","^7","~$re-frame.core/clear-sub","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",48,"^11",1,"^12",48,"^13",15,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",48,"^11",6,"^12",48,"^13",15],"^21","^22"],"~$dispatch",["^ ","^7","~$re-frame.core/dispatch","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",40,"^11",1,"^12",40,"^13",14,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",40,"^11",6,"^12",40,"^13",14]],"~$after",["^ ","^7","~$re-frame.core/after","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",126,"^11",1,"^12",126,"^13",11,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",126,"^11",6,"^12",126,"^13",11]],"~$add-post-event-callback",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",201,"^11",7,"^12",201,"^13",30,"^1;",["^1<",["^1=",["^1<",[["~$f"],["^1S","~$f"]]]]],"^1@","Registers a function `f` to be called after each event is processed\n   `f` will be called with two arguments:\n    - `event`: a vector. The event just processed.\n    - `queue`: a PersistentQueue, possibly empty, of events yet to be processed.\n\n   This is useful in advanced cases like:\n     - you are implementing a complex bootstrap pipeline\n     - you want to create your own handling infrastructure, with perhaps multiple\n       handlers for the one event, etc.  Hook in here.\n     - libraries providing 'isomorphic javascript' rendering on  Nodejs or Nashorn.\n\n  'id' is typically a keyword. Supplied at \"add time\" so it can subsequently\n  be used at \"remove time\" to get rid of the right callback.\n  ","^1N",["^ ","^1B",false,"^1F",2,"^1C",["^1<",[["~$f"],["^1S","~$f"]]],"^1;",["^1<",[["~$f"],["^1S","~$f"]]],"^1E",["^1<",[null,null]]]],"^7","~$re-frame.core/add-post-event-callback","^1B",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",30,"^1N",["^ ","^1B",false,"^1F",2,"^1C",["^1<",[["~$f"],["^1S","~$f"]]],"^1;",["^1<",[["~$f"],["^1S","~$f"]]],"^1E",["^1<",[null,null]]],"^1C",["^1<",[["~$f"],["^1S","~$f"]]],"^1D",null,"^1E",["^1<",[null,null]],"^11",1,"^10",201,"^12",201,"^1F",2,"^1G",true,"^1;",["^1<",[["~$f"],["^1S","~$f"]]],"^1@","Registers a function `f` to be called after each event is processed\n   `f` will be called with two arguments:\n    - `event`: a vector. The event just processed.\n    - `queue`: a PersistentQueue, possibly empty, of events yet to be processed.\n\n   This is useful in advanced cases like:\n     - you are implementing a complex bootstrap pipeline\n     - you want to create your own handling infrastructure, with perhaps multiple\n       handlers for the one event, etc.  Hook in here.\n     - libraries providing 'isomorphic javascript' rendering on  Nodejs or Nashorn.\n\n  'id' is typically a keyword. Supplied at \"add time\" so it can subsequently\n  be used at \"remove time\" to get rid of the right callback.\n  "],"~$reg-cofx",["^ ","^7","~$re-frame.core/reg-cofx","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",64,"^11",1,"^12",64,"^13",14,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",64,"^11",6,"^12",64,"^13",14]],"~$reg-event-fx",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",87,"^11",7,"^12",87,"^13",19,"^1;",["^1<",["^1=",["^1<",[["^1S","^26"],["^1S","^27","^26"]]]]],"^1@","Register the given event `handler` (function) for the given `id`. Optionally, provide\n  an `interceptors` chain.\n  `id` is typically a namespaced keyword  (but can be anything)\n  `handler` is a function: (coeffects-map event-vector) -> effects-map\n  `interceptors` is a collection of interceptors. Will be flattened and nils removed.\n  `handler` is wrapped in its own interceptor and added to the end of the interceptor\n   chain, so that, in the end, only a chain is registered.\n   Special effects and coeffects interceptors are added to the front of the\n   interceptor chain.  These interceptors inject the value of app-db into coeffects,\n   and, later, action effects.","^1N",["^ ","^1B",false,"^1F",3,"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1E",["^1<",[null,null]]]],"^7","~$re-frame.core/reg-event-fx","^1B",false,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",19,"^1N",["^ ","^1B",false,"^1F",3,"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1E",["^1<",[null,null]]],"^1C",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1D",null,"^1E",["^1<",[null,null]],"^11",1,"^10",87,"^12",87,"^1F",3,"^1G",true,"^1;",["^1<",[["^1S","^26"],["^1S","^27","^26"]]],"^1@","Register the given event `handler` (function) for the given `id`. Optionally, provide\n  an `interceptors` chain.\n  `id` is typically a namespaced keyword  (but can be anything)\n  `handler` is a function: (coeffects-map event-vector) -> effects-map\n  `interceptors` is a collection of interceptors. Will be flattened and nils removed.\n  `handler` is wrapped in its own interceptor and added to the end of the interceptor\n   chain, so that, in the end, only a chain is registered.\n   Special effects and coeffects interceptors are added to the front of the\n   interceptor chain.  These interceptors inject the value of app-db into coeffects,\n   and, later, action effects."],"~$register-handler",["^ ","^1:",null,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",229,"^11",7,"^12",229,"^13",23,"^1;",["^1<",["^1=",["^1<",[["~$&","^1M"]]]]],"^1N",["^ ","^1B",true,"^1F",0,"^1C",[["^1<",["^1M"]]],"^1;",["^1<",[["~$&","^1M"]]],"^1E",["^1<",[null]]]],"^7","~$re-frame.core/register-handler","^1B",true,"^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^13",23,"^1N",["^ ","^1B",true,"^1F",0,"^1C",[["^1<",["^1M"]]],"^1;",["^1<",[["~$&","^1M"]]],"^1E",["^1<",[null]]],"^1C",[["^1<",["^1M"]]],"^1D",null,"^1E",["^1<",[null]],"^11",1,"^10",229,"^12",229,"^1F",0,"^1G",true,"^1;",["^1<",[["~$&","^1M"]]]],"~$clear-subscription-cache!",["^ ","^7","~$re-frame.core/clear-subscription-cache!","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",49,"^11",1,"^12",49,"^13",31,"^14",["^ ","^[","/home/julien/.cljs/.aot_cache/1.10.329/D20F42F/re_frame/core.cljc","^10",49,"^11",6,"^12",49,"^13",31]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["~:warn"]],"~:order",["^3;"]],"^1@",null]
\ No newline at end of file
diff --git a/js/re_frame/core.js b/js/re_frame/core.js
new file mode 100644
index 0000000..81d9be4
--- /dev/null
+++ b/js/re_frame/core.js
@@ -0,0 +1,368 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.core');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.events');
+goog.require('re_frame.subs');
+goog.require('re_frame.interop');
+goog.require('re_frame.db');
+goog.require('re_frame.fx');
+goog.require('re_frame.cofx');
+goog.require('re_frame.router');
+goog.require('re_frame.loggers');
+goog.require('re_frame.registrar');
+goog.require('re_frame.interceptor');
+goog.require('re_frame.std_interceptors');
+goog.require('clojure.set');
+re_frame.core.dispatch = re_frame.router.dispatch;
+re_frame.core.dispatch_sync = re_frame.router.dispatch_sync;
+re_frame.core.reg_sub = re_frame.subs.reg_sub;
+re_frame.core.subscribe = re_frame.subs.subscribe;
+re_frame.core.clear_sub = cljs.core.partial.cljs$core$IFn$_invoke$arity$2(re_frame.registrar.clear_handlers,re_frame.subs.kind);
+re_frame.core.clear_subscription_cache_BANG_ = re_frame.subs.clear_subscription_cache_BANG_;
+/**
+ * This is a low level, advanced function.  You should probably be
+ *   using reg-sub instead.
+ *   Docs in https://github.com/Day8/re-frame/blob/master/docs/SubscriptionFlow.md
+ */
+re_frame.core.reg_sub_raw = (function re_frame$core$reg_sub_raw(query_id,handler_fn){
+return re_frame.registrar.register_handler(re_frame.subs.kind,query_id,handler_fn);
+});
+re_frame.core.reg_fx = re_frame.fx.reg_fx;
+re_frame.core.clear_fx = cljs.core.partial.cljs$core$IFn$_invoke$arity$2(re_frame.registrar.clear_handlers,re_frame.fx.kind);
+re_frame.core.reg_cofx = re_frame.cofx.reg_cofx;
+re_frame.core.inject_cofx = re_frame.cofx.inject_cofx;
+re_frame.core.clear_cofx = cljs.core.partial.cljs$core$IFn$_invoke$arity$2(re_frame.registrar.clear_handlers,re_frame.cofx.kind);
+/**
+ * Register the given event `handler` (function) for the given `id`. Optionally, provide
+ *   an `interceptors` chain.
+ *   `id` is typically a namespaced keyword  (but can be anything)
+ *   `handler` is a function: (db event) -> db
+ *   `interceptors` is a collection of interceptors. Will be flattened and nils removed.
+ *   `handler` is wrapped in its own interceptor and added to the end of the interceptor
+ * chain, so that, in the end, only a chain is registered.
+ * Special effects and coeffects interceptors are added to the front of this
+ * chain.
+ */
+re_frame.core.reg_event_db = (function re_frame$core$reg_event_db(var_args){
+var G__5299 = arguments.length;
+switch (G__5299) {
+case 2:
+return re_frame.core.reg_event_db.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return re_frame.core.reg_event_db.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.core.reg_event_db.cljs$core$IFn$_invoke$arity$2 = (function (id,handler){
+return re_frame.core.reg_event_db.cljs$core$IFn$_invoke$arity$3(id,null,handler);
+});
+
+re_frame.core.reg_event_db.cljs$core$IFn$_invoke$arity$3 = (function (id,interceptors,handler){
+return re_frame.events.register(id,new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [re_frame.cofx.inject_db,re_frame.fx.do_fx,interceptors,re_frame.std_interceptors.db_handler__GT_interceptor(handler)], null));
+});
+
+re_frame.core.reg_event_db.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Register the given event `handler` (function) for the given `id`. Optionally, provide
+ *   an `interceptors` chain.
+ *   `id` is typically a namespaced keyword  (but can be anything)
+ *   `handler` is a function: (coeffects-map event-vector) -> effects-map
+ *   `interceptors` is a collection of interceptors. Will be flattened and nils removed.
+ *   `handler` is wrapped in its own interceptor and added to the end of the interceptor
+ * chain, so that, in the end, only a chain is registered.
+ * Special effects and coeffects interceptors are added to the front of the
+ * interceptor chain.  These interceptors inject the value of app-db into coeffects,
+ * and, later, action effects.
+ */
+re_frame.core.reg_event_fx = (function re_frame$core$reg_event_fx(var_args){
+var G__5302 = arguments.length;
+switch (G__5302) {
+case 2:
+return re_frame.core.reg_event_fx.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return re_frame.core.reg_event_fx.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.core.reg_event_fx.cljs$core$IFn$_invoke$arity$2 = (function (id,handler){
+return re_frame.core.reg_event_fx.cljs$core$IFn$_invoke$arity$3(id,null,handler);
+});
+
+re_frame.core.reg_event_fx.cljs$core$IFn$_invoke$arity$3 = (function (id,interceptors,handler){
+return re_frame.events.register(id,new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [re_frame.cofx.inject_db,re_frame.fx.do_fx,interceptors,re_frame.std_interceptors.fx_handler__GT_interceptor(handler)], null));
+});
+
+re_frame.core.reg_event_fx.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Register the given event `handler` (function) for the given `id`. Optionally, provide
+ *   an `interceptors` chain.
+ *   `id` is typically a namespaced keyword  (but can be anything)
+ *   `handler` is a function: (context-map event-vector) -> context-map
+ * 
+ *   This form of registration is almost never used. 
+ */
+re_frame.core.reg_event_ctx = (function re_frame$core$reg_event_ctx(var_args){
+var G__5305 = arguments.length;
+switch (G__5305) {
+case 2:
+return re_frame.core.reg_event_ctx.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return re_frame.core.reg_event_ctx.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.core.reg_event_ctx.cljs$core$IFn$_invoke$arity$2 = (function (id,handler){
+return re_frame.core.reg_event_ctx.cljs$core$IFn$_invoke$arity$3(id,null,handler);
+});
+
+re_frame.core.reg_event_ctx.cljs$core$IFn$_invoke$arity$3 = (function (id,interceptors,handler){
+return re_frame.events.register(id,new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [re_frame.cofx.inject_db,re_frame.fx.do_fx,interceptors,re_frame.std_interceptors.ctx_handler__GT_interceptor(handler)], null));
+});
+
+re_frame.core.reg_event_ctx.cljs$lang$maxFixedArity = 3;
+
+re_frame.core.clear_event = cljs.core.partial.cljs$core$IFn$_invoke$arity$2(re_frame.registrar.clear_handlers,re_frame.events.kind);
+re_frame.core.debug = re_frame.std_interceptors.debug;
+re_frame.core.path = re_frame.std_interceptors.path;
+re_frame.core.enrich = re_frame.std_interceptors.enrich;
+re_frame.core.trim_v = re_frame.std_interceptors.trim_v;
+re_frame.core.after = re_frame.std_interceptors.after;
+re_frame.core.on_changes = re_frame.std_interceptors.on_changes;
+re_frame.core.__GT_interceptor = re_frame.interceptor.__GT_interceptor;
+re_frame.core.get_coeffect = re_frame.interceptor.get_coeffect;
+re_frame.core.assoc_coeffect = re_frame.interceptor.assoc_coeffect;
+re_frame.core.get_effect = re_frame.interceptor.get_effect;
+re_frame.core.assoc_effect = re_frame.interceptor.assoc_effect;
+re_frame.core.enqueue = re_frame.interceptor.enqueue;
+re_frame.core.set_loggers_BANG_ = re_frame.loggers.set_loggers_BANG_;
+re_frame.core.console = re_frame.loggers.console;
+/**
+ * Checkpoints the state of re-frame and returns a function which, when
+ *   later called, will restore re-frame to that checkpointed state.
+ * 
+ *   Checkpoint includes app-db, all registered handlers and all subscriptions.
+ *   
+ */
+re_frame.core.make_restore_fn = (function re_frame$core$make_restore_fn(){
+var handlers = cljs.core.deref(re_frame.registrar.kind__GT_id__GT_handler);
+var app_db = cljs.core.deref(re_frame.db.app_db);
+var subs_cache = cljs.core.deref(re_frame.subs.query__GT_reaction);
+return ((function (handlers,app_db,subs_cache){
+return (function (){
+var original_subs_5311 = cljs.core.set(cljs.core.vals(subs_cache));
+var current_subs_5312 = cljs.core.set(cljs.core.vals(cljs.core.deref(re_frame.subs.query__GT_reaction)));
+var seq__5307_5313 = cljs.core.seq(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(current_subs_5312,original_subs_5311));
+var chunk__5308_5314 = null;
+var count__5309_5315 = (0);
+var i__5310_5316 = (0);
+while(true){
+if((i__5310_5316 < count__5309_5315)){
+var sub_5317 = chunk__5308_5314.cljs$core$IIndexed$_nth$arity$2(null,i__5310_5316);
+re_frame.interop.dispose_BANG_(sub_5317);
+
+
+var G__5318 = seq__5307_5313;
+var G__5319 = chunk__5308_5314;
+var G__5320 = count__5309_5315;
+var G__5321 = (i__5310_5316 + (1));
+seq__5307_5313 = G__5318;
+chunk__5308_5314 = G__5319;
+count__5309_5315 = G__5320;
+i__5310_5316 = G__5321;
+continue;
+} else {
+var temp__5457__auto___5322 = cljs.core.seq(seq__5307_5313);
+if(temp__5457__auto___5322){
+var seq__5307_5323__$1 = temp__5457__auto___5322;
+if(cljs.core.chunked_seq_QMARK_(seq__5307_5323__$1)){
+var c__4338__auto___5324 = cljs.core.chunk_first(seq__5307_5323__$1);
+var G__5325 = cljs.core.chunk_rest(seq__5307_5323__$1);
+var G__5326 = c__4338__auto___5324;
+var G__5327 = cljs.core.count(c__4338__auto___5324);
+var G__5328 = (0);
+seq__5307_5313 = G__5325;
+chunk__5308_5314 = G__5326;
+count__5309_5315 = G__5327;
+i__5310_5316 = G__5328;
+continue;
+} else {
+var sub_5329 = cljs.core.first(seq__5307_5323__$1);
+re_frame.interop.dispose_BANG_(sub_5329);
+
+
+var G__5330 = cljs.core.next(seq__5307_5323__$1);
+var G__5331 = null;
+var G__5332 = (0);
+var G__5333 = (0);
+seq__5307_5313 = G__5330;
+chunk__5308_5314 = G__5331;
+count__5309_5315 = G__5332;
+i__5310_5316 = G__5333;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+cljs.core.reset_BANG_(re_frame.registrar.kind__GT_id__GT_handler,handlers);
+
+cljs.core.reset_BANG_(re_frame.db.app_db,app_db);
+
+return null;
+});
+;})(handlers,app_db,subs_cache))
+});
+/**
+ * Remove all events queued for processing
+ */
+re_frame.core.purge_event_queue = (function re_frame$core$purge_event_queue(){
+return re_frame.router.purge(re_frame.router.event_queue);
+});
+/**
+ * Registers a function `f` to be called after each event is processed
+ * `f` will be called with two arguments:
+ *  - `event`: a vector. The event just processed.
+ *  - `queue`: a PersistentQueue, possibly empty, of events yet to be processed.
+ * 
+ * This is useful in advanced cases like:
+ *   - you are implementing a complex bootstrap pipeline
+ *   - you want to create your own handling infrastructure, with perhaps multiple
+ *     handlers for the one event, etc.  Hook in here.
+ *   - libraries providing 'isomorphic javascript' rendering on  Nodejs or Nashorn.
+ * 
+ *   'id' is typically a keyword. Supplied at "add time" so it can subsequently
+ *   be used at "remove time" to get rid of the right callback.
+ *   
+ */
+re_frame.core.add_post_event_callback = (function re_frame$core$add_post_event_callback(var_args){
+var G__5335 = arguments.length;
+switch (G__5335) {
+case 1:
+return re_frame.core.add_post_event_callback.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.core.add_post_event_callback.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.core.add_post_event_callback.cljs$core$IFn$_invoke$arity$1 = (function (f){
+return re_frame.core.add_post_event_callback.cljs$core$IFn$_invoke$arity$2(f,f);
+});
+
+re_frame.core.add_post_event_callback.cljs$core$IFn$_invoke$arity$2 = (function (id,f){
+return re_frame.router.add_post_event_callback(re_frame.router.event_queue,id,f);
+});
+
+re_frame.core.add_post_event_callback.cljs$lang$maxFixedArity = 2;
+
+re_frame.core.remove_post_event_callback = (function re_frame$core$remove_post_event_callback(id){
+return re_frame.router.remove_post_event_callback(re_frame.router.event_queue,id);
+});
+re_frame.core.register_handler = (function re_frame$core$register_handler(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___5342 = arguments.length;
+var i__4519__auto___5343 = (0);
+while(true){
+if((i__4519__auto___5343 < len__4518__auto___5342)){
+args__4521__auto__.push((arguments[i__4519__auto___5343]));
+
+var G__5344 = (i__4519__auto___5343 + (1));
+i__4519__auto___5343 = G__5344;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return re_frame.core.register_handler.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+re_frame.core.register_handler.cljs$core$IFn$_invoke$arity$variadic = (function (args){
+var G__5338_5345 = cljs.core.cst$kw$warn;
+var G__5339_5346 = "re-frame:  \"register-handler\" has been renamed \"reg-event-db\" (look for registration of";
+var G__5340_5347 = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(args))].join('');
+var G__5341_5348 = ")";
+(re_frame.core.console.cljs$core$IFn$_invoke$arity$4 ? re_frame.core.console.cljs$core$IFn$_invoke$arity$4(G__5338_5345,G__5339_5346,G__5340_5347,G__5341_5348) : re_frame.core.console.call(null,G__5338_5345,G__5339_5346,G__5340_5347,G__5341_5348));
+
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(re_frame.core.reg_event_db,args);
+});
+
+re_frame.core.register_handler.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+re_frame.core.register_handler.cljs$lang$applyTo = (function (seq5337){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq5337));
+});
+
+re_frame.core.register_sub = (function re_frame$core$register_sub(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___5354 = arguments.length;
+var i__4519__auto___5355 = (0);
+while(true){
+if((i__4519__auto___5355 < len__4518__auto___5354)){
+args__4521__auto__.push((arguments[i__4519__auto___5355]));
+
+var G__5356 = (i__4519__auto___5355 + (1));
+i__4519__auto___5355 = G__5356;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return re_frame.core.register_sub.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+re_frame.core.register_sub.cljs$core$IFn$_invoke$arity$variadic = (function (args){
+var G__5350_5357 = cljs.core.cst$kw$warn;
+var G__5351_5358 = "re-frame:  \"register-sub\" is deprecated. Use \"reg-sub-raw\" (look for registration of";
+var G__5352_5359 = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(args))].join('');
+var G__5353_5360 = ")";
+(re_frame.core.console.cljs$core$IFn$_invoke$arity$4 ? re_frame.core.console.cljs$core$IFn$_invoke$arity$4(G__5350_5357,G__5351_5358,G__5352_5359,G__5353_5360) : re_frame.core.console.call(null,G__5350_5357,G__5351_5358,G__5352_5359,G__5353_5360));
+
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(re_frame.core.reg_sub_raw,args);
+});
+
+re_frame.core.register_sub.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+re_frame.core.register_sub.cljs$lang$applyTo = (function (seq5349){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq5349));
+});
+
diff --git a/js/re_frame/db.cljc b/js/re_frame/db.cljc
new file mode 100644
index 0000000..5d9bef0
--- /dev/null
+++ b/js/re_frame/db.cljc
@@ -0,0 +1,11 @@
+(ns re-frame.db
+  (:require [re-frame.interop :refer [ratom]]))
+
+
+;; -- Application State  --------------------------------------------------------------------------
+;;
+;; Should not be accessed directly by application code.
+;; Read access goes through subscriptions.
+;; Updates via event handlers.
+(def app-db (ratom {}))
+
diff --git a/js/re_frame/db.cljc.cache.json b/js/re_frame/db.cljc.cache.json
new file mode 100644
index 0000000..9bf085e
--- /dev/null
+++ b/js/re_frame/db.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ ","~$ratom","~$re-frame.interop"],"~:excludes",["~#set",[]],"~:name","~$re-frame.db","~:imports",null,"~:requires",["^ ","^4","^4"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^3","^4"],"~:defs",["^ ","~$app-db",["^ ","^7","~$re-frame.db/app-db","~:file","/home/julien/.cljs/.aot_cache/1.10.329/C7F1BA2/re_frame/db.cljc","~:line",10,"~:column",1,"~:end-line",10,"~:end-column",12,"~:meta",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/C7F1BA2/re_frame/db.cljc","^A",10,"^B",6,"^C",10,"^D",12],"~:tag","~$any"]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:doc",null]
\ No newline at end of file
diff --git a/js/re_frame/db.js b/js/re_frame/db.js
new file mode 100644
index 0000000..6e4da48
--- /dev/null
+++ b/js/re_frame/db.js
@@ -0,0 +1,6 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.db');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.interop');
+re_frame.db.app_db = re_frame.interop.ratom(cljs.core.PersistentArrayMap.EMPTY);
diff --git a/js/re_frame/events.cljc b/js/re_frame/events.cljc
new file mode 100644
index 0000000..89a4af4
--- /dev/null
+++ b/js/re_frame/events.cljc
@@ -0,0 +1,68 @@
+(ns re-frame.events
+  (:require [re-frame.db          :refer [app-db]]
+            [re-frame.utils       :refer [first-in-vector]]
+            [re-frame.interop     :refer [empty-queue debug-enabled?]]
+            [re-frame.registrar   :refer [get-handler register-handler]]
+            [re-frame.loggers     :refer [console]]
+            [re-frame.interceptor :as  interceptor]
+            [re-frame.trace       :as trace :include-macros true]))
+
+
+(def kind :event)
+(assert (re-frame.registrar/kinds kind))
+
+(defn- flatten-and-remove-nils
+  "`interceptors` might have nested collections, and contain nil elements.
+  return a flat collection, with all nils removed.
+  This function is 9/10 about giving good error messages."
+  [id interceptors]
+  (let [make-chain  #(->> % flatten (remove nil?))]
+    (if-not debug-enabled?
+      (make-chain interceptors)
+      (do    ;; do a whole lot of development time checks
+        (when-not (coll? interceptors)
+          (console :error "re-frame: when registering" id ", expected a collection of interceptors, got:" interceptors))
+        (let [chain (make-chain interceptors)]
+          (when (empty? chain)
+            (console :error "re-frame: when registering" id ", given an empty interceptor chain"))
+          (when-let [not-i (first (remove interceptor/interceptor? chain))]
+            (if (fn? not-i)
+              (console :error "re-frame: when registering" id ", got a function instead of an interceptor. Did you provide old style middleware by mistake? Got:" not-i)
+              (console :error "re-frame: when registering" id ", expected interceptors, but got:" not-i)))
+          chain)))))
+
+
+(defn register
+  "Associate the given event `id` with the given collection of `interceptors`.
+
+   `interceptors` may contain nested collections and there may be nils
+   at any level,so process this structure into a simple, nil-less vector
+   before registration.
+
+   Typically, an `event handler` will be at the end of the chain (wrapped
+   in an interceptor)."
+  [id interceptors]
+  (register-handler kind id (flatten-and-remove-nils id interceptors)))
+
+
+
+;; -- handle event --------------------------------------------------------------------------------
+
+(def ^:dynamic *handling* nil)    ;; remember what event we are currently handling
+
+(defn handle
+  "Given an event vector `event-v`, look up the associated interceptor chain, and execute it."
+  [event-v]
+  (let [event-id  (first-in-vector event-v)]
+    (if-let [interceptors  (get-handler kind event-id true)]
+      (if *handling*
+        (console :error "re-frame: while handling" *handling* ", dispatch-sync was called for" event-v ". You can't call dispatch-sync within an event handler.")
+        (binding [*handling*  event-v]
+          (trace/with-trace {:operation event-id
+                             :op-type   kind
+                             :tags      {:event event-v}}
+            (trace/merge-trace! {:tags {:app-db-before @app-db}})
+            (interceptor/execute event-v interceptors)
+            (trace/merge-trace! {:tags {:app-db-after @app-db}})))))))
+
+
diff --git a/js/re_frame/events.cljc.cache.json b/js/re_frame/events.cljc.cache.json
new file mode 100644
index 0000000..8c8f34b
--- /dev/null
+++ b/js/re_frame/events.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ ","~$console","~$re-frame.loggers","~$empty-queue","~$re-frame.interop","~$debug-enabled?","^8"],"~:excludes",["~#set",[]],"~:name","~$re-frame.events","~:imports",null,"~:requires",["^ ","~$re-frame.db","^@","~$re-frame.utils","^A","^8","^8","~$re-frame.registrar","^B","^6","^6","~$interceptor","~$re-frame.interceptor","^D","^D","~$trace","~$re-frame.trace","^F","^F"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^5","^6","~$app-db","^@","~$get-handler","^B","~$first-in-vector","^A","^7","^8","^9","^8","~$register-handler","^B"],"~:defs",["^ ","~$kind",["^ ","^<","~$re-frame.events/kind","~:file","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","~:line",11,"~:column",1,"~:end-line",11,"~:end-column",10,"~:meta",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^Q",11,"^R",6,"^S",11,"^T",10],"~:tag","~$cljs.core/Keyword"],"~$flatten-and-remove-nils",["^ ","~:protocol-inline",null,"^U",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^Q",14,"^R",8,"^S",14,"^T",31,"~:private",true,"~:arglists",["~#list",["~$quote",["^10",[["~$id","~$interceptors"]]]]],"~:doc","~`interceptors` might have nested collections, and contain nil elements.\n  return a flat collection, with all nils removed.\n  This function is 9/10 about giving good error messages."],"^Z",true,"^<","~$re-frame.events/flatten-and-remove-nils","~:variadic",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^T",31,"~:method-params",["^10",[["^12","^13"]]],"~:protocol-impl",null,"~:arglists-meta",["^10",[null,null]],"^R",1,"^Q",14,"^S",14,"~:max-fixed-arity",2,"~:fn-var",true,"^[",["^10",["^11",["^10",[["^12","^13"]]]]],"^14","~`interceptors` might have nested collections, and contain nil elements.\n  return a flat collection, with all nils removed.\n  This function is 9/10 about giving good error messages."],"~$register",["^ ","^Y",null,"^U",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^Q",35,"^R",7,"^S",35,"^T",15,"^[",["^10",["^11",["^10",[["^12","^13"]]]]],"^14","Associate the given event `id` with the given collection of `interceptors`.\n\n   `interceptors` may contain nested collections and there may be nils\n   at any level,so process this structure into a simple, nil-less vector\n   before registration.\n\n   Typically, an `event handler` will be at the end of the chain (wrapped\n   in an interceptor)."],"^<","~$re-frame.events/register","^16",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^T",15,"^17",["^10",[["^12","^13"]]],"^18",null,"^19",["^10",[null,null]],"^R",1,"^Q",35,"^S",35,"^1:",2,"^1;",true,"^[",["^10",["^11",["^10",[["^12","^13"]]]]],"^14","Associate the given event `id` with the given collection of `interceptors`.\n\n   `interceptors` may contain nested collections and there may be nils\n   at any level,so process this structure into a simple, nil-less vector\n   before registration.\n\n   Typically, an `event handler` will be at the end of the chain (wrapped\n   in an interceptor)."],"~$*handling*",["^ ","^<","~$re-frame.events/*handling*","^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^Q",51,"^R",1,"^S",51,"^T",26,"~:dynamic",true,"^U",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^Q",51,"^R",16,"^S",51,"^T",26,"^1@",true],"^V","~$clj-nil"],"~$handle",["^ ","^Y",null,"^U",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^Q",53,"^R",7,"^S",53,"^T",13,"^[",["^10",["^11",["^10",[["~$event-v"]]]]],"^14","Given an event vector `event-v`, look up the associated interceptor chain, and execute it."],"^<","~$re-frame.events/handle","^16",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/2A414AD/re_frame/events.cljc","^T",13,"^17",["^10",[["^1C"]]],"^18",null,"^19",["^10",[null,null]],"^R",1,"^Q",53,"^S",53,"^1:",1,"^1;",true,"^[",["^10",["^11",["^10",[["^1C"]]]]],"^14","Given an event vector `event-v`, look up the associated interceptor chain, and execute it."]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^E","^F","^F","^F"],"~:cljs.analyzer/constants",["^ ","~:seen",["^;",["~:tags","~:app-db-after","~:operation","~:start","~:app-db-before","~:duration","~:event","~:error","~:end","~:op-type"]],"~:order",["^1O","^1P","^1K","^1R","^1I","^1L","^1N","^1Q","^1M","^1J"]],"^14",null]
\ No newline at end of file
diff --git a/js/re_frame/events.js b/js/re_frame/events.js
new file mode 100644
index 0000000..ce2a043
--- /dev/null
+++ b/js/re_frame/events.js
@@ -0,0 +1,136 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.events');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.db');
+goog.require('re_frame.utils');
+goog.require('re_frame.interop');
+goog.require('re_frame.registrar');
+goog.require('re_frame.loggers');
+goog.require('re_frame.interceptor');
+goog.require('re_frame.trace');
+re_frame.events.kind = cljs.core.cst$kw$event;
+if(cljs.core.truth_((re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1 ? re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1(re_frame.events.kind) : re_frame.registrar.kinds.call(null,re_frame.events.kind)))){
+} else {
+throw (new Error("Assert failed: (re-frame.registrar/kinds kind)"));
+}
+/**
+ * `interceptors` might have nested collections, and contain nil elements.
+ *   return a flat collection, with all nils removed.
+ *   This function is 9/10 about giving good error messages.
+ */
+re_frame.events.flatten_and_remove_nils = (function re_frame$events$flatten_and_remove_nils(id,interceptors){
+var make_chain = (function (p1__4557_SHARP_){
+return cljs.core.remove.cljs$core$IFn$_invoke$arity$2(cljs.core.nil_QMARK_,cljs.core.flatten(p1__4557_SHARP_));
+});
+if(!(re_frame.interop.debug_enabled_QMARK_)){
+return make_chain(interceptors);
+} else {
+if(cljs.core.coll_QMARK_(interceptors)){
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: when registering",id,", expected a collection of interceptors, got:",interceptors], 0));
+}
+
+var chain = make_chain(interceptors);
+if(cljs.core.empty_QMARK_(chain)){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: when registering",id,", given an empty interceptor chain"], 0));
+} else {
+}
+
+var temp__5457__auto___4558 = cljs.core.first(cljs.core.remove.cljs$core$IFn$_invoke$arity$2(re_frame.interceptor.interceptor_QMARK_,chain));
+if(cljs.core.truth_(temp__5457__auto___4558)){
+var not_i_4559 = temp__5457__auto___4558;
+if(cljs.core.fn_QMARK_(not_i_4559)){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: when registering",id,", got a function instead of an interceptor. Did you provide old style middleware by mistake? Got:",not_i_4559], 0));
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: when registering",id,", expected interceptors, but got:",not_i_4559], 0));
+}
+} else {
+}
+
+return chain;
+}
+});
+/**
+ * Associate the given event `id` with the given collection of `interceptors`.
+ * 
+ * `interceptors` may contain nested collections and there may be nils
+ * at any level,so process this structure into a simple, nil-less vector
+ * before registration.
+ * 
+ * Typically, an `event handler` will be at the end of the chain (wrapped
+ * in an interceptor).
+ */
+re_frame.events.register = (function re_frame$events$register(id,interceptors){
+return re_frame.registrar.register_handler(re_frame.events.kind,id,re_frame.events.flatten_and_remove_nils(id,interceptors));
+});
+re_frame.events._STAR_handling_STAR_ = null;
+/**
+ * Given an event vector `event-v`, look up the associated interceptor chain, and execute it.
+ */
+re_frame.events.handle = (function re_frame$events$handle(event_v){
+var event_id = re_frame.utils.first_in_vector(event_v);
+var temp__5455__auto__ = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3(re_frame.events.kind,event_id,true);
+if(cljs.core.truth_(temp__5455__auto__)){
+var interceptors = temp__5455__auto__;
+if(cljs.core.truth_(re_frame.events._STAR_handling_STAR_)){
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: while handling",re_frame.events._STAR_handling_STAR_,", dispatch-sync was called for",event_v,". You can't call dispatch-sync within an event handler."], 0));
+} else {
+var _STAR_handling_STAR_4560 = re_frame.events._STAR_handling_STAR_;
+re_frame.events._STAR_handling_STAR_ = event_v;
+
+try{if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_4561 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$operation,event_id,cljs.core.cst$kw$op_DASH_type,re_frame.events.kind,cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$event,event_v], null)], null));
+
+try{try{if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___4562 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_before,cljs.core.deref(re_frame.db.app_db)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_before,cljs.core.deref(re_frame.db.app_db)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___4562;
+
+} else {
+}
+
+re_frame.interceptor.execute(event_v,interceptors);
+
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___4563 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_after,cljs.core.deref(re_frame.db.app_db)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_after,cljs.core.deref(re_frame.db.app_db)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___4563;
+
+return null;
+} else {
+return null;
+}
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___4564 = re_frame.interop.now();
+var duration__4440__auto___4565 = (end__4439__auto___4564 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___4565,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___4564);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_4561;
+}} else {
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___4566 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_before,cljs.core.deref(re_frame.db.app_db)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_before,cljs.core.deref(re_frame.db.app_db)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___4566;
+
+} else {
+}
+
+re_frame.interceptor.execute(event_v,interceptors);
+
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___4567 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_after,cljs.core.deref(re_frame.db.app_db)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$app_DASH_db_DASH_after,cljs.core.deref(re_frame.db.app_db)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___4567;
+
+return null;
+} else {
+return null;
+}
+}
+}finally {re_frame.events._STAR_handling_STAR_ = _STAR_handling_STAR_4560;
+}}
+} else {
+return null;
+}
+});
diff --git a/js/re_frame/fx.cljc b/js/re_frame/fx.cljc
new file mode 100644
index 0000000..ed770d6
--- /dev/null
+++ b/js/re_frame/fx.cljc
@@ -0,0 +1,167 @@
+(ns re-frame.fx
+  (:require
+    [re-frame.router      :as router]
+    [re-frame.db          :refer [app-db]]
+    [re-frame.interceptor :refer [->interceptor]]
+    [re-frame.interop     :refer [set-timeout!]]
+    [re-frame.events      :as events]
+    [re-frame.registrar   :refer [get-handler clear-handlers register-handler]]
+    [re-frame.loggers     :refer [console]]
+    [re-frame.trace :as trace :include-macros true]))
+
+
+;; -- Registration ------------------------------------------------------------
+
+(def kind :fx)
+(assert (re-frame.registrar/kinds kind))
+
+(defn reg-fx
+  "Register the given effect `handler` for the given `id`.
+
+  `id` is keyword, often namespaced.
+  `handler` is a side-effecting function which takes a single argument and whose return
+  value is ignored.
+
+  Example Use
+  -----------
+
+  First, registration ... associate `:effect2` with a handler.
+
+  (reg-fx
+     :effect2
+     (fn [value]
+        ... do something side-effect-y))
+
+  Then, later, if an event handler were to return this effects map ...
+
+  {...
+   :effect2  [1 2]}
+
+   ... then the `handler` `fn` we registered previously, using `reg-fx`, will be
+   called with an argument of `[1 2]`."
+  [id handler]
+  (register-handler kind id handler))
+
+;; -- Interceptor -------------------------------------------------------------
+
+(def do-fx
+  "An interceptor whose `:after` actions the contents of `:effects`. As a result,
+  this interceptor is Domino 3.
+
+  This interceptor is silently added (by reg-event-db etc) to the front of
+  interceptor chains for all events.
+
+  For each key in `:effects` (a map), it calls the registered `effects handler`
+  (see `reg-fx` for registration of effect handlers).
+
+  So, if `:effects` was:
+      {:dispatch  [:hello 42]
+       :db        {...}
+       :undo      \"set flag\"}
+
+  it will call the registered effect handlers for each of the map's keys:
+  `:dispatch`, `:undo` and `:db`. When calling each handler, provides the map
+  value for that key - so in the example above the effect handler for :dispatch
+  will be given one arg `[:hello 42]`.
+
+  You cannot rely on the ordering in which effects are executed."
+  (->interceptor
+    :id :do-fx
+    :after (fn do-fx-after
+             [context]
+             (trace/with-trace
+               {:op-type :event/do-fx}
+               (doseq [[effect-key effect-value] (:effects context)]
+                 (if-let [effect-fn (get-handler kind effect-key false)]
+                   (effect-fn effect-value)
+                   (console :error "re-frame: no handler registered for effect:" effect-key ". Ignoring.")))))))
+
+;; -- Builtin Effect Handlers  ------------------------------------------------
+
+;; :dispatch-later
+;;
+;; `dispatch` one or more events after given delays. Expects a collection
+;; of maps with two keys:  :`ms` and `:dispatch`
+;;
+;; usage:
+;;
+;;    {:dispatch-later [{:ms 200 :dispatch [:event-id "param"]}    ;;  in 200ms do this: (dispatch [:event-id "param"])
+;;                      {:ms 100 :dispatch [:also :this :in :100ms]}]}
+;;
+(reg-fx
+  :dispatch-later
+  (fn [value]
+    (doseq [{:keys [ms dispatch] :as effect} value]
+        (if (or (empty? dispatch) (not (number? ms)))
+          (console :error "re-frame: ignoring bad :dispatch-later value:" effect)
+          (set-timeout! #(router/dispatch dispatch) ms)))))
+
+
+;; :dispatch
+;;
+;; `dispatch` one event. Excepts a single vector.
+;;
+;; usage:
+;;   {:dispatch [:event-id "param"] }
+
+(reg-fx
+  :dispatch
+  (fn [value]
+    (if-not (vector? value)
+      (console :error "re-frame: ignoring bad :dispatch value. Expected a vector, but got:" value)
+      (router/dispatch value))))
+
+
+;; :dispatch-n
+;;
+;; `dispatch` more than one event. Expects a list or vector of events. Something for which
+;; sequential? returns true.
+;;
+;; usage:
+;;   {:dispatch-n (list [:do :all] [:three :of] [:these])}
+;;
+;; Note: nil events are ignored which means events can be added
+;; conditionally:
+;;    {:dispatch-n (list (when (> 3 5) [:conditioned-out])
+;;                       [:another-one])}
+;;
+(reg-fx
+  :dispatch-n
+  (fn [value]
+    (if-not (sequential? value)
+      (console :error "re-frame: ignoring bad :dispatch-n value. Expected a collection, got got:" value)
+      (doseq [event (remove nil? value)] (router/dispatch event)))))
+
+
+;; :deregister-event-handler
+;;
+;; removes a previously registered event handler. Expects either a single id (
+;; typically a namespaced keyword), or a seq of ids.
+;;
+;; usage:
+;;   {:deregister-event-handler :my-id)}
+;; or:
+;;   {:deregister-event-handler [:one-id :another-id]}
+;;
+(reg-fx
+  :deregister-event-handler
+  (fn [value]
+    (let [clear-event (partial clear-handlers events/kind)]
+      (if (sequential? value)
+        (doseq [event value] (clear-event event))
+        (clear-event value)))))
+
+
+;; :db
+;;
+;; reset! app-db with a new value. `value` is expected to be a map.
+;;
+;; usage:
+;;   {:db  {:key1 value1 key2 value2}}
+;;
+(reg-fx
+  :db
+  (fn [value]
+    (if-not (identical? @app-db value)
+      (reset! app-db value))))
+
diff --git a/js/re_frame/fx.cljc.cache.json b/js/re_frame/fx.cljc.cache.json
new file mode 100644
index 0000000..848b7c1
--- /dev/null
+++ b/js/re_frame/fx.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ ","~$console","~$re-frame.loggers","~$set-timeout!","~$re-frame.interop"],"~:excludes",["~#set",[]],"~:name","~$re-frame.fx","~:imports",null,"~:requires",["^ ","^8","^8","~$re-frame.interceptor","^?","~$re-frame.events","^@","~$re-frame.trace","^A","~$re-frame.registrar","^B","~$router","~$re-frame.router","^D","^D","~$trace","^A","~$events","^@","^6","^6","~$re-frame.db","^G"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^5","^6","~$app-db","^G","~$->interceptor","^?","^7","^8","~$get-handler","^B","~$clear-handlers","^B","~$register-handler","^B"],"~:defs",["^ ","~$kind",["^ ","^;","~$re-frame.fx/kind","~:file","/home/julien/.cljs/.aot_cache/1.10.329/D738019/re_frame/fx.cljc","~:line",15,"~:column",1,"~:end-line",15,"~:end-column",10,"~:meta",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/D738019/re_frame/fx.cljc","^S",15,"^T",6,"^U",15,"^V",10],"~:tag","~$cljs.core/Keyword"],"~$reg-fx",["^ ","~:protocol-inline",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/D738019/re_frame/fx.cljc","^S",18,"^T",7,"^U",18,"^V",13,"~:arglists",["~#list",["~$quote",["^11",[["~$id","~$handler"]]]]],"~:doc","Register the given effect `handler` for the given `id`.\n\n  `id` is keyword, often namespaced.\n  `handler` is a side-effecting function which takes a single argument and whose return\n  value is ignored.\n\n  Example Use\n  -----------\n\n  First, registration ... associate `:effect2` with a handler.\n\n  (reg-fx\n     :effect2\n     (fn [value]\n        ... do something side-effect-y))\n\n  Then, later, if an event handler were to return this effects map ...\n\n  {...\n   :effect2  [1 2]}\n\n   ... then the `handler` `fn` we registered previously, using `reg-fx`, will be\n   called with an argument of `[1 2]`."],"^;","~$re-frame.fx/reg-fx","~:variadic",false,"^R","/home/julien/.cljs/.aot_cache/1.10.329/D738019/re_frame/fx.cljc","^V",13,"~:method-params",["^11",[["^13","^14"]]],"~:protocol-impl",null,"~:arglists-meta",["^11",[null,null]],"^T",1,"^S",18,"^U",18,"~:max-fixed-arity",2,"~:fn-var",true,"^10",["^11",["^12",["^11",[["^13","^14"]]]]],"^15","Register the given effect `handler` for the given `id`.\n\n  `id` is keyword, often namespaced.\n  `handler` is a side-effecting function which takes a single argument and whose return\n  value is ignored.\n\n  Example Use\n  -----------\n\n  First, registration ... associate `:effect2` with a handler.\n\n  (reg-fx\n     :effect2\n     (fn [value]\n        ... do something side-effect-y))\n\n  Then, later, if an event handler were to return this effects map ...\n\n  {...\n   :effect2  [1 2]}\n\n   ... then the `handler` `fn` we registered previously, using `reg-fx`, will be\n   called with an argument of `[1 2]`."],"~$do-fx",["^ ","^;","~$re-frame.fx/do-fx","^R","/home/julien/.cljs/.aot_cache/1.10.329/D738019/re_frame/fx.cljc","^S",47,"^T",1,"^U",47,"^V",11,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/D738019/re_frame/fx.cljc","^S",47,"^T",6,"^U",47,"^V",11],"^15","An interceptor whose `:after` actions the contents of `:effects`. As a result,\n  this interceptor is Domino 3.\n\n  This interceptor is silently added (by reg-event-db etc) to the front of\n  interceptor chains for all events.\n\n  For each key in `:effects` (a map), it calls the registered `effects handler`\n  (see `reg-fx` for registration of effect handlers).\n\n  So, if `:effects` was:\n      {:dispatch  [:hello 42]\n       :db        {...}\n       :undo      \"set flag\"}\n\n  it will call the registered effect handlers for each of the map's keys:\n  `:dispatch`, `:undo` and `:db`. When calling each handler, provides the map\n  value for that key - so in the example above the effect handler for :dispatch\n  will be given one arg `[:hello 42]`.\n\n  You cannot rely on the ordering in which effects are executed.","^X","~$any"]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^E","^A","^A","^A"],"~:cljs.analyzer/constants",["^ ","~:seen",["^:",["~:db","~:do-fx","~:start","~:dispatch-n","~:duration","~:deregister-event-handler","~:dispatch","~:after","~:event/do-fx","~:id","~:effects","~:error","~:end","~:ms","~:fx","~:op-type","~:dispatch-later"]],"~:order",["^1R","^1M","^1E","^1K","^1S","^1L","^1F","^1H","^1P","^1N","^1O","^1T","^1Q","^1J","^1G","^1I","^1D"]],"^15",null]
\ No newline at end of file
diff --git a/js/re_frame/fx.js b/js/re_frame/fx.js
new file mode 100644
index 0000000..dc8598a
--- /dev/null
+++ b/js/re_frame/fx.js
@@ -0,0 +1,444 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.fx');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.router');
+goog.require('re_frame.db');
+goog.require('re_frame.interceptor');
+goog.require('re_frame.interop');
+goog.require('re_frame.events');
+goog.require('re_frame.registrar');
+goog.require('re_frame.loggers');
+goog.require('re_frame.trace');
+re_frame.fx.kind = cljs.core.cst$kw$fx;
+if(cljs.core.truth_((re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1 ? re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1(re_frame.fx.kind) : re_frame.registrar.kinds.call(null,re_frame.fx.kind)))){
+} else {
+throw (new Error("Assert failed: (re-frame.registrar/kinds kind)"));
+}
+/**
+ * Register the given effect `handler` for the given `id`.
+ * 
+ *   `id` is keyword, often namespaced.
+ *   `handler` is a side-effecting function which takes a single argument and whose return
+ *   value is ignored.
+ * 
+ *   Example Use
+ *   -----------
+ * 
+ *   First, registration ... associate `:effect2` with a handler.
+ * 
+ *   (reg-fx
+ *   :effect2
+ *   (fn [value]
+ *      ... do something side-effect-y))
+ * 
+ *   Then, later, if an event handler were to return this effects map ...
+ * 
+ *   {...
+ * :effect2  [1 2]}
+ * 
+ * ... then the `handler` `fn` we registered previously, using `reg-fx`, will be
+ * called with an argument of `[1 2]`.
+ */
+re_frame.fx.reg_fx = (function re_frame$fx$reg_fx(id,handler){
+return re_frame.registrar.register_handler(re_frame.fx.kind,id,handler);
+});
+/**
+ * An interceptor whose `:after` actions the contents of `:effects`. As a result,
+ *   this interceptor is Domino 3.
+ * 
+ *   This interceptor is silently added (by reg-event-db etc) to the front of
+ *   interceptor chains for all events.
+ * 
+ *   For each key in `:effects` (a map), it calls the registered `effects handler`
+ *   (see `reg-fx` for registration of effect handlers).
+ * 
+ *   So, if `:effects` was:
+ *    {:dispatch  [:hello 42]
+ *     :db        {...}
+ *     :undo      "set flag"}
+ * 
+ *   it will call the registered effect handlers for each of the map's keys:
+ *   `:dispatch`, `:undo` and `:db`. When calling each handler, provides the map
+ *   value for that key - so in the example above the effect handler for :dispatch
+ *   will be given one arg `[:hello 42]`.
+ * 
+ *   You cannot rely on the ordering in which effects are executed.
+ */
+re_frame.fx.do_fx = re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$do_DASH_fx,cljs.core.cst$kw$after,(function re_frame$fx$do_fx_after(context){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_4931 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$event_SLASH_do_DASH_fx], null));
+
+try{try{var seq__4932 = cljs.core.seq(cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(context));
+var chunk__4933 = null;
+var count__4934 = (0);
+var i__4935 = (0);
+while(true){
+if((i__4935 < count__4934)){
+var vec__4936 = chunk__4933.cljs$core$IIndexed$_nth$arity$2(null,i__4935);
+var effect_key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4936,(0),null);
+var effect_value = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4936,(1),null);
+var temp__5455__auto___4952 = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3(re_frame.fx.kind,effect_key,false);
+if(cljs.core.truth_(temp__5455__auto___4952)){
+var effect_fn_4953 = temp__5455__auto___4952;
+(effect_fn_4953.cljs$core$IFn$_invoke$arity$1 ? effect_fn_4953.cljs$core$IFn$_invoke$arity$1(effect_value) : effect_fn_4953.call(null,effect_value));
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: no handler registered for effect:",effect_key,". Ignoring."], 0));
+}
+
+
+var G__4954 = seq__4932;
+var G__4955 = chunk__4933;
+var G__4956 = count__4934;
+var G__4957 = (i__4935 + (1));
+seq__4932 = G__4954;
+chunk__4933 = G__4955;
+count__4934 = G__4956;
+i__4935 = G__4957;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__4932);
+if(temp__5457__auto__){
+var seq__4932__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__4932__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__4932__$1);
+var G__4958 = cljs.core.chunk_rest(seq__4932__$1);
+var G__4959 = c__4338__auto__;
+var G__4960 = cljs.core.count(c__4338__auto__);
+var G__4961 = (0);
+seq__4932 = G__4958;
+chunk__4933 = G__4959;
+count__4934 = G__4960;
+i__4935 = G__4961;
+continue;
+} else {
+var vec__4939 = cljs.core.first(seq__4932__$1);
+var effect_key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4939,(0),null);
+var effect_value = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4939,(1),null);
+var temp__5455__auto___4962 = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3(re_frame.fx.kind,effect_key,false);
+if(cljs.core.truth_(temp__5455__auto___4962)){
+var effect_fn_4963 = temp__5455__auto___4962;
+(effect_fn_4963.cljs$core$IFn$_invoke$arity$1 ? effect_fn_4963.cljs$core$IFn$_invoke$arity$1(effect_value) : effect_fn_4963.call(null,effect_value));
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: no handler registered for effect:",effect_key,". Ignoring."], 0));
+}
+
+
+var G__4964 = cljs.core.next(seq__4932__$1);
+var G__4965 = null;
+var G__4966 = (0);
+var G__4967 = (0);
+seq__4932 = G__4964;
+chunk__4933 = G__4965;
+count__4934 = G__4966;
+i__4935 = G__4967;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___4968 = re_frame.interop.now();
+var duration__4440__auto___4969 = (end__4439__auto___4968 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___4969,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___4968);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_4931;
+}} else {
+var seq__4942 = cljs.core.seq(cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(context));
+var chunk__4943 = null;
+var count__4944 = (0);
+var i__4945 = (0);
+while(true){
+if((i__4945 < count__4944)){
+var vec__4946 = chunk__4943.cljs$core$IIndexed$_nth$arity$2(null,i__4945);
+var effect_key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4946,(0),null);
+var effect_value = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4946,(1),null);
+var temp__5455__auto___4970 = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3(re_frame.fx.kind,effect_key,false);
+if(cljs.core.truth_(temp__5455__auto___4970)){
+var effect_fn_4971 = temp__5455__auto___4970;
+(effect_fn_4971.cljs$core$IFn$_invoke$arity$1 ? effect_fn_4971.cljs$core$IFn$_invoke$arity$1(effect_value) : effect_fn_4971.call(null,effect_value));
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: no handler registered for effect:",effect_key,". Ignoring."], 0));
+}
+
+
+var G__4972 = seq__4942;
+var G__4973 = chunk__4943;
+var G__4974 = count__4944;
+var G__4975 = (i__4945 + (1));
+seq__4942 = G__4972;
+chunk__4943 = G__4973;
+count__4944 = G__4974;
+i__4945 = G__4975;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__4942);
+if(temp__5457__auto__){
+var seq__4942__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__4942__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__4942__$1);
+var G__4976 = cljs.core.chunk_rest(seq__4942__$1);
+var G__4977 = c__4338__auto__;
+var G__4978 = cljs.core.count(c__4338__auto__);
+var G__4979 = (0);
+seq__4942 = G__4976;
+chunk__4943 = G__4977;
+count__4944 = G__4978;
+i__4945 = G__4979;
+continue;
+} else {
+var vec__4949 = cljs.core.first(seq__4942__$1);
+var effect_key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4949,(0),null);
+var effect_value = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4949,(1),null);
+var temp__5455__auto___4980 = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3(re_frame.fx.kind,effect_key,false);
+if(cljs.core.truth_(temp__5455__auto___4980)){
+var effect_fn_4981 = temp__5455__auto___4980;
+(effect_fn_4981.cljs$core$IFn$_invoke$arity$1 ? effect_fn_4981.cljs$core$IFn$_invoke$arity$1(effect_value) : effect_fn_4981.call(null,effect_value));
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: no handler registered for effect:",effect_key,". Ignoring."], 0));
+}
+
+
+var G__4982 = cljs.core.next(seq__4942__$1);
+var G__4983 = null;
+var G__4984 = (0);
+var G__4985 = (0);
+seq__4942 = G__4982;
+chunk__4943 = G__4983;
+count__4944 = G__4984;
+i__4945 = G__4985;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+}
+})], 0));
+re_frame.fx.reg_fx(cljs.core.cst$kw$dispatch_DASH_later,(function (value){
+var seq__4986 = cljs.core.seq(value);
+var chunk__4987 = null;
+var count__4988 = (0);
+var i__4989 = (0);
+while(true){
+if((i__4989 < count__4988)){
+var map__4990 = chunk__4987.cljs$core$IIndexed$_nth$arity$2(null,i__4989);
+var map__4990__$1 = ((((!((map__4990 == null)))?(((((map__4990.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__4990.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__4990):map__4990);
+var effect = map__4990__$1;
+var ms = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4990__$1,cljs.core.cst$kw$ms);
+var dispatch = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4990__$1,cljs.core.cst$kw$dispatch);
+if(((cljs.core.empty_QMARK_(dispatch)) || (!(typeof ms === 'number')))){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: ignoring bad :dispatch-later value:",effect], 0));
+} else {
+re_frame.interop.set_timeout_BANG_(((function (seq__4986,chunk__4987,count__4988,i__4989,map__4990,map__4990__$1,effect,ms,dispatch){
+return (function (){
+return re_frame.router.dispatch(dispatch);
+});})(seq__4986,chunk__4987,count__4988,i__4989,map__4990,map__4990__$1,effect,ms,dispatch))
+,ms);
+}
+
+
+var G__4994 = seq__4986;
+var G__4995 = chunk__4987;
+var G__4996 = count__4988;
+var G__4997 = (i__4989 + (1));
+seq__4986 = G__4994;
+chunk__4987 = G__4995;
+count__4988 = G__4996;
+i__4989 = G__4997;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__4986);
+if(temp__5457__auto__){
+var seq__4986__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__4986__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__4986__$1);
+var G__4998 = cljs.core.chunk_rest(seq__4986__$1);
+var G__4999 = c__4338__auto__;
+var G__5000 = cljs.core.count(c__4338__auto__);
+var G__5001 = (0);
+seq__4986 = G__4998;
+chunk__4987 = G__4999;
+count__4988 = G__5000;
+i__4989 = G__5001;
+continue;
+} else {
+var map__4992 = cljs.core.first(seq__4986__$1);
+var map__4992__$1 = ((((!((map__4992 == null)))?(((((map__4992.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__4992.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__4992):map__4992);
+var effect = map__4992__$1;
+var ms = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4992__$1,cljs.core.cst$kw$ms);
+var dispatch = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4992__$1,cljs.core.cst$kw$dispatch);
+if(((cljs.core.empty_QMARK_(dispatch)) || (!(typeof ms === 'number')))){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: ignoring bad :dispatch-later value:",effect], 0));
+} else {
+re_frame.interop.set_timeout_BANG_(((function (seq__4986,chunk__4987,count__4988,i__4989,map__4992,map__4992__$1,effect,ms,dispatch,seq__4986__$1,temp__5457__auto__){
+return (function (){
+return re_frame.router.dispatch(dispatch);
+});})(seq__4986,chunk__4987,count__4988,i__4989,map__4992,map__4992__$1,effect,ms,dispatch,seq__4986__$1,temp__5457__auto__))
+,ms);
+}
+
+
+var G__5002 = cljs.core.next(seq__4986__$1);
+var G__5003 = null;
+var G__5004 = (0);
+var G__5005 = (0);
+seq__4986 = G__5002;
+chunk__4987 = G__5003;
+count__4988 = G__5004;
+i__4989 = G__5005;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+}));
+re_frame.fx.reg_fx(cljs.core.cst$kw$dispatch,(function (value){
+if(!(cljs.core.vector_QMARK_(value))){
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: ignoring bad :dispatch value. Expected a vector, but got:",value], 0));
+} else {
+return re_frame.router.dispatch(value);
+}
+}));
+re_frame.fx.reg_fx(cljs.core.cst$kw$dispatch_DASH_n,(function (value){
+if(!(cljs.core.sequential_QMARK_(value))){
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: ignoring bad :dispatch-n value. Expected a collection, got got:",value], 0));
+} else {
+var seq__5006 = cljs.core.seq(cljs.core.remove.cljs$core$IFn$_invoke$arity$2(cljs.core.nil_QMARK_,value));
+var chunk__5007 = null;
+var count__5008 = (0);
+var i__5009 = (0);
+while(true){
+if((i__5009 < count__5008)){
+var event = chunk__5007.cljs$core$IIndexed$_nth$arity$2(null,i__5009);
+re_frame.router.dispatch(event);
+
+
+var G__5010 = seq__5006;
+var G__5011 = chunk__5007;
+var G__5012 = count__5008;
+var G__5013 = (i__5009 + (1));
+seq__5006 = G__5010;
+chunk__5007 = G__5011;
+count__5008 = G__5012;
+i__5009 = G__5013;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__5006);
+if(temp__5457__auto__){
+var seq__5006__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__5006__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__5006__$1);
+var G__5014 = cljs.core.chunk_rest(seq__5006__$1);
+var G__5015 = c__4338__auto__;
+var G__5016 = cljs.core.count(c__4338__auto__);
+var G__5017 = (0);
+seq__5006 = G__5014;
+chunk__5007 = G__5015;
+count__5008 = G__5016;
+i__5009 = G__5017;
+continue;
+} else {
+var event = cljs.core.first(seq__5006__$1);
+re_frame.router.dispatch(event);
+
+
+var G__5018 = cljs.core.next(seq__5006__$1);
+var G__5019 = null;
+var G__5020 = (0);
+var G__5021 = (0);
+seq__5006 = G__5018;
+chunk__5007 = G__5019;
+count__5008 = G__5020;
+i__5009 = G__5021;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+}
+}));
+re_frame.fx.reg_fx(cljs.core.cst$kw$deregister_DASH_event_DASH_handler,(function (value){
+var clear_event = cljs.core.partial.cljs$core$IFn$_invoke$arity$2(re_frame.registrar.clear_handlers,re_frame.events.kind);
+if(cljs.core.sequential_QMARK_(value)){
+var seq__5022 = cljs.core.seq(value);
+var chunk__5023 = null;
+var count__5024 = (0);
+var i__5025 = (0);
+while(true){
+if((i__5025 < count__5024)){
+var event = chunk__5023.cljs$core$IIndexed$_nth$arity$2(null,i__5025);
+(clear_event.cljs$core$IFn$_invoke$arity$1 ? clear_event.cljs$core$IFn$_invoke$arity$1(event) : clear_event.call(null,event));
+
+
+var G__5026 = seq__5022;
+var G__5027 = chunk__5023;
+var G__5028 = count__5024;
+var G__5029 = (i__5025 + (1));
+seq__5022 = G__5026;
+chunk__5023 = G__5027;
+count__5024 = G__5028;
+i__5025 = G__5029;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__5022);
+if(temp__5457__auto__){
+var seq__5022__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__5022__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__5022__$1);
+var G__5030 = cljs.core.chunk_rest(seq__5022__$1);
+var G__5031 = c__4338__auto__;
+var G__5032 = cljs.core.count(c__4338__auto__);
+var G__5033 = (0);
+seq__5022 = G__5030;
+chunk__5023 = G__5031;
+count__5024 = G__5032;
+i__5025 = G__5033;
+continue;
+} else {
+var event = cljs.core.first(seq__5022__$1);
+(clear_event.cljs$core$IFn$_invoke$arity$1 ? clear_event.cljs$core$IFn$_invoke$arity$1(event) : clear_event.call(null,event));
+
+
+var G__5034 = cljs.core.next(seq__5022__$1);
+var G__5035 = null;
+var G__5036 = (0);
+var G__5037 = (0);
+seq__5022 = G__5034;
+chunk__5023 = G__5035;
+count__5024 = G__5036;
+i__5025 = G__5037;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+} else {
+return (clear_event.cljs$core$IFn$_invoke$arity$1 ? clear_event.cljs$core$IFn$_invoke$arity$1(value) : clear_event.call(null,value));
+}
+}));
+re_frame.fx.reg_fx(cljs.core.cst$kw$db,(function (value){
+if(!((cljs.core.deref(re_frame.db.app_db) === value))){
+return cljs.core.reset_BANG_(re_frame.db.app_db,value);
+} else {
+return null;
+}
+}));
diff --git a/js/re_frame/interceptor.cljc b/js/re_frame/interceptor.cljc
new file mode 100644
index 0000000..8ecc872
--- /dev/null
+++ b/js/re_frame/interceptor.cljc
@@ -0,0 +1,201 @@
+(ns re-frame.interceptor
+  (:require
+    [re-frame.loggers :refer [console]]
+    [re-frame.interop :refer [empty-queue debug-enabled?]]
+    [re-frame.trace :as trace :include-macros true]
+    [clojure.set :as set]))
+
+
+(def mandatory-interceptor-keys #{:id :after :before})
+
+(defn interceptor?
+  [m]
+  (and (map? m)
+       (= mandatory-interceptor-keys (-> m keys set))))
+
+
+(defn ->interceptor
+  "Create an interceptor from named arguments"
+  [& {:as m :keys [id before after]}]
+  (when debug-enabled?
+    (if-let [unknown-keys (seq (set/difference
+                                (-> m keys set)
+                                mandatory-interceptor-keys))]
+      (console :error "re-frame: ->interceptor" m "has unknown keys:" unknown-keys)))
+  {:id     (or id :unnamed)
+   :before before
+   :after  after })
+
+;; -- Effect Helpers  -----------------------------------------------------------------------------
+
+(defn get-effect
+  ([context]
+   (:effects context))
+  ([context key]
+   (get-in context [:effects key]))
+  ([context key not-found]
+   (get-in context [:effects key] not-found)))
+
+
+(defn assoc-effect
+  [context key value]
+  (assoc-in context [:effects key] value))
+
+;; -- CoEffect Helpers  ---------------------------------------------------------------------------
+
+(defn get-coeffect
+  ([context]
+   (:coeffects context))
+  ([context key]
+   (get-in context [:coeffects key]))
+  ([context key not-found]
+   (get-in context [:coeffects key] not-found)))
+
+(defn assoc-coeffect
+  [context key value]
+  (assoc-in context [:coeffects key] value))
+
+(defn update-coeffect
+  [context key f & args]
+  (apply update-in context [:coeffects key] f args))
+
+;; -- Execute Interceptor Chain  ------------------------------------------------------------------
+
+
+(defn- invoke-interceptor-fn
+  [context interceptor direction]
+  (if-let [f (get interceptor direction)]
+    (f context)
+    context))
+
+
+(defn- invoke-interceptors
+  "Loop over all interceptors, calling `direction` function on each,
+  threading the value of `context` through every call.
+
+  `direction` is one of `:before` or `:after`.
+
+  Each iteration, the next interceptor to process is obtained from
+  context's `:queue`. After they are processed, interceptors are popped
+  from `:queue` and added to `:stack`.
+
+  After sufficient iteration, `:queue` will be empty, and `:stack` will
+  contain all interceptors processed.
+
+  Returns updated `context`. Ie. the `context` which has been threaded
+  through all interceptor functions.
+
+  Generally speaking, an interceptor's `:before` function will (if present)
+  add to a `context's` `:coeffects`, while it's `:after` function
+  will modify the `context`'s `:effects`.  Very approximately.
+
+  But because all interceptor functions are given `context`, and can
+  return a modified version of it, the way is clear for an interceptor
+  to introspect the stack or queue, or even modify the queue
+  (add new interceptors via `enqueue`?). This is a very fluid arrangement."
+  ([context direction]
+   (loop [context context]
+     (let [queue (:queue context)]        ;; future interceptors
+       (if (empty? queue)
+         context
+         (let [interceptor (peek queue)   ;; next interceptor to call
+               stack (:stack context)]    ;; already completed interceptors
+           (recur (-> context
+                      (assoc :queue (pop queue)
+                             :stack (conj stack interceptor))
+                      (invoke-interceptor-fn interceptor direction)))))))))
+
+
+(defn enqueue
+  "Add a collection of `interceptors` to the end of `context's` execution `:queue`.
+  Returns the updated `context`.
+
+  In an advanced case, this function could allow an interceptor to add new
+  interceptors to the `:queue` of a context."
+  [context interceptors]
+  (update context :queue
+          (fnil into empty-queue)
+          interceptors))
+
+
+(defn- context
+  "Create a fresh context"
+  ([event interceptors]
+  (-> {}
+      (assoc-coeffect :event event)
+      (enqueue interceptors)))
+  ([event interceptors db]      ;; only used in tests, probably a hack, remove ?  XXX
+   (-> (context event interceptors)
+       (assoc-coeffect :db db))))
+
+
+(defn- change-direction
+  "Called on completion of `:before` processing, this function prepares/modifies
+   `context` for the backwards sweep of processing in which an interceptor
+   chain's `:after` fns are called.
+
+  At this point in processing, the `:queue` is empty and `:stack` holds all
+  the previously run interceptors. So this function enables the backwards walk
+  by priming `:queue` with what's currently in `:stack`"
+  [context]
+  (-> context
+      (dissoc :queue)
+      (enqueue (:stack context))))
+
+
+(defn execute
+  "Executes the given chain (coll) of interceptors.
+
+   Each interceptor has this form:
+       {:before  (fn [context] ...)     ;; returns possibly modified context
+        :after   (fn [context] ...)}    ;; `identity` would be a noop
+
+   Walks the queue of iterceptors from beginning to end, calling the
+   `:before` fn on each, then reverse direction and walk backwards,
+   calling the `:after` fn on each.
+
+   The last interceptor in the chain presumably wraps an event
+   handler fn. So the overall goal of the process is to \"handle
+   the given event\".
+
+   Thread a `context` through all calls. `context` has this form:
+
+     {:coeffects {:event [:a-query-id :some-param]
+                  :db    <original contents of app-db>}
+      :effects   {:db    <new value for app-db>
+                  :dispatch  [:an-event-id :param1]}
+      :queue     <a collection of further interceptors>
+      :stack     <a collection of interceptors already walked>}
+
+   `context` has `:coeffects` and `:effects` which, if this was a web
+   server, would be somewhat anologous to `request` and `response`
+   respectively.
+
+   `coeffects` will contain data like `event` and the initial
+   state of `db` -  the inputs required by the event handler
+   (sitting presumably on the end of the chain), while handler-returned
+   side effects are put into `:effects` including, but not limited to,
+   new values for `db`.
+
+   The first few interceptors in a chain will likely have `:before`
+   functions which \"prime\" the `context` by adding the event, and
+   the current state of app-db into `:coeffects`. But interceptors can
+   add whatever they want to `:coeffects` - perhaps the event handler needs
+   some information from localstore, or a random number, or access to
+   a DataScript connection.
+
+   Equally, some interceptors in the chain will have `:after` fn
+   which can process the side effects accumulated into `:effects`
+   including but, not limited to, updates to app-db.
+
+   Through both stages (before and after), `context` contains a `:queue`
+   of interceptors yet to be processed, and a `:stack` of interceptors
+   already done.  In advanced cases, these values can be modified by the
+   functions through which the context is threaded."
+  [event-v interceptors]
+  (trace/merge-trace!
+    {:tags {:interceptors interceptors}})
+  (-> (context event-v interceptors)
+      (invoke-interceptors :before)
+      change-direction
+      (invoke-interceptors :after)))
diff --git a/js/re_frame/interceptor.cljc.cache.json b/js/re_frame/interceptor.cljc.cache.json
new file mode 100644
index 0000000..b8a3ce2
--- /dev/null
+++ b/js/re_frame/interceptor.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ ","~$console","~$re-frame.loggers","~$empty-queue","~$re-frame.interop","~$debug-enabled?","^8"],"~:excludes",["~#set",[]],"~:name","~$re-frame.interceptor","~:imports",null,"~:requires",["^ ","^6","^6","^8","^8","~$trace","~$re-frame.trace","^A","^A","~$set","~$clojure.set","^C","^C"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^5","^6","^7","^8","^9","^8"],"~:defs",["^ ","~$invoke-interceptors",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","~:line",72,"~:column",8,"~:end-line",72,"~:end-column",27,"~:private",true,"~:arglists",["~#list",["~$quote",["^Q",[["~$context","~$direction"]]]]],"~:doc","Loop over all interceptors, calling `direction` function on each,\n  threading the value of `context` through every call.\n\n  `direction` is one of `:before` or `:after`.\n\n  Each iteration, the next interceptor to process is obtained from\n  context's `:queue`. After they are processed, interceptors are popped\n  from `:queue` and added to `:stack`.\n\n  After sufficient iteration, `:queue` will be empty, and `:stack` will\n  contain all interceptors processed.\n\n  Returns updated `context`. Ie. the `context` which has been threaded\n  through all interceptor functions.\n\n  Generally speaking, an interceptor's `:before` function will (if present)\n  add to a `context's` `:coeffects`, while it's `:after` function\n  will modify the `context`'s `:effects`.  Very approximately.\n\n  But because all interceptor functions are given `context`, and can\n  return a modified version of it, the way is clear for an interceptor\n  to introspect the stack or queue, or even modify the queue\n  (add new interceptors via `enqueue`?). This is a very fluid arrangement."],"^O",true,"^<","~$re-frame.interceptor/invoke-interceptors","~:variadic",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",27,"~:method-params",["^Q",[["^S","^T"]]],"~:protocol-impl",null,"~:arglists-meta",["^Q",[null,null]],"^L",1,"^K",72,"^M",72,"~:max-fixed-arity",2,"~:fn-var",true,"^P",["^Q",["^R",["^Q",[["^S","^T"]]]]],"^U","Loop over all interceptors, calling `direction` function on each,\n  threading the value of `context` through every call.\n\n  `direction` is one of `:before` or `:after`.\n\n  Each iteration, the next interceptor to process is obtained from\n  context's `:queue`. After they are processed, interceptors are popped\n  from `:queue` and added to `:stack`.\n\n  After sufficient iteration, `:queue` will be empty, and `:stack` will\n  contain all interceptors processed.\n\n  Returns updated `context`. Ie. the `context` which has been threaded\n  through all interceptor functions.\n\n  Generally speaking, an interceptor's `:before` function will (if present)\n  add to a `context's` `:coeffects`, while it's `:after` function\n  will modify the `context`'s `:effects`.  Very approximately.\n\n  But because all interceptor functions are given `context`, and can\n  return a modified version of it, the way is clear for an interceptor\n  to introspect the stack or queue, or even modify the queue\n  (add new interceptors via `enqueue`?). This is a very fluid arrangement."],"~$assoc-coeffect",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",54,"^L",7,"^M",54,"^N",21,"^P",["^Q",["^R",["^Q",[["^S","~$key","~$value"]]]]]],"^<","~$re-frame.interceptor/assoc-coeffect","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",21,"^X",["^Q",[["^S","^12","^13"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",54,"^M",54,"^[",3,"^10",true,"^P",["^Q",["^R",["^Q",[["^S","^12","^13"]]]]]],"~$update-coeffect",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",58,"^L",7,"^M",58,"^N",22,"^P",["^Q",["^R",["^Q",[["^S","^12","~$f","~$&","~$args"]]]]],"~:top-fn",["^ ","^W",true,"^[",3,"^X",[["^Q",["^S","^12","~$f","^16"]]],"^P",["^Q",[["^S","^12","~$f","~$&","^16"]]],"^Z",["^Q",[null]]]],"^<","~$re-frame.interceptor/update-coeffect","^W",true,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",22,"^17",["^ ","^W",true,"^[",3,"^X",[["^Q",["^S","^12","~$f","^16"]]],"^P",["^Q",[["^S","^12","~$f","~$&","^16"]]],"^Z",["^Q",[null]]],"^X",[["^Q",["^S","^12","~$f","^16"]]],"^Y",null,"^Z",["^Q",[null]],"^L",1,"^K",58,"^M",58,"^[",3,"^10",true,"^P",["^Q",[["^S","^12","~$f","~$&","^16"]]]],"~$invoke-interceptor-fn",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",65,"^L",8,"^M",65,"^N",29,"^O",true,"^P",["^Q",["^R",["^Q",[["^S","~$interceptor","^T"]]]]]],"^O",true,"^<","~$re-frame.interceptor/invoke-interceptor-fn","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",29,"^X",["^Q",[["^S","^1:","^T"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",65,"^M",65,"^[",3,"^10",true,"^P",["^Q",["^R",["^Q",[["^S","^1:","^T"]]]]]],"~$get-effect",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",31,"^L",7,"^M",31,"^N",17,"^P",["^Q",["^R",["^Q",[["^S"],["^S","^12"],["^S","^12","~$not-found"]]]]],"^17",["^ ","^W",false,"^[",3,"^X",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^P",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^Z",["^Q",[null,null,null]]]],"^<","~$re-frame.interceptor/get-effect","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",17,"^17",["^ ","^W",false,"^[",3,"^X",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^P",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^Z",["^Q",[null,null,null]]],"^X",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^Y",null,"^Z",["^Q",[null,null,null]],"^L",1,"^K",31,"^M",31,"^[",3,"^10",true,"^P",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]]],"~$->interceptor",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",17,"^L",7,"^M",17,"^N",20,"^P",["^Q",["^R",["^Q",[["~$&",["^ ","~:as","~$m","~:keys",["~$id","~$before","~$after"]]]]]]],"^U","Create an interceptor from named arguments","^17",["^ ","^W",true,"^[",0,"^X",[["^Q",[["^ ","^1@","~$m","^1A",["^1B","^1C","^1D"]]]]],"^P",["^Q",[["~$&",["^ ","^1@","~$m","^1A",["^1B","^1C","^1D"]]]]],"^Z",["^Q",[null]]]],"^<","~$re-frame.interceptor/->interceptor","^W",true,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",20,"^17",["^ ","^W",true,"^[",0,"^X",[["^Q",[["^ ","^1@","~$m","^1A",["^1B","^1C","^1D"]]]]],"^P",["^Q",[["~$&",["^ ","^1@","~$m","^1A",["^1B","^1C","^1D"]]]]],"^Z",["^Q",[null]]],"^X",[["^Q",[["^ ","^1@","~$m","^1A",["^1B","^1C","^1D"]]]]],"^Y",null,"^Z",["^Q",[null]],"^L",1,"^K",17,"^M",17,"^[",0,"^10",true,"^P",["^Q",[["~$&",["^ ","^1@","~$m","^1A",["^1B","^1C","^1D"]]]]],"^U","Create an interceptor from named arguments"],"~$get-coeffect",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",46,"^L",7,"^M",46,"^N",19,"^P",["^Q",["^R",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]]]],"^17",["^ ","^W",false,"^[",3,"^X",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^P",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^Z",["^Q",[null,null,null]]]],"^<","~$re-frame.interceptor/get-coeffect","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",19,"^17",["^ ","^W",false,"^[",3,"^X",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^P",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^Z",["^Q",[null,null,null]]],"^X",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]],"^Y",null,"^Z",["^Q",[null,null,null]],"^L",1,"^K",46,"^M",46,"^[",3,"^10",true,"^P",["^Q",[["^S"],["^S","^12"],["^S","^12","^1="]]]],"~$execute",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",146,"^L",7,"^M",146,"^N",14,"^P",["^Q",["^R",["^Q",[["~$event-v","~$interceptors"]]]]],"^U","Executes the given chain (coll) of interceptors.\n\n   Each interceptor has this form:\n       {:before  (fn [context] ...)     ;; returns possibly modified context\n        :after   (fn [context] ...)}    ;; `identity` would be a noop\n\n   Walks the queue of iterceptors from beginning to end, calling the\n   `:before` fn on each, then reverse direction and walk backwards,\n   calling the `:after` fn on each.\n\n   The last interceptor in the chain presumably wraps an event\n   handler fn. So the overall goal of the process is to \"handle\n   the given event\".\n\n   Thread a `context` through all calls. `context` has this form:\n\n     {:coeffects {:event [:a-query-id :some-param]\n                  :db    <original contents of app-db>}\n      :effects   {:db    <new value for app-db>\n                  :dispatch  [:an-event-id :param1]}\n      :queue     <a collection of further interceptors>\n      :stack     <a collection of interceptors already walked>}\n\n   `context` has `:coeffects` and `:effects` which, if this was a web\n   server, would be somewhat anologous to `request` and `response`\n   respectively.\n\n   `coeffects` will contain data like `event` and the initial\n   state of `db` -  the inputs required by the event handler\n   (sitting presumably on the end of the chain), while handler-returned\n   side effects are put into `:effects` including, but not limited to,\n   new values for `db`.\n\n   The first few interceptors in a chain will likely have `:before`\n   functions which \"prime\" the `context` by adding the event, and\n   the current state of app-db into `:coeffects`. But interceptors can\n   add whatever they want to `:coeffects` - perhaps the event handler needs\n   some information from localstore, or a random number, or access to\n   a DataScript connection.\n\n   Equally, some interceptors in the chain will have `:after` fn\n   which can process the side effects accumulated into `:effects`\n   including but, not limited to, updates to app-db.\n\n   Through both stages (before and after), `context` contains a `:queue`\n   of interceptors yet to be processed, and a `:stack` of interceptors\n   already done.  In advanced cases, these values can be modified by the\n   functions through which the context is threaded."],"^<","~$re-frame.interceptor/execute","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",14,"^X",["^Q",[["^1I","^1J"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",146,"^M",146,"^[",2,"^10",true,"^P",["^Q",["^R",["^Q",[["^1I","^1J"]]]]],"^U","Executes the given chain (coll) of interceptors.\n\n   Each interceptor has this form:\n       {:before  (fn [context] ...)     ;; returns possibly modified context\n        :after   (fn [context] ...)}    ;; `identity` would be a noop\n\n   Walks the queue of iterceptors from beginning to end, calling the\n   `:before` fn on each, then reverse direction and walk backwards,\n   calling the `:after` fn on each.\n\n   The last interceptor in the chain presumably wraps an event\n   handler fn. So the overall goal of the process is to \"handle\n   the given event\".\n\n   Thread a `context` through all calls. `context` has this form:\n\n     {:coeffects {:event [:a-query-id :some-param]\n                  :db    <original contents of app-db>}\n      :effects   {:db    <new value for app-db>\n                  :dispatch  [:an-event-id :param1]}\n      :queue     <a collection of further interceptors>\n      :stack     <a collection of interceptors already walked>}\n\n   `context` has `:coeffects` and `:effects` which, if this was a web\n   server, would be somewhat anologous to `request` and `response`\n   respectively.\n\n   `coeffects` will contain data like `event` and the initial\n   state of `db` -  the inputs required by the event handler\n   (sitting presumably on the end of the chain), while handler-returned\n   side effects are put into `:effects` including, but not limited to,\n   new values for `db`.\n\n   The first few interceptors in a chain will likely have `:before`\n   functions which \"prime\" the `context` by adding the event, and\n   the current state of app-db into `:coeffects`. But interceptors can\n   add whatever they want to `:coeffects` - perhaps the event handler needs\n   some information from localstore, or a random number, or access to\n   a DataScript connection.\n\n   Equally, some interceptors in the chain will have `:after` fn\n   which can process the side effects accumulated into `:effects`\n   including but, not limited to, updates to app-db.\n\n   Through both stages (before and after), `context` contains a `:queue`\n   of interceptors yet to be processed, and a `:stack` of interceptors\n   already done.  In advanced cases, these values can be modified by the\n   functions through which the context is threaded."],"~$assoc-effect",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",40,"^L",7,"^M",40,"^N",19,"^P",["^Q",["^R",["^Q",[["^S","^12","^13"]]]]]],"^<","~$re-frame.interceptor/assoc-effect","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",19,"^X",["^Q",[["^S","^12","^13"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",40,"^M",40,"^[",3,"^10",true,"^P",["^Q",["^R",["^Q",[["^S","^12","^13"]]]]]],"~$enqueue",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",109,"^L",7,"^M",109,"^N",14,"^P",["^Q",["^R",["^Q",[["^S","^1J"]]]]],"^U","Add a collection of `interceptors` to the end of `context's` execution `:queue`.\n  Returns the updated `context`.\n\n  In an advanced case, this function could allow an interceptor to add new\n  interceptors to the `:queue` of a context."],"^<","~$re-frame.interceptor/enqueue","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",14,"^X",["^Q",[["^S","^1J"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",109,"^M",109,"^[",2,"^10",true,"^P",["^Q",["^R",["^Q",[["^S","^1J"]]]]],"^U","Add a collection of `interceptors` to the end of `context's` execution `:queue`.\n  Returns the updated `context`.\n\n  In an advanced case, this function could allow an interceptor to add new\n  interceptors to the `:queue` of a context."],"~$mandatory-interceptor-keys",["^ ","^<","~$re-frame.interceptor/mandatory-interceptor-keys","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",9,"^L",1,"^M",9,"^N",32,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",9,"^L",6,"^M",9,"^N",32],"~:tag","~$cljs.core/ISet"],"~$interceptor?",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",11,"^L",7,"^M",11,"^N",19,"^P",["^Q",["^R",["^Q",[["~$m"]]]]]],"^<","~$re-frame.interceptor/interceptor?","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",19,"^X",["^Q",[["~$m"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",11,"^M",11,"^[",1,"^10",true,"^P",["^Q",["^R",["^Q",[["~$m"]]]]]],"~$change-direction",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",132,"^L",8,"^M",132,"^N",24,"^O",true,"^P",["^Q",["^R",["^Q",[["^S"]]]]],"^U","Called on completion of `:before` processing, this function prepares/modifies\n   `context` for the backwards sweep of processing in which an interceptor\n   chain's `:after` fns are called.\n\n  At this point in processing, the `:queue` is empty and `:stack` holds all\n  the previously run interceptors. So this function enables the backwards walk\n  by priming `:queue` with what's currently in `:stack`"],"^O",true,"^<","~$re-frame.interceptor/change-direction","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",24,"^X",["^Q",[["^S"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",132,"^M",132,"^[",1,"^10",true,"^P",["^Q",["^R",["^Q",[["^S"]]]]],"^U","Called on completion of `:before` processing, this function prepares/modifies\n   `context` for the backwards sweep of processing in which an interceptor\n   chain's `:after` fns are called.\n\n  At this point in processing, the `:queue` is empty and `:stack` holds all\n  the previously run interceptors. So this function enables the backwards walk\n  by priming `:queue` with what's currently in `:stack`"],"^S",["^ ","^H",null,"^I",["^ ","^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^K",121,"^L",8,"^M",121,"^N",15,"^O",true,"^P",["^Q",["^R",["^Q",[["~$event","^1J"],["^1X","^1J","~$db"]]]]],"^U","Create a fresh context","^17",["^ ","^W",false,"^[",3,"^X",["^Q",[["^1X","^1J"],["^1X","^1J","^1Y"]]],"^P",["^Q",[["^1X","^1J"],["^1X","^1J","^1Y"]]],"^Z",["^Q",[null,null]]]],"^O",true,"^<","~$re-frame.interceptor/context","^W",false,"^J","/home/julien/.cljs/.aot_cache/1.10.329/54E7700/re_frame/interceptor.cljc","^N",15,"^17",["^ ","^W",false,"^[",3,"^X",["^Q",[["^1X","^1J"],["^1X","^1J","^1Y"]]],"^P",["^Q",[["^1X","^1J"],["^1X","^1J","^1Y"]]],"^Z",["^Q",[null,null]]],"^X",["^Q",[["^1X","^1J"],["^1X","^1J","^1Y"]]],"^Y",null,"^Z",["^Q",[null,null]],"^L",1,"^K",121,"^M",121,"^[",3,"^10",true,"^P",["^Q",[["^1X","^1J"],["^1X","^1J","^1Y"]]],"^U","Create a fresh context"]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^@","^A","^A","^A"],"~:cljs.analyzer/constants",["^ ","~:seen",["^;",["~:unnamed","~:tags","~:db","~:queue","~:event","~:after","~:id","~:effects","~:stack","~:error","~:coeffects","~:interceptors","~:before"]],"~:order",["^28","^29","^2?","^2<","^23","^2:","^2=","^26","^2;","^27","^25","^24","^2>"]],"^U",null]
\ No newline at end of file
diff --git a/js/re_frame/interceptor.js b/js/re_frame/interceptor.js
new file mode 100644
index 0000000..059cf15
--- /dev/null
+++ b/js/re_frame/interceptor.js
@@ -0,0 +1,345 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.interceptor');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.loggers');
+goog.require('re_frame.interop');
+goog.require('re_frame.trace');
+goog.require('clojure.set');
+re_frame.interceptor.mandatory_interceptor_keys = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$after,null,cljs.core.cst$kw$id,null,cljs.core.cst$kw$before,null], null), null);
+re_frame.interceptor.interceptor_QMARK_ = (function re_frame$interceptor$interceptor_QMARK_(m){
+return ((cljs.core.map_QMARK_(m)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(re_frame.interceptor.mandatory_interceptor_keys,cljs.core.set(cljs.core.keys(m)))));
+});
+/**
+ * Create an interceptor from named arguments
+ */
+re_frame.interceptor.__GT_interceptor = (function re_frame$interceptor$__GT_interceptor(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4516 = arguments.length;
+var i__4519__auto___4517 = (0);
+while(true){
+if((i__4519__auto___4517 < len__4518__auto___4516)){
+args__4521__auto__.push((arguments[i__4519__auto___4517]));
+
+var G__4518 = (i__4519__auto___4517 + (1));
+i__4519__auto___4517 = G__4518;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic = (function (p__4513){
+var map__4514 = p__4513;
+var map__4514__$1 = ((((!((map__4514 == null)))?(((((map__4514.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__4514.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__4514):map__4514);
+var m = map__4514__$1;
+var id = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4514__$1,cljs.core.cst$kw$id);
+var before = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4514__$1,cljs.core.cst$kw$before);
+var after = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4514__$1,cljs.core.cst$kw$after);
+if(re_frame.interop.debug_enabled_QMARK_){
+var temp__5455__auto___4519 = cljs.core.seq(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(cljs.core.set(cljs.core.keys(m)),re_frame.interceptor.mandatory_interceptor_keys));
+if(temp__5455__auto___4519){
+var unknown_keys_4520 = temp__5455__auto___4519;
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: ->interceptor",m,"has unknown keys:",unknown_keys_4520], 0));
+} else {
+}
+} else {
+}
+
+return new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$id,(function (){var or__3936__auto__ = id;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.cst$kw$unnamed;
+}
+})(),cljs.core.cst$kw$before,before,cljs.core.cst$kw$after,after], null);
+});
+
+re_frame.interceptor.__GT_interceptor.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+re_frame.interceptor.__GT_interceptor.cljs$lang$applyTo = (function (seq4512){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq4512));
+});
+
+re_frame.interceptor.get_effect = (function re_frame$interceptor$get_effect(var_args){
+var G__4522 = arguments.length;
+switch (G__4522) {
+case 1:
+return re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$1 = (function (context){
+return cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(context);
+});
+
+re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$2 = (function (context,key){
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$effects,key], null));
+});
+
+re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$3 = (function (context,key,not_found){
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$3(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$effects,key], null),not_found);
+});
+
+re_frame.interceptor.get_effect.cljs$lang$maxFixedArity = 3;
+
+re_frame.interceptor.assoc_effect = (function re_frame$interceptor$assoc_effect(context,key,value){
+return cljs.core.assoc_in(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$effects,key], null),value);
+});
+re_frame.interceptor.get_coeffect = (function re_frame$interceptor$get_coeffect(var_args){
+var G__4525 = arguments.length;
+switch (G__4525) {
+case 1:
+return re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$1 = (function (context){
+return cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context);
+});
+
+re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2 = (function (context,key){
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,key], null));
+});
+
+re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$3 = (function (context,key,not_found){
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$3(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,key], null),not_found);
+});
+
+re_frame.interceptor.get_coeffect.cljs$lang$maxFixedArity = 3;
+
+re_frame.interceptor.assoc_coeffect = (function re_frame$interceptor$assoc_coeffect(context,key,value){
+return cljs.core.assoc_in(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,key], null),value);
+});
+re_frame.interceptor.update_coeffect = (function re_frame$interceptor$update_coeffect(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___4531 = arguments.length;
+var i__4519__auto___4532 = (0);
+while(true){
+if((i__4519__auto___4532 < len__4518__auto___4531)){
+args__4521__auto__.push((arguments[i__4519__auto___4532]));
+
+var G__4533 = (i__4519__auto___4532 + (1));
+i__4519__auto___4532 = G__4533;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((3) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((3)),(0),null)):null);
+return re_frame.interceptor.update_coeffect.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4522__auto__);
+});
+
+re_frame.interceptor.update_coeffect.cljs$core$IFn$_invoke$arity$variadic = (function (context,key,f,args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(cljs.core.update_in,context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,key], null),f,args);
+});
+
+re_frame.interceptor.update_coeffect.cljs$lang$maxFixedArity = (3);
+
+/** @this {Function} */
+re_frame.interceptor.update_coeffect.cljs$lang$applyTo = (function (seq4527){
+var G__4528 = cljs.core.first(seq4527);
+var seq4527__$1 = cljs.core.next(seq4527);
+var G__4529 = cljs.core.first(seq4527__$1);
+var seq4527__$2 = cljs.core.next(seq4527__$1);
+var G__4530 = cljs.core.first(seq4527__$2);
+var seq4527__$3 = cljs.core.next(seq4527__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__4528,G__4529,G__4530,seq4527__$3);
+});
+
+re_frame.interceptor.invoke_interceptor_fn = (function re_frame$interceptor$invoke_interceptor_fn(context,interceptor,direction){
+var temp__5455__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$2(interceptor,direction);
+if(cljs.core.truth_(temp__5455__auto__)){
+var f = temp__5455__auto__;
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(context) : f.call(null,context));
+} else {
+return context;
+}
+});
+/**
+ * Loop over all interceptors, calling `direction` function on each,
+ *   threading the value of `context` through every call.
+ * 
+ *   `direction` is one of `:before` or `:after`.
+ * 
+ *   Each iteration, the next interceptor to process is obtained from
+ *   context's `:queue`. After they are processed, interceptors are popped
+ *   from `:queue` and added to `:stack`.
+ * 
+ *   After sufficient iteration, `:queue` will be empty, and `:stack` will
+ *   contain all interceptors processed.
+ * 
+ *   Returns updated `context`. Ie. the `context` which has been threaded
+ *   through all interceptor functions.
+ * 
+ *   Generally speaking, an interceptor's `:before` function will (if present)
+ *   add to a `context's` `:coeffects`, while it's `:after` function
+ *   will modify the `context`'s `:effects`.  Very approximately.
+ * 
+ *   But because all interceptor functions are given `context`, and can
+ *   return a modified version of it, the way is clear for an interceptor
+ *   to introspect the stack or queue, or even modify the queue
+ *   (add new interceptors via `enqueue`?). This is a very fluid arrangement.
+ */
+re_frame.interceptor.invoke_interceptors = (function re_frame$interceptor$invoke_interceptors(context,direction){
+var context__$1 = context;
+while(true){
+var queue = cljs.core.cst$kw$queue.cljs$core$IFn$_invoke$arity$1(context__$1);
+if(cljs.core.empty_QMARK_(queue)){
+return context__$1;
+} else {
+var interceptor = cljs.core.peek(queue);
+var stack = cljs.core.cst$kw$stack.cljs$core$IFn$_invoke$arity$1(context__$1);
+var G__4534 = re_frame.interceptor.invoke_interceptor_fn(cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(context__$1,cljs.core.cst$kw$queue,cljs.core.pop(queue),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$stack,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack,interceptor)], 0)),interceptor,direction);
+context__$1 = G__4534;
+continue;
+}
+break;
+}
+});
+/**
+ * Add a collection of `interceptors` to the end of `context's` execution `:queue`.
+ *   Returns the updated `context`.
+ * 
+ *   In an advanced case, this function could allow an interceptor to add new
+ *   interceptors to the `:queue` of a context.
+ */
+re_frame.interceptor.enqueue = (function re_frame$interceptor$enqueue(context,interceptors){
+return cljs.core.update.cljs$core$IFn$_invoke$arity$4(context,cljs.core.cst$kw$queue,cljs.core.fnil.cljs$core$IFn$_invoke$arity$2(cljs.core.into,re_frame.interop.empty_queue),interceptors);
+});
+/**
+ * Create a fresh context
+ */
+re_frame.interceptor.context = (function re_frame$interceptor$context(var_args){
+var G__4536 = arguments.length;
+switch (G__4536) {
+case 2:
+return re_frame.interceptor.context.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return re_frame.interceptor.context.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.interceptor.context.cljs$core$IFn$_invoke$arity$2 = (function (event,interceptors){
+return re_frame.interceptor.enqueue(re_frame.interceptor.assoc_coeffect(cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$event,event),interceptors);
+});
+
+re_frame.interceptor.context.cljs$core$IFn$_invoke$arity$3 = (function (event,interceptors,db){
+return re_frame.interceptor.assoc_coeffect(re_frame.interceptor.context.cljs$core$IFn$_invoke$arity$2(event,interceptors),cljs.core.cst$kw$db,db);
+});
+
+re_frame.interceptor.context.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Called on completion of `:before` processing, this function prepares/modifies
+ * `context` for the backwards sweep of processing in which an interceptor
+ * chain's `:after` fns are called.
+ * 
+ *   At this point in processing, the `:queue` is empty and `:stack` holds all
+ *   the previously run interceptors. So this function enables the backwards walk
+ *   by priming `:queue` with what's currently in `:stack`
+ */
+re_frame.interceptor.change_direction = (function re_frame$interceptor$change_direction(context){
+return re_frame.interceptor.enqueue(cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$queue),cljs.core.cst$kw$stack.cljs$core$IFn$_invoke$arity$1(context));
+});
+/**
+ * Executes the given chain (coll) of interceptors.
+ * 
+ * Each interceptor has this form:
+ *     {:before  (fn [context] ...)     ;; returns possibly modified context
+ *      :after   (fn [context] ...)}    ;; `identity` would be a noop
+ * 
+ * Walks the queue of iterceptors from beginning to end, calling the
+ * `:before` fn on each, then reverse direction and walk backwards,
+ * calling the `:after` fn on each.
+ * 
+ * The last interceptor in the chain presumably wraps an event
+ * handler fn. So the overall goal of the process is to "handle
+ * the given event".
+ * 
+ * Thread a `context` through all calls. `context` has this form:
+ * 
+ *   {:coeffects {:event [:a-query-id :some-param]
+ *                :db    <original contents of app-db>}
+ *    :effects   {:db    <new value for app-db>
+ *                :dispatch  [:an-event-id :param1]}
+ *    :queue     <a collection of further interceptors>
+ *    :stack     <a collection of interceptors already walked>}
+ * 
+ * `context` has `:coeffects` and `:effects` which, if this was a web
+ * server, would be somewhat anologous to `request` and `response`
+ * respectively.
+ * 
+ * `coeffects` will contain data like `event` and the initial
+ * state of `db` -  the inputs required by the event handler
+ * (sitting presumably on the end of the chain), while handler-returned
+ * side effects are put into `:effects` including, but not limited to,
+ * new values for `db`.
+ * 
+ * The first few interceptors in a chain will likely have `:before`
+ * functions which "prime" the `context` by adding the event, and
+ * the current state of app-db into `:coeffects`. But interceptors can
+ * add whatever they want to `:coeffects` - perhaps the event handler needs
+ * some information from localstore, or a random number, or access to
+ * a DataScript connection.
+ * 
+ * Equally, some interceptors in the chain will have `:after` fn
+ * which can process the side effects accumulated into `:effects`
+ * including but, not limited to, updates to app-db.
+ * 
+ * Through both stages (before and after), `context` contains a `:queue`
+ * of interceptors yet to be processed, and a `:stack` of interceptors
+ * already done.  In advanced cases, these values can be modified by the
+ * functions through which the context is threaded.
+ */
+re_frame.interceptor.execute = (function re_frame$interceptor$execute(event_v,interceptors){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___4538 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$interceptors,interceptors], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$interceptors,interceptors], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___4538;
+
+} else {
+}
+
+return re_frame.interceptor.invoke_interceptors(re_frame.interceptor.change_direction(re_frame.interceptor.invoke_interceptors(re_frame.interceptor.context.cljs$core$IFn$_invoke$arity$2(event_v,interceptors),cljs.core.cst$kw$before)),cljs.core.cst$kw$after);
+});
diff --git a/js/re_frame/interop.cljs b/js/re_frame/interop.cljs
new file mode 100644
index 0000000..5d0e13a
--- /dev/null
+++ b/js/re_frame/interop.cljs
@@ -0,0 +1,58 @@
+(ns re-frame.interop
+  (:require [goog.async.nextTick]
+            [reagent.core]
+            [reagent.ratom]))
+
+(def next-tick goog.async.nextTick)
+
+(def empty-queue #queue [])
+
+(def after-render reagent.core/after-render)
+
+;; Make sure the Google Closure compiler sees this as a boolean constant,
+;; otherwise Dead Code Elimination won't happen in `:advanced` builds.
+;; Type hints have been liberally sprinkled.
+;; https://developers.google.com/closure/compiler/docs/js-for-compiler
+(def ^boolean debug-enabled? "@define {boolean}" ^boolean js/goog.DEBUG)
+
+(defn ratom [x]
+  (reagent.core/atom x))
+
+(defn ratom? [x]
+  (satisfies? reagent.ratom/IReactiveAtom x))
+
+(defn deref? [x]
+  (satisfies? IDeref x))
+
+
+(defn make-reaction [f]
+  (reagent.ratom/make-reaction f))
+
+(defn add-on-dispose! [a-ratom f]
+  (reagent.ratom/add-on-dispose! a-ratom f))
+
+(defn dispose! [a-ratom]
+	(reagent.ratom/dispose! a-ratom))
+
+(defn set-timeout! [f ms]
+  (js/setTimeout f ms))
+
+(defn now []
+  (if (and
+       (exists? js/performance)
+       (exists? js/performance.now))
+    (js/performance.now)
+    (js/Date.now)))
+
+(defn reagent-id
+  "Produces an id for reactive Reagent values
+  e.g. reactions, ratoms, cursors."
+  [reactive-val]
+  (when (implements? reagent.ratom/IReactiveAtom reactive-val)
+    (str (condp instance? reactive-val
+           reagent.ratom/RAtom "ra"
+           reagent.ratom/RCursor "rc"
+           reagent.ratom/Reaction "rx"
+           reagent.ratom/Track "tr"
+           "other")
+         (hash reactive-val))))
diff --git a/js/re_frame/interop.cljs.cache.json b/js/re_frame/interop.cljs.cache.json
new file mode 100644
index 0000000..f916ac5
--- /dev/null
+++ b/js/re_frame/interop.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$goog",["^ ","~$DEBUG",["^ "]],"~$setTimeout",["^ "],"~$performance",["^ ","~$now",["^ "]],"~$Date",["^ ","^7",["^ "]]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$re-frame.interop","~:imports",null,"~:requires",["^ ","~$goog.async.nextTick","^@","~$reagent.core","^A","~$reagent.ratom","^B"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$reagent-id",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","~:line",47,"~:column",7,"~:end-line",47,"~:end-column",17,"~:arglists",["~#list",["~$quote",["^O",[["~$reactive-val"]]]]],"~:doc","Produces an id for reactive Reagent values\n  e.g. reactions, ratoms, cursors."],"^<","~$re-frame.interop/reagent-id","~:variadic",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",17,"~:method-params",["^O",[["^Q"]]],"~:protocol-impl",null,"~:arglists-meta",["^O",[null,null]],"^K",1,"^J",47,"^L",47,"~:max-fixed-arity",1,"~:fn-var",true,"^N",["^O",["^P",["^O",[["^Q"]]]]],"^R","Produces an id for reactive Reagent values\n  e.g. reactions, ratoms, cursors."],"~$after-render",["^ ","^<","~$re-frame.interop/after-render","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",10,"^K",1,"^L",10,"^M",18,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",10,"^K",6,"^L",10,"^M",18]],"~$next-tick",["^ ","^<","~$re-frame.interop/next-tick","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",6,"^K",1,"^L",6,"^M",15,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",6,"^K",6,"^L",6,"^M",15]],"~$dispose!",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",34,"^K",7,"^L",34,"^M",15,"^N",["^O",["^P",["^O",[["~$a-ratom"]]]]]],"^<","~$re-frame.interop/dispose!","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",15,"^U",["^O",[["^13"]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",34,"^L",34,"^X",1,"^Y",true,"^N",["^O",["^P",["^O",[["^13"]]]]]],"~$add-on-dispose!",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",31,"^K",7,"^L",31,"^M",22,"^N",["^O",["^P",["^O",[["^13","~$f"]]]]]],"^<","~$re-frame.interop/add-on-dispose!","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",22,"^U",["^O",[["^13","~$f"]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",31,"^L",31,"^X",2,"^Y",true,"^N",["^O",["^P",["^O",[["^13","~$f"]]]]]],"^7",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",40,"^K",7,"^L",40,"^M",10,"^N",["^O",["^P",["^O",[[]]]]]],"^<","~$re-frame.interop/now","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",10,"^U",["^O",[[]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",40,"^L",40,"^X",0,"^Y",true,"^N",["^O",["^P",["^O",[[]]]]]],"~$set-timeout!",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",37,"^K",7,"^L",37,"^M",19,"^N",["^O",["^P",["^O",[["~$f","~$ms"]]]]]],"^<","~$re-frame.interop/set-timeout!","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",19,"^U",["^O",[["~$f","^19"]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",37,"^L",37,"^X",2,"^Y",true,"^N",["^O",["^P",["^O",[["~$f","^19"]]]]]],"~$make-reaction",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",28,"^K",7,"^L",28,"^M",20,"^N",["^O",["^P",["^O",[["~$f"]]]]]],"^<","~$re-frame.interop/make-reaction","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",20,"^U",["^O",[["~$f"]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",28,"^L",28,"^X",1,"^Y",true,"^N",["^O",["^P",["^O",[["~$f"]]]]]],"~$ratom",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",18,"^K",7,"^L",18,"^M",12,"^N",["^O",["^P",["^O",[["~$x"]]]]]],"^<","~$re-frame.interop/ratom","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",12,"^U",["^O",[["~$x"]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",18,"^L",18,"^X",1,"^Y",true,"^N",["^O",["^P",["^O",[["~$x"]]]]]],"~$deref?",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",24,"^K",7,"^L",24,"^M",13,"^N",["^O",["^P",["^O",[["~$x"]]]]]],"^<","~$re-frame.interop/deref?","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",13,"^U",["^O",[["~$x"]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",24,"^L",24,"^X",1,"^Y",true,"^N",["^O",["^P",["^O",[["~$x"]]]]]],"~$ratom?",["^ ","^G",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",21,"^K",7,"^L",21,"^M",13,"^N",["^O",["^P",["^O",[["~$x"]]]]]],"^<","~$re-frame.interop/ratom?","^T",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^M",13,"^U",["^O",[["~$x"]]],"^V",null,"^W",["^O",[null,null]],"^K",1,"^J",21,"^L",21,"^X",1,"^Y",true,"^N",["^O",["^P",["^O",[["~$x"]]]]]],"~$empty-queue",["^ ","^<","~$re-frame.interop/empty-queue","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",8,"^K",1,"^L",8,"^M",17,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",8,"^K",6,"^L",8,"^M",17],"~:tag","~$any"],"~$debug-enabled?",["^ ","^<","~$re-frame.interop/debug-enabled?","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",16,"^K",1,"^L",16,"^M",29,"^1E","~$boolean","^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/73B27ED/re_frame/interop.cljs","^J",16,"^K",15,"^L",16,"^M",29,"^1E","^1I"],"^R","@define {boolean}"]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^A","^A","^B","^B"],"^R",null]
\ No newline at end of file
diff --git a/js/re_frame/interop.js b/js/re_frame/interop.js
new file mode 100644
index 0000000..42a477b
--- /dev/null
+++ b/js/re_frame/interop.js
@@ -0,0 +1,96 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.interop');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('goog.async.nextTick');
+goog.require('reagent.core');
+goog.require('reagent.ratom');
+re_frame.interop.next_tick = goog.async.nextTick;
+re_frame.interop.empty_queue = cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentQueue.EMPTY,cljs.core.PersistentVector.EMPTY);
+re_frame.interop.after_render = reagent.core.after_render;
+/**
+ * @define {boolean}
+ */
+re_frame.interop.debug_enabled_QMARK_ = goog.DEBUG;
+re_frame.interop.ratom = (function re_frame$interop$ratom(x){
+return reagent.core.atom.cljs$core$IFn$_invoke$arity$1(x);
+});
+re_frame.interop.ratom_QMARK_ = (function re_frame$interop$ratom_QMARK_(x){
+if(!((x == null))){
+if(((false) || ((cljs.core.PROTOCOL_SENTINEL === x.reagent$ratom$IReactiveAtom$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition$)){
+return cljs.core.native_satisfies_QMARK_(reagent.ratom.IReactiveAtom,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(reagent.ratom.IReactiveAtom,x);
+}
+});
+re_frame.interop.deref_QMARK_ = (function re_frame$interop$deref_QMARK_(x){
+if(!((x == null))){
+if((((x.cljs$lang$protocol_mask$partition0$ & (32768))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IDeref$)))){
+return true;
+} else {
+if((!x.cljs$lang$protocol_mask$partition0$)){
+return cljs.core.native_satisfies_QMARK_(cljs.core.IDeref,x);
+} else {
+return false;
+}
+}
+} else {
+return cljs.core.native_satisfies_QMARK_(cljs.core.IDeref,x);
+}
+});
+re_frame.interop.make_reaction = (function re_frame$interop$make_reaction(f){
+return reagent.ratom.make_reaction(f);
+});
+re_frame.interop.add_on_dispose_BANG_ = (function re_frame$interop$add_on_dispose_BANG_(a_ratom,f){
+return reagent.ratom.add_on_dispose_BANG_(a_ratom,f);
+});
+re_frame.interop.dispose_BANG_ = (function re_frame$interop$dispose_BANG_(a_ratom){
+return reagent.ratom.dispose_BANG_(a_ratom);
+});
+re_frame.interop.set_timeout_BANG_ = (function re_frame$interop$set_timeout_BANG_(f,ms){
+return setTimeout(f,ms);
+});
+re_frame.interop.now = (function re_frame$interop$now(){
+if((((typeof performance !== 'undefined')) && ((typeof performance !== 'undefined') && (typeof performance.now !== 'undefined')))){
+return performance.now();
+} else {
+return Date.now();
+}
+});
+/**
+ * Produces an id for reactive Reagent values
+ *   e.g. reactions, ratoms, cursors.
+ */
+re_frame.interop.reagent_id = (function re_frame$interop$reagent_id(reactive_val){
+if(((!((reactive_val == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === reactive_val.reagent$ratom$IReactiveAtom$))))?true:false):false)){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1((function (){var pred__3977 = cljs.core.instance_QMARK_;
+var expr__3978 = reactive_val;
+if(cljs.core.truth_((pred__3977.cljs$core$IFn$_invoke$arity$2 ? pred__3977.cljs$core$IFn$_invoke$arity$2(reagent.ratom.RAtom,expr__3978) : pred__3977.call(null,reagent.ratom.RAtom,expr__3978)))){
+return "ra";
+} else {
+if(cljs.core.truth_((pred__3977.cljs$core$IFn$_invoke$arity$2 ? pred__3977.cljs$core$IFn$_invoke$arity$2(reagent.ratom.RCursor,expr__3978) : pred__3977.call(null,reagent.ratom.RCursor,expr__3978)))){
+return "rc";
+} else {
+if(cljs.core.truth_((pred__3977.cljs$core$IFn$_invoke$arity$2 ? pred__3977.cljs$core$IFn$_invoke$arity$2(reagent.ratom.Reaction,expr__3978) : pred__3977.call(null,reagent.ratom.Reaction,expr__3978)))){
+return "rx";
+} else {
+if(cljs.core.truth_((pred__3977.cljs$core$IFn$_invoke$arity$2 ? pred__3977.cljs$core$IFn$_invoke$arity$2(reagent.ratom.Track,expr__3978) : pred__3977.call(null,reagent.ratom.Track,expr__3978)))){
+return "tr";
+} else {
+return "other";
+}
+}
+}
+}
+})()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.hash(reactive_val))].join('');
+} else {
+return null;
+}
+});
diff --git a/js/re_frame/loggers.cljc b/js/re_frame/loggers.cljc
new file mode 100644
index 0000000..60f71d7
--- /dev/null
+++ b/js/re_frame/loggers.cljc
@@ -0,0 +1,51 @@
+(ns re-frame.loggers
+  (:require
+   [clojure.set :refer [difference]]
+   #?@(:clj [[clojure.string :as str]
+             [clojure.tools.logging :as log]])))
+
+#?(:clj (defn log [level & args]
+          (log/log level (if (= 1 (count args))
+                           (first args)
+                           (str/join " " args)))))
+
+
+;; XXX should loggers be put in the registrar ??
+(def ^:private loggers
+  "Holds the current set of logging functions.
+   By default, re-frame uses the functions provided by js/console.
+   Use `set-loggers!` to change these defaults
+  "
+  (atom #?(:cljs {:log       (js/console.log.bind   js/console)
+                  :warn      (js/console.warn.bind  js/console)
+                  :error     (js/console.error.bind js/console)
+                  :group     (if (.-group js/console)         ;; console.group does not exist  < IE 11
+                               (js/console.group.bind js/console)
+                               (js/console.log.bind   js/console))
+                  :groupEnd  (if (.-groupEnd js/console)        ;; console.groupEnd does not exist  < IE 11
+                               (js/console.groupEnd.bind js/console)
+                               #())})
+        ;; clojure versions
+        #?(:clj {:log      (partial log :info)
+                 :warn     (partial log :warn)
+                 :error    (partial log :error)
+                 :group    (partial log :info)
+                 :groupEnd  #()})))
+
+(defn console
+  [level & args]
+  (assert (contains? @loggers level) (str "re-frame: log called with unknown level: " level))
+  (apply (level @loggers) args))
+
+
+(defn set-loggers!
+  "Change the set (or a subset) of logging functions used by re-frame.
+  `new-loggers` should be a map with the same keys as `loggers` (above)"
+  [new-loggers]
+  (assert  (empty? (difference (set (keys new-loggers)) (-> @loggers keys set))) "Unknown keys in new-loggers")
+  (swap! loggers merge new-loggers))
+
+(defn get-loggers
+  "Get the current logging functions used by re-frame."
+  []
+  @loggers)
diff --git a/js/re_frame/loggers.cljc.cache.json b/js/re_frame/loggers.cljc.cache.json
new file mode 100644
index 0000000..87fbb31
--- /dev/null
+++ b/js/re_frame/loggers.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$console",["^ ","~$log",["^ ","~$bind",["^ "]],"~$warn",["^ ","^5",["^ "]],"~$error",["^ ","^5",["^ "]],"~$group",["^ ","^5",["^ "]],"~$groupEnd",["^ ","^5",["^ "]]],"~$Error",["^ "]],"~:use-macros",["^ ","~$difference","~$clojure.set"],"~:excludes",["~#set",[]],"~:name","~$re-frame.loggers","~:imports",null,"~:requires",["^ ","^=","^="],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^<","^="],"~:defs",["^ ","~$loggers",["^ ","~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","~:line",14,"~:column",16,"~:end-line",14,"~:end-column",23,"~:private",true],"^N",true,"^@","~$re-frame.loggers/loggers","^I","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","^M",23,"^K",1,"^J",14,"^L",14,"~:tag","~$any","~:doc","Holds the current set of logging functions.\n   By default, re-frame uses the functions provided by js/console.\n   Use `set-loggers!` to change these defaults\n  "],"^3",["^ ","~:protocol-inline",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","^J",35,"^K",7,"^L",35,"^M",14,"~:arglists",["~#list",["~$quote",["^U",[["~$level","~$&","~$args"]]]]],"~:top-fn",["^ ","~:variadic",true,"~:max-fixed-arity",1,"~:method-params",[["^U",["^W","^X"]]],"^T",["^U",[["^W","~$&","^X"]]],"~:arglists-meta",["^U",[null]]]],"^@","~$re-frame.loggers/console","^Z",true,"^I","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","^M",14,"^Y",["^ ","^Z",true,"^[",1,"^10",[["^U",["^W","^X"]]],"^T",["^U",[["^W","~$&","^X"]]],"^11",["^U",[null]]],"^10",[["^U",["^W","^X"]]],"~:protocol-impl",null,"^11",["^U",[null]],"^K",1,"^J",35,"^L",35,"^[",1,"~:fn-var",true,"^T",["^U",[["^W","~$&","^X"]]]],"~$set-loggers!",["^ ","^S",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","^J",41,"^K",7,"^L",41,"^M",19,"^T",["^U",["^V",["^U",[["~$new-loggers"]]]]],"^R","Change the set (or a subset) of logging functions used by re-frame.\n  `new-loggers` should be a map with the same keys as `loggers` (above)"],"^@","~$re-frame.loggers/set-loggers!","^Z",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","^M",19,"^10",["^U",[["^16"]]],"^13",null,"^11",["^U",[null,null]],"^K",1,"^J",41,"^L",41,"^[",1,"^14",true,"^T",["^U",["^V",["^U",[["^16"]]]]],"^R","Change the set (or a subset) of logging functions used by re-frame.\n  `new-loggers` should be a map with the same keys as `loggers` (above)"],"~$get-loggers",["^ ","^S",null,"^H",["^ ","^I","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","^J",48,"^K",7,"^L",48,"^M",18,"^T",["^U",["^V",["^U",[[]]]]],"^R","Get the current logging functions used by re-frame."],"^@","~$re-frame.loggers/get-loggers","^Z",false,"^I","/home/julien/.cljs/.aot_cache/1.10.329/9AF8553/re_frame/loggers.cljc","^M",18,"^10",["^U",[[]]],"^13",null,"^11",["^U",[null,null]],"^K",1,"^J",48,"^L",48,"^[",0,"^14",true,"^T",["^U",["^V",["^U",[[]]]]],"^R","Get the current logging functions used by re-frame."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^?",["~:group","~:warn","~:error","~:groupEnd","~:log"]],"~:order",["^1B","^1?","^1@","^1>","^1A"]],"^R",null]
\ No newline at end of file
diff --git a/js/re_frame/loggers.js b/js/re_frame/loggers.js
new file mode 100644
index 0000000..8cfc75f
--- /dev/null
+++ b/js/re_frame/loggers.js
@@ -0,0 +1,73 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.loggers');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.set');
+/**
+ * Holds the current set of logging functions.
+ * By default, re-frame uses the functions provided by js/console.
+ * Use `set-loggers!` to change these defaults
+ *   
+ */
+re_frame.loggers.loggers = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 5, [cljs.core.cst$kw$log,console.log.bind(console),cljs.core.cst$kw$warn,console.warn.bind(console),cljs.core.cst$kw$error,console.error.bind(console),cljs.core.cst$kw$group,(cljs.core.truth_(console.group)?console.group.bind(console):console.log.bind(console)),cljs.core.cst$kw$groupEnd,(cljs.core.truth_(console.groupEnd)?console.groupEnd.bind(console):(function (){
+return cljs.core.List.EMPTY;
+}))], null));
+re_frame.loggers.console = (function re_frame$loggers$console(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3985 = arguments.length;
+var i__4519__auto___3986 = (0);
+while(true){
+if((i__4519__auto___3986 < len__4518__auto___3985)){
+args__4521__auto__.push((arguments[i__4519__auto___3986]));
+
+var G__3987 = (i__4519__auto___3986 + (1));
+i__4519__auto___3986 = G__3987;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic = (function (level,args){
+if(cljs.core.contains_QMARK_(cljs.core.deref(re_frame.loggers.loggers),level)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["re-frame: log called with unknown level: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(level)].join('')),"\n","(contains? (clojure.core/deref loggers) level)"].join('')));
+}
+
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2((function (){var G__3984 = cljs.core.deref(re_frame.loggers.loggers);
+return (level.cljs$core$IFn$_invoke$arity$1 ? level.cljs$core$IFn$_invoke$arity$1(G__3984) : level.call(null,G__3984));
+})(),args);
+});
+
+re_frame.loggers.console.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+re_frame.loggers.console.cljs$lang$applyTo = (function (seq3982){
+var G__3983 = cljs.core.first(seq3982);
+var seq3982__$1 = cljs.core.next(seq3982);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3983,seq3982__$1);
+});
+
+/**
+ * Change the set (or a subset) of logging functions used by re-frame.
+ *   `new-loggers` should be a map with the same keys as `loggers` (above)
+ */
+re_frame.loggers.set_loggers_BANG_ = (function re_frame$loggers$set_loggers_BANG_(new_loggers){
+if(cljs.core.empty_QMARK_(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(cljs.core.set(cljs.core.keys(new_loggers)),cljs.core.set(cljs.core.keys(cljs.core.deref(re_frame.loggers.loggers)))))){
+} else {
+throw (new Error(["Assert failed: ","Unknown keys in new-loggers","\n","(empty? (difference (set (keys new-loggers)) (-> (clojure.core/deref loggers) keys set)))"].join('')));
+}
+
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.loggers.loggers,cljs.core.merge,new_loggers);
+});
+/**
+ * Get the current logging functions used by re-frame.
+ */
+re_frame.loggers.get_loggers = (function re_frame$loggers$get_loggers(){
+return cljs.core.deref(re_frame.loggers.loggers);
+});
diff --git a/js/re_frame/registrar.cljc b/js/re_frame/registrar.cljc
new file mode 100644
index 0000000..6c38818
--- /dev/null
+++ b/js/re_frame/registrar.cljc
@@ -0,0 +1,56 @@
+(ns re-frame.registrar
+  "In many places, re-frame asks you to associate an `id` (keyword)
+  with a `handler` (function).  This namespace contains the
+  central registry of such associations."
+  (:require  [re-frame.interop :refer [debug-enabled?]]
+             [re-frame.loggers :refer [console]]))
+
+
+;; kinds of handlers
+(def kinds #{:event :fx :cofx :sub})
+
+;; This atom contains a register of all handlers.
+;; Contains a two layer map, keyed first by `kind` (of handler), and then `id` of handler.
+;; Leaf nodes are handlers.
+(def kind->id->handler  (atom {}))
+
+
+(defn get-handler
+
+  ([kind]
+   (get @kind->id->handler kind))
+
+  ([kind id]
+   (-> (get @kind->id->handler kind)
+       (get id)))
+
+  ([kind id required?]
+   (let [handler (get-handler kind id)]
+     (when debug-enabled?                          ;; This is in a separate `when` so Closure DCE can run ...
+       (when (and required? (nil? handler))        ;; ...otherwise you'd need to type-hint the `and` with a ^boolean for DCE.
+         (console :error "re-frame: no" (str kind) "handler registered for:" id)))
+     handler)))
+
+
+(defn register-handler
+  [kind id handler-fn]
+  (when debug-enabled?                                       ;; This is in a separate when so Closure DCE can run
+    (when (get-handler kind id false)
+      (console :warn "re-frame: overwriting" (str kind) "handler for:" id)))   ;; allow it, but warn. Happens on figwheel reloads.
+  (swap! kind->id->handler assoc-in [kind id] handler-fn)
+  handler-fn)    ;; note: returns the just registered handler
+
+
+(defn clear-handlers
+  ([]            ;; clear all kinds
+   (reset! kind->id->handler {}))
+
+  ([kind]        ;; clear all handlers for this kind
+   (assert (kinds kind))
+   (swap! kind->id->handler dissoc kind))
+
+  ([kind id]     ;; clear a single handler for a kind
+   (assert (kinds kind))
+   (if (get-handler kind id)
+     (swap! kind->id->handler update-in [kind] dissoc id)
+     (console :warn "re-frame: can't clear" (str kind) "handler for" (str id ". Handler not found.")))))
diff --git a/js/re_frame/registrar.cljc.cache.json b/js/re_frame/registrar.cljc.cache.json
new file mode 100644
index 0000000..fa40d26
--- /dev/null
+++ b/js/re_frame/registrar.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ ","~$console","~$re-frame.loggers","~$debug-enabled?","~$re-frame.interop"],"~:excludes",["~#set",[]],"~:name","~$re-frame.registrar","~:imports",null,"~:requires",["^ ","^8","^8","^6","^6"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^5","^6","^7","^8"],"~:defs",["^ ","~$kinds",["^ ","^;","~$re-frame.registrar/kinds","~:file","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","~:line",10,"~:column",1,"~:end-line",10,"~:end-column",11,"~:meta",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^E",10,"^F",6,"^G",10,"^H",11],"~:tag","~$cljs.core/ISet"],"~$kind->id->handler",["^ ","^;","~$re-frame.registrar/kind->id->handler","^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^E",15,"^F",1,"^G",15,"^H",23,"^I",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^E",15,"^F",6,"^G",15,"^H",23],"^J","~$any"],"~$get-handler",["^ ","~:protocol-inline",null,"^I",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^E",18,"^F",7,"^G",18,"^H",18,"~:arglists",["~#list",["~$quote",["^R",[["~$kind"],["^T","~$id"],["^T","^U","~$required?"]]]]],"~:top-fn",["^ ","~:variadic",false,"~:max-fixed-arity",3,"~:method-params",["^R",[["^T"],["^T","^U"],["^T","^U","^V"]]],"^Q",["^R",[["^T"],["^T","^U"],["^T","^U","^V"]]],"~:arglists-meta",["^R",[null,null,null]]]],"^;","~$re-frame.registrar/get-handler","^X",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^H",18,"^W",["^ ","^X",false,"^Y",3,"^Z",["^R",[["^T"],["^T","^U"],["^T","^U","^V"]]],"^Q",["^R",[["^T"],["^T","^U"],["^T","^U","^V"]]],"^[",["^R",[null,null,null]]],"^Z",["^R",[["^T"],["^T","^U"],["^T","^U","^V"]]],"~:protocol-impl",null,"^[",["^R",[null,null,null]],"^F",1,"^E",18,"^G",18,"^Y",3,"~:fn-var",true,"^Q",["^R",[["^T"],["^T","^U"],["^T","^U","^V"]]]],"~$register-handler",["^ ","^P",null,"^I",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^E",35,"^F",7,"^G",35,"^H",23,"^Q",["^R",["^S",["^R",[["^T","^U","~$handler-fn"]]]]]],"^;","~$re-frame.registrar/register-handler","^X",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^H",23,"^Z",["^R",[["^T","^U","^14"]]],"^11",null,"^[",["^R",[null,null]],"^F",1,"^E",35,"^G",35,"^Y",3,"^12",true,"^Q",["^R",["^S",["^R",[["^T","^U","^14"]]]]]],"~$clear-handlers",["^ ","^P",null,"^I",["^ ","^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^E",44,"^F",7,"^G",44,"^H",21,"^Q",["^R",["^S",["^R",[[],["^T"],["^T","^U"]]]]],"^W",["^ ","^X",false,"^Y",2,"^Z",["^R",[[],["^T"],["^T","^U"]]],"^Q",["^R",[[],["^T"],["^T","^U"]]],"^[",["^R",[null,null,null]]]],"^;","~$re-frame.registrar/clear-handlers","^X",false,"^D","/home/julien/.cljs/.aot_cache/1.10.329/42FB056/re_frame/registrar.cljc","^H",21,"^W",["^ ","^X",false,"^Y",2,"^Z",["^R",[[],["^T"],["^T","^U"]]],"^Q",["^R",[[],["^T"],["^T","^U"]]],"^[",["^R",[null,null,null]]],"^Z",["^R",[[],["^T"],["^T","^U"]]],"^11",null,"^[",["^R",[null,null,null]],"^F",1,"^E",44,"^G",44,"^Y",2,"^12",true,"^Q",["^R",[[],["^T"],["^T","^U"]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^:",["~:sub","~:warn","~:event","~:error","~:cofx","~:fx"]],"~:order",["^1<","^1>","^1@","^1A","^1?","^1="]],"~:doc","In many places, re-frame asks you to associate an `id` (keyword)\n  with a `handler` (function).  This namespace contains the\n  central registry of such associations."]
\ No newline at end of file
diff --git a/js/re_frame/registrar.js b/js/re_frame/registrar.js
new file mode 100644
index 0000000..986ecaa
--- /dev/null
+++ b/js/re_frame/registrar.js
@@ -0,0 +1,120 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.registrar');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.interop');
+goog.require('re_frame.loggers');
+re_frame.registrar.kinds = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 4, [cljs.core.cst$kw$sub,null,cljs.core.cst$kw$event,null,cljs.core.cst$kw$cofx,null,cljs.core.cst$kw$fx,null], null), null);
+re_frame.registrar.kind__GT_id__GT_handler = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+re_frame.registrar.get_handler = (function re_frame$registrar$get_handler(var_args){
+var G__4542 = arguments.length;
+switch (G__4542) {
+case 1:
+return re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$1 = (function (kind){
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(re_frame.registrar.kind__GT_id__GT_handler),kind);
+});
+
+re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2 = (function (kind,id){
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(re_frame.registrar.kind__GT_id__GT_handler),kind),id);
+});
+
+re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3 = (function (kind,id,required_QMARK_){
+var handler = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(kind,id);
+if(re_frame.interop.debug_enabled_QMARK_){
+if(cljs.core.truth_((function (){var and__3925__auto__ = required_QMARK_;
+if(cljs.core.truth_(and__3925__auto__)){
+return (handler == null);
+} else {
+return and__3925__auto__;
+}
+})())){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: no",[cljs.core.str.cljs$core$IFn$_invoke$arity$1(kind)].join(''),"handler registered for:",id], 0));
+} else {
+}
+} else {
+}
+
+return handler;
+});
+
+re_frame.registrar.get_handler.cljs$lang$maxFixedArity = 3;
+
+re_frame.registrar.register_handler = (function re_frame$registrar$register_handler(kind,id,handler_fn){
+if(re_frame.interop.debug_enabled_QMARK_){
+if(cljs.core.truth_(re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$3(kind,id,false))){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: overwriting",[cljs.core.str.cljs$core$IFn$_invoke$arity$1(kind)].join(''),"handler for:",id], 0));
+} else {
+}
+} else {
+}
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(re_frame.registrar.kind__GT_id__GT_handler,cljs.core.assoc_in,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [kind,id], null),handler_fn);
+
+return handler_fn;
+});
+re_frame.registrar.clear_handlers = (function re_frame$registrar$clear_handlers(var_args){
+var G__4545 = arguments.length;
+switch (G__4545) {
+case 0:
+return re_frame.registrar.clear_handlers.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return re_frame.registrar.clear_handlers.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.registrar.clear_handlers.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.registrar.clear_handlers.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.reset_BANG_(re_frame.registrar.kind__GT_id__GT_handler,cljs.core.PersistentArrayMap.EMPTY);
+});
+
+re_frame.registrar.clear_handlers.cljs$core$IFn$_invoke$arity$1 = (function (kind){
+if(cljs.core.truth_((re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1 ? re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1(kind) : re_frame.registrar.kinds.call(null,kind)))){
+} else {
+throw (new Error("Assert failed: (kinds kind)"));
+}
+
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.registrar.kind__GT_id__GT_handler,cljs.core.dissoc,kind);
+});
+
+re_frame.registrar.clear_handlers.cljs$core$IFn$_invoke$arity$2 = (function (kind,id){
+if(cljs.core.truth_((re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1 ? re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1(kind) : re_frame.registrar.kinds.call(null,kind)))){
+} else {
+throw (new Error("Assert failed: (kinds kind)"));
+}
+
+if(cljs.core.truth_(re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(kind,id))){
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic(re_frame.registrar.kind__GT_id__GT_handler,cljs.core.update_in,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [kind], null),cljs.core.dissoc,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([id], 0));
+} else {
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: can't clear",[cljs.core.str.cljs$core$IFn$_invoke$arity$1(kind)].join(''),"handler for",[cljs.core.str.cljs$core$IFn$_invoke$arity$1(id),". Handler not found."].join('')], 0));
+}
+});
+
+re_frame.registrar.clear_handlers.cljs$lang$maxFixedArity = 2;
+
diff --git a/js/re_frame/router.cljc b/js/re_frame/router.cljc
new file mode 100644
index 0000000..a59b145
--- /dev/null
+++ b/js/re_frame/router.cljc
@@ -0,0 +1,266 @@
+(ns re-frame.router
+  (:require [re-frame.events  :refer [handle]]
+            [re-frame.interop :refer [after-render empty-queue next-tick]]
+            [re-frame.loggers :refer [console]]
+            [re-frame.trace   :as trace :include-macros true]))
+
+
+;; -- Router Loop ------------------------------------------------------------
+;;
+;; A call to "re-frame.core/dispatch" places an event on a queue for processing.
+;; A short time later, the handler registered to handle this event will be run.
+;; What follows is the implementation of this process.
+;;
+;; The task is to process queued events in a perpetual loop, one after
+;; the other, FIFO, calling the registered event-handler for each, being idle when
+;; there are no events, and firing up when one arrives.
+;;
+;; But browsers only have a single thread of control and we must be
+;; careful to not hog the CPU. When processing events one after another, we
+;; must regularly hand back control to the browser, so it can redraw, process
+;; websockets, etc. But not too regularly! If we are in a de-focused browser
+;; tab, our app will be CPU throttled. Each time we get back control, we have
+;; to process all queued events, or else something like a bursty websocket
+;; (producing events) might overwhelm the queue. So there's a balance.
+;;
+;; The processing/handling of an event happens "asynchronously" sometime after
+;; that event was enqueued via "dispatch". The original implementation of this router loop
+;; used `core.async`. As a result, it was fairly simple, and it mostly worked,
+;; but it did not give enough control. So now we hand-roll our own,
+;; finite-state-machine and all.
+;;
+;; In what follows, the strategy is this:
+;;   - maintain a FIFO queue of `dispatched` events.
+;;   - when a new event arrives, "schedule" processing of this queue using
+;;     goog.async.nextTick, which means it will happen "very soon".
+;;   - when processing events, one after the other, do ALL the currently
+;;     queued events. Don't stop. Don't yield to the browser. Hog that CPU.
+;;   - but if any new events are dispatched during this cycle of processing,
+;;     don't do them immediately. Leave them queued. Yield first to the browser,
+;;     and do these new events in the next processing cycle. That way we drain
+;;     the queue up to a point, but we never hog the CPU forever. In
+;;     particular, we handle the case where handling one event will beget
+;;     another event. The freshly begotten event will be handled next cycle,
+;;     with yielding in-between.
+;;   - In some cases, an event should not be handled until after the GUI has been
+;;     updated, i.e., after the next Reagent animation frame. In such a case,
+;;     the event should be dispatched with :flush-dom metadata like this:
+;;       (dispatch ^:flush-dom [:event-id other params])
+;;     Such an event will temporarily block all further processing because
+;;     events are processed sequentially: we handle one event completely
+;;     before we handle the ones behind it.
+;;
+;; Implementation notes:
+;;   - queue processing can be in a number of states: scheduled, running, paused
+;;     etc. So it is modeled as a Finite State Machine.
+;;     See "-fsm-trigger" (below) for the states and transitions.
+;;   - the scheduling is done via "goog.async.nextTick" which is pretty quick
+;;   - when the event has :flush-dom metadata we schedule via
+;;       "reagent.core.after-render"
+;;     which will run event processing after the next Reagent animation frame.
+;;
+
+;; Events can have metadata which says to pause event processing.
+;; event metadata -> "run later" functions
+(def later-fns
+  {:flush-dom (fn [f] (after-render #(next-tick f)))   ;; one tick after the end of the next annimation frame
+   :yield     next-tick})               ;; almost immediately
+
+
+;; Event Queue Abstraction
+(defprotocol IEventQueue
+
+  ;; -- API
+  (push [this event])
+  (add-post-event-callback [this id callack])
+  (remove-post-event-callback [this f])
+  (purge [this])
+
+  ;; -- Implementation via a Finite State Machine
+  (-fsm-trigger [this trigger arg])
+
+  ;; -- Finite State Machine actions
+  (-add-event [this event])
+  (-process-1st-event-in-queue [this])
+  (-run-next-tick [this])
+  (-run-queue [this])
+  (-exception [this ex])
+  (-pause [this later-fn])
+  (-resume [this])
+  (-call-post-event-callbacks [this event]))
+
+
+;; Concrete implementation of IEventQueue
+(deftype EventQueue [#?(:cljs ^:mutable fsm-state               :clj ^:volatile-mutable fsm-state)
+                     #?(:cljs ^:mutable queue                   :clj ^:volatile-mutable queue)
+                     #?(:cljs ^:mutable post-event-callback-fns :clj ^:volatile-mutable post-event-callback-fns)]
+  IEventQueue
+
+  ;; -- API ------------------------------------------------------------------
+
+  (push [this event]         ;; presumably called by dispatch
+    (-fsm-trigger this :add-event event))
+
+  ;; register a callback function which will be called after each event is processed
+  (add-post-event-callback [_ id callback-fn]
+    (if (contains? post-event-callback-fns id)
+      (console :warn "re-frame: overwriting existing post event call back with id:" id))
+    (->> (assoc post-event-callback-fns id callback-fn)
+         (set! post-event-callback-fns)))
+
+  (remove-post-event-callback [_ id]
+    (if-not (contains? post-event-callback-fns id)
+      (console :warn "re-frame: could not remove post event call back with id:" id)
+      (->> (dissoc post-event-callback-fns id)
+           (set! post-event-callback-fns))))
+
+  (purge [_]
+    (set! queue empty-queue))
+
+  ;; -- FSM Implementation ---------------------------------------------------
+
+  (-fsm-trigger
+    [this trigger arg]
+
+    ;; The following "case" implements the Finite State Machine.
+    ;; Given a "trigger", and the existing FSM state, it computes the
+    ;; new FSM state and the transition action (function).
+
+    (trace/with-trace {:op-type ::fsm-trigger}
+      (let [[new-fsm-state action-fn]
+            (case [fsm-state trigger]
+
+              ;; You should read the following "case" as:
+              ;; [current-FSM-state trigger] -> [new-FSM-state action-fn]
+              ;;
+              ;; So, for example, the next line should be interpreted as:
+              ;; if you are in state ":idle" and a trigger ":add-event"
+              ;; happens, then move the FSM to state ":scheduled" and execute
+              ;; that two-part "do" function.
+              [:idle :add-event] [:scheduled #(do (-add-event this arg)
+                                                  (-run-next-tick this))]
+
+              ;; State: :scheduled  (the queue is scheduled to run, soon)
+              [:scheduled :add-event] [:scheduled #(-add-event this arg)]
+              [:scheduled :run-queue] [:running #(-run-queue this)]
+
+              ;; State: :running (the queue is being processed one event after another)
+              [:running :add-event] [:running #(-add-event this arg)]
+              [:running :pause] [:paused #(-pause this arg)]
+              [:running :exception] [:idle #(-exception this arg)]
+              [:running :finish-run] (if (empty? queue)     ;; FSM guard
+                                       [:idle]
+                                       [:scheduled #(-run-next-tick this)])
+
+              ;; State: :paused (:flush-dom metadata on an event has caused a temporary pause in processing)
+              [:paused :add-event] [:paused #(-add-event this arg)]
+              [:paused :resume] [:running #(-resume this)]
+
+              (throw (ex-info (str "re-frame: router state transition not found. " fsm-state " " trigger)
+                              {:fsm-state fsm-state, :trigger trigger})))]
+
+        ;; The "case" above computed both the new FSM state, and the action. Now, make it happen.
+
+        (trace/merge-trace! {:operation [fsm-state trigger]
+                             :tags      {:current-state fsm-state
+                                         :new-state     new-fsm-state}})
+        (set! fsm-state new-fsm-state)
+        (when action-fn (action-fn)))))
+
+  (-add-event
+    [_ event]
+    (set! queue (conj queue event)))
+
+  (-process-1st-event-in-queue
+    [this]
+    (let [event-v (peek queue)]
+      (try
+        (handle event-v)
+        (set! queue (pop queue))
+        (-call-post-event-callbacks this event-v)
+        (catch #?(:cljs :default :clj Exception) ex
+          (-fsm-trigger this :exception ex)))))
+
+  (-run-next-tick
+    [this]
+    (next-tick #(-fsm-trigger this :run-queue nil)))
+
+  ;; Process all the events currently in the queue, but not any new ones.
+  ;; Be aware that events might have metadata which will pause processing.
+  (-run-queue
+    [this]
+    (loop [n (count queue)]
+      (if (zero? n)
+        (-fsm-trigger this :finish-run nil)
+        (if-let [later-fn (some later-fns (-> queue peek meta keys))]  ;; any metadata which causes pausing?
+          (-fsm-trigger this :pause later-fn)
+          (do (-process-1st-event-in-queue this)
+              (recur (dec n)))))))
+
+  (-exception
+    [this ex]
+    (purge this)   ;; purge the queue
+    (throw ex))
+
+  (-pause
+    [this later-fn]
+    (later-fn #(-fsm-trigger this :resume nil)))
+
+  (-call-post-event-callbacks
+    [_ event-v]
+    (doseq [callback (vals post-event-callback-fns)]
+      (callback event-v queue)))
+
+  (-resume
+    [this]
+    (-process-1st-event-in-queue this)  ;; do the event which paused processing
+    (-run-queue this)))                 ;; do the rest of the queued events
+
+
+;; ---------------------------------------------------------------------------
+;; Event Queue
+;; When "dispatch" is called, the event is added into this event queue.  Later,
+;;  the queue will "run" and the event will be "handled" by the registered function.
+;;
+(def event-queue (->EventQueue :idle empty-queue {}))
+
+
+;; ---------------------------------------------------------------------------
+;; Dispatching
+;;
+
+(defn dispatch
+  "Enqueue `event` for processing by event handling machinery.
+
+  `event` is a vector of length >= 1. The 1st element identifies the kind of event.
+
+  Note: the event handler is not run immediately - it is not run
+  synchronously. It will likely be run 'very soon', although it may be
+  added to the end of a FIFO queue which already contain events.
+
+  Usage:
+     (dispatch [:order-pizza {:supreme 2 :meatlovers 1 :veg 1})"
+  [event]
+  (if (nil? event)
+      (throw (ex-info "re-frame: you called \"dispatch\" without an event vector." {}))
+      (push event-queue event))
+  nil)                                           ;; Ensure nil return. See https://github.com/Day8/re-frame/wiki/Beware-Returning-False
+
+
+(defn dispatch-sync
+  "Synchronously (immediately) process `event`. Do not queue.
+
+  Generally, don't use this. Instead use `dispatch`. It is an error
+  to use `dispatch-sync` within an event handler.
+
+  Useful when any delay in processing is a problem:
+     1. the `:on-change` handler of a text field where we are expecting fast typing.
+     2  when initialising your app - see 'main' in todomvc examples
+     3. in a unit test where we don't want the action 'later'
+
+  Usage:
+     (dispatch-sync [:sing :falsetto 634])"
+  [event-v]
+  (handle event-v)
+  (-call-post-event-callbacks event-queue event-v)  ;; slightly ugly hack. Run the registered post event callbacks.
+  nil)                                              ;; Ensure nil return. See https://github.com/Day8/re-frame/wiki/Beware-Returning-False
diff --git a/js/re_frame/router.cljc.cache.json b/js/re_frame/router.cljc.cache.json
new file mode 100644
index 0000000..fec8b7a
--- /dev/null
+++ b/js/re_frame/router.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ ","~$console","~$re-frame.loggers","~$after-render","~$re-frame.interop","~$next-tick","^6","~$empty-queue","^6"],"~:excludes",["~#set",[]],"~:name","~$re-frame.router","~:imports",null,"~:requires",["^ ","~$re-frame.events","^?","^6","^6","^4","^4","~$trace","~$re-frame.trace","^A","^A"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^3","^4","^5","^6","^7","^6","^8","^6","~$handle","^?"],"~:defs",["^ ","~$EventQueue",["^ ","~:num-fields",3,"~:protocols",["^:",["~$re-frame.router/IEventQueue"]],"^;","~$re-frame.router/EventQueue","~:file","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","~:end-column",20,"~:type",true,"~:column",10,"~:line",94,"~:record",false,"~:end-line",94,"~:tag","~$function","~:skip-protocol-flag",null],"~$-run-queue",["^ ","~:protocol-inline",null,"~:meta",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",86,"^N",4,"^Q",86,"^L",14,"~:protocol","^I","~:doc",null,"~:arglists",["~#list",["~$quote",["^[",[["~$this"]]]]]],"^X","^I","^;","~$re-frame.router/-run-queue","~:variadic",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",14,"~:method-params",["^[",[["^11"]]],"~:protocol-impl",null,"~:arglists-meta",["^[",[null,null]],"^N",1,"^O",71,"^Q",86,"~:max-fixed-arity",1,"~:fn-var",true,"^Z",["^[",["^10",["^[",[["^11"]]]]],"^Y",null],"~$remove-post-event-callback",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",76,"^N",4,"^Q",76,"^L",30,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","~$f"]]]]]],"^X","^I","^;","~$re-frame.router/remove-post-event-callback","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",30,"^14",["^[",[["^11","~$f"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",76,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["^11","~$f"]]]]],"^Y",null],"~$dispatch-sync",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",250,"^N",7,"^Q",250,"^L",20,"^Z",["^[",["^10",["^[",[["~$event-v"]]]]],"^Y","Synchronously (immediately) process `event`. Do not queue.\n\n  Generally, don't use this. Instead use `dispatch`. It is an error\n  to use `dispatch-sync` within an event handler.\n\n  Useful when any delay in processing is a problem:\n     1. the `:on-change` handler of a text field where we are expecting fast typing.\n     2  when initialising your app - see 'main' in todomvc examples\n     3. in a unit test where we don't want the action 'later'\n\n  Usage:\n     (dispatch-sync [:sing :falsetto 634])"],"^;","~$re-frame.router/dispatch-sync","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",20,"^14",["^[",[["^1<"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",250,"^Q",250,"^17",1,"^18",true,"^Z",["^[",["^10",["^[",[["^1<"]]]]],"^Y","Synchronously (immediately) process `event`. Do not queue.\n\n  Generally, don't use this. Instead use `dispatch`. It is an error\n  to use `dispatch-sync` within an event handler.\n\n  Useful when any delay in processing is a problem:\n     1. the `:on-change` handler of a text field where we are expecting fast typing.\n     2  when initialising your app - see 'main' in todomvc examples\n     3. in a unit test where we don't want the action 'later'\n\n  Usage:\n     (dispatch-sync [:sing :falsetto 634])"],"~$-add-event",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",83,"^N",4,"^Q",83,"^L",14,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","~$event"]]]]]],"^X","^I","^;","~$re-frame.router/-add-event","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",14,"^14",["^[",[["^11","^1?"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",83,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["^11","^1?"]]]]],"^Y",null],"~$-resume",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",89,"^N",4,"^Q",89,"^L",11,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11"]]]]]],"^X","^I","^;","~$re-frame.router/-resume","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",11,"^14",["^[",[["^11"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",89,"^17",1,"^18",true,"^Z",["^[",["^10",["^[",[["^11"]]]]],"^Y",null],"~$push",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",74,"^N",4,"^Q",74,"^L",8,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","^1?"]]]]]],"^X","^I","^;","~$re-frame.router/push","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",8,"^14",["^[",[["^11","^1?"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",74,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["^11","^1?"]]]]],"^Y",null],"~$-run-next-tick",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",85,"^N",4,"^Q",85,"^L",18,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11"]]]]]],"^X","^I","^;","~$re-frame.router/-run-next-tick","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",18,"^14",["^[",[["^11"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",85,"^17",1,"^18",true,"^Z",["^[",["^10",["^[",[["^11"]]]]],"^Y",null],"~$later-fns",["^ ","^;","~$re-frame.router/later-fns","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",65,"^N",1,"^Q",65,"^L",15,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",65,"^N",6,"^Q",65,"^L",15],"^R","~$cljs.core/IMap"],"~$-fsm-trigger",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",80,"^N",4,"^Q",80,"^L",16,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","~$trigger","~$arg"]]]]]],"^X","^I","^;","~$re-frame.router/-fsm-trigger","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",16,"^14",["^[",[["^11","^1K","^1L"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",80,"^17",3,"^18",true,"^Z",["^[",["^10",["^[",[["^11","^1K","^1L"]]]]],"^Y",null],"~$-pause",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",88,"^N",4,"^Q",88,"^L",10,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","~$later-fn"]]]]]],"^X","^I","^;","~$re-frame.router/-pause","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",10,"^14",["^[",[["^11","^1O"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",88,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["^11","^1O"]]]]],"^Y",null],"~$dispatch",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",232,"^N",7,"^Q",232,"^L",15,"^Z",["^[",["^10",["^[",[["^1?"]]]]],"^Y","Enqueue `event` for processing by event handling machinery.\n\n  `event` is a vector of length >= 1. The 1st element identifies the kind of event.\n\n  Note: the event handler is not run immediately - it is not run\n  synchronously. It will likely be run 'very soon', although it may be\n  added to the end of a FIFO queue which already contain events.\n\n  Usage:\n     (dispatch [:order-pizza {:supreme 2 :meatlovers 1 :veg 1})"],"^;","~$re-frame.router/dispatch","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",15,"^14",["^[",[["^1?"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",232,"^Q",232,"^17",1,"^18",true,"^Z",["^[",["^10",["^[",[["^1?"]]]]],"^Y","Enqueue `event` for processing by event handling machinery.\n\n  `event` is a vector of length >= 1. The 1st element identifies the kind of event.\n\n  Note: the event handler is not run immediately - it is not run\n  synchronously. It will likely be run 'very soon', although it may be\n  added to the end of a FIFO queue which already contain events.\n\n  Usage:\n     (dispatch [:order-pizza {:supreme 2 :meatlovers 1 :veg 1})"],"~$add-post-event-callback",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",75,"^N",4,"^Q",75,"^L",27,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","~$id","~$callack"]]]]]],"^X","^I","^;","~$re-frame.router/add-post-event-callback","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",27,"^14",["^[",[["^11","^1T","^1U"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",75,"^17",3,"^18",true,"^Z",["^[",["^10",["^[",[["^11","^1T","^1U"]]]]],"^Y",null],"~$-process-1st-event-in-queue",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",84,"^N",4,"^Q",84,"^L",31,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11"]]]]]],"^X","^I","^;","~$re-frame.router/-process-1st-event-in-queue","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",31,"^14",["^[",[["^11"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",84,"^17",1,"^18",true,"^Z",["^[",["^10",["^[",[["^11"]]]]],"^Y",null],"~$-call-post-event-callbacks",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",90,"^N",4,"^Q",90,"^L",30,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","^1?"]]]]]],"^X","^I","^;","~$re-frame.router/-call-post-event-callbacks","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",30,"^14",["^[",[["^11","^1?"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",90,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["^11","^1?"]]]]],"^Y",null],"~$->EventQueue",["^ ","^V",null,"^W",["^ ","^H",["^:",["^I"]],"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",20,"^N",10,"~:factory","~:positional","^O",94,"^Q",94,"^Z",["^[",["^10",["^[",[["~$fsm-state","~$queue","~$post-event-callback-fns"]]]]],"^T",null,"^Y","Positional factory function for re-frame.router/EventQueue."],"^H",["^:",["^I"]],"^;","~$re-frame.router/->EventQueue","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",20,"^14",["^[",[["^22","^23","^24"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^20","^21","^O",94,"^Q",94,"^17",3,"^18",true,"^Z",["^[",["^10",["^[",[["^22","^23","^24"]]]]],"^T",null,"^Y","Positional factory function for re-frame.router/EventQueue."],"~$purge",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",77,"^N",4,"^Q",77,"^L",9,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11"]]]]]],"^X","^I","^;","~$re-frame.router/purge","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",9,"^14",["^[",[["^11"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",77,"^17",1,"^18",true,"^Z",["^[",["^10",["^[",[["^11"]]]]],"^Y",null],"~$event-queue",["^ ","^;","~$re-frame.router/event-queue","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",225,"^N",1,"^Q",225,"^L",17,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",225,"^N",6,"^Q",225,"^L",17],"^R","~$any"],"~$IEventQueue",["^ ","^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",71,"^N",14,"^Q",71,"^L",25,"^Y",null,"~:protocol-symbol",true,"~:jsdoc",["^[",["@interface"]],"~:protocol-info",["^ ","~:methods",["^ ","^U",[["^11"]],"^19",[["^11","~$f"]],"^1>",[["^11","^1?"]],"^1A",[["^11"]],"^1C",[["^11","^1?"]],"^1E",[["^11"]],"^1J",[["^11","^1K","^1L"]],"^1N",[["^11","^1O"]],"^1S",[["^11","^1T","^1U"]],"^1W",[["^11"]],"^1Y",[["^11","^1?"]],"^26",[["^11"]],"~$-exception",[["^11","~$ex"]]]]],"^2<",true,"^;","^I","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",25,"^N",1,"^O",71,"^2>",["^ ","^2?",["^ ","^U",[["^11"]],"^19",[["^11","~$f"]],"^1>",[["^11","^1?"]],"^1A",[["^11"]],"^1C",[["^11","^1?"]],"^1E",[["^11"]],"^1J",[["^11","^1K","^1L"]],"^1N",[["^11","^1O"]],"^1S",[["^11","^1T","^1U"]],"^1W",[["^11"]],"^1Y",[["^11","^1?"]],"^26",[["^11"]],"^2@",[["^11","^2A"]]]],"~:info",null,"^Q",71,"^R","^2:","~:impls",["^:",["^J"]],"^Y",null,"^2=",["^[",["@interface"]]],"^2@",["^ ","^V",null,"^W",["^ ","^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^O",87,"^N",4,"^Q",87,"^L",14,"^X","^I","^Y",null,"^Z",["^[",["^10",["^[",[["^11","^2A"]]]]]],"^X","^I","^;","~$re-frame.router/-exception","^13",false,"^K","/home/julien/.cljs/.aot_cache/1.10.329/118BEDE/re_frame/router.cljc","^L",14,"^14",["^[",[["^11","^2A"]]],"^15",null,"^16",["^[",[null,null]],"^N",1,"^O",71,"^Q",87,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["^11","^2A"]]]]],"^Y",null]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^@","^A","^A","^A"],"~:cljs.analyzer/constants",["^ ","~:seen",["^:",["~:add-event","~:yield","~:tags","^24","~:paused","~:idle","~:current-state","~:new-state","~:fsm-state","~:else","~:warn","~:re-frame.router/fsm-trigger","~:operation","~:start","^22","~:duration","^23","~:running","~:flush-dom","~:run-queue","~:scheduled","~:pause","~:exception","~:mutable","~:end","~:trigger","~:resume","~:op-type","~:finish-run"]],"~:order",["^2X","^2J","^36","^2[","^2R","^2I","^2Y","^35","^2S","^2U","^2V","^32","^2M","^2Z","^2W","^2L","^30","^34","^2Q","^2P","^33","^2K","^2T","^2N","^2O","^22","^31","^23","^24"]],"^Y",null]
\ No newline at end of file
diff --git a/js/re_frame/router.js b/js/re_frame/router.js
new file mode 100644
index 0000000..4bd1e7b
--- /dev/null
+++ b/js/re_frame/router.js
@@ -0,0 +1,731 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.router');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.events');
+goog.require('re_frame.interop');
+goog.require('re_frame.loggers');
+goog.require('re_frame.trace');
+re_frame.router.later_fns = new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$flush_DASH_dom,(function (f){
+var G__4570 = (function (){
+return (re_frame.interop.next_tick.cljs$core$IFn$_invoke$arity$1 ? re_frame.interop.next_tick.cljs$core$IFn$_invoke$arity$1(f) : re_frame.interop.next_tick.call(null,f));
+});
+return (re_frame.interop.after_render.cljs$core$IFn$_invoke$arity$1 ? re_frame.interop.after_render.cljs$core$IFn$_invoke$arity$1(G__4570) : re_frame.interop.after_render.call(null,G__4570));
+}),cljs.core.cst$kw$yield,re_frame.interop.next_tick], null);
+
+/**
+ * @interface
+ */
+re_frame.router.IEventQueue = function(){};
+
+re_frame.router.push = (function re_frame$router$push(this$,event){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$push$arity$2 == null))))){
+return this$.re_frame$router$IEventQueue$push$arity$2(this$,event);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router.push[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,event) : m__4231__auto__.call(null,this$,event));
+} else {
+var m__4231__auto____$1 = (re_frame.router.push["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,event) : m__4231__auto____$1.call(null,this$,event));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.push",this$);
+}
+}
+}
+});
+
+re_frame.router.add_post_event_callback = (function re_frame$router$add_post_event_callback(this$,id,callack){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$add_post_event_callback$arity$3 == null))))){
+return this$.re_frame$router$IEventQueue$add_post_event_callback$arity$3(this$,id,callack);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router.add_post_event_callback[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(this$,id,callack) : m__4231__auto__.call(null,this$,id,callack));
+} else {
+var m__4231__auto____$1 = (re_frame.router.add_post_event_callback["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,id,callack) : m__4231__auto____$1.call(null,this$,id,callack));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.add-post-event-callback",this$);
+}
+}
+}
+});
+
+re_frame.router.remove_post_event_callback = (function re_frame$router$remove_post_event_callback(this$,f){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$remove_post_event_callback$arity$2 == null))))){
+return this$.re_frame$router$IEventQueue$remove_post_event_callback$arity$2(this$,f);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router.remove_post_event_callback[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,f) : m__4231__auto__.call(null,this$,f));
+} else {
+var m__4231__auto____$1 = (re_frame.router.remove_post_event_callback["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,f) : m__4231__auto____$1.call(null,this$,f));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.remove-post-event-callback",this$);
+}
+}
+}
+});
+
+re_frame.router.purge = (function re_frame$router$purge(this$){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$purge$arity$1 == null))))){
+return this$.re_frame$router$IEventQueue$purge$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router.purge[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (re_frame.router.purge["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.purge",this$);
+}
+}
+}
+});
+
+re_frame.router._fsm_trigger = (function re_frame$router$_fsm_trigger(this$,trigger,arg){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_fsm_trigger$arity$3 == null))))){
+return this$.re_frame$router$IEventQueue$_fsm_trigger$arity$3(this$,trigger,arg);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._fsm_trigger[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$3(this$,trigger,arg) : m__4231__auto__.call(null,this$,trigger,arg));
+} else {
+var m__4231__auto____$1 = (re_frame.router._fsm_trigger["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,trigger,arg) : m__4231__auto____$1.call(null,this$,trigger,arg));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-fsm-trigger",this$);
+}
+}
+}
+});
+
+re_frame.router._add_event = (function re_frame$router$_add_event(this$,event){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_add_event$arity$2 == null))))){
+return this$.re_frame$router$IEventQueue$_add_event$arity$2(this$,event);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._add_event[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,event) : m__4231__auto__.call(null,this$,event));
+} else {
+var m__4231__auto____$1 = (re_frame.router._add_event["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,event) : m__4231__auto____$1.call(null,this$,event));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-add-event",this$);
+}
+}
+}
+});
+
+re_frame.router._process_1st_event_in_queue = (function re_frame$router$_process_1st_event_in_queue(this$){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_process_1st_event_in_queue$arity$1 == null))))){
+return this$.re_frame$router$IEventQueue$_process_1st_event_in_queue$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._process_1st_event_in_queue[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (re_frame.router._process_1st_event_in_queue["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-process-1st-event-in-queue",this$);
+}
+}
+}
+});
+
+re_frame.router._run_next_tick = (function re_frame$router$_run_next_tick(this$){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_run_next_tick$arity$1 == null))))){
+return this$.re_frame$router$IEventQueue$_run_next_tick$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._run_next_tick[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (re_frame.router._run_next_tick["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-run-next-tick",this$);
+}
+}
+}
+});
+
+re_frame.router._run_queue = (function re_frame$router$_run_queue(this$){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_run_queue$arity$1 == null))))){
+return this$.re_frame$router$IEventQueue$_run_queue$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._run_queue[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (re_frame.router._run_queue["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-run-queue",this$);
+}
+}
+}
+});
+
+re_frame.router._exception = (function re_frame$router$_exception(this$,ex){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_exception$arity$2 == null))))){
+return this$.re_frame$router$IEventQueue$_exception$arity$2(this$,ex);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._exception[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,ex) : m__4231__auto__.call(null,this$,ex));
+} else {
+var m__4231__auto____$1 = (re_frame.router._exception["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,ex) : m__4231__auto____$1.call(null,this$,ex));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-exception",this$);
+}
+}
+}
+});
+
+re_frame.router._pause = (function re_frame$router$_pause(this$,later_fn){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_pause$arity$2 == null))))){
+return this$.re_frame$router$IEventQueue$_pause$arity$2(this$,later_fn);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._pause[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,later_fn) : m__4231__auto__.call(null,this$,later_fn));
+} else {
+var m__4231__auto____$1 = (re_frame.router._pause["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,later_fn) : m__4231__auto____$1.call(null,this$,later_fn));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-pause",this$);
+}
+}
+}
+});
+
+re_frame.router._resume = (function re_frame$router$_resume(this$){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_resume$arity$1 == null))))){
+return this$.re_frame$router$IEventQueue$_resume$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._resume[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (re_frame.router._resume["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-resume",this$);
+}
+}
+}
+});
+
+re_frame.router._call_post_event_callbacks = (function re_frame$router$_call_post_event_callbacks(this$,event){
+if(((!((this$ == null))) && (!((this$.re_frame$router$IEventQueue$_call_post_event_callbacks$arity$2 == null))))){
+return this$.re_frame$router$IEventQueue$_call_post_event_callbacks$arity$2(this$,event);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (re_frame.router._call_post_event_callbacks[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,event) : m__4231__auto__.call(null,this$,event));
+} else {
+var m__4231__auto____$1 = (re_frame.router._call_post_event_callbacks["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,event) : m__4231__auto____$1.call(null,this$,event));
+} else {
+throw cljs.core.missing_protocol("IEventQueue.-call-post-event-callbacks",this$);
+}
+}
+}
+});
+
+
+/**
+* @constructor
+ * @implements {re_frame.router.IEventQueue}
+*/
+re_frame.router.EventQueue = (function (fsm_state,queue,post_event_callback_fns){
+this.fsm_state = fsm_state;
+this.queue = queue;
+this.post_event_callback_fns = post_event_callback_fns;
+});
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$ = cljs.core.PROTOCOL_SENTINEL;
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_run_queue$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var n = cljs.core.count(self__.queue);
+while(true){
+if((n === (0))){
+return this$__$1.re_frame$router$IEventQueue$_fsm_trigger$arity$3(null,cljs.core.cst$kw$finish_DASH_run,null);
+} else {
+var temp__5455__auto__ = cljs.core.some(re_frame.router.later_fns,cljs.core.keys(cljs.core.meta(cljs.core.peek(self__.queue))));
+if(cljs.core.truth_(temp__5455__auto__)){
+var later_fn = temp__5455__auto__;
+return this$__$1.re_frame$router$IEventQueue$_fsm_trigger$arity$3(null,cljs.core.cst$kw$pause,later_fn);
+} else {
+this$__$1.re_frame$router$IEventQueue$_process_1st_event_in_queue$arity$1(null);
+
+var G__4587 = (n - (1));
+n = G__4587;
+continue;
+}
+}
+break;
+}
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$remove_post_event_callback$arity$2 = (function (_,id){
+var self__ = this;
+var ___$1 = this;
+if(!(cljs.core.contains_QMARK_(self__.post_event_callback_fns,id))){
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: could not remove post event call back with id:",id], 0));
+} else {
+return self__.post_event_callback_fns = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(self__.post_event_callback_fns,id);
+}
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_add_event$arity$2 = (function (_,event){
+var self__ = this;
+var ___$1 = this;
+return self__.queue = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(self__.queue,event);
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_resume$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+this$__$1.re_frame$router$IEventQueue$_process_1st_event_in_queue$arity$1(null);
+
+return this$__$1.re_frame$router$IEventQueue$_run_queue$arity$1(null);
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$push$arity$2 = (function (this$,event){
+var self__ = this;
+var this$__$1 = this;
+return this$__$1.re_frame$router$IEventQueue$_fsm_trigger$arity$3(null,cljs.core.cst$kw$add_DASH_event,event);
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_run_next_tick$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var G__4571 = ((function (this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_fsm_trigger$arity$3(null,cljs.core.cst$kw$run_DASH_queue,null);
+});})(this$__$1))
+;
+return (re_frame.interop.next_tick.cljs$core$IFn$_invoke$arity$1 ? re_frame.interop.next_tick.cljs$core$IFn$_invoke$arity$1(G__4571) : re_frame.interop.next_tick.call(null,G__4571));
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_fsm_trigger$arity$3 = (function (this$,trigger,arg){
+var self__ = this;
+var this$__$1 = this;
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_4572 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$re_DASH_frame$router_SLASH_fsm_DASH_trigger], null));
+
+try{try{var vec__4573 = (function (){var G__4576 = new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.fsm_state,trigger], null);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$idle,cljs.core.cst$kw$add_DASH_event], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+
+return this$__$1.re_frame$router$IEventQueue$_run_next_tick$arity$1(null);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,cljs.core.cst$kw$add_DASH_event], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,cljs.core.cst$kw$run_DASH_queue], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_run_queue$arity$1(null);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$add_DASH_event], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$pause], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_pause$arity$2(null,arg);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$exception], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$idle,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_exception$arity$2(null,arg);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$finish_DASH_run], null),G__4576)){
+if(cljs.core.empty_QMARK_(self__.queue)){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$idle], null);
+} else {
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_run_next_tick$arity$1(null);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+}
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,cljs.core.cst$kw$add_DASH_event], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,cljs.core.cst$kw$resume], null),G__4576)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,((function (G__4576,_STAR_current_trace_STAR_4572,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_resume$arity$1(null);
+});})(G__4576,_STAR_current_trace_STAR_4572,this$__$1))
+], null);
+} else {
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2(["re-frame: router state transition not found. ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.fsm_state)," ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(trigger)].join(''),new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$fsm_DASH_state,self__.fsm_state,cljs.core.cst$kw$trigger,trigger], null));
+
+}
+}
+}
+}
+}
+}
+}
+}
+}
+})();
+var new_fsm_state = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4573,(0),null);
+var action_fn = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4573,(1),null);
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___4588 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$operation,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.fsm_state,trigger], null),cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$current_DASH_state,self__.fsm_state,cljs.core.cst$kw$new_DASH_state,new_fsm_state], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$operation,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.fsm_state,trigger], null),cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$current_DASH_state,self__.fsm_state,cljs.core.cst$kw$new_DASH_state,new_fsm_state], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___4588;
+
+} else {
+}
+
+self__.fsm_state = new_fsm_state;
+
+if(cljs.core.truth_(action_fn)){
+return (action_fn.cljs$core$IFn$_invoke$arity$0 ? action_fn.cljs$core$IFn$_invoke$arity$0() : action_fn.call(null));
+} else {
+return null;
+}
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___4589 = re_frame.interop.now();
+var duration__4440__auto___4590 = (end__4439__auto___4589 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___4590,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___4589);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_4572;
+}} else {
+var vec__4577 = (function (){var G__4580 = new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.fsm_state,trigger], null);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$idle,cljs.core.cst$kw$add_DASH_event], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,((function (G__4580,this$__$1){
+return (function (){
+this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+
+return this$__$1.re_frame$router$IEventQueue$_run_next_tick$arity$1(null);
+});})(G__4580,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,cljs.core.cst$kw$add_DASH_event], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+});})(G__4580,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,cljs.core.cst$kw$run_DASH_queue], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_run_queue$arity$1(null);
+});})(G__4580,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$add_DASH_event], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+});})(G__4580,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$pause], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_pause$arity$2(null,arg);
+});})(G__4580,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$exception], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$idle,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_exception$arity$2(null,arg);
+});})(G__4580,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,cljs.core.cst$kw$finish_DASH_run], null),G__4580)){
+if(cljs.core.empty_QMARK_(self__.queue)){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$idle], null);
+} else {
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$scheduled,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_run_next_tick$arity$1(null);
+});})(G__4580,this$__$1))
+], null);
+}
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,cljs.core.cst$kw$add_DASH_event], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_add_event$arity$2(null,arg);
+});})(G__4580,this$__$1))
+], null);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$paused,cljs.core.cst$kw$resume], null),G__4580)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$running,((function (G__4580,this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_resume$arity$1(null);
+});})(G__4580,this$__$1))
+], null);
+} else {
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2(["re-frame: router state transition not found. ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.fsm_state)," ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(trigger)].join(''),new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$fsm_DASH_state,self__.fsm_state,cljs.core.cst$kw$trigger,trigger], null));
+
+}
+}
+}
+}
+}
+}
+}
+}
+}
+})();
+var new_fsm_state = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4577,(0),null);
+var action_fn = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4577,(1),null);
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___4591 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$operation,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.fsm_state,trigger], null),cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$current_DASH_state,self__.fsm_state,cljs.core.cst$kw$new_DASH_state,new_fsm_state], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$operation,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.fsm_state,trigger], null),cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$current_DASH_state,self__.fsm_state,cljs.core.cst$kw$new_DASH_state,new_fsm_state], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___4591;
+
+} else {
+}
+
+self__.fsm_state = new_fsm_state;
+
+if(cljs.core.truth_(action_fn)){
+return (action_fn.cljs$core$IFn$_invoke$arity$0 ? action_fn.cljs$core$IFn$_invoke$arity$0() : action_fn.call(null));
+} else {
+return null;
+}
+}
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_pause$arity$2 = (function (this$,later_fn){
+var self__ = this;
+var this$__$1 = this;
+var G__4581 = ((function (this$__$1){
+return (function (){
+return this$__$1.re_frame$router$IEventQueue$_fsm_trigger$arity$3(null,cljs.core.cst$kw$resume,null);
+});})(this$__$1))
+;
+return (later_fn.cljs$core$IFn$_invoke$arity$1 ? later_fn.cljs$core$IFn$_invoke$arity$1(G__4581) : later_fn.call(null,G__4581));
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$add_post_event_callback$arity$3 = (function (_,id,callback_fn){
+var self__ = this;
+var ___$1 = this;
+if(cljs.core.contains_QMARK_(self__.post_event_callback_fns,id)){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: overwriting existing post event call back with id:",id], 0));
+} else {
+}
+
+return self__.post_event_callback_fns = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.post_event_callback_fns,id,callback_fn);
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_process_1st_event_in_queue$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var event_v = cljs.core.peek(self__.queue);
+try{re_frame.events.handle(event_v);
+
+self__.queue = cljs.core.pop(self__.queue);
+
+return this$__$1.re_frame$router$IEventQueue$_call_post_event_callbacks$arity$2(null,event_v);
+}catch (e4582){var ex = e4582;
+return this$__$1.re_frame$router$IEventQueue$_fsm_trigger$arity$3(null,cljs.core.cst$kw$exception,ex);
+}});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_call_post_event_callbacks$arity$2 = (function (_,event_v){
+var self__ = this;
+var ___$1 = this;
+var seq__4583 = cljs.core.seq(cljs.core.vals(self__.post_event_callback_fns));
+var chunk__4584 = null;
+var count__4585 = (0);
+var i__4586 = (0);
+while(true){
+if((i__4586 < count__4585)){
+var callback = chunk__4584.cljs$core$IIndexed$_nth$arity$2(null,i__4586);
+(callback.cljs$core$IFn$_invoke$arity$2 ? callback.cljs$core$IFn$_invoke$arity$2(event_v,self__.queue) : callback.call(null,event_v,self__.queue));
+
+
+var G__4592 = seq__4583;
+var G__4593 = chunk__4584;
+var G__4594 = count__4585;
+var G__4595 = (i__4586 + (1));
+seq__4583 = G__4592;
+chunk__4584 = G__4593;
+count__4585 = G__4594;
+i__4586 = G__4595;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__4583);
+if(temp__5457__auto__){
+var seq__4583__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__4583__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__4583__$1);
+var G__4596 = cljs.core.chunk_rest(seq__4583__$1);
+var G__4597 = c__4338__auto__;
+var G__4598 = cljs.core.count(c__4338__auto__);
+var G__4599 = (0);
+seq__4583 = G__4596;
+chunk__4584 = G__4597;
+count__4585 = G__4598;
+i__4586 = G__4599;
+continue;
+} else {
+var callback = cljs.core.first(seq__4583__$1);
+(callback.cljs$core$IFn$_invoke$arity$2 ? callback.cljs$core$IFn$_invoke$arity$2(event_v,self__.queue) : callback.call(null,event_v,self__.queue));
+
+
+var G__4600 = cljs.core.next(seq__4583__$1);
+var G__4601 = null;
+var G__4602 = (0);
+var G__4603 = (0);
+seq__4583 = G__4600;
+chunk__4584 = G__4601;
+count__4585 = G__4602;
+i__4586 = G__4603;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$purge$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.queue = re_frame.interop.empty_queue;
+});
+
+re_frame.router.EventQueue.prototype.re_frame$router$IEventQueue$_exception$arity$2 = (function (this$,ex){
+var self__ = this;
+var this$__$1 = this;
+this$__$1.re_frame$router$IEventQueue$purge$arity$1(null);
+
+throw ex;
+});
+
+re_frame.router.EventQueue.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$fsm_DASH_state,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$queue,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$post_DASH_event_DASH_callback_DASH_fns,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+re_frame.router.EventQueue.cljs$lang$type = true;
+
+re_frame.router.EventQueue.cljs$lang$ctorStr = "re-frame.router/EventQueue";
+
+re_frame.router.EventQueue.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"re-frame.router/EventQueue");
+});
+
+/**
+ * Positional factory function for re-frame.router/EventQueue.
+ */
+re_frame.router.__GT_EventQueue = (function re_frame$router$__GT_EventQueue(fsm_state,queue,post_event_callback_fns){
+return (new re_frame.router.EventQueue(fsm_state,queue,post_event_callback_fns));
+});
+
+re_frame.router.event_queue = re_frame.router.__GT_EventQueue(cljs.core.cst$kw$idle,re_frame.interop.empty_queue,cljs.core.PersistentArrayMap.EMPTY);
+/**
+ * Enqueue `event` for processing by event handling machinery.
+ * 
+ *   `event` is a vector of length >= 1. The 1st element identifies the kind of event.
+ * 
+ *   Note: the event handler is not run immediately - it is not run
+ *   synchronously. It will likely be run 'very soon', although it may be
+ *   added to the end of a FIFO queue which already contain events.
+ * 
+ *   Usage:
+ *   (dispatch [:order-pizza {:supreme 2 :meatlovers 1 :veg 1})
+ */
+re_frame.router.dispatch = (function re_frame$router$dispatch(event){
+if((event == null)){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("re-frame: you called \"dispatch\" without an event vector.",cljs.core.PersistentArrayMap.EMPTY);
+} else {
+re_frame.router.push(re_frame.router.event_queue,event);
+}
+
+return null;
+});
+/**
+ * Synchronously (immediately) process `event`. Do not queue.
+ * 
+ *   Generally, don't use this. Instead use `dispatch`. It is an error
+ *   to use `dispatch-sync` within an event handler.
+ * 
+ *   Useful when any delay in processing is a problem:
+ *   1. the `:on-change` handler of a text field where we are expecting fast typing.
+ *   2  when initialising your app - see 'main' in todomvc examples
+ *   3. in a unit test where we don't want the action 'later'
+ * 
+ *   Usage:
+ *   (dispatch-sync [:sing :falsetto 634])
+ */
+re_frame.router.dispatch_sync = (function re_frame$router$dispatch_sync(event_v){
+re_frame.events.handle(event_v);
+
+re_frame.router._call_post_event_callbacks(re_frame.router.event_queue,event_v);
+
+return null;
+});
diff --git a/js/re_frame/std_interceptors.cljc b/js/re_frame/std_interceptors.cljc
new file mode 100644
index 0000000..d735f9f
--- /dev/null
+++ b/js/re_frame/std_interceptors.cljc
@@ -0,0 +1,358 @@
+(ns re-frame.std-interceptors
+  "contains re-frame supplied, standard interceptors"
+  (:require
+    [re-frame.interceptor :refer [->interceptor get-effect get-coeffect assoc-coeffect assoc-effect]]
+    [re-frame.loggers :refer [console]]
+    [re-frame.registrar :as registrar]
+    [re-frame.db :refer [app-db]]
+    [clojure.data :as data]
+    [re-frame.cofx :as cofx]
+    [re-frame.utils :as utils]
+    [re-frame.trace :as trace :include-macros true]))
+
+
+(def debug
+  "An interceptor which logs/instruments an event handler's actions to
+  `js/console.debug`. See examples/todomvc/src/events.cljs for use.
+
+  Output includes:
+  1. the event vector
+  2. a `clojure.data/diff` of db, before vs after, which shows
+     the changes caused by the event handler.  You will absolutely have
+     to understand https://clojuredocs.org/clojure.data/diff to
+     understand the output.
+
+  You'd typically include this interceptor after (to the right of) any
+  path interceptor.
+
+  Warning:  calling clojure.data/diff on large, complex data structures
+  can be slow. So, you won't want this interceptor present in production
+  code. So condition it out like this :
+
+    (re-frame.core/reg-event-db
+       :evt-id
+       [(when ^boolean goog.DEBUG re-frame.core/debug)]  ;; <-- conditional
+       (fn [db v]
+         ...))
+
+  To make this code fragment work, you'll also have to set goog.DEBUG to
+  false in your production builds - look in `project.clj` of /examples/todomvc.
+  "
+  (->interceptor
+    :id     :debug
+    :before (fn debug-before
+              [context]
+              (console :log "Handling re-frame event:" (get-coeffect context :event))
+              context)
+    :after  (fn debug-after
+              [context]
+              (let [event   (get-coeffect context :event)
+                    orig-db (get-coeffect context :db)
+                    new-db  (get-effect   context :db ::not-found)]
+                (if (= new-db ::not-found)
+                  (console :log "No :db changes caused by:" event)
+                  (let [[only-before only-after] (data/diff orig-db new-db)
+                        db-changed?    (or (some? only-before) (some? only-after))]
+                    (if db-changed?
+                      (do (console :group "db clojure.data/diff for:" event)
+                          (console :log "only before:" only-before)
+                          (console :log "only after :" only-after)
+                          (console :groupEnd))
+                      (console :log "no app-db changes caused by:" event))))
+                context))))
+
+
+(def trim-v
+  "An interceptor which removes the first element of the event vector,
+  allowing you to write more aesthetically pleasing event handlers. No
+  leading underscore on the event-v!
+  Your event handlers will look like this:
+
+      (defn my-handler
+        [db [x y z]]    ;; <-- instead of [_ x y z]
+        ....)"
+  (->interceptor
+    :id      :trim-v
+    :before  (fn trimv-before
+               [context]
+               (-> context
+                   (update-in [:coeffects :event] subvec 1)
+                   (assoc-in [:coeffects ::untrimmed-event] (get-coeffect context :event))))
+    :after   (fn trimv-after
+               [context]
+               (-> context
+                   (utils/dissoc-in [:coeffects ::untrimmed-event])
+                   (assoc-in [:coeffects :event] (get-coeffect context ::untrimmed-event))))))
+
+
+;; -- Interceptor Factories - PART 1 ---------------------------------------------------------------
+;;
+;; These 3 factories wrap the 3 kinds of event handlers.
+;;
+
+(defn db-handler->interceptor
+  "Returns an interceptor which wraps the kind of event handler given to `reg-event-db`.
+
+  These handlers take two arguments;  `db` and `event`, and they return `db`.
+
+  (fn [db event]
+     ....)
+
+  So, the interceptor wraps the given handler:
+     1. extracts two `:coeffects` keys: db and event
+     2. calls handler-fn
+     3. stores the db result back into context's `:effects`"
+  [handler-fn]
+  (->interceptor
+    :id     :db-handler
+    :before (fn db-handler-before
+              [context]
+              (let [new-context
+                    (trace/with-trace
+                      {:op-type   :event/handler
+                       :operation (get-in context [:coeffects :event])}
+                      (let [{:keys [db event]} (:coeffects context)]
+                        (->> (handler-fn db event)
+                             (assoc-effect context :db))))]
+                ;; We merge these tags outside of the :event/handler trace because we want them to be assigned to the parent
+                ;; wrapping trace.
+                (trace/merge-trace!
+                  {:tags {:effects   (:effects new-context)
+                          :coeffects (:coeffects context)}})
+                new-context))))
+
+
+(defn fx-handler->interceptor
+  "Returns an interceptor which wraps the kind of event handler given to `reg-event-fx`.
+
+  These handlers take two arguments;  `coeffects` and `event`, and they return `effects`.
+
+  (fn [coeffects event]
+     {:db ...
+      :dispatch ...})
+
+   Wrap handler in an interceptor so it can be added to (the RHS) of a chain:
+     1. extracts `:coeffects`
+     2. call handler-fn giving coeffects
+     3. stores the result back into the `:effects`"
+  [handler-fn]
+(->interceptor
+  :id     :fx-handler
+  :before (fn fx-handler-before
+            [context]
+            (let [{:keys [event] :as coeffects} (:coeffects context)
+                  new-context
+                  (trace/with-trace
+                    {:op-type   :event/handler
+                     :operation (get-in context [:coeffects :event])}
+                    (->> (handler-fn coeffects event)
+                         (assoc context :effects)))]
+              (trace/merge-trace!
+                {:tags {:effects   (:effects new-context)
+                        :coeffects (:coeffects context)}})
+              new-context))))
+
+
+(defn ctx-handler->interceptor
+  "Returns an interceptor which wraps the kind of event handler given to `reg-event-ctx`.
+  These advanced handlers take one argument: `context` and they return a modified `context`.
+  Example:
+     (fn [context]
+        (enqueue context [more interceptors]))"
+  [handler-fn]
+  (->interceptor
+    :id     :ctx-handler
+    :before (fn ctx-handler-before
+              [context]
+              (let [new-context
+                    (trace/with-trace
+                      {:op-type   :event/handler
+                       :operation (get-in context [:coeffects :event])}
+                      (handler-fn context))]
+                (trace/merge-trace!
+                  {:tags {:effects   (:effects new-context)
+                          :coeffects (:coeffects context)}})
+                new-context))))
+
+
+;; -- Interceptors Factories -  PART 2 ------------------------------------------------------------
+
+
+(defn path
+  "returns an interceptor whose `:before` substitutes the coeffects `:db` with
+  a sub-path of `:db`. Within `:after` it grafts the handler's return value
+  back into db, at the right path.
+
+  So, its overall action is to make the event handler behave like the function
+  you might give to clojure's `update-in`.
+
+  Examples:
+    (path :some :path)
+    (path [:some :path])
+    (path [:some :path] :to :here)
+    (path [:some :path] [:to] :here)
+
+  Example Use:
+
+    (reg-event-db
+      :event-id
+      (path [:a :b])  ;; used here, in interceptor chain
+      (fn [b v]       ;; 1st arg is now not db. Is the value from path [:a :b] within db
+        ... new-b))   ;; returns a new value for that path (not the entire db)
+
+  Notes:
+    1. `path` may appear more than once in an interceptor chain. Progressive narrowing.
+    2. if `:effects` contains no `:db` effect, can't graft a value back in.
+  "
+  [& args]
+  (let [path (flatten args)
+        db-store-key :re-frame-path/db-store]    ;; this is where, within `context`, we store the original dbs
+    (when (empty? path)
+      (console :error "re-frame: \"path\" interceptor given no params"))
+    (->interceptor
+      :id      :path
+      :before  (fn
+                 [context]
+                 (let [original-db (get-coeffect context :db)]
+                   (-> context
+                       (update db-store-key conj original-db)
+                       (assoc-coeffect :db (get-in original-db path)))))
+      :after   (fn [context]
+                 (let [db-store     (db-store-key context)
+                       original-db  (peek db-store)
+                       new-db-store (pop db-store)
+                       context'     (-> (assoc context db-store-key new-db-store)
+                                        (assoc-coeffect :db original-db))     ;; put the original db back so that things like debug work later on
+                       db           (get-effect context :db ::not-found)]
+                   (if (= db ::not-found)
+                     context'
+                     (->> (assoc-in original-db path db)
+                          (assoc-effect context' :db))))))))
+
+
+
+
+(defn enrich
+  "Interceptor factory which runs the given function `f` in the `after handler`
+  position.  `f` is called with two arguments: `db` and `v`, and is expected to
+  return a modified `db`.
+
+  Unlike the `after` interceptor which is only about side effects, `enrich`
+  expects `f` to process and alter the given `db` coeffect in some useful way,
+  contributing to the derived data, flowing vibe.
+
+  Example Use:
+  ------------
+
+  Imagine that todomvc needed to do duplicate detection - if any two todos had
+  the same text, then highlight their background, and report them via a warning
+  at the bottom of the panel.
+
+  Almost any user action (edit text, add new todo, remove a todo) requires a
+  complete reassessment of duplication errors and warnings. Eg: that edit
+  just made might have introduced a new duplicate, or removed one. Same with
+  any todo removal. So we need to re-calculate warnings after any CRUD events
+  associated with the todos list.
+
+  Unless we are careful, we might end up coding subtly different checks
+  for each kind of CRUD operation.  The duplicates check made after
+  'delete todo' event might be subtly different to that done after an
+  editing operation. Nice and efficient, but fiddly. A bug generator
+  approach.
+
+  So, instead, we create an `f` which recalculates ALL warnings from scratch
+  every time there is ANY change. It will inspect all the todos, and
+  reset ALL FLAGS every time (overwriting what was there previously)
+  and fully recalculate the list of duplicates (displayed at the bottom?).
+
+  https://twitter.com/nathanmarz/status/879722740776939520
+
+  By applying `f` in an `:enrich` interceptor, after every CRUD event,
+  we keep the handlers simple and yet we ensure this important step
+  (of getting warnings right) is not missed on any change.
+
+  We can test `f` easily - it is a pure function - independently of
+  any CRUD operation.
+
+  This brings huge simplicity at the expense of some re-computation
+  each time. This may be a very satisfactory trade-off in many cases."
+  [f]
+  (->interceptor
+    :id    :enrich
+    :after (fn enrich-after
+             [context]
+             (let [event (get-coeffect context :event)
+                   db    (or (get-effect context :db)
+                             ;; If no db effect is returned, we provide the original coeffect.
+                             (get-coeffect context :db))]
+               (->> (f db event)
+                    (assoc-effect context :db))))))
+
+
+
+(defn after
+  "returns an interceptor which runs a given function `f` in the `:after`
+  position, presumably for side effects.
+
+  `f` is called with two arguments: the `:effects` value for `:db`
+  (or the `coeffect` value of db if no db effect is returned) and the event.
+  Its return value is ignored, so `f` can only side-effect.
+
+  Examples use can be seen in the /examples/todomvc:
+     - `f` runs schema validation (reporting any errors found).
+     - `f` writes to localstorage."
+  [f]
+  (->interceptor
+    :id    :after
+    :after (fn after-after
+             [context]
+             (let [db    (or (get-effect context :db)
+                             ;; If no db effect is returned, we provide the original coeffect.
+                             (get-coeffect context :db))
+                   event (get-coeffect context :event)]
+               (f db event)    ;; call f for side effects
+               context))))     ;; context is unchanged
+
+
+(defn  on-changes
+  "Interceptor factory which acts a bit like `reaction`  (but it flows into
+  `db`, rather than out). It observes N paths within `db` and if any of them
+  test not identical? to their previous value  (as a result of a event handler
+  being run) then it runs `f` to compute a new value, which is then assoc-ed
+  into the given `out-path` within `db`.
+
+  Usage:
+
+  (defn my-f
+    [a-val b-val]
+    ... some computation on a and b in here)
+
+  (on-changes my-f [:c]  [:a] [:b])
+
+  Put this Interceptor on the right handlers (ones which might change :a or :b).
+  It will:
+     - call `f` each time the value at path [:a] or [:b] changes
+     - call `f` with the values extracted from [:a] [:b]
+     - assoc the return value from `f` into the path  [:c]
+  "
+  [f out-path & in-paths]
+  (->interceptor
+    :id    :on-changes
+    :after (fn on-change-after
+             [context]
+             (let [new-db   (get-effect context :db)
+                   old-db   (get-coeffect context :db)
+
+                   ;; work out if any "inputs" have changed
+                   new-ins      (map #(get-in new-db %) in-paths)
+                   old-ins      (map #(get-in old-db %) in-paths)
+                   ;; make sure the db is actually set in the effect
+                   changed-ins? (and (contains? (get-effect context) :db)
+                                     (some false? (map identical? new-ins old-ins)))]
+
+               ;; if one of the inputs has changed, then run 'f'
+               (if changed-ins?
+                 (->> (apply f new-ins)
+                      (assoc-in new-db out-path)
+                      (assoc-effect context :db))
+                 context)))))
diff --git a/js/re_frame/std_interceptors.cljc.cache.json b/js/re_frame/std_interceptors.cljc.cache.json
new file mode 100644
index 0000000..a8a182b
--- /dev/null
+++ b/js/re_frame/std_interceptors.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ ","~$console","~$re-frame.loggers"],"~:excludes",["~#set",[]],"~:name","~$re-frame.std-interceptors","~:imports",null,"~:requires",["^ ","~$cofx","~$re-frame.cofx","~$re-frame.interceptor","^=","~$data","~$clojure.data","~$re-frame.trace","^@","~$re-frame.registrar","^A","~$registrar","^A","~$trace","^@","~$re-frame.utils","^D","^4","^4","~$utils","^D","^<","^<","^?","^?","~$re-frame.db","^F"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^3","^4","~$assoc-coeffect","^=","~$app-db","^F","~$get-effect","^=","~$->interceptor","^=","~$get-coeffect","^=","~$assoc-effect","^="],"~:defs",["^ ","~$debug",["^ ","^7","~$re-frame.std-interceptors/debug","~:file","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","~:line",14,"~:column",1,"~:end-line",14,"~:end-column",11,"~:meta",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",14,"^T",6,"^U",14,"^V",11],"~:doc","An interceptor which logs/instruments an event handler's actions to\n  `js/console.debug`. See examples/todomvc/src/events.cljs for use.\n\n  Output includes:\n  1. the event vector\n  2. a `clojure.data/diff` of db, before vs after, which shows\n     the changes caused by the event handler.  You will absolutely have\n     to understand https://clojuredocs.org/clojure.data/diff to\n     understand the output.\n\n  You'd typically include this interceptor after (to the right of) any\n  path interceptor.\n\n  Warning:  calling clojure.data/diff on large, complex data structures\n  can be slow. So, you won't want this interceptor present in production\n  code. So condition it out like this :\n\n    (re-frame.core/reg-event-db\n       :evt-id\n       [(when ^boolean goog.DEBUG re-frame.core/debug)]  ;; <-- conditional\n       (fn [db v]\n         ...))\n\n  To make this code fragment work, you'll also have to set goog.DEBUG to\n  false in your production builds - look in `project.clj` of /examples/todomvc.\n  ","~:tag","~$any"],"~$trim-v",["^ ","^7","~$re-frame.std-interceptors/trim-v","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",65,"^T",1,"^U",65,"^V",12,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",65,"^T",6,"^U",65,"^V",12],"^X","An interceptor which removes the first element of the event vector,\n  allowing you to write more aesthetically pleasing event handlers. No\n  leading underscore on the event-v!\n  Your event handlers will look like this:\n\n      (defn my-handler\n        [db [x y z]]    ;; <-- instead of [_ x y z]\n        ....)","^Y","^Z"],"~$db-handler->interceptor",["^ ","~:protocol-inline",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",93,"^T",7,"^U",93,"^V",30,"~:arglists",["~#list",["~$quote",["^14",[["~$handler-fn"]]]]],"^X","Returns an interceptor which wraps the kind of event handler given to `reg-event-db`.\n\n  These handlers take two arguments;  `db` and `event`, and they return `db`.\n\n  (fn [db event]\n     ....)\n\n  So, the interceptor wraps the given handler:\n     1. extracts two `:coeffects` keys: db and event\n     2. calls handler-fn\n     3. stores the db result back into context's `:effects`"],"^7","~$re-frame.std-interceptors/db-handler->interceptor","~:variadic",false,"^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^V",30,"~:method-params",["^14",[["^16"]]],"~:protocol-impl",null,"~:arglists-meta",["^14",[null,null]],"^T",1,"^S",93,"^U",93,"~:max-fixed-arity",1,"~:fn-var",true,"^13",["^14",["^15",["^14",[["^16"]]]]],"^X","Returns an interceptor which wraps the kind of event handler given to `reg-event-db`.\n\n  These handlers take two arguments;  `db` and `event`, and they return `db`.\n\n  (fn [db event]\n     ....)\n\n  So, the interceptor wraps the given handler:\n     1. extracts two `:coeffects` keys: db and event\n     2. calls handler-fn\n     3. stores the db result back into context's `:effects`"],"~$fx-handler->interceptor",["^ ","^12",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",125,"^T",7,"^U",125,"^V",30,"^13",["^14",["^15",["^14",[["^16"]]]]],"^X","Returns an interceptor which wraps the kind of event handler given to `reg-event-fx`.\n\n  These handlers take two arguments;  `coeffects` and `event`, and they return `effects`.\n\n  (fn [coeffects event]\n     {:db ...\n      :dispatch ...})\n\n   Wrap handler in an interceptor so it can be added to (the RHS) of a chain:\n     1. extracts `:coeffects`\n     2. call handler-fn giving coeffects\n     3. stores the result back into the `:effects`"],"^7","~$re-frame.std-interceptors/fx-handler->interceptor","^18",false,"^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^V",30,"^19",["^14",[["^16"]]],"^1:",null,"^1;",["^14",[null,null]],"^T",1,"^S",125,"^U",125,"^1<",1,"^1=",true,"^13",["^14",["^15",["^14",[["^16"]]]]],"^X","Returns an interceptor which wraps the kind of event handler given to `reg-event-fx`.\n\n  These handlers take two arguments;  `coeffects` and `event`, and they return `effects`.\n\n  (fn [coeffects event]\n     {:db ...\n      :dispatch ...})\n\n   Wrap handler in an interceptor so it can be added to (the RHS) of a chain:\n     1. extracts `:coeffects`\n     2. call handler-fn giving coeffects\n     3. stores the result back into the `:effects`"],"~$ctx-handler->interceptor",["^ ","^12",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",156,"^T",7,"^U",156,"^V",31,"^13",["^14",["^15",["^14",[["^16"]]]]],"^X","Returns an interceptor which wraps the kind of event handler given to `reg-event-ctx`.\n  These advanced handlers take one argument: `context` and they return a modified `context`.\n  Example:\n     (fn [context]\n        (enqueue context [more interceptors]))"],"^7","~$re-frame.std-interceptors/ctx-handler->interceptor","^18",false,"^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^V",31,"^19",["^14",[["^16"]]],"^1:",null,"^1;",["^14",[null,null]],"^T",1,"^S",156,"^U",156,"^1<",1,"^1=",true,"^13",["^14",["^15",["^14",[["^16"]]]]],"^X","Returns an interceptor which wraps the kind of event handler given to `reg-event-ctx`.\n  These advanced handlers take one argument: `context` and they return a modified `context`.\n  Example:\n     (fn [context]\n        (enqueue context [more interceptors]))"],"~$path",["^ ","^12",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",181,"^T",7,"^U",181,"^V",11,"^13",["^14",["^15",["^14",[["~$&","~$args"]]]]],"^X","returns an interceptor whose `:before` substitutes the coeffects `:db` with\n  a sub-path of `:db`. Within `:after` it grafts the handler's return value\n  back into db, at the right path.\n\n  So, its overall action is to make the event handler behave like the function\n  you might give to clojure's `update-in`.\n\n  Examples:\n    (path :some :path)\n    (path [:some :path])\n    (path [:some :path] :to :here)\n    (path [:some :path] [:to] :here)\n\n  Example Use:\n\n    (reg-event-db\n      :event-id\n      (path [:a :b])  ;; used here, in interceptor chain\n      (fn [b v]       ;; 1st arg is now not db. Is the value from path [:a :b] within db\n        ... new-b))   ;; returns a new value for that path (not the entire db)\n\n  Notes:\n    1. `path` may appear more than once in an interceptor chain. Progressive narrowing.\n    2. if `:effects` contains no `:db` effect, can't graft a value back in.\n  ","~:top-fn",["^ ","^18",true,"^1<",0,"^19",[["^14",["^1C"]]],"^13",["^14",[["~$&","^1C"]]],"^1;",["^14",[null]]]],"^7","~$re-frame.std-interceptors/path","^18",true,"^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^V",11,"^1D",["^ ","^18",true,"^1<",0,"^19",[["^14",["^1C"]]],"^13",["^14",[["~$&","^1C"]]],"^1;",["^14",[null]]],"^19",[["^14",["^1C"]]],"^1:",null,"^1;",["^14",[null]],"^T",1,"^S",181,"^U",181,"^1<",0,"^1=",true,"^13",["^14",[["~$&","^1C"]]],"^X","returns an interceptor whose `:before` substitutes the coeffects `:db` with\n  a sub-path of `:db`. Within `:after` it grafts the handler's return value\n  back into db, at the right path.\n\n  So, its overall action is to make the event handler behave like the function\n  you might give to clojure's `update-in`.\n\n  Examples:\n    (path :some :path)\n    (path [:some :path])\n    (path [:some :path] :to :here)\n    (path [:some :path] [:to] :here)\n\n  Example Use:\n\n    (reg-event-db\n      :event-id\n      (path [:a :b])  ;; used here, in interceptor chain\n      (fn [b v]       ;; 1st arg is now not db. Is the value from path [:a :b] within db\n        ... new-b))   ;; returns a new value for that path (not the entire db)\n\n  Notes:\n    1. `path` may appear more than once in an interceptor chain. Progressive narrowing.\n    2. if `:effects` contains no `:db` effect, can't graft a value back in.\n  "],"~$enrich",["^ ","^12",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",235,"^T",7,"^U",235,"^V",13,"^13",["^14",["^15",["^14",[["~$f"]]]]],"^X","Interceptor factory which runs the given function `f` in the `after handler`\n  position.  `f` is called with two arguments: `db` and `v`, and is expected to\n  return a modified `db`.\n\n  Unlike the `after` interceptor which is only about side effects, `enrich`\n  expects `f` to process and alter the given `db` coeffect in some useful way,\n  contributing to the derived data, flowing vibe.\n\n  Example Use:\n  ------------\n\n  Imagine that todomvc needed to do duplicate detection - if any two todos had\n  the same text, then highlight their background, and report them via a warning\n  at the bottom of the panel.\n\n  Almost any user action (edit text, add new todo, remove a todo) requires a\n  complete reassessment of duplication errors and warnings. Eg: that edit\n  just made might have introduced a new duplicate, or removed one. Same with\n  any todo removal. So we need to re-calculate warnings after any CRUD events\n  associated with the todos list.\n\n  Unless we are careful, we might end up coding subtly different checks\n  for each kind of CRUD operation.  The duplicates check made after\n  'delete todo' event might be subtly different to that done after an\n  editing operation. Nice and efficient, but fiddly. A bug generator\n  approach.\n\n  So, instead, we create an `f` which recalculates ALL warnings from scratch\n  every time there is ANY change. It will inspect all the todos, and\n  reset ALL FLAGS every time (overwriting what was there previously)\n  and fully recalculate the list of duplicates (displayed at the bottom?).\n\n  https://twitter.com/nathanmarz/status/879722740776939520\n\n  By applying `f` in an `:enrich` interceptor, after every CRUD event,\n  we keep the handlers simple and yet we ensure this important step\n  (of getting warnings right) is not missed on any change.\n\n  We can test `f` easily - it is a pure function - independently of\n  any CRUD operation.\n\n  This brings huge simplicity at the expense of some re-computation\n  each time. This may be a very satisfactory trade-off in many cases."],"^7","~$re-frame.std-interceptors/enrich","^18",false,"^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^V",13,"^19",["^14",[["~$f"]]],"^1:",null,"^1;",["^14",[null,null]],"^T",1,"^S",235,"^U",235,"^1<",1,"^1=",true,"^13",["^14",["^15",["^14",[["~$f"]]]]],"^X","Interceptor factory which runs the given function `f` in the `after handler`\n  position.  `f` is called with two arguments: `db` and `v`, and is expected to\n  return a modified `db`.\n\n  Unlike the `after` interceptor which is only about side effects, `enrich`\n  expects `f` to process and alter the given `db` coeffect in some useful way,\n  contributing to the derived data, flowing vibe.\n\n  Example Use:\n  ------------\n\n  Imagine that todomvc needed to do duplicate detection - if any two todos had\n  the same text, then highlight their background, and report them via a warning\n  at the bottom of the panel.\n\n  Almost any user action (edit text, add new todo, remove a todo) requires a\n  complete reassessment of duplication errors and warnings. Eg: that edit\n  just made might have introduced a new duplicate, or removed one. Same with\n  any todo removal. So we need to re-calculate warnings after any CRUD events\n  associated with the todos list.\n\n  Unless we are careful, we might end up coding subtly different checks\n  for each kind of CRUD operation.  The duplicates check made after\n  'delete todo' event might be subtly different to that done after an\n  editing operation. Nice and efficient, but fiddly. A bug generator\n  approach.\n\n  So, instead, we create an `f` which recalculates ALL warnings from scratch\n  every time there is ANY change. It will inspect all the todos, and\n  reset ALL FLAGS every time (overwriting what was there previously)\n  and fully recalculate the list of duplicates (displayed at the bottom?).\n\n  https://twitter.com/nathanmarz/status/879722740776939520\n\n  By applying `f` in an `:enrich` interceptor, after every CRUD event,\n  we keep the handlers simple and yet we ensure this important step\n  (of getting warnings right) is not missed on any change.\n\n  We can test `f` easily - it is a pure function - independently of\n  any CRUD operation.\n\n  This brings huge simplicity at the expense of some re-computation\n  each time. This may be a very satisfactory trade-off in many cases."],"~$after",["^ ","^12",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",293,"^T",7,"^U",293,"^V",12,"^13",["^14",["^15",["^14",[["~$f"]]]]],"^X","returns an interceptor which runs a given function `f` in the `:after`\n  position, presumably for side effects.\n\n  `f` is called with two arguments: the `:effects` value for `:db`\n  (or the `coeffect` value of db if no db effect is returned) and the event.\n  Its return value is ignored, so `f` can only side-effect.\n\n  Examples use can be seen in the /examples/todomvc:\n     - `f` runs schema validation (reporting any errors found).\n     - `f` writes to localstorage."],"^7","~$re-frame.std-interceptors/after","^18",false,"^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^V",12,"^19",["^14",[["~$f"]]],"^1:",null,"^1;",["^14",[null,null]],"^T",1,"^S",293,"^U",293,"^1<",1,"^1=",true,"^13",["^14",["^15",["^14",[["~$f"]]]]],"^X","returns an interceptor which runs a given function `f` in the `:after`\n  position, presumably for side effects.\n\n  `f` is called with two arguments: the `:effects` value for `:db`\n  (or the `coeffect` value of db if no db effect is returned) and the event.\n  Its return value is ignored, so `f` can only side-effect.\n\n  Examples use can be seen in the /examples/todomvc:\n     - `f` runs schema validation (reporting any errors found).\n     - `f` writes to localstorage."],"~$on-changes",["^ ","^12",null,"^W",["^ ","^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^S",317,"^T",8,"^U",317,"^V",18,"^13",["^14",["^15",["^14",[["~$f","~$out-path","~$&","~$in-paths"]]]]],"^X","Interceptor factory which acts a bit like `reaction`  (but it flows into\n  `db`, rather than out). It observes N paths within `db` and if any of them\n  test not identical? to their previous value  (as a result of a event handler\n  being run) then it runs `f` to compute a new value, which is then assoc-ed\n  into the given `out-path` within `db`.\n\n  Usage:\n\n  (defn my-f\n    [a-val b-val]\n    ... some computation on a and b in here)\n\n  (on-changes my-f [:c]  [:a] [:b])\n\n  Put this Interceptor on the right handlers (ones which might change :a or :b).\n  It will:\n     - call `f` each time the value at path [:a] or [:b] changes\n     - call `f` with the values extracted from [:a] [:b]\n     - assoc the return value from `f` into the path  [:c]\n  ","^1D",["^ ","^18",true,"^1<",2,"^19",[["^14",["~$f","^1K","^1L"]]],"^13",["^14",[["~$f","^1K","~$&","^1L"]]],"^1;",["^14",[null]]]],"^7","~$re-frame.std-interceptors/on-changes","^18",true,"^R","/home/julien/.cljs/.aot_cache/1.10.329/AFA1C19/re_frame/std_interceptors.cljc","^V",18,"^1D",["^ ","^18",true,"^1<",2,"^19",[["^14",["~$f","^1K","^1L"]]],"^13",["^14",[["~$f","^1K","~$&","^1L"]]],"^1;",["^14",[null]]],"^19",[["^14",["~$f","^1K","^1L"]]],"^1:",null,"^1;",["^14",[null]],"^T",1,"^S",317,"^U",317,"^1<",2,"^1=",true,"^13",["^14",[["~$f","^1K","~$&","^1L"]]],"^X","Interceptor factory which acts a bit like `reaction`  (but it flows into\n  `db`, rather than out). It observes N paths within `db` and if any of them\n  test not identical? to their previous value  (as a result of a event handler\n  being run) then it runs `f` to compute a new value, which is then assoc-ed\n  into the given `out-path` within `db`.\n\n  Usage:\n\n  (defn my-f\n    [a-val b-val]\n    ... some computation on a and b in here)\n\n  (on-changes my-f [:c]  [:a] [:b])\n\n  Put this Interceptor on the right handlers (ones which might change :a or :b).\n  It will:\n     - call `f` each time the value at path [:a] or [:b] changes\n     - call `f` with the values extracted from [:a] [:b]\n     - assoc the return value from `f` into the path  [:c]\n  "]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^C","^@","^@","^@"],"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["~:path","~:tags","~:group","~:db","~:fx-handler","~:re-frame.std-interceptors/not-found","~:operation","~:start","~:duration","~:debug","~:trim-v","~:event/handler","~:db-handler","~:event","~:after","~:id","~:effects","~:error","~:coeffects","~:re-frame-path/db-store","~:end","~:on-changes","~:groupEnd","~:ctx-handler","~:enrich","~:before","~:op-type","~:log","~:re-frame.std-interceptors/untrimmed-event"]],"~:order",["^25","^1[","^2?","^2A","^23","^24","^1U","^1W","^1T","^2<","^20","^28","^2B","^22","^2@","^1X","^21","^1Y","^1Z","^2:","^1S","^26","^1V","^2=","^29","^27","^1R","^2>","^2;"]],"^X","contains re-frame supplied, standard interceptors"]
\ No newline at end of file
diff --git a/js/re_frame/std_interceptors.js b/js/re_frame/std_interceptors.js
new file mode 100644
index 0000000..249f3f3
--- /dev/null
+++ b/js/re_frame/std_interceptors.js
@@ -0,0 +1,462 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.std_interceptors');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.interceptor');
+goog.require('re_frame.loggers');
+goog.require('re_frame.registrar');
+goog.require('re_frame.db');
+goog.require('clojure.data');
+goog.require('re_frame.cofx');
+goog.require('re_frame.utils');
+goog.require('re_frame.trace');
+/**
+ * An interceptor which logs/instruments an event handler's actions to
+ *   `js/console.debug`. See examples/todomvc/src/events.cljs for use.
+ * 
+ *   Output includes:
+ *   1. the event vector
+ *   2. a `clojure.data/diff` of db, before vs after, which shows
+ *   the changes caused by the event handler.  You will absolutely have
+ *   to understand https://clojuredocs.org/clojure.data/diff to
+ *   understand the output.
+ * 
+ *   You'd typically include this interceptor after (to the right of) any
+ *   path interceptor.
+ * 
+ *   Warning:  calling clojure.data/diff on large, complex data structures
+ *   can be slow. So, you won't want this interceptor present in production
+ *   code. So condition it out like this :
+ * 
+ *  (re-frame.core/reg-event-db
+ *     :evt-id
+ *     [(when ^boolean goog.DEBUG re-frame.core/debug)]  ;; <-- conditional
+ *     (fn [db v]
+ *       ...))
+ * 
+ *   To make this code fragment work, you'll also have to set goog.DEBUG to
+ *   false in your production builds - look in `project.clj` of /examples/todomvc.
+ *   
+ */
+re_frame.std_interceptors.debug = re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$debug,cljs.core.cst$kw$before,(function re_frame$std_interceptors$debug_before(context){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$log,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Handling re-frame event:",re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$event)], 0));
+
+return context;
+}),cljs.core.cst$kw$after,(function re_frame$std_interceptors$debug_after(context){
+var event = re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$event);
+var orig_db = re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+var new_db = re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$3(context,cljs.core.cst$kw$db,cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_not_DASH_found);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new_db,cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_not_DASH_found)){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$log,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["No :db changes caused by:",event], 0));
+} else {
+var vec__5148_5151 = clojure.data.diff(orig_db,new_db);
+var only_before_5152 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5148_5151,(0),null);
+var only_after_5153 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5148_5151,(1),null);
+var db_changed_QMARK__5154 = ((!((only_before_5152 == null))) || (!((only_after_5153 == null))));
+if(db_changed_QMARK__5154){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$group,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["db clojure.data/diff for:",event], 0));
+
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$log,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["only before:",only_before_5152], 0));
+
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$log,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["only after :",only_after_5153], 0));
+
+re_frame.loggers.console(cljs.core.cst$kw$groupEnd);
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$log,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["no app-db changes caused by:",event], 0));
+}
+}
+
+return context;
+})], 0));
+/**
+ * An interceptor which removes the first element of the event vector,
+ *   allowing you to write more aesthetically pleasing event handlers. No
+ *   leading underscore on the event-v!
+ *   Your event handlers will look like this:
+ * 
+ *    (defn my-handler
+ *      [db [x y z]]    ;; <-- instead of [_ x y z]
+ *      ....)
+ */
+re_frame.std_interceptors.trim_v = re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$trim_DASH_v,cljs.core.cst$kw$before,(function re_frame$std_interceptors$trimv_before(context){
+return cljs.core.assoc_in(cljs.core.update_in.cljs$core$IFn$_invoke$arity$4(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,cljs.core.cst$kw$event], null),cljs.core.subvec,(1)),new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_untrimmed_DASH_event], null),re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$event));
+}),cljs.core.cst$kw$after,(function re_frame$std_interceptors$trimv_after(context){
+return cljs.core.assoc_in(re_frame.utils.dissoc_in(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_untrimmed_DASH_event], null)),new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,cljs.core.cst$kw$event], null),re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_untrimmed_DASH_event));
+})], 0));
+/**
+ * Returns an interceptor which wraps the kind of event handler given to `reg-event-db`.
+ * 
+ *   These handlers take two arguments;  `db` and `event`, and they return `db`.
+ * 
+ *   (fn [db event]
+ *   ....)
+ * 
+ *   So, the interceptor wraps the given handler:
+ *   1. extracts two `:coeffects` keys: db and event
+ *   2. calls handler-fn
+ *   3. stores the db result back into context's `:effects`
+ */
+re_frame.std_interceptors.db_handler__GT_interceptor = (function re_frame$std_interceptors$db_handler__GT_interceptor(handler_fn){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$db_DASH_handler,cljs.core.cst$kw$before,(function re_frame$std_interceptors$db_handler__GT_interceptor_$_db_handler_before(context){
+var new_context = ((re_frame.trace.is_trace_enabled_QMARK_())?(function (){var _STAR_current_trace_STAR_5155 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$event_SLASH_handler,cljs.core.cst$kw$operation,cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,cljs.core.cst$kw$event], null))], null));
+
+try{try{var map__5156 = cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context);
+var map__5156__$1 = ((((!((map__5156 == null)))?(((((map__5156.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__5156.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__5156):map__5156);
+var db = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__5156__$1,cljs.core.cst$kw$db);
+var event = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__5156__$1,cljs.core.cst$kw$event);
+return re_frame.interceptor.assoc_effect(context,cljs.core.cst$kw$db,(handler_fn.cljs$core$IFn$_invoke$arity$2 ? handler_fn.cljs$core$IFn$_invoke$arity$2(db,event) : handler_fn.call(null,db,event)));
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5160 = re_frame.interop.now();
+var duration__4440__auto___5161 = (end__4439__auto___5160 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5161,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5160);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5155;
+}})():(function (){var map__5158 = cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context);
+var map__5158__$1 = ((((!((map__5158 == null)))?(((((map__5158.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__5158.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__5158):map__5158);
+var db = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__5158__$1,cljs.core.cst$kw$db);
+var event = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__5158__$1,cljs.core.cst$kw$event);
+return re_frame.interceptor.assoc_effect(context,cljs.core.cst$kw$db,(handler_fn.cljs$core$IFn$_invoke$arity$2 ? handler_fn.cljs$core$IFn$_invoke$arity$2(db,event) : handler_fn.call(null,db,event)));
+})());
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5162 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$effects,cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(new_context),cljs.core.cst$kw$coeffects,cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$effects,cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(new_context),cljs.core.cst$kw$coeffects,cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5162;
+
+} else {
+}
+
+return new_context;
+})], 0));
+});
+/**
+ * Returns an interceptor which wraps the kind of event handler given to `reg-event-fx`.
+ * 
+ *   These handlers take two arguments;  `coeffects` and `event`, and they return `effects`.
+ * 
+ *   (fn [coeffects event]
+ *   {:db ...
+ *    :dispatch ...})
+ * 
+ * Wrap handler in an interceptor so it can be added to (the RHS) of a chain:
+ *   1. extracts `:coeffects`
+ *   2. call handler-fn giving coeffects
+ *   3. stores the result back into the `:effects`
+ */
+re_frame.std_interceptors.fx_handler__GT_interceptor = (function re_frame$std_interceptors$fx_handler__GT_interceptor(handler_fn){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$fx_DASH_handler,cljs.core.cst$kw$before,(function re_frame$std_interceptors$fx_handler__GT_interceptor_$_fx_handler_before(context){
+var map__5163 = cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context);
+var map__5163__$1 = ((((!((map__5163 == null)))?(((((map__5163.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__5163.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__5163):map__5163);
+var coeffects = map__5163__$1;
+var event = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__5163__$1,cljs.core.cst$kw$event);
+var new_context = ((re_frame.trace.is_trace_enabled_QMARK_())?(function (){var _STAR_current_trace_STAR_5165 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$event_SLASH_handler,cljs.core.cst$kw$operation,cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,cljs.core.cst$kw$event], null))], null));
+
+try{try{return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(context,cljs.core.cst$kw$effects,(handler_fn.cljs$core$IFn$_invoke$arity$2 ? handler_fn.cljs$core$IFn$_invoke$arity$2(coeffects,event) : handler_fn.call(null,coeffects,event)));
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5166 = re_frame.interop.now();
+var duration__4440__auto___5167 = (end__4439__auto___5166 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5167,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5166);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5165;
+}})():cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(context,cljs.core.cst$kw$effects,(handler_fn.cljs$core$IFn$_invoke$arity$2 ? handler_fn.cljs$core$IFn$_invoke$arity$2(coeffects,event) : handler_fn.call(null,coeffects,event))));
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5168 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$effects,cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(new_context),cljs.core.cst$kw$coeffects,cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$effects,cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(new_context),cljs.core.cst$kw$coeffects,cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5168;
+
+} else {
+}
+
+return new_context;
+})], 0));
+});
+/**
+ * Returns an interceptor which wraps the kind of event handler given to `reg-event-ctx`.
+ *   These advanced handlers take one argument: `context` and they return a modified `context`.
+ *   Example:
+ *   (fn [context]
+ *      (enqueue context [more interceptors]))
+ */
+re_frame.std_interceptors.ctx_handler__GT_interceptor = (function re_frame$std_interceptors$ctx_handler__GT_interceptor(handler_fn){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$ctx_DASH_handler,cljs.core.cst$kw$before,(function re_frame$std_interceptors$ctx_handler__GT_interceptor_$_ctx_handler_before(context){
+var new_context = ((re_frame.trace.is_trace_enabled_QMARK_())?(function (){var _STAR_current_trace_STAR_5169 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$event_SLASH_handler,cljs.core.cst$kw$operation,cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(context,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$coeffects,cljs.core.cst$kw$event], null))], null));
+
+try{try{return (handler_fn.cljs$core$IFn$_invoke$arity$1 ? handler_fn.cljs$core$IFn$_invoke$arity$1(context) : handler_fn.call(null,context));
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5170 = re_frame.interop.now();
+var duration__4440__auto___5171 = (end__4439__auto___5170 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5171,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5170);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5169;
+}})():(handler_fn.cljs$core$IFn$_invoke$arity$1 ? handler_fn.cljs$core$IFn$_invoke$arity$1(context) : handler_fn.call(null,context)));
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5172 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$effects,cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(new_context),cljs.core.cst$kw$coeffects,cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$effects,cljs.core.cst$kw$effects.cljs$core$IFn$_invoke$arity$1(new_context),cljs.core.cst$kw$coeffects,cljs.core.cst$kw$coeffects.cljs$core$IFn$_invoke$arity$1(context)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5172;
+
+} else {
+}
+
+return new_context;
+})], 0));
+});
+/**
+ * returns an interceptor whose `:before` substitutes the coeffects `:db` with
+ *   a sub-path of `:db`. Within `:after` it grafts the handler's return value
+ *   back into db, at the right path.
+ * 
+ *   So, its overall action is to make the event handler behave like the function
+ *   you might give to clojure's `update-in`.
+ * 
+ *   Examples:
+ *  (path :some :path)
+ *  (path [:some :path])
+ *  (path [:some :path] :to :here)
+ *  (path [:some :path] [:to] :here)
+ * 
+ *   Example Use:
+ * 
+ *  (reg-event-db
+ *    :event-id
+ *    (path [:a :b])  ;; used here, in interceptor chain
+ *    (fn [b v]       ;; 1st arg is now not db. Is the value from path [:a :b] within db
+ *      ... new-b))   ;; returns a new value for that path (not the entire db)
+ * 
+ *   Notes:
+ *  1. `path` may appear more than once in an interceptor chain. Progressive narrowing.
+ *  2. if `:effects` contains no `:db` effect, can't graft a value back in.
+ *   
+ */
+re_frame.std_interceptors.path = (function re_frame$std_interceptors$path(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___5174 = arguments.length;
+var i__4519__auto___5175 = (0);
+while(true){
+if((i__4519__auto___5175 < len__4518__auto___5174)){
+args__4521__auto__.push((arguments[i__4519__auto___5175]));
+
+var G__5176 = (i__4519__auto___5175 + (1));
+i__4519__auto___5175 = G__5176;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((0) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((0)),(0),null)):null);
+return re_frame.std_interceptors.path.cljs$core$IFn$_invoke$arity$variadic(argseq__4522__auto__);
+});
+
+re_frame.std_interceptors.path.cljs$core$IFn$_invoke$arity$variadic = (function (args){
+var path = cljs.core.flatten(args);
+var db_store_key = cljs.core.cst$kw$re_DASH_frame_DASH_path_SLASH_db_DASH_store;
+if(cljs.core.empty_QMARK_(path)){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: \"path\" interceptor given no params"], 0));
+} else {
+}
+
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$path,cljs.core.cst$kw$before,((function (path,db_store_key){
+return (function (context){
+var original_db = re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+return re_frame.interceptor.assoc_coeffect(cljs.core.update.cljs$core$IFn$_invoke$arity$4(context,db_store_key,cljs.core.conj,original_db),cljs.core.cst$kw$db,cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(original_db,path));
+});})(path,db_store_key))
+,cljs.core.cst$kw$after,((function (path,db_store_key){
+return (function (context){
+var db_store = db_store_key.cljs$core$IFn$_invoke$arity$1(context);
+var original_db = cljs.core.peek(db_store);
+var new_db_store = cljs.core.pop(db_store);
+var context_SINGLEQUOTE_ = re_frame.interceptor.assoc_coeffect(cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(context,db_store_key,new_db_store),cljs.core.cst$kw$db,original_db);
+var db = re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$3(context,cljs.core.cst$kw$db,cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_not_DASH_found);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(db,cljs.core.cst$kw$re_DASH_frame$std_DASH_interceptors_SLASH_not_DASH_found)){
+return context_SINGLEQUOTE_;
+} else {
+return re_frame.interceptor.assoc_effect(context_SINGLEQUOTE_,cljs.core.cst$kw$db,cljs.core.assoc_in(original_db,path,db));
+}
+});})(path,db_store_key))
+], 0));
+});
+
+re_frame.std_interceptors.path.cljs$lang$maxFixedArity = (0);
+
+/** @this {Function} */
+re_frame.std_interceptors.path.cljs$lang$applyTo = (function (seq5173){
+var self__4506__auto__ = this;
+return self__4506__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq5173));
+});
+
+/**
+ * Interceptor factory which runs the given function `f` in the `after handler`
+ *   position.  `f` is called with two arguments: `db` and `v`, and is expected to
+ *   return a modified `db`.
+ * 
+ *   Unlike the `after` interceptor which is only about side effects, `enrich`
+ *   expects `f` to process and alter the given `db` coeffect in some useful way,
+ *   contributing to the derived data, flowing vibe.
+ * 
+ *   Example Use:
+ *   ------------
+ * 
+ *   Imagine that todomvc needed to do duplicate detection - if any two todos had
+ *   the same text, then highlight their background, and report them via a warning
+ *   at the bottom of the panel.
+ * 
+ *   Almost any user action (edit text, add new todo, remove a todo) requires a
+ *   complete reassessment of duplication errors and warnings. Eg: that edit
+ *   just made might have introduced a new duplicate, or removed one. Same with
+ *   any todo removal. So we need to re-calculate warnings after any CRUD events
+ *   associated with the todos list.
+ * 
+ *   Unless we are careful, we might end up coding subtly different checks
+ *   for each kind of CRUD operation.  The duplicates check made after
+ *   'delete todo' event might be subtly different to that done after an
+ *   editing operation. Nice and efficient, but fiddly. A bug generator
+ *   approach.
+ * 
+ *   So, instead, we create an `f` which recalculates ALL warnings from scratch
+ *   every time there is ANY change. It will inspect all the todos, and
+ *   reset ALL FLAGS every time (overwriting what was there previously)
+ *   and fully recalculate the list of duplicates (displayed at the bottom?).
+ * 
+ *   https://twitter.com/nathanmarz/status/879722740776939520
+ * 
+ *   By applying `f` in an `:enrich` interceptor, after every CRUD event,
+ *   we keep the handlers simple and yet we ensure this important step
+ *   (of getting warnings right) is not missed on any change.
+ * 
+ *   We can test `f` easily - it is a pure function - independently of
+ *   any CRUD operation.
+ * 
+ *   This brings huge simplicity at the expense of some re-computation
+ *   each time. This may be a very satisfactory trade-off in many cases.
+ */
+re_frame.std_interceptors.enrich = (function re_frame$std_interceptors$enrich(f){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$enrich,cljs.core.cst$kw$after,(function re_frame$std_interceptors$enrich_$_enrich_after(context){
+var event = re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$event);
+var db = (function (){var or__3936__auto__ = re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+}
+})();
+return re_frame.interceptor.assoc_effect(context,cljs.core.cst$kw$db,(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(db,event) : f.call(null,db,event)));
+})], 0));
+});
+/**
+ * returns an interceptor which runs a given function `f` in the `:after`
+ *   position, presumably for side effects.
+ * 
+ *   `f` is called with two arguments: the `:effects` value for `:db`
+ *   (or the `coeffect` value of db if no db effect is returned) and the event.
+ *   Its return value is ignored, so `f` can only side-effect.
+ * 
+ *   Examples use can be seen in the /examples/todomvc:
+ *   - `f` runs schema validation (reporting any errors found).
+ *   - `f` writes to localstorage.
+ */
+re_frame.std_interceptors.after = (function re_frame$std_interceptors$after(f){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$after,cljs.core.cst$kw$after,(function re_frame$std_interceptors$after_$_after_after(context){
+var db = (function (){var or__3936__auto__ = re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+}
+})();
+var event = re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$event);
+(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(db,event) : f.call(null,db,event));
+
+return context;
+})], 0));
+});
+/**
+ * Interceptor factory which acts a bit like `reaction`  (but it flows into
+ *   `db`, rather than out). It observes N paths within `db` and if any of them
+ *   test not identical? to their previous value  (as a result of a event handler
+ *   being run) then it runs `f` to compute a new value, which is then assoc-ed
+ *   into the given `out-path` within `db`.
+ * 
+ *   Usage:
+ * 
+ *   (defn my-f
+ *  [a-val b-val]
+ *  ... some computation on a and b in here)
+ * 
+ *   (on-changes my-f [:c]  [:a] [:b])
+ * 
+ *   Put this Interceptor on the right handlers (ones which might change :a or :b).
+ *   It will:
+ *   - call `f` each time the value at path [:a] or [:b] changes
+ *   - call `f` with the values extracted from [:a] [:b]
+ *   - assoc the return value from `f` into the path  [:c]
+ *   
+ */
+re_frame.std_interceptors.on_changes = (function re_frame$std_interceptors$on_changes(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___5182 = arguments.length;
+var i__4519__auto___5183 = (0);
+while(true){
+if((i__4519__auto___5183 < len__4518__auto___5182)){
+args__4521__auto__.push((arguments[i__4519__auto___5183]));
+
+var G__5184 = (i__4519__auto___5183 + (1));
+i__4519__auto___5183 = G__5184;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((2) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((2)),(0),null)):null);
+return re_frame.std_interceptors.on_changes.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4522__auto__);
+});
+
+re_frame.std_interceptors.on_changes.cljs$core$IFn$_invoke$arity$variadic = (function (f,out_path,in_paths){
+return re_frame.interceptor.__GT_interceptor.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$id,cljs.core.cst$kw$on_DASH_changes,cljs.core.cst$kw$after,(function re_frame$std_interceptors$on_change_after(context){
+var new_db = re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+var old_db = re_frame.interceptor.get_coeffect.cljs$core$IFn$_invoke$arity$2(context,cljs.core.cst$kw$db);
+var new_ins = cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (new_db,old_db){
+return (function (p1__5177_SHARP_){
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(new_db,p1__5177_SHARP_);
+});})(new_db,old_db))
+,in_paths);
+var old_ins = cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (new_db,old_db,new_ins){
+return (function (p1__5178_SHARP_){
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(old_db,p1__5178_SHARP_);
+});})(new_db,old_db,new_ins))
+,in_paths);
+var changed_ins_QMARK_ = (function (){var and__3925__auto__ = cljs.core.contains_QMARK_(re_frame.interceptor.get_effect.cljs$core$IFn$_invoke$arity$1(context),cljs.core.cst$kw$db);
+if(and__3925__auto__){
+return cljs.core.some(cljs.core.false_QMARK_,cljs.core.map.cljs$core$IFn$_invoke$arity$3(cljs.core.identical_QMARK_,new_ins,old_ins));
+} else {
+return and__3925__auto__;
+}
+})();
+if(cljs.core.truth_(changed_ins_QMARK_)){
+return re_frame.interceptor.assoc_effect(context,cljs.core.cst$kw$db,cljs.core.assoc_in(new_db,out_path,cljs.core.apply.cljs$core$IFn$_invoke$arity$2(f,new_ins)));
+} else {
+return context;
+}
+})], 0));
+});
+
+re_frame.std_interceptors.on_changes.cljs$lang$maxFixedArity = (2);
+
+/** @this {Function} */
+re_frame.std_interceptors.on_changes.cljs$lang$applyTo = (function (seq5179){
+var G__5180 = cljs.core.first(seq5179);
+var seq5179__$1 = cljs.core.next(seq5179);
+var G__5181 = cljs.core.first(seq5179__$1);
+var seq5179__$2 = cljs.core.next(seq5179__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__5180,G__5181,seq5179__$2);
+});
+
diff --git a/js/re_frame/subs.cljc b/js/re_frame/subs.cljc
new file mode 100644
index 0000000..4b57f86
--- /dev/null
+++ b/js/re_frame/subs.cljc
@@ -0,0 +1,354 @@
+(ns re-frame.subs
+ (:require
+   [re-frame.db        :refer [app-db]]
+   [re-frame.interop   :refer [add-on-dispose! debug-enabled? make-reaction ratom? deref? dispose! reagent-id]]
+   [re-frame.loggers   :refer [console]]
+   [re-frame.utils     :refer [first-in-vector]]
+   [re-frame.registrar :refer [get-handler clear-handlers register-handler]]
+   [re-frame.trace     :as trace :include-macros true]))
+
+(def kind :sub)
+(assert (re-frame.registrar/kinds kind))
+
+;; -- cache -------------------------------------------------------------------
+;;
+;; De-duplicate subscriptions. If two or more equal subscriptions
+;; are concurrently active, we want only one handler running.
+;; Two subscriptions are "equal" if their query vectors test "=".
+(def query->reaction (atom {}))
+
+(defn clear-subscription-cache!
+  "Causes all subscriptions to be removed from the cache.
+  Does this by:
+     1. running on-dispose on all cached subscriptions
+     2. These on-dispose will then do the removal of themselves.
+
+  This is a development time tool. Useful when reloading Figwheel code
+  after a React exception, because React components won't have been
+  cleaned up properly. And this, in turn, means the subscriptions within those
+  components won't have been cleaned up correctly. So this forces the issue."
+  []
+  (doseq [[k rxn] @query->reaction]
+    (dispose! rxn))
+  (if (not-empty @query->reaction)
+    (console :warn "Subscription cache should be empty after clearing it.")))
+
+(defn clear-all-handlers!
+  "Unregisters all existing subscription handlers"
+  []
+  (clear-handlers kind)
+  (clear-subscription-cache!))
+
+(defn cache-and-return
+  "cache the reaction r"
+  [query-v dynv r]
+  (let [cache-key [query-v dynv]]
+    ;; when this reaction is no longer being used, remove it from the cache
+    (add-on-dispose! r #(trace/with-trace {:operation (first-in-vector query-v)
+                                           :op-type   :sub/dispose
+                                           :tags      {:query-v  query-v
+                                                       :reaction (reagent-id r)}}
+                                          (swap! query->reaction
+                                                 (fn [query-cache]
+                                                   (if (and (contains? query-cache cache-key) (identical? r (get query-cache cache-key)))
+                                                     (dissoc query-cache cache-key)
+                                                     query-cache)))))
+    ;; cache this reaction, so it can be used to deduplicate other, later "=" subscriptions
+    (swap! query->reaction (fn [query-cache]
+                             (when debug-enabled?
+                               (when (contains? query-cache cache-key)
+                                 (console :warn "re-frame: Adding a new subscription to the cache while there is an existing subscription in the cache" cache-key)))
+                             (assoc query-cache cache-key r)))
+    (trace/merge-trace! {:tags {:reaction (reagent-id r)}})
+    r)) ;; return the actual reaction
+
+(defn cache-lookup
+  ([query-v]
+   (cache-lookup query-v []))
+  ([query-v dyn-v]
+   (get @query->reaction [query-v dyn-v])))
+
+
+;; -- subscribe ---------------------------------------------------------------
+
+(defn subscribe
+  "Given a `query`, returns a Reagent `reaction` which, over
+  time, reactively delivers a stream of values. So in FRP-ish terms,
+  it returns a Signal.
+
+  To obtain the returned Signal/Stream's current value, it must be `deref`ed.
+
+  `query` is a vector of at least one element. The first element is the
+  `query-id`, typically a namespaced keyword. The rest of the vector's
+  elements are optional, additional values which parameterise the query
+  performed.
+
+  `dynv` is an optional 3rd argument, `which is a vector of further input
+  signals (atoms, reactions, etc), NOT values. This argument exists for
+  historical reasons and is borderline deprecated these days.
+
+  Example Usage:
+  --------------
+
+    (subscribe [:items])
+    (subscribe [:items \"blue\" :small])
+    (subscribe [:items {:colour \"blue\"  :size :small}])
+
+  Note: for any given call to `subscribe` there must have been a previous call
+  to `reg-sub`, registering the query handler (function) for the `query-id` given.
+
+  Hint
+  ----
+
+  When used in a view function BE SURE to `deref` the returned value.
+  In fact, to avoid any mistakes, some prefer to define:
+
+     (def <sub  (comp deref re-frame.core/subscribe))
+
+  And then, within their views, they call  `(<sub [:items :small])` rather
+  than using `subscribe` directly.
+
+  De-duplication
+  --------------
+
+  XXX
+  "
+
+  ([query]
+   (trace/with-trace {:operation (first-in-vector query)
+                      :op-type   :sub/create
+                      :tags      {:query-v query}}
+     (if-let [cached (cache-lookup query)]
+       (do
+         (trace/merge-trace! {:tags {:cached?  true
+                                     :reaction (reagent-id cached)}})
+         cached)
+
+       (let [query-id   (first-in-vector query)
+             handler-fn (get-handler kind query-id)]
+         (trace/merge-trace! {:tags {:cached? false}})
+         (if (nil? handler-fn)
+           (do (trace/merge-trace! {:error true})
+               (console :error (str "re-frame: no subscription handler registered for: " query-id ". Returning a nil subscription.")))
+           (cache-and-return query [] (handler-fn app-db query)))))))
+
+  ([query dynv]
+   (trace/with-trace {:operation (first-in-vector query)
+                      :op-type   :sub/create
+                      :tags      {:query-v query
+                                  :dyn-v   dynv}}
+     (if-let [cached (cache-lookup query dynv)]
+       (do
+         (trace/merge-trace! {:tags {:cached?  true
+                                     :reaction (reagent-id cached)}})
+         cached)
+       (let [query-id   (first-in-vector query)
+             handler-fn (get-handler kind query-id)]
+         (trace/merge-trace! {:tags {:cached? false}})
+         (when debug-enabled?
+           (when-let [not-reactive (not-empty (remove ratom? dynv))]
+             (console :warn "re-frame: your subscription's dynamic parameters that don't implement IReactiveAtom:" not-reactive)))
+         (if (nil? handler-fn)
+           (do (trace/merge-trace! {:error true})
+               (console :error (str "re-frame: no subscription handler registered for: " query-id ". Returning a nil subscription.")))
+           (let [dyn-vals (make-reaction (fn [] (mapv deref dynv)))
+                 sub      (make-reaction (fn [] (handler-fn app-db query @dyn-vals)))]
+             ;; handler-fn returns a reaction which is then wrapped in the sub reaction
+             ;; need to double deref it to get to the actual value.
+             ;(console :log "Subscription created: " v dynv)
+             (cache-and-return query dynv (make-reaction (fn [] @@sub))))))))))
+
+;; -- reg-sub -----------------------------------------------------------------
+
+(defn- map-vals
+  "Returns a new version of 'm' in which 'f' has been applied to each value.
+  (map-vals inc {:a 4, :b 2}) => {:a 5, :b 3}"
+  [f m]
+  (into (empty m)
+        (map (fn [[k v]] [k (f v)]))
+        m))
+
+(defn map-signals
+  "Runs f over signals. Signals may take several
+  forms, this function handles all of them."
+  [f signals]
+  (cond
+    (sequential? signals) (map f signals)
+    (map? signals) (map-vals f signals)
+    (deref? signals) (f signals)
+    :else '()))
+
+(defn to-seq
+  "Coerces x to a seq if it isn't one already"
+  [x]
+  (if (sequential? x)
+    x
+    (list x)))
+
+(defn- deref-input-signals
+  [signals query-id]
+  (let [dereffed-signals (map-signals deref signals)]
+    (cond
+      (sequential? signals) (map deref signals)
+      (map? signals) (map-vals deref signals)
+      (deref? signals) (deref signals)
+      :else (console :error "re-frame: in the reg-sub for" query-id ", the input-signals function returns:" signals))
+    (trace/merge-trace! {:tags {:input-signals (doall (to-seq (map-signals reagent-id signals)))}})
+    dereffed-signals))
+
+
+(defn reg-sub
+  "For a given `query-id`, register a `computation` function and input `signals`.
+
+  At an abstract level, a call to this function allows you to register 'the mechanism'
+  to later fulfil a call to `(subscribe [query-id ...])`.
+
+  To say that another way, reg-sub allows you to create a template for a node
+  in the signal graph. But note: reg-sub does not cause a node to be created.
+  It simply allows you to register the template from which such a
+  node could be created, if it were needed, sometime later, when the call
+  to `subscribe` is made.
+
+  reg-sub needs three things:
+    - a `query-id`
+    - the required inputs for this node
+    - a computation function for this node
+
+  The `query-id` is always the 1st argument to reg-sub and it is typically
+  a namespaced keyword.
+
+  A computation function is always the last argument and it has this general form:
+    `(input-signals, query-vector) -> a-value`
+
+  What goes in between the 1st and last args can vary, but whatever is there will
+  define the input signals part of the template, and, as a result, it will control
+  what values the computation functions gets as a first argument.
+
+  There's 3 ways this function can be called - 3 ways to supply input signals:
+
+  1. No input signals given:
+
+     (reg-sub
+       :query-id
+       a-computation-fn)   ;; (fn [db v]  ... a-value)
+
+     The node's input signal defaults to `app-db`, and the value within `app-db` is
+     is given as the 1st argument to the computation function.
+
+  2. A signal function is supplied:
+
+     (reg-sub
+       :query-id
+       signal-fn     ;; <-- here
+       computation-fn)
+
+     When a node is created from the template, the `signal-fn` will be called and it
+     is expected to return the input signal(s) as either a singleton, if there is only
+     one, or a sequence if there are many, or a map with the signals as the values.
+
+     The values from the nominated signals will be supplied as the 1st argument to the
+     computation function - either a singleton, sequence or map of them, paralleling
+     the structure returned by the signal function.
+
+     Here, is an example signal-fn, which returns a vector of input signals.
+
+       (fn [query-vec dynamic-vec]
+         [(subscribe [:a-sub])
+          (subscribe [:b-sub])])
+
+     For that signal function, the computation function must be written
+     to expect a vector of values for its first argument.
+       (fn [[a b] _] ....)
+
+     If the signal function was simpler and returned a singleton, like this:
+        (fn [query-vec dynamic-vec]
+          (subscribe [:a-sub]))
+
+     then the computation function must be written to expect a single value
+     as the 1st argument:
+
+        (fn [a _] ...)
+
+  3. Syntax Sugar
+
+     (reg-sub
+       :a-b-sub
+       :<- [:a-sub]
+       :<- [:b-sub]
+       (fn [[a b] [_]] {:a a :b b}))
+
+  This 3rd variation is syntactic sugar for the 2nd. Pairs are supplied instead
+  of an `input signals` functions. Each pair starts with a `:<-` and a subscription
+  vector follows.
+
+  For further understanding, read `/docs`, and look at the detailed comments in
+  /examples/todomvc/src/subs.cljs
+  "
+  [query-id & args]
+  (let [computation-fn (last args)
+        input-args     (butlast args) ;; may be empty, or one signal fn, or pairs of  :<- / vector
+        err-header     (str "re-frame: reg-sub for " query-id ", ")
+        inputs-fn      (case (count input-args)
+                         ;; no `inputs` function provided - give the default
+                         0 (fn
+                             ([_] app-db)
+                             ([_ _] app-db))
+
+                         ;; a single `inputs` fn
+                         1 (let [f (first input-args)]
+                             (when-not (fn? f)
+                               (console :error err-header "2nd argument expected to be an inputs function, got:" f))
+                             f)
+
+                         ;; one sugar pair
+                         2 (let [[marker vec] input-args]
+                             (when-not (= :<- marker)
+                               (console :error err-header "expected :<-, got:" marker))
+                             (fn inp-fn
+                               ([_] (subscribe vec))
+                               ([_ _] (subscribe vec))))
+
+                         ;; multiple sugar pairs
+                         (let [pairs   (partition 2 input-args)
+                               markers (map first pairs)
+                               vecs    (map last pairs)]
+                           (when-not (and (every? #{:<-} markers) (every? vector? vecs))
+                             (console :error err-header "expected pairs of :<- and vectors, got:" pairs))
+                           (fn inp-fn
+                             ([_] (map subscribe vecs))
+                             ([_ _] (map subscribe vecs)))))]
+    (register-handler
+      kind
+      query-id
+      (fn subs-handler-fn
+        ([db query-vec]
+         (let [subscriptions (inputs-fn query-vec)
+               reaction-id   (atom nil)
+               reaction      (make-reaction
+                               (fn []
+                                 (trace/with-trace {:operation (first-in-vector query-vec)
+                                                    :op-type   :sub/run
+                                                    :tags      {:query-v    query-vec
+                                                                :reaction   @reaction-id}}
+                                                   (let [subscription (computation-fn (deref-input-signals subscriptions query-id) query-vec)]
+                                                     (trace/merge-trace! {:tags {:value subscription}})
+                                                     subscription))))]
+
+           (reset! reaction-id (reagent-id reaction))
+           reaction))
+        ([db query-vec dyn-vec]
+         (let [subscriptions (inputs-fn query-vec dyn-vec)
+               reaction-id   (atom nil)
+               reaction      (make-reaction
+                               (fn []
+                                 (trace/with-trace {:operation (first-in-vector query-vec)
+                                                    :op-type   :sub/run
+                                                    :tags      {:query-v   query-vec
+                                                                :dyn-v     dyn-vec
+                                                                :reaction  @reaction-id}}
+                                                   (let [subscription (computation-fn (deref-input-signals subscriptions query-id) query-vec dyn-vec)]
+                                                     (trace/merge-trace! {:tags {:value subscription}})
+                                                     subscription))))]
+
+           (reset! reaction-id (reagent-id reaction))
+           reaction))))))
diff --git a/js/re_frame/subs.cljc.cache.json b/js/re_frame/subs.cljc.cache.json
new file mode 100644
index 0000000..36ee9d2
--- /dev/null
+++ b/js/re_frame/subs.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "]],"~:use-macros",["^ ","~$reagent-id","~$re-frame.interop","~$console","~$re-frame.loggers","~$dispose!","^6","~$add-on-dispose!","^6","~$make-reaction","^6","~$deref?","^6","~$ratom?","^6","~$debug-enabled?","^6"],"~:excludes",["~#set",[]],"~:name","~$re-frame.subs","~:imports",null,"~:requires",["^ ","~$re-frame.db","^E","^6","^6","^8","^8","~$re-frame.utils","^F","~$re-frame.registrar","^G","~$trace","~$re-frame.trace","^I","^I"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^5","^6","^7","^8","~$app-db","^E","^9","^6","^:","^6","^;","^6","~$get-handler","^G","~$first-in-vector","^F","^<","^6","^=","^6","^>","^6","~$clear-handlers","^G","~$register-handler","^G"],"~:defs",["^ ","~$to-seq",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","~:line",181,"~:column",7,"~:end-line",181,"~:end-column",13,"~:arglists",["~#list",["~$quote",["^[",[["~$x"]]]]],"~:doc","Coerces x to a seq if it isn't one already"],"^A","~$re-frame.subs/to-seq","~:variadic",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",13,"~:method-params",["^[",[["~$x"]]],"~:protocol-impl",null,"~:arglists-meta",["^[",[null,null]],"^W",1,"^V",181,"^X",181,"~:max-fixed-arity",1,"~:fn-var",true,"^Z",["^[",["^10",["^[",[["~$x"]]]]],"^11","Coerces x to a seq if it isn't one already"],"~$cache-and-return",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",42,"^W",7,"^X",42,"^Y",23,"^Z",["^[",["^10",["^[",[["~$query-v","~$dynv","~$r"]]]]],"^11","cache the reaction r"],"^A","~$re-frame.subs/cache-and-return","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",23,"^14",["^[",[["^1:","^1;","~$r"]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",42,"^X",42,"^17",3,"^18",true,"^Z",["^[",["^10",["^[",[["^1:","^1;","~$r"]]]]],"^11","cache the reaction r"],"~$deref-input-signals",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",188,"^W",8,"^X",188,"^Y",27,"~:private",true,"^Z",["^[",["^10",["^[",[["~$signals","~$query-id"]]]]]],"^1>",true,"^A","~$re-frame.subs/deref-input-signals","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",27,"^14",["^[",[["^1?","^1@"]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",188,"^X",188,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["^1?","^1@"]]]]]],"~$subscribe",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",74,"^W",7,"^X",74,"^Y",16,"^Z",["^[",["^10",["^[",[["~$query"],["^1C","^1;"]]]]],"^11","Given a `query`, returns a Reagent `reaction` which, over\n  time, reactively delivers a stream of values. So in FRP-ish terms,\n  it returns a Signal.\n\n  To obtain the returned Signal/Stream's current value, it must be `deref`ed.\n\n  `query` is a vector of at least one element. The first element is the\n  `query-id`, typically a namespaced keyword. The rest of the vector's\n  elements are optional, additional values which parameterise the query\n  performed.\n\n  `dynv` is an optional 3rd argument, `which is a vector of further input\n  signals (atoms, reactions, etc), NOT values. This argument exists for\n  historical reasons and is borderline deprecated these days.\n\n  Example Usage:\n  --------------\n\n    (subscribe [:items])\n    (subscribe [:items \"blue\" :small])\n    (subscribe [:items {:colour \"blue\"  :size :small}])\n\n  Note: for any given call to `subscribe` there must have been a previous call\n  to `reg-sub`, registering the query handler (function) for the `query-id` given.\n\n  Hint\n  ----\n\n  When used in a view function BE SURE to `deref` the returned value.\n  In fact, to avoid any mistakes, some prefer to define:\n\n     (def <sub  (comp deref re-frame.core/subscribe))\n\n  And then, within their views, they call  `(<sub [:items :small])` rather\n  than using `subscribe` directly.\n\n  De-duplication\n  --------------\n\n  XXX\n  ","~:top-fn",["^ ","^13",false,"^17",2,"^14",["^[",[["^1C"],["^1C","^1;"]]],"^Z",["^[",[["^1C"],["^1C","^1;"]]],"^16",["^[",[null,null]]]],"^A","~$re-frame.subs/subscribe","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",16,"^1D",["^ ","^13",false,"^17",2,"^14",["^[",[["^1C"],["^1C","^1;"]]],"^Z",["^[",[["^1C"],["^1C","^1;"]]],"^16",["^[",[null,null]]],"^14",["^[",[["^1C"],["^1C","^1;"]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",74,"^X",74,"^17",2,"^18",true,"^Z",["^[",[["^1C"],["^1C","^1;"]]],"^11","Given a `query`, returns a Reagent `reaction` which, over\n  time, reactively delivers a stream of values. So in FRP-ish terms,\n  it returns a Signal.\n\n  To obtain the returned Signal/Stream's current value, it must be `deref`ed.\n\n  `query` is a vector of at least one element. The first element is the\n  `query-id`, typically a namespaced keyword. The rest of the vector's\n  elements are optional, additional values which parameterise the query\n  performed.\n\n  `dynv` is an optional 3rd argument, `which is a vector of further input\n  signals (atoms, reactions, etc), NOT values. This argument exists for\n  historical reasons and is borderline deprecated these days.\n\n  Example Usage:\n  --------------\n\n    (subscribe [:items])\n    (subscribe [:items \"blue\" :small])\n    (subscribe [:items {:colour \"blue\"  :size :small}])\n\n  Note: for any given call to `subscribe` there must have been a previous call\n  to `reg-sub`, registering the query handler (function) for the `query-id` given.\n\n  Hint\n  ----\n\n  When used in a view function BE SURE to `deref` the returned value.\n  In fact, to avoid any mistakes, some prefer to define:\n\n     (def <sub  (comp deref re-frame.core/subscribe))\n\n  And then, within their views, they call  `(<sub [:items :small])` rather\n  than using `subscribe` directly.\n\n  De-duplication\n  --------------\n\n  XXX\n  "],"~$reg-sub",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",200,"^W",7,"^X",200,"^Y",14,"^Z",["^[",["^10",["^[",[["^1@","~$&","~$args"]]]]],"^11","For a given `query-id`, register a `computation` function and input `signals`.\n\n  At an abstract level, a call to this function allows you to register 'the mechanism'\n  to later fulfil a call to `(subscribe [query-id ...])`.\n\n  To say that another way, reg-sub allows you to create a template for a node\n  in the signal graph. But note: reg-sub does not cause a node to be created.\n  It simply allows you to register the template from which such a\n  node could be created, if it were needed, sometime later, when the call\n  to `subscribe` is made.\n\n  reg-sub needs three things:\n    - a `query-id`\n    - the required inputs for this node\n    - a computation function for this node\n\n  The `query-id` is always the 1st argument to reg-sub and it is typically\n  a namespaced keyword.\n\n  A computation function is always the last argument and it has this general form:\n    `(input-signals, query-vector) -> a-value`\n\n  What goes in between the 1st and last args can vary, but whatever is there will\n  define the input signals part of the template, and, as a result, it will control\n  what values the computation functions gets as a first argument.\n\n  There's 3 ways this function can be called - 3 ways to supply input signals:\n\n  1. No input signals given:\n\n     (reg-sub\n       :query-id\n       a-computation-fn)   ;; (fn [db v]  ... a-value)\n\n     The node's input signal defaults to `app-db`, and the value within `app-db` is\n     is given as the 1st argument to the computation function.\n\n  2. A signal function is supplied:\n\n     (reg-sub\n       :query-id\n       signal-fn     ;; <-- here\n       computation-fn)\n\n     When a node is created from the template, the `signal-fn` will be called and it\n     is expected to return the input signal(s) as either a singleton, if there is only\n     one, or a sequence if there are many, or a map with the signals as the values.\n\n     The values from the nominated signals will be supplied as the 1st argument to the\n     computation function - either a singleton, sequence or map of them, paralleling\n     the structure returned by the signal function.\n\n     Here, is an example signal-fn, which returns a vector of input signals.\n\n       (fn [query-vec dynamic-vec]\n         [(subscribe [:a-sub])\n          (subscribe [:b-sub])])\n\n     For that signal function, the computation function must be written\n     to expect a vector of values for its first argument.\n       (fn [[a b] _] ....)\n\n     If the signal function was simpler and returned a singleton, like this:\n        (fn [query-vec dynamic-vec]\n          (subscribe [:a-sub]))\n\n     then the computation function must be written to expect a single value\n     as the 1st argument:\n\n        (fn [a _] ...)\n\n  3. Syntax Sugar\n\n     (reg-sub\n       :a-b-sub\n       :<- [:a-sub]\n       :<- [:b-sub]\n       (fn [[a b] [_]] {:a a :b b}))\n\n  This 3rd variation is syntactic sugar for the 2nd. Pairs are supplied instead\n  of an `input signals` functions. Each pair starts with a `:<-` and a subscription\n  vector follows.\n\n  For further understanding, read `/docs`, and look at the detailed comments in\n  /examples/todomvc/src/subs.cljs\n  ","^1D",["^ ","^13",true,"^17",1,"^14",[["^[",["^1@","^1G"]]],"^Z",["^[",[["^1@","~$&","^1G"]]],"^16",["^[",[null]]]],"^A","~$re-frame.subs/reg-sub","^13",true,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",14,"^1D",["^ ","^13",true,"^17",1,"^14",[["^[",["^1@","^1G"]]],"^Z",["^[",[["^1@","~$&","^1G"]]],"^16",["^[",[null]]],"^14",[["^[",["^1@","^1G"]]],"^15",null,"^16",["^[",[null]],"^W",1,"^V",200,"^X",200,"^17",1,"^18",true,"^Z",["^[",[["^1@","~$&","^1G"]]],"^11","For a given `query-id`, register a `computation` function and input `signals`.\n\n  At an abstract level, a call to this function allows you to register 'the mechanism'\n  to later fulfil a call to `(subscribe [query-id ...])`.\n\n  To say that another way, reg-sub allows you to create a template for a node\n  in the signal graph. But note: reg-sub does not cause a node to be created.\n  It simply allows you to register the template from which such a\n  node could be created, if it were needed, sometime later, when the call\n  to `subscribe` is made.\n\n  reg-sub needs three things:\n    - a `query-id`\n    - the required inputs for this node\n    - a computation function for this node\n\n  The `query-id` is always the 1st argument to reg-sub and it is typically\n  a namespaced keyword.\n\n  A computation function is always the last argument and it has this general form:\n    `(input-signals, query-vector) -> a-value`\n\n  What goes in between the 1st and last args can vary, but whatever is there will\n  define the input signals part of the template, and, as a result, it will control\n  what values the computation functions gets as a first argument.\n\n  There's 3 ways this function can be called - 3 ways to supply input signals:\n\n  1. No input signals given:\n\n     (reg-sub\n       :query-id\n       a-computation-fn)   ;; (fn [db v]  ... a-value)\n\n     The node's input signal defaults to `app-db`, and the value within `app-db` is\n     is given as the 1st argument to the computation function.\n\n  2. A signal function is supplied:\n\n     (reg-sub\n       :query-id\n       signal-fn     ;; <-- here\n       computation-fn)\n\n     When a node is created from the template, the `signal-fn` will be called and it\n     is expected to return the input signal(s) as either a singleton, if there is only\n     one, or a sequence if there are many, or a map with the signals as the values.\n\n     The values from the nominated signals will be supplied as the 1st argument to the\n     computation function - either a singleton, sequence or map of them, paralleling\n     the structure returned by the signal function.\n\n     Here, is an example signal-fn, which returns a vector of input signals.\n\n       (fn [query-vec dynamic-vec]\n         [(subscribe [:a-sub])\n          (subscribe [:b-sub])])\n\n     For that signal function, the computation function must be written\n     to expect a vector of values for its first argument.\n       (fn [[a b] _] ....)\n\n     If the signal function was simpler and returned a singleton, like this:\n        (fn [query-vec dynamic-vec]\n          (subscribe [:a-sub]))\n\n     then the computation function must be written to expect a single value\n     as the 1st argument:\n\n        (fn [a _] ...)\n\n  3. Syntax Sugar\n\n     (reg-sub\n       :a-b-sub\n       :<- [:a-sub]\n       :<- [:b-sub]\n       (fn [[a b] [_]] {:a a :b b}))\n\n  This 3rd variation is syntactic sugar for the 2nd. Pairs are supplied instead\n  of an `input signals` functions. Each pair starts with a `:<-` and a subscription\n  vector follows.\n\n  For further understanding, read `/docs`, and look at the detailed comments in\n  /examples/todomvc/src/subs.cljs\n  "],"~$query->reaction",["^ ","^A","~$re-frame.subs/query->reaction","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",18,"^W",1,"^X",18,"^Y",21,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",18,"^W",6,"^X",18,"^Y",21],"~:tag","~$any"],"~$clear-all-handlers!",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",36,"^W",7,"^X",36,"^Y",26,"^Z",["^[",["^10",["^[",[[]]]]],"^11","Unregisters all existing subscription handlers"],"^A","~$re-frame.subs/clear-all-handlers!","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",26,"^14",["^[",[[]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",36,"^X",36,"^17",0,"^18",true,"^Z",["^[",["^10",["^[",[[]]]]],"^11","Unregisters all existing subscription handlers"],"~$cache-lookup",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",65,"^W",7,"^X",65,"^Y",19,"^Z",["^[",["^10",["^[",[["^1:"],["^1:","~$dyn-v"]]]]],"^1D",["^ ","^13",false,"^17",2,"^14",["^[",[["^1:"],["^1:","^1P"]]],"^Z",["^[",[["^1:"],["^1:","^1P"]]],"^16",["^[",[null,null]]]],"^A","~$re-frame.subs/cache-lookup","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",19,"^1D",["^ ","^13",false,"^17",2,"^14",["^[",[["^1:"],["^1:","^1P"]]],"^Z",["^[",[["^1:"],["^1:","^1P"]]],"^16",["^[",[null,null]]],"^14",["^[",[["^1:"],["^1:","^1P"]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",65,"^X",65,"^17",2,"^18",true,"^Z",["^[",[["^1:"],["^1:","^1P"]]]],"~$map-vals",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",163,"^W",8,"^X",163,"^Y",16,"^1>",true,"^Z",["^[",["^10",["^[",[["~$f","~$m"]]]]],"^11","Returns a new version of 'm' in which 'f' has been applied to each value.\n  (map-vals inc {:a 4, :b 2}) => {:a 5, :b 3}"],"^1>",true,"^A","~$re-frame.subs/map-vals","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",16,"^14",["^[",[["~$f","~$m"]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",163,"^X",163,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["~$f","~$m"]]]]],"^11","Returns a new version of 'm' in which 'f' has been applied to each value.\n  (map-vals inc {:a 4, :b 2}) => {:a 5, :b 3}"],"~$kind",["^ ","^A","~$re-frame.subs/kind","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",10,"^W",1,"^X",10,"^Y",10,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",10,"^W",6,"^X",10,"^Y",10],"^1K","~$cljs.core/Keyword"],"~$clear-subscription-cache!",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",20,"^W",7,"^X",20,"^Y",32,"^Z",["^[",["^10",["^[",[[]]]]],"^11","Causes all subscriptions to be removed from the cache.\n  Does this by:\n     1. running on-dispose on all cached subscriptions\n     2. These on-dispose will then do the removal of themselves.\n\n  This is a development time tool. Useful when reloading Figwheel code\n  after a React exception, because React components won't have been\n  cleaned up properly. And this, in turn, means the subscriptions within those\n  components won't have been cleaned up correctly. So this forces the issue."],"^A","~$re-frame.subs/clear-subscription-cache!","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",32,"^14",["^[",[[]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",20,"^X",20,"^17",0,"^18",true,"^Z",["^[",["^10",["^[",[[]]]]],"^11","Causes all subscriptions to be removed from the cache.\n  Does this by:\n     1. running on-dispose on all cached subscriptions\n     2. These on-dispose will then do the removal of themselves.\n\n  This is a development time tool. Useful when reloading Figwheel code\n  after a React exception, because React components won't have been\n  cleaned up properly. And this, in turn, means the subscriptions within those\n  components won't have been cleaned up correctly. So this forces the issue."],"~$map-signals",["^ ","^S",null,"^T",["^ ","^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^V",171,"^W",7,"^X",171,"^Y",18,"^Z",["^[",["^10",["^[",[["~$f","^1?"]]]]],"^11","Runs f over signals. Signals may take several\n  forms, this function handles all of them."],"^A","~$re-frame.subs/map-signals","^13",false,"^U","/home/julien/.cljs/.aot_cache/1.10.329/910BA2B/re_frame/subs.cljc","^Y",18,"^14",["^[",[["~$f","^1?"]]],"^15",null,"^16",["^[",[null,null]],"^W",1,"^V",171,"^X",171,"^17",2,"^18",true,"^Z",["^[",["^10",["^[",[["~$f","^1?"]]]]],"^11","Runs f over signals. Signals may take several\n  forms, this function handles all of them."]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^H","^I","^I","^I"],"~:cljs.analyzer/constants",["^ ","~:seen",["^@",["~:dyn-v","~:tags","~:sub/run","~:else","~:<-","~:sub","~:sub/create","~:warn","~:value","~:operation","~:start","~:duration","~:query-v","~:cached?","~:sub/dispose","~:error","~:input-signals","~:end","~:reaction","~:op-type"]],"~:order",["^28","^2:","^2<","^2F","^24","^2A","^2?","^2E","^2=","^2>","^2D","^29","^2@","^2B","^23","^26","^2C","^27","^25","^2;"]],"^11",null]
\ No newline at end of file
diff --git a/js/re_frame/subs.js b/js/re_frame/subs.js
new file mode 100644
index 0000000..fee7cec
--- /dev/null
+++ b/js/re_frame/subs.js
@@ -0,0 +1,901 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.subs');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.db');
+goog.require('re_frame.interop');
+goog.require('re_frame.loggers');
+goog.require('re_frame.utils');
+goog.require('re_frame.registrar');
+goog.require('re_frame.trace');
+re_frame.subs.kind = cljs.core.cst$kw$sub;
+if(cljs.core.truth_((re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1 ? re_frame.registrar.kinds.cljs$core$IFn$_invoke$arity$1(re_frame.subs.kind) : re_frame.registrar.kinds.call(null,re_frame.subs.kind)))){
+} else {
+throw (new Error("Assert failed: (re-frame.registrar/kinds kind)"));
+}
+re_frame.subs.query__GT_reaction = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+/**
+ * Causes all subscriptions to be removed from the cache.
+ *   Does this by:
+ *   1. running on-dispose on all cached subscriptions
+ *   2. These on-dispose will then do the removal of themselves.
+ * 
+ *   This is a development time tool. Useful when reloading Figwheel code
+ *   after a React exception, because React components won't have been
+ *   cleaned up properly. And this, in turn, means the subscriptions within those
+ *   components won't have been cleaned up correctly. So this forces the issue.
+ */
+re_frame.subs.clear_subscription_cache_BANG_ = (function re_frame$subs$clear_subscription_cache_BANG_(){
+var seq__5187_5197 = cljs.core.seq(cljs.core.deref(re_frame.subs.query__GT_reaction));
+var chunk__5188_5198 = null;
+var count__5189_5199 = (0);
+var i__5190_5200 = (0);
+while(true){
+if((i__5190_5200 < count__5189_5199)){
+var vec__5191_5201 = chunk__5188_5198.cljs$core$IIndexed$_nth$arity$2(null,i__5190_5200);
+var k_5202 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5191_5201,(0),null);
+var rxn_5203 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5191_5201,(1),null);
+re_frame.interop.dispose_BANG_(rxn_5203);
+
+
+var G__5204 = seq__5187_5197;
+var G__5205 = chunk__5188_5198;
+var G__5206 = count__5189_5199;
+var G__5207 = (i__5190_5200 + (1));
+seq__5187_5197 = G__5204;
+chunk__5188_5198 = G__5205;
+count__5189_5199 = G__5206;
+i__5190_5200 = G__5207;
+continue;
+} else {
+var temp__5457__auto___5208 = cljs.core.seq(seq__5187_5197);
+if(temp__5457__auto___5208){
+var seq__5187_5209__$1 = temp__5457__auto___5208;
+if(cljs.core.chunked_seq_QMARK_(seq__5187_5209__$1)){
+var c__4338__auto___5210 = cljs.core.chunk_first(seq__5187_5209__$1);
+var G__5211 = cljs.core.chunk_rest(seq__5187_5209__$1);
+var G__5212 = c__4338__auto___5210;
+var G__5213 = cljs.core.count(c__4338__auto___5210);
+var G__5214 = (0);
+seq__5187_5197 = G__5211;
+chunk__5188_5198 = G__5212;
+count__5189_5199 = G__5213;
+i__5190_5200 = G__5214;
+continue;
+} else {
+var vec__5194_5215 = cljs.core.first(seq__5187_5209__$1);
+var k_5216 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5194_5215,(0),null);
+var rxn_5217 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5194_5215,(1),null);
+re_frame.interop.dispose_BANG_(rxn_5217);
+
+
+var G__5218 = cljs.core.next(seq__5187_5209__$1);
+var G__5219 = null;
+var G__5220 = (0);
+var G__5221 = (0);
+seq__5187_5197 = G__5218;
+chunk__5188_5198 = G__5219;
+count__5189_5199 = G__5220;
+i__5190_5200 = G__5221;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+if(cljs.core.truth_(cljs.core.not_empty(cljs.core.deref(re_frame.subs.query__GT_reaction)))){
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Subscription cache should be empty after clearing it."], 0));
+} else {
+return null;
+}
+});
+/**
+ * Unregisters all existing subscription handlers
+ */
+re_frame.subs.clear_all_handlers_BANG_ = (function re_frame$subs$clear_all_handlers_BANG_(){
+re_frame.registrar.clear_handlers.cljs$core$IFn$_invoke$arity$1(re_frame.subs.kind);
+
+return re_frame.subs.clear_subscription_cache_BANG_();
+});
+/**
+ * cache the reaction r
+ */
+re_frame.subs.cache_and_return = (function re_frame$subs$cache_and_return(query_v,dynv,r){
+var cache_key = new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [query_v,dynv], null);
+re_frame.interop.add_on_dispose_BANG_(r,((function (cache_key){
+return (function (){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_5222 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$operation,re_frame.utils.first_in_vector(query_v),cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$sub_SLASH_dispose,cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$query_DASH_v,query_v,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(r)], null)], null));
+
+try{try{return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(re_frame.subs.query__GT_reaction,((function (_STAR_current_trace_STAR_5222,cache_key){
+return (function (query_cache){
+if(((cljs.core.contains_QMARK_(query_cache,cache_key)) && ((r === cljs.core.get.cljs$core$IFn$_invoke$arity$2(query_cache,cache_key))))){
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(query_cache,cache_key);
+} else {
+return query_cache;
+}
+});})(_STAR_current_trace_STAR_5222,cache_key))
+);
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5223 = re_frame.interop.now();
+var duration__4440__auto___5224 = (end__4439__auto___5223 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5224,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5223);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5222;
+}} else {
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(re_frame.subs.query__GT_reaction,((function (cache_key){
+return (function (query_cache){
+if(((cljs.core.contains_QMARK_(query_cache,cache_key)) && ((r === cljs.core.get.cljs$core$IFn$_invoke$arity$2(query_cache,cache_key))))){
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(query_cache,cache_key);
+} else {
+return query_cache;
+}
+});})(cache_key))
+);
+}
+});})(cache_key))
+);
+
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(re_frame.subs.query__GT_reaction,((function (cache_key){
+return (function (query_cache){
+if(re_frame.interop.debug_enabled_QMARK_){
+if(cljs.core.contains_QMARK_(query_cache,cache_key)){
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: Adding a new subscription to the cache while there is an existing subscription in the cache",cache_key], 0));
+} else {
+}
+} else {
+}
+
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(query_cache,cache_key,r);
+});})(cache_key))
+);
+
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5225 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(r)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(r)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5225;
+
+} else {
+}
+
+return r;
+});
+re_frame.subs.cache_lookup = (function re_frame$subs$cache_lookup(var_args){
+var G__5227 = arguments.length;
+switch (G__5227) {
+case 1:
+return re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$1 = (function (query_v){
+return re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$2(query_v,cljs.core.PersistentVector.EMPTY);
+});
+
+re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$2 = (function (query_v,dyn_v){
+return cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(re_frame.subs.query__GT_reaction),new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [query_v,dyn_v], null));
+});
+
+re_frame.subs.cache_lookup.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Given a `query`, returns a Reagent `reaction` which, over
+ *   time, reactively delivers a stream of values. So in FRP-ish terms,
+ *   it returns a Signal.
+ * 
+ *   To obtain the returned Signal/Stream's current value, it must be `deref`ed.
+ * 
+ *   `query` is a vector of at least one element. The first element is the
+ *   `query-id`, typically a namespaced keyword. The rest of the vector's
+ *   elements are optional, additional values which parameterise the query
+ *   performed.
+ * 
+ *   `dynv` is an optional 3rd argument, `which is a vector of further input
+ *   signals (atoms, reactions, etc), NOT values. This argument exists for
+ *   historical reasons and is borderline deprecated these days.
+ * 
+ *   Example Usage:
+ *   --------------
+ * 
+ *  (subscribe [:items])
+ *  (subscribe [:items "blue" :small])
+ *  (subscribe [:items {:colour "blue"  :size :small}])
+ * 
+ *   Note: for any given call to `subscribe` there must have been a previous call
+ *   to `reg-sub`, registering the query handler (function) for the `query-id` given.
+ * 
+ *   Hint
+ *   ----
+ * 
+ *   When used in a view function BE SURE to `deref` the returned value.
+ *   In fact, to avoid any mistakes, some prefer to define:
+ * 
+ *   (def <sub  (comp deref re-frame.core/subscribe))
+ * 
+ *   And then, within their views, they call  `(<sub [:items :small])` rather
+ *   than using `subscribe` directly.
+ * 
+ *   De-duplication
+ *   --------------
+ * 
+ *   XXX
+ *   
+ */
+re_frame.subs.subscribe = (function re_frame$subs$subscribe(var_args){
+var G__5230 = arguments.length;
+switch (G__5230) {
+case 1:
+return re_frame.subs.subscribe.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return re_frame.subs.subscribe.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+re_frame.subs.subscribe.cljs$core$IFn$_invoke$arity$1 = (function (query){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_5231 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$operation,re_frame.utils.first_in_vector(query),cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$sub_SLASH_create,cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$query_DASH_v,query], null)], null));
+
+try{try{var temp__5455__auto__ = re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$1(query);
+if(cljs.core.truth_(temp__5455__auto__)){
+var cached = temp__5455__auto__;
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5240 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5240;
+
+} else {
+}
+
+return cached;
+} else {
+var query_id = re_frame.utils.first_in_vector(query);
+var handler_fn = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(re_frame.subs.kind,query_id);
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5241 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5241;
+
+} else {
+}
+
+if((handler_fn == null)){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5242 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5242;
+
+} else {
+}
+
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([["re-frame: no subscription handler registered for: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(query_id),". Returning a nil subscription."].join('')], 0));
+} else {
+return re_frame.subs.cache_and_return(query,cljs.core.PersistentVector.EMPTY,(handler_fn.cljs$core$IFn$_invoke$arity$2 ? handler_fn.cljs$core$IFn$_invoke$arity$2(re_frame.db.app_db,query) : handler_fn.call(null,re_frame.db.app_db,query)));
+}
+}
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5243 = re_frame.interop.now();
+var duration__4440__auto___5244 = (end__4439__auto___5243 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5244,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5243);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5231;
+}} else {
+var temp__5455__auto__ = re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$1(query);
+if(cljs.core.truth_(temp__5455__auto__)){
+var cached = temp__5455__auto__;
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5245 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5245;
+
+} else {
+}
+
+return cached;
+} else {
+var query_id = re_frame.utils.first_in_vector(query);
+var handler_fn = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(re_frame.subs.kind,query_id);
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5246 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5246;
+
+} else {
+}
+
+if((handler_fn == null)){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5247 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5247;
+
+} else {
+}
+
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([["re-frame: no subscription handler registered for: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(query_id),". Returning a nil subscription."].join('')], 0));
+} else {
+return re_frame.subs.cache_and_return(query,cljs.core.PersistentVector.EMPTY,(handler_fn.cljs$core$IFn$_invoke$arity$2 ? handler_fn.cljs$core$IFn$_invoke$arity$2(re_frame.db.app_db,query) : handler_fn.call(null,re_frame.db.app_db,query)));
+}
+}
+}
+});
+
+re_frame.subs.subscribe.cljs$core$IFn$_invoke$arity$2 = (function (query,dynv){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_5232 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$operation,re_frame.utils.first_in_vector(query),cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$sub_SLASH_create,cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$query_DASH_v,query,cljs.core.cst$kw$dyn_DASH_v,dynv], null)], null));
+
+try{try{var temp__5455__auto__ = re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$2(query,dynv);
+if(cljs.core.truth_(temp__5455__auto__)){
+var cached = temp__5455__auto__;
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5248 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5248;
+
+} else {
+}
+
+return cached;
+} else {
+var query_id = re_frame.utils.first_in_vector(query);
+var handler_fn = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(re_frame.subs.kind,query_id);
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5249 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5249;
+
+} else {
+}
+
+if(re_frame.interop.debug_enabled_QMARK_){
+var temp__5457__auto___5250 = cljs.core.not_empty(cljs.core.remove.cljs$core$IFn$_invoke$arity$2(re_frame.interop.ratom_QMARK_,dynv));
+if(cljs.core.truth_(temp__5457__auto___5250)){
+var not_reactive_5251 = temp__5457__auto___5250;
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: your subscription's dynamic parameters that don't implement IReactiveAtom:",not_reactive_5251], 0));
+} else {
+}
+} else {
+}
+
+if((handler_fn == null)){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5252 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5252;
+
+} else {
+}
+
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([["re-frame: no subscription handler registered for: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(query_id),". Returning a nil subscription."].join('')], 0));
+} else {
+var dyn_vals = re_frame.interop.make_reaction(((function (query_id,handler_fn,temp__5455__auto__,_STAR_current_trace_STAR_5232){
+return (function (){
+return cljs.core.mapv.cljs$core$IFn$_invoke$arity$2(cljs.core.deref,dynv);
+});})(query_id,handler_fn,temp__5455__auto__,_STAR_current_trace_STAR_5232))
+);
+var sub = re_frame.interop.make_reaction(((function (dyn_vals,query_id,handler_fn,temp__5455__auto__,_STAR_current_trace_STAR_5232){
+return (function (){
+var G__5233 = re_frame.db.app_db;
+var G__5234 = query;
+var G__5235 = cljs.core.deref(dyn_vals);
+return (handler_fn.cljs$core$IFn$_invoke$arity$3 ? handler_fn.cljs$core$IFn$_invoke$arity$3(G__5233,G__5234,G__5235) : handler_fn.call(null,G__5233,G__5234,G__5235));
+});})(dyn_vals,query_id,handler_fn,temp__5455__auto__,_STAR_current_trace_STAR_5232))
+);
+return re_frame.subs.cache_and_return(query,dynv,re_frame.interop.make_reaction(((function (dyn_vals,sub,query_id,handler_fn,temp__5455__auto__,_STAR_current_trace_STAR_5232){
+return (function (){
+return cljs.core.deref(cljs.core.deref(sub));
+});})(dyn_vals,sub,query_id,handler_fn,temp__5455__auto__,_STAR_current_trace_STAR_5232))
+));
+}
+}
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5253 = re_frame.interop.now();
+var duration__4440__auto___5254 = (end__4439__auto___5253 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5254,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5253);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5232;
+}} else {
+var temp__5455__auto__ = re_frame.subs.cache_lookup.cljs$core$IFn$_invoke$arity$2(query,dynv);
+if(cljs.core.truth_(temp__5455__auto__)){
+var cached = temp__5455__auto__;
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5255 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$cached_QMARK_,true,cljs.core.cst$kw$reaction,re_frame.interop.reagent_id(cached)], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5255;
+
+} else {
+}
+
+return cached;
+} else {
+var query_id = re_frame.utils.first_in_vector(query);
+var handler_fn = re_frame.registrar.get_handler.cljs$core$IFn$_invoke$arity$2(re_frame.subs.kind,query_id);
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5256 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cached_QMARK_,false], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5256;
+
+} else {
+}
+
+if(re_frame.interop.debug_enabled_QMARK_){
+var temp__5457__auto___5257 = cljs.core.not_empty(cljs.core.remove.cljs$core$IFn$_invoke$arity$2(re_frame.interop.ratom_QMARK_,dynv));
+if(cljs.core.truth_(temp__5457__auto___5257)){
+var not_reactive_5258 = temp__5457__auto___5257;
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: your subscription's dynamic parameters that don't implement IReactiveAtom:",not_reactive_5258], 0));
+} else {
+}
+} else {
+}
+
+if((handler_fn == null)){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5259 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$error,true], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5259;
+
+} else {
+}
+
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([["re-frame: no subscription handler registered for: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(query_id),". Returning a nil subscription."].join('')], 0));
+} else {
+var dyn_vals = re_frame.interop.make_reaction(((function (query_id,handler_fn,temp__5455__auto__){
+return (function (){
+return cljs.core.mapv.cljs$core$IFn$_invoke$arity$2(cljs.core.deref,dynv);
+});})(query_id,handler_fn,temp__5455__auto__))
+);
+var sub = re_frame.interop.make_reaction(((function (dyn_vals,query_id,handler_fn,temp__5455__auto__){
+return (function (){
+var G__5236 = re_frame.db.app_db;
+var G__5237 = query;
+var G__5238 = cljs.core.deref(dyn_vals);
+return (handler_fn.cljs$core$IFn$_invoke$arity$3 ? handler_fn.cljs$core$IFn$_invoke$arity$3(G__5236,G__5237,G__5238) : handler_fn.call(null,G__5236,G__5237,G__5238));
+});})(dyn_vals,query_id,handler_fn,temp__5455__auto__))
+);
+return re_frame.subs.cache_and_return(query,dynv,re_frame.interop.make_reaction(((function (dyn_vals,sub,query_id,handler_fn,temp__5455__auto__){
+return (function (){
+return cljs.core.deref(cljs.core.deref(sub));
+});})(dyn_vals,sub,query_id,handler_fn,temp__5455__auto__))
+));
+}
+}
+}
+});
+
+re_frame.subs.subscribe.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns a new version of 'm' in which 'f' has been applied to each value.
+ *   (map-vals inc {:a 4, :b 2}) => {:a 5, :b 3}
+ */
+re_frame.subs.map_vals = (function re_frame$subs$map_vals(f,m){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$3(cljs.core.empty(m),cljs.core.map.cljs$core$IFn$_invoke$arity$1((function (p__5260){
+var vec__5261 = p__5260;
+var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5261,(0),null);
+var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5261,(1),null);
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(v) : f.call(null,v))], null);
+})),m);
+});
+/**
+ * Runs f over signals. Signals may take several
+ *   forms, this function handles all of them.
+ */
+re_frame.subs.map_signals = (function re_frame$subs$map_signals(f,signals){
+if(cljs.core.sequential_QMARK_(signals)){
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,signals);
+} else {
+if(cljs.core.map_QMARK_(signals)){
+return re_frame.subs.map_vals(f,signals);
+} else {
+if(cljs.core.truth_(re_frame.interop.deref_QMARK_(signals))){
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(signals) : f.call(null,signals));
+} else {
+return cljs.core.List.EMPTY;
+
+}
+}
+}
+});
+/**
+ * Coerces x to a seq if it isn't one already
+ */
+re_frame.subs.to_seq = (function re_frame$subs$to_seq(x){
+if(cljs.core.sequential_QMARK_(x)){
+return x;
+} else {
+return (new cljs.core.List(null,x,null,(1),null));
+}
+});
+re_frame.subs.deref_input_signals = (function re_frame$subs$deref_input_signals(signals,query_id){
+var dereffed_signals = re_frame.subs.map_signals(cljs.core.deref,signals);
+if(cljs.core.sequential_QMARK_(signals)){
+cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.deref,signals);
+} else {
+if(cljs.core.map_QMARK_(signals)){
+re_frame.subs.map_vals(cljs.core.deref,signals);
+} else {
+if(cljs.core.truth_(re_frame.interop.deref_QMARK_(signals))){
+cljs.core.deref(signals);
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: in the reg-sub for",query_id,", the input-signals function returns:",signals], 0));
+
+}
+}
+}
+
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5264 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$input_DASH_signals,cljs.core.doall.cljs$core$IFn$_invoke$arity$1(re_frame.subs.to_seq(re_frame.subs.map_signals(re_frame.interop.reagent_id,signals)))], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$input_DASH_signals,cljs.core.doall.cljs$core$IFn$_invoke$arity$1(re_frame.subs.to_seq(re_frame.subs.map_signals(re_frame.interop.reagent_id,signals)))], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5264;
+
+} else {
+}
+
+return dereffed_signals;
+});
+/**
+ * For a given `query-id`, register a `computation` function and input `signals`.
+ * 
+ *   At an abstract level, a call to this function allows you to register 'the mechanism'
+ *   to later fulfil a call to `(subscribe [query-id ...])`.
+ * 
+ *   To say that another way, reg-sub allows you to create a template for a node
+ *   in the signal graph. But note: reg-sub does not cause a node to be created.
+ *   It simply allows you to register the template from which such a
+ *   node could be created, if it were needed, sometime later, when the call
+ *   to `subscribe` is made.
+ * 
+ *   reg-sub needs three things:
+ *  - a `query-id`
+ *  - the required inputs for this node
+ *  - a computation function for this node
+ * 
+ *   The `query-id` is always the 1st argument to reg-sub and it is typically
+ *   a namespaced keyword.
+ * 
+ *   A computation function is always the last argument and it has this general form:
+ *  `(input-signals, query-vector) -> a-value`
+ * 
+ *   What goes in between the 1st and last args can vary, but whatever is there will
+ *   define the input signals part of the template, and, as a result, it will control
+ *   what values the computation functions gets as a first argument.
+ * 
+ *   There's 3 ways this function can be called - 3 ways to supply input signals:
+ * 
+ *   1. No input signals given:
+ * 
+ *   (reg-sub
+ *     :query-id
+ *     a-computation-fn)   ;; (fn [db v]  ... a-value)
+ * 
+ *   The node's input signal defaults to `app-db`, and the value within `app-db` is
+ *   is given as the 1st argument to the computation function.
+ * 
+ *   2. A signal function is supplied:
+ * 
+ *   (reg-sub
+ *     :query-id
+ *     signal-fn     ;; <-- here
+ *     computation-fn)
+ * 
+ *   When a node is created from the template, the `signal-fn` will be called and it
+ *   is expected to return the input signal(s) as either a singleton, if there is only
+ *   one, or a sequence if there are many, or a map with the signals as the values.
+ * 
+ *   The values from the nominated signals will be supplied as the 1st argument to the
+ *   computation function - either a singleton, sequence or map of them, paralleling
+ *   the structure returned by the signal function.
+ * 
+ *   Here, is an example signal-fn, which returns a vector of input signals.
+ * 
+ *     (fn [query-vec dynamic-vec]
+ *       [(subscribe [:a-sub])
+ *        (subscribe [:b-sub])])
+ * 
+ *   For that signal function, the computation function must be written
+ *   to expect a vector of values for its first argument.
+ *     (fn [[a b] _] ....)
+ * 
+ *   If the signal function was simpler and returned a singleton, like this:
+ *      (fn [query-vec dynamic-vec]
+ *        (subscribe [:a-sub]))
+ * 
+ *   then the computation function must be written to expect a single value
+ *   as the 1st argument:
+ * 
+ *      (fn [a _] ...)
+ * 
+ *   3. Syntax Sugar
+ * 
+ *   (reg-sub
+ *     :a-b-sub
+ *     :<- [:a-sub]
+ *     :<- [:b-sub]
+ *     (fn [[a b] [_]] {:a a :b b}))
+ * 
+ *   This 3rd variation is syntactic sugar for the 2nd. Pairs are supplied instead
+ *   of an `input signals` functions. Each pair starts with a `:<-` and a subscription
+ *   vector follows.
+ * 
+ *   For further understanding, read `/docs`, and look at the detailed comments in
+ *   /examples/todomvc/src/subs.cljs
+ *   
+ */
+re_frame.subs.reg_sub = (function re_frame$subs$reg_sub(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___5283 = arguments.length;
+var i__4519__auto___5284 = (0);
+while(true){
+if((i__4519__auto___5284 < len__4518__auto___5283)){
+args__4521__auto__.push((arguments[i__4519__auto___5284]));
+
+var G__5285 = (i__4519__auto___5284 + (1));
+i__4519__auto___5284 = G__5285;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return re_frame.subs.reg_sub.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+re_frame.subs.reg_sub.cljs$core$IFn$_invoke$arity$variadic = (function (query_id,args){
+var computation_fn = cljs.core.last(args);
+var input_args = cljs.core.butlast(args);
+var err_header = ["re-frame: reg-sub for ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(query_id),", "].join('');
+var inputs_fn = (function (){var G__5267 = cljs.core.count(input_args);
+switch (G__5267) {
+case (0):
+return ((function (G__5267,computation_fn,input_args,err_header){
+return (function() {
+var G__5287 = null;
+var G__5287__1 = (function (_){
+return re_frame.db.app_db;
+});
+var G__5287__2 = (function (_,___$1){
+return re_frame.db.app_db;
+});
+G__5287 = function(_,___$1){
+switch(arguments.length){
+case 1:
+return G__5287__1.call(this,_);
+case 2:
+return G__5287__2.call(this,_,___$1);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__5287.cljs$core$IFn$_invoke$arity$1 = G__5287__1;
+G__5287.cljs$core$IFn$_invoke$arity$2 = G__5287__2;
+return G__5287;
+})()
+;})(G__5267,computation_fn,input_args,err_header))
+
+break;
+case (1):
+var f = cljs.core.first(input_args);
+if(cljs.core.fn_QMARK_(f)){
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([err_header,"2nd argument expected to be an inputs function, got:",f], 0));
+}
+
+return f;
+
+break;
+case (2):
+var vec__5268 = input_args;
+var marker = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5268,(0),null);
+var vec = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__5268,(1),null);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$_LT__DASH_,marker)){
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([err_header,"expected :<-, got:",marker], 0));
+}
+
+return ((function (vec__5268,marker,vec,G__5267,computation_fn,input_args,err_header){
+return (function() {
+var re_frame$subs$inp_fn = null;
+var re_frame$subs$inp_fn__1 = (function (_){
+return re_frame.subs.subscribe.cljs$core$IFn$_invoke$arity$1(vec);
+});
+var re_frame$subs$inp_fn__2 = (function (_,___$1){
+return re_frame.subs.subscribe.cljs$core$IFn$_invoke$arity$1(vec);
+});
+re_frame$subs$inp_fn = function(_,___$1){
+switch(arguments.length){
+case 1:
+return re_frame$subs$inp_fn__1.call(this,_);
+case 2:
+return re_frame$subs$inp_fn__2.call(this,_,___$1);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+re_frame$subs$inp_fn.cljs$core$IFn$_invoke$arity$1 = re_frame$subs$inp_fn__1;
+re_frame$subs$inp_fn.cljs$core$IFn$_invoke$arity$2 = re_frame$subs$inp_fn__2;
+return re_frame$subs$inp_fn;
+})()
+;})(vec__5268,marker,vec,G__5267,computation_fn,input_args,err_header))
+
+break;
+default:
+var pairs = cljs.core.partition.cljs$core$IFn$_invoke$arity$2((2),input_args);
+var markers = cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.first,pairs);
+var vecs = cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.last,pairs);
+if(((cljs.core.every_QMARK_(new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$_LT__DASH_,null], null), null),markers)) && (cljs.core.every_QMARK_(cljs.core.vector_QMARK_,vecs)))){
+} else {
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([err_header,"expected pairs of :<- and vectors, got:",pairs], 0));
+}
+
+return ((function (pairs,markers,vecs,G__5267,computation_fn,input_args,err_header){
+return (function() {
+var re_frame$subs$inp_fn = null;
+var re_frame$subs$inp_fn__1 = (function (_){
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(re_frame.subs.subscribe,vecs);
+});
+var re_frame$subs$inp_fn__2 = (function (_,___$1){
+return cljs.core.map.cljs$core$IFn$_invoke$arity$2(re_frame.subs.subscribe,vecs);
+});
+re_frame$subs$inp_fn = function(_,___$1){
+switch(arguments.length){
+case 1:
+return re_frame$subs$inp_fn__1.call(this,_);
+case 2:
+return re_frame$subs$inp_fn__2.call(this,_,___$1);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+re_frame$subs$inp_fn.cljs$core$IFn$_invoke$arity$1 = re_frame$subs$inp_fn__1;
+re_frame$subs$inp_fn.cljs$core$IFn$_invoke$arity$2 = re_frame$subs$inp_fn__2;
+return re_frame$subs$inp_fn;
+})()
+;})(pairs,markers,vecs,G__5267,computation_fn,input_args,err_header))
+
+}
+})();
+return re_frame.registrar.register_handler(re_frame.subs.kind,query_id,((function (computation_fn,input_args,err_header,inputs_fn){
+return (function() {
+var re_frame$subs$subs_handler_fn = null;
+var re_frame$subs$subs_handler_fn__2 = (function (db,query_vec){
+var subscriptions = (inputs_fn.cljs$core$IFn$_invoke$arity$1 ? inputs_fn.cljs$core$IFn$_invoke$arity$1(query_vec) : inputs_fn.call(null,query_vec));
+var reaction_id = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(null);
+var reaction = re_frame.interop.make_reaction(((function (subscriptions,reaction_id,computation_fn,input_args,err_header,inputs_fn){
+return (function (){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_5271 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$operation,re_frame.utils.first_in_vector(query_vec),cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$sub_SLASH_run,cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$query_DASH_v,query_vec,cljs.core.cst$kw$reaction,cljs.core.deref(reaction_id)], null)], null));
+
+try{try{var subscription = (function (){var G__5272 = re_frame.subs.deref_input_signals(subscriptions,query_id);
+var G__5273 = query_vec;
+return (computation_fn.cljs$core$IFn$_invoke$arity$2 ? computation_fn.cljs$core$IFn$_invoke$arity$2(G__5272,G__5273) : computation_fn.call(null,G__5272,G__5273));
+})();
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5288 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5288;
+
+} else {
+}
+
+return subscription;
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5289 = re_frame.interop.now();
+var duration__4440__auto___5290 = (end__4439__auto___5289 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5290,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5289);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5271;
+}} else {
+var subscription = (function (){var G__5274 = re_frame.subs.deref_input_signals(subscriptions,query_id);
+var G__5275 = query_vec;
+return (computation_fn.cljs$core$IFn$_invoke$arity$2 ? computation_fn.cljs$core$IFn$_invoke$arity$2(G__5274,G__5275) : computation_fn.call(null,G__5274,G__5275));
+})();
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5291 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5291;
+
+} else {
+}
+
+return subscription;
+}
+});})(subscriptions,reaction_id,computation_fn,input_args,err_header,inputs_fn))
+);
+cljs.core.reset_BANG_(reaction_id,re_frame.interop.reagent_id(reaction));
+
+return reaction;
+});
+var re_frame$subs$subs_handler_fn__3 = (function (db,query_vec,dyn_vec){
+var subscriptions = (inputs_fn.cljs$core$IFn$_invoke$arity$2 ? inputs_fn.cljs$core$IFn$_invoke$arity$2(query_vec,dyn_vec) : inputs_fn.call(null,query_vec,dyn_vec));
+var reaction_id = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(null);
+var reaction = re_frame.interop.make_reaction(((function (subscriptions,reaction_id,computation_fn,input_args,err_header,inputs_fn){
+return (function (){
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var _STAR_current_trace_STAR_5276 = re_frame.trace._STAR_current_trace_STAR_;
+re_frame.trace._STAR_current_trace_STAR_ = re_frame.trace.start_trace(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$operation,re_frame.utils.first_in_vector(query_vec),cljs.core.cst$kw$op_DASH_type,cljs.core.cst$kw$sub_SLASH_run,cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$query_DASH_v,query_vec,cljs.core.cst$kw$dyn_DASH_v,dyn_vec,cljs.core.cst$kw$reaction,cljs.core.deref(reaction_id)], null)], null));
+
+try{try{var subscription = (function (){var G__5277 = re_frame.subs.deref_input_signals(subscriptions,query_id);
+var G__5278 = query_vec;
+var G__5279 = dyn_vec;
+return (computation_fn.cljs$core$IFn$_invoke$arity$3 ? computation_fn.cljs$core$IFn$_invoke$arity$3(G__5277,G__5278,G__5279) : computation_fn.call(null,G__5277,G__5278,G__5279));
+})();
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5292 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5292;
+
+} else {
+}
+
+return subscription;
+}finally {if(re_frame.trace.is_trace_enabled_QMARK_()){
+var end__4439__auto___5293 = re_frame.interop.now();
+var duration__4440__auto___5294 = (end__4439__auto___5293 - cljs.core.cst$kw$start.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.traces,cljs.core.conj,cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$duration,duration__4440__auto___5294,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$end,re_frame.interop.now()], 0)));
+
+re_frame.trace.run_tracing_callbacks_BANG_(end__4439__auto___5293);
+} else {
+}
+}}finally {re_frame.trace._STAR_current_trace_STAR_ = _STAR_current_trace_STAR_5276;
+}} else {
+var subscription = (function (){var G__5280 = re_frame.subs.deref_input_signals(subscriptions,query_id);
+var G__5281 = query_vec;
+var G__5282 = dyn_vec;
+return (computation_fn.cljs$core$IFn$_invoke$arity$3 ? computation_fn.cljs$core$IFn$_invoke$arity$3(G__5280,G__5281,G__5282) : computation_fn.call(null,G__5280,G__5281,G__5282));
+})();
+if(re_frame.trace.is_trace_enabled_QMARK_()){
+var new_trace__4441__auto___5295 = cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.update.cljs$core$IFn$_invoke$arity$4(re_frame.trace._STAR_current_trace_STAR_,cljs.core.cst$kw$tags,cljs.core.merge,cljs.core.cst$kw$tags.cljs$core$IFn$_invoke$arity$1(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null))),cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tags,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$value,subscription], null)], null),cljs.core.cst$kw$tags)], 0));
+re_frame.trace._STAR_current_trace_STAR_ = new_trace__4441__auto___5295;
+
+} else {
+}
+
+return subscription;
+}
+});})(subscriptions,reaction_id,computation_fn,input_args,err_header,inputs_fn))
+);
+cljs.core.reset_BANG_(reaction_id,re_frame.interop.reagent_id(reaction));
+
+return reaction;
+});
+re_frame$subs$subs_handler_fn = function(db,query_vec,dyn_vec){
+switch(arguments.length){
+case 2:
+return re_frame$subs$subs_handler_fn__2.call(this,db,query_vec);
+case 3:
+return re_frame$subs$subs_handler_fn__3.call(this,db,query_vec,dyn_vec);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+re_frame$subs$subs_handler_fn.cljs$core$IFn$_invoke$arity$2 = re_frame$subs$subs_handler_fn__2;
+re_frame$subs$subs_handler_fn.cljs$core$IFn$_invoke$arity$3 = re_frame$subs$subs_handler_fn__3;
+return re_frame$subs$subs_handler_fn;
+})()
+;})(computation_fn,input_args,err_header,inputs_fn))
+);
+});
+
+re_frame.subs.reg_sub.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+re_frame.subs.reg_sub.cljs$lang$applyTo = (function (seq5265){
+var G__5266 = cljs.core.first(seq5265);
+var seq5265__$1 = cljs.core.next(seq5265);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__5266,seq5265__$1);
+});
+
diff --git a/js/re_frame/trace.cljc b/js/re_frame/trace.cljc
new file mode 100644
index 0000000..dbfa99e
--- /dev/null
+++ b/js/re_frame/trace.cljc
@@ -0,0 +1,125 @@
+(ns re-frame.trace
+  "Tracing for re-frame.
+  Alpha quality, subject to change/break at any time."
+  #?(:cljs (:require-macros [net.cgrand.macrovich :as macros]
+                            [re-frame.trace :refer [finish-trace with-trace merge-trace!]]))
+  (:require [re-frame.interop :as interop]
+            [re-frame.loggers :refer [console]]
+            #?(:clj [net.cgrand.macrovich :as macros])
+            #?(:cljs [goog.functions])))
+
+(def id (atom 0))
+(def ^:dynamic *current-trace* nil)
+
+(defn reset-tracing! []
+  (reset! id 0))
+
+#?(:cljs (goog-define trace-enabled? false)
+   :clj  (def ^boolean trace-enabled? false))
+
+(defn ^boolean is-trace-enabled?
+  "See https://groups.google.com/d/msg/clojurescript/jk43kmYiMhA/IHglVr_TPdgJ for more details"
+  []
+  trace-enabled?)
+
+(def trace-cbs (atom {}))
+(defonce traces (atom []))
+(defonce next-delivery (atom 0))
+
+(defn register-trace-cb
+  "Registers a tracing callback function which will receive a collection of one or more traces.
+  Will replace an existing callback function if it shares the same key."
+  [key f]
+  (if trace-enabled?
+    (swap! trace-cbs assoc key f)
+    (console :warn "Tracing is not enabled. Please set {\"re_frame.trace.trace_enabled_QMARK_\" true} in :closure-defines. See: https://github.com/Day8/re-frame-trace#installation.")))
+
+(defn remove-trace-cb [key]
+  (swap! trace-cbs dissoc key)
+  nil)
+
+(defn next-id [] (swap! id inc))
+
+(defn start-trace [{:keys [operation op-type tags child-of]}]
+  {:id        (next-id)
+   :operation operation
+   :op-type   op-type
+   :tags      tags
+   :child-of  (or child-of (:id *current-trace*))
+   :start     (interop/now)})
+
+;; On debouncing
+;;
+;; We debounce delivering traces to registered cbs so that
+;; we can deliver them in batches. This aids us in efficiency
+;; but also importantly lets us avoid slowing down the host
+;; application by running any trace code in the critical path.
+;;
+;; We add a lightweight check on top of goog.functions/debounce
+;; to avoid constant setting and cancelling of timeouts. This
+;; means that we will deliver traces between 10-50 ms from the
+;; last trace being created, which still achieves our goals.
+
+(def debounce-time 50)
+
+(defn debounce [f interval]
+  #?(:cljs (goog.functions/debounce f interval)
+     :clj  (f)))
+
+(def schedule-debounce
+  (debounce
+    (fn tracing-cb-debounced []
+      (doseq [[k cb] @trace-cbs]
+        (try (cb @traces)
+             #?(:clj (catch Exception e
+                       (console :error "Error thrown from trace cb" k "while storing" @traces e)))
+             #?(:cljs (catch :default e
+                        (console :error "Error thrown from trace cb" k "while storing" @traces e)))))
+      (reset! traces []))
+    debounce-time))
+
+(defn run-tracing-callbacks! [now]
+  ;; Optimised debounce, we only re-debounce
+  ;; if we are close to delivery time
+  ;; to avoid constant setting and cancelling
+  ;; timeouts.
+
+  ;; If we are within 10 ms of next delivery
+  (when (< (- @next-delivery 10) now)
+    (schedule-debounce)
+    ;; The next-delivery time is not perfectly accurate
+    ;; as scheduling the debounce takes some time, but
+    ;; it's good enough for our purposes here.
+    (reset! next-delivery (+ now debounce-time))))
+
+(macros/deftime
+  (defmacro finish-trace [trace]
+     `(when (is-trace-enabled?)
+        (let [end#      (interop/now)
+              duration# (- end# (:start ~trace))]
+          (swap! traces conj (assoc ~trace
+                               :duration duration#
+                               :end (interop/now)))
+          (run-tracing-callbacks! end#))))
+
+ (defmacro with-trace
+     "Create a trace inside the scope of the with-trace macro
+
+          Common keys for trace-opts
+          :op-type - what kind of operation is this? e.g. :sub/create, :render.
+          :operation - identifier for the operation, for an subscription it would be the subscription keyword
+          tags - a map of arbitrary kv pairs"
+     [{:keys [operation op-type tags child-of] :as trace-opts} & body]
+     `(if (is-trace-enabled?)
+        (binding [*current-trace* (start-trace ~trace-opts)]
+          (try ~@body
+               (finally (finish-trace *current-trace*))))
+        (do ~@body)))
+
+  (defmacro merge-trace! [m]
+     ;; Overwrite keys in tags, and all top level keys.
+     `(when (is-trace-enabled?)
+        (let [new-trace# (-> (update *current-trace* :tags merge (:tags ~m))
+                             (merge (dissoc ~m :tags)))]
+          (set! *current-trace* new-trace#))
+        nil)))
diff --git a/js/re_frame/trace.cljc.cache.json b/js/re_frame/trace.cljc.cache.json
new file mode 100644
index 0000000..16548c1
--- /dev/null
+++ b/js/re_frame/trace.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ ","~$console","~$re-frame.loggers","~$with-trace","~$re-frame.trace","~$finish-trace","^6","~$merge-trace!","^6"],"~:excludes",["~#set",[]],"~:name","^6","~:imports",null,"~:requires",["^ ","~$interop","~$re-frame.interop","^?","^?","^4","^4","~$goog.functions","^@"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^3","^4"],"~:defs",["^ ","~$reset-tracing!",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","~:line",14,"~:column",7,"~:end-line",14,"~:end-column",21,"~:arglists",["~#list",["~$quote",["^M",[[]]]]]],"^;","~$re-frame.trace/reset-tracing!","~:variadic",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",21,"~:method-params",["^M",[[]]],"~:protocol-impl",null,"~:arglists-meta",["^M",[null,null]],"^I",1,"^H",14,"^J",14,"~:max-fixed-arity",0,"~:fn-var",true,"^L",["^M",["^N",["^M",[[]]]]]],"~$next-delivery",["^ ","^;","~$re-frame.trace/next-delivery","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",27,"^I",1,"^J",27,"^K",23,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",27,"^I",10,"^J",27,"^K",23],"~:tag","~$any"],"~$run-tracing-callbacks!",["^ ","^E",null,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",81,"^I",7,"^J",81,"^K",29,"^L",["^M",["^N",["^M",[["~$now"]]]]]],"^;","~$re-frame.trace/run-tracing-callbacks!","^P",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",29,"^Q",["^M",[["^["]]],"^R",null,"^S",["^M",[null,null]],"^I",1,"^H",81,"^J",81,"^T",1,"^U",true,"^L",["^M",["^N",["^M",[["^["]]]]]],"~$trace-cbs",["^ ","^;","~$re-frame.trace/trace-cbs","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",25,"^I",1,"^J",25,"^K",15,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",25,"^I",6,"^J",25,"^K",15],"^X","^Y"],"~$register-trace-cb",["^ ","^E",null,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",29,"^I",7,"^J",29,"^K",24,"^L",["^M",["^N",["^M",[["~$key","~$f"]]]]],"~:doc","Registers a tracing callback function which will receive a collection of one or more traces.\n  Will replace an existing callback function if it shares the same key."],"^;","~$re-frame.trace/register-trace-cb","^P",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",24,"^Q",["^M",[["^14","~$f"]]],"^R",null,"^S",["^M",[null,null]],"^I",1,"^H",29,"^J",29,"^T",2,"^U",true,"^L",["^M",["^N",["^M",[["^14","~$f"]]]]],"^15","Registers a tracing callback function which will receive a collection of one or more traces.\n  Will replace an existing callback function if it shares the same key."],"~$next-id",["^ ","^E",null,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",41,"^I",7,"^J",41,"^K",14,"^L",["^M",["^N",["^M",[[]]]]]],"^;","~$re-frame.trace/next-id","^P",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",14,"^Q",["^M",[[]]],"^R",null,"^S",["^M",[null,null]],"^I",1,"^H",41,"^J",41,"^T",0,"^U",true,"^L",["^M",["^N",["^M",[[]]]]]],"~$debounce",["^ ","^E",null,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",65,"^I",7,"^J",65,"^K",15,"^L",["^M",["^N",["^M",[["~$f","~$interval"]]]]]],"^;","~$re-frame.trace/debounce","^P",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",15,"^Q",["^M",[["~$f","^1:"]]],"^R",null,"^S",["^M",[null,null]],"^I",1,"^H",65,"^J",65,"^T",2,"^U",true,"^L",["^M",["^N",["^M",[["~$f","^1:"]]]]]],"~$is-trace-enabled?",["^ ","^E",null,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",20,"^I",16,"^J",20,"^K",33,"^X","~$boolean","^L",["^M",["^N",["^M",[[]]]]],"^15","See https://groups.google.com/d/msg/clojurescript/jk43kmYiMhA/IHglVr_TPdgJ for more details"],"^;","~$re-frame.trace/is-trace-enabled?","^P",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",33,"^Q",["^M",[[]]],"^R",null,"^S",["^M",[null,null]],"^I",1,"^H",20,"~:ret-tag","^1=","^J",20,"^T",0,"^X","^1=","^U",true,"^L",["^M",["^N",["^M",[[]]]]],"^15","See https://groups.google.com/d/msg/clojurescript/jk43kmYiMhA/IHglVr_TPdgJ for more details"],"~$traces",["^ ","^;","~$re-frame.trace/traces","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",26,"^I",1,"^J",26,"^K",16,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",26,"^I",10,"^J",26,"^K",16],"^X","^Y"],"~$debounce-time",["^ ","^;","~$re-frame.trace/debounce-time","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",63,"^I",1,"^J",63,"^K",19,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",63,"^I",6,"^J",63,"^K",19],"^X","~$number"],"~$schedule-debounce",["^ ","^;","~$re-frame.trace/schedule-debounce","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",69,"^I",1,"^J",69,"^K",23,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",69,"^I",6,"^J",69,"^K",23],"^X","^Y"],"~$id",["^ ","^;","~$re-frame.trace/id","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",11,"^I",1,"^J",11,"^K",8,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",11,"^I",6,"^J",11,"^K",8],"^X","^Y"],"~$*current-trace*",["^ ","^;","~$re-frame.trace/*current-trace*","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",12,"^I",1,"^J",12,"^K",31,"~:dynamic",true,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",12,"^I",16,"^J",12,"^K",31,"^1K",true],"^X","~$clj-nil"],"~$remove-trace-cb",["^ ","^E",null,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",37,"^I",7,"^J",37,"^K",22,"^L",["^M",["^N",["^M",[["^14"]]]]]],"^;","~$re-frame.trace/remove-trace-cb","^P",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",22,"^Q",["^M",[["^14"]]],"^R",null,"^S",["^M",[null,null]],"^I",1,"^H",37,"^J",37,"^T",1,"^U",true,"^L",["^M",["^N",["^M",[["^14"]]]]]],"~$start-trace",["^ ","^E",null,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",43,"^I",7,"^J",43,"^K",18,"^L",["^M",["^N",["^M",[[["^ ","~:keys",["~$operation","~$op-type","~$tags","~$child-of"]]]]]]]],"^;","~$re-frame.trace/start-trace","^P",false,"^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^K",18,"^Q",["^M",[["~$p__4461"]]],"^R",null,"^S",["^M",[null,null]],"^I",1,"^H",43,"^J",43,"^T",1,"^U",true,"^L",["^M",["^N",["^M",[[["^ ","^1P",["^1Q","^1R","^1S","^1T"]]]]]]]],"~$trace-enabled?",["^ ","^;","~$re-frame.trace/trace-enabled?","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",17,"^I",10,"^J",17,"^K",37,"^X","^1=","~:declared",true,"^F",["^ ","^G","/home/julien/.cljs/.aot_cache/1.10.329/27A92D9/re_frame/trace.cljc","^H",17,"^I",23,"^J",17,"^K",37,"^X","^1=","^1Y",true]]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","~$macros","~$net.cgrand.macrovich","^21","^21","^6","^6"],"~:cljs.analyzer/constants",["^ ","~:seen",["^:",["~:tags","~:warn","~:child-of","~:operation","~:start","~:id","~:error","~:op-type"]],"~:order",["^25","^27","^2;","^24","^26","^29","^28","^2:"]],"^15","Tracing for re-frame.\n  Alpha quality, subject to change/break at any time."]
\ No newline at end of file
diff --git a/js/re_frame/trace.js b/js/re_frame/trace.js
new file mode 100644
index 0000000..87e33db
--- /dev/null
+++ b/js/re_frame/trace.js
@@ -0,0 +1,145 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.trace');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.interop');
+goog.require('re_frame.loggers');
+goog.require('goog.functions');
+re_frame.trace.id = cljs.core.atom.cljs$core$IFn$_invoke$arity$1((0));
+re_frame.trace._STAR_current_trace_STAR_ = null;
+re_frame.trace.reset_tracing_BANG_ = (function re_frame$trace$reset_tracing_BANG_(){
+return cljs.core.reset_BANG_(re_frame.trace.id,(0));
+});
+
+/** @define {boolean} */
+goog.define("re_frame.trace.trace_enabled_QMARK_",false);
+/**
+ * See https://groups.google.com/d/msg/clojurescript/jk43kmYiMhA/IHglVr_TPdgJ for more details
+ */
+re_frame.trace.is_trace_enabled_QMARK_ = (function re_frame$trace$is_trace_enabled_QMARK_(){
+return re_frame.trace.trace_enabled_QMARK_;
+});
+re_frame.trace.trace_cbs = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+if((typeof re_frame !== 'undefined') && (typeof re_frame.trace !== 'undefined') && (typeof re_frame.trace.traces !== 'undefined')){
+} else {
+re_frame.trace.traces = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentVector.EMPTY);
+}
+if((typeof re_frame !== 'undefined') && (typeof re_frame.trace !== 'undefined') && (typeof re_frame.trace.next_delivery !== 'undefined')){
+} else {
+re_frame.trace.next_delivery = cljs.core.atom.cljs$core$IFn$_invoke$arity$1((0));
+}
+/**
+ * Registers a tracing callback function which will receive a collection of one or more traces.
+ *   Will replace an existing callback function if it shares the same key.
+ */
+re_frame.trace.register_trace_cb = (function re_frame$trace$register_trace_cb(key,f){
+if(re_frame.trace.trace_enabled_QMARK_){
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(re_frame.trace.trace_cbs,cljs.core.assoc,key,f);
+} else {
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$warn,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Tracing is not enabled. Please set {\"re_frame.trace.trace_enabled_QMARK_\" true} in :closure-defines. See: https://github.com/Day8/re-frame-trace#installation."], 0));
+}
+});
+re_frame.trace.remove_trace_cb = (function re_frame$trace$remove_trace_cb(key){
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(re_frame.trace.trace_cbs,cljs.core.dissoc,key);
+
+return null;
+});
+re_frame.trace.next_id = (function re_frame$trace$next_id(){
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(re_frame.trace.id,cljs.core.inc);
+});
+re_frame.trace.start_trace = (function re_frame$trace$start_trace(p__4461){
+var map__4462 = p__4461;
+var map__4462__$1 = ((((!((map__4462 == null)))?(((((map__4462.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__4462.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__4462):map__4462);
+var operation = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4462__$1,cljs.core.cst$kw$operation);
+var op_type = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4462__$1,cljs.core.cst$kw$op_DASH_type);
+var tags = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4462__$1,cljs.core.cst$kw$tags);
+var child_of = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__4462__$1,cljs.core.cst$kw$child_DASH_of);
+return new cljs.core.PersistentArrayMap(null, 6, [cljs.core.cst$kw$id,re_frame.trace.next_id(),cljs.core.cst$kw$operation,operation,cljs.core.cst$kw$op_DASH_type,op_type,cljs.core.cst$kw$tags,tags,cljs.core.cst$kw$child_DASH_of,(function (){var or__3936__auto__ = child_of;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.cst$kw$id.cljs$core$IFn$_invoke$arity$1(re_frame.trace._STAR_current_trace_STAR_);
+}
+})(),cljs.core.cst$kw$start,re_frame.interop.now()], null);
+});
+re_frame.trace.debounce_time = (50);
+re_frame.trace.debounce = (function re_frame$trace$debounce(f,interval){
+return goog.functions.debounce(f,interval);
+});
+re_frame.trace.schedule_debounce = re_frame.trace.debounce((function re_frame$trace$tracing_cb_debounced(){
+var seq__4464_4478 = cljs.core.seq(cljs.core.deref(re_frame.trace.trace_cbs));
+var chunk__4465_4479 = null;
+var count__4466_4480 = (0);
+var i__4467_4481 = (0);
+while(true){
+if((i__4467_4481 < count__4466_4480)){
+var vec__4468_4482 = chunk__4465_4479.cljs$core$IIndexed$_nth$arity$2(null,i__4467_4481);
+var k_4483 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4468_4482,(0),null);
+var cb_4484 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4468_4482,(1),null);
+try{var G__4472_4485 = cljs.core.deref(re_frame.trace.traces);
+(cb_4484.cljs$core$IFn$_invoke$arity$1 ? cb_4484.cljs$core$IFn$_invoke$arity$1(G__4472_4485) : cb_4484.call(null,G__4472_4485));
+}catch (e4471){var e_4486 = e4471;
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Error thrown from trace cb",k_4483,"while storing",cljs.core.deref(re_frame.trace.traces),e_4486], 0));
+}
+
+var G__4487 = seq__4464_4478;
+var G__4488 = chunk__4465_4479;
+var G__4489 = count__4466_4480;
+var G__4490 = (i__4467_4481 + (1));
+seq__4464_4478 = G__4487;
+chunk__4465_4479 = G__4488;
+count__4466_4480 = G__4489;
+i__4467_4481 = G__4490;
+continue;
+} else {
+var temp__5457__auto___4491 = cljs.core.seq(seq__4464_4478);
+if(temp__5457__auto___4491){
+var seq__4464_4492__$1 = temp__5457__auto___4491;
+if(cljs.core.chunked_seq_QMARK_(seq__4464_4492__$1)){
+var c__4338__auto___4493 = cljs.core.chunk_first(seq__4464_4492__$1);
+var G__4494 = cljs.core.chunk_rest(seq__4464_4492__$1);
+var G__4495 = c__4338__auto___4493;
+var G__4496 = cljs.core.count(c__4338__auto___4493);
+var G__4497 = (0);
+seq__4464_4478 = G__4494;
+chunk__4465_4479 = G__4495;
+count__4466_4480 = G__4496;
+i__4467_4481 = G__4497;
+continue;
+} else {
+var vec__4473_4498 = cljs.core.first(seq__4464_4492__$1);
+var k_4499 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4473_4498,(0),null);
+var cb_4500 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__4473_4498,(1),null);
+try{var G__4477_4501 = cljs.core.deref(re_frame.trace.traces);
+(cb_4500.cljs$core$IFn$_invoke$arity$1 ? cb_4500.cljs$core$IFn$_invoke$arity$1(G__4477_4501) : cb_4500.call(null,G__4477_4501));
+}catch (e4476){var e_4502 = e4476;
+re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Error thrown from trace cb",k_4499,"while storing",cljs.core.deref(re_frame.trace.traces),e_4502], 0));
+}
+
+var G__4503 = cljs.core.next(seq__4464_4492__$1);
+var G__4504 = null;
+var G__4505 = (0);
+var G__4506 = (0);
+seq__4464_4478 = G__4503;
+chunk__4465_4479 = G__4504;
+count__4466_4480 = G__4505;
+i__4467_4481 = G__4506;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+return cljs.core.reset_BANG_(re_frame.trace.traces,cljs.core.PersistentVector.EMPTY);
+}),re_frame.trace.debounce_time);
+re_frame.trace.run_tracing_callbacks_BANG_ = (function re_frame$trace$run_tracing_callbacks_BANG_(now){
+if(((cljs.core.deref(re_frame.trace.next_delivery) - (10)) < now)){
+(re_frame.trace.schedule_debounce.cljs$core$IFn$_invoke$arity$0 ? re_frame.trace.schedule_debounce.cljs$core$IFn$_invoke$arity$0() : re_frame.trace.schedule_debounce.call(null));
+
+return cljs.core.reset_BANG_(re_frame.trace.next_delivery,(now + re_frame.trace.debounce_time));
+} else {
+return null;
+}
+});
diff --git a/js/re_frame/utils.cljc b/js/re_frame/utils.cljc
new file mode 100644
index 0000000..0f547b1
--- /dev/null
+++ b/js/re_frame/utils.cljc
@@ -0,0 +1,24 @@
+(ns re-frame.utils
+  (:require
+    [re-frame.loggers :refer [console]]))
+
+(defn dissoc-in
+  "Dissociates an entry from a nested associative structure returning a new
+  nested structure. keys is a sequence of keys. Any empty maps that result
+  will not be present in the new structure.
+  The key thing is that 'm' remains identical? to istelf if the path was never present"
+  [m [k & ks :as keys]]
+  (if ks
+    (if-let [nextmap (get m k)]
+      (let [newmap (dissoc-in nextmap ks)]
+        (if (seq newmap)
+          (assoc m k newmap)
+          (dissoc m k)))
+      m)
+    (dissoc m k)))
+
+(defn first-in-vector
+  [v]
+  (if (vector? v)
+    (first v)
+    (console :error "re-frame: expected a vector, but got:" v)))
diff --git a/js/re_frame/utils.cljc.cache.json b/js/re_frame/utils.cljc.cache.json
new file mode 100644
index 0000000..fe0cebc
--- /dev/null
+++ b/js/re_frame/utils.cljc.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ ","~$console","~$re-frame.loggers"],"~:excludes",["~#set",[]],"~:name","~$re-frame.utils","~:imports",null,"~:requires",["^ ","^4","^4"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^3","^4"],"~:defs",["^ ","~$dissoc-in",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/E6FDB52/re_frame/utils.cljc","~:line",5,"~:column",7,"~:end-line",5,"~:end-column",16,"~:arglists",["~#list",["~$quote",["^G",[["~$m",["~$k","~$&","~$ks","~:as","~$keys"]]]]]],"~:doc","Dissociates an entry from a nested associative structure returning a new\n  nested structure. keys is a sequence of keys. Any empty maps that result\n  will not be present in the new structure.\n  The key thing is that 'm' remains identical? to istelf if the path was never present"],"^7","~$re-frame.utils/dissoc-in","~:variadic",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/E6FDB52/re_frame/utils.cljc","^E",16,"~:method-params",["^G",[["~$m","~$p__4549"]]],"~:protocol-impl",null,"~:arglists-meta",["^G",[null,null]],"^C",1,"^B",5,"^D",5,"~:max-fixed-arity",2,"~:fn-var",true,"^F",["^G",["^H",["^G",[["~$m",["~$k","~$&","^I","^J","^K"]]]]]],"^L","Dissociates an entry from a nested associative structure returning a new\n  nested structure. keys is a sequence of keys. Any empty maps that result\n  will not be present in the new structure.\n  The key thing is that 'm' remains identical? to istelf if the path was never present"],"~$first-in-vector",["^ ","^?",null,"^@",["^ ","^A","/home/julien/.cljs/.aot_cache/1.10.329/E6FDB52/re_frame/utils.cljc","^B",20,"^C",7,"^D",20,"^E",22,"^F",["^G",["^H",["^G",[["~$v"]]]]]],"^7","~$re-frame.utils/first-in-vector","^N",false,"^A","/home/julien/.cljs/.aot_cache/1.10.329/E6FDB52/re_frame/utils.cljc","^E",22,"^O",["^G",[["~$v"]]],"^Q",null,"^R",["^G",[null,null]],"^C",1,"^B",20,"^D",20,"^S",1,"^T",true,"^F",["^G",["^H",["^G",[["~$v"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["~:error"]],"~:order",["^["]],"^L",null]
\ No newline at end of file
diff --git a/js/re_frame/utils.js b/js/re_frame/utils.js
new file mode 100644
index 0000000..5c4cff9
--- /dev/null
+++ b/js/re_frame/utils.js
@@ -0,0 +1,43 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('re_frame.utils');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('re_frame.loggers');
+/**
+ * Dissociates an entry from a nested associative structure returning a new
+ *   nested structure. keys is a sequence of keys. Any empty maps that result
+ *   will not be present in the new structure.
+ *   The key thing is that 'm' remains identical? to istelf if the path was never present
+ */
+re_frame.utils.dissoc_in = (function re_frame$utils$dissoc_in(m,p__4549){
+var vec__4550 = p__4549;
+var seq__4551 = cljs.core.seq(vec__4550);
+var first__4552 = cljs.core.first(seq__4551);
+var seq__4551__$1 = cljs.core.next(seq__4551);
+var k = first__4552;
+var ks = seq__4551__$1;
+var keys = vec__4550;
+if(ks){
+var temp__5455__auto__ = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+if(cljs.core.truth_(temp__5455__auto__)){
+var nextmap = temp__5455__auto__;
+var newmap = (re_frame.utils.dissoc_in.cljs$core$IFn$_invoke$arity$2 ? re_frame.utils.dissoc_in.cljs$core$IFn$_invoke$arity$2(nextmap,ks) : re_frame.utils.dissoc_in.call(null,nextmap,ks));
+if(cljs.core.seq(newmap)){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,newmap);
+} else {
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(m,k);
+}
+} else {
+return m;
+}
+} else {
+return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(m,k);
+}
+});
+re_frame.utils.first_in_vector = (function re_frame$utils$first_in_vector(v){
+if(cljs.core.vector_QMARK_(v)){
+return cljs.core.first(v);
+} else {
+return re_frame.loggers.console.cljs$core$IFn$_invoke$arity$variadic(cljs.core.cst$kw$error,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["re-frame: expected a vector, but got:",v], 0));
+}
+});
diff --git a/js/reagent/core.cljs b/js/reagent/core.cljs
new file mode 100644
index 0000000..6390138
--- /dev/null
+++ b/js/reagent/core.cljs
@@ -0,0 +1,348 @@
+(ns reagent.core
+  (:require-macros [reagent.core])
+  (:refer-clojure :exclude [partial atom flush])
+  (:require [react :as react]
+            [reagent.impl.template :as tmpl]
+            [reagent.impl.component :as comp]
+            [reagent.impl.util :as util]
+            [reagent.impl.batching :as batch]
+            [reagent.ratom :as ratom]
+            [reagent.debug :as deb :refer-macros [dbg prn
+                                                  assert-some assert-component
+                                                  assert-js-object assert-new-state
+                                                  assert-callable]]
+            [reagent.interop :refer-macros [$ $!]]
+            [reagent.dom :as dom]))
+
+(def is-client util/is-client)
+
+(defn create-element
+  "Create a native React element, by calling React.createElement directly.
+
+  That means the second argument must be a javascript object (or nil), and
+  that any Reagent hiccup forms must be processed with as-element. For example
+  like this:
+
+    (r/create-element \"div\" #js{:className \"foo\"}
+       \"Hi \" (r/as-element [:strong \"world!\"])
+
+  which is equivalent to
+
+    [:div.foo \"Hi\" [:strong \"world!\"]]"
+  ([type]
+   (create-element type nil))
+  ([type props]
+   (assert-js-object props)
+   (react/createElement type props))
+  ([type props child]
+   (assert-js-object props)
+   (react/createElement type props child))
+  ([type props child & children]
+   (assert-js-object props)
+   (apply react/createElement type props child children)))
+
+(defn as-element
+  "Turns a vector of Hiccup syntax into a React element. Returns form
+  unchanged if it is not a vector."
+  [form]
+  (tmpl/as-element form))
+
+(defn adapt-react-class
+  "Returns an adapter for a native React class, that may be used
+  just like a Reagent component function or class in Hiccup forms."
+  [c]
+  (assert-some c "Component")
+  (tmpl/adapt-react-class c))
+
+(defn reactify-component
+  "Returns an adapter for a Reagent component, that may be used from
+  React, for example in JSX. A single argument, props, is passed to
+  the component, converted to a map."
+  [c]
+  (assert-some c "Component")
+  (comp/reactify-component c))
+
+(defn render
+  "Render a Reagent component into the DOM. The first argument may be
+  either a vector (using Reagent's Hiccup syntax), or a React element.
+  The second argument should be a DOM node.
+
+  Optionally takes a callback that is called when the component is in place.
+
+  Returns the mounted component instance."
+  ([comp container]
+   (dom/render comp container))
+  ([comp container callback]
+   (dom/render comp container callback)))
+
+(defn unmount-component-at-node
+  "Remove a component from the given DOM node."
+  [container]
+  (dom/unmount-component-at-node container))
+
+;; For backward compatibility
+(def as-component as-element)
+(def render-component render)
+
+(defn ^:export force-update-all
+  "Force re-rendering of all mounted Reagent components. This is
+  probably only useful in a development environment, when you want to
+  update components in response to some dynamic changes to code.
+
+  Note that force-update-all may not update root components. This
+  happens if a component 'foo' is mounted with `(render [foo])` (since
+  functions are passed by value, and not by reference, in
+  ClojureScript). To get around this you'll have to introduce a layer
+  of indirection, for example by using `(render [#'foo])` instead."
+  []
+  (ratom/flush!)
+  (dom/force-update-all)
+  (batch/flush-after-render))
+
+(defn create-class
+  "Create a component, React style. Should be called with a map,
+  looking like this:
+
+    {:get-initial-state (fn [this])
+     :component-will-receive-props (fn [this new-argv])
+     :should-component-update (fn [this old-argv new-argv])
+     :component-will-mount (fn [this])
+     :component-did-mount (fn [this])
+     :component-will-update (fn [this new-argv])
+     :component-did-update (fn [this old-argv])
+     :component-will-unmount (fn [this])
+     :reagent-render (fn [args....])}   ;; or :render (fn [this])
+
+  Everything is optional, except either :reagent-render or :render."
+  [spec]
+  (comp/create-class spec))
+
+
+(defn current-component
+  "Returns the current React component (a.k.a this) in a component
+  function."
+  []
+  comp/*current-component*)
+
+(defn state-atom
+  "Returns an atom containing a components state."
+  [this]
+  (assert-component this)
+  (comp/state-atom this))
+
+(defn state
+  "Returns the state of a component, as set with replace-state or set-state.
+  Equivalent to (deref (r/state-atom this))"
+  [this]
+  (assert-component this)
+  (deref (state-atom this)))
+
+(defn replace-state
+  "Set state of a component.
+  Equivalent to (reset! (state-atom this) new-state)"
+  [this new-state]
+  (assert-component this)
+  (assert-new-state new-state)
+  (reset! (state-atom this) new-state))
+
+(defn set-state
+  "Merge component state with new-state.
+  Equivalent to (swap! (state-atom this) merge new-state)"
+  [this new-state]
+  (assert-component this)
+  (assert-new-state new-state)
+  (swap! (state-atom this) merge new-state))
+
+(defn force-update
+  "Force a component to re-render immediately.
+
+  If the second argument is true, child components will also be
+  re-rendered, even is their arguments have not changed."
+  ([this]
+   (force-update this false))
+  ([this deep]
+   (ratom/flush!)
+   (util/force-update this deep)
+   (batch/flush-after-render)))
+
+(defn props
+  "Returns the props passed to a component."
+  [this]
+  (assert-component this)
+  (comp/get-props this))
+
+(defn children
+  "Returns the children passed to a component."
+  [this]
+  (assert-component this)
+  (comp/get-children this))
+
+(defn argv
+  "Returns the entire Hiccup form passed to the component."
+  [this]
+  (assert-component this)
+  (comp/get-argv this))
+
+(defn dom-node
+  "Returns the root DOM node of a mounted component."
+  [this]
+  (dom/dom-node this))
+
+(defn merge-props
+  "Utility function that merges two maps, handling :class and :style
+  specially, like React's transferPropsTo."
+  [defaults props]
+  (util/merge-props defaults props))
+
+(defn flush
+  "Render dirty components immediately to the DOM.
+
+  Note that this may not work in event handlers, since React.js does
+  batching of updates there."
+  []
+  (batch/flush))
+
+
+
+;; Ratom
+
+(defn atom
+  "Like clojure.core/atom, except that it keeps track of derefs.
+  Reagent components that derefs one of these are automatically
+  re-rendered."
+  ([x] (ratom/atom x))
+  ([x & rest] (apply ratom/atom x rest)))
+
+(defn track
+  "Takes a function and optional arguments, and returns a derefable
+  containing the output of that function. If the function derefs
+  Reagent atoms (or track, etc), the value will be updated whenever
+  the atom changes.
+
+  In other words, @(track foo bar) will produce the same result
+  as (foo bar), but foo will only be called again when the atoms it
+  depends on changes, and will only trigger updates of components when
+  its result changes.
+
+  track is lazy, i.e the function is only evaluated on deref."
+  [f & args]
+  {:pre [(ifn? f)]}
+  (ratom/make-track f args))
+
+(defn track!
+  "An eager version of track. The function passed is called
+  immediately, and continues to be called when needed, until stopped
+  with dispose!."
+  [f & args]
+  {:pre [(ifn? f)]}
+  (ratom/make-track! f args))
+
+(defn dispose!
+  "Stop the result of track! from updating."
+  [x]
+  (ratom/dispose! x))
+
+(defn wrap
+  "Provide a combination of value and callback, that looks like an atom.
+
+  The first argument can be any value, that will be returned when the
+  result is deref'ed.
+
+  The second argument should be a function, that is called with the
+  optional extra arguments provided to wrap, and the new value of the
+  resulting 'atom'.
+
+  Use for example like this:
+
+  (wrap (:foo @state)
+        swap! state assoc :foo)
+
+  Probably useful only for passing to child components."
+  [value reset-fn & args]
+  (assert-callable reset-fn)
+  (ratom/make-wrapper value reset-fn args))
+
+
+;; RCursor
+
+(defn cursor
+  "Provide a cursor into a Reagent atom.
+
+  Behaves like a Reagent atom but focuses updates and derefs to
+  the specified path within the wrapped Reagent atom. e.g.,
+    (let [c (cursor ra [:nested :content])]
+      ... @c ;; equivalent to (get-in @ra [:nested :content])
+      ... (reset! c 42) ;; equivalent to (swap! ra assoc-in [:nested :content] 42)
+      ... (swap! c inc) ;; equivalence to (swap! ra update-in [:nested :content] inc)
+      )
+
+  The first parameter can also be a function, that should look
+  something like this:
+
+    (defn set-get
+      ([k] (get-in @state k))
+      ([k v] (swap! state assoc-in k v)))
+
+  The function will be called with one argument – the path passed to
+  cursor – when the cursor is deref'ed, and two arguments (path and
+  new value) when the cursor is modified.
+
+  Given that set-get function, (and that state is a Reagent atom, or
+  another cursor) these cursors are equivalent:
+  (cursor state [:foo]) and (cursor set-get [:foo]).
+
+  Note that a cursor is lazy: its value will not change until it is
+  used. This may be noticed with add-watch."
+  ([src path]
+   (ratom/cursor src path)))
+
+
+;; Utilities
+
+(defn rswap!
+  "Swaps the value of a to be (apply f current-value-of-atom args).
+
+  rswap! works like swap!, except that recursive calls to rswap! on
+  the same atom are allowed – and it always returns nil."
+  [a f & args]
+  {:pre [(satisfies? IAtom a)
+         (ifn? f)]}
+  (if a.rswapping
+    (-> (or a.rswapfs (set! a.rswapfs (array)))
+        (.push #(apply f % args)))
+    (do (set! a.rswapping true)
+        (try (swap! a (fn [state]
+                        (loop [s (apply f state args)]
+                          (if-some [sf (some-> a.rswapfs .shift)]
+                            (recur (sf s))
+                            s))))
+             (finally
+               (set! a.rswapping false)))))
+  nil)
+
+(defn next-tick
+  "Run f using requestAnimationFrame or equivalent.
+
+  f will be called just before components are rendered."
+  [f]
+  (batch/do-before-flush f))
+
+(defn after-render
+  "Run f using requestAnimationFrame or equivalent.
+
+  f will be called just after any queued renders in the next animation
+  frame (and even if no renders actually occur)."
+  [f]
+  (batch/do-after-render f))
+
+(defn partial
+  "Works just like clojure.core/partial, but the result can be compared with ="
+  [f & args]
+  (util/make-partial-fn f args))
+
+(defn component-path
+  ;; Try to return the path of component c as a string.
+  ;; Maybe useful for debugging and error reporting, but may break
+  ;; with future versions of React (and return nil).
+  [c]
+  (comp/component-path c))
diff --git a/js/reagent/core.cljs.cache.json b/js/reagent/core.cljs.cache.json
new file mode 100644
index 0000000..75fb005
--- /dev/null
+++ b/js/reagent/core.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "],"~$Object",["^ ","~$createElement",["^ "]]],"~:use-macros",["^ ","~$assert-js-object","~$reagent.debug","~$assert-some","^8","~$assert-new-state","^8","~$dbg","^8","~$$!","~$reagent.interop","~$prn","^8","~$assert-component","^8","~$$","^=","~$assert-callable","^8"],"~:excludes",["~#set",["~$atom","~$flush","~$partial"]],"~:name","~$reagent.core","~:imports",null,"~:requires",["^ ","~$reagent.impl.util","^J","~$dom","~$reagent.dom","~$comp","~$reagent.impl.component","^=","^=","~$reagent.ratom","^O","~$react","^P","~$reagent.impl.template","^Q","~$reagent.impl.batching","^R","^N","^N","~$util","^J","~$tmpl","^Q","~$ratom","^O","~$deb","^8","~$batch","^R","^8","^8","^L","^L"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$after-render",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","~:line",330,"~:column",7,"~:end-line",330,"~:end-column",19,"~:arglists",["~#list",["~$quote",["^18",[["~$f"]]]]],"~:doc","Run f using requestAnimationFrame or equivalent.\n\n  f will be called just after any queued renders in the next animation\n  frame (and even if no renders actually occur)."],"^F","~$reagent.core/after-render","~:variadic",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",19,"~:method-params",["^18",[["~$f"]]],"~:protocol-impl",null,"~:arglists-meta",["^18",[null,null]],"^14",1,"^13",330,"^15",330,"~:max-fixed-arity",1,"~:fn-var",true,"^17",["^18",["^19",["^18",[["~$f"]]]]],"^1:","Run f using requestAnimationFrame or equivalent.\n\n  f will be called just after any queued renders in the next animation\n  frame (and even if no renders actually occur)."],"~$current-component",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",121,"^14",7,"^15",121,"^16",24,"^17",["^18",["^19",["^18",[[]]]]],"^1:","Returns the current React component (a.k.a this) in a component\n  function."],"^F","~$reagent.core/current-component","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",24,"^1=",["^18",[[]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",121,"^15",121,"^1@",0,"^1A",true,"^17",["^18",["^19",["^18",[[]]]]],"^1:","Returns the current React component (a.k.a this) in a component\n  function."],"~$as-component",["^ ","^F","~$reagent.core/as-component","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",84,"^14",1,"^15",84,"^16",18,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",84,"^14",6,"^15",84,"^16",18]],"~$adapt-react-class",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",50,"^14",7,"^15",50,"^16",24,"^17",["^18",["^19",["^18",[["~$c"]]]]],"^1:","Returns an adapter for a native React class, that may be used\n  just like a Reagent component function or class in Hiccup forms."],"^F","~$reagent.core/adapt-react-class","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",24,"^1=",["^18",[["~$c"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",50,"^15",50,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["~$c"]]]]],"^1:","Returns an adapter for a native React class, that may be used\n  just like a Reagent component function or class in Hiccup forms."],"^C",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",209,"^14",7,"^15",209,"^16",11,"^17",["^18",["^19",["^18",[["~$x"],["~$x","~$&","~$rest"]]]]],"^1:","Like clojure.core/atom, except that it keeps track of derefs.\n  Reagent components that derefs one of these are automatically\n  re-rendered.","~:top-fn",["^ ","^1<",true,"^1@",1,"^1=",["^18",[["~$x"]]],"^17",["^18",[["~$x"],["~$x","~$&","^1H"]]],"^1?",["^18",[null,null]]]],"^F","~$reagent.core/atom","^1<",true,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",11,"^1I",["^ ","^1<",true,"^1@",1,"^1=",["^18",[["~$x"]]],"^17",["^18",[["~$x"],["~$x","~$&","^1H"]]],"^1?",["^18",[null,null]]],"^1=",["^18",[["~$x"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",209,"^15",209,"^1@",1,"^1A",true,"^17",["^18",[["~$x"],["~$x","~$&","^1H"]]],"^1:","Like clojure.core/atom, except that it keeps track of derefs.\n  Reagent components that derefs one of these are automatically\n  re-rendered."],"~$merge-props",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",191,"^14",7,"^15",191,"^16",18,"^17",["^18",["^19",["^18",[["~$defaults","~$props"]]]]],"^1:","Utility function that merges two maps, handling :class and :style\n  specially, like React's transferPropsTo."],"^F","~$reagent.core/merge-props","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",18,"^1=",["^18",[["^1L","^1M"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",191,"^15",191,"^1@",2,"^1A",true,"^17",["^18",["^19",["^18",[["^1L","^1M"]]]]],"^1:","Utility function that merges two maps, handling :class and :style\n  specially, like React's transferPropsTo."],"~$force-update-all",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",87,"^14",16,"^15",87,"^16",32,"~:export",true,"^17",["^18",["^19",["^18",[[]]]]],"^1:","Force re-rendering of all mounted Reagent components. This is\n  probably only useful in a development environment, when you want to\n  update components in response to some dynamic changes to code.\n\n  Note that force-update-all may not update root components. This\n  happens if a component 'foo' is mounted with `(render [foo])` (since\n  functions are passed by value, and not by reference, in\n  ClojureScript). To get around this you'll have to introduce a layer\n  of indirection, for example by using `(render [#'foo])` instead."],"^F","~$reagent.core/force-update-all","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",32,"^1=",["^18",[[]]],"^1>",null,"^1P",true,"^1?",["^18",[null,null]],"^14",1,"^13",87,"^15",87,"^1@",0,"^1A",true,"^17",["^18",["^19",["^18",[[]]]]],"^1:","Force re-rendering of all mounted Reagent components. This is\n  probably only useful in a development environment, when you want to\n  update components in response to some dynamic changes to code.\n\n  Note that force-update-all may not update root components. This\n  happens if a component 'foo' is mounted with `(render [foo])` (since\n  functions are passed by value, and not by reference, in\n  ClojureScript). To get around this you'll have to introduce a layer\n  of indirection, for example by using `(render [#'foo])` instead."],"~$as-element",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",44,"^14",7,"^15",44,"^16",17,"^17",["^18",["^19",["^18",[["~$form"]]]]],"^1:","Turns a vector of Hiccup syntax into a React element. Returns form\n  unchanged if it is not a vector."],"^F","~$reagent.core/as-element","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",17,"^1=",["^18",[["^1S"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",44,"^15",44,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^1S"]]]]],"^1:","Turns a vector of Hiccup syntax into a React element. Returns form\n  unchanged if it is not a vector."],"~$rswap!",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",302,"^14",7,"^15",302,"^16",13,"^17",["^18",["^19",["^18",[["~$a","~$f","~$&","~$args"]]]]],"^1:","Swaps the value of a to be (apply f current-value-of-atom args).\n\n  rswap! works like swap!, except that recursive calls to rswap! on\n  the same atom are allowed – and it always returns nil.","^1I",["^ ","^1<",true,"^1@",2,"^1=",[["^18",["~$a","~$f","^1V"]]],"^17",["^18",[["~$a","~$f","~$&","^1V"]]],"^1?",["^18",[null]]]],"^F","~$reagent.core/rswap!","^1<",true,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",13,"^1I",["^ ","^1<",true,"^1@",2,"^1=",[["^18",["~$a","~$f","^1V"]]],"^17",["^18",[["~$a","~$f","~$&","^1V"]]],"^1?",["^18",[null]]],"^1=",[["^18",["~$a","~$f","^1V"]]],"^1>",null,"^1?",["^18",[null]],"^14",1,"^13",302,"^15",302,"^1@",2,"^1A",true,"^17",["^18",[["~$a","~$f","~$&","^1V"]]],"^1:","Swaps the value of a to be (apply f current-value-of-atom args).\n\n  rswap! works like swap!, except that recursive calls to rswap! on\n  the same atom are allowed – and it always returns nil."],"~$next-tick",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",323,"^14",7,"^15",323,"^16",16,"^17",["^18",["^19",["^18",[["~$f"]]]]],"^1:","Run f using requestAnimationFrame or equivalent.\n\n  f will be called just before components are rendered."],"^F","~$reagent.core/next-tick","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",16,"^1=",["^18",[["~$f"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",323,"^15",323,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["~$f"]]]]],"^1:","Run f using requestAnimationFrame or equivalent.\n\n  f will be called just before components are rendered."],"~$track",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",216,"^14",7,"^15",216,"^16",12,"^17",["^18",["^19",["^18",[["~$f","~$&","^1V"]]]]],"^1:","Takes a function and optional arguments, and returns a derefable\n  containing the output of that function. If the function derefs\n  Reagent atoms (or track, etc), the value will be updated whenever\n  the atom changes.\n\n  In other words, @(track foo bar) will produce the same result\n  as (foo bar), but foo will only be called again when the atoms it\n  depends on changes, and will only trigger updates of components when\n  its result changes.\n\n  track is lazy, i.e the function is only evaluated on deref.","^1I",["^ ","^1<",true,"^1@",1,"^1=",[["^18",["~$f","^1V"]]],"^17",["^18",[["~$f","~$&","^1V"]]],"^1?",["^18",[null]]]],"^F","~$reagent.core/track","^1<",true,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",12,"^1I",["^ ","^1<",true,"^1@",1,"^1=",[["^18",["~$f","^1V"]]],"^17",["^18",[["~$f","~$&","^1V"]]],"^1?",["^18",[null]]],"^1=",[["^18",["~$f","^1V"]]],"^1>",null,"^1?",["^18",[null]],"^14",1,"^13",216,"^15",216,"^1@",1,"^1A",true,"^17",["^18",[["~$f","~$&","^1V"]]],"^1:","Takes a function and optional arguments, and returns a derefable\n  containing the output of that function. If the function derefs\n  Reagent atoms (or track, etc), the value will be updated whenever\n  the atom changes.\n\n  In other words, @(track foo bar) will produce the same result\n  as (foo bar), but foo will only be called again when the atoms it\n  depends on changes, and will only trigger updates of components when\n  its result changes.\n\n  track is lazy, i.e the function is only evaluated on deref."],"^1M",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",168,"^14",7,"^15",168,"^16",12,"^17",["^18",["^19",["^18",[["~$this"]]]]],"^1:","Returns the props passed to a component."],"^F","~$reagent.core/props","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",12,"^1=",["^18",[["^20"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",168,"^15",168,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the props passed to a component."],"~$dispose!",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",240,"^14",7,"^15",240,"^16",15,"^17",["^18",["^19",["^18",[["~$x"]]]]],"^1:","Stop the result of track! from updating."],"^F","~$reagent.core/dispose!","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",15,"^1=",["^18",[["~$x"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",240,"^15",240,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["~$x"]]]]],"^1:","Stop the result of track! from updating."],"~$state-atom",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",127,"^14",7,"^15",127,"^16",17,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns an atom containing a components state."],"^F","~$reagent.core/state-atom","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",17,"^1=",["^18",[["^20"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",127,"^15",127,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns an atom containing a components state."],"^D",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",197,"^14",7,"^15",197,"^16",12,"^17",["^18",["^19",["^18",[[]]]]],"^1:","Render dirty components immediately to the DOM.\n\n  Note that this may not work in event handlers, since React.js does\n  batching of updates there."],"^F","~$reagent.core/flush","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",12,"^1=",["^18",[[]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",197,"^15",197,"^1@",0,"^1A",true,"^17",["^18",["^19",["^18",[[]]]]],"^1:","Render dirty components immediately to the DOM.\n\n  Note that this may not work in event handlers, since React.js does\n  batching of updates there."],"~$children",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",174,"^14",7,"^15",174,"^16",15,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the children passed to a component."],"^F","~$reagent.core/children","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",15,"^1=",["^18",[["^20"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",174,"^15",174,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the children passed to a component."],"~$wrap",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",245,"^14",7,"^15",245,"^16",11,"^17",["^18",["^19",["^18",[["~$value","~$reset-fn","~$&","^1V"]]]]],"^1:","Provide a combination of value and callback, that looks like an atom.\n\n  The first argument can be any value, that will be returned when the\n  result is deref'ed.\n\n  The second argument should be a function, that is called with the\n  optional extra arguments provided to wrap, and the new value of the\n  resulting 'atom'.\n\n  Use for example like this:\n\n  (wrap (:foo @state)\n        swap! state assoc :foo)\n\n  Probably useful only for passing to child components.","^1I",["^ ","^1<",true,"^1@",2,"^1=",[["^18",["^2:","^2;","^1V"]]],"^17",["^18",[["^2:","^2;","~$&","^1V"]]],"^1?",["^18",[null]]]],"^F","~$reagent.core/wrap","^1<",true,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",11,"^1I",["^ ","^1<",true,"^1@",2,"^1=",[["^18",["^2:","^2;","^1V"]]],"^17",["^18",[["^2:","^2;","~$&","^1V"]]],"^1?",["^18",[null]]],"^1=",[["^18",["^2:","^2;","^1V"]]],"^1>",null,"^1?",["^18",[null]],"^14",1,"^13",245,"^15",245,"^1@",2,"^1A",true,"^17",["^18",[["^2:","^2;","~$&","^1V"]]],"^1:","Provide a combination of value and callback, that looks like an atom.\n\n  The first argument can be any value, that will be returned when the\n  result is deref'ed.\n\n  The second argument should be a function, that is called with the\n  optional extra arguments provided to wrap, and the new value of the\n  resulting 'atom'.\n\n  Use for example like this:\n\n  (wrap (:foo @state)\n        swap! state assoc :foo)\n\n  Probably useful only for passing to child components."],"~$reactify-component",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",57,"^14",7,"^15",57,"^16",25,"^17",["^18",["^19",["^18",[["~$c"]]]]],"^1:","Returns an adapter for a Reagent component, that may be used from\n  React, for example in JSX. A single argument, props, is passed to\n  the component, converted to a map."],"^F","~$reagent.core/reactify-component","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",25,"^1=",["^18",[["~$c"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",57,"^15",57,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["~$c"]]]]],"^1:","Returns an adapter for a Reagent component, that may be used from\n  React, for example in JSX. A single argument, props, is passed to\n  the component, converted to a map."],"~$unmount-component-at-node",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",78,"^14",7,"^15",78,"^16",32,"^17",["^18",["^19",["^18",[["~$container"]]]]],"^1:","Remove a component from the given DOM node."],"^F","~$reagent.core/unmount-component-at-node","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",32,"^1=",["^18",[["^2@"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",78,"^15",78,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^2@"]]]]],"^1:","Remove a component from the given DOM node."],"~$render-component",["^ ","^F","~$reagent.core/render-component","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",85,"^14",1,"^15",85,"^16",22,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",85,"^14",6,"^15",85,"^16",22]],"~$component-path",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",343,"^14",7,"^15",343,"^16",21,"^17",["^18",["^19",["^18",[["~$c"]]]]]],"^F","~$reagent.core/component-path","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",21,"^1=",["^18",[["~$c"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",343,"^15",343,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["~$c"]]]]]],"~$cursor",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",268,"^14",7,"^15",268,"^16",13,"^17",["^18",["^19",["^18",[["~$src","~$path"]]]]],"^1:","Provide a cursor into a Reagent atom.\n\n  Behaves like a Reagent atom but focuses updates and derefs to\n  the specified path within the wrapped Reagent atom. e.g.,\n    (let [c (cursor ra [:nested :content])]\n      ... @c ;; equivalent to (get-in @ra [:nested :content])\n      ... (reset! c 42) ;; equivalent to (swap! ra assoc-in [:nested :content] 42)\n      ... (swap! c inc) ;; equivalence to (swap! ra update-in [:nested :content] inc)\n      )\n\n  The first parameter can also be a function, that should look\n  something like this:\n\n    (defn set-get\n      ([k] (get-in @state k))\n      ([k v] (swap! state assoc-in k v)))\n\n  The function will be called with one argument – the path passed to\n  cursor – when the cursor is deref'ed, and two arguments (path and\n  new value) when the cursor is modified.\n\n  Given that set-get function, (and that state is a Reagent atom, or\n  another cursor) these cursors are equivalent:\n  (cursor state [:foo]) and (cursor set-get [:foo]).\n\n  Note that a cursor is lazy: its value will not change until it is\n  used. This may be noticed with add-watch."],"^F","~$reagent.core/cursor","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",13,"^1=",["^18",[["^2G","^2H"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",268,"^15",268,"^1@",2,"^1A",true,"^17",["^18",["^19",["^18",[["^2G","^2H"]]]]],"^1:","Provide a cursor into a Reagent atom.\n\n  Behaves like a Reagent atom but focuses updates and derefs to\n  the specified path within the wrapped Reagent atom. e.g.,\n    (let [c (cursor ra [:nested :content])]\n      ... @c ;; equivalent to (get-in @ra [:nested :content])\n      ... (reset! c 42) ;; equivalent to (swap! ra assoc-in [:nested :content] 42)\n      ... (swap! c inc) ;; equivalence to (swap! ra update-in [:nested :content] inc)\n      )\n\n  The first parameter can also be a function, that should look\n  something like this:\n\n    (defn set-get\n      ([k] (get-in @state k))\n      ([k v] (swap! state assoc-in k v)))\n\n  The function will be called with one argument – the path passed to\n  cursor – when the cursor is deref'ed, and two arguments (path and\n  new value) when the cursor is modified.\n\n  Given that set-get function, (and that state is a Reagent atom, or\n  another cursor) these cursors are equivalent:\n  (cursor state [:foo]) and (cursor set-get [:foo]).\n\n  Note that a cursor is lazy: its value will not change until it is\n  used. This may be noticed with add-watch."],"~$state",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",133,"^14",7,"^15",133,"^16",12,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the state of a component, as set with replace-state or set-state.\n  Equivalent to (deref (r/state-atom this))"],"^F","~$reagent.core/state","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",12,"^1=",["^18",[["^20"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",133,"^15",133,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the state of a component, as set with replace-state or set-state.\n  Equivalent to (deref (r/state-atom this))"],"~$dom-node",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",186,"^14",7,"^15",186,"^16",15,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the root DOM node of a mounted component."],"^F","~$reagent.core/dom-node","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",15,"^1=",["^18",[["^20"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",186,"^15",186,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the root DOM node of a mounted component."],"~$track!",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",232,"^14",7,"^15",232,"^16",13,"^17",["^18",["^19",["^18",[["~$f","~$&","^1V"]]]]],"^1:","An eager version of track. The function passed is called\n  immediately, and continues to be called when needed, until stopped\n  with dispose!.","^1I",["^ ","^1<",true,"^1@",1,"^1=",[["^18",["~$f","^1V"]]],"^17",["^18",[["~$f","~$&","^1V"]]],"^1?",["^18",[null]]]],"^F","~$reagent.core/track!","^1<",true,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",13,"^1I",["^ ","^1<",true,"^1@",1,"^1=",[["^18",["~$f","^1V"]]],"^17",["^18",[["~$f","~$&","^1V"]]],"^1?",["^18",[null]]],"^1=",[["^18",["~$f","^1V"]]],"^1>",null,"^1?",["^18",[null]],"^14",1,"^13",232,"^15",232,"^1@",1,"^1A",true,"^17",["^18",[["~$f","~$&","^1V"]]],"^1:","An eager version of track. The function passed is called\n  immediately, and continues to be called when needed, until stopped\n  with dispose!."],"~$is-client",["^ ","^F","~$reagent.core/is-client","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",17,"^14",1,"^15",17,"^16",15,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",17,"^14",6,"^15",17,"^16",15],"~:tag","~$boolean"],"~$replace-state",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",140,"^14",7,"^15",140,"^16",20,"^17",["^18",["^19",["^18",[["^20","~$new-state"]]]]],"^1:","Set state of a component.\n  Equivalent to (reset! (state-atom this) new-state)"],"^F","~$reagent.core/replace-state","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",20,"^1=",["^18",[["^20","^2U"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",140,"^15",140,"^1@",2,"^1A",true,"^17",["^18",["^19",["^18",[["^20","^2U"]]]]],"^1:","Set state of a component.\n  Equivalent to (reset! (state-atom this) new-state)"],"^E",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",338,"^14",7,"^15",338,"^16",14,"^17",["^18",["^19",["^18",[["~$f","~$&","^1V"]]]]],"^1:","Works just like clojure.core/partial, but the result can be compared with =","^1I",["^ ","^1<",true,"^1@",1,"^1=",[["^18",["~$f","^1V"]]],"^17",["^18",[["~$f","~$&","^1V"]]],"^1?",["^18",[null]]]],"^F","~$reagent.core/partial","^1<",true,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",14,"^1I",["^ ","^1<",true,"^1@",1,"^1=",[["^18",["~$f","^1V"]]],"^17",["^18",[["~$f","~$&","^1V"]]],"^1?",["^18",[null]]],"^1=",[["^18",["~$f","^1V"]]],"^1>",null,"^1?",["^18",[null]],"^14",1,"^13",338,"^15",338,"^1@",1,"^1A",true,"^17",["^18",[["~$f","~$&","^1V"]]],"^1:","Works just like clojure.core/partial, but the result can be compared with ="],"~$set-state",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",148,"^14",7,"^15",148,"^16",16,"^17",["^18",["^19",["^18",[["^20","^2U"]]]]],"^1:","Merge component state with new-state.\n  Equivalent to (swap! (state-atom this) merge new-state)"],"^F","~$reagent.core/set-state","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",16,"^1=",["^18",[["^20","^2U"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",148,"^15",148,"^1@",2,"^1A",true,"^17",["^18",["^19",["^18",[["^20","^2U"]]]]],"^1:","Merge component state with new-state.\n  Equivalent to (swap! (state-atom this) merge new-state)"],"~$argv",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",180,"^14",7,"^15",180,"^16",11,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the entire Hiccup form passed to the component."],"^F","~$reagent.core/argv","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",11,"^1=",["^18",[["^20"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",180,"^15",180,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^20"]]]]],"^1:","Returns the entire Hiccup form passed to the component."],"~$render",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",65,"^14",7,"^15",65,"^16",13,"^17",["^18",["^19",["^18",[["^M","^2@"],["^M","^2@","~$callback"]]]]],"^1:","Render a Reagent component into the DOM. The first argument may be\n  either a vector (using Reagent's Hiccup syntax), or a React element.\n  The second argument should be a DOM node.\n\n  Optionally takes a callback that is called when the component is in place.\n\n  Returns the mounted component instance.","^1I",["^ ","^1<",false,"^1@",3,"^1=",["^18",[["^M","^2@"],["^M","^2@","^31"]]],"^17",["^18",[["^M","^2@"],["^M","^2@","^31"]]],"^1?",["^18",[null,null]]]],"^F","~$reagent.core/render","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",13,"^1I",["^ ","^1<",false,"^1@",3,"^1=",["^18",[["^M","^2@"],["^M","^2@","^31"]]],"^17",["^18",[["^M","^2@"],["^M","^2@","^31"]]],"^1?",["^18",[null,null]]],"^1=",["^18",[["^M","^2@"],["^M","^2@","^31"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",65,"^15",65,"^1@",3,"^1A",true,"^17",["^18",[["^M","^2@"],["^M","^2@","^31"]]],"^1:","Render a Reagent component into the DOM. The first argument may be\n  either a vector (using Reagent's Hiccup syntax), or a React element.\n  The second argument should be a DOM node.\n\n  Optionally takes a callback that is called when the component is in place.\n\n  Returns the mounted component instance."],"~$force-update",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",156,"^14",7,"^15",156,"^16",19,"^17",["^18",["^19",["^18",[["^20"],["^20","~$deep"]]]]],"^1:","Force a component to re-render immediately.\n\n  If the second argument is true, child components will also be\n  re-rendered, even is their arguments have not changed.","^1I",["^ ","^1<",false,"^1@",2,"^1=",["^18",[["^20"],["^20","^34"]]],"^17",["^18",[["^20"],["^20","^34"]]],"^1?",["^18",[null,null]]]],"^F","~$reagent.core/force-update","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",19,"^1I",["^ ","^1<",false,"^1@",2,"^1=",["^18",[["^20"],["^20","^34"]]],"^17",["^18",[["^20"],["^20","^34"]]],"^1?",["^18",[null,null]]],"^1=",["^18",[["^20"],["^20","^34"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",156,"^15",156,"^1@",2,"^1A",true,"^17",["^18",[["^20"],["^20","^34"]]],"^1:","Force a component to re-render immediately.\n\n  If the second argument is true, child components will also be\n  re-rendered, even is their arguments have not changed."],"~$create-class",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",102,"^14",7,"^15",102,"^16",19,"^17",["^18",["^19",["^18",[["~$spec"]]]]],"^1:","Create a component, React style. Should be called with a map,\n  looking like this:\n\n    {:get-initial-state (fn [this])\n     :component-will-receive-props (fn [this new-argv])\n     :should-component-update (fn [this old-argv new-argv])\n     :component-will-mount (fn [this])\n     :component-did-mount (fn [this])\n     :component-will-update (fn [this new-argv])\n     :component-did-update (fn [this old-argv])\n     :component-will-unmount (fn [this])\n     :reagent-render (fn [args....])}   ;; or :render (fn [this])\n\n  Everything is optional, except either :reagent-render or :render."],"^F","~$reagent.core/create-class","^1<",false,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",19,"^1=",["^18",[["^37"]]],"^1>",null,"^1?",["^18",[null,null]],"^14",1,"^13",102,"^15",102,"^1@",1,"^1A",true,"^17",["^18",["^19",["^18",[["^37"]]]]],"^1:","Create a component, React style. Should be called with a map,\n  looking like this:\n\n    {:get-initial-state (fn [this])\n     :component-will-receive-props (fn [this new-argv])\n     :should-component-update (fn [this old-argv new-argv])\n     :component-will-mount (fn [this])\n     :component-did-mount (fn [this])\n     :component-will-update (fn [this new-argv])\n     :component-did-update (fn [this old-argv])\n     :component-will-unmount (fn [this])\n     :reagent-render (fn [args....])}   ;; or :render (fn [this])\n\n  Everything is optional, except either :reagent-render or :render."],"~$create-element",["^ ","^10",null,"^11",["^ ","^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^13",19,"^14",7,"^15",19,"^16",21,"^17",["^18",["^19",["^18",[["~$type"],["^3:","^1M"],["^3:","^1M","~$child"],["^3:","^1M","^3;","~$&","^27"]]]]],"^1:","Create a native React element, by calling React.createElement directly.\n\n  That means the second argument must be a javascript object (or nil), and\n  that any Reagent hiccup forms must be processed with as-element. For example\n  like this:\n\n    (r/create-element \"div\" #js{:className \"foo\"}\n       \"Hi \" (r/as-element [:strong \"world!\"])\n\n  which is equivalent to\n\n    [:div.foo \"Hi\" [:strong \"world!\"]]","^1I",["^ ","^1<",true,"^1@",3,"^1=",["^18",[["^3:"],["^3:","^1M"],["^3:","^1M","^3;"]]],"^17",["^18",[["^3:"],["^3:","^1M"],["^3:","^1M","^3;"],["^3:","^1M","^3;","~$&","^27"]]],"^1?",["^18",[null,null,null,null]]]],"^F","~$reagent.core/create-element","^1<",true,"^12","/home/julien/.cljs/.aot_cache/1.10.329/D55AC72/reagent/core.cljs","^16",21,"^1I",["^ ","^1<",true,"^1@",3,"^1=",["^18",[["^3:"],["^3:","^1M"],["^3:","^1M","^3;"]]],"^17",["^18",[["^3:"],["^3:","^1M"],["^3:","^1M","^3;"],["^3:","^1M","^3;","~$&","^27"]]],"^1?",["^18",[null,null,null,null]]],"^1=",["^18",[["^3:"],["^3:","^1M"],["^3:","^1M","^3;"]]],"^1>",null,"^1?",["^18",[null,null,null,null]],"^14",1,"^13",19,"^15",19,"^1@",3,"^1A",true,"^17",["^18",[["^3:"],["^3:","^1M"],["^3:","^1M","^3;"],["^3:","^1M","^3;","~$&","^27"]]],"^1:","Create a native React element, by calling React.createElement directly.\n\n  That means the second argument must be a javascript object (or nil), and\n  that any Reagent hiccup forms must be processed with as-element. For example\n  like this:\n\n    (r/create-element \"div\" #js{:className \"foo\"}\n       \"Hi \" (r/as-element [:strong \"world!\"])\n\n  which is equivalent to\n\n    [:div.foo \"Hi\" [:strong \"world!\"]]"]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^G","^G","^U","^O","^O","^O","^V","^8","^8","^8","^=","^="],"^1:",null]
\ No newline at end of file
diff --git a/js/reagent/core.js b/js/reagent/core.js
new file mode 100644
index 0000000..8bf6baf
--- /dev/null
+++ b/js/reagent/core.js
@@ -0,0 +1,770 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.core');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('reagent.impl.template');
+goog.require('reagent.impl.component');
+goog.require('reagent.impl.util');
+goog.require('reagent.impl.batching');
+goog.require('reagent.ratom');
+goog.require('reagent.debug');
+goog.require('reagent.interop');
+goog.require('reagent.dom');
+reagent.core.global$module$react = goog.global["React"];
+reagent.core.is_client = reagent.impl.util.is_client;
+/**
+ * Create a native React element, by calling React.createElement directly.
+ * 
+ *   That means the second argument must be a javascript object (or nil), and
+ *   that any Reagent hiccup forms must be processed with as-element. For example
+ *   like this:
+ * 
+ *  (r/create-element "div" #js{:className "foo"}
+ *     "Hi " (r/as-element [:strong "world!"])
+ * 
+ *   which is equivalent to
+ * 
+ *  [:div.foo "Hi" [:strong "world!"]]
+ */
+reagent.core.create_element = (function reagent$core$create_element(var_args){
+var G__3922 = arguments.length;
+switch (G__3922) {
+case 1:
+return reagent.core.create_element.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return reagent.core.create_element.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return reagent.core.create_element.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3924 = arguments.length;
+var i__4519__auto___3925 = (0);
+while(true){
+if((i__4519__auto___3925 < len__4518__auto___3924)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3925]));
+
+var G__3926 = (i__4519__auto___3925 + (1));
+i__4519__auto___3925 = G__3926;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((3)),(0),null));
+return reagent.core.create_element.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4534__auto__);
+
+}
+});
+
+reagent.core.create_element.cljs$core$IFn$_invoke$arity$1 = (function (type){
+return reagent.core.create_element.cljs$core$IFn$_invoke$arity$2(type,null);
+});
+
+reagent.core.create_element.cljs$core$IFn$_invoke$arity$2 = (function (type,props){
+if(!(cljs.core.map_QMARK_(props))){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a JS object, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([props], 0)))].join('')),"\n","(clojure.core/not (clojure.core/map? props))"].join('')));
+}
+
+return (reagent.core.global$module$react.createElement.cljs$core$IFn$_invoke$arity$2 ? reagent.core.global$module$react.createElement.cljs$core$IFn$_invoke$arity$2(type,props) : reagent.core.global$module$react.createElement.call(null,type,props));
+});
+
+reagent.core.create_element.cljs$core$IFn$_invoke$arity$3 = (function (type,props,child){
+if(!(cljs.core.map_QMARK_(props))){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a JS object, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([props], 0)))].join('')),"\n","(clojure.core/not (clojure.core/map? props))"].join('')));
+}
+
+return (reagent.core.global$module$react.createElement.cljs$core$IFn$_invoke$arity$3 ? reagent.core.global$module$react.createElement.cljs$core$IFn$_invoke$arity$3(type,props,child) : reagent.core.global$module$react.createElement.call(null,type,props,child));
+});
+
+reagent.core.create_element.cljs$core$IFn$_invoke$arity$variadic = (function (type,props,child,children){
+if(!(cljs.core.map_QMARK_(props))){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a JS object, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([props], 0)))].join('')),"\n","(clojure.core/not (clojure.core/map? props))"].join('')));
+}
+
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(reagent.core.global$module$react.createElement,type,props,child,children);
+});
+
+/** @this {Function} */
+reagent.core.create_element.cljs$lang$applyTo = (function (seq3918){
+var G__3919 = cljs.core.first(seq3918);
+var seq3918__$1 = cljs.core.next(seq3918);
+var G__3920 = cljs.core.first(seq3918__$1);
+var seq3918__$2 = cljs.core.next(seq3918__$1);
+var G__3921 = cljs.core.first(seq3918__$2);
+var seq3918__$3 = cljs.core.next(seq3918__$2);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3919,G__3920,G__3921,seq3918__$3);
+});
+
+reagent.core.create_element.cljs$lang$maxFixedArity = (3);
+
+/**
+ * Turns a vector of Hiccup syntax into a React element. Returns form
+ *   unchanged if it is not a vector.
+ */
+reagent.core.as_element = (function reagent$core$as_element(form){
+return reagent.impl.template.as_element(form);
+});
+/**
+ * Returns an adapter for a native React class, that may be used
+ *   just like a Reagent component function or class in Hiccup forms.
+ */
+reagent.core.adapt_react_class = (function reagent$core$adapt_react_class(c){
+if(cljs.core.truth_(c)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Component"," must not be nil"].join('')),"\n","c"].join('')));
+}
+
+return reagent.impl.template.adapt_react_class(c);
+});
+/**
+ * Returns an adapter for a Reagent component, that may be used from
+ *   React, for example in JSX. A single argument, props, is passed to
+ *   the component, converted to a map.
+ */
+reagent.core.reactify_component = (function reagent$core$reactify_component(c){
+if(cljs.core.truth_(c)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Component"," must not be nil"].join('')),"\n","c"].join('')));
+}
+
+return reagent.impl.component.reactify_component(c);
+});
+/**
+ * Render a Reagent component into the DOM. The first argument may be
+ *   either a vector (using Reagent's Hiccup syntax), or a React element.
+ *   The second argument should be a DOM node.
+ * 
+ *   Optionally takes a callback that is called when the component is in place.
+ * 
+ *   Returns the mounted component instance.
+ */
+reagent.core.render = (function reagent$core$render(var_args){
+var G__3928 = arguments.length;
+switch (G__3928) {
+case 2:
+return reagent.core.render.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return reagent.core.render.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+reagent.core.render.cljs$core$IFn$_invoke$arity$2 = (function (comp,container){
+return reagent.dom.render.cljs$core$IFn$_invoke$arity$2(comp,container);
+});
+
+reagent.core.render.cljs$core$IFn$_invoke$arity$3 = (function (comp,container,callback){
+return reagent.dom.render.cljs$core$IFn$_invoke$arity$3(comp,container,callback);
+});
+
+reagent.core.render.cljs$lang$maxFixedArity = 3;
+
+/**
+ * Remove a component from the given DOM node.
+ */
+reagent.core.unmount_component_at_node = (function reagent$core$unmount_component_at_node(container){
+return reagent.dom.unmount_component_at_node(container);
+});
+reagent.core.as_component = reagent.core.as_element;
+reagent.core.render_component = reagent.core.render;
+/**
+ * Force re-rendering of all mounted Reagent components. This is
+ *   probably only useful in a development environment, when you want to
+ *   update components in response to some dynamic changes to code.
+ * 
+ *   Note that force-update-all may not update root components. This
+ *   happens if a component 'foo' is mounted with `(render [foo])` (since
+ *   functions are passed by value, and not by reference, in
+ *   ClojureScript). To get around this you'll have to introduce a layer
+ *   of indirection, for example by using `(render [#'foo])` instead.
+ */
+reagent.core.force_update_all = (function reagent$core$force_update_all(){
+reagent.ratom.flush_BANG_();
+
+reagent.dom.force_update_all();
+
+return reagent.impl.batching.flush_after_render();
+});
+goog.exportSymbol('reagent.core.force_update_all', reagent.core.force_update_all);
+/**
+ * Create a component, React style. Should be called with a map,
+ *   looking like this:
+ * 
+ *  {:get-initial-state (fn [this])
+ *   :component-will-receive-props (fn [this new-argv])
+ *   :should-component-update (fn [this old-argv new-argv])
+ *   :component-will-mount (fn [this])
+ *   :component-did-mount (fn [this])
+ *   :component-will-update (fn [this new-argv])
+ *   :component-did-update (fn [this old-argv])
+ *   :component-will-unmount (fn [this])
+ *   :reagent-render (fn [args....])}   ;; or :render (fn [this])
+ * 
+ *   Everything is optional, except either :reagent-render or :render.
+ */
+reagent.core.create_class = (function reagent$core$create_class(spec){
+return reagent.impl.component.create_class(spec);
+});
+/**
+ * Returns the current React component (a.k.a this) in a component
+ *   function.
+ */
+reagent.core.current_component = (function reagent$core$current_component(){
+return reagent.impl.component._STAR_current_component_STAR_;
+});
+/**
+ * Returns an atom containing a components state.
+ */
+reagent.core.state_atom = (function reagent$core$state_atom(this$){
+if(reagent.impl.component.reagent_component_QMARK_(this$)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a reagent component, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$], 0)))].join('')),"\n","(comp/reagent-component? this)"].join('')));
+}
+
+return reagent.impl.component.state_atom(this$);
+});
+/**
+ * Returns the state of a component, as set with replace-state or set-state.
+ *   Equivalent to (deref (r/state-atom this))
+ */
+reagent.core.state = (function reagent$core$state(this$){
+if(reagent.impl.component.reagent_component_QMARK_(this$)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a reagent component, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$], 0)))].join('')),"\n","(comp/reagent-component? this)"].join('')));
+}
+
+return cljs.core.deref(reagent.core.state_atom(this$));
+});
+/**
+ * Set state of a component.
+ *   Equivalent to (reset! (state-atom this) new-state)
+ */
+reagent.core.replace_state = (function reagent$core$replace_state(this$,new_state){
+if(reagent.impl.component.reagent_component_QMARK_(this$)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a reagent component, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$], 0)))].join('')),"\n","(comp/reagent-component? this)"].join('')));
+}
+
+if((((new_state == null)) || (cljs.core.map_QMARK_(new_state)))){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a valid new state, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([new_state], 0)))].join('')),"\n","(clojure.core/or (clojure.core/nil? new-state) (clojure.core/map? new-state))"].join('')));
+}
+
+return cljs.core.reset_BANG_(reagent.core.state_atom(this$),new_state);
+});
+/**
+ * Merge component state with new-state.
+ *   Equivalent to (swap! (state-atom this) merge new-state)
+ */
+reagent.core.set_state = (function reagent$core$set_state(this$,new_state){
+if(reagent.impl.component.reagent_component_QMARK_(this$)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a reagent component, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$], 0)))].join('')),"\n","(comp/reagent-component? this)"].join('')));
+}
+
+if((((new_state == null)) || (cljs.core.map_QMARK_(new_state)))){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a valid new state, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([new_state], 0)))].join('')),"\n","(clojure.core/or (clojure.core/nil? new-state) (clojure.core/map? new-state))"].join('')));
+}
+
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(reagent.core.state_atom(this$),cljs.core.merge,new_state);
+});
+/**
+ * Force a component to re-render immediately.
+ * 
+ *   If the second argument is true, child components will also be
+ *   re-rendered, even is their arguments have not changed.
+ */
+reagent.core.force_update = (function reagent$core$force_update(var_args){
+var G__3931 = arguments.length;
+switch (G__3931) {
+case 1:
+return reagent.core.force_update.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return reagent.core.force_update.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+reagent.core.force_update.cljs$core$IFn$_invoke$arity$1 = (function (this$){
+return reagent.core.force_update.cljs$core$IFn$_invoke$arity$2(this$,false);
+});
+
+reagent.core.force_update.cljs$core$IFn$_invoke$arity$2 = (function (this$,deep){
+reagent.ratom.flush_BANG_();
+
+reagent.impl.util.force_update(this$,deep);
+
+return reagent.impl.batching.flush_after_render();
+});
+
+reagent.core.force_update.cljs$lang$maxFixedArity = 2;
+
+/**
+ * Returns the props passed to a component.
+ */
+reagent.core.props = (function reagent$core$props(this$){
+if(reagent.impl.component.reagent_component_QMARK_(this$)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a reagent component, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$], 0)))].join('')),"\n","(comp/reagent-component? this)"].join('')));
+}
+
+return reagent.impl.component.get_props(this$);
+});
+/**
+ * Returns the children passed to a component.
+ */
+reagent.core.children = (function reagent$core$children(this$){
+if(reagent.impl.component.reagent_component_QMARK_(this$)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a reagent component, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$], 0)))].join('')),"\n","(comp/reagent-component? this)"].join('')));
+}
+
+return reagent.impl.component.get_children(this$);
+});
+/**
+ * Returns the entire Hiccup form passed to the component.
+ */
+reagent.core.argv = (function reagent$core$argv(this$){
+if(reagent.impl.component.reagent_component_QMARK_(this$)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected a reagent component, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$], 0)))].join('')),"\n","(comp/reagent-component? this)"].join('')));
+}
+
+return reagent.impl.component.get_argv(this$);
+});
+/**
+ * Returns the root DOM node of a mounted component.
+ */
+reagent.core.dom_node = (function reagent$core$dom_node(this$){
+return reagent.dom.dom_node(this$);
+});
+/**
+ * Utility function that merges two maps, handling :class and :style
+ *   specially, like React's transferPropsTo.
+ */
+reagent.core.merge_props = (function reagent$core$merge_props(defaults,props){
+return reagent.impl.util.merge_props(defaults,props);
+});
+/**
+ * Render dirty components immediately to the DOM.
+ * 
+ *   Note that this may not work in event handlers, since React.js does
+ *   batching of updates there.
+ */
+reagent.core.flush = (function reagent$core$flush(){
+return reagent.impl.batching.flush();
+});
+/**
+ * Like clojure.core/atom, except that it keeps track of derefs.
+ *   Reagent components that derefs one of these are automatically
+ *   re-rendered.
+ */
+reagent.core.atom = (function reagent$core$atom(var_args){
+var G__3936 = arguments.length;
+switch (G__3936) {
+case 1:
+return reagent.core.atom.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3938 = arguments.length;
+var i__4519__auto___3939 = (0);
+while(true){
+if((i__4519__auto___3939 < len__4518__auto___3938)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3939]));
+
+var G__3940 = (i__4519__auto___3939 + (1));
+i__4519__auto___3939 = G__3940;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((1)),(0),null));
+return reagent.core.atom.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4534__auto__);
+
+}
+});
+
+reagent.core.atom.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return reagent.ratom.atom.cljs$core$IFn$_invoke$arity$1(x);
+});
+
+reagent.core.atom.cljs$core$IFn$_invoke$arity$variadic = (function (x,rest){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(reagent.ratom.atom,x,rest);
+});
+
+/** @this {Function} */
+reagent.core.atom.cljs$lang$applyTo = (function (seq3934){
+var G__3935 = cljs.core.first(seq3934);
+var seq3934__$1 = cljs.core.next(seq3934);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3935,seq3934__$1);
+});
+
+reagent.core.atom.cljs$lang$maxFixedArity = (1);
+
+/**
+ * Takes a function and optional arguments, and returns a derefable
+ *   containing the output of that function. If the function derefs
+ *   Reagent atoms (or track, etc), the value will be updated whenever
+ *   the atom changes.
+ * 
+ *   In other words, @(track foo bar) will produce the same result
+ *   as (foo bar), but foo will only be called again when the atoms it
+ *   depends on changes, and will only trigger updates of components when
+ *   its result changes.
+ * 
+ *   track is lazy, i.e the function is only evaluated on deref.
+ */
+reagent.core.track = (function reagent$core$track(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3943 = arguments.length;
+var i__4519__auto___3944 = (0);
+while(true){
+if((i__4519__auto___3944 < len__4518__auto___3943)){
+args__4521__auto__.push((arguments[i__4519__auto___3944]));
+
+var G__3945 = (i__4519__auto___3944 + (1));
+i__4519__auto___3944 = G__3945;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return reagent.core.track.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+reagent.core.track.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
+if(cljs.core.ifn_QMARK_(f)){
+} else {
+throw (new Error("Assert failed: (ifn? f)"));
+}
+
+return reagent.ratom.make_track(f,args);
+});
+
+reagent.core.track.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+reagent.core.track.cljs$lang$applyTo = (function (seq3941){
+var G__3942 = cljs.core.first(seq3941);
+var seq3941__$1 = cljs.core.next(seq3941);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3942,seq3941__$1);
+});
+
+/**
+ * An eager version of track. The function passed is called
+ *   immediately, and continues to be called when needed, until stopped
+ *   with dispose!.
+ */
+reagent.core.track_BANG_ = (function reagent$core$track_BANG_(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3948 = arguments.length;
+var i__4519__auto___3949 = (0);
+while(true){
+if((i__4519__auto___3949 < len__4518__auto___3948)){
+args__4521__auto__.push((arguments[i__4519__auto___3949]));
+
+var G__3950 = (i__4519__auto___3949 + (1));
+i__4519__auto___3949 = G__3950;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return reagent.core.track_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+reagent.core.track_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
+if(cljs.core.ifn_QMARK_(f)){
+} else {
+throw (new Error("Assert failed: (ifn? f)"));
+}
+
+return reagent.ratom.make_track_BANG_(f,args);
+});
+
+reagent.core.track_BANG_.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+reagent.core.track_BANG_.cljs$lang$applyTo = (function (seq3946){
+var G__3947 = cljs.core.first(seq3946);
+var seq3946__$1 = cljs.core.next(seq3946);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3947,seq3946__$1);
+});
+
+/**
+ * Stop the result of track! from updating.
+ */
+reagent.core.dispose_BANG_ = (function reagent$core$dispose_BANG_(x){
+return reagent.ratom.dispose_BANG_(x);
+});
+/**
+ * Provide a combination of value and callback, that looks like an atom.
+ * 
+ *   The first argument can be any value, that will be returned when the
+ *   result is deref'ed.
+ * 
+ *   The second argument should be a function, that is called with the
+ *   optional extra arguments provided to wrap, and the new value of the
+ *   resulting 'atom'.
+ * 
+ *   Use for example like this:
+ * 
+ *   (wrap (:foo @state)
+ *      swap! state assoc :foo)
+ * 
+ *   Probably useful only for passing to child components.
+ */
+reagent.core.wrap = (function reagent$core$wrap(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3954 = arguments.length;
+var i__4519__auto___3955 = (0);
+while(true){
+if((i__4519__auto___3955 < len__4518__auto___3954)){
+args__4521__auto__.push((arguments[i__4519__auto___3955]));
+
+var G__3956 = (i__4519__auto___3955 + (1));
+i__4519__auto___3955 = G__3956;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((2) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((2)),(0),null)):null);
+return reagent.core.wrap.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4522__auto__);
+});
+
+reagent.core.wrap.cljs$core$IFn$_invoke$arity$variadic = (function (value,reset_fn,args){
+if(cljs.core.ifn_QMARK_(reset_fn)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected something callable, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([reset_fn], 0)))].join('')),"\n","(clojure.core/ifn? reset-fn)"].join('')));
+}
+
+return reagent.ratom.make_wrapper(value,reset_fn,args);
+});
+
+reagent.core.wrap.cljs$lang$maxFixedArity = (2);
+
+/** @this {Function} */
+reagent.core.wrap.cljs$lang$applyTo = (function (seq3951){
+var G__3952 = cljs.core.first(seq3951);
+var seq3951__$1 = cljs.core.next(seq3951);
+var G__3953 = cljs.core.first(seq3951__$1);
+var seq3951__$2 = cljs.core.next(seq3951__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3952,G__3953,seq3951__$2);
+});
+
+/**
+ * Provide a cursor into a Reagent atom.
+ * 
+ *   Behaves like a Reagent atom but focuses updates and derefs to
+ *   the specified path within the wrapped Reagent atom. e.g.,
+ *  (let [c (cursor ra [:nested :content])]
+ *    ... @c ;; equivalent to (get-in @ra [:nested :content])
+ *    ... (reset! c 42) ;; equivalent to (swap! ra assoc-in [:nested :content] 42)
+ *    ... (swap! c inc) ;; equivalence to (swap! ra update-in [:nested :content] inc)
+ *    )
+ * 
+ *   The first parameter can also be a function, that should look
+ *   something like this:
+ * 
+ *  (defn set-get
+ *    ([k] (get-in @state k))
+ *    ([k v] (swap! state assoc-in k v)))
+ * 
+ *   The function will be called with one argument – the path passed to
+ *   cursor – when the cursor is deref'ed, and two arguments (path and
+ *   new value) when the cursor is modified.
+ * 
+ *   Given that set-get function, (and that state is a Reagent atom, or
+ *   another cursor) these cursors are equivalent:
+ *   (cursor state [:foo]) and (cursor set-get [:foo]).
+ * 
+ *   Note that a cursor is lazy: its value will not change until it is
+ *   used. This may be noticed with add-watch.
+ */
+reagent.core.cursor = (function reagent$core$cursor(src,path){
+return reagent.ratom.cursor(src,path);
+});
+/**
+ * Swaps the value of a to be (apply f current-value-of-atom args).
+ * 
+ *   rswap! works like swap!, except that recursive calls to rswap! on
+ *   the same atom are allowed – and it always returns nil.
+ */
+reagent.core.rswap_BANG_ = (function reagent$core$rswap_BANG_(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3963 = arguments.length;
+var i__4519__auto___3964 = (0);
+while(true){
+if((i__4519__auto___3964 < len__4518__auto___3963)){
+args__4521__auto__.push((arguments[i__4519__auto___3964]));
+
+var G__3965 = (i__4519__auto___3964 + (1));
+i__4519__auto___3964 = G__3965;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((2) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((2)),(0),null)):null);
+return reagent.core.rswap_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4522__auto__);
+});
+
+reagent.core.rswap_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (a,f,args){
+if(((!((a == null)))?(((((a.cljs$lang$protocol_mask$partition1$ & (16384))) || ((cljs.core.PROTOCOL_SENTINEL === a.cljs$core$IAtom$))))?true:(((!a.cljs$lang$protocol_mask$partition1$))?cljs.core.native_satisfies_QMARK_(cljs.core.IAtom,a):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IAtom,a))){
+} else {
+throw (new Error("Assert failed: (satisfies? IAtom a)"));
+}
+
+if(cljs.core.ifn_QMARK_(f)){
+} else {
+throw (new Error("Assert failed: (ifn? f)"));
+}
+
+if(cljs.core.truth_(a.rswapping)){
+(function (){var or__3936__auto__ = a.rswapfs;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return a.rswapfs = [];
+}
+})().push((function (p1__3957_SHARP_){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(f,p1__3957_SHARP_,args);
+}));
+} else {
+a.rswapping = true;
+
+try{cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(a,(function (state){
+var s = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(f,state,args);
+while(true){
+var temp__5459__auto__ = (function (){var G__3962 = a.rswapfs;
+if((G__3962 == null)){
+return null;
+} else {
+return G__3962.shift();
+}
+})();
+if((temp__5459__auto__ == null)){
+return s;
+} else {
+var sf = temp__5459__auto__;
+var G__3966 = (sf.cljs$core$IFn$_invoke$arity$1 ? sf.cljs$core$IFn$_invoke$arity$1(s) : sf.call(null,s));
+s = G__3966;
+continue;
+}
+break;
+}
+}));
+}finally {a.rswapping = false;
+}}
+
+return null;
+});
+
+reagent.core.rswap_BANG_.cljs$lang$maxFixedArity = (2);
+
+/** @this {Function} */
+reagent.core.rswap_BANG_.cljs$lang$applyTo = (function (seq3958){
+var G__3959 = cljs.core.first(seq3958);
+var seq3958__$1 = cljs.core.next(seq3958);
+var G__3960 = cljs.core.first(seq3958__$1);
+var seq3958__$2 = cljs.core.next(seq3958__$1);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3959,G__3960,seq3958__$2);
+});
+
+/**
+ * Run f using requestAnimationFrame or equivalent.
+ * 
+ *   f will be called just before components are rendered.
+ */
+reagent.core.next_tick = (function reagent$core$next_tick(f){
+return reagent.impl.batching.do_before_flush(f);
+});
+/**
+ * Run f using requestAnimationFrame or equivalent.
+ * 
+ *   f will be called just after any queued renders in the next animation
+ *   frame (and even if no renders actually occur).
+ */
+reagent.core.after_render = (function reagent$core$after_render(f){
+return reagent.impl.batching.do_after_render(f);
+});
+/**
+ * Works just like clojure.core/partial, but the result can be compared with =
+ */
+reagent.core.partial = (function reagent$core$partial(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3969 = arguments.length;
+var i__4519__auto___3970 = (0);
+while(true){
+if((i__4519__auto___3970 < len__4518__auto___3969)){
+args__4521__auto__.push((arguments[i__4519__auto___3970]));
+
+var G__3971 = (i__4519__auto___3970 + (1));
+i__4519__auto___3970 = G__3971;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return reagent.core.partial.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+reagent.core.partial.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
+return reagent.impl.util.make_partial_fn(f,args);
+});
+
+reagent.core.partial.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+reagent.core.partial.cljs$lang$applyTo = (function (seq3967){
+var G__3968 = cljs.core.first(seq3967);
+var seq3967__$1 = cljs.core.next(seq3967);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3968,seq3967__$1);
+});
+
+reagent.core.component_path = (function reagent$core$component_path(c){
+return reagent.impl.component.component_path(c);
+});
diff --git a/js/reagent/debug.cljs b/js/reagent/debug.cljs
new file mode 100644
index 0000000..2a272bb
--- /dev/null
+++ b/js/reagent/debug.cljs
@@ -0,0 +1,27 @@
+(ns reagent.debug
+  (:require-macros [reagent.debug]))
+
+(def ^:const has-console (exists? js/console))
+
+(def ^boolean tracking false)
+
+(defonce warnings (atom nil))
+
+(defonce track-console
+  (let [o #js{}]
+    (set! (.-warn o)
+          (fn [& args]
+            (swap! warnings update-in [:warn] conj (apply str args))))
+    (set! (.-error o)
+          (fn [& args]
+            (swap! warnings update-in [:error] conj (apply str args))))
+    o))
+
+(defn track-warnings [f]
+  (set! tracking true)
+  (reset! warnings nil)
+  (f)
+  (let [warns @warnings]
+    (reset! warnings nil)
+    (set! tracking false)
+    warns))
diff --git a/js/reagent/debug.cljs.cache.json b/js/reagent/debug.cljs.cache.json
new file mode 100644
index 0000000..f9055a6
--- /dev/null
+++ b/js/reagent/debug.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$console",["^ "]],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$reagent.debug","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$has-console",["^ ","^7","~$reagent.debug/has-console","~:file","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","~:line",4,"~:column",1,"~:end-line",4,"~:end-column",25,"~:const",true,"~:meta",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",4,"^B",14,"^C",4,"^D",25,"^E",true],"~:tag","~$boolean"],"~$tracking",["^ ","^7","~$reagent.debug/tracking","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",6,"^B",1,"^C",6,"^D",23,"^G","^H","^F",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",6,"^B",15,"^C",6,"^D",23,"^G","^H"]],"~$warnings",["^ ","^7","~$reagent.debug/warnings","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",8,"^B",1,"^C",8,"^D",18,"^F",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",8,"^B",10,"^C",8,"^D",18],"^G","~$any"],"~$track-console",["^ ","^7","~$reagent.debug/track-console","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",10,"^B",1,"^C",10,"^D",23,"^F",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",10,"^B",10,"^C",10,"^D",23],"^G","~$object"],"~$track-warnings",["^ ","~:protocol-inline",null,"^F",["^ ","^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^A",20,"^B",7,"^C",20,"^D",21,"~:arglists",["~#list",["~$quote",["^T",[["~$f"]]]]]],"^7","~$reagent.debug/track-warnings","~:variadic",false,"^@","/home/julien/.cljs/.aot_cache/1.10.329/01CEA71/reagent/debug.cljs","^D",21,"~:method-params",["^T",[["~$f"]]],"~:protocol-impl",null,"~:arglists-meta",["^T",[null,null]],"^B",1,"^A",20,"^C",20,"~:max-fixed-arity",1,"~:fn-var",true,"^S",["^T",["^U",["^T",[["~$f"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^8","^8"],"~:cljs.analyzer/constants",["^ ","~:seen",["^6",["~:warn","~:error"]],"~:order",["^15","^16"]],"~:doc",null]
\ No newline at end of file
diff --git a/js/reagent/debug.js b/js/reagent/debug.js
new file mode 100644
index 0000000..716031c
--- /dev/null
+++ b/js/reagent/debug.js
@@ -0,0 +1,78 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.debug');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+reagent.debug.has_console = (typeof console !== 'undefined');
+reagent.debug.tracking = false;
+if((typeof reagent !== 'undefined') && (typeof reagent.debug !== 'undefined') && (typeof reagent.debug.warnings !== 'undefined')){
+} else {
+reagent.debug.warnings = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(null);
+}
+if((typeof reagent !== 'undefined') && (typeof reagent.debug !== 'undefined') && (typeof reagent.debug.track_console !== 'undefined')){
+} else {
+reagent.debug.track_console = (function (){var o = ({});
+o.warn = ((function (o){
+return (function() { 
+var G__3441__delegate = function (args){
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic(reagent.debug.warnings,cljs.core.update_in,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$warn], null),cljs.core.conj,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.str,args)], 0));
+};
+var G__3441 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__3442__i = 0, G__3442__a = new Array(arguments.length -  0);
+while (G__3442__i < G__3442__a.length) {G__3442__a[G__3442__i] = arguments[G__3442__i + 0]; ++G__3442__i;}
+  args = new cljs.core.IndexedSeq(G__3442__a,0,null);
+} 
+return G__3441__delegate.call(this,args);};
+G__3441.cljs$lang$maxFixedArity = 0;
+G__3441.cljs$lang$applyTo = (function (arglist__3443){
+var args = cljs.core.seq(arglist__3443);
+return G__3441__delegate(args);
+});
+G__3441.cljs$core$IFn$_invoke$arity$variadic = G__3441__delegate;
+return G__3441;
+})()
+;})(o))
+;
+
+o.error = ((function (o){
+return (function() { 
+var G__3444__delegate = function (args){
+return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic(reagent.debug.warnings,cljs.core.update_in,new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$error], null),cljs.core.conj,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.str,args)], 0));
+};
+var G__3444 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__3445__i = 0, G__3445__a = new Array(arguments.length -  0);
+while (G__3445__i < G__3445__a.length) {G__3445__a[G__3445__i] = arguments[G__3445__i + 0]; ++G__3445__i;}
+  args = new cljs.core.IndexedSeq(G__3445__a,0,null);
+} 
+return G__3444__delegate.call(this,args);};
+G__3444.cljs$lang$maxFixedArity = 0;
+G__3444.cljs$lang$applyTo = (function (arglist__3446){
+var args = cljs.core.seq(arglist__3446);
+return G__3444__delegate(args);
+});
+G__3444.cljs$core$IFn$_invoke$arity$variadic = G__3444__delegate;
+return G__3444;
+})()
+;})(o))
+;
+
+return o;
+})();
+}
+reagent.debug.track_warnings = (function reagent$debug$track_warnings(f){
+reagent.debug.tracking = true;
+
+cljs.core.reset_BANG_(reagent.debug.warnings,null);
+
+(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+
+var warns = cljs.core.deref(reagent.debug.warnings);
+cljs.core.reset_BANG_(reagent.debug.warnings,null);
+
+reagent.debug.tracking = false;
+
+return warns;
+});
diff --git a/js/reagent/dom.cljs b/js/reagent/dom.cljs
new file mode 100644
index 0000000..d812d67
--- /dev/null
+++ b/js/reagent/dom.cljs
@@ -0,0 +1,70 @@
+(ns reagent.dom
+  (:require [react-dom :as react-dom]
+            [reagent.impl.util :as util]
+            [reagent.impl.template :as tmpl]
+            [reagent.impl.batching :as batch]
+            [reagent.ratom :as ratom]
+            [reagent.debug :refer-macros [dbg]]
+            [reagent.interop :refer-macros [$ $!]]))
+
+(defonce ^:private imported nil)
+
+(defonce ^:private roots (atom {}))
+
+(defn- unmount-comp [container]
+  (swap! roots dissoc container)
+  (react-dom/unmountComponentAtNode container))
+
+(defn- render-comp [comp container callback]
+  (binding [util/*always-update* true]
+    (react-dom/render (comp) container
+      (fn []
+        (binding [util/*always-update* false]
+          (swap! roots assoc container [comp container])
+          (batch/flush-after-render)
+          (if (some? callback)
+            (callback)))))))
+
+(defn- re-render-component [comp container]
+  (render-comp comp container nil))
+
+(defn render
+  "Render a Reagent component into the DOM. The first argument may be
+  either a vector (using Reagent's Hiccup syntax), or a React element. The second argument should be a DOM node.
+
+  Optionally takes a callback that is called when the component is in place.
+
+  Returns the mounted component instance."
+  ([comp container]
+   (render comp container nil))
+  ([comp container callback]
+   (ratom/flush!)
+   (let [f (fn []
+             (tmpl/as-element (if (fn? comp) (comp) comp)))]
+     (render-comp f container callback))))
+
+(defn unmount-component-at-node [container]
+  (unmount-comp container))
+
+(defn dom-node
+  "Returns the root DOM node of a mounted component."
+  [this]
+  (react-dom/findDOMNode this))
+
+(set! tmpl/find-dom-node dom-node)
+
+(defn force-update-all
+  "Force re-rendering of all mounted Reagent components. This is
+  probably only useful in a development environment, when you want to
+  update components in response to some dynamic changes to code.
+
+  Note that force-update-all may not update root components. This
+  happens if a component 'foo' is mounted with `(render [foo])` (since
+  functions are passed by value, and not by reference, in
+  ClojureScript). To get around this you'll have to introduce a layer
+  of indirection, for example by using `(render [#'foo])` instead."
+  []
+  (ratom/flush!)
+  (doseq [v (vals @roots)]
+    (apply re-render-component v))
+  "Updated")
diff --git a/js/reagent/dom.cljs.cache.json b/js/reagent/dom.cljs.cache.json
new file mode 100644
index 0000000..8fb7897
--- /dev/null
+++ b/js/reagent/dom.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Object",["^ ","~$unmountComponentAtNode",["^ "],"~$render",["^ "],"~$findDOMNode",["^ "]],"~$Error",["^ "]],"~:use-macros",["^ ","~$dbg","~$reagent.debug","~$$!","~$reagent.interop","~$$","^<"],"~:excludes",["~#set",[]],"~:name","~$reagent.dom","~:imports",null,"~:requires",["^ ","~$reagent.impl.util","^C","^<","^<","~$reagent.ratom","^D","~$reagent.impl.template","^E","~$reagent.impl.batching","^F","~$util","^C","~$tmpl","^E","~$ratom","^D","~$batch","^F","^:","^:","~$react-dom","^K"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$imported",["^ ","^?","~$reagent.dom/imported","~:file","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","~:line",10,"~:column",1,"~:end-line",10,"~:end-column",28,"~:private",true,"~:meta",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",10,"^S",20,"^T",10,"^U",28,"^V",true],"~:tag","~$clj-nil"],"~$roots",["^ ","^?","~$reagent.dom/roots","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",12,"^S",1,"^T",12,"^U",25,"^V",true,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",12,"^S",20,"^T",12,"^U",25,"^V",true],"^X","~$any"],"~$unmount-comp",["^ ","~:protocol-inline",null,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",14,"^S",8,"^T",14,"^U",20,"^V",true,"~:arglists",["~#list",["~$quote",["^14",[["~$container"]]]]]],"^V",true,"^?","~$reagent.dom/unmount-comp","~:variadic",false,"^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^U",20,"~:method-params",["^14",[["^16"]]],"~:protocol-impl",null,"~:arglists-meta",["^14",[null,null]],"^S",1,"^R",14,"^T",14,"~:max-fixed-arity",1,"~:fn-var",true,"^13",["^14",["^15",["^14",[["^16"]]]]]],"~$render-comp",["^ ","^12",null,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",18,"^S",8,"^T",18,"^U",19,"^V",true,"^13",["^14",["^15",["^14",[["~$comp","^16","~$callback"]]]]]],"^V",true,"^?","~$reagent.dom/render-comp","^18",false,"^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^U",19,"^19",["^14",[["^1?","^16","^1@"]]],"^1:",null,"^1;",["^14",[null,null]],"^S",1,"^R",18,"^T",18,"^1<",3,"^1=",true,"^13",["^14",["^15",["^14",[["^1?","^16","^1@"]]]]]],"~$re-render-component",["^ ","^12",null,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",28,"^S",8,"^T",28,"^U",27,"^V",true,"^13",["^14",["^15",["^14",[["^1?","^16"]]]]]],"^V",true,"^?","~$reagent.dom/re-render-component","^18",false,"^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^U",27,"^19",["^14",[["^1?","^16"]]],"^1:",null,"^1;",["^14",[null,null]],"^S",1,"^R",28,"^T",28,"^1<",2,"^1=",true,"^13",["^14",["^15",["^14",[["^1?","^16"]]]]]],"^5",["^ ","^12",null,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",31,"^S",7,"^T",31,"^U",13,"^13",["^14",["^15",["^14",[["^1?","^16"],["^1?","^16","^1@"]]]]],"~:doc","Render a Reagent component into the DOM. The first argument may be\n  either a vector (using Reagent's Hiccup syntax), or a React element. The second argument should be a DOM node.\n\n  Optionally takes a callback that is called when the component is in place.\n\n  Returns the mounted component instance.","~:top-fn",["^ ","^18",false,"^1<",3,"^19",["^14",[["^1?","^16"],["^1?","^16","^1@"]]],"^13",["^14",[["^1?","^16"],["^1?","^16","^1@"]]],"^1;",["^14",[null,null]]]],"^?","~$reagent.dom/render","^18",false,"^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^U",13,"^1E",["^ ","^18",false,"^1<",3,"^19",["^14",[["^1?","^16"],["^1?","^16","^1@"]]],"^13",["^14",[["^1?","^16"],["^1?","^16","^1@"]]],"^1;",["^14",[null,null]]],"^19",["^14",[["^1?","^16"],["^1?","^16","^1@"]]],"^1:",null,"^1;",["^14",[null,null]],"^S",1,"^R",31,"^T",31,"^1<",3,"^1=",true,"^13",["^14",[["^1?","^16"],["^1?","^16","^1@"]]],"^1D","Render a Reagent component into the DOM. The first argument may be\n  either a vector (using Reagent's Hiccup syntax), or a React element. The second argument should be a DOM node.\n\n  Optionally takes a callback that is called when the component is in place.\n\n  Returns the mounted component instance."],"~$unmount-component-at-node",["^ ","^12",null,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",46,"^S",7,"^T",46,"^U",32,"^13",["^14",["^15",["^14",[["^16"]]]]]],"^?","~$reagent.dom/unmount-component-at-node","^18",false,"^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^U",32,"^19",["^14",[["^16"]]],"^1:",null,"^1;",["^14",[null,null]],"^S",1,"^R",46,"^T",46,"^1<",1,"^1=",true,"^13",["^14",["^15",["^14",[["^16"]]]]]],"~$dom-node",["^ ","^12",null,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",49,"^S",7,"^T",49,"^U",15,"^13",["^14",["^15",["^14",[["~$this"]]]]],"^1D","Returns the root DOM node of a mounted component."],"^?","~$reagent.dom/dom-node","^18",false,"^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^U",15,"^19",["^14",[["^1J"]]],"^1:",null,"^1;",["^14",[null,null]],"^S",1,"^R",49,"^T",49,"^1<",1,"^1=",true,"^13",["^14",["^15",["^14",[["^1J"]]]]],"^1D","Returns the root DOM node of a mounted component."],"~$force-update-all",["^ ","^12",null,"^W",["^ ","^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^R",56,"^S",7,"^T",56,"^U",23,"^13",["^14",["^15",["^14",[[]]]]],"^1D","Force re-rendering of all mounted Reagent components. This is\n  probably only useful in a development environment, when you want to\n  update components in response to some dynamic changes to code.\n\n  Note that force-update-all may not update root components. This\n  happens if a component 'foo' is mounted with `(render [foo])` (since\n  functions are passed by value, and not by reference, in\n  ClojureScript). To get around this you'll have to introduce a layer\n  of indirection, for example by using `(render [#'foo])` instead."],"^?","~$reagent.dom/force-update-all","^18",false,"^Q","/home/julien/.cljs/.aot_cache/1.10.329/D61A328/reagent/dom.cljs","^U",23,"^19",["^14",[[]]],"^1:",null,"^1;",["^14",[null,null]],"^S",1,"^R",56,"^T",56,"^1<",0,"^1=",true,"^13",["^14",["^15",["^14",[[]]]]],"^1D","Force re-rendering of all mounted Reagent components. This is\n  probably only useful in a development environment, when you want to\n  update components in response to some dynamic changes to code.\n\n  Note that force-update-all may not update root components. This\n  happens if a component 'foo' is mounted with `(render [foo])` (since\n  functions are passed by value, and not by reference, in\n  ClojureScript). To get around this you'll have to introduce a layer\n  of indirection, for example by using `(render [#'foo])` instead."]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^I","^D","^D","^D","^:","^:","^<","^<"],"^1D",null]
\ No newline at end of file
diff --git a/js/reagent/dom.js b/js/reagent/dom.js
new file mode 100644
index 0000000..8dfb9a5
--- /dev/null
+++ b/js/reagent/dom.js
@@ -0,0 +1,174 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.dom');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('reagent.impl.util');
+goog.require('reagent.impl.template');
+goog.require('reagent.impl.batching');
+goog.require('reagent.ratom');
+goog.require('reagent.debug');
+goog.require('reagent.interop');
+reagent.dom.global$module$react_dom = goog.global["ReactDOM"];
+if((typeof reagent !== 'undefined') && (typeof reagent.dom !== 'undefined') && (typeof reagent.dom.imported !== 'undefined')){
+} else {
+reagent.dom.imported = null;
+}
+if((typeof reagent !== 'undefined') && (typeof reagent.dom !== 'undefined') && (typeof reagent.dom.roots !== 'undefined')){
+} else {
+reagent.dom.roots = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+}
+reagent.dom.unmount_comp = (function reagent$dom$unmount_comp(container){
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(reagent.dom.roots,cljs.core.dissoc,container);
+
+return (reagent.dom.global$module$react_dom.unmountComponentAtNode.cljs$core$IFn$_invoke$arity$1 ? reagent.dom.global$module$react_dom.unmountComponentAtNode.cljs$core$IFn$_invoke$arity$1(container) : reagent.dom.global$module$react_dom.unmountComponentAtNode.call(null,container));
+});
+reagent.dom.render_comp = (function reagent$dom$render_comp(comp,container,callback){
+var _STAR_always_update_STAR_3867 = reagent.impl.util._STAR_always_update_STAR_;
+reagent.impl.util._STAR_always_update_STAR_ = true;
+
+try{var G__3868 = (comp.cljs$core$IFn$_invoke$arity$0 ? comp.cljs$core$IFn$_invoke$arity$0() : comp.call(null));
+var G__3869 = container;
+var G__3870 = ((function (G__3868,G__3869,_STAR_always_update_STAR_3867){
+return (function (){
+var _STAR_always_update_STAR_3871 = reagent.impl.util._STAR_always_update_STAR_;
+reagent.impl.util._STAR_always_update_STAR_ = false;
+
+try{cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(reagent.dom.roots,cljs.core.assoc,container,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [comp,container], null));
+
+reagent.impl.batching.flush_after_render();
+
+if(!((callback == null))){
+return (callback.cljs$core$IFn$_invoke$arity$0 ? callback.cljs$core$IFn$_invoke$arity$0() : callback.call(null));
+} else {
+return null;
+}
+}finally {reagent.impl.util._STAR_always_update_STAR_ = _STAR_always_update_STAR_3871;
+}});})(G__3868,G__3869,_STAR_always_update_STAR_3867))
+;
+return (reagent.dom.global$module$react_dom.render.cljs$core$IFn$_invoke$arity$3 ? reagent.dom.global$module$react_dom.render.cljs$core$IFn$_invoke$arity$3(G__3868,G__3869,G__3870) : reagent.dom.global$module$react_dom.render.call(null,G__3868,G__3869,G__3870));
+}finally {reagent.impl.util._STAR_always_update_STAR_ = _STAR_always_update_STAR_3867;
+}});
+reagent.dom.re_render_component = (function reagent$dom$re_render_component(comp,container){
+return reagent.dom.render_comp(comp,container,null);
+});
+/**
+ * Render a Reagent component into the DOM. The first argument may be
+ *   either a vector (using Reagent's Hiccup syntax), or a React element. The second argument should be a DOM node.
+ * 
+ *   Optionally takes a callback that is called when the component is in place.
+ * 
+ *   Returns the mounted component instance.
+ */
+reagent.dom.render = (function reagent$dom$render(var_args){
+var G__3873 = arguments.length;
+switch (G__3873) {
+case 2:
+return reagent.dom.render.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return reagent.dom.render.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+reagent.dom.render.cljs$core$IFn$_invoke$arity$2 = (function (comp,container){
+return reagent.dom.render.cljs$core$IFn$_invoke$arity$3(comp,container,null);
+});
+
+reagent.dom.render.cljs$core$IFn$_invoke$arity$3 = (function (comp,container,callback){
+reagent.ratom.flush_BANG_();
+
+var f = (function (){
+return reagent.impl.template.as_element(((cljs.core.fn_QMARK_(comp))?(comp.cljs$core$IFn$_invoke$arity$0 ? comp.cljs$core$IFn$_invoke$arity$0() : comp.call(null)):comp));
+});
+return reagent.dom.render_comp(f,container,callback);
+});
+
+reagent.dom.render.cljs$lang$maxFixedArity = 3;
+
+reagent.dom.unmount_component_at_node = (function reagent$dom$unmount_component_at_node(container){
+return reagent.dom.unmount_comp(container);
+});
+/**
+ * Returns the root DOM node of a mounted component.
+ */
+reagent.dom.dom_node = (function reagent$dom$dom_node(this$){
+return (reagent.dom.global$module$react_dom.findDOMNode.cljs$core$IFn$_invoke$arity$1 ? reagent.dom.global$module$react_dom.findDOMNode.cljs$core$IFn$_invoke$arity$1(this$) : reagent.dom.global$module$react_dom.findDOMNode.call(null,this$));
+});
+reagent.impl.template.find_dom_node = reagent.dom.dom_node;
+/**
+ * Force re-rendering of all mounted Reagent components. This is
+ *   probably only useful in a development environment, when you want to
+ *   update components in response to some dynamic changes to code.
+ * 
+ *   Note that force-update-all may not update root components. This
+ *   happens if a component 'foo' is mounted with `(render [foo])` (since
+ *   functions are passed by value, and not by reference, in
+ *   ClojureScript). To get around this you'll have to introduce a layer
+ *   of indirection, for example by using `(render [#'foo])` instead.
+ */
+reagent.dom.force_update_all = (function reagent$dom$force_update_all(){
+reagent.ratom.flush_BANG_();
+
+var seq__3875_3879 = cljs.core.seq(cljs.core.vals(cljs.core.deref(reagent.dom.roots)));
+var chunk__3876_3880 = null;
+var count__3877_3881 = (0);
+var i__3878_3882 = (0);
+while(true){
+if((i__3878_3882 < count__3877_3881)){
+var v_3883 = chunk__3876_3880.cljs$core$IIndexed$_nth$arity$2(null,i__3878_3882);
+cljs.core.apply.cljs$core$IFn$_invoke$arity$2(reagent.dom.re_render_component,v_3883);
+
+
+var G__3884 = seq__3875_3879;
+var G__3885 = chunk__3876_3880;
+var G__3886 = count__3877_3881;
+var G__3887 = (i__3878_3882 + (1));
+seq__3875_3879 = G__3884;
+chunk__3876_3880 = G__3885;
+count__3877_3881 = G__3886;
+i__3878_3882 = G__3887;
+continue;
+} else {
+var temp__5457__auto___3888 = cljs.core.seq(seq__3875_3879);
+if(temp__5457__auto___3888){
+var seq__3875_3889__$1 = temp__5457__auto___3888;
+if(cljs.core.chunked_seq_QMARK_(seq__3875_3889__$1)){
+var c__4338__auto___3890 = cljs.core.chunk_first(seq__3875_3889__$1);
+var G__3891 = cljs.core.chunk_rest(seq__3875_3889__$1);
+var G__3892 = c__4338__auto___3890;
+var G__3893 = cljs.core.count(c__4338__auto___3890);
+var G__3894 = (0);
+seq__3875_3879 = G__3891;
+chunk__3876_3880 = G__3892;
+count__3877_3881 = G__3893;
+i__3878_3882 = G__3894;
+continue;
+} else {
+var v_3895 = cljs.core.first(seq__3875_3889__$1);
+cljs.core.apply.cljs$core$IFn$_invoke$arity$2(reagent.dom.re_render_component,v_3895);
+
+
+var G__3896 = cljs.core.next(seq__3875_3889__$1);
+var G__3897 = null;
+var G__3898 = (0);
+var G__3899 = (0);
+seq__3875_3879 = G__3896;
+chunk__3876_3880 = G__3897;
+count__3877_3881 = G__3898;
+i__3878_3882 = G__3899;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+return "Updated";
+});
diff --git a/js/reagent/impl/batching.cljs b/js/reagent/impl/batching.cljs
new file mode 100644
index 0000000..33567b8
--- /dev/null
+++ b/js/reagent/impl/batching.cljs
@@ -0,0 +1,113 @@
+(ns reagent.impl.batching
+  (:refer-clojure :exclude [flush])
+  (:require [reagent.debug :refer-macros [dbg assert-some]]
+            [reagent.interop :refer-macros [$ $!]]
+            [reagent.impl.util :refer [is-client]]
+            [clojure.string :as string]))
+
+;;; Update batching
+
+(defonce mount-count 0)
+
+(defn next-mount-count []
+  (set! mount-count (inc mount-count)))
+
+(defn fake-raf [f]
+  (js/setTimeout f 16))
+
+(def next-tick
+  (if-not is-client
+    fake-raf
+    (let [w js/window]
+      (or ($ w :requestAnimationFrame)
+          ($ w :webkitRequestAnimationFrame)
+          ($ w :mozRequestAnimationFrame)
+          ($ w :msRequestAnimationFrame)
+          fake-raf))))
+
+(defn compare-mount-order [c1 c2]
+  (- ($ c1 :cljsMountOrder)
+     ($ c2 :cljsMountOrder)))
+
+(defn run-queue [a]
+  ;; sort components by mount order, to make sure parents
+  ;; are rendered before children
+  (.sort a compare-mount-order)
+  (dotimes [i (alength a)]
+    (let [c (aget a i)]
+      (when (true? ($ c :cljsIsDirty))
+        ($ c forceUpdate)))))
+
+
+;; Set from ratom.cljs
+(defonce ratom-flush (fn []))
+
+(deftype RenderQueue [^:mutable ^boolean scheduled?]
+  Object
+  (enqueue [this k f]
+    (assert-some f "Enqueued function")
+    (when (nil? (aget this k))
+      (aset this k (array)))
+    (.push (aget this k) f)
+    (.schedule this))
+
+  (run-funs [this k]
+    (when-some [fs (aget this k)]
+      (aset this k nil)
+      (dotimes [i (alength fs)]
+        ((aget fs i)))))
+
+  (schedule [this]
+    (when-not scheduled?
+      (set! scheduled? true)
+      (next-tick #(.run-queues this))))
+
+  (queue-render [this c]
+    (.enqueue this "componentQueue" c))
+
+  (add-before-flush [this f]
+    (.enqueue this "beforeFlush" f))
+
+  (add-after-render [this f]
+    (.enqueue this "afterRender" f))
+
+  (run-queues [this]
+    (set! scheduled? false)
+    (.flush-queues this))
+
+  (flush-after-render [this]
+    (.run-funs this "afterRender"))
+
+  (flush-queues [this]
+    (.run-funs this "beforeFlush")
+    (ratom-flush)
+    (when-some [cs (aget this "componentQueue")]
+      (aset this "componentQueue" nil)
+      (run-queue cs))
+    (.flush-after-render this)))
+
+(defonce render-queue (->RenderQueue false))
+
+(defn flush []
+  (.flush-queues render-queue))
+
+(defn flush-after-render []
+  (.flush-after-render render-queue))
+
+(defn queue-render [c]
+  (when-not ($ c :cljsIsDirty)
+    ($! c :cljsIsDirty true)
+    (.queue-render render-queue c)))
+
+(defn mark-rendered [c]
+  ($! c :cljsIsDirty false))
+
+(defn do-before-flush [f]
+  (.add-before-flush render-queue f))
+
+(defn do-after-render [f]
+  (.add-after-render render-queue f))
+
+(defn schedule []
+  (when (false? (.-scheduled? render-queue))
+    (.schedule render-queue)))
diff --git a/js/reagent/impl/batching.cljs.cache.json b/js/reagent/impl/batching.cljs.cache.json
new file mode 100644
index 0000000..f5c83fa
--- /dev/null
+++ b/js/reagent/impl/batching.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$setTimeout",["^ "],"~$window",["^ "],"~$Error",["^ "]],"~:use-macros",["^ ","~$assert-some","~$reagent.debug","~$dbg","^8","~$$!","~$reagent.interop","~$$","^;"],"~:excludes",["~#set",["~$flush"]],"~:name","~$reagent.impl.batching","~:imports",null,"~:requires",["^ ","^8","^8","^;","^;","~$reagent.impl.util","^C","~$string","~$clojure.string","^E","^E"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","~$is-client","^C"],"~:defs",["^ ","~$fake-raf",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","~:line",15,"~:column",7,"~:end-line",15,"~:end-column",15,"~:arglists",["~#list",["~$quote",["^S",[["~$f"]]]]]],"^?","~$reagent.impl.batching/fake-raf","~:variadic",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",15,"~:method-params",["^S",[["~$f"]]],"~:protocol-impl",null,"~:arglists-meta",["^S",[null,null]],"^O",1,"^N",15,"^P",15,"~:max-fixed-arity",1,"~:fn-var",true,"^R",["^S",["^T",["^S",[["~$f"]]]]]],"~$do-before-flush",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",105,"^O",7,"^P",105,"^Q",22,"^R",["^S",["^T",["^S",[["~$f"]]]]]],"^?","~$reagent.impl.batching/do-before-flush","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",22,"^W",["^S",[["~$f"]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",105,"^P",105,"^Z",1,"^[",true,"^R",["^S",["^T",["^S",[["~$f"]]]]]],"~$flush-after-render",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",94,"^O",7,"^P",94,"^Q",25,"^R",["^S",["^T",["^S",[[]]]]]],"^?","~$reagent.impl.batching/flush-after-render","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",25,"^W",["^S",[[]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",94,"^P",94,"^Z",0,"^[",true,"^R",["^S",["^T",["^S",[[]]]]]],"~$queue-render",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",97,"^O",7,"^P",97,"^Q",19,"^R",["^S",["^T",["^S",[["~$c"]]]]]],"^?","~$reagent.impl.batching/queue-render","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",19,"^W",["^S",[["~$c"]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",97,"^P",97,"^Z",1,"^[",true,"^R",["^S",["^T",["^S",[["~$c"]]]]]],"~$next-tick",["^ ","^?","~$reagent.impl.batching/next-tick","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",18,"^O",1,"^P",18,"^Q",15,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",18,"^O",6,"^P",18,"^Q",15],"~:tag",["^=",[null,"~$any"]]],"^>",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",91,"^O",7,"^P",91,"^Q",12,"^R",["^S",["^T",["^S",[[]]]]]],"^?","~$reagent.impl.batching/flush","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",12,"^W",["^S",[[]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",91,"^P",91,"^Z",0,"^[",true,"^R",["^S",["^T",["^S",[[]]]]]],"~$mark-rendered",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",102,"^O",7,"^P",102,"^Q",20,"^R",["^S",["^T",["^S",[["~$c"]]]]]],"^?","~$reagent.impl.batching/mark-rendered","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",20,"^W",["^S",[["~$c"]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",102,"^P",102,"^Z",1,"^[",true,"^R",["^S",["^T",["^S",[["~$c"]]]]]],"~$schedule",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",111,"^O",7,"^P",111,"^Q",15,"^R",["^S",["^T",["^S",[[]]]]]],"^?","~$reagent.impl.batching/schedule","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",15,"^W",["^S",[[]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",111,"^P",111,"^Z",0,"^[",true,"^R",["^S",["^T",["^S",[[]]]]]],"~$render-queue",["^ ","^?","~$reagent.impl.batching/render-queue","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",89,"^O",1,"^P",89,"^Q",22,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",89,"^O",10,"^P",89,"^Q",22],"^18","^19"],"~$RenderQueue",["^ ","~:num-fields",1,"~:protocols",["^=",["~$reagent.impl.batching/Object"]],"^?","~$reagent.impl.batching/RenderQueue","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",21,"~:type",true,"^O",10,"^N",45,"~:record",false,"^P",45,"^18","~$function","~:skip-protocol-flag",null],"~$compare-mount-order",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",28,"^O",7,"^P",28,"^Q",26,"^R",["^S",["^T",["^S",[["~$c1","~$c2"]]]]]],"^?","~$reagent.impl.batching/compare-mount-order","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",26,"^W",["^S",[["^1K","^1L"]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",28,"^P",28,"^Z",2,"^[",true,"^R",["^S",["^T",["^S",[["^1K","^1L"]]]]]],"~$mount-count",["^ ","^?","~$reagent.impl.batching/mount-count","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",10,"^O",1,"^P",10,"^Q",21,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",10,"^O",10,"^P",10,"^Q",21],"^18","~$number"],"~$next-mount-count",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",12,"^O",7,"^P",12,"^Q",23,"^R",["^S",["^T",["^S",[[]]]]]],"^?","~$reagent.impl.batching/next-mount-count","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",23,"^W",["^S",[[]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",12,"^P",12,"^Z",0,"^[",true,"^R",["^S",["^T",["^S",[[]]]]]],"~$->RenderQueue",["^ ","^K",null,"^L",["^ ","^1C",["^=",["^1D"]],"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",21,"^O",10,"~:factory","~:positional","^N",45,"^P",45,"^R",["^S",["^T",["^S",[["~$scheduled?"]]]]],"^1I",null,"~:doc","Positional factory function for reagent.impl.batching/RenderQueue."],"^1C",["^=",["^1D"]],"^?","~$reagent.impl.batching/->RenderQueue","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",21,"^W",["^S",[["^1V"]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^1T","^1U","^N",45,"^P",45,"^Z",1,"^[",true,"^R",["^S",["^T",["^S",[["^1V"]]]]],"^1I",null,"^1W","Positional factory function for reagent.impl.batching/RenderQueue."],"~$do-after-render",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",108,"^O",7,"^P",108,"^Q",22,"^R",["^S",["^T",["^S",[["~$f"]]]]]],"^?","~$reagent.impl.batching/do-after-render","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",22,"^W",["^S",[["~$f"]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",108,"^P",108,"^Z",1,"^[",true,"^R",["^S",["^T",["^S",[["~$f"]]]]]],"~$run-queue",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",32,"^O",7,"^P",32,"^Q",16,"^R",["^S",["^T",["^S",[["~$a"]]]]]],"^?","~$reagent.impl.batching/run-queue","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",16,"^W",["^S",[["~$a"]]],"^X",null,"^Y",["^S",[null,null]],"^O",1,"^N",32,"^P",32,"^Z",1,"^[",true,"^R",["^S",["^T",["^S",[["~$a"]]]]]],"~$ratom-flush",["^ ","^K",null,"^L",["^ ","^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^N",43,"^O",10,"^P",43,"^Q",21],"^?","~$reagent.impl.batching/ratom-flush","^V",false,"^M","/home/julien/.cljs/.aot_cache/1.10.329/6F12B9E/reagent/impl/batching.cljs","^Q",21,"^W",["^S",[[]]],"^X",null,"^Y",["^S",[]],"^O",1,"^N",43,"^P",43,"^Z",0,"^[",true,"^R",null]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^8","^8","^;","^;"],"~:cljs.analyzer/constants",["^ ","~:seen",["^=",["~$boolean","^1V","^18","~:mutable"]],"~:order",["^1V","^18","^28","^27"]],"^1W",null]
\ No newline at end of file
diff --git a/js/reagent/impl/batching.js b/js/reagent/impl/batching.js
new file mode 100644
index 0000000..f4cfdde
--- /dev/null
+++ b/js/reagent/impl/batching.js
@@ -0,0 +1,248 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.impl.batching');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('reagent.debug');
+goog.require('reagent.interop');
+goog.require('reagent.impl.util');
+goog.require('clojure.string');
+if((typeof reagent !== 'undefined') && (typeof reagent.impl !== 'undefined') && (typeof reagent.impl.batching !== 'undefined') && (typeof reagent.impl.batching.mount_count !== 'undefined')){
+} else {
+reagent.impl.batching.mount_count = (0);
+}
+reagent.impl.batching.next_mount_count = (function reagent$impl$batching$next_mount_count(){
+return reagent.impl.batching.mount_count = (reagent.impl.batching.mount_count + (1));
+});
+reagent.impl.batching.fake_raf = (function reagent$impl$batching$fake_raf(f){
+return setTimeout(f,(16));
+});
+reagent.impl.batching.next_tick = ((!(reagent.impl.util.is_client))?reagent.impl.batching.fake_raf:(function (){var w = window;
+var or__3936__auto__ = (w["requestAnimationFrame"]);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (w["webkitRequestAnimationFrame"]);
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var or__3936__auto____$2 = (w["mozRequestAnimationFrame"]);
+if(cljs.core.truth_(or__3936__auto____$2)){
+return or__3936__auto____$2;
+} else {
+var or__3936__auto____$3 = (w["msRequestAnimationFrame"]);
+if(cljs.core.truth_(or__3936__auto____$3)){
+return or__3936__auto____$3;
+} else {
+return reagent.impl.batching.fake_raf;
+}
+}
+}
+}
+})());
+reagent.impl.batching.compare_mount_order = (function reagent$impl$batching$compare_mount_order(c1,c2){
+return ((c1["cljsMountOrder"]) - (c2["cljsMountOrder"]));
+});
+reagent.impl.batching.run_queue = (function reagent$impl$batching$run_queue(a){
+a.sort(reagent.impl.batching.compare_mount_order);
+
+var n__4395__auto__ = a.length;
+var i = (0);
+while(true){
+if((i < n__4395__auto__)){
+var c_3494 = (a[i]);
+if((c_3494["cljsIsDirty"]) === true){
+(c_3494["forceUpdate"])();
+} else {
+}
+
+var G__3495 = (i + (1));
+i = G__3495;
+continue;
+} else {
+return null;
+}
+break;
+}
+});
+if((typeof reagent !== 'undefined') && (typeof reagent.impl !== 'undefined') && (typeof reagent.impl.batching !== 'undefined') && (typeof reagent.impl.batching.ratom_flush !== 'undefined')){
+} else {
+reagent.impl.batching.ratom_flush = (function reagent$impl$batching$ratom_flush(){
+return null;
+});
+}
+
+/**
+* @constructor
+ * @implements {reagent.impl.batching.Object}
+*/
+reagent.impl.batching.RenderQueue = (function (scheduled_QMARK_){
+this.scheduled_QMARK_ = scheduled_QMARK_;
+});
+reagent.impl.batching.RenderQueue.prototype.run_funs = (function (k){
+var self__ = this;
+var this$ = this;
+var temp__5461__auto__ = (this$[k]);
+if((temp__5461__auto__ == null)){
+return null;
+} else {
+var fs = temp__5461__auto__;
+(this$[k] = null);
+
+var n__4395__auto__ = fs.length;
+var i = (0);
+while(true){
+if((i < n__4395__auto__)){
+var fexpr__3496_3498 = (fs[i]);
+(fexpr__3496_3498.cljs$core$IFn$_invoke$arity$0 ? fexpr__3496_3498.cljs$core$IFn$_invoke$arity$0() : fexpr__3496_3498.call(null));
+
+var G__3499 = (i + (1));
+i = G__3499;
+continue;
+} else {
+return null;
+}
+break;
+}
+}
+});
+
+reagent.impl.batching.RenderQueue.prototype.flush_after_render = (function (){
+var self__ = this;
+var this$ = this;
+return this$.run_funs("afterRender");
+});
+
+reagent.impl.batching.RenderQueue.prototype.queue_render = (function (c){
+var self__ = this;
+var this$ = this;
+return this$.enqueue("componentQueue",c);
+});
+
+reagent.impl.batching.RenderQueue.prototype.schedule = (function (){
+var self__ = this;
+var this$ = this;
+if(self__.scheduled_QMARK_){
+return null;
+} else {
+self__.scheduled_QMARK_ = true;
+
+var G__3497 = ((function (this$){
+return (function (){
+return this$.run_queues();
+});})(this$))
+;
+return (reagent.impl.batching.next_tick.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.batching.next_tick.cljs$core$IFn$_invoke$arity$1(G__3497) : reagent.impl.batching.next_tick.call(null,G__3497));
+}
+});
+
+reagent.impl.batching.RenderQueue.prototype.flush_queues = (function (){
+var self__ = this;
+var this$ = this;
+this$.run_funs("beforeFlush");
+
+reagent.impl.batching.ratom_flush();
+
+var temp__5461__auto___3500 = (this$["componentQueue"]);
+if((temp__5461__auto___3500 == null)){
+} else {
+var cs_3501 = temp__5461__auto___3500;
+(this$["componentQueue"] = null);
+
+reagent.impl.batching.run_queue(cs_3501);
+}
+
+return this$.flush_after_render();
+});
+
+reagent.impl.batching.RenderQueue.prototype.run_queues = (function (){
+var self__ = this;
+var this$ = this;
+self__.scheduled_QMARK_ = false;
+
+return this$.flush_queues();
+});
+
+reagent.impl.batching.RenderQueue.prototype.enqueue = (function (k,f){
+var self__ = this;
+var this$ = this;
+if(cljs.core.truth_(f)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Enqueued function"," must not be nil"].join('')),"\n","f"].join('')));
+}
+
+if(((this$[k]) == null)){
+(this$[k] = []);
+} else {
+}
+
+(this$[k]).push(f);
+
+return this$.schedule();
+});
+
+reagent.impl.batching.RenderQueue.prototype.add_before_flush = (function (f){
+var self__ = this;
+var this$ = this;
+return this$.enqueue("beforeFlush",f);
+});
+
+reagent.impl.batching.RenderQueue.prototype.add_after_render = (function (f){
+var self__ = this;
+var this$ = this;
+return this$.enqueue("afterRender",f);
+});
+
+reagent.impl.batching.RenderQueue.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$scheduled_QMARK_,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean,cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+reagent.impl.batching.RenderQueue.cljs$lang$type = true;
+
+reagent.impl.batching.RenderQueue.cljs$lang$ctorStr = "reagent.impl.batching/RenderQueue";
+
+reagent.impl.batching.RenderQueue.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.impl.batching/RenderQueue");
+});
+
+/**
+ * Positional factory function for reagent.impl.batching/RenderQueue.
+ */
+reagent.impl.batching.__GT_RenderQueue = (function reagent$impl$batching$__GT_RenderQueue(scheduled_QMARK_){
+return (new reagent.impl.batching.RenderQueue(scheduled_QMARK_));
+});
+
+if((typeof reagent !== 'undefined') && (typeof reagent.impl !== 'undefined') && (typeof reagent.impl.batching !== 'undefined') && (typeof reagent.impl.batching.render_queue !== 'undefined')){
+} else {
+reagent.impl.batching.render_queue = reagent.impl.batching.__GT_RenderQueue(false);
+}
+reagent.impl.batching.flush = (function reagent$impl$batching$flush(){
+return reagent.impl.batching.render_queue.flush_queues();
+});
+reagent.impl.batching.flush_after_render = (function reagent$impl$batching$flush_after_render(){
+return reagent.impl.batching.render_queue.flush_after_render();
+});
+reagent.impl.batching.queue_render = (function reagent$impl$batching$queue_render(c){
+if(cljs.core.truth_((c["cljsIsDirty"]))){
+return null;
+} else {
+(c["cljsIsDirty"] = true);
+
+return reagent.impl.batching.render_queue.queue_render(c);
+}
+});
+reagent.impl.batching.mark_rendered = (function reagent$impl$batching$mark_rendered(c){
+return (c["cljsIsDirty"] = false);
+});
+reagent.impl.batching.do_before_flush = (function reagent$impl$batching$do_before_flush(f){
+return reagent.impl.batching.render_queue.add_before_flush(f);
+});
+reagent.impl.batching.do_after_render = (function reagent$impl$batching$do_after_render(f){
+return reagent.impl.batching.render_queue.add_after_render(f);
+});
+reagent.impl.batching.schedule = (function reagent$impl$batching$schedule(){
+if(reagent.impl.batching.render_queue.scheduled_QMARK_ === false){
+return reagent.impl.batching.render_queue.schedule();
+} else {
+return null;
+}
+});
diff --git a/js/reagent/impl/component.cljs b/js/reagent/impl/component.cljs
new file mode 100644
index 0000000..90b5397
--- /dev/null
+++ b/js/reagent/impl/component.cljs
@@ -0,0 +1,342 @@
+(ns reagent.impl.component
+  (:require [create-react-class :as create-react-class]
+            [react :as react]
+            [reagent.impl.util :as util]
+            [reagent.impl.batching :as batch]
+            [reagent.ratom :as ratom]
+            [reagent.interop :refer-macros [$ $!]]
+            [reagent.debug :refer-macros [dbg prn dev? warn error warn-unless
+                                          assert-callable]]))
+
+(declare ^:dynamic *current-component*)
+
+
+;;; Argv access
+
+(defn shallow-obj-to-map [o]
+  (let [ks (js-keys o)
+        len (alength ks)]
+    (loop [m {} i 0]
+      (if (< i len)
+        (let [k (aget ks i)]
+          (recur (assoc m (keyword k) (aget o k)) (inc i)))
+        m))))
+
+(defn extract-props [v]
+  (let [p (nth v 1 nil)]
+    (if (map? p) p)))
+
+(defn extract-children [v]
+  (let [p (nth v 1 nil)
+        first-child (if (or (nil? p) (map? p)) 2 1)]
+    (if (> (count v) first-child)
+      (subvec v first-child))))
+
+(defn props-argv [c p]
+  (if-some [a ($ p :argv)]
+    a
+    [(.-constructor c) (shallow-obj-to-map p)]))
+
+(defn get-argv [c]
+  (props-argv c ($ c :props)))
+
+(defn get-props [c]
+  (let [p ($ c :props)]
+    (if-some [v ($ p :argv)]
+      (extract-props v)
+      (shallow-obj-to-map p))))
+
+(defn get-children [c]
+  (let [p ($ c :props)]
+    (if-some [v ($ p :argv)]
+      (extract-children v)
+      (->> ($ p :children)
+           (react/Children.toArray)
+           (into [])))))
+
+(defn ^boolean reagent-class? [c]
+  (and (fn? c)
+       (some? (some-> c .-prototype ($ :reagentRender)))))
+
+(defn ^boolean react-class? [c]
+  (and (fn? c)
+       (some? (some-> c .-prototype ($ :render)))))
+
+(defn ^boolean reagent-component? [c]
+  (some? ($ c :reagentRender)))
+
+(defn cached-react-class [c]
+  ($ c :cljsReactClass))
+
+(defn cache-react-class [c constructor]
+  ($! c :cljsReactClass constructor))
+
+
+;;; State
+
+(defn state-atom [this]
+  (let [sa ($ this :cljsState)]
+    (if-not (nil? sa)
+      sa
+      ($! this :cljsState (ratom/atom nil)))))
+
+;; avoid circular dependency: this gets set from template.cljs
+(defonce as-element nil)
+
+
+;;; Rendering
+
+(defn wrap-render [c]
+  (let [f ($ c :reagentRender)
+        _ (assert-callable f)
+        res (if (true? ($ c :cljsLegacyRender))
+              (.call f c c)
+              (let [v (get-argv c)
+                    n (count v)]
+                (case n
+                  1 (.call f c)
+                  2 (.call f c (nth v 1))
+                  3 (.call f c (nth v 1) (nth v 2))
+                  4 (.call f c (nth v 1) (nth v 2) (nth v 3))
+                  5 (.call f c (nth v 1) (nth v 2) (nth v 3) (nth v 4))
+                  (.apply f c (.slice (into-array v) 1)))))]
+    (cond
+      (vector? res) (as-element res)
+      (ifn? res) (let [f (if (reagent-class? res)
+                           (fn [& args]
+                             (as-element (apply vector res args)))
+                           res)]
+                   ($! c :reagentRender f)
+                   (recur c))
+      :else res)))
+
+(declare comp-name)
+
+(defn do-render [c]
+  (binding [*current-component* c]
+    (if (dev?)
+      ;; Log errors, without using try/catch (and mess up call stack)
+      (let [ok (array false)]
+        (try
+          (let [res (wrap-render c)]
+            (aset ok 0 true)
+            res)
+          (finally
+            (when-not (aget ok 0)
+              (error (str "Error rendering component"
+                          (comp-name)))))))
+      (wrap-render c))))
+
+
+;;; Method wrapping
+
+(def rat-opts {:no-cache true})
+
+(def static-fns
+  {:render
+   (fn render []
+     (this-as c (if util/*non-reactive*
+                  (do-render c)
+                  (let [rat ($ c :cljsRatom)]
+                    (batch/mark-rendered c)
+                    (if (nil? rat)
+                      (ratom/run-in-reaction #(do-render c) c "cljsRatom"
+                                             batch/queue-render rat-opts)
+                      (._run rat false))))))})
+
+(defn custom-wrapper [key f]
+  (case key
+    :getDefaultProps
+    (throw (js/Error. "getDefaultProps not supported"))
+
+    :getInitialState
+    (fn getInitialState []
+      (this-as c (reset! (state-atom c) (.call f c c))))
+
+    :componentWillReceiveProps
+    (fn componentWillReceiveProps [nextprops]
+      (this-as c (.call f c c (props-argv c nextprops))))
+
+    :shouldComponentUpdate
+    (fn shouldComponentUpdate [nextprops nextstate]
+      (or util/*always-update*
+          (this-as c
+                   ;; Don't care about nextstate here, we use forceUpdate
+                   ;; when only when state has changed anyway.
+                   (let [old-argv ($ c :props.argv)
+                         new-argv ($ nextprops :argv)
+                         noargv (or (nil? old-argv) (nil? new-argv))]
+                     (cond
+                       (nil? f) (or noargv (not= old-argv new-argv))
+                       noargv (.call f c c (get-argv c) (props-argv c nextprops))
+                       :else  (.call f c c old-argv new-argv))))))
+
+    :componentWillUpdate
+    (fn componentWillUpdate [nextprops]
+      (this-as c (.call f c c (props-argv c nextprops))))
+
+    :componentDidUpdate
+    (fn componentDidUpdate [oldprops]
+      (this-as c (.call f c c (props-argv c oldprops))))
+
+    :componentWillMount
+    (fn componentWillMount []
+      (this-as c
+               ($! c :cljsMountOrder (batch/next-mount-count))
+               (when-not (nil? f)
+                 (.call f c c))))
+
+    :componentDidMount
+    (fn componentDidMount []
+      (this-as c (.call f c c)))
+
+    :componentWillUnmount
+    (fn componentWillUnmount []
+      (this-as c
+               (some-> ($ c :cljsRatom)
+                       ratom/dispose!)
+               (batch/mark-rendered c)
+               (when-not (nil? f)
+                 (.call f c c))))
+
+    :componentDidCatch
+    (fn componentDidCatch [error info]
+      (this-as c (.call f c c error info)))
+
+    nil))
+
+(defn get-wrapper [key f name]
+  (let [wrap (custom-wrapper key f)]
+    (when (and wrap f)
+      (assert-callable f))
+    (or wrap f)))
+
+(def obligatory {:shouldComponentUpdate nil
+                 :componentWillMount nil
+                 :componentWillUnmount nil})
+
+(def dash-to-camel (util/memoize-1 util/dash-to-camel))
+
+(defn camelify-map-keys [fun-map]
+  (reduce-kv (fn [m k v]
+               (assoc m (-> k dash-to-camel keyword) v))
+             {} fun-map))
+
+(defn add-obligatory [fun-map]
+  (merge obligatory fun-map))
+
+(defn wrap-funs [fmap]
+  (when (dev?)
+    (let [renders (select-keys fmap [:render :reagentRender :componentFunction])
+          render-fun (-> renders vals first)]
+      (assert (pos? (count renders)) "Missing reagent-render")
+      (assert (== 1 (count renders)) "Too many render functions supplied")
+      (assert-callable render-fun)))
+  (let [render-fun (or (:reagentRender fmap)
+                       (:componentFunction fmap))
+        legacy-render (nil? render-fun)
+        render-fun (or render-fun
+                       (:render fmap))
+        name (str (or (:displayName fmap)
+                      (util/fun-name render-fun)))
+        name (case name
+               "" (str (gensym "reagent"))
+               name)
+        fmap (reduce-kv (fn [m k v]
+                          (assoc m k (get-wrapper k v name)))
+                        {} fmap)]
+    (assoc fmap
+           :displayName name
+           :autobind false
+           :cljsLegacyRender legacy-render
+           :reagentRender render-fun
+           :render (:render static-fns))))
+
+(defn map-to-js [m]
+  (reduce-kv (fn [o k v]
+               (doto o
+                 (aset (name k) v)))
+             #js{} m))
+
+(defn cljsify [body]
+  (-> body
+      camelify-map-keys
+      add-obligatory
+      wrap-funs
+      map-to-js))
+
+(defn create-class [body]
+  {:pre [(map? body)]}
+  (->> body
+       cljsify
+       create-react-class))
+
+(defn fiber-component-path [fiber]
+  (let [name (some-> fiber
+                     ($ :type)
+                     ($ :displayName))
+        parent (some-> fiber
+                       ($ :return))
+        path (some-> parent
+                     fiber-component-path
+                     (str " > "))
+        res (str path name)]
+    (when-not (empty? res) res)))
+
+(defn component-path [c]
+  ;; Alternative branch for React 16
+  ;; Try both original name (for UMD foreign-lib) and manged name (property access, for Closure optimized React)
+  (if-let [fiber (or (some-> c ($ :_reactInternalFiber))
+                     (some-> c (.-_reactInternalFiber)))]
+    (fiber-component-path fiber)
+    (let [instance (or (some-> c ($ :_reactInternalInstance))
+                       (some-> c (.-_reactInternalInstance))
+                       c)
+          elem (or (some-> instance ($ :_currentElement))
+                   (some-> instance (.-_currentElement)))
+          name (some-> elem
+                       ($ :type)
+                       ($ :displayName))
+          owner (or (some-> elem ($ :_owner))
+                    (some-> elem (.-_owner)))
+          path (some-> owner
+                       component-path
+                       (str " > "))
+          res (str path name)]
+      (when-not (empty? res) res))))
+
+(defn comp-name []
+  (if (dev?)
+    (let [c *current-component*
+          n (or (component-path c)
+                (some-> c .-constructor util/fun-name))]
+      (if-not (empty? n)
+        (str " (in " n ")")
+        ""))
+    ""))
+
+(defn fn-to-class [f]
+  (assert-callable f)
+  (warn-unless (not (and (react-class? f)
+                         (not (reagent-class? f))))
+               "Using native React classes directly in Hiccup forms "
+               "is not supported. Use create-element or "
+               "adapt-react-class instead: " (let [n (util/fun-name f)]
+                                               (if (empty? n) f n))
+               (comp-name))
+  (if (reagent-class? f)
+    (cache-react-class f f)
+    (let [spec (meta f)
+          withrender (assoc spec :reagent-render f)
+          res (create-class withrender)]
+      (cache-react-class f res))))
+
+(defn as-class [tag]
+  (if-some [cached-class (cached-react-class tag)]
+    cached-class
+    (fn-to-class tag)))
+
+(defn reactify-component [comp]
+  (if (react-class? comp)
+    comp
+    (as-class comp)))
diff --git a/js/reagent/impl/component.cljs.cache.json b/js/reagent/impl/component.cljs.cache.json
new file mode 100644
index 0000000..516c4c3
--- /dev/null
+++ b/js/reagent/impl/component.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Object",["^ ","~$Children",["^ ","~$toArray",["^ "]]],"~$Error",["^ "],"~$console",["^ "]],"~:use-macros",["^ ","~$warn-unless","~$reagent.debug","~$dbg","^:","~$$!","~$reagent.interop","~$prn","^:","~$warn","^:","~$dev?","^:","~$$","^=","~$assert-callable","^:","~$error","^:"],"~:excludes",["~#set",[]],"~:name","~$reagent.impl.component","~:imports",null,"~:requires",["^ ","~$create-react-class","^I","~$reagent.impl.util","^J","^=","^=","~$reagent.ratom","^K","~$react","^L","~$reagent.impl.batching","^M","~$util","^J","~$ratom","^K","~$batch","^M","^:","^:"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$get-props",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","~:line",43,"~:column",7,"~:end-line",43,"~:end-column",16,"~:arglists",["~#list",["~$quote",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/get-props","~:variadic",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",16,"~:method-params",["^11",[["~$c"]]],"~:protocol-impl",null,"~:arglists-meta",["^11",[null,null]],"^Y",1,"^X",43,"^Z",43,"~:max-fixed-arity",1,"~:fn-var",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$get-wrapper",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",208,"^Y",7,"^Z",208,"^[",18,"^10",["^11",["^12",["^11",[["~$key","~$f","~$name"]]]]]],"^E","~$reagent.impl.component/get-wrapper","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",18,"^15",["^11",[["^1;","~$f","^1<"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",208,"^Z",208,"^18",3,"^19",true,"^10",["^11",["^12",["^11",[["^1;","~$f","^1<"]]]]]],"~$get-argv",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",40,"^Y",7,"^Z",40,"^[",15,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/get-argv","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",15,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",40,"^Z",40,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$wrap-render",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",89,"^Y",7,"^Z",89,"^[",18,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/wrap-render","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",18,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",89,"^Z",89,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$rat-opts",["^ ","^E","~$reagent.impl.component/rat-opts","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",133,"^Y",1,"^Z",133,"^[",14,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",133,"^Y",6,"^Z",133,"^[",14],"~:tag","~$cljs.core/IMap"],"~$obligatory",["^ ","^E","~$reagent.impl.component/obligatory","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",214,"^Y",1,"^Z",214,"^[",16,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",214,"^Y",6,"^Z",214,"^[",16],"^1D","^1E"],"~$props-argv",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",35,"^Y",7,"^Z",35,"^[",17,"^10",["^11",["^12",["^11",[["~$c","~$p"]]]]]],"^E","~$reagent.impl.component/props-argv","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",17,"^15",["^11",[["~$c","~$p"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",35,"^Z",35,"^18",2,"^19",true,"^10",["^11",["^12",["^11",[["~$c","~$p"]]]]]],"~$as-element",["^ ","^E","~$reagent.impl.component/as-element","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",84,"^Y",1,"^Z",84,"^[",20,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",84,"^Y",10,"^Z",84,"^[",20],"^1D","~$clj-nil"],"~$do-render",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",115,"^Y",7,"^Z",115,"^[",16,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/do-render","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",16,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",115,"^Z",115,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$comp-name",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",308,"^Y",7,"^Z",308,"^[",16,"^10",["^11",["^12",["^11",[[]]]]]],"^E","~$reagent.impl.component/comp-name","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",16,"^15",["^11",[[]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",308,"^Z",308,"^18",0,"^19",true,"^10",["^11",["^12",["^11",[[]]]]]],"~$add-obligatory",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",225,"^Y",7,"^Z",225,"^[",21,"^10",["^11",["^12",["^11",[["~$fun-map"]]]]]],"^E","~$reagent.impl.component/add-obligatory","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",21,"^15",["^11",[["^1R"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",225,"^Z",225,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^1R"]]]]]],"~$cached-react-class",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",68,"^Y",7,"^Z",68,"^[",25,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/cached-react-class","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",25,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",68,"^Z",68,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$state-atom",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",77,"^Y",7,"^Z",77,"^[",17,"^10",["^11",["^12",["^11",[["~$this"]]]]]],"^E","~$reagent.impl.component/state-atom","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",17,"^15",["^11",[["^1W"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",77,"^Z",77,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^1W"]]]]]],"~$fiber-component-path",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",274,"^Y",7,"^Z",274,"^[",27,"^10",["^11",["^12",["^11",[["~$fiber"]]]]]],"^E","~$reagent.impl.component/fiber-component-path","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",27,"^15",["^11",[["^1Z"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",274,"^Z",274,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^1Z"]]]]]],"~$dash-to-camel",["^ ","^E","~$reagent.impl.component/dash-to-camel","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",218,"^Y",1,"^Z",218,"^[",19,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",218,"^Y",6,"^Z",218,"^[",19],"^1D","~$any"],"~$reagent-component?",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",65,"^Y",16,"^Z",65,"^[",34,"^1D","~$boolean","^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/reagent-component?","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",34,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",65,"~:ret-tag","^24","^Z",65,"^18",1,"^1D","^24","^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$static-fns",["^ ","^E","~$reagent.impl.component/static-fns","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",135,"^Y",1,"^Z",135,"^[",16,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",135,"^Y",6,"^Z",135,"^[",16],"^1D","^1E"],"~$as-class",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",334,"^Y",7,"^Z",334,"^[",15,"^10",["^11",["^12",["^11",[["~$tag"]]]]]],"^E","~$reagent.impl.component/as-class","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",15,"^15",["^11",[["^2:"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",334,"^Z",334,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^2:"]]]]]],"~$reagent-class?",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",57,"^Y",16,"^Z",57,"^[",30,"^1D","^24","^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/reagent-class?","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",30,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",57,"^26","^24","^Z",57,"^18",1,"^1D","^24","^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$fn-to-class",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",318,"^Y",7,"^Z",318,"^[",18,"^10",["^11",["^12",["^11",[["~$f"]]]]]],"^E","~$reagent.impl.component/fn-to-class","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",18,"^15",["^11",[["~$f"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",318,"^Z",318,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$f"]]]]]],"~$reactify-component",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",339,"^Y",7,"^Z",339,"^[",25,"^10",["^11",["^12",["^11",[["~$comp"]]]]]],"^E","~$reagent.impl.component/reactify-component","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",25,"^15",["^11",[["^2A"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",339,"^Z",339,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^2A"]]]]]],"~$map-to-js",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",255,"^Y",7,"^Z",255,"^[",16,"^10",["^11",["^12",["^11",[["~$m"]]]]]],"^E","~$reagent.impl.component/map-to-js","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",16,"^15",["^11",[["~$m"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",255,"^Z",255,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$m"]]]]]],"~$extract-children",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",29,"^Y",7,"^Z",29,"^[",23,"^10",["^11",["^12",["^11",[["~$v"]]]]]],"^E","~$reagent.impl.component/extract-children","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",23,"^15",["^11",[["~$v"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",29,"^Z",29,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$v"]]]]]],"~$component-path",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",286,"^Y",7,"^Z",286,"^[",21,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/component-path","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",21,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",286,"^Z",286,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$extract-props",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",25,"^Y",7,"^Z",25,"^[",20,"^10",["^11",["^12",["^11",[["~$v"]]]]]],"^E","~$reagent.impl.component/extract-props","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",20,"^15",["^11",[["~$v"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",25,"^Z",25,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$v"]]]]]],"~$*current-component*",["^ ","^E","~$reagent.impl.component/*current-component*","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",11,"^Y",1,"^Z",11,"^[",39,"~:dynamic",true,"~:declared",true,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",11,"^Y",20,"^Z",11,"^[",39,"^2M",true,"^2N",true]],"~$get-children",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",49,"^Y",7,"^Z",49,"^[",19,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/get-children","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",19,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",49,"^Z",49,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$camelify-map-keys",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",220,"^Y",7,"^Z",220,"^[",24,"^10",["^11",["^12",["^11",[["^1R"]]]]]],"^E","~$reagent.impl.component/camelify-map-keys","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",24,"^15",["^11",[["^1R"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",220,"^Z",220,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^1R"]]]]]],"~$shallow-obj-to-map",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",16,"^Y",7,"^Z",16,"^[",25,"^10",["^11",["^12",["^11",[["~$o"]]]]]],"^E","~$reagent.impl.component/shallow-obj-to-map","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",25,"^15",["^11",[["~$o"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",16,"^Z",16,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["~$o"]]]]]],"~$cljsify",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",261,"^Y",7,"^Z",261,"^[",14,"^10",["^11",["^12",["^11",[["~$body"]]]]]],"^E","~$reagent.impl.component/cljsify","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",14,"^15",["^11",[["^2V"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",261,"^Z",261,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^2V"]]]]]],"~$react-class?",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",61,"^Y",16,"^Z",61,"^[",28,"^1D","^24","^10",["^11",["^12",["^11",[["~$c"]]]]]],"^E","~$reagent.impl.component/react-class?","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",28,"^15",["^11",[["~$c"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",61,"^26","^24","^Z",61,"^18",1,"^1D","^24","^19",true,"^10",["^11",["^12",["^11",[["~$c"]]]]]],"~$cache-react-class",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",71,"^Y",7,"^Z",71,"^[",24,"^10",["^11",["^12",["^11",[["~$c","~$constructor"]]]]]],"^E","~$reagent.impl.component/cache-react-class","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",24,"^15",["^11",[["~$c","^2["]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",71,"^Z",71,"^18",2,"^19",true,"^10",["^11",["^12",["^11",[["~$c","^2["]]]]]],"~$custom-wrapper",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",147,"^Y",7,"^Z",147,"^[",21,"^10",["^11",["^12",["^11",[["^1;","~$f"]]]]]],"^E","~$reagent.impl.component/custom-wrapper","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",21,"^15",["^11",[["^1;","~$f"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",147,"^Z",147,"^18",2,"^19",true,"^10",["^11",["^12",["^11",[["^1;","~$f"]]]]]],"~$create-class",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",268,"^Y",7,"^Z",268,"^[",19,"^10",["^11",["^12",["^11",[["^2V"]]]]]],"^E","~$reagent.impl.component/create-class","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",19,"^15",["^11",[["^2V"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",268,"^Z",268,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^2V"]]]]]],"~$wrap-funs",["^ ","^U",null,"^V",["^ ","^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^X",228,"^Y",7,"^Z",228,"^[",16,"^10",["^11",["^12",["^11",[["~$fmap"]]]]]],"^E","~$reagent.impl.component/wrap-funs","^14",false,"^W","/home/julien/.cljs/.aot_cache/1.10.329/1EE6299/reagent/impl/component.cljs","^[",16,"^15",["^11",[["^36"]]],"^16",null,"^17",["^11",[null,null]],"^Y",1,"^X",228,"^Z",228,"^18",1,"^19",true,"^10",["^11",["^12",["^11",[["^36"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^O","^K","^K","^K","^=","^=","^:","^:"],"~:cljs.analyzer/constants",["^ ","~:seen",["^D",["~:cljsLegacyRender","~:else","~:displayName","~:componentWillUnmount","~:shouldComponentUpdate","~:reagentRender","~:no-cache","~:render","~:reagent-render","~:componentFunction","~:autobind","~:componentWillMount"]],"~:order",["^3=","^3B","^3C","^3@","^3G","^3?","^3A","^3E","^3>","^3F","^3<","^3D"]],"~:doc",null]
\ No newline at end of file
diff --git a/js/reagent/impl/component.js b/js/reagent/impl/component.js
new file mode 100644
index 0000000..f87f31b
--- /dev/null
+++ b/js/reagent/impl/component.js
@@ -0,0 +1,681 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.impl.component');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('reagent.impl.util');
+goog.require('reagent.impl.batching');
+goog.require('reagent.ratom');
+goog.require('reagent.interop');
+goog.require('reagent.debug');
+reagent.impl.component.global$module$create_react_class = goog.global["createReactClass"];
+reagent.impl.component.global$module$react = goog.global["React"];
+reagent.impl.component.shallow_obj_to_map = (function reagent$impl$component$shallow_obj_to_map(o){
+var ks = cljs.core.js_keys(o);
+var len = ks.length;
+var m = cljs.core.PersistentArrayMap.EMPTY;
+var i = (0);
+while(true){
+if((i < len)){
+var k = (ks[i]);
+var G__3748 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(k),(o[k]));
+var G__3749 = (i + (1));
+m = G__3748;
+i = G__3749;
+continue;
+} else {
+return m;
+}
+break;
+}
+});
+reagent.impl.component.extract_props = (function reagent$impl$component$extract_props(v){
+var p = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(v,(1),null);
+if(cljs.core.map_QMARK_(p)){
+return p;
+} else {
+return null;
+}
+});
+reagent.impl.component.extract_children = (function reagent$impl$component$extract_children(v){
+var p = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(v,(1),null);
+var first_child = (((((p == null)) || (cljs.core.map_QMARK_(p))))?(2):(1));
+if((cljs.core.count(v) > first_child)){
+return cljs.core.subvec.cljs$core$IFn$_invoke$arity$2(v,first_child);
+} else {
+return null;
+}
+});
+reagent.impl.component.props_argv = (function reagent$impl$component$props_argv(c,p){
+var temp__5459__auto__ = (p["argv"]);
+if((temp__5459__auto__ == null)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [c.constructor,reagent.impl.component.shallow_obj_to_map(p)], null);
+} else {
+var a = temp__5459__auto__;
+return a;
+}
+});
+reagent.impl.component.get_argv = (function reagent$impl$component$get_argv(c){
+return reagent.impl.component.props_argv(c,(c["props"]));
+});
+reagent.impl.component.get_props = (function reagent$impl$component$get_props(c){
+var p = (c["props"]);
+var temp__5459__auto__ = (p["argv"]);
+if((temp__5459__auto__ == null)){
+return reagent.impl.component.shallow_obj_to_map(p);
+} else {
+var v = temp__5459__auto__;
+return reagent.impl.component.extract_props(v);
+}
+});
+reagent.impl.component.get_children = (function reagent$impl$component$get_children(c){
+var p = (c["props"]);
+var temp__5459__auto__ = (p["argv"]);
+if((temp__5459__auto__ == null)){
+return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentVector.EMPTY,(function (){var G__3750 = (p["children"]);
+return (reagent.impl.component.global$module$react.Children.toArray.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.component.global$module$react.Children.toArray.cljs$core$IFn$_invoke$arity$1(G__3750) : reagent.impl.component.global$module$react.Children.toArray.call(null,G__3750));
+})());
+} else {
+var v = temp__5459__auto__;
+return reagent.impl.component.extract_children(v);
+}
+});
+reagent.impl.component.reagent_class_QMARK_ = (function reagent$impl$component$reagent_class_QMARK_(c){
+return ((cljs.core.fn_QMARK_(c)) && (!(((function (){var G__3752 = c;
+var G__3752__$1 = (((G__3752 == null))?null:G__3752.prototype);
+if((G__3752__$1 == null)){
+return null;
+} else {
+return (G__3752__$1["reagentRender"]);
+}
+})() == null))));
+});
+reagent.impl.component.react_class_QMARK_ = (function reagent$impl$component$react_class_QMARK_(c){
+return ((cljs.core.fn_QMARK_(c)) && (!(((function (){var G__3754 = c;
+var G__3754__$1 = (((G__3754 == null))?null:G__3754.prototype);
+if((G__3754__$1 == null)){
+return null;
+} else {
+return (G__3754__$1["render"]);
+}
+})() == null))));
+});
+reagent.impl.component.reagent_component_QMARK_ = (function reagent$impl$component$reagent_component_QMARK_(c){
+return !(((c["reagentRender"]) == null));
+});
+reagent.impl.component.cached_react_class = (function reagent$impl$component$cached_react_class(c){
+return (c["cljsReactClass"]);
+});
+reagent.impl.component.cache_react_class = (function reagent$impl$component$cache_react_class(c,constructor$){
+return (c["cljsReactClass"] = constructor$);
+});
+reagent.impl.component.state_atom = (function reagent$impl$component$state_atom(this$){
+var sa = (this$["cljsState"]);
+if(!((sa == null))){
+return sa;
+} else {
+return (this$["cljsState"] = reagent.ratom.atom.cljs$core$IFn$_invoke$arity$1(null));
+}
+});
+if((typeof reagent !== 'undefined') && (typeof reagent.impl !== 'undefined') && (typeof reagent.impl.component !== 'undefined') && (typeof reagent.impl.component.as_element !== 'undefined')){
+} else {
+reagent.impl.component.as_element = null;
+}
+reagent.impl.component.wrap_render = (function reagent$impl$component$wrap_render(c){
+while(true){
+var f = (c["reagentRender"]);
+var _ = ((cljs.core.ifn_QMARK_(f))?null:(function(){throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected something callable, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([f], 0)))].join('')),"\n","(clojure.core/ifn? f)"].join('')))})());
+var res = (((c["cljsLegacyRender"]) === true)?f.call(c,c):(function (){var v = reagent.impl.component.get_argv(c);
+var n = cljs.core.count(v);
+var G__3755 = n;
+switch (G__3755) {
+case (1):
+return f.call(c);
+
+break;
+case (2):
+return f.call(c,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(1)));
+
+break;
+case (3):
+return f.call(c,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(1)),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(2)));
+
+break;
+case (4):
+return f.call(c,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(1)),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(2)),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(3)));
+
+break;
+case (5):
+return f.call(c,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(1)),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(2)),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(3)),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,(4)));
+
+break;
+default:
+return f.apply(c,cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(v).slice((1)));
+
+}
+})());
+if(cljs.core.vector_QMARK_(res)){
+return (reagent.impl.component.as_element.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.component.as_element.cljs$core$IFn$_invoke$arity$1(res) : reagent.impl.component.as_element.call(null,res));
+} else {
+if(cljs.core.ifn_QMARK_(res)){
+var f__$1 = ((reagent.impl.component.reagent_class_QMARK_(res))?((function (c,f,_,res){
+return (function() { 
+var G__3758__delegate = function (args){
+var G__3756 = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.vector,res,args);
+return (reagent.impl.component.as_element.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.component.as_element.cljs$core$IFn$_invoke$arity$1(G__3756) : reagent.impl.component.as_element.call(null,G__3756));
+};
+var G__3758 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__3759__i = 0, G__3759__a = new Array(arguments.length -  0);
+while (G__3759__i < G__3759__a.length) {G__3759__a[G__3759__i] = arguments[G__3759__i + 0]; ++G__3759__i;}
+  args = new cljs.core.IndexedSeq(G__3759__a,0,null);
+} 
+return G__3758__delegate.call(this,args);};
+G__3758.cljs$lang$maxFixedArity = 0;
+G__3758.cljs$lang$applyTo = (function (arglist__3760){
+var args = cljs.core.seq(arglist__3760);
+return G__3758__delegate(args);
+});
+G__3758.cljs$core$IFn$_invoke$arity$variadic = G__3758__delegate;
+return G__3758;
+})()
+;})(c,f,_,res))
+:res);
+(c["reagentRender"] = f__$1);
+
+var G__3761 = c;
+c = G__3761;
+continue;
+} else {
+return res;
+
+}
+}
+break;
+}
+});
+reagent.impl.component.do_render = (function reagent$impl$component$do_render(c){
+var _STAR_current_component_STAR_3762 = reagent.impl.component._STAR_current_component_STAR_;
+reagent.impl.component._STAR_current_component_STAR_ = c;
+
+try{var ok = [false];
+try{var res = reagent.impl.component.wrap_render(c);
+(ok[(0)] = true);
+
+return res;
+}finally {if(cljs.core.truth_((ok[(0)]))){
+} else {
+if(cljs.core.truth_(reagent.debug.has_console)){
+(cljs.core.truth_(reagent.debug.tracking)?reagent.debug.track_console:console).error([cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Error rendering component",cljs.core.str.cljs$core$IFn$_invoke$arity$1((reagent.impl.component.comp_name.cljs$core$IFn$_invoke$arity$0 ? reagent.impl.component.comp_name.cljs$core$IFn$_invoke$arity$0() : reagent.impl.component.comp_name.call(null)))].join(''))].join(''));
+} else {
+}
+}
+}
+}finally {reagent.impl.component._STAR_current_component_STAR_ = _STAR_current_component_STAR_3762;
+}});
+reagent.impl.component.rat_opts = new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$no_DASH_cache,true], null);
+reagent.impl.component.static_fns = new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$render,(function reagent$impl$component$render(){
+var c = this;
+if(reagent.impl.util._STAR_non_reactive_STAR_){
+return reagent.impl.component.do_render(c);
+} else {
+var rat = (c["cljsRatom"]);
+reagent.impl.batching.mark_rendered(c);
+
+if((rat == null)){
+return reagent.ratom.run_in_reaction(((function (rat,c){
+return (function (){
+return reagent.impl.component.do_render(c);
+});})(rat,c))
+,c,"cljsRatom",reagent.impl.batching.queue_render,reagent.impl.component.rat_opts);
+} else {
+return rat._run(false);
+}
+}
+})], null);
+reagent.impl.component.custom_wrapper = (function reagent$impl$component$custom_wrapper(key,f){
+var G__3763 = key;
+var G__3763__$1 = (((G__3763 instanceof cljs.core.Keyword))?G__3763.fqn:null);
+switch (G__3763__$1) {
+case "getDefaultProps":
+throw (new Error("getDefaultProps not supported"));
+
+break;
+case "getInitialState":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_getInitialState(){
+var c = this;
+return cljs.core.reset_BANG_(reagent.impl.component.state_atom(c),f.call(c,c));
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "componentWillReceiveProps":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_componentWillReceiveProps(nextprops){
+var c = this;
+return f.call(c,c,reagent.impl.component.props_argv(c,nextprops));
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "shouldComponentUpdate":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_shouldComponentUpdate(nextprops,nextstate){
+var or__3936__auto__ = reagent.impl.util._STAR_always_update_STAR_;
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+var c = this;
+var old_argv = (c["props"]["argv"]);
+var new_argv = (nextprops["argv"]);
+var noargv = (((old_argv == null)) || ((new_argv == null)));
+if((f == null)){
+return ((noargv) || (cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(old_argv,new_argv)));
+} else {
+if(noargv){
+return f.call(c,c,reagent.impl.component.get_argv(c),reagent.impl.component.props_argv(c,nextprops));
+} else {
+return f.call(c,c,old_argv,new_argv);
+
+}
+}
+}
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "componentWillUpdate":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_componentWillUpdate(nextprops){
+var c = this;
+return f.call(c,c,reagent.impl.component.props_argv(c,nextprops));
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "componentDidUpdate":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_componentDidUpdate(oldprops){
+var c = this;
+return f.call(c,c,reagent.impl.component.props_argv(c,oldprops));
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "componentWillMount":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_componentWillMount(){
+var c = this;
+(c["cljsMountOrder"] = reagent.impl.batching.next_mount_count());
+
+if((f == null)){
+return null;
+} else {
+return f.call(c,c);
+}
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "componentDidMount":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_componentDidMount(){
+var c = this;
+return f.call(c,c);
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "componentWillUnmount":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_componentWillUnmount(){
+var c = this;
+var G__3764_3766 = (c["cljsRatom"]);
+if((G__3764_3766 == null)){
+} else {
+reagent.ratom.dispose_BANG_(G__3764_3766);
+}
+
+reagent.impl.batching.mark_rendered(c);
+
+if((f == null)){
+return null;
+} else {
+return f.call(c,c);
+}
+});
+;})(G__3763,G__3763__$1))
+
+break;
+case "componentDidCatch":
+return ((function (G__3763,G__3763__$1){
+return (function reagent$impl$component$custom_wrapper_$_componentDidCatch(error,info){
+var c = this;
+return f.call(c,c,error,info);
+});
+;})(G__3763,G__3763__$1))
+
+break;
+default:
+return null;
+
+}
+});
+reagent.impl.component.get_wrapper = (function reagent$impl$component$get_wrapper(key,f,name){
+var wrap = reagent.impl.component.custom_wrapper(key,f);
+if(cljs.core.truth_((function (){var and__3925__auto__ = wrap;
+if(cljs.core.truth_(and__3925__auto__)){
+return f;
+} else {
+return and__3925__auto__;
+}
+})())){
+if(cljs.core.ifn_QMARK_(f)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected something callable, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([f], 0)))].join('')),"\n","(clojure.core/ifn? f)"].join('')));
+}
+} else {
+}
+
+var or__3936__auto__ = wrap;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return f;
+}
+});
+reagent.impl.component.obligatory = new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$shouldComponentUpdate,null,cljs.core.cst$kw$componentWillMount,null,cljs.core.cst$kw$componentWillUnmount,null], null);
+reagent.impl.component.dash_to_camel = reagent.impl.util.memoize_1(reagent.impl.util.dash_to_camel);
+reagent.impl.component.camelify_map_keys = (function reagent$impl$component$camelify_map_keys(fun_map){
+return cljs.core.reduce_kv((function (m,k,v){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,cljs.core.keyword.cljs$core$IFn$_invoke$arity$1((reagent.impl.component.dash_to_camel.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.component.dash_to_camel.cljs$core$IFn$_invoke$arity$1(k) : reagent.impl.component.dash_to_camel.call(null,k))),v);
+}),cljs.core.PersistentArrayMap.EMPTY,fun_map);
+});
+reagent.impl.component.add_obligatory = (function reagent$impl$component$add_obligatory(fun_map){
+return cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([reagent.impl.component.obligatory,fun_map], 0));
+});
+reagent.impl.component.wrap_funs = (function reagent$impl$component$wrap_funs(fmap){
+var renders_3768 = cljs.core.select_keys(fmap,new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$kw$render,cljs.core.cst$kw$reagentRender,cljs.core.cst$kw$componentFunction], null));
+var render_fun_3769 = cljs.core.first(cljs.core.vals(renders_3768));
+if((cljs.core.count(renders_3768) > (0))){
+} else {
+throw (new Error(["Assert failed: ","Missing reagent-render","\n","(pos? (count renders))"].join('')));
+}
+
+if(((1) === cljs.core.count(renders_3768))){
+} else {
+throw (new Error(["Assert failed: ","Too many render functions supplied","\n","(== 1 (count renders))"].join('')));
+}
+
+if(cljs.core.ifn_QMARK_(render_fun_3769)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected something callable, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([render_fun_3769], 0)))].join('')),"\n","(clojure.core/ifn? render-fun)"].join('')));
+}
+
+
+var render_fun = (function (){var or__3936__auto__ = cljs.core.cst$kw$reagentRender.cljs$core$IFn$_invoke$arity$1(fmap);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.cst$kw$componentFunction.cljs$core$IFn$_invoke$arity$1(fmap);
+}
+})();
+var legacy_render = (render_fun == null);
+var render_fun__$1 = (function (){var or__3936__auto__ = render_fun;
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return cljs.core.cst$kw$render.cljs$core$IFn$_invoke$arity$1(fmap);
+}
+})();
+var name = [cljs.core.str.cljs$core$IFn$_invoke$arity$1((function (){var or__3936__auto__ = cljs.core.cst$kw$displayName.cljs$core$IFn$_invoke$arity$1(fmap);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return reagent.impl.util.fun_name(render_fun__$1);
+}
+})())].join('');
+var name__$1 = (function (){var G__3767 = name;
+switch (G__3767) {
+case "":
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.gensym.cljs$core$IFn$_invoke$arity$1("reagent"))].join('');
+
+break;
+default:
+return name;
+
+}
+})();
+var fmap__$1 = cljs.core.reduce_kv(((function (render_fun,legacy_render,render_fun__$1,name,name__$1){
+return (function (m,k,v){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,reagent.impl.component.get_wrapper(k,v,name__$1));
+});})(render_fun,legacy_render,render_fun__$1,name,name__$1))
+,cljs.core.PersistentArrayMap.EMPTY,fmap);
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic(fmap__$1,cljs.core.cst$kw$displayName,name__$1,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$autobind,false,cljs.core.cst$kw$cljsLegacyRender,legacy_render,cljs.core.cst$kw$reagentRender,render_fun__$1,cljs.core.cst$kw$render,cljs.core.cst$kw$render.cljs$core$IFn$_invoke$arity$1(reagent.impl.component.static_fns)], 0));
+});
+reagent.impl.component.map_to_js = (function reagent$impl$component$map_to_js(m){
+return cljs.core.reduce_kv((function (o,k,v){
+var G__3771 = o;
+(G__3771[cljs.core.name(k)] = v);
+
+return G__3771;
+}),({}),m);
+});
+reagent.impl.component.cljsify = (function reagent$impl$component$cljsify(body){
+return reagent.impl.component.map_to_js(reagent.impl.component.wrap_funs(reagent.impl.component.add_obligatory(reagent.impl.component.camelify_map_keys(body))));
+});
+reagent.impl.component.create_class = (function reagent$impl$component$create_class(body){
+if(cljs.core.map_QMARK_(body)){
+} else {
+throw (new Error("Assert failed: (map? body)"));
+}
+
+var G__3772 = reagent.impl.component.cljsify(body);
+return (reagent.impl.component.global$module$create_react_class.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.component.global$module$create_react_class.cljs$core$IFn$_invoke$arity$1(G__3772) : reagent.impl.component.global$module$create_react_class.call(null,G__3772));
+});
+reagent.impl.component.fiber_component_path = (function reagent$impl$component$fiber_component_path(fiber){
+var name = (function (){var G__3773 = fiber;
+var G__3773__$1 = (((G__3773 == null))?null:(G__3773["type"]));
+if((G__3773__$1 == null)){
+return null;
+} else {
+return (G__3773__$1["displayName"]);
+}
+})();
+var parent = (function (){var G__3774 = fiber;
+if((G__3774 == null)){
+return null;
+} else {
+return (G__3774["return"]);
+}
+})();
+var path = (function (){var G__3775 = parent;
+var G__3775__$1 = (((G__3775 == null))?null:(reagent.impl.component.fiber_component_path.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.component.fiber_component_path.cljs$core$IFn$_invoke$arity$1(G__3775) : reagent.impl.component.fiber_component_path.call(null,G__3775)));
+if((G__3775__$1 == null)){
+return null;
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__3775__$1)," > "].join('');
+}
+})();
+var res = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(path),cljs.core.str.cljs$core$IFn$_invoke$arity$1(name)].join('');
+if(cljs.core.empty_QMARK_(res)){
+return null;
+} else {
+return res;
+}
+});
+reagent.impl.component.component_path = (function reagent$impl$component$component_path(c){
+var temp__5455__auto__ = (function (){var or__3936__auto__ = (function (){var G__3777 = c;
+if((G__3777 == null)){
+return null;
+} else {
+return (G__3777["_reactInternalFiber"]);
+}
+})();
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var G__3778 = c;
+if((G__3778 == null)){
+return null;
+} else {
+return G__3778._reactInternalFiber;
+}
+}
+})();
+if(cljs.core.truth_(temp__5455__auto__)){
+var fiber = temp__5455__auto__;
+return reagent.impl.component.fiber_component_path(fiber);
+} else {
+var instance = (function (){var or__3936__auto__ = (function (){var G__3780 = c;
+if((G__3780 == null)){
+return null;
+} else {
+return (G__3780["_reactInternalInstance"]);
+}
+})();
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (function (){var G__3782 = c;
+if((G__3782 == null)){
+return null;
+} else {
+return G__3782._reactInternalInstance;
+}
+})();
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+return c;
+}
+}
+})();
+var elem = (function (){var or__3936__auto__ = (function (){var G__3784 = instance;
+if((G__3784 == null)){
+return null;
+} else {
+return (G__3784["_currentElement"]);
+}
+})();
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var G__3785 = instance;
+if((G__3785 == null)){
+return null;
+} else {
+return G__3785._currentElement;
+}
+}
+})();
+var name = (function (){var G__3786 = elem;
+var G__3786__$1 = (((G__3786 == null))?null:(G__3786["type"]));
+if((G__3786__$1 == null)){
+return null;
+} else {
+return (G__3786__$1["displayName"]);
+}
+})();
+var owner = (function (){var or__3936__auto__ = (function (){var G__3788 = elem;
+if((G__3788 == null)){
+return null;
+} else {
+return (G__3788["_owner"]);
+}
+})();
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var G__3789 = elem;
+if((G__3789 == null)){
+return null;
+} else {
+return G__3789._owner;
+}
+}
+})();
+var path = (function (){var G__3790 = owner;
+var G__3790__$1 = (((G__3790 == null))?null:(reagent.impl.component.component_path.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.component.component_path.cljs$core$IFn$_invoke$arity$1(G__3790) : reagent.impl.component.component_path.call(null,G__3790)));
+if((G__3790__$1 == null)){
+return null;
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__3790__$1)," > "].join('');
+}
+})();
+var res = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(path),cljs.core.str.cljs$core$IFn$_invoke$arity$1(name)].join('');
+if(cljs.core.empty_QMARK_(res)){
+return null;
+} else {
+return res;
+}
+}
+});
+reagent.impl.component.comp_name = (function reagent$impl$component$comp_name(){
+var c = reagent.impl.component._STAR_current_component_STAR_;
+var n = (function (){var or__3936__auto__ = reagent.impl.component.component_path(c);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var G__3791 = c;
+var G__3791__$1 = (((G__3791 == null))?null:G__3791.constructor);
+if((G__3791__$1 == null)){
+return null;
+} else {
+return reagent.impl.util.fun_name(G__3791__$1);
+}
+}
+})();
+if(!(cljs.core.empty_QMARK_(n))){
+return [" (in ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n),")"].join('');
+} else {
+return "";
+}
+
+});
+reagent.impl.component.fn_to_class = (function reagent$impl$component$fn_to_class(f){
+if(cljs.core.ifn_QMARK_(f)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Expected something callable, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([f], 0)))].join('')),"\n","(clojure.core/ifn? f)"].join('')));
+}
+
+if(!(!(((reagent.impl.component.react_class_QMARK_(f)) && (!(reagent.impl.component.reagent_class_QMARK_(f))))))){
+if(cljs.core.truth_(reagent.debug.has_console)){
+(cljs.core.truth_(reagent.debug.tracking)?reagent.debug.track_console:console).warn(["Warning: ","Using native React classes directly in Hiccup forms ","is not supported. Use create-element or ","adapt-react-class instead: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1((function (){var n = reagent.impl.util.fun_name(f);
+if(cljs.core.empty_QMARK_(n)){
+return f;
+} else {
+return n;
+}
+})()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.component.comp_name())].join(''));
+} else {
+}
+} else {
+}
+
+if(reagent.impl.component.reagent_class_QMARK_(f)){
+return reagent.impl.component.cache_react_class(f,f);
+} else {
+var spec = cljs.core.meta(f);
+var withrender = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(spec,cljs.core.cst$kw$reagent_DASH_render,f);
+var res = reagent.impl.component.create_class(withrender);
+return reagent.impl.component.cache_react_class(f,res);
+}
+});
+reagent.impl.component.as_class = (function reagent$impl$component$as_class(tag){
+var temp__5459__auto__ = reagent.impl.component.cached_react_class(tag);
+if((temp__5459__auto__ == null)){
+return reagent.impl.component.fn_to_class(tag);
+} else {
+var cached_class = temp__5459__auto__;
+return cached_class;
+}
+});
+reagent.impl.component.reactify_component = (function reagent$impl$component$reactify_component(comp){
+if(reagent.impl.component.react_class_QMARK_(comp)){
+return comp;
+} else {
+return reagent.impl.component.as_class(comp);
+}
+});
diff --git a/js/reagent/impl/template.cljs b/js/reagent/impl/template.cljs
new file mode 100644
index 0000000..02e61aa
--- /dev/null
+++ b/js/reagent/impl/template.cljs
@@ -0,0 +1,480 @@
+(ns reagent.impl.template
+  (:require [react :as react]
+            [clojure.string :as string]
+            [clojure.walk :refer [prewalk]]
+            [reagent.impl.util :as util :refer [is-client]]
+            [reagent.impl.component :as comp]
+            [reagent.impl.batching :as batch]
+            [reagent.ratom :as ratom]
+            [reagent.interop :refer-macros [$ $!]]
+            [reagent.debug :refer-macros [dbg prn println log dev?
+                                          warn warn-unless]]))
+
+(declare as-element)
+
+;; From Weavejester's Hiccup, via pump:
+(def ^{:doc "Regular expression that parses a CSS-style id and class
+             from a tag name."}
+  re-tag #"([^\s\.#]+)(?:#([^\s\.#]+))?(?:\.([^\s#]+))?")
+
+(deftype NativeWrapper [])
+
+
+;;; Common utilities
+
+(defn ^boolean named? [x]
+  (or (keyword? x)
+      (symbol? x)))
+
+(defn ^boolean hiccup-tag? [x]
+  (or (named? x)
+      (string? x)))
+
+(defn ^boolean valid-tag? [x]
+  (or (hiccup-tag? x)
+      (ifn? x)
+      (instance? NativeWrapper x)))
+
+
+;;; Props conversion
+
+(def prop-name-cache #js{:class "className"
+                         :for "htmlFor"
+                         :charset "charSet"})
+
+(defn cache-get [o k]
+  (when ^boolean (.hasOwnProperty o k)
+    (aget o k)))
+
+(defn cached-prop-name [k]
+  (if (named? k)
+    (if-some [k' (cache-get prop-name-cache (name k))]
+      k'
+      (aset prop-name-cache (name k)
+            (util/dash-to-camel k)))
+    k))
+
+(defn ^boolean js-val? [x]
+  (not (identical? "object" (goog/typeOf x))))
+
+(declare convert-prop-value)
+
+(defn kv-conv [o k v]
+  (doto o
+    (aset (cached-prop-name k)
+          (convert-prop-value v))))
+
+(defn convert-prop-value [x]
+  (cond (js-val? x) x
+        (named? x) (name x)
+        (map? x) (reduce-kv kv-conv #js{} x)
+        (coll? x) (clj->js x)
+        (ifn? x) (fn [& args]
+                   (apply x args))
+        :else (clj->js x)))
+
+;; Previous few functions copied for custom elements,
+;; without mapping from class to className etc.
+
+(def custom-prop-name-cache #js{})
+
+(defn cached-custom-prop-name [k]
+  (if (named? k)
+    (if-some [k' (cache-get custom-prop-name-cache (name k))]
+      k'
+      (aset prop-name-cache (name k)
+            (util/dash-to-camel k)))
+    k))
+
+(defn custom-kv-conv [o k v]
+  (doto o
+    (aset (cached-custom-prop-name k)
+          (convert-prop-value v))))
+
+(defn convert-custom-prop-value [x]
+  (cond (js-val? x) x
+        (named? x) (name x)
+        (map? x) (reduce-kv custom-kv-conv #js{} x)
+        (coll? x) (clj->js x)
+        (ifn? x) (fn [& args]
+                   (apply x args))
+        :else (clj->js x)))
+
+(defn oset [o k v]
+  (doto (if (nil? o) #js{} o)
+    (aset k v)))
+
+(defn oget [o k]
+  (if (nil? o) nil (aget o k)))
+
+(defn set-id-class
+  "Takes the id and class from tag keyword, and adds them to the
+  other props. Parsed tag is JS object with :id and :class properties."
+  [props id-class]
+  (let [id ($ id-class :id)
+        class ($ id-class :class)]
+    (cond-> props
+      ;; Only use ID from tag keyword if no :id in props already
+      (and (some? id)
+           (nil? (:id props)))
+      (assoc :id id)
+
+      ;; Merge classes
+      class
+      (assoc :class (let [old-class (:class props)]
+                      (if (nil? old-class) class (str class " " old-class)))))))
+
+(defn stringify-class [{:keys [class] :as props}]
+  (if (coll? class)
+    (->> class
+         (filter identity)
+         (string/join " ")
+         (assoc props :class))
+    props))
+
+(defn convert-props [props id-class]
+  (let [props (-> props
+                  stringify-class
+                  (set-id-class id-class))]
+    (if ($ id-class :custom)
+      (convert-custom-prop-value props)
+      (convert-prop-value props))))
+
+;;; Specialization for input components
+
+;; This gets set from reagent.dom
+(defonce find-dom-node nil)
+
+;; <input type="??" >
+;; The properites 'selectionStart' and 'selectionEnd' only exist on some inputs
+;; See: https://html.spec.whatwg.org/multipage/forms.html#do-not-apply
+(def these-inputs-have-selection-api #{"text" "textarea" "password" "search"
+                                       "tel" "url"})
+
+(defn ^boolean has-selection-api?
+  [input-type]
+  (contains? these-inputs-have-selection-api input-type))
+
+(declare input-component-set-value)
+
+(defn input-node-set-value
+  [node rendered-value dom-value component {:keys [on-write]}]
+  (if-not (and (identical? node ($ js/document :activeElement))
+            (has-selection-api? ($ node :type))
+            (string? rendered-value)
+            (string? dom-value))
+    ;; just set the value, no need to worry about a cursor
+    (do
+      ($! component :cljsDOMValue rendered-value)
+      ($! node :value rendered-value)
+      (when (fn? on-write)
+        (on-write rendered-value)))
+
+    ;; Setting "value" (below) moves the cursor position to the
+    ;; end which gives the user a jarring experience.
+    ;;
+    ;; But repositioning the cursor within the text, turns out to
+    ;; be quite a challenge because changes in the text can be
+    ;; triggered by various events like:
+    ;; - a validation function rejecting a user inputted char
+    ;; - the user enters a lower case char, but is transformed to
+    ;;   upper.
+    ;; - the user selects multiple chars and deletes text
+    ;; - the user pastes in multiple chars, and some of them are
+    ;;   rejected by a validator.
+    ;; - the user selects multiple chars and then types in a
+    ;;   single new char to repalce them all.
+    ;; Coming up with a sane cursor repositioning strategy hasn't
+    ;; been easy ALTHOUGH in the end, it kinda fell out nicely,
+    ;; and it appears to sanely handle all the cases we could
+    ;; think of.
+    ;; So this is just a warning. The code below is simple
+    ;; enough, but if you are tempted to change it, be aware of
+    ;; all the scenarios you have handle.
+    (let [node-value ($ node :value)]
+      (if (not= node-value dom-value)
+        ;; IE has not notified us of the change yet, so check again later
+        (batch/do-after-render #(input-component-set-value component))
+        (let [existing-offset-from-end (- (count node-value)
+                                         ($ node :selectionStart))
+              new-cursor-offset        (- (count rendered-value)
+                                         existing-offset-from-end)]
+          ($! component :cljsDOMValue rendered-value)
+          ($! node :value rendered-value)
+          (when (fn? on-write)
+            (on-write rendered-value))
+          ($! node :selectionStart new-cursor-offset)
+          ($! node :selectionEnd new-cursor-offset))))))
+
+(defn input-component-set-value [this]
+  (when ($ this :cljsInputLive)
+    ($! this :cljsInputDirty false)
+    (let [rendered-value ($ this :cljsRenderedValue)
+          dom-value ($ this :cljsDOMValue)
+          ;; Default to the root node within this component
+          node (find-dom-node this)]
+      (when (not= rendered-value dom-value)
+        (input-node-set-value node rendered-value dom-value this {})))))
+
+(defn input-handle-change [this on-change e]
+  ($! this :cljsDOMValue (-> e .-target .-value))
+  ;; Make sure the input is re-rendered, in case on-change
+  ;; wants to keep the value unchanged
+  (when-not ($ this :cljsInputDirty)
+    ($! this :cljsInputDirty true)
+    (batch/do-after-render #(input-component-set-value this)))
+  (on-change e))
+
+(defn input-render-setup
+  [this jsprops]
+  ;; Don't rely on React for updating "controlled inputs", since it
+  ;; doesn't play well with async rendering (misses keystrokes).
+  (when (and (some? jsprops)
+             (.hasOwnProperty jsprops "onChange")
+             (.hasOwnProperty jsprops "value"))
+    (assert find-dom-node
+            "reagent.dom needs to be loaded for controlled input to work")
+    (let [v ($ jsprops :value)
+          value (if (nil? v) "" v)
+          on-change ($ jsprops :onChange)]
+      (when-not ($ this :cljsInputLive)
+        ;; set initial value
+        ($! this :cljsInputLive true)
+        ($! this :cljsDOMValue value))
+      ($! this :cljsRenderedValue value)
+      (js-delete jsprops "value")
+      (doto jsprops
+        ($! :defaultValue value)
+        ($! :onChange #(input-handle-change this on-change %))))))
+
+(defn input-unmount [this]
+  ($! this :cljsInputLive nil))
+
+(defn ^boolean input-component? [x]
+  (case x
+    ("input" "textarea") true
+    false))
+
+(def reagent-input-class nil)
+
+(declare make-element)
+
+(def input-spec
+  {:display-name "ReagentInput"
+   :component-did-update input-component-set-value
+   :component-will-unmount input-unmount
+   :reagent-render
+   (fn [argv comp jsprops first-child]
+     (let [this comp/*current-component*]
+       (input-render-setup this jsprops)
+       (make-element argv comp jsprops first-child)))})
+
+(defn reagent-input
+  []
+  (when (nil? reagent-input-class)
+    (set! reagent-input-class (comp/create-class input-spec)))
+  reagent-input-class)
+
+
+;;; Conversion from Hiccup forms
+
+(defn parse-tag [hiccup-tag]
+  (let [[tag id class] (->> hiccup-tag name (re-matches re-tag) next)
+        class (when-not (nil? class)
+                (string/replace class #"\." " "))]
+    (assert tag (str "Invalid tag: '" hiccup-tag "'"
+                     (comp/comp-name)))
+    #js {:name tag
+         :id id
+         :class class
+         ;; Custom element names must contain hyphen
+         ;; https://www.w3.org/TR/custom-elements/#custom-elements-core-concepts
+         :custom (not= -1 (.indexOf tag "-"))}))
+
+(defn try-get-key [x]
+  ;; try catch to avoid clojurescript peculiarity with
+  ;; sorted-maps with keys that are numbers
+  (try (get x :key)
+       (catch :default e)))
+
+(defn get-key [x]
+  (when (map? x)
+    (try-get-key x)))
+
+(defn key-from-vec [v]
+  (if-some [k (-> (meta v) get-key)]
+    k
+    (-> v (nth 1 nil) get-key)))
+
+(defn reag-element [tag v]
+  (let [c (comp/as-class tag)
+        jsprops #js{:argv v}]
+    (when-some [key (key-from-vec v)]
+      ($! jsprops :key key))
+    (react/createElement c jsprops)))
+
+(defn fragment-element [argv]
+  (let [props (nth argv 1 nil)
+        hasprops (or (nil? props) (map? props))
+        jsprops (convert-prop-value (if hasprops props))
+        first-child (+ 1 (if hasprops 1 0))]
+    (when-some [key (key-from-vec argv)]
+      (oset jsprops "key" key))
+    (make-element argv react/Fragment jsprops first-child)))
+
+(defn adapt-react-class
+  [c]
+  (doto (->NativeWrapper)
+    ($! :name c)
+    ($! :id nil)
+    ($! :class nil)))
+
+(def tag-name-cache #js{})
+
+(defn cached-parse [x]
+  (if-some [s (cache-get tag-name-cache x)]
+    s
+    (aset tag-name-cache x (parse-tag x))))
+
+(defn native-element [parsed argv first]
+  (let [comp ($ parsed :name)]
+    (let [props (nth argv first nil)
+          hasprops (or (nil? props) (map? props))
+          jsprops (convert-props (if hasprops props) parsed)
+          first-child (+ first (if hasprops 1 0))]
+      (if (input-component? comp)
+        (-> [(reagent-input) argv comp jsprops first-child]
+            (with-meta (meta argv))
+            as-element)
+        (let [key (-> (meta argv) get-key)
+              p (if (nil? key)
+                  jsprops
+                  (oset jsprops "key" key))]
+          (make-element argv comp p first-child))))))
+
+(defn str-coll [coll]
+  (if (dev?)
+    (str (prewalk (fn [x]
+                    (if (fn? x)
+                      (let [n (util/fun-name x)]
+                        (case n "" x (symbol n)))
+                      x)) coll))
+    (str coll)))
+
+(defn hiccup-err [v & msg]
+  (str (apply str msg) ": " (str-coll v) "\n" (comp/comp-name)))
+
+(defn vec-to-elem [v]
+  (assert (pos? (count v)) (hiccup-err v "Hiccup form should not be empty"))
+  (let [tag (nth v 0 nil)]
+    (assert (valid-tag? tag) (hiccup-err v "Invalid Hiccup form"))
+    (cond
+      (keyword-identical? :<> tag)
+      (fragment-element v)
+
+      (hiccup-tag? tag)
+      (let [n (name tag)
+            pos (.indexOf n ">")]
+        (case pos
+          -1 (native-element (cached-parse n) v 1)
+          0 (let [comp (nth v 1 nil)]
+              ;; Support [:> comp ...]
+              (assert (= ">" n) (hiccup-err v "Invalid Hiccup tag"))
+              (assert (or (string? comp) (fn? comp))
+                      (hiccup-err v "Expected React component in"))
+              (native-element #js{:name comp} v 2))
+          ;; Support extended hiccup syntax, i.e :div.bar>a.foo
+          ;; Apply metadata (e.g. :key) to the outermost element.
+          ;; Metadata is probably used only with sequeneces, and in that case
+          ;; only the key of the outermost element matters.
+          (recur (with-meta [(subs n 0 pos)
+                             (assoc (with-meta v nil) 0 (subs n (inc pos)))]
+                            (meta v)))))
+
+      (instance? NativeWrapper tag)
+      (native-element tag v 1)
+
+      :else (reag-element tag v))))
+
+(declare expand-seq)
+(declare expand-seq-check)
+
+(defn as-element [x]
+  (cond (js-val? x) x
+        (vector? x) (vec-to-elem x)
+        (seq? x) (if (dev?)
+                   (expand-seq-check x)
+                   (expand-seq x))
+        (named? x) (name x)
+        (satisfies? IPrintWithWriter x) (pr-str x)
+        :else x))
+
+(set! comp/as-element as-element)
+
+(defn expand-seq [s]
+  (let [a (into-array s)]
+    (dotimes [i (alength a)]
+      (aset a i (as-element (aget a i))))
+    a))
+
+(defn expand-seq-dev [s o]
+  (let [a (into-array s)]
+    (dotimes [i (alength a)]
+      (let [val (aget a i)]
+        (when (and (vector? val)
+                   (nil? (key-from-vec val)))
+          ($! o :no-key true))
+        (aset a i (as-element val))))
+    a))
+
+(defn expand-seq-check [x]
+  (let [ctx #js{}
+        [res derefed] (ratom/check-derefs #(expand-seq-dev x ctx))]
+    (when derefed
+      (warn (hiccup-err x "Reactive deref not supported in lazy seq, "
+                        "it should be wrapped in doall")))
+    (when ($ ctx :no-key)
+      (warn (hiccup-err x "Every element in a seq should have a unique :key")))
+    res))
+
+;; From https://github.com/babel/babel/commit/1d0e68f5a19d721fe8799b1ea331041d8bf9120e
+;; (def react-element-type (or (and (exists? js/Symbol)
+;;                                  ($ js/Symbol :for)
+;;                                  ($ js/Symbol for "react.element"))
+;;                             60103))
+
+;; (defn make-element-fast [argv comp jsprops first-child]
+;;   (let [key (some-> jsprops ($ :key))
+;;         ref (some-> jsprops ($ :ref))
+;;         props (if (nil? jsprops) (js-obj) jsprops)]
+;;     ($! props :children
+;;         (case (- (count argv) first-child)
+;;           0 nil
+;;           1 (as-element (nth argv first-child))
+;;           (reduce-kv (fn [a k v]
+;;                        (when (>= k first-child)
+;;                          (.push a (as-element v)))
+;;                        a)
+;;                      #js[] argv)))
+;;     (js-obj "key" key
+;;             "ref" ref
+;;             "props" props
+;;             "$$typeof" react-element-type
+;;             "type" comp
+;;             ;; "_store" (js-obj)
+;;             )))
+
+(defn make-element [argv comp jsprops first-child]
+  (case (- (count argv) first-child)
+    ;; Optimize cases of zero or one child
+    0 (react/createElement comp jsprops)
+
+    1 (react/createElement comp jsprops
+          (as-element (nth argv first-child nil)))
+
+    (.apply react/createElement nil
+            (reduce-kv (fn [a k v]
+                         (when (>= k first-child)
+                           (.push a (as-element v)))
+                         a)
+                       #js[comp jsprops] argv))))
diff --git a/js/reagent/impl/template.cljs.cache.json b/js/reagent/impl/template.cljs.cache.json
new file mode 100644
index 0000000..146f7ad
--- /dev/null
+++ b/js/reagent/impl/template.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$document",["^ "],"~$Error",["^ "],"~$Object",["^ ","~$createElement",["^ ","~$apply",["^ "]],"~$Fragment",["^ "]],"~$console",["^ "]],"~:use-macros",["^ ","~$log","~$reagent.debug","~$warn-unless","^<","~$dbg","^<","~$$!","~$reagent.interop","~$prn","^<","~$warn","^<","~$dev?","^<","~$prewalk","~$clojure.walk","~$println","^<","~$$","^@"],"~:excludes",["~#set",[]],"~:name","~$reagent.impl.template","~:imports",null,"~:requires",["^ ","~$reagent.impl.util","^M","~$comp","~$reagent.impl.component","^@","^@","~$reagent.ratom","^P","~$react","^Q","~$reagent.impl.batching","^R","^O","^O","~$util","^M","~$ratom","^P","~$string","~$clojure.string","~$batch","^R","^<","^<","^V","^V","^E","^E"],"~:cljs.spec/speced-vars",[],"~:uses",["^ ","^D","^E","~$is-client","^M"],"~:defs",["^ ","~$valid-tag?",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","~:line",33,"~:column",16,"~:end-line",33,"~:end-column",26,"~:tag","~$boolean","~:arglists",["~#list",["~$quote",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/valid-tag?","~:variadic",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",26,"~:method-params",["^1;",[["~$x"]]],"~:protocol-impl",null,"~:arglists-meta",["^1;",[null,null]],"^15",1,"^14",33,"~:ret-tag","^19","^16",33,"~:max-fixed-arity",1,"^18","^19","~:fn-var",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$adapt-react-class",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",325,"^15",7,"^16",325,"^17",24,"^1:",["^1;",["^1<",["^1;",[["~$c"]]]]]],"^I","~$reagent.impl.template/adapt-react-class","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",24,"^1?",["^1;",[["~$c"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",325,"^16",325,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$c"]]]]]],"~$has-selection-api?",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",154,"^15",16,"^16",154,"^17",34,"^18","^19","^1:",["^1;",["^1<",["^1;",[["~$input-type"]]]]]],"^I","~$reagent.impl.template/has-selection-api?","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",34,"^1?",["^1;",[["^1H"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",154,"^1B","^19","^16",154,"^1C",1,"^18","^19","^1D",true,"^1:",["^1;",["^1<",["^1;",[["^1H"]]]]]],"~$str-coll",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",355,"^15",7,"^16",355,"^17",15,"^1:",["^1;",["^1<",["^1;",[["~$coll"]]]]]],"^I","~$reagent.impl.template/str-coll","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",15,"^1?",["^1;",[["^1K"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",355,"^16",355,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^1K"]]]]]],"~$get-key",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",300,"^15",7,"^16",300,"^17",14,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/get-key","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",14,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",300,"^16",300,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$re-tag",["^ ","^I","~$reagent.impl.template/re-tag","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",16,"^15",1,"^16",18,"^17",9,"~:doc","Regular expression that parses a CSS-style id and class\n             from a tag name.","^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",18,"^15",3,"^16",18,"^17",9,"^1Q","Regular expression that parses a CSS-style id and class\n             from a tag name."],"^18","~$any"],"~$reag-element",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",309,"^15",7,"^16",309,"^17",19,"^1:",["^1;",["^1<",["^1;",[["~$tag","~$v"]]]]]],"^I","~$reagent.impl.template/reag-element","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",19,"^1?",["^1;",[["^1T","~$v"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",309,"^16",309,"^1C",2,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^1T","~$v"]]]]]],"~$as-element",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",402,"^15",7,"^16",402,"^17",17,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/as-element","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",17,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",402,"^16",402,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$input-component?",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",253,"^15",16,"^16",253,"^17",32,"^18","^19","^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/input-component?","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",32,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",253,"^1B","^19","^16",253,"^1C",1,"^18","^19","^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$NativeWrapper",["^ ","~:num-fields",0,"~:protocols",["^H",[]],"^I","~$reagent.impl.template/NativeWrapper","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",23,"~:type",true,"^15",10,"^14",20,"~:record",false,"^16",20,"^18","~$function","~:skip-protocol-flag",null],"~$->NativeWrapper",["^ ","^11",null,"^12",["^ ","^20",["^H",[]],"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",23,"^15",10,"~:factory","~:positional","^14",20,"^16",20,"^1:",["^1;",["^1<",["^1;",[[]]]]],"^25",null,"^1Q","Positional factory function for reagent.impl.template/NativeWrapper."],"^20",["^H",[]],"^I","~$reagent.impl.template/->NativeWrapper","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",23,"^1?",["^1;",[[]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^27","^28","^14",20,"^16",20,"^1C",0,"^1D",true,"^1:",["^1;",["^1<",["^1;",[[]]]]],"^25",null,"^1Q","Positional factory function for reagent.impl.template/NativeWrapper."],"~$custom-kv-conv",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",89,"^15",7,"^16",89,"^17",21,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k","~$v"]]]]]],"^I","~$reagent.impl.template/custom-kv-conv","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",21,"^1?",["^1;",[["~$o","~$k","~$v"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",89,"^16",89,"^1C",3,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k","~$v"]]]]]],"~$input-render-setup",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",228,"^15",7,"^16",228,"^17",25,"^1:",["^1;",["^1<",["^1;",[["~$this","~$jsprops"]]]]]],"^I","~$reagent.impl.template/input-render-setup","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",25,"^1?",["^1;",[["^2=","^2>"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",228,"^16",228,"^1C",2,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^2=","^2>"]]]]]],"~$input-component-set-value",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",209,"^15",7,"^16",209,"^17",32,"^1:",["^1;",["^1<",["^1;",[["^2="]]]]]],"^I","~$reagent.impl.template/input-component-set-value","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",32,"^1?",["^1;",[["^2="]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",209,"^16",209,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^2="]]]]]],"~$stringify-class",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",127,"^15",7,"^16",127,"^17",22,"^1:",["^1;",["^1<",["^1;",[[["^ ","~:keys",["~$class"],"~:as","~$props"]]]]]]],"^I","~$reagent.impl.template/stringify-class","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",22,"^1?",["^1;",[["~$p__3819"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",127,"^16",127,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[[["^ ","^2C",["^2D"],"^2E","^2F"]]]]]]],"~$oset",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",103,"^15",7,"^16",103,"^17",11,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k","~$v"]]]]]],"^I","~$reagent.impl.template/oset","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",11,"^1?",["^1;",[["~$o","~$k","~$v"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",103,"^16",103,"^1C",3,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k","~$v"]]]]]],"~$oget",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",107,"^15",7,"^16",107,"^17",11,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k"]]]]]],"^I","~$reagent.impl.template/oget","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",11,"^1?",["^1;",[["~$o","~$k"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",107,"^16",107,"^1C",2,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k"]]]]]],"~$hiccup-tag?",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",29,"^15",16,"^16",29,"^17",27,"^18","^19","^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/hiccup-tag?","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",27,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",29,"^1B","^19","^16",29,"^1C",1,"^18","^19","^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$set-id-class",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",110,"^15",7,"^16",110,"^17",19,"^1:",["^1;",["^1<",["^1;",[["^2F","~$id-class"]]]]],"^1Q","Takes the id and class from tag keyword, and adds them to the\n  other props. Parsed tag is JS object with :id and :class properties."],"^I","~$reagent.impl.template/set-id-class","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",19,"^1?",["^1;",[["^2F","^2P"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",110,"^16",110,"^1C",2,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^2F","^2P"]]]]],"^1Q","Takes the id and class from tag keyword, and adds them to the\n  other props. Parsed tag is JS object with :id and :class properties."],"~$tag-name-cache",["^ ","^I","~$reagent.impl.template/tag-name-cache","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",332,"^15",1,"^16",332,"^17",20,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",332,"^15",6,"^16",332,"^17",20],"^18","~$object"],"~$prop-name-cache",["^ ","^I","~$reagent.impl.template/prop-name-cache","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",41,"^15",1,"^16",41,"^17",21,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",41,"^15",6,"^16",41,"^17",21],"^18","^2T"],"~$input-node-set-value",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",160,"^15",7,"^16",160,"^17",27,"^1:",["^1;",["^1<",["^1;",[["~$node","~$rendered-value","~$dom-value","~$component",["^ ","^2C",["~$on-write"]]]]]]]],"^I","~$reagent.impl.template/input-node-set-value","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",27,"^1?",["^1;",[["^2X","^2Y","^2Z","^2[","~$p__3822"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",160,"^16",160,"^1C",5,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^2X","^2Y","^2Z","^2[",["^ ","^2C",["^30"]]]]]]]],"~$convert-props",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",135,"^15",7,"^16",135,"^17",20,"^1:",["^1;",["^1<",["^1;",[["^2F","^2P"]]]]]],"^I","~$reagent.impl.template/convert-props","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",20,"^1?",["^1;",[["^2F","^2P"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",135,"^16",135,"^1C",2,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^2F","^2P"]]]]]],"~$hiccup-err",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",364,"^15",7,"^16",364,"^17",17,"^1:",["^1;",["^1<",["^1;",[["~$v","~$&","~$msg"]]]]],"~:top-fn",["^ ","^1>",true,"^1C",1,"^1?",[["^1;",["~$v","^36"]]],"^1:",["^1;",[["~$v","~$&","^36"]]],"^1A",["^1;",[null]]]],"^I","~$reagent.impl.template/hiccup-err","^1>",true,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",17,"^37",["^ ","^1>",true,"^1C",1,"^1?",[["^1;",["~$v","^36"]]],"^1:",["^1;",[["~$v","~$&","^36"]]],"^1A",["^1;",[null]]],"^1?",[["^1;",["~$v","^36"]]],"^1@",null,"^1A",["^1;",[null]],"^15",1,"^14",364,"^16",364,"^1C",1,"^1D",true,"^1:",["^1;",[["~$v","~$&","^36"]]]],"~$custom-prop-name-cache",["^ ","^I","~$reagent.impl.template/custom-prop-name-cache","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",79,"^15",1,"^16",79,"^17",28,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",79,"^15",6,"^16",79,"^17",28],"^18","^2T"],"~$named?",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",25,"^15",16,"^16",25,"^17",22,"^18","^19","^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/named?","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",22,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",25,"^1B","^19","^16",25,"^1C",1,"^18","^19","^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$parse-tag",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",281,"^15",7,"^16",281,"^17",16,"^1:",["^1;",["^1<",["^1;",[["~$hiccup-tag"]]]]]],"^I","~$reagent.impl.template/parse-tag","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",16,"^1?",["^1;",[["^3>"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",281,"^16",281,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^3>"]]]]]],"~$kv-conv",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",62,"^15",7,"^16",62,"^17",14,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k","~$v"]]]]]],"^I","~$reagent.impl.template/kv-conv","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",14,"^1?",["^1;",[["~$o","~$k","~$v"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",62,"^16",62,"^1C",3,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k","~$v"]]]]]],"~$key-from-vec",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",304,"^15",7,"^16",304,"^17",19,"^1:",["^1;",["^1<",["^1;",[["~$v"]]]]]],"^I","~$reagent.impl.template/key-from-vec","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",19,"^1?",["^1;",[["~$v"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",304,"^16",304,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$v"]]]]]],"~$js-val?",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",57,"^15",16,"^16",57,"^17",23,"^18","^19","^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/js-val?","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",23,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",57,"^1B","^19","^16",57,"^1C",1,"^18","^19","^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$input-unmount",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",250,"^15",7,"^16",250,"^17",20,"^1:",["^1;",["^1<",["^1;",[["^2="]]]]]],"^I","~$reagent.impl.template/input-unmount","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",20,"^1?",["^1;",[["^2="]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",250,"^16",250,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^2="]]]]]],"~$convert-custom-prop-value",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",94,"^15",7,"^16",94,"^17",32,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/convert-custom-prop-value","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",32,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",94,"^16",94,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$reagent-input-class",["^ ","^I","~$reagent.impl.template/reagent-input-class","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",258,"^15",1,"^16",258,"^17",25,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",258,"^15",6,"^16",258,"^17",25],"^18","~$clj-nil"],"~$native-element",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",339,"^15",7,"^16",339,"^17",21,"^1:",["^1;",["^1<",["^1;",[["~$parsed","~$argv","~$first"]]]]]],"^I","~$reagent.impl.template/native-element","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",21,"^1?",["^1;",[["^3N","^3O","^3P"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",339,"^16",339,"^1C",3,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^3N","^3O","^3P"]]]]]],"~$reagent-input",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",272,"^15",7,"^16",272,"^17",20,"^1:",["^1;",["^1<",["^1;",[[]]]]]],"^I","~$reagent.impl.template/reagent-input","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",20,"^1?",["^1;",[[]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",272,"^16",272,"^1C",0,"^1D",true,"^1:",["^1;",["^1<",["^1;",[[]]]]]],"~$fragment-element",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",316,"^15",7,"^16",316,"^17",23,"^1:",["^1;",["^1<",["^1;",[["^3O"]]]]]],"^I","~$reagent.impl.template/fragment-element","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",23,"^1?",["^1;",[["^3O"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",316,"^16",316,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^3O"]]]]]],"~$vec-to-elem",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",367,"^15",7,"^16",367,"^17",18,"^1:",["^1;",["^1<",["^1;",[["~$v"]]]]]],"^I","~$reagent.impl.template/vec-to-elem","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",18,"^1?",["^1;",[["~$v"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",367,"^16",367,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$v"]]]]]],"~$cache-get",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",45,"^15",7,"^16",45,"^17",16,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k"]]]]]],"^I","~$reagent.impl.template/cache-get","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",16,"^1?",["^1;",[["~$o","~$k"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",45,"^16",45,"^1C",2,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$o","~$k"]]]]]],"~$input-handle-change",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",219,"^15",7,"^16",219,"^17",26,"^1:",["^1;",["^1<",["^1;",[["^2=","~$on-change","~$e"]]]]]],"^I","~$reagent.impl.template/input-handle-change","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",26,"^1?",["^1;",[["^2=","^3[","~$e"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",219,"^16",219,"^1C",3,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^2=","^3[","~$e"]]]]]],"~$make-element",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",467,"^15",7,"^16",467,"^17",19,"^1:",["^1;",["^1<",["^1;",[["^3O","^N","^2>","~$first-child"]]]]]],"^I","~$reagent.impl.template/make-element","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",19,"^1?",["^1;",[["^3O","^N","^2>","^42"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",467,"^16",467,"^1C",4,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["^3O","^N","^2>","^42"]]]]]],"~$input-spec",["^ ","^I","~$reagent.impl.template/input-spec","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",262,"^15",1,"^16",262,"^17",16,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",262,"^15",6,"^16",262,"^17",16],"^18","~$cljs.core/IMap"],"~$expand-seq-dev",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",420,"^15",7,"^16",420,"^17",21,"^1:",["^1;",["^1<",["^1;",[["~$s","~$o"]]]]]],"^I","~$reagent.impl.template/expand-seq-dev","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",21,"^1?",["^1;",[["~$s","~$o"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",420,"^16",420,"^1C",2,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$s","~$o"]]]]]],"~$convert-prop-value",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",67,"^15",7,"^16",67,"^17",25,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/convert-prop-value","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",25,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",67,"^16",67,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$cached-prop-name",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",49,"^15",7,"^16",49,"^17",23,"^1:",["^1;",["^1<",["^1;",[["~$k"]]]]]],"^I","~$reagent.impl.template/cached-prop-name","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",23,"^1?",["^1;",[["~$k"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",49,"^16",49,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$k"]]]]]],"~$cached-custom-prop-name",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",81,"^15",7,"^16",81,"^17",30,"^1:",["^1;",["^1<",["^1;",[["~$k"]]]]]],"^I","~$reagent.impl.template/cached-custom-prop-name","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",30,"^1?",["^1;",[["~$k"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",81,"^16",81,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$k"]]]]]],"~$these-inputs-have-selection-api",["^ ","^I","~$reagent.impl.template/these-inputs-have-selection-api","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",151,"^15",1,"^16",151,"^17",37,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",151,"^15",6,"^16",151,"^17",37],"^18","~$cljs.core/ISet"],"~$expand-seq",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",414,"^15",7,"^16",414,"^17",17,"^1:",["^1;",["^1<",["^1;",[["~$s"]]]]]],"^I","~$reagent.impl.template/expand-seq","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",17,"^1?",["^1;",[["~$s"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",414,"^16",414,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$s"]]]]]],"~$expand-seq-check",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",430,"^15",7,"^16",430,"^17",23,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/expand-seq-check","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",23,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",430,"^16",430,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$find-dom-node",["^ ","^I","~$reagent.impl.template/find-dom-node","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",146,"^15",1,"^16",146,"^17",23,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",146,"^15",10,"^16",146,"^17",23],"^18","^3L"],"~$cached-parse",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",334,"^15",7,"^16",334,"^17",19,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/cached-parse","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",19,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",334,"^16",334,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"~$try-get-key",["^ ","^11",null,"^12",["^ ","^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^14",294,"^15",7,"^16",294,"^17",18,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]],"^I","~$reagent.impl.template/try-get-key","^1>",false,"^13","/home/julien/.cljs/.aot_cache/1.10.329/78628EC/reagent/impl/template.cljs","^17",18,"^1?",["^1;",[["~$x"]]],"^1@",null,"^1A",["^1;",[null,null]],"^15",1,"^14",294,"^16",294,"^1C",1,"^1D",true,"^1:",["^1;",["^1<",["^1;",[["~$x"]]]]]]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^T","^P","^P","^P","^@","^@","^<","^<"],"~:cljs.analyzer/constants",["^ ","~:seen",["^H",["~:key","~:else","~:component-did-update","~:<>","~:reagent-render","~:on-write","~:id","~:class","~:component-will-unmount","~:display-name"]],"~:order",["^4Q","^4V","^4W","^4U","^4Y","^4R","^4X","^4T","^4P","^4S"]],"^1Q",null]
\ No newline at end of file
diff --git a/js/reagent/impl/template.js b/js/reagent/impl/template.js
new file mode 100644
index 0000000..1a11174
--- /dev/null
+++ b/js/reagent/impl/template.js
@@ -0,0 +1,729 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.impl.template');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('clojure.string');
+goog.require('clojure.walk');
+goog.require('reagent.impl.util');
+goog.require('reagent.impl.component');
+goog.require('reagent.impl.batching');
+goog.require('reagent.ratom');
+goog.require('reagent.interop');
+goog.require('reagent.debug');
+reagent.impl.template.global$module$react = goog.global["React"];
+/**
+ * Regular expression that parses a CSS-style id and class
+ *           from a tag name.
+ */
+reagent.impl.template.re_tag = /([^\s\.#]+)(?:#([^\s\.#]+))?(?:\.([^\s#]+))?/;
+
+/**
+* @constructor
+*/
+reagent.impl.template.NativeWrapper = (function (){
+});
+
+reagent.impl.template.NativeWrapper.getBasis = (function (){
+return cljs.core.PersistentVector.EMPTY;
+});
+
+reagent.impl.template.NativeWrapper.cljs$lang$type = true;
+
+reagent.impl.template.NativeWrapper.cljs$lang$ctorStr = "reagent.impl.template/NativeWrapper";
+
+reagent.impl.template.NativeWrapper.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.impl.template/NativeWrapper");
+});
+
+/**
+ * Positional factory function for reagent.impl.template/NativeWrapper.
+ */
+reagent.impl.template.__GT_NativeWrapper = (function reagent$impl$template$__GT_NativeWrapper(){
+return (new reagent.impl.template.NativeWrapper());
+});
+
+reagent.impl.template.named_QMARK_ = (function reagent$impl$template$named_QMARK_(x){
+return (((x instanceof cljs.core.Keyword)) || ((x instanceof cljs.core.Symbol)));
+});
+reagent.impl.template.hiccup_tag_QMARK_ = (function reagent$impl$template$hiccup_tag_QMARK_(x){
+return ((reagent.impl.template.named_QMARK_(x)) || (typeof x === 'string'));
+});
+reagent.impl.template.valid_tag_QMARK_ = (function reagent$impl$template$valid_tag_QMARK_(x){
+return ((reagent.impl.template.hiccup_tag_QMARK_(x)) || (cljs.core.ifn_QMARK_(x)) || ((x instanceof reagent.impl.template.NativeWrapper)));
+});
+reagent.impl.template.prop_name_cache = ({"class": "className", "for": "htmlFor", "charset": "charSet"});
+reagent.impl.template.cache_get = (function reagent$impl$template$cache_get(o,k){
+if(o.hasOwnProperty(k)){
+return (o[k]);
+} else {
+return null;
+}
+});
+reagent.impl.template.cached_prop_name = (function reagent$impl$template$cached_prop_name(k){
+if(reagent.impl.template.named_QMARK_(k)){
+var temp__5459__auto__ = reagent.impl.template.cache_get(reagent.impl.template.prop_name_cache,cljs.core.name(k));
+if((temp__5459__auto__ == null)){
+return (reagent.impl.template.prop_name_cache[cljs.core.name(k)] = reagent.impl.util.dash_to_camel(k));
+} else {
+var k_SINGLEQUOTE_ = temp__5459__auto__;
+return k_SINGLEQUOTE_;
+}
+} else {
+return k;
+}
+});
+reagent.impl.template.js_val_QMARK_ = (function reagent$impl$template$js_val_QMARK_(x){
+return !(("object" === goog.typeOf(x)));
+});
+reagent.impl.template.kv_conv = (function reagent$impl$template$kv_conv(o,k,v){
+var G__3809 = o;
+(G__3809[reagent.impl.template.cached_prop_name(k)] = (reagent.impl.template.convert_prop_value.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.template.convert_prop_value.cljs$core$IFn$_invoke$arity$1(v) : reagent.impl.template.convert_prop_value.call(null,v)));
+
+return G__3809;
+});
+reagent.impl.template.convert_prop_value = (function reagent$impl$template$convert_prop_value(x){
+if(reagent.impl.template.js_val_QMARK_(x)){
+return x;
+} else {
+if(reagent.impl.template.named_QMARK_(x)){
+return cljs.core.name(x);
+} else {
+if(cljs.core.map_QMARK_(x)){
+return cljs.core.reduce_kv(reagent.impl.template.kv_conv,({}),x);
+} else {
+if(cljs.core.coll_QMARK_(x)){
+return cljs.core.clj__GT_js(x);
+} else {
+if(cljs.core.ifn_QMARK_(x)){
+return (function() { 
+var G__3810__delegate = function (args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(x,args);
+};
+var G__3810 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__3811__i = 0, G__3811__a = new Array(arguments.length -  0);
+while (G__3811__i < G__3811__a.length) {G__3811__a[G__3811__i] = arguments[G__3811__i + 0]; ++G__3811__i;}
+  args = new cljs.core.IndexedSeq(G__3811__a,0,null);
+} 
+return G__3810__delegate.call(this,args);};
+G__3810.cljs$lang$maxFixedArity = 0;
+G__3810.cljs$lang$applyTo = (function (arglist__3812){
+var args = cljs.core.seq(arglist__3812);
+return G__3810__delegate(args);
+});
+G__3810.cljs$core$IFn$_invoke$arity$variadic = G__3810__delegate;
+return G__3810;
+})()
+;
+} else {
+return cljs.core.clj__GT_js(x);
+
+}
+}
+}
+}
+}
+});
+reagent.impl.template.custom_prop_name_cache = ({});
+reagent.impl.template.cached_custom_prop_name = (function reagent$impl$template$cached_custom_prop_name(k){
+if(reagent.impl.template.named_QMARK_(k)){
+var temp__5459__auto__ = reagent.impl.template.cache_get(reagent.impl.template.custom_prop_name_cache,cljs.core.name(k));
+if((temp__5459__auto__ == null)){
+return (reagent.impl.template.prop_name_cache[cljs.core.name(k)] = reagent.impl.util.dash_to_camel(k));
+} else {
+var k_SINGLEQUOTE_ = temp__5459__auto__;
+return k_SINGLEQUOTE_;
+}
+} else {
+return k;
+}
+});
+reagent.impl.template.custom_kv_conv = (function reagent$impl$template$custom_kv_conv(o,k,v){
+var G__3813 = o;
+(G__3813[reagent.impl.template.cached_custom_prop_name(k)] = reagent.impl.template.convert_prop_value(v));
+
+return G__3813;
+});
+reagent.impl.template.convert_custom_prop_value = (function reagent$impl$template$convert_custom_prop_value(x){
+if(reagent.impl.template.js_val_QMARK_(x)){
+return x;
+} else {
+if(reagent.impl.template.named_QMARK_(x)){
+return cljs.core.name(x);
+} else {
+if(cljs.core.map_QMARK_(x)){
+return cljs.core.reduce_kv(reagent.impl.template.custom_kv_conv,({}),x);
+} else {
+if(cljs.core.coll_QMARK_(x)){
+return cljs.core.clj__GT_js(x);
+} else {
+if(cljs.core.ifn_QMARK_(x)){
+return (function() { 
+var G__3814__delegate = function (args){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(x,args);
+};
+var G__3814 = function (var_args){
+var args = null;
+if (arguments.length > 0) {
+var G__3815__i = 0, G__3815__a = new Array(arguments.length -  0);
+while (G__3815__i < G__3815__a.length) {G__3815__a[G__3815__i] = arguments[G__3815__i + 0]; ++G__3815__i;}
+  args = new cljs.core.IndexedSeq(G__3815__a,0,null);
+} 
+return G__3814__delegate.call(this,args);};
+G__3814.cljs$lang$maxFixedArity = 0;
+G__3814.cljs$lang$applyTo = (function (arglist__3816){
+var args = cljs.core.seq(arglist__3816);
+return G__3814__delegate(args);
+});
+G__3814.cljs$core$IFn$_invoke$arity$variadic = G__3814__delegate;
+return G__3814;
+})()
+;
+} else {
+return cljs.core.clj__GT_js(x);
+
+}
+}
+}
+}
+}
+});
+reagent.impl.template.oset = (function reagent$impl$template$oset(o,k,v){
+var G__3817 = (((o == null))?({}):o);
+(G__3817[k] = v);
+
+return G__3817;
+});
+reagent.impl.template.oget = (function reagent$impl$template$oget(o,k){
+if((o == null)){
+return null;
+} else {
+return (o[k]);
+}
+});
+/**
+ * Takes the id and class from tag keyword, and adds them to the
+ *   other props. Parsed tag is JS object with :id and :class properties.
+ */
+reagent.impl.template.set_id_class = (function reagent$impl$template$set_id_class(props,id_class){
+var id = (id_class["id"]);
+var class$ = (id_class["class"]);
+var G__3818 = props;
+var G__3818__$1 = ((((!((id == null))) && ((cljs.core.cst$kw$id.cljs$core$IFn$_invoke$arity$1(props) == null))))?cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(G__3818,cljs.core.cst$kw$id,id):G__3818);
+if(cljs.core.truth_(class$)){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(G__3818__$1,cljs.core.cst$kw$class,(function (){var old_class = cljs.core.cst$kw$class.cljs$core$IFn$_invoke$arity$1(props);
+if((old_class == null)){
+return class$;
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(class$)," ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(old_class)].join('');
+}
+})());
+} else {
+return G__3818__$1;
+}
+});
+reagent.impl.template.stringify_class = (function reagent$impl$template$stringify_class(p__3819){
+var map__3820 = p__3819;
+var map__3820__$1 = ((((!((map__3820 == null)))?(((((map__3820.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3820.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3820):map__3820);
+var props = map__3820__$1;
+var class$ = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3820__$1,cljs.core.cst$kw$class);
+if(cljs.core.coll_QMARK_(class$)){
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(props,cljs.core.cst$kw$class,clojure.string.join.cljs$core$IFn$_invoke$arity$2(" ",cljs.core.filter.cljs$core$IFn$_invoke$arity$2(cljs.core.identity,class$)));
+} else {
+return props;
+}
+});
+reagent.impl.template.convert_props = (function reagent$impl$template$convert_props(props,id_class){
+var props__$1 = reagent.impl.template.set_id_class(reagent.impl.template.stringify_class(props),id_class);
+if(cljs.core.truth_((id_class["custom"]))){
+return reagent.impl.template.convert_custom_prop_value(props__$1);
+} else {
+return reagent.impl.template.convert_prop_value(props__$1);
+}
+});
+if((typeof reagent !== 'undefined') && (typeof reagent.impl !== 'undefined') && (typeof reagent.impl.template !== 'undefined') && (typeof reagent.impl.template.find_dom_node !== 'undefined')){
+} else {
+reagent.impl.template.find_dom_node = null;
+}
+reagent.impl.template.these_inputs_have_selection_api = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 6, ["url",null,"tel",null,"text",null,"textarea",null,"password",null,"search",null], null), null);
+reagent.impl.template.has_selection_api_QMARK_ = (function reagent$impl$template$has_selection_api_QMARK_(input_type){
+return cljs.core.contains_QMARK_(reagent.impl.template.these_inputs_have_selection_api,input_type);
+});
+reagent.impl.template.input_node_set_value = (function reagent$impl$template$input_node_set_value(node,rendered_value,dom_value,component,p__3822){
+var map__3823 = p__3822;
+var map__3823__$1 = ((((!((map__3823 == null)))?(((((map__3823.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3823.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3823):map__3823);
+var on_write = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3823__$1,cljs.core.cst$kw$on_DASH_write);
+if(!((((node === (document["activeElement"]))) && (reagent.impl.template.has_selection_api_QMARK_((node["type"]))) && (typeof rendered_value === 'string') && (typeof dom_value === 'string')))){
+(component["cljsDOMValue"] = rendered_value);
+
+(node["value"] = rendered_value);
+
+if(cljs.core.fn_QMARK_(on_write)){
+return (on_write.cljs$core$IFn$_invoke$arity$1 ? on_write.cljs$core$IFn$_invoke$arity$1(rendered_value) : on_write.call(null,rendered_value));
+} else {
+return null;
+}
+} else {
+var node_value = (node["value"]);
+if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(node_value,dom_value)){
+return reagent.impl.batching.do_after_render(((function (node_value,map__3823,map__3823__$1,on_write){
+return (function (){
+return (reagent.impl.template.input_component_set_value.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.template.input_component_set_value.cljs$core$IFn$_invoke$arity$1(component) : reagent.impl.template.input_component_set_value.call(null,component));
+});})(node_value,map__3823,map__3823__$1,on_write))
+);
+} else {
+var existing_offset_from_end = (cljs.core.count(node_value) - (node["selectionStart"]));
+var new_cursor_offset = (cljs.core.count(rendered_value) - existing_offset_from_end);
+(component["cljsDOMValue"] = rendered_value);
+
+(node["value"] = rendered_value);
+
+if(cljs.core.fn_QMARK_(on_write)){
+(on_write.cljs$core$IFn$_invoke$arity$1 ? on_write.cljs$core$IFn$_invoke$arity$1(rendered_value) : on_write.call(null,rendered_value));
+} else {
+}
+
+(node["selectionStart"] = new_cursor_offset);
+
+return (node["selectionEnd"] = new_cursor_offset);
+}
+}
+});
+reagent.impl.template.input_component_set_value = (function reagent$impl$template$input_component_set_value(this$){
+if(cljs.core.truth_((this$["cljsInputLive"]))){
+(this$["cljsInputDirty"] = false);
+
+var rendered_value = (this$["cljsRenderedValue"]);
+var dom_value = (this$["cljsDOMValue"]);
+var node = (reagent.impl.template.find_dom_node.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.template.find_dom_node.cljs$core$IFn$_invoke$arity$1(this$) : reagent.impl.template.find_dom_node.call(null,this$));
+if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(rendered_value,dom_value)){
+return reagent.impl.template.input_node_set_value(node,rendered_value,dom_value,this$,cljs.core.PersistentArrayMap.EMPTY);
+} else {
+return null;
+}
+} else {
+return null;
+}
+});
+reagent.impl.template.input_handle_change = (function reagent$impl$template$input_handle_change(this$,on_change,e){
+(this$["cljsDOMValue"] = e.target.value);
+
+if(cljs.core.truth_((this$["cljsInputDirty"]))){
+} else {
+(this$["cljsInputDirty"] = true);
+
+reagent.impl.batching.do_after_render((function (){
+return reagent.impl.template.input_component_set_value(this$);
+}));
+}
+
+return (on_change.cljs$core$IFn$_invoke$arity$1 ? on_change.cljs$core$IFn$_invoke$arity$1(e) : on_change.call(null,e));
+});
+reagent.impl.template.input_render_setup = (function reagent$impl$template$input_render_setup(this$,jsprops){
+if(cljs.core.truth_((function (){var and__3925__auto__ = !((jsprops == null));
+if(and__3925__auto__){
+var and__3925__auto____$1 = jsprops.hasOwnProperty("onChange");
+if(cljs.core.truth_(and__3925__auto____$1)){
+return jsprops.hasOwnProperty("value");
+} else {
+return and__3925__auto____$1;
+}
+} else {
+return and__3925__auto__;
+}
+})())){
+if(cljs.core.truth_(reagent.impl.template.find_dom_node)){
+} else {
+throw (new Error(["Assert failed: ","reagent.dom needs to be loaded for controlled input to work","\n","find-dom-node"].join('')));
+}
+
+var v = (jsprops["value"]);
+var value = (((v == null))?"":v);
+var on_change = (jsprops["onChange"]);
+if(cljs.core.truth_((this$["cljsInputLive"]))){
+} else {
+(this$["cljsInputLive"] = true);
+
+(this$["cljsDOMValue"] = value);
+}
+
+(this$["cljsRenderedValue"] = value);
+
+delete jsprops["value"];
+
+var G__3826 = jsprops;
+(G__3826["defaultValue"] = value);
+
+(G__3826["onChange"] = ((function (G__3826,v,value,on_change){
+return (function (p1__3825_SHARP_){
+return reagent.impl.template.input_handle_change(this$,on_change,p1__3825_SHARP_);
+});})(G__3826,v,value,on_change))
+);
+
+return G__3826;
+} else {
+return null;
+}
+});
+reagent.impl.template.input_unmount = (function reagent$impl$template$input_unmount(this$){
+return (this$["cljsInputLive"] = null);
+});
+reagent.impl.template.input_component_QMARK_ = (function reagent$impl$template$input_component_QMARK_(x){
+var G__3827 = x;
+switch (G__3827) {
+case "input":
+case "textarea":
+return true;
+
+break;
+default:
+return false;
+
+}
+});
+reagent.impl.template.reagent_input_class = null;
+reagent.impl.template.input_spec = new cljs.core.PersistentArrayMap(null, 4, [cljs.core.cst$kw$display_DASH_name,"ReagentInput",cljs.core.cst$kw$component_DASH_did_DASH_update,reagent.impl.template.input_component_set_value,cljs.core.cst$kw$component_DASH_will_DASH_unmount,reagent.impl.template.input_unmount,cljs.core.cst$kw$reagent_DASH_render,(function (argv,comp,jsprops,first_child){
+var this$ = reagent.impl.component._STAR_current_component_STAR_;
+reagent.impl.template.input_render_setup(this$,jsprops);
+
+return (reagent.impl.template.make_element.cljs$core$IFn$_invoke$arity$4 ? reagent.impl.template.make_element.cljs$core$IFn$_invoke$arity$4(argv,comp,jsprops,first_child) : reagent.impl.template.make_element.call(null,argv,comp,jsprops,first_child));
+})], null);
+reagent.impl.template.reagent_input = (function reagent$impl$template$reagent_input(){
+if((reagent.impl.template.reagent_input_class == null)){
+reagent.impl.template.reagent_input_class = reagent.impl.component.create_class(reagent.impl.template.input_spec);
+} else {
+}
+
+return reagent.impl.template.reagent_input_class;
+});
+reagent.impl.template.parse_tag = (function reagent$impl$template$parse_tag(hiccup_tag){
+var vec__3829 = cljs.core.next(cljs.core.re_matches(reagent.impl.template.re_tag,cljs.core.name(hiccup_tag)));
+var tag = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3829,(0),null);
+var id = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3829,(1),null);
+var class$ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3829,(2),null);
+var class$__$1 = (((class$ == null))?null:clojure.string.replace(class$,/\./," "));
+if(cljs.core.truth_(tag)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Invalid tag: '",cljs.core.str.cljs$core$IFn$_invoke$arity$1(hiccup_tag),"'",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.component.comp_name())].join('')),"\n","tag"].join('')));
+}
+
+return ({"name": tag, "id": id, "class": class$__$1, "custom": cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2((-1),tag.indexOf("-"))});
+});
+reagent.impl.template.try_get_key = (function reagent$impl$template$try_get_key(x){
+try{return cljs.core.get.cljs$core$IFn$_invoke$arity$2(x,cljs.core.cst$kw$key);
+}catch (e3832){var e = e3832;
+return null;
+}});
+reagent.impl.template.get_key = (function reagent$impl$template$get_key(x){
+if(cljs.core.map_QMARK_(x)){
+return reagent.impl.template.try_get_key(x);
+} else {
+return null;
+}
+});
+reagent.impl.template.key_from_vec = (function reagent$impl$template$key_from_vec(v){
+var temp__5459__auto__ = reagent.impl.template.get_key(cljs.core.meta(v));
+if((temp__5459__auto__ == null)){
+return reagent.impl.template.get_key(cljs.core.nth.cljs$core$IFn$_invoke$arity$3(v,(1),null));
+} else {
+var k = temp__5459__auto__;
+return k;
+}
+});
+reagent.impl.template.reag_element = (function reagent$impl$template$reag_element(tag,v){
+var c = reagent.impl.component.as_class(tag);
+var jsprops = ({"argv": v});
+var temp__5461__auto___3833 = reagent.impl.template.key_from_vec(v);
+if((temp__5461__auto___3833 == null)){
+} else {
+var key_3834 = temp__5461__auto___3833;
+(jsprops["key"] = key_3834);
+}
+
+return (reagent.impl.template.global$module$react.createElement.cljs$core$IFn$_invoke$arity$2 ? reagent.impl.template.global$module$react.createElement.cljs$core$IFn$_invoke$arity$2(c,jsprops) : reagent.impl.template.global$module$react.createElement.call(null,c,jsprops));
+});
+reagent.impl.template.fragment_element = (function reagent$impl$template$fragment_element(argv){
+var props = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(argv,(1),null);
+var hasprops = (((props == null)) || (cljs.core.map_QMARK_(props)));
+var jsprops = reagent.impl.template.convert_prop_value(((hasprops)?props:null));
+var first_child = ((1) + ((hasprops)?(1):(0)));
+var temp__5461__auto___3835 = reagent.impl.template.key_from_vec(argv);
+if((temp__5461__auto___3835 == null)){
+} else {
+var key_3836 = temp__5461__auto___3835;
+reagent.impl.template.oset(jsprops,"key",key_3836);
+}
+
+return (reagent.impl.template.make_element.cljs$core$IFn$_invoke$arity$4 ? reagent.impl.template.make_element.cljs$core$IFn$_invoke$arity$4(argv,reagent.impl.template.global$module$react.Fragment,jsprops,first_child) : reagent.impl.template.make_element.call(null,argv,reagent.impl.template.global$module$react.Fragment,jsprops,first_child));
+});
+reagent.impl.template.adapt_react_class = (function reagent$impl$template$adapt_react_class(c){
+var G__3837 = reagent.impl.template.__GT_NativeWrapper();
+(G__3837["name"] = c);
+
+(G__3837["id"] = null);
+
+(G__3837["class"] = null);
+
+return G__3837;
+});
+reagent.impl.template.tag_name_cache = ({});
+reagent.impl.template.cached_parse = (function reagent$impl$template$cached_parse(x){
+var temp__5459__auto__ = reagent.impl.template.cache_get(reagent.impl.template.tag_name_cache,x);
+if((temp__5459__auto__ == null)){
+return (reagent.impl.template.tag_name_cache[x] = reagent.impl.template.parse_tag(x));
+} else {
+var s = temp__5459__auto__;
+return s;
+}
+});
+reagent.impl.template.native_element = (function reagent$impl$template$native_element(parsed,argv,first){
+var comp = (parsed["name"]);
+var props = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(argv,first,null);
+var hasprops = (((props == null)) || (cljs.core.map_QMARK_(props)));
+var jsprops = reagent.impl.template.convert_props(((hasprops)?props:null),parsed);
+var first_child = (first + ((hasprops)?(1):(0)));
+if(reagent.impl.template.input_component_QMARK_(comp)){
+var G__3838 = cljs.core.with_meta(new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [reagent.impl.template.reagent_input(),argv,comp,jsprops,first_child], null),cljs.core.meta(argv));
+return (reagent.impl.template.as_element.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.template.as_element.cljs$core$IFn$_invoke$arity$1(G__3838) : reagent.impl.template.as_element.call(null,G__3838));
+} else {
+var key = reagent.impl.template.get_key(cljs.core.meta(argv));
+var p = (((key == null))?jsprops:reagent.impl.template.oset(jsprops,"key",key));
+return (reagent.impl.template.make_element.cljs$core$IFn$_invoke$arity$4 ? reagent.impl.template.make_element.cljs$core$IFn$_invoke$arity$4(argv,comp,p,first_child) : reagent.impl.template.make_element.call(null,argv,comp,p,first_child));
+}
+});
+reagent.impl.template.str_coll = (function reagent$impl$template$str_coll(coll){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(clojure.walk.prewalk((function (x){
+if(cljs.core.fn_QMARK_(x)){
+var n = reagent.impl.util.fun_name(x);
+var G__3839 = n;
+switch (G__3839) {
+case "":
+return x;
+
+break;
+default:
+return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(n);
+
+}
+} else {
+return x;
+}
+}),coll))].join('');
+
+});
+reagent.impl.template.hiccup_err = (function reagent$impl$template$hiccup_err(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3843 = arguments.length;
+var i__4519__auto___3844 = (0);
+while(true){
+if((i__4519__auto___3844 < len__4518__auto___3843)){
+args__4521__auto__.push((arguments[i__4519__auto___3844]));
+
+var G__3845 = (i__4519__auto___3844 + (1));
+i__4519__auto___3844 = G__3845;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic = (function (v,msg){
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.str,msg)),": ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.template.str_coll(v)),"\n",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.component.comp_name())].join('');
+});
+
+reagent.impl.template.hiccup_err.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+reagent.impl.template.hiccup_err.cljs$lang$applyTo = (function (seq3841){
+var G__3842 = cljs.core.first(seq3841);
+var seq3841__$1 = cljs.core.next(seq3841);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3842,seq3841__$1);
+});
+
+reagent.impl.template.vec_to_elem = (function reagent$impl$template$vec_to_elem(v){
+while(true){
+if((cljs.core.count(v) > (0))){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic(v,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Hiccup form should not be empty"], 0))),"\n","(pos? (count v))"].join('')));
+}
+
+var tag = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(v,(0),null);
+if(reagent.impl.template.valid_tag_QMARK_(tag)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic(v,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid Hiccup form"], 0))),"\n","(valid-tag? tag)"].join('')));
+}
+
+if(cljs.core.keyword_identical_QMARK_(cljs.core.cst$kw$_LT__GT_,tag)){
+return reagent.impl.template.fragment_element(v);
+} else {
+if(reagent.impl.template.hiccup_tag_QMARK_(tag)){
+var n = cljs.core.name(tag);
+var pos = n.indexOf(">");
+var G__3846 = pos;
+switch (G__3846) {
+case (-1):
+return reagent.impl.template.native_element(reagent.impl.template.cached_parse(n),v,(1));
+
+break;
+case (0):
+var comp = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(v,(1),null);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(">",n)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic(v,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Invalid Hiccup tag"], 0))),"\n","(= \">\" n)"].join('')));
+}
+
+if(((typeof comp === 'string') || (cljs.core.fn_QMARK_(comp)))){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic(v,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Expected React component in"], 0))),"\n","(or (string? comp) (fn? comp))"].join('')));
+}
+
+return reagent.impl.template.native_element(({"name": comp}),v,(2));
+
+break;
+default:
+var G__3848 = cljs.core.with_meta(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.subs.cljs$core$IFn$_invoke$arity$3(n,(0),pos),cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.with_meta(v,null),(0),cljs.core.subs.cljs$core$IFn$_invoke$arity$2(n,(pos + (1))))], null),cljs.core.meta(v));
+v = G__3848;
+continue;
+
+}
+} else {
+if((tag instanceof reagent.impl.template.NativeWrapper)){
+return reagent.impl.template.native_element(tag,v,(1));
+} else {
+return reagent.impl.template.reag_element(tag,v);
+
+}
+}
+}
+break;
+}
+});
+reagent.impl.template.as_element = (function reagent$impl$template$as_element(x){
+if(reagent.impl.template.js_val_QMARK_(x)){
+return x;
+} else {
+if(cljs.core.vector_QMARK_(x)){
+return reagent.impl.template.vec_to_elem(x);
+} else {
+if(cljs.core.seq_QMARK_(x)){
+return (reagent.impl.template.expand_seq_check.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.template.expand_seq_check.cljs$core$IFn$_invoke$arity$1(x) : reagent.impl.template.expand_seq_check.call(null,x));
+
+} else {
+if(reagent.impl.template.named_QMARK_(x)){
+return cljs.core.name(x);
+} else {
+if(((!((x == null)))?(((((x.cljs$lang$protocol_mask$partition0$ & (2147483648))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IPrintWithWriter$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IPrintWithWriter,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IPrintWithWriter,x))){
+return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([x], 0));
+} else {
+return x;
+
+}
+}
+}
+}
+}
+});
+reagent.impl.component.as_element = reagent.impl.template.as_element;
+reagent.impl.template.expand_seq = (function reagent$impl$template$expand_seq(s){
+var a = cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(s);
+var n__4395__auto___3850 = a.length;
+var i_3851 = (0);
+while(true){
+if((i_3851 < n__4395__auto___3850)){
+(a[i_3851] = reagent.impl.template.as_element((a[i_3851])));
+
+var G__3852 = (i_3851 + (1));
+i_3851 = G__3852;
+continue;
+} else {
+}
+break;
+}
+
+return a;
+});
+reagent.impl.template.expand_seq_dev = (function reagent$impl$template$expand_seq_dev(s,o){
+var a = cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(s);
+var n__4395__auto___3853 = a.length;
+var i_3854 = (0);
+while(true){
+if((i_3854 < n__4395__auto___3853)){
+var val_3855 = (a[i_3854]);
+if(((cljs.core.vector_QMARK_(val_3855)) && ((reagent.impl.template.key_from_vec(val_3855) == null)))){
+(o["no-key"] = true);
+} else {
+}
+
+(a[i_3854] = reagent.impl.template.as_element(val_3855));
+
+var G__3856 = (i_3854 + (1));
+i_3854 = G__3856;
+continue;
+} else {
+}
+break;
+}
+
+return a;
+});
+reagent.impl.template.expand_seq_check = (function reagent$impl$template$expand_seq_check(x){
+var ctx = ({});
+var vec__3857 = reagent.ratom.check_derefs(((function (ctx){
+return (function (){
+return reagent.impl.template.expand_seq_dev(x,ctx);
+});})(ctx))
+);
+var res = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3857,(0),null);
+var derefed = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3857,(1),null);
+if(cljs.core.truth_(derefed)){
+if(cljs.core.truth_(reagent.debug.has_console)){
+(cljs.core.truth_(reagent.debug.tracking)?reagent.debug.track_console:console).warn(["Warning: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic(x,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Reactive deref not supported in lazy seq, ","it should be wrapped in doall"], 0)))].join(''));
+} else {
+}
+} else {
+}
+
+if(cljs.core.truth_((ctx["no-key"]))){
+if(cljs.core.truth_(reagent.debug.has_console)){
+(cljs.core.truth_(reagent.debug.tracking)?reagent.debug.track_console:console).warn(["Warning: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(reagent.impl.template.hiccup_err.cljs$core$IFn$_invoke$arity$variadic(x,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["Every element in a seq should have a unique :key"], 0)))].join(''));
+} else {
+}
+} else {
+}
+
+return res;
+});
+reagent.impl.template.make_element = (function reagent$impl$template$make_element(argv,comp,jsprops,first_child){
+var G__3860 = (cljs.core.count(argv) - first_child);
+switch (G__3860) {
+case (0):
+return (reagent.impl.template.global$module$react.createElement.cljs$core$IFn$_invoke$arity$2 ? reagent.impl.template.global$module$react.createElement.cljs$core$IFn$_invoke$arity$2(comp,jsprops) : reagent.impl.template.global$module$react.createElement.call(null,comp,jsprops));
+
+break;
+case (1):
+var G__3861 = comp;
+var G__3862 = jsprops;
+var G__3863 = reagent.impl.template.as_element(cljs.core.nth.cljs$core$IFn$_invoke$arity$3(argv,first_child,null));
+return (reagent.impl.template.global$module$react.createElement.cljs$core$IFn$_invoke$arity$3 ? reagent.impl.template.global$module$react.createElement.cljs$core$IFn$_invoke$arity$3(G__3861,G__3862,G__3863) : reagent.impl.template.global$module$react.createElement.call(null,G__3861,G__3862,G__3863));
+
+break;
+default:
+return reagent.impl.template.global$module$react.createElement.apply(null,cljs.core.reduce_kv(((function (G__3860){
+return (function (a,k,v){
+if((k >= first_child)){
+a.push(reagent.impl.template.as_element(v));
+} else {
+}
+
+return a;
+});})(G__3860))
+,[comp,jsprops],argv));
+
+}
+});
diff --git a/js/reagent/impl/util.cljs b/js/reagent/impl/util.cljs
new file mode 100644
index 0000000..6fabd93
--- /dev/null
+++ b/js/reagent/impl/util.cljs
@@ -0,0 +1,141 @@
+(ns reagent.impl.util
+  (:require [reagent.debug :refer-macros [dbg log warn]]
+            [reagent.interop :refer-macros [$ $!]]
+            [clojure.string :as string]))
+
+(def is-client (and (exists? js/window)
+                    (-> js/window ($ :document) nil? not)))
+
+(def ^:dynamic ^boolean *non-reactive* false)
+
+;;; Props accessors
+
+;; Misc utilities
+
+(defn memoize-1 [f]
+  (let [mem (atom {})]
+    (fn [arg]
+      (let [v (get @mem arg)]
+        (if-not (nil? v)
+          v
+          (let [ret (f arg)]
+            (swap! mem assoc arg ret)
+            ret))))))
+
+(def dont-camel-case #{"aria" "data"})
+
+(defn capitalize [s]
+  (if (< (count s) 2)
+    (string/upper-case s)
+    (str (string/upper-case (subs s 0 1)) (subs s 1))))
+
+(defn dash-to-camel [dashed]
+  (if (string? dashed)
+    dashed
+    (let [name-str (name dashed)
+          [start & parts] (string/split name-str #"-")]
+      (if (dont-camel-case start)
+        name-str
+        (apply str start (map capitalize parts))))))
+
+(defn fun-name [f]
+  (let [n (or (and (fn? f)
+                   (or ($ f :displayName)
+                       ($ f :name)))
+              (and (implements? INamed f)
+                   (name f))
+              (let [m (meta f)]
+                (if (map? m)
+                  (:name m))))]
+    (-> n
+        str
+        (clojure.string/replace "$" "."))))
+
+(deftype PartialFn [pfn f args]
+  Fn
+  IFn
+  (-invoke [_]
+    (pfn))
+  (-invoke [_ a]
+    (pfn a))
+  (-invoke [_ a b]
+    (pfn a b))
+  (-invoke [_ a b c]
+    (pfn a b c))
+  (-invoke [_ a b c d]
+    (pfn a b c d))
+  (-invoke [_ a b c d e]
+    (pfn a b c d e))
+  (-invoke [_ a b c d e f]
+    (pfn a b c d e f))
+  (-invoke [_ a b c d e f g]
+    (pfn a b c d e f g))
+  (-invoke [_ a b c d e f g h]
+    (pfn a b c d e f g h))
+  (-invoke [_ a b c d e f g h i]
+    (pfn a b c d e f g h i))
+  (-invoke [_ a b c d e f g h i j]
+    (pfn a b c d e f g h i j))
+  (-invoke [_ a b c d e f g h i j k]
+    (pfn a b c d e f g h i j k))
+  (-invoke [_ a b c d e f g h i j k l]
+    (pfn a b c d e f g h i j k l))
+  (-invoke [_ a b c d e f g h i j k l m]
+    (pfn a b c d e f g h i j k l m))
+  (-invoke [_ a b c d e f g h i j k l m n]
+    (pfn a b c d e f g h i j k l m n))
+  (-invoke [_ a b c d e f g h i j k l m n o]
+    (pfn a b c d e f g h i j k l m n o))
+  (-invoke [_ a b c d e f g h i j k l m n o p]
+    (pfn a b c d e f g h i j k l m n o p))
+  (-invoke [_ a b c d e f g h i j k l m n o p q]
+    (pfn a b c d e f g h i j k l m n o p q))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r]
+    (pfn a b c d e f g h i j k l m n o p q r))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s]
+    (pfn a b c d e f g h i j k l m n o p q r s))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s t]
+    (pfn a b c d e f g h i j k l m n o p q r s t))
+  (-invoke [_ a b c d e f g h i j k l m n o p q r s t rest]
+    (apply pfn a b c d e f g h i j k l m n o p q r s t rest))
+  IEquiv
+  (-equiv [_ other]
+    (and (= f (.-f other)) (= args (.-args other))))
+  IHash
+  (-hash [_] (hash [f args])))
+
+(defn make-partial-fn [f args]
+  (->PartialFn (apply partial f args) f args))
+
+(defn- merge-class [p1 p2]
+  (let [class (when-let [c1 (:class p1)]
+                (when-let [c2 (:class p2)]
+                  (str c1 " " c2)))]
+    (if (nil? class)
+      p2
+      (assoc p2 :class class))))
+
+(defn- merge-style [p1 p2]
+  (let [style (when-let [s1 (:style p1)]
+                (when-let [s2 (:style p2)]
+                  (merge s1 s2)))]
+    (if (nil? style)
+      p2
+      (assoc p2 :style style))))
+
+(defn merge-props [p1 p2]
+  (if (nil? p1)
+    p2
+    (do
+      (assert (map? p1)
+              (str "Property must be a map, not " (pr-str p1)))
+      (merge-style p1 (merge-class p1 (merge p1 p2))))))
+
+
+(def ^:dynamic *always-update* false)
+
+(defn force-update [comp deep]
+  (if deep
+    (binding [*always-update* true]
+      ($ comp forceUpdate))
+    ($ comp forceUpdate)))
diff --git a/js/reagent/impl/util.cljs.cache.json b/js/reagent/impl/util.cljs.cache.json
new file mode 100644
index 0000000..0f76303
--- /dev/null
+++ b/js/reagent/impl/util.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$window",["^ "],"~$Error",["^ "]],"~:use-macros",["^ ","~$log","~$reagent.debug","~$dbg","^7","~$$!","~$reagent.interop","~$warn","^7","~$$","^:"],"~:excludes",["~#set",[]],"~:name","~$reagent.impl.util","~:imports",null,"~:requires",["^ ","^7","^7","^:","^:","~$string","~$clojure.string","^C","^C"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$->PartialFn",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:protocols",["^=",["~$cljs.core/IEquiv","~$cljs.core/IHash","~$cljs.core/IFn","~$cljs.core/Fn"]],"~:file","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","~:end-column",19,"~:column",10,"~:factory","~:positional","~:line",54,"~:end-line",54,"~:arglists",["~#list",["~$quote",["^W",[["~$pfn","~$f","~$args"]]]]],"~:skip-protocol-flag",["^=",["^K","^L","^M"]],"~:doc","Positional factory function for reagent.impl.util/PartialFn."],"^J",["^=",["^K","^L","^M","^N"]],"^>","~$reagent.impl.util/->PartialFn","~:variadic",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",19,"~:method-params",["^W",[["^Y","~$f","^Z"]]],"~:protocol-impl",null,"~:arglists-meta",["^W",[null,null]],"^Q",1,"^R","^S","^T",54,"^U",54,"~:max-fixed-arity",3,"~:fn-var",true,"^V",["^W",["^X",["^W",[["^Y","~$f","^Z"]]]]],"^[",["^=",["^K","^L","^M"]],"^10","Positional factory function for reagent.impl.util/PartialFn."],"~$merge-props",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",126,"^Q",7,"^U",126,"^P",18,"^V",["^W",["^X",["^W",[["~$p1","~$p2"]]]]]],"^>","~$reagent.impl.util/merge-props","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",18,"^13",["^W",[["^19","^1:"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",126,"^U",126,"^16",2,"^17",true,"^V",["^W",["^X",["^W",[["^19","^1:"]]]]]],"~$capitalize",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",27,"^Q",7,"^U",27,"^P",17,"^V",["^W",["^X",["^W",[["~$s"]]]]]],"^>","~$reagent.impl.util/capitalize","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",17,"^13",["^W",[["~$s"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",27,"^U",27,"^16",1,"^17",true,"^V",["^W",["^X",["^W",[["~$s"]]]]]],"~$PartialFn",["^ ","~:num-fields",3,"^J",["^=",["^K","^L","^M","^N"]],"^>","~$reagent.impl.util/PartialFn","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",19,"~:type",true,"^Q",10,"^T",54,"~:record",false,"^U",54,"~:tag","~$function","^[",["^=",["^K","^L","^M"]]],"~$dash-to-camel",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",32,"^Q",7,"^U",32,"^P",20,"^V",["^W",["^X",["^W",[["~$dashed"]]]]]],"^>","~$reagent.impl.util/dash-to-camel","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",20,"^13",["^W",[["^1F"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",32,"^U",32,"^16",1,"^17",true,"^V",["^W",["^X",["^W",[["^1F"]]]]]],"~$dont-camel-case",["^ ","^>","~$reagent.impl.util/dont-camel-case","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",25,"^Q",1,"^U",25,"^P",21,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",25,"^Q",6,"^U",25,"^P",21],"^1C","~$cljs.core/ISet"],"~$merge-style",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",118,"^Q",8,"^U",118,"^P",19,"~:private",true,"^V",["^W",["^X",["^W",[["^19","^1:"]]]]]],"^1L",true,"^>","~$reagent.impl.util/merge-style","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",19,"^13",["^W",[["^19","^1:"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",118,"^U",118,"^16",2,"^17",true,"^V",["^W",["^X",["^W",[["^19","^1:"]]]]]],"~$memoize-1",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",15,"^Q",7,"^U",15,"^P",16,"^V",["^W",["^X",["^W",[["~$f"]]]]]],"^>","~$reagent.impl.util/memoize-1","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",16,"^13",["^W",[["~$f"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",15,"^U",15,"^16",1,"^17",true,"^V",["^W",["^X",["^W",[["~$f"]]]]]],"~$make-partial-fn",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",107,"^Q",7,"^U",107,"^P",22,"^V",["^W",["^X",["^W",[["~$f","^Z"]]]]]],"^>","~$reagent.impl.util/make-partial-fn","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",22,"^13",["^W",[["~$f","^Z"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",107,"^U",107,"^16",2,"^17",true,"^V",["^W",["^X",["^W",[["~$f","^Z"]]]]]],"~$*non-reactive*",["^ ","^>","~$reagent.impl.util/*non-reactive*","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",9,"^Q",1,"^U",9,"^P",39,"^1C","~$boolean","~:dynamic",true,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",9,"^Q",25,"^U",9,"^P",39,"^1C","^1T","^1U",true]],"~$fun-name",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",41,"^Q",7,"^U",41,"^P",15,"^V",["^W",["^X",["^W",[["~$f"]]]]]],"^>","~$reagent.impl.util/fun-name","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",15,"^13",["^W",[["~$f"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",41,"^U",41,"^16",1,"^17",true,"^V",["^W",["^X",["^W",[["~$f"]]]]]],"~$merge-class",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",110,"^Q",8,"^U",110,"^P",19,"^1L",true,"^V",["^W",["^X",["^W",[["^19","^1:"]]]]]],"^1L",true,"^>","~$reagent.impl.util/merge-class","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",19,"^13",["^W",[["^19","^1:"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",110,"^U",110,"^16",2,"^17",true,"^V",["^W",["^X",["^W",[["^19","^1:"]]]]]],"~$is-client",["^ ","^>","~$reagent.impl.util/is-client","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",6,"^Q",1,"^U",6,"^P",15,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",6,"^Q",6,"^U",6,"^P",15],"^1C","^1T"],"~$force-update",["^ ","^H",null,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",137,"^Q",7,"^U",137,"^P",19,"^V",["^W",["^X",["^W",[["~$comp","~$deep"]]]]]],"^>","~$reagent.impl.util/force-update","^12",false,"^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^P",19,"^13",["^W",[["^21","^22"]]],"^14",null,"^15",["^W",[null,null]],"^Q",1,"^T",137,"^U",137,"^16",2,"^17",true,"^V",["^W",["^X",["^W",[["^21","^22"]]]]]],"~$*always-update*",["^ ","^>","~$reagent.impl.util/*always-update*","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",135,"^Q",1,"^U",135,"^P",31,"^1U",true,"^I",["^ ","^O","/home/julien/.cljs/.aot_cache/1.10.329/872C8BD/reagent/impl/util.cljs","^T",135,"^Q",16,"^U",135,"^P",31,"^1U",true],"^1C","^1T"]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^7","^7","^:","^:"],"~:cljs.analyzer/constants",["^ ","~:seen",["^=",["^Z","^>","~:style","^Y","~:class","~$f"]],"~:order",["^>","^Y","~$f","^Z","^2;","^2:"]],"^10",null]
\ No newline at end of file
diff --git a/js/reagent/impl/util.js b/js/reagent/impl/util.js
new file mode 100644
index 0000000..2b58eff
--- /dev/null
+++ b/js/reagent/impl/util.js
@@ -0,0 +1,552 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.impl.util');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('reagent.debug');
+goog.require('reagent.interop');
+goog.require('clojure.string');
+reagent.impl.util.is_client = (((typeof window !== 'undefined')) && (!(((window["document"]) == null))));
+reagent.impl.util._STAR_non_reactive_STAR_ = false;
+reagent.impl.util.memoize_1 = (function reagent$impl$util$memoize_1(f){
+var mem = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
+return ((function (mem){
+return (function (arg){
+var v = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(mem),arg);
+if(!((v == null))){
+return v;
+} else {
+var ret = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(arg) : f.call(null,arg));
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(mem,cljs.core.assoc,arg,ret);
+
+return ret;
+}
+});
+;})(mem))
+});
+reagent.impl.util.dont_camel_case = new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 2, ["aria",null,"data",null], null), null);
+reagent.impl.util.capitalize = (function reagent$impl$util$capitalize(s){
+if((cljs.core.count(s) < (2))){
+return clojure.string.upper_case(s);
+} else {
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(clojure.string.upper_case(cljs.core.subs.cljs$core$IFn$_invoke$arity$3(s,(0),(1)))),cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.subs.cljs$core$IFn$_invoke$arity$2(s,(1)))].join('');
+}
+});
+reagent.impl.util.dash_to_camel = (function reagent$impl$util$dash_to_camel(dashed){
+if(typeof dashed === 'string'){
+return dashed;
+} else {
+var name_str = cljs.core.name(dashed);
+var vec__3482 = clojure.string.split.cljs$core$IFn$_invoke$arity$2(name_str,/-/);
+var seq__3483 = cljs.core.seq(vec__3482);
+var first__3484 = cljs.core.first(seq__3483);
+var seq__3483__$1 = cljs.core.next(seq__3483);
+var start = first__3484;
+var parts = seq__3483__$1;
+if(cljs.core.truth_((reagent.impl.util.dont_camel_case.cljs$core$IFn$_invoke$arity$1 ? reagent.impl.util.dont_camel_case.cljs$core$IFn$_invoke$arity$1(start) : reagent.impl.util.dont_camel_case.call(null,start)))){
+return name_str;
+} else {
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.str,start,cljs.core.map.cljs$core$IFn$_invoke$arity$2(reagent.impl.util.capitalize,parts));
+}
+}
+});
+reagent.impl.util.fun_name = (function reagent$impl$util$fun_name(f){
+var n = (function (){var or__3936__auto__ = (function (){var and__3925__auto__ = cljs.core.fn_QMARK_(f);
+if(and__3925__auto__){
+var or__3936__auto__ = (f["displayName"]);
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+return (f["name"]);
+}
+} else {
+return and__3925__auto__;
+}
+})();
+if(cljs.core.truth_(or__3936__auto__)){
+return or__3936__auto__;
+} else {
+var or__3936__auto____$1 = (function (){var and__3925__auto__ = ((!((f == null)))?(((((f.cljs$lang$protocol_mask$partition1$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === f.cljs$core$INamed$))))?true:false):false);
+if(and__3925__auto__){
+return cljs.core.name(f);
+} else {
+return and__3925__auto__;
+}
+})();
+if(cljs.core.truth_(or__3936__auto____$1)){
+return or__3936__auto____$1;
+} else {
+var m = cljs.core.meta(f);
+if(cljs.core.map_QMARK_(m)){
+return cljs.core.cst$kw$name.cljs$core$IFn$_invoke$arity$1(m);
+} else {
+return null;
+}
+}
+}
+})();
+return clojure.string.replace([cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)].join(''),"$",".");
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IFn}
+ * @implements {cljs.core.Fn}
+*/
+reagent.impl.util.PartialFn = (function (pfn,f,args){
+this.pfn = pfn;
+this.f = f;
+this.args = args;
+this.cljs$lang$protocol_mask$partition0$ = 6291457;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+reagent.impl.util.PartialFn.prototype.cljs$core$Fn$ = cljs.core.PROTOCOL_SENTINEL;
+
+reagent.impl.util.PartialFn.prototype.call = (function() {
+var G__3490 = null;
+var G__3490__1 = (function (self__){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$0 ? self__.pfn.cljs$core$IFn$_invoke$arity$0() : self__.pfn.call(null));
+});
+var G__3490__2 = (function (self__,a){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$1 ? self__.pfn.cljs$core$IFn$_invoke$arity$1(a) : self__.pfn.call(null,a));
+});
+var G__3490__3 = (function (self__,a,b){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$2 ? self__.pfn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.pfn.call(null,a,b));
+});
+var G__3490__4 = (function (self__,a,b,c){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$3 ? self__.pfn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.pfn.call(null,a,b,c));
+});
+var G__3490__5 = (function (self__,a,b,c,d){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$4 ? self__.pfn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.pfn.call(null,a,b,c,d));
+});
+var G__3490__6 = (function (self__,a,b,c,d,e){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$5 ? self__.pfn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.pfn.call(null,a,b,c,d,e));
+});
+var G__3490__7 = (function (self__,a,b,c,d,e,f__$1){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$6 ? self__.pfn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f__$1) : self__.pfn.call(null,a,b,c,d,e,f__$1));
+});
+var G__3490__8 = (function (self__,a,b,c,d,e,f__$1,g){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$7 ? self__.pfn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f__$1,g) : self__.pfn.call(null,a,b,c,d,e,f__$1,g));
+});
+var G__3490__9 = (function (self__,a,b,c,d,e,f__$1,g,h){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$8 ? self__.pfn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f__$1,g,h) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h));
+});
+var G__3490__10 = (function (self__,a,b,c,d,e,f__$1,g,h,i){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$9 ? self__.pfn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f__$1,g,h,i) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i));
+});
+var G__3490__11 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$10 ? self__.pfn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f__$1,g,h,i,j) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j));
+});
+var G__3490__12 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$11 ? self__.pfn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f__$1,g,h,i,j,k) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k));
+});
+var G__3490__13 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$12 ? self__.pfn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f__$1,g,h,i,j,k,l) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l));
+});
+var G__3490__14 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$13 ? self__.pfn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f__$1,g,h,i,j,k,l,m) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m));
+});
+var G__3490__15 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$14 ? self__.pfn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n));
+});
+var G__3490__16 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$15 ? self__.pfn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o));
+});
+var G__3490__17 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$16 ? self__.pfn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p));
+});
+var G__3490__18 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$17 ? self__.pfn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q));
+});
+var G__3490__19 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$18 ? self__.pfn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+var G__3490__20 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$19 ? self__.pfn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+var G__3490__21 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$20 ? self__.pfn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+var G__3490__22 = (function (self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var self____$1 = this;
+var _ = self____$1;
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.pfn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+G__3490 = function(self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+switch(arguments.length){
+case 1:
+return G__3490__1.call(this,self__);
+case 2:
+return G__3490__2.call(this,self__,a);
+case 3:
+return G__3490__3.call(this,self__,a,b);
+case 4:
+return G__3490__4.call(this,self__,a,b,c);
+case 5:
+return G__3490__5.call(this,self__,a,b,c,d);
+case 6:
+return G__3490__6.call(this,self__,a,b,c,d,e);
+case 7:
+return G__3490__7.call(this,self__,a,b,c,d,e,f__$1);
+case 8:
+return G__3490__8.call(this,self__,a,b,c,d,e,f__$1,g);
+case 9:
+return G__3490__9.call(this,self__,a,b,c,d,e,f__$1,g,h);
+case 10:
+return G__3490__10.call(this,self__,a,b,c,d,e,f__$1,g,h,i);
+case 11:
+return G__3490__11.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j);
+case 12:
+return G__3490__12.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k);
+case 13:
+return G__3490__13.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l);
+case 14:
+return G__3490__14.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m);
+case 15:
+return G__3490__15.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n);
+case 16:
+return G__3490__16.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o);
+case 17:
+return G__3490__17.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p);
+case 18:
+return G__3490__18.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q);
+case 19:
+return G__3490__19.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r);
+case 20:
+return G__3490__20.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s);
+case 21:
+return G__3490__21.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
+case 22:
+return G__3490__22.call(this,self__,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
+}
+throw(new Error('Invalid arity: ' + (arguments.length - 1)));
+};
+G__3490.cljs$core$IFn$_invoke$arity$1 = G__3490__1;
+G__3490.cljs$core$IFn$_invoke$arity$2 = G__3490__2;
+G__3490.cljs$core$IFn$_invoke$arity$3 = G__3490__3;
+G__3490.cljs$core$IFn$_invoke$arity$4 = G__3490__4;
+G__3490.cljs$core$IFn$_invoke$arity$5 = G__3490__5;
+G__3490.cljs$core$IFn$_invoke$arity$6 = G__3490__6;
+G__3490.cljs$core$IFn$_invoke$arity$7 = G__3490__7;
+G__3490.cljs$core$IFn$_invoke$arity$8 = G__3490__8;
+G__3490.cljs$core$IFn$_invoke$arity$9 = G__3490__9;
+G__3490.cljs$core$IFn$_invoke$arity$10 = G__3490__10;
+G__3490.cljs$core$IFn$_invoke$arity$11 = G__3490__11;
+G__3490.cljs$core$IFn$_invoke$arity$12 = G__3490__12;
+G__3490.cljs$core$IFn$_invoke$arity$13 = G__3490__13;
+G__3490.cljs$core$IFn$_invoke$arity$14 = G__3490__14;
+G__3490.cljs$core$IFn$_invoke$arity$15 = G__3490__15;
+G__3490.cljs$core$IFn$_invoke$arity$16 = G__3490__16;
+G__3490.cljs$core$IFn$_invoke$arity$17 = G__3490__17;
+G__3490.cljs$core$IFn$_invoke$arity$18 = G__3490__18;
+G__3490.cljs$core$IFn$_invoke$arity$19 = G__3490__19;
+G__3490.cljs$core$IFn$_invoke$arity$20 = G__3490__20;
+G__3490.cljs$core$IFn$_invoke$arity$21 = G__3490__21;
+G__3490.cljs$core$IFn$_invoke$arity$22 = G__3490__22;
+return G__3490;
+})()
+;
+
+reagent.impl.util.PartialFn.prototype.apply = (function (self__,args3489){
+var self__ = this;
+var self____$1 = this;
+return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args3489)));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$0 = (function (){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$0 ? self__.pfn.cljs$core$IFn$_invoke$arity$0() : self__.pfn.call(null));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$1 = (function (a){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$1 ? self__.pfn.cljs$core$IFn$_invoke$arity$1(a) : self__.pfn.call(null,a));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$2 ? self__.pfn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.pfn.call(null,a,b));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$3 = (function (a,b,c){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$3 ? self__.pfn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.pfn.call(null,a,b,c));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,d){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$4 ? self__.pfn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.pfn.call(null,a,b,c,d));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$5 = (function (a,b,c,d,e){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$5 ? self__.pfn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.pfn.call(null,a,b,c,d,e));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$6 = (function (a,b,c,d,e,f__$1){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$6 ? self__.pfn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f__$1) : self__.pfn.call(null,a,b,c,d,e,f__$1));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$7 = (function (a,b,c,d,e,f__$1,g){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$7 ? self__.pfn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f__$1,g) : self__.pfn.call(null,a,b,c,d,e,f__$1,g));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$8 = (function (a,b,c,d,e,f__$1,g,h){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$8 ? self__.pfn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f__$1,g,h) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$9 = (function (a,b,c,d,e,f__$1,g,h,i){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$9 ? self__.pfn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f__$1,g,h,i) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$10 = (function (a,b,c,d,e,f__$1,g,h,i,j){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$10 ? self__.pfn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f__$1,g,h,i,j) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$11 = (function (a,b,c,d,e,f__$1,g,h,i,j,k){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$11 ? self__.pfn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f__$1,g,h,i,j,k) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$12 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$12 ? self__.pfn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f__$1,g,h,i,j,k,l) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$13 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$13 ? self__.pfn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f__$1,g,h,i,j,k,l,m) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$14 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$14 ? self__.pfn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$15 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$15 ? self__.pfn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$16 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$16 ? self__.pfn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$17 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$17 ? self__.pfn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$18 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$18 ? self__.pfn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$19 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$19 ? self__.pfn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$20 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
+var self__ = this;
+var _ = this;
+return (self__.pfn.cljs$core$IFn$_invoke$arity$20 ? self__.pfn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.pfn.call(null,a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IFn$_invoke$arity$21 = (function (a,b,c,d,e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
+var self__ = this;
+var _ = this;
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.pfn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f__$1,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+return ((cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.f,other.f)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.args,other.args)));
+});
+
+reagent.impl.util.PartialFn.prototype.cljs$core$IHash$_hash$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.hash(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.f,self__.args], null));
+});
+
+reagent.impl.util.PartialFn.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$pfn,cljs.core.cst$sym$f,cljs.core.cst$sym$args], null);
+});
+
+reagent.impl.util.PartialFn.cljs$lang$type = true;
+
+reagent.impl.util.PartialFn.cljs$lang$ctorStr = "reagent.impl.util/PartialFn";
+
+reagent.impl.util.PartialFn.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.impl.util/PartialFn");
+});
+
+/**
+ * Positional factory function for reagent.impl.util/PartialFn.
+ */
+reagent.impl.util.__GT_PartialFn = (function reagent$impl$util$__GT_PartialFn(pfn,f,args){
+return (new reagent.impl.util.PartialFn(pfn,f,args));
+});
+
+reagent.impl.util.make_partial_fn = (function reagent$impl$util$make_partial_fn(f,args){
+return reagent.impl.util.__GT_PartialFn(cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.partial,f,args),f,args);
+});
+reagent.impl.util.merge_class = (function reagent$impl$util$merge_class(p1,p2){
+var class$ = (function (){var temp__5457__auto__ = cljs.core.cst$kw$class.cljs$core$IFn$_invoke$arity$1(p1);
+if(cljs.core.truth_(temp__5457__auto__)){
+var c1 = temp__5457__auto__;
+var temp__5457__auto____$1 = cljs.core.cst$kw$class.cljs$core$IFn$_invoke$arity$1(p2);
+if(cljs.core.truth_(temp__5457__auto____$1)){
+var c2 = temp__5457__auto____$1;
+return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(c1)," ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(c2)].join('');
+} else {
+return null;
+}
+} else {
+return null;
+}
+})();
+if((class$ == null)){
+return p2;
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(p2,cljs.core.cst$kw$class,class$);
+}
+});
+reagent.impl.util.merge_style = (function reagent$impl$util$merge_style(p1,p2){
+var style = (function (){var temp__5457__auto__ = cljs.core.cst$kw$style.cljs$core$IFn$_invoke$arity$1(p1);
+if(cljs.core.truth_(temp__5457__auto__)){
+var s1 = temp__5457__auto__;
+var temp__5457__auto____$1 = cljs.core.cst$kw$style.cljs$core$IFn$_invoke$arity$1(p2);
+if(cljs.core.truth_(temp__5457__auto____$1)){
+var s2 = temp__5457__auto____$1;
+return cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([s1,s2], 0));
+} else {
+return null;
+}
+} else {
+return null;
+}
+})();
+if((style == null)){
+return p2;
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(p2,cljs.core.cst$kw$style,style);
+}
+});
+reagent.impl.util.merge_props = (function reagent$impl$util$merge_props(p1,p2){
+if((p1 == null)){
+return p2;
+} else {
+if(cljs.core.map_QMARK_(p1)){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["Property must be a map, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p1], 0)))].join('')),"\n","(map? p1)"].join('')));
+}
+
+return reagent.impl.util.merge_style(p1,reagent.impl.util.merge_class(p1,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p1,p2], 0))));
+}
+});
+reagent.impl.util._STAR_always_update_STAR_ = false;
+reagent.impl.util.force_update = (function reagent$impl$util$force_update(comp,deep){
+if(cljs.core.truth_(deep)){
+var _STAR_always_update_STAR_3491 = reagent.impl.util._STAR_always_update_STAR_;
+reagent.impl.util._STAR_always_update_STAR_ = true;
+
+try{return (comp["forceUpdate"])();
+}finally {reagent.impl.util._STAR_always_update_STAR_ = _STAR_always_update_STAR_3491;
+}} else {
+return (comp["forceUpdate"])();
+}
+});
diff --git a/js/reagent/interop.cljs b/js/reagent/interop.cljs
new file mode 100644
index 0000000..078819c
--- /dev/null
+++ b/js/reagent/interop.cljs
@@ -0,0 +1,2 @@
+(ns reagent.interop
+  (:require-macros [reagent.interop]))
diff --git a/js/reagent/interop.cljs.cache.json b/js/reagent/interop.cljs.cache.json
new file mode 100644
index 0000000..7cfa0b0
--- /dev/null
+++ b/js/reagent/interop.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$reagent.interop","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ "],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^6","^6"],"~:doc",null]
\ No newline at end of file
diff --git a/js/reagent/interop.js b/js/reagent/interop.js
new file mode 100644
index 0000000..0bc4fe9
--- /dev/null
+++ b/js/reagent/interop.js
@@ -0,0 +1,4 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.interop');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
diff --git a/js/reagent/ratom.cljs b/js/reagent/ratom.cljs
new file mode 100644
index 0000000..393e6c6
--- /dev/null
+++ b/js/reagent/ratom.cljs
@@ -0,0 +1,595 @@
+(ns reagent.ratom
+  (:refer-clojure :exclude [atom])
+  (:require-macros [reagent.ratom :refer [with-let]])
+  (:require [reagent.impl.util :as util]
+            [reagent.debug :refer-macros [dbg log warn error dev? time]]
+            [reagent.impl.batching :as batch]
+            [clojure.set :as s]))
+
+(declare ^:dynamic *ratom-context*)
+(defonce ^boolean debug false)
+(defonce ^:private generation 0)
+(defonce ^:private -running (clojure.core/atom 0))
+
+(defn ^boolean reactive? []
+  (some? *ratom-context*))
+
+
+;;; Utilities
+
+(defn running []
+  (+ @-running))
+
+(defn- ^number arr-len [x]
+  (if (nil? x) 0 (alength x)))
+
+(defn- ^boolean arr-eq [x y]
+  (let [len (arr-len x)]
+    (and (== len (arr-len y))
+         (loop [i 0]
+           (or (== i len)
+               (if (identical? (aget x i) (aget y i))
+                 (recur (inc i))
+                 false))))))
+
+(defn- in-context [obj f]
+  (binding [*ratom-context* obj]
+    (f)))
+
+(defn- deref-capture [f r]
+  (set! (.-captured r) nil)
+  (when (dev?)
+    (set! (.-ratomGeneration r) (set! generation (inc generation))))
+  (let [res (in-context r f)
+        c (.-captured r)]
+    (set! (.-dirty? r) false)
+    ;; Optimize common case where derefs occur in same order
+    (when-not (arr-eq c (.-watching r))
+      (._update-watching r c))
+    res))
+
+(defn- notify-deref-watcher! [derefed]
+  (when-some [r *ratom-context*]
+    (let [c (.-captured r)]
+      (if (nil? c)
+        (set! (.-captured r) (array derefed))
+        (.push c derefed)))))
+
+(defn- check-watches [old new]
+  (when debug
+    (swap! -running + (- (count new) (count old))))
+  new)
+
+(defn- add-w [this key f]
+  (let [w (.-watches this)]
+    (set! (.-watches this) (check-watches w (assoc w key f)))
+    (set! (.-watchesArr this) nil)))
+
+(defn- remove-w [this key]
+  (let [w (.-watches this)]
+    (set! (.-watches this) (check-watches w (dissoc w key)))
+    (set! (.-watchesArr this) nil)))
+
+(defn- notify-w [this old new]
+  (let [w (.-watchesArr this)
+        a (if (nil? w)
+            ;; Copy watches to array for speed
+            (->> (.-watches this)
+                 (reduce-kv #(doto %1 (.push %2) (.push %3)) #js[])
+                 (set! (.-watchesArr this)))
+            w)]
+    (let [len (alength a)]
+      (loop [i 0]
+        (when (< i len)
+          (let [k (aget a i)
+                f (aget a (inc i))]
+            (f k this old new))
+          (recur (+ 2 i)))))))
+
+(defn- pr-atom [a writer opts s]
+  (-write writer (str "#<" s " "))
+  (pr-writer (binding [*ratom-context* nil] (-deref a)) writer opts)
+  (-write writer ">"))
+
+
+;;; Queueing
+
+(defonce ^:private rea-queue nil)
+
+(defn- rea-enqueue [r]
+  (when (nil? rea-queue)
+    (set! rea-queue (array))
+    (batch/schedule))
+  (.push rea-queue r))
+
+(defn flush! []
+  (loop []
+    (let [q rea-queue]
+      (when-not (nil? q)
+        (set! rea-queue nil)
+        (dotimes [i (alength q)]
+          (._queued-run (aget q i)))
+        (recur)))))
+
+(set! batch/ratom-flush flush!)
+
+
+;;; Atom
+
+(defprotocol IReactiveAtom)
+
+(deftype RAtom [^:mutable state meta validator ^:mutable watches]
+  IAtom
+  IReactiveAtom
+
+  IEquiv
+  (-equiv [o other] (identical? o other))
+
+  IDeref
+  (-deref [this]
+    (notify-deref-watcher! this)
+    state)
+
+  IReset
+  (-reset! [a new-value]
+    (when-not (nil? validator)
+      (assert (validator new-value) "Validator rejected reference state"))
+    (let [old-value state]
+      (set! state new-value)
+      (when-not (nil? watches)
+        (notify-w a old-value new-value))
+      new-value))
+
+  ISwap
+  (-swap! [a f]          (-reset! a (f state)))
+  (-swap! [a f x]        (-reset! a (f state x)))
+  (-swap! [a f x y]      (-reset! a (f state x y)))
+  (-swap! [a f x y more] (-reset! a (apply f state x y more)))
+
+  IWithMeta
+  (-with-meta [_ new-meta] (RAtom. state new-meta validator watches))
+
+  IMeta
+  (-meta [_] meta)
+
+  IPrintWithWriter
+  (-pr-writer [a w opts] (pr-atom a w opts "Atom:"))
+
+  IWatchable
+  (-notify-watches [this old new] (notify-w this old new))
+  (-add-watch [this key f]        (add-w this key f))
+  (-remove-watch [this key]       (remove-w this key))
+
+  IHash
+  (-hash [this] (goog/getUid this)))
+
+(defn atom
+  "Like clojure.core/atom, except that it keeps track of derefs."
+  ([x] (->RAtom x nil nil nil))
+  ([x & {:keys [meta validator]}] (->RAtom x meta validator nil)))
+
+
+;;; track
+
+(declare make-reaction)
+
+(def ^{:private true :const true} cache-key "reagReactionCache")
+
+(defn- cached-reaction [f o k obj destroy]
+  (let [m (aget o cache-key)
+        m (if (nil? m) {} m)
+        r (m k nil)]
+    (cond
+      (some? r) (-deref r)
+      (nil? *ratom-context*) (f)
+      :else (let [r (make-reaction
+                     f :on-dispose (fn [x]
+                                     (when debug (swap! -running dec))
+                                     (as-> (aget o cache-key) _
+                                       (dissoc _ k)
+                                       (aset o cache-key _))
+                                     (when (some? obj)
+                                       (set! (.-reaction obj) nil))
+                                     (when (some? destroy)
+                                       (destroy x))))
+                  v (-deref r)]
+              (aset o cache-key (assoc m k r))
+              (when debug (swap! -running inc))
+              (when (some? obj)
+                (set! (.-reaction obj) r))
+              v))))
+
+(deftype Track [f args ^:mutable reaction]
+  IReactiveAtom
+
+  IDeref
+  (-deref [this]
+    (if-some [r reaction]
+      (-deref r)
+      (cached-reaction #(apply f args) f args this nil)))
+
+  IEquiv
+  (-equiv [_ other]
+    (and (instance? Track other)
+         (= f (.-f other))
+         (= args (.-args other))))
+
+  IHash
+  (-hash [_] (hash [f args]))
+
+  IPrintWithWriter
+  (-pr-writer [a w opts] (pr-atom a w opts "Track:")))
+
+(defn make-track [f args]
+  (Track. f args nil))
+
+(defn make-track! [f args]
+  (let [t (make-track f args)
+        r (make-reaction #(-deref t)
+                         :auto-run true)]
+    @r
+    r))
+
+(defn track [f & args]
+  {:pre [(ifn? f)]}
+  (make-track f args))
+
+(defn track! [f & args]
+  {:pre [(ifn? f)]}
+  (make-track! f args))
+
+;;; cursor
+
+(deftype RCursor [ratom path ^:mutable reaction
+                  ^:mutable state ^:mutable watches]
+  IAtom
+  IReactiveAtom
+
+  IEquiv
+  (-equiv [_ other]
+    (and (instance? RCursor other)
+         (= path (.-path other))
+         (= ratom (.-ratom other))))
+
+  Object
+  (_peek [this]
+    (binding [*ratom-context* nil]
+      (-deref this)))
+
+  (_set-state [this oldstate newstate]
+    (when-not (identical? oldstate newstate)
+      (set! state newstate)
+      (when (some? watches)
+        (notify-w this oldstate newstate))))
+
+  IDeref
+  (-deref [this]
+    (let [oldstate state
+          newstate (if-some [r reaction]
+                     (-deref r)
+                     (let [f (if (satisfies? IDeref ratom)
+                               #(get-in @ratom path)
+                               #(ratom path))]
+                       (cached-reaction f ratom path this nil)))]
+      (._set-state this oldstate newstate)
+      newstate))
+
+  IReset
+  (-reset! [this new-value]
+    (let [oldstate state]
+      (._set-state this oldstate new-value)
+      (if (satisfies? IDeref ratom)
+        (if (= path [])
+          (reset! ratom new-value)
+          (swap! ratom assoc-in path new-value))
+        (ratom path new-value))
+      new-value))
+
+  ISwap
+  (-swap! [a f]          (-reset! a (f (._peek a))))
+  (-swap! [a f x]        (-reset! a (f (._peek a) x)))
+  (-swap! [a f x y]      (-reset! a (f (._peek a) x y)))
+  (-swap! [a f x y more] (-reset! a (apply f (._peek a) x y more)))
+
+  IPrintWithWriter
+  (-pr-writer [a w opts] (pr-atom a w opts (str "Cursor: " path)))
+
+  IWatchable
+  (-notify-watches [this old new] (notify-w this old new))
+  (-add-watch [this key f]        (add-w this key f))
+  (-remove-watch [this key]       (remove-w this key))
+
+  IHash
+  (-hash [_] (hash [ratom path])))
+
+(defn cursor
+  [src path]
+  (assert (or (satisfies? IReactiveAtom src)
+              (and (ifn? src)
+                   (not (vector? src))))
+          (str "src must be a reactive atom or a function, not "
+               (pr-str src)))
+  (->RCursor src path nil nil nil))
+
+
+;;; with-let support
+
+(defn with-let-destroy [v]
+  (when-some [f (.-destroy v)]
+    (f)))
+
+(defn with-let-values [key]
+  (if-some [c *ratom-context*]
+    (cached-reaction array c key
+                     nil with-let-destroy)
+    (array)))
+
+
+;;;; reaction
+
+(defprotocol IDisposable
+  (dispose! [this])
+  (add-on-dispose! [this f]))
+
+(defprotocol IRunnable
+  (run [this]))
+
+(defn- handle-reaction-change [this sender old new]
+  (._handle-change this sender old new))
+
+
+(deftype Reaction [f ^:mutable state ^:mutable ^boolean dirty? ^boolean nocache?
+                   ^:mutable watching ^:mutable watches ^:mutable auto-run
+                   ^:mutable caught]
+  IAtom
+  IReactiveAtom
+
+  IWatchable
+  (-notify-watches [this old new] (notify-w this old new))
+  (-add-watch [this key f]        (add-w this key f))
+  (-remove-watch [this key]
+    (let [was-empty (empty? watches)]
+      (remove-w this key)
+      (when (and (not was-empty)
+                 (empty? watches)
+                 (nil? auto-run))
+        (dispose! this))))
+
+  IReset
+  (-reset! [a newval]
+    (assert (fn? (.-on-set a)) "Reaction is read only; on-set is not allowed")
+    (let [oldval state]
+      (set! state newval)
+      (.on-set a oldval newval)
+      (notify-w a oldval newval)
+      newval))
+
+  ISwap
+  (-swap! [a f]          (-reset! a (f (._peek-at a))))
+  (-swap! [a f x]        (-reset! a (f (._peek-at a) x)))
+  (-swap! [a f x y]      (-reset! a (f (._peek-at a) x y)))
+  (-swap! [a f x y more] (-reset! a (apply f (._peek-at a) x y more)))
+
+  Object
+  (_peek-at [this]
+    (binding [*ratom-context* nil]
+      (-deref this)))
+
+  (_handle-change [this sender oldval newval]
+    (when-not (or (identical? oldval newval)
+                  dirty?)
+      (if (nil? auto-run)
+        (do
+          (set! dirty? true)
+          (rea-enqueue this))
+        (if (true? auto-run)
+          (._run this false)
+          (auto-run this)))))
+
+  (_update-watching [this derefed]
+    (let [new (set derefed)
+          old (set watching)]
+      (set! watching derefed)
+      (doseq [w (s/difference new old)]
+        (-add-watch w this handle-reaction-change))
+      (doseq [w (s/difference old new)]
+        (-remove-watch w this))))
+
+  (_queued-run [this]
+    (when (and dirty? (some? watching))
+      (._run this true)))
+
+  (_try-capture [this f]
+    (try
+      (set! caught nil)
+      (deref-capture f this)
+      (catch :default e
+        (set! state e)
+        (set! caught e)
+        (set! dirty? false))))
+
+  (_run [this check]
+    (let [oldstate state
+          res (if check
+                (._try-capture this f)
+                (deref-capture f this))]
+      (when-not nocache?
+        (set! state res)
+        ;; Use = to determine equality from reactions, since
+        ;; they are likely to produce new data structures.
+        (when-not (or (nil? watches)
+                      (= oldstate res))
+          (notify-w this oldstate res)))
+      res))
+
+  (_set-opts [this {:keys [auto-run on-set on-dispose no-cache]}]
+    (when (some? auto-run)
+      (set! (.-auto-run this) auto-run))
+    (when (some? on-set)
+      (set! (.-on-set this) on-set))
+    (when (some? on-dispose)
+      (set! (.-on-dispose this) on-dispose))
+    (when (some? no-cache)
+      (set! (.-nocache? this) no-cache)))
+
+  IRunnable
+  (run [this]
+    (flush!)
+    (._run this false))
+
+  IDeref
+  (-deref [this]
+    (when-some [e caught]
+      (throw e))
+    (let [non-reactive (nil? *ratom-context*)]
+      (when non-reactive
+        (flush!))
+      (if (and non-reactive (nil? auto-run))
+        (when dirty?
+          (let [oldstate state]
+            (set! state (f))
+            (when-not (or (nil? watches) (= oldstate state))
+              (notify-w this oldstate state))))
+        (do
+          (notify-deref-watcher! this)
+          (when dirty?
+            (._run this false)))))
+    state)
+
+  IDisposable
+  (dispose! [this]
+    (let [s state
+          wg watching]
+      (set! watching nil)
+      (set! state nil)
+      (set! auto-run nil)
+      (set! dirty? true)
+      (doseq [w (set wg)]
+        (-remove-watch w this))
+      (when (some? (.-on-dispose this))
+        (.on-dispose this s))
+      (when-some [a (.-on-dispose-arr this)]
+        (dotimes [i (alength a)]
+          ((aget a i) this)))))
+
+  (add-on-dispose! [this f]
+    ;; f is called with the reaction as argument when it is no longer active
+    (if-some [a (.-on-dispose-arr this)]
+      (.push a f)
+      (set! (.-on-dispose-arr this) (array f))))
+
+  IEquiv
+  (-equiv [o other] (identical? o other))
+
+  IPrintWithWriter
+  (-pr-writer [a w opts] (pr-atom a w opts (str "Reaction " (hash a) ":")))
+
+  IHash
+  (-hash [this] (goog/getUid this)))
+
+
+(defn make-reaction [f & {:keys [auto-run on-set on-dispose]}]
+  (let [reaction (->Reaction f nil true false nil nil nil nil)]
+    (._set-opts reaction {:auto-run auto-run
+                          :on-set on-set
+                          :on-dispose on-dispose})
+    reaction))
+
+
+
+(def ^:private temp-reaction (make-reaction nil))
+
+(defn run-in-reaction [f obj key run opts]
+  (let [r temp-reaction
+        res (deref-capture f r)]
+    (when-not (nil? (.-watching r))
+      (set! temp-reaction (make-reaction nil))
+      (._set-opts r opts)
+      (set! (.-f r) f)
+      (set! (.-auto-run r) #(run obj))
+      (aset obj key r))
+    res))
+
+(defn check-derefs [f]
+  (let [ctx (js-obj)
+        res (in-context ctx f)]
+    [res (some? (.-captured ctx))]))
+
+
+;;; wrap
+
+(deftype Wrapper [^:mutable state callback ^:mutable ^boolean changed
+                  ^:mutable watches]
+
+  IAtom
+
+  IDeref
+  (-deref [this]
+    (when (dev?)
+      (when (and changed (some? *ratom-context*))
+        (warn "derefing stale wrap: "
+              (pr-str this))))
+    state)
+
+  IReset
+  (-reset! [this newval]
+    (let [oldval state]
+      (set! changed true)
+      (set! state newval)
+      (when (some? watches)
+        (notify-w this oldval newval))
+      (callback newval)
+      newval))
+
+  ISwap
+  (-swap! [a f]          (-reset! a (f state)))
+  (-swap! [a f x]        (-reset! a (f state x)))
+  (-swap! [a f x y]      (-reset! a (f state x y)))
+  (-swap! [a f x y more] (-reset! a (apply f state x y more)))
+
+  IEquiv
+  (-equiv [_ other]
+          (and (instance? Wrapper other)
+               ;; If either of the wrappers have changed, equality
+               ;; cannot be relied on.
+               (not changed)
+               (not (.-changed other))
+               (= state (.-state other))
+               (= callback (.-callback other))))
+
+  IWatchable
+  (-notify-watches [this old new] (notify-w this old new))
+  (-add-watch [this key f]        (add-w this key f))
+  (-remove-watch [this key]       (remove-w this key))
+
+  IPrintWithWriter
+  (-pr-writer [a w opts] (pr-atom a w opts "Wrap:")))
+
+(defn make-wrapper [value callback-fn args]
+  (->Wrapper value
+             (util/make-partial-fn callback-fn args)
+             false nil))
+
+
+
+
+#_(do
+  (defn ratom-perf []
+    (set! debug false)
+    (dotimes [_ 10]
+      (let [nite 100000
+            a (atom 0)
+            f (fn []
+                (quot @a 10))
+            mid (make-reaction f)
+            res (track! (fn []
+                          ;; (with-let [x 1])
+                          ;; @(track f)
+                          (inc @mid)
+                          ))]
+        @res
+        (time (dotimes [x nite]
+                (swap! a inc)
+                (flush!)))
+        (dispose! res))))
+  (ratom-perf))
diff --git a/js/reagent/ratom.cljs.cache.json b/js/reagent/ratom.cljs.cache.json
new file mode 100644
index 0000000..dc5ccc8
--- /dev/null
+++ b/js/reagent/ratom.cljs.cache.json
@@ -0,0 +1 @@
+["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:externs",["^ ","~$Error",["^ "],"~$console",["^ "]],"~:use-macros",["^ ","~$with-let","~$reagent.ratom","~$log","~$reagent.debug","~$dbg","^9","~$warn","^9","~$dev?","^9","~$time","^9","~$error","^9"],"~:excludes",["~#set",["~$atom"]],"~:name","^7","~:imports",null,"~:requires",["^ ","~$util","~$reagent.impl.util","^F","^F","^9","^9","~$batch","~$reagent.impl.batching","^H","^H","~$s","~$clojure.set","^I","^I"],"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$pr-atom",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","~:line",89,"~:column",8,"~:end-line",89,"~:end-column",15,"~:private",true,"~:arglists",["~#list",["~$quote",["^W",[["~$a","~$writer","~$opts","~$s"]]]]]],"^U",true,"^B","~$reagent.ratom/pr-atom","~:variadic",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",15,"~:method-params",["^W",[["~$a","^Y","^Z","~$s"]]],"~:protocol-impl",null,"~:arglists-meta",["^W",[null,null]],"^R",1,"^Q",89,"^S",89,"~:max-fixed-arity",4,"~:fn-var",true,"^V",["^W",["^X",["^W",[["~$a","^Y","^Z","~$s"]]]]]],"~$->RCursor",["^ ","^N",null,"^O",["^ ","~:protocols",["^@",["~$cljs.core/IWatchable","~$cljs.core/IAtom","~$cljs.core/IEquiv","~$cljs.core/IHash","~$cljs.core/IReset","~$cljs.core/ISwap","~$reagent.ratom/IReactiveAtom","~$cljs.core/IDeref","~$cljs.core/IPrintWithWriter","~$reagent.ratom/Object"]],"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",17,"^R",10,"~:factory","~:positional","^Q",243,"^S",243,"^V",["^W",["^X",["^W",[["~$ratom","~$path","~$reaction","~$state","~$watches"]]]]],"~:skip-protocol-flag",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1?","^1@"]],"~:doc","Positional factory function for reagent.ratom/RCursor."],"^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","^1?","^1@","^1A"]],"^B","~$reagent.ratom/->RCursor","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",17,"^11",["^W",[["^1D","^1E","^1F","^1G","^1H"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^1B","^1C","^Q",243,"^S",243,"^14",5,"^15",true,"^V",["^W",["^X",["^W",[["^1D","^1E","^1F","^1G","^1H"]]]]],"^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1?","^1@"]],"^1J","Positional factory function for reagent.ratom/RCursor."],"~$notify-deref-watcher!",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",51,"^R",8,"^S",51,"^T",29,"^U",true,"^V",["^W",["^X",["^W",[["~$derefed"]]]]]],"^U",true,"^B","~$reagent.ratom/notify-deref-watcher!","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",29,"^11",["^W",[["^1M"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",51,"^S",51,"^14",1,"^15",true,"^V",["^W",["^X",["^W",[["^1M"]]]]]],"~$rea-enqueue",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",99,"^R",8,"^S",99,"^T",19,"^U",true,"^V",["^W",["^X",["^W",[["~$r"]]]]]],"^U",true,"^B","~$reagent.ratom/rea-enqueue","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",19,"^11",["^W",[["~$r"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",99,"^S",99,"^14",1,"^15",true,"^V",["^W",["^X",["^W",[["~$r"]]]]]],"~$in-context",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",35,"^R",8,"^S",35,"^T",18,"^U",true,"^V",["^W",["^X",["^W",[["~$obj","~$f"]]]]]],"^U",true,"^B","~$reagent.ratom/in-context","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",18,"^11",["^W",[["^1R","~$f"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",35,"^S",35,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["^1R","~$f"]]]]]],"~$make-track",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",223,"^R",7,"^S",223,"^T",17,"^V",["^W",["^X",["^W",[["~$f","~$args"]]]]]],"^B","~$reagent.ratom/make-track","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",17,"^11",["^W",[["~$f","^1U"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",223,"^S",223,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["~$f","^1U"]]]]]],"~$RAtom",["^ ","~:num-fields",4,"^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","~$cljs.core/IMeta","^1?","^1@","~$cljs.core/IWithMeta"]],"^B","~$reagent.ratom/RAtom","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",15,"~:type",true,"^R",10,"^Q",121,"~:record",false,"^S",121,"~:tag","~$function","^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1Y","^1?","^1@","^1Z"]]],"^A",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",166,"^R",7,"^S",166,"^T",11,"^V",["^W",["^X",["^W",[["~$x"],["~$x","~$&",["^ ","~:keys",["~$meta","~$validator"]]]]]]],"^1J","Like clojure.core/atom, except that it keeps track of derefs.","~:top-fn",["^ ","^10",true,"^14",1,"^11",["^W",[["~$x"]]],"^V",["^W",[["~$x"],["~$x","~$&",["^ ","^24",["^25","^26"]]]]],"^13",["^W",[null,null]]]],"^B","~$reagent.ratom/atom","^10",true,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",11,"^27",["^ ","^10",true,"^14",1,"^11",["^W",[["~$x"]]],"^V",["^W",[["~$x"],["~$x","~$&",["^ ","^24",["^25","^26"]]]]],"^13",["^W",[null,null]]],"^11",["^W",[["~$x"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",166,"^S",166,"^14",1,"^15",true,"^V",["^W",[["~$x"],["~$x","~$&",["^ ","^24",["^25","^26"]]]]],"^1J","Like clojure.core/atom, except that it keeps track of derefs."],"~$notify-w",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",73,"^R",8,"^S",73,"^T",16,"^U",true,"^V",["^W",["^X",["^W",[["~$this","~$old","~$new"]]]]]],"^U",true,"^B","~$reagent.ratom/notify-w","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",16,"^11",["^W",[["^2:","^2;","^2<"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",73,"^S",73,"^14",3,"^15",true,"^V",["^W",["^X",["^W",[["^2:","^2;","^2<"]]]]]],"~$->Reaction",["^ ","^N",null,"^O",["^ ","^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","~$reagent.ratom/IRunnable","~$reagent.ratom/IDisposable","^1?","^1@","^1A"]],"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",18,"^R",10,"^1B","^1C","^Q",341,"^S",341,"^V",["^W",["^X",["^W",[["~$f","^1G","~$dirty?","~$nocache?","~$watching","^1H","~$auto-run","~$caught"]]]]],"^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1?","^1@"]],"^1J","Positional factory function for reagent.ratom/Reaction."],"^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","^2?","^2@","^1?","^1@","^1A"]],"^B","~$reagent.ratom/->Reaction","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",18,"^11",["^W",[["~$f","^1G","^2A","^2B","^2C","^1H","^2D","^2E"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^1B","^1C","^Q",341,"^S",341,"^14",8,"^15",true,"^V",["^W",["^X",["^W",[["~$f","^1G","^2A","^2B","^2C","^1H","^2D","^2E"]]]]],"^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1?","^1@"]],"^1J","Positional factory function for reagent.ratom/Reaction."],"~$make-wrapper",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",568,"^R",7,"^S",568,"^T",19,"^V",["^W",["^X",["^W",[["~$value","~$callback-fn","^1U"]]]]]],"^B","~$reagent.ratom/make-wrapper","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",19,"^11",["^W",[["^2H","^2I","^1U"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",568,"^S",568,"^14",3,"^15",true,"^V",["^W",["^X",["^W",[["^2H","^2I","^1U"]]]]]],"~$IReactiveAtom",["^ ","^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",119,"^R",14,"^S",119,"^T",27,"^1J",null,"~:protocol-symbol",true,"~:jsdoc",["^W",["@interface"]],"~:protocol-info",["^ ","~:methods",["^ "]]],"^2L",true,"^B","^1>","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",27,"^R",1,"^Q",119,"^2N",["^ ","^2O",["^ "]],"~:info",null,"^S",119,"^22","~$any","~:impls",["^@",["~$reagent.ratom/RCursor","~$reagent.ratom/Track","~$reagent.ratom/Reaction","^1["]],"^1J",null,"^2M",["^W",["@interface"]]],"~$track",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",233,"^R",7,"^S",233,"^T",12,"^V",["^W",["^X",["^W",[["~$f","~$&","^1U"]]]]],"^27",["^ ","^10",true,"^14",1,"^11",[["^W",["~$f","^1U"]]],"^V",["^W",[["~$f","~$&","^1U"]]],"^13",["^W",[null]]]],"^B","~$reagent.ratom/track","^10",true,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",12,"^27",["^ ","^10",true,"^14",1,"^11",[["^W",["~$f","^1U"]]],"^V",["^W",[["~$f","~$&","^1U"]]],"^13",["^W",[null]]],"^11",[["^W",["~$f","^1U"]]],"^12",null,"^13",["^W",[null]],"^R",1,"^Q",233,"^S",233,"^14",1,"^15",true,"^V",["^W",[["~$f","~$&","^1U"]]]],"~$dispose!",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",331,"^R",4,"^S",331,"^T",12,"~:protocol","^2@","^1J",null,"^V",["^W",["^X",["^W",[["^2:"]]]]]],"^2Y","^2@","^B","~$reagent.ratom/dispose!","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",12,"^11",["^W",[["^2:"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",330,"^S",331,"^14",1,"^15",true,"^V",["^W",["^X",["^W",[["^2:"]]]]],"^1J",null],"~$arr-eq",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",26,"^R",17,"^S",26,"^T",23,"^22","~$boolean","^U",true,"^V",["^W",["^X",["^W",[["~$x","~$y"]]]]]],"^U",true,"^B","~$reagent.ratom/arr-eq","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",23,"^11",["^W",[["~$x","~$y"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",26,"~:ret-tag","^30","^S",26,"^14",2,"^22","^30","^15",true,"^V",["^W",["^X",["^W",[["~$x","~$y"]]]]]],"~$handle-reaction-change",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",337,"^R",8,"^S",337,"^T",30,"^U",true,"^V",["^W",["^X",["^W",[["^2:","~$sender","^2;","^2<"]]]]]],"^U",true,"^B","~$reagent.ratom/handle-reaction-change","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",30,"^11",["^W",[["^2:","^34","^2;","^2<"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",337,"^S",337,"^14",4,"^15",true,"^V",["^W",["^X",["^W",[["^2:","^34","^2;","^2<"]]]]]],"~$run",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",335,"^R",4,"^S",335,"^T",7,"^2Y","^2?","^1J",null,"^V",["^W",["^X",["^W",[["^2:"]]]]]],"^2Y","^2?","^B","~$reagent.ratom/run","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",7,"^11",["^W",[["^2:"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",334,"^S",335,"^14",1,"^15",true,"^V",["^W",["^X",["^W",[["^2:"]]]]],"^1J",null],"~$add-on-dispose!",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",332,"^R",4,"^S",332,"^T",19,"^2Y","^2@","^1J",null,"^V",["^W",["^X",["^W",[["^2:","~$f"]]]]]],"^2Y","^2@","^B","~$reagent.ratom/add-on-dispose!","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",19,"^11",["^W",[["^2:","~$f"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",330,"^S",332,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["^2:","~$f"]]]]],"^1J",null],"~$temp-reaction",["^ ","^B","~$reagent.ratom/temp-reaction","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",500,"^R",1,"^S",500,"^T",29,"^U",true,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",500,"^R",16,"^S",500,"^T",29,"^U",true],"^22","^2Q"],"~$cache-key",["^ ","^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",176,"^R",35,"^S",176,"^T",44,"^U",true,"~:const",true],"^U",true,"^B","~$reagent.ratom/cache-key","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",44,"~:const-expr",["^ ","~:op","^3=","~:val","reagReactionCache","~:env",["^ ","~:context","~:expr"],"~:form","reagReactionCache","^22","~$string"],"^R",1,"^3=",true,"^Q",176,"^S",176,"^22","^3F"],"~$make-track!",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",226,"^R",7,"^S",226,"^T",18,"^V",["^W",["^X",["^W",[["~$f","^1U"]]]]]],"^B","~$reagent.ratom/make-track!","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",18,"^11",["^W",[["~$f","^1U"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",226,"^S",226,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["~$f","^1U"]]]]]],"~$generation",["^ ","^B","~$reagent.ratom/generation","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",11,"^R",1,"^S",11,"^T",30,"^U",true,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",11,"^R",20,"^S",11,"^T",30,"^U",true],"^22","~$number"],"~$run-in-reaction",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",502,"^R",7,"^S",502,"^T",22,"^V",["^W",["^X",["^W",[["~$f","^1R","~$key","^36","^Z"]]]]]],"^B","~$reagent.ratom/run-in-reaction","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",22,"^11",["^W",[["~$f","^1R","^3M","^36","^Z"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",502,"^S",502,"^14",5,"^15",true,"^V",["^W",["^X",["^W",[["~$f","^1R","^3M","^36","^Z"]]]]]],"~$IDisposable",["^ ","^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",330,"^R",14,"^S",330,"^T",25,"^1J",null,"^2L",true,"^2M",["^W",["@interface"]],"^2N",["^ ","^2O",["^ ","^2X",[["^2:"]],"^38",[["^2:","~$f"]]]]],"^2L",true,"^B","^2@","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",25,"^R",1,"^Q",330,"^2N",["^ ","^2O",["^ ","^2X",[["^2:"]],"^38",[["^2:","~$f"]]]],"^2P",null,"^S",330,"^22","^2Q","^2R",["^@",["^2U"]],"^1J",null,"^2M",["^W",["@interface"]]],"~$check-watches",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",58,"^R",8,"^S",58,"^T",21,"^U",true,"^V",["^W",["^X",["^W",[["^2;","^2<"]]]]]],"^U",true,"^B","~$reagent.ratom/check-watches","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",21,"^11",["^W",[["^2;","^2<"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",58,"^S",58,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["^2;","^2<"]]]]]],"~$with-let-destroy",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",317,"^R",7,"^S",317,"^T",23,"^V",["^W",["^X",["^W",[["~$v"]]]]]],"^B","~$reagent.ratom/with-let-destroy","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",23,"^11",["^W",[["~$v"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",317,"^S",317,"^14",1,"^15",true,"^V",["^W",["^X",["^W",[["~$v"]]]]]],"~$make-reaction",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",491,"^R",7,"^S",491,"^T",20,"^V",["^W",["^X",["^W",[["~$f","~$&",["^ ","^24",["^2D","~$on-set","~$on-dispose"]]]]]]],"^27",["^ ","^10",true,"^14",1,"^11",[["^W",["~$f",["^ ","^24",["^2D","^3U","^3V"]]]]],"^V",["^W",[["~$f","~$&",["^ ","^24",["^2D","^3U","^3V"]]]]],"^13",["^W",[null]]]],"^B","~$reagent.ratom/make-reaction","^10",true,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",20,"^27",["^ ","^10",true,"^14",1,"^11",[["^W",["~$f",["^ ","^24",["^2D","^3U","^3V"]]]]],"^V",["^W",[["~$f","~$&",["^ ","^24",["^2D","^3U","^3V"]]]]],"^13",["^W",[null]]],"^11",[["^W",["~$f",["^ ","^24",["^2D","^3U","^3V"]]]]],"^12",null,"^13",["^W",[null]],"^R",1,"^Q",491,"^S",491,"^14",1,"^15",true,"^V",["^W",[["~$f","~$&",["^ ","^24",["^2D","^3U","^3V"]]]]]],"~$add-w",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",63,"^R",8,"^S",63,"^T",13,"^U",true,"^V",["^W",["^X",["^W",[["^2:","^3M","~$f"]]]]]],"^U",true,"^B","~$reagent.ratom/add-w","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",13,"^11",["^W",[["^2:","^3M","~$f"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",63,"^S",63,"^14",3,"^15",true,"^V",["^W",["^X",["^W",[["^2:","^3M","~$f"]]]]]],"~$Reaction",["^ ","^1X",8,"^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","^2?","^2@","^1?","^1@","^1A"]],"^B","^2U","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",18,"^20",true,"^R",10,"^Q",341,"^21",false,"^S",341,"^22","^23","^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1?","^1@"]]],"~$flush!",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",105,"^R",7,"^S",105,"^T",13,"^V",["^W",["^X",["^W",[[]]]]]],"^B","~$reagent.ratom/flush!","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",13,"^11",["^W",[[]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",105,"^S",105,"^14",0,"^15",true,"^V",["^W",["^X",["^W",[[]]]]]],"~$RCursor",["^ ","^1X",5,"^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","^1?","^1@","^1A"]],"^B","^2S","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",17,"^20",true,"^R",10,"^Q",243,"^21",false,"^S",243,"^22","^23","^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1?","^1@"]]],"~$cached-reaction",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",178,"^R",8,"^S",178,"^T",23,"^U",true,"^V",["^W",["^X",["^W",[["~$f","~$o","~$k","^1R","~$destroy"]]]]]],"^U",true,"^B","~$reagent.ratom/cached-reaction","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",23,"^11",["^W",[["~$f","~$o","~$k","^1R","^43"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",178,"^S",178,"^14",5,"^15",true,"^V",["^W",["^X",["^W",[["~$f","~$o","~$k","^1R","^43"]]]]]],"~$Track",["^ ","^1X",3,"^17",["^@",["^1:","^1;","^1>","^1?","^1@"]],"^B","^2T","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",15,"^20",true,"^R",10,"^Q",202,"^21",false,"^S",202,"^22","^23","^1I",["^@",["^1:","^1;","^1?","^1@"]]],"~$debug",["^ ","^B","~$reagent.ratom/debug","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",10,"^R",1,"^S",10,"^T",24,"^22","^30","^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",10,"^R",19,"^S",10,"^T",24,"^22","^30"]],"~$-running",["^ ","^B","~$reagent.ratom/-running","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",12,"^R",1,"^S",12,"^T",28,"^U",true,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",12,"^R",20,"^S",12,"^T",28,"^U",true],"^22","^2Q"],"~$cursor",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",305,"^R",7,"^S",305,"^T",13,"^V",["^W",["^X",["^W",[["~$src","^1E"]]]]]],"^B","~$reagent.ratom/cursor","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",13,"^11",["^W",[["^4;","^1E"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",305,"^S",305,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["^4;","^1E"]]]]]],"~$Wrapper",["^ ","^1X",4,"^17",["^@",["^18","^19","^1:","^1<","^1=","^1?","^1@"]],"^B","~$reagent.ratom/Wrapper","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",17,"^20",true,"^R",10,"^Q",521,"^21",false,"^S",521,"^22","^23","^1I",["^@",["^18","^19","^1:","^1<","^1=","^1?","^1@"]]],"~$running",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",20,"^R",7,"^S",20,"^T",14,"^V",["^W",["^X",["^W",[[]]]]]],"^B","~$reagent.ratom/running","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",14,"^11",["^W",[[]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",20,"^S",20,"^14",0,"^15",true,"^V",["^W",["^X",["^W",[[]]]]]],"~$IRunnable",["^ ","^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",334,"^R",14,"^S",334,"^T",23,"^1J",null,"^2L",true,"^2M",["^W",["@interface"]],"^2N",["^ ","^2O",["^ ","^36",[["^2:"]]]]],"^2L",true,"^B","^2?","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",23,"^R",1,"^Q",334,"^2N",["^ ","^2O",["^ ","^36",[["^2:"]]]],"^2P",null,"^S",334,"^22","^2Q","^2R",["^@",["^2U"]],"^1J",null,"^2M",["^W",["@interface"]]],"~$reactive?",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",14,"^R",16,"^S",14,"^T",25,"^22","^30","^V",["^W",["^X",["^W",[[]]]]]],"^B","~$reagent.ratom/reactive?","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",25,"^11",["^W",[[]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",14,"^32","^30","^S",14,"^14",0,"^22","^30","^15",true,"^V",["^W",["^X",["^W",[[]]]]]],"~$deref-capture",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",39,"^R",8,"^S",39,"^T",21,"^U",true,"^V",["^W",["^X",["^W",[["~$f","~$r"]]]]]],"^U",true,"^B","~$reagent.ratom/deref-capture","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",21,"^11",["^W",[["~$f","~$r"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",39,"^S",39,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["~$f","~$r"]]]]]],"~$rea-queue",["^ ","^B","~$reagent.ratom/rea-queue","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",97,"^R",1,"^S",97,"^T",29,"^U",true,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",97,"^R",20,"^S",97,"^T",29,"^U",true],"^22","~$clj-nil"],"~$with-let-values",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",321,"^R",7,"^S",321,"^T",22,"^V",["^W",["^X",["^W",[["^3M"]]]]]],"^B","~$reagent.ratom/with-let-values","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",22,"^11",["^W",[["^3M"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",321,"^S",321,"^14",1,"^15",true,"^V",["^W",["^X",["^W",[["^3M"]]]]]],"~$track!",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",237,"^R",7,"^S",237,"^T",13,"^V",["^W",["^X",["^W",[["~$f","~$&","^1U"]]]]],"^27",["^ ","^10",true,"^14",1,"^11",[["^W",["~$f","^1U"]]],"^V",["^W",[["~$f","~$&","^1U"]]],"^13",["^W",[null]]]],"^B","~$reagent.ratom/track!","^10",true,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",13,"^27",["^ ","^10",true,"^14",1,"^11",[["^W",["~$f","^1U"]]],"^V",["^W",[["~$f","~$&","^1U"]]],"^13",["^W",[null]]],"^11",[["^W",["~$f","^1U"]]],"^12",null,"^13",["^W",[null]],"^R",1,"^Q",237,"^S",237,"^14",1,"^15",true,"^V",["^W",[["~$f","~$&","^1U"]]]],"~$*ratom-context*",["^ ","^B","~$reagent.ratom/*ratom-context*","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",9,"^R",1,"^S",9,"^T",35,"~:dynamic",true,"~:declared",true,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",9,"^R",20,"^S",9,"^T",35,"^4O",true,"^4P",true]],"~$check-derefs",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",513,"^R",7,"^S",513,"^T",19,"^V",["^W",["^X",["^W",[["~$f"]]]]]],"^B","~$reagent.ratom/check-derefs","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",19,"^11",["^W",[["~$f"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",513,"^S",513,"^14",1,"^15",true,"^V",["^W",["^X",["^W",[["~$f"]]]]]],"~$remove-w",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",68,"^R",8,"^S",68,"^T",16,"^U",true,"^V",["^W",["^X",["^W",[["^2:","^3M"]]]]]],"^U",true,"^B","~$reagent.ratom/remove-w","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",16,"^11",["^W",[["^2:","^3M"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",68,"^S",68,"^14",2,"^15",true,"^V",["^W",["^X",["^W",[["^2:","^3M"]]]]]],"~$->Wrapper",["^ ","^N",null,"^O",["^ ","^17",["^@",["^18","^19","^1:","^1<","^1=","^1?","^1@"]],"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",17,"^R",10,"^1B","^1C","^Q",521,"^S",521,"^V",["^W",["^X",["^W",[["^1G","~$callback","~$changed","^1H"]]]]],"^1I",["^@",["^18","^19","^1:","^1<","^1=","^1?","^1@"]],"^1J","Positional factory function for reagent.ratom/Wrapper."],"^17",["^@",["^18","^19","^1:","^1<","^1=","^1?","^1@"]],"^B","~$reagent.ratom/->Wrapper","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",17,"^11",["^W",[["^1G","^4V","^4W","^1H"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^1B","^1C","^Q",521,"^S",521,"^14",4,"^15",true,"^V",["^W",["^X",["^W",[["^1G","^4V","^4W","^1H"]]]]],"^1I",["^@",["^18","^19","^1:","^1<","^1=","^1?","^1@"]],"^1J","Positional factory function for reagent.ratom/Wrapper."],"~$arr-len",["^ ","^N",null,"^O",["^ ","^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^Q",23,"^R",16,"^S",23,"^T",23,"^22","^3K","^U",true,"^V",["^W",["^X",["^W",[["~$x"]]]]]],"^U",true,"^B","~$reagent.ratom/arr-len","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",23,"^11",["^W",[["~$x"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^Q",23,"^32","^3K","^S",23,"^14",1,"^22","^3K","^15",true,"^V",["^W",["^X",["^W",[["~$x"]]]]]],"~$->RAtom",["^ ","^N",null,"^O",["^ ","^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","^1Y","^1?","^1@","^1Z"]],"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",15,"^R",10,"^1B","^1C","^Q",121,"^S",121,"^V",["^W",["^X",["^W",[["^1G","^25","^26","^1H"]]]]],"^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1Y","^1?","^1@","^1Z"]],"^1J","Positional factory function for reagent.ratom/RAtom."],"^17",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1>","^1Y","^1?","^1@","^1Z"]],"^B","~$reagent.ratom/->RAtom","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",15,"^11",["^W",[["^1G","^25","^26","^1H"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^1B","^1C","^Q",121,"^S",121,"^14",4,"^15",true,"^V",["^W",["^X",["^W",[["^1G","^25","^26","^1H"]]]]],"^1I",["^@",["^18","^19","^1:","^1;","^1<","^1=","^1Y","^1?","^1@","^1Z"]],"^1J","Positional factory function for reagent.ratom/RAtom."],"~$->Track",["^ ","^N",null,"^O",["^ ","^17",["^@",["^1:","^1;","^1>","^1?","^1@"]],"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",15,"^R",10,"^1B","^1C","^Q",202,"^S",202,"^V",["^W",["^X",["^W",[["~$f","^1U","^1F"]]]]],"^1I",["^@",["^1:","^1;","^1?","^1@"]],"^1J","Positional factory function for reagent.ratom/Track."],"^17",["^@",["^1:","^1;","^1>","^1?","^1@"]],"^B","~$reagent.ratom/->Track","^10",false,"^P","/home/julien/.cljs/.aot_cache/1.10.329/BA34A09/reagent/ratom.cljs","^T",15,"^11",["^W",[["~$f","^1U","^1F"]]],"^12",null,"^13",["^W",[null,null]],"^R",1,"^1B","^1C","^Q",202,"^S",202,"^14",3,"^15",true,"^V",["^W",["^X",["^W",[["~$f","^1U","^1F"]]]]],"^1I",["^@",["^1:","^1;","^1?","^1@"]],"^1J","Positional factory function for reagent.ratom/Track."]],"~:cljs.spec/registry-ref",[],"~:require-macros",["^ ","^7","^7","^9","^9"],"~:cljs.analyzer/constants",["^ ","~:seen",["^@",["~:on-set","^2E","^2C","^30","^1F","^4V","^O","~:else","^1E","^1U","~:validator","^1H","^25","^26","^2A","~:no-cache","^1D","^1G","~:auto-run","~:on-dispose","^22","~:mutable","^4W","^2D","^2B","~$f"]],"~:order",["^1G","^5=","^25","^26","^1H","^O","^59","^58","^5<","~$f","^1U","^1F","^5;","^1D","^1E","^57","^5:","^2A","^22","^30","^2B","^2C","^2D","^2E","^4V","^4W"]],"^1J",null]
\ No newline at end of file
diff --git a/js/reagent/ratom.js b/js/reagent/ratom.js
new file mode 100644
index 0000000..142493f
--- /dev/null
+++ b/js/reagent/ratom.js
@@ -0,0 +1,1637 @@
+// Compiled by ClojureScript 1.10.329 {:static-fns true, :optimize-constants true}
+goog.provide('reagent.ratom');
+goog.require('cljs.core');
+goog.require('cljs.core.constants');
+goog.require('reagent.impl.util');
+goog.require('reagent.debug');
+goog.require('reagent.impl.batching');
+goog.require('clojure.set');
+if((typeof reagent !== 'undefined') && (typeof reagent.ratom !== 'undefined') && (typeof reagent.ratom.debug !== 'undefined')){
+} else {
+reagent.ratom.debug = false;
+}
+if((typeof reagent !== 'undefined') && (typeof reagent.ratom !== 'undefined') && (typeof reagent.ratom.generation !== 'undefined')){
+} else {
+reagent.ratom.generation = (0);
+}
+if((typeof reagent !== 'undefined') && (typeof reagent.ratom !== 'undefined') && (typeof reagent.ratom._running !== 'undefined')){
+} else {
+reagent.ratom._running = cljs.core.atom.cljs$core$IFn$_invoke$arity$1((0));
+}
+reagent.ratom.reactive_QMARK_ = (function reagent$ratom$reactive_QMARK_(){
+return !((reagent.ratom._STAR_ratom_context_STAR_ == null));
+});
+reagent.ratom.running = (function reagent$ratom$running(){
+return cljs.core.deref(reagent.ratom._running);
+});
+reagent.ratom.arr_len = (function reagent$ratom$arr_len(x){
+if((x == null)){
+return (0);
+} else {
+return x.length;
+}
+});
+reagent.ratom.arr_eq = (function reagent$ratom$arr_eq(x,y){
+var len = reagent.ratom.arr_len(x);
+var and__3925__auto__ = (len === reagent.ratom.arr_len(y));
+if(and__3925__auto__){
+var i = (0);
+while(true){
+var or__3936__auto__ = (i === len);
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+if(((x[i]) === (y[i]))){
+var G__3599 = (i + (1));
+i = G__3599;
+continue;
+} else {
+return false;
+}
+}
+break;
+}
+} else {
+return and__3925__auto__;
+}
+});
+reagent.ratom.in_context = (function reagent$ratom$in_context(obj,f){
+var _STAR_ratom_context_STAR_3600 = reagent.ratom._STAR_ratom_context_STAR_;
+reagent.ratom._STAR_ratom_context_STAR_ = obj;
+
+try{return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+}finally {reagent.ratom._STAR_ratom_context_STAR_ = _STAR_ratom_context_STAR_3600;
+}});
+reagent.ratom.deref_capture = (function reagent$ratom$deref_capture(f,r){
+r.captured = null;
+
+r.ratomGeneration = reagent.ratom.generation = (reagent.ratom.generation + (1));
+
+
+var res = reagent.ratom.in_context(r,f);
+var c = r.captured;
+r.dirty_QMARK_ = false;
+
+if(reagent.ratom.arr_eq(c,r.watching)){
+} else {
+r._update_watching(c);
+}
+
+return res;
+});
+reagent.ratom.notify_deref_watcher_BANG_ = (function reagent$ratom$notify_deref_watcher_BANG_(derefed){
+var temp__5461__auto__ = reagent.ratom._STAR_ratom_context_STAR_;
+if((temp__5461__auto__ == null)){
+return null;
+} else {
+var r = temp__5461__auto__;
+var c = r.captured;
+if((c == null)){
+return r.captured = [derefed];
+} else {
+return c.push(derefed);
+}
+}
+});
+reagent.ratom.check_watches = (function reagent$ratom$check_watches(old,new$){
+if(reagent.ratom.debug){
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(reagent.ratom._running,cljs.core._PLUS_,(cljs.core.count(new$) - cljs.core.count(old)));
+} else {
+}
+
+return new$;
+});
+reagent.ratom.add_w = (function reagent$ratom$add_w(this$,key,f){
+var w = this$.watches;
+this$.watches = reagent.ratom.check_watches(w,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(w,key,f));
+
+return this$.watchesArr = null;
+});
+reagent.ratom.remove_w = (function reagent$ratom$remove_w(this$,key){
+var w = this$.watches;
+this$.watches = reagent.ratom.check_watches(w,cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(w,key));
+
+return this$.watchesArr = null;
+});
+reagent.ratom.notify_w = (function reagent$ratom$notify_w(this$,old,new$){
+var w = this$.watchesArr;
+var a = (((w == null))?this$.watchesArr = cljs.core.reduce_kv(((function (w){
+return (function (p1__3601_SHARP_,p2__3602_SHARP_,p3__3603_SHARP_){
+var G__3604 = p1__3601_SHARP_;
+G__3604.push(p2__3602_SHARP_);
+
+G__3604.push(p3__3603_SHARP_);
+
+return G__3604;
+});})(w))
+,[],this$.watches):w);
+var len = a.length;
+var i = (0);
+while(true){
+if((i < len)){
+var k_3605 = (a[i]);
+var f_3606 = (a[(i + (1))]);
+(f_3606.cljs$core$IFn$_invoke$arity$4 ? f_3606.cljs$core$IFn$_invoke$arity$4(k_3605,this$,old,new$) : f_3606.call(null,k_3605,this$,old,new$));
+
+var G__3607 = ((2) + i);
+i = G__3607;
+continue;
+} else {
+return null;
+}
+break;
+}
+});
+reagent.ratom.pr_atom = (function reagent$ratom$pr_atom(a,writer,opts,s){
+cljs.core._write(writer,["#<",cljs.core.str.cljs$core$IFn$_invoke$arity$1(s)," "].join(''));
+
+cljs.core.pr_writer((function (){var _STAR_ratom_context_STAR_3608 = reagent.ratom._STAR_ratom_context_STAR_;
+reagent.ratom._STAR_ratom_context_STAR_ = null;
+
+try{return cljs.core._deref(a);
+}finally {reagent.ratom._STAR_ratom_context_STAR_ = _STAR_ratom_context_STAR_3608;
+}})(),writer,opts);
+
+return cljs.core._write(writer,">");
+});
+if((typeof reagent !== 'undefined') && (typeof reagent.ratom !== 'undefined') && (typeof reagent.ratom.rea_queue !== 'undefined')){
+} else {
+reagent.ratom.rea_queue = null;
+}
+reagent.ratom.rea_enqueue = (function reagent$ratom$rea_enqueue(r){
+if((reagent.ratom.rea_queue == null)){
+reagent.ratom.rea_queue = [];
+
+reagent.impl.batching.schedule();
+} else {
+}
+
+return reagent.ratom.rea_queue.push(r);
+});
+reagent.ratom.flush_BANG_ = (function reagent$ratom$flush_BANG_(){
+while(true){
+var q = reagent.ratom.rea_queue;
+if((q == null)){
+return null;
+} else {
+reagent.ratom.rea_queue = null;
+
+var n__4395__auto___3609 = q.length;
+var i_3610 = (0);
+while(true){
+if((i_3610 < n__4395__auto___3609)){
+(q[i_3610])._queued_run();
+
+var G__3611 = (i_3610 + (1));
+i_3610 = G__3611;
+continue;
+} else {
+}
+break;
+}
+
+continue;
+}
+break;
+}
+});
+reagent.impl.batching.ratom_flush = reagent.ratom.flush_BANG_;
+
+/**
+ * @interface
+ */
+reagent.ratom.IReactiveAtom = function(){};
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IWatchable}
+ * @implements {cljs.core.IAtom}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IReset}
+ * @implements {cljs.core.ISwap}
+ * @implements {reagent.ratom.IReactiveAtom}
+ * @implements {cljs.core.IMeta}
+ * @implements {cljs.core.IDeref}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {cljs.core.IWithMeta}
+*/
+reagent.ratom.RAtom = (function (state,meta,validator,watches){
+this.state = state;
+this.meta = meta;
+this.validator = validator;
+this.watches = watches;
+this.cljs$lang$protocol_mask$partition0$ = 2154201088;
+this.cljs$lang$protocol_mask$partition1$ = 114690;
+});
+reagent.ratom.RAtom.prototype.reagent$ratom$IReactiveAtom$ = cljs.core.PROTOCOL_SENTINEL;
+
+reagent.ratom.RAtom.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,w,opts){
+var self__ = this;
+var a__$1 = this;
+return reagent.ratom.pr_atom(a__$1,w,opts,"Atom:");
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return self__.meta;
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return goog.getUid(this$__$1);
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
+var self__ = this;
+var o__$1 = this;
+return (o__$1 === other);
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IReset$_reset_BANG_$arity$2 = (function (a,new_value){
+var self__ = this;
+var a__$1 = this;
+if((self__.validator == null)){
+} else {
+if(cljs.core.truth_((self__.validator.cljs$core$IFn$_invoke$arity$1 ? self__.validator.cljs$core$IFn$_invoke$arity$1(new_value) : self__.validator.call(null,new_value)))){
+} else {
+throw (new Error(["Assert failed: ","Validator rejected reference state","\n","(validator new-value)"].join('')));
+}
+}
+
+var old_value = self__.state;
+self__.state = new_value;
+
+if((self__.watches == null)){
+} else {
+reagent.ratom.notify_w(a__$1,old_value,new_value);
+}
+
+return new_value;
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$ISwap$_swap_BANG_$arity$2 = (function (a,f){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(self__.state) : f.call(null,self__.state)));
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$ISwap$_swap_BANG_$arity$3 = (function (a,f,x){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(self__.state,x) : f.call(null,self__.state,x)));
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$ISwap$_swap_BANG_$arity$4 = (function (a,f,x,y){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(self__.state,x,y) : f.call(null,self__.state,x,y)));
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$ISwap$_swap_BANG_$arity$5 = (function (a,f,x,y,more){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,self__.state,x,y,more));
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IWatchable$_notify_watches$arity$3 = (function (this$,old,new$){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.notify_w(this$__$1,old,new$);
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IWatchable$_add_watch$arity$3 = (function (this$,key,f){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.add_w(this$__$1,key,f);
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IWatchable$_remove_watch$arity$2 = (function (this$,key){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.remove_w(this$__$1,key);
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_,new_meta){
+var self__ = this;
+var ___$1 = this;
+return (new reagent.ratom.RAtom(self__.state,new_meta,self__.validator,self__.watches));
+});
+
+reagent.ratom.RAtom.prototype.cljs$core$IDeref$_deref$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+reagent.ratom.notify_deref_watcher_BANG_(this$__$1);
+
+return self__.state;
+});
+
+reagent.ratom.RAtom.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$state,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$meta,cljs.core.cst$sym$validator,cljs.core.with_meta(cljs.core.cst$sym$watches,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+reagent.ratom.RAtom.cljs$lang$type = true;
+
+reagent.ratom.RAtom.cljs$lang$ctorStr = "reagent.ratom/RAtom";
+
+reagent.ratom.RAtom.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.ratom/RAtom");
+});
+
+/**
+ * Positional factory function for reagent.ratom/RAtom.
+ */
+reagent.ratom.__GT_RAtom = (function reagent$ratom$__GT_RAtom(state,meta,validator,watches){
+return (new reagent.ratom.RAtom(state,meta,validator,watches));
+});
+
+/**
+ * Like clojure.core/atom, except that it keeps track of derefs.
+ */
+reagent.ratom.atom = (function reagent$ratom$atom(var_args){
+var G__3615 = arguments.length;
+switch (G__3615) {
+case 1:
+return reagent.ratom.atom.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__4533__auto__ = [];
+var len__4518__auto___3620 = arguments.length;
+var i__4519__auto___3621 = (0);
+while(true){
+if((i__4519__auto___3621 < len__4518__auto___3620)){
+args_arr__4533__auto__.push((arguments[i__4519__auto___3621]));
+
+var G__3622 = (i__4519__auto___3621 + (1));
+i__4519__auto___3621 = G__3622;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4534__auto__ = (new cljs.core.IndexedSeq(args_arr__4533__auto__.slice((1)),(0),null));
+return reagent.ratom.atom.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4534__auto__);
+
+}
+});
+
+reagent.ratom.atom.cljs$core$IFn$_invoke$arity$1 = (function (x){
+return reagent.ratom.__GT_RAtom(x,null,null,null);
+});
+
+reagent.ratom.atom.cljs$core$IFn$_invoke$arity$variadic = (function (x,p__3616){
+var map__3617 = p__3616;
+var map__3617__$1 = ((((!((map__3617 == null)))?(((((map__3617.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3617.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3617):map__3617);
+var meta = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3617__$1,cljs.core.cst$kw$meta);
+var validator = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3617__$1,cljs.core.cst$kw$validator);
+return reagent.ratom.__GT_RAtom(x,meta,validator,null);
+});
+
+/** @this {Function} */
+reagent.ratom.atom.cljs$lang$applyTo = (function (seq3613){
+var G__3614 = cljs.core.first(seq3613);
+var seq3613__$1 = cljs.core.next(seq3613);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3614,seq3613__$1);
+});
+
+reagent.ratom.atom.cljs$lang$maxFixedArity = (1);
+
+reagent.ratom.cache_key = "reagReactionCache";
+reagent.ratom.cached_reaction = (function reagent$ratom$cached_reaction(f,o,k,obj,destroy){
+var m = (o["reagReactionCache"]);
+var m__$1 = (((m == null))?cljs.core.PersistentArrayMap.EMPTY:m);
+var r = (m__$1.cljs$core$IFn$_invoke$arity$2 ? m__$1.cljs$core$IFn$_invoke$arity$2(k,null) : m__$1.call(null,k,null));
+if(!((r == null))){
+return cljs.core._deref(r);
+} else {
+if((reagent.ratom._STAR_ratom_context_STAR_ == null)){
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+} else {
+var r__$1 = (function (){var G__3623 = f;
+var G__3624 = cljs.core.cst$kw$on_DASH_dispose;
+var G__3625 = ((function (G__3623,G__3624,m,m__$1,r){
+return (function (x){
+if(reagent.ratom.debug){
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(reagent.ratom._running,cljs.core.dec);
+} else {
+}
+
+var __3626 = (o["reagReactionCache"]);
+var __3627__$1 = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(__3626,k);
+(o["reagReactionCache"] = __3627__$1);
+
+if(!((obj == null))){
+obj.reaction = null;
+} else {
+}
+
+if(!((destroy == null))){
+return (destroy.cljs$core$IFn$_invoke$arity$1 ? destroy.cljs$core$IFn$_invoke$arity$1(x) : destroy.call(null,x));
+} else {
+return null;
+}
+});})(G__3623,G__3624,m,m__$1,r))
+;
+return (reagent.ratom.make_reaction.cljs$core$IFn$_invoke$arity$3 ? reagent.ratom.make_reaction.cljs$core$IFn$_invoke$arity$3(G__3623,G__3624,G__3625) : reagent.ratom.make_reaction.call(null,G__3623,G__3624,G__3625));
+})();
+var v = cljs.core._deref(r__$1);
+(o["reagReactionCache"] = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m__$1,k,r__$1));
+
+if(reagent.ratom.debug){
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(reagent.ratom._running,cljs.core.inc);
+} else {
+}
+
+if(!((obj == null))){
+obj.reaction = r__$1;
+} else {
+}
+
+return v;
+
+}
+}
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {reagent.ratom.IReactiveAtom}
+ * @implements {cljs.core.IDeref}
+ * @implements {cljs.core.IPrintWithWriter}
+*/
+reagent.ratom.Track = (function (f,args,reaction){
+this.f = f;
+this.args = args;
+this.reaction = reaction;
+this.cljs$lang$protocol_mask$partition0$ = 2153807872;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+reagent.ratom.Track.prototype.reagent$ratom$IReactiveAtom$ = cljs.core.PROTOCOL_SENTINEL;
+
+reagent.ratom.Track.prototype.cljs$core$IDeref$_deref$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var temp__5459__auto__ = self__.reaction;
+if((temp__5459__auto__ == null)){
+return reagent.ratom.cached_reaction(((function (temp__5459__auto__,this$__$1){
+return (function (){
+return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(self__.f,self__.args);
+});})(temp__5459__auto__,this$__$1))
+,self__.f,self__.args,this$__$1,null);
+} else {
+var r = temp__5459__auto__;
+return cljs.core._deref(r);
+}
+});
+
+reagent.ratom.Track.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+return (((other instanceof reagent.ratom.Track)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.f,other.f)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.args,other.args)));
+});
+
+reagent.ratom.Track.prototype.cljs$core$IHash$_hash$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.hash(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.f,self__.args], null));
+});
+
+reagent.ratom.Track.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,w,opts){
+var self__ = this;
+var a__$1 = this;
+return reagent.ratom.pr_atom(a__$1,w,opts,"Track:");
+});
+
+reagent.ratom.Track.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$f,cljs.core.cst$sym$args,cljs.core.with_meta(cljs.core.cst$sym$reaction,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+reagent.ratom.Track.cljs$lang$type = true;
+
+reagent.ratom.Track.cljs$lang$ctorStr = "reagent.ratom/Track";
+
+reagent.ratom.Track.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.ratom/Track");
+});
+
+/**
+ * Positional factory function for reagent.ratom/Track.
+ */
+reagent.ratom.__GT_Track = (function reagent$ratom$__GT_Track(f,args,reaction){
+return (new reagent.ratom.Track(f,args,reaction));
+});
+
+reagent.ratom.make_track = (function reagent$ratom$make_track(f,args){
+return (new reagent.ratom.Track(f,args,null));
+});
+reagent.ratom.make_track_BANG_ = (function reagent$ratom$make_track_BANG_(f,args){
+var t = reagent.ratom.make_track(f,args);
+var r = (function (){var G__3628 = ((function (t){
+return (function (){
+return cljs.core._deref(t);
+});})(t))
+;
+var G__3629 = cljs.core.cst$kw$auto_DASH_run;
+var G__3630 = true;
+return (reagent.ratom.make_reaction.cljs$core$IFn$_invoke$arity$3 ? reagent.ratom.make_reaction.cljs$core$IFn$_invoke$arity$3(G__3628,G__3629,G__3630) : reagent.ratom.make_reaction.call(null,G__3628,G__3629,G__3630));
+})();
+cljs.core.deref(r);
+
+return r;
+});
+reagent.ratom.track = (function reagent$ratom$track(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3633 = arguments.length;
+var i__4519__auto___3634 = (0);
+while(true){
+if((i__4519__auto___3634 < len__4518__auto___3633)){
+args__4521__auto__.push((arguments[i__4519__auto___3634]));
+
+var G__3635 = (i__4519__auto___3634 + (1));
+i__4519__auto___3634 = G__3635;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return reagent.ratom.track.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+reagent.ratom.track.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
+if(cljs.core.ifn_QMARK_(f)){
+} else {
+throw (new Error("Assert failed: (ifn? f)"));
+}
+
+return reagent.ratom.make_track(f,args);
+});
+
+reagent.ratom.track.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+reagent.ratom.track.cljs$lang$applyTo = (function (seq3631){
+var G__3632 = cljs.core.first(seq3631);
+var seq3631__$1 = cljs.core.next(seq3631);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3632,seq3631__$1);
+});
+
+reagent.ratom.track_BANG_ = (function reagent$ratom$track_BANG_(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3638 = arguments.length;
+var i__4519__auto___3639 = (0);
+while(true){
+if((i__4519__auto___3639 < len__4518__auto___3638)){
+args__4521__auto__.push((arguments[i__4519__auto___3639]));
+
+var G__3640 = (i__4519__auto___3639 + (1));
+i__4519__auto___3639 = G__3640;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return reagent.ratom.track_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+reagent.ratom.track_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
+if(cljs.core.ifn_QMARK_(f)){
+} else {
+throw (new Error("Assert failed: (ifn? f)"));
+}
+
+return reagent.ratom.make_track_BANG_(f,args);
+});
+
+reagent.ratom.track_BANG_.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+reagent.ratom.track_BANG_.cljs$lang$applyTo = (function (seq3636){
+var G__3637 = cljs.core.first(seq3636);
+var seq3636__$1 = cljs.core.next(seq3636);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3637,seq3636__$1);
+});
+
+
+/**
+* @constructor
+ * @implements {cljs.core.IWatchable}
+ * @implements {cljs.core.IAtom}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IReset}
+ * @implements {cljs.core.ISwap}
+ * @implements {reagent.ratom.IReactiveAtom}
+ * @implements {cljs.core.IDeref}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {reagent.ratom.Object}
+*/
+reagent.ratom.RCursor = (function (ratom,path,reaction,state,watches){
+this.ratom = ratom;
+this.path = path;
+this.reaction = reaction;
+this.state = state;
+this.watches = watches;
+this.cljs$lang$protocol_mask$partition0$ = 2153807872;
+this.cljs$lang$protocol_mask$partition1$ = 114690;
+});
+reagent.ratom.RCursor.prototype._peek = (function (){
+var self__ = this;
+var this$ = this;
+var _STAR_ratom_context_STAR_3641 = reagent.ratom._STAR_ratom_context_STAR_;
+reagent.ratom._STAR_ratom_context_STAR_ = null;
+
+try{return this$.cljs$core$IDeref$_deref$arity$1(null);
+}finally {reagent.ratom._STAR_ratom_context_STAR_ = _STAR_ratom_context_STAR_3641;
+}});
+
+reagent.ratom.RCursor.prototype._set_state = (function (oldstate,newstate){
+var self__ = this;
+var this$ = this;
+if((oldstate === newstate)){
+return null;
+} else {
+self__.state = newstate;
+
+if(!((self__.watches == null))){
+return reagent.ratom.notify_w(this$,oldstate,newstate);
+} else {
+return null;
+}
+}
+});
+
+reagent.ratom.RCursor.prototype.reagent$ratom$IReactiveAtom$ = cljs.core.PROTOCOL_SENTINEL;
+
+reagent.ratom.RCursor.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,w,opts){
+var self__ = this;
+var a__$1 = this;
+return reagent.ratom.pr_atom(a__$1,w,opts,["Cursor: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.path)].join(''));
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$IHash$_hash$arity$1 = (function (_){
+var self__ = this;
+var ___$1 = this;
+return cljs.core.hash(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.ratom,self__.path], null));
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+return (((other instanceof reagent.ratom.RCursor)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.path,other.path)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.ratom,other.ratom)));
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$IReset$_reset_BANG_$arity$2 = (function (this$,new_value){
+var self__ = this;
+var this$__$1 = this;
+var oldstate = self__.state;
+this$__$1._set_state(oldstate,new_value);
+
+if(((!((self__.ratom == null)))?(((((self__.ratom.cljs$lang$protocol_mask$partition0$ & (32768))) || ((cljs.core.PROTOCOL_SENTINEL === self__.ratom.cljs$core$IDeref$))))?true:(((!self__.ratom.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IDeref,self__.ratom):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IDeref,self__.ratom))){
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.path,cljs.core.PersistentVector.EMPTY)){
+cljs.core.reset_BANG_(self__.ratom,new_value);
+} else {
+cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(self__.ratom,cljs.core.assoc_in,self__.path,new_value);
+}
+} else {
+(self__.ratom.cljs$core$IFn$_invoke$arity$2 ? self__.ratom.cljs$core$IFn$_invoke$arity$2(self__.path,new_value) : self__.ratom.call(null,self__.path,new_value));
+}
+
+return new_value;
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$ISwap$_swap_BANG_$arity$2 = (function (a,f){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(function (){var G__3643 = a__$1._peek();
+return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__3643) : f.call(null,G__3643));
+})());
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$ISwap$_swap_BANG_$arity$3 = (function (a,f,x){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(function (){var G__3644 = a__$1._peek();
+var G__3645 = x;
+return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__3644,G__3645) : f.call(null,G__3644,G__3645));
+})());
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$ISwap$_swap_BANG_$arity$4 = (function (a,f,x,y){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(function (){var G__3646 = a__$1._peek();
+var G__3647 = x;
+var G__3648 = y;
+return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__3646,G__3647,G__3648) : f.call(null,G__3646,G__3647,G__3648));
+})());
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$ISwap$_swap_BANG_$arity$5 = (function (a,f,x,y,more){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,a__$1._peek(),x,y,more));
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$IWatchable$_notify_watches$arity$3 = (function (this$,old,new$){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.notify_w(this$__$1,old,new$);
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$IWatchable$_add_watch$arity$3 = (function (this$,key,f){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.add_w(this$__$1,key,f);
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$IWatchable$_remove_watch$arity$2 = (function (this$,key){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.remove_w(this$__$1,key);
+});
+
+reagent.ratom.RCursor.prototype.cljs$core$IDeref$_deref$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var oldstate = self__.state;
+var newstate = (function (){var temp__5459__auto__ = self__.reaction;
+if((temp__5459__auto__ == null)){
+var f = ((((!((self__.ratom == null)))?(((((self__.ratom.cljs$lang$protocol_mask$partition0$ & (32768))) || ((cljs.core.PROTOCOL_SENTINEL === self__.ratom.cljs$core$IDeref$))))?true:(((!self__.ratom.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IDeref,self__.ratom):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IDeref,self__.ratom)))?((function (temp__5459__auto__,oldstate,this$__$1){
+return (function (){
+return cljs.core.get_in.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(self__.ratom),self__.path);
+});})(temp__5459__auto__,oldstate,this$__$1))
+:((function (temp__5459__auto__,oldstate,this$__$1){
+return (function (){
+return (self__.ratom.cljs$core$IFn$_invoke$arity$1 ? self__.ratom.cljs$core$IFn$_invoke$arity$1(self__.path) : self__.ratom.call(null,self__.path));
+});})(temp__5459__auto__,oldstate,this$__$1))
+);
+return reagent.ratom.cached_reaction(f,self__.ratom,self__.path,this$__$1,null);
+} else {
+var r = temp__5459__auto__;
+return cljs.core._deref(r);
+}
+})();
+this$__$1._set_state(oldstate,newstate);
+
+return newstate;
+});
+
+reagent.ratom.RCursor.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$ratom,cljs.core.cst$sym$path,cljs.core.with_meta(cljs.core.cst$sym$reaction,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$state,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$watches,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+reagent.ratom.RCursor.cljs$lang$type = true;
+
+reagent.ratom.RCursor.cljs$lang$ctorStr = "reagent.ratom/RCursor";
+
+reagent.ratom.RCursor.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.ratom/RCursor");
+});
+
+/**
+ * Positional factory function for reagent.ratom/RCursor.
+ */
+reagent.ratom.__GT_RCursor = (function reagent$ratom$__GT_RCursor(ratom,path,reaction,state,watches){
+return (new reagent.ratom.RCursor(ratom,path,reaction,state,watches));
+});
+
+reagent.ratom.cursor = (function reagent$ratom$cursor(src,path){
+if((function (){var or__3936__auto__ = ((!((src == null)))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === src.reagent$ratom$IReactiveAtom$))))?true:(((!src.cljs$lang$protocol_mask$partition$))?cljs.core.native_satisfies_QMARK_(reagent.ratom.IReactiveAtom,src):false)):cljs.core.native_satisfies_QMARK_(reagent.ratom.IReactiveAtom,src));
+if(or__3936__auto__){
+return or__3936__auto__;
+} else {
+return ((cljs.core.ifn_QMARK_(src)) && (!(cljs.core.vector_QMARK_(src))));
+}
+})()){
+} else {
+throw (new Error(["Assert failed: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(["src must be a reactive atom or a function, not ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([src], 0)))].join('')),"\n","(or (satisfies? IReactiveAtom src) (and (ifn? src) (not (vector? src))))"].join('')));
+}
+
+return reagent.ratom.__GT_RCursor(src,path,null,null,null);
+});
+reagent.ratom.with_let_destroy = (function reagent$ratom$with_let_destroy(v){
+var temp__5461__auto__ = v.destroy;
+if((temp__5461__auto__ == null)){
+return null;
+} else {
+var f = temp__5461__auto__;
+return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
+}
+});
+reagent.ratom.with_let_values = (function reagent$ratom$with_let_values(key){
+var temp__5459__auto__ = reagent.ratom._STAR_ratom_context_STAR_;
+if((temp__5459__auto__ == null)){
+return [];
+} else {
+var c = temp__5459__auto__;
+return reagent.ratom.cached_reaction(cljs.core.array,c,key,null,reagent.ratom.with_let_destroy);
+}
+});
+
+/**
+ * @interface
+ */
+reagent.ratom.IDisposable = function(){};
+
+reagent.ratom.dispose_BANG_ = (function reagent$ratom$dispose_BANG_(this$){
+if(((!((this$ == null))) && (!((this$.reagent$ratom$IDisposable$dispose_BANG_$arity$1 == null))))){
+return this$.reagent$ratom$IDisposable$dispose_BANG_$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (reagent.ratom.dispose_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (reagent.ratom.dispose_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IDisposable.dispose!",this$);
+}
+}
+}
+});
+
+reagent.ratom.add_on_dispose_BANG_ = (function reagent$ratom$add_on_dispose_BANG_(this$,f){
+if(((!((this$ == null))) && (!((this$.reagent$ratom$IDisposable$add_on_dispose_BANG_$arity$2 == null))))){
+return this$.reagent$ratom$IDisposable$add_on_dispose_BANG_$arity$2(this$,f);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (reagent.ratom.add_on_dispose_BANG_[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$2(this$,f) : m__4231__auto__.call(null,this$,f));
+} else {
+var m__4231__auto____$1 = (reagent.ratom.add_on_dispose_BANG_["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,f) : m__4231__auto____$1.call(null,this$,f));
+} else {
+throw cljs.core.missing_protocol("IDisposable.add-on-dispose!",this$);
+}
+}
+}
+});
+
+
+/**
+ * @interface
+ */
+reagent.ratom.IRunnable = function(){};
+
+reagent.ratom.run = (function reagent$ratom$run(this$){
+if(((!((this$ == null))) && (!((this$.reagent$ratom$IRunnable$run$arity$1 == null))))){
+return this$.reagent$ratom$IRunnable$run$arity$1(this$);
+} else {
+var x__4230__auto__ = (((this$ == null))?null:this$);
+var m__4231__auto__ = (reagent.ratom.run[goog.typeOf(x__4230__auto__)]);
+if(!((m__4231__auto__ == null))){
+return (m__4231__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto__.call(null,this$));
+} else {
+var m__4231__auto____$1 = (reagent.ratom.run["_"]);
+if(!((m__4231__auto____$1 == null))){
+return (m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4231__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4231__auto____$1.call(null,this$));
+} else {
+throw cljs.core.missing_protocol("IRunnable.run",this$);
+}
+}
+}
+});
+
+reagent.ratom.handle_reaction_change = (function reagent$ratom$handle_reaction_change(this$,sender,old,new$){
+return this$._handle_change(sender,old,new$);
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IWatchable}
+ * @implements {cljs.core.IAtom}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IHash}
+ * @implements {cljs.core.IReset}
+ * @implements {cljs.core.ISwap}
+ * @implements {reagent.ratom.IReactiveAtom}
+ * @implements {reagent.ratom.IRunnable}
+ * @implements {reagent.ratom.IDisposable}
+ * @implements {cljs.core.IDeref}
+ * @implements {cljs.core.IPrintWithWriter}
+ * @implements {reagent.ratom.Object}
+*/
+reagent.ratom.Reaction = (function (f,state,dirty_QMARK_,nocache_QMARK_,watching,watches,auto_run,caught){
+this.f = f;
+this.state = state;
+this.dirty_QMARK_ = dirty_QMARK_;
+this.nocache_QMARK_ = nocache_QMARK_;
+this.watching = watching;
+this.watches = watches;
+this.auto_run = auto_run;
+this.caught = caught;
+this.cljs$lang$protocol_mask$partition0$ = 2153807872;
+this.cljs$lang$protocol_mask$partition1$ = 114690;
+});
+reagent.ratom.Reaction.prototype._peek_at = (function (){
+var self__ = this;
+var this$ = this;
+var _STAR_ratom_context_STAR_3652 = reagent.ratom._STAR_ratom_context_STAR_;
+reagent.ratom._STAR_ratom_context_STAR_ = null;
+
+try{return this$.cljs$core$IDeref$_deref$arity$1(null);
+}finally {reagent.ratom._STAR_ratom_context_STAR_ = _STAR_ratom_context_STAR_3652;
+}});
+
+reagent.ratom.Reaction.prototype._handle_change = (function (sender,oldval,newval){
+var self__ = this;
+var this$ = this;
+if((((oldval === newval)) || (self__.dirty_QMARK_))){
+return null;
+} else {
+if((self__.auto_run == null)){
+self__.dirty_QMARK_ = true;
+
+return reagent.ratom.rea_enqueue(this$);
+} else {
+if(self__.auto_run === true){
+return this$._run(false);
+} else {
+return (self__.auto_run.cljs$core$IFn$_invoke$arity$1 ? self__.auto_run.cljs$core$IFn$_invoke$arity$1(this$) : self__.auto_run.call(null,this$));
+}
+}
+}
+});
+
+reagent.ratom.Reaction.prototype._update_watching = (function (derefed){
+var self__ = this;
+var this$ = this;
+var new$ = cljs.core.set(derefed);
+var old = cljs.core.set(self__.watching);
+self__.watching = derefed;
+
+var seq__3653_3676 = cljs.core.seq(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(new$,old));
+var chunk__3654_3677 = null;
+var count__3655_3678 = (0);
+var i__3656_3679 = (0);
+while(true){
+if((i__3656_3679 < count__3655_3678)){
+var w_3680 = chunk__3654_3677.cljs$core$IIndexed$_nth$arity$2(null,i__3656_3679);
+cljs.core._add_watch(w_3680,this$,reagent.ratom.handle_reaction_change);
+
+
+var G__3681 = seq__3653_3676;
+var G__3682 = chunk__3654_3677;
+var G__3683 = count__3655_3678;
+var G__3684 = (i__3656_3679 + (1));
+seq__3653_3676 = G__3681;
+chunk__3654_3677 = G__3682;
+count__3655_3678 = G__3683;
+i__3656_3679 = G__3684;
+continue;
+} else {
+var temp__5457__auto___3685 = cljs.core.seq(seq__3653_3676);
+if(temp__5457__auto___3685){
+var seq__3653_3686__$1 = temp__5457__auto___3685;
+if(cljs.core.chunked_seq_QMARK_(seq__3653_3686__$1)){
+var c__4338__auto___3687 = cljs.core.chunk_first(seq__3653_3686__$1);
+var G__3688 = cljs.core.chunk_rest(seq__3653_3686__$1);
+var G__3689 = c__4338__auto___3687;
+var G__3690 = cljs.core.count(c__4338__auto___3687);
+var G__3691 = (0);
+seq__3653_3676 = G__3688;
+chunk__3654_3677 = G__3689;
+count__3655_3678 = G__3690;
+i__3656_3679 = G__3691;
+continue;
+} else {
+var w_3692 = cljs.core.first(seq__3653_3686__$1);
+cljs.core._add_watch(w_3692,this$,reagent.ratom.handle_reaction_change);
+
+
+var G__3693 = cljs.core.next(seq__3653_3686__$1);
+var G__3694 = null;
+var G__3695 = (0);
+var G__3696 = (0);
+seq__3653_3676 = G__3693;
+chunk__3654_3677 = G__3694;
+count__3655_3678 = G__3695;
+i__3656_3679 = G__3696;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+var seq__3657 = cljs.core.seq(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(old,new$));
+var chunk__3658 = null;
+var count__3659 = (0);
+var i__3660 = (0);
+while(true){
+if((i__3660 < count__3659)){
+var w = chunk__3658.cljs$core$IIndexed$_nth$arity$2(null,i__3660);
+cljs.core._remove_watch(w,this$);
+
+
+var G__3697 = seq__3657;
+var G__3698 = chunk__3658;
+var G__3699 = count__3659;
+var G__3700 = (i__3660 + (1));
+seq__3657 = G__3697;
+chunk__3658 = G__3698;
+count__3659 = G__3699;
+i__3660 = G__3700;
+continue;
+} else {
+var temp__5457__auto__ = cljs.core.seq(seq__3657);
+if(temp__5457__auto__){
+var seq__3657__$1 = temp__5457__auto__;
+if(cljs.core.chunked_seq_QMARK_(seq__3657__$1)){
+var c__4338__auto__ = cljs.core.chunk_first(seq__3657__$1);
+var G__3701 = cljs.core.chunk_rest(seq__3657__$1);
+var G__3702 = c__4338__auto__;
+var G__3703 = cljs.core.count(c__4338__auto__);
+var G__3704 = (0);
+seq__3657 = G__3701;
+chunk__3658 = G__3702;
+count__3659 = G__3703;
+i__3660 = G__3704;
+continue;
+} else {
+var w = cljs.core.first(seq__3657__$1);
+cljs.core._remove_watch(w,this$);
+
+
+var G__3705 = cljs.core.next(seq__3657__$1);
+var G__3706 = null;
+var G__3707 = (0);
+var G__3708 = (0);
+seq__3657 = G__3705;
+chunk__3658 = G__3706;
+count__3659 = G__3707;
+i__3660 = G__3708;
+continue;
+}
+} else {
+return null;
+}
+}
+break;
+}
+});
+
+reagent.ratom.Reaction.prototype._queued_run = (function (){
+var self__ = this;
+var this$ = this;
+if(((self__.dirty_QMARK_) && (!((self__.watching == null))))){
+return this$._run(true);
+} else {
+return null;
+}
+});
+
+reagent.ratom.Reaction.prototype._try_capture = (function (f__$1){
+var self__ = this;
+var this$ = this;
+try{self__.caught = null;
+
+return reagent.ratom.deref_capture(f__$1,this$);
+}catch (e3661){var e = e3661;
+self__.state = e;
+
+self__.caught = e;
+
+return self__.dirty_QMARK_ = false;
+}});
+
+reagent.ratom.Reaction.prototype._run = (function (check){
+var self__ = this;
+var this$ = this;
+var oldstate = self__.state;
+var res = (cljs.core.truth_(check)?this$._try_capture(self__.f):reagent.ratom.deref_capture(self__.f,this$));
+if(self__.nocache_QMARK_){
+} else {
+self__.state = res;
+
+if((((self__.watches == null)) || (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(oldstate,res)))){
+} else {
+reagent.ratom.notify_w(this$,oldstate,res);
+}
+}
+
+return res;
+});
+
+reagent.ratom.Reaction.prototype._set_opts = (function (p__3662){
+var self__ = this;
+var map__3663 = p__3662;
+var map__3663__$1 = ((((!((map__3663 == null)))?(((((map__3663.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3663.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3663):map__3663);
+var auto_run__$1 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3663__$1,cljs.core.cst$kw$auto_DASH_run);
+var on_set = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3663__$1,cljs.core.cst$kw$on_DASH_set);
+var on_dispose = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3663__$1,cljs.core.cst$kw$on_DASH_dispose);
+var no_cache = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3663__$1,cljs.core.cst$kw$no_DASH_cache);
+var this$ = this;
+if(!((auto_run__$1 == null))){
+this$.auto_run = auto_run__$1;
+} else {
+}
+
+if(!((on_set == null))){
+this$.on_set = on_set;
+} else {
+}
+
+if(!((on_dispose == null))){
+this$.on_dispose = on_dispose;
+} else {
+}
+
+if(!((no_cache == null))){
+return this$.nocache_QMARK_ = no_cache;
+} else {
+return null;
+}
+});
+
+reagent.ratom.Reaction.prototype.reagent$ratom$IReactiveAtom$ = cljs.core.PROTOCOL_SENTINEL;
+
+reagent.ratom.Reaction.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,w,opts){
+var self__ = this;
+var a__$1 = this;
+return reagent.ratom.pr_atom(a__$1,w,opts,["Reaction ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.hash(a__$1)),":"].join(''));
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+return goog.getUid(this$__$1);
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
+var self__ = this;
+var o__$1 = this;
+return (o__$1 === other);
+});
+
+reagent.ratom.Reaction.prototype.reagent$ratom$IDisposable$ = cljs.core.PROTOCOL_SENTINEL;
+
+reagent.ratom.Reaction.prototype.reagent$ratom$IDisposable$dispose_BANG_$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var s = self__.state;
+var wg = self__.watching;
+self__.watching = null;
+
+self__.state = null;
+
+self__.auto_run = null;
+
+self__.dirty_QMARK_ = true;
+
+var seq__3665_3709 = cljs.core.seq(cljs.core.set(wg));
+var chunk__3666_3710 = null;
+var count__3667_3711 = (0);
+var i__3668_3712 = (0);
+while(true){
+if((i__3668_3712 < count__3667_3711)){
+var w_3713 = chunk__3666_3710.cljs$core$IIndexed$_nth$arity$2(null,i__3668_3712);
+cljs.core._remove_watch(w_3713,this$__$1);
+
+
+var G__3714 = seq__3665_3709;
+var G__3715 = chunk__3666_3710;
+var G__3716 = count__3667_3711;
+var G__3717 = (i__3668_3712 + (1));
+seq__3665_3709 = G__3714;
+chunk__3666_3710 = G__3715;
+count__3667_3711 = G__3716;
+i__3668_3712 = G__3717;
+continue;
+} else {
+var temp__5457__auto___3718 = cljs.core.seq(seq__3665_3709);
+if(temp__5457__auto___3718){
+var seq__3665_3719__$1 = temp__5457__auto___3718;
+if(cljs.core.chunked_seq_QMARK_(seq__3665_3719__$1)){
+var c__4338__auto___3720 = cljs.core.chunk_first(seq__3665_3719__$1);
+var G__3721 = cljs.core.chunk_rest(seq__3665_3719__$1);
+var G__3722 = c__4338__auto___3720;
+var G__3723 = cljs.core.count(c__4338__auto___3720);
+var G__3724 = (0);
+seq__3665_3709 = G__3721;
+chunk__3666_3710 = G__3722;
+count__3667_3711 = G__3723;
+i__3668_3712 = G__3724;
+continue;
+} else {
+var w_3725 = cljs.core.first(seq__3665_3719__$1);
+cljs.core._remove_watch(w_3725,this$__$1);
+
+
+var G__3726 = cljs.core.next(seq__3665_3719__$1);
+var G__3727 = null;
+var G__3728 = (0);
+var G__3729 = (0);
+seq__3665_3709 = G__3726;
+chunk__3666_3710 = G__3727;
+count__3667_3711 = G__3728;
+i__3668_3712 = G__3729;
+continue;
+}
+} else {
+}
+}
+break;
+}
+
+if(!((this$__$1.on_dispose == null))){
+this$__$1.on_dispose(s);
+} else {
+}
+
+var temp__5461__auto__ = this$__$1.on_dispose_arr;
+if((temp__5461__auto__ == null)){
+return null;
+} else {
+var a = temp__5461__auto__;
+var n__4395__auto__ = a.length;
+var i = (0);
+while(true){
+if((i < n__4395__auto__)){
+var fexpr__3669_3730 = (a[i]);
+(fexpr__3669_3730.cljs$core$IFn$_invoke$arity$1 ? fexpr__3669_3730.cljs$core$IFn$_invoke$arity$1(this$__$1) : fexpr__3669_3730.call(null,this$__$1));
+
+var G__3731 = (i + (1));
+i = G__3731;
+continue;
+} else {
+return null;
+}
+break;
+}
+}
+});
+
+reagent.ratom.Reaction.prototype.reagent$ratom$IDisposable$add_on_dispose_BANG_$arity$2 = (function (this$,f__$1){
+var self__ = this;
+var this$__$1 = this;
+var temp__5459__auto__ = this$__$1.on_dispose_arr;
+if((temp__5459__auto__ == null)){
+return this$__$1.on_dispose_arr = [f__$1];
+} else {
+var a = temp__5459__auto__;
+return a.push(f__$1);
+}
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$IReset$_reset_BANG_$arity$2 = (function (a,newval){
+var self__ = this;
+var a__$1 = this;
+if(cljs.core.fn_QMARK_(a__$1.on_set)){
+} else {
+throw (new Error(["Assert failed: ","Reaction is read only; on-set is not allowed","\n","(fn? (.-on-set a))"].join('')));
+}
+
+var oldval = self__.state;
+self__.state = newval;
+
+a__$1.on_set(oldval,newval);
+
+reagent.ratom.notify_w(a__$1,oldval,newval);
+
+return newval;
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$ISwap$_swap_BANG_$arity$2 = (function (a,f__$1){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(function (){var G__3670 = a__$1._peek_at();
+return (f__$1.cljs$core$IFn$_invoke$arity$1 ? f__$1.cljs$core$IFn$_invoke$arity$1(G__3670) : f__$1.call(null,G__3670));
+})());
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$ISwap$_swap_BANG_$arity$3 = (function (a,f__$1,x){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(function (){var G__3671 = a__$1._peek_at();
+var G__3672 = x;
+return (f__$1.cljs$core$IFn$_invoke$arity$2 ? f__$1.cljs$core$IFn$_invoke$arity$2(G__3671,G__3672) : f__$1.call(null,G__3671,G__3672));
+})());
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$ISwap$_swap_BANG_$arity$4 = (function (a,f__$1,x,y){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(function (){var G__3673 = a__$1._peek_at();
+var G__3674 = x;
+var G__3675 = y;
+return (f__$1.cljs$core$IFn$_invoke$arity$3 ? f__$1.cljs$core$IFn$_invoke$arity$3(G__3673,G__3674,G__3675) : f__$1.call(null,G__3673,G__3674,G__3675));
+})());
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$ISwap$_swap_BANG_$arity$5 = (function (a,f__$1,x,y,more){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f__$1,a__$1._peek_at(),x,y,more));
+});
+
+reagent.ratom.Reaction.prototype.reagent$ratom$IRunnable$ = cljs.core.PROTOCOL_SENTINEL;
+
+reagent.ratom.Reaction.prototype.reagent$ratom$IRunnable$run$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+reagent.ratom.flush_BANG_();
+
+return this$__$1._run(false);
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$IWatchable$_notify_watches$arity$3 = (function (this$,old,new$){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.notify_w(this$__$1,old,new$);
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$IWatchable$_add_watch$arity$3 = (function (this$,key,f__$1){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.add_w(this$__$1,key,f__$1);
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$IWatchable$_remove_watch$arity$2 = (function (this$,key){
+var self__ = this;
+var this$__$1 = this;
+var was_empty = cljs.core.empty_QMARK_(self__.watches);
+reagent.ratom.remove_w(this$__$1,key);
+
+if(((!(was_empty)) && (cljs.core.empty_QMARK_(self__.watches)) && ((self__.auto_run == null)))){
+return this$__$1.reagent$ratom$IDisposable$dispose_BANG_$arity$1(null);
+} else {
+return null;
+}
+});
+
+reagent.ratom.Reaction.prototype.cljs$core$IDeref$_deref$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+var temp__5461__auto___3732 = self__.caught;
+if((temp__5461__auto___3732 == null)){
+} else {
+var e_3733 = temp__5461__auto___3732;
+throw e_3733;
+}
+
+var non_reactive_3734 = (reagent.ratom._STAR_ratom_context_STAR_ == null);
+if(non_reactive_3734){
+reagent.ratom.flush_BANG_();
+} else {
+}
+
+if(((non_reactive_3734) && ((self__.auto_run == null)))){
+if(self__.dirty_QMARK_){
+var oldstate_3735 = self__.state;
+self__.state = (self__.f.cljs$core$IFn$_invoke$arity$0 ? self__.f.cljs$core$IFn$_invoke$arity$0() : self__.f.call(null));
+
+if((((self__.watches == null)) || (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(oldstate_3735,self__.state)))){
+} else {
+reagent.ratom.notify_w(this$__$1,oldstate_3735,self__.state);
+}
+} else {
+}
+} else {
+reagent.ratom.notify_deref_watcher_BANG_(this$__$1);
+
+if(self__.dirty_QMARK_){
+this$__$1._run(false);
+} else {
+}
+}
+
+return self__.state;
+});
+
+reagent.ratom.Reaction.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 8, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$f,cljs.core.with_meta(cljs.core.cst$sym$state,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$dirty_QMARK_,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean,cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$nocache_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean], null)),cljs.core.with_meta(cljs.core.cst$sym$watching,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$watches,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$auto_DASH_run,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$caught,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+reagent.ratom.Reaction.cljs$lang$type = true;
+
+reagent.ratom.Reaction.cljs$lang$ctorStr = "reagent.ratom/Reaction";
+
+reagent.ratom.Reaction.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.ratom/Reaction");
+});
+
+/**
+ * Positional factory function for reagent.ratom/Reaction.
+ */
+reagent.ratom.__GT_Reaction = (function reagent$ratom$__GT_Reaction(f,state,dirty_QMARK_,nocache_QMARK_,watching,watches,auto_run,caught){
+return (new reagent.ratom.Reaction(f,state,dirty_QMARK_,nocache_QMARK_,watching,watches,auto_run,caught));
+});
+
+reagent.ratom.make_reaction = (function reagent$ratom$make_reaction(var_args){
+var args__4521__auto__ = [];
+var len__4518__auto___3741 = arguments.length;
+var i__4519__auto___3742 = (0);
+while(true){
+if((i__4519__auto___3742 < len__4518__auto___3741)){
+args__4521__auto__.push((arguments[i__4519__auto___3742]));
+
+var G__3743 = (i__4519__auto___3742 + (1));
+i__4519__auto___3742 = G__3743;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__4522__auto__ = ((((1) < args__4521__auto__.length))?(new cljs.core.IndexedSeq(args__4521__auto__.slice((1)),(0),null)):null);
+return reagent.ratom.make_reaction.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4522__auto__);
+});
+
+reagent.ratom.make_reaction.cljs$core$IFn$_invoke$arity$variadic = (function (f,p__3738){
+var map__3739 = p__3738;
+var map__3739__$1 = ((((!((map__3739 == null)))?(((((map__3739.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3739.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3739):map__3739);
+var auto_run = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3739__$1,cljs.core.cst$kw$auto_DASH_run);
+var on_set = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3739__$1,cljs.core.cst$kw$on_DASH_set);
+var on_dispose = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3739__$1,cljs.core.cst$kw$on_DASH_dispose);
+var reaction = reagent.ratom.__GT_Reaction(f,null,true,false,null,null,null,null);
+reaction._set_opts(new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$auto_DASH_run,auto_run,cljs.core.cst$kw$on_DASH_set,on_set,cljs.core.cst$kw$on_DASH_dispose,on_dispose], null));
+
+return reaction;
+});
+
+reagent.ratom.make_reaction.cljs$lang$maxFixedArity = (1);
+
+/** @this {Function} */
+reagent.ratom.make_reaction.cljs$lang$applyTo = (function (seq3736){
+var G__3737 = cljs.core.first(seq3736);
+var seq3736__$1 = cljs.core.next(seq3736);
+var self__4505__auto__ = this;
+return self__4505__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3737,seq3736__$1);
+});
+
+reagent.ratom.temp_reaction = reagent.ratom.make_reaction(null);
+reagent.ratom.run_in_reaction = (function reagent$ratom$run_in_reaction(f,obj,key,run,opts){
+var r = reagent.ratom.temp_reaction;
+var res = reagent.ratom.deref_capture(f,r);
+if((r.watching == null)){
+} else {
+reagent.ratom.temp_reaction = reagent.ratom.make_reaction(null);
+
+r._set_opts(opts);
+
+r.f = f;
+
+r.auto_run = ((function (r,res){
+return (function (){
+return (run.cljs$core$IFn$_invoke$arity$1 ? run.cljs$core$IFn$_invoke$arity$1(obj) : run.call(null,obj));
+});})(r,res))
+;
+
+(obj[key] = r);
+}
+
+return res;
+});
+reagent.ratom.check_derefs = (function reagent$ratom$check_derefs(f){
+var ctx = {};
+var res = reagent.ratom.in_context(ctx,f);
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [res,!((ctx.captured == null))], null);
+});
+
+/**
+* @constructor
+ * @implements {cljs.core.IWatchable}
+ * @implements {cljs.core.IAtom}
+ * @implements {cljs.core.IEquiv}
+ * @implements {cljs.core.IReset}
+ * @implements {cljs.core.ISwap}
+ * @implements {cljs.core.IDeref}
+ * @implements {cljs.core.IPrintWithWriter}
+*/
+reagent.ratom.Wrapper = (function (state,callback,changed,watches){
+this.state = state;
+this.callback = callback;
+this.changed = changed;
+this.watches = watches;
+this.cljs$lang$protocol_mask$partition1$ = 114690;
+this.cljs$lang$protocol_mask$partition0$ = 2149613568;
+});
+reagent.ratom.Wrapper.prototype.cljs$core$IDeref$_deref$arity$1 = (function (this$){
+var self__ = this;
+var this$__$1 = this;
+if(((self__.changed) && (!((reagent.ratom._STAR_ratom_context_STAR_ == null))))){
+if(cljs.core.truth_(reagent.debug.has_console)){
+(cljs.core.truth_(reagent.debug.tracking)?reagent.debug.track_console:console).warn(["Warning: ","derefing stale wrap: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([this$__$1], 0)))].join(''));
+} else {
+}
+} else {
+}
+
+
+return self__.state;
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$IReset$_reset_BANG_$arity$2 = (function (this$,newval){
+var self__ = this;
+var this$__$1 = this;
+var oldval = self__.state;
+self__.changed = true;
+
+self__.state = newval;
+
+if(!((self__.watches == null))){
+reagent.ratom.notify_w(this$__$1,oldval,newval);
+} else {
+}
+
+(self__.callback.cljs$core$IFn$_invoke$arity$1 ? self__.callback.cljs$core$IFn$_invoke$arity$1(newval) : self__.callback.call(null,newval));
+
+return newval;
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$ISwap$_swap_BANG_$arity$2 = (function (a,f){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(self__.state) : f.call(null,self__.state)));
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$ISwap$_swap_BANG_$arity$3 = (function (a,f,x){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(self__.state,x) : f.call(null,self__.state,x)));
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$ISwap$_swap_BANG_$arity$4 = (function (a,f,x,y){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(self__.state,x,y) : f.call(null,self__.state,x,y)));
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$ISwap$_swap_BANG_$arity$5 = (function (a,f,x,y,more){
+var self__ = this;
+var a__$1 = this;
+return a__$1.cljs$core$IReset$_reset_BANG_$arity$2(null,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,self__.state,x,y,more));
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
+var self__ = this;
+var ___$1 = this;
+return (((other instanceof reagent.ratom.Wrapper)) && (!(self__.changed)) && (cljs.core.not(other.changed)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.state,other.state)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.callback,other.callback)));
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$IWatchable$_notify_watches$arity$3 = (function (this$,old,new$){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.notify_w(this$__$1,old,new$);
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$IWatchable$_add_watch$arity$3 = (function (this$,key,f){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.add_w(this$__$1,key,f);
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$IWatchable$_remove_watch$arity$2 = (function (this$,key){
+var self__ = this;
+var this$__$1 = this;
+return reagent.ratom.remove_w(this$__$1,key);
+});
+
+reagent.ratom.Wrapper.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,w,opts){
+var self__ = this;
+var a__$1 = this;
+return reagent.ratom.pr_atom(a__$1,w,opts,"Wrap:");
+});
+
+reagent.ratom.Wrapper.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$state,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$callback,cljs.core.with_meta(cljs.core.cst$sym$changed,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean,cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$watches,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
+});
+
+reagent.ratom.Wrapper.cljs$lang$type = true;
+
+reagent.ratom.Wrapper.cljs$lang$ctorStr = "reagent.ratom/Wrapper";
+
+reagent.ratom.Wrapper.cljs$lang$ctorPrWriter = (function (this__4179__auto__,writer__4180__auto__,opt__4181__auto__){
+return cljs.core._write(writer__4180__auto__,"reagent.ratom/Wrapper");
+});
+
+/**
+ * Positional factory function for reagent.ratom/Wrapper.
+ */
+reagent.ratom.__GT_Wrapper = (function reagent$ratom$__GT_Wrapper(state,callback,changed,watches){
+return (new reagent.ratom.Wrapper(state,callback,changed,watches));
+});
+
+reagent.ratom.make_wrapper = (function reagent$ratom$make_wrapper(value,callback_fn,args){
+return reagent.ratom.__GT_Wrapper(value,reagent.impl.util.make_partial_fn(callback_fn,args),false,null);
+});
diff --git a/sitemap.xml b/sitemap.xml
index ebea872..29e2fae 100644
--- a/sitemap.xml
+++ b/sitemap.xml
@@ -3,6 +3,12 @@
 <url> <loc>https://status-im.github.io/help.html</loc> <changefreq>weekly</changefreq> <priority>0.5</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/en/help.html" /> </url>
 <url> <loc>https://status-im.github.io/index.html</loc> <changefreq>weekly</changefreq> <priority>0.5</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/en/index.html" /> </url>
 <url> <loc>https://status-im.github.io/todo.html</loc> <changefreq>weekly</changefreq> <priority>0.5</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/en/todo.html" /> </url>
+<url> <loc>https://status-im.github.io/docs/concepts/Anatomy.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/concepts/Anatomy.html" /> </url>
+<url> <loc>https://status-im.github.io/docs/concepts/Hook.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/concepts/Hook.html" /> </url>
+<url> <loc>https://status-im.github.io/docs/concepts/Reference.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/concepts/Reference.html" /> </url>
+<url> <loc>https://status-im.github.io/docs/concepts/Registry.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/concepts/Registry.html" /> </url>
+<url> <loc>https://status-im.github.io/docs/concepts/Type.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/concepts/Type.html" /> </url>
+<url> <loc>https://status-im.github.io/docs/concepts/View.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/concepts/View.html" /> </url>
 <url> <loc>https://status-im.github.io/docs/Contributing.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/Contributing.html" /> </url>
 <url> <loc>https://status-im.github.io/docs/decisions/0001-record-decisions.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/decisions/0001-record-decisions.html" /> </url>
 <url> <loc>https://status-im.github.io/docs/decisions/0002-reader-errors.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/decisions/0002-reader-errors.html" /> </url>
@@ -10,11 +16,7 @@
 <url> <loc>https://status-im.github.io/docs/decisions/templates/template.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/decisions/templates/template.html" /> </url>
 <url> <loc>https://status-im.github.io/docs/Development.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/Development.html" /> </url>
 <url> <loc>https://status-im.github.io/docs/Examples.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/Examples.html" /> </url>
-<url> <loc>https://status-im.github.io/docs/format/Hook.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/format/Hook.html" /> </url>
-<url> <loc>https://status-im.github.io/docs/format/Reference.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/format/Reference.html" /> </url>
-<url> <loc>https://status-im.github.io/docs/format/Registry.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/format/Registry.html" /> </url>
-<url> <loc>https://status-im.github.io/docs/format/Type.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/format/Type.html" /> </url>
-<url> <loc>https://status-im.github.io/docs/format/View.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/format/View.html" /> </url>
 <url> <loc>https://status-im.github.io/docs/Manifesto.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/Manifesto.html" /> </url>
+<url> <loc>https://status-im.github.io/docs/Roadmap.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/Roadmap.html" /> </url>
 <url> <loc>https://status-im.github.io/docs/Tutorial.html</loc> <changefreq>hourly</changefreq> <priority>1.0</priority> <xhtml:link rel="alternate" hreflang="en" href="https://status-im.github.io/docs/Tutorial.html" /> </url>
 </urlset>
\ No newline at end of file