[
{
"path": ".gitignore",
"content": ".nrepl-port\ntarget\nelm/ModuleBrowser/elm-stuff\nelm/ModuleBrowser/elm.js\nDocPreview/elm-stuff\nDocPreview/elm.js\n"
},
{
"path": "DocPreview/DocPreview.elm",
"content": "module DocPreview (..) where\n\n\nimport Html exposing (Html, text, div, span, h1)\nimport Html.Attributes exposing (class)\nimport StartApp\nimport Effects exposing (Effects, Never)\nimport Docs.Package\nimport Docs.Entry\nimport String\nimport Regex\nimport Dict\nimport Json.Decode as Dec\nimport Utils.Markdown as Markdown\nimport Parse.Type\nimport Docs.Type\nimport Docs.Name\nimport Set\n\n\ntype alias Model =\n { selModule : Maybe Docs.Package.Module\n , package : Docs.Package.Package }\n\n\ninit : (Model, Effects Action)\ninit =\n (Model Nothing Dict.empty, Effects.none)\n\n\n\ntype Action\n = NoOp\n | RefreshModules String\n | SelectModule String\n\n\nupdate : Action -> Model -> ( Model, Effects Action )\nupdate action model =\n case action of\n NoOp ->\n ( model, Effects.none )\n\n RefreshModules rawModules ->\n let\n res =\n Dec.decodeString Docs.Package.decodePackage rawModules\n in\n case res of\n Result.Err v ->\n Debug.crash \"Error decoding package docs\"\n\n Result.Ok r ->\n ( { model | package = r\n , selModule = Dict.values r |> List.head\n }\n , Effects.none\n )\n\n SelectModule name ->\n ( { model | selModule = Dict.get name model.package }\n , Effects.none\n )\n\n\n\n\n-- View module docs\n\nview : Signal.Address Action -> Model -> Html\nview address model =\n case model.selModule of\n Nothing ->\n div [] [text \"NO SELECTED MODULE - Maybe you forgot to add your module to the `exposed-modules` entry in elm-package.json ?\"]\n Just mod ->\n let\n chunks = toChunks mod\n --nameDict = toNameDict model.package\n --newChunks = List.map (chunkMap stringToType) chunks\n in\n div [ class \"entry-list\" ] <|\n h1 [class \"entry-list-title\"] [text mod.name]\n :: List.map (viewChunk Docs.Entry.stringView) chunks\n --:: List.map (viewChunk (Docs.Entry.typeView nameDict)) newChunks\n\n\nviewChunk : (Docs.Entry.Model tipe -> Html) -> Chunk tipe -> Html\nviewChunk entryView chunk =\n case chunk of\n Markdown md ->\n span [class \"markdown-entry\"] [ Markdown.block md ]\n\n Entry entry ->\n entryView entry\n\n\ntype Chunk tipe\n = Markdown String\n | Entry (Docs.Entry.Model tipe)\n\n\ntoNameDict : Docs.Package.Package -> Docs.Name.Dictionary\ntoNameDict pkg =\n Dict.map (\\_ modul -> Set.fromList (Dict.keys modul.entries)) pkg\n\n\n\nchunkMap : (a -> b) -> Chunk a -> Chunk b\nchunkMap func chunk =\n case chunk of\n Markdown md ->\n Markdown md\n\n Entry entry ->\n Entry (Docs.Entry.map func entry)\n\n\n\n-- parsing fails for some reason when in LT (native issue ?)\nstringToType : String -> Docs.Type.Type\nstringToType str =\n let\n _ = Debug.log \"String to type for:\" str\n in\n case Parse.Type.parse str of\n Ok tipe ->\n let\n _ = Debug.log \"type after parse: \" tipe\n in\n tipe\n\n Err err ->\n let\n _ = Debug.log \"Shit while parsing\" err\n in\n Docs.Type.Var str\n\n\ntoChunks : Docs.Package.Module -> List (Chunk String)\ntoChunks moduleDocs =\n case String.split \"\\n@docs \" moduleDocs.comment of\n [] ->\n Debug.crash \"Expecting some documented functions in this module!\"\n\n firstChunk :: rest ->\n Markdown firstChunk\n :: List.concatMap (subChunks moduleDocs) rest\n\n\nsubChunks : Docs.Package.Module -> String -> List (Chunk String)\nsubChunks moduleDocs postDocs =\n subChunksHelp moduleDocs (String.split \",\" postDocs)\n\n\nsubChunksHelp : Docs.Package.Module -> List String -> List (Chunk String)\nsubChunksHelp moduleDocs parts =\n case parts of\n [] ->\n []\n\n rawPart :: remainingParts ->\n let\n part =\n String.trim rawPart\n in\n case isValue part of\n Just valueName ->\n toEntry moduleDocs valueName\n :: subChunksHelp moduleDocs remainingParts\n\n Nothing ->\n let\n trimmedPart =\n String.trimLeft rawPart\n in\n case String.words trimmedPart of\n [] ->\n [ Markdown (String.join \",\" parts) ]\n\n token :: _ ->\n case isValue token of\n Just valueName ->\n [ toEntry moduleDocs valueName\n , Markdown (String.dropLeft (String.length token) trimmedPart)\n ]\n\n Nothing ->\n [ Markdown (String.join \",\" parts) ]\n\nvar : Regex.Regex\nvar =\n Regex.regex \"^[a-zA-Z0-9_']+$\"\n\n\noperator : Regex.Regex\noperator =\n Regex.regex \"^\\\\([^a-zA-Z0-9]+\\\\)$\"\n\n\nisValue : String -> Maybe String\nisValue str =\n if Regex.contains var str then\n Just str\n\n else if Regex.contains operator str then\n Just (String.dropLeft 1 (String.dropRight 1 str))\n\n else\n Nothing\n\n\ntoEntry : Docs.Package.Module -> String -> Chunk String\ntoEntry moduleDocs name =\n case Dict.get name moduleDocs.entries of\n Nothing ->\n Debug.crash (\"docs have been corrupted, could not find \" ++ name)\n\n Just entry ->\n Entry entry\n\n\n-- START-APP WIRING\n\n\napp : StartApp.App Model\napp =\n StartApp.start\n { init = init\n , update = update\n , view = view\n , inputs = [ modulesSignal, selectModuleSignal ]\n }\n\n\nmain : Signal Html\nmain =\n app.html\n\n\n-- Inbound\n\nmodulesSignal : Signal Action\nmodulesSignal =\n Signal.map RefreshModules modules\n\n\nport modules : Signal String\n\n\nselectModuleSignal : Signal Action\nselectModuleSignal =\n Signal.map SelectModule selectModule\n\n\nport selectModule : Signal String\n"
},
{
"path": "DocPreview/DocPreview.html",
"content": "\n\n \n \n \n \n \n \n \n \n\n\n\n\n \n\n \n \n \n Here we go docpreview\n
\n\n\n \n \n\n\n\n \n\n \n\n"
},
{
"path": "DocPreview/LICENSE",
"content": "Copyright (c) 2014, Evan Czaplicki\n\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n\n * Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following\n disclaimer in the documentation and/or other materials provided\n with the distribution.\n\n * Neither the name of Evan Czaplicki nor the names of other\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n"
},
{
"path": "DocPreview/docPreview.js",
"content": "var Elm = Elm || { Native: {} };\nElm.Native.Array = {};\nElm.Native.Array.make = function(localRuntime) {\n\n\tlocalRuntime.Native = localRuntime.Native || {};\n\tlocalRuntime.Native.Array = localRuntime.Native.Array || {};\n\tif (localRuntime.Native.Array.values)\n\t{\n\t\treturn localRuntime.Native.Array.values;\n\t}\n\tif ('values' in Elm.Native.Array)\n\t{\n\t\treturn localRuntime.Native.Array.values = Elm.Native.Array.values;\n\t}\n\n\tvar List = Elm.Native.List.make(localRuntime);\n\n\t// A RRB-Tree has two distinct data types.\n\t// Leaf -> \"height\" is always 0\n\t// \"table\" is an array of elements\n\t// Node -> \"height\" is always greater than 0\n\t// \"table\" is an array of child nodes\n\t// \"lengths\" is an array of accumulated lengths of the child nodes\n\n\t// M is the maximal table size. 32 seems fast. E is the allowed increase\n\t// of search steps when concatting to find an index. Lower values will\n\t// decrease balancing, but will increase search steps.\n\tvar M = 32;\n\tvar E = 2;\n\n\t// An empty array.\n\tvar empty = {\n\t\tctor: '_Array',\n\t\theight: 0,\n\t\ttable: []\n\t};\n\n\n\tfunction get(i, array)\n\t{\n\t\tif (i < 0 || i >= length(array))\n\t\t{\n\t\t\tthrow new Error(\n\t\t\t\t'Index ' + i + ' is out of range. Check the length of ' +\n\t\t\t\t'your array first or use getMaybe or getWithDefault.');\n\t\t}\n\t\treturn unsafeGet(i, array);\n\t}\n\n\n\tfunction unsafeGet(i, array)\n\t{\n\t\tfor (var x = array.height; x > 0; x--)\n\t\t{\n\t\t\tvar slot = i >> (x * 5);\n\t\t\twhile (array.lengths[slot] <= i)\n\t\t\t{\n\t\t\t\tslot++;\n\t\t\t}\n\t\t\tif (slot > 0)\n\t\t\t{\n\t\t\t\ti -= array.lengths[slot - 1];\n\t\t\t}\n\t\t\tarray = array.table[slot];\n\t\t}\n\t\treturn array.table[i];\n\t}\n\n\n\t// Sets the value at the index i. Only the nodes leading to i will get\n\t// copied and updated.\n\tfunction set(i, item, array)\n\t{\n\t\tif (i < 0 || length(array) <= i)\n\t\t{\n\t\t\treturn array;\n\t\t}\n\t\treturn unsafeSet(i, item, array);\n\t}\n\n\n\tfunction unsafeSet(i, item, array)\n\t{\n\t\tarray = nodeCopy(array);\n\n\t\tif (array.height === 0)\n\t\t{\n\t\t\tarray.table[i] = item;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvar slot = getSlot(i, array);\n\t\t\tif (slot > 0)\n\t\t\t{\n\t\t\t\ti -= array.lengths[slot - 1];\n\t\t\t}\n\t\t\tarray.table[slot] = unsafeSet(i, item, array.table[slot]);\n\t\t}\n\t\treturn array;\n\t}\n\n\n\tfunction initialize(len, f)\n\t{\n\t\tif (len <= 0)\n\t\t{\n\t\t\treturn empty;\n\t\t}\n\t\tvar h = Math.floor( Math.log(len) / Math.log(M) );\n\t\treturn initialize_(f, h, 0, len);\n\t}\n\n\tfunction initialize_(f, h, from, to)\n\t{\n\t\tif (h === 0)\n\t\t{\n\t\t\tvar table = new Array((to - from) % (M + 1));\n\t\t\tfor (var i = 0; i < table.length; i++)\n\t\t\t{\n\t\t\t table[i] = f(from + i);\n\t\t\t}\n\t\t\treturn {\n\t\t\t\tctor: '_Array',\n\t\t\t\theight: 0,\n\t\t\t\ttable: table\n\t\t\t};\n\t\t}\n\n\t\tvar step = Math.pow(M, h);\n\t\tvar table = new Array(Math.ceil((to - from) / step));\n\t\tvar lengths = new Array(table.length);\n\t\tfor (var i = 0; i < table.length; i++)\n\t\t{\n\t\t\ttable[i] = initialize_(f, h - 1, from + (i * step), Math.min(from + ((i + 1) * step), to));\n\t\t\tlengths[i] = length(table[i]) + (i > 0 ? lengths[i-1] : 0);\n\t\t}\n\t\treturn {\n\t\t\tctor: '_Array',\n\t\t\theight: h,\n\t\t\ttable: table,\n\t\t\tlengths: lengths\n\t\t};\n\t}\n\n\tfunction fromList(list)\n\t{\n\t\tif (list === List.Nil)\n\t\t{\n\t\t\treturn empty;\n\t\t}\n\n\t\t// Allocate M sized blocks (table) and write list elements to it.\n\t\tvar table = new Array(M);\n\t\tvar nodes = [];\n\t\tvar i = 0;\n\n\t\twhile (list.ctor !== '[]')\n\t\t{\n\t\t\ttable[i] = list._0;\n\t\t\tlist = list._1;\n\t\t\ti++;\n\n\t\t\t// table is full, so we can push a leaf containing it into the\n\t\t\t// next node.\n\t\t\tif (i === M)\n\t\t\t{\n\t\t\t\tvar leaf = {\n\t\t\t\t\tctor: '_Array',\n\t\t\t\t\theight: 0,\n\t\t\t\t\ttable: table\n\t\t\t\t};\n\t\t\t\tfromListPush(leaf, nodes);\n\t\t\t\ttable = new Array(M);\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\n\t\t// Maybe there is something left on the table.\n\t\tif (i > 0)\n\t\t{\n\t\t\tvar leaf = {\n\t\t\t\tctor: '_Array',\n\t\t\t\theight: 0,\n\t\t\t\ttable: table.splice(0, i)\n\t\t\t};\n\t\t\tfromListPush(leaf, nodes);\n\t\t}\n\n\t\t// Go through all of the nodes and eventually push them into higher nodes.\n\t\tfor (var h = 0; h < nodes.length - 1; h++)\n\t\t{\n\t\t\tif (nodes[h].table.length > 0)\n\t\t\t{\n\t\t\t\tfromListPush(nodes[h], nodes);\n\t\t\t}\n\t\t}\n\n\t\tvar head = nodes[nodes.length - 1];\n\t\tif (head.height > 0 && head.table.length === 1)\n\t\t{\n\t\t\treturn head.table[0];\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn head;\n\t\t}\n\t}\n\n\t// Push a node into a higher node as a child.\n\tfunction fromListPush(toPush, nodes)\n\t{\n\t\tvar h = toPush.height;\n\n\t\t// Maybe the node on this height does not exist.\n\t\tif (nodes.length === h)\n\t\t{\n\t\t\tvar node = {\n\t\t\t\tctor: '_Array',\n\t\t\t\theight: h + 1,\n\t\t\t\ttable: [],\n\t\t\t\tlengths: []\n\t\t\t};\n\t\t\tnodes.push(node);\n\t\t}\n\n\t\tnodes[h].table.push(toPush);\n\t\tvar len = length(toPush);\n\t\tif (nodes[h].lengths.length > 0)\n\t\t{\n\t\t\tlen += nodes[h].lengths[nodes[h].lengths.length - 1];\n\t\t}\n\t\tnodes[h].lengths.push(len);\n\n\t\tif (nodes[h].table.length === M)\n\t\t{\n\t\t\tfromListPush(nodes[h], nodes);\n\t\t\tnodes[h] = {\n\t\t\t\tctor: '_Array',\n\t\t\t\theight: h + 1,\n\t\t\t\ttable: [],\n\t\t\t\tlengths: []\n\t\t\t};\n\t\t}\n\t}\n\n\t// Pushes an item via push_ to the bottom right of a tree.\n\tfunction push(item, a)\n\t{\n\t\tvar pushed = push_(item, a);\n\t\tif (pushed !== null)\n\t\t{\n\t\t\treturn pushed;\n\t\t}\n\n\t\tvar newTree = create(item, a.height);\n\t\treturn siblise(a, newTree);\n\t}\n\n\t// Recursively tries to push an item to the bottom-right most\n\t// tree possible. If there is no space left for the item,\n\t// null will be returned.\n\tfunction push_(item, a)\n\t{\n\t\t// Handle resursion stop at leaf level.\n\t\tif (a.height === 0)\n\t\t{\n\t\t\tif (a.table.length < M)\n\t\t\t{\n\t\t\t\tvar newA = {\n\t\t\t\t\tctor: '_Array',\n\t\t\t\t\theight: 0,\n\t\t\t\t\ttable: a.table.slice()\n\t\t\t\t};\n\t\t\t\tnewA.table.push(item);\n\t\t\t\treturn newA;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t return null;\n\t\t\t}\n\t\t}\n\n\t\t// Recursively push\n\t\tvar pushed = push_(item, botRight(a));\n\n\t\t// There was space in the bottom right tree, so the slot will\n\t\t// be updated.\n\t\tif (pushed !== null)\n\t\t{\n\t\t\tvar newA = nodeCopy(a);\n\t\t\tnewA.table[newA.table.length - 1] = pushed;\n\t\t\tnewA.lengths[newA.lengths.length - 1]++;\n\t\t\treturn newA;\n\t\t}\n\n\t\t// When there was no space left, check if there is space left\n\t\t// for a new slot with a tree which contains only the item\n\t\t// at the bottom.\n\t\tif (a.table.length < M)\n\t\t{\n\t\t\tvar newSlot = create(item, a.height - 1);\n\t\t\tvar newA = nodeCopy(a);\n\t\t\tnewA.table.push(newSlot);\n\t\t\tnewA.lengths.push(newA.lengths[newA.lengths.length - 1] + length(newSlot));\n\t\t\treturn newA;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn null;\n\t\t}\n\t}\n\n\t// Converts an array into a list of elements.\n\tfunction toList(a)\n\t{\n\t\treturn toList_(List.Nil, a);\n\t}\n\n\tfunction toList_(list, a)\n\t{\n\t\tfor (var i = a.table.length - 1; i >= 0; i--)\n\t\t{\n\t\t\tlist =\n\t\t\t\ta.height === 0\n\t\t\t\t\t? List.Cons(a.table[i], list)\n\t\t\t\t\t: toList_(list, a.table[i]);\n\t\t}\n\t\treturn list;\n\t}\n\n\t// Maps a function over the elements of an array.\n\tfunction map(f, a)\n\t{\n\t\tvar newA = {\n\t\t\tctor: '_Array',\n\t\t\theight: a.height,\n\t\t\ttable: new Array(a.table.length)\n\t\t};\n\t\tif (a.height > 0)\n\t\t{\n\t\t\tnewA.lengths = a.lengths;\n\t\t}\n\t\tfor (var i = 0; i < a.table.length; i++)\n\t\t{\n\t\t\tnewA.table[i] =\n\t\t\t\ta.height === 0\n\t\t\t\t\t? f(a.table[i])\n\t\t\t\t\t: map(f, a.table[i]);\n\t\t}\n\t\treturn newA;\n\t}\n\n\t// Maps a function over the elements with their index as first argument.\n\tfunction indexedMap(f, a)\n\t{\n\t\treturn indexedMap_(f, a, 0);\n\t}\n\n\tfunction indexedMap_(f, a, from)\n\t{\n\t\tvar newA = {\n\t\t\tctor: '_Array',\n\t\t\theight: a.height,\n\t\t\ttable: new Array(a.table.length)\n\t\t};\n\t\tif (a.height > 0)\n\t\t{\n\t\t\tnewA.lengths = a.lengths;\n\t\t}\n\t\tfor (var i = 0; i < a.table.length; i++)\n\t\t{\n\t\t\tnewA.table[i] =\n\t\t\t\ta.height === 0\n\t\t\t\t\t? A2(f, from + i, a.table[i])\n\t\t\t\t\t: indexedMap_(f, a.table[i], i == 0 ? from : from + a.lengths[i - 1]);\n\t\t}\n\t\treturn newA;\n\t}\n\n\tfunction foldl(f, b, a)\n\t{\n\t\tif (a.height === 0)\n\t\t{\n\t\t\tfor (var i = 0; i < a.table.length; i++)\n\t\t\t{\n\t\t\t\tb = A2(f, a.table[i], b);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (var i = 0; i < a.table.length; i++)\n\t\t\t{\n\t\t\t\tb = foldl(f, b, a.table[i]);\n\t\t\t}\n\t\t}\n\t\treturn b;\n\t}\n\n\tfunction foldr(f, b, a)\n\t{\n\t\tif (a.height === 0)\n\t\t{\n\t\t\tfor (var i = a.table.length; i--; )\n\t\t\t{\n\t\t\t\tb = A2(f, a.table[i], b);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (var i = a.table.length; i--; )\n\t\t\t{\n\t\t\t\tb = foldr(f, b, a.table[i]);\n\t\t\t}\n\t\t}\n\t\treturn b;\n\t}\n\n\t// TODO: currently, it slices the right, then the left. This can be\n\t// optimized.\n\tfunction slice(from, to, a)\n\t{\n\t\tif (from < 0)\n\t\t{\n\t\t\tfrom += length(a);\n\t\t}\n\t\tif (to < 0)\n\t\t{\n\t\t\tto += length(a);\n\t\t}\n\t\treturn sliceLeft(from, sliceRight(to, a));\n\t}\n\n\tfunction sliceRight(to, a)\n\t{\n\t\tif (to === length(a))\n\t\t{\n\t\t\treturn a;\n\t\t}\n\n\t\t// Handle leaf level.\n\t\tif (a.height === 0)\n\t\t{\n\t\t\tvar newA = { ctor:'_Array', height:0 };\n\t\t\tnewA.table = a.table.slice(0, to);\n\t\t\treturn newA;\n\t\t}\n\n\t\t// Slice the right recursively.\n\t\tvar right = getSlot(to, a);\n\t\tvar sliced = sliceRight(to - (right > 0 ? a.lengths[right - 1] : 0), a.table[right]);\n\n\t\t// Maybe the a node is not even needed, as sliced contains the whole slice.\n\t\tif (right === 0)\n\t\t{\n\t\t\treturn sliced;\n\t\t}\n\n\t\t// Create new node.\n\t\tvar newA = {\n\t\t\tctor: '_Array',\n\t\t\theight: a.height,\n\t\t\ttable: a.table.slice(0, right),\n\t\t\tlengths: a.lengths.slice(0, right)\n\t\t};\n\t\tif (sliced.table.length > 0)\n\t\t{\n\t\t\tnewA.table[right] = sliced;\n\t\t\tnewA.lengths[right] = length(sliced) + (right > 0 ? newA.lengths[right - 1] : 0);\n\t\t}\n\t\treturn newA;\n\t}\n\n\tfunction sliceLeft(from, a)\n\t{\n\t\tif (from === 0)\n\t\t{\n\t\t\treturn a;\n\t\t}\n\n\t\t// Handle leaf level.\n\t\tif (a.height === 0)\n\t\t{\n\t\t\tvar newA = { ctor:'_Array', height:0 };\n\t\t\tnewA.table = a.table.slice(from, a.table.length + 1);\n\t\t\treturn newA;\n\t\t}\n\n\t\t// Slice the left recursively.\n\t\tvar left = getSlot(from, a);\n\t\tvar sliced = sliceLeft(from - (left > 0 ? a.lengths[left - 1] : 0), a.table[left]);\n\n\t\t// Maybe the a node is not even needed, as sliced contains the whole slice.\n\t\tif (left === a.table.length - 1)\n\t\t{\n\t\t\treturn sliced;\n\t\t}\n\n\t\t// Create new node.\n\t\tvar newA = {\n\t\t\tctor: '_Array',\n\t\t\theight: a.height,\n\t\t\ttable: a.table.slice(left, a.table.length + 1),\n\t\t\tlengths: new Array(a.table.length - left)\n\t\t};\n\t\tnewA.table[0] = sliced;\n\t\tvar len = 0;\n\t\tfor (var i = 0; i < newA.table.length; i++)\n\t\t{\n\t\t\tlen += length(newA.table[i]);\n\t\t\tnewA.lengths[i] = len;\n\t\t}\n\n\t\treturn newA;\n\t}\n\n\t// Appends two trees.\n\tfunction append(a,b)\n\t{\n\t\tif (a.table.length === 0)\n\t\t{\n\t\t\treturn b;\n\t\t}\n\t\tif (b.table.length === 0)\n\t\t{\n\t\t\treturn a;\n\t\t}\n\n\t\tvar c = append_(a, b);\n\n\t\t// Check if both nodes can be crunshed together.\n\t\tif (c[0].table.length + c[1].table.length <= M)\n\t\t{\n\t\t\tif (c[0].table.length === 0)\n\t\t\t{\n\t\t\t\treturn c[1];\n\t\t\t}\n\t\t\tif (c[1].table.length === 0)\n\t\t\t{\n\t\t\t\treturn c[0];\n\t\t\t}\n\n\t\t\t// Adjust .table and .lengths\n\t\t\tc[0].table = c[0].table.concat(c[1].table);\n\t\t\tif (c[0].height > 0)\n\t\t\t{\n\t\t\t\tvar len = length(c[0]);\n\t\t\t\tfor (var i = 0; i < c[1].lengths.length; i++)\n\t\t\t\t{\n\t\t\t\t\tc[1].lengths[i] += len;\n\t\t\t\t}\n\t\t\t\tc[0].lengths = c[0].lengths.concat(c[1].lengths);\n\t\t\t}\n\n\t\t\treturn c[0];\n\t\t}\n\n\t\tif (c[0].height > 0)\n\t\t{\n\t\t\tvar toRemove = calcToRemove(a, b);\n\t\t\tif (toRemove > E)\n\t\t\t{\n\t\t\t\tc = shuffle(c[0], c[1], toRemove);\n\t\t\t}\n\t\t}\n\n\t\treturn siblise(c[0], c[1]);\n\t}\n\n\t// Returns an array of two nodes; right and left. One node _may_ be empty.\n\tfunction append_(a, b)\n\t{\n\t\tif (a.height === 0 && b.height === 0)\n\t\t{\n\t\t\treturn [a, b];\n\t\t}\n\n\t\tif (a.height !== 1 || b.height !== 1)\n\t\t{\n\t\t\tif (a.height === b.height)\n\t\t\t{\n\t\t\t\ta = nodeCopy(a);\n\t\t\t\tb = nodeCopy(b);\n\t\t\t\tvar appended = append_(botRight(a), botLeft(b));\n\n\t\t\t\tinsertRight(a, appended[1]);\n\t\t\t\tinsertLeft(b, appended[0]);\n\t\t\t}\n\t\t\telse if (a.height > b.height)\n\t\t\t{\n\t\t\t\ta = nodeCopy(a);\n\t\t\t\tvar appended = append_(botRight(a), b);\n\n\t\t\t\tinsertRight(a, appended[0]);\n\t\t\t\tb = parentise(appended[1], appended[1].height + 1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb = nodeCopy(b);\n\t\t\t\tvar appended = append_(a, botLeft(b));\n\n\t\t\t\tvar left = appended[0].table.length === 0 ? 0 : 1;\n\t\t\t\tvar right = left === 0 ? 1 : 0;\n\t\t\t\tinsertLeft(b, appended[left]);\n\t\t\t\ta = parentise(appended[right], appended[right].height + 1);\n\t\t\t}\n\t\t}\n\n\t\t// Check if balancing is needed and return based on that.\n\t\tif (a.table.length === 0 || b.table.length === 0)\n\t\t{\n\t\t\treturn [a, b];\n\t\t}\n\n\t\tvar toRemove = calcToRemove(a, b);\n\t\tif (toRemove <= E)\n\t\t{\n\t\t\treturn [a, b];\n\t\t}\n\t\treturn shuffle(a, b, toRemove);\n\t}\n\n\t// Helperfunctions for append_. Replaces a child node at the side of the parent.\n\tfunction insertRight(parent, node)\n\t{\n\t\tvar index = parent.table.length - 1;\n\t\tparent.table[index] = node;\n\t\tparent.lengths[index] = length(node);\n\t\tparent.lengths[index] += index > 0 ? parent.lengths[index - 1] : 0;\n\t}\n\n\tfunction insertLeft(parent, node)\n\t{\n\t\tif (node.table.length > 0)\n\t\t{\n\t\t\tparent.table[0] = node;\n\t\t\tparent.lengths[0] = length(node);\n\n\t\t\tvar len = length(parent.table[0]);\n\t\t\tfor (var i = 1; i < parent.lengths.length; i++)\n\t\t\t{\n\t\t\t\tlen += length(parent.table[i]);\n\t\t\t\tparent.lengths[i] = len;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tparent.table.shift();\n\t\t\tfor (var i = 1; i < parent.lengths.length; i++)\n\t\t\t{\n\t\t\t\tparent.lengths[i] = parent.lengths[i] - parent.lengths[0];\n\t\t\t}\n\t\t\tparent.lengths.shift();\n\t\t}\n\t}\n\n\t// Returns the extra search steps for E. Refer to the paper.\n\tfunction calcToRemove(a, b)\n\t{\n\t\tvar subLengths = 0;\n\t\tfor (var i = 0; i < a.table.length; i++)\n\t\t{\n\t\t\tsubLengths += a.table[i].table.length;\n\t\t}\n\t\tfor (var i = 0; i < b.table.length; i++)\n\t\t{\n\t\t\tsubLengths += b.table[i].table.length;\n\t\t}\n\n\t\tvar toRemove = a.table.length + b.table.length;\n\t\treturn toRemove - (Math.floor((subLengths - 1) / M) + 1);\n\t}\n\n\t// get2, set2 and saveSlot are helpers for accessing elements over two arrays.\n\tfunction get2(a, b, index)\n\t{\n\t\treturn index < a.length\n\t\t\t? a[index]\n\t\t\t: b[index - a.length];\n\t}\n\n\tfunction set2(a, b, index, value)\n\t{\n\t\tif (index < a.length)\n\t\t{\n\t\t\ta[index] = value;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tb[index - a.length] = value;\n\t\t}\n\t}\n\n\tfunction saveSlot(a, b, index, slot)\n\t{\n\t\tset2(a.table, b.table, index, slot);\n\n\t\tvar l = (index === 0 || index === a.lengths.length)\n\t\t\t? 0\n\t\t\t: get2(a.lengths, a.lengths, index - 1);\n\n\t\tset2(a.lengths, b.lengths, index, l + length(slot));\n\t}\n\n\t// Creates a node or leaf with a given length at their arrays for perfomance.\n\t// Is only used by shuffle.\n\tfunction createNode(h, length)\n\t{\n\t\tif (length < 0)\n\t\t{\n\t\t\tlength = 0;\n\t\t}\n\t\tvar a = {\n\t\t\tctor: '_Array',\n\t\t\theight: h,\n\t\t\ttable: new Array(length)\n\t\t};\n\t\tif (h > 0)\n\t\t{\n\t\t\ta.lengths = new Array(length);\n\t\t}\n\t\treturn a;\n\t}\n\n\t// Returns an array of two balanced nodes.\n\tfunction shuffle(a, b, toRemove)\n\t{\n\t\tvar newA = createNode(a.height, Math.min(M, a.table.length + b.table.length - toRemove));\n\t\tvar newB = createNode(a.height, newA.table.length - (a.table.length + b.table.length - toRemove));\n\n\t\t// Skip the slots with size M. More precise: copy the slot references\n\t\t// to the new node\n\t\tvar read = 0;\n\t\twhile (get2(a.table, b.table, read).table.length % M === 0)\n\t\t{\n\t\t\tset2(newA.table, newB.table, read, get2(a.table, b.table, read));\n\t\t\tset2(newA.lengths, newB.lengths, read, get2(a.lengths, b.lengths, read));\n\t\t\tread++;\n\t\t}\n\n\t\t// Pulling items from left to right, caching in a slot before writing\n\t\t// it into the new nodes.\n\t\tvar write = read;\n\t\tvar slot = new createNode(a.height - 1, 0);\n\t\tvar from = 0;\n\n\t\t// If the current slot is still containing data, then there will be at\n\t\t// least one more write, so we do not break this loop yet.\n\t\twhile (read - write - (slot.table.length > 0 ? 1 : 0) < toRemove)\n\t\t{\n\t\t\t// Find out the max possible items for copying.\n\t\t\tvar source = get2(a.table, b.table, read);\n\t\t\tvar to = Math.min(M - slot.table.length, source.table.length);\n\n\t\t\t// Copy and adjust size table.\n\t\t\tslot.table = slot.table.concat(source.table.slice(from, to));\n\t\t\tif (slot.height > 0)\n\t\t\t{\n\t\t\t\tvar len = slot.lengths.length;\n\t\t\t\tfor (var i = len; i < len + to - from; i++)\n\t\t\t\t{\n\t\t\t\t\tslot.lengths[i] = length(slot.table[i]);\n\t\t\t\t\tslot.lengths[i] += (i > 0 ? slot.lengths[i - 1] : 0);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfrom += to;\n\n\t\t\t// Only proceed to next slots[i] if the current one was\n\t\t\t// fully copied.\n\t\t\tif (source.table.length <= to)\n\t\t\t{\n\t\t\t\tread++; from = 0;\n\t\t\t}\n\n\t\t\t// Only create a new slot if the current one is filled up.\n\t\t\tif (slot.table.length === M)\n\t\t\t{\n\t\t\t\tsaveSlot(newA, newB, write, slot);\n\t\t\t\tslot = createNode(a.height - 1, 0);\n\t\t\t\twrite++;\n\t\t\t}\n\t\t}\n\n\t\t// Cleanup after the loop. Copy the last slot into the new nodes.\n\t\tif (slot.table.length > 0)\n\t\t{\n\t\t\tsaveSlot(newA, newB, write, slot);\n\t\t\twrite++;\n\t\t}\n\n\t\t// Shift the untouched slots to the left\n\t\twhile (read < a.table.length + b.table.length )\n\t\t{\n\t\t\tsaveSlot(newA, newB, write, get2(a.table, b.table, read));\n\t\t\tread++;\n\t\t\twrite++;\n\t\t}\n\n\t\treturn [newA, newB];\n\t}\n\n\t// Navigation functions\n\tfunction botRight(a)\n\t{\n\t\treturn a.table[a.table.length - 1];\n\t}\n\tfunction botLeft(a)\n\t{\n\t\treturn a.table[0];\n\t}\n\n\t// Copies a node for updating. Note that you should not use this if\n\t// only updating only one of \"table\" or \"lengths\" for performance reasons.\n\tfunction nodeCopy(a)\n\t{\n\t\tvar newA = {\n\t\t\tctor: '_Array',\n\t\t\theight: a.height,\n\t\t\ttable: a.table.slice()\n\t\t};\n\t\tif (a.height > 0)\n\t\t{\n\t\t\tnewA.lengths = a.lengths.slice();\n\t\t}\n\t\treturn newA;\n\t}\n\n\t// Returns how many items are in the tree.\n\tfunction length(array)\n\t{\n\t\tif (array.height === 0)\n\t\t{\n\t\t\treturn array.table.length;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn array.lengths[array.lengths.length - 1];\n\t\t}\n\t}\n\n\t// Calculates in which slot of \"table\" the item probably is, then\n\t// find the exact slot via forward searching in \"lengths\". Returns the index.\n\tfunction getSlot(i, a)\n\t{\n\t\tvar slot = i >> (5 * a.height);\n\t\twhile (a.lengths[slot] <= i)\n\t\t{\n\t\t\tslot++;\n\t\t}\n\t\treturn slot;\n\t}\n\n\t// Recursively creates a tree with a given height containing\n\t// only the given item.\n\tfunction create(item, h)\n\t{\n\t\tif (h === 0)\n\t\t{\n\t\t\treturn {\n\t\t\t\tctor: '_Array',\n\t\t\t\theight: 0,\n\t\t\t\ttable: [item]\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\tctor: '_Array',\n\t\t\theight: h,\n\t\t\ttable: [create(item, h - 1)],\n\t\t\tlengths: [1]\n\t\t};\n\t}\n\n\t// Recursively creates a tree that contains the given tree.\n\tfunction parentise(tree, h)\n\t{\n\t\tif (h === tree.height)\n\t\t{\n\t\t\treturn tree;\n\t\t}\n\n\t\treturn {\n\t\t\tctor: '_Array',\n\t\t\theight: h,\n\t\t\ttable: [parentise(tree, h - 1)],\n\t\t\tlengths: [length(tree)]\n\t\t};\n\t}\n\n\t// Emphasizes blood brotherhood beneath two trees.\n\tfunction siblise(a, b)\n\t{\n\t\treturn {\n\t\t\tctor: '_Array',\n\t\t\theight: a.height + 1,\n\t\t\ttable: [a, b],\n\t\t\tlengths: [length(a), length(a) + length(b)]\n\t\t};\n\t}\n\n\tfunction toJSArray(a)\n\t{\n\t\tvar jsArray = new Array(length(a));\n\t\ttoJSArray_(jsArray, 0, a);\n\t\treturn jsArray;\n\t}\n\n\tfunction toJSArray_(jsArray, i, a)\n\t{\n\t\tfor (var t = 0; t < a.table.length; t++)\n\t\t{\n\t\t\tif (a.height === 0)\n\t\t\t{\n\t\t\t\tjsArray[i + t] = a.table[t];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tvar inc = t === 0 ? 0 : a.lengths[t - 1];\n\t\t\t\ttoJSArray_(jsArray, i + inc, a.table[t]);\n\t\t\t}\n\t\t}\n\t}\n\n\tfunction fromJSArray(jsArray)\n\t{\n\t\tif (jsArray.length === 0)\n\t\t{\n\t\t\treturn empty;\n\t\t}\n\t\tvar h = Math.floor(Math.log(jsArray.length) / Math.log(M));\n\t\treturn fromJSArray_(jsArray, h, 0, jsArray.length);\n\t}\n\n\tfunction fromJSArray_(jsArray, h, from, to)\n\t{\n\t\tif (h === 0)\n\t\t{\n\t\t\treturn {\n\t\t\t\tctor: '_Array',\n\t\t\t\theight: 0,\n\t\t\t\ttable: jsArray.slice(from, to)\n\t\t\t};\n\t\t}\n\n\t\tvar step = Math.pow(M, h);\n\t\tvar table = new Array(Math.ceil((to - from) / step));\n\t\tvar lengths = new Array(table.length);\n\t\tfor (var i = 0; i < table.length; i++)\n\t\t{\n\t\t\ttable[i] = fromJSArray_(jsArray, h - 1, from + (i * step), Math.min(from + ((i + 1) * step), to));\n\t\t\tlengths[i] = length(table[i]) + (i > 0 ? lengths[i - 1] : 0);\n\t\t}\n\t\treturn {\n\t\t\tctor: '_Array',\n\t\t\theight: h,\n\t\t\ttable: table,\n\t\t\tlengths: lengths\n\t\t};\n\t}\n\n\tElm.Native.Array.values = {\n\t\tempty: empty,\n\t\tfromList: fromList,\n\t\ttoList: toList,\n\t\tinitialize: F2(initialize),\n\t\tappend: F2(append),\n\t\tpush: F2(push),\n\t\tslice: F3(slice),\n\t\tget: F2(get),\n\t\tset: F3(set),\n\t\tmap: F2(map),\n\t\tindexedMap: F2(indexedMap),\n\t\tfoldl: F3(foldl),\n\t\tfoldr: F3(foldr),\n\t\tlength: length,\n\n\t\ttoJSArray: toJSArray,\n\t\tfromJSArray: fromJSArray\n\t};\n\n\treturn localRuntime.Native.Array.values = Elm.Native.Array.values;\n};\n\nElm.Native.Basics = {};\nElm.Native.Basics.make = function(localRuntime) {\n\tlocalRuntime.Native = localRuntime.Native || {};\n\tlocalRuntime.Native.Basics = localRuntime.Native.Basics || {};\n\tif (localRuntime.Native.Basics.values)\n\t{\n\t\treturn localRuntime.Native.Basics.values;\n\t}\n\n\tvar Utils = Elm.Native.Utils.make(localRuntime);\n\n\tfunction div(a, b)\n\t{\n\t\treturn (a / b) | 0;\n\t}\n\tfunction rem(a, b)\n\t{\n\t\treturn a % b;\n\t}\n\tfunction mod(a, b)\n\t{\n\t\tif (b === 0)\n\t\t{\n\t\t\tthrow new Error('Cannot perform mod 0. Division by zero error.');\n\t\t}\n\t\tvar r = a % b;\n\t\tvar m = a === 0 ? 0 : (b > 0 ? (a >= 0 ? r : r + b) : -mod(-a, -b));\n\n\t\treturn m === b ? 0 : m;\n\t}\n\tfunction logBase(base, n)\n\t{\n\t\treturn Math.log(n) / Math.log(base);\n\t}\n\tfunction negate(n)\n\t{\n\t\treturn -n;\n\t}\n\tfunction abs(n)\n\t{\n\t\treturn n < 0 ? -n : n;\n\t}\n\n\tfunction min(a, b)\n\t{\n\t\treturn Utils.cmp(a, b) < 0 ? a : b;\n\t}\n\tfunction max(a, b)\n\t{\n\t\treturn Utils.cmp(a, b) > 0 ? a : b;\n\t}\n\tfunction clamp(lo, hi, n)\n\t{\n\t\treturn Utils.cmp(n, lo) < 0 ? lo : Utils.cmp(n, hi) > 0 ? hi : n;\n\t}\n\n\tfunction xor(a, b)\n\t{\n\t\treturn a !== b;\n\t}\n\tfunction not(b)\n\t{\n\t\treturn !b;\n\t}\n\tfunction isInfinite(n)\n\t{\n\t\treturn n === Infinity || n === -Infinity;\n\t}\n\n\tfunction truncate(n)\n\t{\n\t\treturn n | 0;\n\t}\n\n\tfunction degrees(d)\n\t{\n\t\treturn d * Math.PI / 180;\n\t}\n\tfunction turns(t)\n\t{\n\t\treturn 2 * Math.PI * t;\n\t}\n\tfunction fromPolar(point)\n\t{\n\t\tvar r = point._0;\n\t\tvar t = point._1;\n\t\treturn Utils.Tuple2(r * Math.cos(t), r * Math.sin(t));\n\t}\n\tfunction toPolar(point)\n\t{\n\t\tvar x = point._0;\n\t\tvar y = point._1;\n\t\treturn Utils.Tuple2(Math.sqrt(x * x + y * y), Math.atan2(y, x));\n\t}\n\n\treturn localRuntime.Native.Basics.values = {\n\t\tdiv: F2(div),\n\t\trem: F2(rem),\n\t\tmod: F2(mod),\n\n\t\tpi: Math.PI,\n\t\te: Math.E,\n\t\tcos: Math.cos,\n\t\tsin: Math.sin,\n\t\ttan: Math.tan,\n\t\tacos: Math.acos,\n\t\tasin: Math.asin,\n\t\tatan: Math.atan,\n\t\tatan2: F2(Math.atan2),\n\n\t\tdegrees: degrees,\n\t\tturns: turns,\n\t\tfromPolar: fromPolar,\n\t\ttoPolar: toPolar,\n\n\t\tsqrt: Math.sqrt,\n\t\tlogBase: F2(logBase),\n\t\tnegate: negate,\n\t\tabs: abs,\n\t\tmin: F2(min),\n\t\tmax: F2(max),\n\t\tclamp: F3(clamp),\n\t\tcompare: Utils.compare,\n\n\t\txor: F2(xor),\n\t\tnot: not,\n\n\t\ttruncate: truncate,\n\t\tceiling: Math.ceil,\n\t\tfloor: Math.floor,\n\t\tround: Math.round,\n\t\ttoFloat: function(x) { return x; },\n\t\tisNaN: isNaN,\n\t\tisInfinite: isInfinite\n\t};\n};\n\nElm.Native.Port = {};\n\nElm.Native.Port.make = function(localRuntime) {\n\tlocalRuntime.Native = localRuntime.Native || {};\n\tlocalRuntime.Native.Port = localRuntime.Native.Port || {};\n\tif (localRuntime.Native.Port.values)\n\t{\n\t\treturn localRuntime.Native.Port.values;\n\t}\n\n\tvar NS;\n\n\t// INBOUND\n\n\tfunction inbound(name, type, converter)\n\t{\n\t\tif (!localRuntime.argsTracker[name])\n\t\t{\n\t\t\tthrow new Error(\n\t\t\t\t'Port Error:\\n' +\n\t\t\t\t'No argument was given for the port named \\'' + name + '\\' with type:\\n\\n' +\n\t\t\t\t' ' + type.split('\\n').join('\\n ') + '\\n\\n' +\n\t\t\t\t'You need to provide an initial value!\\n\\n' +\n\t\t\t\t'Find out more about ports here '\n\t\t\t);\n\t\t}\n\t\tvar arg = localRuntime.argsTracker[name];\n\t\targ.used = true;\n\n\t\treturn jsToElm(name, type, converter, arg.value);\n\t}\n\n\n\tfunction inboundSignal(name, type, converter)\n\t{\n\t\tvar initialValue = inbound(name, type, converter);\n\n\t\tif (!NS)\n\t\t{\n\t\t\tNS = Elm.Native.Signal.make(localRuntime);\n\t\t}\n\t\tvar signal = NS.input('inbound-port-' + name, initialValue);\n\n\t\tfunction send(jsValue)\n\t\t{\n\t\t\tvar elmValue = jsToElm(name, type, converter, jsValue);\n\t\t\tsetTimeout(function() {\n\t\t\t\tlocalRuntime.notify(signal.id, elmValue);\n\t\t\t}, 0);\n\t\t}\n\n\t\tlocalRuntime.ports[name] = { send: send };\n\n\t\treturn signal;\n\t}\n\n\n\tfunction jsToElm(name, type, converter, value)\n\t{\n\t\ttry\n\t\t{\n\t\t\treturn converter(value);\n\t\t}\n\t\tcatch(e)\n\t\t{\n\t\t\tthrow new Error(\n\t\t\t\t'Port Error:\\n' +\n\t\t\t\t'Regarding the port named \\'' + name + '\\' with type:\\n\\n' +\n\t\t\t\t' ' + type.split('\\n').join('\\n ') + '\\n\\n' +\n\t\t\t\t'You just sent the value:\\n\\n' +\n\t\t\t\t' ' + JSON.stringify(value) + '\\n\\n' +\n\t\t\t\t'but it cannot be converted to the necessary type.\\n' +\n\t\t\t\te.message\n\t\t\t);\n\t\t}\n\t}\n\n\n\t// OUTBOUND\n\n\tfunction outbound(name, converter, elmValue)\n\t{\n\t\tlocalRuntime.ports[name] = converter(elmValue);\n\t}\n\n\n\tfunction outboundSignal(name, converter, signal)\n\t{\n\t\tvar subscribers = [];\n\n\t\tfunction subscribe(handler)\n\t\t{\n\t\t\tsubscribers.push(handler);\n\t\t}\n\t\tfunction unsubscribe(handler)\n\t\t{\n\t\t\tsubscribers.pop(subscribers.indexOf(handler));\n\t\t}\n\n\t\tfunction notify(elmValue)\n\t\t{\n\t\t\tvar jsValue = converter(elmValue);\n\t\t\tvar len = subscribers.length;\n\t\t\tfor (var i = 0; i < len; ++i)\n\t\t\t{\n\t\t\t\tsubscribers[i](jsValue);\n\t\t\t}\n\t\t}\n\n\t\tif (!NS)\n\t\t{\n\t\t\tNS = Elm.Native.Signal.make(localRuntime);\n\t\t}\n\t\tNS.output('outbound-port-' + name, notify, signal);\n\n\t\tlocalRuntime.ports[name] = {\n\t\t\tsubscribe: subscribe,\n\t\t\tunsubscribe: unsubscribe\n\t\t};\n\n\t\treturn signal;\n\t}\n\n\n\treturn localRuntime.Native.Port.values = {\n\t\tinbound: inbound,\n\t\toutbound: outbound,\n\t\tinboundSignal: inboundSignal,\n\t\toutboundSignal: outboundSignal\n\t};\n};\n\nif (!Elm.fullscreen) {\n\t(function() {\n\t\t'use strict';\n\n\t\tvar Display = {\n\t\t\tFULLSCREEN: 0,\n\t\t\tCOMPONENT: 1,\n\t\t\tNONE: 2\n\t\t};\n\n\t\tElm.fullscreen = function(module, args)\n\t\t{\n\t\t\tvar container = document.createElement('div');\n\t\t\tdocument.body.appendChild(container);\n\t\t\treturn init(Display.FULLSCREEN, container, module, args || {});\n\t\t};\n\n\t\tElm.embed = function(module, container, args)\n\t\t{\n\t\t\tvar tag = container.tagName;\n\t\t\tif (tag !== 'DIV')\n\t\t\t{\n\t\t\t\tthrow new Error('Elm.node must be given a DIV, not a ' + tag + '.');\n\t\t\t}\n\t\t\treturn init(Display.COMPONENT, container, module, args || {});\n\t\t};\n\n\t\tElm.worker = function(module, args)\n\t\t{\n\t\t\treturn init(Display.NONE, {}, module, args || {});\n\t\t};\n\n\t\tfunction init(display, container, module, args, moduleToReplace)\n\t\t{\n\t\t\t// defining state needed for an instance of the Elm RTS\n\t\t\tvar inputs = [];\n\n\t\t\t/* OFFSET\n\t\t\t * Elm's time traveling debugger lets you pause time. This means\n\t\t\t * \"now\" may be shifted a bit into the past. By wrapping Date.now()\n\t\t\t * we can manage this.\n\t\t\t */\n\t\t\tvar timer = {\n\t\t\t\tprogramStart: Date.now(),\n\t\t\t\tnow: function()\n\t\t\t\t{\n\t\t\t\t\treturn Date.now();\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tvar updateInProgress = false;\n\t\t\tfunction notify(id, v)\n\t\t\t{\n\t\t\t\tif (updateInProgress)\n\t\t\t\t{\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t'The notify function has been called synchronously!\\n' +\n\t\t\t\t\t\t'This can lead to frames being dropped.\\n' +\n\t\t\t\t\t\t'Definitely report this to \\n');\n\t\t\t\t}\n\t\t\t\tupdateInProgress = true;\n\t\t\t\tvar timestep = timer.now();\n\t\t\t\tfor (var i = inputs.length; i--; )\n\t\t\t\t{\n\t\t\t\t\tinputs[i].notify(timestep, id, v);\n\t\t\t\t}\n\t\t\t\tupdateInProgress = false;\n\t\t\t}\n\t\t\tfunction setTimeout(func, delay)\n\t\t\t{\n\t\t\t\treturn window.setTimeout(func, delay);\n\t\t\t}\n\n\t\t\tvar listeners = [];\n\t\t\tfunction addListener(relevantInputs, domNode, eventName, func)\n\t\t\t{\n\t\t\t\tdomNode.addEventListener(eventName, func);\n\t\t\t\tvar listener = {\n\t\t\t\t\trelevantInputs: relevantInputs,\n\t\t\t\t\tdomNode: domNode,\n\t\t\t\t\teventName: eventName,\n\t\t\t\t\tfunc: func\n\t\t\t\t};\n\t\t\t\tlisteners.push(listener);\n\t\t\t}\n\n\t\t\tvar argsTracker = {};\n\t\t\tfor (var name in args)\n\t\t\t{\n\t\t\t\targsTracker[name] = {\n\t\t\t\t\tvalue: args[name],\n\t\t\t\t\tused: false\n\t\t\t\t};\n\t\t\t}\n\n\t\t\t// create the actual RTS. Any impure modules will attach themselves to this\n\t\t\t// object. This permits many Elm programs to be embedded per document.\n\t\t\tvar elm = {\n\t\t\t\tnotify: notify,\n\t\t\t\tsetTimeout: setTimeout,\n\t\t\t\tnode: container,\n\t\t\t\taddListener: addListener,\n\t\t\t\tinputs: inputs,\n\t\t\t\ttimer: timer,\n\t\t\t\targsTracker: argsTracker,\n\t\t\t\tports: {},\n\n\t\t\t\tisFullscreen: function() { return display === Display.FULLSCREEN; },\n\t\t\t\tisEmbed: function() { return display === Display.COMPONENT; },\n\t\t\t\tisWorker: function() { return display === Display.NONE; }\n\t\t\t};\n\n\t\t\tfunction swap(newModule)\n\t\t\t{\n\t\t\t\tremoveListeners(listeners);\n\t\t\t\tvar div = document.createElement('div');\n\t\t\t\tvar newElm = init(display, div, newModule, args, elm);\n\t\t\t\tinputs = [];\n\n\t\t\t\treturn newElm;\n\t\t\t}\n\n\t\t\tfunction dispose()\n\t\t\t{\n\t\t\t\tremoveListeners(listeners);\n\t\t\t\tinputs = [];\n\t\t\t}\n\n\t\t\tvar Module = {};\n\t\t\ttry\n\t\t\t{\n\t\t\t\tModule = module.make(elm);\n\t\t\t\tcheckInputs(elm);\n\t\t\t}\n\t\t\tcatch (error)\n\t\t\t{\n\t\t\t\tif (typeof container.appendChild === \"function\")\n\t\t\t\t{\n\t\t\t\t\tcontainer.appendChild(errorNode(error.message));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tconsole.error(error.message);\n\t\t\t\t}\n\t\t\t\tthrow error;\n\t\t\t}\n\n\t\t\tif (display !== Display.NONE)\n\t\t\t{\n\t\t\t\tvar graphicsNode = initGraphics(elm, Module);\n\t\t\t}\n\n\t\t\tvar rootNode = { kids: inputs };\n\t\t\ttrimDeadNodes(rootNode);\n\t\t\tinputs = rootNode.kids;\n\t\t\tfilterListeners(inputs, listeners);\n\n\t\t\taddReceivers(elm.ports);\n\n\t\t\tif (typeof moduleToReplace !== 'undefined')\n\t\t\t{\n\t\t\t\thotSwap(moduleToReplace, elm);\n\n\t\t\t\t// rerender scene if graphics are enabled.\n\t\t\t\tif (typeof graphicsNode !== 'undefined')\n\t\t\t\t{\n\t\t\t\t\tgraphicsNode.notify(0, true, 0);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tswap: swap,\n\t\t\t\tports: elm.ports,\n\t\t\t\tdispose: dispose\n\t\t\t};\n\t\t}\n\n\t\tfunction checkInputs(elm)\n\t\t{\n\t\t\tvar argsTracker = elm.argsTracker;\n\t\t\tfor (var name in argsTracker)\n\t\t\t{\n\t\t\t\tif (!argsTracker[name].used)\n\t\t\t\t{\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\"Port Error:\\nYou provided an argument named '\" + name +\n\t\t\t\t\t\t\"' but there is no corresponding port!\\n\\n\" +\n\t\t\t\t\t\t\"Maybe add a port '\" + name + \"' to your Elm module?\\n\" +\n\t\t\t\t\t\t\"Maybe remove the '\" + name + \"' argument from your initialization code in JS?\"\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfunction errorNode(message)\n\t\t{\n\t\t\tvar code = document.createElement('code');\n\n\t\t\tvar lines = message.split('\\n');\n\t\t\tcode.appendChild(document.createTextNode(lines[0]));\n\t\t\tcode.appendChild(document.createElement('br'));\n\t\t\tcode.appendChild(document.createElement('br'));\n\t\t\tfor (var i = 1; i < lines.length; ++i)\n\t\t\t{\n\t\t\t\tcode.appendChild(document.createTextNode('\\u00A0 \\u00A0 ' + lines[i].replace(/ /g, '\\u00A0 ')));\n\t\t\t\tcode.appendChild(document.createElement('br'));\n\t\t\t}\n\t\t\tcode.appendChild(document.createElement('br'));\n\t\t\tcode.appendChild(document.createTextNode('Open the developer console for more details.'));\n\t\t\treturn code;\n\t\t}\n\n\n\t\t//// FILTER SIGNALS ////\n\n\t\t// TODO: move this code into the signal module and create a function\n\t\t// Signal.initializeGraph that actually instantiates everything.\n\n\t\tfunction filterListeners(inputs, listeners)\n\t\t{\n\t\t\tloop:\n\t\t\tfor (var i = listeners.length; i--; )\n\t\t\t{\n\t\t\t\tvar listener = listeners[i];\n\t\t\t\tfor (var j = inputs.length; j--; )\n\t\t\t\t{\n\t\t\t\t\tif (listener.relevantInputs.indexOf(inputs[j].id) >= 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue loop;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tlistener.domNode.removeEventListener(listener.eventName, listener.func);\n\t\t\t}\n\t\t}\n\n\t\tfunction removeListeners(listeners)\n\t\t{\n\t\t\tfor (var i = listeners.length; i--; )\n\t\t\t{\n\t\t\t\tvar listener = listeners[i];\n\t\t\t\tlistener.domNode.removeEventListener(listener.eventName, listener.func);\n\t\t\t}\n\t\t}\n\n\t\t// add receivers for built-in ports if they are defined\n\t\tfunction addReceivers(ports)\n\t\t{\n\t\t\tif ('title' in ports)\n\t\t\t{\n\t\t\t\tif (typeof ports.title === 'string')\n\t\t\t\t{\n\t\t\t\t\tdocument.title = ports.title;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tports.title.subscribe(function(v) { document.title = v; });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ('redirect' in ports)\n\t\t\t{\n\t\t\t\tports.redirect.subscribe(function(v) {\n\t\t\t\t\tif (v.length > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\twindow.location = v;\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\n\t\t// returns a boolean representing whether the node is alive or not.\n\t\tfunction trimDeadNodes(node)\n\t\t{\n\t\t\tif (node.isOutput)\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tvar liveKids = [];\n\t\t\tfor (var i = node.kids.length; i--; )\n\t\t\t{\n\t\t\t\tvar kid = node.kids[i];\n\t\t\t\tif (trimDeadNodes(kid))\n\t\t\t\t{\n\t\t\t\t\tliveKids.push(kid);\n\t\t\t\t}\n\t\t\t}\n\t\t\tnode.kids = liveKids;\n\n\t\t\treturn liveKids.length > 0;\n\t\t}\n\n\n\t\t//// RENDERING ////\n\n\t\tfunction initGraphics(elm, Module)\n\t\t{\n\t\t\tif (!('main' in Module))\n\t\t\t{\n\t\t\t\tthrow new Error(\"'main' is missing! What do I display?!\");\n\t\t\t}\n\n\t\t\tvar signalGraph = Module.main;\n\n\t\t\t// make sure the signal graph is actually a signal & extract the visual model\n\t\t\tif (!('notify' in signalGraph))\n\t\t\t{\n\t\t\t\tsignalGraph = Elm.Signal.make(elm).constant(signalGraph);\n\t\t\t}\n\t\t\tvar initialScene = signalGraph.value;\n\n\t\t\t// Figure out what the render functions should be\n\t\t\tvar render;\n\t\t\tvar update;\n\t\t\tif (initialScene.ctor === 'Element_elm_builtin')\n\t\t\t{\n\t\t\t\tvar Element = Elm.Native.Graphics.Element.make(elm);\n\t\t\t\trender = Element.render;\n\t\t\t\tupdate = Element.updateAndReplace;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tvar VirtualDom = Elm.Native.VirtualDom.make(elm);\n\t\t\t\trender = VirtualDom.render;\n\t\t\t\tupdate = VirtualDom.updateAndReplace;\n\t\t\t}\n\n\t\t\t// Add the initialScene to the DOM\n\t\t\tvar container = elm.node;\n\t\t\tvar node = render(initialScene);\n\t\t\twhile (container.firstChild)\n\t\t\t{\n\t\t\t\tcontainer.removeChild(container.firstChild);\n\t\t\t}\n\t\t\tcontainer.appendChild(node);\n\n\t\t\tvar _requestAnimationFrame =\n\t\t\t\ttypeof requestAnimationFrame !== 'undefined'\n\t\t\t\t\t? requestAnimationFrame\n\t\t\t\t\t: function(cb) { setTimeout(cb, 1000 / 60); }\n\t\t\t\t\t;\n\n\t\t\t// domUpdate is called whenever the main Signal changes.\n\t\t\t//\n\t\t\t// domUpdate and drawCallback implement a small state machine in order\n\t\t\t// to schedule only 1 draw per animation frame. This enforces that\n\t\t\t// once draw has been called, it will not be called again until the\n\t\t\t// next frame.\n\t\t\t//\n\t\t\t// drawCallback is scheduled whenever\n\t\t\t// 1. The state transitions from PENDING_REQUEST to EXTRA_REQUEST, or\n\t\t\t// 2. The state transitions from NO_REQUEST to PENDING_REQUEST\n\t\t\t//\n\t\t\t// Invariants:\n\t\t\t// 1. In the NO_REQUEST state, there is never a scheduled drawCallback.\n\t\t\t// 2. In the PENDING_REQUEST and EXTRA_REQUEST states, there is always exactly 1\n\t\t\t// scheduled drawCallback.\n\t\t\tvar NO_REQUEST = 0;\n\t\t\tvar PENDING_REQUEST = 1;\n\t\t\tvar EXTRA_REQUEST = 2;\n\t\t\tvar state = NO_REQUEST;\n\t\t\tvar savedScene = initialScene;\n\t\t\tvar scheduledScene = initialScene;\n\n\t\t\tfunction domUpdate(newScene)\n\t\t\t{\n\t\t\t\tscheduledScene = newScene;\n\n\t\t\t\tswitch (state)\n\t\t\t\t{\n\t\t\t\t\tcase NO_REQUEST:\n\t\t\t\t\t\t_requestAnimationFrame(drawCallback);\n\t\t\t\t\t\tstate = PENDING_REQUEST;\n\t\t\t\t\t\treturn;\n\t\t\t\t\tcase PENDING_REQUEST:\n\t\t\t\t\t\tstate = PENDING_REQUEST;\n\t\t\t\t\t\treturn;\n\t\t\t\t\tcase EXTRA_REQUEST:\n\t\t\t\t\t\tstate = PENDING_REQUEST;\n\t\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfunction drawCallback()\n\t\t\t{\n\t\t\t\tswitch (state)\n\t\t\t\t{\n\t\t\t\t\tcase NO_REQUEST:\n\t\t\t\t\t\t// This state should not be possible. How can there be no\n\t\t\t\t\t\t// request, yet somehow we are actively fulfilling a\n\t\t\t\t\t\t// request?\n\t\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\t'Unexpected draw callback.\\n' +\n\t\t\t\t\t\t\t'Please report this to .'\n\t\t\t\t\t\t);\n\n\t\t\t\t\tcase PENDING_REQUEST:\n\t\t\t\t\t\t// At this point, we do not *know* that another frame is\n\t\t\t\t\t\t// needed, but we make an extra request to rAF just in\n\t\t\t\t\t\t// case. It's possible to drop a frame if rAF is called\n\t\t\t\t\t\t// too late, so we just do it preemptively.\n\t\t\t\t\t\t_requestAnimationFrame(drawCallback);\n\t\t\t\t\t\tstate = EXTRA_REQUEST;\n\n\t\t\t\t\t\t// There's also stuff we definitely need to draw.\n\t\t\t\t\t\tdraw();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\tcase EXTRA_REQUEST:\n\t\t\t\t\t\t// Turns out the extra request was not needed, so we will\n\t\t\t\t\t\t// stop calling rAF. No reason to call it all the time if\n\t\t\t\t\t\t// no one needs it.\n\t\t\t\t\t\tstate = NO_REQUEST;\n\t\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfunction draw()\n\t\t\t{\n\t\t\t\tupdate(elm.node.firstChild, savedScene, scheduledScene);\n\t\t\t\tif (elm.Native.Window)\n\t\t\t\t{\n\t\t\t\t\telm.Native.Window.values.resizeIfNeeded();\n\t\t\t\t}\n\t\t\t\tsavedScene = scheduledScene;\n\t\t\t}\n\n\t\t\tvar renderer = Elm.Native.Signal.make(elm).output('main', domUpdate, signalGraph);\n\n\t\t\t// must check for resize after 'renderer' is created so\n\t\t\t// that changes show up.\n\t\t\tif (elm.Native.Window)\n\t\t\t{\n\t\t\t\telm.Native.Window.values.resizeIfNeeded();\n\t\t\t}\n\n\t\t\treturn renderer;\n\t\t}\n\n\t\t//// HOT SWAPPING ////\n\n\t\t// Returns boolean indicating if the swap was successful.\n\t\t// Requires that the two signal graphs have exactly the same\n\t\t// structure.\n\t\tfunction hotSwap(from, to)\n\t\t{\n\t\t\tfunction similar(nodeOld, nodeNew)\n\t\t\t{\n\t\t\t\tif (nodeOld.id !== nodeNew.id)\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tif (nodeOld.isOutput)\n\t\t\t\t{\n\t\t\t\t\treturn nodeNew.isOutput;\n\t\t\t\t}\n\t\t\t\treturn nodeOld.kids.length === nodeNew.kids.length;\n\t\t\t}\n\t\t\tfunction swap(nodeOld, nodeNew)\n\t\t\t{\n\t\t\t\tnodeNew.value = nodeOld.value;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tvar canSwap = depthFirstTraversals(similar, from.inputs, to.inputs);\n\t\t\tif (canSwap)\n\t\t\t{\n\t\t\t\tdepthFirstTraversals(swap, from.inputs, to.inputs);\n\t\t\t}\n\t\t\tfrom.node.parentNode.replaceChild(to.node, from.node);\n\n\t\t\treturn canSwap;\n\t\t}\n\n\t\t// Returns false if the node operation f ever fails.\n\t\tfunction depthFirstTraversals(f, queueOld, queueNew)\n\t\t{\n\t\t\tif (queueOld.length !== queueNew.length)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tqueueOld = queueOld.slice(0);\n\t\t\tqueueNew = queueNew.slice(0);\n\n\t\t\tvar seen = [];\n\t\t\twhile (queueOld.length > 0 && queueNew.length > 0)\n\t\t\t{\n\t\t\t\tvar nodeOld = queueOld.pop();\n\t\t\t\tvar nodeNew = queueNew.pop();\n\t\t\t\tif (seen.indexOf(nodeOld.id) < 0)\n\t\t\t\t{\n\t\t\t\t\tif (!f(nodeOld, nodeNew))\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tqueueOld = queueOld.concat(nodeOld.kids || []);\n\t\t\t\t\tqueueNew = queueNew.concat(nodeNew.kids || []);\n\t\t\t\t\tseen.push(nodeOld.id);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}());\n\n\tfunction F2(fun)\n\t{\n\t\tfunction wrapper(a) { return function(b) { return fun(a,b); }; }\n\t\twrapper.arity = 2;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction F3(fun)\n\t{\n\t\tfunction wrapper(a) {\n\t\t\treturn function(b) { return function(c) { return fun(a, b, c); }; };\n\t\t}\n\t\twrapper.arity = 3;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction F4(fun)\n\t{\n\t\tfunction wrapper(a) { return function(b) { return function(c) {\n\t\t\treturn function(d) { return fun(a, b, c, d); }; }; };\n\t\t}\n\t\twrapper.arity = 4;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction F5(fun)\n\t{\n\t\tfunction wrapper(a) { return function(b) { return function(c) {\n\t\t\treturn function(d) { return function(e) { return fun(a, b, c, d, e); }; }; }; };\n\t\t}\n\t\twrapper.arity = 5;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction F6(fun)\n\t{\n\t\tfunction wrapper(a) { return function(b) { return function(c) {\n\t\t\treturn function(d) { return function(e) { return function(f) {\n\t\t\treturn fun(a, b, c, d, e, f); }; }; }; }; };\n\t\t}\n\t\twrapper.arity = 6;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction F7(fun)\n\t{\n\t\tfunction wrapper(a) { return function(b) { return function(c) {\n\t\t\treturn function(d) { return function(e) { return function(f) {\n\t\t\treturn function(g) { return fun(a, b, c, d, e, f, g); }; }; }; }; }; };\n\t\t}\n\t\twrapper.arity = 7;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction F8(fun)\n\t{\n\t\tfunction wrapper(a) { return function(b) { return function(c) {\n\t\t\treturn function(d) { return function(e) { return function(f) {\n\t\t\treturn function(g) { return function(h) {\n\t\t\treturn fun(a, b, c, d, e, f, g, h); }; }; }; }; }; }; };\n\t\t}\n\t\twrapper.arity = 8;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction F9(fun)\n\t{\n\t\tfunction wrapper(a) { return function(b) { return function(c) {\n\t\t\treturn function(d) { return function(e) { return function(f) {\n\t\t\treturn function(g) { return function(h) { return function(i) {\n\t\t\treturn fun(a, b, c, d, e, f, g, h, i); }; }; }; }; }; }; }; };\n\t\t}\n\t\twrapper.arity = 9;\n\t\twrapper.func = fun;\n\t\treturn wrapper;\n\t}\n\n\tfunction A2(fun, a, b)\n\t{\n\t\treturn fun.arity === 2\n\t\t\t? fun.func(a, b)\n\t\t\t: fun(a)(b);\n\t}\n\tfunction A3(fun, a, b, c)\n\t{\n\t\treturn fun.arity === 3\n\t\t\t? fun.func(a, b, c)\n\t\t\t: fun(a)(b)(c);\n\t}\n\tfunction A4(fun, a, b, c, d)\n\t{\n\t\treturn fun.arity === 4\n\t\t\t? fun.func(a, b, c, d)\n\t\t\t: fun(a)(b)(c)(d);\n\t}\n\tfunction A5(fun, a, b, c, d, e)\n\t{\n\t\treturn fun.arity === 5\n\t\t\t? fun.func(a, b, c, d, e)\n\t\t\t: fun(a)(b)(c)(d)(e);\n\t}\n\tfunction A6(fun, a, b, c, d, e, f)\n\t{\n\t\treturn fun.arity === 6\n\t\t\t? fun.func(a, b, c, d, e, f)\n\t\t\t: fun(a)(b)(c)(d)(e)(f);\n\t}\n\tfunction A7(fun, a, b, c, d, e, f, g)\n\t{\n\t\treturn fun.arity === 7\n\t\t\t? fun.func(a, b, c, d, e, f, g)\n\t\t\t: fun(a)(b)(c)(d)(e)(f)(g);\n\t}\n\tfunction A8(fun, a, b, c, d, e, f, g, h)\n\t{\n\t\treturn fun.arity === 8\n\t\t\t? fun.func(a, b, c, d, e, f, g, h)\n\t\t\t: fun(a)(b)(c)(d)(e)(f)(g)(h);\n\t}\n\tfunction A9(fun, a, b, c, d, e, f, g, h, i)\n\t{\n\t\treturn fun.arity === 9\n\t\t\t? fun.func(a, b, c, d, e, f, g, h, i)\n\t\t\t: fun(a)(b)(c)(d)(e)(f)(g)(h)(i);\n\t}\n}\n\nElm.Native = Elm.Native || {};\nElm.Native.Utils = {};\nElm.Native.Utils.make = function(localRuntime) {\n\tlocalRuntime.Native = localRuntime.Native || {};\n\tlocalRuntime.Native.Utils = localRuntime.Native.Utils || {};\n\tif (localRuntime.Native.Utils.values)\n\t{\n\t\treturn localRuntime.Native.Utils.values;\n\t}\n\n\n\t// COMPARISONS\n\n\tfunction eq(l, r)\n\t{\n\t\tvar stack = [{'x': l, 'y': r}];\n\t\twhile (stack.length > 0)\n\t\t{\n\t\t\tvar front = stack.pop();\n\t\t\tvar x = front.x;\n\t\t\tvar y = front.y;\n\t\t\tif (x === y)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (typeof x === 'object')\n\t\t\t{\n\t\t\t\tvar c = 0;\n\t\t\t\tfor (var i in x)\n\t\t\t\t{\n\t\t\t\t\t++c;\n\t\t\t\t\tif (i in y)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (i !== 'ctor')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstack.push({ 'x': x[i], 'y': y[i] });\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif ('ctor' in x)\n\t\t\t\t{\n\t\t\t\t\tstack.push({'x': x.ctor, 'y': y.ctor});\n\t\t\t\t}\n\t\t\t\tif (c !== Object.keys(y).length)\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (typeof x === 'function')\n\t\t\t{\n\t\t\t\tthrow new Error('Equality error: general function equality is ' +\n\t\t\t\t\t\t\t\t'undecidable, and therefore, unsupported');\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t// code in Generate/JavaScript.hs depends on the particular\n\t// integer values assigned to LT, EQ, and GT\n\tvar LT = -1, EQ = 0, GT = 1, ord = ['LT', 'EQ', 'GT'];\n\n\tfunction compare(x, y)\n\t{\n\t\treturn {\n\t\t\tctor: ord[cmp(x, y) + 1]\n\t\t};\n\t}\n\n\tfunction cmp(x, y) {\n\t\tvar ord;\n\t\tif (typeof x !== 'object')\n\t\t{\n\t\t\treturn x === y ? EQ : x < y ? LT : GT;\n\t\t}\n\t\telse if (x.isChar)\n\t\t{\n\t\t\tvar a = x.toString();\n\t\t\tvar b = y.toString();\n\t\t\treturn a === b\n\t\t\t\t? EQ\n\t\t\t\t: a < b\n\t\t\t\t\t? LT\n\t\t\t\t\t: GT;\n\t\t}\n\t\telse if (x.ctor === '::' || x.ctor === '[]')\n\t\t{\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tif (x.ctor === '[]' && y.ctor === '[]')\n\t\t\t\t{\n\t\t\t\t\treturn EQ;\n\t\t\t\t}\n\t\t\t\tif (x.ctor !== y.ctor)\n\t\t\t\t{\n\t\t\t\t\treturn x.ctor === '[]' ? LT : GT;\n\t\t\t\t}\n\t\t\t\tord = cmp(x._0, y._0);\n\t\t\t\tif (ord !== EQ)\n\t\t\t\t{\n\t\t\t\t\treturn ord;\n\t\t\t\t}\n\t\t\t\tx = x._1;\n\t\t\t\ty = y._1;\n\t\t\t}\n\t\t}\n\t\telse if (x.ctor.slice(0, 6) === '_Tuple')\n\t\t{\n\t\t\tvar n = x.ctor.slice(6) - 0;\n\t\t\tvar err = 'cannot compare tuples with more than 6 elements.';\n\t\t\tif (n === 0) return EQ;\n\t\t\tif (n >= 1) { ord = cmp(x._0, y._0); if (ord !== EQ) return ord;\n\t\t\tif (n >= 2) { ord = cmp(x._1, y._1); if (ord !== EQ) return ord;\n\t\t\tif (n >= 3) { ord = cmp(x._2, y._2); if (ord !== EQ) return ord;\n\t\t\tif (n >= 4) { ord = cmp(x._3, y._3); if (ord !== EQ) return ord;\n\t\t\tif (n >= 5) { ord = cmp(x._4, y._4); if (ord !== EQ) return ord;\n\t\t\tif (n >= 6) { ord = cmp(x._5, y._5); if (ord !== EQ) return ord;\n\t\t\tif (n >= 7) throw new Error('Comparison error: ' + err); } } } } } }\n\t\t\treturn EQ;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow new Error('Comparison error: comparison is only defined on ints, ' +\n\t\t\t\t\t\t\t'floats, times, chars, strings, lists of comparable values, ' +\n\t\t\t\t\t\t\t'and tuples of comparable values.');\n\t\t}\n\t}\n\n\n\t// TUPLES\n\n\tvar Tuple0 = {\n\t\tctor: '_Tuple0'\n\t};\n\n\tfunction Tuple2(x, y)\n\t{\n\t\treturn {\n\t\t\tctor: '_Tuple2',\n\t\t\t_0: x,\n\t\t\t_1: y\n\t\t};\n\t}\n\n\n\t// LITERALS\n\n\tfunction chr(c)\n\t{\n\t\tvar x = new String(c);\n\t\tx.isChar = true;\n\t\treturn x;\n\t}\n\n\tfunction txt(str)\n\t{\n\t\tvar t = new String(str);\n\t\tt.text = true;\n\t\treturn t;\n\t}\n\n\n\t// GUID\n\n\tvar count = 0;\n\tfunction guid(_)\n\t{\n\t\treturn count++;\n\t}\n\n\n\t// RECORDS\n\n\tfunction update(oldRecord, updatedFields)\n\t{\n\t\tvar newRecord = {};\n\t\tfor (var key in oldRecord)\n\t\t{\n\t\t\tvar value = (key in updatedFields) ? updatedFields[key] : oldRecord[key];\n\t\t\tnewRecord[key] = value;\n\t\t}\n\t\treturn newRecord;\n\t}\n\n\n\t// MOUSE COORDINATES\n\n\tfunction getXY(e)\n\t{\n\t\tvar posx = 0;\n\t\tvar posy = 0;\n\t\tif (e.pageX || e.pageY)\n\t\t{\n\t\t\tposx = e.pageX;\n\t\t\tposy = e.pageY;\n\t\t}\n\t\telse if (e.clientX || e.clientY)\n\t\t{\n\t\t\tposx = e.clientX + document.body.scrollLeft + document.documentElement.scrollLeft;\n\t\t\tposy = e.clientY + document.body.scrollTop + document.documentElement.scrollTop;\n\t\t}\n\n\t\tif (localRuntime.isEmbed())\n\t\t{\n\t\t\tvar rect = localRuntime.node.getBoundingClientRect();\n\t\t\tvar relx = rect.left + document.body.scrollLeft + document.documentElement.scrollLeft;\n\t\t\tvar rely = rect.top + document.body.scrollTop + document.documentElement.scrollTop;\n\t\t\t// TODO: figure out if there is a way to avoid rounding here\n\t\t\tposx = posx - Math.round(relx) - localRuntime.node.clientLeft;\n\t\t\tposy = posy - Math.round(rely) - localRuntime.node.clientTop;\n\t\t}\n\t\treturn Tuple2(posx, posy);\n\t}\n\n\n\t//// LIST STUFF ////\n\n\tvar Nil = { ctor: '[]' };\n\n\tfunction Cons(hd, tl)\n\t{\n\t\treturn {\n\t\t\tctor: '::',\n\t\t\t_0: hd,\n\t\t\t_1: tl\n\t\t};\n\t}\n\n\tfunction list(arr)\n\t{\n\t\tvar out = Nil;\n\t\tfor (var i = arr.length; i--; )\n\t\t{\n\t\t\tout = Cons(arr[i], out);\n\t\t}\n\t\treturn out;\n\t}\n\n\tfunction range(lo, hi)\n\t{\n\t\tvar list = Nil;\n\t\tif (lo <= hi)\n\t\t{\n\t\t\tdo\n\t\t\t{\n\t\t\t\tlist = Cons(hi, list);\n\t\t\t}\n\t\t\twhile (hi-- > lo);\n\t\t}\n\t\treturn list;\n\t}\n\n\tfunction append(xs, ys)\n\t{\n\t\t// append Strings\n\t\tif (typeof xs === 'string')\n\t\t{\n\t\t\treturn xs + ys;\n\t\t}\n\n\t\t// append Text\n\t\tif (xs.ctor.slice(0, 5) === 'Text:')\n\t\t{\n\t\t\treturn {\n\t\t\t\tctor: 'Text:Append',\n\t\t\t\t_0: xs,\n\t\t\t\t_1: ys\n\t\t\t};\n\t\t}\n\n\n\t\t// append Lists\n\t\tif (xs.ctor === '[]')\n\t\t{\n\t\t\treturn ys;\n\t\t}\n\t\tvar root = Cons(xs._0, Nil);\n\t\tvar curr = root;\n\t\txs = xs._1;\n\t\twhile (xs.ctor !== '[]')\n\t\t{\n\t\t\tcurr._1 = Cons(xs._0, Nil);\n\t\t\txs = xs._1;\n\t\t\tcurr = curr._1;\n\t\t}\n\t\tcurr._1 = ys;\n\t\treturn root;\n\t}\n\n\n\t// CRASHES\n\n\tfunction crash(moduleName, region)\n\t{\n\t\treturn function(message) {\n\t\t\tthrow new Error(\n\t\t\t\t'Ran into a `Debug.crash` in module `' + moduleName + '` ' + regionToString(region) + '\\n'\n\t\t\t\t+ 'The message provided by the code author is:\\n\\n '\n\t\t\t\t+ message\n\t\t\t);\n\t\t};\n\t}\n\n\tfunction crashCase(moduleName, region, value)\n\t{\n\t\treturn function(message) {\n\t\t\tthrow new Error(\n\t\t\t\t'Ran into a `Debug.crash` in module `' + moduleName + '`\\n\\n'\n\t\t\t\t+ 'This was caused by the `case` expression ' + regionToString(region) + '.\\n'\n\t\t\t\t+ 'One of the branches ended with a crash and the following value got through:\\n\\n ' + toString(value) + '\\n\\n'\n\t\t\t\t+ 'The message provided by the code author is:\\n\\n '\n\t\t\t\t+ message\n\t\t\t);\n\t\t};\n\t}\n\n\tfunction regionToString(region)\n\t{\n\t\tif (region.start.line == region.end.line)\n\t\t{\n\t\t\treturn 'on line ' + region.start.line;\n\t\t}\n\t\treturn 'between lines ' + region.start.line + ' and ' + region.end.line;\n\t}\n\n\n\t// BAD PORTS\n\n\tfunction badPort(expected, received)\n\t{\n\t\tthrow new Error(\n\t\t\t'Runtime error when sending values through a port.\\n\\n'\n\t\t\t+ 'Expecting ' + expected + ' but was given ' + formatValue(received)\n\t\t);\n\t}\n\n\tfunction formatValue(value)\n\t{\n\t\t// Explicity format undefined values as \"undefined\"\n\t\t// because JSON.stringify(undefined) unhelpfully returns \"\"\n\t\treturn (value === undefined) ? \"undefined\" : JSON.stringify(value);\n\t}\n\n\n\t// TO STRING\n\n\tvar _Array;\n\tvar Dict;\n\tvar List;\n\n\tvar toString = function(v)\n\t{\n\t\tvar type = typeof v;\n\t\tif (type === 'function')\n\t\t{\n\t\t\tvar name = v.func ? v.func.name : v.name;\n\t\t\treturn '';\n\t\t}\n\t\telse if (type === 'boolean')\n\t\t{\n\t\t\treturn v ? 'True' : 'False';\n\t\t}\n\t\telse if (type === 'number')\n\t\t{\n\t\t\treturn v + '';\n\t\t}\n\t\telse if ((v instanceof String) && v.isChar)\n\t\t{\n\t\t\treturn '\\'' + addSlashes(v, true) + '\\'';\n\t\t}\n\t\telse if (type === 'string')\n\t\t{\n\t\t\treturn '\"' + addSlashes(v, false) + '\"';\n\t\t}\n\t\telse if (type === 'object' && 'ctor' in v)\n\t\t{\n\t\t\tif (v.ctor.substring(0, 6) === '_Tuple')\n\t\t\t{\n\t\t\t\tvar output = [];\n\t\t\t\tfor (var k in v)\n\t\t\t\t{\n\t\t\t\t\tif (k === 'ctor') continue;\n\t\t\t\t\toutput.push(toString(v[k]));\n\t\t\t\t}\n\t\t\t\treturn '(' + output.join(',') + ')';\n\t\t\t}\n\t\t\telse if (v.ctor === '_Array')\n\t\t\t{\n\t\t\t\tif (!_Array)\n\t\t\t\t{\n\t\t\t\t\t_Array = Elm.Array.make(localRuntime);\n\t\t\t\t}\n\t\t\t\tvar list = _Array.toList(v);\n\t\t\t\treturn 'Array.fromList ' + toString(list);\n\t\t\t}\n\t\t\telse if (v.ctor === '::')\n\t\t\t{\n\t\t\t\tvar output = '[' + toString(v._0);\n\t\t\t\tv = v._1;\n\t\t\t\twhile (v.ctor === '::')\n\t\t\t\t{\n\t\t\t\t\toutput += ',' + toString(v._0);\n\t\t\t\t\tv = v._1;\n\t\t\t\t}\n\t\t\t\treturn output + ']';\n\t\t\t}\n\t\t\telse if (v.ctor === '[]')\n\t\t\t{\n\t\t\t\treturn '[]';\n\t\t\t}\n\t\t\telse if (v.ctor === 'RBNode_elm_builtin' || v.ctor === 'RBEmpty_elm_builtin' || v.ctor === 'Set_elm_builtin')\n\t\t\t{\n\t\t\t\tif (!Dict)\n\t\t\t\t{\n\t\t\t\t\tDict = Elm.Dict.make(localRuntime);\n\t\t\t\t}\n\t\t\t\tvar list;\n\t\t\t\tvar name;\n\t\t\t\tif (v.ctor === 'Set_elm_builtin')\n\t\t\t\t{\n\t\t\t\t\tif (!List)\n\t\t\t\t\t{\n\t\t\t\t\t\tList = Elm.List.make(localRuntime);\n\t\t\t\t\t}\n\t\t\t\t\tname = 'Set';\n\t\t\t\t\tlist = A2(List.map, function(x) {return x._0; }, Dict.toList(v._0));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tname = 'Dict';\n\t\t\t\t\tlist = Dict.toList(v);\n\t\t\t\t}\n\t\t\t\treturn name + '.fromList ' + toString(list);\n\t\t\t}\n\t\t\telse if (v.ctor.slice(0, 5) === 'Text:')\n\t\t\t{\n\t\t\t\treturn '';\n\t\t\t}\n\t\t\telse if (v.ctor === 'Element_elm_builtin')\n\t\t\t{\n\t\t\t\treturn ''\n\t\t\t}\n\t\t\telse if (v.ctor === 'Form_elm_builtin')\n\t\t\t{\n\t\t\t\treturn '