git.iko.soy/rowtype-yoga/ry-blocks
on main help sign in
swap
b097d44117 ahead, 0 behind
.idea/.gitignorenew file+3
since splitsnapshots
unifiedsplit
@@ -0,0 +1,3 @@
1+# Default ignored files
2+/shelf/
3+/workspace.xml
.idea/misc.xmlnew file+6
@@ -0,0 +1,6 @@
1+<?xml version="1.0" encoding="UTF-8"?>
2+<project version="4">
3+ <component name="ProjectRootManager">
4+ <output url="file://$PROJECT_DIR$/out" />
5+ </component>
6+</project>
.idea/modules.xmlnew file+8
@@ -0,0 +1,8 @@
1+<?xml version="1.0" encoding="UTF-8"?>
2+<project version="4">
3+ <component name="ProjectModuleManager">
4+ <modules>
5+ <module fileurl="file://$PROJECT_DIR$/.idea/ry-blocks.iml" filepath="$PROJECT_DIR$/.idea/ry-blocks.iml" />
6+ </modules>
7+ </component>
8+</project>
.idea/ry-blocks.imlnew file+9
@@ -0,0 +1,9 @@
1+<?xml version="1.0" encoding="UTF-8"?>
2+<module type="JAVA_MODULE" version="4">
3+ <component name="NewModuleRootManager" inherit-compiler-output="true">
4+ <exclude-output />
5+ <content url="file://$MODULE_DIR$" />
6+ <orderEntry type="inheritedJdk" />
7+ <orderEntry type="sourceFolder" forTests="false" />
8+ </component>
9+</module>
.idea/vcs.xmlnew file+6
@@ -0,0 +1,6 @@
1+<?xml version="1.0" encoding="UTF-8"?>
2+<project version="4">
3+ <component name="VcsDirectoryMappings">
4+ <mapping directory="" vcs="Git" />
5+ </component>
6+</project>
.psci_modules/index.jsdeleted−1
@@ -1 +0,0 @@
1−require('$PSCI')['$main']();
.purs-repldeleted−1
@@ -1 +0,0 @@
1−import Prelude
.storybook/logo.svgdeleted−1
@@ -1 +0,0 @@
1−<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" viewBox="0 0 372.65 283.62"><defs><style>.a{isolation:isolate;}.b,.c,.d,.e,.f,.g,.h,.i,.j,.k,.l,.m,.o,.p,.q,.r,.t{fill-rule:evenodd;}.b{fill:url(#a);}.c{fill:url(#b);}.d{fill:url(#c);}.e{fill:url(#d);}.f{fill:url(#e);}.g{fill:url(#f);}.h{fill:url(#g);}.i{fill:url(#h);}.j{fill:url(#i);}.k{fill:url(#j);}.l{fill:url(#k);}.m{opacity:0.7;fill:url(#l);}.n{opacity:0.68;mix-blend-mode:hard-light;}.o{fill:#ff0;}.p{fill:url(#m);}.q{fill:url(#n);}.r{fill:url(#o);}.s{opacity:0.74;}.s,.t{mix-blend-mode:multiply;}.t{fill:url(#p);}</style><linearGradient id="a" x1="270.71" y1="247.58" x2="262.86" y2="230.67" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#037a58"/><stop offset="0.05" stop-color="#02744d"/><stop offset="0.14" stop-color="#016b3d"/><stop offset="0.21" stop-color="#006837"/><stop offset="0.46" stop-color="#1c613d"/><stop offset="0.46" stop-color="#1c613d"/><stop offset="0.52" stop-color="#1e6534"/><stop offset="0.59" stop-color="#1e6631"/><stop offset="0.98" stop-color="#1d6131"/></linearGradient><linearGradient id="b" x1="137" y1="220.8" x2="124.33" y2="252.8" xlink:href="#a"/><linearGradient id="c" x1="294.01" y1="228.84" x2="292.8" y2="255.41" xlink:href="#a"/><linearGradient id="d" x1="107.12" y1="230.89" x2="107.72" y2="260.48" xlink:href="#a"/><linearGradient id="e" x1="262.48" y1="293.85" x2="279.39" y2="243.14" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#037a58"/><stop offset="0.05" stop-color="#02744d"/><stop offset="0.14" stop-color="#016b3d"/><stop offset="0.21" stop-color="#006837"/><stop offset="0.49" stop-color="#1b613c"/><stop offset="0.5" stop-color="#1c613c"/><stop offset="0.5" stop-color="#1c613b"/><stop offset="0.51" stop-color="#1e6532"/><stop offset="0.53" stop-color="#1e662f"/><stop offset="0.98" stop-color="#1d6131"/></linearGradient><linearGradient id="f" x1="123.24" y1="248.93" x2="135.31" y2="284.55" xlink:href="#e"/><linearGradient id="g" x1="143.95" y1="286.12" x2="256.36" y2="275.98" xlink:href="#e"/><linearGradient id="h" x1="190.11" y1="160.99" x2="260" y2="160.99" gradientTransform="matrix(0.8, -0.27, 0.32, 0.95, -54.09, 53.28)" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#e59cc9"/><stop offset="0.46" stop-color="#e196c5"/><stop offset="0.5" stop-color="#db82be"/><stop offset="0.56" stop-color="#d771b9"/><stop offset="0.63" stop-color="#d366b5"/><stop offset="0.73" stop-color="#d25fb3"/><stop offset="1" stop-color="#d15db2"/></linearGradient><linearGradient id="i" x1="264.25" y1="158.92" x2="219.51" y2="149.43" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#d15db2"/><stop offset="0.4" stop-color="#d25fb3"/><stop offset="0.54" stop-color="#d366b5"/><stop offset="0.65" stop-color="#d771b9"/><stop offset="0.73" stop-color="#db82be"/><stop offset="0.8" stop-color="#e196c5"/><stop offset="0.84" stop-color="#e49ac8"/><stop offset="1" stop-color="#e59cc9"/></linearGradient><linearGradient id="j" x1="234.73" y1="150.66" x2="302.41" y2="188.18" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#e59cc9"/><stop offset="0.55" stop-color="#e196c5"/><stop offset="0.59" stop-color="#db82be"/><stop offset="0.63" stop-color="#d771b9"/><stop offset="0.69" stop-color="#d366b5"/><stop offset="0.77" stop-color="#d25fb3"/><stop offset="1" stop-color="#d15db2"/></linearGradient><linearGradient id="k" x1="111.81" y1="187.65" x2="185.69" y2="151.61" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#e59cc9"/><stop offset="0.32" stop-color="#e196c5"/><stop offset="0.36" stop-color="#db82be"/><stop offset="0.42" stop-color="#d771b9"/><stop offset="0.49" stop-color="#d366b5"/><stop offset="0.58" stop-color="#d25fb3"/><stop offset="0.85" stop-color="#d15db2"/></linearGradient><linearGradient id="l" x1="207.91" y1="84.59" x2="207.91" y2="240.39" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#e5b5d3" stop-opacity="0"/><stop offset="0.07" stop-color="#e6b6d0" stop-opacity="0.02"/><stop offset="0.15" stop-color="#e7b9c9" stop-opacity="0.08"/><stop offset="0.24" stop-color="#eabfbc" stop-opacity="0.17"/><stop offset="0.34" stop-color="#eec6aa" stop-opacity="0.3"/><stop offset="0.44" stop-color="#f2d094" stop-opacity="0.47"/><stop offset="0.54" stop-color="#f8dc78" stop-opacity="0.67"/><stop offset="0.63" stop-color="#ffe959" stop-opacity="0.9"/></linearGradient><linearGradient id="m" x1="296.18" y1="227.11" x2="257.67" y2="188.6" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#d662b1"/><stop offset="1" stop-color="#e07ebc"/></linearGradient><linearGradient id="n" x1="118.1" y1="221.13" x2="147.51" y2="188.42" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#c959a9"/><stop offset="0.27" stop-color="#ca5cab"/><stop offset="0.5" stop-color="#cf67b0"/><stop offset="0.72" stop-color="#d678b8"/><stop offset="0.92" stop-color="#e090c3"/><stop offset="1" stop-color="#e59cc9"/></linearGradient><linearGradient id="o" x1="156.82" y1="210.09" x2="244.2" y2="209.5" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#c454aa"/><stop offset="0" stop-color="#c555ab"/><stop offset="0.08" stop-color="#d564bb"/><stop offset="0.13" stop-color="#db69c0"/><stop offset="0.27" stop-color="#da6ec1"/><stop offset="0.45" stop-color="#d87dc3"/><stop offset="0.48" stop-color="#d781c3"/><stop offset="0.49" stop-color="#d884c5"/><stop offset="0.54" stop-color="#dd8dc9"/><stop offset="0.61" stop-color="#de90cb"/><stop offset="0.62" stop-color="#de90cb"/><stop offset="1" stop-color="#de8ecb"/></linearGradient><linearGradient id="p" x1="204.12" y1="270.93" x2="204.12" y2="125.27" gradientUnits="userSpaceOnUse"><stop offset="0" stop-color="#470e3f"/><stop offset="0.2" stop-color="#97705b" stop-opacity="0.61"/><stop offset="0.42" stop-color="#d2b870" stop-opacity="0.32"/><stop offset="0.66" stop-color="#f4e37c" stop-opacity="0.15"/><stop offset="1" stop-color="#fff080" stop-opacity="0.1"/></linearGradient></defs><title>logo</title><g class="a"><path class="b" d="M240.1,219.84c-39.88,7.27-57.35,19.63-39,23s57.41,12.51,94.45-4c23.44-10.41,30.6-29,30.6-29S280,212.56,240.1,219.84Z" transform="translate(-14 -38.88)"/><path class="c" d="M95.27,235.85c37.56,15.24,87.06,10.46,105.38,7.11s-25.18-17.57-65.06-24.84-70.24-8-70.24-8S69,225.18,95.27,235.85Z" transform="translate(-14 -38.88)"/><path class="d" d="M293.22,260.93c-51.6,0-93.43-6.58-93.43-14.71s38.57-18,90.17-18,96.69,18,96.69,18S344.82,260.93,293.22,260.93Z" transform="translate(-14 -38.88)"/><path class="e" d="M107.43,231.5c51.6,0,93.44,6.59,93.44,14.72s-48.34,18-99.95,18-86.92-18-86.92-18S55.83,231.5,107.43,231.5Z" transform="translate(-14 -38.88)"/><path class="f" d="M240.1,286.13c-39.88-12.63-57.35-34.09-39-39.9s65.51-.27,105.39,12.36,39,33.4,39,33.4S280,298.77,240.1,286.13Z" transform="translate(-14 -38.88)"/><path class="g" d="M95.27,258.33c39.88-12.64,87.06-18.17,105.38-12.37s-25.18,30.53-65.06,43.16-79.35,2.6-79.35,2.6S55.39,271,95.27,258.33Z" transform="translate(-14 -38.88)"/><path class="h" d="M144.12,278.52c0-21.51,25.3-39,56.5-39s50,17.45,50,39-46.73,44-46.73,44S144.12,300,144.12,278.52Z" transform="translate(-14 -38.88)"/><path class="i" d="M205,146.42c8.48,33.6,11.56,50.94-6.39,57.07S157.08,188,145.89,155.2s-8.54-45.88,12.29-70.61C179.66,103.14,195.61,109,205,146.42Z" transform="translate(-14 -38.88)"/><path class="j" d="M198.61,148.9c-1.88,34.61-14.83,50.8,6.34,59.35s48.84-10.57,61.82-42.7-24.6-73.66-24.6-73.66S200.48,114.53,198.61,148.9Z" transform="translate(-14 -38.88)"/><path class="k" d="M235.61,183.4c-25,44.55-53.25,32.3-36.65,48.9s59.35.78,95.48-35.35,21.81-103.3,21.92-103.4C294.86,126.27,257.53,144.36,235.61,183.4Z" transform="translate(-14 -38.88)"/><path class="l" d="M180.22,184.89c25,44.55,53.25,32.3,36.65,48.91s-59.35.77-95.48-35.36S99.58,95.14,99.47,95.05C121,127.77,158.3,145.85,180.22,184.89Z" transform="translate(-14 -38.88)"/><path class="m" d="M316.36,93.55c-12.53,19.07-30.43,33.17-47.53,49.34-4.17-26.14-26.66-51-26.66-51s-30.63,16.64-40.56,43c-9.66-27.41-24.37-33.88-43.43-50.34-17,20.19-21.89,32.62-17,54.36-15.25-14-30.58-27-41.69-43.9.11.09-14.21,67.26,21.92,103.39,32.06,32.06,69.33,48.13,88.92,39.75,20.46,4.34,54.52-11.63,84.13-41.24C330.57,160.82,316.25,93.65,316.36,93.55ZM194.23,204.43a18.66,18.66,0,0,0,3.32-.61,23.67,23.67,0,0,0,7.4,4.43,28,28,0,0,0,8.87,2,74.57,74.57,0,0,1-7,5.06A75.86,75.86,0,0,1,194.23,204.43Z" transform="translate(-14 -38.88)"/><g class="n"><path class="o" d="M247.46,124.39c.52.14.29,1,.93,1a9.17,9.17,0,0,1-3,1.34C245.54,125.33,247.52,126,247.46,124.39Z" transform="translate(-14 -38.88)"/><path class="o" d="M202.23,127.36c.39.1.46.5,1,.52C202.87,129,200.87,128.08,202.23,127.36Z" transform="translate(-14 -38.88)"/><path class="o" d="M213.65,132.68c1.28-1.84.64,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M233.78,138.37s0-.48,0-.49C236.15,137.57,231.37,140.9,233.78,138.37Z" transform="translate(-14 -38.88)"/><path class="o" d="M235.68,139.42a.49.49,0,0,1,1,0C236.4,140.15,236.22,139.39,235.68,139.42Z" transform="translate(-14 -38.88)"/><path class="o" d="M215.71,141.5c1.67-1.11-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M237,142.38c1.28-1.84.64,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M196.3,141.66c.77-1.57,1.12,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M219,143.58c1.67-1.11-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M186,143.66a.49.49,0,0,1,1,0C186.75,144.39,186.57,143.63,186,143.66Z" transform="translate(-14 -38.88)"/><path class="o" d="M200.07,144.24a.49.49,0,0,1,1,0C200.8,145,200.62,144.22,200.07,144.24Z" transform="translate(-14 -38.88)"/><path class="o" d="M170.47,144.47l1,0,0,1-1,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M242.12,147.93a1.33,1.33,0,0,1,.9,1.49A1.33,1.33,0,0,1,242.12,147.93Z" transform="translate(-14 -38.88)"/><path class="o" d="M222.65,149.55c1.67-1.11-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M231.28,151.85c.1-.57.9-.38,1.48-.43C232.65,152,231.86,151.79,231.28,151.85Z" transform="translate(-14 -38.88)"/><path class="o" d="M164.93,149.57c.77-1.57,1.12,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M192.3,156.05c1.29-1.84.64,1.63,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M152.52,156.33a.49.49,0,0,1,1,0C153.24,157.07,153.06,156.31,152.52,156.33Z" transform="translate(-14 -38.88)"/><path class="o" d="M249.8,161.35c.78-1.58,1.13,1.93,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M233.32,161.15c1.67-1.11-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M193.6,160c1.67-1.1-1.24,1.58,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M156.76,159.42c.39-.85.88,0,1.45.06C157.82,160.33,157.32,159.51,156.76,159.42Z" transform="translate(-14 -38.88)"/><path class="o" d="M243.91,163a1.34,1.34,0,0,1,.91,1.49A1.34,1.34,0,0,1,243.91,163Z" transform="translate(-14 -38.88)"/><path class="o" d="M246.31,163.63a.49.49,0,0,1,1,0C247,164.36,246.86,163.6,246.31,163.63Z" transform="translate(-14 -38.88)"/><path class="o" d="M158.61,161.44a.49.49,0,0,1,1,0C159.34,162.17,159.16,161.41,158.61,161.44Z" transform="translate(-14 -38.88)"/><path class="o" d="M266.89,170.3c1.29-1.84.64,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M275.57,171.63c.08-.13,1.08-.85,1.47-.42S275.08,172.46,275.57,171.63Z" transform="translate(-14 -38.88)"/><path class="o" d="M186.35,170.83c1.29-1.83.64,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M214.86,173.48c1.67-1.11-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M154.05,177.74a1.33,1.33,0,0,1,.91,1.49A1.34,1.34,0,0,1,154.05,177.74Z" transform="translate(-14 -38.88)"/><path class="o" d="M208.75,180.5c1.67-1.11-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M161.28,179c-1.55,1.73-1.57-1.54,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M174.83,179.57c.15-.6,1-.45,1,0C175.56,180.31,175.38,179.55,174.83,179.57Z" transform="translate(-14 -38.88)"/><path class="o" d="M253.26,183.32c.1-.57.9-.38,1.47-.43C254.63,183.46,253.83,183.27,253.26,183.32Z" transform="translate(-14 -38.88)"/><path class="o" d="M151.07,179.55c1.28-1.83.64,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M213.47,183.6c.25-1.19,1.88.05,1.41,1C214.25,184.44,214.16,183.75,213.47,183.6Z" transform="translate(-14 -38.88)"/><path class="o" d="M215.89,183.7c.77-1.57,1.13,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M251.72,185.19c.85.39,0,.89-.06,1.46C250.82,186.26,251.63,185.76,251.72,185.19Z" transform="translate(-14 -38.88)"/><path class="o" d="M254.57,186.77c1.28-1.84.64,1.63,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M263.24,188.1c1.29-1.84.64,1.63,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M166.38,184.56c1.32-1.62,1.07,2.54,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M223.94,188.4c.15-.6,1-.44,1,0C224.67,189.14,224.49,188.38,223.94,188.4Z" transform="translate(-14 -38.88)"/><path class="o" d="M273.8,191c.14-.6,1-.45,1,0C274.52,191.7,274.34,190.93,273.8,191Z" transform="translate(-14 -38.88)"/><path class="o" d="M243.21,191.63c.77-1.57,1.13,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M255.28,193.1c1.28-1.84.63,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M146.79,189.08c-1.24,1.54-2.26-1.44,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M155.53,189c1.73,1.54-1.54,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M197.13,191.66c1.67-1.11-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M251.36,193.91c1.67-1.1-1.24,1.58,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M193.6,194.9c.12-1.2,1.64-.07,1.94.08C195.16,196.42,194.52,194.48,193.6,194.9Z" transform="translate(-14 -38.88)"/><path class="o" d="M196,195.49a.49.49,0,0,1,1,0C196.73,196.22,196.55,195.46,196,195.49Z" transform="translate(-14 -38.88)"/><path class="o" d="M235.22,197.12c1.67-1.1-1.24,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M238.55,198.71c1.67-1.1-1.24,1.58,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M243.88,198.93c.1-.56.9-.37,1.47-.42C245.25,199.07,244.45,198.88,243.88,198.93Z" transform="translate(-14 -38.88)"/><path class="o" d="M213.78,199.62c.1-.56.9-.37,1.47-.42C215.15,199.76,214.35,199.57,213.78,199.62Z" transform="translate(-14 -38.88)"/><path class="o" d="M230.24,200.31c.1-.57.9-.37,1.47-.43C231.61,200.45,230.81,200.25,230.24,200.31Z" transform="translate(-14 -38.88)"/><path class="o" d="M210.83,200.47c.1-.56.9-.37,1.47-.42C212.2,200.61,211.4,200.42,210.83,200.47Z" transform="translate(-14 -38.88)"/><path class="o" d="M227.29,201.16c.78-1.58,1.13,1.93,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M250.47,203.57c.85.39,0,.89-.06,1.46C249.57,204.64,250.38,204.14,250.47,203.57Z" transform="translate(-14 -38.88)"/><path class="o" d="M193.3,202.17c.77-1.58,1.12,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M252.39,204.14a1.33,1.33,0,0,1,.91,1.49A1.33,1.33,0,0,1,252.39,204.14Z" transform="translate(-14 -38.88)"/><path class="o" d="M165.68,201.5c.84.16,1.07.88.89,2A2.12,2.12,0,0,1,165.68,201.5Z" transform="translate(-14 -38.88)"/><path class="o" d="M245.55,205.31c.77-1.58,1.13,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M219.34,205.68c.78-1.58,1.13,1.93,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M147.18,203.16c.1-.56.9-.37,1.47-.42C148.55,203.3,147.75,203.11,147.18,203.16Z" transform="translate(-14 -38.88)"/><path class="o" d="M207.68,206.16c.39-.85.89,0,1.46.06C208.74,207.07,208.25,206.25,207.68,206.16Z" transform="translate(-14 -38.88)"/><path class="o" d="M237.2,207.87c1.28-1.84.64,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M241.58,207.57c.85.39,0,.88-.06,1.45C240.67,208.63,241.48,208.14,241.58,207.57Z" transform="translate(-14 -38.88)"/><path class="o" d="M265.26,209.52a1.34,1.34,0,0,1,.91,1.5A1.34,1.34,0,0,1,265.26,209.52Z" transform="translate(-14 -38.88)"/><path class="o" d="M198.91,207.25c.84.15,1.07.88.88,2A2.15,2.15,0,0,1,198.91,207.25Z" transform="translate(-14 -38.88)"/><path class="o" d="M225,208.82s0-.48,0-.48C227.4,208,222.63,211.35,225,208.82Z" transform="translate(-14 -38.88)"/><path class="o" d="M255.06,210.07c.14-.6,1-.45,1,0C255.78,210.8,255.6,210,255.06,210.07Z" transform="translate(-14 -38.88)"/><path class="o" d="M196.47,207.63c1-.12,1.51.17,1.41,1l-1.45-.06Z" transform="translate(-14 -38.88)"/><path class="o" d="M262.78,210.88c.1-.57.9-.38,1.48-.43C264.15,211,263.36,210.82,262.78,210.88Z" transform="translate(-14 -38.88)"/><path class="o" d="M254,212a.49.49,0,0,1,1,0C254.73,212.7,254.55,211.94,254,212Z" transform="translate(-14 -38.88)"/><path class="o" d="M223.44,212.15c.77-1.58,1.13,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M224.29,215.1c.77-1.58,1.12,1.93,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M171.47,213.87c.77-1.57,1.13,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M191.26,216.15c-1.24,1.54-2.26-1.44,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M213.05,217.05c.18-.65,1.23-.35,2-.4,0,.47-.61.35-1,.44-.11.41.17.47.46.51C213.94,219.18,213.55,217,213.05,217.05Z" transform="translate(-14 -38.88)"/><path class="o" d="M170.9,215.79c1.68-1.1-1.23,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M176.23,216c-1.24,1.54-2.26-1.44,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M169.41,216.7c1.73,1.54-1.54,1.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M182,217.7a.49.49,0,0,1,1,0C182.71,218.44,182.53,217.68,182,217.7Z" transform="translate(-14 -38.88)"/><path class="o" d="M233.71,221.79a.49.49,0,0,1,1,0C234.43,222.53,234.26,221.77,233.71,221.79Z" transform="translate(-14 -38.88)"/><path class="o" d="M182.34,220.63c1.4.48.52.75.41,2C182.1,222.41,182.4,221.36,182.34,220.63Z" transform="translate(-14 -38.88)"/><path class="o" d="M176.84,224.76c1.28-1.83.64,1.64,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M178.29,224.83c.1-.57.9-.38,1.47-.43C179.66,225,178.86,224.77,178.29,224.83Z" transform="translate(-14 -38.88)"/><path class="o" d="M221.59,233.42c.77-1.58,1.12,1.93,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M171.57,234.73c.77-1.57,1.13,1.94,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M221.11,128.14c.33-1.39.73.78,1.43.55C222,130.27,221.61,128.1,221.11,128.14Z" transform="translate(-14 -38.88)"/><path class="o" d="M199,134.5c1.21,1.06-1.33,1.92-.14,3.39-.63-.2-.73-.89-1.41-1C198.31,136.43,198.59,135.38,199,134.5Z" transform="translate(-14 -38.88)"/><path class="o" d="M221.19,137.85c-.93-1.27,1.13,1,1.4,1.51C221.69,141,221.57,138.18,221.19,137.85Z" transform="translate(-14 -38.88)"/><path class="o" d="M175.38,143.22c1.57-.24,1.86,3.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M242.52,149.89c1.71,1.09-1,1.52-1.07,2.38C240.09,151.56,242.79,151.08,242.52,149.89Z" transform="translate(-14 -38.88)"/><path class="o" d="M167.27,151.61c.07-.07,1-.88,1.47-.42C169,151.44,165.57,153.17,167.27,151.61Z" transform="translate(-14 -38.88)"/><path class="o" d="M192.93,152.68c.22-1.8,1.14,1.47,0,1C192,154.75,192.94,153.47,192.93,152.68Z" transform="translate(-14 -38.88)"/><path class="o" d="M159.74,157.6c.11-.41-.17-.46-.46-.5,1.16-1.37.89.65.42,1.47l-1,0c.11-.41-.17-.46-.46-.5C158.37,157.46,159.17,157.66,159.74,157.6Z" transform="translate(-14 -38.88)"/><path class="o" d="M261.35,175.41c-1.4-.76,1.14-.33.44,1C261.38,177.26,261.28,176.08,261.35,175.41Z" transform="translate(-14 -38.88)"/><path class="o" d="M242.26,179.46c1.39.33-.77.73-.54,1.44C240.13,180.36,242.3,180,242.26,179.46Z" transform="translate(-14 -38.88)"/><path class="o" d="M268.21,185.39c.21-1.79,1.14,1.48,0,1C267.31,187.47,268.22,186.19,268.21,185.39Z" transform="translate(-14 -38.88)"/><path class="o" d="M268.61,187.35c.18-1.14,1.27.61,1.92.56C270,189.38,269.26,187.31,268.61,187.35Z" transform="translate(-14 -38.88)"/><path class="o" d="M249.32,196.25c.71.24-.21.61-.06,1.45-.42-.31-.84-.62-1,0C246.49,196.76,249.38,196.91,249.32,196.25Z" transform="translate(-14 -38.88)"/><path class="o" d="M237.52,211.77c.87-.11-.05,1.88-1,1.41C236.27,212.09,237.45,212.53,237.52,211.77Z" transform="translate(-14 -38.88)"/><path class="o" d="M203.12,210.82c1.91.23-.42,1.48.89,2C203.68,213.58,201.22,211,203.12,210.82Z" transform="translate(-14 -38.88)"/><path class="o" d="M185,216.37c1-.22.94,1.93.46.51C184.38,217.38,184.36,217.36,185,216.37Z" transform="translate(-14 -38.88)"/></g><g class="n"><path class="o" d="M155.12,218.52c-.42-.33.12-1-.45-1.29a8.84,8.84,0,0,1,3.25,0C157.26,218.42,155.69,217,155.12,218.52Z" transform="translate(-14 -38.88)"/><path class="o" d="M197.8,233.81c-.32-.26-.23-.65-.67-.86C197.87,232,199.33,233.68,197.8,233.81Z" transform="translate(-14 -38.88)"/><path class="o" d="M189.44,224.38c-1.91,1.17.06-1.76,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M173.23,211.14s-.17.45-.21.44C170.75,210.93,176.45,209.78,173.23,211.14Z" transform="translate(-14 -38.88)"/><path class="o" d="M171.91,209.42c-.37.5-1.08,0-.87-.42C171.54,208.46,171.4,209.23,171.91,209.42Z" transform="translate(-14 -38.88)"/><path class="o" d="M191.06,215.47c-2,.34,1.76-.95,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M171.87,206.17c-1.91,1.18.06-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M208.93,223.05c-1.34,1.13-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M188.85,212.25c-2,.34,1.77-1,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M219.15,225.3a.49.49,0,0,1-.88-.42C218.77,224.34,218.64,225.11,219.15,225.3Z" transform="translate(-14 -38.88)"/><path class="o" d="M206.5,219.18c-.38.49-1.08,0-.87-.43C206.13,218.21,206,219,206.5,219.18Z" transform="translate(-14 -38.88)"/><path class="o" d="M233.74,230.75l-.87-.42.42-.87.87.42Z" transform="translate(-14 -38.88)"/><path class="o" d="M169.4,199.05a1.32,1.32,0,0,1-.24-1.73A1.35,1.35,0,0,1,169.4,199.05Z" transform="translate(-14 -38.88)"/><path class="o" d="M187.9,205.32c-2,.35,1.76-.95,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M180.89,199.77c-.31.48-1,0-1.52-.19C179.69,199.1,180.35,199.59,180.89,199.77Z" transform="translate(-14 -38.88)"/><path class="o" d="M240.86,228.28c-1.34,1.14-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M218.32,211.44c-1.91,1.18.07-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M254.93,227c-.37.49-1.08,0-.87-.43C254.56,226.05,254.42,226.82,254.93,227Z" transform="translate(-14 -38.88)"/><path class="o" d="M167.68,183.68c-1.33,1.14-.26-2.22,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M182.73,190.43c-2,.35,1.76-1,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M218.7,207.32c-2,.34,1.77-1,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M252.27,222.5c-.69.62-.82-.32-1.3-.64C251.66,221.24,251.79,222.19,252.27,222.5Z" transform="translate(-14 -38.88)"/><path class="o" d="M173.76,184.47a1.34,1.34,0,0,1-.23-1.73A1.34,1.34,0,0,1,173.76,184.47Z" transform="translate(-14 -38.88)"/><path class="o" d="M171.79,183c-.37.5-1.08,0-.87-.42C171.42,182,171.28,182.79,171.79,183Z" transform="translate(-14 -38.88)"/><path class="o" d="M251.37,219.91c-.37.5-1.08,0-.87-.42C251,219,250.86,219.72,251.37,219.91Z" transform="translate(-14 -38.88)"/><path class="o" d="M155.57,168.66c-1.91,1.18.07-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M148.15,164c-.13.09-1.33.35-1.52-.2S148.93,163.42,148.15,164Z" transform="translate(-14 -38.88)"/><path class="o" d="M229.67,200.24c-1.91,1.18.06-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M204.57,186.47c-2,.35,1.76-.95,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M262.05,206.77a1.32,1.32,0,0,1-.24-1.73A1.35,1.35,0,0,1,262.05,206.77Z" transform="translate(-14 -38.88)"/><path class="o" d="M213,182.46c-2,.35,1.76-1,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M255.93,202.73c2.1-1,.82,2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M243.71,196.81c-.37.5-1.08,0-.87-.42C243.34,195.85,243.2,196.62,243.71,196.81Z" transform="translate(-14 -38.88)"/><path class="o" d="M173.27,162.16c-.32.47-1,0-1.52-.2C172.06,161.48,172.72,162,173.27,162.16Z" transform="translate(-14 -38.88)"/><path class="o" d="M265.51,206.29c-1.91,1.18.06-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M209.88,177.73c-.71,1-1.71-.79-.89-1.5C209.49,176.66,209.3,177.33,209.88,177.73Z" transform="translate(-14 -38.88)"/><path class="o" d="M207.7,176.68c-1.34,1.13-.27-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M175.42,161c-.62-.69.32-.82.63-1.3C176.67,160.43,175.73,160.56,175.42,161Z" transform="translate(-14 -38.88)"/><path class="o" d="M173.44,158.47c-1.91,1.17.06-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M166,153.79c-1.91,1.18.06-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M253.45,195.61c-1.85.95,0-2.76,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M202.18,169.16c-.37.5-1.08,0-.87-.42C201.81,168.2,201.67,169,202.18,169.16Z" transform="translate(-14 -38.88)"/><path class="o" d="M157.47,147c-.38.49-1.08,0-.87-.43C157.1,146,157,146.77,157.47,147Z" transform="translate(-14 -38.88)"/><path class="o" d="M185.79,158.53c-1.33,1.14-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M175.31,152.38c-1.91,1.17.06-1.76,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M273.22,199.26c1.75-.92,1.5,2.22,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M265.16,195.89c-1-2.1,2-.82,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M228.07,176.85c-2,.35,1.76-.95,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M179.22,153.19c-2,.35,1.76-.95,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M232.6,175.28c-.59,1.05-1.53-.59-1.74-.85C231.78,173.27,231.59,175.3,232.6,175.28Z" transform="translate(-14 -38.88)"/><path class="o" d="M230.63,173.79c-.37.49-1.08,0-.87-.43C230.26,172.82,230.12,173.59,230.63,173.79Z" transform="translate(-14 -38.88)"/><path class="o" d="M195.3,156.68c-2,.34,1.77-1,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M192.89,153.89c-2,.34,1.76-.95,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M188.09,151.57c-.32.47-1,0-1.52-.2C186.89,150.89,187.54,151.38,188.09,151.57Z" transform="translate(-14 -38.88)"/><path class="o" d="M216,162.92c-.31.47-1,0-1.51-.2C214.77,162.24,215.43,162.74,216,162.92Z" transform="translate(-14 -38.88)"/><path class="o" d="M201.14,155.74c-.31.47-1,0-1.51-.2C199.94,155.06,200.6,155.55,201.14,155.74Z" transform="translate(-14 -38.88)"/><path class="o" d="M219,163.31c-.31.48-1,0-1.52-.2C217.81,162.64,218.47,163.13,219,163.31Z" transform="translate(-14 -38.88)"/><path class="o" d="M204.18,156.13c-1.33,1.14-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M183.88,144.68c-.62-.69.32-.82.64-1.31C185.14,144.07,184.19,144.2,183.88,144.68Z" transform="translate(-14 -38.88)"/><path class="o" d="M235.77,168.74c-1.33,1.13-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M182.35,143.4a1.32,1.32,0,0,1-.24-1.73A1.34,1.34,0,0,1,182.35,143.4Z" transform="translate(-14 -38.88)"/><path class="o" d="M260.84,180.34c-.71-.48-.63-1.23,0-2.17A2.14,2.14,0,0,1,260.84,180.34Z" transform="translate(-14 -38.88)"/><path class="o" d="M189.09,145.05c-1.34,1.14-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M213.28,155.15c-1.34,1.14-.27-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M278.48,186.19c-.32.47-1,0-1.52-.2C277.27,185.51,277.93,186,278.48,186.19Z" transform="translate(-14 -38.88)"/><path class="o" d="M224.17,159.35c-.7.62-.83-.33-1.31-.64C223.55,158.09,223.68,159,224.17,159.35Z" transform="translate(-14 -38.88)"/><path class="o" d="M197.77,146c-1.91,1.18.07-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M193.63,144.56c-.62-.7.33-.83.64-1.31C194.89,144,194,144.07,193.63,144.56Z" transform="translate(-14 -38.88)"/><path class="o" d="M172.68,133.34a1.35,1.35,0,0,1-.23-1.74A1.35,1.35,0,0,1,172.68,133.34Z" transform="translate(-14 -38.88)"/><path class="o" d="M232.65,161.84c-.72-.48-.63-1.23,0-2.17A2.14,2.14,0,0,1,232.65,161.84Z" transform="translate(-14 -38.88)"/><path class="o" d="M209.31,150s-.18.44-.21.43C206.82,149.79,212.53,148.63,209.31,150Z" transform="translate(-14 -38.88)"/><path class="o" d="M182.27,136.9a.49.49,0,0,1-.88-.42C181.89,135.94,181.76,136.71,182.27,136.9Z" transform="translate(-14 -38.88)"/><path class="o" d="M235,162.46c-.94-.28-1.32-.75-.88-1.51l1.31.64Z" transform="translate(-14 -38.88)"/><path class="o" d="M175.5,133.08c-.32.48-1,0-1.52-.19C174.3,132.41,175,132.9,175.5,133.08Z" transform="translate(-14 -38.88)"/><path class="o" d="M184,135.58c-.37.49-1.08,0-.87-.43C183.61,134.61,183.47,135.38,184,135.58Z" transform="translate(-14 -38.88)"/><path class="o" d="M212.1,147.58c-1.34,1.13-.27-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M212.49,144.54c-1.33,1.13-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M260.46,166.69c-1.34,1.14-.27-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M243.21,156.72c1.75-.92,1.49,2.22,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M223.58,147.22c-.42.52-1.27-.17-2-.41.22-.42.7-.08,1.09,0,.26-.33,0-.49-.23-.64C223.61,144.91,223.11,147.05,223.58,147.22Z" transform="translate(-14 -38.88)"/><path class="o" d="M261.74,165.16c-2,.34,1.76-1,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M256.94,162.83c1.75-.92,1.5,2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M263.47,164.92c-1-2.1,2-.83,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M252.34,159c-.37.5-1.08,0-.87-.42C252,158,251.83,158.8,252.34,159Z" transform="translate(-14 -38.88)"/><path class="o" d="M206.51,134.64c-.37.5-1.08,0-.87-.42C206.14,133.68,206,134.45,206.51,134.64Z" transform="translate(-14 -38.88)"/><path class="o" d="M253.17,156.16c-1.08-1-.17-.89.41-1.95C254.11,154.63,253.41,155.47,253.17,156.16Z" transform="translate(-14 -38.88)"/><path class="o" d="M259.87,154.56c-1.91,1.18.06-1.75,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M258.56,153.93c-.32.47-1,0-1.52-.2C257.36,153.25,258,153.75,258.56,153.93Z" transform="translate(-14 -38.88)"/><path class="o" d="M222.26,128.81c-1.33,1.14-.26-2.23,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M268.67,147.51c-1.34,1.14-.26-2.22,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M180.79,225.57c-.86,1.14-.36-1-1.1-1.07C180.81,223.26,180.31,225.4,180.79,225.57Z" transform="translate(-14 -38.88)"/><path class="o" d="M203.58,228.53c-.69-1.45,2-1.23,1.48-3.05.5.43.31,1.1.89,1.5C205,227,204.33,227.89,203.58,228.53Z" transform="translate(-14 -38.88)"/><path class="o" d="M184.57,216.63c.36,1.53-.64-1.34-.67-1.94C185.39,213.52,184.36,216.17,184.57,216.63Z" transform="translate(-14 -38.88)"/><path class="o" d="M228.74,230c-1.53-.41-.45-3.62,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M169.81,197.1c-1.14-1.68,1.54-1,1.92-1.76C172.7,196.53,170,195.89,169.81,197.1Z" transform="translate(-14 -38.88)"/><path class="o" d="M239.52,225.48c-.1,0-1.31.38-1.52-.2C237.89,225,241.7,224.72,239.52,225.48Z" transform="translate(-14 -38.88)"/><path class="o" d="M216.41,214.28c-.92,1.56-.47-1.81.42-.87C218.05,212.74,216.71,213.55,216.41,214.28Z" transform="translate(-14 -38.88)"/><path class="o" d="M248.81,223c-.26.33,0,.49.23.64-1.61.8-.56-1,.19-1.52l.88.43c-.26.33,0,.49.22.64C250,223.65,249.36,223.16,248.81,223Z" transform="translate(-14 -38.88)"/><path class="o" d="M162.7,166.19c1,1.25-1.18-.16,0-1.08C163.41,164.47,163,165.6,162.7,166.19Z" transform="translate(-14 -38.88)"/><path class="o" d="M181.82,170.07c-1.15-.86,1-.36,1.07-1.1C184.13,170.1,182,169.6,181.82,170.07Z" transform="translate(-14 -38.88)"/><path class="o" d="M160.38,154.3c-.92,1.56-.46-1.81.42-.87C162,152.75,160.68,153.57,160.38,154.3Z" transform="translate(-14 -38.88)"/><path class="o" d="M160.79,152.34c-.62,1-.93-1.06-1.54-1.28C160.33,149.93,160.17,152.13,160.79,152.34Z" transform="translate(-14 -38.88)"/><path class="o" d="M182,151.86c-.55-.51.44-.48.64-1.31.25.46.52.9.87.42C184.82,152.52,182.23,151.23,182,151.86Z" transform="translate(-14 -38.88)"/><path class="o" d="M199,142.32c-.84-.24.8-1.7,1.51-.88C200.3,142.52,199.4,141.65,199,142.32Z" transform="translate(-14 -38.88)"/><path class="o" d="M230.2,156.89c-1.65-1,1-1.2,0-2.17C230.79,154.13,232,157.48,230.2,156.89Z" transform="translate(-14 -38.88)"/><path class="o" d="M249.09,159c-1-.21-.1-2.15-.23-.65C250,158.33,250,158.36,249.09,159Z" transform="translate(-14 -38.88)"/></g><g class="n"><path class="o" d="M195.65,172.51c-.53.13-.73-.72-1.31-.43a9.09,9.09,0,0,1,1.94-2.61C196.86,170.74,194.82,171.15,195.65,172.51Z" transform="translate(-14 -38.88)"/><path class="o" d="M233.68,147.84c-.39.09-.65-.22-1.09,0C232.31,146.71,234.51,146.54,233.68,147.84Z" transform="translate(-14 -38.88)"/><path class="o" d="M221.11,148.76c-.22,2.23-1.35-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M200.76,153.63s.25.41.22.43C199.09,155.48,201.63,150.24,200.76,153.63Z" transform="translate(-14 -38.88)"/><path class="o" d="M198.59,153.64c.17.6-.64.87-.86.43C197.6,153.35,198.13,153.93,198.59,153.64Z" transform="translate(-14 -38.88)"/><path class="o" d="M215,142.07c-.92,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M196,151.7c-.22,2.23-1.35-1.12,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M231.87,132.46c.1,1.75-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M211.11,141.87c-.92,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M239.86,125.7a.49.49,0,0,1-.87.44C238.87,125.41,239.4,126,239.86,125.7Z" transform="translate(-14 -38.88)"/><path class="o" d="M227.32,132.05a.49.49,0,0,1-.87.43C226.33,131.76,226.86,132.34,227.32,132.05Z" transform="translate(-14 -38.88)"/><path class="o" d="M253,117.4l-.86.44-.44-.86.86-.44Z" transform="translate(-14 -38.88)"/><path class="o" d="M188.82,149.35a1.34,1.34,0,0,1-1.52-.86A1.33,1.33,0,0,1,188.82,149.35Z" transform="translate(-14 -38.88)"/><path class="o" d="M205,138.44c-.92,1.77.32-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M196.37,140.64c.18.55-.61.77-1.08,1.09C195.1,141.19,195.89,141,196.37,140.64Z" transform="translate(-14 -38.88)"/><path class="o" d="M255.39,110.24c.1,1.75-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M228.34,118c-.23,2.23-1.36-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M262.92,98.29c.17.59-.64.87-.86.43C261.93,98,262.46,98.57,262.92,98.29Z" transform="translate(-14 -38.88)"/><path class="o" d="M175.56,141.39c.1,1.75-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M190.05,133.52c-.93,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M225.29,115.15c-.92,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M257.72,97.66c.07.93-.76.46-1.3.66C256.35,97.39,257.17,97.86,257.72,97.66Z" transform="translate(-14 -38.88)"/><path class="o" d="M179.88,137a1.34,1.34,0,0,1-1.52-.86A1.34,1.34,0,0,1,179.88,137Z" transform="translate(-14 -38.88)"/><path class="o" d="M177.5,137.7c.16.6-.64.87-.87.44C176.5,137.41,177,138,177.5,137.7Z" transform="translate(-14 -38.88)"/><path class="o" d="M255.11,96.8c.17.6-.64.88-.86.44C254.12,96.52,254.65,97.09,255.11,96.8Z" transform="translate(-14 -38.88)"/><path class="o" d="M156.28,141.91c-.23,2.24-1.36-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M148.05,145c0,.15-.52,1.27-1.08,1.09S148.08,144,148.05,145Z" transform="translate(-14 -38.88)"/><path class="o" d="M226.31,102.14c-.22,2.23-1.35-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M200.14,113.75c-.92,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M251.13,80.35a1.34,1.34,0,0,1-1.52-.86A1.34,1.34,0,0,1,251.13,80.35Z" transform="translate(-14 -38.88)"/><path class="o" d="M202.05,104.64c-.92,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M244.21,82.77c.5-2.26,2.12.57,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M232.1,88.89c.17.6-.64.87-.86.44C231.11,88.61,231.64,89.18,232.1,88.89Z" transform="translate(-14 -38.88)"/><path class="o" d="M161.83,123.9c.18.54-.61.76-1.08,1.09C160.56,124.45,161.35,124.22,161.83,123.9Z" transform="translate(-14 -38.88)"/><path class="o" d="M252.85,77.31c-.22,2.23-1.35-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M196.41,104.23c.37,1.17-1.66.88-1.73-.21C195.32,103.89,195.74,104.44,196.41,104.23Z" transform="translate(-14 -38.88)"/><path class="o" d="M194.25,105.33c.09,1.75-1.93-1.15,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M162.25,121.51c-.93.08-.46-.75-.66-1.29C162.52,120.14,162.05,121,162.25,121.51Z" transform="translate(-14 -38.88)"/><path class="o" d="M159,121.53c-.23,2.23-1.36-1.12,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M150.78,124.6c-.23,2.23-1.36-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M237.05,80.42c-.37,2-2.17-1.7,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M184.93,105.15a.49.49,0,0,1-.87.44C183.94,104.86,184.47,105.44,184.93,105.15Z" transform="translate(-14 -38.88)"/><path class="o" d="M140.17,127.25a.49.49,0,0,1-.87.44C139.18,127,139.71,127.54,140.17,127.25Z" transform="translate(-14 -38.88)"/><path class="o" d="M166.54,111.74c.09,1.75-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M155.29,116.34c-.22,2.24-1.36-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M251.94,66.91c.33-2,2.67.16,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M244.37,71.28c-2.26-.5.58-2.12,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M206.75,89.23c-.93,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M158.31,113.73c-.92,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M208.24,84.67c.48,1.11-1.4.87-1.73.87C206.14,84.11,207.64,85.49,208.24,84.67Z" transform="translate(-14 -38.88)"/><path class="o" d="M205.86,85.33c.17.6-.64.87-.86.44C204.87,85,205.4,85.62,205.86,85.33Z" transform="translate(-14 -38.88)"/><path class="o" d="M170.83,103.05c-.92,1.78.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M167.15,103.29c-.92,1.77.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M162.39,105.69c.19.54-.6.77-1.08,1.09C161.13,106.24,161.92,106,162.39,105.69Z" transform="translate(-14 -38.88)"/><path class="o" d="M188.33,90.4c.18.54-.61.76-1.08,1.09C187.06,90.94,187.85,90.72,188.33,90.4Z" transform="translate(-14 -38.88)"/><path class="o" d="M173.63,97.84c.18.54-.61.76-1.08,1.08C172.36,98.38,173.15,98.16,173.63,97.84Z" transform="translate(-14 -38.88)"/><path class="o" d="M190.49,88.22c.18.54-.61.76-1.08,1.09C189.22,88.77,190,88.55,190.49,88.22Z" transform="translate(-14 -38.88)"/><path class="o" d="M175.78,95.66c.1,1.75-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M154.37,104.86c-.93.07-.46-.75-.66-1.3C154.64,103.49,154.17,104.32,154.37,104.86Z" transform="translate(-14 -38.88)"/><path class="o" d="M205,78.18c.09,1.76-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M152.42,105.3a1.33,1.33,0,0,1-1.52-.86A1.34,1.34,0,0,1,152.42,105.3Z" transform="translate(-14 -38.88)"/><path class="o" d="M229.39,65.28c-.81.28-1.36-.24-1.74-1.29C228.37,64,228.92,64.51,229.39,65.28Z" transform="translate(-14 -38.88)"/><path class="o" d="M157.82,100.94c.09,1.76-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M180.51,87.83c.1,1.76-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M244.73,54.81c.19.54-.6.76-1.08,1.09C243.46,55.35,244.25,55.13,244.73,54.81Z" transform="translate(-14 -38.88)"/><path class="o" d="M190.46,81.72c.07.93-.76.46-1.3.66C189.09,81.45,189.91,81.92,190.46,81.72Z" transform="translate(-14 -38.88)"/><path class="o" d="M163.86,94.63c-.23,2.23-1.36-1.11,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M160.18,97c-.93.07-.46-.75-.65-1.3C160.46,95.66,160,96.49,160.18,97Z" transform="translate(-14 -38.88)"/><path class="o" d="M138.56,106.89A1.36,1.36,0,0,1,137,106,1.34,1.34,0,0,1,138.56,106.89Z" transform="translate(-14 -38.88)"/><path class="o" d="M197.58,76.48c-.81.29-1.36-.24-1.74-1.29C196.57,75.18,197.12,75.71,197.58,76.48Z" transform="translate(-14 -38.88)"/><path class="o" d="M174,87.86s.25.42.22.44C172.34,89.71,174.88,84.48,174,87.86Z" transform="translate(-14 -38.88)"/><path class="o" d="M147.2,101.43c.17.6-.64.87-.86.43C146.21,101.14,146.74,101.72,147.2,101.43Z" transform="translate(-14 -38.88)"/><path class="o" d="M199.53,75c-.8.58-1.4.59-1.74-.21l1.3-.66Z" transform="translate(-14 -38.88)"/><path class="o" d="M140.06,104.49c.19.55-.6.77-1.08,1.09C138.8,105,139.59,104.82,140.06,104.49Z" transform="translate(-14 -38.88)"/><path class="o" d="M147.19,99.26a.49.49,0,0,1-.87.44C146.2,99,146.73,99.55,147.19,99.26Z" transform="translate(-14 -38.88)"/><path class="o" d="M173.78,84.18c.09,1.75-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M171.6,82c.09,1.76-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M218.3,57.31c.09,1.76-1.93-1.14,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M199.91,65c.33-1.95,2.68.15,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M180.45,74.83c.17.66-.9.91-1.51,1.31-.2-.43.36-.61.65-.87-.11-.41-.38-.33-.65-.22C178.63,73.41,180,75.1,180.45,74.83Z" transform="translate(-14 -38.88)"/><path class="o" d="M217.86,55.37c-.92,1.77.31-2,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M213.1,57.77c.33-2,2.67.16,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M218.72,53.84c-2.26-.5.57-2.12,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M207.25,59.1a.49.49,0,0,1-.86.44C206.26,58.81,206.79,59.39,207.25,59.1Z" transform="translate(-14 -38.88)"/><path class="o" d="M160.11,80.78a.49.49,0,0,1-.87.43C159.12,80.49,159.65,81.07,160.11,80.78Z" transform="translate(-14 -38.88)"/><path class="o" d="M205.51,56.72c-1.45.26-.81-.4-1.31-1.51C204.86,55.05,205.11,56.11,205.51,56.72Z" transform="translate(-14 -38.88)"/><path class="o" d="M208.3,50.43c-.23,2.23-1.36-1.12,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M207,51.08c.19.54-.6.77-1.08,1.09C205.74,51.63,206.53,51.41,207,51.08Z" transform="translate(-14 -38.88)"/><path class="o" d="M165,64.72c.09,1.75-1.93-1.15,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M208,39.16c.09,1.75-1.93-1.15,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M216.81,156.37c.39,1.37-1-.32-1.51.22C215,155,216.4,156.64,216.81,156.37Z" transform="translate(-14 -38.88)"/><path class="o" d="M233,140c-1.57-.34.23-2.33-1.53-3,.64-.13,1.07.42,1.73.21C232.67,138,232.93,139.06,233,140Z" transform="translate(-14 -38.88)"/><path class="o" d="M212,147.94c1.43.65-1.45-.3-1.95-.64C210,145.41,211.51,147.83,212,147.94Z" transform="translate(-14 -38.88)"/><path class="o" d="M249.37,120.89c-1.25,1-3.15-1.83,0,0Z" transform="translate(-14 -38.88)"/><path class="o" d="M187.51,147.84c-2-.12.16-1.83-.23-2.6C188.81,145.19,186.69,146.92,187.51,147.84Z" transform="translate(-14 -38.88)"/><path class="o" d="M252.35,109.61c0,.1-.49,1.28-1.07,1.08C251,110.59,253.07,107.42,252.35,109.61Z" transform="translate(-14 -38.88)"/><path class="o" d="M229.44,121.2c.68,1.67-1.72-.73-.44-.87C229.2,119,229,120.51,229.44,121.2Z" transform="translate(-14 -38.88)"/><path class="o" d="M256,100.7c.1.41.37.32.65.22-.35,1.76-1.1-.14-1.09-1.08l.87-.44c.1.41.37.32.65.21C257.26,100.16,256.47,100.38,256,100.7Z" transform="translate(-14 -38.88)"/><path class="o" d="M158.63,134.75c1.59,0-.84.84-.87-.64C157.69,133.15,158.35,134.13,158.63,134.75Z" transform="translate(-14 -38.88)"/><path class="o" d="M173.3,121.9c-1.37.39.33-1-.22-1.52C174.73,120.08,173,121.48,173.3,121.9Z" transform="translate(-14 -38.88)"/><path class="o" d="M147.76,129.38c.69,1.68-1.72-.73-.43-.86C147.53,127.14,147.37,128.7,147.76,129.38Z" transform="translate(-14 -38.88)"/><path class="o" d="M146.46,127.87c.39,1.09-1.41.09-2,.45C144.26,126.77,145.91,128.23,146.46,127.87Z" transform="translate(-14 -38.88)"/><path class="o" d="M159,110.69c-.74.14-.11-.64-.66-1.3.52.08,1,.14.87-.43C161.17,108.86,158.58,110.14,159,110.69Z" transform="translate(-14 -38.88)"/><path class="o" d="M161.67,91.39c-.7.52-.87-1.66.21-1.74C162.61,90.49,161.37,90.69,161.67,91.39Z" transform="translate(-14 -38.88)"/><path class="o" d="M192.16,75.43c-1.78.72-.36-1.5-1.74-1.3C190.32,73.29,193.73,74.34,192.16,75.43Z" transform="translate(-14 -38.88)"/><path class="o" d="M205.32,61.71c-.79.69-1.77-1.22-.65-.21C205.32,60.56,205.35,60.57,205.32,61.71Z" transform="translate(-14 -38.88)"/></g><path class="p" d="M172,254c12.9,24.52,60,16.26,108.73-19.31s73.93-117.17,64.95-108.82C308.43,160.48,159.1,229.48,172,254Z" transform="translate(-14 -38.88)"/><path class="q" d="M222.28,253c-10.9,21-55.9,11.87-100.5-20.33s-60.59-80.34-61-96.29C95,167.39,233.19,232,222.28,253Z" transform="translate(-14 -38.88)"/><path class="r" d="M243.91,209.8c0,33.76-19.56,61.13-43.69,61.13s-43.69-27.37-43.69-61.13,43.69-61.13,43.69-61.13S243.91,176,243.91,209.8Z" transform="translate(-14 -38.88)"/><g class="s"><path class="t" d="M345.68,125.87c-18.54,17.22-64.83,43-105.08,67.5-10.18-25.78-40.38-44.7-40.38-44.7s-34.06,21.34-42,49.59c-37.39-22.6-80.33-46.44-97.42-61.93.42,15.95,16.41,64.08,61,96.29,18.8,13.57,37.66,23,54,27.86,7,6.6,15.38,10.45,24.43,10.45a33.17,33.17,0,0,0,17.32-5c18.58-4.25,40.7-14.83,63.19-31.23C329.5,199.11,354.66,117.52,345.68,125.87Z" transform="translate(-14 -38.88)"/></g></g></svg>
.storybook/main.jsdeleted−15
@@ -1,15 +0,0 @@
1−const path = require('path');
2−const webpack = require('webpack');
3−
4−module.exports = {
5− stories: ['../output/**/*.Story/index.js'],
6− addons: [],
7− webpackFinal: async config => {
8− config.plugins.push(new webpack.SourceMapDevToolPlugin({
9− append: '\n//# sourceMappingURL=./[url]',
10− }))
11−
12− // do mutation to the config
13− return config;
14− },
15−};
.storybook/main.tsnew file+10
@@ -0,0 +1,10 @@
1+import { indexer } from './purescript-indexer'
2+
3+export default {
4+ staticDirs: ['../assets'],
5+ addons: ["@storybook/addon-essentials", "@storybook/addon-interactions"],
6+ stories: ["../output/Story.*/index.js"],
7+ framework: "@storybook/react-webpack5",
8+ storyIndexers: [{ test: /..\/output\/.*/, indexer }],
9+ disableTelemetry: true,
10+}
.storybook/manager.jsdeleted−7
@@ -1,7 +0,0 @@
1−import { addons } from '@storybook/addons';
2−import rowtypeYogaTheme from './rowtype-yoga-theme';
3−
4−addons.setConfig({
5− theme: rowtypeYogaTheme,
6− isToolshown: false,
7−});
.storybook/preview-head.html+5−1
@@ -1,2 +1,6 @@
1<link href="https://rsms.me/inter/inter.css" rel="stylesheet">
1<link href="https://rsms.me/inter/inter.css" rel="stylesheet">
2−<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/victormono@latest/dist/index.min.css">
2+<style>
3+#storybook-root {
4+ height: 100%;
5+}
6+</style>
.storybook/purescript-indexer-ts.tsnew file+27
@@ -0,0 +1,27 @@
1+import { promises } from "fs"
2+import { loadCsf, CsfFile, CsfOptions } from '@storybook/csf-tools';
3+
4+export const adjustSourceForStorybook = (source: string): string => {
5+ // regex for var $$default = unsafeCoerce({ ... })
6+ // we need to remove the unsafeCoerce part so that the parser can read
7+ // the info about the story
8+ const defaultVariableRecordRegex = /^var \$\$default =[^\{]+\{((?:.*\n)+?)(^\}\);)/gm;
9+ // $ has a special meaning so to produce two dollar signs we need $$$$
10+ const replacement = "var $$$$default = { $1 };";
11+ return source.replace(defaultVariableRecordRegex, replacement);
12+}
13+
14+export const justLoad = async (fileName: string, opts: CsfOptions): Promise<string> => {
15+ const fileContent: string = await promises.readFile(fileName, 'utf-8');
16+ const fixedFileContent: string = adjustSourceForStorybook(fileContent);
17+ return fixedFileContent;
18+}
19+
20+export const indexer = async (fileName: string, opts: CsfOptions): Promise<CsfFile> => {
21+ console.log("File name: ", fileName);
22+ const fileContent: string = await promises.readFile(fileName, 'utf-8');
23+ const fixedFileContent: string = adjustSourceForStorybook(fileContent);
24+ const parseResult: CsfFile = loadCsf(fixedFileContent, { ...opts, fileName }).parse();
25+ parseResult._stories
26+ return parseResult
27+}
.storybook/purescript-indexer/.gitignorenew file+11
@@ -0,0 +1,11 @@
1+/bower_components/
2+/node_modules/
3+/.pulp-cache/
4+/output/
5+/generated-docs/
6+/.psc-package/
7+/.psc*
8+/.purs*
9+/.psa*
10+/.spago
11+/dist/
.storybook/purescript-indexer/output-es/Ansi.Codes/index.jsnew file+1862
@@ -0,0 +1,1862 @@
1+// | This module defines a data type representing ANSI escape codes, as well as
2+// | functions for serialising them as Strings.
3+import * as $runtime from "../runtime.js";
4+import * as Data$dGeneric$dRep from "../Data.Generic.Rep/index.js";
5+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
6+import * as Data$dOrd from "../Data.Ord/index.js";
7+import * as Data$dOrdering from "../Data.Ordering/index.js";
8+import * as Data$dShow from "../Data.Show/index.js";
9+import * as Data$dShow$dGeneric from "../Data.Show.Generic/index.js";
10+const $Color = tag => ({tag});
11+const $EraseParam = tag => ({tag});
12+const $EscapeCode = (tag, _1, _2) => ({tag, _1, _2});
13+const $GraphicsParam = (tag, _1) => ({tag, _1});
14+const $RenderingMode = tag => ({tag});
15+const genericShowArgsArgument = {genericShowArgs: v => [Data$dShow.showIntImpl(v)]};
16+const Bold = /* #__PURE__ */ $RenderingMode("Bold");
17+const Dim = /* #__PURE__ */ $RenderingMode("Dim");
18+const Italic = /* #__PURE__ */ $RenderingMode("Italic");
19+const Underline = /* #__PURE__ */ $RenderingMode("Underline");
20+const Inverse = /* #__PURE__ */ $RenderingMode("Inverse");
21+const Strikethrough = /* #__PURE__ */ $RenderingMode("Strikethrough");
22+const ToEnd = /* #__PURE__ */ $EraseParam("ToEnd");
23+const FromBeginning = /* #__PURE__ */ $EraseParam("FromBeginning");
24+const Entire = /* #__PURE__ */ $EraseParam("Entire");
25+const Black = /* #__PURE__ */ $Color("Black");
26+const Red = /* #__PURE__ */ $Color("Red");
27+const Green = /* #__PURE__ */ $Color("Green");
28+const Yellow = /* #__PURE__ */ $Color("Yellow");
29+const Blue = /* #__PURE__ */ $Color("Blue");
30+const Magenta = /* #__PURE__ */ $Color("Magenta");
31+const Cyan = /* #__PURE__ */ $Color("Cyan");
32+const White = /* #__PURE__ */ $Color("White");
33+const BrightBlack = /* #__PURE__ */ $Color("BrightBlack");
34+const BrightRed = /* #__PURE__ */ $Color("BrightRed");
35+const BrightGreen = /* #__PURE__ */ $Color("BrightGreen");
36+const BrightYellow = /* #__PURE__ */ $Color("BrightYellow");
37+const BrightBlue = /* #__PURE__ */ $Color("BrightBlue");
38+const BrightMagenta = /* #__PURE__ */ $Color("BrightMagenta");
39+const BrightCyan = /* #__PURE__ */ $Color("BrightCyan");
40+const BrightWhite = /* #__PURE__ */ $Color("BrightWhite");
41+const Reset = /* #__PURE__ */ $GraphicsParam("Reset");
42+const PMode = value0 => $GraphicsParam("PMode", value0);
43+const PForeground = value0 => $GraphicsParam("PForeground", value0);
44+const PBackground = value0 => $GraphicsParam("PBackground", value0);
45+const Up = value0 => $EscapeCode("Up", value0);
46+const Down = value0 => $EscapeCode("Down", value0);
47+const Forward = value0 => $EscapeCode("Forward", value0);
48+const Back = value0 => $EscapeCode("Back", value0);
49+const NextLine = value0 => $EscapeCode("NextLine", value0);
50+const PreviousLine = value0 => $EscapeCode("PreviousLine", value0);
51+const HorizontalAbsolute = value0 => $EscapeCode("HorizontalAbsolute", value0);
52+const Position = value0 => value1 => $EscapeCode("Position", value0, value1);
53+const EraseData = value0 => $EscapeCode("EraseData", value0);
54+const EraseLine = value0 => $EscapeCode("EraseLine", value0);
55+const ScrollUp = value0 => $EscapeCode("ScrollUp", value0);
56+const ScrollDown = value0 => $EscapeCode("ScrollDown", value0);
57+const Graphics = value0 => $EscapeCode("Graphics", value0);
58+const SavePosition = /* #__PURE__ */ $EscapeCode("SavePosition");
59+const RestorePosition = /* #__PURE__ */ $EscapeCode("RestorePosition");
60+const QueryPosition = /* #__PURE__ */ $EscapeCode("QueryPosition");
61+const HideCursor = /* #__PURE__ */ $EscapeCode("HideCursor");
62+const ShowCursor = /* #__PURE__ */ $EscapeCode("ShowCursor");
63+const prefix = "\u001b[";
64+const genericRenderingMode = {
65+ to: x => {
66+ if (x.tag === "Inl") { return Bold; }
67+ if (x.tag === "Inr") {
68+ if (x._1.tag === "Inl") { return Dim; }
69+ if (x._1.tag === "Inr") {
70+ if (x._1._1.tag === "Inl") { return Italic; }
71+ if (x._1._1.tag === "Inr") {
72+ if (x._1._1._1.tag === "Inl") { return Underline; }
73+ if (x._1._1._1.tag === "Inr") {
74+ if (x._1._1._1._1.tag === "Inl") { return Inverse; }
75+ if (x._1._1._1._1.tag === "Inr") { return Strikethrough; }
76+ $runtime.fail();
77+ }
78+ $runtime.fail();
79+ }
80+ $runtime.fail();
81+ }
82+ $runtime.fail();
83+ }
84+ $runtime.fail();
85+ },
86+ from: x => {
87+ if (x.tag === "Bold") { return Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments); }
88+ if (x.tag === "Dim") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)); }
89+ if (x.tag === "Italic") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))); }
90+ if (x.tag === "Underline") {
91+ return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))));
92+ }
93+ if (x.tag === "Inverse") {
94+ return Data$dGeneric$dRep.$Sum(
95+ "Inr",
96+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
97+ );
98+ }
99+ if (x.tag === "Strikethrough") {
100+ return Data$dGeneric$dRep.$Sum(
101+ "Inr",
102+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.NoArguments))))
103+ );
104+ }
105+ $runtime.fail();
106+ }
107+};
108+const showRenderingMode = {
109+ show: /* #__PURE__ */ (() => {
110+ const $0 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Bold"});
111+ const $1 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Dim"});
112+ const $2 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Italic"});
113+ const $3 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Underline"});
114+ const $4 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Inverse"});
115+ const $5 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Strikethrough"});
116+ return x => {
117+ const $7 = genericRenderingMode.from(x);
118+ if ($7.tag === "Inl") { return $0["genericShow'"]($7._1); }
119+ if ($7.tag === "Inr") {
120+ if ($7._1.tag === "Inl") { return $1["genericShow'"]($7._1._1); }
121+ if ($7._1.tag === "Inr") {
122+ if ($7._1._1.tag === "Inl") { return $2["genericShow'"]($7._1._1._1); }
123+ if ($7._1._1.tag === "Inr") {
124+ if ($7._1._1._1.tag === "Inl") { return $3["genericShow'"]($7._1._1._1._1); }
125+ if ($7._1._1._1.tag === "Inr") {
126+ if ($7._1._1._1._1.tag === "Inl") { return $4["genericShow'"]($7._1._1._1._1._1); }
127+ if ($7._1._1._1._1.tag === "Inr") { return $5["genericShow'"]($7._1._1._1._1._1); }
128+ $runtime.fail();
129+ }
130+ $runtime.fail();
131+ }
132+ $runtime.fail();
133+ }
134+ $runtime.fail();
135+ }
136+ $runtime.fail();
137+ };
138+ })()
139+};
140+const genericGraphicsParam = {
141+ to: x => {
142+ if (x.tag === "Inl") { return Reset; }
143+ if (x.tag === "Inr") {
144+ if (x._1.tag === "Inl") { return $GraphicsParam("PMode", x._1._1); }
145+ if (x._1.tag === "Inr") {
146+ if (x._1._1.tag === "Inl") { return $GraphicsParam("PForeground", x._1._1._1); }
147+ if (x._1._1.tag === "Inr") { return $GraphicsParam("PBackground", x._1._1._1); }
148+ $runtime.fail();
149+ }
150+ $runtime.fail();
151+ }
152+ $runtime.fail();
153+ },
154+ from: x => {
155+ if (x.tag === "Reset") { return Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments); }
156+ if (x.tag === "PMode") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)); }
157+ if (x.tag === "PForeground") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1))); }
158+ if (x.tag === "PBackground") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", x._1))); }
159+ $runtime.fail();
160+ }
161+};
162+const genericEscapeCode = {
163+ to: x => {
164+ if (x.tag === "Inl") { return $EscapeCode("Up", x._1); }
165+ if (x.tag === "Inr") {
166+ if (x._1.tag === "Inl") { return $EscapeCode("Down", x._1._1); }
167+ if (x._1.tag === "Inr") {
168+ if (x._1._1.tag === "Inl") { return $EscapeCode("Forward", x._1._1._1); }
169+ if (x._1._1.tag === "Inr") {
170+ if (x._1._1._1.tag === "Inl") { return $EscapeCode("Back", x._1._1._1._1); }
171+ if (x._1._1._1.tag === "Inr") {
172+ if (x._1._1._1._1.tag === "Inl") { return $EscapeCode("NextLine", x._1._1._1._1._1); }
173+ if (x._1._1._1._1.tag === "Inr") {
174+ if (x._1._1._1._1._1.tag === "Inl") { return $EscapeCode("PreviousLine", x._1._1._1._1._1._1); }
175+ if (x._1._1._1._1._1.tag === "Inr") {
176+ if (x._1._1._1._1._1._1.tag === "Inl") { return $EscapeCode("HorizontalAbsolute", x._1._1._1._1._1._1._1); }
177+ if (x._1._1._1._1._1._1.tag === "Inr") {
178+ if (x._1._1._1._1._1._1._1.tag === "Inl") { return $EscapeCode("Position", x._1._1._1._1._1._1._1._1._1, x._1._1._1._1._1._1._1._1._2); }
179+ if (x._1._1._1._1._1._1._1.tag === "Inr") {
180+ if (x._1._1._1._1._1._1._1._1.tag === "Inl") { return $EscapeCode("EraseData", x._1._1._1._1._1._1._1._1._1); }
181+ if (x._1._1._1._1._1._1._1._1.tag === "Inr") {
182+ if (x._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $EscapeCode("EraseLine", x._1._1._1._1._1._1._1._1._1._1); }
183+ if (x._1._1._1._1._1._1._1._1._1.tag === "Inr") {
184+ if (x._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $EscapeCode("ScrollUp", x._1._1._1._1._1._1._1._1._1._1._1); }
185+ if (x._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
186+ if (x._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $EscapeCode("ScrollDown", x._1._1._1._1._1._1._1._1._1._1._1._1); }
187+ if (x._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
188+ if (x._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $EscapeCode("Graphics", x._1._1._1._1._1._1._1._1._1._1._1._1._1); }
189+ if (x._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
190+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return SavePosition; }
191+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
192+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return RestorePosition; }
193+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
194+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return QueryPosition; }
195+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
196+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return HideCursor; }
197+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") { return ShowCursor; }
198+ $runtime.fail();
199+ }
200+ $runtime.fail();
201+ }
202+ $runtime.fail();
203+ }
204+ $runtime.fail();
205+ }
206+ $runtime.fail();
207+ }
208+ $runtime.fail();
209+ }
210+ $runtime.fail();
211+ }
212+ $runtime.fail();
213+ }
214+ $runtime.fail();
215+ }
216+ $runtime.fail();
217+ }
218+ $runtime.fail();
219+ }
220+ $runtime.fail();
221+ }
222+ $runtime.fail();
223+ }
224+ $runtime.fail();
225+ }
226+ $runtime.fail();
227+ }
228+ $runtime.fail();
229+ }
230+ $runtime.fail();
231+ },
232+ from: x => {
233+ if (x.tag === "Up") { return Data$dGeneric$dRep.$Sum("Inl", x._1); }
234+ if (x.tag === "Down") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)); }
235+ if (x.tag === "Forward") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1))); }
236+ if (x.tag === "Back") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)))); }
237+ if (x.tag === "NextLine") {
238+ return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)))));
239+ }
240+ if (x.tag === "PreviousLine") {
241+ return Data$dGeneric$dRep.$Sum(
242+ "Inr",
243+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)))))
244+ );
245+ }
246+ if (x.tag === "HorizontalAbsolute") {
247+ return Data$dGeneric$dRep.$Sum(
248+ "Inr",
249+ Data$dGeneric$dRep.$Sum(
250+ "Inr",
251+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)))))
252+ )
253+ );
254+ }
255+ if (x.tag === "Position") {
256+ return Data$dGeneric$dRep.$Sum(
257+ "Inr",
258+ Data$dGeneric$dRep.$Sum(
259+ "Inr",
260+ Data$dGeneric$dRep.$Sum(
261+ "Inr",
262+ Data$dGeneric$dRep.$Sum(
263+ "Inr",
264+ Data$dGeneric$dRep.$Sum(
265+ "Inr",
266+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.$Product(x._1, x._2))))
267+ )
268+ )
269+ )
270+ )
271+ );
272+ }
273+ if (x.tag === "EraseData") {
274+ return Data$dGeneric$dRep.$Sum(
275+ "Inr",
276+ Data$dGeneric$dRep.$Sum(
277+ "Inr",
278+ Data$dGeneric$dRep.$Sum(
279+ "Inr",
280+ Data$dGeneric$dRep.$Sum(
281+ "Inr",
282+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)))))
283+ )
284+ )
285+ )
286+ );
287+ }
288+ if (x.tag === "EraseLine") {
289+ return Data$dGeneric$dRep.$Sum(
290+ "Inr",
291+ Data$dGeneric$dRep.$Sum(
292+ "Inr",
293+ Data$dGeneric$dRep.$Sum(
294+ "Inr",
295+ Data$dGeneric$dRep.$Sum(
296+ "Inr",
297+ Data$dGeneric$dRep.$Sum(
298+ "Inr",
299+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1)))))
300+ )
301+ )
302+ )
303+ )
304+ );
305+ }
306+ if (x.tag === "ScrollUp") {
307+ return Data$dGeneric$dRep.$Sum(
308+ "Inr",
309+ Data$dGeneric$dRep.$Sum(
310+ "Inr",
311+ Data$dGeneric$dRep.$Sum(
312+ "Inr",
313+ Data$dGeneric$dRep.$Sum(
314+ "Inr",
315+ Data$dGeneric$dRep.$Sum(
316+ "Inr",
317+ Data$dGeneric$dRep.$Sum(
318+ "Inr",
319+ Data$dGeneric$dRep.$Sum(
320+ "Inr",
321+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1))))
322+ )
323+ )
324+ )
325+ )
326+ )
327+ )
328+ );
329+ }
330+ if (x.tag === "ScrollDown") {
331+ return Data$dGeneric$dRep.$Sum(
332+ "Inr",
333+ Data$dGeneric$dRep.$Sum(
334+ "Inr",
335+ Data$dGeneric$dRep.$Sum(
336+ "Inr",
337+ Data$dGeneric$dRep.$Sum(
338+ "Inr",
339+ Data$dGeneric$dRep.$Sum(
340+ "Inr",
341+ Data$dGeneric$dRep.$Sum(
342+ "Inr",
343+ Data$dGeneric$dRep.$Sum(
344+ "Inr",
345+ Data$dGeneric$dRep.$Sum(
346+ "Inr",
347+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1))))
348+ )
349+ )
350+ )
351+ )
352+ )
353+ )
354+ )
355+ );
356+ }
357+ if (x.tag === "Graphics") {
358+ return Data$dGeneric$dRep.$Sum(
359+ "Inr",
360+ Data$dGeneric$dRep.$Sum(
361+ "Inr",
362+ Data$dGeneric$dRep.$Sum(
363+ "Inr",
364+ Data$dGeneric$dRep.$Sum(
365+ "Inr",
366+ Data$dGeneric$dRep.$Sum(
367+ "Inr",
368+ Data$dGeneric$dRep.$Sum(
369+ "Inr",
370+ Data$dGeneric$dRep.$Sum(
371+ "Inr",
372+ Data$dGeneric$dRep.$Sum(
373+ "Inr",
374+ Data$dGeneric$dRep.$Sum(
375+ "Inr",
376+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", x._1))))
377+ )
378+ )
379+ )
380+ )
381+ )
382+ )
383+ )
384+ )
385+ );
386+ }
387+ if (x.tag === "SavePosition") {
388+ return Data$dGeneric$dRep.$Sum(
389+ "Inr",
390+ Data$dGeneric$dRep.$Sum(
391+ "Inr",
392+ Data$dGeneric$dRep.$Sum(
393+ "Inr",
394+ Data$dGeneric$dRep.$Sum(
395+ "Inr",
396+ Data$dGeneric$dRep.$Sum(
397+ "Inr",
398+ Data$dGeneric$dRep.$Sum(
399+ "Inr",
400+ Data$dGeneric$dRep.$Sum(
401+ "Inr",
402+ Data$dGeneric$dRep.$Sum(
403+ "Inr",
404+ Data$dGeneric$dRep.$Sum(
405+ "Inr",
406+ Data$dGeneric$dRep.$Sum(
407+ "Inr",
408+ Data$dGeneric$dRep.$Sum(
409+ "Inr",
410+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)))
411+ )
412+ )
413+ )
414+ )
415+ )
416+ )
417+ )
418+ )
419+ )
420+ )
421+ );
422+ }
423+ if (x.tag === "RestorePosition") {
424+ return Data$dGeneric$dRep.$Sum(
425+ "Inr",
426+ Data$dGeneric$dRep.$Sum(
427+ "Inr",
428+ Data$dGeneric$dRep.$Sum(
429+ "Inr",
430+ Data$dGeneric$dRep.$Sum(
431+ "Inr",
432+ Data$dGeneric$dRep.$Sum(
433+ "Inr",
434+ Data$dGeneric$dRep.$Sum(
435+ "Inr",
436+ Data$dGeneric$dRep.$Sum(
437+ "Inr",
438+ Data$dGeneric$dRep.$Sum(
439+ "Inr",
440+ Data$dGeneric$dRep.$Sum(
441+ "Inr",
442+ Data$dGeneric$dRep.$Sum(
443+ "Inr",
444+ Data$dGeneric$dRep.$Sum(
445+ "Inr",
446+ Data$dGeneric$dRep.$Sum(
447+ "Inr",
448+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)))
449+ )
450+ )
451+ )
452+ )
453+ )
454+ )
455+ )
456+ )
457+ )
458+ )
459+ )
460+ );
461+ }
462+ if (x.tag === "QueryPosition") {
463+ return Data$dGeneric$dRep.$Sum(
464+ "Inr",
465+ Data$dGeneric$dRep.$Sum(
466+ "Inr",
467+ Data$dGeneric$dRep.$Sum(
468+ "Inr",
469+ Data$dGeneric$dRep.$Sum(
470+ "Inr",
471+ Data$dGeneric$dRep.$Sum(
472+ "Inr",
473+ Data$dGeneric$dRep.$Sum(
474+ "Inr",
475+ Data$dGeneric$dRep.$Sum(
476+ "Inr",
477+ Data$dGeneric$dRep.$Sum(
478+ "Inr",
479+ Data$dGeneric$dRep.$Sum(
480+ "Inr",
481+ Data$dGeneric$dRep.$Sum(
482+ "Inr",
483+ Data$dGeneric$dRep.$Sum(
484+ "Inr",
485+ Data$dGeneric$dRep.$Sum(
486+ "Inr",
487+ Data$dGeneric$dRep.$Sum(
488+ "Inr",
489+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)))
490+ )
491+ )
492+ )
493+ )
494+ )
495+ )
496+ )
497+ )
498+ )
499+ )
500+ )
501+ )
502+ );
503+ }
504+ if (x.tag === "HideCursor") {
505+ return Data$dGeneric$dRep.$Sum(
506+ "Inr",
507+ Data$dGeneric$dRep.$Sum(
508+ "Inr",
509+ Data$dGeneric$dRep.$Sum(
510+ "Inr",
511+ Data$dGeneric$dRep.$Sum(
512+ "Inr",
513+ Data$dGeneric$dRep.$Sum(
514+ "Inr",
515+ Data$dGeneric$dRep.$Sum(
516+ "Inr",
517+ Data$dGeneric$dRep.$Sum(
518+ "Inr",
519+ Data$dGeneric$dRep.$Sum(
520+ "Inr",
521+ Data$dGeneric$dRep.$Sum(
522+ "Inr",
523+ Data$dGeneric$dRep.$Sum(
524+ "Inr",
525+ Data$dGeneric$dRep.$Sum(
526+ "Inr",
527+ Data$dGeneric$dRep.$Sum(
528+ "Inr",
529+ Data$dGeneric$dRep.$Sum(
530+ "Inr",
531+ Data$dGeneric$dRep.$Sum(
532+ "Inr",
533+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)))
534+ )
535+ )
536+ )
537+ )
538+ )
539+ )
540+ )
541+ )
542+ )
543+ )
544+ )
545+ )
546+ )
547+ );
548+ }
549+ if (x.tag === "ShowCursor") {
550+ return Data$dGeneric$dRep.$Sum(
551+ "Inr",
552+ Data$dGeneric$dRep.$Sum(
553+ "Inr",
554+ Data$dGeneric$dRep.$Sum(
555+ "Inr",
556+ Data$dGeneric$dRep.$Sum(
557+ "Inr",
558+ Data$dGeneric$dRep.$Sum(
559+ "Inr",
560+ Data$dGeneric$dRep.$Sum(
561+ "Inr",
562+ Data$dGeneric$dRep.$Sum(
563+ "Inr",
564+ Data$dGeneric$dRep.$Sum(
565+ "Inr",
566+ Data$dGeneric$dRep.$Sum(
567+ "Inr",
568+ Data$dGeneric$dRep.$Sum(
569+ "Inr",
570+ Data$dGeneric$dRep.$Sum(
571+ "Inr",
572+ Data$dGeneric$dRep.$Sum(
573+ "Inr",
574+ Data$dGeneric$dRep.$Sum(
575+ "Inr",
576+ Data$dGeneric$dRep.$Sum(
577+ "Inr",
578+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.NoArguments)))
579+ )
580+ )
581+ )
582+ )
583+ )
584+ )
585+ )
586+ )
587+ )
588+ )
589+ )
590+ )
591+ )
592+ );
593+ }
594+ $runtime.fail();
595+ }
596+};
597+const genericEraseParam = {
598+ to: x => {
599+ if (x.tag === "Inl") { return ToEnd; }
600+ if (x.tag === "Inr") {
601+ if (x._1.tag === "Inl") { return FromBeginning; }
602+ if (x._1.tag === "Inr") { return Entire; }
603+ $runtime.fail();
604+ }
605+ $runtime.fail();
606+ },
607+ from: x => {
608+ if (x.tag === "ToEnd") { return Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments); }
609+ if (x.tag === "FromBeginning") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)); }
610+ if (x.tag === "Entire") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.NoArguments)); }
611+ $runtime.fail();
612+ }
613+};
614+const showEraseParam = {
615+ show: /* #__PURE__ */ (() => {
616+ const $0 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "ToEnd"});
617+ const $1 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "FromBeginning"});
618+ const $2 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Entire"});
619+ return x => {
620+ const $4 = genericEraseParam.from(x);
621+ if ($4.tag === "Inl") { return $0["genericShow'"]($4._1); }
622+ if ($4.tag === "Inr") {
623+ if ($4._1.tag === "Inl") { return $1["genericShow'"]($4._1._1); }
624+ if ($4._1.tag === "Inr") { return $2["genericShow'"]($4._1._1); }
625+ $runtime.fail();
626+ }
627+ $runtime.fail();
628+ };
629+ })()
630+};
631+const genericColor = {
632+ to: x => {
633+ if (x.tag === "Inl") { return Black; }
634+ if (x.tag === "Inr") {
635+ if (x._1.tag === "Inl") { return Red; }
636+ if (x._1.tag === "Inr") {
637+ if (x._1._1.tag === "Inl") { return Green; }
638+ if (x._1._1.tag === "Inr") {
639+ if (x._1._1._1.tag === "Inl") { return Yellow; }
640+ if (x._1._1._1.tag === "Inr") {
641+ if (x._1._1._1._1.tag === "Inl") { return Blue; }
642+ if (x._1._1._1._1.tag === "Inr") {
643+ if (x._1._1._1._1._1.tag === "Inl") { return Magenta; }
644+ if (x._1._1._1._1._1.tag === "Inr") {
645+ if (x._1._1._1._1._1._1.tag === "Inl") { return Cyan; }
646+ if (x._1._1._1._1._1._1.tag === "Inr") {
647+ if (x._1._1._1._1._1._1._1.tag === "Inl") { return White; }
648+ if (x._1._1._1._1._1._1._1.tag === "Inr") {
649+ if (x._1._1._1._1._1._1._1._1.tag === "Inl") { return BrightBlack; }
650+ if (x._1._1._1._1._1._1._1._1.tag === "Inr") {
651+ if (x._1._1._1._1._1._1._1._1._1.tag === "Inl") { return BrightRed; }
652+ if (x._1._1._1._1._1._1._1._1._1.tag === "Inr") {
653+ if (x._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return BrightGreen; }
654+ if (x._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
655+ if (x._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return BrightYellow; }
656+ if (x._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
657+ if (x._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return BrightBlue; }
658+ if (x._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
659+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return BrightMagenta; }
660+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
661+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return BrightCyan; }
662+ if (x._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") { return BrightWhite; }
663+ $runtime.fail();
664+ }
665+ $runtime.fail();
666+ }
667+ $runtime.fail();
668+ }
669+ $runtime.fail();
670+ }
671+ $runtime.fail();
672+ }
673+ $runtime.fail();
674+ }
675+ $runtime.fail();
676+ }
677+ $runtime.fail();
678+ }
679+ $runtime.fail();
680+ }
681+ $runtime.fail();
682+ }
683+ $runtime.fail();
684+ }
685+ $runtime.fail();
686+ }
687+ $runtime.fail();
688+ }
689+ $runtime.fail();
690+ }
691+ $runtime.fail();
692+ },
693+ from: x => {
694+ if (x.tag === "Black") { return Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments); }
695+ if (x.tag === "Red") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)); }
696+ if (x.tag === "Green") { return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))); }
697+ if (x.tag === "Yellow") {
698+ return Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))));
699+ }
700+ if (x.tag === "Blue") {
701+ return Data$dGeneric$dRep.$Sum(
702+ "Inr",
703+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
704+ );
705+ }
706+ if (x.tag === "Magenta") {
707+ return Data$dGeneric$dRep.$Sum(
708+ "Inr",
709+ Data$dGeneric$dRep.$Sum(
710+ "Inr",
711+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
712+ )
713+ );
714+ }
715+ if (x.tag === "Cyan") {
716+ return Data$dGeneric$dRep.$Sum(
717+ "Inr",
718+ Data$dGeneric$dRep.$Sum(
719+ "Inr",
720+ Data$dGeneric$dRep.$Sum(
721+ "Inr",
722+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
723+ )
724+ )
725+ );
726+ }
727+ if (x.tag === "White") {
728+ return Data$dGeneric$dRep.$Sum(
729+ "Inr",
730+ Data$dGeneric$dRep.$Sum(
731+ "Inr",
732+ Data$dGeneric$dRep.$Sum(
733+ "Inr",
734+ Data$dGeneric$dRep.$Sum(
735+ "Inr",
736+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
737+ )
738+ )
739+ )
740+ );
741+ }
742+ if (x.tag === "BrightBlack") {
743+ return Data$dGeneric$dRep.$Sum(
744+ "Inr",
745+ Data$dGeneric$dRep.$Sum(
746+ "Inr",
747+ Data$dGeneric$dRep.$Sum(
748+ "Inr",
749+ Data$dGeneric$dRep.$Sum(
750+ "Inr",
751+ Data$dGeneric$dRep.$Sum(
752+ "Inr",
753+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
754+ )
755+ )
756+ )
757+ )
758+ );
759+ }
760+ if (x.tag === "BrightRed") {
761+ return Data$dGeneric$dRep.$Sum(
762+ "Inr",
763+ Data$dGeneric$dRep.$Sum(
764+ "Inr",
765+ Data$dGeneric$dRep.$Sum(
766+ "Inr",
767+ Data$dGeneric$dRep.$Sum(
768+ "Inr",
769+ Data$dGeneric$dRep.$Sum(
770+ "Inr",
771+ Data$dGeneric$dRep.$Sum(
772+ "Inr",
773+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
774+ )
775+ )
776+ )
777+ )
778+ )
779+ );
780+ }
781+ if (x.tag === "BrightGreen") {
782+ return Data$dGeneric$dRep.$Sum(
783+ "Inr",
784+ Data$dGeneric$dRep.$Sum(
785+ "Inr",
786+ Data$dGeneric$dRep.$Sum(
787+ "Inr",
788+ Data$dGeneric$dRep.$Sum(
789+ "Inr",
790+ Data$dGeneric$dRep.$Sum(
791+ "Inr",
792+ Data$dGeneric$dRep.$Sum(
793+ "Inr",
794+ Data$dGeneric$dRep.$Sum(
795+ "Inr",
796+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
797+ )
798+ )
799+ )
800+ )
801+ )
802+ )
803+ );
804+ }
805+ if (x.tag === "BrightYellow") {
806+ return Data$dGeneric$dRep.$Sum(
807+ "Inr",
808+ Data$dGeneric$dRep.$Sum(
809+ "Inr",
810+ Data$dGeneric$dRep.$Sum(
811+ "Inr",
812+ Data$dGeneric$dRep.$Sum(
813+ "Inr",
814+ Data$dGeneric$dRep.$Sum(
815+ "Inr",
816+ Data$dGeneric$dRep.$Sum(
817+ "Inr",
818+ Data$dGeneric$dRep.$Sum(
819+ "Inr",
820+ Data$dGeneric$dRep.$Sum(
821+ "Inr",
822+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments))))
823+ )
824+ )
825+ )
826+ )
827+ )
828+ )
829+ )
830+ );
831+ }
832+ if (x.tag === "BrightBlue") {
833+ return Data$dGeneric$dRep.$Sum(
834+ "Inr",
835+ Data$dGeneric$dRep.$Sum(
836+ "Inr",
837+ Data$dGeneric$dRep.$Sum(
838+ "Inr",
839+ Data$dGeneric$dRep.$Sum(
840+ "Inr",
841+ Data$dGeneric$dRep.$Sum(
842+ "Inr",
843+ Data$dGeneric$dRep.$Sum(
844+ "Inr",
845+ Data$dGeneric$dRep.$Sum(
846+ "Inr",
847+ Data$dGeneric$dRep.$Sum(
848+ "Inr",
849+ Data$dGeneric$dRep.$Sum(
850+ "Inr",
851+ Data$dGeneric$dRep.$Sum(
852+ "Inr",
853+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)))
854+ )
855+ )
856+ )
857+ )
858+ )
859+ )
860+ )
861+ )
862+ )
863+ );
864+ }
865+ if (x.tag === "BrightMagenta") {
866+ return Data$dGeneric$dRep.$Sum(
867+ "Inr",
868+ Data$dGeneric$dRep.$Sum(
869+ "Inr",
870+ Data$dGeneric$dRep.$Sum(
871+ "Inr",
872+ Data$dGeneric$dRep.$Sum(
873+ "Inr",
874+ Data$dGeneric$dRep.$Sum(
875+ "Inr",
876+ Data$dGeneric$dRep.$Sum(
877+ "Inr",
878+ Data$dGeneric$dRep.$Sum(
879+ "Inr",
880+ Data$dGeneric$dRep.$Sum(
881+ "Inr",
882+ Data$dGeneric$dRep.$Sum(
883+ "Inr",
884+ Data$dGeneric$dRep.$Sum(
885+ "Inr",
886+ Data$dGeneric$dRep.$Sum(
887+ "Inr",
888+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)))
889+ )
890+ )
891+ )
892+ )
893+ )
894+ )
895+ )
896+ )
897+ )
898+ )
899+ );
900+ }
901+ if (x.tag === "BrightCyan") {
902+ return Data$dGeneric$dRep.$Sum(
903+ "Inr",
904+ Data$dGeneric$dRep.$Sum(
905+ "Inr",
906+ Data$dGeneric$dRep.$Sum(
907+ "Inr",
908+ Data$dGeneric$dRep.$Sum(
909+ "Inr",
910+ Data$dGeneric$dRep.$Sum(
911+ "Inr",
912+ Data$dGeneric$dRep.$Sum(
913+ "Inr",
914+ Data$dGeneric$dRep.$Sum(
915+ "Inr",
916+ Data$dGeneric$dRep.$Sum(
917+ "Inr",
918+ Data$dGeneric$dRep.$Sum(
919+ "Inr",
920+ Data$dGeneric$dRep.$Sum(
921+ "Inr",
922+ Data$dGeneric$dRep.$Sum(
923+ "Inr",
924+ Data$dGeneric$dRep.$Sum(
925+ "Inr",
926+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inl", Data$dGeneric$dRep.NoArguments)))
927+ )
928+ )
929+ )
930+ )
931+ )
932+ )
933+ )
934+ )
935+ )
936+ )
937+ )
938+ );
939+ }
940+ if (x.tag === "BrightWhite") {
941+ return Data$dGeneric$dRep.$Sum(
942+ "Inr",
943+ Data$dGeneric$dRep.$Sum(
944+ "Inr",
945+ Data$dGeneric$dRep.$Sum(
946+ "Inr",
947+ Data$dGeneric$dRep.$Sum(
948+ "Inr",
949+ Data$dGeneric$dRep.$Sum(
950+ "Inr",
951+ Data$dGeneric$dRep.$Sum(
952+ "Inr",
953+ Data$dGeneric$dRep.$Sum(
954+ "Inr",
955+ Data$dGeneric$dRep.$Sum(
956+ "Inr",
957+ Data$dGeneric$dRep.$Sum(
958+ "Inr",
959+ Data$dGeneric$dRep.$Sum(
960+ "Inr",
961+ Data$dGeneric$dRep.$Sum(
962+ "Inr",
963+ Data$dGeneric$dRep.$Sum(
964+ "Inr",
965+ Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.$Sum("Inr", Data$dGeneric$dRep.NoArguments)))
966+ )
967+ )
968+ )
969+ )
970+ )
971+ )
972+ )
973+ )
974+ )
975+ )
976+ )
977+ );
978+ }
979+ $runtime.fail();
980+ }
981+};
982+const showColor = {
983+ show: /* #__PURE__ */ (() => {
984+ const $0 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Black"});
985+ const $1 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Red"});
986+ const $2 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Green"});
987+ const $3 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Yellow"});
988+ const $4 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Blue"});
989+ const $5 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Magenta"});
990+ const $6 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Cyan"});
991+ const $7 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "White"});
992+ const $8 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightBlack"});
993+ const $9 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightRed"});
994+ const $10 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightGreen"});
995+ const $11 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightYellow"});
996+ const $12 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightBlue"});
997+ const $13 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightMagenta"});
998+ const $14 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightCyan"});
999+ const $15 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "BrightWhite"});
1000+ return x => {
1001+ const $17 = genericColor.from(x);
1002+ if ($17.tag === "Inl") { return $0["genericShow'"]($17._1); }
1003+ if ($17.tag === "Inr") {
1004+ if ($17._1.tag === "Inl") { return $1["genericShow'"]($17._1._1); }
1005+ if ($17._1.tag === "Inr") {
1006+ if ($17._1._1.tag === "Inl") { return $2["genericShow'"]($17._1._1._1); }
1007+ if ($17._1._1.tag === "Inr") {
1008+ if ($17._1._1._1.tag === "Inl") { return $3["genericShow'"]($17._1._1._1._1); }
1009+ if ($17._1._1._1.tag === "Inr") {
1010+ if ($17._1._1._1._1.tag === "Inl") { return $4["genericShow'"]($17._1._1._1._1._1); }
1011+ if ($17._1._1._1._1.tag === "Inr") {
1012+ if ($17._1._1._1._1._1.tag === "Inl") { return $5["genericShow'"]($17._1._1._1._1._1._1); }
1013+ if ($17._1._1._1._1._1.tag === "Inr") {
1014+ if ($17._1._1._1._1._1._1.tag === "Inl") { return $6["genericShow'"]($17._1._1._1._1._1._1._1); }
1015+ if ($17._1._1._1._1._1._1.tag === "Inr") {
1016+ if ($17._1._1._1._1._1._1._1.tag === "Inl") { return $7["genericShow'"]($17._1._1._1._1._1._1._1._1); }
1017+ if ($17._1._1._1._1._1._1._1.tag === "Inr") {
1018+ if ($17._1._1._1._1._1._1._1._1.tag === "Inl") { return $8["genericShow'"]($17._1._1._1._1._1._1._1._1._1); }
1019+ if ($17._1._1._1._1._1._1._1._1.tag === "Inr") {
1020+ if ($17._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $9["genericShow'"]($17._1._1._1._1._1._1._1._1._1._1); }
1021+ if ($17._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1022+ if ($17._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $10["genericShow'"]($17._1._1._1._1._1._1._1._1._1._1._1); }
1023+ if ($17._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1024+ if ($17._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $11["genericShow'"]($17._1._1._1._1._1._1._1._1._1._1._1._1); }
1025+ if ($17._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1026+ if ($17._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $12["genericShow'"]($17._1._1._1._1._1._1._1._1._1._1._1._1._1); }
1027+ if ($17._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1028+ if ($17._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $13["genericShow'"]($17._1._1._1._1._1._1._1._1._1._1._1._1._1._1); }
1029+ if ($17._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1030+ if ($17._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $14["genericShow'"]($17._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1); }
1031+ if ($17._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") { return $15["genericShow'"]($17._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1); }
1032+ $runtime.fail();
1033+ }
1034+ $runtime.fail();
1035+ }
1036+ $runtime.fail();
1037+ }
1038+ $runtime.fail();
1039+ }
1040+ $runtime.fail();
1041+ }
1042+ $runtime.fail();
1043+ }
1044+ $runtime.fail();
1045+ }
1046+ $runtime.fail();
1047+ }
1048+ $runtime.fail();
1049+ }
1050+ $runtime.fail();
1051+ }
1052+ $runtime.fail();
1053+ }
1054+ $runtime.fail();
1055+ }
1056+ $runtime.fail();
1057+ }
1058+ $runtime.fail();
1059+ }
1060+ $runtime.fail();
1061+ };
1062+ })()
1063+};
1064+const showGraphicsParam = {
1065+ show: /* #__PURE__ */ (() => {
1066+ const $0 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "Reset"});
1067+ const $1 = Data$dShow$dGeneric.genericShowConstructor({genericShowArgs: v => [showRenderingMode.show(v)]})({reflectSymbol: () => "PMode"});
1068+ const $2 = Data$dShow$dGeneric.genericShowConstructor({genericShowArgs: v => [showColor.show(v)]})({reflectSymbol: () => "PForeground"});
1069+ const $3 = Data$dShow$dGeneric.genericShowConstructor({genericShowArgs: v => [showColor.show(v)]})({reflectSymbol: () => "PBackground"});
1070+ return x => {
1071+ const $5 = genericGraphicsParam.from(x);
1072+ if ($5.tag === "Inl") { return $0["genericShow'"]($5._1); }
1073+ if ($5.tag === "Inr") {
1074+ if ($5._1.tag === "Inl") { return $1["genericShow'"]($5._1._1); }
1075+ if ($5._1.tag === "Inr") {
1076+ if ($5._1._1.tag === "Inl") { return $2["genericShow'"]($5._1._1._1); }
1077+ if ($5._1._1.tag === "Inr") { return $3["genericShow'"]($5._1._1._1); }
1078+ $runtime.fail();
1079+ }
1080+ $runtime.fail();
1081+ }
1082+ $runtime.fail();
1083+ };
1084+ })()
1085+};
1086+const showEscapeCode = {
1087+ show: /* #__PURE__ */ (() => {
1088+ const $0 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "Up"});
1089+ const $1 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "Down"});
1090+ const $2 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "Forward"});
1091+ const $3 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "Back"});
1092+ const $4 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "NextLine"});
1093+ const $5 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "PreviousLine"});
1094+ const $6 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "HorizontalAbsolute"});
1095+ const $7 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsProduct(genericShowArgsArgument)(genericShowArgsArgument))({
1096+ reflectSymbol: () => "Position"
1097+ });
1098+ const $8 = Data$dShow$dGeneric.genericShowConstructor({genericShowArgs: v => [showEraseParam.show(v)]})({reflectSymbol: () => "EraseData"});
1099+ const $9 = Data$dShow$dGeneric.genericShowConstructor({genericShowArgs: v => [showEraseParam.show(v)]})({reflectSymbol: () => "EraseLine"});
1100+ const $10 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "ScrollUp"});
1101+ const $11 = Data$dShow$dGeneric.genericShowConstructor(genericShowArgsArgument)({reflectSymbol: () => "ScrollDown"});
1102+ const $12 = Data$dShow$dGeneric.genericShowConstructor((() => {
1103+ const $12 = Data$dList$dTypes.showNonEmptyList(showGraphicsParam);
1104+ return {genericShowArgs: v => [$12.show(v)]};
1105+ })())({reflectSymbol: () => "Graphics"});
1106+ const $13 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "SavePosition"});
1107+ const $14 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "RestorePosition"});
1108+ const $15 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "QueryPosition"});
1109+ const $16 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "HideCursor"});
1110+ const $17 = Data$dShow$dGeneric.genericShowConstructor(Data$dShow$dGeneric.genericShowArgsNoArguments)({reflectSymbol: () => "ShowCursor"});
1111+ return x => {
1112+ const $19 = genericEscapeCode.from(x);
1113+ if ($19.tag === "Inl") { return $0["genericShow'"]($19._1); }
1114+ if ($19.tag === "Inr") {
1115+ if ($19._1.tag === "Inl") { return $1["genericShow'"]($19._1._1); }
1116+ if ($19._1.tag === "Inr") {
1117+ if ($19._1._1.tag === "Inl") { return $2["genericShow'"]($19._1._1._1); }
1118+ if ($19._1._1.tag === "Inr") {
1119+ if ($19._1._1._1.tag === "Inl") { return $3["genericShow'"]($19._1._1._1._1); }
1120+ if ($19._1._1._1.tag === "Inr") {
1121+ if ($19._1._1._1._1.tag === "Inl") { return $4["genericShow'"]($19._1._1._1._1._1); }
1122+ if ($19._1._1._1._1.tag === "Inr") {
1123+ if ($19._1._1._1._1._1.tag === "Inl") { return $5["genericShow'"]($19._1._1._1._1._1._1); }
1124+ if ($19._1._1._1._1._1.tag === "Inr") {
1125+ if ($19._1._1._1._1._1._1.tag === "Inl") { return $6["genericShow'"]($19._1._1._1._1._1._1._1); }
1126+ if ($19._1._1._1._1._1._1.tag === "Inr") {
1127+ if ($19._1._1._1._1._1._1._1.tag === "Inl") { return $7["genericShow'"]($19._1._1._1._1._1._1._1._1); }
1128+ if ($19._1._1._1._1._1._1._1.tag === "Inr") {
1129+ if ($19._1._1._1._1._1._1._1._1.tag === "Inl") { return $8["genericShow'"]($19._1._1._1._1._1._1._1._1._1); }
1130+ if ($19._1._1._1._1._1._1._1._1.tag === "Inr") {
1131+ if ($19._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $9["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1); }
1132+ if ($19._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1133+ if ($19._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $10["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1); }
1134+ if ($19._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1135+ if ($19._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $11["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1._1); }
1136+ if ($19._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1137+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $12["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1._1._1); }
1138+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1139+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $13["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1); }
1140+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1141+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") { return $14["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1); }
1142+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1143+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") {
1144+ return $15["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1);
1145+ }
1146+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1147+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inl") {
1148+ return $16["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1);
1149+ }
1150+ if ($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1.tag === "Inr") {
1151+ return $17["genericShow'"]($19._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1._1);
1152+ }
1153+ $runtime.fail();
1154+ }
1155+ $runtime.fail();
1156+ }
1157+ $runtime.fail();
1158+ }
1159+ $runtime.fail();
1160+ }
1161+ $runtime.fail();
1162+ }
1163+ $runtime.fail();
1164+ }
1165+ $runtime.fail();
1166+ }
1167+ $runtime.fail();
1168+ }
1169+ $runtime.fail();
1170+ }
1171+ $runtime.fail();
1172+ }
1173+ $runtime.fail();
1174+ }
1175+ $runtime.fail();
1176+ }
1177+ $runtime.fail();
1178+ }
1179+ $runtime.fail();
1180+ }
1181+ $runtime.fail();
1182+ }
1183+ $runtime.fail();
1184+ }
1185+ $runtime.fail();
1186+ };
1187+ })()
1188+};
1189+const eraseParamToString = ep => {
1190+ if (ep.tag === "ToEnd") { return "0"; }
1191+ if (ep.tag === "FromBeginning") { return "1"; }
1192+ if (ep.tag === "Entire") { return "2"; }
1193+ $runtime.fail();
1194+};
1195+const eqRenderingMode = {
1196+ eq: x => y => {
1197+ if (x.tag === "Bold") { return y.tag === "Bold"; }
1198+ if (x.tag === "Dim") { return y.tag === "Dim"; }
1199+ if (x.tag === "Italic") { return y.tag === "Italic"; }
1200+ if (x.tag === "Underline") { return y.tag === "Underline"; }
1201+ if (x.tag === "Inverse") { return y.tag === "Inverse"; }
1202+ if (x.tag === "Strikethrough") { return y.tag === "Strikethrough"; }
1203+ return false;
1204+ }
1205+};
1206+const ordRenderingMode = {
1207+ compare: x => y => {
1208+ if (x.tag === "Bold") {
1209+ if (y.tag === "Bold") { return Data$dOrdering.EQ; }
1210+ return Data$dOrdering.LT;
1211+ }
1212+ if (y.tag === "Bold") { return Data$dOrdering.GT; }
1213+ if (x.tag === "Dim") {
1214+ if (y.tag === "Dim") { return Data$dOrdering.EQ; }
1215+ return Data$dOrdering.LT;
1216+ }
1217+ if (y.tag === "Dim") { return Data$dOrdering.GT; }
1218+ if (x.tag === "Italic") {
1219+ if (y.tag === "Italic") { return Data$dOrdering.EQ; }
1220+ return Data$dOrdering.LT;
1221+ }
1222+ if (y.tag === "Italic") { return Data$dOrdering.GT; }
1223+ if (x.tag === "Underline") {
1224+ if (y.tag === "Underline") { return Data$dOrdering.EQ; }
1225+ return Data$dOrdering.LT;
1226+ }
1227+ if (y.tag === "Underline") { return Data$dOrdering.GT; }
1228+ if (x.tag === "Inverse") {
1229+ if (y.tag === "Inverse") { return Data$dOrdering.EQ; }
1230+ return Data$dOrdering.LT;
1231+ }
1232+ if (y.tag === "Inverse") { return Data$dOrdering.GT; }
1233+ if (x.tag === "Strikethrough") {
1234+ if (y.tag === "Strikethrough") { return Data$dOrdering.EQ; }
1235+ $runtime.fail();
1236+ }
1237+ $runtime.fail();
1238+ },
1239+ Eq0: () => eqRenderingMode
1240+};
1241+const eqEraseParam = {
1242+ eq: x => y => {
1243+ if (x.tag === "ToEnd") { return y.tag === "ToEnd"; }
1244+ if (x.tag === "FromBeginning") { return y.tag === "FromBeginning"; }
1245+ if (x.tag === "Entire") { return y.tag === "Entire"; }
1246+ return false;
1247+ }
1248+};
1249+const ordEraseParam = {
1250+ compare: x => y => {
1251+ if (x.tag === "ToEnd") {
1252+ if (y.tag === "ToEnd") { return Data$dOrdering.EQ; }
1253+ return Data$dOrdering.LT;
1254+ }
1255+ if (y.tag === "ToEnd") { return Data$dOrdering.GT; }
1256+ if (x.tag === "FromBeginning") {
1257+ if (y.tag === "FromBeginning") { return Data$dOrdering.EQ; }
1258+ return Data$dOrdering.LT;
1259+ }
1260+ if (y.tag === "FromBeginning") { return Data$dOrdering.GT; }
1261+ if (x.tag === "Entire") {
1262+ if (y.tag === "Entire") { return Data$dOrdering.EQ; }
1263+ $runtime.fail();
1264+ }
1265+ $runtime.fail();
1266+ },
1267+ Eq0: () => eqEraseParam
1268+};
1269+const eqColor = {
1270+ eq: x => y => {
1271+ if (x.tag === "Black") { return y.tag === "Black"; }
1272+ if (x.tag === "Red") { return y.tag === "Red"; }
1273+ if (x.tag === "Green") { return y.tag === "Green"; }
1274+ if (x.tag === "Yellow") { return y.tag === "Yellow"; }
1275+ if (x.tag === "Blue") { return y.tag === "Blue"; }
1276+ if (x.tag === "Magenta") { return y.tag === "Magenta"; }
1277+ if (x.tag === "Cyan") { return y.tag === "Cyan"; }
1278+ if (x.tag === "White") { return y.tag === "White"; }
1279+ if (x.tag === "BrightBlack") { return y.tag === "BrightBlack"; }
1280+ if (x.tag === "BrightRed") { return y.tag === "BrightRed"; }
1281+ if (x.tag === "BrightGreen") { return y.tag === "BrightGreen"; }
1282+ if (x.tag === "BrightYellow") { return y.tag === "BrightYellow"; }
1283+ if (x.tag === "BrightBlue") { return y.tag === "BrightBlue"; }
1284+ if (x.tag === "BrightMagenta") { return y.tag === "BrightMagenta"; }
1285+ if (x.tag === "BrightCyan") { return y.tag === "BrightCyan"; }
1286+ if (x.tag === "BrightWhite") { return y.tag === "BrightWhite"; }
1287+ return false;
1288+ }
1289+};
1290+const eqGraphicsParam = {
1291+ eq: x => y => {
1292+ if (x.tag === "Reset") { return y.tag === "Reset"; }
1293+ if (x.tag === "PMode") {
1294+ if (y.tag === "PMode") {
1295+ if (x._1.tag === "Bold") { return y._1.tag === "Bold"; }
1296+ if (x._1.tag === "Dim") { return y._1.tag === "Dim"; }
1297+ if (x._1.tag === "Italic") { return y._1.tag === "Italic"; }
1298+ if (x._1.tag === "Underline") { return y._1.tag === "Underline"; }
1299+ if (x._1.tag === "Inverse") { return y._1.tag === "Inverse"; }
1300+ if (x._1.tag === "Strikethrough") { return y._1.tag === "Strikethrough"; }
1301+ return false;
1302+ }
1303+ return false;
1304+ }
1305+ if (x.tag === "PForeground") {
1306+ if (y.tag === "PForeground") { return eqColor.eq(x._1)(y._1); }
1307+ return false;
1308+ }
1309+ if (x.tag === "PBackground") {
1310+ if (y.tag === "PBackground") { return eqColor.eq(x._1)(y._1); }
1311+ return false;
1312+ }
1313+ return false;
1314+ }
1315+};
1316+const eq4 = x => y => eqGraphicsParam.eq(x._1)(y._1) && (() => {
1317+ const go = go$a0$copy => go$a1$copy => go$a2$copy => {
1318+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$a2 = go$a2$copy, go$c = true, go$r;
1319+ while (go$c) {
1320+ const v = go$a0, v1 = go$a1, v2 = go$a2;
1321+ if (!v2) {
1322+ go$c = false;
1323+ go$r = false;
1324+ continue;
1325+ }
1326+ if (v.tag === "Nil") {
1327+ if (v1.tag === "Nil") {
1328+ go$c = false;
1329+ go$r = v2;
1330+ continue;
1331+ }
1332+ go$c = false;
1333+ go$r = false;
1334+ continue;
1335+ }
1336+ if (v.tag === "Cons") {
1337+ if (v1.tag === "Cons") {
1338+ go$a0 = v._2;
1339+ go$a1 = v1._2;
1340+ go$a2 = v2 && eqGraphicsParam.eq(v1._1)(v._1);
1341+ continue;
1342+ }
1343+ go$c = false;
1344+ go$r = false;
1345+ continue;
1346+ }
1347+ go$c = false;
1348+ go$r = false;
1349+ continue;
1350+ };
1351+ return go$r;
1352+ };
1353+ return go(x._2)(y._2)(true);
1354+})();
1355+const eqEscapeCode = {
1356+ eq: x => y => {
1357+ if (x.tag === "Up") {
1358+ if (y.tag === "Up") { return x._1 === y._1; }
1359+ return false;
1360+ }
1361+ if (x.tag === "Down") {
1362+ if (y.tag === "Down") { return x._1 === y._1; }
1363+ return false;
1364+ }
1365+ if (x.tag === "Forward") {
1366+ if (y.tag === "Forward") { return x._1 === y._1; }
1367+ return false;
1368+ }
1369+ if (x.tag === "Back") {
1370+ if (y.tag === "Back") { return x._1 === y._1; }
1371+ return false;
1372+ }
1373+ if (x.tag === "NextLine") {
1374+ if (y.tag === "NextLine") { return x._1 === y._1; }
1375+ return false;
1376+ }
1377+ if (x.tag === "PreviousLine") {
1378+ if (y.tag === "PreviousLine") { return x._1 === y._1; }
1379+ return false;
1380+ }
1381+ if (x.tag === "HorizontalAbsolute") {
1382+ if (y.tag === "HorizontalAbsolute") { return x._1 === y._1; }
1383+ return false;
1384+ }
1385+ if (x.tag === "Position") {
1386+ if (y.tag === "Position") { return x._1 === y._1 && x._2 === y._2; }
1387+ return false;
1388+ }
1389+ if (x.tag === "EraseData") {
1390+ if (y.tag === "EraseData") {
1391+ if (x._1.tag === "ToEnd") { return y._1.tag === "ToEnd"; }
1392+ if (x._1.tag === "FromBeginning") { return y._1.tag === "FromBeginning"; }
1393+ if (x._1.tag === "Entire") { return y._1.tag === "Entire"; }
1394+ return false;
1395+ }
1396+ return false;
1397+ }
1398+ if (x.tag === "EraseLine") {
1399+ if (y.tag === "EraseLine") {
1400+ if (x._1.tag === "ToEnd") { return y._1.tag === "ToEnd"; }
1401+ if (x._1.tag === "FromBeginning") { return y._1.tag === "FromBeginning"; }
1402+ if (x._1.tag === "Entire") { return y._1.tag === "Entire"; }
1403+ return false;
1404+ }
1405+ return false;
1406+ }
1407+ if (x.tag === "ScrollUp") {
1408+ if (y.tag === "ScrollUp") { return x._1 === y._1; }
1409+ return false;
1410+ }
1411+ if (x.tag === "ScrollDown") {
1412+ if (y.tag === "ScrollDown") { return x._1 === y._1; }
1413+ return false;
1414+ }
1415+ if (x.tag === "Graphics") {
1416+ if (y.tag === "Graphics") { return eq4(x._1)(y._1); }
1417+ return false;
1418+ }
1419+ if (x.tag === "SavePosition") { return y.tag === "SavePosition"; }
1420+ if (x.tag === "RestorePosition") { return y.tag === "RestorePosition"; }
1421+ if (x.tag === "QueryPosition") { return y.tag === "QueryPosition"; }
1422+ if (x.tag === "HideCursor") { return y.tag === "HideCursor"; }
1423+ if (x.tag === "ShowCursor") { return y.tag === "ShowCursor"; }
1424+ return false;
1425+ }
1426+};
1427+const ordColor = {
1428+ compare: x => y => {
1429+ if (x.tag === "Black") {
1430+ if (y.tag === "Black") { return Data$dOrdering.EQ; }
1431+ return Data$dOrdering.LT;
1432+ }
1433+ if (y.tag === "Black") { return Data$dOrdering.GT; }
1434+ if (x.tag === "Red") {
1435+ if (y.tag === "Red") { return Data$dOrdering.EQ; }
1436+ return Data$dOrdering.LT;
1437+ }
1438+ if (y.tag === "Red") { return Data$dOrdering.GT; }
1439+ if (x.tag === "Green") {
1440+ if (y.tag === "Green") { return Data$dOrdering.EQ; }
1441+ return Data$dOrdering.LT;
1442+ }
1443+ if (y.tag === "Green") { return Data$dOrdering.GT; }
1444+ if (x.tag === "Yellow") {
1445+ if (y.tag === "Yellow") { return Data$dOrdering.EQ; }
1446+ return Data$dOrdering.LT;
1447+ }
1448+ if (y.tag === "Yellow") { return Data$dOrdering.GT; }
1449+ if (x.tag === "Blue") {
1450+ if (y.tag === "Blue") { return Data$dOrdering.EQ; }
1451+ return Data$dOrdering.LT;
1452+ }
1453+ if (y.tag === "Blue") { return Data$dOrdering.GT; }
1454+ if (x.tag === "Magenta") {
1455+ if (y.tag === "Magenta") { return Data$dOrdering.EQ; }
1456+ return Data$dOrdering.LT;
1457+ }
1458+ if (y.tag === "Magenta") { return Data$dOrdering.GT; }
1459+ if (x.tag === "Cyan") {
1460+ if (y.tag === "Cyan") { return Data$dOrdering.EQ; }
1461+ return Data$dOrdering.LT;
1462+ }
1463+ if (y.tag === "Cyan") { return Data$dOrdering.GT; }
1464+ if (x.tag === "White") {
1465+ if (y.tag === "White") { return Data$dOrdering.EQ; }
1466+ return Data$dOrdering.LT;
1467+ }
1468+ if (y.tag === "White") { return Data$dOrdering.GT; }
1469+ if (x.tag === "BrightBlack") {
1470+ if (y.tag === "BrightBlack") { return Data$dOrdering.EQ; }
1471+ return Data$dOrdering.LT;
1472+ }
1473+ if (y.tag === "BrightBlack") { return Data$dOrdering.GT; }
1474+ if (x.tag === "BrightRed") {
1475+ if (y.tag === "BrightRed") { return Data$dOrdering.EQ; }
1476+ return Data$dOrdering.LT;
1477+ }
1478+ if (y.tag === "BrightRed") { return Data$dOrdering.GT; }
1479+ if (x.tag === "BrightGreen") {
1480+ if (y.tag === "BrightGreen") { return Data$dOrdering.EQ; }
1481+ return Data$dOrdering.LT;
1482+ }
1483+ if (y.tag === "BrightGreen") { return Data$dOrdering.GT; }
1484+ if (x.tag === "BrightYellow") {
1485+ if (y.tag === "BrightYellow") { return Data$dOrdering.EQ; }
1486+ return Data$dOrdering.LT;
1487+ }
1488+ if (y.tag === "BrightYellow") { return Data$dOrdering.GT; }
1489+ if (x.tag === "BrightBlue") {
1490+ if (y.tag === "BrightBlue") { return Data$dOrdering.EQ; }
1491+ return Data$dOrdering.LT;
1492+ }
1493+ if (y.tag === "BrightBlue") { return Data$dOrdering.GT; }
1494+ if (x.tag === "BrightMagenta") {
1495+ if (y.tag === "BrightMagenta") { return Data$dOrdering.EQ; }
1496+ return Data$dOrdering.LT;
1497+ }
1498+ if (y.tag === "BrightMagenta") { return Data$dOrdering.GT; }
1499+ if (x.tag === "BrightCyan") {
1500+ if (y.tag === "BrightCyan") { return Data$dOrdering.EQ; }
1501+ return Data$dOrdering.LT;
1502+ }
1503+ if (y.tag === "BrightCyan") { return Data$dOrdering.GT; }
1504+ if (x.tag === "BrightWhite") {
1505+ if (y.tag === "BrightWhite") { return Data$dOrdering.EQ; }
1506+ $runtime.fail();
1507+ }
1508+ $runtime.fail();
1509+ },
1510+ Eq0: () => eqColor
1511+};
1512+const ordGraphicsParam = {
1513+ compare: x => y => {
1514+ if (x.tag === "Reset") {
1515+ if (y.tag === "Reset") { return Data$dOrdering.EQ; }
1516+ return Data$dOrdering.LT;
1517+ }
1518+ if (y.tag === "Reset") { return Data$dOrdering.GT; }
1519+ if (x.tag === "PMode") {
1520+ if (y.tag === "PMode") { return ordRenderingMode.compare(x._1)(y._1); }
1521+ return Data$dOrdering.LT;
1522+ }
1523+ if (y.tag === "PMode") { return Data$dOrdering.GT; }
1524+ if (x.tag === "PForeground") {
1525+ if (y.tag === "PForeground") { return ordColor.compare(x._1)(y._1); }
1526+ return Data$dOrdering.LT;
1527+ }
1528+ if (y.tag === "PForeground") { return Data$dOrdering.GT; }
1529+ if (x.tag === "PBackground") {
1530+ if (y.tag === "PBackground") { return ordColor.compare(x._1)(y._1); }
1531+ $runtime.fail();
1532+ }
1533+ $runtime.fail();
1534+ },
1535+ Eq0: () => eqGraphicsParam
1536+};
1537+const compare4 = /* #__PURE__ */ (() => Data$dList$dTypes.ordNonEmpty(ordGraphicsParam).compare)();
1538+const ordEscapeCode = {
1539+ compare: x => y => {
1540+ if (x.tag === "Up") {
1541+ if (y.tag === "Up") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1542+ return Data$dOrdering.LT;
1543+ }
1544+ if (y.tag === "Up") { return Data$dOrdering.GT; }
1545+ if (x.tag === "Down") {
1546+ if (y.tag === "Down") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1547+ return Data$dOrdering.LT;
1548+ }
1549+ if (y.tag === "Down") { return Data$dOrdering.GT; }
1550+ if (x.tag === "Forward") {
1551+ if (y.tag === "Forward") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1552+ return Data$dOrdering.LT;
1553+ }
1554+ if (y.tag === "Forward") { return Data$dOrdering.GT; }
1555+ if (x.tag === "Back") {
1556+ if (y.tag === "Back") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1557+ return Data$dOrdering.LT;
1558+ }
1559+ if (y.tag === "Back") { return Data$dOrdering.GT; }
1560+ if (x.tag === "NextLine") {
1561+ if (y.tag === "NextLine") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1562+ return Data$dOrdering.LT;
1563+ }
1564+ if (y.tag === "NextLine") { return Data$dOrdering.GT; }
1565+ if (x.tag === "PreviousLine") {
1566+ if (y.tag === "PreviousLine") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1567+ return Data$dOrdering.LT;
1568+ }
1569+ if (y.tag === "PreviousLine") { return Data$dOrdering.GT; }
1570+ if (x.tag === "HorizontalAbsolute") {
1571+ if (y.tag === "HorizontalAbsolute") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1572+ return Data$dOrdering.LT;
1573+ }
1574+ if (y.tag === "HorizontalAbsolute") { return Data$dOrdering.GT; }
1575+ if (x.tag === "Position") {
1576+ if (y.tag === "Position") {
1577+ const v = Data$dOrd.ordInt.compare(x._1)(y._1);
1578+ if (v.tag === "LT") { return Data$dOrdering.LT; }
1579+ if (v.tag === "GT") { return Data$dOrdering.GT; }
1580+ return Data$dOrd.ordInt.compare(x._2)(y._2);
1581+ }
1582+ return Data$dOrdering.LT;
1583+ }
1584+ if (y.tag === "Position") { return Data$dOrdering.GT; }
1585+ if (x.tag === "EraseData") {
1586+ if (y.tag === "EraseData") { return ordEraseParam.compare(x._1)(y._1); }
1587+ return Data$dOrdering.LT;
1588+ }
1589+ if (y.tag === "EraseData") { return Data$dOrdering.GT; }
1590+ if (x.tag === "EraseLine") {
1591+ if (y.tag === "EraseLine") { return ordEraseParam.compare(x._1)(y._1); }
1592+ return Data$dOrdering.LT;
1593+ }
1594+ if (y.tag === "EraseLine") { return Data$dOrdering.GT; }
1595+ if (x.tag === "ScrollUp") {
1596+ if (y.tag === "ScrollUp") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1597+ return Data$dOrdering.LT;
1598+ }
1599+ if (y.tag === "ScrollUp") { return Data$dOrdering.GT; }
1600+ if (x.tag === "ScrollDown") {
1601+ if (y.tag === "ScrollDown") { return Data$dOrd.ordInt.compare(x._1)(y._1); }
1602+ return Data$dOrdering.LT;
1603+ }
1604+ if (y.tag === "ScrollDown") { return Data$dOrdering.GT; }
1605+ if (x.tag === "Graphics") {
1606+ if (y.tag === "Graphics") { return compare4(x._1)(y._1); }
1607+ return Data$dOrdering.LT;
1608+ }
1609+ if (y.tag === "Graphics") { return Data$dOrdering.GT; }
1610+ if (x.tag === "SavePosition") {
1611+ if (y.tag === "SavePosition") { return Data$dOrdering.EQ; }
1612+ return Data$dOrdering.LT;
1613+ }
1614+ if (y.tag === "SavePosition") { return Data$dOrdering.GT; }
1615+ if (x.tag === "RestorePosition") {
1616+ if (y.tag === "RestorePosition") { return Data$dOrdering.EQ; }
1617+ return Data$dOrdering.LT;
1618+ }
1619+ if (y.tag === "RestorePosition") { return Data$dOrdering.GT; }
1620+ if (x.tag === "QueryPosition") {
1621+ if (y.tag === "QueryPosition") { return Data$dOrdering.EQ; }
1622+ return Data$dOrdering.LT;
1623+ }
1624+ if (y.tag === "QueryPosition") { return Data$dOrdering.GT; }
1625+ if (x.tag === "HideCursor") {
1626+ if (y.tag === "HideCursor") { return Data$dOrdering.EQ; }
1627+ return Data$dOrdering.LT;
1628+ }
1629+ if (y.tag === "HideCursor") { return Data$dOrdering.GT; }
1630+ if (x.tag === "ShowCursor") {
1631+ if (y.tag === "ShowCursor") { return Data$dOrdering.EQ; }
1632+ $runtime.fail();
1633+ }
1634+ $runtime.fail();
1635+ },
1636+ Eq0: () => eqEscapeCode
1637+};
1638+const colorSuffix = "m";
1639+const colorCode = c => {
1640+ if (c.tag === "Black") { return 30; }
1641+ if (c.tag === "Red") { return 31; }
1642+ if (c.tag === "Green") { return 32; }
1643+ if (c.tag === "Yellow") { return 33; }
1644+ if (c.tag === "Blue") { return 34; }
1645+ if (c.tag === "Magenta") { return 35; }
1646+ if (c.tag === "Cyan") { return 36; }
1647+ if (c.tag === "White") { return 37; }
1648+ if (c.tag === "BrightBlack") { return 90; }
1649+ if (c.tag === "BrightRed") { return 91; }
1650+ if (c.tag === "BrightGreen") { return 92; }
1651+ if (c.tag === "BrightYellow") { return 93; }
1652+ if (c.tag === "BrightBlue") { return 94; }
1653+ if (c.tag === "BrightMagenta") { return 95; }
1654+ if (c.tag === "BrightCyan") { return 96; }
1655+ if (c.tag === "BrightWhite") { return 97; }
1656+ $runtime.fail();
1657+};
1658+const codeForRenderingMode = m => {
1659+ if (m.tag === "Bold") { return 1; }
1660+ if (m.tag === "Dim") { return 2; }
1661+ if (m.tag === "Italic") { return 3; }
1662+ if (m.tag === "Underline") { return 4; }
1663+ if (m.tag === "Inverse") { return 7; }
1664+ if (m.tag === "Strikethrough") { return 9; }
1665+ $runtime.fail();
1666+};
1667+const graphicsParamToString = gp => {
1668+ if (gp.tag === "Reset") { return "0"; }
1669+ if (gp.tag === "PMode") {
1670+ return Data$dShow.showIntImpl((() => {
1671+ if (gp._1.tag === "Bold") { return 1; }
1672+ if (gp._1.tag === "Dim") { return 2; }
1673+ if (gp._1.tag === "Italic") { return 3; }
1674+ if (gp._1.tag === "Underline") { return 4; }
1675+ if (gp._1.tag === "Inverse") { return 7; }
1676+ if (gp._1.tag === "Strikethrough") { return 9; }
1677+ $runtime.fail();
1678+ })());
1679+ }
1680+ if (gp.tag === "PForeground") {
1681+ return Data$dShow.showIntImpl((() => {
1682+ if (gp._1.tag === "Black") { return 30; }
1683+ if (gp._1.tag === "Red") { return 31; }
1684+ if (gp._1.tag === "Green") { return 32; }
1685+ if (gp._1.tag === "Yellow") { return 33; }
1686+ if (gp._1.tag === "Blue") { return 34; }
1687+ if (gp._1.tag === "Magenta") { return 35; }
1688+ if (gp._1.tag === "Cyan") { return 36; }
1689+ if (gp._1.tag === "White") { return 37; }
1690+ if (gp._1.tag === "BrightBlack") { return 90; }
1691+ if (gp._1.tag === "BrightRed") { return 91; }
1692+ if (gp._1.tag === "BrightGreen") { return 92; }
1693+ if (gp._1.tag === "BrightYellow") { return 93; }
1694+ if (gp._1.tag === "BrightBlue") { return 94; }
1695+ if (gp._1.tag === "BrightMagenta") { return 95; }
1696+ if (gp._1.tag === "BrightCyan") { return 96; }
1697+ if (gp._1.tag === "BrightWhite") { return 97; }
1698+ $runtime.fail();
1699+ })());
1700+ }
1701+ if (gp.tag === "PBackground") {
1702+ return Data$dShow.showIntImpl((() => {
1703+ if (gp._1.tag === "Black") { return 40; }
1704+ if (gp._1.tag === "Red") { return 41; }
1705+ if (gp._1.tag === "Green") { return 42; }
1706+ if (gp._1.tag === "Yellow") { return 43; }
1707+ if (gp._1.tag === "Blue") { return 44; }
1708+ if (gp._1.tag === "Magenta") { return 45; }
1709+ if (gp._1.tag === "Cyan") { return 46; }
1710+ if (gp._1.tag === "White") { return 47; }
1711+ if (gp._1.tag === "BrightBlack") { return 100; }
1712+ if (gp._1.tag === "BrightRed") { return 101; }
1713+ if (gp._1.tag === "BrightGreen") { return 102; }
1714+ if (gp._1.tag === "BrightYellow") { return 103; }
1715+ if (gp._1.tag === "BrightBlue") { return 104; }
1716+ if (gp._1.tag === "BrightMagenta") { return 105; }
1717+ if (gp._1.tag === "BrightCyan") { return 106; }
1718+ if (gp._1.tag === "BrightWhite") { return 107; }
1719+ $runtime.fail();
1720+ })());
1721+ }
1722+ $runtime.fail();
1723+};
1724+const escapeCodeToString = x => {
1725+ if (x.tag === "Up") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "A"); }
1726+ if (x.tag === "Down") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "B"); }
1727+ if (x.tag === "Forward") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "C"); }
1728+ if (x.tag === "Back") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "D"); }
1729+ if (x.tag === "NextLine") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "E"); }
1730+ if (x.tag === "PreviousLine") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "F"); }
1731+ if (x.tag === "HorizontalAbsolute") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "G"); }
1732+ if (x.tag === "Position") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + (";" + (Data$dShow.showIntImpl(x._2) + "H"))); }
1733+ if (x.tag === "EraseData") {
1734+ if (x._1.tag === "ToEnd") { return "\u001b[0J"; }
1735+ if (x._1.tag === "FromBeginning") { return "\u001b[1J"; }
1736+ if (x._1.tag === "Entire") { return "\u001b[2J"; }
1737+ $runtime.fail();
1738+ }
1739+ if (x.tag === "EraseLine") {
1740+ if (x._1.tag === "ToEnd") { return "\u001b[0K"; }
1741+ if (x._1.tag === "FromBeginning") { return "\u001b[1K"; }
1742+ if (x._1.tag === "Entire") { return "\u001b[2K"; }
1743+ $runtime.fail();
1744+ }
1745+ if (x.tag === "ScrollUp") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "S"); }
1746+ if (x.tag === "ScrollDown") { return "\u001b[" + (Data$dShow.showIntImpl(x._1) + "T"); }
1747+ if (x.tag === "Graphics") {
1748+ const $1 = Data$dList$dTypes.functorNonEmptyList.map(graphicsParamToString)(x._1);
1749+ const go = go$a0$copy => go$a1$copy => {
1750+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
1751+ while (go$c) {
1752+ const b = go$a0, v = go$a1;
1753+ if (v.tag === "Nil") {
1754+ go$c = false;
1755+ go$r = b;
1756+ continue;
1757+ }
1758+ if (v.tag === "Cons") {
1759+ go$a0 = (() => {
1760+ if (b.init) { return {init: false, acc: v._1}; }
1761+ return {init: false, acc: b.acc + (";" + v._1)};
1762+ })();
1763+ go$a1 = v._2;
1764+ continue;
1765+ }
1766+ $runtime.fail();
1767+ };
1768+ return go$r;
1769+ };
1770+ return "\u001b[" + (go({init: false, acc: $1._1})($1._2).acc + "m");
1771+ }
1772+ if (x.tag === "SavePosition") { return "\u001b[s"; }
1773+ if (x.tag === "RestorePosition") { return "\u001b[u"; }
1774+ if (x.tag === "QueryPosition") { return "\u001b[6n"; }
1775+ if (x.tag === "HideCursor") { return "\u001b[?25l"; }
1776+ if (x.tag === "ShowCursor") { return "\u001b[?25h"; }
1777+ $runtime.fail();
1778+};
1779+export {
1780+ $Color,
1781+ $EraseParam,
1782+ $EscapeCode,
1783+ $GraphicsParam,
1784+ $RenderingMode,
1785+ Back,
1786+ Black,
1787+ Blue,
1788+ Bold,
1789+ BrightBlack,
1790+ BrightBlue,
1791+ BrightCyan,
1792+ BrightGreen,
1793+ BrightMagenta,
1794+ BrightRed,
1795+ BrightWhite,
1796+ BrightYellow,
1797+ Cyan,
1798+ Dim,
1799+ Down,
1800+ Entire,
1801+ EraseData,
1802+ EraseLine,
1803+ Forward,
1804+ FromBeginning,
1805+ Graphics,
1806+ Green,
1807+ HideCursor,
1808+ HorizontalAbsolute,
1809+ Inverse,
1810+ Italic,
1811+ Magenta,
1812+ NextLine,
1813+ PBackground,
1814+ PForeground,
1815+ PMode,
1816+ Position,
1817+ PreviousLine,
1818+ QueryPosition,
1819+ Red,
1820+ Reset,
1821+ RestorePosition,
1822+ SavePosition,
1823+ ScrollDown,
1824+ ScrollUp,
1825+ ShowCursor,
1826+ Strikethrough,
1827+ ToEnd,
1828+ Underline,
1829+ Up,
1830+ White,
1831+ Yellow,
1832+ codeForRenderingMode,
1833+ colorCode,
1834+ colorSuffix,
1835+ compare4,
1836+ eq4,
1837+ eqColor,
1838+ eqEraseParam,
1839+ eqEscapeCode,
1840+ eqGraphicsParam,
1841+ eqRenderingMode,
1842+ eraseParamToString,
1843+ escapeCodeToString,
1844+ genericColor,
1845+ genericEraseParam,
1846+ genericEscapeCode,
1847+ genericGraphicsParam,
1848+ genericRenderingMode,
1849+ genericShowArgsArgument,
1850+ graphicsParamToString,
1851+ ordColor,
1852+ ordEraseParam,
1853+ ordEscapeCode,
1854+ ordGraphicsParam,
1855+ ordRenderingMode,
1856+ prefix,
1857+ showColor,
1858+ showEraseParam,
1859+ showEscapeCode,
1860+ showGraphicsParam,
1861+ showRenderingMode
1862+};
.storybook/purescript-indexer/output-es/Ansi.Output/index.jsnew file+18
@@ -0,0 +1,18 @@
1+// | Convenience functions to simplify outputting ANSI escape codes to
2+// | terminals.
3+import * as $runtime from "../runtime.js";
4+import * as Ansi$dCodes from "../Ansi.Codes/index.js";
5+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
6+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
7+const withGraphics = params => text => Ansi$dCodes.escapeCodeToString(Ansi$dCodes.$EscapeCode("Graphics", params)) + (
8+ text + Ansi$dCodes.escapeCodeToString(Ansi$dCodes.$EscapeCode("Graphics", Data$dNonEmpty.$NonEmpty(Ansi$dCodes.Reset, Data$dList$dTypes.Nil)))
9+);
10+const underline = /* #__PURE__ */ Data$dNonEmpty.$NonEmpty(/* #__PURE__ */ Ansi$dCodes.$GraphicsParam("PMode", Ansi$dCodes.Underline), Data$dList$dTypes.Nil);
11+const strikethrough = /* #__PURE__ */ Data$dNonEmpty.$NonEmpty(/* #__PURE__ */ Ansi$dCodes.$GraphicsParam("PMode", Ansi$dCodes.Strikethrough), Data$dList$dTypes.Nil);
12+const italic = /* #__PURE__ */ Data$dNonEmpty.$NonEmpty(/* #__PURE__ */ Ansi$dCodes.$GraphicsParam("PMode", Ansi$dCodes.Italic), Data$dList$dTypes.Nil);
13+const inverse = /* #__PURE__ */ Data$dNonEmpty.$NonEmpty(/* #__PURE__ */ Ansi$dCodes.$GraphicsParam("PMode", Ansi$dCodes.Inverse), Data$dList$dTypes.Nil);
14+const foreground = c => Data$dNonEmpty.$NonEmpty(Ansi$dCodes.$GraphicsParam("PForeground", c), Data$dList$dTypes.Nil);
15+const dim = /* #__PURE__ */ Data$dNonEmpty.$NonEmpty(/* #__PURE__ */ Ansi$dCodes.$GraphicsParam("PMode", Ansi$dCodes.Dim), Data$dList$dTypes.Nil);
16+const bold = /* #__PURE__ */ Data$dNonEmpty.$NonEmpty(/* #__PURE__ */ Ansi$dCodes.$GraphicsParam("PMode", Ansi$dCodes.Bold), Data$dList$dTypes.Nil);
17+const background = c => Data$dNonEmpty.$NonEmpty(Ansi$dCodes.$GraphicsParam("PBackground", c), Data$dList$dTypes.Nil);
18+export {background, bold, dim, foreground, inverse, italic, strikethrough, underline, withGraphics};
.storybook/purescript-indexer/output-es/Control.Alt/index.jsnew file+6
@@ -0,0 +1,6 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dFunctor from "../Data.Functor/index.js";
3+import * as Data$dSemigroup from "../Data.Semigroup/index.js";
4+const altArray = {alt: Data$dSemigroup.concatArray, Functor0: () => Data$dFunctor.functorArray};
5+const alt = dict => dict.alt;
6+export {alt, altArray};
.storybook/purescript-indexer/output-es/Control.Alternative/index.jsnew file+14
@@ -0,0 +1,14 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dApplicative from "../Control.Applicative/index.js";
3+import * as Control$dPlus from "../Control.Plus/index.js";
4+import * as Data$dUnit from "../Data.Unit/index.js";
5+const guard = dictAlternative => {
6+ const pure = dictAlternative.Applicative0().pure;
7+ const empty = dictAlternative.Plus1().empty;
8+ return v => {
9+ if (v) { return pure(Data$dUnit.unit); }
10+ return empty;
11+ };
12+};
13+const alternativeArray = {Applicative0: () => Control$dApplicative.applicativeArray, Plus1: () => Control$dPlus.plusArray};
14+export {alternativeArray, guard};
.storybook/purescript-indexer/output-es/Control.Applicative/index.jsnew file+22
@@ -0,0 +1,22 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dApply from "../Control.Apply/index.js";
3+import * as Data$dUnit from "../Data.Unit/index.js";
4+import * as Type$dProxy from "../Type.Proxy/index.js";
5+const pure = dict => dict.pure;
6+const unless = dictApplicative => v => v1 => {
7+ if (!v) { return v1; }
8+ if (v) { return dictApplicative.pure(Data$dUnit.unit); }
9+ $runtime.fail();
10+};
11+const when = dictApplicative => v => v1 => {
12+ if (v) { return v1; }
13+ return dictApplicative.pure(Data$dUnit.unit);
14+};
15+const liftA1 = dictApplicative => {
16+ const apply = dictApplicative.Apply0().apply;
17+ return f => a => apply(dictApplicative.pure(f))(a);
18+};
19+const applicativeProxy = {pure: v => Type$dProxy.Proxy, Apply0: () => Control$dApply.applyProxy};
20+const applicativeFn = {pure: x => v => x, Apply0: () => Control$dApply.applyFn};
21+const applicativeArray = {pure: x => [x], Apply0: () => Control$dApply.applyArray};
22+export {applicativeArray, applicativeFn, applicativeProxy, liftA1, pure, unless, when};
.storybook/purescript-indexer/output-es/Control.Apply/foreign.jsnew file+15
@@ -0,0 +1,15 @@
1+export const arrayApply = function (fs) {
2+ return function (xs) {
3+ var l = fs.length;
4+ var k = xs.length;
5+ var result = new Array(l*k);
6+ var n = 0;
7+ for (var i = 0; i < l; i++) {
8+ var f = fs[i];
9+ for (var j = 0; j < k; j++) {
10+ result[n++] = f(xs[j]);
11+ }
12+ }
13+ return result;
14+ };
15+};
.storybook/purescript-indexer/output-es/Control.Apply/index.jsnew file+36
@@ -0,0 +1,36 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dFunction from "../Data.Function/index.js";
3+import * as Data$dFunctor from "../Data.Functor/index.js";
4+import * as Type$dProxy from "../Type.Proxy/index.js";
5+import {arrayApply} from "./foreign.js";
6+const identity = x => x;
7+const applyProxy = {apply: v => v1 => Type$dProxy.Proxy, Functor0: () => Data$dFunctor.functorProxy};
8+const applyFn = {apply: f => g => x => f(x)(g(x)), Functor0: () => Data$dFunctor.functorFn};
9+const applyArray = {apply: arrayApply, Functor0: () => Data$dFunctor.functorArray};
10+const apply = dict => dict.apply;
11+const applyFirst = dictApply => {
12+ const map = dictApply.Functor0().map;
13+ return a => b => dictApply.apply(map(Data$dFunction.const)(a))(b);
14+};
15+const applySecond = dictApply => {
16+ const map = dictApply.Functor0().map;
17+ return a => b => dictApply.apply(map(v => identity)(a))(b);
18+};
19+const lift2 = dictApply => {
20+ const map = dictApply.Functor0().map;
21+ return f => a => b => dictApply.apply(map(f)(a))(b);
22+};
23+const lift3 = dictApply => {
24+ const map = dictApply.Functor0().map;
25+ return f => a => b => c => dictApply.apply(dictApply.apply(map(f)(a))(b))(c);
26+};
27+const lift4 = dictApply => {
28+ const map = dictApply.Functor0().map;
29+ return f => a => b => c => d => dictApply.apply(dictApply.apply(dictApply.apply(map(f)(a))(b))(c))(d);
30+};
31+const lift5 = dictApply => {
32+ const map = dictApply.Functor0().map;
33+ return f => a => b => c => d => e => dictApply.apply(dictApply.apply(dictApply.apply(dictApply.apply(map(f)(a))(b))(c))(d))(e);
34+};
35+export {apply, applyArray, applyFirst, applyFn, applyProxy, applySecond, identity, lift2, lift3, lift4, lift5};
36+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Control.Biapplicative/index.jsnew file+6
@@ -0,0 +1,6 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dBiapply from "../Control.Biapply/index.js";
3+import * as Data$dTuple from "../Data.Tuple/index.js";
4+const bipure = dict => dict.bipure;
5+const biapplicativeTuple = {bipure: Data$dTuple.Tuple, Biapply0: () => Control$dBiapply.biapplyTuple};
6+export {biapplicativeTuple, bipure};
.storybook/purescript-indexer/output-es/Control.Biapply/index.jsnew file+24
@@ -0,0 +1,24 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dBifunctor from "../Data.Bifunctor/index.js";
3+import * as Data$dFunction from "../Data.Function/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+const identity = x => x;
6+const biapplyTuple = {biapply: v => v1 => Data$dTuple.$Tuple(v._1(v1._1), v._2(v1._2)), Bifunctor0: () => Data$dBifunctor.bifunctorTuple};
7+const biapply = dict => dict.biapply;
8+const biapplyFirst = dictBiapply => {
9+ const bimap = dictBiapply.Bifunctor0().bimap;
10+ return a => b => dictBiapply.biapply(bimap(v => identity)(v => identity)(a))(b);
11+};
12+const biapplySecond = dictBiapply => {
13+ const bimap = dictBiapply.Bifunctor0().bimap;
14+ return a => b => dictBiapply.biapply(bimap(Data$dFunction.const)(Data$dFunction.const)(a))(b);
15+};
16+const bilift2 = dictBiapply => {
17+ const bimap = dictBiapply.Bifunctor0().bimap;
18+ return f => g => a => b => dictBiapply.biapply(bimap(f)(g)(a))(b);
19+};
20+const bilift3 = dictBiapply => {
21+ const bimap = dictBiapply.Bifunctor0().bimap;
22+ return f => g => a => b => c => dictBiapply.biapply(dictBiapply.biapply(bimap(f)(g)(a))(b))(c);
23+};
24+export {biapply, biapplyFirst, biapplySecond, biapplyTuple, bilift2, bilift3, identity};
.storybook/purescript-indexer/output-es/Control.Bind/foreign.jsnew file+9
@@ -0,0 +1,9 @@
1+export const arrayBind = function (arr) {
2+ return function (f) {
3+ var result = [];
4+ for (var i = 0, l = arr.length; i < l; i++) {
5+ Array.prototype.push.apply(result, f(arr[i]));
6+ }
7+ return result;
8+ };
9+};
.storybook/purescript-indexer/output-es/Control.Bind/index.jsnew file+22
@@ -0,0 +1,22 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dApply from "../Control.Apply/index.js";
3+import * as Type$dProxy from "../Type.Proxy/index.js";
4+import {arrayBind} from "./foreign.js";
5+const identity = x => x;
6+const discard = dict => dict.discard;
7+const bindProxy = {bind: v => v1 => Type$dProxy.Proxy, Apply0: () => Control$dApply.applyProxy};
8+const bindFn = {bind: m => f => x => f(m(x))(x), Apply0: () => Control$dApply.applyFn};
9+const bindArray = {bind: arrayBind, Apply0: () => Control$dApply.applyArray};
10+const bind = dict => dict.bind;
11+const bindFlipped = dictBind => b => a => dictBind.bind(a)(b);
12+const composeKleisliFlipped = dictBind => f => g => a => dictBind.bind(g(a))(f);
13+const composeKleisli = dictBind => f => g => a => dictBind.bind(f(a))(g);
14+const discardProxy = {discard: dictBind => dictBind.bind};
15+const discardUnit = {discard: dictBind => dictBind.bind};
16+const ifM = dictBind => cond => t => f => dictBind.bind(cond)(cond$p => {
17+ if (cond$p) { return t; }
18+ return f;
19+});
20+const join = dictBind => m => dictBind.bind(m)(identity);
21+export {bind, bindArray, bindFlipped, bindFn, bindProxy, composeKleisli, composeKleisliFlipped, discard, discardProxy, discardUnit, identity, ifM, join};
22+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Control.Category/index.jsnew file+5
@@ -0,0 +1,5 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dSemigroupoid from "../Control.Semigroupoid/index.js";
3+const identity = dict => dict.identity;
4+const categoryFn = {identity: x => x, Semigroupoid0: () => Control$dSemigroupoid.semigroupoidFn};
5+export {categoryFn, identity};
.storybook/purescript-indexer/output-es/Control.Comonad.Cofree.Class/index.jsnew file+30
@@ -0,0 +1,30 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dComonad$dCofree from "../Control.Comonad.Cofree/index.js";
3+import * as Control$dComonad$dEnv$dTrans from "../Control.Comonad.Env.Trans/index.js";
4+import * as Control$dComonad$dStore$dTrans from "../Control.Comonad.Store.Trans/index.js";
5+import * as Control$dComonad$dTraced$dTrans from "../Control.Comonad.Traced.Trans/index.js";
6+import * as Data$dTuple from "../Data.Tuple/index.js";
7+const unwrapCofree = dict => dict.unwrapCofree;
8+const comonadCofreeTracedT = dictFunctor => dictComonadCofree => {
9+ const Functor0 = dictComonadCofree.Functor0();
10+ const comonadTracedT = Control$dComonad$dTraced$dTrans.comonadTracedT(dictComonadCofree.Comonad1());
11+ return dictMonoid => {
12+ const comonadTracedT1 = comonadTracedT(dictMonoid);
13+ return {unwrapCofree: v => Functor0.map(Control$dComonad$dTraced$dTrans.TracedT)(dictComonadCofree.unwrapCofree(v)), Functor0: () => Functor0, Comonad1: () => comonadTracedT1};
14+ };
15+};
16+const comonadCofreeStoreT = dictFunctor => dictComonadCofree => {
17+ const Functor0 = dictComonadCofree.Functor0();
18+ const comonadStoreT = Control$dComonad$dStore$dTrans.comonadStoreT(dictComonadCofree.Comonad1());
19+ return {unwrapCofree: v => Functor0.map(x => Data$dTuple.$Tuple(x, v._2))(dictComonadCofree.unwrapCofree(v._1)), Functor0: () => Functor0, Comonad1: () => comonadStoreT};
20+};
21+const comonadCofreeEnvT = dictFunctor => dictComonadCofree => {
22+ const Functor0 = dictComonadCofree.Functor0();
23+ const comonadEnvT = Control$dComonad$dEnv$dTrans.comonadEnvT(dictComonadCofree.Comonad1());
24+ return {unwrapCofree: v => Functor0.map(x => Data$dTuple.$Tuple(v._1, x))(dictComonadCofree.unwrapCofree(v._2)), Functor0: () => Functor0, Comonad1: () => comonadEnvT};
25+};
26+const comonadCofreeCofree = dictFunctor => {
27+ const extendCofree1 = Control$dComonad$dCofree.extendCofree(dictFunctor);
28+ return {unwrapCofree: Control$dComonad$dCofree.tail, Functor0: () => dictFunctor, Comonad1: () => ({extract: Control$dComonad$dCofree.head, Extend0: () => extendCofree1})};
29+};
30+export {comonadCofreeCofree, comonadCofreeEnvT, comonadCofreeStoreT, comonadCofreeTracedT, unwrapCofree};
.storybook/purescript-indexer/output-es/Control.Comonad.Cofree/index.jsnew file+223
@@ -0,0 +1,223 @@
1+// | The _cofree comonad_ for a `Functor`.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dFree from "../Control.Monad.Free/index.js";
4+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
5+import * as Control$dMonad$dState$dTrans from "../Control.Monad.State.Trans/index.js";
6+import * as Data$dIdentity from "../Data.Identity/index.js";
7+import * as Data$dLazy from "../Data.Lazy/index.js";
8+import * as Data$dTuple from "../Data.Tuple/index.js";
9+import * as Data$dUnit from "../Data.Unit/index.js";
10+const identity = x => x;
11+const state = /* #__PURE__ */ (() => Control$dMonad$dState$dTrans.monadStateStateT(Data$dIdentity.monadIdentity).state)();
12+const monadRecStateT = /* #__PURE__ */ Control$dMonad$dState$dTrans.monadRecStateT(Control$dMonad$dRec$dClass.monadRecIdentity);
13+const tail = v => Data$dLazy.force(v)._2;
14+const mkCofree = a => t => Data$dLazy.defer(v => Data$dTuple.$Tuple(a, t));
15+const lazyCofree = {defer: k => Data$dLazy.defer(v => Data$dLazy.force(k(Data$dUnit.unit)))};
16+const hoistCofree = dictFunctor => nat => v => {
17+ const $3 = Data$dTuple.functorTuple.map((() => {
18+ const $3 = dictFunctor.map(hoistCofree(dictFunctor)(nat));
19+ return x => nat($3(x));
20+ })());
21+ return Data$dLazy.defer(v$1 => $3(Data$dLazy.force(v)));
22+};
23+const head = v => Data$dLazy.force(v)._1;
24+const functorCofree = dictFunctor => (
25+ {
26+ map: f => {
27+ const loop = v => Data$dLazy.defer(v$1 => {
28+ const $5 = Data$dLazy.force(v);
29+ return Data$dTuple.$Tuple(f($5._1), dictFunctor.map(loop)($5._2));
30+ });
31+ return loop;
32+ }
33+ }
34+);
35+const functorWithIndexCofree = dictFunctor => {
36+ const functorCofree1 = functorCofree(dictFunctor);
37+ return {
38+ mapWithIndex: f => {
39+ const loop = n => v => Data$dLazy.defer(v$1 => {
40+ const $7 = Data$dLazy.force(v);
41+ return Data$dTuple.$Tuple(f(n)($7._1), dictFunctor.map(loop(n + 1 | 0))($7._2));
42+ });
43+ return loop(0);
44+ },
45+ Functor0: () => functorCofree1
46+ };
47+};
48+const foldableCofree = dictFoldable => (
49+ {
50+ foldr: f => {
51+ const go = fa => b => f(Data$dLazy.force(fa)._1)(dictFoldable.foldr(go)(b)(Data$dLazy.force(fa)._2));
52+ return b => a => go(a)(b);
53+ },
54+ foldl: f => {
55+ const go = b => fa => dictFoldable.foldl(go)(f(b)(Data$dLazy.force(fa)._1))(Data$dLazy.force(fa)._2);
56+ return go;
57+ },
58+ foldMap: dictMonoid => {
59+ const append = dictMonoid.Semigroup0().append;
60+ const foldMap1 = dictFoldable.foldMap(dictMonoid);
61+ return f => {
62+ const go = fa => append(f(Data$dLazy.force(fa)._1))(foldMap1(go)(Data$dLazy.force(fa)._2));
63+ return go;
64+ };
65+ }
66+ }
67+);
68+const traversableCofree = dictTraversable => {
69+ const functorCofree1 = functorCofree(dictTraversable.Functor0());
70+ const foldableCofree1 = foldableCofree(dictTraversable.Foldable1());
71+ return {
72+ sequence: dictApplicative => traversableCofree(dictTraversable).traverse(dictApplicative)(identity),
73+ traverse: dictApplicative => {
74+ const Apply0 = dictApplicative.Apply0();
75+ const map2 = Apply0.Functor0().map;
76+ const traverse1 = dictTraversable.traverse(dictApplicative);
77+ return f => {
78+ const loop = ta => Apply0.apply(map2(mkCofree)(f(Data$dLazy.force(ta)._1)))(traverse1(loop)(Data$dLazy.force(ta)._2));
79+ return loop;
80+ };
81+ },
82+ Functor0: () => functorCofree1,
83+ Foldable1: () => foldableCofree1
84+ };
85+};
86+const extendCofree = dictFunctor => {
87+ const functorCofree1 = functorCofree(dictFunctor);
88+ return {
89+ extend: f => {
90+ const loop = v => Data$dLazy.defer(v$1 => Data$dTuple.$Tuple(f(v), dictFunctor.map(loop)(Data$dLazy.force(v)._2)));
91+ return loop;
92+ },
93+ Functor0: () => functorCofree1
94+ };
95+};
96+const eqCofree = dictEq1 => dictEq => (
97+ {eq: x => y => dictEq.eq(Data$dLazy.force(x)._1)(Data$dLazy.force(y)._1) && dictEq1.eq1(eqCofree(dictEq1)(dictEq))(Data$dLazy.force(x)._2)(Data$dLazy.force(y)._2)}
98+);
99+const ordCofree = dictOrd1 => {
100+ const eqCofree1 = eqCofree(dictOrd1.Eq10());
101+ return dictOrd => {
102+ const eqCofree2 = eqCofree1(dictOrd.Eq0());
103+ return {
104+ compare: x => y => {
105+ const v = dictOrd.compare(Data$dLazy.force(x)._1)(Data$dLazy.force(y)._1);
106+ if (v.tag === "EQ") { return dictOrd1.compare1(ordCofree(dictOrd1)(dictOrd))(Data$dLazy.force(x)._2)(Data$dLazy.force(y)._2); }
107+ return v;
108+ },
109+ Eq0: () => eqCofree2
110+ };
111+ };
112+};
113+const eq1Cofree = dictEq1 => ({eq1: dictEq => eqCofree(dictEq1)(dictEq).eq});
114+const ord1Cofree = dictOrd1 => {
115+ const ordCofree1 = ordCofree(dictOrd1);
116+ const $2 = dictOrd1.Eq10();
117+ const eq1Cofree1 = {eq1: dictEq => eqCofree($2)(dictEq).eq};
118+ return {compare1: dictOrd => ordCofree1(dictOrd).compare, Eq10: () => eq1Cofree1};
119+};
120+const deferCofree = x => Data$dLazy.defer(x);
121+const semigroupCofree = dictApply => {
122+ const map2 = dictApply.Functor0().map;
123+ return dictSemigroup => (
124+ {
125+ append: x => y => Data$dLazy.defer(v => Data$dTuple.$Tuple(
126+ dictSemigroup.append(Data$dLazy.force(x)._1)(Data$dLazy.force(y)._1),
127+ dictApply.apply(map2(semigroupCofree(dictApply)(dictSemigroup).append)(Data$dLazy.force(x)._2))(Data$dLazy.force(y)._2)
128+ ))
129+ }
130+ );
131+};
132+const monoidCofree = dictApplicative => {
133+ const semigroupCofree1 = semigroupCofree(dictApplicative.Apply0());
134+ return dictMonoid => {
135+ const semigroupCofree2 = semigroupCofree1(dictMonoid.Semigroup0());
136+ return {
137+ mempty: Data$dLazy.defer(v => Data$dTuple.$Tuple(dictMonoid.mempty, dictApplicative.pure(monoidCofree(dictApplicative)(dictMonoid).mempty))),
138+ Semigroup0: () => semigroupCofree2
139+ };
140+ };
141+};
142+const comonadCofree = dictFunctor => {
143+ const extendCofree1 = extendCofree(dictFunctor);
144+ return {extract: head, Extend0: () => extendCofree1};
145+};
146+const explore = dictFunctor => {
147+ const runFreeM = Control$dMonad$dFree.runFreeM(dictFunctor)(monadRecStateT);
148+ return dictFunctor1 => pair => m => w => {
149+ const v = runFreeM(ff => state(cof => pair(dictFunctor.map(Data$dTuple.Tuple)(ff))(Data$dLazy.force(cof)._2)))(m)(w);
150+ return v._1(Data$dLazy.force(v._2)._1);
151+ };
152+};
153+const exploreM = dictFunctor => dictFunctor1 => dictMonadRec => {
154+ const map3 = dictMonadRec.Monad0().Bind1().Apply0().Functor0().map;
155+ const runFreeM1 = Control$dMonad$dFree.runFreeM(dictFunctor)(Control$dMonad$dState$dTrans.monadRecStateT(dictMonadRec));
156+ return pair => m => w => map3(v => v._1(Data$dLazy.force(v._2)._1))(runFreeM1(ff => cof => pair(dictFunctor.map(Data$dTuple.Tuple)(ff))(Data$dLazy.force(cof)._2))(m)(w));
157+};
158+const buildCofree = dictFunctor => k => s => Data$dLazy.defer(v => {
159+ const $4 = k(s);
160+ return Data$dTuple.$Tuple($4._1, dictFunctor.map(buildCofree(dictFunctor)(k))($4._2));
161+});
162+const monadCofree = dictAlternative => ({Applicative0: () => applicativeCofree(dictAlternative), Bind1: () => bindCofree(dictAlternative)});
163+const bindCofree = dictAlternative => {
164+ const Alt0 = dictAlternative.Plus1().Alt0();
165+ const map2 = Alt0.Functor0().map;
166+ return {
167+ bind: fa => f => {
168+ const loop = fa$p => {
169+ const fh = f(Data$dLazy.force(fa$p)._1);
170+ const $8 = Data$dLazy.force(fh)._1;
171+ const $9 = Alt0.alt(Data$dLazy.force(fh)._2)(map2(loop)(Data$dLazy.force(fa$p)._2));
172+ return Data$dLazy.defer(v => Data$dTuple.$Tuple($8, $9));
173+ };
174+ return loop(fa);
175+ },
176+ Apply0: () => applyCofree(dictAlternative)
177+ };
178+};
179+const applyCofree = dictAlternative => {
180+ const functorCofree1 = functorCofree(dictAlternative.Plus1().Alt0().Functor0());
181+ return {
182+ apply: (() => {
183+ const bind = bindCofree(dictAlternative).bind;
184+ const pure = applicativeCofree(dictAlternative).pure;
185+ return f => a => bind(f)(f$p => bind(a)(a$p => pure(f$p(a$p))));
186+ })(),
187+ Functor0: () => functorCofree1
188+ };
189+};
190+const applicativeCofree = dictAlternative => {
191+ const empty = dictAlternative.Plus1().empty;
192+ return {pure: a => Data$dLazy.defer(v => Data$dTuple.$Tuple(a, empty)), Apply0: () => applyCofree(dictAlternative)};
193+};
194+export {
195+ applicativeCofree,
196+ applyCofree,
197+ bindCofree,
198+ buildCofree,
199+ comonadCofree,
200+ deferCofree,
201+ eq1Cofree,
202+ eqCofree,
203+ explore,
204+ exploreM,
205+ extendCofree,
206+ foldableCofree,
207+ functorCofree,
208+ functorWithIndexCofree,
209+ head,
210+ hoistCofree,
211+ identity,
212+ lazyCofree,
213+ mkCofree,
214+ monadCofree,
215+ monadRecStateT,
216+ monoidCofree,
217+ ord1Cofree,
218+ ordCofree,
219+ semigroupCofree,
220+ state,
221+ tail,
222+ traversableCofree
223+};
.storybook/purescript-indexer/output-es/Control.Comonad.Env.Class/index.jsnew file+18
@@ -0,0 +1,18 @@
1+// | This module defines the `ComonadEnv` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dComonad$dEnv$dTrans from "../Control.Comonad.Env.Trans/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+const local = dict => dict.local;
6+const comonadAskTuple = {ask: Data$dTuple.fst, Comonad0: () => Data$dTuple.comonadTuple};
7+const comonadEnvTuple = {local: f => v => Data$dTuple.$Tuple(f(v._1), v._2), ComonadAsk0: () => comonadAskTuple};
8+const comonadAskEnvT = dictComonad => {
9+ const comonadEnvT = Control$dComonad$dEnv$dTrans.comonadEnvT(dictComonad);
10+ return {ask: v => v._1, Comonad0: () => comonadEnvT};
11+};
12+const comonadEnvEnvT = dictComonad => {
13+ const comonadEnvT = Control$dComonad$dEnv$dTrans.comonadEnvT(dictComonad);
14+ return {local: f => v => Data$dTuple.$Tuple(f(v._1), v._2), ComonadAsk0: () => ({ask: v => v._1, Comonad0: () => comonadEnvT})};
15+};
16+const ask = dict => dict.ask;
17+const asks = dictComonadAsk => f => x => f(dictComonadAsk.ask(x));
18+export {ask, asks, comonadAskEnvT, comonadAskTuple, comonadEnvEnvT, comonadEnvTuple, local};
.storybook/purescript-indexer/output-es/Control.Comonad.Env.Trans/index.jsnew file+112
@@ -0,0 +1,112 @@
1+// | This module defines the environment comonad transformer, `EnvT`.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dTuple from "../Data.Tuple/index.js";
4+const EnvT = x => x;
5+const withEnvT = f => v => Data$dTuple.$Tuple(f(v._1), v._2);
6+const runEnvT = v => v;
7+const newtypeEnvT = {Coercible0: () => undefined};
8+const mapEnvT = f => v => Data$dTuple.$Tuple(v._1, f(v._2));
9+const functorEnvT = dictFunctor => ({map: f => v => Data$dTuple.$Tuple(v._1, dictFunctor.map(f)(v._2))});
10+const functorWithIndexEnvT = dictFunctorWithIndex => {
11+ const $1 = dictFunctorWithIndex.Functor0();
12+ const functorEnvT1 = {map: f => v => Data$dTuple.$Tuple(v._1, $1.map(f)(v._2))};
13+ return {mapWithIndex: f => v => Data$dTuple.$Tuple(v._1, dictFunctorWithIndex.mapWithIndex(f)(v._2)), Functor0: () => functorEnvT1};
14+};
15+const foldableEnvT = dictFoldable => (
16+ {
17+ foldl: fn => a => v => dictFoldable.foldl(fn)(a)(v._2),
18+ foldr: fn => a => v => dictFoldable.foldr(fn)(a)(v._2),
19+ foldMap: dictMonoid => {
20+ const foldMap1 = dictFoldable.foldMap(dictMonoid);
21+ return fn => v => foldMap1(fn)(v._2);
22+ }
23+ }
24+);
25+const foldableWithIndexEnvT = dictFoldableWithIndex => {
26+ const $1 = dictFoldableWithIndex.Foldable0();
27+ const foldableEnvT1 = {
28+ foldl: fn => a => v => $1.foldl(fn)(a)(v._2),
29+ foldr: fn => a => v => $1.foldr(fn)(a)(v._2),
30+ foldMap: dictMonoid => {
31+ const foldMap1 = $1.foldMap(dictMonoid);
32+ return fn => v => foldMap1(fn)(v._2);
33+ }
34+ };
35+ return {
36+ foldlWithIndex: f => a => v => dictFoldableWithIndex.foldlWithIndex(f)(a)(v._2),
37+ foldrWithIndex: f => a => v => dictFoldableWithIndex.foldrWithIndex(f)(a)(v._2),
38+ foldMapWithIndex: dictMonoid => {
39+ const foldMapWithIndex1 = dictFoldableWithIndex.foldMapWithIndex(dictMonoid);
40+ return f => v => foldMapWithIndex1(f)(v._2);
41+ },
42+ Foldable0: () => foldableEnvT1
43+ };
44+};
45+const traversableEnvT = dictTraversable => {
46+ const $1 = dictTraversable.Functor0();
47+ const functorEnvT1 = {map: f => v => Data$dTuple.$Tuple(v._1, $1.map(f)(v._2))};
48+ const $3 = dictTraversable.Foldable1();
49+ const foldableEnvT1 = {
50+ foldl: fn => a => v => $3.foldl(fn)(a)(v._2),
51+ foldr: fn => a => v => $3.foldr(fn)(a)(v._2),
52+ foldMap: dictMonoid => {
53+ const foldMap1 = $3.foldMap(dictMonoid);
54+ return fn => v => foldMap1(fn)(v._2);
55+ }
56+ };
57+ return {
58+ sequence: dictApplicative => {
59+ const map1 = dictApplicative.Apply0().Functor0().map;
60+ const sequence1 = dictTraversable.sequence(dictApplicative);
61+ return v => map1(Data$dTuple.Tuple(v._1))(sequence1(v._2));
62+ },
63+ traverse: dictApplicative => {
64+ const map1 = dictApplicative.Apply0().Functor0().map;
65+ const traverse1 = dictTraversable.traverse(dictApplicative);
66+ return f => v => map1(Data$dTuple.Tuple(v._1))(traverse1(f)(v._2));
67+ },
68+ Functor0: () => functorEnvT1,
69+ Foldable1: () => foldableEnvT1
70+ };
71+};
72+const traversableWithIndexEnvT = dictTraversableWithIndex => {
73+ const functorWithIndexEnvT1 = functorWithIndexEnvT(dictTraversableWithIndex.FunctorWithIndex0());
74+ const foldableWithIndexEnvT1 = foldableWithIndexEnvT(dictTraversableWithIndex.FoldableWithIndex1());
75+ const traversableEnvT1 = traversableEnvT(dictTraversableWithIndex.Traversable2());
76+ return {
77+ traverseWithIndex: dictApplicative => {
78+ const map1 = dictApplicative.Apply0().Functor0().map;
79+ const traverseWithIndex1 = dictTraversableWithIndex.traverseWithIndex(dictApplicative);
80+ return f => v => map1(Data$dTuple.Tuple(v._1))(traverseWithIndex1(f)(v._2));
81+ },
82+ FunctorWithIndex0: () => functorWithIndexEnvT1,
83+ FoldableWithIndex1: () => foldableWithIndexEnvT1,
84+ Traversable2: () => traversableEnvT1
85+ };
86+};
87+const extendEnvT = dictExtend => {
88+ const Functor0 = dictExtend.Functor0();
89+ const functorEnvT1 = {map: f => v => Data$dTuple.$Tuple(v._1, Functor0.map(f)(v._2))};
90+ return {extend: f => v => Data$dTuple.$Tuple(v._1, Functor0.map(f)(dictExtend.extend(Data$dTuple.Tuple(v._1))(v._2))), Functor0: () => functorEnvT1};
91+};
92+const comonadTransEnvT = {lower: dictComonad => v => v._2};
93+const comonadEnvT = dictComonad => {
94+ const extendEnvT1 = extendEnvT(dictComonad.Extend0());
95+ return {extract: v => dictComonad.extract(v._2), Extend0: () => extendEnvT1};
96+};
97+export {
98+ EnvT,
99+ comonadEnvT,
100+ comonadTransEnvT,
101+ extendEnvT,
102+ foldableEnvT,
103+ foldableWithIndexEnvT,
104+ functorEnvT,
105+ functorWithIndexEnvT,
106+ mapEnvT,
107+ newtypeEnvT,
108+ runEnvT,
109+ traversableEnvT,
110+ traversableWithIndexEnvT,
111+ withEnvT
112+};
.storybook/purescript-indexer/output-es/Control.Comonad.Env/index.jsnew file+9
@@ -0,0 +1,9 @@
1+// | This module defines the `Env` comonad.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dComonad$dEnv$dTrans from "../Control.Comonad.Env.Trans/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+const withEnv = Control$dComonad$dEnv$dTrans.withEnvT;
6+const runEnv = v => Data$dTuple.$Tuple(v._1, v._2);
7+const mapEnv = f => v => Data$dTuple.$Tuple(v._1, f(v._2));
8+const env = e => a => Data$dTuple.$Tuple(e, a);
9+export {env, mapEnv, runEnv, withEnv};
.storybook/purescript-indexer/output-es/Control.Comonad.Store.Class/index.jsnew file+56
@@ -0,0 +1,56 @@
1+// | This module defines the `ComonadStore` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dComonad$dEnv$dTrans from "../Control.Comonad.Env.Trans/index.js";
4+import * as Control$dComonad$dStore$dTrans from "../Control.Comonad.Store.Trans/index.js";
5+import * as Control$dComonad$dTraced$dTrans from "../Control.Comonad.Traced.Trans/index.js";
6+import * as Control$dExtend from "../Control.Extend/index.js";
7+const pos = dict => dict.pos;
8+const peek = dict => dict.peek;
9+const peeks = dictComonadStore => f => x => dictComonadStore.peek(f(dictComonadStore.pos(x)))(x);
10+const seeks = dictComonadStore => {
11+ const duplicate = dictComonadStore.Comonad0().Extend0().extend(Control$dExtend.identity);
12+ return f => x => {
13+ const $4 = duplicate(x);
14+ return dictComonadStore.peek(f(dictComonadStore.pos($4)))($4);
15+ };
16+};
17+const seek = dictComonadStore => {
18+ const duplicate = dictComonadStore.Comonad0().Extend0().extend(Control$dExtend.identity);
19+ return s => {
20+ const $3 = dictComonadStore.peek(s);
21+ return x => $3(duplicate(x));
22+ };
23+};
24+const experiment = dictComonadStore => dictFunctor => f => x => dictFunctor.map(a => dictComonadStore.peek(a)(x))(f(dictComonadStore.pos(x)));
25+const comonadStoreTracedT = dictComonadStore => {
26+ const Comonad0 = dictComonadStore.Comonad0();
27+ const comonadTracedT = Control$dComonad$dTraced$dTrans.comonadTracedT(Comonad0);
28+ return dictMonoid => {
29+ const map = Comonad0.Extend0().Functor0().map;
30+ const comonadTracedT1 = comonadTracedT(dictMonoid);
31+ return {
32+ pos: x => dictComonadStore.pos(map(f => f(dictMonoid.mempty))(x)),
33+ peek: s => {
34+ const $7 = dictComonadStore.peek(s);
35+ return x => $7(map(f => f(dictMonoid.mempty))(x));
36+ },
37+ Comonad0: () => comonadTracedT1
38+ };
39+ };
40+};
41+const comonadStoreStoreT = dictComonad => {
42+ const comonadStoreT = Control$dComonad$dStore$dTrans.comonadStoreT(dictComonad);
43+ return {pos: v => v._2, peek: s => v => dictComonad.extract(v._1)(s), Comonad0: () => comonadStoreT};
44+};
45+const comonadStoreEnvT = dictComonadStore => {
46+ const comonadEnvT = Control$dComonad$dEnv$dTrans.comonadEnvT(dictComonadStore.Comonad0());
47+ return {
48+ pos: x => dictComonadStore.pos(x._2),
49+ peek: s => {
50+ const $3 = dictComonadStore.peek(s);
51+ return x => $3(x._2);
52+ },
53+ Comonad0: () => comonadEnvT
54+ };
55+};
56+export {comonadStoreEnvT, comonadStoreStoreT, comonadStoreTracedT, experiment, peek, peeks, pos, seek, seeks};
.storybook/purescript-indexer/output-es/Control.Comonad.Store.Trans/index.jsnew file+22
@@ -0,0 +1,22 @@
1+// | This module defines the store comonad transformer, `StoreT`.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dTuple from "../Data.Tuple/index.js";
4+const StoreT = x => x;
5+const runStoreT = v => v;
6+const newtypeStoreT = {Coercible0: () => undefined};
7+const functorStoreT = dictFunctor => ({map: f => v => Data$dTuple.$Tuple(dictFunctor.map(h => x => f(h(x)))(v._1), v._2)});
8+const extendStoreT = dictExtend => {
9+ const functorStoreT1 = functorStoreT(dictExtend.Functor0());
10+ return {extend: f => v => Data$dTuple.$Tuple(dictExtend.extend(w$p => s$p => f(Data$dTuple.$Tuple(w$p, s$p)))(v._1), v._2), Functor0: () => functorStoreT1};
11+};
12+const comonadTransStoreT = {
13+ lower: dictComonad => {
14+ const map = dictComonad.Extend0().Functor0().map;
15+ return v => map(v1 => v1(v._2))(v._1);
16+ }
17+};
18+const comonadStoreT = dictComonad => {
19+ const extendStoreT1 = extendStoreT(dictComonad.Extend0());
20+ return {extract: v => dictComonad.extract(v._1)(v._2), Extend0: () => extendStoreT1};
21+};
22+export {StoreT, comonadStoreT, comonadTransStoreT, extendStoreT, functorStoreT, newtypeStoreT, runStoreT};
.storybook/purescript-indexer/output-es/Control.Comonad.Store/index.jsnew file+6
@@ -0,0 +1,6 @@
1+// | This module defines the `Store` comonad.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dTuple from "../Data.Tuple/index.js";
4+const store = f => x => Data$dTuple.$Tuple(f, x);
5+const runStore = v => Data$dTuple.$Tuple(v._1, v._2);
6+export {runStore, store};
.storybook/purescript-indexer/output-es/Control.Comonad.Traced.Class/index.jsnew file+20
@@ -0,0 +1,20 @@
1+// | This module defines the `ComonadTraced` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dComonad$dTraced$dTrans from "../Control.Comonad.Traced.Trans/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+const track = dict => dict.track;
6+const tracks = dictComonadTraced => {
7+ const extract = dictComonadTraced.Comonad0().extract;
8+ return f => w => dictComonadTraced.track(f(extract(w)))(w);
9+};
10+const listens = dictFunctor => f => v => dictFunctor.map(g => t => Data$dTuple.$Tuple(g(t), f(t)))(v);
11+const listen = dictFunctor => v => dictFunctor.map(f => t => Data$dTuple.$Tuple(f(t), t))(v);
12+const comonadTracedTracedT = dictComonad => {
13+ const comonadTracedT = Control$dComonad$dTraced$dTrans.comonadTracedT(dictComonad);
14+ return dictMonoid => {
15+ const comonadTracedT1 = comonadTracedT(dictMonoid);
16+ return {track: t => v => dictComonad.extract(v)(t), Comonad0: () => comonadTracedT1};
17+ };
18+};
19+const censor = dictFunctor => f => v => dictFunctor.map(v1 => x => v1(f(x)))(v);
20+export {censor, comonadTracedTracedT, listen, listens, track, tracks};
.storybook/purescript-indexer/output-es/Control.Comonad.Traced.Trans/index.jsnew file+30
@@ -0,0 +1,30 @@
1+// | This module defines the cowriter comonad transformer, `TracedT`.
2+import * as $runtime from "../runtime.js";
3+const TracedT = x => x;
4+const runTracedT = v => v;
5+const newtypeTracedT = {Coercible0: () => undefined};
6+const functorTracedT = dictFunctor => ({map: f => v => dictFunctor.map(g => t => f(g(t)))(v)});
7+const extendTracedT = dictExtend => {
8+ const Functor0 = dictExtend.Functor0();
9+ const functorTracedT1 = {map: f => v => Functor0.map(g => t => f(g(t)))(v)};
10+ return dictSemigroup => ({extend: f => v => dictExtend.extend(w$p => t => f(Functor0.map(h => t$p => h(dictSemigroup.append(t)(t$p)))(w$p)))(v), Functor0: () => functorTracedT1});
11+};
12+const comonadTransTracedT = dictMonoid => (
13+ {
14+ lower: dictComonad => {
15+ const map = dictComonad.Extend0().Functor0().map;
16+ return v => map(f => f(dictMonoid.mempty))(v);
17+ }
18+ }
19+);
20+const comonadTracedT = dictComonad => {
21+ const $1 = dictComonad.Extend0();
22+ const Functor0 = $1.Functor0();
23+ const functorTracedT1 = {map: f => v => Functor0.map(g => t => f(g(t)))(v)};
24+ return dictMonoid => {
25+ const $5 = dictMonoid.Semigroup0();
26+ const extendTracedT2 = {extend: f => v => $1.extend(w$p => t => f(Functor0.map(h => t$p => h($5.append(t)(t$p)))(w$p)))(v), Functor0: () => functorTracedT1};
27+ return {extract: v => dictComonad.extract(v)(dictMonoid.mempty), Extend0: () => extendTracedT2};
28+ };
29+};
30+export {TracedT, comonadTracedT, comonadTransTracedT, extendTracedT, functorTracedT, newtypeTracedT, runTracedT};
.storybook/purescript-indexer/output-es/Control.Comonad.Traced/index.jsnew file+5
@@ -0,0 +1,5 @@
1+// | This module defines the `Traced` comonad.
2+import * as $runtime from "../runtime.js";
3+const traced = x => x;
4+const runTraced = v => v;
5+export {runTraced, traced};
.storybook/purescript-indexer/output-es/Control.Comonad.Trans.Class/index.jsnew file+4
@@ -0,0 +1,4 @@
1+// | This module defines the `ComonadTrans` type class of _comonad transformers_.
2+import * as $runtime from "../runtime.js";
3+const lower = dict => dict.lower;
4+export {lower};
.storybook/purescript-indexer/output-es/Control.Comonad/index.jsnew file+3
@@ -0,0 +1,3 @@
1+import * as $runtime from "../runtime.js";
2+const extract = dict => dict.extract;
3+export {extract};
.storybook/purescript-indexer/output-es/Control.Extend/foreign.jsnew file+7
@@ -0,0 +1,7 @@
1+export const arrayExtend = function(f) {
2+ return function(xs) {
3+ return xs.map(function (_, i, xs) {
4+ return f(xs.slice(i));
5+ });
6+ };
7+};
.storybook/purescript-indexer/output-es/Control.Extend/index.jsnew file+13
@@ -0,0 +1,13 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dFunctor from "../Data.Functor/index.js";
3+import {arrayExtend} from "./foreign.js";
4+const identity = x => x;
5+const extendFn = dictSemigroup => ({extend: f => g => w => f(w$p => g(dictSemigroup.append(w)(w$p))), Functor0: () => Data$dFunctor.functorFn});
6+const extendArray = {extend: arrayExtend, Functor0: () => Data$dFunctor.functorArray};
7+const extend = dict => dict.extend;
8+const extendFlipped = dictExtend => w => f => dictExtend.extend(f)(w);
9+const duplicate = dictExtend => dictExtend.extend(identity);
10+const composeCoKleisliFlipped = dictExtend => f => g => w => f(dictExtend.extend(g)(w));
11+const composeCoKleisli = dictExtend => f => g => w => g(dictExtend.extend(f)(w));
12+export {composeCoKleisli, composeCoKleisliFlipped, duplicate, extend, extendArray, extendFlipped, extendFn, identity};
13+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Control.Lazy/index.jsnew file+11
@@ -0,0 +1,11 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dUnit from "../Data.Unit/index.js";
3+const lazyUnit = {defer: v => Data$dUnit.unit};
4+const lazyFn = {defer: f => x => f(Data$dUnit.unit)(x)};
5+const defer = dict => dict.defer;
6+const fix = dictLazy => f => {
7+ const go$lazy = $runtime.binding(() => dictLazy.defer(v => f(go$lazy())));
8+ const go = go$lazy();
9+ return go;
10+};
11+export {defer, fix, lazyFn, lazyUnit};
.storybook/purescript-indexer/output-es/Control.Monad.Cont.Class/index.jsnew file+4
@@ -0,0 +1,4 @@
1+// | This module defines the `MonadCont` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+const callCC = dict => dict.callCC;
4+export {callCC};
.storybook/purescript-indexer/output-es/Control.Monad.Cont.Trans/index.jsnew file+113
@@ -0,0 +1,113 @@
1+// | This module defines the CPS monad transformer.
2+import * as $runtime from "../runtime.js";
3+const ContT = x => x;
4+const withContT = f => v => k => v(f(k));
5+const runContT = v => k => v(k);
6+const newtypeContT = {Coercible0: () => undefined};
7+const monadTransContT = {lift: dictMonad => dictMonad.Bind1().bind};
8+const mapContT = f => v => k => f(v(k));
9+const functorContT = dictFunctor => ({map: f => v => k => v(a => k(f(a)))});
10+const applyContT = dictApply => {
11+ const functorContT1 = {map: f => v => k => v(a => k(f(a)))};
12+ return {apply: v => v1 => k => v(g => v1(a => k(g(a)))), Functor0: () => functorContT1};
13+};
14+const bindContT = dictBind => {
15+ const functorContT1 = {map: f => v => k => v(a => k(f(a)))};
16+ const applyContT1 = {apply: v => v1 => k => v(g => v1(a => k(g(a)))), Functor0: () => functorContT1};
17+ return {bind: v => k => k$p => v(a => k(a)(k$p)), Apply0: () => applyContT1};
18+};
19+const semigroupContT = dictApply => dictSemigroup => (
20+ {
21+ append: a => b => k => a(a$1 => {
22+ const $6 = dictSemigroup.append(a$1);
23+ return b(a$2 => k($6(a$2)));
24+ })
25+ }
26+);
27+const applicativeContT = dictApplicative => {
28+ const functorContT1 = {map: f => v => k => v(a => k(f(a)))};
29+ const applyContT1 = {apply: v => v1 => k => v(g => v1(a => k(g(a)))), Functor0: () => functorContT1};
30+ return {pure: a => k => k(a), Apply0: () => applyContT1};
31+};
32+const monadContT = dictMonad => {
33+ const functorContT1 = {map: f => v => k => v(a => k(f(a)))};
34+ const applyContT1 = {apply: v => v1 => k => v(g => v1(a => k(g(a)))), Functor0: () => functorContT1};
35+ const applicativeContT1 = {pure: a => k => k(a), Apply0: () => applyContT1};
36+ const functorContT1$1 = {map: f => v => k => v(a => k(f(a)))};
37+ const applyContT1$1 = {apply: v => v1 => k => v(g => v1(a => k(g(a)))), Functor0: () => functorContT1$1};
38+ const bindContT1 = {bind: v => k => k$p => v(a => k(a)(k$p)), Apply0: () => applyContT1$1};
39+ return {Applicative0: () => applicativeContT1, Bind1: () => bindContT1};
40+};
41+const monadAskContT = dictMonadAsk => {
42+ const Monad0 = dictMonadAsk.Monad0();
43+ const monadContT1 = monadContT(Monad0);
44+ return {ask: Monad0.Bind1().bind(dictMonadAsk.ask), Monad0: () => monadContT1};
45+};
46+const monadReaderContT = dictMonadReader => {
47+ const MonadAsk0 = dictMonadReader.MonadAsk0();
48+ const bind = MonadAsk0.Monad0().Bind1().bind;
49+ const monadAskContT1 = monadAskContT(MonadAsk0);
50+ return {
51+ local: f => v => k => bind(MonadAsk0.ask)(r => dictMonadReader.local(f)(v((() => {
52+ const $8 = dictMonadReader.local(v$1 => r);
53+ return x => $8(k(x));
54+ })()))),
55+ MonadAsk0: () => monadAskContT1
56+ };
57+};
58+const monadContContT = dictMonad => {
59+ const monadContT1 = monadContT(dictMonad);
60+ return {callCC: f => k => f(a => v1 => k(a))(k), Monad0: () => monadContT1};
61+};
62+const monadEffectContT = dictMonadEffect => {
63+ const Monad0 = dictMonadEffect.Monad0();
64+ const monadContT1 = monadContT(Monad0);
65+ return {
66+ liftEffect: (() => {
67+ const $3 = Monad0.Bind1().bind;
68+ return x => $3(dictMonadEffect.liftEffect(x));
69+ })(),
70+ Monad0: () => monadContT1
71+ };
72+};
73+const monadStateContT = dictMonadState => {
74+ const Monad0 = dictMonadState.Monad0();
75+ const monadContT1 = monadContT(Monad0);
76+ return {
77+ state: (() => {
78+ const $3 = Monad0.Bind1().bind;
79+ return x => $3(dictMonadState.state(x));
80+ })(),
81+ Monad0: () => monadContT1
82+ };
83+};
84+const monoidContT = dictApplicative => dictMonoid => {
85+ const $2 = dictMonoid.Semigroup0();
86+ const semigroupContT2 = {
87+ append: a => b => k => a(a$1 => {
88+ const $7 = $2.append(a$1);
89+ return b(a$2 => k($7(a$2)));
90+ })
91+ };
92+ return {mempty: k => k(dictMonoid.mempty), Semigroup0: () => semigroupContT2};
93+};
94+export {
95+ ContT,
96+ applicativeContT,
97+ applyContT,
98+ bindContT,
99+ functorContT,
100+ mapContT,
101+ monadAskContT,
102+ monadContContT,
103+ monadContT,
104+ monadEffectContT,
105+ monadReaderContT,
106+ monadStateContT,
107+ monadTransContT,
108+ monoidContT,
109+ newtypeContT,
110+ runContT,
111+ semigroupContT,
112+ withContT
113+};
.storybook/purescript-indexer/output-es/Control.Monad.Cont/index.jsnew file+7
@@ -0,0 +1,7 @@
1+// | This module defines the `Cont`inuation monad.
2+import * as $runtime from "../runtime.js";
3+const withCont = f => v => k => v(f(x => k(x)));
4+const runCont = cc => k => cc(x => k(x));
5+const mapCont = f => v => k => f(v(k));
6+const cont = f => c => f(x => c(x));
7+export {cont, mapCont, runCont, withCont};
.storybook/purescript-indexer/output-es/Control.Monad.Error.Class/index.jsnew file+90
@@ -0,0 +1,90 @@
1+// | This module defines the `MonadError` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dEither from "../Data.Either/index.js";
4+import * as Data$dMaybe from "../Data.Maybe/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+import * as Effect from "../Effect/index.js";
7+import * as Effect$dException from "../Effect.Exception/index.js";
8+const throwError = dict => dict.throwError;
9+const monadThrowMaybe = {throwError: v => Data$dMaybe.Nothing, Monad0: () => Data$dMaybe.monadMaybe};
10+const monadThrowEither = {throwError: Data$dEither.Left, Monad0: () => Data$dEither.monadEither};
11+const monadThrowEffect = {throwError: Effect$dException.throwException, Monad0: () => Effect.monadEffect};
12+const monadErrorMaybe = {
13+ catchError: v => v1 => {
14+ if (v.tag === "Nothing") { return v1(Data$dUnit.unit); }
15+ if (v.tag === "Just") { return Data$dMaybe.$Maybe("Just", v._1); }
16+ $runtime.fail();
17+ },
18+ MonadThrow0: () => monadThrowMaybe
19+};
20+const monadErrorEither = {
21+ catchError: v => v1 => {
22+ if (v.tag === "Left") { return v1(v._1); }
23+ if (v.tag === "Right") { return Data$dEither.$Either("Right", v._1); }
24+ $runtime.fail();
25+ },
26+ MonadThrow0: () => monadThrowEither
27+};
28+const monadErrorEffect = {catchError: b => a => Effect$dException.catchException(a)(b), MonadThrow0: () => monadThrowEffect};
29+const liftMaybe = dictMonadThrow => {
30+ const pure = dictMonadThrow.Monad0().Applicative0().pure;
31+ return error => {
32+ const $3 = dictMonadThrow.throwError(error);
33+ return v2 => {
34+ if (v2.tag === "Nothing") { return $3; }
35+ if (v2.tag === "Just") { return pure(v2._1); }
36+ $runtime.fail();
37+ };
38+ };
39+};
40+const liftEither = dictMonadThrow => {
41+ const $1 = dictMonadThrow.Monad0().Applicative0().pure;
42+ return v2 => {
43+ if (v2.tag === "Left") { return dictMonadThrow.throwError(v2._1); }
44+ if (v2.tag === "Right") { return $1(v2._1); }
45+ $runtime.fail();
46+ };
47+};
48+const catchError = dict => dict.catchError;
49+const catchJust = dictMonadError => {
50+ const throwError1 = dictMonadError.MonadThrow0().throwError;
51+ return p => act => handler => dictMonadError.catchError(act)(e => {
52+ const v = p(e);
53+ if (v.tag === "Nothing") { return throwError1(e); }
54+ if (v.tag === "Just") { return handler(v._1); }
55+ $runtime.fail();
56+ });
57+};
58+const $$try = dictMonadError => {
59+ const Monad0 = dictMonadError.MonadThrow0().Monad0();
60+ const map = Monad0.Bind1().Apply0().Functor0().map;
61+ const pure = Monad0.Applicative0().pure;
62+ return a => dictMonadError.catchError(map(Data$dEither.Right)(a))(x => pure(Data$dEither.$Either("Left", x)));
63+};
64+const withResource = dictMonadError => {
65+ const MonadThrow0 = dictMonadError.MonadThrow0();
66+ const Monad0 = MonadThrow0.Monad0();
67+ const Bind1 = Monad0.Bind1();
68+ const try1 = $$try(dictMonadError);
69+ const pure = Monad0.Applicative0().pure;
70+ return acquire => release => kleisli => Bind1.bind(acquire)(resource => Bind1.bind(try1(kleisli(resource)))(result => Bind1.bind(release(resource))(() => {
71+ if (result.tag === "Left") { return MonadThrow0.throwError(result._1); }
72+ if (result.tag === "Right") { return pure(result._1); }
73+ $runtime.fail();
74+ })));
75+};
76+export {
77+ catchError,
78+ catchJust,
79+ liftEither,
80+ liftMaybe,
81+ monadErrorEffect,
82+ monadErrorEither,
83+ monadErrorMaybe,
84+ monadThrowEffect,
85+ monadThrowEither,
86+ monadThrowMaybe,
87+ throwError,
88+ $$try as try,
89+ withResource
90+};
.storybook/purescript-indexer/output-es/Control.Monad.Except.Trans/index.jsnew file+252
@@ -0,0 +1,252 @@
1+// | This module defines the _exception monad transformer_ `ExceptT`.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
4+import * as Data$dEither from "../Data.Either/index.js";
5+import * as Data$dTuple from "../Data.Tuple/index.js";
6+const identity = x => x;
7+const ExceptT = x => x;
8+const withExceptT = dictFunctor => f => v => dictFunctor.map(v2 => {
9+ if (v2.tag === "Right") { return Data$dEither.$Either("Right", v2._1); }
10+ if (v2.tag === "Left") { return Data$dEither.$Either("Left", f(v2._1)); }
11+ $runtime.fail();
12+})(v);
13+const runExceptT = v => v;
14+const newtypeExceptT = {Coercible0: () => undefined};
15+const monadTransExceptT = {
16+ lift: dictMonad => {
17+ const bind = dictMonad.Bind1().bind;
18+ const pure = dictMonad.Applicative0().pure;
19+ return m => bind(m)(a => pure(Data$dEither.$Either("Right", a)));
20+ }
21+};
22+const mapExceptT = f => v => f(v);
23+const functorExceptT = dictFunctor => ({map: f => dictFunctor.map(Data$dEither.functorEither.map(f))});
24+const except = dictApplicative => x => dictApplicative.pure(x);
25+const monadExceptT = dictMonad => ({Applicative0: () => applicativeExceptT(dictMonad), Bind1: () => bindExceptT(dictMonad)});
26+const bindExceptT = dictMonad => {
27+ const bind = dictMonad.Bind1().bind;
28+ const pure = dictMonad.Applicative0().pure;
29+ return {
30+ bind: v => k => bind(v)(v2 => {
31+ if (v2.tag === "Left") { return pure(Data$dEither.$Either("Left", v2._1)); }
32+ if (v2.tag === "Right") { return k(v2._1); }
33+ $runtime.fail();
34+ }),
35+ Apply0: () => applyExceptT(dictMonad)
36+ };
37+};
38+const applyExceptT = dictMonad => {
39+ const $1 = dictMonad.Bind1().Apply0().Functor0();
40+ const functorExceptT1 = {map: f => $1.map(Data$dEither.functorEither.map(f))};
41+ return {
42+ apply: (() => {
43+ const bind = bindExceptT(dictMonad).bind;
44+ const pure = applicativeExceptT(dictMonad).pure;
45+ return f => a => bind(f)(f$p => bind(a)(a$p => pure(f$p(a$p))));
46+ })(),
47+ Functor0: () => functorExceptT1
48+ };
49+};
50+const applicativeExceptT = dictMonad => (
51+ {
52+ pure: (() => {
53+ const $1 = dictMonad.Applicative0().pure;
54+ return x => $1(Data$dEither.$Either("Right", x));
55+ })(),
56+ Apply0: () => applyExceptT(dictMonad)
57+ }
58+);
59+const semigroupExceptT = dictMonad => {
60+ const $1 = applyExceptT(dictMonad);
61+ const map = $1.Functor0().map;
62+ return dictSemigroup => ({append: a => b => $1.apply(map(dictSemigroup.append)(a))(b)});
63+};
64+const monadAskExceptT = dictMonadAsk => {
65+ const Monad0 = dictMonadAsk.Monad0();
66+ const monadExceptT1 = {Applicative0: () => applicativeExceptT(Monad0), Bind1: () => bindExceptT(Monad0)};
67+ return {ask: monadTransExceptT.lift(Monad0)(dictMonadAsk.ask), Monad0: () => monadExceptT1};
68+};
69+const monadReaderExceptT = dictMonadReader => {
70+ const monadAskExceptT1 = monadAskExceptT(dictMonadReader.MonadAsk0());
71+ return {local: f => dictMonadReader.local(f), MonadAsk0: () => monadAskExceptT1};
72+};
73+const monadContExceptT = dictMonadCont => {
74+ const $1 = dictMonadCont.Monad0();
75+ const monadExceptT1 = {Applicative0: () => applicativeExceptT($1), Bind1: () => bindExceptT($1)};
76+ return {callCC: f => dictMonadCont.callCC(c => f(a => c(Data$dEither.$Either("Right", a)))), Monad0: () => monadExceptT1};
77+};
78+const monadEffectExceptT = dictMonadEffect => {
79+ const Monad0 = dictMonadEffect.Monad0();
80+ const monadExceptT1 = {Applicative0: () => applicativeExceptT(Monad0), Bind1: () => bindExceptT(Monad0)};
81+ return {
82+ liftEffect: (() => {
83+ const $3 = monadTransExceptT.lift(Monad0);
84+ return x => $3(dictMonadEffect.liftEffect(x));
85+ })(),
86+ Monad0: () => monadExceptT1
87+ };
88+};
89+const monadRecExceptT = dictMonadRec => {
90+ const Monad0 = dictMonadRec.Monad0();
91+ const bind = Monad0.Bind1().bind;
92+ const pure = Monad0.Applicative0().pure;
93+ const monadExceptT1 = {Applicative0: () => applicativeExceptT(Monad0), Bind1: () => bindExceptT(Monad0)};
94+ return {
95+ tailRecM: f => dictMonadRec.tailRecM(a => bind(f(a))(m$p => pure((() => {
96+ if (m$p.tag === "Left") { return Control$dMonad$dRec$dClass.$Step("Done", Data$dEither.$Either("Left", m$p._1)); }
97+ if (m$p.tag === "Right") {
98+ if (m$p._1.tag === "Loop") { return Control$dMonad$dRec$dClass.$Step("Loop", m$p._1._1); }
99+ if (m$p._1.tag === "Done") { return Control$dMonad$dRec$dClass.$Step("Done", Data$dEither.$Either("Right", m$p._1._1)); }
100+ $runtime.fail();
101+ }
102+ $runtime.fail();
103+ })()))),
104+ Monad0: () => monadExceptT1
105+ };
106+};
107+const monadStateExceptT = dictMonadState => {
108+ const Monad0 = dictMonadState.Monad0();
109+ const lift1 = monadTransExceptT.lift(Monad0);
110+ const monadExceptT1 = {Applicative0: () => applicativeExceptT(Monad0), Bind1: () => bindExceptT(Monad0)};
111+ return {state: f => lift1(dictMonadState.state(f)), Monad0: () => monadExceptT1};
112+};
113+const monadTellExceptT = dictMonadTell => {
114+ const Monad1 = dictMonadTell.Monad1();
115+ const Semigroup0 = dictMonadTell.Semigroup0();
116+ const monadExceptT1 = {Applicative0: () => applicativeExceptT(Monad1), Bind1: () => bindExceptT(Monad1)};
117+ return {
118+ tell: (() => {
119+ const $4 = monadTransExceptT.lift(Monad1);
120+ return x => $4(dictMonadTell.tell(x));
121+ })(),
122+ Semigroup0: () => Semigroup0,
123+ Monad1: () => monadExceptT1
124+ };
125+};
126+const monadWriterExceptT = dictMonadWriter => {
127+ const MonadTell1 = dictMonadWriter.MonadTell1();
128+ const Monad1 = MonadTell1.Monad1();
129+ const bind = Monad1.Bind1().bind;
130+ const pure = Monad1.Applicative0().pure;
131+ const Monoid0 = dictMonadWriter.Monoid0();
132+ const monadTellExceptT1 = monadTellExceptT(MonadTell1);
133+ return {
134+ listen: v => bind(dictMonadWriter.listen(v))(v$1 => pure((() => {
135+ if (v$1._1.tag === "Left") { return Data$dEither.$Either("Left", v$1._1._1); }
136+ if (v$1._1.tag === "Right") { return Data$dEither.$Either("Right", Data$dTuple.$Tuple(v$1._1._1, v$1._2)); }
137+ $runtime.fail();
138+ })())),
139+ pass: v => dictMonadWriter.pass(bind(v)(a => pure((() => {
140+ if (a.tag === "Left") { return Data$dTuple.$Tuple(Data$dEither.$Either("Left", a._1), identity); }
141+ if (a.tag === "Right") { return Data$dTuple.$Tuple(Data$dEither.$Either("Right", a._1._1), a._1._2); }
142+ $runtime.fail();
143+ })()))),
144+ Monoid0: () => Monoid0,
145+ MonadTell1: () => monadTellExceptT1
146+ };
147+};
148+const monadThrowExceptT = dictMonad => {
149+ const monadExceptT1 = {Applicative0: () => applicativeExceptT(dictMonad), Bind1: () => bindExceptT(dictMonad)};
150+ return {
151+ throwError: (() => {
152+ const $2 = dictMonad.Applicative0().pure;
153+ return x => $2(Data$dEither.$Either("Left", x));
154+ })(),
155+ Monad0: () => monadExceptT1
156+ };
157+};
158+const monadErrorExceptT = dictMonad => {
159+ const bind = dictMonad.Bind1().bind;
160+ const pure = dictMonad.Applicative0().pure;
161+ const monadThrowExceptT1 = monadThrowExceptT(dictMonad);
162+ return {
163+ catchError: v => k => bind(v)(v2 => {
164+ if (v2.tag === "Left") { return k(v2._1); }
165+ if (v2.tag === "Right") { return pure(Data$dEither.$Either("Right", v2._1)); }
166+ $runtime.fail();
167+ }),
168+ MonadThrow0: () => monadThrowExceptT1
169+ };
170+};
171+const monoidExceptT = dictMonad => {
172+ const pure = applicativeExceptT(dictMonad).pure;
173+ const semigroupExceptT1 = semigroupExceptT(dictMonad);
174+ return dictMonoid => {
175+ const semigroupExceptT2 = semigroupExceptT1(dictMonoid.Semigroup0());
176+ return {mempty: pure(dictMonoid.mempty), Semigroup0: () => semigroupExceptT2};
177+ };
178+};
179+const altExceptT = dictSemigroup => dictMonad => {
180+ const Bind1 = dictMonad.Bind1();
181+ const pure = dictMonad.Applicative0().pure;
182+ const $4 = Bind1.Apply0().Functor0();
183+ const functorExceptT1 = {map: f => $4.map(Data$dEither.functorEither.map(f))};
184+ return {
185+ alt: v => v1 => Bind1.bind(v)(rm => {
186+ if (rm.tag === "Right") { return pure(Data$dEither.$Either("Right", rm._1)); }
187+ if (rm.tag === "Left") {
188+ return Bind1.bind(v1)(rn => {
189+ if (rn.tag === "Right") { return pure(Data$dEither.$Either("Right", rn._1)); }
190+ if (rn.tag === "Left") { return pure(Data$dEither.$Either("Left", dictSemigroup.append(rm._1)(rn._1))); }
191+ $runtime.fail();
192+ });
193+ }
194+ $runtime.fail();
195+ }),
196+ Functor0: () => functorExceptT1
197+ };
198+};
199+const plusExceptT = dictMonoid => {
200+ const altExceptT1 = altExceptT(dictMonoid.Semigroup0());
201+ return dictMonad => {
202+ const altExceptT2 = altExceptT1(dictMonad);
203+ return {empty: monadThrowExceptT(dictMonad).throwError(dictMonoid.mempty), Alt0: () => altExceptT2};
204+ };
205+};
206+const alternativeExceptT = dictMonoid => {
207+ const plusExceptT1 = plusExceptT(dictMonoid);
208+ return dictMonad => {
209+ const applicativeExceptT1 = applicativeExceptT(dictMonad);
210+ const plusExceptT2 = plusExceptT1(dictMonad);
211+ return {Applicative0: () => applicativeExceptT1, Plus1: () => plusExceptT2};
212+ };
213+};
214+const monadPlusExceptT = dictMonoid => {
215+ const alternativeExceptT1 = alternativeExceptT(dictMonoid);
216+ return dictMonad => {
217+ const monadExceptT1 = {Applicative0: () => applicativeExceptT(dictMonad), Bind1: () => bindExceptT(dictMonad)};
218+ const alternativeExceptT2 = alternativeExceptT1(dictMonad);
219+ return {Monad0: () => monadExceptT1, Alternative1: () => alternativeExceptT2};
220+ };
221+};
222+export {
223+ ExceptT,
224+ altExceptT,
225+ alternativeExceptT,
226+ applicativeExceptT,
227+ applyExceptT,
228+ bindExceptT,
229+ except,
230+ functorExceptT,
231+ identity,
232+ mapExceptT,
233+ monadAskExceptT,
234+ monadContExceptT,
235+ monadEffectExceptT,
236+ monadErrorExceptT,
237+ monadExceptT,
238+ monadPlusExceptT,
239+ monadReaderExceptT,
240+ monadRecExceptT,
241+ monadStateExceptT,
242+ monadTellExceptT,
243+ monadThrowExceptT,
244+ monadTransExceptT,
245+ monadWriterExceptT,
246+ monoidExceptT,
247+ newtypeExceptT,
248+ plusExceptT,
249+ runExceptT,
250+ semigroupExceptT,
251+ withExceptT
252+};
.storybook/purescript-indexer/output-es/Control.Monad.Except/index.jsnew file+7
@@ -0,0 +1,7 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dExcept$dTrans from "../Control.Monad.Except.Trans/index.js";
3+import * as Data$dIdentity from "../Data.Identity/index.js";
4+const withExcept = /* #__PURE__ */ Control$dMonad$dExcept$dTrans.withExceptT(Data$dIdentity.functorIdentity);
5+const runExcept = x => x;
6+const mapExcept = f => v => f(v);
7+export {mapExcept, runExcept, withExcept};
.storybook/purescript-indexer/output-es/Control.Monad.Free.Class/index.jsnew file+46
@@ -0,0 +1,46 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dBind from "../Control.Bind/index.js";
3+import * as Control$dMonad$dExcept$dTrans from "../Control.Monad.Except.Trans/index.js";
4+import * as Control$dMonad$dFree from "../Control.Monad.Free/index.js";
5+import * as Control$dMonad$dMaybe$dTrans from "../Control.Monad.Maybe.Trans/index.js";
6+import * as Control$dMonad$dReader$dTrans from "../Control.Monad.Reader.Trans/index.js";
7+import * as Control$dMonad$dState$dTrans from "../Control.Monad.State.Trans/index.js";
8+import * as Control$dMonad$dWriter$dTrans from "../Control.Monad.Writer.Trans/index.js";
9+import * as Data$dCatList from "../Data.CatList/index.js";
10+import * as Data$dCatQueue from "../Data.CatQueue/index.js";
11+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
12+const wrapFree = dict => dict.wrapFree;
13+const monadFreeWriterT = dictFunctor => dictMonadFree => {
14+ const Monad0 = dictMonadFree.Monad0();
15+ return dictMonoid => {
16+ const monadWriterT = Control$dMonad$dWriter$dTrans.monadWriterT(dictMonoid)(Monad0);
17+ return {wrapFree: f => dictMonadFree.wrapFree(dictFunctor.map(Control$dMonad$dWriter$dTrans.runWriterT)(f)), Monad0: () => monadWriterT};
18+ };
19+};
20+const monadFreeStateT = dictFunctor => dictMonadFree => {
21+ const $2 = dictMonadFree.Monad0();
22+ const monadStateT = {Applicative0: () => Control$dMonad$dState$dTrans.applicativeStateT($2), Bind1: () => Control$dMonad$dState$dTrans.bindStateT($2)};
23+ return {wrapFree: f => s => dictMonadFree.wrapFree(dictFunctor.map(st => st(s))(f)), Monad0: () => monadStateT};
24+};
25+const monadFreeReaderT = dictFunctor => dictMonadFree => {
26+ const monadReaderT = Control$dMonad$dReader$dTrans.monadReaderT(dictMonadFree.Monad0());
27+ return {wrapFree: f => r => dictMonadFree.wrapFree(dictFunctor.map(rt => rt(r))(f)), Monad0: () => monadReaderT};
28+};
29+const monadFreeMaybeT = dictFunctor => dictMonadFree => {
30+ const $2 = dictMonadFree.Monad0();
31+ const monadMaybeT = {Applicative0: () => Control$dMonad$dMaybe$dTrans.applicativeMaybeT($2), Bind1: () => Control$dMonad$dMaybe$dTrans.bindMaybeT($2)};
32+ return {wrapFree: f => dictMonadFree.wrapFree(dictFunctor.map(Control$dMonad$dMaybe$dTrans.runMaybeT)(f)), Monad0: () => monadMaybeT};
33+};
34+const monadFreeFree = {
35+ wrapFree: x => Control$dMonad$dFree.$Free(
36+ Control$dMonad$dFree.$FreeView("Bind", x, x$1 => Control$dMonad$dFree.$Free(Control$dMonad$dFree.$FreeView("Return", x$1), Data$dCatList.CatNil)),
37+ Data$dCatList.link(Data$dCatList.CatNil)(Data$dCatList.$CatList("CatCons", Control$dBind.identity, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)))
38+ ),
39+ Monad0: () => Control$dMonad$dFree.freeMonad
40+};
41+const monadFreeExceptT = dictFunctor => dictMonadFree => {
42+ const $2 = dictMonadFree.Monad0();
43+ const monadExceptT = {Applicative0: () => Control$dMonad$dExcept$dTrans.applicativeExceptT($2), Bind1: () => Control$dMonad$dExcept$dTrans.bindExceptT($2)};
44+ return {wrapFree: f => dictMonadFree.wrapFree(dictFunctor.map(Control$dMonad$dExcept$dTrans.runExceptT)(f)), Monad0: () => monadExceptT};
45+};
46+export {monadFreeExceptT, monadFreeFree, monadFreeMaybeT, monadFreeReaderT, monadFreeStateT, monadFreeWriterT, wrapFree};
.storybook/purescript-indexer/output-es/Control.Monad.Free/index.jsnew file+319
@@ -0,0 +1,319 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dBind from "../Control.Bind/index.js";
3+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
4+import * as Data$dCatList from "../Data.CatList/index.js";
5+import * as Data$dCatQueue from "../Data.CatQueue/index.js";
6+import * as Data$dEither from "../Data.Either/index.js";
7+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
8+import * as Data$dOrdering from "../Data.Ordering/index.js";
9+import * as Unsafe$dCoerce from "../Unsafe.Coerce/index.js";
10+const $Free = (_1, _2) => ({tag: "Free", _1, _2});
11+const $FreeView = (tag, _1, _2) => ({tag, _1, _2});
12+const identity = x => x;
13+const Free = value0 => value1 => $Free(value0, value1);
14+const Return = value0 => $FreeView("Return", value0);
15+const Bind = value0 => value1 => $FreeView("Bind", value0, value1);
16+const toView = toView$a0$copy => {
17+ let toView$a0 = toView$a0$copy, toView$c = true, toView$r;
18+ while (toView$c) {
19+ const v = toView$a0;
20+ if (v._1.tag === "Return") {
21+ const v2 = Data$dCatList.uncons(v._2);
22+ if (v2.tag === "Nothing") {
23+ toView$c = false;
24+ toView$r = $FreeView("Return", v._1._1);
25+ continue;
26+ }
27+ if (v2.tag === "Just") {
28+ toView$a0 = (() => {
29+ const $2 = v2._1._1(v._1._1);
30+ return $Free($2._1, Data$dCatList.link($2._2)(v2._1._2));
31+ })();
32+ continue;
33+ }
34+ $runtime.fail();
35+ }
36+ if (v._1.tag === "Bind") {
37+ toView$c = false;
38+ toView$r = $FreeView(
39+ "Bind",
40+ v._1._1,
41+ a => {
42+ const $2 = v._1._2(a);
43+ return $Free($2._1, Data$dCatList.link($2._2)(v._2));
44+ }
45+ );
46+ continue;
47+ }
48+ $runtime.fail();
49+ };
50+ return toView$r;
51+};
52+const runFreeM = dictFunctor => dictMonadRec => {
53+ const Monad0 = dictMonadRec.Monad0();
54+ const map2 = Monad0.Bind1().Apply0().Functor0().map;
55+ const pure1 = Monad0.Applicative0().pure;
56+ return k => dictMonadRec.tailRecM(f => {
57+ const v = toView(f);
58+ if (v.tag === "Return") { return map2(Control$dMonad$dRec$dClass.Done)(pure1(v._1)); }
59+ if (v.tag === "Bind") { return map2(Control$dMonad$dRec$dClass.Loop)(k(dictFunctor.map(v._2)(v._1))); }
60+ $runtime.fail();
61+ });
62+};
63+const runFree = dictFunctor => k => {
64+ const go = go$a0$copy => {
65+ let go$a0 = go$a0$copy, go$c = true, go$r;
66+ while (go$c) {
67+ const f = go$a0;
68+ const v = toView(f);
69+ if (v.tag === "Return") {
70+ go$c = false;
71+ go$r = v._1;
72+ continue;
73+ }
74+ if (v.tag === "Bind") {
75+ go$a0 = k(dictFunctor.map(v._2)(v._1));
76+ continue;
77+ }
78+ $runtime.fail();
79+ };
80+ return go$r;
81+ };
82+ return go;
83+};
84+const resume$p = k => j => f => {
85+ const v = toView(f);
86+ if (v.tag === "Return") { return j(v._1); }
87+ if (v.tag === "Bind") { return k(v._1)(v._2); }
88+ $runtime.fail();
89+};
90+const resume = dictFunctor => resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right);
91+const wrap = f => $Free($FreeView("Bind", f, Unsafe$dCoerce.unsafeCoerce), Data$dCatList.CatNil);
92+const suspendF = dictApplicative => f => $Free($FreeView("Bind", dictApplicative.pure(f), Unsafe$dCoerce.unsafeCoerce), Data$dCatList.CatNil);
93+const freeMonad = {Applicative0: () => freeApplicative, Bind1: () => freeBind};
94+const freeFunctor = {map: k => f => freeBind.bind(f)(x => freeApplicative.pure(k(x)))};
95+const freeBind = {
96+ bind: v => k => $Free(v._1, Data$dCatList.link(v._2)(Data$dCatList.$CatList("CatCons", k, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)))),
97+ Apply0: () => freeApply
98+};
99+const freeApply = {
100+ apply: f => a => $Free(
101+ f._1,
102+ Data$dCatList.link(f._2)(Data$dCatList.$CatList(
103+ "CatCons",
104+ f$p => $Free(
105+ a._1,
106+ Data$dCatList.link(a._2)(Data$dCatList.$CatList("CatCons", a$p => freeApplicative.pure(f$p(a$p)), Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)))
107+ ),
108+ Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)
109+ ))
110+ ),
111+ Functor0: () => freeFunctor
112+};
113+const freeApplicative = {pure: x => $Free($FreeView("Return", x), Data$dCatList.CatNil), Apply0: () => freeApply};
114+const semigroupFree = dictSemigroup => (
115+ {
116+ append: a => b => freeApply.apply($Free(
117+ a._1,
118+ Data$dCatList.link(a._2)(Data$dCatList.$CatList(
119+ "CatCons",
120+ x => $Free($FreeView("Return", dictSemigroup.append(x)), Data$dCatList.CatNil),
121+ Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)
122+ ))
123+ ))(b)
124+ }
125+);
126+const freeMonadRec = {
127+ tailRecM: k => a => {
128+ const $2 = k(a);
129+ return $Free(
130+ $2._1,
131+ Data$dCatList.link($2._2)(Data$dCatList.$CatList(
132+ "CatCons",
133+ v => {
134+ if (v.tag === "Loop") { return freeMonadRec.tailRecM(k)(v._1); }
135+ if (v.tag === "Done") { return $Free($FreeView("Return", v._1), Data$dCatList.CatNil); }
136+ $runtime.fail();
137+ },
138+ Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)
139+ ))
140+ );
141+ },
142+ Monad0: () => freeMonad
143+};
144+const liftF = f => $Free($FreeView("Bind", f, x => $Free($FreeView("Return", x), Data$dCatList.CatNil)), Data$dCatList.CatNil);
145+const freeMonadTrans = {lift: dictMonad => liftF};
146+const monoidFree = dictMonoid => {
147+ const semigroupFree1 = semigroupFree(dictMonoid.Semigroup0());
148+ return {mempty: $Free($FreeView("Return", dictMonoid.mempty), Data$dCatList.CatNil), Semigroup0: () => semigroupFree1};
149+};
150+const substFree = k => {
151+ const go = f => {
152+ const v = toView(f);
153+ if (v.tag === "Return") { return $Free($FreeView("Return", v._1), Data$dCatList.CatNil); }
154+ if (v.tag === "Bind") {
155+ const $4 = k(v._1);
156+ return $Free($4._1, Data$dCatList.link($4._2)(Data$dCatList.$CatList("CatCons", x => go(v._2(x)), Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil))));
157+ }
158+ $runtime.fail();
159+ };
160+ return go;
161+};
162+const hoistFree = k => substFree(x => $Free($FreeView("Bind", k(x), x$1 => $Free($FreeView("Return", x$1), Data$dCatList.CatNil)), Data$dCatList.CatNil));
163+const foldableFree = dictFunctor => dictFoldable => (
164+ {
165+ foldMap: dictMonoid => {
166+ const foldMap1 = dictFoldable.foldMap(dictMonoid);
167+ return f => {
168+ const go = x => {
169+ const $7 = resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right)(x);
170+ if ($7.tag === "Left") { return foldMap1(go)($7._1); }
171+ if ($7.tag === "Right") { return f($7._1); }
172+ $runtime.fail();
173+ };
174+ return go;
175+ };
176+ },
177+ foldl: f => {
178+ const go = r => x => {
179+ const $6 = resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right)(x);
180+ if ($6.tag === "Left") { return dictFoldable.foldl(go)(r)($6._1); }
181+ if ($6.tag === "Right") { return f(r)($6._1); }
182+ $runtime.fail();
183+ };
184+ return go;
185+ },
186+ foldr: f => {
187+ const go = r => x => {
188+ const $6 = resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right)(x);
189+ if ($6.tag === "Left") { return dictFoldable.foldr(b => a => go(a)(b))(r)($6._1); }
190+ if ($6.tag === "Right") { return f($6._1)(r); }
191+ $runtime.fail();
192+ };
193+ return go;
194+ }
195+ }
196+);
197+const traversableFree = dictTraversable => {
198+ const Functor0 = dictTraversable.Functor0();
199+ const foldableFree1 = foldableFree(Functor0)(dictTraversable.Foldable1());
200+ return {
201+ traverse: dictApplicative => {
202+ const map1 = dictApplicative.Apply0().Functor0().map;
203+ const traverse1 = dictTraversable.traverse(dictApplicative);
204+ return f => {
205+ const go = x => {
206+ const $9 = resume$p(g => i => Data$dEither.$Either("Left", Functor0.map(i)(g)))(Data$dEither.Right)(x);
207+ if ($9.tag === "Left") {
208+ return map1(x$1 => $Free(
209+ $FreeView("Bind", x$1, x$2 => $Free($FreeView("Return", x$2), Data$dCatList.CatNil)),
210+ Data$dCatList.link(Data$dCatList.CatNil)(Data$dCatList.$CatList(
211+ "CatCons",
212+ Control$dBind.identity,
213+ Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)
214+ ))
215+ ))(traverse1(go)($9._1));
216+ }
217+ if ($9.tag === "Right") { return map1(freeApplicative.pure)(f($9._1)); }
218+ $runtime.fail();
219+ };
220+ return go;
221+ };
222+ },
223+ sequence: dictApplicative => tma => traversableFree(dictTraversable).traverse(dictApplicative)(identity)(tma),
224+ Functor0: () => freeFunctor,
225+ Foldable1: () => foldableFree1
226+ };
227+};
228+const foldFree = dictMonadRec => {
229+ const Monad0 = dictMonadRec.Monad0();
230+ const map1 = Monad0.Bind1().Apply0().Functor0().map;
231+ const pure1 = Monad0.Applicative0().pure;
232+ return k => dictMonadRec.tailRecM(f => {
233+ const v = toView(f);
234+ if (v.tag === "Return") { return map1(Control$dMonad$dRec$dClass.Done)(pure1(v._1)); }
235+ if (v.tag === "Bind") { return map1(x => Control$dMonad$dRec$dClass.$Step("Loop", v._2(x)))(k(v._1)); }
236+ $runtime.fail();
237+ });
238+};
239+const eqFree = dictFunctor => dictEq1 => dictEq => (
240+ {
241+ eq: x => y => {
242+ const v = resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right)(y);
243+ const v1 = resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right)(x);
244+ if (v1.tag === "Left") {
245+ if (v.tag === "Left") { return dictEq1.eq1(eqFree(dictFunctor)(dictEq1)(dictEq))(v1._1)(v._1); }
246+ return false;
247+ }
248+ if (v1.tag === "Right") {
249+ if (v.tag === "Right") { return dictEq.eq(v1._1)(v._1); }
250+ return false;
251+ }
252+ return false;
253+ }
254+ }
255+);
256+const ordFree = dictFunctor => dictOrd1 => {
257+ const eqFree2 = eqFree(dictFunctor)(dictOrd1.Eq10());
258+ return dictOrd => {
259+ const eqFree3 = eqFree2(dictOrd.Eq0());
260+ return {
261+ compare: x => y => {
262+ const v = resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right)(y);
263+ const v1 = resume$p(g => i => Data$dEither.$Either("Left", dictFunctor.map(i)(g)))(Data$dEither.Right)(x);
264+ if (v1.tag === "Left") {
265+ if (v.tag === "Left") { return dictOrd1.compare1(ordFree(dictFunctor)(dictOrd1)(dictOrd))(v1._1)(v._1); }
266+ return Data$dOrdering.LT;
267+ }
268+ if (v.tag === "Left") { return Data$dOrdering.GT; }
269+ if (v1.tag === "Right") {
270+ if (v.tag === "Right") { return dictOrd.compare(v1._1)(v._1); }
271+ $runtime.fail();
272+ }
273+ $runtime.fail();
274+ },
275+ Eq0: () => eqFree3
276+ };
277+ };
278+};
279+const eq1Free = dictFunctor => dictEq1 => ({eq1: dictEq => eqFree(dictFunctor)(dictEq1)(dictEq).eq});
280+const ord1Free = dictFunctor => dictOrd1 => {
281+ const ordFree2 = ordFree(dictFunctor)(dictOrd1);
282+ const $3 = dictOrd1.Eq10();
283+ const eq1Free2 = {eq1: dictEq => eqFree(dictFunctor)($3)(dictEq).eq};
284+ return {compare1: dictOrd => ordFree2(dictOrd).compare, Eq10: () => eq1Free2};
285+};
286+export {
287+ $Free,
288+ $FreeView,
289+ Bind,
290+ Free,
291+ Return,
292+ eq1Free,
293+ eqFree,
294+ foldFree,
295+ foldableFree,
296+ freeApplicative,
297+ freeApply,
298+ freeBind,
299+ freeFunctor,
300+ freeMonad,
301+ freeMonadRec,
302+ freeMonadTrans,
303+ hoistFree,
304+ identity,
305+ liftF,
306+ monoidFree,
307+ ord1Free,
308+ ordFree,
309+ resume,
310+ resume$p,
311+ runFree,
312+ runFreeM,
313+ semigroupFree,
314+ substFree,
315+ suspendF,
316+ toView,
317+ traversableFree,
318+ wrap
319+};
.storybook/purescript-indexer/output-es/Control.Monad.Gen.Class/index.jsnew file+7
@@ -0,0 +1,7 @@
1+import * as $runtime from "../runtime.js";
2+const sized = dict => dict.sized;
3+const resize = dict => dict.resize;
4+const chooseInt = dict => dict.chooseInt;
5+const chooseFloat = dict => dict.chooseFloat;
6+const chooseBool = dict => dict.chooseBool;
7+export {chooseBool, chooseFloat, chooseInt, resize, sized};
.storybook/purescript-indexer/output-es/Control.Monad.Gen.Common/index.jsnew file+50
@@ -0,0 +1,50 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dGen from "../Control.Monad.Gen/index.js";
3+import * as Data$dEither from "../Data.Either/index.js";
4+import * as Data$dIdentity from "../Data.Identity/index.js";
5+import * as Data$dMaybe from "../Data.Maybe/index.js";
6+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
7+import * as Data$dOrd from "../Data.Ord/index.js";
8+import * as Data$dTuple from "../Data.Tuple/index.js";
9+const max = x => y => {
10+ const v = Data$dOrd.ordInt.compare(x)(y);
11+ if (v.tag === "LT") { return y; }
12+ if (v.tag === "EQ") { return x; }
13+ if (v.tag === "GT") { return x; }
14+ $runtime.fail();
15+};
16+const genTuple = dictApply => {
17+ const map = dictApply.Functor0().map;
18+ return a => b => dictApply.apply(map(Data$dTuple.Tuple)(a))(b);
19+};
20+const genNonEmpty = dictMonadRec => dictMonadGen => {
21+ const Apply0 = dictMonadGen.Monad0().Bind1().Apply0();
22+ const map = Apply0.Functor0().map;
23+ const unfoldable1 = Control$dMonad$dGen.unfoldable(dictMonadRec)(dictMonadGen);
24+ return dictUnfoldable => {
25+ const unfoldable2 = unfoldable1(dictUnfoldable);
26+ return gen => Apply0.apply(map(Data$dNonEmpty.NonEmpty)(gen))(dictMonadGen.resize(x => max(0)(x - 1 | 0))(unfoldable2(gen)));
27+ };
28+};
29+const genMaybe$p = dictMonadGen => {
30+ const Monad0 = dictMonadGen.Monad0();
31+ const Bind1 = Monad0.Bind1();
32+ const map = Bind1.Apply0().Functor0().map;
33+ const pure = Monad0.Applicative0().pure;
34+ return bias => gen => Bind1.bind(dictMonadGen.chooseFloat(0.0)(1.0))(n => {
35+ if (n < bias) { return map(Data$dMaybe.Just)(gen); }
36+ return pure(Data$dMaybe.Nothing);
37+ });
38+};
39+const genMaybe = dictMonadGen => genMaybe$p(dictMonadGen)(0.75);
40+const genIdentity = dictFunctor => dictFunctor.map(Data$dIdentity.Identity);
41+const genEither$p = dictMonadGen => {
42+ const Bind1 = dictMonadGen.Monad0().Bind1();
43+ const map = Bind1.Apply0().Functor0().map;
44+ return bias => genA => genB => Bind1.bind(dictMonadGen.chooseFloat(0.0)(1.0))(n => {
45+ if (n < bias) { return map(Data$dEither.Left)(genA); }
46+ return map(Data$dEither.Right)(genB);
47+ });
48+};
49+const genEither = dictMonadGen => genEither$p(dictMonadGen)(0.5);
50+export {genEither, genEither$p, genIdentity, genMaybe, genMaybe$p, genNonEmpty, genTuple, max};
.storybook/purescript-indexer/output-es/Control.Monad.Gen/index.jsnew file+130
@@ -0,0 +1,130 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
3+import * as Data$dMaybe from "../Data.Maybe/index.js";
4+import * as Data$dSemigroup$dLast from "../Data.Semigroup.Last/index.js";
5+import * as Data$dTuple from "../Data.Tuple/index.js";
6+import * as Data$dUnit from "../Data.Unit/index.js";
7+const $LL = (tag, _1, _2) => ({tag, _1, _2});
8+const monoidAdditive = /* #__PURE__ */ (() => {
9+ const semigroupAdditive1 = {append: v => v1 => v + v1};
10+ return {mempty: 0.0, Semigroup0: () => semigroupAdditive1};
11+})();
12+const Cons = value0 => value1 => $LL("Cons", value0, value1);
13+const Nil = /* #__PURE__ */ $LL("Nil");
14+const unfoldable = dictMonadRec => dictMonadGen => {
15+ const Monad0 = dictMonadGen.Monad0();
16+ const pure = Monad0.Applicative0().pure;
17+ const Bind1 = Monad0.Bind1();
18+ const map = Bind1.Apply0().Functor0().map;
19+ return dictUnfoldable => gen => map(dictUnfoldable.unfoldr(v => {
20+ if (v.tag === "Nil") { return Data$dMaybe.Nothing; }
21+ if (v.tag === "Cons") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(v._1, v._2)); }
22+ $runtime.fail();
23+ }))(dictMonadGen.sized((() => {
24+ const $8 = dictMonadRec.tailRecM(v => {
25+ if (v._2 <= 0) { return pure(Control$dMonad$dRec$dClass.$Step("Done", v._1)); }
26+ return Bind1.bind(gen)(x => pure(Control$dMonad$dRec$dClass.$Step("Loop", Data$dTuple.$Tuple($LL("Cons", x, v._1), v._2 - 1 | 0))));
27+ });
28+ const $9 = Data$dTuple.Tuple(Nil);
29+ return x => $8($9(x));
30+ })()));
31+};
32+const semigroupFreqSemigroup = {
33+ append: v => v1 => pos => {
34+ const v2 = v(pos);
35+ if (v2._1.tag === "Just") { return v1(v2._1._1); }
36+ return v2;
37+ }
38+};
39+const fromIndex = dictFoldable1 => {
40+ const foldMap1 = dictFoldable1.foldMap1(Data$dSemigroup$dLast.semigroupLast);
41+ const foldr = dictFoldable1.Foldable0().foldr;
42+ return i => xs => {
43+ const go = go$a0$copy => go$a1$copy => {
44+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
45+ while (go$c) {
46+ const v = go$a0, v1 = go$a1;
47+ if (v1.tag === "Cons") {
48+ if (v1._2.tag === "Nil") {
49+ go$c = false;
50+ go$r = v1._1;
51+ continue;
52+ }
53+ if (v <= 0) {
54+ go$c = false;
55+ go$r = v1._1;
56+ continue;
57+ }
58+ go$a0 = v - 1 | 0;
59+ go$a1 = v1._2;
60+ continue;
61+ }
62+ if (v1.tag === "Nil") {
63+ go$c = false;
64+ go$r = foldMap1(Data$dSemigroup$dLast.Last)(xs);
65+ continue;
66+ }
67+ $runtime.fail();
68+ };
69+ return go$r;
70+ };
71+ return go(i)(foldr(Cons)(Nil)(xs));
72+ };
73+};
74+const oneOf = dictMonadGen => {
75+ const bind = dictMonadGen.Monad0().Bind1().bind;
76+ return dictFoldable1 => {
77+ const length = dictFoldable1.Foldable0().foldl(c => v => 1 + c | 0)(0);
78+ const fromIndex1 = fromIndex(dictFoldable1);
79+ return xs => bind(dictMonadGen.chooseInt(0)(length(xs) - 1 | 0))(n => fromIndex1(n)(xs));
80+ };
81+};
82+const freqSemigroup = v => pos => {
83+ if (pos >= v._1) { return Data$dTuple.$Tuple(Data$dMaybe.$Maybe("Just", pos - v._1), v._2); }
84+ return Data$dTuple.$Tuple(Data$dMaybe.Nothing, v._2);
85+};
86+const frequency = dictMonadGen => {
87+ const bind = dictMonadGen.Monad0().Bind1().bind;
88+ return dictFoldable1 => {
89+ const foldMap = dictFoldable1.Foldable0().foldMap(monoidAdditive);
90+ const foldMap1 = dictFoldable1.foldMap1(semigroupFreqSemigroup);
91+ return xs => bind(dictMonadGen.chooseFloat(0.0)(foldMap(Data$dTuple.fst)(xs)))((() => {
92+ const $6 = foldMap1(freqSemigroup)(xs);
93+ return x => $6(x)._2;
94+ })());
95+ };
96+};
97+const filtered = dictMonadRec => dictMonadGen => {
98+ const $2 = dictMonadGen.Monad0().Bind1().Apply0().Functor0();
99+ return gen => dictMonadRec.tailRecM(v => $2.map(a => {
100+ if (a.tag === "Nothing") { return Control$dMonad$dRec$dClass.$Step("Loop", Data$dUnit.unit); }
101+ if (a.tag === "Just") { return Control$dMonad$dRec$dClass.$Step("Done", a._1); }
102+ $runtime.fail();
103+ })(gen))(Data$dUnit.unit);
104+};
105+const suchThat = dictMonadRec => dictMonadGen => {
106+ const filtered2 = filtered(dictMonadRec)(dictMonadGen);
107+ const $3 = dictMonadGen.Monad0().Bind1().Apply0().Functor0();
108+ return gen => pred => filtered2($3.map(a => {
109+ if (pred(a)) { return Data$dMaybe.$Maybe("Just", a); }
110+ return Data$dMaybe.Nothing;
111+ })(gen));
112+};
113+const elements = dictMonadGen => {
114+ const Monad0 = dictMonadGen.Monad0();
115+ const bind = Monad0.Bind1().bind;
116+ const pure = Monad0.Applicative0().pure;
117+ return dictFoldable1 => {
118+ const length = dictFoldable1.Foldable0().foldl(c => v => 1 + c | 0)(0);
119+ const fromIndex1 = fromIndex(dictFoldable1);
120+ return xs => bind(dictMonadGen.chooseInt(0)(length(xs) - 1 | 0))(n => pure(fromIndex1(n)(xs)));
121+ };
122+};
123+const choose = dictMonadGen => {
124+ const bind = dictMonadGen.Monad0().Bind1().bind;
125+ return genA => genB => bind(dictMonadGen.chooseBool)(v => {
126+ if (v) { return genA; }
127+ return genB;
128+ });
129+};
130+export {$LL, Cons, Nil, choose, elements, filtered, freqSemigroup, frequency, fromIndex, monoidAdditive, oneOf, semigroupFreqSemigroup, suchThat, unfoldable};
.storybook/purescript-indexer/output-es/Control.Monad.Identity.Trans/index.jsnew file+78
@@ -0,0 +1,78 @@
1+import * as $runtime from "../runtime.js";
2+const IdentityT = x => x;
3+const traversableIdentityT = dictTraversable => dictTraversable;
4+const runIdentityT = v => v;
5+const plusIdentityT = dictPlus => dictPlus;
6+const newtypeIdentityT = {Coercible0: () => undefined};
7+const monadWriterIdentityT = dictMonadWriter => dictMonadWriter;
8+const monadTransIdentityT = {lift: dictMonad => IdentityT};
9+const monadThrowIdentityT = dictMonadThrow => dictMonadThrow;
10+const monadTellIdentityT = dictMonadTell => dictMonadTell;
11+const monadStateIdentityT = dictMonadState => dictMonadState;
12+const monadRecIdentityT = dictMonadRec => dictMonadRec;
13+const monadReaderIdentityT = dictMonadReader => dictMonadReader;
14+const monadPlusIdentityT = dictMonadPlus => dictMonadPlus;
15+const monadIdentityT = dictMonad => dictMonad;
16+const monadErrorIdentityT = dictMonadError => dictMonadError;
17+const monadEffectIdentityT = dictMonadEffect => dictMonadEffect;
18+const monadContIdentityT = dictMonadCont => dictMonadCont;
19+const monadAskIdentityT = dictMonadAsk => dictMonadAsk;
20+const mapIdentityT = f => v => f(v);
21+const functorIdentityT = dictFunctor => dictFunctor;
22+const foldableIdentityT = dictFoldable => dictFoldable;
23+const eqIdentityT = dictEq1 => dictEq => {
24+ const eq11 = dictEq1.eq1(dictEq);
25+ return {eq: x => y => eq11(x)(y)};
26+};
27+const ordIdentityT = dictOrd1 => {
28+ const $1 = dictOrd1.Eq10();
29+ return dictOrd => {
30+ const compare11 = dictOrd1.compare1(dictOrd);
31+ const eq11 = $1.eq1(dictOrd.Eq0());
32+ const eqIdentityT2 = {eq: x => y => eq11(x)(y)};
33+ return {compare: x => y => compare11(x)(y), Eq0: () => eqIdentityT2};
34+ };
35+};
36+const eq1IdentityT = dictEq1 => ({eq1: dictEq => dictEq1.eq1(dictEq)});
37+const ord1IdentityT = dictOrd1 => {
38+ const $1 = dictOrd1.Eq10();
39+ const eq1IdentityT1 = {eq1: dictEq => $1.eq1(dictEq)};
40+ return {compare1: dictOrd => dictOrd1.compare1(dictOrd), Eq10: () => eq1IdentityT1};
41+};
42+const bindIdentityT = dictBind => dictBind;
43+const applyIdentityT = dictApply => dictApply;
44+const applicativeIdentityT = dictApplicative => dictApplicative;
45+const alternativeIdentityT = dictAlternative => dictAlternative;
46+const altIdentityT = dictAlt => dictAlt;
47+export {
48+ IdentityT,
49+ altIdentityT,
50+ alternativeIdentityT,
51+ applicativeIdentityT,
52+ applyIdentityT,
53+ bindIdentityT,
54+ eq1IdentityT,
55+ eqIdentityT,
56+ foldableIdentityT,
57+ functorIdentityT,
58+ mapIdentityT,
59+ monadAskIdentityT,
60+ monadContIdentityT,
61+ monadEffectIdentityT,
62+ monadErrorIdentityT,
63+ monadIdentityT,
64+ monadPlusIdentityT,
65+ monadReaderIdentityT,
66+ monadRecIdentityT,
67+ monadStateIdentityT,
68+ monadTellIdentityT,
69+ monadThrowIdentityT,
70+ monadTransIdentityT,
71+ monadWriterIdentityT,
72+ newtypeIdentityT,
73+ ord1IdentityT,
74+ ordIdentityT,
75+ plusIdentityT,
76+ runIdentityT,
77+ traversableIdentityT
78+};
.storybook/purescript-indexer/output-es/Control.Monad.List.Trans/index.jsnew file+509
@@ -0,0 +1,509 @@
1+// | This module defines the list monad transformer, `ListT`.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
4+import * as Data$dLazy from "../Data.Lazy/index.js";
5+import * as Data$dMaybe from "../Data.Maybe/index.js";
6+import * as Data$dTuple from "../Data.Tuple/index.js";
7+import * as Data$dUnit from "../Data.Unit/index.js";
8+const $Step = (tag, _1, _2) => ({tag, _1, _2});
9+const identity = x => x;
10+const Yield = value0 => value1 => $Step("Yield", value0, value1);
11+const Skip = value0 => $Step("Skip", value0);
12+const Done = /* #__PURE__ */ $Step("Done");
13+const ListT = x => x;
14+const wrapLazy = dictApplicative => v => dictApplicative.pure($Step("Skip", v));
15+const wrapEffect = dictFunctor => v => dictFunctor.map(x => $Step("Skip", Data$dLazy.defer(v$1 => x)))(v);
16+const unfold = dictMonad => {
17+ const map2 = dictMonad.Bind1().Apply0().Functor0().map;
18+ return f => z => map2(v => {
19+ if (v.tag === "Just") { return $Step("Yield", v._1._2, Data$dLazy.defer(v1 => unfold(dictMonad)(f)(v._1._1))); }
20+ if (v.tag === "Nothing") { return Done; }
21+ $runtime.fail();
22+ })(f(z));
23+};
24+const uncons = dictMonad => {
25+ const pure1 = dictMonad.Applicative0().pure;
26+ const bind = dictMonad.Bind1().bind;
27+ return v => bind(v)(v1 => {
28+ if (v1.tag === "Yield") { return pure1(Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(v1._1, Data$dLazy.force(v1._2)))); }
29+ if (v1.tag === "Skip") { return uncons(dictMonad)(Data$dLazy.force(v1._1)); }
30+ if (v1.tag === "Done") { return pure1(Data$dMaybe.Nothing); }
31+ $runtime.fail();
32+ });
33+};
34+const tail = dictMonad => {
35+ const map2 = dictMonad.Bind1().Apply0().Functor0().map;
36+ const uncons1 = uncons(dictMonad);
37+ return l => map2(Data$dMaybe.functorMaybe.map(Data$dTuple.snd))(uncons1(l));
38+};
39+const takeWhile = dictApplicative => {
40+ const $1 = dictApplicative.Apply0().Functor0();
41+ return f => v => $1.map(v$1 => {
42+ if (v$1.tag === "Yield") {
43+ if (f(v$1._1)) {
44+ return $Step(
45+ "Yield",
46+ v$1._1,
47+ (() => {
48+ const $5 = takeWhile(dictApplicative)(f);
49+ return Data$dLazy.defer(v$2 => $5(Data$dLazy.force(v$1._2)));
50+ })()
51+ );
52+ }
53+ return Done;
54+ }
55+ if (v$1.tag === "Skip") {
56+ return $Step(
57+ "Skip",
58+ (() => {
59+ const $5 = takeWhile(dictApplicative)(f);
60+ return Data$dLazy.defer(v$2 => $5(Data$dLazy.force(v$1._1)));
61+ })()
62+ );
63+ }
64+ if (v$1.tag === "Done") { return Done; }
65+ $runtime.fail();
66+ })(v);
67+};
68+const scanl = dictMonad => {
69+ const map2 = dictMonad.Bind1().Apply0().Functor0().map;
70+ const unfold1 = unfold(dictMonad);
71+ return f => b => l => unfold1(v => map2(v1 => {
72+ if (v1.tag === "Yield") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(Data$dTuple.$Tuple(f(v._1)(v1._1), Data$dLazy.force(v1._2)), v._1)); }
73+ if (v1.tag === "Skip") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(Data$dTuple.$Tuple(v._1, Data$dLazy.force(v1._1)), v._1)); }
74+ if (v1.tag === "Done") { return Data$dMaybe.Nothing; }
75+ $runtime.fail();
76+ })(v._2))(Data$dTuple.$Tuple(b, l));
77+};
78+const prepend$p = dictApplicative => h => t => dictApplicative.pure($Step("Yield", h, t));
79+const prepend = dictApplicative => h => t => dictApplicative.pure($Step("Yield", h, Data$dLazy.defer(v => t)));
80+const nil = dictApplicative => dictApplicative.pure(Done);
81+const singleton = dictApplicative => {
82+ const nil1 = dictApplicative.pure(Done);
83+ return a => dictApplicative.pure($Step("Yield", a, Data$dLazy.defer(v => nil1)));
84+};
85+const take = dictApplicative => {
86+ const nil1 = dictApplicative.pure(Done);
87+ const $2 = dictApplicative.Apply0().Functor0();
88+ return v => v1 => {
89+ if (v === 0) { return nil1; }
90+ return $2.map(v2 => {
91+ if (v2.tag === "Yield") {
92+ return $Step(
93+ "Yield",
94+ v2._1,
95+ (() => {
96+ const $6 = take(dictApplicative)(v - 1 | 0);
97+ return Data$dLazy.defer(v$1 => $6(Data$dLazy.force(v2._2)));
98+ })()
99+ );
100+ }
101+ if (v2.tag === "Skip") {
102+ return $Step(
103+ "Skip",
104+ (() => {
105+ const $6 = take(dictApplicative)(v);
106+ return Data$dLazy.defer(v$1 => $6(Data$dLazy.force(v2._1)));
107+ })()
108+ );
109+ }
110+ if (v2.tag === "Done") { return Done; }
111+ $runtime.fail();
112+ })(v1);
113+ };
114+};
115+const zipWith$p = dictMonad => {
116+ const Applicative0 = dictMonad.Applicative0();
117+ const nil1 = Applicative0.pure(Done);
118+ const Bind1 = dictMonad.Bind1();
119+ const Functor0 = Bind1.Apply0().Functor0();
120+ const uncons1 = uncons(dictMonad);
121+ return f => fa => fb => Functor0.map(x => $Step("Skip", Data$dLazy.defer(v => x)))(Bind1.bind(uncons1(fa))(ua => Bind1.bind(uncons1(fb))(ub => {
122+ if (ub.tag === "Nothing") { return Applicative0.pure(nil1); }
123+ if (ua.tag === "Nothing") { return Applicative0.pure(nil1); }
124+ if (ua.tag === "Just") {
125+ if (ub.tag === "Just") {
126+ return Functor0.map((() => {
127+ const $11 = Data$dLazy.defer(v2 => zipWith$p(dictMonad)(f)(ua._1._2)(ub._1._2));
128+ return a => Applicative0.pure($Step("Yield", a, $11));
129+ })())(f(ua._1._1)(ub._1._1));
130+ }
131+ $runtime.fail();
132+ }
133+ $runtime.fail();
134+ })));
135+};
136+const zipWith = dictMonad => {
137+ const pure1 = dictMonad.Applicative0().pure;
138+ const zipWith$p1 = zipWith$p(dictMonad);
139+ return f => zipWith$p1(a => b => pure1(f(a)(b)));
140+};
141+const newtypeListT = {Coercible0: () => undefined};
142+const mapMaybe = dictFunctor => f => v => dictFunctor.map(v$1 => {
143+ if (v$1.tag === "Yield") {
144+ const $4 = f(v$1._1);
145+ if ($4.tag === "Just") {
146+ return $Step(
147+ "Yield",
148+ $4._1,
149+ (() => {
150+ const $5 = mapMaybe(dictFunctor)(f);
151+ return Data$dLazy.defer(v$2 => $5(Data$dLazy.force(v$1._2)));
152+ })()
153+ );
154+ }
155+ return $Step(
156+ "Skip",
157+ (() => {
158+ const $5 = mapMaybe(dictFunctor)(f);
159+ return Data$dLazy.defer(v$2 => $5(Data$dLazy.force(v$1._2)));
160+ })()
161+ );
162+ }
163+ if (v$1.tag === "Skip") {
164+ return $Step(
165+ "Skip",
166+ (() => {
167+ const $4 = mapMaybe(dictFunctor)(f);
168+ return Data$dLazy.defer(v$2 => $4(Data$dLazy.force(v$1._1)));
169+ })()
170+ );
171+ }
172+ if (v$1.tag === "Done") { return Done; }
173+ $runtime.fail();
174+})(v);
175+const iterate = dictMonad => {
176+ const pure1 = dictMonad.Applicative0().pure;
177+ const unfold1 = unfold(dictMonad);
178+ return f => a => unfold1(x => pure1(Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(f(x), x))))(a);
179+};
180+const repeat = dictMonad => iterate(dictMonad)(identity);
181+const head = dictMonad => {
182+ const map2 = dictMonad.Bind1().Apply0().Functor0().map;
183+ const uncons1 = uncons(dictMonad);
184+ return l => map2(Data$dMaybe.functorMaybe.map(Data$dTuple.fst))(uncons1(l));
185+};
186+const functorListT = dictFunctor => (
187+ {
188+ map: f => v => dictFunctor.map(v$1 => {
189+ if (v$1.tag === "Yield") {
190+ return $Step(
191+ "Yield",
192+ f(v$1._1),
193+ (() => {
194+ const $4 = functorListT(dictFunctor).map(f);
195+ return Data$dLazy.defer(v$2 => $4(Data$dLazy.force(v$1._2)));
196+ })()
197+ );
198+ }
199+ if (v$1.tag === "Skip") {
200+ return $Step(
201+ "Skip",
202+ (() => {
203+ const $4 = functorListT(dictFunctor).map(f);
204+ return Data$dLazy.defer(v$2 => $4(Data$dLazy.force(v$1._1)));
205+ })()
206+ );
207+ }
208+ if (v$1.tag === "Done") { return Done; }
209+ $runtime.fail();
210+ })(v)
211+ }
212+);
213+const fromEffect = dictApplicative => {
214+ const map2 = dictApplicative.Apply0().Functor0().map;
215+ const nil1 = dictApplicative.pure(Done);
216+ return fa => map2((() => {
217+ const $4 = Data$dLazy.defer(v => nil1);
218+ return a => $Step("Yield", a, $4);
219+ })())(fa);
220+};
221+const monadTransListT = {lift: dictMonad => fromEffect(dictMonad.Applicative0())};
222+const foldlRec$p = dictMonadRec => {
223+ const Monad0 = dictMonadRec.Monad0();
224+ const pure1 = Monad0.Applicative0().pure;
225+ const bind = Monad0.Bind1().bind;
226+ const uncons1 = uncons(Monad0);
227+ return f => a => b => dictMonadRec.tailRecM(o => bind(uncons1(o.b))(v => {
228+ if (v.tag === "Nothing") { return pure1(Control$dMonad$dRec$dClass.$Step("Done", o.a)); }
229+ if (v.tag === "Just") { return bind(f(o.a)(v._1._1))(b$p => pure1(Control$dMonad$dRec$dClass.$Step("Loop", {a: b$p, b: v._1._2}))); }
230+ $runtime.fail();
231+ }))({a: a, b: b});
232+};
233+const runListTRec = dictMonadRec => {
234+ const pure1 = dictMonadRec.Monad0().Applicative0().pure;
235+ return foldlRec$p(dictMonadRec)(v => v1 => pure1(Data$dUnit.unit))(Data$dUnit.unit);
236+};
237+const foldlRec = dictMonadRec => {
238+ const Monad0 = dictMonadRec.Monad0();
239+ const pure1 = Monad0.Applicative0().pure;
240+ const bind = Monad0.Bind1().bind;
241+ const uncons1 = uncons(Monad0);
242+ return f => a => b => dictMonadRec.tailRecM(o => bind(uncons1(o.b))(v => {
243+ if (v.tag === "Nothing") { return pure1(Control$dMonad$dRec$dClass.$Step("Done", o.a)); }
244+ if (v.tag === "Just") { return pure1(Control$dMonad$dRec$dClass.$Step("Loop", {a: f(o.a)(v._1._1), b: v._1._2})); }
245+ $runtime.fail();
246+ }))({a: a, b: b});
247+};
248+const foldl$p = dictMonad => {
249+ const pure1 = dictMonad.Applicative0().pure;
250+ const bind = dictMonad.Bind1().bind;
251+ const uncons1 = uncons(dictMonad);
252+ return f => {
253+ const loop = b => l => bind(uncons1(l))(v => {
254+ if (v.tag === "Nothing") { return pure1(b); }
255+ if (v.tag === "Just") { return bind(f(b)(v._1._1))(a => loop(a)(v._1._2)); }
256+ $runtime.fail();
257+ });
258+ return loop;
259+ };
260+};
261+const runListT = dictMonad => {
262+ const pure1 = dictMonad.Applicative0().pure;
263+ return foldl$p(dictMonad)(v => v1 => pure1(Data$dUnit.unit))(Data$dUnit.unit);
264+};
265+const foldl = dictMonad => {
266+ const pure1 = dictMonad.Applicative0().pure;
267+ const bind = dictMonad.Bind1().bind;
268+ const uncons1 = uncons(dictMonad);
269+ return f => {
270+ const loop = b => l => bind(uncons1(l))(v => {
271+ if (v.tag === "Nothing") { return pure1(b); }
272+ if (v.tag === "Just") { return loop(f(b)(v._1._1))(v._1._2); }
273+ $runtime.fail();
274+ });
275+ return loop;
276+ };
277+};
278+const filter = dictFunctor => f => v => dictFunctor.map(v$1 => {
279+ if (v$1.tag === "Yield") {
280+ const $4 = filter(dictFunctor)(f);
281+ const s$p = Data$dLazy.defer(v$2 => $4(Data$dLazy.force(v$1._2)));
282+ if (f(v$1._1)) { return $Step("Yield", v$1._1, s$p); }
283+ return $Step("Skip", s$p);
284+ }
285+ if (v$1.tag === "Skip") {
286+ return $Step(
287+ "Skip",
288+ (() => {
289+ const $4 = filter(dictFunctor)(f);
290+ return Data$dLazy.defer(v$2 => $4(Data$dLazy.force(v$1._1)));
291+ })()
292+ );
293+ }
294+ if (v$1.tag === "Done") { return Done; }
295+ $runtime.fail();
296+})(v);
297+const dropWhile = dictApplicative => {
298+ const $1 = dictApplicative.Apply0().Functor0();
299+ return f => v => $1.map(v$1 => {
300+ if (v$1.tag === "Yield") {
301+ if (f(v$1._1)) {
302+ return $Step(
303+ "Skip",
304+ (() => {
305+ const $5 = dropWhile(dictApplicative)(f);
306+ return Data$dLazy.defer(v$2 => $5(Data$dLazy.force(v$1._2)));
307+ })()
308+ );
309+ }
310+ return $Step("Yield", v$1._1, v$1._2);
311+ }
312+ if (v$1.tag === "Skip") {
313+ return $Step(
314+ "Skip",
315+ (() => {
316+ const $5 = dropWhile(dictApplicative)(f);
317+ return Data$dLazy.defer(v$2 => $5(Data$dLazy.force(v$1._1)));
318+ })()
319+ );
320+ }
321+ if (v$1.tag === "Done") { return Done; }
322+ $runtime.fail();
323+ })(v);
324+};
325+const drop = dictApplicative => {
326+ const $1 = dictApplicative.Apply0().Functor0();
327+ return v => v1 => {
328+ if (v === 0) { return v1; }
329+ return $1.map(v2 => {
330+ if (v2.tag === "Yield") {
331+ return $Step(
332+ "Skip",
333+ (() => {
334+ const $5 = drop(dictApplicative)(v - 1 | 0);
335+ return Data$dLazy.defer(v$1 => $5(Data$dLazy.force(v2._2)));
336+ })()
337+ );
338+ }
339+ if (v2.tag === "Skip") {
340+ return $Step(
341+ "Skip",
342+ (() => {
343+ const $5 = drop(dictApplicative)(v);
344+ return Data$dLazy.defer(v$1 => $5(Data$dLazy.force(v2._1)));
345+ })()
346+ );
347+ }
348+ if (v2.tag === "Done") { return Done; }
349+ $runtime.fail();
350+ })(v1);
351+ };
352+};
353+const cons = dictApplicative => lh => t => dictApplicative.pure($Step("Yield", Data$dLazy.force(lh), t));
354+const unfoldable1ListT = dictMonad => {
355+ const Applicative0 = dictMonad.Applicative0();
356+ const singleton1 = singleton(Applicative0);
357+ return {
358+ unfoldr1: f => b => {
359+ const go = v => {
360+ if (v._2.tag === "Nothing") { return singleton1(v._1); }
361+ if (v._2.tag === "Just") { return Applicative0.pure($Step("Yield", Data$dLazy.force(Data$dLazy.defer(v$1 => v._1)), Data$dLazy.defer(v1 => go(f(v._2._1))))); }
362+ $runtime.fail();
363+ };
364+ return go(f(b));
365+ }
366+ };
367+};
368+const unfoldableListT = dictMonad => {
369+ const Applicative0 = dictMonad.Applicative0();
370+ const nil1 = Applicative0.pure(Done);
371+ const unfoldable1ListT1 = unfoldable1ListT(dictMonad);
372+ return {
373+ unfoldr: f => b => {
374+ const go = v => {
375+ if (v.tag === "Nothing") { return nil1; }
376+ if (v.tag === "Just") { return Applicative0.pure($Step("Yield", Data$dLazy.force(Data$dLazy.defer(v$1 => v._1._1)), Data$dLazy.defer(v1 => go(f(v._1._2))))); }
377+ $runtime.fail();
378+ };
379+ return go(f(b));
380+ },
381+ Unfoldable10: () => unfoldable1ListT1
382+ };
383+};
384+const semigroupListT = dictApplicative => ({append: concat(dictApplicative)});
385+const concat = dictApplicative => {
386+ const $1 = dictApplicative.Apply0().Functor0();
387+ return x => y => $1.map(v => {
388+ if (v.tag === "Yield") { return $Step("Yield", v._1, Data$dLazy.defer(v$1 => concat(dictApplicative)(Data$dLazy.force(v._2))(y))); }
389+ if (v.tag === "Skip") { return $Step("Skip", Data$dLazy.defer(v$1 => concat(dictApplicative)(Data$dLazy.force(v._1))(y))); }
390+ if (v.tag === "Done") { return $Step("Skip", Data$dLazy.defer(v$1 => y)); }
391+ $runtime.fail();
392+ })(x);
393+};
394+const monoidListT = dictApplicative => {
395+ const semigroupListT1 = {append: concat(dictApplicative)};
396+ return {mempty: dictApplicative.pure(Done), Semigroup0: () => semigroupListT1};
397+};
398+const catMaybes = dictFunctor => mapMaybe(dictFunctor)(identity);
399+const monadListT = dictMonad => ({Applicative0: () => applicativeListT(dictMonad), Bind1: () => bindListT(dictMonad)});
400+const bindListT = dictMonad => {
401+ const append = concat(dictMonad.Applicative0());
402+ const $2 = dictMonad.Bind1().Apply0().Functor0();
403+ return {
404+ bind: fa => f => $2.map(v => {
405+ if (v.tag === "Yield") { return $Step("Skip", Data$dLazy.defer(v$1 => append(f(v._1))(bindListT(dictMonad).bind(Data$dLazy.force(v._2))(f)))); }
406+ if (v.tag === "Skip") { return $Step("Skip", Data$dLazy.defer(v$1 => bindListT(dictMonad).bind(Data$dLazy.force(v._1))(f))); }
407+ if (v.tag === "Done") { return Done; }
408+ $runtime.fail();
409+ })(fa),
410+ Apply0: () => applyListT(dictMonad)
411+ };
412+};
413+const applyListT = dictMonad => {
414+ const functorListT1 = functorListT(dictMonad.Bind1().Apply0().Functor0());
415+ return {
416+ apply: (() => {
417+ const bind = bindListT(dictMonad).bind;
418+ const pure = applicativeListT(dictMonad).pure;
419+ return f => a => bind(f)(f$p => bind(a)(a$p => pure(f$p(a$p))));
420+ })(),
421+ Functor0: () => functorListT1
422+ };
423+};
424+const applicativeListT = dictMonad => ({pure: singleton(dictMonad.Applicative0()), Apply0: () => applyListT(dictMonad)});
425+const monadEffectListT = dictMonadEffect => {
426+ const Monad0 = dictMonadEffect.Monad0();
427+ const monadListT1 = {Applicative0: () => ({pure: singleton(Monad0.Applicative0()), Apply0: () => applyListT(Monad0)}), Bind1: () => bindListT(Monad0)};
428+ return {
429+ liftEffect: (() => {
430+ const $3 = fromEffect(Monad0.Applicative0());
431+ return x => $3(dictMonadEffect.liftEffect(x));
432+ })(),
433+ Monad0: () => monadListT1
434+ };
435+};
436+const altListT = dictApplicative => {
437+ const functorListT1 = functorListT(dictApplicative.Apply0().Functor0());
438+ return {alt: concat(dictApplicative), Functor0: () => functorListT1};
439+};
440+const plusListT = dictMonad => {
441+ const Applicative0 = dictMonad.Applicative0();
442+ const altListT1 = altListT(Applicative0);
443+ return {empty: Applicative0.pure(Done), Alt0: () => altListT1};
444+};
445+const alternativeListT = dictMonad => {
446+ const applicativeListT1 = {pure: singleton(dictMonad.Applicative0()), Apply0: () => applyListT(dictMonad)};
447+ const plusListT1 = plusListT(dictMonad);
448+ return {Applicative0: () => applicativeListT1, Plus1: () => plusListT1};
449+};
450+const monadPlusListT = dictMonad => {
451+ const monadListT1 = {Applicative0: () => ({pure: singleton(dictMonad.Applicative0()), Apply0: () => applyListT(dictMonad)}), Bind1: () => bindListT(dictMonad)};
452+ const alternativeListT1 = alternativeListT(dictMonad);
453+ return {Monad0: () => monadListT1, Alternative1: () => alternativeListT1};
454+};
455+export {
456+ $Step,
457+ Done,
458+ ListT,
459+ Skip,
460+ Yield,
461+ altListT,
462+ alternativeListT,
463+ applicativeListT,
464+ applyListT,
465+ bindListT,
466+ catMaybes,
467+ concat,
468+ cons,
469+ drop,
470+ dropWhile,
471+ filter,
472+ foldl,
473+ foldl$p,
474+ foldlRec,
475+ foldlRec$p,
476+ fromEffect,
477+ functorListT,
478+ head,
479+ identity,
480+ iterate,
481+ mapMaybe,
482+ monadEffectListT,
483+ monadListT,
484+ monadPlusListT,
485+ monadTransListT,
486+ monoidListT,
487+ newtypeListT,
488+ nil,
489+ plusListT,
490+ prepend,
491+ prepend$p,
492+ repeat,
493+ runListT,
494+ runListTRec,
495+ scanl,
496+ semigroupListT,
497+ singleton,
498+ tail,
499+ take,
500+ takeWhile,
501+ uncons,
502+ unfold,
503+ unfoldable1ListT,
504+ unfoldableListT,
505+ wrapEffect,
506+ wrapLazy,
507+ zipWith,
508+ zipWith$p
509+};
.storybook/purescript-indexer/output-es/Control.Monad.Maybe.Trans/index.jsnew file+214
@@ -0,0 +1,214 @@
1+// | This module defines the `MaybeT` monad transformer.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
4+import * as Data$dMaybe from "../Data.Maybe/index.js";
5+import * as Data$dTuple from "../Data.Tuple/index.js";
6+const identity = x => x;
7+const MaybeT = x => x;
8+const runMaybeT = v => v;
9+const newtypeMaybeT = {Coercible0: () => undefined};
10+const monadTransMaybeT = {
11+ lift: dictMonad => {
12+ const bind = dictMonad.Bind1().bind;
13+ const pure = dictMonad.Applicative0().pure;
14+ return x => bind(x)(a$p => pure(Data$dMaybe.$Maybe("Just", a$p)));
15+ }
16+};
17+const mapMaybeT = f => v => f(v);
18+const functorMaybeT = dictFunctor => ({map: f => v => dictFunctor.map(Data$dMaybe.functorMaybe.map(f))(v)});
19+const monadMaybeT = dictMonad => ({Applicative0: () => applicativeMaybeT(dictMonad), Bind1: () => bindMaybeT(dictMonad)});
20+const bindMaybeT = dictMonad => {
21+ const bind = dictMonad.Bind1().bind;
22+ const pure = dictMonad.Applicative0().pure;
23+ return {
24+ bind: v => f => bind(v)(v1 => {
25+ if (v1.tag === "Nothing") { return pure(Data$dMaybe.Nothing); }
26+ if (v1.tag === "Just") { return f(v1._1); }
27+ $runtime.fail();
28+ }),
29+ Apply0: () => applyMaybeT(dictMonad)
30+ };
31+};
32+const applyMaybeT = dictMonad => {
33+ const $1 = dictMonad.Bind1().Apply0().Functor0();
34+ const functorMaybeT1 = {map: f => v => $1.map(Data$dMaybe.functorMaybe.map(f))(v)};
35+ return {
36+ apply: (() => {
37+ const bind = bindMaybeT(dictMonad).bind;
38+ const pure = applicativeMaybeT(dictMonad).pure;
39+ return f => a => bind(f)(f$p => bind(a)(a$p => pure(f$p(a$p))));
40+ })(),
41+ Functor0: () => functorMaybeT1
42+ };
43+};
44+const applicativeMaybeT = dictMonad => (
45+ {
46+ pure: (() => {
47+ const $1 = dictMonad.Applicative0().pure;
48+ return x => $1(Data$dMaybe.$Maybe("Just", x));
49+ })(),
50+ Apply0: () => applyMaybeT(dictMonad)
51+ }
52+);
53+const semigroupMaybeT = dictMonad => {
54+ const $1 = applyMaybeT(dictMonad);
55+ const map = $1.Functor0().map;
56+ return dictSemigroup => ({append: a => b => $1.apply(map(dictSemigroup.append)(a))(b)});
57+};
58+const monadAskMaybeT = dictMonadAsk => {
59+ const Monad0 = dictMonadAsk.Monad0();
60+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT(Monad0), Bind1: () => bindMaybeT(Monad0)};
61+ return {ask: monadTransMaybeT.lift(Monad0)(dictMonadAsk.ask), Monad0: () => monadMaybeT1};
62+};
63+const monadReaderMaybeT = dictMonadReader => {
64+ const monadAskMaybeT1 = monadAskMaybeT(dictMonadReader.MonadAsk0());
65+ return {local: f => dictMonadReader.local(f), MonadAsk0: () => monadAskMaybeT1};
66+};
67+const monadContMaybeT = dictMonadCont => {
68+ const $1 = dictMonadCont.Monad0();
69+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT($1), Bind1: () => bindMaybeT($1)};
70+ return {callCC: f => dictMonadCont.callCC(c => f(a => c(Data$dMaybe.$Maybe("Just", a)))), Monad0: () => monadMaybeT1};
71+};
72+const monadEffectMaybe = dictMonadEffect => {
73+ const Monad0 = dictMonadEffect.Monad0();
74+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT(Monad0), Bind1: () => bindMaybeT(Monad0)};
75+ return {
76+ liftEffect: (() => {
77+ const $3 = monadTransMaybeT.lift(Monad0);
78+ return x => $3(dictMonadEffect.liftEffect(x));
79+ })(),
80+ Monad0: () => monadMaybeT1
81+ };
82+};
83+const monadRecMaybeT = dictMonadRec => {
84+ const Monad0 = dictMonadRec.Monad0();
85+ const bind = Monad0.Bind1().bind;
86+ const pure = Monad0.Applicative0().pure;
87+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT(Monad0), Bind1: () => bindMaybeT(Monad0)};
88+ return {
89+ tailRecM: f => dictMonadRec.tailRecM(a => bind(f(a))(m$p => pure((() => {
90+ if (m$p.tag === "Nothing") { return Control$dMonad$dRec$dClass.$Step("Done", Data$dMaybe.Nothing); }
91+ if (m$p.tag === "Just") {
92+ if (m$p._1.tag === "Loop") { return Control$dMonad$dRec$dClass.$Step("Loop", m$p._1._1); }
93+ if (m$p._1.tag === "Done") { return Control$dMonad$dRec$dClass.$Step("Done", Data$dMaybe.$Maybe("Just", m$p._1._1)); }
94+ $runtime.fail();
95+ }
96+ $runtime.fail();
97+ })()))),
98+ Monad0: () => monadMaybeT1
99+ };
100+};
101+const monadStateMaybeT = dictMonadState => {
102+ const Monad0 = dictMonadState.Monad0();
103+ const lift1 = monadTransMaybeT.lift(Monad0);
104+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT(Monad0), Bind1: () => bindMaybeT(Monad0)};
105+ return {state: f => lift1(dictMonadState.state(f)), Monad0: () => monadMaybeT1};
106+};
107+const monadTellMaybeT = dictMonadTell => {
108+ const Monad1 = dictMonadTell.Monad1();
109+ const Semigroup0 = dictMonadTell.Semigroup0();
110+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT(Monad1), Bind1: () => bindMaybeT(Monad1)};
111+ return {
112+ tell: (() => {
113+ const $4 = monadTransMaybeT.lift(Monad1);
114+ return x => $4(dictMonadTell.tell(x));
115+ })(),
116+ Semigroup0: () => Semigroup0,
117+ Monad1: () => monadMaybeT1
118+ };
119+};
120+const monadWriterMaybeT = dictMonadWriter => {
121+ const MonadTell1 = dictMonadWriter.MonadTell1();
122+ const Monad1 = MonadTell1.Monad1();
123+ const bind = Monad1.Bind1().bind;
124+ const pure = Monad1.Applicative0().pure;
125+ const Monoid0 = dictMonadWriter.Monoid0();
126+ const monadTellMaybeT1 = monadTellMaybeT(MonadTell1);
127+ return {
128+ listen: v => bind(dictMonadWriter.listen(v))(v$1 => pure((() => {
129+ if (v$1._1.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(v$1._1._1, v$1._2)); }
130+ return Data$dMaybe.Nothing;
131+ })())),
132+ pass: v => dictMonadWriter.pass(bind(v)(a => pure((() => {
133+ if (a.tag === "Nothing") { return Data$dTuple.$Tuple(Data$dMaybe.Nothing, identity); }
134+ if (a.tag === "Just") { return Data$dTuple.$Tuple(Data$dMaybe.$Maybe("Just", a._1._1), a._1._2); }
135+ $runtime.fail();
136+ })()))),
137+ Monoid0: () => Monoid0,
138+ MonadTell1: () => monadTellMaybeT1
139+ };
140+};
141+const monadThrowMaybeT = dictMonadThrow => {
142+ const Monad0 = dictMonadThrow.Monad0();
143+ const lift1 = monadTransMaybeT.lift(Monad0);
144+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT(Monad0), Bind1: () => bindMaybeT(Monad0)};
145+ return {throwError: e => lift1(dictMonadThrow.throwError(e)), Monad0: () => monadMaybeT1};
146+};
147+const monadErrorMaybeT = dictMonadError => {
148+ const monadThrowMaybeT1 = monadThrowMaybeT(dictMonadError.MonadThrow0());
149+ return {catchError: v => h => dictMonadError.catchError(v)(a => h(a)), MonadThrow0: () => monadThrowMaybeT1};
150+};
151+const monoidMaybeT = dictMonad => {
152+ const pure = applicativeMaybeT(dictMonad).pure;
153+ const semigroupMaybeT1 = semigroupMaybeT(dictMonad);
154+ return dictMonoid => {
155+ const semigroupMaybeT2 = semigroupMaybeT1(dictMonoid.Semigroup0());
156+ return {mempty: pure(dictMonoid.mempty), Semigroup0: () => semigroupMaybeT2};
157+ };
158+};
159+const altMaybeT = dictMonad => {
160+ const Bind1 = dictMonad.Bind1();
161+ const pure = dictMonad.Applicative0().pure;
162+ const $3 = Bind1.Apply0().Functor0();
163+ const functorMaybeT1 = {map: f => v => $3.map(Data$dMaybe.functorMaybe.map(f))(v)};
164+ return {
165+ alt: v => v1 => Bind1.bind(v)(m => {
166+ if (m.tag === "Nothing") { return v1; }
167+ return pure(m);
168+ }),
169+ Functor0: () => functorMaybeT1
170+ };
171+};
172+const plusMaybeT = dictMonad => {
173+ const altMaybeT1 = altMaybeT(dictMonad);
174+ return {empty: dictMonad.Applicative0().pure(Data$dMaybe.Nothing), Alt0: () => altMaybeT1};
175+};
176+const alternativeMaybeT = dictMonad => {
177+ const applicativeMaybeT1 = applicativeMaybeT(dictMonad);
178+ const plusMaybeT1 = plusMaybeT(dictMonad);
179+ return {Applicative0: () => applicativeMaybeT1, Plus1: () => plusMaybeT1};
180+};
181+const monadPlusMaybeT = dictMonad => {
182+ const monadMaybeT1 = {Applicative0: () => applicativeMaybeT(dictMonad), Bind1: () => bindMaybeT(dictMonad)};
183+ const alternativeMaybeT1 = alternativeMaybeT(dictMonad);
184+ return {Monad0: () => monadMaybeT1, Alternative1: () => alternativeMaybeT1};
185+};
186+export {
187+ MaybeT,
188+ altMaybeT,
189+ alternativeMaybeT,
190+ applicativeMaybeT,
191+ applyMaybeT,
192+ bindMaybeT,
193+ functorMaybeT,
194+ identity,
195+ mapMaybeT,
196+ monadAskMaybeT,
197+ monadContMaybeT,
198+ monadEffectMaybe,
199+ monadErrorMaybeT,
200+ monadMaybeT,
201+ monadPlusMaybeT,
202+ monadReaderMaybeT,
203+ monadRecMaybeT,
204+ monadStateMaybeT,
205+ monadTellMaybeT,
206+ monadThrowMaybeT,
207+ monadTransMaybeT,
208+ monadWriterMaybeT,
209+ monoidMaybeT,
210+ newtypeMaybeT,
211+ plusMaybeT,
212+ runMaybeT,
213+ semigroupMaybeT
214+};
.storybook/purescript-indexer/output-es/Control.Monad.RWS.Trans/index.jsnew file+240
@@ -0,0 +1,240 @@
1+// | This module defines the reader-writer-state monad transformer, `RWST`.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+const $RWSResult = (_1, _2, _3) => ({tag: "RWSResult", _1, _2, _3});
7+const RWSResult = value0 => value1 => value2 => $RWSResult(value0, value1, value2);
8+const RWST = x => x;
9+const withRWST = f => m => r => s => {
10+ const $4 = f(r)(s);
11+ return m($4._1)($4._2);
12+};
13+const runRWST = v => v;
14+const newtypeRWST = {Coercible0: () => undefined};
15+const monadTransRWST = dictMonoid => (
16+ {
17+ lift: dictMonad => {
18+ const bind = dictMonad.Bind1().bind;
19+ const pure = dictMonad.Applicative0().pure;
20+ return m => v => s => bind(m)(a => pure($RWSResult(s, a, dictMonoid.mempty)));
21+ }
22+ }
23+);
24+const mapRWST = f => v => r => s => f(v(r)(s));
25+const lazyRWST = {defer: f => r => s => f(Data$dUnit.unit)(r)(s)};
26+const functorRWST = dictFunctor => ({map: f => v => r => s => dictFunctor.map(v1 => $RWSResult(v1._1, f(v1._2), v1._3))(v(r)(s))});
27+const execRWST = dictMonad => {
28+ const bind = dictMonad.Bind1().bind;
29+ const pure = dictMonad.Applicative0().pure;
30+ return v => r => s => bind(v(r)(s))(v1 => pure(Data$dTuple.$Tuple(v1._1, v1._3)));
31+};
32+const evalRWST = dictMonad => {
33+ const bind = dictMonad.Bind1().bind;
34+ const pure = dictMonad.Applicative0().pure;
35+ return v => r => s => bind(v(r)(s))(v1 => pure(Data$dTuple.$Tuple(v1._2, v1._3)));
36+};
37+const applyRWST = dictBind => {
38+ const Functor0 = dictBind.Apply0().Functor0();
39+ const functorRWST1 = functorRWST(Functor0);
40+ return dictMonoid => {
41+ const append = dictMonoid.Semigroup0().append;
42+ return {
43+ apply: v => v1 => r => s => dictBind.bind(v(r)(s))(v2 => Functor0.map(v3 => $RWSResult(v3._1, v2._2(v3._2), append(v2._3)(v3._3)))(v1(r)(v2._1))),
44+ Functor0: () => functorRWST1
45+ };
46+ };
47+};
48+const bindRWST = dictBind => {
49+ const $1 = dictBind.Apply0().Functor0();
50+ const applyRWST1 = applyRWST(dictBind);
51+ return dictMonoid => {
52+ const append = dictMonoid.Semigroup0().append;
53+ const applyRWST2 = applyRWST1(dictMonoid);
54+ return {bind: v => f => r => s => dictBind.bind(v(r)(s))(v1 => $1.map(v3 => $RWSResult(v3._1, v3._2, append(v1._3)(v3._3)))(f(v1._2)(r)(v1._1))), Apply0: () => applyRWST2};
55+ };
56+};
57+const semigroupRWST = dictBind => {
58+ const applyRWST1 = applyRWST(dictBind);
59+ return dictMonoid => {
60+ const $3 = applyRWST1(dictMonoid);
61+ const map = $3.Functor0().map;
62+ return dictSemigroup => ({append: a => b => $3.apply(map(dictSemigroup.append)(a))(b)});
63+ };
64+};
65+const applicativeRWST = dictMonad => {
66+ const pure = dictMonad.Applicative0().pure;
67+ const applyRWST1 = applyRWST(dictMonad.Bind1());
68+ return dictMonoid => {
69+ const applyRWST2 = applyRWST1(dictMonoid);
70+ return {pure: a => v => s => pure($RWSResult(s, a, dictMonoid.mempty)), Apply0: () => applyRWST2};
71+ };
72+};
73+const monadRWST = dictMonad => {
74+ const applicativeRWST1 = applicativeRWST(dictMonad);
75+ const bindRWST1 = bindRWST(dictMonad.Bind1());
76+ return dictMonoid => {
77+ const applicativeRWST2 = applicativeRWST1(dictMonoid);
78+ const bindRWST2 = bindRWST1(dictMonoid);
79+ return {Applicative0: () => applicativeRWST2, Bind1: () => bindRWST2};
80+ };
81+};
82+const monadAskRWST = dictMonad => {
83+ const pure = dictMonad.Applicative0().pure;
84+ const monadRWST1 = monadRWST(dictMonad);
85+ return dictMonoid => {
86+ const monadRWST2 = monadRWST1(dictMonoid);
87+ return {ask: r => s => pure($RWSResult(s, r, dictMonoid.mempty)), Monad0: () => monadRWST2};
88+ };
89+};
90+const monadReaderRWST = dictMonad => {
91+ const monadAskRWST1 = monadAskRWST(dictMonad);
92+ return dictMonoid => {
93+ const monadAskRWST2 = monadAskRWST1(dictMonoid);
94+ return {local: f => m => r => s => m(f(r))(s), MonadAsk0: () => monadAskRWST2};
95+ };
96+};
97+const monadEffectRWS = dictMonoid => {
98+ const lift = monadTransRWST(dictMonoid).lift;
99+ return dictMonadEffect => {
100+ const Monad0 = dictMonadEffect.Monad0();
101+ const monadRWST1 = monadRWST(Monad0)(dictMonoid);
102+ return {
103+ liftEffect: (() => {
104+ const $5 = lift(Monad0);
105+ return x => $5(dictMonadEffect.liftEffect(x));
106+ })(),
107+ Monad0: () => monadRWST1
108+ };
109+ };
110+};
111+const monadRecRWST = dictMonadRec => {
112+ const Monad0 = dictMonadRec.Monad0();
113+ const bind = Monad0.Bind1().bind;
114+ const pure = Monad0.Applicative0().pure;
115+ const monadRWST1 = monadRWST(Monad0);
116+ return dictMonoid => {
117+ const append = dictMonoid.Semigroup0().append;
118+ const monadRWST2 = monadRWST1(dictMonoid);
119+ return {
120+ tailRecM: k => a => r => s => dictMonadRec.tailRecM(v => bind(k(v._2)(r)(v._1))(v2 => pure((() => {
121+ if (v2._2.tag === "Loop") { return Control$dMonad$dRec$dClass.$Step("Loop", $RWSResult(v2._1, v2._2._1, append(v._3)(v2._3))); }
122+ if (v2._2.tag === "Done") { return Control$dMonad$dRec$dClass.$Step("Done", $RWSResult(v2._1, v2._2._1, append(v._3)(v2._3))); }
123+ $runtime.fail();
124+ })())))($RWSResult(s, a, dictMonoid.mempty)),
125+ Monad0: () => monadRWST2
126+ };
127+ };
128+};
129+const monadStateRWST = dictMonad => {
130+ const pure = dictMonad.Applicative0().pure;
131+ const monadRWST1 = monadRWST(dictMonad);
132+ return dictMonoid => {
133+ const monadRWST2 = monadRWST1(dictMonoid);
134+ return {
135+ state: f => v => s => {
136+ const v1 = f(s);
137+ return pure($RWSResult(v1._2, v1._1, dictMonoid.mempty));
138+ },
139+ Monad0: () => monadRWST2
140+ };
141+ };
142+};
143+const monadTellRWST = dictMonad => {
144+ const pure = dictMonad.Applicative0().pure;
145+ const monadRWST1 = monadRWST(dictMonad);
146+ return dictMonoid => {
147+ const Semigroup0 = dictMonoid.Semigroup0();
148+ const monadRWST2 = monadRWST1(dictMonoid);
149+ return {tell: w => v => s => pure($RWSResult(s, Data$dUnit.unit, w)), Semigroup0: () => Semigroup0, Monad1: () => monadRWST2};
150+ };
151+};
152+const monadWriterRWST = dictMonad => {
153+ const bind = dictMonad.Bind1().bind;
154+ const pure = dictMonad.Applicative0().pure;
155+ const monadTellRWST1 = monadTellRWST(dictMonad);
156+ return dictMonoid => {
157+ const monadTellRWST2 = monadTellRWST1(dictMonoid);
158+ return {
159+ listen: m => r => s => bind(m(r)(s))(v => pure($RWSResult(v._1, Data$dTuple.$Tuple(v._2, v._3), v._3))),
160+ pass: m => r => s => bind(m(r)(s))(v => pure($RWSResult(v._1, v._2._1, v._2._2(v._3)))),
161+ Monoid0: () => dictMonoid,
162+ MonadTell1: () => monadTellRWST2
163+ };
164+ };
165+};
166+const monadThrowRWST = dictMonadThrow => {
167+ const Monad0 = dictMonadThrow.Monad0();
168+ const monadRWST1 = monadRWST(Monad0);
169+ return dictMonoid => {
170+ const lift = monadTransRWST(dictMonoid).lift(Monad0);
171+ const monadRWST2 = monadRWST1(dictMonoid);
172+ return {throwError: e => lift(dictMonadThrow.throwError(e)), Monad0: () => monadRWST2};
173+ };
174+};
175+const monadErrorRWST = dictMonadError => {
176+ const monadThrowRWST1 = monadThrowRWST(dictMonadError.MonadThrow0());
177+ return dictMonoid => {
178+ const monadThrowRWST2 = monadThrowRWST1(dictMonoid);
179+ return {catchError: m => h => r => s => dictMonadError.catchError(m(r)(s))(e => h(e)(r)(s)), MonadThrow0: () => monadThrowRWST2};
180+ };
181+};
182+const monoidRWST = dictMonad => {
183+ const applicativeRWST1 = applicativeRWST(dictMonad);
184+ const semigroupRWST1 = semigroupRWST(dictMonad.Bind1());
185+ return dictMonoid => {
186+ const pure = applicativeRWST1(dictMonoid).pure;
187+ const semigroupRWST2 = semigroupRWST1(dictMonoid);
188+ return dictMonoid1 => {
189+ const semigroupRWST3 = semigroupRWST2(dictMonoid1.Semigroup0());
190+ return {mempty: pure(dictMonoid1.mempty), Semigroup0: () => semigroupRWST3};
191+ };
192+ };
193+};
194+const altRWST = dictAlt => {
195+ const functorRWST1 = functorRWST(dictAlt.Functor0());
196+ return {alt: v => v1 => r => s => dictAlt.alt(v(r)(s))(v1(r)(s)), Functor0: () => functorRWST1};
197+};
198+const plusRWST = dictPlus => {
199+ const altRWST1 = altRWST(dictPlus.Alt0());
200+ return {empty: v => v1 => dictPlus.empty, Alt0: () => altRWST1};
201+};
202+const alternativeRWST = dictMonoid => dictAlternative => {
203+ const plusRWST1 = plusRWST(dictAlternative.Plus1());
204+ return dictMonad => {
205+ const applicativeRWST1 = applicativeRWST(dictMonad)(dictMonoid);
206+ return {Applicative0: () => applicativeRWST1, Plus1: () => plusRWST1};
207+ };
208+};
209+export {
210+ $RWSResult,
211+ RWSResult,
212+ RWST,
213+ altRWST,
214+ alternativeRWST,
215+ applicativeRWST,
216+ applyRWST,
217+ bindRWST,
218+ evalRWST,
219+ execRWST,
220+ functorRWST,
221+ lazyRWST,
222+ mapRWST,
223+ monadAskRWST,
224+ monadEffectRWS,
225+ monadErrorRWST,
226+ monadRWST,
227+ monadReaderRWST,
228+ monadRecRWST,
229+ monadStateRWST,
230+ monadTellRWST,
231+ monadThrowRWST,
232+ monadTransRWST,
233+ monadWriterRWST,
234+ monoidRWST,
235+ newtypeRWST,
236+ plusRWST,
237+ runRWST,
238+ semigroupRWST,
239+ withRWST
240+};
.storybook/purescript-indexer/output-es/Control.Monad.RWS/index.jsnew file+13
@@ -0,0 +1,13 @@
1+// | This module defines the `RWS` monad.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dRWS$dTrans from "../Control.Monad.RWS.Trans/index.js";
4+import * as Data$dIdentity from "../Data.Identity/index.js";
5+const execRWST = /* #__PURE__ */ Control$dMonad$dRWS$dTrans.execRWST(Data$dIdentity.monadIdentity);
6+const evalRWST = /* #__PURE__ */ Control$dMonad$dRWS$dTrans.evalRWST(Data$dIdentity.monadIdentity);
7+const withRWS = Control$dMonad$dRWS$dTrans.withRWST;
8+const rws = f => r => s => f(r)(s);
9+const runRWS = m => r => s => m(r)(s);
10+const mapRWS = f => v => r => s => f(v(r)(s));
11+const execRWS = m => r => s => execRWST(m)(r)(s);
12+const evalRWS = m => r => s => evalRWST(m)(r)(s);
13+export {evalRWS, evalRWST, execRWS, execRWST, mapRWS, runRWS, rws, withRWS};
.storybook/purescript-indexer/output-es/Control.Monad.Reader.Class/index.jsnew file+12
@@ -0,0 +1,12 @@
1+// | This module defines the `MonadReader` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad from "../Control.Monad/index.js";
4+const monadAskFun = {ask: x => x, Monad0: () => Control$dMonad.monadFn};
5+const monadReaderFun = {local: f => g => x => g(f(x)), MonadAsk0: () => monadAskFun};
6+const local = dict => dict.local;
7+const ask = dict => dict.ask;
8+const asks = dictMonadAsk => {
9+ const map = dictMonadAsk.Monad0().Bind1().Apply0().Functor0().map;
10+ return f => map(f)(dictMonadAsk.ask);
11+};
12+export {ask, asks, local, monadAskFun, monadReaderFun};
.storybook/purescript-indexer/output-es/Control.Monad.Reader.Trans/index.jsnew file+293
@@ -0,0 +1,293 @@
1+// | This module defines the reader monad transformer, `ReaderT`.
2+import * as $runtime from "../runtime.js";
3+const ReaderT = x => x;
4+const withReaderT = f => v => x => v(f(x));
5+const runReaderT = v => v;
6+const newtypeReaderT = {Coercible0: () => undefined};
7+const monadTransReaderT = {lift: dictMonad => x => v => x};
8+const mapReaderT = f => v => x => f(v(x));
9+const functorReaderT = dictFunctor => (
10+ {
11+ map: x => {
12+ const $2 = dictFunctor.map(x);
13+ return v => x$1 => $2(v(x$1));
14+ }
15+ }
16+);
17+const distributiveReaderT = dictDistributive => {
18+ const $1 = dictDistributive.Functor0();
19+ const functorReaderT1 = {
20+ map: x => {
21+ const $3 = $1.map(x);
22+ return v => x$1 => $3(v(x$1));
23+ }
24+ };
25+ return {
26+ distribute: dictFunctor => {
27+ const collect1 = dictDistributive.collect(dictFunctor);
28+ return a => e => collect1(r => r(e))(a);
29+ },
30+ collect: dictFunctor => f => {
31+ const $5 = distributiveReaderT(dictDistributive).distribute(dictFunctor);
32+ const $6 = dictFunctor.map(f);
33+ return x => $5($6(x));
34+ },
35+ Functor0: () => functorReaderT1
36+ };
37+};
38+const applyReaderT = dictApply => {
39+ const $1 = dictApply.Functor0();
40+ const functorReaderT1 = {
41+ map: x => {
42+ const $3 = $1.map(x);
43+ return v => x$1 => $3(v(x$1));
44+ }
45+ };
46+ return {apply: v => v1 => r => dictApply.apply(v(r))(v1(r)), Functor0: () => functorReaderT1};
47+};
48+const bindReaderT = dictBind => {
49+ const $1 = dictBind.Apply0();
50+ const $2 = $1.Functor0();
51+ const functorReaderT1 = {
52+ map: x => {
53+ const $4 = $2.map(x);
54+ return v => x$1 => $4(v(x$1));
55+ }
56+ };
57+ const applyReaderT1 = {apply: v => v1 => r => $1.apply(v(r))(v1(r)), Functor0: () => functorReaderT1};
58+ return {bind: v => k => r => dictBind.bind(v(r))(a => k(a)(r)), Apply0: () => applyReaderT1};
59+};
60+const semigroupReaderT = dictApply => {
61+ const $1 = dictApply.Functor0();
62+ return dictSemigroup => (
63+ {
64+ append: a => b => {
65+ const $5 = $1.map(dictSemigroup.append);
66+ return r => dictApply.apply($5(a(r)))(b(r));
67+ }
68+ }
69+ );
70+};
71+const applicativeReaderT = dictApplicative => {
72+ const $1 = dictApplicative.Apply0();
73+ const $2 = $1.Functor0();
74+ const functorReaderT1 = {
75+ map: x => {
76+ const $4 = $2.map(x);
77+ return v => x$1 => $4(v(x$1));
78+ }
79+ };
80+ const applyReaderT1 = {apply: v => v1 => r => $1.apply(v(r))(v1(r)), Functor0: () => functorReaderT1};
81+ return {
82+ pure: x => {
83+ const $6 = dictApplicative.pure(x);
84+ return v => $6;
85+ },
86+ Apply0: () => applyReaderT1
87+ };
88+};
89+const monadReaderT = dictMonad => {
90+ const $1 = dictMonad.Applicative0();
91+ const $2 = $1.Apply0();
92+ const $3 = $2.Functor0();
93+ const functorReaderT1 = {
94+ map: x => {
95+ const $5 = $3.map(x);
96+ return v => x$1 => $5(v(x$1));
97+ }
98+ };
99+ const applyReaderT1 = {apply: v => v1 => r => $2.apply(v(r))(v1(r)), Functor0: () => functorReaderT1};
100+ const applicativeReaderT1 = {
101+ pure: x => {
102+ const $7 = $1.pure(x);
103+ return v => $7;
104+ },
105+ Apply0: () => applyReaderT1
106+ };
107+ const bindReaderT1 = bindReaderT(dictMonad.Bind1());
108+ return {Applicative0: () => applicativeReaderT1, Bind1: () => bindReaderT1};
109+};
110+const monadAskReaderT = dictMonad => {
111+ const monadReaderT1 = monadReaderT(dictMonad);
112+ return {ask: dictMonad.Applicative0().pure, Monad0: () => monadReaderT1};
113+};
114+const monadReaderReaderT = dictMonad => {
115+ const monadReaderT1 = monadReaderT(dictMonad);
116+ const monadAskReaderT1 = {ask: dictMonad.Applicative0().pure, Monad0: () => monadReaderT1};
117+ return {local: withReaderT, MonadAsk0: () => monadAskReaderT1};
118+};
119+const monadContReaderT = dictMonadCont => {
120+ const monadReaderT1 = monadReaderT(dictMonadCont.Monad0());
121+ return {
122+ callCC: f => r => dictMonadCont.callCC(c => f(x => {
123+ const $6 = c(x);
124+ return v => $6;
125+ })(r)),
126+ Monad0: () => monadReaderT1
127+ };
128+};
129+const monadEffectReader = dictMonadEffect => {
130+ const monadReaderT1 = monadReaderT(dictMonadEffect.Monad0());
131+ return {
132+ liftEffect: x => {
133+ const $3 = dictMonadEffect.liftEffect(x);
134+ return v => $3;
135+ },
136+ Monad0: () => monadReaderT1
137+ };
138+};
139+const monadRecReaderT = dictMonadRec => {
140+ const Monad0 = dictMonadRec.Monad0();
141+ const $2 = Monad0.Bind1();
142+ const pure = Monad0.Applicative0().pure;
143+ const monadReaderT1 = monadReaderT(Monad0);
144+ return {tailRecM: k => a => r => dictMonadRec.tailRecM(a$p => $2.bind(k(a$p)(r))(pure))(a), Monad0: () => monadReaderT1};
145+};
146+const monadStateReaderT = dictMonadState => {
147+ const monadReaderT1 = monadReaderT(dictMonadState.Monad0());
148+ return {
149+ state: x => {
150+ const $3 = dictMonadState.state(x);
151+ return v => $3;
152+ },
153+ Monad0: () => monadReaderT1
154+ };
155+};
156+const monadTellReaderT = dictMonadTell => {
157+ const Semigroup0 = dictMonadTell.Semigroup0();
158+ const monadReaderT1 = monadReaderT(dictMonadTell.Monad1());
159+ return {
160+ tell: x => {
161+ const $4 = dictMonadTell.tell(x);
162+ return v => $4;
163+ },
164+ Semigroup0: () => Semigroup0,
165+ Monad1: () => monadReaderT1
166+ };
167+};
168+const monadWriterReaderT = dictMonadWriter => {
169+ const Monoid0 = dictMonadWriter.Monoid0();
170+ const monadTellReaderT1 = monadTellReaderT(dictMonadWriter.MonadTell1());
171+ return {listen: v => x => dictMonadWriter.listen(v(x)), pass: v => x => dictMonadWriter.pass(v(x)), Monoid0: () => Monoid0, MonadTell1: () => monadTellReaderT1};
172+};
173+const monadThrowReaderT = dictMonadThrow => {
174+ const monadReaderT1 = monadReaderT(dictMonadThrow.Monad0());
175+ return {
176+ throwError: x => {
177+ const $3 = dictMonadThrow.throwError(x);
178+ return v => $3;
179+ },
180+ Monad0: () => monadReaderT1
181+ };
182+};
183+const monadErrorReaderT = dictMonadError => {
184+ const monadThrowReaderT1 = monadThrowReaderT(dictMonadError.MonadThrow0());
185+ return {catchError: v => h => r => dictMonadError.catchError(v(r))(e => h(e)(r)), MonadThrow0: () => monadThrowReaderT1};
186+};
187+const monoidReaderT = dictApplicative => {
188+ const $1 = dictApplicative.Apply0();
189+ const $2 = $1.Functor0();
190+ return dictMonoid => {
191+ const $4 = dictMonoid.Semigroup0();
192+ const semigroupReaderT2 = {
193+ append: a => b => {
194+ const $7 = $2.map($4.append);
195+ return r => $1.apply($7(a(r)))(b(r));
196+ }
197+ };
198+ return {
199+ mempty: (() => {
200+ const $6 = dictApplicative.pure(dictMonoid.mempty);
201+ return v => $6;
202+ })(),
203+ Semigroup0: () => semigroupReaderT2
204+ };
205+ };
206+};
207+const altReaderT = dictAlt => {
208+ const $1 = dictAlt.Functor0();
209+ const functorReaderT1 = {
210+ map: x => {
211+ const $3 = $1.map(x);
212+ return v => x$1 => $3(v(x$1));
213+ }
214+ };
215+ return {alt: v => v1 => r => dictAlt.alt(v(r))(v1(r)), Functor0: () => functorReaderT1};
216+};
217+const plusReaderT = dictPlus => {
218+ const $1 = dictPlus.Alt0();
219+ const $2 = $1.Functor0();
220+ const functorReaderT1 = {
221+ map: x => {
222+ const $4 = $2.map(x);
223+ return v => x$1 => $4(v(x$1));
224+ }
225+ };
226+ const altReaderT1 = {alt: v => v1 => r => $1.alt(v(r))(v1(r)), Functor0: () => functorReaderT1};
227+ return {empty: v => dictPlus.empty, Alt0: () => altReaderT1};
228+};
229+const alternativeReaderT = dictAlternative => {
230+ const $1 = dictAlternative.Applicative0();
231+ const $2 = $1.Apply0();
232+ const $3 = $2.Functor0();
233+ const functorReaderT1 = {
234+ map: x => {
235+ const $5 = $3.map(x);
236+ return v => x$1 => $5(v(x$1));
237+ }
238+ };
239+ const applyReaderT1 = {apply: v => v1 => r => $2.apply(v(r))(v1(r)), Functor0: () => functorReaderT1};
240+ const applicativeReaderT1 = {
241+ pure: x => {
242+ const $7 = $1.pure(x);
243+ return v => $7;
244+ },
245+ Apply0: () => applyReaderT1
246+ };
247+ const $7 = dictAlternative.Plus1();
248+ const $8 = $7.Alt0();
249+ const $9 = $8.Functor0();
250+ const functorReaderT1$1 = {
251+ map: x => {
252+ const $11 = $9.map(x);
253+ return v => x$1 => $11(v(x$1));
254+ }
255+ };
256+ const altReaderT1 = {alt: v => v1 => r => $8.alt(v(r))(v1(r)), Functor0: () => functorReaderT1$1};
257+ return {Applicative0: () => applicativeReaderT1, Plus1: () => ({empty: v => $7.empty, Alt0: () => altReaderT1})};
258+};
259+const monadPlusReaderT = dictMonadPlus => {
260+ const monadReaderT1 = monadReaderT(dictMonadPlus.Monad0());
261+ const alternativeReaderT1 = alternativeReaderT(dictMonadPlus.Alternative1());
262+ return {Monad0: () => monadReaderT1, Alternative1: () => alternativeReaderT1};
263+};
264+export {
265+ ReaderT,
266+ altReaderT,
267+ alternativeReaderT,
268+ applicativeReaderT,
269+ applyReaderT,
270+ bindReaderT,
271+ distributiveReaderT,
272+ functorReaderT,
273+ mapReaderT,
274+ monadAskReaderT,
275+ monadContReaderT,
276+ monadEffectReader,
277+ monadErrorReaderT,
278+ monadPlusReaderT,
279+ monadReaderReaderT,
280+ monadReaderT,
281+ monadRecReaderT,
282+ monadStateReaderT,
283+ monadTellReaderT,
284+ monadThrowReaderT,
285+ monadTransReaderT,
286+ monadWriterReaderT,
287+ monoidReaderT,
288+ newtypeReaderT,
289+ plusReaderT,
290+ runReaderT,
291+ semigroupReaderT,
292+ withReaderT
293+};
.storybook/purescript-indexer/output-es/Control.Monad.Reader/index.jsnew file+7
@@ -0,0 +1,7 @@
1+// | This module defines the `Reader` monad.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dReader$dTrans from "../Control.Monad.Reader.Trans/index.js";
4+const withReader = Control$dMonad$dReader$dTrans.withReaderT;
5+const runReader = v => x => v(x);
6+const mapReader = f => v => x => f(v(x));
7+export {mapReader, runReader, withReader};
.storybook/purescript-indexer/output-es/Control.Monad.Rec.Class/index.jsnew file+270
@@ -0,0 +1,270 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad from "../Control.Monad/index.js";
3+import * as Data$dEither from "../Data.Either/index.js";
4+import * as Data$dIdentity from "../Data.Identity/index.js";
5+import * as Data$dMaybe from "../Data.Maybe/index.js";
6+import * as Data$dUnit from "../Data.Unit/index.js";
7+import * as Effect from "../Effect/index.js";
8+import * as Effect$dRef from "../Effect.Ref/index.js";
9+const $Step = (tag, _1) => ({tag, _1});
10+const Loop = value0 => $Step("Loop", value0);
11+const Done = value0 => $Step("Done", value0);
12+const tailRecM = dict => dict.tailRecM;
13+const tailRecM2 = dictMonadRec => f => a => b => dictMonadRec.tailRecM(o => f(o.a)(o.b))({a: a, b: b});
14+const tailRecM3 = dictMonadRec => f => a => b => c => dictMonadRec.tailRecM(o => f(o.a)(o.b)(o.c))({a: a, b: b, c: c});
15+const untilJust = dictMonadRec => {
16+ const $1 = dictMonadRec.Monad0().Bind1().Apply0().Functor0();
17+ return m => dictMonadRec.tailRecM(v => $1.map(v1 => {
18+ if (v1.tag === "Nothing") { return $Step("Loop", Data$dUnit.unit); }
19+ if (v1.tag === "Just") { return $Step("Done", v1._1); }
20+ $runtime.fail();
21+ })(m))(Data$dUnit.unit);
22+};
23+const whileJust = dictMonoid => {
24+ const append = dictMonoid.Semigroup0().append;
25+ return dictMonadRec => {
26+ const $3 = dictMonadRec.Monad0().Bind1().Apply0().Functor0();
27+ return m => dictMonadRec.tailRecM(v => $3.map(v1 => {
28+ if (v1.tag === "Nothing") { return $Step("Done", v); }
29+ if (v1.tag === "Just") { return $Step("Loop", append(v)(v1._1)); }
30+ $runtime.fail();
31+ })(m))(dictMonoid.mempty);
32+ };
33+};
34+const tailRec = f => {
35+ const go = go$a0$copy => {
36+ let go$a0 = go$a0$copy, go$c = true, go$r;
37+ while (go$c) {
38+ const v = go$a0;
39+ if (v.tag === "Loop") {
40+ go$a0 = f(v._1);
41+ continue;
42+ }
43+ if (v.tag === "Done") {
44+ go$c = false;
45+ go$r = v._1;
46+ continue;
47+ }
48+ $runtime.fail();
49+ };
50+ return go$r;
51+ };
52+ return x => go(f(x));
53+};
54+const tailRec2 = f => a => b => {
55+ const go = go$a0$copy => {
56+ let go$a0 = go$a0$copy, go$c = true, go$r;
57+ while (go$c) {
58+ const v = go$a0;
59+ if (v.tag === "Loop") {
60+ go$a0 = f(v._1.a)(v._1.b);
61+ continue;
62+ }
63+ if (v.tag === "Done") {
64+ go$c = false;
65+ go$r = v._1;
66+ continue;
67+ }
68+ $runtime.fail();
69+ };
70+ return go$r;
71+ };
72+ return go(f(a)(b));
73+};
74+const tailRec3 = f => a => b => c => {
75+ const go = go$a0$copy => {
76+ let go$a0 = go$a0$copy, go$c = true, go$r;
77+ while (go$c) {
78+ const v = go$a0;
79+ if (v.tag === "Loop") {
80+ go$a0 = f(v._1.a)(v._1.b)(v._1.c);
81+ continue;
82+ }
83+ if (v.tag === "Done") {
84+ go$c = false;
85+ go$r = v._1;
86+ continue;
87+ }
88+ $runtime.fail();
89+ };
90+ return go$r;
91+ };
92+ return go(f(a)(b)(c));
93+};
94+const monadRecMaybe = {
95+ tailRecM: f => a0 => {
96+ const $2 = v => {
97+ if (v.tag === "Nothing") { return $Step("Done", Data$dMaybe.Nothing); }
98+ if (v.tag === "Just") {
99+ if (v._1.tag === "Loop") { return $Step("Loop", f(v._1._1)); }
100+ if (v._1.tag === "Done") { return $Step("Done", Data$dMaybe.$Maybe("Just", v._1._1)); }
101+ $runtime.fail();
102+ }
103+ $runtime.fail();
104+ };
105+ const go = go$a0$copy => {
106+ let go$a0 = go$a0$copy, go$c = true, go$r;
107+ while (go$c) {
108+ const v = go$a0;
109+ if (v.tag === "Loop") {
110+ go$a0 = $2(v._1);
111+ continue;
112+ }
113+ if (v.tag === "Done") {
114+ go$c = false;
115+ go$r = v._1;
116+ continue;
117+ }
118+ $runtime.fail();
119+ };
120+ return go$r;
121+ };
122+ return go($2(f(a0)));
123+ },
124+ Monad0: () => Data$dMaybe.monadMaybe
125+};
126+const monadRecIdentity = {
127+ tailRecM: f => {
128+ const go = go$a0$copy => {
129+ let go$a0 = go$a0$copy, go$c = true, go$r;
130+ while (go$c) {
131+ const v = go$a0;
132+ if (v.tag === "Loop") {
133+ go$a0 = f(v._1);
134+ continue;
135+ }
136+ if (v.tag === "Done") {
137+ go$c = false;
138+ go$r = v._1;
139+ continue;
140+ }
141+ $runtime.fail();
142+ };
143+ return go$r;
144+ };
145+ return x => go(f(x));
146+ },
147+ Monad0: () => Data$dIdentity.monadIdentity
148+};
149+const monadRecFunction = {
150+ tailRecM: f => a0 => e => {
151+ const go = go$a0$copy => {
152+ let go$a0 = go$a0$copy, go$c = true, go$r;
153+ while (go$c) {
154+ const v = go$a0;
155+ if (v.tag === "Loop") {
156+ go$a0 = f(v._1)(e);
157+ continue;
158+ }
159+ if (v.tag === "Done") {
160+ go$c = false;
161+ go$r = v._1;
162+ continue;
163+ }
164+ $runtime.fail();
165+ };
166+ return go$r;
167+ };
168+ return go(f(a0)(e));
169+ },
170+ Monad0: () => Control$dMonad.monadFn
171+};
172+const monadRecEither = {
173+ tailRecM: f => a0 => {
174+ const $2 = v => {
175+ if (v.tag === "Left") { return $Step("Done", Data$dEither.$Either("Left", v._1)); }
176+ if (v.tag === "Right") {
177+ if (v._1.tag === "Loop") { return $Step("Loop", f(v._1._1)); }
178+ if (v._1.tag === "Done") { return $Step("Done", Data$dEither.$Either("Right", v._1._1)); }
179+ $runtime.fail();
180+ }
181+ $runtime.fail();
182+ };
183+ const go = go$a0$copy => {
184+ let go$a0 = go$a0$copy, go$c = true, go$r;
185+ while (go$c) {
186+ const v = go$a0;
187+ if (v.tag === "Loop") {
188+ go$a0 = $2(v._1);
189+ continue;
190+ }
191+ if (v.tag === "Done") {
192+ go$c = false;
193+ go$r = v._1;
194+ continue;
195+ }
196+ $runtime.fail();
197+ };
198+ return go$r;
199+ };
200+ return go($2(f(a0)));
201+ },
202+ Monad0: () => Data$dEither.monadEither
203+};
204+const monadRecEffect = {
205+ tailRecM: f => a => {
206+ const $2 = Effect.bindE(f(a))(Effect$dRef._new);
207+ return () => {
208+ const r = $2();
209+ Effect.untilE(() => {
210+ const v = r.value;
211+ if (v.tag === "Loop") {
212+ const e = f(v._1)();
213+ r.value = e;
214+ return false;
215+ }
216+ if (v.tag === "Done") { return true; }
217+ $runtime.fail();
218+ })();
219+ const a$p = r.value;
220+ return (() => {
221+ if (a$p.tag === "Done") { return a$p._1; }
222+ $runtime.fail();
223+ })();
224+ };
225+ },
226+ Monad0: () => Effect.monadEffect
227+};
228+const loop3 = a => b => c => $Step("Loop", {a: a, b: b, c: c});
229+const loop2 = a => b => $Step("Loop", {a: a, b: b});
230+const functorStep = {
231+ map: f => m => {
232+ if (m.tag === "Loop") { return $Step("Loop", m._1); }
233+ if (m.tag === "Done") { return $Step("Done", f(m._1)); }
234+ $runtime.fail();
235+ }
236+};
237+const forever = dictMonadRec => {
238+ const $1 = dictMonadRec.Monad0().Bind1().Apply0().Functor0();
239+ return ma => dictMonadRec.tailRecM(u => $1.map(v => $Step("Loop", u))(ma))(Data$dUnit.unit);
240+};
241+const bifunctorStep = {
242+ bimap: v => v1 => v2 => {
243+ if (v2.tag === "Loop") { return $Step("Loop", v(v2._1)); }
244+ if (v2.tag === "Done") { return $Step("Done", v1(v2._1)); }
245+ $runtime.fail();
246+ }
247+};
248+export {
249+ $Step,
250+ Done,
251+ Loop,
252+ bifunctorStep,
253+ forever,
254+ functorStep,
255+ loop2,
256+ loop3,
257+ monadRecEffect,
258+ monadRecEither,
259+ monadRecFunction,
260+ monadRecIdentity,
261+ monadRecMaybe,
262+ tailRec,
263+ tailRec2,
264+ tailRec3,
265+ tailRecM,
266+ tailRecM2,
267+ tailRecM3,
268+ untilJust,
269+ whileJust
270+};
.storybook/purescript-indexer/output-es/Control.Monad.ST.Class/index.jsnew file+8
@@ -0,0 +1,8 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dST$dInternal from "../Control.Monad.ST.Internal/index.js";
3+import * as Effect from "../Effect/index.js";
4+import * as Unsafe$dCoerce from "../Unsafe.Coerce/index.js";
5+const monadSTST = {liftST: x => x, Monad0: () => Control$dMonad$dST$dInternal.monadST};
6+const monadSTEffect = {liftST: Unsafe$dCoerce.unsafeCoerce, Monad0: () => Effect.monadEffect};
7+const liftST = dict => dict.liftST;
8+export {liftST, monadSTEffect, monadSTST};
.storybook/purescript-indexer/output-es/Control.Monad.ST.Global/index.jsnew file+4
@@ -0,0 +1,4 @@
1+import * as $runtime from "../runtime.js";
2+import * as Unsafe$dCoerce from "../Unsafe.Coerce/index.js";
3+const toEffect = Unsafe$dCoerce.unsafeCoerce;
4+export {toEffect};
.storybook/purescript-indexer/output-es/Control.Monad.ST.Internal/foreign.jsnew file+90
@@ -0,0 +1,90 @@
1+export const map_ = function (f) {
2+ return function (a) {
3+ return function () {
4+ return f(a());
5+ };
6+ };
7+};
8+
9+export const pure_ = function (a) {
10+ return function () {
11+ return a;
12+ };
13+};
14+
15+export const bind_ = function (a) {
16+ return function (f) {
17+ return function () {
18+ return f(a())();
19+ };
20+ };
21+};
22+
23+export const run = function (f) {
24+ return f();
25+};
26+
27+function whileST(f) {
28+ return function (a) {
29+ return function () {
30+ while (f()) {
31+ a();
32+ }
33+ };
34+ };
35+}
36+export { whileST as while };
37+
38+function forST(lo) {
39+ return function (hi) {
40+ return function (f) {
41+ return function () {
42+ for (var i = lo; i < hi; i++) {
43+ f(i)();
44+ }
45+ };
46+ };
47+ };
48+}
49+export { forST as for };
50+
51+export const foreach = function (as) {
52+ return function (f) {
53+ return function () {
54+ for (var i = 0, l = as.length; i < l; i++) {
55+ f(as[i])();
56+ }
57+ };
58+ };
59+};
60+
61+function newSTRef(val) {
62+ return function () {
63+ return { value: val };
64+ };
65+}
66+export { newSTRef as new };
67+
68+export const read = function (ref) {
69+ return function () {
70+ return ref.value;
71+ };
72+};
73+
74+export const modifyImpl = function (f) {
75+ return function (ref) {
76+ return function () {
77+ var t = f(ref.value);
78+ ref.value = t.state;
79+ return t.value;
80+ };
81+ };
82+};
83+
84+export const write = function (a) {
85+ return function (ref) {
86+ return function () {
87+ return ref.value = a; // eslint-disable-line no-return-assign
88+ };
89+ };
90+};
.storybook/purescript-indexer/output-es/Control.Monad.ST.Internal/index.jsnew file+69
@@ -0,0 +1,69 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dUnit from "../Data.Unit/index.js";
3+import {bind_, for as $$for, foreach, map_, modifyImpl, new as $$new, pure_, read, run, while as $$while, write} from "./foreign.js";
4+const modify$p = modifyImpl;
5+const modify = f => modifyImpl(s => {
6+ const s$p = f(s);
7+ return {state: s$p, value: s$p};
8+});
9+const functorST = {map: map_};
10+const monadST = {Applicative0: () => applicativeST, Bind1: () => bindST};
11+const bindST = {bind: bind_, Apply0: () => applyST};
12+const applyST = {
13+ apply: f => a => () => {
14+ const f$p = f();
15+ const a$p = a();
16+ return applicativeST.pure(f$p(a$p))();
17+ },
18+ Functor0: () => functorST
19+};
20+const applicativeST = {pure: pure_, Apply0: () => applyST};
21+const semigroupST = dictSemigroup => (
22+ {
23+ append: a => b => () => {
24+ const $3 = a();
25+ const a$p = b();
26+ return dictSemigroup.append($3)(a$p);
27+ }
28+ }
29+);
30+const monadRecST = {
31+ tailRecM: f => a => {
32+ const $2 = bind_(f(a))($$new);
33+ return () => {
34+ const r = $2();
35+ $$while(() => {
36+ const $4 = r.value;
37+ return $4.tag === "Loop";
38+ })(() => {
39+ const v = r.value;
40+ if (v.tag === "Loop") {
41+ const e = f(v._1)();
42+ r.value = e;
43+ return Data$dUnit.unit;
44+ }
45+ if (v.tag === "Done") { return Data$dUnit.unit; }
46+ $runtime.fail();
47+ })();
48+ const $5 = r.value;
49+ return (() => {
50+ if ($5.tag === "Done") { return $5._1; }
51+ $runtime.fail();
52+ })();
53+ };
54+ },
55+ Monad0: () => monadST
56+};
57+const monoidST = dictMonoid => {
58+ const $1 = dictMonoid.Semigroup0();
59+ const semigroupST1 = {
60+ append: a => b => () => {
61+ const $4 = a();
62+ const a$p = b();
63+ return $1.append($4)(a$p);
64+ }
65+ };
66+ return {mempty: () => dictMonoid.mempty, Semigroup0: () => semigroupST1};
67+};
68+export {applicativeST, applyST, bindST, functorST, modify, modify$p, monadRecST, monadST, monoidST, semigroupST};
69+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Control.Monad.ST.Ref/index.jsnew file+2
@@ -0,0 +1,2 @@
1+import * as $runtime from "../runtime.js";
2+export {};
.storybook/purescript-indexer/output-es/Control.Monad.ST.Uncurried/foreign.jsnew file+229
@@ -0,0 +1,229 @@
1+export const mkSTFn1 = function mkSTFn1(fn) {
2+ return function(x) {
3+ return fn(x)();
4+ };
5+};
6+
7+export const mkSTFn2 = function mkSTFn2(fn) {
8+ return function(a, b) {
9+ return fn(a)(b)();
10+ };
11+};
12+
13+export const mkSTFn3 = function mkSTFn3(fn) {
14+ return function(a, b, c) {
15+ return fn(a)(b)(c)();
16+ };
17+};
18+
19+export const mkSTFn4 = function mkSTFn4(fn) {
20+ return function(a, b, c, d) {
21+ return fn(a)(b)(c)(d)();
22+ };
23+};
24+
25+export const mkSTFn5 = function mkSTFn5(fn) {
26+ return function(a, b, c, d, e) {
27+ return fn(a)(b)(c)(d)(e)();
28+ };
29+};
30+
31+export const mkSTFn6 = function mkSTFn6(fn) {
32+ return function(a, b, c, d, e, f) {
33+ return fn(a)(b)(c)(d)(e)(f)();
34+ };
35+};
36+
37+export const mkSTFn7 = function mkSTFn7(fn) {
38+ return function(a, b, c, d, e, f, g) {
39+ return fn(a)(b)(c)(d)(e)(f)(g)();
40+ };
41+};
42+
43+export const mkSTFn8 = function mkSTFn8(fn) {
44+ return function(a, b, c, d, e, f, g, h) {
45+ return fn(a)(b)(c)(d)(e)(f)(g)(h)();
46+ };
47+};
48+
49+export const mkSTFn9 = function mkSTFn9(fn) {
50+ return function(a, b, c, d, e, f, g, h, i) {
51+ return fn(a)(b)(c)(d)(e)(f)(g)(h)(i)();
52+ };
53+};
54+
55+export const mkSTFn10 = function mkSTFn10(fn) {
56+ return function(a, b, c, d, e, f, g, h, i, j) {
57+ return fn(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)();
58+ };
59+};
60+
61+export const runSTFn1 = function runSTFn1(fn) {
62+ return function(a) {
63+ return function() {
64+ return fn(a);
65+ };
66+ };
67+};
68+
69+export const runSTFn2 = function runSTFn2(fn) {
70+ return function(a) {
71+ return function(b) {
72+ return function() {
73+ return fn(a, b);
74+ };
75+ };
76+ };
77+};
78+
79+export const runSTFn3 = function runSTFn3(fn) {
80+ return function(a) {
81+ return function(b) {
82+ return function(c) {
83+ return function() {
84+ return fn(a, b, c);
85+ };
86+ };
87+ };
88+ };
89+};
90+
91+export const runSTFn4 = function runSTFn4(fn) {
92+ return function(a) {
93+ return function(b) {
94+ return function(c) {
95+ return function(d) {
96+ return function() {
97+ return fn(a, b, c, d);
98+ };
99+ };
100+ };
101+ };
102+ };
103+};
104+
105+export const runSTFn5 = function runSTFn5(fn) {
106+ return function(a) {
107+ return function(b) {
108+ return function(c) {
109+ return function(d) {
110+ return function(e) {
111+ return function() {
112+ return fn(a, b, c, d, e);
113+ };
114+ };
115+ };
116+ };
117+ };
118+ };
119+};
120+
121+export const runSTFn6 = function runSTFn6(fn) {
122+ return function(a) {
123+ return function(b) {
124+ return function(c) {
125+ return function(d) {
126+ return function(e) {
127+ return function(f) {
128+ return function() {
129+ return fn(a, b, c, d, e, f);
130+ };
131+ };
132+ };
133+ };
134+ };
135+ };
136+ };
137+};
138+
139+export const runSTFn7 = function runSTFn7(fn) {
140+ return function(a) {
141+ return function(b) {
142+ return function(c) {
143+ return function(d) {
144+ return function(e) {
145+ return function(f) {
146+ return function(g) {
147+ return function() {
148+ return fn(a, b, c, d, e, f, g);
149+ };
150+ };
151+ };
152+ };
153+ };
154+ };
155+ };
156+ };
157+};
158+
159+export const runSTFn8 = function runSTFn8(fn) {
160+ return function(a) {
161+ return function(b) {
162+ return function(c) {
163+ return function(d) {
164+ return function(e) {
165+ return function(f) {
166+ return function(g) {
167+ return function(h) {
168+ return function() {
169+ return fn(a, b, c, d, e, f, g, h);
170+ };
171+ };
172+ };
173+ };
174+ };
175+ };
176+ };
177+ };
178+ };
179+};
180+
181+export const runSTFn9 = function runSTFn9(fn) {
182+ return function(a) {
183+ return function(b) {
184+ return function(c) {
185+ return function(d) {
186+ return function(e) {
187+ return function(f) {
188+ return function(g) {
189+ return function(h) {
190+ return function(i) {
191+ return function() {
192+ return fn(a, b, c, d, e, f, g, h, i);
193+ };
194+ };
195+ };
196+ };
197+ };
198+ };
199+ };
200+ };
201+ };
202+ };
203+};
204+
205+export const runSTFn10 = function runSTFn10(fn) {
206+ return function(a) {
207+ return function(b) {
208+ return function(c) {
209+ return function(d) {
210+ return function(e) {
211+ return function(f) {
212+ return function(g) {
213+ return function(h) {
214+ return function(i) {
215+ return function(j) {
216+ return function() {
217+ return fn(a, b, c, d, e, f, g, h, i, j);
218+ };
219+ };
220+ };
221+ };
222+ };
223+ };
224+ };
225+ };
226+ };
227+ };
228+ };
229+};
.storybook/purescript-indexer/output-es/Control.Monad.ST.Uncurried/index.jsnew file+40
@@ -0,0 +1,40 @@
1+// | This module defines types for STf uncurried functions, as well as
2+// | functions for converting back and forth between them.
3+// |
4+// | The general naming scheme for functions and types in this module is as
5+// | follows:
6+// |
7+// | * `STFn{N}` means, an uncurried function which accepts N arguments and
8+// | performs some STs. The first N arguments are the actual function's
9+// | argument. The last type argument is the return type.
10+// | * `runSTFn{N}` takes an `STFn` of N arguments, and converts it into
11+// | the normal PureScript form: a curried function which returns an ST
12+// | action.
13+// | * `mkSTFn{N}` is the inverse of `runSTFn{N}`. It can be useful for
14+// | callbacks.
15+// |
16+import * as $runtime from "../runtime.js";
17+import {
18+ mkSTFn1,
19+ mkSTFn10,
20+ mkSTFn2,
21+ mkSTFn3,
22+ mkSTFn4,
23+ mkSTFn5,
24+ mkSTFn6,
25+ mkSTFn7,
26+ mkSTFn8,
27+ mkSTFn9,
28+ runSTFn1,
29+ runSTFn10,
30+ runSTFn2,
31+ runSTFn3,
32+ runSTFn4,
33+ runSTFn5,
34+ runSTFn6,
35+ runSTFn7,
36+ runSTFn8,
37+ runSTFn9
38+} from "./foreign.js";
39+export {};
40+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Control.Monad.ST/index.jsnew file+2
@@ -0,0 +1,2 @@
1+import * as $runtime from "../runtime.js";
2+export {};
.storybook/purescript-indexer/output-es/Control.Monad.State.Class/index.jsnew file+14
@@ -0,0 +1,14 @@
1+// | This module defines the `MonadState` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dTuple from "../Data.Tuple/index.js";
4+import * as Data$dUnit from "../Data.Unit/index.js";
5+const state = dict => dict.state;
6+const put = dictMonadState => s => dictMonadState.state(v => Data$dTuple.$Tuple(Data$dUnit.unit, s));
7+const modify_ = dictMonadState => f => dictMonadState.state(s => Data$dTuple.$Tuple(Data$dUnit.unit, f(s)));
8+const modify = dictMonadState => f => dictMonadState.state(s => {
9+ const s$p = f(s);
10+ return Data$dTuple.$Tuple(s$p, s$p);
11+});
12+const gets = dictMonadState => f => dictMonadState.state(s => Data$dTuple.$Tuple(f(s), s));
13+const $$get = dictMonadState => dictMonadState.state(s => Data$dTuple.$Tuple(s, s));
14+export {$$get as get, gets, modify, modify_, put, state};
.storybook/purescript-indexer/output-es/Control.Monad.State.Trans/index.jsnew file+194
@@ -0,0 +1,194 @@
1+// | This module defines the state monad transformer, `StateT`.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+const StateT = x => x;
7+const withStateT = f => v => x => v(f(x));
8+const runStateT = v => v;
9+const newtypeStateT = {Coercible0: () => undefined};
10+const monadTransStateT = {
11+ lift: dictMonad => {
12+ const bind = dictMonad.Bind1().bind;
13+ const pure = dictMonad.Applicative0().pure;
14+ return m => s => bind(m)(x => pure(Data$dTuple.$Tuple(x, s)));
15+ }
16+};
17+const mapStateT = f => v => x => f(v(x));
18+const lazyStateT = {defer: f => s => f(Data$dUnit.unit)(s)};
19+const functorStateT = dictFunctor => ({map: f => v => s => dictFunctor.map(v1 => Data$dTuple.$Tuple(f(v1._1), v1._2))(v(s))});
20+const execStateT = dictFunctor => v => s => dictFunctor.map(Data$dTuple.snd)(v(s));
21+const evalStateT = dictFunctor => v => s => dictFunctor.map(Data$dTuple.fst)(v(s));
22+const monadStateT = dictMonad => ({Applicative0: () => applicativeStateT(dictMonad), Bind1: () => bindStateT(dictMonad)});
23+const bindStateT = dictMonad => {
24+ const bind = dictMonad.Bind1().bind;
25+ return {bind: v => f => s => bind(v(s))(v1 => f(v1._1)(v1._2)), Apply0: () => applyStateT(dictMonad)};
26+};
27+const applyStateT = dictMonad => {
28+ const functorStateT1 = functorStateT(dictMonad.Bind1().Apply0().Functor0());
29+ return {
30+ apply: (() => {
31+ const bind = bindStateT(dictMonad).bind;
32+ const pure = applicativeStateT(dictMonad).pure;
33+ return f => a => bind(f)(f$p => bind(a)(a$p => pure(f$p(a$p))));
34+ })(),
35+ Functor0: () => functorStateT1
36+ };
37+};
38+const applicativeStateT = dictMonad => {
39+ const pure = dictMonad.Applicative0().pure;
40+ return {pure: a => s => pure(Data$dTuple.$Tuple(a, s)), Apply0: () => applyStateT(dictMonad)};
41+};
42+const semigroupStateT = dictMonad => {
43+ const $1 = applyStateT(dictMonad);
44+ const map = $1.Functor0().map;
45+ return dictSemigroup => ({append: a => b => $1.apply(map(dictSemigroup.append)(a))(b)});
46+};
47+const monadAskStateT = dictMonadAsk => {
48+ const Monad0 = dictMonadAsk.Monad0();
49+ const monadStateT1 = {Applicative0: () => applicativeStateT(Monad0), Bind1: () => bindStateT(Monad0)};
50+ return {ask: monadTransStateT.lift(Monad0)(dictMonadAsk.ask), Monad0: () => monadStateT1};
51+};
52+const monadReaderStateT = dictMonadReader => {
53+ const monadAskStateT1 = monadAskStateT(dictMonadReader.MonadAsk0());
54+ return {
55+ local: x => {
56+ const $3 = dictMonadReader.local(x);
57+ return v => x$1 => $3(v(x$1));
58+ },
59+ MonadAsk0: () => monadAskStateT1
60+ };
61+};
62+const monadContStateT = dictMonadCont => {
63+ const $1 = dictMonadCont.Monad0();
64+ const monadStateT1 = {Applicative0: () => applicativeStateT($1), Bind1: () => bindStateT($1)};
65+ return {callCC: f => s => dictMonadCont.callCC(c => f(a => s$p => c(Data$dTuple.$Tuple(a, s$p)))(s)), Monad0: () => monadStateT1};
66+};
67+const monadEffectState = dictMonadEffect => {
68+ const Monad0 = dictMonadEffect.Monad0();
69+ const monadStateT1 = {Applicative0: () => applicativeStateT(Monad0), Bind1: () => bindStateT(Monad0)};
70+ return {
71+ liftEffect: (() => {
72+ const $3 = monadTransStateT.lift(Monad0);
73+ return x => $3(dictMonadEffect.liftEffect(x));
74+ })(),
75+ Monad0: () => monadStateT1
76+ };
77+};
78+const monadRecStateT = dictMonadRec => {
79+ const Monad0 = dictMonadRec.Monad0();
80+ const bind = Monad0.Bind1().bind;
81+ const pure = Monad0.Applicative0().pure;
82+ const monadStateT1 = {Applicative0: () => applicativeStateT(Monad0), Bind1: () => bindStateT(Monad0)};
83+ return {
84+ tailRecM: f => a => s => dictMonadRec.tailRecM(v => bind(f(v._1)(v._2))(v2 => pure((() => {
85+ if (v2._1.tag === "Loop") { return Control$dMonad$dRec$dClass.$Step("Loop", Data$dTuple.$Tuple(v2._1._1, v2._2)); }
86+ if (v2._1.tag === "Done") { return Control$dMonad$dRec$dClass.$Step("Done", Data$dTuple.$Tuple(v2._1._1, v2._2)); }
87+ $runtime.fail();
88+ })())))(Data$dTuple.$Tuple(a, s)),
89+ Monad0: () => monadStateT1
90+ };
91+};
92+const monadStateStateT = dictMonad => {
93+ const pure = dictMonad.Applicative0().pure;
94+ const monadStateT1 = {Applicative0: () => applicativeStateT(dictMonad), Bind1: () => bindStateT(dictMonad)};
95+ return {state: f => x => pure(f(x)), Monad0: () => monadStateT1};
96+};
97+const monadTellStateT = dictMonadTell => {
98+ const Monad1 = dictMonadTell.Monad1();
99+ const Semigroup0 = dictMonadTell.Semigroup0();
100+ const monadStateT1 = {Applicative0: () => applicativeStateT(Monad1), Bind1: () => bindStateT(Monad1)};
101+ return {
102+ tell: (() => {
103+ const $4 = monadTransStateT.lift(Monad1);
104+ return x => $4(dictMonadTell.tell(x));
105+ })(),
106+ Semigroup0: () => Semigroup0,
107+ Monad1: () => monadStateT1
108+ };
109+};
110+const monadWriterStateT = dictMonadWriter => {
111+ const MonadTell1 = dictMonadWriter.MonadTell1();
112+ const Monad1 = MonadTell1.Monad1();
113+ const bind = Monad1.Bind1().bind;
114+ const pure = Monad1.Applicative0().pure;
115+ const Monoid0 = dictMonadWriter.Monoid0();
116+ const monadTellStateT1 = monadTellStateT(MonadTell1);
117+ return {
118+ listen: m => s => bind(dictMonadWriter.listen(m(s)))(v => pure(Data$dTuple.$Tuple(Data$dTuple.$Tuple(v._1._1, v._2), v._1._2))),
119+ pass: m => s => dictMonadWriter.pass(bind(m(s))(v => pure(Data$dTuple.$Tuple(Data$dTuple.$Tuple(v._1._1, v._2), v._1._2)))),
120+ Monoid0: () => Monoid0,
121+ MonadTell1: () => monadTellStateT1
122+ };
123+};
124+const monadThrowStateT = dictMonadThrow => {
125+ const Monad0 = dictMonadThrow.Monad0();
126+ const lift1 = monadTransStateT.lift(Monad0);
127+ const monadStateT1 = {Applicative0: () => applicativeStateT(Monad0), Bind1: () => bindStateT(Monad0)};
128+ return {throwError: e => lift1(dictMonadThrow.throwError(e)), Monad0: () => monadStateT1};
129+};
130+const monadErrorStateT = dictMonadError => {
131+ const monadThrowStateT1 = monadThrowStateT(dictMonadError.MonadThrow0());
132+ return {catchError: v => h => s => dictMonadError.catchError(v(s))(e => h(e)(s)), MonadThrow0: () => monadThrowStateT1};
133+};
134+const monoidStateT = dictMonad => {
135+ const pure = applicativeStateT(dictMonad).pure;
136+ const semigroupStateT1 = semigroupStateT(dictMonad);
137+ return dictMonoid => {
138+ const semigroupStateT2 = semigroupStateT1(dictMonoid.Semigroup0());
139+ return {mempty: pure(dictMonoid.mempty), Semigroup0: () => semigroupStateT2};
140+ };
141+};
142+const altStateT = dictMonad => dictAlt => {
143+ const functorStateT1 = functorStateT(dictAlt.Functor0());
144+ return {alt: v => v1 => s => dictAlt.alt(v(s))(v1(s)), Functor0: () => functorStateT1};
145+};
146+const plusStateT = dictMonad => dictPlus => {
147+ const altStateT2 = altStateT(dictMonad)(dictPlus.Alt0());
148+ return {empty: v => dictPlus.empty, Alt0: () => altStateT2};
149+};
150+const alternativeStateT = dictMonad => {
151+ const applicativeStateT1 = applicativeStateT(dictMonad);
152+ return dictAlternative => {
153+ const plusStateT2 = plusStateT(dictMonad)(dictAlternative.Plus1());
154+ return {Applicative0: () => applicativeStateT1, Plus1: () => plusStateT2};
155+ };
156+};
157+const monadPlusStateT = dictMonadPlus => {
158+ const Monad0 = dictMonadPlus.Monad0();
159+ const monadStateT1 = {Applicative0: () => applicativeStateT(Monad0), Bind1: () => bindStateT(Monad0)};
160+ const alternativeStateT1 = alternativeStateT(Monad0)(dictMonadPlus.Alternative1());
161+ return {Monad0: () => monadStateT1, Alternative1: () => alternativeStateT1};
162+};
163+export {
164+ StateT,
165+ altStateT,
166+ alternativeStateT,
167+ applicativeStateT,
168+ applyStateT,
169+ bindStateT,
170+ evalStateT,
171+ execStateT,
172+ functorStateT,
173+ lazyStateT,
174+ mapStateT,
175+ monadAskStateT,
176+ monadContStateT,
177+ monadEffectState,
178+ monadErrorStateT,
179+ monadPlusStateT,
180+ monadReaderStateT,
181+ monadRecStateT,
182+ monadStateStateT,
183+ monadStateT,
184+ monadTellStateT,
185+ monadThrowStateT,
186+ monadTransStateT,
187+ monadWriterStateT,
188+ monoidStateT,
189+ newtypeStateT,
190+ plusStateT,
191+ runStateT,
192+ semigroupStateT,
193+ withStateT
194+};
.storybook/purescript-indexer/output-es/Control.Monad.State/index.jsnew file+9
@@ -0,0 +1,9 @@
1+// | This module defines the `State` monad.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dState$dTrans from "../Control.Monad.State.Trans/index.js";
4+const withState = Control$dMonad$dState$dTrans.withStateT;
5+const runState = v => x => v(x);
6+const mapState = f => v => x => f(v(x));
7+const execState = v => s => v(s)._2;
8+const evalState = v => s => v(s)._1;
9+export {evalState, execState, mapState, runState, withState};
.storybook/purescript-indexer/output-es/Control.Monad.Trampoline/index.jsnew file+11
@@ -0,0 +1,11 @@
1+// | A _trampoline_ monad, which can be used at the bottom of
2+// | a monad transformer stack to avoid stack overflows in large
3+// | monadic computations.
4+import * as $runtime from "../runtime.js";
5+import * as Control$dMonad$dFree from "../Control.Monad.Free/index.js";
6+import * as Data$dFunctor from "../Data.Functor/index.js";
7+import * as Data$dUnit from "../Data.Unit/index.js";
8+const runTrampoline = /* #__PURE__ */ Control$dMonad$dFree.runFree(Data$dFunctor.functorFn)(v => v(Data$dUnit.unit));
9+const done = /* #__PURE__ */ (() => Control$dMonad$dFree.freeApplicative.pure)();
10+const delay = Control$dMonad$dFree.liftF;
11+export {delay, done, runTrampoline};
.storybook/purescript-indexer/output-es/Control.Monad.Trans.Class/index.jsnew file+4
@@ -0,0 +1,4 @@
1+// | This module defines the `MonadTrans` type class of _monad transformers_.
2+import * as $runtime from "../runtime.js";
3+const lift = dict => dict.lift;
4+export {lift};
.storybook/purescript-indexer/output-es/Control.Monad.Writer.Class/index.jsnew file+19
@@ -0,0 +1,19 @@
1+// | This module defines the `MonadWriter` type class and its instances.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dTuple from "../Data.Tuple/index.js";
4+const tell = dict => dict.tell;
5+const pass = dict => dict.pass;
6+const listen = dict => dict.listen;
7+const listens = dictMonadWriter => {
8+ const Monad1 = dictMonadWriter.MonadTell1().Monad1();
9+ const bind = Monad1.Bind1().bind;
10+ const pure = Monad1.Applicative0().pure;
11+ return f => m => bind(dictMonadWriter.listen(m))(v => pure(Data$dTuple.$Tuple(v._1, f(v._2))));
12+};
13+const censor = dictMonadWriter => {
14+ const Monad1 = dictMonadWriter.MonadTell1().Monad1();
15+ const bind = Monad1.Bind1().bind;
16+ const pure = Monad1.Applicative0().pure;
17+ return f => m => dictMonadWriter.pass(bind(m)(a => pure(Data$dTuple.$Tuple(a, f))));
18+};
19+export {censor, listen, listens, pass, tell};
.storybook/purescript-indexer/output-es/Control.Monad.Writer.Trans/index.jsnew file+231
@@ -0,0 +1,231 @@
1+// | This module defines the writer monad transformer, `WriterT`.
2+import * as $runtime from "../runtime.js";
3+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+const WriterT = x => x;
7+const runWriterT = v => v;
8+const newtypeWriterT = {Coercible0: () => undefined};
9+const monadTransWriterT = dictMonoid => (
10+ {
11+ lift: dictMonad => {
12+ const bind = dictMonad.Bind1().bind;
13+ const pure = dictMonad.Applicative0().pure;
14+ return m => bind(m)(a => pure(Data$dTuple.$Tuple(a, dictMonoid.mempty)));
15+ }
16+ }
17+);
18+const mapWriterT = f => v => f(v);
19+const functorWriterT = dictFunctor => ({map: f => dictFunctor.map(v => Data$dTuple.$Tuple(f(v._1), v._2))});
20+const execWriterT = dictFunctor => v => dictFunctor.map(Data$dTuple.snd)(v);
21+const applyWriterT = dictSemigroup => dictApply => {
22+ const Functor0 = dictApply.Functor0();
23+ const functorWriterT1 = functorWriterT(Functor0);
24+ return {apply: v => v1 => dictApply.apply(Functor0.map(v3 => v4 => Data$dTuple.$Tuple(v3._1(v4._1), dictSemigroup.append(v3._2)(v4._2)))(v))(v1), Functor0: () => functorWriterT1};
25+};
26+const bindWriterT = dictSemigroup => dictBind => {
27+ const Apply0 = dictBind.Apply0();
28+ const map = Apply0.Functor0().map;
29+ const applyWriterT2 = applyWriterT(dictSemigroup)(Apply0);
30+ return {bind: v => k => dictBind.bind(v)(v1 => map(v3 => Data$dTuple.$Tuple(v3._1, dictSemigroup.append(v1._2)(v3._2)))(k(v1._1))), Apply0: () => applyWriterT2};
31+};
32+const semigroupWriterT = dictApply => dictSemigroup => {
33+ const $2 = applyWriterT(dictSemigroup)(dictApply);
34+ const map = $2.Functor0().map;
35+ return dictSemigroup1 => ({append: a => b => $2.apply(map(dictSemigroup1.append)(a))(b)});
36+};
37+const applicativeWriterT = dictMonoid => {
38+ const applyWriterT1 = applyWriterT(dictMonoid.Semigroup0());
39+ return dictApplicative => {
40+ const applyWriterT2 = applyWriterT1(dictApplicative.Apply0());
41+ return {pure: a => dictApplicative.pure(Data$dTuple.$Tuple(a, dictMonoid.mempty)), Apply0: () => applyWriterT2};
42+ };
43+};
44+const monadWriterT = dictMonoid => {
45+ const applicativeWriterT1 = applicativeWriterT(dictMonoid);
46+ const bindWriterT1 = bindWriterT(dictMonoid.Semigroup0());
47+ return dictMonad => {
48+ const applicativeWriterT2 = applicativeWriterT1(dictMonad.Applicative0());
49+ const bindWriterT2 = bindWriterT1(dictMonad.Bind1());
50+ return {Applicative0: () => applicativeWriterT2, Bind1: () => bindWriterT2};
51+ };
52+};
53+const monadAskWriterT = dictMonoid => {
54+ const lift = monadTransWriterT(dictMonoid).lift;
55+ const monadWriterT1 = monadWriterT(dictMonoid);
56+ return dictMonadAsk => {
57+ const Monad0 = dictMonadAsk.Monad0();
58+ const monadWriterT2 = monadWriterT1(Monad0);
59+ return {ask: lift(Monad0)(dictMonadAsk.ask), Monad0: () => monadWriterT2};
60+ };
61+};
62+const monadReaderWriterT = dictMonoid => {
63+ const monadAskWriterT1 = monadAskWriterT(dictMonoid);
64+ return dictMonadReader => {
65+ const monadAskWriterT2 = monadAskWriterT1(dictMonadReader.MonadAsk0());
66+ return {local: f => dictMonadReader.local(f), MonadAsk0: () => monadAskWriterT2};
67+ };
68+};
69+const monadContWriterT = dictMonoid => {
70+ const monadWriterT1 = monadWriterT(dictMonoid);
71+ return dictMonadCont => {
72+ const monadWriterT2 = monadWriterT1(dictMonadCont.Monad0());
73+ return {callCC: f => dictMonadCont.callCC(c => f(a => c(Data$dTuple.$Tuple(a, dictMonoid.mempty)))), Monad0: () => monadWriterT2};
74+ };
75+};
76+const monadEffectWriter = dictMonoid => {
77+ const lift = monadTransWriterT(dictMonoid).lift;
78+ const monadWriterT1 = monadWriterT(dictMonoid);
79+ return dictMonadEffect => {
80+ const Monad0 = dictMonadEffect.Monad0();
81+ const monadWriterT2 = monadWriterT1(Monad0);
82+ return {
83+ liftEffect: (() => {
84+ const $6 = lift(Monad0);
85+ return x => $6(dictMonadEffect.liftEffect(x));
86+ })(),
87+ Monad0: () => monadWriterT2
88+ };
89+ };
90+};
91+const monadRecWriterT = dictMonoid => {
92+ const append = dictMonoid.Semigroup0().append;
93+ const monadWriterT1 = monadWriterT(dictMonoid);
94+ return dictMonadRec => {
95+ const Monad0 = dictMonadRec.Monad0();
96+ const bind = Monad0.Bind1().bind;
97+ const pure = Monad0.Applicative0().pure;
98+ const monadWriterT2 = monadWriterT1(Monad0);
99+ return {
100+ tailRecM: f => a => dictMonadRec.tailRecM(v => bind(f(v._1))(v2 => pure((() => {
101+ if (v2._1.tag === "Loop") { return Control$dMonad$dRec$dClass.$Step("Loop", Data$dTuple.$Tuple(v2._1._1, append(v._2)(v2._2))); }
102+ if (v2._1.tag === "Done") { return Control$dMonad$dRec$dClass.$Step("Done", Data$dTuple.$Tuple(v2._1._1, append(v._2)(v2._2))); }
103+ $runtime.fail();
104+ })())))(Data$dTuple.$Tuple(a, dictMonoid.mempty)),
105+ Monad0: () => monadWriterT2
106+ };
107+ };
108+};
109+const monadStateWriterT = dictMonoid => {
110+ const lift = monadTransWriterT(dictMonoid).lift;
111+ const monadWriterT1 = monadWriterT(dictMonoid);
112+ return dictMonadState => {
113+ const Monad0 = dictMonadState.Monad0();
114+ const lift1 = lift(Monad0);
115+ const monadWriterT2 = monadWriterT1(Monad0);
116+ return {state: f => lift1(dictMonadState.state(f)), Monad0: () => monadWriterT2};
117+ };
118+};
119+const monadTellWriterT = dictMonoid => {
120+ const Semigroup0 = dictMonoid.Semigroup0();
121+ const monadWriterT1 = monadWriterT(dictMonoid);
122+ return dictMonad => {
123+ const monadWriterT2 = monadWriterT1(dictMonad);
124+ return {
125+ tell: (() => {
126+ const $5 = dictMonad.Applicative0().pure;
127+ const $6 = Data$dTuple.Tuple(Data$dUnit.unit);
128+ return x => $5($6(x));
129+ })(),
130+ Semigroup0: () => Semigroup0,
131+ Monad1: () => monadWriterT2
132+ };
133+ };
134+};
135+const monadWriterWriterT = dictMonoid => {
136+ const monadTellWriterT1 = monadTellWriterT(dictMonoid);
137+ return dictMonad => {
138+ const bind = dictMonad.Bind1().bind;
139+ const pure = dictMonad.Applicative0().pure;
140+ const monadTellWriterT2 = monadTellWriterT1(dictMonad);
141+ return {
142+ listen: v => bind(v)(v1 => pure(Data$dTuple.$Tuple(Data$dTuple.$Tuple(v1._1, v1._2), v1._2))),
143+ pass: v => bind(v)(v1 => pure(Data$dTuple.$Tuple(v1._1._1, v1._1._2(v1._2)))),
144+ Monoid0: () => dictMonoid,
145+ MonadTell1: () => monadTellWriterT2
146+ };
147+ };
148+};
149+const monadThrowWriterT = dictMonoid => {
150+ const lift = monadTransWriterT(dictMonoid).lift;
151+ const monadWriterT1 = monadWriterT(dictMonoid);
152+ return dictMonadThrow => {
153+ const Monad0 = dictMonadThrow.Monad0();
154+ const lift1 = lift(Monad0);
155+ const monadWriterT2 = monadWriterT1(Monad0);
156+ return {throwError: e => lift1(dictMonadThrow.throwError(e)), Monad0: () => monadWriterT2};
157+ };
158+};
159+const monadErrorWriterT = dictMonoid => {
160+ const monadThrowWriterT1 = monadThrowWriterT(dictMonoid);
161+ return dictMonadError => {
162+ const monadThrowWriterT2 = monadThrowWriterT1(dictMonadError.MonadThrow0());
163+ return {catchError: v => h => dictMonadError.catchError(v)(e => h(e)), MonadThrow0: () => monadThrowWriterT2};
164+ };
165+};
166+const monoidWriterT = dictApplicative => {
167+ const semigroupWriterT1 = semigroupWriterT(dictApplicative.Apply0());
168+ return dictMonoid => {
169+ const pure = applicativeWriterT(dictMonoid)(dictApplicative).pure;
170+ const semigroupWriterT2 = semigroupWriterT1(dictMonoid.Semigroup0());
171+ return dictMonoid1 => {
172+ const semigroupWriterT3 = semigroupWriterT2(dictMonoid1.Semigroup0());
173+ return {mempty: pure(dictMonoid1.mempty), Semigroup0: () => semigroupWriterT3};
174+ };
175+ };
176+};
177+const altWriterT = dictAlt => {
178+ const functorWriterT1 = functorWriterT(dictAlt.Functor0());
179+ return {alt: v => v1 => dictAlt.alt(v)(v1), Functor0: () => functorWriterT1};
180+};
181+const plusWriterT = dictPlus => {
182+ const altWriterT1 = altWriterT(dictPlus.Alt0());
183+ return {empty: dictPlus.empty, Alt0: () => altWriterT1};
184+};
185+const alternativeWriterT = dictMonoid => {
186+ const applicativeWriterT1 = applicativeWriterT(dictMonoid);
187+ return dictAlternative => {
188+ const applicativeWriterT2 = applicativeWriterT1(dictAlternative.Applicative0());
189+ const $4 = dictAlternative.Plus1();
190+ const altWriterT1 = altWriterT($4.Alt0());
191+ return {Applicative0: () => applicativeWriterT2, Plus1: () => ({empty: $4.empty, Alt0: () => altWriterT1})};
192+ };
193+};
194+const monadPlusWriterT = dictMonoid => {
195+ const monadWriterT1 = monadWriterT(dictMonoid);
196+ const alternativeWriterT1 = alternativeWriterT(dictMonoid);
197+ return dictMonadPlus => {
198+ const monadWriterT2 = monadWriterT1(dictMonadPlus.Monad0());
199+ const alternativeWriterT2 = alternativeWriterT1(dictMonadPlus.Alternative1());
200+ return {Monad0: () => monadWriterT2, Alternative1: () => alternativeWriterT2};
201+ };
202+};
203+export {
204+ WriterT,
205+ altWriterT,
206+ alternativeWriterT,
207+ applicativeWriterT,
208+ applyWriterT,
209+ bindWriterT,
210+ execWriterT,
211+ functorWriterT,
212+ mapWriterT,
213+ monadAskWriterT,
214+ monadContWriterT,
215+ monadEffectWriter,
216+ monadErrorWriterT,
217+ monadPlusWriterT,
218+ monadReaderWriterT,
219+ monadRecWriterT,
220+ monadStateWriterT,
221+ monadTellWriterT,
222+ monadThrowWriterT,
223+ monadTransWriterT,
224+ monadWriterT,
225+ monadWriterWriterT,
226+ monoidWriterT,
227+ newtypeWriterT,
228+ plusWriterT,
229+ runWriterT,
230+ semigroupWriterT
231+};
.storybook/purescript-indexer/output-es/Control.Monad.Writer/index.jsnew file+7
@@ -0,0 +1,7 @@
1+// | This module defines the `Writer` monad.
2+import * as $runtime from "../runtime.js";
3+const writer = x => x;
4+const runWriter = x => x;
5+const mapWriter = f => v => f(v);
6+const execWriter = m => m._2;
7+export {execWriter, mapWriter, runWriter, writer};
.storybook/purescript-indexer/output-es/Control.Monad/index.jsnew file+35
@@ -0,0 +1,35 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dApplicative from "../Control.Applicative/index.js";
3+import * as Control$dBind from "../Control.Bind/index.js";
4+import * as Data$dUnit from "../Data.Unit/index.js";
5+const whenM = dictMonad => {
6+ const bind = dictMonad.Bind1().bind;
7+ const $2 = dictMonad.Applicative0();
8+ return mb => m => bind(mb)(b => {
9+ if (b) { return m; }
10+ return $2.pure(Data$dUnit.unit);
11+ });
12+};
13+const unlessM = dictMonad => {
14+ const bind = dictMonad.Bind1().bind;
15+ const $2 = dictMonad.Applicative0();
16+ return mb => m => bind(mb)(b => {
17+ if (!b) { return m; }
18+ if (b) { return $2.pure(Data$dUnit.unit); }
19+ $runtime.fail();
20+ });
21+};
22+const monadProxy = {Applicative0: () => Control$dApplicative.applicativeProxy, Bind1: () => Control$dBind.bindProxy};
23+const monadFn = {Applicative0: () => Control$dApplicative.applicativeFn, Bind1: () => Control$dBind.bindFn};
24+const monadArray = {Applicative0: () => Control$dApplicative.applicativeArray, Bind1: () => Control$dBind.bindArray};
25+const liftM1 = dictMonad => {
26+ const bind = dictMonad.Bind1().bind;
27+ const pure = dictMonad.Applicative0().pure;
28+ return f => a => bind(a)(a$p => pure(f(a$p)));
29+};
30+const ap = dictMonad => {
31+ const bind = dictMonad.Bind1().bind;
32+ const pure = dictMonad.Applicative0().pure;
33+ return f => a => bind(f)(f$p => bind(a)(a$p => pure(f$p(a$p))));
34+};
35+export {ap, liftM1, monadArray, monadFn, monadProxy, unlessM, whenM};
.storybook/purescript-indexer/output-es/Control.MonadPlus/index.jsnew file+5
@@ -0,0 +1,5 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dAlternative from "../Control.Alternative/index.js";
3+import * as Control$dMonad from "../Control.Monad/index.js";
4+const monadPlusArray = {Monad0: () => Control$dMonad.monadArray, Alternative1: () => Control$dAlternative.alternativeArray};
5+export {monadPlusArray};
.storybook/purescript-indexer/output-es/Control.Parallel.Class/index.jsnew file+168
@@ -0,0 +1,168 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dCont$dTrans from "../Control.Monad.Cont.Trans/index.js";
3+import * as Control$dMonad$dExcept$dTrans from "../Control.Monad.Except.Trans/index.js";
4+import * as Control$dMonad$dMaybe$dTrans from "../Control.Monad.Maybe.Trans/index.js";
5+import * as Control$dMonad$dReader$dTrans from "../Control.Monad.Reader.Trans/index.js";
6+import * as Control$dMonad$dWriter$dTrans from "../Control.Monad.Writer.Trans/index.js";
7+import * as Data$dEither from "../Data.Either/index.js";
8+import * as Data$dFunctor$dCompose from "../Data.Functor.Compose/index.js";
9+import * as Data$dFunctor$dCostar from "../Data.Functor.Costar/index.js";
10+import * as Data$dMaybe from "../Data.Maybe/index.js";
11+import * as Data$dProfunctor$dStar from "../Data.Profunctor.Star/index.js";
12+import * as Data$dUnit from "../Data.Unit/index.js";
13+const ParCont = x => x;
14+const sequential = dict => dict.sequential;
15+const parallel = dict => dict.parallel;
16+const newtypeParCont = {Coercible0: () => undefined};
17+const monadParWriterT = dictMonoid => {
18+ const monadWriterT = Control$dMonad$dWriter$dTrans.monadWriterT(dictMonoid);
19+ const applicativeWriterT = Control$dMonad$dWriter$dTrans.applicativeWriterT(dictMonoid);
20+ return dictParallel => {
21+ const monadWriterT1 = monadWriterT(dictParallel.Monad0());
22+ const applicativeWriterT1 = applicativeWriterT(dictParallel.Applicative1());
23+ return {parallel: v => dictParallel.parallel(v), sequential: v => dictParallel.sequential(v), Monad0: () => monadWriterT1, Applicative1: () => applicativeWriterT1};
24+ };
25+};
26+const monadParStar = dictParallel => {
27+ const monadStar = Data$dProfunctor$dStar.monadStar(dictParallel.Monad0());
28+ const $2 = dictParallel.Applicative1();
29+ const $3 = $2.Apply0();
30+ const $4 = $3.Functor0();
31+ const functorStar1 = {
32+ map: f => v => {
33+ const $7 = $4.map(f);
34+ return x => $7(v(x));
35+ }
36+ };
37+ const applyStar1 = {apply: v => v1 => a => $3.apply(v(a))(v1(a)), Functor0: () => functorStar1};
38+ const applicativeStar = {pure: a => v => $2.pure(a), Apply0: () => applyStar1};
39+ return {parallel: v => x => dictParallel.parallel(v(x)), sequential: v => x => dictParallel.sequential(v(x)), Monad0: () => monadStar, Applicative1: () => applicativeStar};
40+};
41+const monadParReaderT = dictParallel => {
42+ const monadReaderT = Control$dMonad$dReader$dTrans.monadReaderT(dictParallel.Monad0());
43+ const $2 = dictParallel.Applicative1();
44+ const $3 = $2.Apply0();
45+ const $4 = $3.Functor0();
46+ const functorReaderT1 = {
47+ map: x => {
48+ const $6 = $4.map(x);
49+ return v => x$1 => $6(v(x$1));
50+ }
51+ };
52+ const applyReaderT1 = {apply: v => v1 => r => $3.apply(v(r))(v1(r)), Functor0: () => functorReaderT1};
53+ const applicativeReaderT = {
54+ pure: x => {
55+ const $8 = $2.pure(x);
56+ return v => $8;
57+ },
58+ Apply0: () => applyReaderT1
59+ };
60+ return {parallel: v => x => dictParallel.parallel(v(x)), sequential: v => x => dictParallel.sequential(v(x)), Monad0: () => monadReaderT, Applicative1: () => applicativeReaderT};
61+};
62+const monadParMaybeT = dictParallel => {
63+ const $1 = dictParallel.Monad0();
64+ const monadMaybeT = {Applicative0: () => Control$dMonad$dMaybe$dTrans.applicativeMaybeT($1), Bind1: () => Control$dMonad$dMaybe$dTrans.bindMaybeT($1)};
65+ const applicativeCompose = Data$dFunctor$dCompose.applicativeCompose(dictParallel.Applicative1())(Data$dMaybe.applicativeMaybe);
66+ return {parallel: v => dictParallel.parallel(v), sequential: v => dictParallel.sequential(v), Monad0: () => monadMaybeT, Applicative1: () => applicativeCompose};
67+};
68+const monadParExceptT = dictParallel => {
69+ const $1 = dictParallel.Monad0();
70+ const monadExceptT = {Applicative0: () => Control$dMonad$dExcept$dTrans.applicativeExceptT($1), Bind1: () => Control$dMonad$dExcept$dTrans.bindExceptT($1)};
71+ const applicativeCompose = Data$dFunctor$dCompose.applicativeCompose(dictParallel.Applicative1())(Data$dEither.applicativeEither);
72+ return {parallel: v => dictParallel.parallel(v), sequential: v => dictParallel.sequential(v), Monad0: () => monadExceptT, Applicative1: () => applicativeCompose};
73+};
74+const monadParCostar = dictParallel => (
75+ {
76+ parallel: v => x => v(dictParallel.sequential(x)),
77+ sequential: v => x => v(dictParallel.parallel(x)),
78+ Monad0: () => Data$dFunctor$dCostar.monadCostar,
79+ Applicative1: () => Data$dFunctor$dCostar.applicativeCostar
80+ }
81+);
82+const monadParParCont = dictMonadEffect => {
83+ const monadContT = Control$dMonad$dCont$dTrans.monadContT(dictMonadEffect.Monad0());
84+ return {parallel: ParCont, sequential: v => v, Monad0: () => monadContT, Applicative1: () => applicativeParCont(dictMonadEffect)};
85+};
86+const functorParCont = dictMonadEffect => (
87+ {
88+ map: f => {
89+ const $2 = monadParParCont(dictMonadEffect).parallel;
90+ const $3 = monadParParCont(dictMonadEffect).sequential;
91+ return x => $2((() => {
92+ const $5 = $3(x);
93+ return k => $5(a => k(f(a)));
94+ })());
95+ }
96+ }
97+);
98+const applyParCont = dictMonadEffect => {
99+ const Bind1 = dictMonadEffect.Monad0().Bind1();
100+ return {
101+ apply: v => v1 => k => Bind1.bind(dictMonadEffect.liftEffect(() => ({value: Data$dMaybe.Nothing})))(ra => Bind1.bind(dictMonadEffect.liftEffect(() => (
102+ {value: Data$dMaybe.Nothing}
103+ )))(rb => Bind1.bind(v(a => Bind1.bind(dictMonadEffect.liftEffect(() => rb.value))(mb => {
104+ if (mb.tag === "Nothing") { return dictMonadEffect.liftEffect(() => ra.value = Data$dMaybe.$Maybe("Just", a)); }
105+ if (mb.tag === "Just") { return k(a(mb._1)); }
106+ $runtime.fail();
107+ })))(() => v1(b => Bind1.bind(dictMonadEffect.liftEffect(() => ra.value))(ma => {
108+ if (ma.tag === "Nothing") { return dictMonadEffect.liftEffect(() => rb.value = Data$dMaybe.$Maybe("Just", b)); }
109+ if (ma.tag === "Just") { return k(ma._1(b)); }
110+ $runtime.fail();
111+ }))))),
112+ Functor0: () => functorParCont(dictMonadEffect)
113+ };
114+};
115+const applicativeParCont = dictMonadEffect => (
116+ {
117+ pure: (() => {
118+ const $1 = monadParParCont(dictMonadEffect).parallel;
119+ return x => $1(k => k(x));
120+ })(),
121+ Apply0: () => applyParCont(dictMonadEffect)
122+ }
123+);
124+const altParCont = dictMonadEffect => {
125+ const Monad0 = dictMonadEffect.Monad0();
126+ const Bind1 = Monad0.Bind1();
127+ const pure = Monad0.Applicative0().pure;
128+ const functorParCont1 = functorParCont(dictMonadEffect);
129+ return {
130+ alt: v => v1 => k => Bind1.bind(dictMonadEffect.liftEffect(() => ({value: false})))(done => Bind1.bind(v(a => Bind1.bind(dictMonadEffect.liftEffect(() => done.value))(b => {
131+ if (b) { return pure(Data$dUnit.unit); }
132+ return Bind1.bind(dictMonadEffect.liftEffect(() => done.value = true))(() => k(a));
133+ })))(() => v1(a => Bind1.bind(dictMonadEffect.liftEffect(() => done.value))(b => {
134+ if (b) { return pure(Data$dUnit.unit); }
135+ return Bind1.bind(dictMonadEffect.liftEffect(() => done.value = true))(() => k(a));
136+ })))),
137+ Functor0: () => functorParCont1
138+ };
139+};
140+const plusParCont = dictMonadEffect => {
141+ const pure = dictMonadEffect.Monad0().Applicative0().pure;
142+ const altParCont1 = altParCont(dictMonadEffect);
143+ return {empty: v => pure(Data$dUnit.unit), Alt0: () => altParCont1};
144+};
145+const alternativeParCont = dictMonadEffect => {
146+ const applicativeParCont1 = applicativeParCont(dictMonadEffect);
147+ const plusParCont1 = plusParCont(dictMonadEffect);
148+ return {Applicative0: () => applicativeParCont1, Plus1: () => plusParCont1};
149+};
150+export {
151+ ParCont,
152+ altParCont,
153+ alternativeParCont,
154+ applicativeParCont,
155+ applyParCont,
156+ functorParCont,
157+ monadParCostar,
158+ monadParExceptT,
159+ monadParMaybeT,
160+ monadParParCont,
161+ monadParReaderT,
162+ monadParStar,
163+ monadParWriterT,
164+ newtypeParCont,
165+ parallel,
166+ plusParCont,
167+ sequential
168+};
.storybook/purescript-indexer/output-es/Control.Parallel/index.jsnew file+59
@@ -0,0 +1,59 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dFoldable from "../Data.Foldable/index.js";
3+const identity = x => x;
4+const parTraverse_ = dictParallel => {
5+ const traverse_ = Data$dFoldable.traverse_(dictParallel.Applicative1());
6+ return dictFoldable => {
7+ const traverse_1 = traverse_(dictFoldable);
8+ return f => {
9+ const $5 = traverse_1(x => dictParallel.parallel(f(x)));
10+ return x => dictParallel.sequential($5(x));
11+ };
12+ };
13+};
14+const parTraverse = dictParallel => {
15+ const Applicative1 = dictParallel.Applicative1();
16+ return dictTraversable => {
17+ const traverse = dictTraversable.traverse(Applicative1);
18+ return f => {
19+ const $5 = traverse(x => dictParallel.parallel(f(x)));
20+ return x => dictParallel.sequential($5(x));
21+ };
22+ };
23+};
24+const parSequence_ = dictParallel => {
25+ const parTraverse_1 = parTraverse_(dictParallel);
26+ return dictFoldable => parTraverse_1(dictFoldable)(identity);
27+};
28+const parSequence = dictParallel => {
29+ const Applicative1 = dictParallel.Applicative1();
30+ return dictTraversable => {
31+ const $3 = dictTraversable.traverse(Applicative1)(x => dictParallel.parallel(x));
32+ return x => dictParallel.sequential($3(x));
33+ };
34+};
35+const parOneOfMap = dictParallel => dictAlternative => {
36+ const Plus1 = dictAlternative.Plus1();
37+ return dictFoldable => {
38+ const alt = Plus1.Alt0().alt;
39+ return dictFunctor => f => {
40+ const $7 = dictFoldable.foldr(x => alt(dictParallel.parallel(f(x))))(Plus1.empty);
41+ return x => dictParallel.sequential($7(x));
42+ };
43+ };
44+};
45+const parOneOf = dictParallel => dictAlternative => {
46+ const Plus1 = dictAlternative.Plus1();
47+ return dictFoldable => {
48+ const alt = Plus1.Alt0().alt;
49+ return dictFunctor => {
50+ const $6 = dictFoldable.foldr(x => alt(dictParallel.parallel(x)))(Plus1.empty);
51+ return x => dictParallel.sequential($6(x));
52+ };
53+ };
54+};
55+const parApply = dictParallel => {
56+ const apply = dictParallel.Applicative1().Apply0().apply;
57+ return mf => ma => dictParallel.sequential(apply(dictParallel.parallel(mf))(dictParallel.parallel(ma)));
58+};
59+export {identity, parApply, parOneOf, parOneOfMap, parSequence, parSequence_, parTraverse, parTraverse_};
.storybook/purescript-indexer/output-es/Control.Plus/index.jsnew file+5
@@ -0,0 +1,5 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dAlt from "../Control.Alt/index.js";
3+const plusArray = {empty: [], Alt0: () => Control$dAlt.altArray};
4+const empty = dict => dict.empty;
5+export {empty, plusArray};
.storybook/purescript-indexer/output-es/Control.Promise/foreign.jsnew file+24
@@ -0,0 +1,24 @@
1+export function promise(f) {
2+ return function () {
3+ return new Promise(function (success, error) {
4+ var succF = function (s) { return function() { return success(s); } };
5+ var failF = function (s) { return function() { return error(s); } };
6+
7+ // This indicates the aff was wrong?
8+ try { f(succF)(failF)(); }
9+ catch (e) {
10+ error(e);
11+ }
12+ });
13+ };
14+}
15+
16+export function thenImpl(promise) {
17+ return function(errCB) {
18+ return function(succCB) {
19+ return function() {
20+ promise.then(succCB, errCB);
21+ };
22+ };
23+ };
24+}
.storybook/purescript-indexer/output-es/Control.Promise/index.jsnew file+46
@@ -0,0 +1,46 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dExcept$dTrans from "../Control.Monad.Except.Trans/index.js";
3+import * as Data$dEither from "../Data.Either/index.js";
4+import * as Data$dIdentity from "../Data.Identity/index.js";
5+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
6+import * as Data$dUnit from "../Data.Unit/index.js";
7+import * as Effect$dAff from "../Effect.Aff/index.js";
8+import * as Effect$dException from "../Effect.Exception/index.js";
9+import * as Foreign from "../Foreign/index.js";
10+import {promise, thenImpl} from "./foreign.js";
11+const alt = /* #__PURE__ */ (() => Control$dMonad$dExcept$dTrans.altExceptT(Data$dList$dTypes.semigroupNonEmptyList)(Data$dIdentity.monadIdentity).alt)();
12+const unsafeReadTagged = /* #__PURE__ */ Foreign.unsafeReadTagged(Data$dIdentity.monadIdentity);
13+const readString = /* #__PURE__ */ Foreign.unsafeReadTagged(Data$dIdentity.monadIdentity)("String");
14+const toAff$p = customCoerce => p => Effect$dAff.makeAff(cb => {
15+ const $3 = thenImpl(p)($3 => cb(Data$dEither.$Either("Left", customCoerce($3)))())(x => cb(Data$dEither.$Either("Right", x))());
16+ return () => {
17+ $3();
18+ return Effect$dAff.nonCanceler;
19+ };
20+});
21+const fromAff = aff => promise(succ => err => {
22+ const $3 = Effect$dAff.runAff(v2 => {
23+ if (v2.tag === "Left") { return err(v2._1); }
24+ if (v2.tag === "Right") { return succ(v2._1); }
25+ $runtime.fail();
26+ })(aff);
27+ return () => {
28+ $3();
29+ return Data$dUnit.unit;
30+ };
31+});
32+const coerce = fn => {
33+ const $1 = alt(unsafeReadTagged("Error")(fn))((() => {
34+ const $1 = readString(fn);
35+ if ($1.tag === "Left") { return Data$dEither.$Either("Left", $1._1); }
36+ if ($1.tag === "Right") { return Data$dEither.$Either("Right", Effect$dException.error($1._1)); }
37+ $runtime.fail();
38+ })());
39+ if ($1.tag === "Left") { return Effect$dException.error("Promise failed, couldn't extract JS Error or String"); }
40+ if ($1.tag === "Right") { return $1._1; }
41+ $runtime.fail();
42+};
43+const toAff = /* #__PURE__ */ toAff$p(coerce);
44+const toAffE = f => Effect$dAff._bind(Effect$dAff._liftEffect(f))(toAff$p(coerce));
45+export {alt, coerce, fromAff, readString, toAff, toAff$p, toAffE, unsafeReadTagged};
46+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Control.Semigroupoid/index.jsnew file+5
@@ -0,0 +1,5 @@
1+import * as $runtime from "../runtime.js";
2+const semigroupoidFn = {compose: f => g => x => f(g(x))};
3+const compose = dict => dict.compose;
4+const composeFlipped = dictSemigroupoid => f => g => dictSemigroupoid.compose(g)(f);
5+export {compose, composeFlipped, semigroupoidFn};
.storybook/purescript-indexer/output-es/Data.Array.NonEmpty.Internal/foreign.jsnew file+85
@@ -0,0 +1,85 @@
1+export const foldr1Impl = function (f) {
2+ return function (xs) {
3+ var acc = xs[xs.length - 1];
4+ for (var i = xs.length - 2; i >= 0; i--) {
5+ acc = f(xs[i])(acc);
6+ }
7+ return acc;
8+ };
9+};
10+
11+export const foldl1Impl = function (f) {
12+ return function (xs) {
13+ var acc = xs[0];
14+ var len = xs.length;
15+ for (var i = 1; i < len; i++) {
16+ acc = f(acc)(xs[i]);
17+ }
18+ return acc;
19+ };
20+};
21+
22+export const traverse1Impl = function () {
23+ function Cont(fn) {
24+ this.fn = fn;
25+ }
26+
27+ var emptyList = {};
28+
29+ var ConsCell = function (head, tail) {
30+ this.head = head;
31+ this.tail = tail;
32+ };
33+
34+ function finalCell(head) {
35+ return new ConsCell(head, emptyList);
36+ }
37+
38+ function consList(x) {
39+ return function (xs) {
40+ return new ConsCell(x, xs);
41+ };
42+ }
43+
44+ function listToArray(list) {
45+ var arr = [];
46+ var xs = list;
47+ while (xs !== emptyList) {
48+ arr.push(xs.head);
49+ xs = xs.tail;
50+ }
51+ return arr;
52+ }
53+
54+ return function (apply) {
55+ return function (map) {
56+ return function (f) {
57+ var buildFrom = function (x, ys) {
58+ return apply(map(consList)(f(x)))(ys);
59+ };
60+
61+ var go = function (acc, currentLen, xs) {
62+ if (currentLen === 0) {
63+ return acc;
64+ } else {
65+ var last = xs[currentLen - 1];
66+ return new Cont(function () {
67+ var built = go(buildFrom(last, acc), currentLen - 1, xs);
68+ return built;
69+ });
70+ }
71+ };
72+
73+ return function (array) {
74+ var acc = map(finalCell)(f(array[array.length - 1]));
75+ var result = go(acc, array.length - 1, array);
76+ while (result instanceof Cont) {
77+ result = result.fn();
78+ }
79+
80+ return map(listToArray)(result);
81+ };
82+ };
83+ };
84+ };
85+}();
.storybook/purescript-indexer/output-es/Data.Array.NonEmpty.Internal/index.jsnew file+87
@@ -0,0 +1,87 @@
1+// | This module exports the `NonEmptyArray` constructor.
2+// |
3+// | It is **NOT** intended for public use and is **NOT** versioned.
4+// |
5+// | Its content may change **in any way**, **at any time** and
6+// | **without notice**.
7+import * as $runtime from "../runtime.js";
8+import * as Control$dAlt from "../Control.Alt/index.js";
9+import * as Control$dApplicative from "../Control.Applicative/index.js";
10+import * as Control$dApply from "../Control.Apply/index.js";
11+import * as Control$dBind from "../Control.Bind/index.js";
12+import * as Control$dMonad from "../Control.Monad/index.js";
13+import * as Data$dEq from "../Data.Eq/index.js";
14+import * as Data$dFoldable from "../Data.Foldable/index.js";
15+import * as Data$dFoldableWithIndex from "../Data.FoldableWithIndex/index.js";
16+import * as Data$dFunctor from "../Data.Functor/index.js";
17+import * as Data$dFunctorWithIndex from "../Data.FunctorWithIndex/index.js";
18+import * as Data$dOrd from "../Data.Ord/index.js";
19+import * as Data$dSemigroup from "../Data.Semigroup/index.js";
20+import * as Data$dSemigroup$dTraversable from "../Data.Semigroup.Traversable/index.js";
21+import * as Data$dShow from "../Data.Show/index.js";
22+import * as Data$dTraversable from "../Data.Traversable/index.js";
23+import * as Data$dTraversableWithIndex from "../Data.TraversableWithIndex/index.js";
24+import * as Data$dUnfoldable1 from "../Data.Unfoldable1/index.js";
25+import {foldl1Impl, foldr1Impl, traverse1Impl} from "./foreign.js";
26+const NonEmptyArray = x => x;
27+const unfoldable1NonEmptyArray = Data$dUnfoldable1.unfoldable1Array;
28+const traversableWithIndexNonEmptyArray = Data$dTraversableWithIndex.traversableWithIndexArray;
29+const traversableNonEmptyArray = Data$dTraversable.traversableArray;
30+const showNonEmptyArray = dictShow => {
31+ const show = Data$dShow.showArrayImpl(dictShow.show);
32+ return {show: v => "(NonEmptyArray " + (show(v) + ")")};
33+};
34+const semigroupNonEmptyArray = Data$dSemigroup.semigroupArray;
35+const ordNonEmptyArray = dictOrd => Data$dOrd.ordArray(dictOrd);
36+const ord1NonEmptyArray = Data$dOrd.ord1Array;
37+const monadNonEmptyArray = Control$dMonad.monadArray;
38+const functorWithIndexNonEmptyArray = Data$dFunctorWithIndex.functorWithIndexArray;
39+const functorNonEmptyArray = Data$dFunctor.functorArray;
40+const foldableWithIndexNonEmptyArray = Data$dFoldableWithIndex.foldableWithIndexArray;
41+const foldableNonEmptyArray = Data$dFoldable.foldableArray;
42+const foldable1NonEmptyArray = {
43+ foldMap1: dictSemigroup => f => {
44+ const $2 = Data$dFunctor.arrayMap(f);
45+ const $3 = foldable1NonEmptyArray.foldl1(dictSemigroup.append);
46+ return x => $3($2(x));
47+ },
48+ foldr1: foldr1Impl,
49+ foldl1: foldl1Impl,
50+ Foldable0: () => Data$dFoldable.foldableArray
51+};
52+const traversable1NonEmptyArray = {
53+ traverse1: dictApply => traverse1Impl(dictApply.apply)(dictApply.Functor0().map),
54+ sequence1: dictApply => traversable1NonEmptyArray.traverse1(dictApply)(Data$dSemigroup$dTraversable.identity),
55+ Foldable10: () => foldable1NonEmptyArray,
56+ Traversable1: () => Data$dTraversable.traversableArray
57+};
58+const eqNonEmptyArray = dictEq => ({eq: Data$dEq.eqArrayImpl(dictEq.eq)});
59+const eq1NonEmptyArray = Data$dEq.eq1Array;
60+const bindNonEmptyArray = Control$dBind.bindArray;
61+const applyNonEmptyArray = Control$dApply.applyArray;
62+const applicativeNonEmptyArray = Control$dApplicative.applicativeArray;
63+const altNonEmptyArray = Control$dAlt.altArray;
64+export {
65+ NonEmptyArray,
66+ altNonEmptyArray,
67+ applicativeNonEmptyArray,
68+ applyNonEmptyArray,
69+ bindNonEmptyArray,
70+ eq1NonEmptyArray,
71+ eqNonEmptyArray,
72+ foldable1NonEmptyArray,
73+ foldableNonEmptyArray,
74+ foldableWithIndexNonEmptyArray,
75+ functorNonEmptyArray,
76+ functorWithIndexNonEmptyArray,
77+ monadNonEmptyArray,
78+ ord1NonEmptyArray,
79+ ordNonEmptyArray,
80+ semigroupNonEmptyArray,
81+ showNonEmptyArray,
82+ traversable1NonEmptyArray,
83+ traversableNonEmptyArray,
84+ traversableWithIndexNonEmptyArray,
85+ unfoldable1NonEmptyArray
86+};
87+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Array.NonEmpty/index.jsnew file+303
@@ -0,0 +1,303 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dBind from "../Control.Bind/index.js";
3+import * as Control$dMonad$dST$dInternal from "../Control.Monad.ST.Internal/index.js";
4+import * as Data$dArray from "../Data.Array/index.js";
5+import * as Data$dArray$dNonEmpty$dInternal from "../Data.Array.NonEmpty.Internal/index.js";
6+import * as Data$dArray$dST from "../Data.Array.ST/index.js";
7+import * as Data$dFoldable from "../Data.Foldable/index.js";
8+import * as Data$dFunctor from "../Data.Functor/index.js";
9+import * as Data$dMaybe from "../Data.Maybe/index.js";
10+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
11+import * as Data$dOrd from "../Data.Ord/index.js";
12+import * as Data$dSemigroup from "../Data.Semigroup/index.js";
13+import * as Data$dSemigroup$dFoldable from "../Data.Semigroup.Foldable/index.js";
14+import * as Data$dTuple from "../Data.Tuple/index.js";
15+const max = x => y => {
16+ const v = Data$dOrd.ordInt.compare(x)(y);
17+ if (v.tag === "LT") { return y; }
18+ if (v.tag === "EQ") { return x; }
19+ if (v.tag === "GT") { return x; }
20+ $runtime.fail();
21+};
22+const intercalate1 = dictSemigroup => {
23+ const foldMap12 = Data$dArray$dNonEmpty$dInternal.foldable1NonEmptyArray.foldMap1({append: v => v1 => j => dictSemigroup.append(v(j))(dictSemigroup.append(j)(v1(j)))});
24+ return a => foldable => foldMap12(x => v => x)(foldable)(a);
25+};
26+const transpose = x => Data$dArray.transpose(x);
27+const toArray = v => v;
28+const unionBy$p = eq => xs => x => Data$dArray.unionBy(eq)(xs)(x);
29+const union$p = dictEq => unionBy$p(dictEq.eq);
30+const unionBy = eq => xs => x => Data$dArray.unionBy(eq)(xs)(x);
31+const union = dictEq => unionBy(dictEq.eq);
32+const unzip = x => {
33+ const $1 = Data$dArray.unzip(x);
34+ return Data$dTuple.$Tuple($1._1, $1._2);
35+};
36+const updateAt = i => x => Data$dArray.updateAt(i)(x);
37+const zip = xs => ys => Data$dArray.zip(xs)(ys);
38+const zipWith = f => xs => ys => Data$dArray.zipWith(f)(xs)(ys);
39+const zipWithA = dictApplicative => Data$dArray.zipWithA(dictApplicative);
40+const splitAt = i => xs => Data$dArray.splitAt(i)(xs);
41+const some = dictAlternative => Data$dArray.some(dictAlternative);
42+const snoc$p = xs => x => Control$dMonad$dST$dInternal.run(Data$dArray$dST.withArray(Data$dArray$dST.pushAll([x]))(xs));
43+const snoc = xs => x => Control$dMonad$dST$dInternal.run(Data$dArray$dST.withArray(Data$dArray$dST.pushAll([x]))(xs));
44+const singleton = x => [x];
45+const replicate = i => x => Data$dArray.replicate(max(1)(i))(x);
46+const range = x => y => Data$dArray.range(x)(y);
47+const modifyAt = i => f => x => Data$dArray.modifyAt(i)(f)(x);
48+const intersectBy$p = eq => xs => Data$dArray.intersectBy(eq)(xs);
49+const intersectBy = eq => xs => x => Data$dArray.intersectBy(eq)(xs)(x);
50+const intersect$p = dictEq => intersectBy$p(dictEq.eq);
51+const intersect = dictEq => intersectBy(dictEq.eq);
52+const intercalate = dictSemigroup => intercalate1(dictSemigroup);
53+const insertAt = i => x => Data$dArray.insertAt(i)(x);
54+const fromFoldable1 = dictFoldable1 => Data$dArray.fromFoldableImpl(dictFoldable1.Foldable0().foldr);
55+const fromArray = xs => {
56+ if (xs.length > 0) { return Data$dMaybe.$Maybe("Just", xs); }
57+ return Data$dMaybe.Nothing;
58+};
59+const fromFoldable = dictFoldable => {
60+ const $1 = Data$dArray.fromFoldableImpl(dictFoldable.foldr);
61+ return x => {
62+ const $3 = $1(x);
63+ if ($3.length > 0) { return Data$dMaybe.$Maybe("Just", $3); }
64+ return Data$dMaybe.Nothing;
65+ };
66+};
67+const transpose$p = x => {
68+ const $1 = Data$dArray.transpose(x);
69+ if ($1.length > 0) { return Data$dMaybe.$Maybe("Just", $1); }
70+ return Data$dMaybe.Nothing;
71+};
72+const foldr1 = Data$dArray$dNonEmpty$dInternal.foldr1Impl;
73+const foldl1 = Data$dArray$dNonEmpty$dInternal.foldl1Impl;
74+const foldMap1 = dictSemigroup => Data$dArray$dNonEmpty$dInternal.foldable1NonEmptyArray.foldMap1(dictSemigroup);
75+const fold1 = dictSemigroup => Data$dArray$dNonEmpty$dInternal.foldable1NonEmptyArray.foldMap1(dictSemigroup)(Data$dSemigroup$dFoldable.identity);
76+const difference$p = dictEq => Data$dFoldable.foldrArray(Data$dArray.delete(dictEq));
77+const cons$p = x => xs => Data$dSemigroup.concatArray([x])(xs);
78+const fromNonEmpty = v => Data$dSemigroup.concatArray([v._1])(v._2);
79+const concatMap = b => a => Control$dBind.arrayBind(a)(b);
80+const concat = /* #__PURE__ */ (() => {
81+ const $0 = Data$dFunctor.arrayMap(toArray);
82+ return x => Data$dArray.concat($0(x));
83+})();
84+const appendArray = xs => ys => Data$dSemigroup.concatArray(xs)(ys);
85+const alterAt = i => f => x => Data$dArray.alterAt(i)(f)(x);
86+const head = x => {
87+ const $1 = Data$dArray.index(x)(0);
88+ if ($1.tag === "Just") { return $1._1; }
89+ $runtime.fail();
90+};
91+const init = x => {
92+ const $1 = Data$dArray.init(x);
93+ if ($1.tag === "Just") { return $1._1; }
94+ $runtime.fail();
95+};
96+const last = x => {
97+ const $1 = Data$dArray.index(x)(x.length - 1 | 0);
98+ if ($1.tag === "Just") { return $1._1; }
99+ $runtime.fail();
100+};
101+const tail = x => {
102+ const $1 = Data$dArray.tail(x);
103+ if ($1.tag === "Just") { return $1._1; }
104+ $runtime.fail();
105+};
106+const uncons = x => {
107+ const $1 = Data$dArray.uncons(x);
108+ if ($1.tag === "Just") { return $1._1; }
109+ $runtime.fail();
110+};
111+const toNonEmpty = x => {
112+ const $1 = Data$dArray.uncons(x);
113+ const $2 = (() => {
114+ if ($1.tag === "Just") { return $1._1; }
115+ $runtime.fail();
116+ })();
117+ return Data$dNonEmpty.$NonEmpty($2.head, $2.tail);
118+};
119+const unsnoc = x => {
120+ const $1 = Data$dArray.unsnoc(x);
121+ if ($1.tag === "Just") { return $1._1; }
122+ $runtime.fail();
123+};
124+const all = p => Data$dArray.all(p);
125+const any = p => Data$dArray.any(p);
126+const catMaybes = x => Data$dArray.mapMaybe(x$1 => x$1)(x);
127+const $$delete = dictEq => x => x$1 => Data$dArray.deleteBy(dictEq.eq)(x)(x$1);
128+const deleteAt = i => Data$dArray.deleteAt(i);
129+const deleteBy = f => x => x$1 => Data$dArray.deleteBy(f)(x)(x$1);
130+const difference = dictEq => Data$dFoldable.foldrArray(Data$dArray.delete(dictEq));
131+const drop = i => x => {
132+ if (i < 1) { return x; }
133+ return Data$dArray.slice(i)(x.length)(x);
134+};
135+const dropEnd = i => x => Data$dArray.dropEnd(i)(x);
136+const dropWhile = f => x => Data$dArray.span(f)(x).rest;
137+const elem = dictEq => x => x$1 => Data$dArray.elem(dictEq)(x)(x$1);
138+const elemIndex = dictEq => x => Data$dArray.findIndex(v => dictEq.eq(v)(x));
139+const elemLastIndex = dictEq => x => Data$dArray.findLastIndex(v => dictEq.eq(v)(x));
140+const filter = f => Data$dArray.filter(f);
141+const filterA = dictApplicative => Data$dArray.filterA(dictApplicative);
142+const find = p => x => {
143+ const $2 = Data$dArray.findIndex(p)(x);
144+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", x[$2._1]); }
145+ return Data$dMaybe.Nothing;
146+};
147+const findIndex = p => Data$dArray.findIndex(p);
148+const findLastIndex = x => Data$dArray.findLastIndex(x);
149+const findMap = p => Data$dArray.findMap(p);
150+const foldM = dictMonad => Data$dArray.foldM(dictMonad);
151+const foldRecM = dictMonadRec => Data$dArray.foldRecM(dictMonadRec);
152+const index = x => Data$dArray.index(x);
153+const length = x => x.length;
154+const mapMaybe = f => x => Data$dArray.mapMaybe(f)(x);
155+const notElem = dictEq => x => x$1 => Data$dArray.notElem(dictEq)(x)(x$1);
156+const partition = f => Data$dArray.partition(f);
157+const slice = start => end => Data$dArray.slice(start)(end);
158+const span = f => x => Data$dArray.span(f)(x);
159+const take = i => x => {
160+ if (i < 1) { return []; }
161+ return Data$dArray.slice(0)(i)(x);
162+};
163+const takeEnd = i => x => Data$dArray.takeEnd(i)(x);
164+const takeWhile = f => x => Data$dArray.span(f)(x).init;
165+const toUnfoldable = dictUnfoldable => x => Data$dArray.toUnfoldable(dictUnfoldable)(x);
166+const cons = x => x$1 => Data$dSemigroup.concatArray([x])(x$1);
167+const group = dictEq => x => Data$dArray.groupBy(dictEq.eq)(x);
168+const groupAllBy = op => Data$dArray.groupAllBy(op);
169+const groupAll = dictOrd => Data$dArray.groupAllBy(dictOrd.compare);
170+const groupBy = op => x => Data$dArray.groupBy(op)(x);
171+const insert = dictOrd => x => x$1 => Data$dArray.insertBy(dictOrd.compare)(x)(x$1);
172+const insertBy = f => x => x$1 => Data$dArray.insertBy(f)(x)(x$1);
173+const intersperse = x => x$1 => Data$dArray.intersperse(x)(x$1);
174+const mapWithIndex = f => x => Data$dArray.zipWith(f)(Data$dArray.range(0)(x.length - 1 | 0))(x);
175+const modifyAtIndices = dictFoldable => Data$dArray.modifyAtIndices(dictFoldable);
176+const nub = dictOrd => x => Data$dArray.nubBy(dictOrd.compare)(x);
177+const nubBy = f => x => Data$dArray.nubBy(f)(x);
178+const nubByEq = f => x => Data$dArray.nubByEq(f)(x);
179+const nubEq = dictEq => x => Data$dArray.nubByEq(dictEq.eq)(x);
180+const reverse = x => Data$dArray.reverse(x);
181+const scanl = f => x => Data$dArray.scanl(f)(x);
182+const scanr = f => x => Data$dArray.scanr(f)(x);
183+const sort = dictOrd => x => Data$dArray.sortBy(dictOrd.compare)(x);
184+const sortBy = f => Data$dArray.sortBy(f);
185+const sortWith = dictOrd => f => Data$dArray.sortWith(dictOrd)(f);
186+const updateAtIndices = dictFoldable => Data$dArray.updateAtIndices(dictFoldable);
187+const unsafeIndex = () => x => $2 => x[$2];
188+const toUnfoldable1 = dictUnfoldable1 => xs => {
189+ const len = xs.length;
190+ return dictUnfoldable1.unfoldr1(i => Data$dTuple.$Tuple(
191+ xs[i],
192+ (() => {
193+ if (i < (len - 1 | 0)) { return Data$dMaybe.$Maybe("Just", i + 1 | 0); }
194+ return Data$dMaybe.Nothing;
195+ })()
196+ ))(0);
197+};
198+export {
199+ all,
200+ alterAt,
201+ any,
202+ appendArray,
203+ catMaybes,
204+ concat,
205+ concatMap,
206+ cons,
207+ cons$p,
208+ $$delete as delete,
209+ deleteAt,
210+ deleteBy,
211+ difference,
212+ difference$p,
213+ drop,
214+ dropEnd,
215+ dropWhile,
216+ elem,
217+ elemIndex,
218+ elemLastIndex,
219+ filter,
220+ filterA,
221+ find,
222+ findIndex,
223+ findLastIndex,
224+ findMap,
225+ fold1,
226+ foldM,
227+ foldMap1,
228+ foldRecM,
229+ foldl1,
230+ foldr1,
231+ fromArray,
232+ fromFoldable,
233+ fromFoldable1,
234+ fromNonEmpty,
235+ group,
236+ groupAll,
237+ groupAllBy,
238+ groupBy,
239+ head,
240+ index,
241+ init,
242+ insert,
243+ insertAt,
244+ insertBy,
245+ intercalate,
246+ intercalate1,
247+ intersect,
248+ intersect$p,
249+ intersectBy,
250+ intersectBy$p,
251+ intersperse,
252+ last,
253+ length,
254+ mapMaybe,
255+ mapWithIndex,
256+ max,
257+ modifyAt,
258+ modifyAtIndices,
259+ notElem,
260+ nub,
261+ nubBy,
262+ nubByEq,
263+ nubEq,
264+ partition,
265+ range,
266+ replicate,
267+ reverse,
268+ scanl,
269+ scanr,
270+ singleton,
271+ slice,
272+ snoc,
273+ snoc$p,
274+ some,
275+ sort,
276+ sortBy,
277+ sortWith,
278+ span,
279+ splitAt,
280+ tail,
281+ take,
282+ takeEnd,
283+ takeWhile,
284+ toArray,
285+ toNonEmpty,
286+ toUnfoldable,
287+ toUnfoldable1,
288+ transpose,
289+ transpose$p,
290+ uncons,
291+ union,
292+ union$p,
293+ unionBy,
294+ unionBy$p,
295+ unsafeIndex,
296+ unsnoc,
297+ unzip,
298+ updateAt,
299+ updateAtIndices,
300+ zip,
301+ zipWith,
302+ zipWithA
303+};
.storybook/purescript-indexer/output-es/Data.Array.Partial/index.jsnew file+8
@@ -0,0 +1,8 @@
1+// | Partial helper functions for working with immutable arrays.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dArray from "../Data.Array/index.js";
4+const tail = () => xs => Data$dArray.slice(1)(xs.length)(xs);
5+const last = () => xs => xs[(xs.length - 1 | 0)];
6+const init = () => xs => Data$dArray.slice(0)(xs.length - 1 | 0)(xs);
7+const head = () => xs => xs[0];
8+export {head, init, last, tail};
.storybook/purescript-indexer/output-es/Data.Array.ST.Iterator/index.jsnew file+74
@@ -0,0 +1,74 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dST$dInternal from "../Control.Monad.ST.Internal/index.js";
3+import * as Data$dArray$dST from "../Data.Array.ST/index.js";
4+import * as Data$dMaybe from "../Data.Maybe/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+const $Iterator = (_1, _2) => ({tag: "Iterator", _1, _2});
7+const Iterator = value0 => value1 => $Iterator(value0, value1);
8+const peek = v => () => {
9+ const i = v._2.value;
10+ return v._1(i);
11+};
12+const next = v => () => {
13+ const i = v._2.value;
14+ const $2 = v._2.value;
15+ v._2.value = $2 + 1 | 0;
16+ return v._1(i);
17+};
18+const pushWhile = p => iter => array => () => {
19+ const $$break = {value: false};
20+ return Control$dMonad$dST$dInternal.while(() => {
21+ const $4 = $$break.value;
22+ return !$4;
23+ })(() => {
24+ const i = iter._2.value;
25+ const mx = iter._1(i);
26+ if (mx.tag === "Just") {
27+ if (p(mx._1)) {
28+ Data$dArray$dST.pushAll([mx._1])(array)();
29+ iter._2.value;
30+ const $8 = iter._2.value;
31+ iter._2.value = $8 + 1 | 0;
32+ return Data$dUnit.unit;
33+ }
34+ $$break.value = true;
35+ return Data$dUnit.unit;
36+ }
37+ $$break.value = true;
38+ return Data$dUnit.unit;
39+ })();
40+};
41+const pushAll = /* #__PURE__ */ pushWhile(v => true);
42+const iterator = f => {
43+ const $1 = Iterator(f);
44+ return () => {
45+ const $2 = {value: 0};
46+ return $1($2);
47+ };
48+};
49+const iterate = iter => f => () => {
50+ const $$break = {value: false};
51+ return Control$dMonad$dST$dInternal.while(() => {
52+ const $3 = $$break.value;
53+ return !$3;
54+ })(() => {
55+ const i = iter._2.value;
56+ const $4 = iter._2.value;
57+ iter._2.value = $4 + 1 | 0;
58+ const mx = iter._1(i);
59+ if (mx.tag === "Just") { return f(mx._1)(); }
60+ if (mx.tag === "Nothing") {
61+ $$break.value = true;
62+ return Data$dUnit.unit;
63+ }
64+ $runtime.fail();
65+ })();
66+};
67+const exhausted = /* #__PURE__ */ (() => {
68+ const $0 = Control$dMonad$dST$dInternal.map_(Data$dMaybe.isNothing);
69+ return x => $0(() => {
70+ const i = x._2.value;
71+ return x._1(i);
72+ });
73+})();
74+export {$Iterator, Iterator, exhausted, iterate, iterator, next, peek, pushAll, pushWhile};
.storybook/purescript-indexer/output-es/Data.Array.ST.Partial/foreign.jsnew file+17
@@ -0,0 +1,17 @@
1+export const peekImpl = function (i) {
2+ return function (xs) {
3+ return function () {
4+ return xs[i];
5+ };
6+ };
7+};
8+
9+export const pokeImpl = function (i) {
10+ return function (a) {
11+ return function (xs) {
12+ return function () {
13+ xs[i] = a;
14+ };
15+ };
16+ };
17+};
.storybook/purescript-indexer/output-es/Data.Array.ST.Partial/index.jsnew file+9
@@ -0,0 +1,9 @@
1+// | Partial functions for working with mutable arrays using the `ST` effect.
2+// |
3+// | This module is particularly helpful when performance is very important.
4+import * as $runtime from "../runtime.js";
5+import {peekImpl, pokeImpl} from "./foreign.js";
6+const poke = () => pokeImpl;
7+const peek = () => peekImpl;
8+export {peek, poke};
9+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Array.ST/foreign.jsnew file+160
@@ -0,0 +1,160 @@
1+function newSTArray () {
2+ return [];
3+}
4+export { newSTArray as new };
5+
6+export const peekImpl = function (just) {
7+ return function (nothing) {
8+ return function (i) {
9+ return function (xs) {
10+ return function () {
11+ return i >= 0 && i < xs.length ? just(xs[i]) : nothing;
12+ };
13+ };
14+ };
15+ };
16+};
17+
18+export const poke = function (i) {
19+ return function (a) {
20+ return function (xs) {
21+ return function () {
22+ var ret = i >= 0 && i < xs.length;
23+ if (ret) xs[i] = a;
24+ return ret;
25+ };
26+ };
27+ };
28+};
29+
30+export const popImpl = function (just) {
31+ return function (nothing) {
32+ return function (xs) {
33+ return function () {
34+ return xs.length > 0 ? just(xs.pop()) : nothing;
35+ };
36+ };
37+ };
38+};
39+
40+export const pushAll = function (as) {
41+ return function (xs) {
42+ return function () {
43+ return xs.push.apply(xs, as);
44+ };
45+ };
46+};
47+
48+export const shiftImpl = function (just) {
49+ return function (nothing) {
50+ return function (xs) {
51+ return function () {
52+ return xs.length > 0 ? just(xs.shift()) : nothing;
53+ };
54+ };
55+ };
56+};
57+
58+export const unshiftAll = function (as) {
59+ return function (xs) {
60+ return function () {
61+ return xs.unshift.apply(xs, as);
62+ };
63+ };
64+};
65+
66+export const splice = function (i) {
67+ return function (howMany) {
68+ return function (bs) {
69+ return function (xs) {
70+ return function () {
71+ return xs.splice.apply(xs, [i, howMany].concat(bs));
72+ };
73+ };
74+ };
75+ };
76+};
77+
78+export const unsafeFreeze = function (xs) {
79+ return function () {
80+ return xs;
81+ };
82+};
83+
84+export const unsafeThaw = function (xs) {
85+ return function () {
86+ return xs;
87+ };
88+};
89+
90+function copyImpl(xs) {
91+ return function () {
92+ return xs.slice();
93+ };
94+}
95+
96+export const freeze = copyImpl;
97+
98+export const thaw = copyImpl;
99+
100+export const sortByImpl = (function () {
101+ function mergeFromTo(compare, fromOrdering, xs1, xs2, from, to) {
102+ var mid;
103+ var i;
104+ var j;
105+ var k;
106+ var x;
107+ var y;
108+ var c;
109+
110+ mid = from + ((to - from) >> 1);
111+ if (mid - from > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, from, mid);
112+ if (to - mid > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, mid, to);
113+
114+ i = from;
115+ j = mid;
116+ k = from;
117+ while (i < mid && j < to) {
118+ x = xs2[i];
119+ y = xs2[j];
120+ c = fromOrdering(compare(x)(y));
121+ if (c > 0) {
122+ xs1[k++] = y;
123+ ++j;
124+ }
125+ else {
126+ xs1[k++] = x;
127+ ++i;
128+ }
129+ }
130+ while (i < mid) {
131+ xs1[k++] = xs2[i++];
132+ }
133+ while (j < to) {
134+ xs1[k++] = xs2[j++];
135+ }
136+ }
137+
138+ return function (compare) {
139+ return function (fromOrdering) {
140+ return function (xs) {
141+ return function () {
142+ if (xs.length < 2) return xs;
143+
144+ mergeFromTo(compare, fromOrdering, xs, xs.slice(0), 0, xs.length);
145+
146+ return xs;
147+ };
148+ };
149+ };
150+ };
151+})();
152+
153+export const toAssocArray = function (xs) {
154+ return function () {
155+ var n = xs.length;
156+ var as = new Array(n);
157+ for (var i = 0; i < n; i++) as[i] = { value: xs[i], index: i };
158+ return as;
159+ };
160+};
.storybook/purescript-indexer/output-es/Data.Array.ST/index.jsnew file+40
@@ -0,0 +1,40 @@
1+// | Helper functions for working with mutable arrays using the `ST` effect.
2+// |
3+// | This module can be used when performance is important and mutation is a local effect.
4+import * as $runtime from "../runtime.js";
5+import * as Control$dMonad$dST$dInternal from "../Control.Monad.ST.Internal/index.js";
6+import * as Data$dMaybe from "../Data.Maybe/index.js";
7+import {freeze, new as $$new, peekImpl, poke, popImpl, pushAll, shiftImpl, sortByImpl, splice, thaw, toAssocArray, unsafeFreeze, unsafeThaw, unshiftAll} from "./foreign.js";
8+const withArray = f => xs => {
9+ const $2 = thaw(xs);
10+ return () => {
11+ const result = $2();
12+ f(result)();
13+ return unsafeFreeze(result)();
14+ };
15+};
16+const unshift = a => unshiftAll([a]);
17+const sortBy = comp => sortByImpl(comp)(v => {
18+ if (v.tag === "GT") { return 1; }
19+ if (v.tag === "EQ") { return 0; }
20+ if (v.tag === "LT") { return -1; }
21+ $runtime.fail();
22+});
23+const sortWith = dictOrd => f => sortBy(x => y => dictOrd.compare(f(x))(f(y)));
24+const sort = dictOrd => sortBy(dictOrd.compare);
25+const shift = /* #__PURE__ */ shiftImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
26+const run = st => Control$dMonad$dST$dInternal.run(Control$dMonad$dST$dInternal.bind_(st)(unsafeFreeze));
27+const push = a => pushAll([a]);
28+const pop = /* #__PURE__ */ popImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
29+const peek = /* #__PURE__ */ peekImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
30+const modify = i => f => xs => {
31+ const $3 = peek(i)(xs);
32+ return () => {
33+ const entry = $3();
34+ if (entry.tag === "Just") { return poke(i)(f(entry._1))(xs)(); }
35+ if (entry.tag === "Nothing") { return false; }
36+ $runtime.fail();
37+ };
38+};
39+export {modify, peek, pop, push, run, shift, sort, sortBy, sortWith, unshift, withArray};
40+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Array/foreign.jsnew file+386
@@ -0,0 +1,386 @@
1+//------------------------------------------------------------------------------
2+// Array creation --------------------------------------------------------------
3+//------------------------------------------------------------------------------
4+
5+export const range = function (start) {
6+ return function (end) {
7+ var step = start > end ? -1 : 1;
8+ var result = new Array(step * (end - start) + 1);
9+ var i = start, n = 0;
10+ while (i !== end) {
11+ result[n++] = i;
12+ i += step;
13+ }
14+ result[n] = i;
15+ return result;
16+ };
17+};
18+
19+var replicateFill = function (count) {
20+ return function (value) {
21+ if (count < 1) {
22+ return [];
23+ }
24+ var result = new Array(count);
25+ return result.fill(value);
26+ };
27+};
28+
29+var replicatePolyfill = function (count) {
30+ return function (value) {
31+ var result = [];
32+ var n = 0;
33+ for (var i = 0; i < count; i++) {
34+ result[n++] = value;
35+ }
36+ return result;
37+ };
38+};
39+
40+// In browsers that have Array.prototype.fill we use it, as it's faster.
41+export const replicate = typeof Array.prototype.fill === "function" ? replicateFill : replicatePolyfill;
42+
43+export const fromFoldableImpl = (function () {
44+ function Cons(head, tail) {
45+ this.head = head;
46+ this.tail = tail;
47+ }
48+ var emptyList = {};
49+
50+ function curryCons(head) {
51+ return function (tail) {
52+ return new Cons(head, tail);
53+ };
54+ }
55+
56+ function listToArray(list) {
57+ var result = [];
58+ var count = 0;
59+ var xs = list;
60+ while (xs !== emptyList) {
61+ result[count++] = xs.head;
62+ xs = xs.tail;
63+ }
64+ return result;
65+ }
66+
67+ return function (foldr) {
68+ return function (xs) {
69+ return listToArray(foldr(curryCons)(emptyList)(xs));
70+ };
71+ };
72+})();
73+
74+//------------------------------------------------------------------------------
75+// Array size ------------------------------------------------------------------
76+//------------------------------------------------------------------------------
77+
78+export const length = function (xs) {
79+ return xs.length;
80+};
81+
82+//------------------------------------------------------------------------------
83+// Non-indexed reads -----------------------------------------------------------
84+//------------------------------------------------------------------------------
85+
86+export const unconsImpl = function (empty) {
87+ return function (next) {
88+ return function (xs) {
89+ return xs.length === 0 ? empty({}) : next(xs[0])(xs.slice(1));
90+ };
91+ };
92+};
93+
94+//------------------------------------------------------------------------------
95+// Indexed operations ----------------------------------------------------------
96+//------------------------------------------------------------------------------
97+
98+export const indexImpl = function (just) {
99+ return function (nothing) {
100+ return function (xs) {
101+ return function (i) {
102+ return i < 0 || i >= xs.length ? nothing : just(xs[i]);
103+ };
104+ };
105+ };
106+};
107+
108+export const findMapImpl = function (nothing) {
109+ return function (isJust) {
110+ return function (f) {
111+ return function (xs) {
112+ for (var i = 0; i < xs.length; i++) {
113+ var result = f(xs[i]);
114+ if (isJust(result)) return result;
115+ }
116+ return nothing;
117+ };
118+ };
119+ };
120+};
121+
122+export const findIndexImpl = function (just) {
123+ return function (nothing) {
124+ return function (f) {
125+ return function (xs) {
126+ for (var i = 0, l = xs.length; i < l; i++) {
127+ if (f(xs[i])) return just(i);
128+ }
129+ return nothing;
130+ };
131+ };
132+ };
133+};
134+
135+export const findLastIndexImpl = function (just) {
136+ return function (nothing) {
137+ return function (f) {
138+ return function (xs) {
139+ for (var i = xs.length - 1; i >= 0; i--) {
140+ if (f(xs[i])) return just(i);
141+ }
142+ return nothing;
143+ };
144+ };
145+ };
146+};
147+
148+export const _insertAt = function (just) {
149+ return function (nothing) {
150+ return function (i) {
151+ return function (a) {
152+ return function (l) {
153+ if (i < 0 || i > l.length) return nothing;
154+ var l1 = l.slice();
155+ l1.splice(i, 0, a);
156+ return just(l1);
157+ };
158+ };
159+ };
160+ };
161+};
162+
163+export const _deleteAt = function (just) {
164+ return function (nothing) {
165+ return function (i) {
166+ return function (l) {
167+ if (i < 0 || i >= l.length) return nothing;
168+ var l1 = l.slice();
169+ l1.splice(i, 1);
170+ return just(l1);
171+ };
172+ };
173+ };
174+};
175+
176+export const _updateAt = function (just) {
177+ return function (nothing) {
178+ return function (i) {
179+ return function (a) {
180+ return function (l) {
181+ if (i < 0 || i >= l.length) return nothing;
182+ var l1 = l.slice();
183+ l1[i] = a;
184+ return just(l1);
185+ };
186+ };
187+ };
188+ };
189+};
190+
191+//------------------------------------------------------------------------------
192+// Transformations -------------------------------------------------------------
193+//------------------------------------------------------------------------------
194+
195+export const reverse = function (l) {
196+ return l.slice().reverse();
197+};
198+
199+export const concat = function (xss) {
200+ if (xss.length <= 10000) {
201+ // This method is faster, but it crashes on big arrays.
202+ // So we use it when can and fallback to simple variant otherwise.
203+ return Array.prototype.concat.apply([], xss);
204+ }
205+
206+ var result = [];
207+ for (var i = 0, l = xss.length; i < l; i++) {
208+ var xs = xss[i];
209+ for (var j = 0, m = xs.length; j < m; j++) {
210+ result.push(xs[j]);
211+ }
212+ }
213+ return result;
214+};
215+
216+export const filter = function (f) {
217+ return function (xs) {
218+ return xs.filter(f);
219+ };
220+};
221+
222+export const partition = function (f) {
223+ return function (xs) {
224+ var yes = [];
225+ var no = [];
226+ for (var i = 0; i < xs.length; i++) {
227+ var x = xs[i];
228+ if (f(x))
229+ yes.push(x);
230+ else
231+ no.push(x);
232+ }
233+ return { yes: yes, no: no };
234+ };
235+};
236+
237+export const scanl = function (f) {
238+ return function (b) {
239+ return function (xs) {
240+ var len = xs.length;
241+ var acc = b;
242+ var out = new Array(len);
243+ for (var i = 0; i < len; i++) {
244+ acc = f(acc)(xs[i]);
245+ out[i] = acc;
246+ }
247+ return out;
248+ };
249+ };
250+};
251+
252+export const scanr = function (f) {
253+ return function (b) {
254+ return function (xs) {
255+ var len = xs.length;
256+ var acc = b;
257+ var out = new Array(len);
258+ for (var i = len - 1; i >= 0; i--) {
259+ acc = f(xs[i])(acc);
260+ out[i] = acc;
261+ }
262+ return out;
263+ };
264+ };
265+};
266+
267+//------------------------------------------------------------------------------
268+// Sorting ---------------------------------------------------------------------
269+//------------------------------------------------------------------------------
270+
271+export const sortByImpl = (function () {
272+ function mergeFromTo(compare, fromOrdering, xs1, xs2, from, to) {
273+ var mid;
274+ var i;
275+ var j;
276+ var k;
277+ var x;
278+ var y;
279+ var c;
280+
281+ mid = from + ((to - from) >> 1);
282+ if (mid - from > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, from, mid);
283+ if (to - mid > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, mid, to);
284+
285+ i = from;
286+ j = mid;
287+ k = from;
288+ while (i < mid && j < to) {
289+ x = xs2[i];
290+ y = xs2[j];
291+ c = fromOrdering(compare(x)(y));
292+ if (c > 0) {
293+ xs1[k++] = y;
294+ ++j;
295+ }
296+ else {
297+ xs1[k++] = x;
298+ ++i;
299+ }
300+ }
301+ while (i < mid) {
302+ xs1[k++] = xs2[i++];
303+ }
304+ while (j < to) {
305+ xs1[k++] = xs2[j++];
306+ }
307+ }
308+
309+ return function (compare) {
310+ return function (fromOrdering) {
311+ return function (xs) {
312+ var out;
313+
314+ if (xs.length < 2) return xs;
315+
316+ out = xs.slice(0);
317+ mergeFromTo(compare, fromOrdering, out, xs.slice(0), 0, xs.length);
318+
319+ return out;
320+ };
321+ };
322+ };
323+})();
324+
325+//------------------------------------------------------------------------------
326+// Subarrays -------------------------------------------------------------------
327+//------------------------------------------------------------------------------
328+
329+export const slice = function (s) {
330+ return function (e) {
331+ return function (l) {
332+ return l.slice(s, e);
333+ };
334+ };
335+};
336+
337+//------------------------------------------------------------------------------
338+// Zipping ---------------------------------------------------------------------
339+//------------------------------------------------------------------------------
340+
341+export const zipWith = function (f) {
342+ return function (xs) {
343+ return function (ys) {
344+ var l = xs.length < ys.length ? xs.length : ys.length;
345+ var result = new Array(l);
346+ for (var i = 0; i < l; i++) {
347+ result[i] = f(xs[i])(ys[i]);
348+ }
349+ return result;
350+ };
351+ };
352+};
353+
354+//------------------------------------------------------------------------------
355+// Folding ---------------------------------------------------------------------
356+//------------------------------------------------------------------------------
357+
358+export const any = function (p) {
359+ return function (xs) {
360+ var len = xs.length;
361+ for (var i = 0; i < len; i++) {
362+ if (p(xs[i])) return true;
363+ }
364+ return false;
365+ };
366+};
367+
368+export const all = function (p) {
369+ return function (xs) {
370+ var len = xs.length;
371+ for (var i = 0; i < len; i++) {
372+ if (!p(xs[i])) return false;
373+ }
374+ return true;
375+ };
376+};
377+
378+//------------------------------------------------------------------------------
379+// Partial ---------------------------------------------------------------------
380+//------------------------------------------------------------------------------
381+
382+export const unsafeIndexImpl = function (xs) {
383+ return function (n) {
384+ return xs[n];
385+ };
386+};
.storybook/purescript-indexer/output-es/Data.Array/index.jsnew file+519
@@ -0,0 +1,519 @@
1+// | Helper functions for working with immutable Javascript arrays.
2+// |
3+// | _Note_: Depending on your use-case, you may prefer to use `Data.List` or
4+// | `Data.Sequence` instead, which might give better performance for certain
5+// | use cases. This module is useful when integrating with JavaScript libraries
6+// | which use arrays, but immutable arrays are not a practical data structure
7+// | for many use cases due to their poor asymptotics.
8+// |
9+// | In addition to the functions in this module, Arrays have a number of
10+// | useful instances:
11+// |
12+// | * `Functor`, which provides `map :: forall a b. (a -> b) -> Array a ->
13+// | Array b`
14+// | * `Apply`, which provides `(<*>) :: forall a b. Array (a -> b) -> Array a
15+// | -> Array b`. This function works a bit like a Cartesian product; the
16+// | result array is constructed by applying each function in the first
17+// | array to each value in the second, so that the result array ends up with
18+// | a length equal to the product of the two arguments' lengths.
19+// | * `Bind`, which provides `(>>=) :: forall a b. (a -> Array b) -> Array a
20+// | -> Array b` (this is the same as `concatMap`).
21+// | * `Semigroup`, which provides `(<>) :: forall a. Array a -> Array a ->
22+// | Array a`, for concatenating arrays.
23+// | * `Foldable`, which provides a slew of functions for *folding* (also known
24+// | as *reducing*) arrays down to one value. For example,
25+// | `Data.Foldable.or` tests whether an array of `Boolean` values contains
26+// | at least one `true` value.
27+// | * `Traversable`, which provides the PureScript version of a for-loop,
28+// | allowing you to STAI.iterate over an array and accumulate effects.
29+// |
30+import * as $runtime from "../runtime.js";
31+import * as Control$dBind from "../Control.Bind/index.js";
32+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
33+import * as Control$dMonad$dST$dInternal from "../Control.Monad.ST.Internal/index.js";
34+import * as Data$dArray$dST from "../Data.Array.ST/index.js";
35+import * as Data$dArray$dST$dIterator from "../Data.Array.ST.Iterator/index.js";
36+import * as Data$dFoldable from "../Data.Foldable/index.js";
37+import * as Data$dFunctor from "../Data.Functor/index.js";
38+import * as Data$dMaybe from "../Data.Maybe/index.js";
39+import * as Data$dOrd from "../Data.Ord/index.js";
40+import * as Data$dSemigroup from "../Data.Semigroup/index.js";
41+import * as Data$dTraversable from "../Data.Traversable/index.js";
42+import * as Data$dTuple from "../Data.Tuple/index.js";
43+import * as Data$dUnit from "../Data.Unit/index.js";
44+import {
45+ _deleteAt,
46+ _insertAt,
47+ _updateAt,
48+ all,
49+ any,
50+ concat,
51+ filter,
52+ findIndexImpl,
53+ findLastIndexImpl,
54+ findMapImpl,
55+ fromFoldableImpl,
56+ indexImpl,
57+ length,
58+ partition,
59+ range,
60+ replicate,
61+ reverse,
62+ scanl,
63+ scanr,
64+ slice,
65+ sortByImpl,
66+ unconsImpl,
67+ unsafeIndexImpl,
68+ zipWith
69+} from "./foreign.js";
70+const traverse_ = /* #__PURE__ */ Data$dFoldable.traverse_(Control$dMonad$dST$dInternal.applicativeST);
71+const intercalate1 = dictMonoid => {
72+ const append = dictMonoid.Semigroup0().append;
73+ return sep => xs => Data$dFoldable.foldlArray(v => v1 => {
74+ if (v.init) { return {init: false, acc: v1}; }
75+ return {init: false, acc: append(v.acc)(append(sep)(v1))};
76+ })({init: true, acc: dictMonoid.mempty})(xs).acc;
77+};
78+const zipWithA = dictApplicative => {
79+ const sequence1 = Data$dTraversable.traversableArray.traverse(dictApplicative)(Data$dTraversable.identity);
80+ return f => xs => ys => sequence1(zipWith(f)(xs)(ys));
81+};
82+const zip = /* #__PURE__ */ zipWith(Data$dTuple.Tuple);
83+const updateAtIndices = dictFoldable => {
84+ const traverse_1 = traverse_(dictFoldable);
85+ return us => xs => Control$dMonad$dST$dInternal.run(Data$dArray$dST.withArray(res => traverse_1(v => Data$dArray$dST.poke(v._1)(v._2)(res))(us))(xs));
86+};
87+const updateAt = /* #__PURE__ */ _updateAt(Data$dMaybe.Just)(Data$dMaybe.Nothing);
88+const unsafeIndex = () => unsafeIndexImpl;
89+const uncons = /* #__PURE__ */ unconsImpl(v => Data$dMaybe.Nothing)(x => xs => Data$dMaybe.$Maybe("Just", {head: x, tail: xs}));
90+const toUnfoldable = dictUnfoldable => xs => {
91+ const len = xs.length;
92+ return dictUnfoldable.unfoldr(i => {
93+ if (i < len) { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(xs[i], i + 1 | 0)); }
94+ return Data$dMaybe.Nothing;
95+ })(0);
96+};
97+const take = n => xs => {
98+ if (n < 1) { return []; }
99+ return slice(0)(n)(xs);
100+};
101+const tail = /* #__PURE__ */ unconsImpl(v => Data$dMaybe.Nothing)(v => xs => Data$dMaybe.$Maybe("Just", xs));
102+const splitAt = v => v1 => {
103+ if (v <= 0) { return {before: [], after: v1}; }
104+ return {before: slice(0)(v)(v1), after: slice(v)(v1.length)(v1)};
105+};
106+const sortBy = comp => sortByImpl(comp)(v => {
107+ if (v.tag === "GT") { return 1; }
108+ if (v.tag === "EQ") { return 0; }
109+ if (v.tag === "LT") { return -1; }
110+ $runtime.fail();
111+});
112+const sortWith = dictOrd => f => sortBy(x => y => dictOrd.compare(f(x))(f(y)));
113+const sort = dictOrd => xs => sortBy(dictOrd.compare)(xs);
114+const snoc = xs => x => Control$dMonad$dST$dInternal.run(Data$dArray$dST.withArray(Data$dArray$dST.pushAll([x]))(xs));
115+const singleton = a => [a];
116+const $$null = xs => xs.length === 0;
117+const nubByEq = eq2 => xs => Control$dMonad$dST$dInternal.run(() => {
118+ const arr = Data$dArray$dST.new();
119+ Control$dMonad$dST$dInternal.foreach(xs)(x => {
120+ const $4 = any(v => eq2(v)(x));
121+ return () => {
122+ const $5 = Data$dArray$dST.unsafeFreeze(arr)();
123+ if (!$4($5)) {
124+ Data$dArray$dST.pushAll([x])(arr)();
125+ return Data$dUnit.unit;
126+ }
127+ return Data$dUnit.unit;
128+ };
129+ })();
130+ return Data$dArray$dST.unsafeFreeze(arr)();
131+});
132+const nubEq = dictEq => nubByEq(dictEq.eq);
133+const modifyAtIndices = dictFoldable => {
134+ const traverse_1 = traverse_(dictFoldable);
135+ return is => f => xs => Control$dMonad$dST$dInternal.run(Data$dArray$dST.withArray(res => traverse_1(i => Data$dArray$dST.modify(i)(f)(res))(is))(xs));
136+};
137+const mapWithIndex = f => xs => zipWith(f)(range(0)(xs.length - 1 | 0))(xs);
138+const intersperse = a => arr => {
139+ const v = arr.length;
140+ if (v < 2) { return arr; }
141+ return Control$dMonad$dST$dInternal.run(Control$dMonad$dST$dInternal.bind_(() => {
142+ const out = Data$dArray$dST.new();
143+ Data$dArray$dST.pushAll([arr[0]])(out)();
144+ Control$dMonad$dST$dInternal.for(1)(v)(idx => {
145+ const $6 = Data$dArray$dST.pushAll([a])(out);
146+ return () => {
147+ $6();
148+ Data$dArray$dST.pushAll([arr[idx]])(out)();
149+ return Data$dUnit.unit;
150+ };
151+ })();
152+ return out;
153+ })(Data$dArray$dST.unsafeFreeze));
154+};
155+const intercalate = dictMonoid => intercalate1(dictMonoid);
156+const insertAt = /* #__PURE__ */ _insertAt(Data$dMaybe.Just)(Data$dMaybe.Nothing);
157+const init = xs => {
158+ if (xs.length === 0) { return Data$dMaybe.Nothing; }
159+ return Data$dMaybe.$Maybe("Just", slice(0)(xs.length - 1 | 0)(xs));
160+};
161+const index = /* #__PURE__ */ indexImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
162+const last = xs => index(xs)(xs.length - 1 | 0);
163+const unsnoc = xs => Data$dMaybe.applyMaybe.apply((() => {
164+ const $1 = init(xs);
165+ if ($1.tag === "Just") { return Data$dMaybe.$Maybe("Just", v1 => ({init: $1._1, last: v1})); }
166+ return Data$dMaybe.Nothing;
167+})())(index(xs)(xs.length - 1 | 0));
168+const modifyAt = i => f => xs => {
169+ const $3 = index(xs)(i);
170+ if ($3.tag === "Nothing") { return Data$dMaybe.Nothing; }
171+ if ($3.tag === "Just") { return updateAt(i)(f($3._1))(xs); }
172+ $runtime.fail();
173+};
174+const span = p => arr => {
175+ const go = go$a0$copy => {
176+ let go$a0 = go$a0$copy, go$c = true, go$r;
177+ while (go$c) {
178+ const i = go$a0;
179+ const v = index(arr)(i);
180+ if (v.tag === "Just") {
181+ if (p(v._1)) {
182+ go$a0 = i + 1 | 0;
183+ continue;
184+ }
185+ go$c = false;
186+ go$r = Data$dMaybe.$Maybe("Just", i);
187+ continue;
188+ }
189+ if (v.tag === "Nothing") {
190+ go$c = false;
191+ go$r = Data$dMaybe.Nothing;
192+ continue;
193+ }
194+ $runtime.fail();
195+ };
196+ return go$r;
197+ };
198+ const breakIndex = go(0);
199+ if (breakIndex.tag === "Just") {
200+ if (breakIndex._1 === 0) { return {init: [], rest: arr}; }
201+ return {init: slice(0)(breakIndex._1)(arr), rest: slice(breakIndex._1)(arr.length)(arr)};
202+ }
203+ if (breakIndex.tag === "Nothing") { return {init: arr, rest: []}; }
204+ $runtime.fail();
205+};
206+const takeWhile = p => xs => span(p)(xs).init;
207+const unzip = xs => Control$dMonad$dST$dInternal.run(() => {
208+ const fsts = Data$dArray$dST.new();
209+ const snds = Data$dArray$dST.new();
210+ const $3 = {value: 0};
211+ Data$dArray$dST$dIterator.iterate(Data$dArray$dST$dIterator.$Iterator(v => index(xs)(v), $3))(v => () => {
212+ Data$dArray$dST.pushAll([v._1])(fsts)();
213+ Data$dArray$dST.pushAll([v._2])(snds)();
214+ return Data$dUnit.unit;
215+ })();
216+ const fsts$p = Data$dArray$dST.unsafeFreeze(fsts)();
217+ const snds$p = Data$dArray$dST.unsafeFreeze(snds)();
218+ return Data$dTuple.$Tuple(fsts$p, snds$p);
219+});
220+const head = xs => index(xs)(0);
221+const nubBy = comp => xs => {
222+ const indexedAndSorted = sortBy(x => y => comp(x._2)(y._2))(zipWith(Data$dTuple.Tuple)(range(0)(xs.length - 1 | 0))(xs));
223+ const v = index(indexedAndSorted)(0);
224+ if (v.tag === "Nothing") { return []; }
225+ if (v.tag === "Just") {
226+ return Data$dFunctor.arrayMap(Data$dTuple.snd)(sortWith(Data$dOrd.ordInt)(Data$dTuple.fst)(Control$dMonad$dST$dInternal.run((() => {
227+ const $4 = Data$dArray$dST.unsafeThaw([v._1]);
228+ return () => {
229+ const result = $4();
230+ Control$dMonad$dST$dInternal.foreach(indexedAndSorted)(v1 => () => {
231+ const $7 = Data$dArray$dST.unsafeFreeze(result)();
232+ const $8 = index($7)($7.length - 1 | 0);
233+ const $9 = comp((() => {
234+ if ($8.tag === "Just") { return $8._1._2; }
235+ $runtime.fail();
236+ })())(v1._2);
237+ if ($9.tag === "LT" || ($9.tag === "GT" || !($9.tag === "EQ"))) {
238+ Data$dArray$dST.pushAll([v1])(result)();
239+ return Data$dUnit.unit;
240+ }
241+ return Data$dUnit.unit;
242+ })();
243+ return Data$dArray$dST.unsafeFreeze(result)();
244+ };
245+ })())));
246+ }
247+ $runtime.fail();
248+};
249+const nub = dictOrd => nubBy(dictOrd.compare);
250+const groupBy = op => xs => Control$dMonad$dST$dInternal.run(() => {
251+ const result = Data$dArray$dST.new();
252+ const $3 = {value: 0};
253+ const iter = Data$dArray$dST$dIterator.$Iterator(v => index(xs)(v), $3);
254+ Data$dArray$dST$dIterator.iterate(iter)(x => () => {
255+ const sub1 = Data$dArray$dST.new();
256+ Data$dArray$dST.pushAll([x])(sub1)();
257+ Data$dArray$dST$dIterator.pushWhile(op(x))(iter)(sub1)();
258+ const grp = Data$dArray$dST.unsafeFreeze(sub1)();
259+ Data$dArray$dST.pushAll([grp])(result)();
260+ return Data$dUnit.unit;
261+ })();
262+ return Data$dArray$dST.unsafeFreeze(result)();
263+});
264+const groupAllBy = cmp => {
265+ const $1 = groupBy(x => y => cmp(x)(y).tag === "EQ");
266+ const $2 = sortBy(cmp);
267+ return x => $1($2(x));
268+};
269+const groupAll = dictOrd => groupAllBy(dictOrd.compare);
270+const group = dictEq => xs => groupBy(dictEq.eq)(xs);
271+const fromFoldable = dictFoldable => fromFoldableImpl(dictFoldable.foldr);
272+const foldr = Data$dFoldable.foldrArray;
273+const foldl = Data$dFoldable.foldlArray;
274+const transpose = xs => {
275+ const go = go$a0$copy => go$a1$copy => {
276+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
277+ while (go$c) {
278+ const idx = go$a0, allArrays = go$a1;
279+ const v = Data$dFoldable.foldlArray(acc => nextArr => {
280+ const $6 = index(nextArr)(idx);
281+ if ($6.tag === "Nothing") { return acc; }
282+ if ($6.tag === "Just") {
283+ return Data$dMaybe.$Maybe(
284+ "Just",
285+ (() => {
286+ if (acc.tag === "Nothing") { return [$6._1]; }
287+ if (acc.tag === "Just") { return Control$dMonad$dST$dInternal.run(Data$dArray$dST.withArray(Data$dArray$dST.pushAll([$6._1]))(acc._1)); }
288+ $runtime.fail();
289+ })()
290+ );
291+ }
292+ $runtime.fail();
293+ })(Data$dMaybe.Nothing)(xs);
294+ if (v.tag === "Nothing") {
295+ go$c = false;
296+ go$r = allArrays;
297+ continue;
298+ }
299+ if (v.tag === "Just") {
300+ go$a0 = idx + 1 | 0;
301+ go$a1 = Control$dMonad$dST$dInternal.run(Data$dArray$dST.withArray(Data$dArray$dST.pushAll([v._1]))(allArrays));
302+ continue;
303+ }
304+ $runtime.fail();
305+ };
306+ return go$r;
307+ };
308+ return go(0)([]);
309+};
310+const foldRecM = dictMonadRec => {
311+ const Monad0 = dictMonadRec.Monad0();
312+ const pure1 = Monad0.Applicative0().pure;
313+ const bind1 = Monad0.Bind1().bind;
314+ return f => b => array => dictMonadRec.tailRecM(o => {
315+ if (o.b >= array.length) { return pure1(Control$dMonad$dRec$dClass.$Step("Done", o.a)); }
316+ return bind1(f(o.a)(array[o.b]))(res$p => pure1(Control$dMonad$dRec$dClass.$Step("Loop", {a: res$p, b: o.b + 1 | 0})));
317+ })({a: b, b: 0});
318+};
319+const foldMap = dictMonoid => Data$dFoldable.foldableArray.foldMap(dictMonoid);
320+const foldM = dictMonad => {
321+ const pure1 = dictMonad.Applicative0().pure;
322+ const bind1 = dictMonad.Bind1().bind;
323+ return f => b => unconsImpl(v => pure1(b))(a => as => bind1(f(b)(a))(b$p => foldM(dictMonad)(f)(b$p)(as)));
324+};
325+const fold = dictMonoid => Data$dFoldable.foldableArray.foldMap(dictMonoid)(Data$dFoldable.identity);
326+const findMap = /* #__PURE__ */ findMapImpl(Data$dMaybe.Nothing)(Data$dMaybe.isJust);
327+const findLastIndex = /* #__PURE__ */ findLastIndexImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
328+const insertBy = cmp => x => ys => {
329+ const $3 = insertAt((() => {
330+ const $3 = findLastIndex(y => cmp(x)(y).tag === "GT")(ys);
331+ if ($3.tag === "Nothing") { return 0; }
332+ if ($3.tag === "Just") { return $3._1 + 1 | 0; }
333+ $runtime.fail();
334+ })())(x)(ys);
335+ if ($3.tag === "Just") { return $3._1; }
336+ $runtime.fail();
337+};
338+const insert = dictOrd => insertBy(dictOrd.compare);
339+const findIndex = /* #__PURE__ */ findIndexImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
340+const intersectBy = eq2 => xs => ys => filter(x => {
341+ const $4 = findIndex(eq2(x))(ys);
342+ if ($4.tag === "Nothing") { return false; }
343+ if ($4.tag === "Just") { return true; }
344+ $runtime.fail();
345+})(xs);
346+const intersect = dictEq => intersectBy(dictEq.eq);
347+const find = f => xs => {
348+ const $2 = findIndex(f)(xs);
349+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", xs[$2._1]); }
350+ return Data$dMaybe.Nothing;
351+};
352+const elemLastIndex = dictEq => x => findLastIndex(v => dictEq.eq(v)(x));
353+const elemIndex = dictEq => x => findIndex(v => dictEq.eq(v)(x));
354+const notElem = dictEq => a => arr => {
355+ const $3 = findIndex(v => dictEq.eq(v)(a))(arr);
356+ if ($3.tag === "Nothing") { return true; }
357+ if ($3.tag === "Just") { return false; }
358+ $runtime.fail();
359+};
360+const elem = dictEq => a => arr => {
361+ const $3 = findIndex(v => dictEq.eq(v)(a))(arr);
362+ if ($3.tag === "Nothing") { return false; }
363+ if ($3.tag === "Just") { return true; }
364+ $runtime.fail();
365+};
366+const dropWhile = p => xs => span(p)(xs).rest;
367+const dropEnd = n => xs => {
368+ const $2 = xs.length - n | 0;
369+ if ($2 < 1) { return []; }
370+ return slice(0)($2)(xs);
371+};
372+const drop = n => xs => {
373+ if (n < 1) { return xs; }
374+ return slice(n)(xs.length)(xs);
375+};
376+const takeEnd = n => xs => {
377+ const $2 = xs.length - n | 0;
378+ if ($2 < 1) { return xs; }
379+ return slice($2)(xs.length)(xs);
380+};
381+const deleteAt = /* #__PURE__ */ _deleteAt(Data$dMaybe.Just)(Data$dMaybe.Nothing);
382+const deleteBy = v => v1 => v2 => {
383+ if (v2.length === 0) { return []; }
384+ const $3 = findIndex(v(v1))(v2);
385+ if ($3.tag === "Nothing") { return v2; }
386+ if ($3.tag === "Just") {
387+ const $4 = deleteAt($3._1)(v2);
388+ if ($4.tag === "Just") { return $4._1; }
389+ $runtime.fail();
390+ }
391+ $runtime.fail();
392+};
393+const unionBy = eq2 => xs => ys => Data$dSemigroup.concatArray(xs)(Data$dFoldable.foldlArray(b => a => deleteBy(eq2)(a)(b))(nubByEq(eq2)(ys))(xs));
394+const union = dictEq => unionBy(dictEq.eq);
395+const $$delete = dictEq => deleteBy(dictEq.eq);
396+const difference = dictEq => Data$dFoldable.foldrArray($$delete(dictEq));
397+const cons = x => xs => Data$dSemigroup.concatArray([x])(xs);
398+const some = dictAlternative => {
399+ const apply1 = dictAlternative.Applicative0().Apply0().apply;
400+ const map3 = dictAlternative.Plus1().Alt0().Functor0().map;
401+ return dictLazy => v => apply1(map3(cons)(v))(dictLazy.defer(v1 => many(dictAlternative)(dictLazy)(v)));
402+};
403+const many = dictAlternative => {
404+ const alt = dictAlternative.Plus1().Alt0().alt;
405+ const pure1 = dictAlternative.Applicative0().pure;
406+ return dictLazy => v => alt(some(dictAlternative)(dictLazy)(v))(pure1([]));
407+};
408+const concatMap = b => a => Control$dBind.arrayBind(a)(b);
409+const mapMaybe = f => concatMap(x => {
410+ const $2 = f(x);
411+ if ($2.tag === "Nothing") { return []; }
412+ if ($2.tag === "Just") { return [$2._1]; }
413+ $runtime.fail();
414+});
415+const filterA = dictApplicative => {
416+ const traverse1 = Data$dTraversable.traversableArray.traverse(dictApplicative);
417+ const map3 = dictApplicative.Apply0().Functor0().map;
418+ return p => {
419+ const $4 = traverse1(x => map3(Data$dTuple.Tuple(x))(p(x)));
420+ const $5 = map3(mapMaybe(v => {
421+ if (v._2) { return Data$dMaybe.$Maybe("Just", v._1); }
422+ return Data$dMaybe.Nothing;
423+ }));
424+ return x => $5($4(x));
425+ };
426+};
427+const catMaybes = /* #__PURE__ */ mapMaybe(x => x);
428+const alterAt = i => f => xs => {
429+ const $3 = index(xs)(i);
430+ if ($3.tag === "Nothing") { return Data$dMaybe.Nothing; }
431+ if ($3.tag === "Just") {
432+ const v = f($3._1);
433+ if (v.tag === "Nothing") { return deleteAt(i)(xs); }
434+ if (v.tag === "Just") { return updateAt(i)(v._1)(xs); }
435+ $runtime.fail();
436+ }
437+ $runtime.fail();
438+};
439+export {
440+ alterAt,
441+ catMaybes,
442+ concatMap,
443+ cons,
444+ $$delete as delete,
445+ deleteAt,
446+ deleteBy,
447+ difference,
448+ drop,
449+ dropEnd,
450+ dropWhile,
451+ elem,
452+ elemIndex,
453+ elemLastIndex,
454+ filterA,
455+ find,
456+ findIndex,
457+ findLastIndex,
458+ findMap,
459+ fold,
460+ foldM,
461+ foldMap,
462+ foldRecM,
463+ foldl,
464+ foldr,
465+ fromFoldable,
466+ group,
467+ groupAll,
468+ groupAllBy,
469+ groupBy,
470+ head,
471+ index,
472+ init,
473+ insert,
474+ insertAt,
475+ insertBy,
476+ intercalate,
477+ intercalate1,
478+ intersect,
479+ intersectBy,
480+ intersperse,
481+ last,
482+ many,
483+ mapMaybe,
484+ mapWithIndex,
485+ modifyAt,
486+ modifyAtIndices,
487+ notElem,
488+ nub,
489+ nubBy,
490+ nubByEq,
491+ nubEq,
492+ $$null as null,
493+ singleton,
494+ snoc,
495+ some,
496+ sort,
497+ sortBy,
498+ sortWith,
499+ span,
500+ splitAt,
501+ tail,
502+ take,
503+ takeEnd,
504+ takeWhile,
505+ toUnfoldable,
506+ transpose,
507+ traverse_,
508+ uncons,
509+ union,
510+ unionBy,
511+ unsafeIndex,
512+ unsnoc,
513+ unzip,
514+ updateAt,
515+ updateAtIndices,
516+ zip,
517+ zipWithA
518+};
519+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.ArrayBuffer.Types/index.jsnew file+2
@@ -0,0 +1,2 @@
1+import * as $runtime from "../runtime.js";
2+export {};
.storybook/purescript-indexer/output-es/Data.Bifoldable/index.jsnew file+158
@@ -0,0 +1,158 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dApply from "../Control.Apply/index.js";
3+import * as Data$dUnit from "../Data.Unit/index.js";
4+const identity = x => x;
5+const monoidEndo = /* #__PURE__ */ (() => {
6+ const semigroupEndo1 = {append: v => v1 => x => v(v1(x))};
7+ return {mempty: x => x, Semigroup0: () => semigroupEndo1};
8+})();
9+const monoidDual = /* #__PURE__ */ (() => {
10+ const $0 = monoidEndo.Semigroup0();
11+ const semigroupDual1 = {append: v => v1 => $0.append(v1)(v)};
12+ return {mempty: monoidEndo.mempty, Semigroup0: () => semigroupDual1};
13+})();
14+const bifoldr = dict => dict.bifoldr;
15+const bitraverse_ = dictBifoldable => dictApplicative => {
16+ const $2 = dictApplicative.Apply0();
17+ const map = $2.Functor0().map;
18+ return f => g => dictBifoldable.bifoldr(x => {
19+ const $7 = f(x);
20+ return b => $2.apply(map(v => Control$dApply.identity)($7))(b);
21+ })(x => {
22+ const $7 = g(x);
23+ return b => $2.apply(map(v => Control$dApply.identity)($7))(b);
24+ })(dictApplicative.pure(Data$dUnit.unit));
25+};
26+const bifor_ = dictBifoldable => dictApplicative => {
27+ const bitraverse_2 = bitraverse_(dictBifoldable)(dictApplicative);
28+ return t => f => g => bitraverse_2(f)(g)(t);
29+};
30+const bisequence_ = dictBifoldable => dictApplicative => bitraverse_(dictBifoldable)(dictApplicative)(identity)(identity);
31+const bifoldl = dict => dict.bifoldl;
32+const bifoldableTuple = {
33+ bifoldMap: dictMonoid => {
34+ const append = dictMonoid.Semigroup0().append;
35+ return f => g => v => append(f(v._1))(g(v._2));
36+ },
37+ bifoldr: f => g => z => v => f(v._1)(g(v._2)(z)),
38+ bifoldl: f => g => z => v => g(f(z)(v._1))(v._2)
39+};
40+const bifoldableJoker = dictFoldable => (
41+ {
42+ bifoldr: v => r => u => v1 => dictFoldable.foldr(r)(u)(v1),
43+ bifoldl: v => r => u => v1 => dictFoldable.foldl(r)(u)(v1),
44+ bifoldMap: dictMonoid => {
45+ const foldMap1 = dictFoldable.foldMap(dictMonoid);
46+ return v => r => v1 => foldMap1(r)(v1);
47+ }
48+ }
49+);
50+const bifoldableEither = {
51+ bifoldr: v => v1 => v2 => v3 => {
52+ if (v3.tag === "Left") { return v(v3._1)(v2); }
53+ if (v3.tag === "Right") { return v1(v3._1)(v2); }
54+ $runtime.fail();
55+ },
56+ bifoldl: v => v1 => v2 => v3 => {
57+ if (v3.tag === "Left") { return v(v2)(v3._1); }
58+ if (v3.tag === "Right") { return v1(v2)(v3._1); }
59+ $runtime.fail();
60+ },
61+ bifoldMap: dictMonoid => v => v1 => v2 => {
62+ if (v2.tag === "Left") { return v(v2._1); }
63+ if (v2.tag === "Right") { return v1(v2._1); }
64+ $runtime.fail();
65+ }
66+};
67+const bifoldableConst = {bifoldr: f => v => z => v1 => f(v1)(z), bifoldl: f => v => z => v1 => f(z)(v1), bifoldMap: dictMonoid => f => v => v1 => f(v1)};
68+const bifoldableClown = dictFoldable => (
69+ {
70+ bifoldr: l => v => u => v1 => dictFoldable.foldr(l)(u)(v1),
71+ bifoldl: l => v => u => v1 => dictFoldable.foldl(l)(u)(v1),
72+ bifoldMap: dictMonoid => {
73+ const foldMap1 = dictFoldable.foldMap(dictMonoid);
74+ return l => v => v1 => foldMap1(l)(v1);
75+ }
76+ }
77+);
78+const bifoldMapDefaultR = dictBifoldable => dictMonoid => {
79+ const append = dictMonoid.Semigroup0().append;
80+ return f => g => dictBifoldable.bifoldr(x => append(f(x)))(x => append(g(x)))(dictMonoid.mempty);
81+};
82+const bifoldMapDefaultL = dictBifoldable => dictMonoid => {
83+ const append = dictMonoid.Semigroup0().append;
84+ return f => g => dictBifoldable.bifoldl(m => a => append(m)(f(a)))(m => b => append(m)(g(b)))(dictMonoid.mempty);
85+};
86+const bifoldMap = dict => dict.bifoldMap;
87+const bifoldableFlip = dictBifoldable => (
88+ {
89+ bifoldr: r => l => u => v => dictBifoldable.bifoldr(l)(r)(u)(v),
90+ bifoldl: r => l => u => v => dictBifoldable.bifoldl(l)(r)(u)(v),
91+ bifoldMap: dictMonoid => {
92+ const bifoldMap2 = dictBifoldable.bifoldMap(dictMonoid);
93+ return r => l => v => bifoldMap2(l)(r)(v);
94+ }
95+ }
96+);
97+const bifoldlDefault = dictBifoldable => {
98+ const bifoldMap1 = dictBifoldable.bifoldMap(monoidDual);
99+ return f => g => z => p => bifoldMap1(x => a => f(a)(x))(x => a => g(a)(x))(p)(z);
100+};
101+const bifoldrDefault = dictBifoldable => {
102+ const bifoldMap1 = dictBifoldable.bifoldMap(monoidEndo);
103+ return f => g => z => p => bifoldMap1(x => f(x))(x => g(x))(p)(z);
104+};
105+const bifoldableProduct2 = dictBifoldable => dictBifoldable1 => (
106+ {
107+ bifoldr: l => r => u => m => bifoldrDefault(bifoldableProduct2(dictBifoldable)(dictBifoldable1))(l)(r)(u)(m),
108+ bifoldl: l => r => u => m => bifoldlDefault(bifoldableProduct2(dictBifoldable)(dictBifoldable1))(l)(r)(u)(m),
109+ bifoldMap: dictMonoid => {
110+ const append = dictMonoid.Semigroup0().append;
111+ const bifoldMap3 = dictBifoldable.bifoldMap(dictMonoid);
112+ const bifoldMap4 = dictBifoldable1.bifoldMap(dictMonoid);
113+ return l => r => v => append(bifoldMap3(l)(r)(v._1))(bifoldMap4(l)(r)(v._2));
114+ }
115+ }
116+);
117+const bifold = dictBifoldable => dictMonoid => dictBifoldable.bifoldMap(dictMonoid)(identity)(identity);
118+const biany = dictBifoldable => dictBooleanAlgebra => {
119+ const bifoldMap2 = dictBifoldable.bifoldMap((() => {
120+ const $2 = dictBooleanAlgebra.HeytingAlgebra0();
121+ const semigroupDisj1 = {append: v => v1 => $2.disj(v)(v1)};
122+ return {mempty: $2.ff, Semigroup0: () => semigroupDisj1};
123+ })());
124+ return p => q => bifoldMap2(x => p(x))(x => q(x));
125+};
126+const biall = dictBifoldable => dictBooleanAlgebra => {
127+ const bifoldMap2 = dictBifoldable.bifoldMap((() => {
128+ const $2 = dictBooleanAlgebra.HeytingAlgebra0();
129+ const semigroupConj1 = {append: v => v1 => $2.conj(v)(v1)};
130+ return {mempty: $2.tt, Semigroup0: () => semigroupConj1};
131+ })());
132+ return p => q => bifoldMap2(x => p(x))(x => q(x));
133+};
134+export {
135+ biall,
136+ biany,
137+ bifold,
138+ bifoldMap,
139+ bifoldMapDefaultL,
140+ bifoldMapDefaultR,
141+ bifoldableClown,
142+ bifoldableConst,
143+ bifoldableEither,
144+ bifoldableFlip,
145+ bifoldableJoker,
146+ bifoldableProduct2,
147+ bifoldableTuple,
148+ bifoldl,
149+ bifoldlDefault,
150+ bifoldr,
151+ bifoldrDefault,
152+ bifor_,
153+ bisequence_,
154+ bitraverse_,
155+ identity,
156+ monoidDual,
157+ monoidEndo
158+};
.storybook/purescript-indexer/output-es/Data.Bifunctor.Join/index.jsnew file+20
@@ -0,0 +1,20 @@
1+import * as $runtime from "../runtime.js";
2+const Join = x => x;
3+const showJoin = dictShow => ({show: v => "(Join " + (dictShow.show(v) + ")")});
4+const ordJoin = dictOrd => dictOrd;
5+const newtypeJoin = {Coercible0: () => undefined};
6+const eqJoin = dictEq => dictEq;
7+const bifunctorJoin = dictBifunctor => ({map: f => v => dictBifunctor.bimap(f)(f)(v)});
8+const biapplyJoin = dictBiapply => {
9+ const $1 = dictBiapply.Bifunctor0();
10+ const bifunctorJoin1 = {map: f => v => $1.bimap(f)(f)(v)};
11+ return {apply: v => v1 => dictBiapply.biapply(v)(v1), Functor0: () => bifunctorJoin1};
12+};
13+const biapplicativeJoin = dictBiapplicative => {
14+ const $1 = dictBiapplicative.Biapply0();
15+ const $2 = $1.Bifunctor0();
16+ const bifunctorJoin1 = {map: f => v => $2.bimap(f)(f)(v)};
17+ const biapplyJoin1 = {apply: v => v1 => $1.biapply(v)(v1), Functor0: () => bifunctorJoin1};
18+ return {pure: a => dictBiapplicative.bipure(a)(a), Apply0: () => biapplyJoin1};
19+};
20+export {Join, biapplicativeJoin, biapplyJoin, bifunctorJoin, eqJoin, newtypeJoin, ordJoin, showJoin};
.storybook/purescript-indexer/output-es/Data.Bifunctor/index.jsnew file+17
@@ -0,0 +1,17 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEither from "../Data.Either/index.js";
3+import * as Data$dTuple from "../Data.Tuple/index.js";
4+const identity = x => x;
5+const bimap = dict => dict.bimap;
6+const lmap = dictBifunctor => f => dictBifunctor.bimap(f)(identity);
7+const rmap = dictBifunctor => dictBifunctor.bimap(identity);
8+const bifunctorTuple = {bimap: f => g => v => Data$dTuple.$Tuple(f(v._1), g(v._2))};
9+const bifunctorEither = {
10+ bimap: v => v1 => v2 => {
11+ if (v2.tag === "Left") { return Data$dEither.$Either("Left", v(v2._1)); }
12+ if (v2.tag === "Right") { return Data$dEither.$Either("Right", v1(v2._1)); }
13+ $runtime.fail();
14+ }
15+};
16+const bifunctorConst = {bimap: f => v => v1 => f(v1)};
17+export {bifunctorConst, bifunctorEither, bifunctorTuple, bimap, identity, lmap, rmap};
.storybook/purescript-indexer/output-es/Data.Bitraversable/index.jsnew file+210
@@ -0,0 +1,210 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dBifoldable from "../Data.Bifoldable/index.js";
3+import * as Data$dBifunctor from "../Data.Bifunctor/index.js";
4+import * as Data$dConst from "../Data.Const/index.js";
5+import * as Data$dEither from "../Data.Either/index.js";
6+import * as Data$dFunctor$dClown from "../Data.Functor.Clown/index.js";
7+import * as Data$dFunctor$dFlip from "../Data.Functor.Flip/index.js";
8+import * as Data$dFunctor$dJoker from "../Data.Functor.Joker/index.js";
9+import * as Data$dFunctor$dProduct2 from "../Data.Functor.Product2/index.js";
10+import * as Data$dTuple from "../Data.Tuple/index.js";
11+const identity = x => x;
12+const bitraverse = dict => dict.bitraverse;
13+const lfor = dictBitraversable => dictApplicative => {
14+ const bitraverse2 = dictBitraversable.bitraverse(dictApplicative);
15+ return t => f => bitraverse2(f)(dictApplicative.pure)(t);
16+};
17+const ltraverse = dictBitraversable => dictApplicative => {
18+ const bitraverse2 = dictBitraversable.bitraverse(dictApplicative);
19+ return f => bitraverse2(f)(dictApplicative.pure);
20+};
21+const rfor = dictBitraversable => dictApplicative => {
22+ const bitraverse2 = dictBitraversable.bitraverse(dictApplicative);
23+ return t => f => bitraverse2(dictApplicative.pure)(f)(t);
24+};
25+const rtraverse = dictBitraversable => dictApplicative => dictBitraversable.bitraverse(dictApplicative)(dictApplicative.pure);
26+const bitraversableTuple = {
27+ bitraverse: dictApplicative => {
28+ const Apply0 = dictApplicative.Apply0();
29+ const map = Apply0.Functor0().map;
30+ return f => g => v => Apply0.apply(map(Data$dTuple.Tuple)(f(v._1)))(g(v._2));
31+ },
32+ bisequence: dictApplicative => {
33+ const Apply0 = dictApplicative.Apply0();
34+ const map = Apply0.Functor0().map;
35+ return v => Apply0.apply(map(Data$dTuple.Tuple)(v._1))(v._2);
36+ },
37+ Bifunctor0: () => Data$dBifunctor.bifunctorTuple,
38+ Bifoldable1: () => Data$dBifoldable.bifoldableTuple
39+};
40+const bitraversableJoker = dictTraversable => {
41+ const $1 = dictTraversable.Functor0();
42+ const bifunctorJoker = {bimap: v => g => v1 => $1.map(g)(v1)};
43+ const $3 = dictTraversable.Foldable1();
44+ const bifoldableJoker = {
45+ bifoldr: v => r => u => v1 => $3.foldr(r)(u)(v1),
46+ bifoldl: v => r => u => v1 => $3.foldl(r)(u)(v1),
47+ bifoldMap: dictMonoid => {
48+ const foldMap1 = $3.foldMap(dictMonoid);
49+ return v => r => v1 => foldMap1(r)(v1);
50+ }
51+ };
52+ return {
53+ bitraverse: dictApplicative => {
54+ const map = dictApplicative.Apply0().Functor0().map;
55+ const traverse1 = dictTraversable.traverse(dictApplicative);
56+ return v => r => v1 => map(Data$dFunctor$dJoker.Joker)(traverse1(r)(v1));
57+ },
58+ bisequence: dictApplicative => {
59+ const map = dictApplicative.Apply0().Functor0().map;
60+ const sequence1 = dictTraversable.sequence(dictApplicative);
61+ return v => map(Data$dFunctor$dJoker.Joker)(sequence1(v));
62+ },
63+ Bifunctor0: () => bifunctorJoker,
64+ Bifoldable1: () => bifoldableJoker
65+ };
66+};
67+const bitraversableEither = {
68+ bitraverse: dictApplicative => {
69+ const map = dictApplicative.Apply0().Functor0().map;
70+ return v => v1 => v2 => {
71+ if (v2.tag === "Left") { return map(Data$dEither.Left)(v(v2._1)); }
72+ if (v2.tag === "Right") { return map(Data$dEither.Right)(v1(v2._1)); }
73+ $runtime.fail();
74+ };
75+ },
76+ bisequence: dictApplicative => {
77+ const map = dictApplicative.Apply0().Functor0().map;
78+ return v => {
79+ if (v.tag === "Left") { return map(Data$dEither.Left)(v._1); }
80+ if (v.tag === "Right") { return map(Data$dEither.Right)(v._1); }
81+ $runtime.fail();
82+ };
83+ },
84+ Bifunctor0: () => Data$dBifunctor.bifunctorEither,
85+ Bifoldable1: () => Data$dBifoldable.bifoldableEither
86+};
87+const bitraversableConst = {
88+ bitraverse: dictApplicative => {
89+ const map = dictApplicative.Apply0().Functor0().map;
90+ return f => v => v1 => map(Data$dConst.Const)(f(v1));
91+ },
92+ bisequence: dictApplicative => {
93+ const map = dictApplicative.Apply0().Functor0().map;
94+ return v => map(Data$dConst.Const)(v);
95+ },
96+ Bifunctor0: () => Data$dBifunctor.bifunctorConst,
97+ Bifoldable1: () => Data$dBifoldable.bifoldableConst
98+};
99+const bitraversableClown = dictTraversable => {
100+ const $1 = dictTraversable.Functor0();
101+ const bifunctorClown = {bimap: f => v => v1 => $1.map(f)(v1)};
102+ const $3 = dictTraversable.Foldable1();
103+ const bifoldableClown = {
104+ bifoldr: l => v => u => v1 => $3.foldr(l)(u)(v1),
105+ bifoldl: l => v => u => v1 => $3.foldl(l)(u)(v1),
106+ bifoldMap: dictMonoid => {
107+ const foldMap1 = $3.foldMap(dictMonoid);
108+ return l => v => v1 => foldMap1(l)(v1);
109+ }
110+ };
111+ return {
112+ bitraverse: dictApplicative => {
113+ const map = dictApplicative.Apply0().Functor0().map;
114+ const traverse1 = dictTraversable.traverse(dictApplicative);
115+ return l => v => v1 => map(Data$dFunctor$dClown.Clown)(traverse1(l)(v1));
116+ },
117+ bisequence: dictApplicative => {
118+ const map = dictApplicative.Apply0().Functor0().map;
119+ const sequence1 = dictTraversable.sequence(dictApplicative);
120+ return v => map(Data$dFunctor$dClown.Clown)(sequence1(v));
121+ },
122+ Bifunctor0: () => bifunctorClown,
123+ Bifoldable1: () => bifoldableClown
124+ };
125+};
126+const bisequenceDefault = dictBitraversable => dictApplicative => dictBitraversable.bitraverse(dictApplicative)(identity)(identity);
127+const bisequence = dict => dict.bisequence;
128+const bitraversableFlip = dictBitraversable => {
129+ const $1 = dictBitraversable.Bifunctor0();
130+ const bifunctorFlip = {bimap: f => g => v => $1.bimap(g)(f)(v)};
131+ const $3 = dictBitraversable.Bifoldable1();
132+ const bifoldableFlip = {
133+ bifoldr: r => l => u => v => $3.bifoldr(l)(r)(u)(v),
134+ bifoldl: r => l => u => v => $3.bifoldl(l)(r)(u)(v),
135+ bifoldMap: dictMonoid => {
136+ const bifoldMap2 = $3.bifoldMap(dictMonoid);
137+ return r => l => v => bifoldMap2(l)(r)(v);
138+ }
139+ };
140+ return {
141+ bitraverse: dictApplicative => {
142+ const map = dictApplicative.Apply0().Functor0().map;
143+ const bitraverse2 = dictBitraversable.bitraverse(dictApplicative);
144+ return r => l => v => map(Data$dFunctor$dFlip.Flip)(bitraverse2(l)(r)(v));
145+ },
146+ bisequence: dictApplicative => {
147+ const map = dictApplicative.Apply0().Functor0().map;
148+ const bisequence2 = dictBitraversable.bisequence(dictApplicative);
149+ return v => map(Data$dFunctor$dFlip.Flip)(bisequence2(v));
150+ },
151+ Bifunctor0: () => bifunctorFlip,
152+ Bifoldable1: () => bifoldableFlip
153+ };
154+};
155+const bitraversableProduct2 = dictBitraversable => {
156+ const bifunctorProduct2 = Data$dFunctor$dProduct2.bifunctorProduct2(dictBitraversable.Bifunctor0());
157+ const bifoldableProduct2 = Data$dBifoldable.bifoldableProduct2(dictBitraversable.Bifoldable1());
158+ return dictBitraversable1 => {
159+ const bifunctorProduct21 = bifunctorProduct2(dictBitraversable1.Bifunctor0());
160+ const bifoldableProduct21 = bifoldableProduct2(dictBitraversable1.Bifoldable1());
161+ return {
162+ bitraverse: dictApplicative => {
163+ const Apply0 = dictApplicative.Apply0();
164+ const map = Apply0.Functor0().map;
165+ const bitraverse3 = dictBitraversable.bitraverse(dictApplicative);
166+ const bitraverse4 = dictBitraversable1.bitraverse(dictApplicative);
167+ return l => r => v => Apply0.apply(map(Data$dFunctor$dProduct2.Product2)(bitraverse3(l)(r)(v._1)))(bitraverse4(l)(r)(v._2));
168+ },
169+ bisequence: dictApplicative => {
170+ const Apply0 = dictApplicative.Apply0();
171+ const map = Apply0.Functor0().map;
172+ const bisequence3 = dictBitraversable.bisequence(dictApplicative);
173+ const bisequence4 = dictBitraversable1.bisequence(dictApplicative);
174+ return v => Apply0.apply(map(Data$dFunctor$dProduct2.Product2)(bisequence3(v._1)))(bisequence4(v._2));
175+ },
176+ Bifunctor0: () => bifunctorProduct21,
177+ Bifoldable1: () => bifoldableProduct21
178+ };
179+ };
180+};
181+const bitraverseDefault = dictBitraversable => {
182+ const bimap = dictBitraversable.Bifunctor0().bimap;
183+ return dictApplicative => {
184+ const bisequence2 = dictBitraversable.bisequence(dictApplicative);
185+ return f => g => t => bisequence2(bimap(f)(g)(t));
186+ };
187+};
188+const bifor = dictBitraversable => dictApplicative => {
189+ const bitraverse2 = dictBitraversable.bitraverse(dictApplicative);
190+ return t => f => g => bitraverse2(f)(g)(t);
191+};
192+export {
193+ bifor,
194+ bisequence,
195+ bisequenceDefault,
196+ bitraversableClown,
197+ bitraversableConst,
198+ bitraversableEither,
199+ bitraversableFlip,
200+ bitraversableJoker,
201+ bitraversableProduct2,
202+ bitraversableTuple,
203+ bitraverse,
204+ bitraverseDefault,
205+ identity,
206+ lfor,
207+ ltraverse,
208+ rfor,
209+ rtraverse
210+};
.storybook/purescript-indexer/output-es/Data.Boolean/index.jsnew file+3
@@ -0,0 +1,3 @@
1+import * as $runtime from "../runtime.js";
2+const otherwise = true;
3+export {otherwise};
.storybook/purescript-indexer/output-es/Data.BooleanAlgebra/index.jsnew file+39
@@ -0,0 +1,39 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dHeytingAlgebra from "../Data.HeytingAlgebra/index.js";
3+import * as Type$dProxy from "../Type.Proxy/index.js";
4+const booleanAlgebraUnit = {HeytingAlgebra0: () => Data$dHeytingAlgebra.heytingAlgebraUnit};
5+const booleanAlgebraRecordNil = {HeytingAlgebraRecord0: () => Data$dHeytingAlgebra.heytingAlgebraRecordNil};
6+const booleanAlgebraRecordCons = dictIsSymbol => () => dictBooleanAlgebraRecord => {
7+ const heytingAlgebraRecordCons1 = Data$dHeytingAlgebra.heytingAlgebraRecordCons(dictIsSymbol)()(dictBooleanAlgebraRecord.HeytingAlgebraRecord0());
8+ return dictBooleanAlgebra => {
9+ const heytingAlgebraRecordCons2 = heytingAlgebraRecordCons1(dictBooleanAlgebra.HeytingAlgebra0());
10+ return {HeytingAlgebraRecord0: () => heytingAlgebraRecordCons2};
11+ };
12+};
13+const booleanAlgebraRecord = () => dictBooleanAlgebraRecord => {
14+ const $2 = dictBooleanAlgebraRecord.HeytingAlgebraRecord0();
15+ const heytingAlgebraRecord1 = {
16+ ff: $2.ffRecord(Type$dProxy.Proxy)(Type$dProxy.Proxy),
17+ tt: $2.ttRecord(Type$dProxy.Proxy)(Type$dProxy.Proxy),
18+ conj: $2.conjRecord(Type$dProxy.Proxy),
19+ disj: $2.disjRecord(Type$dProxy.Proxy),
20+ implies: $2.impliesRecord(Type$dProxy.Proxy),
21+ not: $2.notRecord(Type$dProxy.Proxy)
22+ };
23+ return {HeytingAlgebra0: () => heytingAlgebraRecord1};
24+};
25+const booleanAlgebraProxy = {HeytingAlgebra0: () => Data$dHeytingAlgebra.heytingAlgebraProxy};
26+const booleanAlgebraFn = dictBooleanAlgebra => {
27+ const $1 = dictBooleanAlgebra.HeytingAlgebra0();
28+ const heytingAlgebraFunction = {
29+ ff: v => $1.ff,
30+ tt: v => $1.tt,
31+ implies: f => g => a => $1.implies(f(a))(g(a)),
32+ conj: f => g => a => $1.conj(f(a))(g(a)),
33+ disj: f => g => a => $1.disj(f(a))(g(a)),
34+ not: f => a => $1.not(f(a))
35+ };
36+ return {HeytingAlgebra0: () => heytingAlgebraFunction};
37+};
38+const booleanAlgebraBoolean = {HeytingAlgebra0: () => Data$dHeytingAlgebra.heytingAlgebraBoolean};
39+export {booleanAlgebraBoolean, booleanAlgebraFn, booleanAlgebraProxy, booleanAlgebraRecord, booleanAlgebraRecordCons, booleanAlgebraRecordNil, booleanAlgebraUnit};
.storybook/purescript-indexer/output-es/Data.Bounded.Generic/index.jsnew file+34
@@ -0,0 +1,34 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dGeneric$dRep from "../Data.Generic.Rep/index.js";
3+const genericTopNoArguments = {"genericTop'": Data$dGeneric$dRep.NoArguments};
4+const genericTopArgument = dictBounded => ({"genericTop'": dictBounded.top});
5+const genericTop$p = dict => dict["genericTop'"];
6+const genericTopConstructor = dictGenericTop => ({"genericTop'": dictGenericTop["genericTop'"]});
7+const genericTopProduct = dictGenericTop => dictGenericTop1 => ({"genericTop'": Data$dGeneric$dRep.$Product(dictGenericTop["genericTop'"], dictGenericTop1["genericTop'"])});
8+const genericTopSum = dictGenericTop => ({"genericTop'": Data$dGeneric$dRep.$Sum("Inr", dictGenericTop["genericTop'"])});
9+const genericTop = dictGeneric => dictGenericTop => dictGeneric.to(dictGenericTop["genericTop'"]);
10+const genericBottomNoArguments = {"genericBottom'": Data$dGeneric$dRep.NoArguments};
11+const genericBottomArgument = dictBounded => ({"genericBottom'": dictBounded.bottom});
12+const genericBottom$p = dict => dict["genericBottom'"];
13+const genericBottomConstructor = dictGenericBottom => ({"genericBottom'": dictGenericBottom["genericBottom'"]});
14+const genericBottomProduct = dictGenericBottom => dictGenericBottom1 => (
15+ {"genericBottom'": Data$dGeneric$dRep.$Product(dictGenericBottom["genericBottom'"], dictGenericBottom1["genericBottom'"])}
16+);
17+const genericBottomSum = dictGenericBottom => ({"genericBottom'": Data$dGeneric$dRep.$Sum("Inl", dictGenericBottom["genericBottom'"])});
18+const genericBottom = dictGeneric => dictGenericBottom => dictGeneric.to(dictGenericBottom["genericBottom'"]);
19+export {
20+ genericBottom,
21+ genericBottom$p,
22+ genericBottomArgument,
23+ genericBottomConstructor,
24+ genericBottomNoArguments,
25+ genericBottomProduct,
26+ genericBottomSum,
27+ genericTop,
28+ genericTop$p,
29+ genericTopArgument,
30+ genericTopConstructor,
31+ genericTopNoArguments,
32+ genericTopProduct,
33+ genericTopSum
34+};
.storybook/purescript-indexer/output-es/Data.Bounded/foreign.jsnew file+8
@@ -0,0 +1,8 @@
1+export const topInt = 2147483647;
2+export const bottomInt = -2147483648;
3+
4+export const topChar = String.fromCharCode(65535);
5+export const bottomChar = String.fromCharCode(0);
6+
7+export const topNumber = Number.POSITIVE_INFINITY;
8+export const bottomNumber = Number.NEGATIVE_INFINITY;
.storybook/purescript-indexer/output-es/Data.Bounded/index.jsnew file+72
@@ -0,0 +1,72 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dOrd from "../Data.Ord/index.js";
3+import * as Data$dOrdering from "../Data.Ordering/index.js";
4+import * as Data$dUnit from "../Data.Unit/index.js";
5+import * as Record$dUnsafe from "../Record.Unsafe/index.js";
6+import * as Type$dProxy from "../Type.Proxy/index.js";
7+import {bottomChar, bottomInt, bottomNumber, topChar, topInt, topNumber} from "./foreign.js";
8+const topRecord = dict => dict.topRecord;
9+const top = dict => dict.top;
10+const boundedUnit = {top: Data$dUnit.unit, bottom: Data$dUnit.unit, Ord0: () => Data$dOrd.ordUnit};
11+const boundedRecordNil = {topRecord: v => v1 => ({}), bottomRecord: v => v1 => ({}), OrdRecord0: () => Data$dOrd.ordRecordNil};
12+const boundedProxy = {bottom: Type$dProxy.Proxy, top: Type$dProxy.Proxy, Ord0: () => Data$dOrd.ordProxy};
13+const boundedOrdering = {top: Data$dOrdering.GT, bottom: Data$dOrdering.LT, Ord0: () => Data$dOrd.ordOrdering};
14+const boundedNumber = {top: topNumber, bottom: bottomNumber, Ord0: () => Data$dOrd.ordNumber};
15+const boundedInt = {top: 2147483647, bottom: -2147483648, Ord0: () => Data$dOrd.ordInt};
16+const boundedChar = {top: "￿", bottom: "\u0000", Ord0: () => Data$dOrd.ordChar};
17+const boundedBoolean = {top: true, bottom: false, Ord0: () => Data$dOrd.ordBoolean};
18+const bottomRecord = dict => dict.bottomRecord;
19+const boundedRecord = () => dictBoundedRecord => {
20+ const ordRecord1 = Data$dOrd.ordRecord()(dictBoundedRecord.OrdRecord0());
21+ return {
22+ top: dictBoundedRecord.topRecord(Type$dProxy.Proxy)(Type$dProxy.Proxy),
23+ bottom: dictBoundedRecord.bottomRecord(Type$dProxy.Proxy)(Type$dProxy.Proxy),
24+ Ord0: () => ordRecord1
25+ };
26+};
27+const bottom = dict => dict.bottom;
28+const boundedRecordCons = dictIsSymbol => dictBounded => {
29+ const Ord0 = dictBounded.Ord0();
30+ return () => () => dictBoundedRecord => {
31+ const $6 = dictBoundedRecord.OrdRecord0();
32+ const $7 = $6.EqRecord0();
33+ const $8 = Ord0.Eq0();
34+ const eqRowCons2 = {
35+ eqRecord: v => ra => rb => {
36+ const $$get = Record$dUnsafe.unsafeGet(dictIsSymbol.reflectSymbol(Type$dProxy.Proxy));
37+ return $8.eq($$get(ra))($$get(rb)) && $7.eqRecord(Type$dProxy.Proxy)(ra)(rb);
38+ }
39+ };
40+ const ordRecordCons = {
41+ compareRecord: v => ra => rb => {
42+ const key = dictIsSymbol.reflectSymbol(Type$dProxy.Proxy);
43+ const left = Ord0.compare(Record$dUnsafe.unsafeGet(key)(ra))(Record$dUnsafe.unsafeGet(key)(rb));
44+ if (left.tag === "LT" || (left.tag === "GT" || !(left.tag === "EQ"))) { return left; }
45+ return $6.compareRecord(Type$dProxy.Proxy)(ra)(rb);
46+ },
47+ EqRecord0: () => eqRowCons2
48+ };
49+ return {
50+ topRecord: v => rowProxy => Record$dUnsafe.unsafeSet(dictIsSymbol.reflectSymbol(Type$dProxy.Proxy))(dictBounded.top)(dictBoundedRecord.topRecord(Type$dProxy.Proxy)(rowProxy)),
51+ bottomRecord: v => rowProxy => Record$dUnsafe.unsafeSet(dictIsSymbol.reflectSymbol(Type$dProxy.Proxy))(dictBounded.bottom)(dictBoundedRecord.bottomRecord(Type$dProxy.Proxy)(rowProxy)),
52+ OrdRecord0: () => ordRecordCons
53+ };
54+ };
55+};
56+export {
57+ bottom,
58+ bottomRecord,
59+ boundedBoolean,
60+ boundedChar,
61+ boundedInt,
62+ boundedNumber,
63+ boundedOrdering,
64+ boundedProxy,
65+ boundedRecord,
66+ boundedRecordCons,
67+ boundedRecordNil,
68+ boundedUnit,
69+ top,
70+ topRecord
71+};
72+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.CatList/index.jsnew file+322
@@ -0,0 +1,322 @@
1+// | This module defines a strict catenable list.
2+// |
3+// | The implementation is based on a queue where all operations require
4+// | `O(1)` amortized time.
5+// |
6+// | However, any single `uncons` operation may run in `O(n)` time.
7+// |
8+// | See [Purely Functional Data Structures](http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf) (Okasaki 1996)
9+import * as $runtime from "../runtime.js";
10+import * as Data$dCatQueue from "../Data.CatQueue/index.js";
11+import * as Data$dFoldable from "../Data.Foldable/index.js";
12+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
13+import * as Data$dMaybe from "../Data.Maybe/index.js";
14+import * as Data$dTuple from "../Data.Tuple/index.js";
15+const $CatList = (tag, _1, _2) => ({tag, _1, _2});
16+const CatNil = /* #__PURE__ */ $CatList("CatNil");
17+const CatCons = value0 => value1 => $CatList("CatCons", value0, value1);
18+const showCatList = dictShow => (
19+ {
20+ show: v => {
21+ if (v.tag === "CatNil") { return "CatNil"; }
22+ if (v.tag === "CatCons") { return "(CatList " + (dictShow.show(v._1) + (" " + (Data$dCatQueue.showCatQueue(showCatList(dictShow)).show(v._2) + ")"))); }
23+ $runtime.fail();
24+ }
25+ }
26+);
27+const $$null = v => v.tag === "CatNil";
28+const link = v => v1 => {
29+ if (v.tag === "CatNil") { return v1; }
30+ if (v1.tag === "CatNil") { return v; }
31+ if (v.tag === "CatCons") { return $CatList("CatCons", v._1, Data$dCatQueue.$CatQueue(v._2._1, Data$dList$dTypes.$List("Cons", v1, v._2._2))); }
32+ $runtime.fail();
33+};
34+const foldr = k => b => q => {
35+ const foldl = foldl$a0$copy => foldl$a1$copy => foldl$a2$copy => {
36+ let foldl$a0 = foldl$a0$copy, foldl$a1 = foldl$a1$copy, foldl$a2 = foldl$a2$copy, foldl$c = true, foldl$r;
37+ while (foldl$c) {
38+ const v = foldl$a0, v1 = foldl$a1, v2 = foldl$a2;
39+ if (v2.tag === "Nil") {
40+ foldl$c = false;
41+ foldl$r = v1;
42+ continue;
43+ }
44+ if (v2.tag === "Cons") {
45+ foldl$a0 = v;
46+ foldl$a1 = v(v1)(v2._1);
47+ foldl$a2 = v2._2;
48+ continue;
49+ }
50+ $runtime.fail();
51+ };
52+ return foldl$r;
53+ };
54+ const go = go$a0$copy => go$a1$copy => {
55+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
56+ while (go$c) {
57+ const xs = go$a0, ys = go$a1;
58+ const v = Data$dCatQueue.uncons(xs);
59+ if (v.tag === "Nothing") {
60+ go$c = false;
61+ go$r = foldl(x => i => i(x))(b)(ys);
62+ continue;
63+ }
64+ if (v.tag === "Just") {
65+ go$a0 = v._1._2;
66+ go$a1 = Data$dList$dTypes.$List("Cons", k(v._1._1), ys);
67+ continue;
68+ }
69+ $runtime.fail();
70+ };
71+ return go$r;
72+ };
73+ return go(q)(Data$dList$dTypes.Nil);
74+};
75+const uncons = v => {
76+ if (v.tag === "CatNil") { return Data$dMaybe.Nothing; }
77+ if (v.tag === "CatCons") {
78+ return Data$dMaybe.$Maybe(
79+ "Just",
80+ Data$dTuple.$Tuple(
81+ v._1,
82+ (() => {
83+ if (
84+ (() => {
85+ if (v._2._1.tag === "Nil") { return v._2._2.tag === "Nil"; }
86+ return false;
87+ })()
88+ ) {
89+ return CatNil;
90+ }
91+ return foldr(link)(CatNil)(v._2);
92+ })()
93+ )
94+ );
95+ }
96+ $runtime.fail();
97+};
98+const foldableCatList = {
99+ foldMap: dictMonoid => {
100+ const append$1 = dictMonoid.Semigroup0().append;
101+ return f => foldableCatList.foldl(acc => x => append$1(acc)(f(x)))(dictMonoid.mempty);
102+ },
103+ foldr: f => s => l => Data$dFoldable.foldrDefault(foldableCatList)(f)(s)(l),
104+ foldl: f => {
105+ const go = go$a0$copy => go$a1$copy => {
106+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
107+ while (go$c) {
108+ const acc = go$a0, q = go$a1;
109+ const v = uncons(q);
110+ if (v.tag === "Just") {
111+ go$a0 = f(acc)(v._1._1);
112+ go$a1 = v._1._2;
113+ continue;
114+ }
115+ if (v.tag === "Nothing") {
116+ go$c = false;
117+ go$r = acc;
118+ continue;
119+ }
120+ $runtime.fail();
121+ };
122+ return go$r;
123+ };
124+ return go;
125+ }
126+};
127+const length = /* #__PURE__ */ (() => foldableCatList.foldl(c => v => 1 + c | 0)(0))();
128+const foldMap = dictMonoid => {
129+ const append2 = dictMonoid.Semigroup0().append;
130+ return v => v1 => {
131+ if (v1.tag === "CatNil") { return dictMonoid.mempty; }
132+ if (v1.tag === "CatCons") {
133+ return append2(v(v1._1))(foldMap(dictMonoid)(v)((() => {
134+ if (
135+ (() => {
136+ if (v1._2._1.tag === "Nil") { return v1._2._2.tag === "Nil"; }
137+ return false;
138+ })()
139+ ) {
140+ return CatNil;
141+ }
142+ return foldr(link)(CatNil)(v1._2);
143+ })()));
144+ }
145+ $runtime.fail();
146+ };
147+};
148+const empty = CatNil;
149+const append = link;
150+const cons = a => cat => link($CatList("CatCons", a, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)))(cat);
151+const functorCatList = {
152+ map: v => v1 => {
153+ if (v1.tag === "CatNil") { return CatNil; }
154+ if (v1.tag === "CatCons") {
155+ return link($CatList("CatCons", v(v1._1), Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)))(functorCatList.map(v)((() => {
156+ if (
157+ (() => {
158+ if (v1._2._1.tag === "Nil") { return v1._2._2.tag === "Nil"; }
159+ return false;
160+ })()
161+ ) {
162+ return CatNil;
163+ }
164+ return foldr(link)(CatNil)(v1._2);
165+ })()));
166+ }
167+ $runtime.fail();
168+ }
169+};
170+const singleton = a => link($CatList("CatCons", a, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)))(CatNil);
171+const traversableCatList = {
172+ traverse: dictApplicative => {
173+ const Apply0 = dictApplicative.Apply0();
174+ const map = Apply0.Functor0().map;
175+ return v => v1 => {
176+ if (v1.tag === "CatNil") { return dictApplicative.pure(CatNil); }
177+ if (v1.tag === "CatCons") {
178+ return Apply0.apply(map(cons)(v(v1._1)))(traversableCatList.traverse(dictApplicative)(v)((() => {
179+ if (
180+ (() => {
181+ if (v1._2._1.tag === "Nil") { return v1._2._2.tag === "Nil"; }
182+ return false;
183+ })()
184+ ) {
185+ return CatNil;
186+ }
187+ return foldr(link)(CatNil)(v1._2);
188+ })()));
189+ }
190+ $runtime.fail();
191+ };
192+ },
193+ sequence: dictApplicative => {
194+ const Apply0 = dictApplicative.Apply0();
195+ const map = Apply0.Functor0().map;
196+ return v => {
197+ if (v.tag === "CatNil") { return dictApplicative.pure(CatNil); }
198+ if (v.tag === "CatCons") {
199+ return Apply0.apply(map(cons)(v._1))(traversableCatList.sequence(dictApplicative)((() => {
200+ if (
201+ (() => {
202+ if (v._2._1.tag === "Nil") { return v._2._2.tag === "Nil"; }
203+ return false;
204+ })()
205+ ) {
206+ return CatNil;
207+ }
208+ return foldr(link)(CatNil)(v._2);
209+ })()));
210+ }
211+ $runtime.fail();
212+ };
213+ },
214+ Functor0: () => functorCatList,
215+ Foldable1: () => foldableCatList
216+};
217+const semigroupCatList = {append: link};
218+const monoidCatList = {mempty: CatNil, Semigroup0: () => semigroupCatList};
219+const monadCatList = {Applicative0: () => applicativeCatList, Bind1: () => bindCatList$lazy()};
220+const applyCatList = {apply: f => a => bindCatList$lazy().bind(f)(f$p => bindCatList$lazy().bind(a)(a$p => applicativeCatList.pure(f$p(a$p)))), Functor0: () => functorCatList};
221+const applicativeCatList = {pure: singleton, Apply0: () => applyCatList};
222+const bindCatList$lazy = /* #__PURE__ */ $runtime.binding(() => (
223+ {
224+ bind: (() => {
225+ const $0 = foldMap(monoidCatList);
226+ return b => a => $0(a)(b);
227+ })(),
228+ Apply0: () => applyCatList
229+ }
230+));
231+const bindCatList = /* #__PURE__ */ bindCatList$lazy();
232+const fromFoldable = dictFoldable => {
233+ const foldMap1 = dictFoldable.foldMap(monoidCatList);
234+ return f => foldMap1(singleton)(f);
235+};
236+const snoc = cat => a => link(cat)($CatList("CatCons", a, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)));
237+const unfoldable1CatList = {
238+ unfoldr1: f => b => {
239+ const go = go$a0$copy => go$a1$copy => {
240+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
241+ while (go$c) {
242+ const source = go$a0, memo = go$a1;
243+ const v = f(source);
244+ if (v._2.tag === "Nothing") {
245+ go$c = false;
246+ go$r = link(memo)($CatList("CatCons", v._1, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)));
247+ continue;
248+ }
249+ if (v._2.tag === "Just") {
250+ go$a0 = v._2._1;
251+ go$a1 = link(memo)($CatList("CatCons", v._1, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)));
252+ continue;
253+ }
254+ $runtime.fail();
255+ };
256+ return go$r;
257+ };
258+ return go(b)(CatNil);
259+ }
260+};
261+const unfoldableCatList = {
262+ unfoldr: f => b => {
263+ const go = go$a0$copy => go$a1$copy => {
264+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
265+ while (go$c) {
266+ const source = go$a0, memo = go$a1;
267+ const v = f(source);
268+ if (v.tag === "Nothing") {
269+ go$c = false;
270+ go$r = memo;
271+ continue;
272+ }
273+ if (v.tag === "Just") {
274+ go$a0 = v._1._2;
275+ go$a1 = link(memo)($CatList("CatCons", v._1._1, Data$dCatQueue.$CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)));
276+ continue;
277+ }
278+ $runtime.fail();
279+ };
280+ return go$r;
281+ };
282+ return go(b)(CatNil);
283+ },
284+ Unfoldable10: () => unfoldable1CatList
285+};
286+const altCatList = {alt: link, Functor0: () => functorCatList};
287+const plusCatList = {empty: CatNil, Alt0: () => altCatList};
288+const alternativeCatList = {Applicative0: () => applicativeCatList, Plus1: () => plusCatList};
289+const monadPlusCatList = {Monad0: () => monadCatList, Alternative1: () => alternativeCatList};
290+export {
291+ $CatList,
292+ CatCons,
293+ CatNil,
294+ altCatList,
295+ alternativeCatList,
296+ append,
297+ applicativeCatList,
298+ applyCatList,
299+ bindCatList,
300+ cons,
301+ empty,
302+ foldMap,
303+ foldableCatList,
304+ foldr,
305+ fromFoldable,
306+ functorCatList,
307+ length,
308+ link,
309+ monadCatList,
310+ monadPlusCatList,
311+ monoidCatList,
312+ $$null as null,
313+ plusCatList,
314+ semigroupCatList,
315+ showCatList,
316+ singleton,
317+ snoc,
318+ traversableCatList,
319+ uncons,
320+ unfoldable1CatList,
321+ unfoldableCatList
322+};
.storybook/purescript-indexer/output-es/Data.CatQueue/index.jsnew file+352
@@ -0,0 +1,352 @@
1+// | This module defines a strict double-ended queue.
2+// |
3+// | The queue implementation is based on a pair of lists where all
4+// | operations require `O(1)` amortized time.
5+// |
6+// | However, any single `uncons` operation may run in `O(n)` time.
7+// |
8+// | See [Simple and Efficient Purely Functional Queues and Dequeues](http://www.westpoint.edu/eecs/SiteAssets/SitePages/Faculty%20Publication%20Documents/Okasaki/jfp95queue.pdf) (Okasaki 1995)
9+import * as $runtime from "../runtime.js";
10+import * as Data$dFoldable from "../Data.Foldable/index.js";
11+import * as Data$dList from "../Data.List/index.js";
12+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
13+import * as Data$dMaybe from "../Data.Maybe/index.js";
14+import * as Data$dOrdering from "../Data.Ordering/index.js";
15+import * as Data$dTraversable from "../Data.Traversable/index.js";
16+import * as Data$dTuple from "../Data.Tuple/index.js";
17+const $CatQueue = (_1, _2) => ({tag: "CatQueue", _1, _2});
18+const CatQueue = value0 => value1 => $CatQueue(value0, value1);
19+const unsnoc = unsnoc$a0$copy => {
20+ let unsnoc$a0 = unsnoc$a0$copy, unsnoc$c = true, unsnoc$r;
21+ while (unsnoc$c) {
22+ const v = unsnoc$a0;
23+ if (v._2.tag === "Cons") {
24+ unsnoc$c = false;
25+ unsnoc$r = Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(v._2._1, $CatQueue(v._1, v._2._2)));
26+ continue;
27+ }
28+ if (v._2.tag === "Nil") {
29+ if (v._1.tag === "Nil") {
30+ unsnoc$c = false;
31+ unsnoc$r = Data$dMaybe.Nothing;
32+ continue;
33+ }
34+ unsnoc$a0 = $CatQueue(Data$dList$dTypes.Nil, Data$dList.reverse(v._1));
35+ continue;
36+ }
37+ $runtime.fail();
38+ };
39+ return unsnoc$r;
40+};
41+const uncons = uncons$a0$copy => {
42+ let uncons$a0 = uncons$a0$copy, uncons$c = true, uncons$r;
43+ while (uncons$c) {
44+ const v = uncons$a0;
45+ if (v._1.tag === "Nil") {
46+ if (v._2.tag === "Nil") {
47+ uncons$c = false;
48+ uncons$r = Data$dMaybe.Nothing;
49+ continue;
50+ }
51+ uncons$a0 = $CatQueue(Data$dList.reverse(v._2), Data$dList$dTypes.Nil);
52+ continue;
53+ }
54+ if (v._1.tag === "Cons") {
55+ uncons$c = false;
56+ uncons$r = Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(v._1._1, $CatQueue(v._1._2, v._2)));
57+ continue;
58+ }
59+ $runtime.fail();
60+ };
61+ return uncons$r;
62+};
63+const snoc = v => a => $CatQueue(v._1, Data$dList$dTypes.$List("Cons", a, v._2));
64+const showCatQueue = dictShow => {
65+ const show = Data$dList$dTypes.showList(dictShow).show;
66+ return {show: v => "(CatQueue " + (show(v._1) + (" " + (show(v._2) + ")")))};
67+};
68+const $$null = v => {
69+ if (v._1.tag === "Nil") { return v._2.tag === "Nil"; }
70+ return false;
71+};
72+const length = v => {
73+ const go = go$a0$copy => go$a1$copy => {
74+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
75+ while (go$c) {
76+ const b = go$a0, v$1 = go$a1;
77+ if (v$1.tag === "Nil") {
78+ go$c = false;
79+ go$r = b;
80+ continue;
81+ }
82+ if (v$1.tag === "Cons") {
83+ go$a0 = b + 1 | 0;
84+ go$a1 = v$1._2;
85+ continue;
86+ }
87+ $runtime.fail();
88+ };
89+ return go$r;
90+ };
91+ const go$1 = go$1$a0$copy => go$1$a1$copy => {
92+ let go$1$a0 = go$1$a0$copy, go$1$a1 = go$1$a1$copy, go$1$c = true, go$1$r;
93+ while (go$1$c) {
94+ const b = go$1$a0, v$1 = go$1$a1;
95+ if (v$1.tag === "Nil") {
96+ go$1$c = false;
97+ go$1$r = b;
98+ continue;
99+ }
100+ if (v$1.tag === "Cons") {
101+ go$1$a0 = b + 1 | 0;
102+ go$1$a1 = v$1._2;
103+ continue;
104+ }
105+ $runtime.fail();
106+ };
107+ return go$1$r;
108+ };
109+ return go(0)(v._1) + go$1(0)(v._2) | 0;
110+};
111+const functorCatQueue = {map: f => v => $CatQueue(Data$dList$dTypes.listMap(f)(v._1), Data$dList$dTypes.listMap(f)(v._2))};
112+const foldableCatQueue = {
113+ foldMap: dictMonoid => {
114+ const append = dictMonoid.Semigroup0().append;
115+ return f => foldableCatQueue.foldl(acc => x => append(acc)(f(x)))(dictMonoid.mempty);
116+ },
117+ foldr: f => Data$dFoldable.foldrDefault(foldableCatQueue)(f),
118+ foldl: f => {
119+ const go = go$a0$copy => go$a1$copy => {
120+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
121+ while (go$c) {
122+ const acc = go$a0, q = go$a1;
123+ const v = uncons(q);
124+ if (v.tag === "Just") {
125+ go$a0 = f(acc)(v._1._1);
126+ go$a1 = v._1._2;
127+ continue;
128+ }
129+ if (v.tag === "Nothing") {
130+ go$c = false;
131+ go$r = acc;
132+ continue;
133+ }
134+ $runtime.fail();
135+ };
136+ return go$r;
137+ };
138+ return go;
139+ }
140+};
141+const semigroupCatQueue = /* #__PURE__ */ (() => ({append: foldableCatQueue.foldl(snoc)}))();
142+const empty = /* #__PURE__ */ $CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil);
143+const monoidCatQueue = {mempty: /* #__PURE__ */ $CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil), Semigroup0: () => semigroupCatQueue};
144+const singleton = /* #__PURE__ */ snoc(/* #__PURE__ */ $CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil));
145+const fromFoldable = dictFoldable => {
146+ const foldMap = dictFoldable.foldMap(monoidCatQueue);
147+ return f => foldMap(snoc($CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)))(f);
148+};
149+const traversableCatQueue = {
150+ traverse: dictApplicative => {
151+ const Apply0 = dictApplicative.Apply0();
152+ const map1 = Apply0.Functor0().map;
153+ const map = Apply0.Functor0().map;
154+ return f => {
155+ const $5 = map1(foldableCatQueue.foldl(snoc)($CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)));
156+ const $6 = foldableCatQueue.foldl(acc => x => Apply0.apply(map(snoc)(acc))(f(x)))(dictApplicative.pure($CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)));
157+ return x => $5($6(x));
158+ };
159+ },
160+ sequence: dictApplicative => traversableCatQueue.traverse(dictApplicative)(Data$dTraversable.identity),
161+ Functor0: () => functorCatQueue,
162+ Foldable1: () => foldableCatQueue
163+};
164+const unfoldable1CatQueue = {
165+ unfoldr1: f => b => {
166+ const go = go$a0$copy => go$a1$copy => {
167+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
168+ while (go$c) {
169+ const source = go$a0, memo = go$a1;
170+ const v = f(source);
171+ if (v._2.tag === "Nothing") {
172+ go$c = false;
173+ go$r = $CatQueue(memo._1, Data$dList$dTypes.$List("Cons", v._1, memo._2));
174+ continue;
175+ }
176+ if (v._2.tag === "Just") {
177+ go$a0 = v._2._1;
178+ go$a1 = $CatQueue(memo._1, Data$dList$dTypes.$List("Cons", v._1, memo._2));
179+ continue;
180+ }
181+ $runtime.fail();
182+ };
183+ return go$r;
184+ };
185+ return go(b)($CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil));
186+ }
187+};
188+const unfoldableCatQueue = {
189+ unfoldr: f => b => {
190+ const go = go$a0$copy => go$a1$copy => {
191+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
192+ while (go$c) {
193+ const source = go$a0, memo = go$a1;
194+ const v = f(source);
195+ if (v.tag === "Nothing") {
196+ go$c = false;
197+ go$r = memo;
198+ continue;
199+ }
200+ if (v.tag === "Just") {
201+ go$a0 = v._1._2;
202+ go$a1 = $CatQueue(memo._1, Data$dList$dTypes.$List("Cons", v._1._1, memo._2));
203+ continue;
204+ }
205+ $runtime.fail();
206+ };
207+ return go$r;
208+ };
209+ return go(b)($CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil));
210+ },
211+ Unfoldable10: () => unfoldable1CatQueue
212+};
213+const cqEq = dictEq => {
214+ const go = go$a0$copy => go$a1$copy => {
215+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
216+ while (go$c) {
217+ const xs = go$a0, ys = go$a1;
218+ const v = uncons(ys);
219+ const v1 = uncons(xs);
220+ if (v1.tag === "Just") {
221+ if (v.tag === "Just") {
222+ if (dictEq.eq(v1._1._1)(v._1._1)) {
223+ go$a0 = v1._1._2;
224+ go$a1 = v._1._2;
225+ continue;
226+ }
227+ go$c = false;
228+ go$r = false;
229+ continue;
230+ }
231+ go$c = false;
232+ go$r = false;
233+ continue;
234+ }
235+ if (v1.tag === "Nothing") {
236+ go$c = false;
237+ go$r = v.tag === "Nothing";
238+ continue;
239+ }
240+ go$c = false;
241+ go$r = false;
242+ continue;
243+ };
244+ return go$r;
245+ };
246+ return go;
247+};
248+const eqCatQueue = dictEq => ({eq: cqEq(dictEq)});
249+const cqCompare = dictOrd => {
250+ const go = go$a0$copy => go$a1$copy => {
251+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
252+ while (go$c) {
253+ const xs = go$a0, ys = go$a1;
254+ const v = uncons(ys);
255+ const v1 = uncons(xs);
256+ if (v1.tag === "Just") {
257+ if (v.tag === "Just") {
258+ const v2 = dictOrd.compare(v1._1._1)(v._1._1);
259+ if (v2.tag === "EQ") {
260+ go$a0 = v1._1._2;
261+ go$a1 = v._1._2;
262+ continue;
263+ }
264+ go$c = false;
265+ go$r = v2;
266+ continue;
267+ }
268+ if (v.tag === "Nothing") {
269+ go$c = false;
270+ go$r = Data$dOrdering.GT;
271+ continue;
272+ }
273+ $runtime.fail();
274+ }
275+ if (v1.tag === "Nothing") {
276+ if (v.tag === "Just") {
277+ go$c = false;
278+ go$r = Data$dOrdering.LT;
279+ continue;
280+ }
281+ if (v.tag === "Nothing") {
282+ go$c = false;
283+ go$r = Data$dOrdering.EQ;
284+ continue;
285+ }
286+ $runtime.fail();
287+ }
288+ $runtime.fail();
289+ };
290+ return go$r;
291+ };
292+ return go;
293+};
294+const ordCatQueue = dictOrd => {
295+ const eqCatQueue1 = {eq: cqEq(dictOrd.Eq0())};
296+ return {compare: cqCompare(dictOrd), Eq0: () => eqCatQueue1};
297+};
298+const cons = a => v => $CatQueue(Data$dList$dTypes.$List("Cons", a, v._1), v._2);
299+const monadCatQueue = {Applicative0: () => applicativeCatQueue$lazy(), Bind1: () => bindCatQueue$lazy()};
300+const applyCatQueue = {
301+ apply: f => a => bindCatQueue$lazy().bind(f)(f$p => bindCatQueue$lazy().bind(a)(a$p => applicativeCatQueue$lazy().pure(f$p(a$p)))),
302+ Functor0: () => functorCatQueue
303+};
304+const bindCatQueue$lazy = /* #__PURE__ */ $runtime.binding(() => (
305+ {
306+ bind: (() => {
307+ const $0 = foldableCatQueue.foldMap(monoidCatQueue);
308+ return b => a => $0(a)(b);
309+ })(),
310+ Apply0: () => applyCatQueue
311+ }
312+));
313+const applicativeCatQueue$lazy = /* #__PURE__ */ $runtime.binding(() => ({pure: snoc($CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil)), Apply0: () => applyCatQueue}));
314+const bindCatQueue = /* #__PURE__ */ bindCatQueue$lazy();
315+const applicativeCatQueue = /* #__PURE__ */ applicativeCatQueue$lazy();
316+const altCatQueue = /* #__PURE__ */ (() => ({alt: semigroupCatQueue.append, Functor0: () => functorCatQueue}))();
317+const plusCatQueue = {empty: /* #__PURE__ */ $CatQueue(Data$dList$dTypes.Nil, Data$dList$dTypes.Nil), Alt0: () => altCatQueue};
318+const alternativeCatQueue = {Applicative0: () => applicativeCatQueue, Plus1: () => plusCatQueue};
319+const monadPlusCatQueue = {Monad0: () => monadCatQueue, Alternative1: () => alternativeCatQueue};
320+export {
321+ $CatQueue,
322+ CatQueue,
323+ altCatQueue,
324+ alternativeCatQueue,
325+ applicativeCatQueue,
326+ applyCatQueue,
327+ bindCatQueue,
328+ cons,
329+ cqCompare,
330+ cqEq,
331+ empty,
332+ eqCatQueue,
333+ foldableCatQueue,
334+ fromFoldable,
335+ functorCatQueue,
336+ length,
337+ monadCatQueue,
338+ monadPlusCatQueue,
339+ monoidCatQueue,
340+ $$null as null,
341+ ordCatQueue,
342+ plusCatQueue,
343+ semigroupCatQueue,
344+ showCatQueue,
345+ singleton,
346+ snoc,
347+ traversableCatQueue,
348+ uncons,
349+ unfoldable1CatQueue,
350+ unfoldableCatQueue,
351+ unsnoc
352+};
.storybook/purescript-indexer/output-es/Data.Char.Gen/index.jsnew file+22
@@ -0,0 +1,22 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dGen from "../Control.Monad.Gen/index.js";
3+import * as Data$dEnum from "../Data.Enum/index.js";
4+import * as Data$dFoldable from "../Data.Foldable/index.js";
5+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
6+const toEnumWithDefaults = low => high => x => {
7+ if (x >= 0 && x <= 65535) { return Data$dEnum.fromCharCode(x); }
8+ if (x < 0) { return low; }
9+ return high;
10+};
11+const foldable1NonEmpty = /* #__PURE__ */ Data$dNonEmpty.foldable1NonEmpty(Data$dFoldable.foldableArray);
12+const genUnicodeChar = dictMonadGen => dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(toEnumWithDefaults("\u0000")("￿"))(dictMonadGen.chooseInt(0)(65536));
13+const genDigitChar = dictMonadGen => dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(toEnumWithDefaults("\u0000")("￿"))(dictMonadGen.chooseInt(48)(57));
14+const genAsciiChar$p = dictMonadGen => dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(toEnumWithDefaults("\u0000")("￿"))(dictMonadGen.chooseInt(0)(127));
15+const genAsciiChar = dictMonadGen => dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(toEnumWithDefaults("\u0000")("￿"))(dictMonadGen.chooseInt(32)(127));
16+const genAlphaUppercase = dictMonadGen => dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(toEnumWithDefaults("\u0000")("￿"))(dictMonadGen.chooseInt(65)(90));
17+const genAlphaLowercase = dictMonadGen => dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(toEnumWithDefaults("\u0000")("￿"))(dictMonadGen.chooseInt(97)(122));
18+const genAlpha = dictMonadGen => Control$dMonad$dGen.oneOf(dictMonadGen)(foldable1NonEmpty)(Data$dNonEmpty.$NonEmpty(
19+ genAlphaLowercase(dictMonadGen),
20+ [genAlphaUppercase(dictMonadGen)]
21+));
22+export {foldable1NonEmpty, genAlpha, genAlphaLowercase, genAlphaUppercase, genAsciiChar, genAsciiChar$p, genDigitChar, genUnicodeChar, toEnumWithDefaults};
.storybook/purescript-indexer/output-es/Data.Char/index.jsnew file+6
@@ -0,0 +1,6 @@
1+// | A type and functions for single characters.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dEnum from "../Data.Enum/index.js";
4+const toCharCode = Data$dEnum.toCharCode;
5+const fromCharCode = Data$dEnum.charToEnum;
6+export {fromCharCode, toCharCode};
.storybook/purescript-indexer/output-es/Data.CommutativeRing/index.jsnew file+35
@@ -0,0 +1,35 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dRing from "../Data.Ring/index.js";
3+const commutativeRingUnit = {Ring0: () => Data$dRing.ringUnit};
4+const commutativeRingRecordNil = {RingRecord0: () => Data$dRing.ringRecordNil};
5+const commutativeRingRecordCons = dictIsSymbol => () => dictCommutativeRingRecord => {
6+ const ringRecordCons1 = Data$dRing.ringRecordCons(dictIsSymbol)()(dictCommutativeRingRecord.RingRecord0());
7+ return dictCommutativeRing => {
8+ const ringRecordCons2 = ringRecordCons1(dictCommutativeRing.Ring0());
9+ return {RingRecord0: () => ringRecordCons2};
10+ };
11+};
12+const commutativeRingRecord = () => dictCommutativeRingRecord => {
13+ const ringRecord1 = Data$dRing.ringRecord()(dictCommutativeRingRecord.RingRecord0());
14+ return {Ring0: () => ringRecord1};
15+};
16+const commutativeRingProxy = {Ring0: () => Data$dRing.ringProxy};
17+const commutativeRingNumber = {Ring0: () => Data$dRing.ringNumber};
18+const commutativeRingInt = {Ring0: () => Data$dRing.ringInt};
19+const commutativeRingFn = dictCommutativeRing => {
20+ const $1 = dictCommutativeRing.Ring0();
21+ const $2 = $1.Semiring0();
22+ const semiringFn = {add: f => g => x => $2.add(f(x))(g(x)), zero: v => $2.zero, mul: f => g => x => $2.mul(f(x))(g(x)), one: v => $2.one};
23+ const ringFn = {sub: f => g => x => $1.sub(f(x))(g(x)), Semiring0: () => semiringFn};
24+ return {Ring0: () => ringFn};
25+};
26+export {
27+ commutativeRingFn,
28+ commutativeRingInt,
29+ commutativeRingNumber,
30+ commutativeRingProxy,
31+ commutativeRingRecord,
32+ commutativeRingRecordCons,
33+ commutativeRingRecordNil,
34+ commutativeRingUnit
35+};
.storybook/purescript-indexer/output-es/Data.Comparison/index.jsnew file+21
@@ -0,0 +1,21 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dOrdering from "../Data.Ordering/index.js";
3+const append = f => g => x => {
4+ const $3 = f(x);
5+ const $4 = g(x);
6+ return x$1 => {
7+ const $6 = $3(x$1);
8+ const $7 = $4(x$1);
9+ if ($6.tag === "LT") { return Data$dOrdering.LT; }
10+ if ($6.tag === "GT") { return Data$dOrdering.GT; }
11+ if ($6.tag === "EQ") { return $7; }
12+ $runtime.fail();
13+ };
14+};
15+const Comparison = x => x;
16+const semigroupComparison = {append: v => v1 => append(v)(v1)};
17+const newtypeComparison = {Coercible0: () => undefined};
18+const monoidComparison = {mempty: v => v1 => Data$dOrdering.EQ, Semigroup0: () => semigroupComparison};
19+const defaultComparison = dictOrd => dictOrd.compare;
20+const contravariantComparison = {cmap: f => v => x => y => v(f(x))(f(y))};
21+export {Comparison, append, contravariantComparison, defaultComparison, monoidComparison, newtypeComparison, semigroupComparison};
.storybook/purescript-indexer/output-es/Data.Const/index.jsnew file+52
@@ -0,0 +1,52 @@
1+import * as $runtime from "../runtime.js";
2+const Const = x => x;
3+const showConst = dictShow => ({show: v => "(Const " + (dictShow.show(v) + ")")});
4+const semiringConst = dictSemiring => dictSemiring;
5+const semigroupoidConst = {compose: v => v1 => v1};
6+const semigroupConst = dictSemigroup => dictSemigroup;
7+const ringConst = dictRing => dictRing;
8+const ordConst = dictOrd => dictOrd;
9+const newtypeConst = {Coercible0: () => undefined};
10+const monoidConst = dictMonoid => dictMonoid;
11+const heytingAlgebraConst = dictHeytingAlgebra => dictHeytingAlgebra;
12+const functorConst = {map: f => m => m};
13+const invariantConst = {imap: f => v => m => m};
14+const euclideanRingConst = dictEuclideanRing => dictEuclideanRing;
15+const eqConst = dictEq => dictEq;
16+const eq1Const = dictEq => ({eq1: dictEq1 => dictEq.eq});
17+const ord1Const = dictOrd => {
18+ const $1 = dictOrd.Eq0();
19+ return {compare1: dictOrd1 => dictOrd.compare, Eq10: () => ({eq1: dictEq1 => $1.eq})};
20+};
21+const commutativeRingConst = dictCommutativeRing => dictCommutativeRing;
22+const boundedConst = dictBounded => dictBounded;
23+const booleanAlgebraConst = dictBooleanAlgebra => dictBooleanAlgebra;
24+const applyConst = dictSemigroup => ({apply: v => v1 => dictSemigroup.append(v)(v1), Functor0: () => functorConst});
25+const applicativeConst = dictMonoid => {
26+ const $1 = dictMonoid.Semigroup0();
27+ const applyConst1 = {apply: v => v1 => $1.append(v)(v1), Functor0: () => functorConst};
28+ return {pure: v => dictMonoid.mempty, Apply0: () => applyConst1};
29+};
30+export {
31+ Const,
32+ applicativeConst,
33+ applyConst,
34+ booleanAlgebraConst,
35+ boundedConst,
36+ commutativeRingConst,
37+ eq1Const,
38+ eqConst,
39+ euclideanRingConst,
40+ functorConst,
41+ heytingAlgebraConst,
42+ invariantConst,
43+ monoidConst,
44+ newtypeConst,
45+ ord1Const,
46+ ordConst,
47+ ringConst,
48+ semigroupConst,
49+ semigroupoidConst,
50+ semiringConst,
51+ showConst
52+};
.storybook/purescript-indexer/output-es/Data.Coyoneda/index.jsnew file+210
@@ -0,0 +1,210 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dSemigroup$dFoldable from "../Data.Semigroup.Foldable/index.js";
3+const $CoyonedaF = (_1, _2) => ({tag: "CoyonedaF", _1, _2});
4+const CoyonedaF = value0 => value1 => $CoyonedaF(value0, value1);
5+const Coyoneda = x => x;
6+const unCoyoneda = f => v => f(v._1)(v._2);
7+const lowerCoyoneda = dictFunctor => v => dictFunctor.map(v._1)(v._2);
8+const foldableCoyoneda = dictFoldable => (
9+ {
10+ foldr: f => z => v => dictFoldable.foldr(x => f(v._1(x)))(z)(v._2),
11+ foldl: f => z => v => dictFoldable.foldl(x => {
12+ const $5 = f(x);
13+ return x$1 => $5(v._1(x$1));
14+ })(z)(v._2),
15+ foldMap: dictMonoid => {
16+ const foldMap1 = dictFoldable.foldMap(dictMonoid);
17+ return f => v => foldMap1(x => f(v._1(x)))(v._2);
18+ }
19+ }
20+);
21+const foldable1Coyoneda = dictFoldable1 => {
22+ const foldableCoyoneda1 = foldableCoyoneda(dictFoldable1.Foldable0());
23+ return {
24+ foldMap1: dictSemigroup => {
25+ const foldMap11 = dictFoldable1.foldMap1(dictSemigroup);
26+ return f => v => foldMap11(x => f(v._1(x)))(v._2);
27+ },
28+ foldr1: Data$dSemigroup$dFoldable.foldr1Default(foldable1Coyoneda(dictFoldable1)),
29+ foldl1: Data$dSemigroup$dFoldable.foldl1Default(foldable1Coyoneda(dictFoldable1)),
30+ Foldable0: () => foldableCoyoneda1
31+ };
32+};
33+const eqCoyoneda = dictFunctor => dictEq1 => dictEq => {
34+ const eq11 = dictEq1.eq1(dictEq);
35+ return {eq: x => y => eq11(dictFunctor.map(x._1)(x._2))(dictFunctor.map(y._1)(y._2))};
36+};
37+const ordCoyoneda = dictFunctor => dictOrd1 => {
38+ const $2 = dictOrd1.Eq10();
39+ return dictOrd => {
40+ const compare11 = dictOrd1.compare1(dictOrd);
41+ const eq11 = $2.eq1(dictOrd.Eq0());
42+ const eqCoyoneda3 = {eq: x => y => eq11(dictFunctor.map(x._1)(x._2))(dictFunctor.map(y._1)(y._2))};
43+ return {compare: x => y => compare11(dictFunctor.map(x._1)(x._2))(dictFunctor.map(y._1)(y._2)), Eq0: () => eqCoyoneda3};
44+ };
45+};
46+const eq1Coyoneda = dictFunctor => dictEq1 => (
47+ {
48+ eq1: dictEq => {
49+ const eq11 = dictEq1.eq1(dictEq);
50+ return x => y => eq11(dictFunctor.map(x._1)(x._2))(dictFunctor.map(y._1)(y._2));
51+ }
52+ }
53+);
54+const ord1Coyoneda = dictFunctor => dictOrd1 => {
55+ const ordCoyoneda2 = ordCoyoneda(dictFunctor)(dictOrd1);
56+ const $3 = dictOrd1.Eq10();
57+ const eq1Coyoneda2 = {
58+ eq1: dictEq => {
59+ const eq11 = $3.eq1(dictEq);
60+ return x => y => eq11(dictFunctor.map(x._1)(x._2))(dictFunctor.map(y._1)(y._2));
61+ }
62+ };
63+ return {compare1: dictOrd => ordCoyoneda2(dictOrd).compare, Eq10: () => eq1Coyoneda2};
64+};
65+const coyoneda = k => fi => $CoyonedaF(k, fi);
66+const functorCoyoneda = {map: f => v => $CoyonedaF(x => f(v._1(x)), v._2)};
67+const invatiantCoyoneda = {imap: f => v => functorCoyoneda.map(f)};
68+const hoistCoyoneda = nat => v => $CoyonedaF(v._1, nat(v._2));
69+const liftCoyoneda = /* #__PURE__ */ coyoneda(x => x);
70+const distributiveCoyoneda = dictDistributive => {
71+ const $1 = dictDistributive.Functor0();
72+ return {
73+ collect: dictFunctor => {
74+ const collect1 = dictDistributive.collect(dictFunctor);
75+ return f => {
76+ const $5 = collect1(x => {
77+ const $6 = f(x);
78+ return $1.map($6._1)($6._2);
79+ });
80+ return x => $CoyonedaF(x$1 => x$1, $5(x));
81+ };
82+ },
83+ distribute: dictFunctor => {
84+ const $3 = dictDistributive.collect(dictFunctor)(v => $1.map(v._1)(v._2));
85+ return x => $CoyonedaF(x$1 => x$1, $3(x));
86+ },
87+ Functor0: () => functorCoyoneda
88+ };
89+};
90+const extendCoyoneda = dictExtend => ({extend: f => v => $CoyonedaF(x => x, dictExtend.extend(x => f($CoyonedaF(v._1, x)))(v._2)), Functor0: () => functorCoyoneda});
91+const monadTransCoyoneda = {lift: dictMonad => liftCoyoneda};
92+const traversableCoyoneda = dictTraversable => {
93+ const foldableCoyoneda1 = foldableCoyoneda(dictTraversable.Foldable1());
94+ return {
95+ traverse: dictApplicative => {
96+ const map = dictApplicative.Apply0().Functor0().map;
97+ const traverse1 = dictTraversable.traverse(dictApplicative);
98+ return f => v => map(liftCoyoneda)(traverse1(x => f(v._1(x)))(v._2));
99+ },
100+ sequence: dictApplicative => {
101+ const map = dictApplicative.Apply0().Functor0().map;
102+ const traverse1 = dictTraversable.traverse(dictApplicative);
103+ return v => map(liftCoyoneda)(traverse1(v._1)(v._2));
104+ },
105+ Functor0: () => functorCoyoneda,
106+ Foldable1: () => foldableCoyoneda1
107+ };
108+};
109+const traversable1Coyoneda = dictTraversable1 => {
110+ const Traversable1 = dictTraversable1.Traversable1();
111+ const map = Traversable1.Functor0().map;
112+ const foldable1Coyoneda1 = foldable1Coyoneda(dictTraversable1.Foldable10());
113+ const traversableCoyoneda1 = traversableCoyoneda(Traversable1);
114+ return {
115+ traverse1: dictApply => {
116+ const map1 = dictApply.Functor0().map;
117+ const traverse11 = dictTraversable1.traverse1(dictApply);
118+ return f => v => map1(liftCoyoneda)(traverse11(x => f(v._1(x)))(v._2));
119+ },
120+ sequence1: dictApply => {
121+ const map1 = dictApply.Functor0().map;
122+ const sequence11 = dictTraversable1.sequence1(dictApply);
123+ return v => map1(liftCoyoneda)(sequence11(map(v._1)(v._2)));
124+ },
125+ Foldable10: () => foldable1Coyoneda1,
126+ Traversable1: () => traversableCoyoneda1
127+ };
128+};
129+const comonadCoyoneda = dictComonad => {
130+ const extendCoyoneda1 = extendCoyoneda(dictComonad.Extend0());
131+ return {extract: v => v._1(dictComonad.extract(v._2)), Extend0: () => extendCoyoneda1};
132+};
133+const applyCoyoneda = dictApply => {
134+ const $1 = dictApply.Functor0();
135+ return {apply: f => g => $CoyonedaF(x => x, dictApply.apply($1.map(f._1)(f._2))($1.map(g._1)(g._2))), Functor0: () => functorCoyoneda};
136+};
137+const bindCoyoneda = dictBind => {
138+ const Apply0 = dictBind.Apply0();
139+ const $2 = Apply0.Functor0();
140+ const applyCoyoneda1 = applyCoyoneda(Apply0);
141+ return {
142+ bind: v => f => $CoyonedaF(
143+ x => x,
144+ dictBind.bind(v._2)(x => {
145+ const $7 = f(v._1(x));
146+ return $2.map($7._1)($7._2);
147+ })
148+ ),
149+ Apply0: () => applyCoyoneda1
150+ };
151+};
152+const applicativeCoyoneda = dictApplicative => {
153+ const applyCoyoneda1 = applyCoyoneda(dictApplicative.Apply0());
154+ return {pure: x => $CoyonedaF(x$1 => x$1, dictApplicative.pure(x)), Apply0: () => applyCoyoneda1};
155+};
156+const monadCoyoneda = dictMonad => {
157+ const applicativeCoyoneda1 = applicativeCoyoneda(dictMonad.Applicative0());
158+ const bindCoyoneda1 = bindCoyoneda(dictMonad.Bind1());
159+ return {Applicative0: () => applicativeCoyoneda1, Bind1: () => bindCoyoneda1};
160+};
161+const altCoyoneda = dictAlt => {
162+ const $1 = dictAlt.Functor0();
163+ return {alt: x => y => $CoyonedaF(x$1 => x$1, dictAlt.alt($1.map(x._1)(x._2))($1.map(y._1)(y._2))), Functor0: () => functorCoyoneda};
164+};
165+const plusCoyoneda = dictPlus => {
166+ const altCoyoneda1 = altCoyoneda(dictPlus.Alt0());
167+ return {empty: $CoyonedaF(x => x, dictPlus.empty), Alt0: () => altCoyoneda1};
168+};
169+const alternativeCoyoneda = dictAlternative => {
170+ const applicativeCoyoneda1 = applicativeCoyoneda(dictAlternative.Applicative0());
171+ const plusCoyoneda1 = plusCoyoneda(dictAlternative.Plus1());
172+ return {Applicative0: () => applicativeCoyoneda1, Plus1: () => plusCoyoneda1};
173+};
174+const monadPlusCoyoneda = dictMonadPlus => {
175+ const monadCoyoneda1 = monadCoyoneda(dictMonadPlus.Monad0());
176+ const alternativeCoyoneda1 = alternativeCoyoneda(dictMonadPlus.Alternative1());
177+ return {Monad0: () => monadCoyoneda1, Alternative1: () => alternativeCoyoneda1};
178+};
179+export {
180+ $CoyonedaF,
181+ Coyoneda,
182+ CoyonedaF,
183+ altCoyoneda,
184+ alternativeCoyoneda,
185+ applicativeCoyoneda,
186+ applyCoyoneda,
187+ bindCoyoneda,
188+ comonadCoyoneda,
189+ coyoneda,
190+ distributiveCoyoneda,
191+ eq1Coyoneda,
192+ eqCoyoneda,
193+ extendCoyoneda,
194+ foldable1Coyoneda,
195+ foldableCoyoneda,
196+ functorCoyoneda,
197+ hoistCoyoneda,
198+ invatiantCoyoneda,
199+ liftCoyoneda,
200+ lowerCoyoneda,
201+ monadCoyoneda,
202+ monadPlusCoyoneda,
203+ monadTransCoyoneda,
204+ ord1Coyoneda,
205+ ordCoyoneda,
206+ plusCoyoneda,
207+ traversable1Coyoneda,
208+ traversableCoyoneda,
209+ unCoyoneda
210+};
.storybook/purescript-indexer/output-es/Data.Date.Component.Gen/index.jsnew file+11
@@ -0,0 +1,11 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDate$dComponent from "../Data.Date.Component/index.js";
3+import * as Data$dEnum$dGen from "../Data.Enum.Gen/index.js";
4+const genYear = dictMonadGen => dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(x => {
5+ if (x >= -271820 && x <= 275759) { return x; }
6+ $runtime.fail();
7+})(dictMonadGen.chooseInt(1900)(2100));
8+const genWeekday = dictMonadGen => Data$dEnum$dGen.genBoundedEnum(dictMonadGen)(Data$dDate$dComponent.boundedEnumWeekday);
9+const genMonth = dictMonadGen => Data$dEnum$dGen.genBoundedEnum(dictMonadGen)(Data$dDate$dComponent.boundedEnumMonth);
10+const genDay = dictMonadGen => Data$dEnum$dGen.genBoundedEnum(dictMonadGen)(Data$dDate$dComponent.boundedEnumDay);
11+export {genDay, genMonth, genWeekday, genYear};
.storybook/purescript-indexer/output-es/Data.Date.Component/index.jsnew file+409
@@ -0,0 +1,409 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEq from "../Data.Eq/index.js";
3+import * as Data$dMaybe from "../Data.Maybe/index.js";
4+import * as Data$dOrd from "../Data.Ord/index.js";
5+import * as Data$dOrdering from "../Data.Ordering/index.js";
6+import * as Data$dShow from "../Data.Show/index.js";
7+const $Month = tag => ({tag});
8+const $Weekday = tag => ({tag});
9+const Monday = /* #__PURE__ */ $Weekday("Monday");
10+const Tuesday = /* #__PURE__ */ $Weekday("Tuesday");
11+const Wednesday = /* #__PURE__ */ $Weekday("Wednesday");
12+const Thursday = /* #__PURE__ */ $Weekday("Thursday");
13+const Friday = /* #__PURE__ */ $Weekday("Friday");
14+const Saturday = /* #__PURE__ */ $Weekday("Saturday");
15+const Sunday = /* #__PURE__ */ $Weekday("Sunday");
16+const January = /* #__PURE__ */ $Month("January");
17+const February = /* #__PURE__ */ $Month("February");
18+const March = /* #__PURE__ */ $Month("March");
19+const April = /* #__PURE__ */ $Month("April");
20+const May = /* #__PURE__ */ $Month("May");
21+const June = /* #__PURE__ */ $Month("June");
22+const July = /* #__PURE__ */ $Month("July");
23+const August = /* #__PURE__ */ $Month("August");
24+const September = /* #__PURE__ */ $Month("September");
25+const October = /* #__PURE__ */ $Month("October");
26+const November = /* #__PURE__ */ $Month("November");
27+const December = /* #__PURE__ */ $Month("December");
28+const showYear = {show: v => "(Year " + (Data$dShow.showIntImpl(v) + ")")};
29+const showWeekday = {
30+ show: v => {
31+ if (v.tag === "Monday") { return "Monday"; }
32+ if (v.tag === "Tuesday") { return "Tuesday"; }
33+ if (v.tag === "Wednesday") { return "Wednesday"; }
34+ if (v.tag === "Thursday") { return "Thursday"; }
35+ if (v.tag === "Friday") { return "Friday"; }
36+ if (v.tag === "Saturday") { return "Saturday"; }
37+ if (v.tag === "Sunday") { return "Sunday"; }
38+ $runtime.fail();
39+ }
40+};
41+const showMonth = {
42+ show: v => {
43+ if (v.tag === "January") { return "January"; }
44+ if (v.tag === "February") { return "February"; }
45+ if (v.tag === "March") { return "March"; }
46+ if (v.tag === "April") { return "April"; }
47+ if (v.tag === "May") { return "May"; }
48+ if (v.tag === "June") { return "June"; }
49+ if (v.tag === "July") { return "July"; }
50+ if (v.tag === "August") { return "August"; }
51+ if (v.tag === "September") { return "September"; }
52+ if (v.tag === "October") { return "October"; }
53+ if (v.tag === "November") { return "November"; }
54+ if (v.tag === "December") { return "December"; }
55+ $runtime.fail();
56+ }
57+};
58+const showDay = {show: v => "(Day " + (Data$dShow.showIntImpl(v) + ")")};
59+const ordYear = Data$dOrd.ordInt;
60+const ordDay = Data$dOrd.ordInt;
61+const eqYear = Data$dEq.eqInt;
62+const eqWeekday = {
63+ eq: x => y => {
64+ if (x.tag === "Monday") { return y.tag === "Monday"; }
65+ if (x.tag === "Tuesday") { return y.tag === "Tuesday"; }
66+ if (x.tag === "Wednesday") { return y.tag === "Wednesday"; }
67+ if (x.tag === "Thursday") { return y.tag === "Thursday"; }
68+ if (x.tag === "Friday") { return y.tag === "Friday"; }
69+ if (x.tag === "Saturday") { return y.tag === "Saturday"; }
70+ if (x.tag === "Sunday") { return y.tag === "Sunday"; }
71+ return false;
72+ }
73+};
74+const ordWeekday = {
75+ compare: x => y => {
76+ if (x.tag === "Monday") {
77+ if (y.tag === "Monday") { return Data$dOrdering.EQ; }
78+ return Data$dOrdering.LT;
79+ }
80+ if (y.tag === "Monday") { return Data$dOrdering.GT; }
81+ if (x.tag === "Tuesday") {
82+ if (y.tag === "Tuesday") { return Data$dOrdering.EQ; }
83+ return Data$dOrdering.LT;
84+ }
85+ if (y.tag === "Tuesday") { return Data$dOrdering.GT; }
86+ if (x.tag === "Wednesday") {
87+ if (y.tag === "Wednesday") { return Data$dOrdering.EQ; }
88+ return Data$dOrdering.LT;
89+ }
90+ if (y.tag === "Wednesday") { return Data$dOrdering.GT; }
91+ if (x.tag === "Thursday") {
92+ if (y.tag === "Thursday") { return Data$dOrdering.EQ; }
93+ return Data$dOrdering.LT;
94+ }
95+ if (y.tag === "Thursday") { return Data$dOrdering.GT; }
96+ if (x.tag === "Friday") {
97+ if (y.tag === "Friday") { return Data$dOrdering.EQ; }
98+ return Data$dOrdering.LT;
99+ }
100+ if (y.tag === "Friday") { return Data$dOrdering.GT; }
101+ if (x.tag === "Saturday") {
102+ if (y.tag === "Saturday") { return Data$dOrdering.EQ; }
103+ return Data$dOrdering.LT;
104+ }
105+ if (y.tag === "Saturday") { return Data$dOrdering.GT; }
106+ if (x.tag === "Sunday") {
107+ if (y.tag === "Sunday") { return Data$dOrdering.EQ; }
108+ $runtime.fail();
109+ }
110+ $runtime.fail();
111+ },
112+ Eq0: () => eqWeekday
113+};
114+const eqMonth = {
115+ eq: x => y => {
116+ if (x.tag === "January") { return y.tag === "January"; }
117+ if (x.tag === "February") { return y.tag === "February"; }
118+ if (x.tag === "March") { return y.tag === "March"; }
119+ if (x.tag === "April") { return y.tag === "April"; }
120+ if (x.tag === "May") { return y.tag === "May"; }
121+ if (x.tag === "June") { return y.tag === "June"; }
122+ if (x.tag === "July") { return y.tag === "July"; }
123+ if (x.tag === "August") { return y.tag === "August"; }
124+ if (x.tag === "September") { return y.tag === "September"; }
125+ if (x.tag === "October") { return y.tag === "October"; }
126+ if (x.tag === "November") { return y.tag === "November"; }
127+ if (x.tag === "December") { return y.tag === "December"; }
128+ return false;
129+ }
130+};
131+const ordMonth = {
132+ compare: x => y => {
133+ if (x.tag === "January") {
134+ if (y.tag === "January") { return Data$dOrdering.EQ; }
135+ return Data$dOrdering.LT;
136+ }
137+ if (y.tag === "January") { return Data$dOrdering.GT; }
138+ if (x.tag === "February") {
139+ if (y.tag === "February") { return Data$dOrdering.EQ; }
140+ return Data$dOrdering.LT;
141+ }
142+ if (y.tag === "February") { return Data$dOrdering.GT; }
143+ if (x.tag === "March") {
144+ if (y.tag === "March") { return Data$dOrdering.EQ; }
145+ return Data$dOrdering.LT;
146+ }
147+ if (y.tag === "March") { return Data$dOrdering.GT; }
148+ if (x.tag === "April") {
149+ if (y.tag === "April") { return Data$dOrdering.EQ; }
150+ return Data$dOrdering.LT;
151+ }
152+ if (y.tag === "April") { return Data$dOrdering.GT; }
153+ if (x.tag === "May") {
154+ if (y.tag === "May") { return Data$dOrdering.EQ; }
155+ return Data$dOrdering.LT;
156+ }
157+ if (y.tag === "May") { return Data$dOrdering.GT; }
158+ if (x.tag === "June") {
159+ if (y.tag === "June") { return Data$dOrdering.EQ; }
160+ return Data$dOrdering.LT;
161+ }
162+ if (y.tag === "June") { return Data$dOrdering.GT; }
163+ if (x.tag === "July") {
164+ if (y.tag === "July") { return Data$dOrdering.EQ; }
165+ return Data$dOrdering.LT;
166+ }
167+ if (y.tag === "July") { return Data$dOrdering.GT; }
168+ if (x.tag === "August") {
169+ if (y.tag === "August") { return Data$dOrdering.EQ; }
170+ return Data$dOrdering.LT;
171+ }
172+ if (y.tag === "August") { return Data$dOrdering.GT; }
173+ if (x.tag === "September") {
174+ if (y.tag === "September") { return Data$dOrdering.EQ; }
175+ return Data$dOrdering.LT;
176+ }
177+ if (y.tag === "September") { return Data$dOrdering.GT; }
178+ if (x.tag === "October") {
179+ if (y.tag === "October") { return Data$dOrdering.EQ; }
180+ return Data$dOrdering.LT;
181+ }
182+ if (y.tag === "October") { return Data$dOrdering.GT; }
183+ if (x.tag === "November") {
184+ if (y.tag === "November") { return Data$dOrdering.EQ; }
185+ return Data$dOrdering.LT;
186+ }
187+ if (y.tag === "November") { return Data$dOrdering.GT; }
188+ if (x.tag === "December") {
189+ if (y.tag === "December") { return Data$dOrdering.EQ; }
190+ $runtime.fail();
191+ }
192+ $runtime.fail();
193+ },
194+ Eq0: () => eqMonth
195+};
196+const eqDay = Data$dEq.eqInt;
197+const boundedYear = {bottom: -271820, top: 275759, Ord0: () => Data$dOrd.ordInt};
198+const boundedWeekday = {bottom: Monday, top: Sunday, Ord0: () => ordWeekday};
199+const boundedMonth = {bottom: January, top: December, Ord0: () => ordMonth};
200+const boundedEnumYear = {
201+ cardinality: 547580,
202+ toEnum: n => {
203+ if (n >= -271820 && n <= 275759) { return Data$dMaybe.$Maybe("Just", n); }
204+ return Data$dMaybe.Nothing;
205+ },
206+ fromEnum: v => v,
207+ Bounded0: () => boundedYear,
208+ Enum1: () => enumYear
209+};
210+const enumYear = {
211+ succ: x => {
212+ const $1 = x + 1 | 0;
213+ if ($1 >= -271820 && $1 <= 275759) { return Data$dMaybe.$Maybe("Just", $1); }
214+ return Data$dMaybe.Nothing;
215+ },
216+ pred: x => {
217+ const $1 = x - 1 | 0;
218+ if ($1 >= -271820 && $1 <= 275759) { return Data$dMaybe.$Maybe("Just", $1); }
219+ return Data$dMaybe.Nothing;
220+ },
221+ Ord0: () => Data$dOrd.ordInt
222+};
223+const boundedEnumWeekday = {
224+ cardinality: 7,
225+ toEnum: v => {
226+ if (v === 1) { return Data$dMaybe.$Maybe("Just", Monday); }
227+ if (v === 2) { return Data$dMaybe.$Maybe("Just", Tuesday); }
228+ if (v === 3) { return Data$dMaybe.$Maybe("Just", Wednesday); }
229+ if (v === 4) { return Data$dMaybe.$Maybe("Just", Thursday); }
230+ if (v === 5) { return Data$dMaybe.$Maybe("Just", Friday); }
231+ if (v === 6) { return Data$dMaybe.$Maybe("Just", Saturday); }
232+ if (v === 7) { return Data$dMaybe.$Maybe("Just", Sunday); }
233+ return Data$dMaybe.Nothing;
234+ },
235+ fromEnum: v => {
236+ if (v.tag === "Monday") { return 1; }
237+ if (v.tag === "Tuesday") { return 2; }
238+ if (v.tag === "Wednesday") { return 3; }
239+ if (v.tag === "Thursday") { return 4; }
240+ if (v.tag === "Friday") { return 5; }
241+ if (v.tag === "Saturday") { return 6; }
242+ if (v.tag === "Sunday") { return 7; }
243+ $runtime.fail();
244+ },
245+ Bounded0: () => boundedWeekday,
246+ Enum1: () => enumWeekday
247+};
248+const enumWeekday = {
249+ succ: x => boundedEnumWeekday.toEnum((() => {
250+ if (x.tag === "Monday") { return 2; }
251+ if (x.tag === "Tuesday") { return 3; }
252+ if (x.tag === "Wednesday") { return 4; }
253+ if (x.tag === "Thursday") { return 5; }
254+ if (x.tag === "Friday") { return 6; }
255+ if (x.tag === "Saturday") { return 7; }
256+ if (x.tag === "Sunday") { return 8; }
257+ $runtime.fail();
258+ })()),
259+ pred: x => boundedEnumWeekday.toEnum((() => {
260+ if (x.tag === "Monday") { return 0; }
261+ if (x.tag === "Tuesday") { return 1; }
262+ if (x.tag === "Wednesday") { return 2; }
263+ if (x.tag === "Thursday") { return 3; }
264+ if (x.tag === "Friday") { return 4; }
265+ if (x.tag === "Saturday") { return 5; }
266+ if (x.tag === "Sunday") { return 6; }
267+ $runtime.fail();
268+ })()),
269+ Ord0: () => ordWeekday
270+};
271+const boundedEnumMonth = {
272+ cardinality: 12,
273+ toEnum: v => {
274+ if (v === 1) { return Data$dMaybe.$Maybe("Just", January); }
275+ if (v === 2) { return Data$dMaybe.$Maybe("Just", February); }
276+ if (v === 3) { return Data$dMaybe.$Maybe("Just", March); }
277+ if (v === 4) { return Data$dMaybe.$Maybe("Just", April); }
278+ if (v === 5) { return Data$dMaybe.$Maybe("Just", May); }
279+ if (v === 6) { return Data$dMaybe.$Maybe("Just", June); }
280+ if (v === 7) { return Data$dMaybe.$Maybe("Just", July); }
281+ if (v === 8) { return Data$dMaybe.$Maybe("Just", August); }
282+ if (v === 9) { return Data$dMaybe.$Maybe("Just", September); }
283+ if (v === 10) { return Data$dMaybe.$Maybe("Just", October); }
284+ if (v === 11) { return Data$dMaybe.$Maybe("Just", November); }
285+ if (v === 12) { return Data$dMaybe.$Maybe("Just", December); }
286+ return Data$dMaybe.Nothing;
287+ },
288+ fromEnum: v => {
289+ if (v.tag === "January") { return 1; }
290+ if (v.tag === "February") { return 2; }
291+ if (v.tag === "March") { return 3; }
292+ if (v.tag === "April") { return 4; }
293+ if (v.tag === "May") { return 5; }
294+ if (v.tag === "June") { return 6; }
295+ if (v.tag === "July") { return 7; }
296+ if (v.tag === "August") { return 8; }
297+ if (v.tag === "September") { return 9; }
298+ if (v.tag === "October") { return 10; }
299+ if (v.tag === "November") { return 11; }
300+ if (v.tag === "December") { return 12; }
301+ $runtime.fail();
302+ },
303+ Bounded0: () => boundedMonth,
304+ Enum1: () => enumMonth
305+};
306+const enumMonth = {
307+ succ: x => boundedEnumMonth.toEnum((() => {
308+ if (x.tag === "January") { return 2; }
309+ if (x.tag === "February") { return 3; }
310+ if (x.tag === "March") { return 4; }
311+ if (x.tag === "April") { return 5; }
312+ if (x.tag === "May") { return 6; }
313+ if (x.tag === "June") { return 7; }
314+ if (x.tag === "July") { return 8; }
315+ if (x.tag === "August") { return 9; }
316+ if (x.tag === "September") { return 10; }
317+ if (x.tag === "October") { return 11; }
318+ if (x.tag === "November") { return 12; }
319+ if (x.tag === "December") { return 13; }
320+ $runtime.fail();
321+ })()),
322+ pred: x => boundedEnumMonth.toEnum((() => {
323+ if (x.tag === "January") { return 0; }
324+ if (x.tag === "February") { return 1; }
325+ if (x.tag === "March") { return 2; }
326+ if (x.tag === "April") { return 3; }
327+ if (x.tag === "May") { return 4; }
328+ if (x.tag === "June") { return 5; }
329+ if (x.tag === "July") { return 6; }
330+ if (x.tag === "August") { return 7; }
331+ if (x.tag === "September") { return 8; }
332+ if (x.tag === "October") { return 9; }
333+ if (x.tag === "November") { return 10; }
334+ if (x.tag === "December") { return 11; }
335+ $runtime.fail();
336+ })()),
337+ Ord0: () => ordMonth
338+};
339+const boundedDay = {bottom: 1, top: 31, Ord0: () => Data$dOrd.ordInt};
340+const boundedEnumDay = {
341+ cardinality: 31,
342+ toEnum: n => {
343+ if (n >= 1 && n <= 31) { return Data$dMaybe.$Maybe("Just", n); }
344+ return Data$dMaybe.Nothing;
345+ },
346+ fromEnum: v => v,
347+ Bounded0: () => boundedDay,
348+ Enum1: () => enumDay
349+};
350+const enumDay = {
351+ succ: x => {
352+ const $1 = x + 1 | 0;
353+ if ($1 >= 1 && $1 <= 31) { return Data$dMaybe.$Maybe("Just", $1); }
354+ return Data$dMaybe.Nothing;
355+ },
356+ pred: x => {
357+ const $1 = x - 1 | 0;
358+ if ($1 >= 1 && $1 <= 31) { return Data$dMaybe.$Maybe("Just", $1); }
359+ return Data$dMaybe.Nothing;
360+ },
361+ Ord0: () => Data$dOrd.ordInt
362+};
363+export {
364+ $Month,
365+ $Weekday,
366+ April,
367+ August,
368+ December,
369+ February,
370+ Friday,
371+ January,
372+ July,
373+ June,
374+ March,
375+ May,
376+ Monday,
377+ November,
378+ October,
379+ Saturday,
380+ September,
381+ Sunday,
382+ Thursday,
383+ Tuesday,
384+ Wednesday,
385+ boundedDay,
386+ boundedEnumDay,
387+ boundedEnumMonth,
388+ boundedEnumWeekday,
389+ boundedEnumYear,
390+ boundedMonth,
391+ boundedWeekday,
392+ boundedYear,
393+ enumDay,
394+ enumMonth,
395+ enumWeekday,
396+ enumYear,
397+ eqDay,
398+ eqMonth,
399+ eqWeekday,
400+ eqYear,
401+ ordDay,
402+ ordMonth,
403+ ordWeekday,
404+ ordYear,
405+ showDay,
406+ showMonth,
407+ showWeekday,
408+ showYear
409+};
.storybook/purescript-indexer/output-es/Data.Date.Gen/index.jsnew file+28
@@ -0,0 +1,28 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDate from "../Data.Date/index.js";
3+import * as Data$dDate$dComponent from "../Data.Date.Component/index.js";
4+import * as Data$dInt from "../Data.Int/index.js";
5+import * as Data$dMaybe from "../Data.Maybe/index.js";
6+const genDate = dictMonadGen => {
7+ const Monad0 = dictMonadGen.Monad0();
8+ const Bind1 = Monad0.Bind1();
9+ const map = Bind1.Apply0().Functor0().map;
10+ const pure = Monad0.Applicative0().pure;
11+ return Bind1.bind(dictMonadGen.Monad0().Bind1().Apply0().Functor0().map(x => {
12+ if (x >= -271820 && x <= 275759) { return x; }
13+ $runtime.fail();
14+ })(dictMonadGen.chooseInt(1900)(2100)))(year => Bind1.bind(map(x => Data$dInt.toNumber(x))(dictMonadGen.chooseInt(0)((() => {
15+ if (Data$dDate.isLeapYear(year)) { return 365; }
16+ return 364;
17+ })())))(days => pure((() => {
18+ const $7 = Data$dDate.exactDate(year)(Data$dDate$dComponent.January)(1);
19+ const $8 = (() => {
20+ if ($7.tag === "Just") { return Data$dDate.adjust(days)($7._1); }
21+ if ($7.tag === "Nothing") { return Data$dMaybe.Nothing; }
22+ $runtime.fail();
23+ })();
24+ if ($8.tag === "Just") { return $8._1; }
25+ $runtime.fail();
26+ })())));
27+};
28+export {genDate};
.storybook/purescript-indexer/output-es/Data.Date/foreign.jsnew file+22
@@ -0,0 +1,22 @@
1+var createDate = function (y, m, d) {
2+ var date = new Date(Date.UTC(y, m, d));
3+ if (y >= 0 && y < 100) {
4+ date.setUTCFullYear(y);
5+ }
6+ return date;
7+};
8+
9+export function canonicalDateImpl(ctor, y, m, d) {
10+ var date = createDate(y, m - 1, d);
11+ return ctor(date.getUTCFullYear())(date.getUTCMonth() + 1)(date.getUTCDate());
12+}
13+
14+export function calcWeekday(y, m, d) {
15+ return createDate(y, m - 1, d).getUTCDay();
16+}
17+
18+export function calcDiff(y1, m1, d1, y2, m2, d2) {
19+ var dt1 = createDate(y1, m1 - 1, d1);
20+ var dt2 = createDate(y2, m2 - 1, d2);
21+ return dt1.getTime() - dt2.getTime();
22+}
.storybook/purescript-indexer/output-es/Data.Date/index.jsnew file+358
@@ -0,0 +1,358 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDate$dComponent from "../Data.Date.Component/index.js";
3+import * as Data$dEuclideanRing from "../Data.EuclideanRing/index.js";
4+import * as Data$dInt from "../Data.Int/index.js";
5+import * as Data$dMaybe from "../Data.Maybe/index.js";
6+import * as Data$dOrd from "../Data.Ord/index.js";
7+import * as Data$dOrdering from "../Data.Ordering/index.js";
8+import * as Data$dShow from "../Data.Show/index.js";
9+import {calcDiff, calcWeekday, canonicalDateImpl} from "./foreign.js";
10+const $Date = (_1, _2, _3) => ({tag: "Date", _1, _2, _3});
11+const greaterThan = /* #__PURE__ */ (() => {
12+ const $0 = Data$dMaybe.ordMaybe(Data$dOrd.ordInt);
13+ return a1 => a2 => $0.compare(a1)(a2).tag === "GT";
14+})();
15+const $$Date = value0 => value1 => value2 => $Date(value0, value1, value2);
16+const year = v => v._1;
17+const weekday = v => {
18+ const n = calcWeekday(
19+ v._1,
20+ (() => {
21+ if (v._2.tag === "January") { return 1; }
22+ if (v._2.tag === "February") { return 2; }
23+ if (v._2.tag === "March") { return 3; }
24+ if (v._2.tag === "April") { return 4; }
25+ if (v._2.tag === "May") { return 5; }
26+ if (v._2.tag === "June") { return 6; }
27+ if (v._2.tag === "July") { return 7; }
28+ if (v._2.tag === "August") { return 8; }
29+ if (v._2.tag === "September") { return 9; }
30+ if (v._2.tag === "October") { return 10; }
31+ if (v._2.tag === "November") { return 11; }
32+ if (v._2.tag === "December") { return 12; }
33+ $runtime.fail();
34+ })(),
35+ v._3
36+ );
37+ if (n === 0) {
38+ const $2 = Data$dDate$dComponent.boundedEnumWeekday.toEnum(7);
39+ if ($2.tag === "Just") { return $2._1; }
40+ $runtime.fail();
41+ }
42+ const $2 = Data$dDate$dComponent.boundedEnumWeekday.toEnum(n);
43+ if ($2.tag === "Just") { return $2._1; }
44+ $runtime.fail();
45+};
46+const showDate = {
47+ show: v => "(Date (Year " + (Data$dShow.showIntImpl(v._1) + ")") + (
48+ " " + (
49+ (() => {
50+ if (v._2.tag === "January") { return "January"; }
51+ if (v._2.tag === "February") { return "February"; }
52+ if (v._2.tag === "March") { return "March"; }
53+ if (v._2.tag === "April") { return "April"; }
54+ if (v._2.tag === "May") { return "May"; }
55+ if (v._2.tag === "June") { return "June"; }
56+ if (v._2.tag === "July") { return "July"; }
57+ if (v._2.tag === "August") { return "August"; }
58+ if (v._2.tag === "September") { return "September"; }
59+ if (v._2.tag === "October") { return "October"; }
60+ if (v._2.tag === "November") { return "November"; }
61+ if (v._2.tag === "December") { return "December"; }
62+ $runtime.fail();
63+ })() + (" (Day " + Data$dShow.showIntImpl(v._3) + "))")
64+ )
65+ )
66+};
67+const month = v => v._2;
68+const isLeapYear = y => Data$dEuclideanRing.intMod(y)(4) === 0 && (Data$dEuclideanRing.intMod(y)(400) === 0 || Data$dEuclideanRing.intMod(y)(100) !== 0);
69+const lastDayOfMonth = y => m => {
70+ if (m.tag === "January") { return 31; }
71+ if (m.tag === "February") {
72+ if (isLeapYear(y)) { return 29; }
73+ return 28;
74+ }
75+ if (m.tag === "March") { return 31; }
76+ if (m.tag === "April") { return 30; }
77+ if (m.tag === "May") { return 31; }
78+ if (m.tag === "June") { return 30; }
79+ if (m.tag === "July") { return 31; }
80+ if (m.tag === "August") { return 31; }
81+ if (m.tag === "September") { return 30; }
82+ if (m.tag === "October") { return 31; }
83+ if (m.tag === "November") { return 30; }
84+ if (m.tag === "December") { return 31; }
85+ $runtime.fail();
86+};
87+const eqDate = {
88+ eq: x => y => x._1 === y._1 && (() => {
89+ if (x._2.tag === "January") { return y._2.tag === "January"; }
90+ if (x._2.tag === "February") { return y._2.tag === "February"; }
91+ if (x._2.tag === "March") { return y._2.tag === "March"; }
92+ if (x._2.tag === "April") { return y._2.tag === "April"; }
93+ if (x._2.tag === "May") { return y._2.tag === "May"; }
94+ if (x._2.tag === "June") { return y._2.tag === "June"; }
95+ if (x._2.tag === "July") { return y._2.tag === "July"; }
96+ if (x._2.tag === "August") { return y._2.tag === "August"; }
97+ if (x._2.tag === "September") { return y._2.tag === "September"; }
98+ if (x._2.tag === "October") { return y._2.tag === "October"; }
99+ if (x._2.tag === "November") { return y._2.tag === "November"; }
100+ if (x._2.tag === "December") { return y._2.tag === "December"; }
101+ return false;
102+ })() && x._3 === y._3
103+};
104+const ordDate = {
105+ compare: x => y => {
106+ const v = Data$dOrd.ordInt.compare(x._1)(y._1);
107+ if (v.tag === "LT") { return Data$dOrdering.LT; }
108+ if (v.tag === "GT") { return Data$dOrdering.GT; }
109+ const v1 = Data$dDate$dComponent.ordMonth.compare(x._2)(y._2);
110+ if (v1.tag === "LT") { return Data$dOrdering.LT; }
111+ if (v1.tag === "GT") { return Data$dOrdering.GT; }
112+ return Data$dOrd.ordInt.compare(x._3)(y._3);
113+ },
114+ Eq0: () => eqDate
115+};
116+const enumDate = {
117+ succ: v => {
118+ const sm = Data$dDate$dComponent.enumMonth.succ(v._2);
119+ const $2 = v._3 + 1 | 0;
120+ const v1 = (() => {
121+ if ($2 >= 1 && $2 <= 31) { return Data$dMaybe.$Maybe("Just", $2); }
122+ return Data$dMaybe.Nothing;
123+ })();
124+ const sd = (() => {
125+ if (greaterThan(v1)(Data$dMaybe.$Maybe("Just", lastDayOfMonth(v._1)(v._2)))) { return Data$dMaybe.Nothing; }
126+ return v1;
127+ })();
128+ return Data$dMaybe.applyMaybe.apply(Data$dMaybe.applyMaybe.apply((() => {
129+ if (
130+ (() => {
131+ if (sd.tag === "Nothing") { return true; }
132+ if (sd.tag === "Just") { return false; }
133+ $runtime.fail();
134+ })() && (() => {
135+ if (sm.tag === "Nothing") { return true; }
136+ if (sm.tag === "Just") { return false; }
137+ $runtime.fail();
138+ })()
139+ ) {
140+ const $5 = v._1 + 1 | 0;
141+ if ($5 >= -271820 && $5 <= 275759) { return Data$dMaybe.$Maybe("Just", $$Date($5)); }
142+ return Data$dMaybe.Nothing;
143+ }
144+ return Data$dMaybe.$Maybe("Just", $$Date(v._1));
145+ })())(Data$dMaybe.$Maybe(
146+ "Just",
147+ (() => {
148+ if (
149+ (() => {
150+ if (sd.tag === "Nothing") { return true; }
151+ if (sd.tag === "Just") { return false; }
152+ $runtime.fail();
153+ })()
154+ ) {
155+ if (sm.tag === "Nothing") { return Data$dDate$dComponent.January; }
156+ if (sm.tag === "Just") { return sm._1; }
157+ $runtime.fail();
158+ }
159+ return v._2;
160+ })()
161+ )))((() => {
162+ if (
163+ (() => {
164+ if (sd.tag === "Nothing") { return true; }
165+ if (sd.tag === "Just") { return false; }
166+ $runtime.fail();
167+ })()
168+ ) {
169+ return Data$dMaybe.$Maybe("Just", 1);
170+ }
171+ return sd;
172+ })());
173+ },
174+ pred: v => {
175+ const pm = Data$dDate$dComponent.enumMonth.pred(v._2);
176+ const $2 = v._3 - 1 | 0;
177+ const pd = (() => {
178+ if ($2 >= 1 && $2 <= 31) { return Data$dMaybe.$Maybe("Just", $2); }
179+ return Data$dMaybe.Nothing;
180+ })();
181+ const m$p = (() => {
182+ if (
183+ (() => {
184+ if (pd.tag === "Nothing") { return true; }
185+ if (pd.tag === "Just") { return false; }
186+ $runtime.fail();
187+ })()
188+ ) {
189+ if (pm.tag === "Nothing") { return Data$dDate$dComponent.December; }
190+ if (pm.tag === "Just") { return pm._1; }
191+ $runtime.fail();
192+ }
193+ return v._2;
194+ })();
195+ const l = lastDayOfMonth(v._1)(m$p);
196+ return Data$dMaybe.applyMaybe.apply(Data$dMaybe.applyMaybe.apply((() => {
197+ if (
198+ (() => {
199+ if (pd.tag === "Nothing") { return true; }
200+ if (pd.tag === "Just") { return false; }
201+ $runtime.fail();
202+ })() && (() => {
203+ if (pm.tag === "Nothing") { return true; }
204+ if (pm.tag === "Just") { return false; }
205+ $runtime.fail();
206+ })()
207+ ) {
208+ const $6 = v._1 - 1 | 0;
209+ if ($6 >= -271820 && $6 <= 275759) { return Data$dMaybe.$Maybe("Just", $$Date($6)); }
210+ return Data$dMaybe.Nothing;
211+ }
212+ return Data$dMaybe.$Maybe("Just", $$Date(v._1));
213+ })())(Data$dMaybe.$Maybe("Just", m$p)))((() => {
214+ if (
215+ (() => {
216+ if (pd.tag === "Nothing") { return true; }
217+ if (pd.tag === "Just") { return false; }
218+ $runtime.fail();
219+ })()
220+ ) {
221+ return Data$dMaybe.$Maybe("Just", l);
222+ }
223+ return pd;
224+ })());
225+ },
226+ Ord0: () => ordDate
227+};
228+const diff = dictDuration => v => v1 => dictDuration.toDuration(calcDiff(
229+ v._1,
230+ (() => {
231+ if (v._2.tag === "January") { return 1; }
232+ if (v._2.tag === "February") { return 2; }
233+ if (v._2.tag === "March") { return 3; }
234+ if (v._2.tag === "April") { return 4; }
235+ if (v._2.tag === "May") { return 5; }
236+ if (v._2.tag === "June") { return 6; }
237+ if (v._2.tag === "July") { return 7; }
238+ if (v._2.tag === "August") { return 8; }
239+ if (v._2.tag === "September") { return 9; }
240+ if (v._2.tag === "October") { return 10; }
241+ if (v._2.tag === "November") { return 11; }
242+ if (v._2.tag === "December") { return 12; }
243+ $runtime.fail();
244+ })(),
245+ v._3,
246+ v1._1,
247+ (() => {
248+ if (v1._2.tag === "January") { return 1; }
249+ if (v1._2.tag === "February") { return 2; }
250+ if (v1._2.tag === "March") { return 3; }
251+ if (v1._2.tag === "April") { return 4; }
252+ if (v1._2.tag === "May") { return 5; }
253+ if (v1._2.tag === "June") { return 6; }
254+ if (v1._2.tag === "July") { return 7; }
255+ if (v1._2.tag === "August") { return 8; }
256+ if (v1._2.tag === "September") { return 9; }
257+ if (v1._2.tag === "October") { return 10; }
258+ if (v1._2.tag === "November") { return 11; }
259+ if (v1._2.tag === "December") { return 12; }
260+ $runtime.fail();
261+ })(),
262+ v1._3
263+));
264+const day = v => v._3;
265+const canonicalDate = y => m => d => canonicalDateImpl(
266+ y$p => m$p => d$p => $Date(
267+ y$p,
268+ (() => {
269+ const $6 = Data$dDate$dComponent.boundedEnumMonth.toEnum(m$p);
270+ if ($6.tag === "Just") { return $6._1; }
271+ $runtime.fail();
272+ })(),
273+ d$p
274+ ),
275+ y,
276+ (() => {
277+ if (m.tag === "January") { return 1; }
278+ if (m.tag === "February") { return 2; }
279+ if (m.tag === "March") { return 3; }
280+ if (m.tag === "April") { return 4; }
281+ if (m.tag === "May") { return 5; }
282+ if (m.tag === "June") { return 6; }
283+ if (m.tag === "July") { return 7; }
284+ if (m.tag === "August") { return 8; }
285+ if (m.tag === "September") { return 9; }
286+ if (m.tag === "October") { return 10; }
287+ if (m.tag === "November") { return 11; }
288+ if (m.tag === "December") { return 12; }
289+ $runtime.fail();
290+ })(),
291+ d
292+);
293+const exactDate = y => m => d => {
294+ if (eqDate.eq(canonicalDate(y)(m)(d))($Date(y, m, d))) { return Data$dMaybe.$Maybe("Just", $Date(y, m, d)); }
295+ return Data$dMaybe.Nothing;
296+};
297+const boundedDate = {
298+ bottom: /* #__PURE__ */ $Date(-271820, Data$dDate$dComponent.January, 1),
299+ top: /* #__PURE__ */ $Date(275759, Data$dDate$dComponent.December, 31),
300+ Ord0: () => ordDate
301+};
302+const adjust = v => date => {
303+ const adj = v1 => v2 => {
304+ if (v1 === 0) { return Data$dMaybe.$Maybe("Just", v2); }
305+ const j = v1 + v2._3 | 0;
306+ const low = j < 1;
307+ const l = lastDayOfMonth(v2._1)((() => {
308+ if (low) {
309+ const $7 = Data$dDate$dComponent.enumMonth.pred(v2._2);
310+ if ($7.tag === "Nothing") { return Data$dDate$dComponent.December; }
311+ if ($7.tag === "Just") { return $7._1; }
312+ $runtime.fail();
313+ }
314+ return v2._2;
315+ })());
316+ const hi = j > l;
317+ const $9 = adj((() => {
318+ if (low) { return j; }
319+ if (hi) { return (j - l | 0) - 1 | 0; }
320+ return 0;
321+ })());
322+ const $10 = (() => {
323+ if (low) { return enumDate.pred($Date(v2._1, v2._2, 1)); }
324+ if (hi) { return enumDate.succ($Date(v2._1, v2._2, l)); }
325+ const $10 = $$Date(v2._1)(v2._2);
326+ if (j >= 1 && j <= 31) { return Data$dMaybe.$Maybe("Just", $10(j)); }
327+ return Data$dMaybe.Nothing;
328+ })();
329+ if ($10.tag === "Just") { return $9($10._1); }
330+ if ($10.tag === "Nothing") { return Data$dMaybe.Nothing; }
331+ $runtime.fail();
332+ };
333+ const $3 = Data$dInt.fromNumber(v);
334+ if ($3.tag === "Just") { return adj($3._1)(date); }
335+ if ($3.tag === "Nothing") { return Data$dMaybe.Nothing; }
336+ $runtime.fail();
337+};
338+export {
339+ $Date,
340+ $$Date as Date,
341+ adjust,
342+ boundedDate,
343+ canonicalDate,
344+ day,
345+ diff,
346+ enumDate,
347+ eqDate,
348+ exactDate,
349+ greaterThan,
350+ isLeapYear,
351+ lastDayOfMonth,
352+ month,
353+ ordDate,
354+ showDate,
355+ weekday,
356+ year
357+};
358+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.DateTime.Gen/index.jsnew file+9
@@ -0,0 +1,9 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDate$dGen from "../Data.Date.Gen/index.js";
3+import * as Data$dDateTime from "../Data.DateTime/index.js";
4+import * as Data$dTime$dGen from "../Data.Time.Gen/index.js";
5+const genDateTime = dictMonadGen => {
6+ const Apply0 = dictMonadGen.Monad0().Bind1().Apply0();
7+ return Apply0.apply(Apply0.Functor0().map(Data$dDateTime.DateTime)(Data$dDate$dGen.genDate(dictMonadGen)))(Data$dTime$dGen.genTime(dictMonadGen));
8+};
9+export {genDateTime};
.storybook/purescript-indexer/output-es/Data.DateTime.Instant/foreign.jsnew file+18
@@ -0,0 +1,18 @@
1+var createDateTime = function (y, m, d, h, mi, s, ms) {
2+ var dateTime = new Date(Date.UTC(y, m, d, h, mi, s, ms));
3+ if (y >= 0 && y < 100) {
4+ dateTime.setUTCFullYear(y);
5+ }
6+ return dateTime;
7+};
8+
9+export function fromDateTimeImpl(y, mo, d, h, mi, s, ms) {
10+ return createDateTime(y, mo - 1, d, h, mi, s, ms).getTime();
11+}
12+
13+export function toDateTimeImpl(ctor) {
14+ return function (instant) {
15+ var dt = new Date(instant);
16+ return ctor (dt.getUTCFullYear())(dt.getUTCMonth() + 1)(dt.getUTCDate())(dt.getUTCHours())(dt.getUTCMinutes())(dt.getUTCSeconds())(dt.getUTCMilliseconds());
17+ };
18+}
.storybook/purescript-indexer/output-es/Data.DateTime.Instant/index.jsnew file+76
@@ -0,0 +1,76 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDate from "../Data.Date/index.js";
3+import * as Data$dDate$dComponent from "../Data.Date.Component/index.js";
4+import * as Data$dDateTime from "../Data.DateTime/index.js";
5+import * as Data$dEq from "../Data.Eq/index.js";
6+import * as Data$dMaybe from "../Data.Maybe/index.js";
7+import * as Data$dOrd from "../Data.Ord/index.js";
8+import * as Data$dShow from "../Data.Show/index.js";
9+import * as Data$dTime from "../Data.Time/index.js";
10+import {fromDateTimeImpl, toDateTimeImpl} from "./foreign.js";
11+const unInstant = v => v;
12+const toDateTime = /* #__PURE__ */ toDateTimeImpl(y => mo => d => h => mi => s => ms => Data$dDateTime.$DateTime(
13+ Data$dDate.canonicalDate(y)((() => {
14+ const $7 = Data$dDate$dComponent.boundedEnumMonth.toEnum(mo);
15+ if ($7.tag === "Just") { return $7._1; }
16+ $runtime.fail();
17+ })())(d),
18+ Data$dTime.$Time(h, mi, s, ms)
19+));
20+const showInstant = {show: v => "(Instant (Milliseconds " + Data$dShow.showNumberImpl(v) + "))"};
21+const ordDateTime = Data$dOrd.ordNumber;
22+const instant = v => {
23+ if (v >= -8639977881600000.0 && v <= 8639977881599999.0) { return Data$dMaybe.$Maybe("Just", v); }
24+ return Data$dMaybe.Nothing;
25+};
26+const fromDateTime = v => fromDateTimeImpl(
27+ v._1._1,
28+ (() => {
29+ if (v._1._2.tag === "January") { return 1; }
30+ if (v._1._2.tag === "February") { return 2; }
31+ if (v._1._2.tag === "March") { return 3; }
32+ if (v._1._2.tag === "April") { return 4; }
33+ if (v._1._2.tag === "May") { return 5; }
34+ if (v._1._2.tag === "June") { return 6; }
35+ if (v._1._2.tag === "July") { return 7; }
36+ if (v._1._2.tag === "August") { return 8; }
37+ if (v._1._2.tag === "September") { return 9; }
38+ if (v._1._2.tag === "October") { return 10; }
39+ if (v._1._2.tag === "November") { return 11; }
40+ if (v._1._2.tag === "December") { return 12; }
41+ $runtime.fail();
42+ })(),
43+ v._1._3,
44+ v._2._1,
45+ v._2._2,
46+ v._2._3,
47+ v._2._4
48+);
49+const fromDate = d => fromDateTimeImpl(
50+ d._1,
51+ (() => {
52+ if (d._2.tag === "January") { return 1; }
53+ if (d._2.tag === "February") { return 2; }
54+ if (d._2.tag === "March") { return 3; }
55+ if (d._2.tag === "April") { return 4; }
56+ if (d._2.tag === "May") { return 5; }
57+ if (d._2.tag === "June") { return 6; }
58+ if (d._2.tag === "July") { return 7; }
59+ if (d._2.tag === "August") { return 8; }
60+ if (d._2.tag === "September") { return 9; }
61+ if (d._2.tag === "October") { return 10; }
62+ if (d._2.tag === "November") { return 11; }
63+ if (d._2.tag === "December") { return 12; }
64+ $runtime.fail();
65+ })(),
66+ d._3,
67+ 0,
68+ 0,
69+ 0,
70+ 0
71+);
72+const eqDateTime = Data$dEq.eqNumber;
73+const diff = dictDuration => dt1 => dt2 => dictDuration.toDuration(dt1 + -dt2);
74+const boundedInstant = {bottom: -8639977881600000.0, top: 8639977881599999.0, Ord0: () => Data$dOrd.ordNumber};
75+export {boundedInstant, diff, eqDateTime, fromDate, fromDateTime, instant, ordDateTime, showInstant, toDateTime, unInstant};
76+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.DateTime/foreign.jsnew file+33
@@ -0,0 +1,33 @@
1+var createUTC = function (y, mo, d, h, m, s, ms) {
2+ var date = new Date(Date.UTC(y, mo, d, h, m, s, ms));
3+ if (y >= 0 && y < 100) {
4+ date.setUTCFullYear(y);
5+ }
6+ return date.getTime();
7+};
8+
9+export function calcDiff(rec1, rec2) {
10+ var msUTC1 = createUTC(rec1.year, rec1.month - 1, rec1.day, rec1.hour, rec1.minute, rec1.second, rec1.millisecond);
11+ var msUTC2 = createUTC(rec2.year, rec2.month - 1, rec2.day, rec2.hour, rec2.minute, rec2.second, rec2.millisecond);
12+ return msUTC1 - msUTC2;
13+}
14+
15+export function adjustImpl(just) {
16+ return function (nothing) {
17+ return function (offset) {
18+ return function (rec) {
19+ var msUTC = createUTC(rec.year, rec.month - 1, rec.day, rec.hour, rec.minute, rec.second, rec.millisecond);
20+ var dt = new Date(msUTC + offset);
21+ return isNaN(dt.getTime()) ? nothing : just({
22+ year: dt.getUTCFullYear(),
23+ month: dt.getUTCMonth() + 1,
24+ day: dt.getUTCDate(),
25+ hour: dt.getUTCHours(),
26+ minute: dt.getUTCMinutes(),
27+ second: dt.getUTCSeconds(),
28+ millisecond: dt.getUTCMilliseconds()
29+ });
30+ };
31+ };
32+ };
33+}
.storybook/purescript-indexer/output-es/Data.DateTime/index.jsnew file+94
@@ -0,0 +1,94 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDate from "../Data.Date/index.js";
3+import * as Data$dDate$dComponent from "../Data.Date.Component/index.js";
4+import * as Data$dMaybe from "../Data.Maybe/index.js";
5+import * as Data$dOrdering from "../Data.Ordering/index.js";
6+import * as Data$dTime from "../Data.Time/index.js";
7+import {adjustImpl, calcDiff} from "./foreign.js";
8+const $DateTime = (_1, _2) => ({tag: "DateTime", _1, _2});
9+const DateTime = value0 => value1 => $DateTime(value0, value1);
10+const toRecord = v => (
11+ {
12+ year: v._1._1,
13+ month: (() => {
14+ if (v._1._2.tag === "January") { return 1; }
15+ if (v._1._2.tag === "February") { return 2; }
16+ if (v._1._2.tag === "March") { return 3; }
17+ if (v._1._2.tag === "April") { return 4; }
18+ if (v._1._2.tag === "May") { return 5; }
19+ if (v._1._2.tag === "June") { return 6; }
20+ if (v._1._2.tag === "July") { return 7; }
21+ if (v._1._2.tag === "August") { return 8; }
22+ if (v._1._2.tag === "September") { return 9; }
23+ if (v._1._2.tag === "October") { return 10; }
24+ if (v._1._2.tag === "November") { return 11; }
25+ if (v._1._2.tag === "December") { return 12; }
26+ $runtime.fail();
27+ })(),
28+ day: v._1._3,
29+ hour: v._2._1,
30+ minute: v._2._2,
31+ second: v._2._3,
32+ millisecond: v._2._4
33+ }
34+);
35+const time = v => v._2;
36+const showDateTime = {show: v => "(DateTime " + (Data$dDate.showDate.show(v._1) + (" " + (Data$dTime.showTime.show(v._2) + ")")))};
37+const modifyTimeF = dictFunctor => f => v => dictFunctor.map(DateTime(v._1))(f(v._2));
38+const modifyTime = f => v => $DateTime(v._1, f(v._2));
39+const modifyDateF = dictFunctor => f => v => dictFunctor.map(a => $DateTime(a, v._2))(f(v._1));
40+const modifyDate = f => v => $DateTime(f(v._1), v._2);
41+const eqDateTime = {eq: x => y => Data$dDate.eqDate.eq(x._1)(y._1) && (x._2._1 === y._2._1 && x._2._2 === y._2._2 && x._2._3 === y._2._3 && x._2._4 === y._2._4)};
42+const ordDateTime = {
43+ compare: x => y => {
44+ const v = Data$dDate.ordDate.compare(x._1)(y._1);
45+ if (v.tag === "LT") { return Data$dOrdering.LT; }
46+ if (v.tag === "GT") { return Data$dOrdering.GT; }
47+ return Data$dTime.ordTime.compare(x._2)(y._2);
48+ },
49+ Eq0: () => eqDateTime
50+};
51+const diff = dictDuration => dt1 => dt2 => dictDuration.toDuration(calcDiff(toRecord(dt1), toRecord(dt2)));
52+const date = v => v._1;
53+const boundedDateTime = {
54+ bottom: /* #__PURE__ */ $DateTime(/* #__PURE__ */ Data$dDate.$Date(-271820, Data$dDate$dComponent.January, 1), /* #__PURE__ */ Data$dTime.$Time(0, 0, 0, 0)),
55+ top: /* #__PURE__ */ $DateTime(/* #__PURE__ */ Data$dDate.$Date(275759, Data$dDate$dComponent.December, 31), /* #__PURE__ */ Data$dTime.$Time(23, 59, 59, 999)),
56+ Ord0: () => ordDateTime
57+};
58+const adjust = dictDuration => d => dt => {
59+ const $3 = adjustImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing)(dictDuration.fromDuration(d))(toRecord(dt));
60+ if ($3.tag === "Just") {
61+ return Data$dMaybe.applyMaybe.apply((() => {
62+ const $4 = Data$dMaybe.applyMaybe.apply(Data$dMaybe.applyMaybe.apply((() => {
63+ if ($3._1.year >= -271820 && $3._1.year <= 275759) { return Data$dMaybe.$Maybe("Just", Data$dDate.exactDate($3._1.year)); }
64+ return Data$dMaybe.Nothing;
65+ })())(Data$dDate$dComponent.boundedEnumMonth.toEnum($3._1.month)))((() => {
66+ if ($3._1.day >= 1 && $3._1.day <= 31) { return Data$dMaybe.$Maybe("Just", $3._1.day); }
67+ return Data$dMaybe.Nothing;
68+ })());
69+ const $5 = (() => {
70+ if ($4.tag === "Just") { return $4._1; }
71+ if ($4.tag === "Nothing") { return Data$dMaybe.Nothing; }
72+ $runtime.fail();
73+ })();
74+ if ($5.tag === "Just") { return Data$dMaybe.$Maybe("Just", DateTime($5._1)); }
75+ return Data$dMaybe.Nothing;
76+ })())(Data$dMaybe.applyMaybe.apply(Data$dMaybe.applyMaybe.apply(Data$dMaybe.applyMaybe.apply((() => {
77+ if ($3._1.hour >= 0 && $3._1.hour <= 23) { return Data$dMaybe.$Maybe("Just", Data$dTime.Time($3._1.hour)); }
78+ return Data$dMaybe.Nothing;
79+ })())((() => {
80+ if ($3._1.minute >= 0 && $3._1.minute <= 59) { return Data$dMaybe.$Maybe("Just", $3._1.minute); }
81+ return Data$dMaybe.Nothing;
82+ })()))((() => {
83+ if ($3._1.second >= 0 && $3._1.second <= 59) { return Data$dMaybe.$Maybe("Just", $3._1.second); }
84+ return Data$dMaybe.Nothing;
85+ })()))((() => {
86+ if ($3._1.millisecond >= 0 && $3._1.millisecond <= 999) { return Data$dMaybe.$Maybe("Just", $3._1.millisecond); }
87+ return Data$dMaybe.Nothing;
88+ })()));
89+ }
90+ if ($3.tag === "Nothing") { return Data$dMaybe.Nothing; }
91+ $runtime.fail();
92+};
93+export {$DateTime, DateTime, adjust, boundedDateTime, date, diff, eqDateTime, modifyDate, modifyDateF, modifyTime, modifyTimeF, ordDateTime, showDateTime, time, toRecord};
94+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Decidable/index.jsnew file+75
@@ -0,0 +1,75 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDecide from "../Data.Decide/index.js";
3+import * as Data$dDivisible from "../Data.Divisible/index.js";
4+const identity = x => x;
5+const lose = dict => dict.lose;
6+const lost = dictDecidable => dictDecidable.lose(identity);
7+const decidablePredicate = {
8+ lose: f => a => {
9+ const spin = spin$a0$copy => {
10+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
11+ while (spin$c) {
12+ const v = spin$a0;
13+ spin$a0 = v;
14+ continue;
15+ };
16+ return spin$r;
17+ };
18+ return spin(f(a));
19+ },
20+ Decide0: () => Data$dDecide.choosePredicate,
21+ Divisible1: () => Data$dDivisible.divisiblePredicate
22+};
23+const decidableOp = dictMonoid => {
24+ const chooseOp = Data$dDecide.chooseOp(dictMonoid.Semigroup0());
25+ const divisibleOp = Data$dDivisible.divisibleOp(dictMonoid);
26+ return {
27+ lose: f => a => {
28+ const spin = spin$a0$copy => {
29+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
30+ while (spin$c) {
31+ const v = spin$a0;
32+ spin$a0 = v;
33+ continue;
34+ };
35+ return spin$r;
36+ };
37+ return spin(f(a));
38+ },
39+ Decide0: () => chooseOp,
40+ Divisible1: () => divisibleOp
41+ };
42+};
43+const decidableEquivalence = {
44+ lose: f => a => {
45+ const spin = spin$a0$copy => {
46+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
47+ while (spin$c) {
48+ const v = spin$a0;
49+ spin$a0 = v;
50+ continue;
51+ };
52+ return spin$r;
53+ };
54+ return spin(f(a));
55+ },
56+ Decide0: () => Data$dDecide.chooseEquivalence,
57+ Divisible1: () => Data$dDivisible.divisibleEquivalence
58+};
59+const decidableComparison = {
60+ lose: f => a => v => {
61+ const spin = spin$a0$copy => {
62+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
63+ while (spin$c) {
64+ const v$1 = spin$a0;
65+ spin$a0 = v$1;
66+ continue;
67+ };
68+ return spin$r;
69+ };
70+ return spin(f(a));
71+ },
72+ Decide0: () => Data$dDecide.chooseComparison,
73+ Divisible1: () => Data$dDivisible.divisibleComparison
74+};
75+export {decidableComparison, decidableEquivalence, decidableOp, decidablePredicate, identity, lose, lost};
.storybook/purescript-indexer/output-es/Data.Decide/index.jsnew file+66
@@ -0,0 +1,66 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDivide from "../Data.Divide/index.js";
3+import * as Data$dOrdering from "../Data.Ordering/index.js";
4+const identity = x => x;
5+const choosePredicate = {
6+ choose: f => v => v1 => x => {
7+ const $4 = f(x);
8+ if ($4.tag === "Left") { return v($4._1); }
9+ if ($4.tag === "Right") { return v1($4._1); }
10+ $runtime.fail();
11+ },
12+ Divide0: () => Data$dDivide.dividePredicate
13+};
14+const chooseOp = dictSemigroup => {
15+ const divideOp = Data$dDivide.divideOp(dictSemigroup);
16+ return {
17+ choose: f => v => v1 => x => {
18+ const $6 = f(x);
19+ if ($6.tag === "Left") { return v($6._1); }
20+ if ($6.tag === "Right") { return v1($6._1); }
21+ $runtime.fail();
22+ },
23+ Divide0: () => divideOp
24+ };
25+};
26+const chooseEquivalence = {
27+ choose: f => v => v1 => a => b => {
28+ const v2 = f(a);
29+ if (v2.tag === "Left") {
30+ const v3 = f(b);
31+ if (v3.tag === "Left") { return v(v2._1)(v3._1); }
32+ if (v3.tag === "Right") { return false; }
33+ $runtime.fail();
34+ }
35+ if (v2.tag === "Right") {
36+ const v3 = f(b);
37+ if (v3.tag === "Left") { return false; }
38+ if (v3.tag === "Right") { return v1(v2._1)(v3._1); }
39+ $runtime.fail();
40+ }
41+ $runtime.fail();
42+ },
43+ Divide0: () => Data$dDivide.divideEquivalence
44+};
45+const chooseComparison = {
46+ choose: f => v => v1 => a => b => {
47+ const v2 = f(a);
48+ if (v2.tag === "Left") {
49+ const v3 = f(b);
50+ if (v3.tag === "Left") { return v(v2._1)(v3._1); }
51+ if (v3.tag === "Right") { return Data$dOrdering.LT; }
52+ $runtime.fail();
53+ }
54+ if (v2.tag === "Right") {
55+ const v3 = f(b);
56+ if (v3.tag === "Left") { return Data$dOrdering.GT; }
57+ if (v3.tag === "Right") { return v1(v2._1)(v3._1); }
58+ $runtime.fail();
59+ }
60+ $runtime.fail();
61+ },
62+ Divide0: () => Data$dDivide.divideComparison
63+};
64+const choose = dict => dict.choose;
65+const chosen = dictDecide => dictDecide.choose(identity);
66+export {choose, chooseComparison, chooseEquivalence, chooseOp, choosePredicate, chosen, identity};
.storybook/purescript-indexer/output-es/Data.Distributive/index.jsnew file+60
@@ -0,0 +1,60 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dFunctor from "../Data.Functor/index.js";
3+import * as Data$dIdentity from "../Data.Identity/index.js";
4+import * as Data$dTuple from "../Data.Tuple/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+import * as Unsafe$dCoerce from "../Unsafe.Coerce/index.js";
7+const identity = x => x;
8+const distributiveIdentity = {
9+ distribute: dictFunctor => dictFunctor.map(Unsafe$dCoerce.unsafeCoerce),
10+ collect: dictFunctor => f => dictFunctor.map(x => f(x)),
11+ Functor0: () => Data$dIdentity.functorIdentity
12+};
13+const distribute = dict => dict.distribute;
14+const distributiveFunction = {
15+ distribute: dictFunctor => a => e => dictFunctor.map(v => v(e))(a),
16+ collect: dictFunctor => f => {
17+ const $2 = distributiveFunction.distribute(dictFunctor);
18+ const $3 = dictFunctor.map(f);
19+ return x => $2($3(x));
20+ },
21+ Functor0: () => Data$dFunctor.functorFn
22+};
23+const cotraverse = dictDistributive => {
24+ const map = dictDistributive.Functor0().map;
25+ return dictFunctor => {
26+ const distribute2 = dictDistributive.distribute(dictFunctor);
27+ return f => {
28+ const $5 = map(f);
29+ return x => $5(distribute2(x));
30+ };
31+ };
32+};
33+const collectDefault = dictDistributive => dictFunctor => {
34+ const distribute2 = dictDistributive.distribute(dictFunctor);
35+ return f => {
36+ const $4 = dictFunctor.map(f);
37+ return x => distribute2($4(x));
38+ };
39+};
40+const distributiveTuple = dictTypeEquals => {
41+ const from = dictTypeEquals.proof(a => a);
42+ return {
43+ collect: dictFunctor => {
44+ const distribute2 = distributiveTuple(dictTypeEquals).distribute(dictFunctor);
45+ return f => {
46+ const $5 = dictFunctor.map(f);
47+ return x => distribute2($5(x));
48+ };
49+ },
50+ distribute: dictFunctor => {
51+ const $3 = Data$dTuple.Tuple(from(Data$dUnit.unit));
52+ const $4 = dictFunctor.map(Data$dTuple.snd);
53+ return x => $3($4(x));
54+ },
55+ Functor0: () => Data$dTuple.functorTuple
56+ };
57+};
58+const collect = dict => dict.collect;
59+const distributeDefault = dictDistributive => dictFunctor => dictDistributive.collect(dictFunctor)(identity);
60+export {collect, collectDefault, cotraverse, distribute, distributeDefault, distributiveFunction, distributiveIdentity, distributiveTuple, identity};
.storybook/purescript-indexer/output-es/Data.Divide/index.jsnew file+47
@@ -0,0 +1,47 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dComparison from "../Data.Comparison/index.js";
3+import * as Data$dEquivalence from "../Data.Equivalence/index.js";
4+import * as Data$dOp from "../Data.Op/index.js";
5+import * as Data$dOrdering from "../Data.Ordering/index.js";
6+import * as Data$dPredicate from "../Data.Predicate/index.js";
7+const identity = x => x;
8+const dividePredicate = {
9+ divide: f => v => v1 => a => {
10+ const v2 = f(a);
11+ return v(v2._1) && v1(v2._2);
12+ },
13+ Contravariant0: () => Data$dPredicate.contravariantPredicate
14+};
15+const divideOp = dictSemigroup => (
16+ {
17+ divide: f => v => v1 => a => {
18+ const v2 = f(a);
19+ return dictSemigroup.append(v(v2._1))(v1(v2._2));
20+ },
21+ Contravariant0: () => Data$dOp.contravariantOp
22+ }
23+);
24+const divideEquivalence = {
25+ divide: f => v => v1 => a => b => {
26+ const v2 = f(a);
27+ const v3 = f(b);
28+ return v(v2._1)(v3._1) && v1(v2._2)(v3._2);
29+ },
30+ Contravariant0: () => Data$dEquivalence.contravariantEquivalence
31+};
32+const divideComparison = {
33+ divide: f => v => v1 => a => b => {
34+ const v2 = f(a);
35+ const v3 = f(b);
36+ const $7 = v(v2._1)(v3._1);
37+ const $8 = v1(v2._2)(v3._2);
38+ if ($7.tag === "LT") { return Data$dOrdering.LT; }
39+ if ($7.tag === "GT") { return Data$dOrdering.GT; }
40+ if ($7.tag === "EQ") { return $8; }
41+ $runtime.fail();
42+ },
43+ Contravariant0: () => Data$dComparison.contravariantComparison
44+};
45+const divide = dict => dict.divide;
46+const divided = dictDivide => dictDivide.divide(identity);
47+export {divide, divideComparison, divideEquivalence, divideOp, dividePredicate, divided, identity};
.storybook/purescript-indexer/output-es/Data.Divisible/index.jsnew file+12
@@ -0,0 +1,12 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dDivide from "../Data.Divide/index.js";
3+import * as Data$dOrdering from "../Data.Ordering/index.js";
4+const divisiblePredicate = {conquer: v => true, Divide0: () => Data$dDivide.dividePredicate};
5+const divisibleOp = dictMonoid => {
6+ const divideOp = Data$dDivide.divideOp(dictMonoid.Semigroup0());
7+ return {conquer: v => dictMonoid.mempty, Divide0: () => divideOp};
8+};
9+const divisibleEquivalence = {conquer: v => v1 => true, Divide0: () => Data$dDivide.divideEquivalence};
10+const divisibleComparison = {conquer: v => v1 => Data$dOrdering.EQ, Divide0: () => Data$dDivide.divideComparison};
11+const conquer = dict => dict.conquer;
12+export {conquer, divisibleComparison, divisibleEquivalence, divisibleOp, divisiblePredicate};
.storybook/purescript-indexer/output-es/Data.DivisionRing/index.jsnew file+13
@@ -0,0 +1,13 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dRing from "../Data.Ring/index.js";
3+const recip = dict => dict.recip;
4+const rightDiv = dictDivisionRing => {
5+ const mul = dictDivisionRing.Ring0().Semiring0().mul;
6+ return a => b => mul(a)(dictDivisionRing.recip(b));
7+};
8+const leftDiv = dictDivisionRing => {
9+ const mul = dictDivisionRing.Ring0().Semiring0().mul;
10+ return a => b => mul(dictDivisionRing.recip(b))(a);
11+};
12+const divisionringNumber = {recip: x => 1.0 / x, Ring0: () => Data$dRing.ringNumber};
13+export {divisionringNumber, leftDiv, recip, rightDiv};
.storybook/purescript-indexer/output-es/Data.Either.Inject/index.jsnew file+25
@@ -0,0 +1,25 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEither from "../Data.Either/index.js";
3+import * as Data$dMaybe from "../Data.Maybe/index.js";
4+const prj = dict => dict.prj;
5+const injectReflexive = {inj: x => x, prj: Data$dMaybe.Just};
6+const injectLeft = {
7+ inj: Data$dEither.Left,
8+ prj: v2 => {
9+ if (v2.tag === "Left") { return Data$dMaybe.$Maybe("Just", v2._1); }
10+ if (v2.tag === "Right") { return Data$dMaybe.Nothing; }
11+ $runtime.fail();
12+ }
13+};
14+const inj = dict => dict.inj;
15+const injectRight = dictInject => (
16+ {
17+ inj: x => Data$dEither.$Either("Right", dictInject.inj(x)),
18+ prj: v2 => {
19+ if (v2.tag === "Left") { return Data$dMaybe.Nothing; }
20+ if (v2.tag === "Right") { return dictInject.prj(v2._1); }
21+ $runtime.fail();
22+ }
23+ }
24+);
25+export {inj, injectLeft, injectReflexive, injectRight, prj};
.storybook/purescript-indexer/output-es/Data.Either.Nested/index.jsnew file+622
@@ -0,0 +1,622 @@
1+// | Utilities for n-eithers: sums types with more than two terms built from nested eithers.
2+// |
3+// | Nested eithers arise naturally in sum combinators. You shouldn't
4+// | represent sum data using nested eithers, but if combinators you're working with
5+// | create them, utilities in this module will allow to to more easily work
6+// | with them, including translating to and from more traditional sum types.
7+// |
8+// | ```purescript
9+// | data Color = Red Number | Green Number | Blue Number
10+// |
11+// | fromEither3 :: Either3 Number Number Number -> Color
12+// | fromEither3 = either3 Red Green Blue
13+// |
14+// | toEither3 :: Color -> Either3 Number Number Number
15+// | toEither3 (Red v) = in1 v
16+// | toEither3 (Green v) = in2 v
17+// | toEither3 (Blue v) = in3 v
18+// | ```
19+import * as $runtime from "../runtime.js";
20+import * as Data$dEither from "../Data.Either/index.js";
21+const in9 = v => Data$dEither.$Either(
22+ "Right",
23+ Data$dEither.$Either(
24+ "Right",
25+ Data$dEither.$Either(
26+ "Right",
27+ Data$dEither.$Either(
28+ "Right",
29+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
30+ )
31+ )
32+ )
33+);
34+const in8 = v => Data$dEither.$Either(
35+ "Right",
36+ Data$dEither.$Either(
37+ "Right",
38+ Data$dEither.$Either(
39+ "Right",
40+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
41+ )
42+ )
43+);
44+const in7 = v => Data$dEither.$Either(
45+ "Right",
46+ Data$dEither.$Either(
47+ "Right",
48+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
49+ )
50+);
51+const in6 = v => Data$dEither.$Either(
52+ "Right",
53+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
54+);
55+const in5 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))));
56+const in4 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v))));
57+const in3 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)));
58+const in2 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Left", v));
59+const in10 = v => Data$dEither.$Either(
60+ "Right",
61+ Data$dEither.$Either(
62+ "Right",
63+ Data$dEither.$Either(
64+ "Right",
65+ Data$dEither.$Either(
66+ "Right",
67+ Data$dEither.$Either(
68+ "Right",
69+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
70+ )
71+ )
72+ )
73+ )
74+);
75+const in1 = Data$dEither.Left;
76+const either9 = a => b => c => d => e => f => g => h => i => y => {
77+ if (y.tag === "Left") { return a(y._1); }
78+ if (y.tag === "Right") {
79+ if (y._1.tag === "Left") { return b(y._1._1); }
80+ if (y._1.tag === "Right") {
81+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
82+ if (y._1._1.tag === "Right") {
83+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
84+ if (y._1._1._1.tag === "Right") {
85+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
86+ if (y._1._1._1._1.tag === "Right") {
87+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
88+ if (y._1._1._1._1._1.tag === "Right") {
89+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
90+ if (y._1._1._1._1._1._1.tag === "Right") {
91+ if (y._1._1._1._1._1._1._1.tag === "Left") { return h(y._1._1._1._1._1._1._1._1); }
92+ if (y._1._1._1._1._1._1._1.tag === "Right") {
93+ if (y._1._1._1._1._1._1._1._1.tag === "Left") { return i(y._1._1._1._1._1._1._1._1._1); }
94+ if (y._1._1._1._1._1._1._1._1.tag === "Right") {
95+ const spin = spin$a0$copy => {
96+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
97+ while (spin$c) {
98+ const v = spin$a0;
99+ spin$a0 = v;
100+ continue;
101+ };
102+ return spin$r;
103+ };
104+ return spin(y._1._1._1._1._1._1._1._1._1);
105+ }
106+ $runtime.fail();
107+ }
108+ $runtime.fail();
109+ }
110+ $runtime.fail();
111+ }
112+ $runtime.fail();
113+ }
114+ $runtime.fail();
115+ }
116+ $runtime.fail();
117+ }
118+ $runtime.fail();
119+ }
120+ $runtime.fail();
121+ }
122+ $runtime.fail();
123+};
124+const either8 = a => b => c => d => e => f => g => h => y => {
125+ if (y.tag === "Left") { return a(y._1); }
126+ if (y.tag === "Right") {
127+ if (y._1.tag === "Left") { return b(y._1._1); }
128+ if (y._1.tag === "Right") {
129+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
130+ if (y._1._1.tag === "Right") {
131+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
132+ if (y._1._1._1.tag === "Right") {
133+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
134+ if (y._1._1._1._1.tag === "Right") {
135+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
136+ if (y._1._1._1._1._1.tag === "Right") {
137+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
138+ if (y._1._1._1._1._1._1.tag === "Right") {
139+ if (y._1._1._1._1._1._1._1.tag === "Left") { return h(y._1._1._1._1._1._1._1._1); }
140+ if (y._1._1._1._1._1._1._1.tag === "Right") {
141+ const spin = spin$a0$copy => {
142+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
143+ while (spin$c) {
144+ const v = spin$a0;
145+ spin$a0 = v;
146+ continue;
147+ };
148+ return spin$r;
149+ };
150+ return spin(y._1._1._1._1._1._1._1._1);
151+ }
152+ $runtime.fail();
153+ }
154+ $runtime.fail();
155+ }
156+ $runtime.fail();
157+ }
158+ $runtime.fail();
159+ }
160+ $runtime.fail();
161+ }
162+ $runtime.fail();
163+ }
164+ $runtime.fail();
165+ }
166+ $runtime.fail();
167+};
168+const either7 = a => b => c => d => e => f => g => y => {
169+ if (y.tag === "Left") { return a(y._1); }
170+ if (y.tag === "Right") {
171+ if (y._1.tag === "Left") { return b(y._1._1); }
172+ if (y._1.tag === "Right") {
173+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
174+ if (y._1._1.tag === "Right") {
175+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
176+ if (y._1._1._1.tag === "Right") {
177+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
178+ if (y._1._1._1._1.tag === "Right") {
179+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
180+ if (y._1._1._1._1._1.tag === "Right") {
181+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
182+ if (y._1._1._1._1._1._1.tag === "Right") {
183+ const spin = spin$a0$copy => {
184+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
185+ while (spin$c) {
186+ const v = spin$a0;
187+ spin$a0 = v;
188+ continue;
189+ };
190+ return spin$r;
191+ };
192+ return spin(y._1._1._1._1._1._1._1);
193+ }
194+ $runtime.fail();
195+ }
196+ $runtime.fail();
197+ }
198+ $runtime.fail();
199+ }
200+ $runtime.fail();
201+ }
202+ $runtime.fail();
203+ }
204+ $runtime.fail();
205+ }
206+ $runtime.fail();
207+};
208+const either6 = a => b => c => d => e => f => y => {
209+ if (y.tag === "Left") { return a(y._1); }
210+ if (y.tag === "Right") {
211+ if (y._1.tag === "Left") { return b(y._1._1); }
212+ if (y._1.tag === "Right") {
213+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
214+ if (y._1._1.tag === "Right") {
215+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
216+ if (y._1._1._1.tag === "Right") {
217+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
218+ if (y._1._1._1._1.tag === "Right") {
219+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
220+ if (y._1._1._1._1._1.tag === "Right") {
221+ const spin = spin$a0$copy => {
222+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
223+ while (spin$c) {
224+ const v = spin$a0;
225+ spin$a0 = v;
226+ continue;
227+ };
228+ return spin$r;
229+ };
230+ return spin(y._1._1._1._1._1._1);
231+ }
232+ $runtime.fail();
233+ }
234+ $runtime.fail();
235+ }
236+ $runtime.fail();
237+ }
238+ $runtime.fail();
239+ }
240+ $runtime.fail();
241+ }
242+ $runtime.fail();
243+};
244+const either5 = a => b => c => d => e => y => {
245+ if (y.tag === "Left") { return a(y._1); }
246+ if (y.tag === "Right") {
247+ if (y._1.tag === "Left") { return b(y._1._1); }
248+ if (y._1.tag === "Right") {
249+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
250+ if (y._1._1.tag === "Right") {
251+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
252+ if (y._1._1._1.tag === "Right") {
253+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
254+ if (y._1._1._1._1.tag === "Right") {
255+ const spin = spin$a0$copy => {
256+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
257+ while (spin$c) {
258+ const v = spin$a0;
259+ spin$a0 = v;
260+ continue;
261+ };
262+ return spin$r;
263+ };
264+ return spin(y._1._1._1._1._1);
265+ }
266+ $runtime.fail();
267+ }
268+ $runtime.fail();
269+ }
270+ $runtime.fail();
271+ }
272+ $runtime.fail();
273+ }
274+ $runtime.fail();
275+};
276+const either4 = a => b => c => d => y => {
277+ if (y.tag === "Left") { return a(y._1); }
278+ if (y.tag === "Right") {
279+ if (y._1.tag === "Left") { return b(y._1._1); }
280+ if (y._1.tag === "Right") {
281+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
282+ if (y._1._1.tag === "Right") {
283+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
284+ if (y._1._1._1.tag === "Right") {
285+ const spin = spin$a0$copy => {
286+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
287+ while (spin$c) {
288+ const v = spin$a0;
289+ spin$a0 = v;
290+ continue;
291+ };
292+ return spin$r;
293+ };
294+ return spin(y._1._1._1._1);
295+ }
296+ $runtime.fail();
297+ }
298+ $runtime.fail();
299+ }
300+ $runtime.fail();
301+ }
302+ $runtime.fail();
303+};
304+const either3 = a => b => c => y => {
305+ if (y.tag === "Left") { return a(y._1); }
306+ if (y.tag === "Right") {
307+ if (y._1.tag === "Left") { return b(y._1._1); }
308+ if (y._1.tag === "Right") {
309+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
310+ if (y._1._1.tag === "Right") {
311+ const spin = spin$a0$copy => {
312+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
313+ while (spin$c) {
314+ const v = spin$a0;
315+ spin$a0 = v;
316+ continue;
317+ };
318+ return spin$r;
319+ };
320+ return spin(y._1._1._1);
321+ }
322+ $runtime.fail();
323+ }
324+ $runtime.fail();
325+ }
326+ $runtime.fail();
327+};
328+const either2 = a => b => y => {
329+ if (y.tag === "Left") { return a(y._1); }
330+ if (y.tag === "Right") {
331+ if (y._1.tag === "Left") { return b(y._1._1); }
332+ if (y._1.tag === "Right") {
333+ const spin = spin$a0$copy => {
334+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
335+ while (spin$c) {
336+ const v = spin$a0;
337+ spin$a0 = v;
338+ continue;
339+ };
340+ return spin$r;
341+ };
342+ return spin(y._1._1);
343+ }
344+ $runtime.fail();
345+ }
346+ $runtime.fail();
347+};
348+const either10 = a => b => c => d => e => f => g => h => i => j => y => {
349+ if (y.tag === "Left") { return a(y._1); }
350+ if (y.tag === "Right") {
351+ if (y._1.tag === "Left") { return b(y._1._1); }
352+ if (y._1.tag === "Right") {
353+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
354+ if (y._1._1.tag === "Right") {
355+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
356+ if (y._1._1._1.tag === "Right") {
357+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
358+ if (y._1._1._1._1.tag === "Right") {
359+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
360+ if (y._1._1._1._1._1.tag === "Right") {
361+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
362+ if (y._1._1._1._1._1._1.tag === "Right") {
363+ if (y._1._1._1._1._1._1._1.tag === "Left") { return h(y._1._1._1._1._1._1._1._1); }
364+ if (y._1._1._1._1._1._1._1.tag === "Right") {
365+ if (y._1._1._1._1._1._1._1._1.tag === "Left") { return i(y._1._1._1._1._1._1._1._1._1); }
366+ if (y._1._1._1._1._1._1._1._1.tag === "Right") {
367+ if (y._1._1._1._1._1._1._1._1._1.tag === "Left") { return j(y._1._1._1._1._1._1._1._1._1._1); }
368+ if (y._1._1._1._1._1._1._1._1._1.tag === "Right") {
369+ const spin = spin$a0$copy => {
370+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
371+ while (spin$c) {
372+ const v = spin$a0;
373+ spin$a0 = v;
374+ continue;
375+ };
376+ return spin$r;
377+ };
378+ return spin(y._1._1._1._1._1._1._1._1._1._1);
379+ }
380+ $runtime.fail();
381+ }
382+ $runtime.fail();
383+ }
384+ $runtime.fail();
385+ }
386+ $runtime.fail();
387+ }
388+ $runtime.fail();
389+ }
390+ $runtime.fail();
391+ }
392+ $runtime.fail();
393+ }
394+ $runtime.fail();
395+ }
396+ $runtime.fail();
397+ }
398+ $runtime.fail();
399+};
400+const either1 = y => {
401+ if (y.tag === "Left") { return y._1; }
402+ if (y.tag === "Right") {
403+ const spin = spin$a0$copy => {
404+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
405+ while (spin$c) {
406+ const v = spin$a0;
407+ spin$a0 = v;
408+ continue;
409+ };
410+ return spin$r;
411+ };
412+ return spin(y._1);
413+ }
414+ $runtime.fail();
415+};
416+const at9 = b => f => y => {
417+ if (y.tag === "Right") {
418+ if (y._1.tag === "Right") {
419+ if (y._1._1.tag === "Right") {
420+ if (y._1._1._1.tag === "Right") {
421+ if (y._1._1._1._1.tag === "Right") {
422+ if (y._1._1._1._1._1.tag === "Right") {
423+ if (y._1._1._1._1._1._1.tag === "Right") {
424+ if (y._1._1._1._1._1._1._1.tag === "Right") {
425+ if (y._1._1._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1._1._1); }
426+ return b;
427+ }
428+ return b;
429+ }
430+ return b;
431+ }
432+ return b;
433+ }
434+ return b;
435+ }
436+ return b;
437+ }
438+ return b;
439+ }
440+ return b;
441+ }
442+ return b;
443+};
444+const at8 = b => f => y => {
445+ if (y.tag === "Right") {
446+ if (y._1.tag === "Right") {
447+ if (y._1._1.tag === "Right") {
448+ if (y._1._1._1.tag === "Right") {
449+ if (y._1._1._1._1.tag === "Right") {
450+ if (y._1._1._1._1._1.tag === "Right") {
451+ if (y._1._1._1._1._1._1.tag === "Right") {
452+ if (y._1._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1._1); }
453+ return b;
454+ }
455+ return b;
456+ }
457+ return b;
458+ }
459+ return b;
460+ }
461+ return b;
462+ }
463+ return b;
464+ }
465+ return b;
466+ }
467+ return b;
468+};
469+const at7 = b => f => y => {
470+ if (y.tag === "Right") {
471+ if (y._1.tag === "Right") {
472+ if (y._1._1.tag === "Right") {
473+ if (y._1._1._1.tag === "Right") {
474+ if (y._1._1._1._1.tag === "Right") {
475+ if (y._1._1._1._1._1.tag === "Right") {
476+ if (y._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1); }
477+ return b;
478+ }
479+ return b;
480+ }
481+ return b;
482+ }
483+ return b;
484+ }
485+ return b;
486+ }
487+ return b;
488+ }
489+ return b;
490+};
491+const at6 = b => f => y => {
492+ if (y.tag === "Right") {
493+ if (y._1.tag === "Right") {
494+ if (y._1._1.tag === "Right") {
495+ if (y._1._1._1.tag === "Right") {
496+ if (y._1._1._1._1.tag === "Right") {
497+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
498+ return b;
499+ }
500+ return b;
501+ }
502+ return b;
503+ }
504+ return b;
505+ }
506+ return b;
507+ }
508+ return b;
509+};
510+const at5 = b => f => y => {
511+ if (y.tag === "Right") {
512+ if (y._1.tag === "Right") {
513+ if (y._1._1.tag === "Right") {
514+ if (y._1._1._1.tag === "Right") {
515+ if (y._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1); }
516+ return b;
517+ }
518+ return b;
519+ }
520+ return b;
521+ }
522+ return b;
523+ }
524+ return b;
525+};
526+const at4 = b => f => y => {
527+ if (y.tag === "Right") {
528+ if (y._1.tag === "Right") {
529+ if (y._1._1.tag === "Right") {
530+ if (y._1._1._1.tag === "Left") { return f(y._1._1._1._1); }
531+ return b;
532+ }
533+ return b;
534+ }
535+ return b;
536+ }
537+ return b;
538+};
539+const at3 = b => f => y => {
540+ if (y.tag === "Right") {
541+ if (y._1.tag === "Right") {
542+ if (y._1._1.tag === "Left") { return f(y._1._1._1); }
543+ return b;
544+ }
545+ return b;
546+ }
547+ return b;
548+};
549+const at2 = b => f => y => {
550+ if (y.tag === "Right") {
551+ if (y._1.tag === "Left") { return f(y._1._1); }
552+ return b;
553+ }
554+ return b;
555+};
556+const at10 = b => f => y => {
557+ if (y.tag === "Right") {
558+ if (y._1.tag === "Right") {
559+ if (y._1._1.tag === "Right") {
560+ if (y._1._1._1.tag === "Right") {
561+ if (y._1._1._1._1.tag === "Right") {
562+ if (y._1._1._1._1._1.tag === "Right") {
563+ if (y._1._1._1._1._1._1.tag === "Right") {
564+ if (y._1._1._1._1._1._1._1.tag === "Right") {
565+ if (y._1._1._1._1._1._1._1._1.tag === "Right") {
566+ if (y._1._1._1._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1._1._1._1); }
567+ return b;
568+ }
569+ return b;
570+ }
571+ return b;
572+ }
573+ return b;
574+ }
575+ return b;
576+ }
577+ return b;
578+ }
579+ return b;
580+ }
581+ return b;
582+ }
583+ return b;
584+ }
585+ return b;
586+};
587+const at1 = b => f => y => {
588+ if (y.tag === "Left") { return f(y._1); }
589+ return b;
590+};
591+export {
592+ at1,
593+ at10,
594+ at2,
595+ at3,
596+ at4,
597+ at5,
598+ at6,
599+ at7,
600+ at8,
601+ at9,
602+ either1,
603+ either10,
604+ either2,
605+ either3,
606+ either4,
607+ either5,
608+ either6,
609+ either7,
610+ either8,
611+ either9,
612+ in1,
613+ in10,
614+ in2,
615+ in3,
616+ in4,
617+ in5,
618+ in6,
619+ in7,
620+ in8,
621+ in9
622+};
.storybook/purescript-indexer/output-es/Data.Either/index.jsnew file+259
@@ -0,0 +1,259 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dGeneric$dRep from "../Data.Generic.Rep/index.js";
3+import * as Data$dMaybe from "../Data.Maybe/index.js";
4+import * as Data$dOrdering from "../Data.Ordering/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+const $Either = (tag, _1) => ({tag, _1});
7+const Left = value0 => $Either("Left", value0);
8+const Right = value0 => $Either("Right", value0);
9+const showEither = dictShow => dictShow1 => (
10+ {
11+ show: v => {
12+ if (v.tag === "Left") { return "(Left " + (dictShow.show(v._1) + ")"); }
13+ if (v.tag === "Right") { return "(Right " + (dictShow1.show(v._1) + ")"); }
14+ $runtime.fail();
15+ }
16+ }
17+);
18+const note$p = f => v2 => {
19+ if (v2.tag === "Nothing") { return $Either("Left", f(Data$dUnit.unit)); }
20+ if (v2.tag === "Just") { return $Either("Right", v2._1); }
21+ $runtime.fail();
22+};
23+const note = a => v2 => {
24+ if (v2.tag === "Nothing") { return $Either("Left", a); }
25+ if (v2.tag === "Just") { return $Either("Right", v2._1); }
26+ $runtime.fail();
27+};
28+const genericEither = {
29+ to: x => {
30+ if (x.tag === "Inl") { return $Either("Left", x._1); }
31+ if (x.tag === "Inr") { return $Either("Right", x._1); }
32+ $runtime.fail();
33+ },
34+ from: x => {
35+ if (x.tag === "Left") { return Data$dGeneric$dRep.$Sum("Inl", x._1); }
36+ if (x.tag === "Right") { return Data$dGeneric$dRep.$Sum("Inr", x._1); }
37+ $runtime.fail();
38+ }
39+};
40+const functorEither = {
41+ map: f => m => {
42+ if (m.tag === "Left") { return $Either("Left", m._1); }
43+ if (m.tag === "Right") { return $Either("Right", f(m._1)); }
44+ $runtime.fail();
45+ }
46+};
47+const invariantEither = {imap: f => v => functorEither.map(f)};
48+const fromRight$p = v => v1 => {
49+ if (v1.tag === "Right") { return v1._1; }
50+ return v(Data$dUnit.unit);
51+};
52+const fromRight = v => v1 => {
53+ if (v1.tag === "Right") { return v1._1; }
54+ return v;
55+};
56+const fromLeft$p = v => v1 => {
57+ if (v1.tag === "Left") { return v1._1; }
58+ return v(Data$dUnit.unit);
59+};
60+const fromLeft = v => v1 => {
61+ if (v1.tag === "Left") { return v1._1; }
62+ return v;
63+};
64+const extendEither = {
65+ extend: v => v1 => {
66+ if (v1.tag === "Left") { return $Either("Left", v1._1); }
67+ return $Either("Right", v(v1));
68+ },
69+ Functor0: () => functorEither
70+};
71+const eqEither = dictEq => dictEq1 => (
72+ {
73+ eq: x => y => {
74+ if (x.tag === "Left") {
75+ if (y.tag === "Left") { return dictEq.eq(x._1)(y._1); }
76+ return false;
77+ }
78+ if (x.tag === "Right") {
79+ if (y.tag === "Right") { return dictEq1.eq(x._1)(y._1); }
80+ return false;
81+ }
82+ return false;
83+ }
84+ }
85+);
86+const ordEither = dictOrd => {
87+ const $1 = dictOrd.Eq0();
88+ return dictOrd1 => {
89+ const $3 = dictOrd1.Eq0();
90+ const eqEither2 = {
91+ eq: x => y => {
92+ if (x.tag === "Left") {
93+ if (y.tag === "Left") { return $1.eq(x._1)(y._1); }
94+ return false;
95+ }
96+ if (x.tag === "Right") {
97+ if (y.tag === "Right") { return $3.eq(x._1)(y._1); }
98+ return false;
99+ }
100+ return false;
101+ }
102+ };
103+ return {
104+ compare: x => y => {
105+ if (x.tag === "Left") {
106+ if (y.tag === "Left") { return dictOrd.compare(x._1)(y._1); }
107+ return Data$dOrdering.LT;
108+ }
109+ if (y.tag === "Left") { return Data$dOrdering.GT; }
110+ if (x.tag === "Right") {
111+ if (y.tag === "Right") { return dictOrd1.compare(x._1)(y._1); }
112+ $runtime.fail();
113+ }
114+ $runtime.fail();
115+ },
116+ Eq0: () => eqEither2
117+ };
118+ };
119+};
120+const eq1Either = dictEq => (
121+ {
122+ eq1: dictEq1 => x => y => {
123+ if (x.tag === "Left") {
124+ if (y.tag === "Left") { return dictEq.eq(x._1)(y._1); }
125+ return false;
126+ }
127+ if (x.tag === "Right") {
128+ if (y.tag === "Right") { return dictEq1.eq(x._1)(y._1); }
129+ return false;
130+ }
131+ return false;
132+ }
133+ }
134+);
135+const ord1Either = dictOrd => {
136+ const ordEither1 = ordEither(dictOrd);
137+ const $2 = dictOrd.Eq0();
138+ const eq1Either1 = {
139+ eq1: dictEq1 => x => y => {
140+ if (x.tag === "Left") {
141+ if (y.tag === "Left") { return $2.eq(x._1)(y._1); }
142+ return false;
143+ }
144+ if (x.tag === "Right") {
145+ if (y.tag === "Right") { return dictEq1.eq(x._1)(y._1); }
146+ return false;
147+ }
148+ return false;
149+ }
150+ };
151+ return {compare1: dictOrd1 => ordEither1(dictOrd1).compare, Eq10: () => eq1Either1};
152+};
153+const either = v => v1 => v2 => {
154+ if (v2.tag === "Left") { return v(v2._1); }
155+ if (v2.tag === "Right") { return v1(v2._1); }
156+ $runtime.fail();
157+};
158+const hush = v2 => {
159+ if (v2.tag === "Left") { return Data$dMaybe.Nothing; }
160+ if (v2.tag === "Right") { return Data$dMaybe.$Maybe("Just", v2._1); }
161+ $runtime.fail();
162+};
163+const isLeft = v2 => {
164+ if (v2.tag === "Left") { return true; }
165+ if (v2.tag === "Right") { return false; }
166+ $runtime.fail();
167+};
168+const isRight = v2 => {
169+ if (v2.tag === "Left") { return false; }
170+ if (v2.tag === "Right") { return true; }
171+ $runtime.fail();
172+};
173+const choose = dictAlt => {
174+ const map1 = dictAlt.Functor0().map;
175+ return a => b => dictAlt.alt(map1(Left)(a))(map1(Right)(b));
176+};
177+const boundedEither = dictBounded => {
178+ const ordEither1 = ordEither(dictBounded.Ord0());
179+ return dictBounded1 => {
180+ const ordEither2 = ordEither1(dictBounded1.Ord0());
181+ return {top: $Either("Right", dictBounded1.top), bottom: $Either("Left", dictBounded.bottom), Ord0: () => ordEither2};
182+ };
183+};
184+const blush = v2 => {
185+ if (v2.tag === "Left") { return Data$dMaybe.$Maybe("Just", v2._1); }
186+ if (v2.tag === "Right") { return Data$dMaybe.Nothing; }
187+ $runtime.fail();
188+};
189+const applyEither = {
190+ apply: v => v1 => {
191+ if (v.tag === "Left") { return $Either("Left", v._1); }
192+ if (v.tag === "Right") {
193+ if (v1.tag === "Left") { return $Either("Left", v1._1); }
194+ if (v1.tag === "Right") { return $Either("Right", v._1(v1._1)); }
195+ $runtime.fail();
196+ }
197+ $runtime.fail();
198+ },
199+ Functor0: () => functorEither
200+};
201+const bindEither = {
202+ bind: v2 => {
203+ if (v2.tag === "Left") { return v => $Either("Left", v2._1); }
204+ if (v2.tag === "Right") { return f => f(v2._1); }
205+ $runtime.fail();
206+ },
207+ Apply0: () => applyEither
208+};
209+const semigroupEither = dictSemigroup => (
210+ {
211+ append: x => y => applyEither.apply((() => {
212+ if (x.tag === "Left") { return $Either("Left", x._1); }
213+ if (x.tag === "Right") { return $Either("Right", dictSemigroup.append(x._1)); }
214+ $runtime.fail();
215+ })())(y)
216+ }
217+);
218+const applicativeEither = {pure: Right, Apply0: () => applyEither};
219+const monadEither = {Applicative0: () => applicativeEither, Bind1: () => bindEither};
220+const altEither = {
221+ alt: v => v1 => {
222+ if (v.tag === "Left") { return v1; }
223+ return v;
224+ },
225+ Functor0: () => functorEither
226+};
227+export {
228+ $Either,
229+ Left,
230+ Right,
231+ altEither,
232+ applicativeEither,
233+ applyEither,
234+ bindEither,
235+ blush,
236+ boundedEither,
237+ choose,
238+ either,
239+ eq1Either,
240+ eqEither,
241+ extendEither,
242+ fromLeft,
243+ fromLeft$p,
244+ fromRight,
245+ fromRight$p,
246+ functorEither,
247+ genericEither,
248+ hush,
249+ invariantEither,
250+ isLeft,
251+ isRight,
252+ monadEither,
253+ note,
254+ note$p,
255+ ord1Either,
256+ ordEither,
257+ semigroupEither,
258+ showEither
259+};
.storybook/purescript-indexer/output-es/Data.Enum.Gen/index.jsnew file+20
@@ -0,0 +1,20 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dMonad$dGen from "../Control.Monad.Gen/index.js";
3+import * as Data$dEnum from "../Data.Enum/index.js";
4+import * as Data$dFoldable from "../Data.Foldable/index.js";
5+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
6+import * as Data$dUnfoldable1 from "../Data.Unfoldable1/index.js";
7+const foldable1NonEmpty = /* #__PURE__ */ Data$dNonEmpty.foldable1NonEmpty(Data$dFoldable.foldableArray);
8+const genBoundedEnum = dictMonadGen => {
9+ const elements = Control$dMonad$dGen.elements(dictMonadGen)(foldable1NonEmpty);
10+ const pure = dictMonadGen.Monad0().Applicative0().pure;
11+ return dictBoundedEnum => {
12+ const Enum1 = dictBoundedEnum.Enum1();
13+ const Bounded0 = dictBoundedEnum.Bounded0();
14+ const v = Enum1.succ(Bounded0.bottom);
15+ if (v.tag === "Just") { return elements(Data$dNonEmpty.$NonEmpty(Bounded0.bottom, Data$dEnum.enumFromTo(Enum1)(Data$dUnfoldable1.unfoldable1Array)(v._1)(Bounded0.top))); }
16+ if (v.tag === "Nothing") { return pure(Bounded0.bottom); }
17+ $runtime.fail();
18+ };
19+};
20+export {foldable1NonEmpty, genBoundedEnum};
.storybook/purescript-indexer/output-es/Data.Enum.Generic/index.jsnew file+194
@@ -0,0 +1,194 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEuclideanRing from "../Data.EuclideanRing/index.js";
3+import * as Data$dGeneric$dRep from "../Data.Generic.Rep/index.js";
4+import * as Data$dMaybe from "../Data.Maybe/index.js";
5+const genericToEnum$p = dict => dict["genericToEnum'"];
6+const genericToEnum = dictGeneric => dictGenericBoundedEnum => x => {
7+ const $3 = dictGenericBoundedEnum["genericToEnum'"](x);
8+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", dictGeneric.to($3._1)); }
9+ return Data$dMaybe.Nothing;
10+};
11+const genericSucc$p = dict => dict["genericSucc'"];
12+const genericSucc = dictGeneric => dictGenericEnum => x => {
13+ const $3 = dictGenericEnum["genericSucc'"](dictGeneric.from(x));
14+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", dictGeneric.to($3._1)); }
15+ return Data$dMaybe.Nothing;
16+};
17+const genericPred$p = dict => dict["genericPred'"];
18+const genericPred = dictGeneric => dictGenericEnum => x => {
19+ const $3 = dictGenericEnum["genericPred'"](dictGeneric.from(x));
20+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", dictGeneric.to($3._1)); }
21+ return Data$dMaybe.Nothing;
22+};
23+const genericFromEnum$p = dict => dict["genericFromEnum'"];
24+const genericFromEnum = dictGeneric => dictGenericBoundedEnum => x => dictGenericBoundedEnum["genericFromEnum'"](dictGeneric.from(x));
25+const genericEnumSum = dictGenericEnum => dictGenericTop => dictGenericEnum1 => dictGenericBottom => (
26+ {
27+ "genericPred'": v => {
28+ if (v.tag === "Inl") {
29+ const $5 = dictGenericEnum["genericPred'"](v._1);
30+ if ($5.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inl", $5._1)); }
31+ return Data$dMaybe.Nothing;
32+ }
33+ if (v.tag === "Inr") {
34+ const v1 = dictGenericEnum1["genericPred'"](v._1);
35+ if (v1.tag === "Nothing") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inl", dictGenericTop["genericTop'"])); }
36+ if (v1.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inr", v1._1)); }
37+ $runtime.fail();
38+ }
39+ $runtime.fail();
40+ },
41+ "genericSucc'": v => {
42+ if (v.tag === "Inl") {
43+ const v1 = dictGenericEnum["genericSucc'"](v._1);
44+ if (v1.tag === "Nothing") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inr", dictGenericBottom["genericBottom'"])); }
45+ if (v1.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inl", v1._1)); }
46+ $runtime.fail();
47+ }
48+ if (v.tag === "Inr") {
49+ const $5 = dictGenericEnum1["genericSucc'"](v._1);
50+ if ($5.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inr", $5._1)); }
51+ return Data$dMaybe.Nothing;
52+ }
53+ $runtime.fail();
54+ }
55+ }
56+);
57+const genericEnumProduct = dictGenericEnum => dictGenericTop => dictGenericBottom => dictGenericEnum1 => dictGenericTop1 => dictGenericBottom1 => (
58+ {
59+ "genericPred'": v => {
60+ const v1 = dictGenericEnum1["genericPred'"](v._2);
61+ if (v1.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Product(v._1, v1._1)); }
62+ if (v1.tag === "Nothing") {
63+ const $8 = dictGenericEnum["genericPred'"](v._1);
64+ if ($8.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Product($8._1, dictGenericTop1["genericTop'"])); }
65+ return Data$dMaybe.Nothing;
66+ }
67+ $runtime.fail();
68+ },
69+ "genericSucc'": v => {
70+ const v1 = dictGenericEnum1["genericSucc'"](v._2);
71+ if (v1.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Product(v._1, v1._1)); }
72+ if (v1.tag === "Nothing") {
73+ const $8 = dictGenericEnum["genericSucc'"](v._1);
74+ if ($8.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Product($8._1, dictGenericBottom1["genericBottom'"])); }
75+ return Data$dMaybe.Nothing;
76+ }
77+ $runtime.fail();
78+ }
79+ }
80+);
81+const genericEnumNoArguments = {"genericPred'": v => Data$dMaybe.Nothing, "genericSucc'": v => Data$dMaybe.Nothing};
82+const genericEnumConstructor = dictGenericEnum => (
83+ {
84+ "genericPred'": v => {
85+ const $2 = dictGenericEnum["genericPred'"](v);
86+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", $2._1); }
87+ return Data$dMaybe.Nothing;
88+ },
89+ "genericSucc'": v => {
90+ const $2 = dictGenericEnum["genericSucc'"](v);
91+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", $2._1); }
92+ return Data$dMaybe.Nothing;
93+ }
94+ }
95+);
96+const genericEnumArgument = dictEnum => (
97+ {
98+ "genericPred'": v => {
99+ const $2 = dictEnum.pred(v);
100+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", $2._1); }
101+ return Data$dMaybe.Nothing;
102+ },
103+ "genericSucc'": v => {
104+ const $2 = dictEnum.succ(v);
105+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", $2._1); }
106+ return Data$dMaybe.Nothing;
107+ }
108+ }
109+);
110+const genericCardinality$p = dict => dict["genericCardinality'"];
111+const genericCardinality = dictGeneric => dictGenericBoundedEnum => dictGenericBoundedEnum["genericCardinality'"];
112+const genericBoundedEnumSum = dictGenericBoundedEnum => dictGenericBoundedEnum1 => (
113+ {
114+ "genericCardinality'": dictGenericBoundedEnum["genericCardinality'"] + dictGenericBoundedEnum1["genericCardinality'"] | 0,
115+ "genericToEnum'": n => {
116+ if (n >= 0 && n < dictGenericBoundedEnum["genericCardinality'"]) {
117+ const $3 = dictGenericBoundedEnum["genericToEnum'"](n);
118+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inl", $3._1)); }
119+ return Data$dMaybe.Nothing;
120+ }
121+ const $3 = dictGenericBoundedEnum1["genericToEnum'"](n - dictGenericBoundedEnum["genericCardinality'"] | 0);
122+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.$Sum("Inr", $3._1)); }
123+ return Data$dMaybe.Nothing;
124+ },
125+ "genericFromEnum'": v => {
126+ if (v.tag === "Inl") { return dictGenericBoundedEnum["genericFromEnum'"](v._1); }
127+ if (v.tag === "Inr") { return dictGenericBoundedEnum1["genericFromEnum'"](v._1) + dictGenericBoundedEnum["genericCardinality'"] | 0; }
128+ $runtime.fail();
129+ }
130+ }
131+);
132+const genericBoundedEnumProduct = dictGenericBoundedEnum => dictGenericBoundedEnum1 => (
133+ {
134+ "genericCardinality'": dictGenericBoundedEnum["genericCardinality'"] * dictGenericBoundedEnum1["genericCardinality'"] | 0,
135+ "genericToEnum'": n => Data$dMaybe.applyMaybe.apply((() => {
136+ const $3 = dictGenericBoundedEnum["genericToEnum'"](Data$dEuclideanRing.intDiv(n)(dictGenericBoundedEnum1["genericCardinality'"]));
137+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.Product($3._1)); }
138+ return Data$dMaybe.Nothing;
139+ })())(dictGenericBoundedEnum1["genericToEnum'"](Data$dEuclideanRing.intMod(n)(dictGenericBoundedEnum1["genericCardinality'"]))),
140+ "genericFromEnum'": v1 => (dictGenericBoundedEnum["genericFromEnum'"](v1._1) * dictGenericBoundedEnum1["genericCardinality'"] | 0) + dictGenericBoundedEnum1["genericFromEnum'"](v1._2) | 0
141+ }
142+);
143+const genericBoundedEnumNoArguments = {
144+ "genericCardinality'": 1,
145+ "genericToEnum'": i => {
146+ if (i === 0) { return Data$dMaybe.$Maybe("Just", Data$dGeneric$dRep.NoArguments); }
147+ return Data$dMaybe.Nothing;
148+ },
149+ "genericFromEnum'": v => 0
150+};
151+const genericBoundedEnumConstructor = dictGenericBoundedEnum => (
152+ {
153+ "genericCardinality'": dictGenericBoundedEnum["genericCardinality'"],
154+ "genericToEnum'": i => {
155+ const $2 = dictGenericBoundedEnum["genericToEnum'"](i);
156+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", $2._1); }
157+ return Data$dMaybe.Nothing;
158+ },
159+ "genericFromEnum'": v => dictGenericBoundedEnum["genericFromEnum'"](v)
160+ }
161+);
162+const genericBoundedEnumArgument = dictBoundedEnum => (
163+ {
164+ "genericCardinality'": dictBoundedEnum.cardinality,
165+ "genericToEnum'": i => {
166+ const $2 = dictBoundedEnum.toEnum(i);
167+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", $2._1); }
168+ return Data$dMaybe.Nothing;
169+ },
170+ "genericFromEnum'": v => dictBoundedEnum.fromEnum(v)
171+ }
172+);
173+export {
174+ genericBoundedEnumArgument,
175+ genericBoundedEnumConstructor,
176+ genericBoundedEnumNoArguments,
177+ genericBoundedEnumProduct,
178+ genericBoundedEnumSum,
179+ genericCardinality,
180+ genericCardinality$p,
181+ genericEnumArgument,
182+ genericEnumConstructor,
183+ genericEnumNoArguments,
184+ genericEnumProduct,
185+ genericEnumSum,
186+ genericFromEnum,
187+ genericFromEnum$p,
188+ genericPred,
189+ genericPred$p,
190+ genericSucc,
191+ genericSucc$p,
192+ genericToEnum,
193+ genericToEnum$p
194+};
.storybook/purescript-indexer/output-es/Data.Enum/foreign.jsnew file+7
@@ -0,0 +1,7 @@
1+export function toCharCode(c) {
2+ return c.charCodeAt(0);
3+}
4+
5+export function fromCharCode(c) {
6+ return String.fromCharCode(c);
7+}
.storybook/purescript-indexer/output-es/Data.Enum/index.jsnew file+407
@@ -0,0 +1,407 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dAlternative from "../Control.Alternative/index.js";
3+import * as Data$dBounded from "../Data.Bounded/index.js";
4+import * as Data$dEither from "../Data.Either/index.js";
5+import * as Data$dEq from "../Data.Eq/index.js";
6+import * as Data$dMaybe from "../Data.Maybe/index.js";
7+import * as Data$dOrd from "../Data.Ord/index.js";
8+import * as Data$dOrdering from "../Data.Ordering/index.js";
9+import * as Data$dShow from "../Data.Show/index.js";
10+import * as Data$dTuple from "../Data.Tuple/index.js";
11+import * as Data$dUnfoldable1 from "../Data.Unfoldable1/index.js";
12+import * as Data$dUnit from "../Data.Unit/index.js";
13+import {fromCharCode, toCharCode} from "./foreign.js";
14+const guard = /* #__PURE__ */ Control$dAlternative.guard(Data$dMaybe.alternativeMaybe);
15+const Cardinality = x => x;
16+const toEnum = dict => dict.toEnum;
17+const succ = dict => dict.succ;
18+const upFromIncluding = dictEnum => dictUnfoldable1 => dictUnfoldable1.unfoldr1(x => Data$dTuple.$Tuple(x, dictEnum.succ(x)));
19+const showCardinality = {show: v => "(Cardinality " + (Data$dShow.showIntImpl(v) + ")")};
20+const pred = dict => dict.pred;
21+const ordCardinality = Data$dOrd.ordInt;
22+const newtypeCardinality = {Coercible0: () => undefined};
23+const fromEnum = dict => dict.fromEnum;
24+const toEnumWithDefaults = dictBoundedEnum => {
25+ const bottom2 = dictBoundedEnum.Bounded0().bottom;
26+ return low => high => x => {
27+ const v = dictBoundedEnum.toEnum(x);
28+ if (v.tag === "Just") { return v._1; }
29+ if (v.tag === "Nothing") {
30+ if (x < dictBoundedEnum.fromEnum(bottom2)) { return low; }
31+ return high;
32+ }
33+ $runtime.fail();
34+ };
35+};
36+const eqCardinality = Data$dEq.eqInt;
37+const enumUnit = {succ: v => Data$dMaybe.Nothing, pred: v => Data$dMaybe.Nothing, Ord0: () => Data$dOrd.ordUnit};
38+const enumTuple = dictEnum => {
39+ const ordTuple = Data$dTuple.ordTuple(dictEnum.Ord0());
40+ return dictBoundedEnum => {
41+ const Bounded0 = dictBoundedEnum.Bounded0();
42+ const Enum1 = dictBoundedEnum.Enum1();
43+ const ordTuple1 = ordTuple(Enum1.Ord0());
44+ return {
45+ succ: v => {
46+ const $7 = dictEnum.succ(v._1);
47+ const $8 = (() => {
48+ if ($7.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple($7._1, Bounded0.bottom)); }
49+ return Data$dMaybe.Nothing;
50+ })();
51+ const $9 = Data$dTuple.Tuple(v._1);
52+ const $10 = Enum1.succ(v._2);
53+ if ($10.tag === "Nothing") { return $8; }
54+ if ($10.tag === "Just") { return Data$dMaybe.$Maybe("Just", $9($10._1)); }
55+ $runtime.fail();
56+ },
57+ pred: v => {
58+ const $7 = dictEnum.pred(v._1);
59+ const $8 = (() => {
60+ if ($7.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple($7._1, Bounded0.top)); }
61+ return Data$dMaybe.Nothing;
62+ })();
63+ const $9 = Data$dTuple.Tuple(v._1);
64+ const $10 = Enum1.pred(v._2);
65+ if ($10.tag === "Nothing") { return $8; }
66+ if ($10.tag === "Just") { return Data$dMaybe.$Maybe("Just", $9($10._1)); }
67+ $runtime.fail();
68+ },
69+ Ord0: () => ordTuple1
70+ };
71+ };
72+};
73+const enumOrdering = {
74+ succ: v => {
75+ if (v.tag === "LT") { return Data$dMaybe.$Maybe("Just", Data$dOrdering.EQ); }
76+ if (v.tag === "EQ") { return Data$dMaybe.$Maybe("Just", Data$dOrdering.GT); }
77+ if (v.tag === "GT") { return Data$dMaybe.Nothing; }
78+ $runtime.fail();
79+ },
80+ pred: v => {
81+ if (v.tag === "LT") { return Data$dMaybe.Nothing; }
82+ if (v.tag === "EQ") { return Data$dMaybe.$Maybe("Just", Data$dOrdering.LT); }
83+ if (v.tag === "GT") { return Data$dMaybe.$Maybe("Just", Data$dOrdering.EQ); }
84+ $runtime.fail();
85+ },
86+ Ord0: () => Data$dOrd.ordOrdering
87+};
88+const enumMaybe = dictBoundedEnum => {
89+ const bottom2 = dictBoundedEnum.Bounded0().bottom;
90+ const Enum1 = dictBoundedEnum.Enum1();
91+ const ordMaybe = Data$dMaybe.ordMaybe(Enum1.Ord0());
92+ return {
93+ succ: v => {
94+ if (v.tag === "Nothing") { return Data$dMaybe.$Maybe("Just", Data$dMaybe.$Maybe("Just", bottom2)); }
95+ if (v.tag === "Just") {
96+ const $5 = Enum1.succ(v._1);
97+ if ($5.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dMaybe.$Maybe("Just", $5._1)); }
98+ return Data$dMaybe.Nothing;
99+ }
100+ $runtime.fail();
101+ },
102+ pred: v => {
103+ if (v.tag === "Nothing") { return Data$dMaybe.Nothing; }
104+ if (v.tag === "Just") { return Data$dMaybe.$Maybe("Just", Enum1.pred(v._1)); }
105+ $runtime.fail();
106+ },
107+ Ord0: () => ordMaybe
108+ };
109+};
110+const enumInt = {
111+ succ: n => {
112+ if (n < 2147483647) { return Data$dMaybe.$Maybe("Just", n + 1 | 0); }
113+ return Data$dMaybe.Nothing;
114+ },
115+ pred: n => {
116+ if (n > -2147483648) { return Data$dMaybe.$Maybe("Just", n - 1 | 0); }
117+ return Data$dMaybe.Nothing;
118+ },
119+ Ord0: () => Data$dOrd.ordInt
120+};
121+const enumFromTo = dictEnum => {
122+ const Ord0 = dictEnum.Ord0();
123+ const eq1 = Ord0.Eq0().eq;
124+ return dictUnfoldable1 => v => v1 => {
125+ if (eq1(v)(v1)) { return Data$dUnfoldable1.replicate1(dictUnfoldable1)(1)(v); }
126+ if (Ord0.compare(v)(v1).tag === "LT") {
127+ return dictUnfoldable1.unfoldr1(a => Data$dTuple.$Tuple(
128+ a,
129+ (() => {
130+ const $7 = dictEnum.succ(a);
131+ if ($7.tag === "Just") {
132+ if (guard(!(Ord0.compare($7._1)(v1).tag === "GT")).tag === "Just") { return Data$dMaybe.$Maybe("Just", $7._1); }
133+ return Data$dMaybe.Nothing;
134+ }
135+ if ($7.tag === "Nothing") { return Data$dMaybe.Nothing; }
136+ $runtime.fail();
137+ })()
138+ ))(v);
139+ }
140+ return dictUnfoldable1.unfoldr1(a => Data$dTuple.$Tuple(
141+ a,
142+ (() => {
143+ const $7 = dictEnum.pred(a);
144+ if ($7.tag === "Just") {
145+ if (guard(!(Ord0.compare($7._1)(v1).tag === "LT")).tag === "Just") { return Data$dMaybe.$Maybe("Just", $7._1); }
146+ return Data$dMaybe.Nothing;
147+ }
148+ if ($7.tag === "Nothing") { return Data$dMaybe.Nothing; }
149+ $runtime.fail();
150+ })()
151+ ))(v);
152+ };
153+};
154+const enumFromThenTo = dictUnfoldable => dictFunctor => dictBoundedEnum => a => b => c => {
155+ const a$p = dictBoundedEnum.fromEnum(a);
156+ return dictFunctor.map(x => {
157+ const $8 = dictBoundedEnum.toEnum(x);
158+ if ($8.tag === "Just") { return $8._1; }
159+ $runtime.fail();
160+ })(dictUnfoldable.unfoldr((() => {
161+ const $7 = dictBoundedEnum.fromEnum(b) - a$p | 0;
162+ const $8 = dictBoundedEnum.fromEnum(c);
163+ return e => {
164+ if (e <= $8) { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(e, e + $7 | 0)); }
165+ return Data$dMaybe.Nothing;
166+ };
167+ })())(a$p));
168+};
169+const enumEither = dictBoundedEnum => {
170+ const Enum1 = dictBoundedEnum.Enum1();
171+ const top2 = dictBoundedEnum.Bounded0().top;
172+ const ordEither = Data$dEither.ordEither(Enum1.Ord0());
173+ return dictBoundedEnum1 => {
174+ const bottom2 = dictBoundedEnum1.Bounded0().bottom;
175+ const Enum11 = dictBoundedEnum1.Enum1();
176+ const ordEither1 = ordEither(Enum11.Ord0());
177+ return {
178+ succ: v => {
179+ if (v.tag === "Left") {
180+ const $9 = Enum1.succ(v._1);
181+ if ($9.tag === "Nothing") { return Data$dMaybe.$Maybe("Just", Data$dEither.$Either("Right", bottom2)); }
182+ if ($9.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dEither.$Either("Left", $9._1)); }
183+ $runtime.fail();
184+ }
185+ if (v.tag === "Right") {
186+ const $9 = Enum11.succ(v._1);
187+ if ($9.tag === "Nothing") { return Data$dMaybe.Nothing; }
188+ if ($9.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dEither.$Either("Right", $9._1)); }
189+ $runtime.fail();
190+ }
191+ $runtime.fail();
192+ },
193+ pred: v => {
194+ if (v.tag === "Left") {
195+ const $9 = Enum1.pred(v._1);
196+ if ($9.tag === "Nothing") { return Data$dMaybe.Nothing; }
197+ if ($9.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dEither.$Either("Left", $9._1)); }
198+ $runtime.fail();
199+ }
200+ if (v.tag === "Right") {
201+ const $9 = Enum11.pred(v._1);
202+ if ($9.tag === "Nothing") { return Data$dMaybe.$Maybe("Just", Data$dEither.$Either("Left", top2)); }
203+ if ($9.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dEither.$Either("Right", $9._1)); }
204+ $runtime.fail();
205+ }
206+ $runtime.fail();
207+ },
208+ Ord0: () => ordEither1
209+ };
210+ };
211+};
212+const enumBoolean = {
213+ succ: v => {
214+ if (!v) { return Data$dMaybe.$Maybe("Just", true); }
215+ return Data$dMaybe.Nothing;
216+ },
217+ pred: v => {
218+ if (v) { return Data$dMaybe.$Maybe("Just", false); }
219+ return Data$dMaybe.Nothing;
220+ },
221+ Ord0: () => Data$dOrd.ordBoolean
222+};
223+const downFromIncluding = dictEnum => dictUnfoldable1 => dictUnfoldable1.unfoldr1(x => Data$dTuple.$Tuple(x, dictEnum.pred(x)));
224+const downFrom = dictEnum => dictUnfoldable => dictUnfoldable.unfoldr(x => {
225+ const $3 = dictEnum.pred(x);
226+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple($3._1, $3._1)); }
227+ return Data$dMaybe.Nothing;
228+});
229+const upFrom = dictEnum => dictUnfoldable => dictUnfoldable.unfoldr(x => {
230+ const $3 = dictEnum.succ(x);
231+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple($3._1, $3._1)); }
232+ return Data$dMaybe.Nothing;
233+});
234+const defaultToEnum = dictBounded => dictEnum => i$p => {
235+ const go = go$a0$copy => go$a1$copy => {
236+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
237+ while (go$c) {
238+ const i = go$a0, x = go$a1;
239+ if (i === 0) {
240+ go$c = false;
241+ go$r = Data$dMaybe.$Maybe("Just", x);
242+ continue;
243+ }
244+ const v = dictEnum.succ(x);
245+ if (v.tag === "Just") {
246+ go$a0 = i - 1 | 0;
247+ go$a1 = v._1;
248+ continue;
249+ }
250+ if (v.tag === "Nothing") {
251+ go$c = false;
252+ go$r = Data$dMaybe.Nothing;
253+ continue;
254+ }
255+ $runtime.fail();
256+ };
257+ return go$r;
258+ };
259+ if (i$p < 0) { return Data$dMaybe.Nothing; }
260+ return go(i$p)(dictBounded.bottom);
261+};
262+const defaultSucc = toEnum$p => fromEnum$p => a => toEnum$p(fromEnum$p(a) + 1 | 0);
263+const defaultPred = toEnum$p => fromEnum$p => a => toEnum$p(fromEnum$p(a) - 1 | 0);
264+const defaultFromEnum = dictEnum => {
265+ const go = go$a0$copy => go$a1$copy => {
266+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
267+ while (go$c) {
268+ const i = go$a0, x = go$a1;
269+ const v = dictEnum.pred(x);
270+ if (v.tag === "Just") {
271+ go$a0 = i + 1 | 0;
272+ go$a1 = v._1;
273+ continue;
274+ }
275+ if (v.tag === "Nothing") {
276+ go$c = false;
277+ go$r = i;
278+ continue;
279+ }
280+ $runtime.fail();
281+ };
282+ return go$r;
283+ };
284+ return go(0);
285+};
286+const defaultCardinality = dictBounded => dictEnum => {
287+ const go = go$a0$copy => go$a1$copy => {
288+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
289+ while (go$c) {
290+ const i = go$a0, x = go$a1;
291+ const v = dictEnum.succ(x);
292+ if (v.tag === "Just") {
293+ go$a0 = i + 1 | 0;
294+ go$a1 = v._1;
295+ continue;
296+ }
297+ if (v.tag === "Nothing") {
298+ go$c = false;
299+ go$r = i;
300+ continue;
301+ }
302+ $runtime.fail();
303+ };
304+ return go$r;
305+ };
306+ return go(1)(dictBounded.bottom);
307+};
308+const charToEnum = v => {
309+ if (v >= 0 && v <= 65535) { return Data$dMaybe.$Maybe("Just", fromCharCode(v)); }
310+ return Data$dMaybe.Nothing;
311+};
312+const enumChar = {
313+ succ: a => {
314+ const $1 = toCharCode(a) + 1 | 0;
315+ if ($1 >= 0 && $1 <= 65535) { return Data$dMaybe.$Maybe("Just", fromCharCode($1)); }
316+ return Data$dMaybe.Nothing;
317+ },
318+ pred: a => {
319+ const $1 = toCharCode(a) - 1 | 0;
320+ if ($1 >= 0 && $1 <= 65535) { return Data$dMaybe.$Maybe("Just", fromCharCode($1)); }
321+ return Data$dMaybe.Nothing;
322+ },
323+ Ord0: () => Data$dOrd.ordChar
324+};
325+const cardinality = dict => dict.cardinality;
326+const boundedEnumUnit = {
327+ cardinality: 1,
328+ toEnum: v => {
329+ if (v === 0) { return Data$dMaybe.$Maybe("Just", Data$dUnit.unit); }
330+ return Data$dMaybe.Nothing;
331+ },
332+ fromEnum: v => 0,
333+ Bounded0: () => Data$dBounded.boundedUnit,
334+ Enum1: () => enumUnit
335+};
336+const boundedEnumOrdering = {
337+ cardinality: 3,
338+ toEnum: v => {
339+ if (v === 0) { return Data$dMaybe.$Maybe("Just", Data$dOrdering.LT); }
340+ if (v === 1) { return Data$dMaybe.$Maybe("Just", Data$dOrdering.EQ); }
341+ if (v === 2) { return Data$dMaybe.$Maybe("Just", Data$dOrdering.GT); }
342+ return Data$dMaybe.Nothing;
343+ },
344+ fromEnum: v => {
345+ if (v.tag === "LT") { return 0; }
346+ if (v.tag === "EQ") { return 1; }
347+ if (v.tag === "GT") { return 2; }
348+ $runtime.fail();
349+ },
350+ Bounded0: () => Data$dBounded.boundedOrdering,
351+ Enum1: () => enumOrdering
352+};
353+const boundedEnumChar = {cardinality: 65535, toEnum: charToEnum, fromEnum: toCharCode, Bounded0: () => Data$dBounded.boundedChar, Enum1: () => enumChar};
354+const boundedEnumBoolean = {
355+ cardinality: 2,
356+ toEnum: v => {
357+ if (v === 0) { return Data$dMaybe.$Maybe("Just", false); }
358+ if (v === 1) { return Data$dMaybe.$Maybe("Just", true); }
359+ return Data$dMaybe.Nothing;
360+ },
361+ fromEnum: v => {
362+ if (!v) { return 0; }
363+ if (v) { return 1; }
364+ $runtime.fail();
365+ },
366+ Bounded0: () => Data$dBounded.boundedBoolean,
367+ Enum1: () => enumBoolean
368+};
369+export {
370+ Cardinality,
371+ boundedEnumBoolean,
372+ boundedEnumChar,
373+ boundedEnumOrdering,
374+ boundedEnumUnit,
375+ cardinality,
376+ charToEnum,
377+ defaultCardinality,
378+ defaultFromEnum,
379+ defaultPred,
380+ defaultSucc,
381+ defaultToEnum,
382+ downFrom,
383+ downFromIncluding,
384+ enumBoolean,
385+ enumChar,
386+ enumEither,
387+ enumFromThenTo,
388+ enumFromTo,
389+ enumInt,
390+ enumMaybe,
391+ enumOrdering,
392+ enumTuple,
393+ enumUnit,
394+ eqCardinality,
395+ fromEnum,
396+ guard,
397+ newtypeCardinality,
398+ ordCardinality,
399+ pred,
400+ showCardinality,
401+ succ,
402+ toEnum,
403+ toEnumWithDefaults,
404+ upFrom,
405+ upFromIncluding
406+};
407+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Eq.Generic/index.jsnew file+24
@@ -0,0 +1,24 @@
1+import * as $runtime from "../runtime.js";
2+const genericEqNoConstructors = {"genericEq'": v => v1 => true};
3+const genericEqNoArguments = {"genericEq'": v => v1 => true};
4+const genericEqArgument = dictEq => ({"genericEq'": v => v1 => dictEq.eq(v)(v1)});
5+const genericEq$p = dict => dict["genericEq'"];
6+const genericEqConstructor = dictGenericEq => ({"genericEq'": v => v1 => dictGenericEq["genericEq'"](v)(v1)});
7+const genericEqProduct = dictGenericEq => dictGenericEq1 => ({"genericEq'": v => v1 => dictGenericEq["genericEq'"](v._1)(v1._1) && dictGenericEq1["genericEq'"](v._2)(v1._2)});
8+const genericEqSum = dictGenericEq => dictGenericEq1 => (
9+ {
10+ "genericEq'": v => v1 => {
11+ if (v.tag === "Inl") {
12+ if (v1.tag === "Inl") { return dictGenericEq["genericEq'"](v._1)(v1._1); }
13+ return false;
14+ }
15+ if (v.tag === "Inr") {
16+ if (v1.tag === "Inr") { return dictGenericEq1["genericEq'"](v._1)(v1._1); }
17+ return false;
18+ }
19+ return false;
20+ }
21+ }
22+);
23+const genericEq = dictGeneric => dictGenericEq => x => y => dictGenericEq["genericEq'"](dictGeneric.from(x))(dictGeneric.from(y));
24+export {genericEq, genericEq$p, genericEqArgument, genericEqConstructor, genericEqNoArguments, genericEqNoConstructors, genericEqProduct, genericEqSum};
.storybook/purescript-indexer/output-es/Data.Eq/foreign.jsnew file+23
@@ -0,0 +1,23 @@
1+var refEq = function (r1) {
2+ return function (r2) {
3+ return r1 === r2;
4+ };
5+};
6+
7+export const eqBooleanImpl = refEq;
8+export const eqIntImpl = refEq;
9+export const eqNumberImpl = refEq;
10+export const eqCharImpl = refEq;
11+export const eqStringImpl = refEq;
12+
13+export const eqArrayImpl = function (f) {
14+ return function (xs) {
15+ return function (ys) {
16+ if (xs.length !== ys.length) return false;
17+ for (var i = 0; i < xs.length; i++) {
18+ if (!f(xs[i])(ys[i])) return false;
19+ }
20+ return true;
21+ };
22+ };
23+};
.storybook/purescript-indexer/output-es/Data.Eq/index.jsnew file+34
@@ -0,0 +1,34 @@
1+import * as $runtime from "../runtime.js";
2+import * as Record$dUnsafe from "../Record.Unsafe/index.js";
3+import * as Type$dProxy from "../Type.Proxy/index.js";
4+import {eqArrayImpl, eqBooleanImpl, eqCharImpl, eqIntImpl, eqNumberImpl, eqStringImpl} from "./foreign.js";
5+const eqVoid = {eq: v => v1 => true};
6+const eqUnit = {eq: v => v1 => true};
7+const eqString = {eq: eqStringImpl};
8+const eqRowNil = {eqRecord: v => v1 => v2 => true};
9+const eqRecord = dict => dict.eqRecord;
10+const eqRec = () => dictEqRecord => ({eq: dictEqRecord.eqRecord(Type$dProxy.Proxy)});
11+const eqProxy = {eq: v => v1 => true};
12+const eqNumber = {eq: eqNumberImpl};
13+const eqInt = {eq: eqIntImpl};
14+const eqChar = {eq: eqCharImpl};
15+const eqBoolean = {eq: eqBooleanImpl};
16+const eq1 = dict => dict.eq1;
17+const eq = dict => dict.eq;
18+const eqArray = dictEq => ({eq: eqArrayImpl(dictEq.eq)});
19+const eq1Array = {eq1: dictEq => eqArrayImpl(dictEq.eq)};
20+const eqRowCons = dictEqRecord => () => dictIsSymbol => dictEq => (
21+ {
22+ eqRecord: v => ra => rb => {
23+ const $$get = Record$dUnsafe.unsafeGet(dictIsSymbol.reflectSymbol(Type$dProxy.Proxy));
24+ return dictEq.eq($$get(ra))($$get(rb)) && dictEqRecord.eqRecord(Type$dProxy.Proxy)(ra)(rb);
25+ }
26+ }
27+);
28+const notEq = dictEq => x => y => !dictEq.eq(x)(y);
29+const notEq1 = dictEq1 => dictEq => {
30+ const eq12 = dictEq1.eq1(dictEq);
31+ return x => y => !eq12(x)(y);
32+};
33+export {eq, eq1, eq1Array, eqArray, eqBoolean, eqChar, eqInt, eqNumber, eqProxy, eqRec, eqRecord, eqRowCons, eqRowNil, eqString, eqUnit, eqVoid, notEq, notEq1};
34+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Equivalence/index.jsnew file+9
@@ -0,0 +1,9 @@
1+import * as $runtime from "../runtime.js";
2+const Equivalence = x => x;
3+const semigroupEquivalence = {append: v => v1 => a => b => v(a)(b) && v1(a)(b)};
4+const newtypeEquivalence = {Coercible0: () => undefined};
5+const monoidEquivalence = {mempty: v => v1 => true, Semigroup0: () => semigroupEquivalence};
6+const defaultEquivalence = dictEq => dictEq.eq;
7+const contravariantEquivalence = {cmap: f => v => x => y => v(f(x))(f(y))};
8+const comparisonEquivalence = v => a => b => v(a)(b).tag === "EQ";
9+export {Equivalence, comparisonEquivalence, contravariantEquivalence, defaultEquivalence, monoidEquivalence, newtypeEquivalence, semigroupEquivalence};
.storybook/purescript-indexer/output-es/Data.EuclideanRing/foreign.jsnew file+26
@@ -0,0 +1,26 @@
1+export const intDegree = function (x) {
2+ return Math.min(Math.abs(x), 2147483647);
3+};
4+
5+// See the Euclidean definition in
6+// https://en.m.wikipedia.org/wiki/Modulo_operation.
7+export const intDiv = function (x) {
8+ return function (y) {
9+ if (y === 0) return 0;
10+ return y > 0 ? Math.floor(x / y) : -Math.floor(x / -y);
11+ };
12+};
13+
14+export const intMod = function (x) {
15+ return function (y) {
16+ if (y === 0) return 0;
17+ var yy = Math.abs(y);
18+ return ((x % yy) + yy) % yy;
19+ };
20+};
21+
22+export const numDiv = function (n1) {
23+ return function (n2) {
24+ return n1 / n2;
25+ };
26+};
.storybook/purescript-indexer/output-es/Data.EuclideanRing/index.jsnew file+25
@@ -0,0 +1,25 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dCommutativeRing from "../Data.CommutativeRing/index.js";
3+import {intDegree, intDiv, intMod, numDiv} from "./foreign.js";
4+const mod = dict => dict.mod;
5+const gcd = dictEq => dictEuclideanRing => {
6+ const zero = dictEuclideanRing.CommutativeRing0().Ring0().Semiring0().zero;
7+ return a => b => {
8+ if (dictEq.eq(b)(zero)) { return a; }
9+ return gcd(dictEq)(dictEuclideanRing)(b)(dictEuclideanRing.mod(a)(b));
10+ };
11+};
12+const euclideanRingNumber = {degree: v => 1, div: numDiv, mod: v => v1 => 0.0, CommutativeRing0: () => Data$dCommutativeRing.commutativeRingNumber};
13+const euclideanRingInt = {degree: intDegree, div: intDiv, mod: intMod, CommutativeRing0: () => Data$dCommutativeRing.commutativeRingInt};
14+const div = dict => dict.div;
15+const lcm = dictEq => dictEuclideanRing => {
16+ const Semiring0 = dictEuclideanRing.CommutativeRing0().Ring0().Semiring0();
17+ const gcd2 = gcd(dictEq)(dictEuclideanRing);
18+ return a => b => {
19+ if (dictEq.eq(a)(Semiring0.zero) || dictEq.eq(b)(Semiring0.zero)) { return Semiring0.zero; }
20+ return dictEuclideanRing.div(Semiring0.mul(a)(b))(gcd2(a)(b));
21+ };
22+};
23+const degree = dict => dict.degree;
24+export {degree, div, euclideanRingInt, euclideanRingNumber, gcd, lcm, mod};
25+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Exists/index.jsnew file+5
@@ -0,0 +1,5 @@
1+import * as $runtime from "../runtime.js";
2+import * as Unsafe$dCoerce from "../Unsafe.Coerce/index.js";
3+const runExists = Unsafe$dCoerce.unsafeCoerce;
4+const mkExists = Unsafe$dCoerce.unsafeCoerce;
5+export {mkExists, runExists};
.storybook/purescript-indexer/output-es/Data.Field/index.jsnew file+3
@@ -0,0 +1,3 @@
1+import * as $runtime from "../runtime.js";
2+const field = dictEuclideanRing => dictDivisionRing => ({EuclideanRing0: () => dictEuclideanRing, DivisionRing1: () => dictDivisionRing});
3+export {field};
.storybook/purescript-indexer/output-es/Data.Foldable/foreign.jsnew file+25
@@ -0,0 +1,25 @@
1+export const foldrArray = function (f) {
2+ return function (init) {
3+ return function (xs) {
4+ var acc = init;
5+ var len = xs.length;
6+ for (var i = len - 1; i >= 0; i--) {
7+ acc = f(xs[i])(acc);
8+ }
9+ return acc;
10+ };
11+ };
12+};
13+
14+export const foldlArray = function (f) {
15+ return function (init) {
16+ return function (xs) {
17+ var acc = init;
18+ var len = xs.length;
19+ for (var i = 0; i < len; i++) {
20+ acc = f(acc)(xs[i]);
21+ }
22+ return acc;
23+ };
24+ };
25+};
.storybook/purescript-indexer/output-es/Data.Foldable/index.jsnew file+389
@@ -0,0 +1,389 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dApply from "../Control.Apply/index.js";
3+import * as Data$dMaybe from "../Data.Maybe/index.js";
4+import * as Data$dMaybe$dFirst from "../Data.Maybe.First/index.js";
5+import * as Data$dUnit from "../Data.Unit/index.js";
6+import {foldlArray, foldrArray} from "./foreign.js";
7+const identity = x => x;
8+const monoidEndo = /* #__PURE__ */ (() => {
9+ const semigroupEndo1 = {append: v => v1 => x => v(v1(x))};
10+ return {mempty: x => x, Semigroup0: () => semigroupEndo1};
11+})();
12+const monoidDual = /* #__PURE__ */ (() => {
13+ const $0 = monoidEndo.Semigroup0();
14+ const semigroupDual1 = {append: v => v1 => $0.append(v1)(v)};
15+ return {mempty: monoidEndo.mempty, Semigroup0: () => semigroupDual1};
16+})();
17+const foldr = dict => dict.foldr;
18+const indexr = dictFoldable => idx => {
19+ const $2 = dictFoldable.foldr(a => cursor => {
20+ if (cursor.elem.tag === "Just") { return cursor; }
21+ if (cursor.pos === idx) { return {elem: Data$dMaybe.$Maybe("Just", a), pos: cursor.pos}; }
22+ return {pos: cursor.pos + 1 | 0, elem: cursor.elem};
23+ })({elem: Data$dMaybe.Nothing, pos: 0});
24+ return x => $2(x).elem;
25+};
26+const $$null = dictFoldable => dictFoldable.foldr(v => v1 => false)(true);
27+const oneOf = dictFoldable => dictPlus => dictFoldable.foldr(dictPlus.Alt0().alt)(dictPlus.empty);
28+const oneOfMap = dictFoldable => dictPlus => {
29+ const alt = dictPlus.Alt0().alt;
30+ return f => dictFoldable.foldr(x => alt(f(x)))(dictPlus.empty);
31+};
32+const traverse_ = dictApplicative => {
33+ const $1 = dictApplicative.Apply0();
34+ const map = $1.Functor0().map;
35+ return dictFoldable => f => dictFoldable.foldr(x => {
36+ const $6 = f(x);
37+ return b => $1.apply(map(v => Control$dApply.identity)($6))(b);
38+ })(dictApplicative.pure(Data$dUnit.unit));
39+};
40+const for_ = dictApplicative => {
41+ const traverse_1 = traverse_(dictApplicative);
42+ return dictFoldable => {
43+ const $3 = traverse_1(dictFoldable);
44+ return b => a => $3(a)(b);
45+ };
46+};
47+const sequence_ = dictApplicative => {
48+ const traverse_1 = traverse_(dictApplicative);
49+ return dictFoldable => traverse_1(dictFoldable)(identity);
50+};
51+const foldl = dict => dict.foldl;
52+const indexl = dictFoldable => idx => {
53+ const $2 = dictFoldable.foldl(cursor => a => {
54+ if (cursor.elem.tag === "Just") { return cursor; }
55+ if (cursor.pos === idx) { return {elem: Data$dMaybe.$Maybe("Just", a), pos: cursor.pos}; }
56+ return {pos: cursor.pos + 1 | 0, elem: cursor.elem};
57+ })({elem: Data$dMaybe.Nothing, pos: 0});
58+ return x => $2(x).elem;
59+};
60+const intercalate = dictFoldable => dictMonoid => {
61+ const append = dictMonoid.Semigroup0().append;
62+ return sep => xs => dictFoldable.foldl(v => v1 => {
63+ if (v.init) { return {init: false, acc: v1}; }
64+ return {init: false, acc: append(v.acc)(append(sep)(v1))};
65+ })({init: true, acc: dictMonoid.mempty})(xs).acc;
66+};
67+const length = dictFoldable => dictSemiring => dictFoldable.foldl(c => v => dictSemiring.add(dictSemiring.one)(c))(dictSemiring.zero);
68+const maximumBy = dictFoldable => cmp => dictFoldable.foldl(v => v1 => {
69+ if (v.tag === "Nothing") { return Data$dMaybe.$Maybe("Just", v1); }
70+ if (v.tag === "Just") {
71+ return Data$dMaybe.$Maybe(
72+ "Just",
73+ (() => {
74+ if (cmp(v._1)(v1).tag === "GT") { return v._1; }
75+ return v1;
76+ })()
77+ );
78+ }
79+ $runtime.fail();
80+})(Data$dMaybe.Nothing);
81+const maximum = dictOrd => dictFoldable => maximumBy(dictFoldable)(dictOrd.compare);
82+const minimumBy = dictFoldable => cmp => dictFoldable.foldl(v => v1 => {
83+ if (v.tag === "Nothing") { return Data$dMaybe.$Maybe("Just", v1); }
84+ if (v.tag === "Just") {
85+ return Data$dMaybe.$Maybe(
86+ "Just",
87+ (() => {
88+ if (cmp(v._1)(v1).tag === "LT") { return v._1; }
89+ return v1;
90+ })()
91+ );
92+ }
93+ $runtime.fail();
94+})(Data$dMaybe.Nothing);
95+const minimum = dictOrd => dictFoldable => minimumBy(dictFoldable)(dictOrd.compare);
96+const product = dictFoldable => dictSemiring => dictFoldable.foldl(dictSemiring.mul)(dictSemiring.one);
97+const sum = dictFoldable => dictSemiring => dictFoldable.foldl(dictSemiring.add)(dictSemiring.zero);
98+const foldableTuple = {foldr: f => z => v => f(v._2)(z), foldl: f => z => v => f(z)(v._2), foldMap: dictMonoid => f => v => f(v._2)};
99+const foldableMultiplicative = {foldr: f => z => v => f(v)(z), foldl: f => z => v => f(z)(v), foldMap: dictMonoid => f => v => f(v)};
100+const foldableMaybe = {
101+ foldr: v => v1 => v2 => {
102+ if (v2.tag === "Nothing") { return v1; }
103+ if (v2.tag === "Just") { return v(v2._1)(v1); }
104+ $runtime.fail();
105+ },
106+ foldl: v => v1 => v2 => {
107+ if (v2.tag === "Nothing") { return v1; }
108+ if (v2.tag === "Just") { return v(v1)(v2._1); }
109+ $runtime.fail();
110+ },
111+ foldMap: dictMonoid => v => v1 => {
112+ if (v1.tag === "Nothing") { return dictMonoid.mempty; }
113+ if (v1.tag === "Just") { return v(v1._1); }
114+ $runtime.fail();
115+ }
116+};
117+const foldableIdentity = {foldr: f => z => v => f(v)(z), foldl: f => z => v => f(z)(v), foldMap: dictMonoid => f => v => f(v)};
118+const foldableEither = {
119+ foldr: v => v1 => v2 => {
120+ if (v2.tag === "Left") { return v1; }
121+ if (v2.tag === "Right") { return v(v2._1)(v1); }
122+ $runtime.fail();
123+ },
124+ foldl: v => v1 => v2 => {
125+ if (v2.tag === "Left") { return v1; }
126+ if (v2.tag === "Right") { return v(v1)(v2._1); }
127+ $runtime.fail();
128+ },
129+ foldMap: dictMonoid => v => v1 => {
130+ if (v1.tag === "Left") { return dictMonoid.mempty; }
131+ if (v1.tag === "Right") { return v(v1._1); }
132+ $runtime.fail();
133+ }
134+};
135+const foldableDual = {foldr: f => z => v => f(v)(z), foldl: f => z => v => f(z)(v), foldMap: dictMonoid => f => v => f(v)};
136+const foldableDisj = {foldr: f => z => v => f(v)(z), foldl: f => z => v => f(z)(v), foldMap: dictMonoid => f => v => f(v)};
137+const foldableConst = {foldr: v => z => v1 => z, foldl: v => z => v1 => z, foldMap: dictMonoid => v => v1 => dictMonoid.mempty};
138+const foldableConj = {foldr: f => z => v => f(v)(z), foldl: f => z => v => f(z)(v), foldMap: dictMonoid => f => v => f(v)};
139+const foldableAdditive = {foldr: f => z => v => f(v)(z), foldl: f => z => v => f(z)(v), foldMap: dictMonoid => f => v => f(v)};
140+const foldMapDefaultR = dictFoldable => dictMonoid => {
141+ const append = dictMonoid.Semigroup0().append;
142+ return f => dictFoldable.foldr(x => acc => append(f(x))(acc))(dictMonoid.mempty);
143+};
144+const foldableArray = {
145+ foldr: foldrArray,
146+ foldl: foldlArray,
147+ foldMap: dictMonoid => {
148+ const append = dictMonoid.Semigroup0().append;
149+ return f => foldableArray.foldr(x => acc => append(f(x))(acc))(dictMonoid.mempty);
150+ }
151+};
152+const foldMapDefaultL = dictFoldable => dictMonoid => {
153+ const append = dictMonoid.Semigroup0().append;
154+ return f => dictFoldable.foldl(acc => x => append(acc)(f(x)))(dictMonoid.mempty);
155+};
156+const foldMap = dict => dict.foldMap;
157+const foldableApp = dictFoldable => (
158+ {foldr: f => i => v => dictFoldable.foldr(f)(i)(v), foldl: f => i => v => dictFoldable.foldl(f)(i)(v), foldMap: dictMonoid => dictFoldable.foldMap(dictMonoid)}
159+);
160+const foldableCompose = dictFoldable => dictFoldable1 => (
161+ {
162+ foldr: f => i => v => dictFoldable.foldr((() => {
163+ const $5 = dictFoldable1.foldr(f);
164+ return b => a => $5(a)(b);
165+ })())(i)(v),
166+ foldl: f => i => v => dictFoldable.foldl(dictFoldable1.foldl(f))(i)(v),
167+ foldMap: dictMonoid => {
168+ const foldMap4 = dictFoldable.foldMap(dictMonoid);
169+ const foldMap5 = dictFoldable1.foldMap(dictMonoid);
170+ return f => v => foldMap4(foldMap5(f))(v);
171+ }
172+ }
173+);
174+const foldableCoproduct = dictFoldable => dictFoldable1 => (
175+ {
176+ foldr: f => z => {
177+ const $4 = dictFoldable.foldr(f)(z);
178+ const $5 = dictFoldable1.foldr(f)(z);
179+ return v2 => {
180+ if (v2.tag === "Left") { return $4(v2._1); }
181+ if (v2.tag === "Right") { return $5(v2._1); }
182+ $runtime.fail();
183+ };
184+ },
185+ foldl: f => z => {
186+ const $4 = dictFoldable.foldl(f)(z);
187+ const $5 = dictFoldable1.foldl(f)(z);
188+ return v2 => {
189+ if (v2.tag === "Left") { return $4(v2._1); }
190+ if (v2.tag === "Right") { return $5(v2._1); }
191+ $runtime.fail();
192+ };
193+ },
194+ foldMap: dictMonoid => {
195+ const foldMap4 = dictFoldable.foldMap(dictMonoid);
196+ const foldMap5 = dictFoldable1.foldMap(dictMonoid);
197+ return f => {
198+ const $6 = foldMap4(f);
199+ const $7 = foldMap5(f);
200+ return v2 => {
201+ if (v2.tag === "Left") { return $6(v2._1); }
202+ if (v2.tag === "Right") { return $7(v2._1); }
203+ $runtime.fail();
204+ };
205+ };
206+ }
207+ }
208+);
209+const foldableFirst = {
210+ foldr: f => z => v => {
211+ if (v.tag === "Nothing") { return z; }
212+ if (v.tag === "Just") { return f(v._1)(z); }
213+ $runtime.fail();
214+ },
215+ foldl: f => z => v => {
216+ if (v.tag === "Nothing") { return z; }
217+ if (v.tag === "Just") { return f(z)(v._1); }
218+ $runtime.fail();
219+ },
220+ foldMap: dictMonoid => f => v => {
221+ if (v.tag === "Nothing") { return dictMonoid.mempty; }
222+ if (v.tag === "Just") { return f(v._1); }
223+ $runtime.fail();
224+ }
225+};
226+const foldableLast = {
227+ foldr: f => z => v => {
228+ if (v.tag === "Nothing") { return z; }
229+ if (v.tag === "Just") { return f(v._1)(z); }
230+ $runtime.fail();
231+ },
232+ foldl: f => z => v => {
233+ if (v.tag === "Nothing") { return z; }
234+ if (v.tag === "Just") { return f(z)(v._1); }
235+ $runtime.fail();
236+ },
237+ foldMap: dictMonoid => f => v => {
238+ if (v.tag === "Nothing") { return dictMonoid.mempty; }
239+ if (v.tag === "Just") { return f(v._1); }
240+ $runtime.fail();
241+ }
242+};
243+const foldableProduct = dictFoldable => dictFoldable1 => (
244+ {
245+ foldr: f => z => v => dictFoldable.foldr(f)(dictFoldable1.foldr(f)(z)(v._2))(v._1),
246+ foldl: f => z => v => dictFoldable1.foldl(f)(dictFoldable.foldl(f)(z)(v._1))(v._2),
247+ foldMap: dictMonoid => {
248+ const append = dictMonoid.Semigroup0().append;
249+ const foldMap4 = dictFoldable.foldMap(dictMonoid);
250+ const foldMap5 = dictFoldable1.foldMap(dictMonoid);
251+ return f => v => append(foldMap4(f)(v._1))(foldMap5(f)(v._2));
252+ }
253+ }
254+);
255+const foldlDefault = dictFoldable => {
256+ const foldMap2 = dictFoldable.foldMap(monoidDual);
257+ return c => u => xs => foldMap2(x => a => c(a)(x))(xs)(u);
258+};
259+const foldrDefault = dictFoldable => {
260+ const foldMap2 = dictFoldable.foldMap(monoidEndo);
261+ return c => u => xs => foldMap2(x => c(x))(xs)(u);
262+};
263+const lookup = dictFoldable => {
264+ const foldMap2 = dictFoldable.foldMap(Data$dMaybe$dFirst.monoidFirst);
265+ return dictEq => a => foldMap2(v => {
266+ if (dictEq.eq(a)(v._1)) { return Data$dMaybe.$Maybe("Just", v._2); }
267+ return Data$dMaybe.Nothing;
268+ });
269+};
270+const surroundMap = dictFoldable => {
271+ const foldMap2 = dictFoldable.foldMap(monoidEndo);
272+ return dictSemigroup => d => t => f => foldMap2(a => m => dictSemigroup.append(d)(dictSemigroup.append(t(a))(m)))(f)(d);
273+};
274+const surround = dictFoldable => {
275+ const surroundMap1 = surroundMap(dictFoldable);
276+ return dictSemigroup => {
277+ const surroundMap2 = surroundMap1(dictSemigroup);
278+ return d => surroundMap2(d)(identity);
279+ };
280+};
281+const foldM = dictFoldable => dictMonad => {
282+ const bind = dictMonad.Bind1().bind;
283+ const pure = dictMonad.Applicative0().pure;
284+ return f => b0 => dictFoldable.foldl(b => a => bind(b)(a$1 => f(a$1)(a)))(pure(b0));
285+};
286+const fold = dictFoldable => dictMonoid => dictFoldable.foldMap(dictMonoid)(identity);
287+const findMap = dictFoldable => p => dictFoldable.foldl(v => v1 => {
288+ if (v.tag === "Nothing") { return p(v1); }
289+ return v;
290+})(Data$dMaybe.Nothing);
291+const find = dictFoldable => p => dictFoldable.foldl(v => v1 => {
292+ if (v.tag === "Nothing") {
293+ if (p(v1)) { return Data$dMaybe.$Maybe("Just", v1); }
294+ return v;
295+ }
296+ return v;
297+})(Data$dMaybe.Nothing);
298+const any = dictFoldable => dictHeytingAlgebra => dictFoldable.foldMap((() => {
299+ const semigroupDisj1 = {append: v => v1 => dictHeytingAlgebra.disj(v)(v1)};
300+ return {mempty: dictHeytingAlgebra.ff, Semigroup0: () => semigroupDisj1};
301+})());
302+const elem = dictFoldable => {
303+ const any1 = dictFoldable.foldMap((() => {
304+ const semigroupDisj1 = {append: v => v1 => v || v1};
305+ return {mempty: false, Semigroup0: () => semigroupDisj1};
306+ })());
307+ return dictEq => x => any1(dictEq.eq(x));
308+};
309+const notElem = dictFoldable => {
310+ const any1 = dictFoldable.foldMap((() => {
311+ const semigroupDisj1 = {append: v => v1 => v || v1};
312+ return {mempty: false, Semigroup0: () => semigroupDisj1};
313+ })());
314+ return dictEq => x => {
315+ const $4 = any1(dictEq.eq(x));
316+ return x$1 => !$4(x$1);
317+ };
318+};
319+const or = dictFoldable => dictHeytingAlgebra => dictFoldable.foldMap((() => {
320+ const semigroupDisj1 = {append: v => v1 => dictHeytingAlgebra.disj(v)(v1)};
321+ return {mempty: dictHeytingAlgebra.ff, Semigroup0: () => semigroupDisj1};
322+})())(identity);
323+const all = dictFoldable => dictHeytingAlgebra => dictFoldable.foldMap((() => {
324+ const semigroupConj1 = {append: v => v1 => dictHeytingAlgebra.conj(v)(v1)};
325+ return {mempty: dictHeytingAlgebra.tt, Semigroup0: () => semigroupConj1};
326+})());
327+const and = dictFoldable => dictHeytingAlgebra => dictFoldable.foldMap((() => {
328+ const semigroupConj1 = {append: v => v1 => dictHeytingAlgebra.conj(v)(v1)};
329+ return {mempty: dictHeytingAlgebra.tt, Semigroup0: () => semigroupConj1};
330+})())(identity);
331+export {
332+ all,
333+ and,
334+ any,
335+ elem,
336+ find,
337+ findMap,
338+ fold,
339+ foldM,
340+ foldMap,
341+ foldMapDefaultL,
342+ foldMapDefaultR,
343+ foldableAdditive,
344+ foldableApp,
345+ foldableArray,
346+ foldableCompose,
347+ foldableConj,
348+ foldableConst,
349+ foldableCoproduct,
350+ foldableDisj,
351+ foldableDual,
352+ foldableEither,
353+ foldableFirst,
354+ foldableIdentity,
355+ foldableLast,
356+ foldableMaybe,
357+ foldableMultiplicative,
358+ foldableProduct,
359+ foldableTuple,
360+ foldl,
361+ foldlDefault,
362+ foldr,
363+ foldrDefault,
364+ for_,
365+ identity,
366+ indexl,
367+ indexr,
368+ intercalate,
369+ length,
370+ lookup,
371+ maximum,
372+ maximumBy,
373+ minimum,
374+ minimumBy,
375+ monoidDual,
376+ monoidEndo,
377+ notElem,
378+ $$null as null,
379+ oneOf,
380+ oneOfMap,
381+ or,
382+ product,
383+ sequence_,
384+ sum,
385+ surround,
386+ surroundMap,
387+ traverse_
388+};
389+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.FoldableWithIndex/index.jsnew file+422
@@ -0,0 +1,422 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dApply from "../Control.Apply/index.js";
3+import * as Data$dEither from "../Data.Either/index.js";
4+import * as Data$dFoldable from "../Data.Foldable/index.js";
5+import * as Data$dFunctorWithIndex from "../Data.FunctorWithIndex/index.js";
6+import * as Data$dMaybe from "../Data.Maybe/index.js";
7+import * as Data$dTuple from "../Data.Tuple/index.js";
8+import * as Data$dUnit from "../Data.Unit/index.js";
9+const monoidEndo = /* #__PURE__ */ (() => {
10+ const semigroupEndo1 = {append: v => v1 => x => v(v1(x))};
11+ return {mempty: x => x, Semigroup0: () => semigroupEndo1};
12+})();
13+const monoidDual = /* #__PURE__ */ (() => {
14+ const $0 = monoidEndo.Semigroup0();
15+ const semigroupDual1 = {append: v => v1 => $0.append(v1)(v)};
16+ return {mempty: monoidEndo.mempty, Semigroup0: () => semigroupDual1};
17+})();
18+const foldrWithIndex = dict => dict.foldrWithIndex;
19+const traverseWithIndex_ = dictApplicative => {
20+ const $1 = dictApplicative.Apply0();
21+ const map = $1.Functor0().map;
22+ return dictFoldableWithIndex => f => dictFoldableWithIndex.foldrWithIndex(i => {
23+ const $6 = f(i);
24+ return x => {
25+ const $8 = $6(x);
26+ return b => $1.apply(map(v => Control$dApply.identity)($8))(b);
27+ };
28+ })(dictApplicative.pure(Data$dUnit.unit));
29+};
30+const forWithIndex_ = dictApplicative => {
31+ const traverseWithIndex_1 = traverseWithIndex_(dictApplicative);
32+ return dictFoldableWithIndex => {
33+ const $3 = traverseWithIndex_1(dictFoldableWithIndex);
34+ return b => a => $3(a)(b);
35+ };
36+};
37+const foldrDefault = dictFoldableWithIndex => f => dictFoldableWithIndex.foldrWithIndex(v => f);
38+const foldlWithIndex = dict => dict.foldlWithIndex;
39+const foldlDefault = dictFoldableWithIndex => f => dictFoldableWithIndex.foldlWithIndex(v => f);
40+const foldableWithIndexTuple = {
41+ foldrWithIndex: f => z => v => f(Data$dUnit.unit)(v._2)(z),
42+ foldlWithIndex: f => z => v => f(Data$dUnit.unit)(z)(v._2),
43+ foldMapWithIndex: dictMonoid => f => v => f(Data$dUnit.unit)(v._2),
44+ Foldable0: () => Data$dFoldable.foldableTuple
45+};
46+const foldableWithIndexMultiplicative = {
47+ foldrWithIndex: f => {
48+ const $1 = f(Data$dUnit.unit);
49+ return z => v => $1(v)(z);
50+ },
51+ foldlWithIndex: f => f(Data$dUnit.unit),
52+ foldMapWithIndex: dictMonoid => f => f(Data$dUnit.unit),
53+ Foldable0: () => Data$dFoldable.foldableMultiplicative
54+};
55+const foldableWithIndexMaybe = {
56+ foldrWithIndex: f => {
57+ const $1 = f(Data$dUnit.unit);
58+ return v1 => v2 => {
59+ if (v2.tag === "Nothing") { return v1; }
60+ if (v2.tag === "Just") { return $1(v2._1)(v1); }
61+ $runtime.fail();
62+ };
63+ },
64+ foldlWithIndex: f => {
65+ const $1 = f(Data$dUnit.unit);
66+ return v1 => v2 => {
67+ if (v2.tag === "Nothing") { return v1; }
68+ if (v2.tag === "Just") { return $1(v1)(v2._1); }
69+ $runtime.fail();
70+ };
71+ },
72+ foldMapWithIndex: dictMonoid => f => {
73+ const $2 = f(Data$dUnit.unit);
74+ return v1 => {
75+ if (v1.tag === "Nothing") { return dictMonoid.mempty; }
76+ if (v1.tag === "Just") { return $2(v1._1); }
77+ $runtime.fail();
78+ };
79+ },
80+ Foldable0: () => Data$dFoldable.foldableMaybe
81+};
82+const foldableWithIndexLast = {
83+ foldrWithIndex: f => {
84+ const $1 = f(Data$dUnit.unit);
85+ return z => v => {
86+ if (v.tag === "Nothing") { return z; }
87+ if (v.tag === "Just") { return $1(v._1)(z); }
88+ $runtime.fail();
89+ };
90+ },
91+ foldlWithIndex: f => {
92+ const $1 = f(Data$dUnit.unit);
93+ return z => v => {
94+ if (v.tag === "Nothing") { return z; }
95+ if (v.tag === "Just") { return $1(z)(v._1); }
96+ $runtime.fail();
97+ };
98+ },
99+ foldMapWithIndex: dictMonoid => f => {
100+ const $2 = f(Data$dUnit.unit);
101+ return v => {
102+ if (v.tag === "Nothing") { return dictMonoid.mempty; }
103+ if (v.tag === "Just") { return $2(v._1); }
104+ $runtime.fail();
105+ };
106+ },
107+ Foldable0: () => Data$dFoldable.foldableLast
108+};
109+const foldableWithIndexIdentity = {
110+ foldrWithIndex: f => z => v => f(Data$dUnit.unit)(v)(z),
111+ foldlWithIndex: f => z => v => f(Data$dUnit.unit)(z)(v),
112+ foldMapWithIndex: dictMonoid => f => v => f(Data$dUnit.unit)(v),
113+ Foldable0: () => Data$dFoldable.foldableIdentity
114+};
115+const foldableWithIndexFirst = {
116+ foldrWithIndex: f => {
117+ const $1 = f(Data$dUnit.unit);
118+ return z => v => {
119+ if (v.tag === "Nothing") { return z; }
120+ if (v.tag === "Just") { return $1(v._1)(z); }
121+ $runtime.fail();
122+ };
123+ },
124+ foldlWithIndex: f => {
125+ const $1 = f(Data$dUnit.unit);
126+ return z => v => {
127+ if (v.tag === "Nothing") { return z; }
128+ if (v.tag === "Just") { return $1(z)(v._1); }
129+ $runtime.fail();
130+ };
131+ },
132+ foldMapWithIndex: dictMonoid => f => {
133+ const $2 = f(Data$dUnit.unit);
134+ return v => {
135+ if (v.tag === "Nothing") { return dictMonoid.mempty; }
136+ if (v.tag === "Just") { return $2(v._1); }
137+ $runtime.fail();
138+ };
139+ },
140+ Foldable0: () => Data$dFoldable.foldableFirst
141+};
142+const foldableWithIndexEither = {
143+ foldrWithIndex: v => v1 => v2 => {
144+ if (v2.tag === "Left") { return v1; }
145+ if (v2.tag === "Right") { return v(Data$dUnit.unit)(v2._1)(v1); }
146+ $runtime.fail();
147+ },
148+ foldlWithIndex: v => v1 => v2 => {
149+ if (v2.tag === "Left") { return v1; }
150+ if (v2.tag === "Right") { return v(Data$dUnit.unit)(v1)(v2._1); }
151+ $runtime.fail();
152+ },
153+ foldMapWithIndex: dictMonoid => v => v1 => {
154+ if (v1.tag === "Left") { return dictMonoid.mempty; }
155+ if (v1.tag === "Right") { return v(Data$dUnit.unit)(v1._1); }
156+ $runtime.fail();
157+ },
158+ Foldable0: () => Data$dFoldable.foldableEither
159+};
160+const foldableWithIndexDual = {
161+ foldrWithIndex: f => {
162+ const $1 = f(Data$dUnit.unit);
163+ return z => v => $1(v)(z);
164+ },
165+ foldlWithIndex: f => f(Data$dUnit.unit),
166+ foldMapWithIndex: dictMonoid => f => f(Data$dUnit.unit),
167+ Foldable0: () => Data$dFoldable.foldableDual
168+};
169+const foldableWithIndexDisj = {
170+ foldrWithIndex: f => {
171+ const $1 = f(Data$dUnit.unit);
172+ return z => v => $1(v)(z);
173+ },
174+ foldlWithIndex: f => f(Data$dUnit.unit),
175+ foldMapWithIndex: dictMonoid => f => f(Data$dUnit.unit),
176+ Foldable0: () => Data$dFoldable.foldableDisj
177+};
178+const foldableWithIndexConst = {
179+ foldrWithIndex: v => z => v1 => z,
180+ foldlWithIndex: v => z => v1 => z,
181+ foldMapWithIndex: dictMonoid => v => v1 => dictMonoid.mempty,
182+ Foldable0: () => Data$dFoldable.foldableConst
183+};
184+const foldableWithIndexConj = {
185+ foldrWithIndex: f => {
186+ const $1 = f(Data$dUnit.unit);
187+ return z => v => $1(v)(z);
188+ },
189+ foldlWithIndex: f => f(Data$dUnit.unit),
190+ foldMapWithIndex: dictMonoid => f => f(Data$dUnit.unit),
191+ Foldable0: () => Data$dFoldable.foldableConj
192+};
193+const foldableWithIndexAdditive = {
194+ foldrWithIndex: f => {
195+ const $1 = f(Data$dUnit.unit);
196+ return z => v => $1(v)(z);
197+ },
198+ foldlWithIndex: f => f(Data$dUnit.unit),
199+ foldMapWithIndex: dictMonoid => f => f(Data$dUnit.unit),
200+ Foldable0: () => Data$dFoldable.foldableAdditive
201+};
202+const foldWithIndexM = dictFoldableWithIndex => dictMonad => {
203+ const bind = dictMonad.Bind1().bind;
204+ const pure = dictMonad.Applicative0().pure;
205+ return f => a0 => dictFoldableWithIndex.foldlWithIndex(i => ma => b => bind(ma)((() => {
206+ const $9 = f(i);
207+ return a => $9(a)(b);
208+ })()))(pure(a0));
209+};
210+const foldMapWithIndexDefaultR = dictFoldableWithIndex => dictMonoid => {
211+ const append = dictMonoid.Semigroup0().append;
212+ return f => dictFoldableWithIndex.foldrWithIndex(i => x => acc => append(f(i)(x))(acc))(dictMonoid.mempty);
213+};
214+const foldableWithIndexArray = {
215+ foldrWithIndex: f => z => {
216+ const $2 = Data$dFoldable.foldrArray(v => y => f(v._1)(v._2)(y))(z);
217+ const $3 = Data$dFunctorWithIndex.mapWithIndexArray(Data$dTuple.Tuple);
218+ return x => $2($3(x));
219+ },
220+ foldlWithIndex: f => z => {
221+ const $2 = Data$dFoldable.foldlArray(y => v => f(v._1)(y)(v._2))(z);
222+ const $3 = Data$dFunctorWithIndex.mapWithIndexArray(Data$dTuple.Tuple);
223+ return x => $2($3(x));
224+ },
225+ foldMapWithIndex: dictMonoid => {
226+ const append = dictMonoid.Semigroup0().append;
227+ return f => foldableWithIndexArray.foldrWithIndex(i => x => acc => append(f(i)(x))(acc))(dictMonoid.mempty);
228+ },
229+ Foldable0: () => Data$dFoldable.foldableArray
230+};
231+const foldMapWithIndexDefaultL = dictFoldableWithIndex => dictMonoid => {
232+ const append = dictMonoid.Semigroup0().append;
233+ return f => dictFoldableWithIndex.foldlWithIndex(i => acc => x => append(acc)(f(i)(x)))(dictMonoid.mempty);
234+};
235+const foldMapWithIndex = dict => dict.foldMapWithIndex;
236+const foldableWithIndexApp = dictFoldableWithIndex => {
237+ const $1 = dictFoldableWithIndex.Foldable0();
238+ const foldableApp = {foldr: f => i => v => $1.foldr(f)(i)(v), foldl: f => i => v => $1.foldl(f)(i)(v), foldMap: dictMonoid => $1.foldMap(dictMonoid)};
239+ return {
240+ foldrWithIndex: f => z => v => dictFoldableWithIndex.foldrWithIndex(f)(z)(v),
241+ foldlWithIndex: f => z => v => dictFoldableWithIndex.foldlWithIndex(f)(z)(v),
242+ foldMapWithIndex: dictMonoid => dictFoldableWithIndex.foldMapWithIndex(dictMonoid),
243+ Foldable0: () => foldableApp
244+ };
245+};
246+const foldableWithIndexCompose = dictFoldableWithIndex => {
247+ const $1 = dictFoldableWithIndex.Foldable0();
248+ return dictFoldableWithIndex1 => {
249+ const $3 = dictFoldableWithIndex1.Foldable0();
250+ const foldableCompose1 = {
251+ foldr: f => i => v => $1.foldr((() => {
252+ const $7 = $3.foldr(f);
253+ return b => a => $7(a)(b);
254+ })())(i)(v),
255+ foldl: f => i => v => $1.foldl($3.foldl(f))(i)(v),
256+ foldMap: dictMonoid => {
257+ const foldMap4 = $1.foldMap(dictMonoid);
258+ const foldMap5 = $3.foldMap(dictMonoid);
259+ return f => v => foldMap4(foldMap5(f))(v);
260+ }
261+ };
262+ return {
263+ foldrWithIndex: f => i => v => dictFoldableWithIndex.foldrWithIndex(a => {
264+ const $9 = dictFoldableWithIndex1.foldrWithIndex(Data$dTuple.curry(f)(a));
265+ return b => a$1 => $9(a$1)(b);
266+ })(i)(v),
267+ foldlWithIndex: f => i => v => dictFoldableWithIndex.foldlWithIndex(x => dictFoldableWithIndex1.foldlWithIndex(Data$dTuple.curry(f)(x)))(i)(v),
268+ foldMapWithIndex: dictMonoid => {
269+ const foldMapWithIndex3 = dictFoldableWithIndex.foldMapWithIndex(dictMonoid);
270+ const foldMapWithIndex4 = dictFoldableWithIndex1.foldMapWithIndex(dictMonoid);
271+ return f => v => foldMapWithIndex3(x => foldMapWithIndex4(Data$dTuple.curry(f)(x)))(v);
272+ },
273+ Foldable0: () => foldableCompose1
274+ };
275+ };
276+};
277+const foldableWithIndexCoproduct = dictFoldableWithIndex => {
278+ const foldableCoproduct = Data$dFoldable.foldableCoproduct(dictFoldableWithIndex.Foldable0());
279+ return dictFoldableWithIndex1 => {
280+ const foldableCoproduct1 = foldableCoproduct(dictFoldableWithIndex1.Foldable0());
281+ return {
282+ foldrWithIndex: f => z => {
283+ const $6 = dictFoldableWithIndex.foldrWithIndex(x => f(Data$dEither.$Either("Left", x)))(z);
284+ const $7 = dictFoldableWithIndex1.foldrWithIndex(x => f(Data$dEither.$Either("Right", x)))(z);
285+ return v2 => {
286+ if (v2.tag === "Left") { return $6(v2._1); }
287+ if (v2.tag === "Right") { return $7(v2._1); }
288+ $runtime.fail();
289+ };
290+ },
291+ foldlWithIndex: f => z => {
292+ const $6 = dictFoldableWithIndex.foldlWithIndex(x => f(Data$dEither.$Either("Left", x)))(z);
293+ const $7 = dictFoldableWithIndex1.foldlWithIndex(x => f(Data$dEither.$Either("Right", x)))(z);
294+ return v2 => {
295+ if (v2.tag === "Left") { return $6(v2._1); }
296+ if (v2.tag === "Right") { return $7(v2._1); }
297+ $runtime.fail();
298+ };
299+ },
300+ foldMapWithIndex: dictMonoid => {
301+ const foldMapWithIndex3 = dictFoldableWithIndex.foldMapWithIndex(dictMonoid);
302+ const foldMapWithIndex4 = dictFoldableWithIndex1.foldMapWithIndex(dictMonoid);
303+ return f => {
304+ const $8 = foldMapWithIndex3(x => f(Data$dEither.$Either("Left", x)));
305+ const $9 = foldMapWithIndex4(x => f(Data$dEither.$Either("Right", x)));
306+ return v2 => {
307+ if (v2.tag === "Left") { return $8(v2._1); }
308+ if (v2.tag === "Right") { return $9(v2._1); }
309+ $runtime.fail();
310+ };
311+ };
312+ },
313+ Foldable0: () => foldableCoproduct1
314+ };
315+ };
316+};
317+const foldableWithIndexProduct = dictFoldableWithIndex => {
318+ const foldableProduct = Data$dFoldable.foldableProduct(dictFoldableWithIndex.Foldable0());
319+ return dictFoldableWithIndex1 => {
320+ const foldableProduct1 = foldableProduct(dictFoldableWithIndex1.Foldable0());
321+ return {
322+ foldrWithIndex: f => z => v => dictFoldableWithIndex.foldrWithIndex(x => f(Data$dEither.$Either("Left", x)))(dictFoldableWithIndex1.foldrWithIndex(x => f(Data$dEither.$Either(
323+ "Right",
324+ x
325+ )))(z)(v._2))(v._1),
326+ foldlWithIndex: f => z => v => dictFoldableWithIndex1.foldlWithIndex(x => f(Data$dEither.$Either("Right", x)))(dictFoldableWithIndex.foldlWithIndex(x => f(Data$dEither.$Either(
327+ "Left",
328+ x
329+ )))(z)(v._1))(v._2),
330+ foldMapWithIndex: dictMonoid => {
331+ const append = dictMonoid.Semigroup0().append;
332+ const foldMapWithIndex3 = dictFoldableWithIndex.foldMapWithIndex(dictMonoid);
333+ const foldMapWithIndex4 = dictFoldableWithIndex1.foldMapWithIndex(dictMonoid);
334+ return f => v => append(foldMapWithIndex3(x => f(Data$dEither.$Either("Left", x)))(v._1))(foldMapWithIndex4(x => f(Data$dEither.$Either("Right", x)))(v._2));
335+ },
336+ Foldable0: () => foldableProduct1
337+ };
338+ };
339+};
340+const foldlWithIndexDefault = dictFoldableWithIndex => {
341+ const foldMapWithIndex1 = dictFoldableWithIndex.foldMapWithIndex(monoidDual);
342+ return c => u => xs => foldMapWithIndex1(i => {
343+ const $6 = c(i);
344+ return x => a => $6(a)(x);
345+ })(xs)(u);
346+};
347+const foldrWithIndexDefault = dictFoldableWithIndex => {
348+ const foldMapWithIndex1 = dictFoldableWithIndex.foldMapWithIndex(monoidEndo);
349+ return c => u => xs => foldMapWithIndex1(i => c(i))(xs)(u);
350+};
351+const surroundMapWithIndex = dictFoldableWithIndex => {
352+ const foldMapWithIndex1 = dictFoldableWithIndex.foldMapWithIndex(monoidEndo);
353+ return dictSemigroup => d => t => f => foldMapWithIndex1(i => a => m => dictSemigroup.append(d)(dictSemigroup.append(t(i)(a))(m)))(f)(d);
354+};
355+const foldMapDefault = dictFoldableWithIndex => dictMonoid => {
356+ const foldMapWithIndex2 = dictFoldableWithIndex.foldMapWithIndex(dictMonoid);
357+ return f => foldMapWithIndex2(v => f);
358+};
359+const findWithIndex = dictFoldableWithIndex => p => dictFoldableWithIndex.foldlWithIndex(v => v1 => v2 => {
360+ if (v1.tag === "Nothing") {
361+ if (p(v)(v2)) { return Data$dMaybe.$Maybe("Just", {index: v, value: v2}); }
362+ return v1;
363+ }
364+ return v1;
365+})(Data$dMaybe.Nothing);
366+const findMapWithIndex = dictFoldableWithIndex => f => dictFoldableWithIndex.foldlWithIndex(v => v1 => v2 => {
367+ if (v1.tag === "Nothing") { return f(v)(v2); }
368+ return v1;
369+})(Data$dMaybe.Nothing);
370+const anyWithIndex = dictFoldableWithIndex => dictHeytingAlgebra => {
371+ const foldMapWithIndex2 = dictFoldableWithIndex.foldMapWithIndex((() => {
372+ const semigroupDisj1 = {append: v => v1 => dictHeytingAlgebra.disj(v)(v1)};
373+ return {mempty: dictHeytingAlgebra.ff, Semigroup0: () => semigroupDisj1};
374+ })());
375+ return t => foldMapWithIndex2(i => t(i));
376+};
377+const allWithIndex = dictFoldableWithIndex => dictHeytingAlgebra => {
378+ const foldMapWithIndex2 = dictFoldableWithIndex.foldMapWithIndex((() => {
379+ const semigroupConj1 = {append: v => v1 => dictHeytingAlgebra.conj(v)(v1)};
380+ return {mempty: dictHeytingAlgebra.tt, Semigroup0: () => semigroupConj1};
381+ })());
382+ return t => foldMapWithIndex2(i => t(i));
383+};
384+export {
385+ allWithIndex,
386+ anyWithIndex,
387+ findMapWithIndex,
388+ findWithIndex,
389+ foldMapDefault,
390+ foldMapWithIndex,
391+ foldMapWithIndexDefaultL,
392+ foldMapWithIndexDefaultR,
393+ foldWithIndexM,
394+ foldableWithIndexAdditive,
395+ foldableWithIndexApp,
396+ foldableWithIndexArray,
397+ foldableWithIndexCompose,
398+ foldableWithIndexConj,
399+ foldableWithIndexConst,
400+ foldableWithIndexCoproduct,
401+ foldableWithIndexDisj,
402+ foldableWithIndexDual,
403+ foldableWithIndexEither,
404+ foldableWithIndexFirst,
405+ foldableWithIndexIdentity,
406+ foldableWithIndexLast,
407+ foldableWithIndexMaybe,
408+ foldableWithIndexMultiplicative,
409+ foldableWithIndexProduct,
410+ foldableWithIndexTuple,
411+ foldlDefault,
412+ foldlWithIndex,
413+ foldlWithIndexDefault,
414+ foldrDefault,
415+ foldrWithIndex,
416+ foldrWithIndexDefault,
417+ forWithIndex_,
418+ monoidDual,
419+ monoidEndo,
420+ surroundMapWithIndex,
421+ traverseWithIndex_
422+};
.storybook/purescript-indexer/output-es/Data.Function.Uncurried/foreign.jsnew file+218
@@ -0,0 +1,218 @@
1+// module Data.Function.Uncurried
2+
3+export const mkFn0 = function (fn) {
4+ return function () {
5+ return fn();
6+ };
7+};
8+
9+export const mkFn2 = function (fn) {
10+ /* jshint maxparams: 2 */
11+ return function (a, b) {
12+ return fn(a)(b);
13+ };
14+};
15+
16+export const mkFn3 = function (fn) {
17+ /* jshint maxparams: 3 */
18+ return function (a, b, c) {
19+ return fn(a)(b)(c);
20+ };
21+};
22+
23+export const mkFn4 = function (fn) {
24+ /* jshint maxparams: 4 */
25+ return function (a, b, c, d) {
26+ return fn(a)(b)(c)(d);
27+ };
28+};
29+
30+export const mkFn5 = function (fn) {
31+ /* jshint maxparams: 5 */
32+ return function (a, b, c, d, e) {
33+ return fn(a)(b)(c)(d)(e);
34+ };
35+};
36+
37+export const mkFn6 = function (fn) {
38+ /* jshint maxparams: 6 */
39+ return function (a, b, c, d, e, f) {
40+ return fn(a)(b)(c)(d)(e)(f);
41+ };
42+};
43+
44+export const mkFn7 = function (fn) {
45+ /* jshint maxparams: 7 */
46+ return function (a, b, c, d, e, f, g) {
47+ return fn(a)(b)(c)(d)(e)(f)(g);
48+ };
49+};
50+
51+export const mkFn8 = function (fn) {
52+ /* jshint maxparams: 8 */
53+ return function (a, b, c, d, e, f, g, h) {
54+ return fn(a)(b)(c)(d)(e)(f)(g)(h);
55+ };
56+};
57+
58+export const mkFn9 = function (fn) {
59+ /* jshint maxparams: 9 */
60+ return function (a, b, c, d, e, f, g, h, i) {
61+ return fn(a)(b)(c)(d)(e)(f)(g)(h)(i);
62+ };
63+};
64+
65+export const mkFn10 = function (fn) {
66+ /* jshint maxparams: 10 */
67+ return function (a, b, c, d, e, f, g, h, i, j) {
68+ return fn(a)(b)(c)(d)(e)(f)(g)(h)(i)(j);
69+ };
70+};
71+
72+export const runFn0 = function (fn) {
73+ return fn();
74+};
75+
76+export const runFn2 = function (fn) {
77+ return function (a) {
78+ return function (b) {
79+ return fn(a, b);
80+ };
81+ };
82+};
83+
84+export const runFn3 = function (fn) {
85+ return function (a) {
86+ return function (b) {
87+ return function (c) {
88+ return fn(a, b, c);
89+ };
90+ };
91+ };
92+};
93+
94+export const runFn4 = function (fn) {
95+ return function (a) {
96+ return function (b) {
97+ return function (c) {
98+ return function (d) {
99+ return fn(a, b, c, d);
100+ };
101+ };
102+ };
103+ };
104+};
105+
106+export const runFn5 = function (fn) {
107+ return function (a) {
108+ return function (b) {
109+ return function (c) {
110+ return function (d) {
111+ return function (e) {
112+ return fn(a, b, c, d, e);
113+ };
114+ };
115+ };
116+ };
117+ };
118+};
119+
120+export const runFn6 = function (fn) {
121+ return function (a) {
122+ return function (b) {
123+ return function (c) {
124+ return function (d) {
125+ return function (e) {
126+ return function (f) {
127+ return fn(a, b, c, d, e, f);
128+ };
129+ };
130+ };
131+ };
132+ };
133+ };
134+};
135+
136+export const runFn7 = function (fn) {
137+ return function (a) {
138+ return function (b) {
139+ return function (c) {
140+ return function (d) {
141+ return function (e) {
142+ return function (f) {
143+ return function (g) {
144+ return fn(a, b, c, d, e, f, g);
145+ };
146+ };
147+ };
148+ };
149+ };
150+ };
151+ };
152+};
153+
154+export const runFn8 = function (fn) {
155+ return function (a) {
156+ return function (b) {
157+ return function (c) {
158+ return function (d) {
159+ return function (e) {
160+ return function (f) {
161+ return function (g) {
162+ return function (h) {
163+ return fn(a, b, c, d, e, f, g, h);
164+ };
165+ };
166+ };
167+ };
168+ };
169+ };
170+ };
171+ };
172+};
173+
174+export const runFn9 = function (fn) {
175+ return function (a) {
176+ return function (b) {
177+ return function (c) {
178+ return function (d) {
179+ return function (e) {
180+ return function (f) {
181+ return function (g) {
182+ return function (h) {
183+ return function (i) {
184+ return fn(a, b, c, d, e, f, g, h, i);
185+ };
186+ };
187+ };
188+ };
189+ };
190+ };
191+ };
192+ };
193+ };
194+};
195+
196+export const runFn10 = function (fn) {
197+ return function (a) {
198+ return function (b) {
199+ return function (c) {
200+ return function (d) {
201+ return function (e) {
202+ return function (f) {
203+ return function (g) {
204+ return function (h) {
205+ return function (i) {
206+ return function (j) {
207+ return fn(a, b, c, d, e, f, g, h, i, j);
208+ };
209+ };
210+ };
211+ };
212+ };
213+ };
214+ };
215+ };
216+ };
217+ };
218+};
.storybook/purescript-indexer/output-es/Data.Function.Uncurried/index.jsnew file+6
@@ -0,0 +1,6 @@
1+import * as $runtime from "../runtime.js";
2+import {mkFn0, mkFn10, mkFn2, mkFn3, mkFn4, mkFn5, mkFn6, mkFn7, mkFn8, mkFn9, runFn0, runFn10, runFn2, runFn3, runFn4, runFn5, runFn6, runFn7, runFn8, runFn9} from "./foreign.js";
3+const runFn1 = f => f;
4+const mkFn1 = f => f;
5+export {mkFn1, runFn1};
6+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Function/index.jsnew file+25
@@ -0,0 +1,25 @@
1+import * as $runtime from "../runtime.js";
2+const on = f => g => x => y => f(g(x))(g(y));
3+const flip = f => b => a => f(a)(b);
4+const $$const = a => v => a;
5+const applyN = f => {
6+ const go = go$a0$copy => go$a1$copy => {
7+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
8+ while (go$c) {
9+ const n = go$a0, acc = go$a1;
10+ if (n <= 0) {
11+ go$c = false;
12+ go$r = acc;
13+ continue;
14+ }
15+ go$a0 = n - 1 | 0;
16+ go$a1 = f(acc);
17+ continue;
18+ };
19+ return go$r;
20+ };
21+ return go;
22+};
23+const applyFlipped = x => f => f(x);
24+const apply = f => x => f(x);
25+export {apply, applyFlipped, applyN, $$const as const, flip, on};
.storybook/purescript-indexer/output-es/Data.Functor.App/index.jsnew file+78
@@ -0,0 +1,78 @@
1+import * as $runtime from "../runtime.js";
2+import * as Unsafe$dCoerce from "../Unsafe.Coerce/index.js";
3+const App = x => x;
4+const showApp = dictShow => ({show: v => "(App " + (dictShow.show(v) + ")")});
5+const semigroupApp = dictApply => {
6+ const map = dictApply.Functor0().map;
7+ return dictSemigroup => ({append: v => v1 => dictApply.apply(map(dictSemigroup.append)(v))(v1)});
8+};
9+const plusApp = dictPlus => dictPlus;
10+const newtypeApp = {Coercible0: () => undefined};
11+const monoidApp = dictApplicative => {
12+ const $1 = dictApplicative.Apply0();
13+ const map = $1.Functor0().map;
14+ return dictMonoid => {
15+ const $4 = dictMonoid.Semigroup0();
16+ const semigroupApp2 = {append: v => v1 => $1.apply(map($4.append)(v))(v1)};
17+ return {mempty: dictApplicative.pure(dictMonoid.mempty), Semigroup0: () => semigroupApp2};
18+ };
19+};
20+const monadPlusApp = dictMonadPlus => dictMonadPlus;
21+const monadApp = dictMonad => dictMonad;
22+const lazyApp = dictLazy => dictLazy;
23+const hoistLowerApp = Unsafe$dCoerce.unsafeCoerce;
24+const hoistLiftApp = Unsafe$dCoerce.unsafeCoerce;
25+const hoistApp = f => v => f(v);
26+const functorApp = dictFunctor => dictFunctor;
27+const extendApp = dictExtend => dictExtend;
28+const eqApp = dictEq1 => dictEq => {
29+ const eq11 = dictEq1.eq1(dictEq);
30+ return {eq: x => y => eq11(x)(y)};
31+};
32+const ordApp = dictOrd1 => {
33+ const $1 = dictOrd1.Eq10();
34+ return dictOrd => {
35+ const compare11 = dictOrd1.compare1(dictOrd);
36+ const eq11 = $1.eq1(dictOrd.Eq0());
37+ const eqApp2 = {eq: x => y => eq11(x)(y)};
38+ return {compare: x => y => compare11(x)(y), Eq0: () => eqApp2};
39+ };
40+};
41+const eq1App = dictEq1 => ({eq1: dictEq => dictEq1.eq1(dictEq)});
42+const ord1App = dictOrd1 => {
43+ const $1 = dictOrd1.Eq10();
44+ const eq1App1 = {eq1: dictEq => $1.eq1(dictEq)};
45+ return {compare1: dictOrd => dictOrd1.compare1(dictOrd), Eq10: () => eq1App1};
46+};
47+const comonadApp = dictComonad => dictComonad;
48+const bindApp = dictBind => dictBind;
49+const applyApp = dictApply => dictApply;
50+const applicativeApp = dictApplicative => dictApplicative;
51+const alternativeApp = dictAlternative => dictAlternative;
52+const altApp = dictAlt => dictAlt;
53+export {
54+ App,
55+ altApp,
56+ alternativeApp,
57+ applicativeApp,
58+ applyApp,
59+ bindApp,
60+ comonadApp,
61+ eq1App,
62+ eqApp,
63+ extendApp,
64+ functorApp,
65+ hoistApp,
66+ hoistLiftApp,
67+ hoistLowerApp,
68+ lazyApp,
69+ monadApp,
70+ monadPlusApp,
71+ monoidApp,
72+ newtypeApp,
73+ ord1App,
74+ ordApp,
75+ plusApp,
76+ semigroupApp,
77+ showApp
78+};
.storybook/purescript-indexer/output-es/Data.Functor.Clown/index.jsnew file+23
@@ -0,0 +1,23 @@
1+import * as $runtime from "../runtime.js";
2+const Clown = x => x;
3+const showClown = dictShow => ({show: v => "(Clown " + (dictShow.show(v) + ")")});
4+const profunctorClown = dictContravariant => ({dimap: f => v => v1 => dictContravariant.cmap(f)(v1)});
5+const ordClown = dictOrd => dictOrd;
6+const newtypeClown = {Coercible0: () => undefined};
7+const hoistClown = f => v => f(v);
8+const functorClown = {map: v => v1 => v1};
9+const eqClown = dictEq => dictEq;
10+const bifunctorClown = dictFunctor => ({bimap: f => v => v1 => dictFunctor.map(f)(v1)});
11+const biapplyClown = dictApply => {
12+ const $1 = dictApply.Functor0();
13+ const bifunctorClown1 = {bimap: f => v => v1 => $1.map(f)(v1)};
14+ return {biapply: v => v1 => dictApply.apply(v)(v1), Bifunctor0: () => bifunctorClown1};
15+};
16+const biapplicativeClown = dictApplicative => {
17+ const $1 = dictApplicative.Apply0();
18+ const $2 = $1.Functor0();
19+ const bifunctorClown1 = {bimap: f => v => v1 => $2.map(f)(v1)};
20+ const biapplyClown1 = {biapply: v => v1 => $1.apply(v)(v1), Bifunctor0: () => bifunctorClown1};
21+ return {bipure: a => v => dictApplicative.pure(a), Biapply0: () => biapplyClown1};
22+};
23+export {Clown, biapplicativeClown, biapplyClown, bifunctorClown, eqClown, functorClown, hoistClown, newtypeClown, ordClown, profunctorClown, showClown};
.storybook/purescript-indexer/output-es/Data.Functor.Compose/index.jsnew file+121
@@ -0,0 +1,121 @@
1+import * as $runtime from "../runtime.js";
2+const Compose = x => x;
3+const showCompose = dictShow => ({show: v => "(Compose " + (dictShow.show(v) + ")")});
4+const newtypeCompose = {Coercible0: () => undefined};
5+const functorCompose = dictFunctor => dictFunctor1 => ({map: f => v => dictFunctor.map(dictFunctor1.map(f))(v)});
6+const eqCompose = dictEq1 => dictEq11 => dictEq => {
7+ const eq11 = dictEq1.eq1((() => {
8+ const eq11 = dictEq11.eq1(dictEq);
9+ return {eq: x => y => eq11(x)(y)};
10+ })());
11+ return {eq: v => v1 => eq11(v)(v1)};
12+};
13+const ordCompose = dictOrd1 => {
14+ const $1 = dictOrd1.Eq10();
15+ return dictOrd11 => {
16+ const $3 = dictOrd11.Eq10();
17+ const $4 = dictOrd11.Eq10();
18+ return dictOrd => {
19+ const compare11 = dictOrd1.compare1((() => {
20+ const compare11 = dictOrd11.compare1(dictOrd);
21+ const eq11 = $3.eq1(dictOrd.Eq0());
22+ const eqApp2 = {eq: x => y => eq11(x)(y)};
23+ return {compare: x => y => compare11(x)(y), Eq0: () => eqApp2};
24+ })());
25+ const eq11 = $1.eq1((() => {
26+ const eq11 = $4.eq1(dictOrd.Eq0());
27+ return {eq: x => y => eq11(x)(y)};
28+ })());
29+ const eqCompose3 = {eq: v => v1 => eq11(v)(v1)};
30+ return {compare: v => v1 => compare11(v)(v1), Eq0: () => eqCompose3};
31+ };
32+ };
33+};
34+const eq1Compose = dictEq1 => dictEq11 => (
35+ {
36+ eq1: dictEq => dictEq1.eq1((() => {
37+ const eq11 = dictEq11.eq1(dictEq);
38+ return {eq: x => y => eq11(x)(y)};
39+ })())
40+ }
41+);
42+const ord1Compose = dictOrd1 => {
43+ const ordCompose1 = ordCompose(dictOrd1);
44+ const $2 = dictOrd1.Eq10();
45+ return dictOrd11 => {
46+ const ordCompose2 = ordCompose1(dictOrd11);
47+ const $5 = dictOrd11.Eq10();
48+ const eq1Compose2 = {
49+ eq1: dictEq => $2.eq1((() => {
50+ const eq11 = $5.eq1(dictEq);
51+ return {eq: x => y => eq11(x)(y)};
52+ })())
53+ };
54+ return {compare1: dictOrd => ordCompose2(dictOrd).compare, Eq10: () => eq1Compose2};
55+ };
56+};
57+const bihoistCompose = dictFunctor => natF => natG => v => natF(dictFunctor.map(natG)(v));
58+const applyCompose = dictApply => {
59+ const Functor0 = dictApply.Functor0();
60+ return dictApply1 => {
61+ const $3 = dictApply1.Functor0();
62+ const functorCompose2 = {map: f => v => Functor0.map($3.map(f))(v)};
63+ return {apply: v => v1 => dictApply.apply(Functor0.map(dictApply1.apply)(v))(v1), Functor0: () => functorCompose2};
64+ };
65+};
66+const applicativeCompose = dictApplicative => {
67+ const $1 = dictApplicative.Apply0();
68+ const Functor0 = $1.Functor0();
69+ return dictApplicative1 => {
70+ const $4 = dictApplicative1.Apply0();
71+ const $5 = $4.Functor0();
72+ const functorCompose2 = {map: f => v => Functor0.map($5.map(f))(v)};
73+ const applyCompose2 = {apply: v => v1 => $1.apply(Functor0.map($4.apply)(v))(v1), Functor0: () => functorCompose2};
74+ return {pure: x => dictApplicative.pure(dictApplicative1.pure(x)), Apply0: () => applyCompose2};
75+ };
76+};
77+const altCompose = dictAlt => {
78+ const $1 = dictAlt.Functor0();
79+ return dictFunctor => {
80+ const functorCompose2 = {map: f => v => $1.map(dictFunctor.map(f))(v)};
81+ return {alt: v => v1 => dictAlt.alt(v)(v1), Functor0: () => functorCompose2};
82+ };
83+};
84+const plusCompose = dictPlus => {
85+ const $1 = dictPlus.Alt0();
86+ const $2 = $1.Functor0();
87+ return dictFunctor => {
88+ const functorCompose2 = {map: f => v => $2.map(dictFunctor.map(f))(v)};
89+ const altCompose2 = {alt: v => v1 => $1.alt(v)(v1), Functor0: () => functorCompose2};
90+ return {empty: dictPlus.empty, Alt0: () => altCompose2};
91+ };
92+};
93+const alternativeCompose = dictAlternative => {
94+ const applicativeCompose1 = applicativeCompose(dictAlternative.Applicative0());
95+ const $2 = dictAlternative.Plus1();
96+ const $3 = $2.Alt0();
97+ const $4 = $3.Functor0();
98+ return dictApplicative => {
99+ const applicativeCompose2 = applicativeCompose1(dictApplicative);
100+ const $7 = dictApplicative.Apply0().Functor0();
101+ const functorCompose2 = {map: f => v => $4.map($7.map(f))(v)};
102+ const altCompose2 = {alt: v => v1 => $3.alt(v)(v1), Functor0: () => functorCompose2};
103+ return {Applicative0: () => applicativeCompose2, Plus1: () => ({empty: $2.empty, Alt0: () => altCompose2})};
104+ };
105+};
106+export {
107+ Compose,
108+ altCompose,
109+ alternativeCompose,
110+ applicativeCompose,
111+ applyCompose,
112+ bihoistCompose,
113+ eq1Compose,
114+ eqCompose,
115+ functorCompose,
116+ newtypeCompose,
117+ ord1Compose,
118+ ordCompose,
119+ plusCompose,
120+ showCompose
121+};
.storybook/purescript-indexer/output-es/Data.Functor.Contravariant/index.jsnew file+8
@@ -0,0 +1,8 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dVoid from "../Data.Void/index.js";
3+const contravariantConst = {cmap: v => v1 => v1};
4+const cmap = dict => dict.cmap;
5+const cmapFlipped = dictContravariant => x => f => dictContravariant.cmap(f)(x);
6+const coerce = dictContravariant => dictFunctor => a => dictFunctor.map(Data$dVoid.absurd)(dictContravariant.cmap(Data$dVoid.absurd)(a));
7+const imapC = dictContravariant => v => f => dictContravariant.cmap(f);
8+export {cmap, cmapFlipped, coerce, contravariantConst, imapC};
.storybook/purescript-indexer/output-es/Data.Functor.Coproduct.Inject/index.jsnew file+25
@@ -0,0 +1,25 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEither from "../Data.Either/index.js";
3+import * as Data$dMaybe from "../Data.Maybe/index.js";
4+const prj = dict => dict.prj;
5+const injectReflexive = {inj: x => x, prj: Data$dMaybe.Just};
6+const injectLeft = {
7+ inj: x => Data$dEither.$Either("Left", x),
8+ prj: v2 => {
9+ if (v2.tag === "Left") { return Data$dMaybe.$Maybe("Just", v2._1); }
10+ if (v2.tag === "Right") { return Data$dMaybe.Nothing; }
11+ $runtime.fail();
12+ }
13+};
14+const inj = dict => dict.inj;
15+const injectRight = dictInject => (
16+ {
17+ inj: x => Data$dEither.$Either("Right", dictInject.inj(x)),
18+ prj: v2 => {
19+ if (v2.tag === "Left") { return Data$dMaybe.Nothing; }
20+ if (v2.tag === "Right") { return dictInject.prj(v2._1); }
21+ $runtime.fail();
22+ }
23+ }
24+);
25+export {inj, injectLeft, injectReflexive, injectRight, prj};
.storybook/purescript-indexer/output-es/Data.Functor.Coproduct.Nested/index.jsnew file+605
@@ -0,0 +1,605 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEither from "../Data.Either/index.js";
3+import * as Data$dFunctor$dCoproduct from "../Data.Functor.Coproduct/index.js";
4+const in9 = v => Data$dEither.$Either(
5+ "Right",
6+ Data$dEither.$Either(
7+ "Right",
8+ Data$dEither.$Either(
9+ "Right",
10+ Data$dEither.$Either(
11+ "Right",
12+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
13+ )
14+ )
15+ )
16+);
17+const in8 = v => Data$dEither.$Either(
18+ "Right",
19+ Data$dEither.$Either(
20+ "Right",
21+ Data$dEither.$Either(
22+ "Right",
23+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
24+ )
25+ )
26+);
27+const in7 = v => Data$dEither.$Either(
28+ "Right",
29+ Data$dEither.$Either(
30+ "Right",
31+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
32+ )
33+);
34+const in6 = v => Data$dEither.$Either(
35+ "Right",
36+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
37+);
38+const in5 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))));
39+const in4 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v))));
40+const in3 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)));
41+const in2 = v => Data$dEither.$Either("Right", Data$dEither.$Either("Left", v));
42+const in10 = v => Data$dEither.$Either(
43+ "Right",
44+ Data$dEither.$Either(
45+ "Right",
46+ Data$dEither.$Either(
47+ "Right",
48+ Data$dEither.$Either(
49+ "Right",
50+ Data$dEither.$Either(
51+ "Right",
52+ Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Right", Data$dEither.$Either("Left", v)))))
53+ )
54+ )
55+ )
56+ )
57+);
58+const in1 = Data$dFunctor$dCoproduct.left;
59+const coproduct9 = a => b => c => d => e => f => g => h => i => y => {
60+ if (y.tag === "Left") { return a(y._1); }
61+ if (y.tag === "Right") {
62+ if (y._1.tag === "Left") { return b(y._1._1); }
63+ if (y._1.tag === "Right") {
64+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
65+ if (y._1._1.tag === "Right") {
66+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
67+ if (y._1._1._1.tag === "Right") {
68+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
69+ if (y._1._1._1._1.tag === "Right") {
70+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
71+ if (y._1._1._1._1._1.tag === "Right") {
72+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
73+ if (y._1._1._1._1._1._1.tag === "Right") {
74+ if (y._1._1._1._1._1._1._1.tag === "Left") { return h(y._1._1._1._1._1._1._1._1); }
75+ if (y._1._1._1._1._1._1._1.tag === "Right") {
76+ if (y._1._1._1._1._1._1._1._1.tag === "Left") { return i(y._1._1._1._1._1._1._1._1._1); }
77+ if (y._1._1._1._1._1._1._1._1.tag === "Right") {
78+ const spin = spin$a0$copy => {
79+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
80+ while (spin$c) {
81+ const v = spin$a0;
82+ spin$a0 = v;
83+ continue;
84+ };
85+ return spin$r;
86+ };
87+ return spin(y._1._1._1._1._1._1._1._1._1);
88+ }
89+ $runtime.fail();
90+ }
91+ $runtime.fail();
92+ }
93+ $runtime.fail();
94+ }
95+ $runtime.fail();
96+ }
97+ $runtime.fail();
98+ }
99+ $runtime.fail();
100+ }
101+ $runtime.fail();
102+ }
103+ $runtime.fail();
104+ }
105+ $runtime.fail();
106+};
107+const coproduct8 = a => b => c => d => e => f => g => h => y => {
108+ if (y.tag === "Left") { return a(y._1); }
109+ if (y.tag === "Right") {
110+ if (y._1.tag === "Left") { return b(y._1._1); }
111+ if (y._1.tag === "Right") {
112+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
113+ if (y._1._1.tag === "Right") {
114+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
115+ if (y._1._1._1.tag === "Right") {
116+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
117+ if (y._1._1._1._1.tag === "Right") {
118+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
119+ if (y._1._1._1._1._1.tag === "Right") {
120+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
121+ if (y._1._1._1._1._1._1.tag === "Right") {
122+ if (y._1._1._1._1._1._1._1.tag === "Left") { return h(y._1._1._1._1._1._1._1._1); }
123+ if (y._1._1._1._1._1._1._1.tag === "Right") {
124+ const spin = spin$a0$copy => {
125+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
126+ while (spin$c) {
127+ const v = spin$a0;
128+ spin$a0 = v;
129+ continue;
130+ };
131+ return spin$r;
132+ };
133+ return spin(y._1._1._1._1._1._1._1._1);
134+ }
135+ $runtime.fail();
136+ }
137+ $runtime.fail();
138+ }
139+ $runtime.fail();
140+ }
141+ $runtime.fail();
142+ }
143+ $runtime.fail();
144+ }
145+ $runtime.fail();
146+ }
147+ $runtime.fail();
148+ }
149+ $runtime.fail();
150+};
151+const coproduct7 = a => b => c => d => e => f => g => y => {
152+ if (y.tag === "Left") { return a(y._1); }
153+ if (y.tag === "Right") {
154+ if (y._1.tag === "Left") { return b(y._1._1); }
155+ if (y._1.tag === "Right") {
156+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
157+ if (y._1._1.tag === "Right") {
158+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
159+ if (y._1._1._1.tag === "Right") {
160+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
161+ if (y._1._1._1._1.tag === "Right") {
162+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
163+ if (y._1._1._1._1._1.tag === "Right") {
164+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
165+ if (y._1._1._1._1._1._1.tag === "Right") {
166+ const spin = spin$a0$copy => {
167+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
168+ while (spin$c) {
169+ const v = spin$a0;
170+ spin$a0 = v;
171+ continue;
172+ };
173+ return spin$r;
174+ };
175+ return spin(y._1._1._1._1._1._1._1);
176+ }
177+ $runtime.fail();
178+ }
179+ $runtime.fail();
180+ }
181+ $runtime.fail();
182+ }
183+ $runtime.fail();
184+ }
185+ $runtime.fail();
186+ }
187+ $runtime.fail();
188+ }
189+ $runtime.fail();
190+};
191+const coproduct6 = a => b => c => d => e => f => y => {
192+ if (y.tag === "Left") { return a(y._1); }
193+ if (y.tag === "Right") {
194+ if (y._1.tag === "Left") { return b(y._1._1); }
195+ if (y._1.tag === "Right") {
196+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
197+ if (y._1._1.tag === "Right") {
198+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
199+ if (y._1._1._1.tag === "Right") {
200+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
201+ if (y._1._1._1._1.tag === "Right") {
202+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
203+ if (y._1._1._1._1._1.tag === "Right") {
204+ const spin = spin$a0$copy => {
205+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
206+ while (spin$c) {
207+ const v = spin$a0;
208+ spin$a0 = v;
209+ continue;
210+ };
211+ return spin$r;
212+ };
213+ return spin(y._1._1._1._1._1._1);
214+ }
215+ $runtime.fail();
216+ }
217+ $runtime.fail();
218+ }
219+ $runtime.fail();
220+ }
221+ $runtime.fail();
222+ }
223+ $runtime.fail();
224+ }
225+ $runtime.fail();
226+};
227+const coproduct5 = a => b => c => d => e => y => {
228+ if (y.tag === "Left") { return a(y._1); }
229+ if (y.tag === "Right") {
230+ if (y._1.tag === "Left") { return b(y._1._1); }
231+ if (y._1.tag === "Right") {
232+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
233+ if (y._1._1.tag === "Right") {
234+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
235+ if (y._1._1._1.tag === "Right") {
236+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
237+ if (y._1._1._1._1.tag === "Right") {
238+ const spin = spin$a0$copy => {
239+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
240+ while (spin$c) {
241+ const v = spin$a0;
242+ spin$a0 = v;
243+ continue;
244+ };
245+ return spin$r;
246+ };
247+ return spin(y._1._1._1._1._1);
248+ }
249+ $runtime.fail();
250+ }
251+ $runtime.fail();
252+ }
253+ $runtime.fail();
254+ }
255+ $runtime.fail();
256+ }
257+ $runtime.fail();
258+};
259+const coproduct4 = a => b => c => d => y => {
260+ if (y.tag === "Left") { return a(y._1); }
261+ if (y.tag === "Right") {
262+ if (y._1.tag === "Left") { return b(y._1._1); }
263+ if (y._1.tag === "Right") {
264+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
265+ if (y._1._1.tag === "Right") {
266+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
267+ if (y._1._1._1.tag === "Right") {
268+ const spin = spin$a0$copy => {
269+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
270+ while (spin$c) {
271+ const v = spin$a0;
272+ spin$a0 = v;
273+ continue;
274+ };
275+ return spin$r;
276+ };
277+ return spin(y._1._1._1._1);
278+ }
279+ $runtime.fail();
280+ }
281+ $runtime.fail();
282+ }
283+ $runtime.fail();
284+ }
285+ $runtime.fail();
286+};
287+const coproduct3 = a => b => c => y => {
288+ if (y.tag === "Left") { return a(y._1); }
289+ if (y.tag === "Right") {
290+ if (y._1.tag === "Left") { return b(y._1._1); }
291+ if (y._1.tag === "Right") {
292+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
293+ if (y._1._1.tag === "Right") {
294+ const spin = spin$a0$copy => {
295+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
296+ while (spin$c) {
297+ const v = spin$a0;
298+ spin$a0 = v;
299+ continue;
300+ };
301+ return spin$r;
302+ };
303+ return spin(y._1._1._1);
304+ }
305+ $runtime.fail();
306+ }
307+ $runtime.fail();
308+ }
309+ $runtime.fail();
310+};
311+const coproduct2 = a => b => y => {
312+ if (y.tag === "Left") { return a(y._1); }
313+ if (y.tag === "Right") {
314+ if (y._1.tag === "Left") { return b(y._1._1); }
315+ if (y._1.tag === "Right") {
316+ const spin = spin$a0$copy => {
317+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
318+ while (spin$c) {
319+ const v = spin$a0;
320+ spin$a0 = v;
321+ continue;
322+ };
323+ return spin$r;
324+ };
325+ return spin(y._1._1);
326+ }
327+ $runtime.fail();
328+ }
329+ $runtime.fail();
330+};
331+const coproduct10 = a => b => c => d => e => f => g => h => i => j => y => {
332+ if (y.tag === "Left") { return a(y._1); }
333+ if (y.tag === "Right") {
334+ if (y._1.tag === "Left") { return b(y._1._1); }
335+ if (y._1.tag === "Right") {
336+ if (y._1._1.tag === "Left") { return c(y._1._1._1); }
337+ if (y._1._1.tag === "Right") {
338+ if (y._1._1._1.tag === "Left") { return d(y._1._1._1._1); }
339+ if (y._1._1._1.tag === "Right") {
340+ if (y._1._1._1._1.tag === "Left") { return e(y._1._1._1._1._1); }
341+ if (y._1._1._1._1.tag === "Right") {
342+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
343+ if (y._1._1._1._1._1.tag === "Right") {
344+ if (y._1._1._1._1._1._1.tag === "Left") { return g(y._1._1._1._1._1._1._1); }
345+ if (y._1._1._1._1._1._1.tag === "Right") {
346+ if (y._1._1._1._1._1._1._1.tag === "Left") { return h(y._1._1._1._1._1._1._1._1); }
347+ if (y._1._1._1._1._1._1._1.tag === "Right") {
348+ if (y._1._1._1._1._1._1._1._1.tag === "Left") { return i(y._1._1._1._1._1._1._1._1._1); }
349+ if (y._1._1._1._1._1._1._1._1.tag === "Right") {
350+ if (y._1._1._1._1._1._1._1._1._1.tag === "Left") { return j(y._1._1._1._1._1._1._1._1._1._1); }
351+ if (y._1._1._1._1._1._1._1._1._1.tag === "Right") {
352+ const spin = spin$a0$copy => {
353+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
354+ while (spin$c) {
355+ const v = spin$a0;
356+ spin$a0 = v;
357+ continue;
358+ };
359+ return spin$r;
360+ };
361+ return spin(y._1._1._1._1._1._1._1._1._1._1);
362+ }
363+ $runtime.fail();
364+ }
365+ $runtime.fail();
366+ }
367+ $runtime.fail();
368+ }
369+ $runtime.fail();
370+ }
371+ $runtime.fail();
372+ }
373+ $runtime.fail();
374+ }
375+ $runtime.fail();
376+ }
377+ $runtime.fail();
378+ }
379+ $runtime.fail();
380+ }
381+ $runtime.fail();
382+};
383+const coproduct1 = y => {
384+ if (y.tag === "Left") { return y._1; }
385+ if (y.tag === "Right") {
386+ const spin = spin$a0$copy => {
387+ let spin$a0 = spin$a0$copy, spin$c = true, spin$r;
388+ while (spin$c) {
389+ const v = spin$a0;
390+ spin$a0 = v;
391+ continue;
392+ };
393+ return spin$r;
394+ };
395+ return spin(y._1);
396+ }
397+ $runtime.fail();
398+};
399+const at9 = b => f => y => {
400+ if (y.tag === "Right") {
401+ if (y._1.tag === "Right") {
402+ if (y._1._1.tag === "Right") {
403+ if (y._1._1._1.tag === "Right") {
404+ if (y._1._1._1._1.tag === "Right") {
405+ if (y._1._1._1._1._1.tag === "Right") {
406+ if (y._1._1._1._1._1._1.tag === "Right") {
407+ if (y._1._1._1._1._1._1._1.tag === "Right") {
408+ if (y._1._1._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1._1._1); }
409+ return b;
410+ }
411+ return b;
412+ }
413+ return b;
414+ }
415+ return b;
416+ }
417+ return b;
418+ }
419+ return b;
420+ }
421+ return b;
422+ }
423+ return b;
424+ }
425+ return b;
426+};
427+const at8 = b => f => y => {
428+ if (y.tag === "Right") {
429+ if (y._1.tag === "Right") {
430+ if (y._1._1.tag === "Right") {
431+ if (y._1._1._1.tag === "Right") {
432+ if (y._1._1._1._1.tag === "Right") {
433+ if (y._1._1._1._1._1.tag === "Right") {
434+ if (y._1._1._1._1._1._1.tag === "Right") {
435+ if (y._1._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1._1); }
436+ return b;
437+ }
438+ return b;
439+ }
440+ return b;
441+ }
442+ return b;
443+ }
444+ return b;
445+ }
446+ return b;
447+ }
448+ return b;
449+ }
450+ return b;
451+};
452+const at7 = b => f => y => {
453+ if (y.tag === "Right") {
454+ if (y._1.tag === "Right") {
455+ if (y._1._1.tag === "Right") {
456+ if (y._1._1._1.tag === "Right") {
457+ if (y._1._1._1._1.tag === "Right") {
458+ if (y._1._1._1._1._1.tag === "Right") {
459+ if (y._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1); }
460+ return b;
461+ }
462+ return b;
463+ }
464+ return b;
465+ }
466+ return b;
467+ }
468+ return b;
469+ }
470+ return b;
471+ }
472+ return b;
473+};
474+const at6 = b => f => y => {
475+ if (y.tag === "Right") {
476+ if (y._1.tag === "Right") {
477+ if (y._1._1.tag === "Right") {
478+ if (y._1._1._1.tag === "Right") {
479+ if (y._1._1._1._1.tag === "Right") {
480+ if (y._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1); }
481+ return b;
482+ }
483+ return b;
484+ }
485+ return b;
486+ }
487+ return b;
488+ }
489+ return b;
490+ }
491+ return b;
492+};
493+const at5 = b => f => y => {
494+ if (y.tag === "Right") {
495+ if (y._1.tag === "Right") {
496+ if (y._1._1.tag === "Right") {
497+ if (y._1._1._1.tag === "Right") {
498+ if (y._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1); }
499+ return b;
500+ }
501+ return b;
502+ }
503+ return b;
504+ }
505+ return b;
506+ }
507+ return b;
508+};
509+const at4 = b => f => y => {
510+ if (y.tag === "Right") {
511+ if (y._1.tag === "Right") {
512+ if (y._1._1.tag === "Right") {
513+ if (y._1._1._1.tag === "Left") { return f(y._1._1._1._1); }
514+ return b;
515+ }
516+ return b;
517+ }
518+ return b;
519+ }
520+ return b;
521+};
522+const at3 = b => f => y => {
523+ if (y.tag === "Right") {
524+ if (y._1.tag === "Right") {
525+ if (y._1._1.tag === "Left") { return f(y._1._1._1); }
526+ return b;
527+ }
528+ return b;
529+ }
530+ return b;
531+};
532+const at2 = b => f => y => {
533+ if (y.tag === "Right") {
534+ if (y._1.tag === "Left") { return f(y._1._1); }
535+ return b;
536+ }
537+ return b;
538+};
539+const at10 = b => f => y => {
540+ if (y.tag === "Right") {
541+ if (y._1.tag === "Right") {
542+ if (y._1._1.tag === "Right") {
543+ if (y._1._1._1.tag === "Right") {
544+ if (y._1._1._1._1.tag === "Right") {
545+ if (y._1._1._1._1._1.tag === "Right") {
546+ if (y._1._1._1._1._1._1.tag === "Right") {
547+ if (y._1._1._1._1._1._1._1.tag === "Right") {
548+ if (y._1._1._1._1._1._1._1._1.tag === "Right") {
549+ if (y._1._1._1._1._1._1._1._1._1.tag === "Left") { return f(y._1._1._1._1._1._1._1._1._1._1); }
550+ return b;
551+ }
552+ return b;
553+ }
554+ return b;
555+ }
556+ return b;
557+ }
558+ return b;
559+ }
560+ return b;
561+ }
562+ return b;
563+ }
564+ return b;
565+ }
566+ return b;
567+ }
568+ return b;
569+};
570+const at1 = b => f => y => {
571+ if (y.tag === "Left") { return f(y._1); }
572+ return b;
573+};
574+export {
575+ at1,
576+ at10,
577+ at2,
578+ at3,
579+ at4,
580+ at5,
581+ at6,
582+ at7,
583+ at8,
584+ at9,
585+ coproduct1,
586+ coproduct10,
587+ coproduct2,
588+ coproduct3,
589+ coproduct4,
590+ coproduct5,
591+ coproduct6,
592+ coproduct7,
593+ coproduct8,
594+ coproduct9,
595+ in1,
596+ in10,
597+ in2,
598+ in3,
599+ in4,
600+ in5,
601+ in6,
602+ in7,
603+ in8,
604+ in9
605+};
.storybook/purescript-indexer/output-es/Data.Functor.Coproduct/index.jsnew file+181
@@ -0,0 +1,181 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dBifunctor from "../Data.Bifunctor/index.js";
3+import * as Data$dEither from "../Data.Either/index.js";
4+import * as Data$dOrdering from "../Data.Ordering/index.js";
5+const Coproduct = x => x;
6+const showCoproduct = dictShow => dictShow1 => (
7+ {
8+ show: v => {
9+ if (v.tag === "Left") { return "(left " + (dictShow.show(v._1) + ")"); }
10+ if (v.tag === "Right") { return "(right " + (dictShow1.show(v._1) + ")"); }
11+ $runtime.fail();
12+ }
13+ }
14+);
15+const right = ga => Data$dEither.$Either("Right", ga);
16+const newtypeCoproduct = {Coercible0: () => undefined};
17+const left = fa => Data$dEither.$Either("Left", fa);
18+const functorCoproduct = dictFunctor => dictFunctor1 => ({map: f => v => Data$dBifunctor.bifunctorEither.bimap(dictFunctor.map(f))(dictFunctor1.map(f))(v)});
19+const eq1Coproduct = dictEq1 => dictEq11 => (
20+ {
21+ eq1: dictEq => {
22+ const eq12 = dictEq1.eq1(dictEq);
23+ const eq13 = dictEq11.eq1(dictEq);
24+ return v => v1 => {
25+ if (v.tag === "Left") {
26+ if (v1.tag === "Left") { return eq12(v._1)(v1._1); }
27+ return false;
28+ }
29+ if (v.tag === "Right") {
30+ if (v1.tag === "Right") { return eq13(v._1)(v1._1); }
31+ return false;
32+ }
33+ return false;
34+ };
35+ }
36+ }
37+);
38+const eqCoproduct = dictEq1 => dictEq11 => dictEq => (
39+ {
40+ eq: (() => {
41+ const eq12 = dictEq1.eq1(dictEq);
42+ const eq13 = dictEq11.eq1(dictEq);
43+ return v => v1 => {
44+ if (v.tag === "Left") {
45+ if (v1.tag === "Left") { return eq12(v._1)(v1._1); }
46+ return false;
47+ }
48+ if (v.tag === "Right") {
49+ if (v1.tag === "Right") { return eq13(v._1)(v1._1); }
50+ return false;
51+ }
52+ return false;
53+ };
54+ })()
55+ }
56+);
57+const ord1Coproduct = dictOrd1 => {
58+ const $1 = dictOrd1.Eq10();
59+ return dictOrd11 => {
60+ const $3 = dictOrd11.Eq10();
61+ const eq1Coproduct2 = {
62+ eq1: dictEq => {
63+ const eq12 = $1.eq1(dictEq);
64+ const eq13 = $3.eq1(dictEq);
65+ return v => v1 => {
66+ if (v.tag === "Left") {
67+ if (v1.tag === "Left") { return eq12(v._1)(v1._1); }
68+ return false;
69+ }
70+ if (v.tag === "Right") {
71+ if (v1.tag === "Right") { return eq13(v._1)(v1._1); }
72+ return false;
73+ }
74+ return false;
75+ };
76+ }
77+ };
78+ return {
79+ compare1: dictOrd => {
80+ const compare12 = dictOrd1.compare1(dictOrd);
81+ const compare13 = dictOrd11.compare1(dictOrd);
82+ return v => v1 => {
83+ if (v.tag === "Left") {
84+ if (v1.tag === "Left") { return compare12(v._1)(v1._1); }
85+ return Data$dOrdering.LT;
86+ }
87+ if (v1.tag === "Left") { return Data$dOrdering.GT; }
88+ if (v.tag === "Right") {
89+ if (v1.tag === "Right") { return compare13(v._1)(v1._1); }
90+ $runtime.fail();
91+ }
92+ $runtime.fail();
93+ };
94+ },
95+ Eq10: () => eq1Coproduct2
96+ };
97+ };
98+};
99+const ordCoproduct = dictOrd1 => {
100+ const ord1Coproduct1 = ord1Coproduct(dictOrd1);
101+ const $2 = dictOrd1.Eq10();
102+ return dictOrd11 => {
103+ const compare1 = ord1Coproduct1(dictOrd11).compare1;
104+ const $5 = dictOrd11.Eq10();
105+ return dictOrd => {
106+ const $7 = dictOrd.Eq0();
107+ const eqCoproduct3 = {
108+ eq: (() => {
109+ const eq12 = $2.eq1($7);
110+ const eq13 = $5.eq1($7);
111+ return v => v1 => {
112+ if (v.tag === "Left") {
113+ if (v1.tag === "Left") { return eq12(v._1)(v1._1); }
114+ return false;
115+ }
116+ if (v.tag === "Right") {
117+ if (v1.tag === "Right") { return eq13(v._1)(v1._1); }
118+ return false;
119+ }
120+ return false;
121+ };
122+ })()
123+ };
124+ return {compare: compare1(dictOrd), Eq0: () => eqCoproduct3};
125+ };
126+ };
127+};
128+const coproduct = v => v1 => v2 => {
129+ if (v2.tag === "Left") { return v(v2._1); }
130+ if (v2.tag === "Right") { return v1(v2._1); }
131+ $runtime.fail();
132+};
133+const extendCoproduct = dictExtend => {
134+ const functorCoproduct1 = functorCoproduct(dictExtend.Functor0());
135+ return dictExtend1 => {
136+ const functorCoproduct2 = functorCoproduct1(dictExtend1.Functor0());
137+ return {
138+ extend: f => {
139+ const $5 = dictExtend.extend(x => f(Data$dEither.$Either("Left", x)));
140+ const $6 = dictExtend1.extend(x => f(Data$dEither.$Either("Right", x)));
141+ return x => {
142+ if (x.tag === "Left") { return Data$dEither.$Either("Left", $5(x._1)); }
143+ if (x.tag === "Right") { return Data$dEither.$Either("Right", $6(x._1)); }
144+ $runtime.fail();
145+ };
146+ },
147+ Functor0: () => functorCoproduct2
148+ };
149+ };
150+};
151+const comonadCoproduct = dictComonad => {
152+ const extendCoproduct1 = extendCoproduct(dictComonad.Extend0());
153+ return dictComonad1 => {
154+ const extendCoproduct2 = extendCoproduct1(dictComonad1.Extend0());
155+ return {
156+ extract: v2 => {
157+ if (v2.tag === "Left") { return dictComonad.extract(v2._1); }
158+ if (v2.tag === "Right") { return dictComonad1.extract(v2._1); }
159+ $runtime.fail();
160+ },
161+ Extend0: () => extendCoproduct2
162+ };
163+ };
164+};
165+const bihoistCoproduct = natF => natG => v => Data$dBifunctor.bifunctorEither.bimap(natF)(natG)(v);
166+export {
167+ Coproduct,
168+ bihoistCoproduct,
169+ comonadCoproduct,
170+ coproduct,
171+ eq1Coproduct,
172+ eqCoproduct,
173+ extendCoproduct,
174+ functorCoproduct,
175+ left,
176+ newtypeCoproduct,
177+ ord1Coproduct,
178+ ordCoproduct,
179+ right,
180+ showCoproduct
181+};
.storybook/purescript-indexer/output-es/Data.Functor.Costar/index.jsnew file+83
@@ -0,0 +1,83 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dTuple from "../Data.Tuple/index.js";
3+const Costar = x => x;
4+const semigroupoidCostar = dictExtend => ({compose: v => v1 => w => v(dictExtend.extend(v1)(w))});
5+const profunctorCostar = dictFunctor => (
6+ {
7+ dimap: f => g => v => {
8+ const $4 = dictFunctor.map(f);
9+ return x => g(v($4(x)));
10+ }
11+ }
12+);
13+const strongCostar = dictComonad => {
14+ const Functor0 = dictComonad.Extend0().Functor0();
15+ const profunctorCostar1 = {
16+ dimap: f => g => v => {
17+ const $5 = Functor0.map(f);
18+ return x => g(v($5(x)));
19+ }
20+ };
21+ return {
22+ first: v => x => Data$dTuple.$Tuple(v(Functor0.map(Data$dTuple.fst)(x)), dictComonad.extract(x)._2),
23+ second: v => x => Data$dTuple.$Tuple(dictComonad.extract(x)._1, v(Functor0.map(Data$dTuple.snd)(x))),
24+ Profunctor0: () => profunctorCostar1
25+ };
26+};
27+const newtypeCostar = {Coercible0: () => undefined};
28+const hoistCostar = f => v => x => v(f(x));
29+const functorCostar = {map: f => v => x => f(v(x))};
30+const invariantCostar = {imap: f => v => v$1 => x => f(v$1(x))};
31+const distributiveCostar = {
32+ distribute: dictFunctor => f => a => dictFunctor.map(v => v(a))(f),
33+ collect: dictFunctor => f => {
34+ const $2 = distributiveCostar.distribute(dictFunctor);
35+ const $3 = dictFunctor.map(f);
36+ return x => $2($3(x));
37+ },
38+ Functor0: () => functorCostar
39+};
40+const closedCostar = dictFunctor => {
41+ const profunctorCostar1 = {
42+ dimap: f => g => v => {
43+ const $4 = dictFunctor.map(f);
44+ return x => g(v($4(x)));
45+ }
46+ };
47+ return {closed: v => g => x => v(dictFunctor.map(v1 => v1(x))(g)), Profunctor0: () => profunctorCostar1};
48+};
49+const categoryCostar = dictComonad => {
50+ const $1 = dictComonad.Extend0();
51+ const semigroupoidCostar1 = {compose: v => v1 => w => v($1.extend(v1)(w))};
52+ return {identity: dictComonad.extract, Semigroupoid0: () => semigroupoidCostar1};
53+};
54+const bifunctorCostar = dictContravariant => (
55+ {
56+ bimap: f => g => v => {
57+ const $4 = dictContravariant.cmap(f);
58+ return x => g(v($4(x)));
59+ }
60+ }
61+);
62+const applyCostar = {apply: v => v1 => a => v(a)(v1(a)), Functor0: () => functorCostar};
63+const bindCostar = {bind: v => f => x => f(v(x))(x), Apply0: () => applyCostar};
64+const applicativeCostar = {pure: a => v => a, Apply0: () => applyCostar};
65+const monadCostar = {Applicative0: () => applicativeCostar, Bind1: () => bindCostar};
66+export {
67+ Costar,
68+ applicativeCostar,
69+ applyCostar,
70+ bifunctorCostar,
71+ bindCostar,
72+ categoryCostar,
73+ closedCostar,
74+ distributiveCostar,
75+ functorCostar,
76+ hoistCostar,
77+ invariantCostar,
78+ monadCostar,
79+ newtypeCostar,
80+ profunctorCostar,
81+ semigroupoidCostar,
82+ strongCostar
83+};
.storybook/purescript-indexer/output-es/Data.Functor.Flip/index.jsnew file+30
@@ -0,0 +1,30 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dBifunctor from "../Data.Bifunctor/index.js";
3+import * as Data$dProfunctor from "../Data.Profunctor/index.js";
4+const Flip = x => x;
5+const showFlip = dictShow => ({show: v => "(Flip " + (dictShow.show(v) + ")")});
6+const semigroupoidFlip = dictSemigroupoid => ({compose: v => v1 => dictSemigroupoid.compose(v1)(v)});
7+const ordFlip = dictOrd => dictOrd;
8+const newtypeFlip = {Coercible0: () => undefined};
9+const functorFlip = dictBifunctor => ({map: f => v => dictBifunctor.bimap(f)(Data$dBifunctor.identity)(v)});
10+const eqFlip = dictEq => dictEq;
11+const contravariantFlip = dictProfunctor => ({cmap: f => v => dictProfunctor.dimap(f)(Data$dProfunctor.identity)(v)});
12+const categoryFlip = dictCategory => {
13+ const $1 = dictCategory.Semigroupoid0();
14+ const semigroupoidFlip1 = {compose: v => v1 => $1.compose(v1)(v)};
15+ return {identity: dictCategory.identity, Semigroupoid0: () => semigroupoidFlip1};
16+};
17+const bifunctorFlip = dictBifunctor => ({bimap: f => g => v => dictBifunctor.bimap(g)(f)(v)});
18+const biapplyFlip = dictBiapply => {
19+ const $1 = dictBiapply.Bifunctor0();
20+ const bifunctorFlip1 = {bimap: f => g => v => $1.bimap(g)(f)(v)};
21+ return {biapply: v => v1 => dictBiapply.biapply(v)(v1), Bifunctor0: () => bifunctorFlip1};
22+};
23+const biapplicativeFlip = dictBiapplicative => {
24+ const $1 = dictBiapplicative.Biapply0();
25+ const $2 = $1.Bifunctor0();
26+ const bifunctorFlip1 = {bimap: f => g => v => $2.bimap(g)(f)(v)};
27+ const biapplyFlip1 = {biapply: v => v1 => $1.biapply(v)(v1), Bifunctor0: () => bifunctorFlip1};
28+ return {bipure: a => b => dictBiapplicative.bipure(b)(a), Biapply0: () => biapplyFlip1};
29+};
30+export {Flip, biapplicativeFlip, biapplyFlip, bifunctorFlip, categoryFlip, contravariantFlip, eqFlip, functorFlip, newtypeFlip, ordFlip, semigroupoidFlip, showFlip};
.storybook/purescript-indexer/output-es/Data.Functor.Invariant/index.jsnew file+15
@@ -0,0 +1,15 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dSemigroupoid from "../Control.Semigroupoid/index.js";
3+import * as Data$dFunctor from "../Data.Functor/index.js";
4+const invariantMultiplicative = {imap: f => v => v1 => f(v1)};
5+const invariantEndo = {imap: ab => ba => v => x => ab(v(ba(x)))};
6+const invariantDual = {imap: f => v => v1 => f(v1)};
7+const invariantDisj = {imap: f => v => v1 => f(v1)};
8+const invariantConj = {imap: f => v => v1 => f(v1)};
9+const invariantAdditive = {imap: f => v => v1 => f(v1)};
10+const imapF = dictFunctor => f => v => dictFunctor.map(f);
11+const invariantArray = {imap: f => v => Data$dFunctor.arrayMap(f)};
12+const invariantFn = {imap: f => v => Control$dSemigroupoid.semigroupoidFn.compose(f)};
13+const imap = dict => dict.imap;
14+const invariantAlternate = dictInvariant => ({imap: f => g => v => dictInvariant.imap(f)(g)(v)});
15+export {imap, imapF, invariantAdditive, invariantAlternate, invariantArray, invariantConj, invariantDisj, invariantDual, invariantEndo, invariantFn, invariantMultiplicative};
.storybook/purescript-indexer/output-es/Data.Functor.Joker/index.jsnew file+79
@@ -0,0 +1,79 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEither from "../Data.Either/index.js";
3+const Joker = x => x;
4+const showJoker = dictShow => ({show: v => "(Joker " + (dictShow.show(v) + ")")});
5+const profunctorJoker = dictFunctor => ({dimap: v => g => v1 => dictFunctor.map(g)(v1)});
6+const ordJoker = dictOrd => dictOrd;
7+const newtypeJoker = {Coercible0: () => undefined};
8+const hoistJoker = f => v => f(v);
9+const functorJoker = dictFunctor => ({map: f => v => dictFunctor.map(f)(v)});
10+const eqJoker = dictEq => dictEq;
11+const choiceJoker = dictFunctor => {
12+ const profunctorJoker1 = {dimap: v => g => v1 => dictFunctor.map(g)(v1)};
13+ return {left: v => dictFunctor.map(Data$dEither.Left)(v), right: v => dictFunctor.map(Data$dEither.Right)(v), Profunctor0: () => profunctorJoker1};
14+};
15+const bifunctorJoker = dictFunctor => ({bimap: v => g => v1 => dictFunctor.map(g)(v1)});
16+const biapplyJoker = dictApply => {
17+ const $1 = dictApply.Functor0();
18+ const bifunctorJoker1 = {bimap: v => g => v1 => $1.map(g)(v1)};
19+ return {biapply: v => v1 => dictApply.apply(v)(v1), Bifunctor0: () => bifunctorJoker1};
20+};
21+const biapplicativeJoker = dictApplicative => {
22+ const $1 = dictApplicative.Apply0();
23+ const $2 = $1.Functor0();
24+ const bifunctorJoker1 = {bimap: v => g => v1 => $2.map(g)(v1)};
25+ const biapplyJoker1 = {biapply: v => v1 => $1.apply(v)(v1), Bifunctor0: () => bifunctorJoker1};
26+ return {bipure: v => b => dictApplicative.pure(b), Biapply0: () => biapplyJoker1};
27+};
28+const applyJoker = dictApply => {
29+ const $1 = dictApply.Functor0();
30+ const functorJoker1 = {map: f => v => $1.map(f)(v)};
31+ return {apply: v => v1 => dictApply.apply(v)(v1), Functor0: () => functorJoker1};
32+};
33+const bindJoker = dictBind => {
34+ const $1 = dictBind.Apply0();
35+ const $2 = $1.Functor0();
36+ const functorJoker1 = {map: f => v => $2.map(f)(v)};
37+ const applyJoker1 = {apply: v => v1 => $1.apply(v)(v1), Functor0: () => functorJoker1};
38+ return {bind: v => amb => dictBind.bind(v)(x => amb(x)), Apply0: () => applyJoker1};
39+};
40+const applicativeJoker = dictApplicative => {
41+ const $1 = dictApplicative.Apply0();
42+ const $2 = $1.Functor0();
43+ const functorJoker1 = {map: f => v => $2.map(f)(v)};
44+ const applyJoker1 = {apply: v => v1 => $1.apply(v)(v1), Functor0: () => functorJoker1};
45+ return {pure: x => dictApplicative.pure(x), Apply0: () => applyJoker1};
46+};
47+const monadJoker = dictMonad => {
48+ const $1 = dictMonad.Applicative0();
49+ const $2 = $1.Apply0();
50+ const $3 = $2.Functor0();
51+ const functorJoker1 = {map: f => v => $3.map(f)(v)};
52+ const applyJoker1 = {apply: v => v1 => $2.apply(v)(v1), Functor0: () => functorJoker1};
53+ const applicativeJoker1 = {pure: x => $1.pure(x), Apply0: () => applyJoker1};
54+ const $7 = dictMonad.Bind1();
55+ const $8 = $7.Apply0();
56+ const $9 = $8.Functor0();
57+ const functorJoker1$1 = {map: f => v => $9.map(f)(v)};
58+ const applyJoker1$1 = {apply: v => v1 => $8.apply(v)(v1), Functor0: () => functorJoker1$1};
59+ const bindJoker1 = {bind: v => amb => $7.bind(v)(x => amb(x)), Apply0: () => applyJoker1$1};
60+ return {Applicative0: () => applicativeJoker1, Bind1: () => bindJoker1};
61+};
62+export {
63+ Joker,
64+ applicativeJoker,
65+ applyJoker,
66+ biapplicativeJoker,
67+ biapplyJoker,
68+ bifunctorJoker,
69+ bindJoker,
70+ choiceJoker,
71+ eqJoker,
72+ functorJoker,
73+ hoistJoker,
74+ monadJoker,
75+ newtypeJoker,
76+ ordJoker,
77+ profunctorJoker,
78+ showJoker
79+};
.storybook/purescript-indexer/output-es/Data.Functor.Product.Nested/index.jsnew file+51
@@ -0,0 +1,51 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dTuple from "../Data.Tuple/index.js";
3+import * as Data$dUnit from "../Data.Unit/index.js";
4+const product9 = a => b => c => d => e => f => g => h => i => Data$dTuple.$Tuple(
5+ a,
6+ Data$dTuple.$Tuple(
7+ b,
8+ Data$dTuple.$Tuple(c, Data$dTuple.$Tuple(d, Data$dTuple.$Tuple(e, Data$dTuple.$Tuple(f, Data$dTuple.$Tuple(g, Data$dTuple.$Tuple(h, Data$dTuple.$Tuple(i, Data$dUnit.unit)))))))
9+ )
10+);
11+const product8 = a => b => c => d => e => f => g => h => Data$dTuple.$Tuple(
12+ a,
13+ Data$dTuple.$Tuple(b, Data$dTuple.$Tuple(c, Data$dTuple.$Tuple(d, Data$dTuple.$Tuple(e, Data$dTuple.$Tuple(f, Data$dTuple.$Tuple(g, Data$dTuple.$Tuple(h, Data$dUnit.unit)))))))
14+);
15+const product7 = a => b => c => d => e => f => g => Data$dTuple.$Tuple(
16+ a,
17+ Data$dTuple.$Tuple(b, Data$dTuple.$Tuple(c, Data$dTuple.$Tuple(d, Data$dTuple.$Tuple(e, Data$dTuple.$Tuple(f, Data$dTuple.$Tuple(g, Data$dUnit.unit))))))
18+);
19+const product6 = a => b => c => d => e => f => Data$dTuple.$Tuple(
20+ a,
21+ Data$dTuple.$Tuple(b, Data$dTuple.$Tuple(c, Data$dTuple.$Tuple(d, Data$dTuple.$Tuple(e, Data$dTuple.$Tuple(f, Data$dUnit.unit)))))
22+);
23+const product5 = a => b => c => d => e => Data$dTuple.$Tuple(a, Data$dTuple.$Tuple(b, Data$dTuple.$Tuple(c, Data$dTuple.$Tuple(d, Data$dTuple.$Tuple(e, Data$dUnit.unit)))));
24+const product4 = a => b => c => d => Data$dTuple.$Tuple(a, Data$dTuple.$Tuple(b, Data$dTuple.$Tuple(c, Data$dTuple.$Tuple(d, Data$dUnit.unit))));
25+const product3 = a => b => c => Data$dTuple.$Tuple(a, Data$dTuple.$Tuple(b, Data$dTuple.$Tuple(c, Data$dUnit.unit)));
26+const product2 = a => b => Data$dTuple.$Tuple(a, Data$dTuple.$Tuple(b, Data$dUnit.unit));
27+const product10 = a => b => c => d => e => f => g => h => i => j => Data$dTuple.$Tuple(
28+ a,
29+ Data$dTuple.$Tuple(
30+ b,
31+ Data$dTuple.$Tuple(
32+ c,
33+ Data$dTuple.$Tuple(
34+ d,
35+ Data$dTuple.$Tuple(e, Data$dTuple.$Tuple(f, Data$dTuple.$Tuple(g, Data$dTuple.$Tuple(h, Data$dTuple.$Tuple(i, Data$dTuple.$Tuple(j, Data$dUnit.unit))))))
36+ )
37+ )
38+ )
39+);
40+const product1 = a => Data$dTuple.$Tuple(a, Data$dUnit.unit);
41+const get9 = v => v._2._2._2._2._2._2._2._2._1;
42+const get8 = v => v._2._2._2._2._2._2._2._1;
43+const get7 = v => v._2._2._2._2._2._2._1;
44+const get6 = v => v._2._2._2._2._2._1;
45+const get5 = v => v._2._2._2._2._1;
46+const get4 = v => v._2._2._2._1;
47+const get3 = v => v._2._2._1;
48+const get2 = v => v._2._1;
49+const get10 = v => v._2._2._2._2._2._2._2._2._2._1;
50+const get1 = v => v._1;
51+export {get1, get10, get2, get3, get4, get5, get6, get7, get8, get9, product1, product10, product2, product3, product4, product5, product6, product7, product8, product9};
.storybook/purescript-indexer/output-es/Data.Functor.Product/index.jsnew file+116
@@ -0,0 +1,116 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dTuple from "../Data.Tuple/index.js";
3+const Product = x => x;
4+const showProduct = dictShow => dictShow1 => ({show: v => "(product " + (dictShow.show(v._1) + (" " + (dictShow1.show(v._2) + ")")))});
5+const product = fa => ga => Data$dTuple.$Tuple(fa, ga);
6+const newtypeProduct = {Coercible0: () => undefined};
7+const functorProduct = dictFunctor => dictFunctor1 => ({map: f => v => Data$dTuple.$Tuple(dictFunctor.map(f)(v._1), dictFunctor1.map(f)(v._2))});
8+const eq1Product = dictEq1 => dictEq11 => (
9+ {
10+ eq1: dictEq => {
11+ const eq12 = dictEq1.eq1(dictEq);
12+ const eq13 = dictEq11.eq1(dictEq);
13+ return v => v1 => eq12(v._1)(v1._1) && eq13(v._2)(v1._2);
14+ }
15+ }
16+);
17+const eqProduct = dictEq1 => dictEq11 => dictEq => (
18+ {
19+ eq: (() => {
20+ const eq12 = dictEq1.eq1(dictEq);
21+ const eq13 = dictEq11.eq1(dictEq);
22+ return v => v1 => eq12(v._1)(v1._1) && eq13(v._2)(v1._2);
23+ })()
24+ }
25+);
26+const ord1Product = dictOrd1 => {
27+ const $1 = dictOrd1.Eq10();
28+ return dictOrd11 => {
29+ const $3 = dictOrd11.Eq10();
30+ const eq1Product2 = {
31+ eq1: dictEq => {
32+ const eq12 = $1.eq1(dictEq);
33+ const eq13 = $3.eq1(dictEq);
34+ return v => v1 => eq12(v._1)(v1._1) && eq13(v._2)(v1._2);
35+ }
36+ };
37+ return {
38+ compare1: dictOrd => {
39+ const compare12 = dictOrd1.compare1(dictOrd);
40+ const compare13 = dictOrd11.compare1(dictOrd);
41+ return v => v1 => {
42+ const v2 = compare12(v._1)(v1._1);
43+ if (v2.tag === "EQ") { return compare13(v._2)(v1._2); }
44+ return v2;
45+ };
46+ },
47+ Eq10: () => eq1Product2
48+ };
49+ };
50+};
51+const ordProduct = dictOrd1 => {
52+ const ord1Product1 = ord1Product(dictOrd1);
53+ const $2 = dictOrd1.Eq10();
54+ return dictOrd11 => {
55+ const compare1 = ord1Product1(dictOrd11).compare1;
56+ const $5 = dictOrd11.Eq10();
57+ return dictOrd => {
58+ const $7 = dictOrd.Eq0();
59+ const eqProduct3 = {
60+ eq: (() => {
61+ const eq12 = $2.eq1($7);
62+ const eq13 = $5.eq1($7);
63+ return v => v1 => eq12(v._1)(v1._1) && eq13(v._2)(v1._2);
64+ })()
65+ };
66+ return {compare: compare1(dictOrd), Eq0: () => eqProduct3};
67+ };
68+ };
69+};
70+const bihoistProduct = natF => natG => v => Data$dTuple.$Tuple(natF(v._1), natG(v._2));
71+const applyProduct = dictApply => {
72+ const functorProduct1 = functorProduct(dictApply.Functor0());
73+ return dictApply1 => {
74+ const functorProduct2 = functorProduct1(dictApply1.Functor0());
75+ return {apply: v => v1 => Data$dTuple.$Tuple(dictApply.apply(v._1)(v1._1), dictApply1.apply(v._2)(v1._2)), Functor0: () => functorProduct2};
76+ };
77+};
78+const bindProduct = dictBind => {
79+ const applyProduct1 = applyProduct(dictBind.Apply0());
80+ return dictBind1 => {
81+ const applyProduct2 = applyProduct1(dictBind1.Apply0());
82+ return {bind: v => f => Data$dTuple.$Tuple(dictBind.bind(v._1)(x => f(x)._1), dictBind1.bind(v._2)(x => f(x)._2)), Apply0: () => applyProduct2};
83+ };
84+};
85+const applicativeProduct = dictApplicative => {
86+ const applyProduct1 = applyProduct(dictApplicative.Apply0());
87+ return dictApplicative1 => {
88+ const applyProduct2 = applyProduct1(dictApplicative1.Apply0());
89+ return {pure: a => Data$dTuple.$Tuple(dictApplicative.pure(a), dictApplicative1.pure(a)), Apply0: () => applyProduct2};
90+ };
91+};
92+const monadProduct = dictMonad => {
93+ const applicativeProduct1 = applicativeProduct(dictMonad.Applicative0());
94+ const bindProduct1 = bindProduct(dictMonad.Bind1());
95+ return dictMonad1 => {
96+ const applicativeProduct2 = applicativeProduct1(dictMonad1.Applicative0());
97+ const bindProduct2 = bindProduct1(dictMonad1.Bind1());
98+ return {Applicative0: () => applicativeProduct2, Bind1: () => bindProduct2};
99+ };
100+};
101+export {
102+ Product,
103+ applicativeProduct,
104+ applyProduct,
105+ bihoistProduct,
106+ bindProduct,
107+ eq1Product,
108+ eqProduct,
109+ functorProduct,
110+ monadProduct,
111+ newtypeProduct,
112+ ord1Product,
113+ ordProduct,
114+ product,
115+ showProduct
116+};
.storybook/purescript-indexer/output-es/Data.Functor.Product2/index.jsnew file+40
@@ -0,0 +1,40 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dOrdering from "../Data.Ordering/index.js";
3+const $Product2 = (_1, _2) => ({tag: "Product2", _1, _2});
4+const Product2 = value0 => value1 => $Product2(value0, value1);
5+const showProduct2 = dictShow => dictShow1 => ({show: v => "(Product2 " + (dictShow.show(v._1) + (" " + (dictShow1.show(v._2) + ")")))});
6+const profunctorProduct2 = dictProfunctor => dictProfunctor1 => ({dimap: f => g => v => $Product2(dictProfunctor.dimap(f)(g)(v._1), dictProfunctor1.dimap(f)(g)(v._2))});
7+const functorProduct2 = dictFunctor => dictFunctor1 => ({map: f => v => $Product2(dictFunctor.map(f)(v._1), dictFunctor1.map(f)(v._2))});
8+const eqProduct2 = dictEq => dictEq1 => ({eq: x => y => dictEq.eq(x._1)(y._1) && dictEq1.eq(x._2)(y._2)});
9+const ordProduct2 = dictOrd => {
10+ const $1 = dictOrd.Eq0();
11+ return dictOrd1 => {
12+ const $3 = dictOrd1.Eq0();
13+ const eqProduct22 = {eq: x => y => $1.eq(x._1)(y._1) && $3.eq(x._2)(y._2)};
14+ return {
15+ compare: x => y => {
16+ const v = dictOrd.compare(x._1)(y._1);
17+ if (v.tag === "LT") { return Data$dOrdering.LT; }
18+ if (v.tag === "GT") { return Data$dOrdering.GT; }
19+ return dictOrd1.compare(x._2)(y._2);
20+ },
21+ Eq0: () => eqProduct22
22+ };
23+ };
24+};
25+const bifunctorProduct2 = dictBifunctor => dictBifunctor1 => ({bimap: f => g => v => $Product2(dictBifunctor.bimap(f)(g)(v._1), dictBifunctor1.bimap(f)(g)(v._2))});
26+const biapplyProduct2 = dictBiapply => {
27+ const bifunctorProduct21 = bifunctorProduct2(dictBiapply.Bifunctor0());
28+ return dictBiapply1 => {
29+ const bifunctorProduct22 = bifunctorProduct21(dictBiapply1.Bifunctor0());
30+ return {biapply: v => v1 => $Product2(dictBiapply.biapply(v._1)(v1._1), dictBiapply1.biapply(v._2)(v1._2)), Bifunctor0: () => bifunctorProduct22};
31+ };
32+};
33+const biapplicativeProduct2 = dictBiapplicative => {
34+ const biapplyProduct21 = biapplyProduct2(dictBiapplicative.Biapply0());
35+ return dictBiapplicative1 => {
36+ const biapplyProduct22 = biapplyProduct21(dictBiapplicative1.Biapply0());
37+ return {bipure: a => b => $Product2(dictBiapplicative.bipure(a)(b), dictBiapplicative1.bipure(a)(b)), Biapply0: () => biapplyProduct22};
38+ };
39+};
40+export {$Product2, Product2, biapplicativeProduct2, biapplyProduct2, bifunctorProduct2, eqProduct2, functorProduct2, ordProduct2, profunctorProduct2, showProduct2};
.storybook/purescript-indexer/output-es/Data.Functor.Variant/index.jsnew file+218
@@ -0,0 +1,218 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
3+import * as Data$dShow from "../Data.Show/index.js";
4+import * as Data$dTraversable from "../Data.Traversable/index.js";
5+import * as Data$dVariant$dInternal from "../Data.Variant.Internal/index.js";
6+import * as Partial from "../Partial/index.js";
7+import * as Record$dUnsafe from "../Record.Unsafe/index.js";
8+import * as Type$dProxy from "../Type.Proxy/index.js";
9+import * as Unsafe$dCoerce from "../Unsafe.Coerce/index.js";
10+const UnvariantF = x => x;
11+const variantFShows = dict => dict.variantFShows;
12+const variantFMaps = dict => dict.variantFMaps;
13+const unvariantF = v => f => f({reflectSymbol: v$1 => v.type})()({map: v.map})(Type$dProxy.Proxy)(v.value);
14+const traverseVFRL = dict => dict.traverseVFRL;
15+const traverseSome = () => () => () => dictVariantTags => dictVariantFMaps => () => () => dictFunctor => r => k => v => {
16+ if (Record$dUnsafe.unsafeHas(v.type)(r)) {
17+ const map1 = Data$dVariant$dInternal.lookup("map")(v.type)(dictVariantTags.variantTags(Type$dProxy.Proxy))(dictVariantFMaps.variantFMaps(Type$dProxy.Proxy));
18+ return dictFunctor.map(value => ({type: v.type, map: map1, value: value}))(Record$dUnsafe.unsafeGet(v.type)(r)(v.value));
19+ }
20+ return k(v);
21+};
22+const traverse = () => () => () => dictVariantTags => dictVariantFMaps => () => () => dictApplicative => {
23+ const Functor0 = dictApplicative.Apply0().Functor0();
24+ return dictTraversable => {
25+ const traverse1 = dictTraversable.traverse(dictApplicative);
26+ return r => f => traverseSome()()()(dictVariantTags)(dictVariantFMaps)()()(Functor0)(r)((() => {
27+ const $13 = traverse1(f);
28+ const $14 = Functor0.map(Unsafe$dCoerce.unsafeCoerce);
29+ return x => $14($13(x));
30+ })());
31+ };
32+};
33+const showVariantFNil = {variantFShows: v => v1 => Data$dList$dTypes.Nil};
34+const showVariantFCons = dictVariantFShows => dictShow => dictShow1 => (
35+ {variantFShows: v => p => Data$dList$dTypes.$List("Cons", dictShow.show, dictVariantFShows.variantFShows(Type$dProxy.Proxy)(p))}
36+);
37+const showVariantF = () => dictVariantTags => dictVariantFShows => dictShow => (
38+ {
39+ show: v1 => "(inj @" + (
40+ Data$dShow.showStringImpl(v1.type) + (
41+ " " + (
42+ Data$dVariant$dInternal.lookup("show")(v1.type)(dictVariantTags.variantTags(Type$dProxy.Proxy))(dictVariantFShows.variantFShows(Type$dProxy.Proxy)(Type$dProxy.Proxy))(v1.value) + ")"
43+ )
44+ )
45+ )
46+ }
47+);
48+const overSome = () => () => () => dictVariantTags => dictVariantFMaps => () => () => r => k => v => {
49+ if (Record$dUnsafe.unsafeHas(v.type)(r)) {
50+ return {
51+ type: v.type,
52+ map: Data$dVariant$dInternal.lookup("map")(v.type)(dictVariantTags.variantTags(Type$dProxy.Proxy))(dictVariantFMaps.variantFMaps(Type$dProxy.Proxy)),
53+ value: Record$dUnsafe.unsafeGet(v.type)(r)(v.value)
54+ };
55+ }
56+ return k(v);
57+};
58+const onMatch = () => () => () => r => k => v => {
59+ if (Record$dUnsafe.unsafeHas(v.type)(r)) { return Record$dUnsafe.unsafeGet(v.type)(r)(v.value); }
60+ return k(v);
61+};
62+const on = () => dictIsSymbol => p => f => g => r => {
63+ if (r.type === dictIsSymbol.reflectSymbol(p)) { return f(r.value); }
64+ return g(r);
65+};
66+const prj = () => dictAlternative => {
67+ const pure = dictAlternative.Applicative0().pure;
68+ const empty = dictAlternative.Plus1().empty;
69+ return dictIsSymbol => p => r => {
70+ if (r.type === dictIsSymbol.reflectSymbol(p)) { return pure(r.value); }
71+ return empty;
72+ };
73+};
74+const mapVariantFNil = {variantFMaps: v => Data$dList$dTypes.Nil};
75+const mapVariantFCons = dictVariantFMaps => dictFunctor => ({variantFMaps: v => Data$dList$dTypes.$List("Cons", dictFunctor.map, dictVariantFMaps.variantFMaps(Type$dProxy.Proxy))});
76+const inj = () => dictIsSymbol => dictFunctor => p => value => ({type: dictIsSymbol.reflectSymbol(p), value: value, map: dictFunctor.map});
77+const overOne = () => () => dictIsSymbol => dictFunctor => p => f => g => r => {
78+ if (r.type === dictIsSymbol.reflectSymbol(p)) { return {type: dictIsSymbol.reflectSymbol(p), value: f(r.value), map: dictFunctor.map}; }
79+ return g(r);
80+};
81+const revariantF = v => v(dictIsSymbol => () => dictFunctor => p => value => ({type: dictIsSymbol.reflectSymbol(p), value: value, map: dictFunctor.map}));
82+const traverseOne = () => () => dictIsSymbol => dictFunctor => dictFunctor1 => p => f => {
83+ const $7 = dictFunctor1.map(value => ({type: dictIsSymbol.reflectSymbol(p), value: value, map: dictFunctor.map}));
84+ return g => r => {
85+ if (r.type === dictIsSymbol.reflectSymbol(p)) { return $7(f(r.value)); }
86+ return g(r);
87+ };
88+};
89+const functorVariantF = {map: f => a => ({type: a.type, value: a.map(f)(a.value), map: a.map})};
90+const over = () => () => () => dictVariantTags => dictVariantFMaps => () => () => r => f => overSome()()()(dictVariantTags)(dictVariantFMaps)()()(r)(x => (
91+ {type: x.type, value: x.map(f)(x.value), map: x.map}
92+));
93+const foldrVFRL = dict => dict.foldrVFRL;
94+const foldlVFRL = dict => dict.foldlVFRL;
95+const foldMapVFRL = dict => dict.foldMapVFRL;
96+const foldableCons = dictIsSymbol => dictFoldable => dictFoldableVFRL => () => (
97+ {
98+ foldrVFRL: v => f => b => {
99+ const $7 = dictFoldable.foldr(f)(b);
100+ const $8 = dictFoldableVFRL.foldrVFRL(Type$dProxy.Proxy)(f)(b);
101+ return r => {
102+ if (r.type === dictIsSymbol.reflectSymbol(Type$dProxy.Proxy)) { return $7(r.value); }
103+ return $8(r);
104+ };
105+ },
106+ foldlVFRL: v => f => b => {
107+ const $7 = dictFoldable.foldl(f)(b);
108+ const $8 = dictFoldableVFRL.foldlVFRL(Type$dProxy.Proxy)(f)(b);
109+ return r => {
110+ if (r.type === dictIsSymbol.reflectSymbol(Type$dProxy.Proxy)) { return $7(r.value); }
111+ return $8(r);
112+ };
113+ },
114+ foldMapVFRL: dictMonoid => {
115+ const foldMap1 = dictFoldable.foldMap(dictMonoid);
116+ const foldMapVFRL2 = dictFoldableVFRL.foldMapVFRL(dictMonoid);
117+ return v => f => {
118+ const $9 = foldMap1(f);
119+ const $10 = foldMapVFRL2(Type$dProxy.Proxy)(f);
120+ return r => {
121+ if (r.type === dictIsSymbol.reflectSymbol(Type$dProxy.Proxy)) { return $9(r.value); }
122+ return $10(r);
123+ };
124+ };
125+ }
126+ }
127+);
128+const foldableVariantF = () => dictFoldableVFRL => (
129+ {
130+ foldr: dictFoldableVFRL.foldrVFRL(Type$dProxy.Proxy),
131+ foldl: dictFoldableVFRL.foldlVFRL(Type$dProxy.Proxy),
132+ foldMap: dictMonoid => dictFoldableVFRL.foldMapVFRL(dictMonoid)(Type$dProxy.Proxy)
133+ }
134+);
135+const traversableVariantF = () => dictTraversableVFRL => {
136+ const foldableVariantF2 = foldableVariantF()(dictTraversableVFRL.FoldableVFRL0());
137+ return {
138+ traverse: dictApplicative => dictTraversableVFRL.traverseVFRL(dictApplicative)(Type$dProxy.Proxy),
139+ sequence: dictApplicative => traversableVariantF()(dictTraversableVFRL).traverse(dictApplicative)(Data$dTraversable.identity),
140+ Functor0: () => functorVariantF,
141+ Foldable1: () => foldableVariantF2
142+ };
143+};
144+const expand = () => Unsafe$dCoerce.unsafeCoerce;
145+const traversableCons = dictIsSymbol => dictTraversable => {
146+ const $2 = dictTraversable.Functor0();
147+ const foldableCons2 = foldableCons(dictIsSymbol)(dictTraversable.Foldable1());
148+ return dictTraversableVFRL => {
149+ const foldableCons3 = foldableCons2(dictTraversableVFRL.FoldableVFRL0())();
150+ return () => () => (
151+ {
152+ traverseVFRL: dictApplicative => {
153+ const traverse2 = dictTraversable.traverse(dictApplicative);
154+ const map1 = dictApplicative.Apply0().Functor0().map;
155+ const traverseVFRL2 = dictTraversableVFRL.traverseVFRL(dictApplicative);
156+ return v => f => {
157+ const $14 = traverse2(f);
158+ const $15 = map1(value => ({type: dictIsSymbol.reflectSymbol(Type$dProxy.Proxy), value: value, map: $2.map}));
159+ const $16 = traverseVFRL2(Type$dProxy.Proxy)(f);
160+ const $17 = map1(Unsafe$dCoerce.unsafeCoerce);
161+ return r => {
162+ if (r.type === dictIsSymbol.reflectSymbol(Type$dProxy.Proxy)) { return $15($14(r.value)); }
163+ return $17($16(r));
164+ };
165+ };
166+ },
167+ FoldableVFRL0: () => foldableCons3
168+ }
169+ );
170+ };
171+};
172+const $$default = a => v => a;
173+const contract = dictAlternative => dictContractable => {
174+ const contractWith = dictContractable.contractWith(dictAlternative);
175+ return v => contractWith(Type$dProxy.Proxy)(Type$dProxy.Proxy)(v.type)(v);
176+};
177+const case_ = r => Partial._crashWith("Data.Functor.Variant: pattern match failure [" + (r.type + "]"));
178+const foldableNil = {foldrVFRL: v => v1 => v2 => case_, foldlVFRL: v => v1 => v2 => case_, foldMapVFRL: dictMonoid => v => v1 => case_};
179+const match = () => () => () => r => onMatch()()()(r)(case_);
180+const traversableNil = {traverseVFRL: dictApplicative => v => v1 => case_, FoldableVFRL0: () => foldableNil};
181+export {
182+ UnvariantF,
183+ case_,
184+ contract,
185+ $$default as default,
186+ expand,
187+ foldMapVFRL,
188+ foldableCons,
189+ foldableNil,
190+ foldableVariantF,
191+ foldlVFRL,
192+ foldrVFRL,
193+ functorVariantF,
194+ inj,
195+ mapVariantFCons,
196+ mapVariantFNil,
197+ match,
198+ on,
199+ onMatch,
200+ over,
201+ overOne,
202+ overSome,
203+ prj,
204+ revariantF,
205+ showVariantF,
206+ showVariantFCons,
207+ showVariantFNil,
208+ traversableCons,
209+ traversableNil,
210+ traversableVariantF,
211+ traverse,
212+ traverseOne,
213+ traverseSome,
214+ traverseVFRL,
215+ unvariantF,
216+ variantFMaps,
217+ variantFShows
218+};
.storybook/purescript-indexer/output-es/Data.Functor/foreign.jsnew file+10
@@ -0,0 +1,10 @@
1+export const arrayMap = function (f) {
2+ return function (arr) {
3+ var l = arr.length;
4+ var result = new Array(l);
5+ for (var i = 0; i < l; i++) {
6+ result[i] = f(arr[i]);
7+ }
8+ return result;
9+ };
10+};
.storybook/purescript-indexer/output-es/Data.Functor/index.jsnew file+16
@@ -0,0 +1,16 @@
1+import * as $runtime from "../runtime.js";
2+import * as Control$dSemigroupoid from "../Control.Semigroupoid/index.js";
3+import * as Data$dUnit from "../Data.Unit/index.js";
4+import * as Type$dProxy from "../Type.Proxy/index.js";
5+import {arrayMap} from "./foreign.js";
6+const map = dict => dict.map;
7+const mapFlipped = dictFunctor => fa => f => dictFunctor.map(f)(fa);
8+const $$void = dictFunctor => dictFunctor.map(v => Data$dUnit.unit);
9+const voidLeft = dictFunctor => f => x => dictFunctor.map(v => x)(f);
10+const voidRight = dictFunctor => x => dictFunctor.map(v => x);
11+const functorProxy = {map: v => v1 => Type$dProxy.Proxy};
12+const functorFn = /* #__PURE__ */ (() => ({map: Control$dSemigroupoid.semigroupoidFn.compose}))();
13+const functorArray = {map: arrayMap};
14+const flap = dictFunctor => ff => x => dictFunctor.map(f => f(x))(ff);
15+export {flap, functorArray, functorFn, functorProxy, map, mapFlipped, $$void as void, voidLeft, voidRight};
16+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.FunctorWithIndex/foreign.jsnew file+10
@@ -0,0 +1,10 @@
1+export const mapWithIndexArray = function (f) {
2+ return function (xs) {
3+ var l = xs.length;
4+ var result = Array(l);
5+ for (var i = 0; i < l; i++) {
6+ result[i] = f(i)(xs[i]);
7+ }
8+ return result;
9+ };
10+};
.storybook/purescript-indexer/output-es/Data.FunctorWithIndex/index.jsnew file+92
@@ -0,0 +1,92 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dBifunctor from "../Data.Bifunctor/index.js";
3+import * as Data$dConst from "../Data.Const/index.js";
4+import * as Data$dEither from "../Data.Either/index.js";
5+import * as Data$dFunctor from "../Data.Functor/index.js";
6+import * as Data$dFunctor$dCoproduct from "../Data.Functor.Coproduct/index.js";
7+import * as Data$dFunctor$dProduct from "../Data.Functor.Product/index.js";
8+import * as Data$dIdentity from "../Data.Identity/index.js";
9+import * as Data$dMaybe from "../Data.Maybe/index.js";
10+import * as Data$dMonoid$dAdditive from "../Data.Monoid.Additive/index.js";
11+import * as Data$dMonoid$dConj from "../Data.Monoid.Conj/index.js";
12+import * as Data$dMonoid$dDisj from "../Data.Monoid.Disj/index.js";
13+import * as Data$dMonoid$dDual from "../Data.Monoid.Dual/index.js";
14+import * as Data$dMonoid$dMultiplicative from "../Data.Monoid.Multiplicative/index.js";
15+import * as Data$dTuple from "../Data.Tuple/index.js";
16+import * as Data$dUnit from "../Data.Unit/index.js";
17+import {mapWithIndexArray} from "./foreign.js";
18+const mapWithIndex = dict => dict.mapWithIndex;
19+const mapDefault = dictFunctorWithIndex => f => dictFunctorWithIndex.mapWithIndex(v => f);
20+const functorWithIndexTuple = {mapWithIndex: f => Data$dTuple.functorTuple.map(f(Data$dUnit.unit)), Functor0: () => Data$dTuple.functorTuple};
21+const functorWithIndexProduct = dictFunctorWithIndex => {
22+ const functorProduct = Data$dFunctor$dProduct.functorProduct(dictFunctorWithIndex.Functor0());
23+ return dictFunctorWithIndex1 => {
24+ const functorProduct1 = functorProduct(dictFunctorWithIndex1.Functor0());
25+ return {
26+ mapWithIndex: f => v => Data$dTuple.$Tuple(
27+ dictFunctorWithIndex.mapWithIndex(x => f(Data$dEither.$Either("Left", x)))(v._1),
28+ dictFunctorWithIndex1.mapWithIndex(x => f(Data$dEither.$Either("Right", x)))(v._2)
29+ ),
30+ Functor0: () => functorProduct1
31+ };
32+ };
33+};
34+const functorWithIndexMultiplicative = {mapWithIndex: f => f(Data$dUnit.unit), Functor0: () => Data$dMonoid$dMultiplicative.functorMultiplicative};
35+const functorWithIndexMaybe = {mapWithIndex: f => Data$dMaybe.functorMaybe.map(f(Data$dUnit.unit)), Functor0: () => Data$dMaybe.functorMaybe};
36+const functorWithIndexLast = {mapWithIndex: f => Data$dMaybe.functorMaybe.map(f(Data$dUnit.unit)), Functor0: () => Data$dMaybe.functorMaybe};
37+const functorWithIndexIdentity = {mapWithIndex: f => v => f(Data$dUnit.unit)(v), Functor0: () => Data$dIdentity.functorIdentity};
38+const functorWithIndexFirst = {mapWithIndex: f => Data$dMaybe.functorMaybe.map(f(Data$dUnit.unit)), Functor0: () => Data$dMaybe.functorMaybe};
39+const functorWithIndexEither = {mapWithIndex: f => Data$dEither.functorEither.map(f(Data$dUnit.unit)), Functor0: () => Data$dEither.functorEither};
40+const functorWithIndexDual = {mapWithIndex: f => f(Data$dUnit.unit), Functor0: () => Data$dMonoid$dDual.functorDual};
41+const functorWithIndexDisj = {mapWithIndex: f => f(Data$dUnit.unit), Functor0: () => Data$dMonoid$dDisj.functorDisj};
42+const functorWithIndexCoproduct = dictFunctorWithIndex => {
43+ const functorCoproduct = Data$dFunctor$dCoproduct.functorCoproduct(dictFunctorWithIndex.Functor0());
44+ return dictFunctorWithIndex1 => {
45+ const functorCoproduct1 = functorCoproduct(dictFunctorWithIndex1.Functor0());
46+ return {
47+ mapWithIndex: f => v => Data$dBifunctor.bifunctorEither.bimap(dictFunctorWithIndex.mapWithIndex(x => f(Data$dEither.$Either("Left", x))))(dictFunctorWithIndex1.mapWithIndex(x => f(Data$dEither.$Either(
48+ "Right",
49+ x
50+ ))))(v),
51+ Functor0: () => functorCoproduct1
52+ };
53+ };
54+};
55+const functorWithIndexConst = {mapWithIndex: v => v1 => v1, Functor0: () => Data$dConst.functorConst};
56+const functorWithIndexConj = {mapWithIndex: f => f(Data$dUnit.unit), Functor0: () => Data$dMonoid$dConj.functorConj};
57+const functorWithIndexCompose = dictFunctorWithIndex => {
58+ const $1 = dictFunctorWithIndex.Functor0();
59+ return dictFunctorWithIndex1 => {
60+ const $3 = dictFunctorWithIndex1.Functor0();
61+ const functorCompose1 = {map: f => v => $1.map($3.map(f))(v)};
62+ return {mapWithIndex: f => v => dictFunctorWithIndex.mapWithIndex(x => dictFunctorWithIndex1.mapWithIndex(Data$dTuple.curry(f)(x)))(v), Functor0: () => functorCompose1};
63+ };
64+};
65+const functorWithIndexArray = {mapWithIndex: mapWithIndexArray, Functor0: () => Data$dFunctor.functorArray};
66+const functorWithIndexApp = dictFunctorWithIndex => {
67+ const functorApp = dictFunctorWithIndex.Functor0();
68+ return {mapWithIndex: f => v => dictFunctorWithIndex.mapWithIndex(f)(v), Functor0: () => functorApp};
69+};
70+const functorWithIndexAdditive = {mapWithIndex: f => f(Data$dUnit.unit), Functor0: () => Data$dMonoid$dAdditive.functorAdditive};
71+export {
72+ functorWithIndexAdditive,
73+ functorWithIndexApp,
74+ functorWithIndexArray,
75+ functorWithIndexCompose,
76+ functorWithIndexConj,
77+ functorWithIndexConst,
78+ functorWithIndexCoproduct,
79+ functorWithIndexDisj,
80+ functorWithIndexDual,
81+ functorWithIndexEither,
82+ functorWithIndexFirst,
83+ functorWithIndexIdentity,
84+ functorWithIndexLast,
85+ functorWithIndexMaybe,
86+ functorWithIndexMultiplicative,
87+ functorWithIndexProduct,
88+ functorWithIndexTuple,
89+ mapDefault,
90+ mapWithIndex
91+};
92+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Generic.Rep/index.jsnew file+31
@@ -0,0 +1,31 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dShow from "../Data.Show/index.js";
3+import * as Type$dProxy from "../Type.Proxy/index.js";
4+const $NoArguments = () => ({tag: "NoArguments"});
5+const $Product = (_1, _2) => ({tag: "Product", _1, _2});
6+const $Sum = (tag, _1) => ({tag, _1});
7+const Inl = value0 => $Sum("Inl", value0);
8+const Inr = value0 => $Sum("Inr", value0);
9+const Product = value0 => value1 => $Product(value0, value1);
10+const NoArguments = /* #__PURE__ */ $NoArguments();
11+const Constructor = x => x;
12+const Argument = x => x;
13+const to = dict => dict.to;
14+const showSum = dictShow => dictShow1 => (
15+ {
16+ show: v => {
17+ if (v.tag === "Inl") { return "(Inl " + (dictShow.show(v._1) + ")"); }
18+ if (v.tag === "Inr") { return "(Inr " + (dictShow1.show(v._1) + ")"); }
19+ $runtime.fail();
20+ }
21+ }
22+);
23+const showProduct = dictShow => dictShow1 => ({show: v => "(Product " + (dictShow.show(v._1) + (" " + (dictShow1.show(v._2) + ")")))});
24+const showNoArguments = {show: v => "NoArguments"};
25+const showConstructor = dictIsSymbol => dictShow => (
26+ {show: v => "(Constructor @" + (Data$dShow.showStringImpl(dictIsSymbol.reflectSymbol(Type$dProxy.Proxy)) + (" " + (dictShow.show(v) + ")")))}
27+);
28+const showArgument = dictShow => ({show: v => "(Argument " + (dictShow.show(v) + ")")});
29+const repOf = dictGeneric => v => Type$dProxy.Proxy;
30+const from = dict => dict.from;
31+export {$NoArguments, $Product, $Sum, Argument, Constructor, Inl, Inr, NoArguments, Product, from, repOf, showArgument, showConstructor, showNoArguments, showProduct, showSum, to};
.storybook/purescript-indexer/output-es/Data.HeytingAlgebra.Generic/index.jsnew file+70
@@ -0,0 +1,70 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dGeneric$dRep from "../Data.Generic.Rep/index.js";
3+const genericTT$p = dict => dict["genericTT'"];
4+const genericTT = dictGeneric => dictGenericHeytingAlgebra => dictGeneric.to(dictGenericHeytingAlgebra["genericTT'"]);
5+const genericNot$p = dict => dict["genericNot'"];
6+const genericNot = dictGeneric => dictGenericHeytingAlgebra => x => dictGeneric.to(dictGenericHeytingAlgebra["genericNot'"](dictGeneric.from(x)));
7+const genericImplies$p = dict => dict["genericImplies'"];
8+const genericImplies = dictGeneric => dictGenericHeytingAlgebra => x => y => dictGeneric.to(dictGenericHeytingAlgebra["genericImplies'"](dictGeneric.from(x))(dictGeneric.from(y)));
9+const genericHeytingAlgebraNoArguments = {
10+ "genericFF'": Data$dGeneric$dRep.NoArguments,
11+ "genericTT'": Data$dGeneric$dRep.NoArguments,
12+ "genericImplies'": v => v1 => Data$dGeneric$dRep.NoArguments,
13+ "genericConj'": v => v1 => Data$dGeneric$dRep.NoArguments,
14+ "genericDisj'": v => v1 => Data$dGeneric$dRep.NoArguments,
15+ "genericNot'": v => Data$dGeneric$dRep.NoArguments
16+};
17+const genericHeytingAlgebraArgument = dictHeytingAlgebra => (
18+ {
19+ "genericFF'": dictHeytingAlgebra.ff,
20+ "genericTT'": dictHeytingAlgebra.tt,
21+ "genericImplies'": v => v1 => dictHeytingAlgebra.implies(v)(v1),
22+ "genericConj'": v => v1 => dictHeytingAlgebra.conj(v)(v1),
23+ "genericDisj'": v => v1 => dictHeytingAlgebra.disj(v)(v1),
24+ "genericNot'": v => dictHeytingAlgebra.not(v)
25+ }
26+);
27+const genericFF$p = dict => dict["genericFF'"];
28+const genericFF = dictGeneric => dictGenericHeytingAlgebra => dictGeneric.to(dictGenericHeytingAlgebra["genericFF'"]);
29+const genericDisj$p = dict => dict["genericDisj'"];
30+const genericDisj = dictGeneric => dictGenericHeytingAlgebra => x => y => dictGeneric.to(dictGenericHeytingAlgebra["genericDisj'"](dictGeneric.from(x))(dictGeneric.from(y)));
31+const genericConj$p = dict => dict["genericConj'"];
32+const genericHeytingAlgebraConstructor = dictGenericHeytingAlgebra => (
33+ {
34+ "genericFF'": dictGenericHeytingAlgebra["genericFF'"],
35+ "genericTT'": dictGenericHeytingAlgebra["genericTT'"],
36+ "genericImplies'": v => v1 => dictGenericHeytingAlgebra["genericImplies'"](v)(v1),
37+ "genericConj'": v => v1 => dictGenericHeytingAlgebra["genericConj'"](v)(v1),
38+ "genericDisj'": v => v1 => dictGenericHeytingAlgebra["genericDisj'"](v)(v1),
39+ "genericNot'": v => dictGenericHeytingAlgebra["genericNot'"](v)
40+ }
41+);
42+const genericHeytingAlgebraProduct = dictGenericHeytingAlgebra => dictGenericHeytingAlgebra1 => (
43+ {
44+ "genericFF'": Data$dGeneric$dRep.$Product(dictGenericHeytingAlgebra["genericFF'"], dictGenericHeytingAlgebra1["genericFF'"]),
45+ "genericTT'": Data$dGeneric$dRep.$Product(dictGenericHeytingAlgebra["genericTT'"], dictGenericHeytingAlgebra1["genericTT'"]),
46+ "genericImplies'": v => v1 => Data$dGeneric$dRep.$Product(dictGenericHeytingAlgebra["genericImplies'"](v._1)(v1._1), dictGenericHeytingAlgebra1["genericImplies'"](v._2)(v1._2)),
47+ "genericConj'": v => v1 => Data$dGeneric$dRep.$Product(dictGenericHeytingAlgebra["genericConj'"](v._1)(v1._1), dictGenericHeytingAlgebra1["genericConj'"](v._2)(v1._2)),
48+ "genericDisj'": v => v1 => Data$dGeneric$dRep.$Product(dictGenericHeytingAlgebra["genericDisj'"](v._1)(v1._1), dictGenericHeytingAlgebra1["genericDisj'"](v._2)(v1._2)),
49+ "genericNot'": v => Data$dGeneric$dRep.$Product(dictGenericHeytingAlgebra["genericNot'"](v._1), dictGenericHeytingAlgebra1["genericNot'"](v._2))
50+ }
51+);
52+const genericConj = dictGeneric => dictGenericHeytingAlgebra => x => y => dictGeneric.to(dictGenericHeytingAlgebra["genericConj'"](dictGeneric.from(x))(dictGeneric.from(y)));
53+export {
54+ genericConj,
55+ genericConj$p,
56+ genericDisj,
57+ genericDisj$p,
58+ genericFF,
59+ genericFF$p,
60+ genericHeytingAlgebraArgument,
61+ genericHeytingAlgebraConstructor,
62+ genericHeytingAlgebraNoArguments,
63+ genericHeytingAlgebraProduct,
64+ genericImplies,
65+ genericImplies$p,
66+ genericNot,
67+ genericNot$p,
68+ genericTT,
69+ genericTT$p
70+};
.storybook/purescript-indexer/output-es/Data.HeytingAlgebra/foreign.jsnew file+15
@@ -0,0 +1,15 @@
1+export const boolConj = function (b1) {
2+ return function (b2) {
3+ return b1 && b2;
4+ };
5+};
6+
7+export const boolDisj = function (b1) {
8+ return function (b2) {
9+ return b1 || b2;
10+ };
11+};
12+
13+export const boolNot = function (b) {
14+ return !b;
15+};
.storybook/purescript-indexer/output-es/Data.HeytingAlgebra/index.jsnew file+109
@@ -0,0 +1,109 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dUnit from "../Data.Unit/index.js";
3+import * as Record$dUnsafe from "../Record.Unsafe/index.js";
4+import * as Type$dProxy from "../Type.Proxy/index.js";
5+import {boolConj, boolDisj, boolNot} from "./foreign.js";
6+const ttRecord = dict => dict.ttRecord;
7+const tt = dict => dict.tt;
8+const notRecord = dict => dict.notRecord;
9+const not = dict => dict.not;
10+const impliesRecord = dict => dict.impliesRecord;
11+const implies = dict => dict.implies;
12+const heytingAlgebraUnit = {
13+ ff: Data$dUnit.unit,
14+ tt: Data$dUnit.unit,
15+ implies: v => v1 => Data$dUnit.unit,
16+ conj: v => v1 => Data$dUnit.unit,
17+ disj: v => v1 => Data$dUnit.unit,
18+ not: v => Data$dUnit.unit
19+};
20+const heytingAlgebraRecordNil = {
21+ conjRecord: v => v1 => v2 => ({}),
22+ disjRecord: v => v1 => v2 => ({}),
23+ ffRecord: v => v1 => ({}),
24+ impliesRecord: v => v1 => v2 => ({}),
25+ notRecord: v => v1 => ({}),
26+ ttRecord: v => v1 => ({})
27+};
28+const heytingAlgebraProxy = {
29+ conj: v => v1 => Type$dProxy.Proxy,
30+ disj: v => v1 => Type$dProxy.Proxy,
31+ implies: v => v1 => Type$dProxy.Proxy,
32+ ff: Type$dProxy.Proxy,
33+ not: v => Type$dProxy.Proxy,
34+ tt: Type$dProxy.Proxy
35+};
36+const ffRecord = dict => dict.ffRecord;
37+const ff = dict => dict.ff;
38+const disjRecord = dict => dict.disjRecord;
39+const disj = dict => dict.disj;
40+const heytingAlgebraBoolean = {ff: false, tt: true, implies: a => b => heytingAlgebraBoolean.disj(heytingAlgebraBoolean.not(a))(b), conj: boolConj, disj: boolDisj, not: boolNot};
41+const conjRecord = dict => dict.conjRecord;
42+const heytingAlgebraRecord = () => dictHeytingAlgebraRecord => (
43+ {
44+ ff: dictHeytingAlgebraRecord.ffRecord(Type$dProxy.Proxy)(Type$dProxy.Proxy),
45+ tt: dictHeytingAlgebraRecord.ttRecord(Type$dProxy.Proxy)(Type$dProxy.Proxy),
46+ conj: dictHeytingAlgebraRecord.conjRecord(Type$dProxy.Proxy),
47+ disj: dictHeytingAlgebraRecord.disjRecord(Type$dProxy.Proxy),
48+ implies: dictHeytingAlgebraRecord.impliesRecord(Type$dProxy.Proxy),
49+ not: dictHeytingAlgebraRecord.notRecord(Type$dProxy.Proxy)
50+ }
51+);
52+const conj = dict => dict.conj;
53+const heytingAlgebraFunction = dictHeytingAlgebra => (
54+ {
55+ ff: v => dictHeytingAlgebra.ff,
56+ tt: v => dictHeytingAlgebra.tt,
57+ implies: f => g => a => dictHeytingAlgebra.implies(f(a))(g(a)),
58+ conj: f => g => a => dictHeytingAlgebra.conj(f(a))(g(a)),
59+ disj: f => g => a => dictHeytingAlgebra.disj(f(a))(g(a)),
60+ not: f => a => dictHeytingAlgebra.not(f(a))
61+ }
62+);
63+const heytingAlgebraRecordCons = dictIsSymbol => () => dictHeytingAlgebraRecord => dictHeytingAlgebra => (
64+ {
65+ conjRecord: v => ra => rb => {
66+ const key = dictIsSymbol.reflectSymbol(Type$dProxy.Proxy);
67+ const $$get = Record$dUnsafe.unsafeGet(key);
68+ return Record$dUnsafe.unsafeSet(key)(dictHeytingAlgebra.conj($$get(ra))($$get(rb)))(dictHeytingAlgebraRecord.conjRecord(Type$dProxy.Proxy)(ra)(rb));
69+ },
70+ disjRecord: v => ra => rb => {
71+ const key = dictIsSymbol.reflectSymbol(Type$dProxy.Proxy);
72+ const $$get = Record$dUnsafe.unsafeGet(key);
73+ return Record$dUnsafe.unsafeSet(key)(dictHeytingAlgebra.disj($$get(ra))($$get(rb)))(dictHeytingAlgebraRecord.disjRecord(Type$dProxy.Proxy)(ra)(rb));
74+ },
75+ impliesRecord: v => ra => rb => {
76+ const key = dictIsSymbol.reflectSymbol(Type$dProxy.Proxy);
77+ const $$get = Record$dUnsafe.unsafeGet(key);
78+ return Record$dUnsafe.unsafeSet(key)(dictHeytingAlgebra.implies($$get(ra))($$get(rb)))(dictHeytingAlgebraRecord.impliesRecord(Type$dProxy.Proxy)(ra)(rb));
79+ },
80+ ffRecord: v => row => Record$dUnsafe.unsafeSet(dictIsSymbol.reflectSymbol(Type$dProxy.Proxy))(dictHeytingAlgebra.ff)(dictHeytingAlgebraRecord.ffRecord(Type$dProxy.Proxy)(row)),
81+ notRecord: v => row => {
82+ const key = dictIsSymbol.reflectSymbol(Type$dProxy.Proxy);
83+ return Record$dUnsafe.unsafeSet(key)(dictHeytingAlgebra.not(Record$dUnsafe.unsafeGet(key)(row)))(dictHeytingAlgebraRecord.notRecord(Type$dProxy.Proxy)(row));
84+ },
85+ ttRecord: v => row => Record$dUnsafe.unsafeSet(dictIsSymbol.reflectSymbol(Type$dProxy.Proxy))(dictHeytingAlgebra.tt)(dictHeytingAlgebraRecord.ttRecord(Type$dProxy.Proxy)(row))
86+ }
87+);
88+export {
89+ conj,
90+ conjRecord,
91+ disj,
92+ disjRecord,
93+ ff,
94+ ffRecord,
95+ heytingAlgebraBoolean,
96+ heytingAlgebraFunction,
97+ heytingAlgebraProxy,
98+ heytingAlgebraRecord,
99+ heytingAlgebraRecordCons,
100+ heytingAlgebraRecordNil,
101+ heytingAlgebraUnit,
102+ implies,
103+ impliesRecord,
104+ not,
105+ notRecord,
106+ tt,
107+ ttRecord
108+};
109+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Identity/index.jsnew file+55
@@ -0,0 +1,55 @@
1+import * as $runtime from "../runtime.js";
2+const Identity = x => x;
3+const showIdentity = dictShow => ({show: v => "(Identity " + (dictShow.show(v) + ")")});
4+const semiringIdentity = dictSemiring => dictSemiring;
5+const semigroupIdentity = dictSemigroup => dictSemigroup;
6+const ringIdentity = dictRing => dictRing;
7+const ordIdentity = dictOrd => dictOrd;
8+const newtypeIdentity = {Coercible0: () => undefined};
9+const monoidIdentity = dictMonoid => dictMonoid;
10+const lazyIdentity = dictLazy => dictLazy;
11+const heytingAlgebraIdentity = dictHeytingAlgebra => dictHeytingAlgebra;
12+const functorIdentity = {map: f => m => f(m)};
13+const invariantIdentity = {imap: f => v => m => f(m)};
14+const extendIdentity = {extend: f => m => f(m), Functor0: () => functorIdentity};
15+const euclideanRingIdentity = dictEuclideanRing => dictEuclideanRing;
16+const eqIdentity = dictEq => dictEq;
17+const eq1Identity = {eq1: dictEq => dictEq.eq};
18+const ord1Identity = {compare1: dictOrd => dictOrd.compare, Eq10: () => eq1Identity};
19+const comonadIdentity = {extract: v => v, Extend0: () => extendIdentity};
20+const commutativeRingIdentity = dictCommutativeRing => dictCommutativeRing;
21+const boundedIdentity = dictBounded => dictBounded;
22+const booleanAlgebraIdentity = dictBooleanAlgebra => dictBooleanAlgebra;
23+const applyIdentity = {apply: v => v1 => v(v1), Functor0: () => functorIdentity};
24+const bindIdentity = {bind: v => f => f(v), Apply0: () => applyIdentity};
25+const applicativeIdentity = {pure: Identity, Apply0: () => applyIdentity};
26+const monadIdentity = {Applicative0: () => applicativeIdentity, Bind1: () => bindIdentity};
27+const altIdentity = {alt: x => v => x, Functor0: () => functorIdentity};
28+export {
29+ Identity,
30+ altIdentity,
31+ applicativeIdentity,
32+ applyIdentity,
33+ bindIdentity,
34+ booleanAlgebraIdentity,
35+ boundedIdentity,
36+ commutativeRingIdentity,
37+ comonadIdentity,
38+ eq1Identity,
39+ eqIdentity,
40+ euclideanRingIdentity,
41+ extendIdentity,
42+ functorIdentity,
43+ heytingAlgebraIdentity,
44+ invariantIdentity,
45+ lazyIdentity,
46+ monadIdentity,
47+ monoidIdentity,
48+ newtypeIdentity,
49+ ord1Identity,
50+ ordIdentity,
51+ ringIdentity,
52+ semigroupIdentity,
53+ semiringIdentity,
54+ showIdentity
55+};
.storybook/purescript-indexer/output-es/Data.Int.Bits/foreign.jsnew file+48
@@ -0,0 +1,48 @@
1+// module Data.Int.Bits
2+
3+export const and = function (n1) {
4+ return function (n2) {
5+ /* jshint bitwise: false */
6+ return n1 & n2;
7+ };
8+};
9+
10+export const or = function (n1) {
11+ return function (n2) {
12+ /* jshint bitwise: false */
13+ return n1 | n2;
14+ };
15+};
16+
17+export const xor = function (n1) {
18+ return function (n2) {
19+ /* jshint bitwise: false */
20+ return n1 ^ n2;
21+ };
22+};
23+
24+export const shl = function (n1) {
25+ return function (n2) {
26+ /* jshint bitwise: false */
27+ return n1 << n2;
28+ };
29+};
30+
31+export const shr = function (n1) {
32+ return function (n2) {
33+ /* jshint bitwise: false */
34+ return n1 >> n2;
35+ };
36+};
37+
38+export const zshr = function (n1) {
39+ return function (n2) {
40+ /* jshint bitwise: false */
41+ return n1 >>> n2;
42+ };
43+};
44+
45+export const complement = function (n) {
46+ /* jshint bitwise: false */
47+ return ~n;
48+};
.storybook/purescript-indexer/output-es/Data.Int.Bits/index.jsnew file+5
@@ -0,0 +1,5 @@
1+// | This module defines bitwise operations for the `Int` type.
2+import * as $runtime from "../runtime.js";
3+import {and, complement, or, shl, shr, xor, zshr} from "./foreign.js";
4+export {};
5+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Int/foreign.jsnew file+65
@@ -0,0 +1,65 @@
1+export const fromNumberImpl = function (just) {
2+ return function (nothing) {
3+ return function (n) {
4+ /* jshint bitwise: false */
5+ return (n | 0) === n ? just(n) : nothing;
6+ };
7+ };
8+};
9+
10+export const toNumber = function (n) {
11+ return n;
12+};
13+
14+export const fromStringAsImpl = function (just) {
15+ return function (nothing) {
16+ return function (radix) {
17+ var digits;
18+ if (radix < 11) {
19+ digits = "[0-" + (radix - 1).toString() + "]";
20+ } else if (radix === 11) {
21+ digits = "[0-9a]";
22+ } else {
23+ digits = "[0-9a-" + String.fromCharCode(86 + radix) + "]";
24+ }
25+ var pattern = new RegExp("^[\\+\\-]?" + digits + "+$", "i");
26+
27+ return function (s) {
28+ /* jshint bitwise: false */
29+ if (pattern.test(s)) {
30+ var i = parseInt(s, radix);
31+ return (i | 0) === i ? just(i) : nothing;
32+ } else {
33+ return nothing;
34+ }
35+ };
36+ };
37+ };
38+};
39+
40+export const toStringAs = function (radix) {
41+ return function (i) {
42+ return i.toString(radix);
43+ };
44+};
45+
46+
47+export const quot = function (x) {
48+ return function (y) {
49+ /* jshint bitwise: false */
50+ return x / y | 0;
51+ };
52+};
53+
54+export const rem = function (x) {
55+ return function (y) {
56+ return x % y;
57+ };
58+};
59+
60+export const pow = function (x) {
61+ return function (y) {
62+ /* jshint bitwise: false */
63+ return Math.pow(x,y) | 0;
64+ };
65+};
.storybook/purescript-indexer/output-es/Data.Int/index.jsnew file+137
@@ -0,0 +1,137 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dMaybe from "../Data.Maybe/index.js";
3+import * as Data$dNumber from "../Data.Number/index.js";
4+import * as Data$dOrdering from "../Data.Ordering/index.js";
5+import {fromNumberImpl, fromStringAsImpl, pow, quot, rem, toNumber, toStringAs} from "./foreign.js";
6+const $Parity = tag => ({tag});
7+const Even = /* #__PURE__ */ $Parity("Even");
8+const Odd = /* #__PURE__ */ $Parity("Odd");
9+const showParity = {
10+ show: v => {
11+ if (v.tag === "Even") { return "Even"; }
12+ if (v.tag === "Odd") { return "Odd"; }
13+ $runtime.fail();
14+ }
15+};
16+const radix = n => {
17+ if (n >= 2 && n <= 36) { return Data$dMaybe.$Maybe("Just", n); }
18+ return Data$dMaybe.Nothing;
19+};
20+const odd = x => (x & 1) !== 0;
21+const octal = 8;
22+const hexadecimal = 16;
23+const fromStringAs = /* #__PURE__ */ fromStringAsImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
24+const fromString = /* #__PURE__ */ fromStringAs(10);
25+const fromNumber = /* #__PURE__ */ fromNumberImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
26+const unsafeClamp = x => {
27+ if (!Data$dNumber.isFinite(x)) { return 0; }
28+ if (x >= toNumber(2147483647)) { return 2147483647; }
29+ if (x <= toNumber(-2147483648)) { return -2147483648; }
30+ const $1 = fromNumber(x);
31+ if ($1.tag === "Nothing") { return 0; }
32+ if ($1.tag === "Just") { return $1._1; }
33+ $runtime.fail();
34+};
35+const round = x => unsafeClamp(Data$dNumber.round(x));
36+const trunc = x => unsafeClamp(Data$dNumber.trunc(x));
37+const floor = x => unsafeClamp(Data$dNumber.floor(x));
38+const even = x => (x & 1) === 0;
39+const parity = n => {
40+ if ((n & 1) === 0) { return Even; }
41+ return Odd;
42+};
43+const eqParity = {
44+ eq: x => y => {
45+ if (x.tag === "Even") { return y.tag === "Even"; }
46+ if (x.tag === "Odd") { return y.tag === "Odd"; }
47+ return false;
48+ }
49+};
50+const ordParity = {
51+ compare: x => y => {
52+ if (x.tag === "Even") {
53+ if (y.tag === "Even") { return Data$dOrdering.EQ; }
54+ return Data$dOrdering.LT;
55+ }
56+ if (y.tag === "Even") { return Data$dOrdering.GT; }
57+ if (x.tag === "Odd") {
58+ if (y.tag === "Odd") { return Data$dOrdering.EQ; }
59+ $runtime.fail();
60+ }
61+ $runtime.fail();
62+ },
63+ Eq0: () => eqParity
64+};
65+const semiringParity = {
66+ zero: Even,
67+ add: x => y => {
68+ if (
69+ (() => {
70+ if (x.tag === "Even") { return y.tag === "Even"; }
71+ if (x.tag === "Odd") { return y.tag === "Odd"; }
72+ return false;
73+ })()
74+ ) {
75+ return Even;
76+ }
77+ return Odd;
78+ },
79+ one: Odd,
80+ mul: v => v1 => {
81+ if (v.tag === "Odd") {
82+ if (v1.tag === "Odd") { return Odd; }
83+ return Even;
84+ }
85+ return Even;
86+ }
87+};
88+const ringParity = /* #__PURE__ */ (() => ({sub: semiringParity.add, Semiring0: () => semiringParity}))();
89+const divisionRingParity = {recip: x => x, Ring0: () => ringParity};
90+const decimal = 10;
91+const commutativeRingParity = {Ring0: () => ringParity};
92+const euclideanRingParity = {
93+ degree: v => {
94+ if (v.tag === "Even") { return 0; }
95+ if (v.tag === "Odd") { return 1; }
96+ $runtime.fail();
97+ },
98+ div: x => v => x,
99+ mod: v => v1 => Even,
100+ CommutativeRing0: () => commutativeRingParity
101+};
102+const ceil = x => unsafeClamp(Data$dNumber.ceil(x));
103+const boundedParity = {bottom: Even, top: Odd, Ord0: () => ordParity};
104+const binary = 2;
105+const base36 = 36;
106+export {
107+ $Parity,
108+ Even,
109+ Odd,
110+ base36,
111+ binary,
112+ boundedParity,
113+ ceil,
114+ commutativeRingParity,
115+ decimal,
116+ divisionRingParity,
117+ eqParity,
118+ euclideanRingParity,
119+ even,
120+ floor,
121+ fromNumber,
122+ fromString,
123+ fromStringAs,
124+ hexadecimal,
125+ octal,
126+ odd,
127+ ordParity,
128+ parity,
129+ radix,
130+ ringParity,
131+ round,
132+ semiringParity,
133+ showParity,
134+ trunc,
135+ unsafeClamp
136+};
137+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Interval.Duration.Iso/index.jsnew file+203
@@ -0,0 +1,203 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEither from "../Data.Either/index.js";
3+import * as Data$dFoldable from "../Data.Foldable/index.js";
4+import * as Data$dInterval$dDuration from "../Data.Interval.Duration/index.js";
5+import * as Data$dList from "../Data.List/index.js";
6+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
7+import * as Data$dMap$dInternal from "../Data.Map.Internal/index.js";
8+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
9+import * as Data$dNumber from "../Data.Number/index.js";
10+import * as Data$dOrdering from "../Data.Ordering/index.js";
11+const $Error = (tag, _1) => ({tag, _1});
12+const foldMap1 = /* #__PURE__ */ (() => Data$dList$dTypes.foldableList.foldMap(Data$dList$dTypes.monoidList))();
13+const foldMap2 = /* #__PURE__ */ (() => Data$dList$dTypes.foldableList.foldMap((() => {
14+ const semigroupAdditive1 = {append: v => v1 => v + v1};
15+ return {mempty: 0.0, Semigroup0: () => semigroupAdditive1};
16+})()))();
17+const fold = /* #__PURE__ */ (() => Data$dFoldable.foldableArray.foldMap((() => {
18+ const semigroupFn = {append: f => g => x => Data$dList$dTypes.foldableList.foldr(Data$dList$dTypes.Cons)(g(x))(f(x))};
19+ return {mempty: v => Data$dList$dTypes.Nil, Semigroup0: () => semigroupFn};
20+})())(Data$dFoldable.identity))();
21+const IsEmpty = /* #__PURE__ */ $Error("IsEmpty");
22+const InvalidWeekComponentUsage = /* #__PURE__ */ $Error("InvalidWeekComponentUsage");
23+const ContainsNegativeValue = value0 => $Error("ContainsNegativeValue", value0);
24+const InvalidFractionalUse = value0 => $Error("InvalidFractionalUse", value0);
25+const unIsoDuration = v => v;
26+const showIsoDuration = {show: v => "(IsoDuration (Duration " + Data$dInterval$dDuration.show(v) + "))"};
27+const showError = {
28+ show: v => {
29+ if (v.tag === "IsEmpty") { return "(IsEmpty)"; }
30+ if (v.tag === "InvalidWeekComponentUsage") { return "(InvalidWeekComponentUsage)"; }
31+ if (v.tag === "ContainsNegativeValue") {
32+ if (v._1.tag === "Minute") { return "(ContainsNegativeValue Minute)"; }
33+ if (v._1.tag === "Second") { return "(ContainsNegativeValue Second)"; }
34+ if (v._1.tag === "Hour") { return "(ContainsNegativeValue Hour)"; }
35+ if (v._1.tag === "Day") { return "(ContainsNegativeValue Day)"; }
36+ if (v._1.tag === "Week") { return "(ContainsNegativeValue Week)"; }
37+ if (v._1.tag === "Month") { return "(ContainsNegativeValue Month)"; }
38+ if (v._1.tag === "Year") { return "(ContainsNegativeValue Year)"; }
39+ $runtime.fail();
40+ }
41+ if (v.tag === "InvalidFractionalUse") {
42+ if (v._1.tag === "Minute") { return "(InvalidFractionalUse Minute)"; }
43+ if (v._1.tag === "Second") { return "(InvalidFractionalUse Second)"; }
44+ if (v._1.tag === "Hour") { return "(InvalidFractionalUse Hour)"; }
45+ if (v._1.tag === "Day") { return "(InvalidFractionalUse Day)"; }
46+ if (v._1.tag === "Week") { return "(InvalidFractionalUse Week)"; }
47+ if (v._1.tag === "Month") { return "(InvalidFractionalUse Month)"; }
48+ if (v._1.tag === "Year") { return "(InvalidFractionalUse Year)"; }
49+ $runtime.fail();
50+ }
51+ $runtime.fail();
52+ }
53+};
54+const prettyError = v => {
55+ if (v.tag === "IsEmpty") { return "Duration is empty (has no components)"; }
56+ if (v.tag === "InvalidWeekComponentUsage") { return "Week component of Duration is used with other components"; }
57+ if (v.tag === "ContainsNegativeValue") {
58+ if (v._1.tag === "Minute") { return "Component `Minute` contains negative value"; }
59+ if (v._1.tag === "Second") { return "Component `Second` contains negative value"; }
60+ if (v._1.tag === "Hour") { return "Component `Hour` contains negative value"; }
61+ if (v._1.tag === "Day") { return "Component `Day` contains negative value"; }
62+ if (v._1.tag === "Week") { return "Component `Week` contains negative value"; }
63+ if (v._1.tag === "Month") { return "Component `Month` contains negative value"; }
64+ if (v._1.tag === "Year") { return "Component `Year` contains negative value"; }
65+ $runtime.fail();
66+ }
67+ if (v.tag === "InvalidFractionalUse") {
68+ if (v._1.tag === "Minute") { return "Invalid usage of Fractional value at component `Minute`"; }
69+ if (v._1.tag === "Second") { return "Invalid usage of Fractional value at component `Second`"; }
70+ if (v._1.tag === "Hour") { return "Invalid usage of Fractional value at component `Hour`"; }
71+ if (v._1.tag === "Day") { return "Invalid usage of Fractional value at component `Day`"; }
72+ if (v._1.tag === "Week") { return "Invalid usage of Fractional value at component `Week`"; }
73+ if (v._1.tag === "Month") { return "Invalid usage of Fractional value at component `Month`"; }
74+ if (v._1.tag === "Year") { return "Invalid usage of Fractional value at component `Year`"; }
75+ $runtime.fail();
76+ }
77+ $runtime.fail();
78+};
79+const eqIsoDuration = {eq: x => y => Data$dInterval$dDuration.eq(x)(y)};
80+const ordIsoDuration = {compare: x => y => Data$dInterval$dDuration.compare(x)(y), Eq0: () => eqIsoDuration};
81+const eqError = {
82+ eq: x => y => {
83+ if (x.tag === "IsEmpty") { return y.tag === "IsEmpty"; }
84+ if (x.tag === "InvalidWeekComponentUsage") { return y.tag === "InvalidWeekComponentUsage"; }
85+ if (x.tag === "ContainsNegativeValue") {
86+ if (y.tag === "ContainsNegativeValue") {
87+ if (x._1.tag === "Second") { return y._1.tag === "Second"; }
88+ if (x._1.tag === "Minute") { return y._1.tag === "Minute"; }
89+ if (x._1.tag === "Hour") { return y._1.tag === "Hour"; }
90+ if (x._1.tag === "Day") { return y._1.tag === "Day"; }
91+ if (x._1.tag === "Week") { return y._1.tag === "Week"; }
92+ if (x._1.tag === "Month") { return y._1.tag === "Month"; }
93+ if (x._1.tag === "Year") { return y._1.tag === "Year"; }
94+ return false;
95+ }
96+ return false;
97+ }
98+ if (x.tag === "InvalidFractionalUse") {
99+ if (y.tag === "InvalidFractionalUse") {
100+ if (x._1.tag === "Second") { return y._1.tag === "Second"; }
101+ if (x._1.tag === "Minute") { return y._1.tag === "Minute"; }
102+ if (x._1.tag === "Hour") { return y._1.tag === "Hour"; }
103+ if (x._1.tag === "Day") { return y._1.tag === "Day"; }
104+ if (x._1.tag === "Week") { return y._1.tag === "Week"; }
105+ if (x._1.tag === "Month") { return y._1.tag === "Month"; }
106+ if (x._1.tag === "Year") { return y._1.tag === "Year"; }
107+ return false;
108+ }
109+ return false;
110+ }
111+ return false;
112+ }
113+};
114+const ordError = {
115+ compare: x => y => {
116+ if (x.tag === "IsEmpty") {
117+ if (y.tag === "IsEmpty") { return Data$dOrdering.EQ; }
118+ return Data$dOrdering.LT;
119+ }
120+ if (y.tag === "IsEmpty") { return Data$dOrdering.GT; }
121+ if (x.tag === "InvalidWeekComponentUsage") {
122+ if (y.tag === "InvalidWeekComponentUsage") { return Data$dOrdering.EQ; }
123+ return Data$dOrdering.LT;
124+ }
125+ if (y.tag === "InvalidWeekComponentUsage") { return Data$dOrdering.GT; }
126+ if (x.tag === "ContainsNegativeValue") {
127+ if (y.tag === "ContainsNegativeValue") { return Data$dInterval$dDuration.ordDurationComponent.compare(x._1)(y._1); }
128+ return Data$dOrdering.LT;
129+ }
130+ if (y.tag === "ContainsNegativeValue") { return Data$dOrdering.GT; }
131+ if (x.tag === "InvalidFractionalUse") {
132+ if (y.tag === "InvalidFractionalUse") { return Data$dInterval$dDuration.ordDurationComponent.compare(x._1)(y._1); }
133+ $runtime.fail();
134+ }
135+ $runtime.fail();
136+ },
137+ Eq0: () => eqError
138+};
139+const checkWeekUsage = v => {
140+ if (
141+ (() => {
142+ const $1 = Data$dMap$dInternal.lookup(Data$dInterval$dDuration.ordDurationComponent)(Data$dInterval$dDuration.Week)(v.asMap);
143+ return (() => {
144+ if ($1.tag === "Nothing") { return false; }
145+ if ($1.tag === "Just") { return true; }
146+ $runtime.fail();
147+ })() && Data$dMap$dInternal.size(v.asMap) > 1;
148+ })()
149+ ) {
150+ return Data$dList$dTypes.$List("Cons", InvalidWeekComponentUsage, Data$dList$dTypes.Nil);
151+ }
152+ return Data$dList$dTypes.Nil;
153+};
154+const checkNegativeValues = v => foldMap1(v1 => {
155+ if (v1._2 >= 0.0) { return Data$dList$dTypes.Nil; }
156+ return Data$dList$dTypes.$List("Cons", $Error("ContainsNegativeValue", v1._1), Data$dList$dTypes.Nil);
157+})(v.asList);
158+const checkFractionalUse = v => {
159+ const v1 = Data$dList.span(x => Data$dNumber.floor(x._2) === x._2)(v.asList).rest;
160+ if (v1.tag === "Cons") {
161+ if (foldMap2(x => Data$dNumber.abs(x._2))(v1._2) > 0.0) { return Data$dList$dTypes.$List("Cons", $Error("InvalidFractionalUse", v1._1._1), Data$dList$dTypes.Nil); }
162+ return Data$dList$dTypes.Nil;
163+ }
164+ return Data$dList$dTypes.Nil;
165+};
166+const checkEmptiness = v => {
167+ if (v.asList.tag === "Nil") { return Data$dList$dTypes.$List("Cons", IsEmpty, Data$dList$dTypes.Nil); }
168+ return Data$dList$dTypes.Nil;
169+};
170+const checkValidIsoDuration = v => fold([checkWeekUsage, checkEmptiness, checkFractionalUse, checkNegativeValues])({
171+ asList: Data$dList.reverse(Data$dMap$dInternal.toUnfoldable(Data$dList$dTypes.unfoldableList)(v)),
172+ asMap: v
173+});
174+const mkIsoDuration = d => {
175+ const $1 = checkValidIsoDuration(d);
176+ if ($1.tag === "Nil") { return Data$dEither.$Either("Right", d); }
177+ if ($1.tag === "Cons") { return Data$dEither.$Either("Left", Data$dNonEmpty.$NonEmpty($1._1, $1._2)); }
178+ $runtime.fail();
179+};
180+export {
181+ $Error,
182+ ContainsNegativeValue,
183+ InvalidFractionalUse,
184+ InvalidWeekComponentUsage,
185+ IsEmpty,
186+ checkEmptiness,
187+ checkFractionalUse,
188+ checkNegativeValues,
189+ checkValidIsoDuration,
190+ checkWeekUsage,
191+ eqError,
192+ eqIsoDuration,
193+ fold,
194+ foldMap1,
195+ foldMap2,
196+ mkIsoDuration,
197+ ordError,
198+ ordIsoDuration,
199+ prettyError,
200+ showError,
201+ showIsoDuration,
202+ unIsoDuration
203+};
.storybook/purescript-indexer/output-es/Data.Interval.Duration/index.jsnew file+130
@@ -0,0 +1,130 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dEq from "../Data.Eq/index.js";
3+import * as Data$dMap$dInternal from "../Data.Map.Internal/index.js";
4+import * as Data$dOrd from "../Data.Ord/index.js";
5+import * as Data$dOrdering from "../Data.Ordering/index.js";
6+import * as Data$dSemiring from "../Data.Semiring/index.js";
7+import * as Data$dShow from "../Data.Show/index.js";
8+const $DurationComponent = tag => ({tag});
9+const Second = /* #__PURE__ */ $DurationComponent("Second");
10+const Minute = /* #__PURE__ */ $DurationComponent("Minute");
11+const Hour = /* #__PURE__ */ $DurationComponent("Hour");
12+const Day = /* #__PURE__ */ $DurationComponent("Day");
13+const Week = /* #__PURE__ */ $DurationComponent("Week");
14+const Month = /* #__PURE__ */ $DurationComponent("Month");
15+const Year = /* #__PURE__ */ $DurationComponent("Year");
16+const Duration = x => x;
17+const showDurationComponent = {
18+ show: v => {
19+ if (v.tag === "Minute") { return "Minute"; }
20+ if (v.tag === "Second") { return "Second"; }
21+ if (v.tag === "Hour") { return "Hour"; }
22+ if (v.tag === "Day") { return "Day"; }
23+ if (v.tag === "Week") { return "Week"; }
24+ if (v.tag === "Month") { return "Month"; }
25+ if (v.tag === "Year") { return "Year"; }
26+ $runtime.fail();
27+ }
28+};
29+const show = /* #__PURE__ */ (() => Data$dMap$dInternal.showMap(showDurationComponent)(Data$dShow.showNumber).show)();
30+const showDuration = {show: v => "(Duration " + (show(v) + ")")};
31+const newtypeDuration = {Coercible0: () => undefined};
32+const eqDurationComponent = {
33+ eq: x => y => {
34+ if (x.tag === "Second") { return y.tag === "Second"; }
35+ if (x.tag === "Minute") { return y.tag === "Minute"; }
36+ if (x.tag === "Hour") { return y.tag === "Hour"; }
37+ if (x.tag === "Day") { return y.tag === "Day"; }
38+ if (x.tag === "Week") { return y.tag === "Week"; }
39+ if (x.tag === "Month") { return y.tag === "Month"; }
40+ if (x.tag === "Year") { return y.tag === "Year"; }
41+ return false;
42+ }
43+};
44+const eq = /* #__PURE__ */ (() => Data$dMap$dInternal.eqMap(eqDurationComponent)(Data$dEq.eqNumber).eq)();
45+const ordDurationComponent = {
46+ compare: x => y => {
47+ if (x.tag === "Second") {
48+ if (y.tag === "Second") { return Data$dOrdering.EQ; }
49+ return Data$dOrdering.LT;
50+ }
51+ if (y.tag === "Second") { return Data$dOrdering.GT; }
52+ if (x.tag === "Minute") {
53+ if (y.tag === "Minute") { return Data$dOrdering.EQ; }
54+ return Data$dOrdering.LT;
55+ }
56+ if (y.tag === "Minute") { return Data$dOrdering.GT; }
57+ if (x.tag === "Hour") {
58+ if (y.tag === "Hour") { return Data$dOrdering.EQ; }
59+ return Data$dOrdering.LT;
60+ }
61+ if (y.tag === "Hour") { return Data$dOrdering.GT; }
62+ if (x.tag === "Day") {
63+ if (y.tag === "Day") { return Data$dOrdering.EQ; }
64+ return Data$dOrdering.LT;
65+ }
66+ if (y.tag === "Day") { return Data$dOrdering.GT; }
67+ if (x.tag === "Week") {
68+ if (y.tag === "Week") { return Data$dOrdering.EQ; }
69+ return Data$dOrdering.LT;
70+ }
71+ if (y.tag === "Week") { return Data$dOrdering.GT; }
72+ if (x.tag === "Month") {
73+ if (y.tag === "Month") { return Data$dOrdering.EQ; }
74+ return Data$dOrdering.LT;
75+ }
76+ if (y.tag === "Month") { return Data$dOrdering.GT; }
77+ if (x.tag === "Year") {
78+ if (y.tag === "Year") { return Data$dOrdering.EQ; }
79+ $runtime.fail();
80+ }
81+ $runtime.fail();
82+ },
83+ Eq0: () => eqDurationComponent
84+};
85+const compare = /* #__PURE__ */ (() => Data$dMap$dInternal.ordMap(ordDurationComponent)(Data$dOrd.ordNumber).compare)();
86+const semigroupDuration = {append: v => v1 => Data$dMap$dInternal.unionWith(ordDurationComponent)(Data$dSemiring.numAdd)(v)(v1)};
87+const monoidDuration = {mempty: Data$dMap$dInternal.Leaf, Semigroup0: () => semigroupDuration};
88+const eqDuration = {eq: x => y => eq(x)(y)};
89+const ordDuration = {compare: x => y => compare(x)(y), Eq0: () => eqDuration};
90+const durationFromComponent = k => v => Data$dMap$dInternal.$Map("Two", Data$dMap$dInternal.Leaf, k, v, Data$dMap$dInternal.Leaf);
91+const hour = /* #__PURE__ */ durationFromComponent(Hour);
92+const millisecond = x => Data$dMap$dInternal.$Map("Two", Data$dMap$dInternal.Leaf, Second, x / 1000.0, Data$dMap$dInternal.Leaf);
93+const minute = /* #__PURE__ */ durationFromComponent(Minute);
94+const month = /* #__PURE__ */ durationFromComponent(Month);
95+const second = /* #__PURE__ */ durationFromComponent(Second);
96+const week = /* #__PURE__ */ durationFromComponent(Week);
97+const year = /* #__PURE__ */ durationFromComponent(Year);
98+const day = /* #__PURE__ */ durationFromComponent(Day);
99+export {
100+ $DurationComponent,
101+ Day,
102+ Duration,
103+ Hour,
104+ Minute,
105+ Month,
106+ Second,
107+ Week,
108+ Year,
109+ compare,
110+ day,
111+ durationFromComponent,
112+ eq,
113+ eqDuration,
114+ eqDurationComponent,
115+ hour,
116+ millisecond,
117+ minute,
118+ monoidDuration,
119+ month,
120+ newtypeDuration,
121+ ordDuration,
122+ ordDurationComponent,
123+ second,
124+ semigroupDuration,
125+ show,
126+ showDuration,
127+ showDurationComponent,
128+ week,
129+ year
130+};
.storybook/purescript-indexer/output-es/Data.Interval/index.jsnew file+313
@@ -0,0 +1,313 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dBifoldable from "../Data.Bifoldable/index.js";
3+import * as Data$dBitraversable from "../Data.Bitraversable/index.js";
4+import * as Data$dFoldable from "../Data.Foldable/index.js";
5+import * as Data$dMaybe from "../Data.Maybe/index.js";
6+import * as Data$dOrd from "../Data.Ord/index.js";
7+import * as Data$dOrdering from "../Data.Ordering/index.js";
8+import * as Data$dShow from "../Data.Show/index.js";
9+import * as Data$dTraversable from "../Data.Traversable/index.js";
10+const $Interval = (tag, _1, _2) => ({tag, _1, _2});
11+const $RecurringInterval = (_1, _2) => ({tag: "RecurringInterval", _1, _2});
12+const show = v => {
13+ if (v.tag === "Just") { return "(Just " + (Data$dShow.showIntImpl(v._1) + ")"); }
14+ if (v.tag === "Nothing") { return "Nothing"; }
15+ $runtime.fail();
16+};
17+const compare = /* #__PURE__ */ (() => Data$dMaybe.ordMaybe(Data$dOrd.ordInt).compare)();
18+const StartEnd = value0 => value1 => $Interval("StartEnd", value0, value1);
19+const DurationEnd = value0 => value1 => $Interval("DurationEnd", value0, value1);
20+const StartDuration = value0 => value1 => $Interval("StartDuration", value0, value1);
21+const DurationOnly = value0 => $Interval("DurationOnly", value0);
22+const RecurringInterval = value0 => value1 => $RecurringInterval(value0, value1);
23+const showInterval = dictShow => dictShow1 => (
24+ {
25+ show: v => {
26+ if (v.tag === "StartEnd") { return "(StartEnd " + (dictShow1.show(v._1) + (" " + (dictShow1.show(v._2) + ")"))); }
27+ if (v.tag === "DurationEnd") { return "(DurationEnd " + (dictShow.show(v._1) + (" " + (dictShow1.show(v._2) + ")"))); }
28+ if (v.tag === "StartDuration") { return "(StartDuration " + (dictShow1.show(v._1) + (" " + (dictShow.show(v._2) + ")"))); }
29+ if (v.tag === "DurationOnly") { return "(DurationOnly " + (dictShow.show(v._1) + ")"); }
30+ $runtime.fail();
31+ }
32+ }
33+);
34+const showRecurringInterval = dictShow => dictShow1 => {
35+ const show1 = showInterval(dictShow)(dictShow1).show;
36+ return {show: v => "(RecurringInterval " + (show(v._1) + (" " + (show1(v._2) + ")")))};
37+};
38+const over = dictFunctor => f => v => dictFunctor.map(RecurringInterval(v._1))(f(v._2));
39+const foldableInterval = {
40+ foldl: v => v1 => v2 => {
41+ if (v2.tag === "StartEnd") { return v(v(v1)(v2._1))(v2._2); }
42+ if (v2.tag === "DurationEnd") { return v(v1)(v2._2); }
43+ if (v2.tag === "StartDuration") { return v(v1)(v2._1); }
44+ return v1;
45+ },
46+ foldr: x => Data$dFoldable.foldrDefault(foldableInterval)(x),
47+ foldMap: dictMonoid => {
48+ const append = dictMonoid.Semigroup0().append;
49+ return f => foldableInterval.foldl(acc => x => append(acc)(f(x)))(dictMonoid.mempty);
50+ }
51+};
52+const foldableRecurringInterval = {
53+ foldl: f => i => x => {
54+ if (x._2.tag === "StartEnd") { return f(f(i)(x._2._1))(x._2._2); }
55+ if (x._2.tag === "DurationEnd") { return f(i)(x._2._2); }
56+ if (x._2.tag === "StartDuration") { return f(i)(x._2._1); }
57+ return i;
58+ },
59+ foldr: f => i => {
60+ const $2 = Data$dFoldable.foldrDefault(foldableInterval)(f)(i);
61+ return x => $2(x._2);
62+ },
63+ foldMap: dictMonoid => {
64+ const append = dictMonoid.Semigroup0().append;
65+ return f => foldableRecurringInterval.foldl(acc => x => append(acc)(f(x)))(dictMonoid.mempty);
66+ }
67+};
68+const eqInterval = dictEq => dictEq1 => (
69+ {
70+ eq: x => y => {
71+ if (x.tag === "StartEnd") {
72+ if (y.tag === "StartEnd") { return dictEq1.eq(x._1)(y._1) && dictEq1.eq(x._2)(y._2); }
73+ return false;
74+ }
75+ if (x.tag === "DurationEnd") {
76+ if (y.tag === "DurationEnd") { return dictEq.eq(x._1)(y._1) && dictEq1.eq(x._2)(y._2); }
77+ return false;
78+ }
79+ if (x.tag === "StartDuration") {
80+ if (y.tag === "StartDuration") { return dictEq1.eq(x._1)(y._1) && dictEq.eq(x._2)(y._2); }
81+ return false;
82+ }
83+ if (x.tag === "DurationOnly") {
84+ if (y.tag === "DurationOnly") { return dictEq.eq(x._1)(y._1); }
85+ return false;
86+ }
87+ return false;
88+ }
89+ }
90+);
91+const eqRecurringInterval = dictEq => dictEq1 => {
92+ const eq1 = eqInterval(dictEq)(dictEq1).eq;
93+ return {
94+ eq: x => y => (() => {
95+ if (x._1.tag === "Nothing") { return y._1.tag === "Nothing"; }
96+ if (x._1.tag === "Just") {
97+ if (y._1.tag === "Just") { return x._1._1 === y._1._1; }
98+ return false;
99+ }
100+ return false;
101+ })() && eq1(x._2)(y._2)
102+ };
103+};
104+const ordInterval = dictOrd => {
105+ const eqInterval1 = eqInterval(dictOrd.Eq0());
106+ return dictOrd1 => {
107+ const eqInterval2 = eqInterval1(dictOrd1.Eq0());
108+ return {
109+ compare: x => y => {
110+ if (x.tag === "StartEnd") {
111+ if (y.tag === "StartEnd") {
112+ const v = dictOrd1.compare(x._1)(y._1);
113+ if (v.tag === "LT") { return Data$dOrdering.LT; }
114+ if (v.tag === "GT") { return Data$dOrdering.GT; }
115+ return dictOrd1.compare(x._2)(y._2);
116+ }
117+ return Data$dOrdering.LT;
118+ }
119+ if (y.tag === "StartEnd") { return Data$dOrdering.GT; }
120+ if (x.tag === "DurationEnd") {
121+ if (y.tag === "DurationEnd") {
122+ const v = dictOrd.compare(x._1)(y._1);
123+ if (v.tag === "LT") { return Data$dOrdering.LT; }
124+ if (v.tag === "GT") { return Data$dOrdering.GT; }
125+ return dictOrd1.compare(x._2)(y._2);
126+ }
127+ return Data$dOrdering.LT;
128+ }
129+ if (y.tag === "DurationEnd") { return Data$dOrdering.GT; }
130+ if (x.tag === "StartDuration") {
131+ if (y.tag === "StartDuration") {
132+ const v = dictOrd1.compare(x._1)(y._1);
133+ if (v.tag === "LT") { return Data$dOrdering.LT; }
134+ if (v.tag === "GT") { return Data$dOrdering.GT; }
135+ return dictOrd.compare(x._2)(y._2);
136+ }
137+ return Data$dOrdering.LT;
138+ }
139+ if (y.tag === "StartDuration") { return Data$dOrdering.GT; }
140+ if (x.tag === "DurationOnly") {
141+ if (y.tag === "DurationOnly") { return dictOrd.compare(x._1)(y._1); }
142+ $runtime.fail();
143+ }
144+ $runtime.fail();
145+ },
146+ Eq0: () => eqInterval2
147+ };
148+ };
149+};
150+const ordRecurringInterval = dictOrd => {
151+ const ordInterval1 = ordInterval(dictOrd);
152+ const eqRecurringInterval1 = eqRecurringInterval(dictOrd.Eq0());
153+ return dictOrd1 => {
154+ const compare1 = ordInterval1(dictOrd1).compare;
155+ const eqRecurringInterval2 = eqRecurringInterval1(dictOrd1.Eq0());
156+ return {
157+ compare: x => y => {
158+ const v = compare(x._1)(y._1);
159+ if (v.tag === "LT") { return Data$dOrdering.LT; }
160+ if (v.tag === "GT") { return Data$dOrdering.GT; }
161+ return compare1(x._2)(y._2);
162+ },
163+ Eq0: () => eqRecurringInterval2
164+ };
165+ };
166+};
167+const bifunctorInterval = {
168+ bimap: v => v1 => v2 => {
169+ if (v2.tag === "StartEnd") { return $Interval("StartEnd", v1(v2._1), v1(v2._2)); }
170+ if (v2.tag === "DurationEnd") { return $Interval("DurationEnd", v(v2._1), v1(v2._2)); }
171+ if (v2.tag === "StartDuration") { return $Interval("StartDuration", v1(v2._1), v(v2._2)); }
172+ if (v2.tag === "DurationOnly") { return $Interval("DurationOnly", v(v2._1)); }
173+ $runtime.fail();
174+ }
175+};
176+const bifunctorRecurringInterval = {bimap: f => g => v => $RecurringInterval(v._1, bifunctorInterval.bimap(f)(g)(v._2))};
177+const functorInterval = /* #__PURE__ */ (() => ({map: bifunctorInterval.bimap(x => x)}))();
178+const extendInterval = {
179+ extend: v => v1 => {
180+ if (v1.tag === "StartEnd") { return $Interval("StartEnd", v(v1), v(v1)); }
181+ if (v1.tag === "DurationEnd") { return $Interval("DurationEnd", v1._1, v(v1)); }
182+ if (v1.tag === "StartDuration") { return $Interval("StartDuration", v(v1), v1._2); }
183+ if (v1.tag === "DurationOnly") { return $Interval("DurationOnly", v1._1); }
184+ $runtime.fail();
185+ },
186+ Functor0: () => functorInterval
187+};
188+const functorRecurringInterval = {map: f => v => $RecurringInterval(v._1, bifunctorInterval.bimap(x => x)(f)(v._2))};
189+const extendRecurringInterval = {
190+ extend: f => v => $RecurringInterval(
191+ v._1,
192+ extendInterval.extend((() => {
193+ const $2 = f(v);
194+ return v$1 => $2;
195+ })())(v._2)
196+ ),
197+ Functor0: () => functorRecurringInterval
198+};
199+const traversableInterval = {
200+ traverse: dictApplicative => {
201+ const Apply0 = dictApplicative.Apply0();
202+ const Functor0 = Apply0.Functor0();
203+ return v => v1 => {
204+ if (v1.tag === "StartEnd") { return Apply0.apply(Functor0.map(StartEnd)(v(v1._1)))(v(v1._2)); }
205+ if (v1.tag === "DurationEnd") { return Functor0.map(DurationEnd(v1._1))(v(v1._2)); }
206+ if (v1.tag === "StartDuration") { return Functor0.map(v2 => $Interval("StartDuration", v2, v1._2))(v(v1._1)); }
207+ if (v1.tag === "DurationOnly") { return dictApplicative.pure($Interval("DurationOnly", v1._1)); }
208+ $runtime.fail();
209+ };
210+ },
211+ sequence: dictApplicative => traversableInterval.traverse(dictApplicative)(Data$dTraversable.identity),
212+ Functor0: () => functorInterval,
213+ Foldable1: () => foldableInterval
214+};
215+const traversableRecurringInterval = {
216+ traverse: dictApplicative => {
217+ const over1 = over(dictApplicative.Apply0().Functor0());
218+ const traverse1 = traversableInterval.traverse(dictApplicative);
219+ return f => i => over1(traverse1(f))(i);
220+ },
221+ sequence: dictApplicative => traversableRecurringInterval.traverse(dictApplicative)(Data$dTraversable.identity),
222+ Functor0: () => functorRecurringInterval,
223+ Foldable1: () => foldableRecurringInterval
224+};
225+const bifoldableInterval = {
226+ bifoldl: v => v1 => v2 => v3 => {
227+ if (v3.tag === "StartEnd") { return v1(v1(v2)(v3._1))(v3._2); }
228+ if (v3.tag === "DurationEnd") { return v1(v(v2)(v3._1))(v3._2); }
229+ if (v3.tag === "StartDuration") { return v1(v(v2)(v3._2))(v3._1); }
230+ if (v3.tag === "DurationOnly") { return v(v2)(v3._1); }
231+ $runtime.fail();
232+ },
233+ bifoldr: x => Data$dBifoldable.bifoldrDefault(bifoldableInterval)(x),
234+ bifoldMap: dictMonoid => {
235+ const append = dictMonoid.Semigroup0().append;
236+ return f => g => bifoldableInterval.bifoldl(m => a => append(m)(f(a)))(m => b => append(m)(g(b)))(dictMonoid.mempty);
237+ }
238+};
239+const bifoldableRecurringInterval = {
240+ bifoldl: f => g => i => x => {
241+ if (x._2.tag === "StartEnd") { return g(g(i)(x._2._1))(x._2._2); }
242+ if (x._2.tag === "DurationEnd") { return g(f(i)(x._2._1))(x._2._2); }
243+ if (x._2.tag === "StartDuration") { return g(f(i)(x._2._2))(x._2._1); }
244+ if (x._2.tag === "DurationOnly") { return f(i)(x._2._1); }
245+ $runtime.fail();
246+ },
247+ bifoldr: f => g => i => {
248+ const $3 = Data$dBifoldable.bifoldrDefault(bifoldableInterval)(f)(g)(i);
249+ return x => $3(x._2);
250+ },
251+ bifoldMap: dictMonoid => {
252+ const append = dictMonoid.Semigroup0().append;
253+ return f => g => bifoldableRecurringInterval.bifoldl(m => a => append(m)(f(a)))(m => b => append(m)(g(b)))(dictMonoid.mempty);
254+ }
255+};
256+const bitraversableInterval = {
257+ bitraverse: dictApplicative => {
258+ const Apply0 = dictApplicative.Apply0();
259+ const map1 = Apply0.Functor0().map;
260+ return v => v1 => v2 => {
261+ if (v2.tag === "StartEnd") { return Apply0.apply(map1(StartEnd)(v1(v2._1)))(v1(v2._2)); }
262+ if (v2.tag === "DurationEnd") { return Apply0.apply(map1(DurationEnd)(v(v2._1)))(v1(v2._2)); }
263+ if (v2.tag === "StartDuration") { return Apply0.apply(map1(StartDuration)(v1(v2._1)))(v(v2._2)); }
264+ if (v2.tag === "DurationOnly") { return map1(DurationOnly)(v(v2._1)); }
265+ $runtime.fail();
266+ };
267+ },
268+ bisequence: dictApplicative => bitraversableInterval.bitraverse(dictApplicative)(Data$dBitraversable.identity)(Data$dBitraversable.identity),
269+ Bifunctor0: () => bifunctorInterval,
270+ Bifoldable1: () => bifoldableInterval
271+};
272+const bitraversableRecurringInterval = {
273+ bitraverse: dictApplicative => {
274+ const over1 = over(dictApplicative.Apply0().Functor0());
275+ const bitraverse1 = bitraversableInterval.bitraverse(dictApplicative);
276+ return l => r => i => over1(bitraverse1(l)(r))(i);
277+ },
278+ bisequence: dictApplicative => bitraversableRecurringInterval.bitraverse(dictApplicative)(Data$dBitraversable.identity)(Data$dBitraversable.identity),
279+ Bifunctor0: () => bifunctorRecurringInterval,
280+ Bifoldable1: () => bifoldableRecurringInterval
281+};
282+export {
283+ $Interval,
284+ $RecurringInterval,
285+ DurationEnd,
286+ DurationOnly,
287+ RecurringInterval,
288+ StartDuration,
289+ StartEnd,
290+ bifoldableInterval,
291+ bifoldableRecurringInterval,
292+ bifunctorInterval,
293+ bifunctorRecurringInterval,
294+ bitraversableInterval,
295+ bitraversableRecurringInterval,
296+ compare,
297+ eqInterval,
298+ eqRecurringInterval,
299+ extendInterval,
300+ extendRecurringInterval,
301+ foldableInterval,
302+ foldableRecurringInterval,
303+ functorInterval,
304+ functorRecurringInterval,
305+ ordInterval,
306+ ordRecurringInterval,
307+ over,
308+ show,
309+ showInterval,
310+ showRecurringInterval,
311+ traversableInterval,
312+ traversableRecurringInterval
313+};
.storybook/purescript-indexer/output-es/Data.JSDate/foreign.jsnew file+83
@@ -0,0 +1,83 @@
1+// global exports
2+var createDate = function(y, m, d, h, mi, s, ms) {
3+ var date = new Date(Date.UTC(y, m, d, h, mi, s, ms));
4+ if (y >= 0 && y < 100) {
5+ date.setUTCFullYear(y);
6+ }
7+ return date;
8+};
9+
10+var createLocalDate = function(y, m, d, h, mi, s, ms) {
11+ var date = new Date(y, m, d, h, mi, s, ms);
12+ if (y >= 0 && y < 100) {
13+ date.setFullYear(y);
14+ }
15+ return date;
16+};
17+
18+export function now() {
19+ return new Date();
20+}
21+
22+export function isValid(date) {
23+ return !isNaN(date.getTime());
24+}
25+
26+export function toInstantImpl(just) {
27+ return function(nothing) {
28+ return function(date) {
29+ var t = date.getTime();
30+ return isNaN(t) ? nothing : just(t);
31+ };
32+ };
33+}
34+
35+export function fromInstant(instant) {
36+ return new Date(instant);
37+}
38+
39+export function jsdate(parts) {
40+ return createDate(
41+ parts.year,
42+ parts.month,
43+ parts.day,
44+ parts.hour,
45+ parts.minute,
46+ parts.second,
47+ parts.millisecond
48+ );
49+}
50+
51+export function jsdateLocal(parts) {
52+ return function() {
53+ return createLocalDate(
54+ parts.year,
55+ parts.month,
56+ parts.day,
57+ parts.hour,
58+ parts.minute,
59+ parts.second,
60+ parts.millisecond
61+ );
62+ };
63+}
64+
65+export function dateMethod(method, date) {
66+ return date[method]();
67+}
68+
69+export function dateMethodEff(method, date) {
70+ return function() {
71+ return date[method]();
72+ };
73+}
74+
75+export function parse(dateString) {
76+ return function() {
77+ return new Date(dateString);
78+ };
79+}
80+
81+export function fromTime(time) {
82+ return new Date(time);
83+}
.storybook/purescript-indexer/output-es/Data.JSDate/index.jsnew file+123
@@ -0,0 +1,123 @@
1+// | A module providing a type and operations for the native JavaScript `Date`
2+// | object.
3+// |
4+// | The `JSDate` type and associated functions are provided for interop
5+// | purposes with JavaScript, but for working with dates in PureScript it is
6+// | recommended that `DateTime` representation is used instead - `DateTime`
7+// | offers greater type safety, a more PureScript-friendly interface, and has
8+// | a `Generic` instance.
9+import * as $runtime from "../runtime.js";
10+import * as Data$dDateTime$dInstant from "../Data.DateTime.Instant/index.js";
11+import * as Data$dIdentity from "../Data.Identity/index.js";
12+import * as Data$dInt from "../Data.Int/index.js";
13+import * as Data$dMaybe from "../Data.Maybe/index.js";
14+import * as Data$dOrd from "../Data.Ord/index.js";
15+import * as Data$dShow from "../Data.Show/index.js";
16+import * as Foreign from "../Foreign/index.js";
17+import {dateMethod, dateMethodEff, fromInstant, fromTime, isValid, jsdate, jsdateLocal, now, parse, toInstantImpl} from "./foreign.js";
18+const toUTCString = dt => dateMethod("toUTCString", dt);
19+const toTimeString = dt => dateMethod("toTimeString", dt);
20+const toString = dt => dateMethod("toString", dt);
21+const toInstant = /* #__PURE__ */ (() => {
22+ const $0 = toInstantImpl(Data$dMaybe.Just)(Data$dMaybe.Nothing);
23+ return a => {
24+ const $2 = $0(a);
25+ if ($2.tag === "Just") {
26+ if ($2._1 >= -8639977881600000.0 && $2._1 <= 8639977881599999.0) { return Data$dMaybe.$Maybe("Just", $2._1); }
27+ return Data$dMaybe.Nothing;
28+ }
29+ if ($2.tag === "Nothing") { return Data$dMaybe.Nothing; }
30+ $runtime.fail();
31+ };
32+})();
33+const toISOString = dt => dateMethodEff("toISOString", dt);
34+const toDateTime = x => {
35+ const $1 = toInstant(x);
36+ if ($1.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dDateTime$dInstant.toDateTime($1._1)); }
37+ return Data$dMaybe.Nothing;
38+};
39+const toDateString = dt => dateMethod("toDateString", dt);
40+const toDate = x => {
41+ const $1 = toInstant(x);
42+ if ($1.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dDateTime$dInstant.toDateTime($1._1)._1); }
43+ return Data$dMaybe.Nothing;
44+};
45+const readDate = /* #__PURE__ */ Foreign.unsafeReadTagged(Data$dIdentity.monadIdentity)("Date");
46+const getUTCSeconds = dt => dateMethod("getUTCSeconds", dt);
47+const getUTCMonth = dt => dateMethod("getUTCMonth", dt);
48+const getUTCMinutes = dt => dateMethod("getUTCMinutes", dt);
49+const getUTCMilliseconds = dt => dateMethod("getUTCMilliseconds", dt);
50+const getUTCHours = dt => dateMethod("getUTCHours", dt);
51+const getUTCFullYear = dt => dateMethod("getUTCFullYear", dt);
52+const getUTCDay = dt => dateMethod("getUTCDay", dt);
53+const getUTCDate = dt => dateMethod("getUTCDate", dt);
54+const getTimezoneOffset = dt => dateMethodEff("getTimezoneOffset", dt);
55+const getTime = dt => dateMethod("getTime", dt);
56+const showJSDate = {show: a => "(fromTime " + (Data$dShow.showNumberImpl(dateMethod("getTime", a)) + ")")};
57+const getSeconds = dt => dateMethodEff("getSeconds", dt);
58+const getMonth = dt => dateMethodEff("getMonth", dt);
59+const getMinutes = dt => dateMethodEff("getMinutes", dt);
60+const getMilliseconds = dt => dateMethodEff("getMilliseconds", dt);
61+const getHours = dt => dateMethodEff("getHours", dt);
62+const getFullYear = dt => dateMethodEff("getFullYear", dt);
63+const getDay = dt => dateMethodEff("getDay", dt);
64+const getDate = dt => dateMethodEff("getDate", dt);
65+const fromDateTime = v => jsdate({
66+ year: Data$dInt.toNumber(v._1._1),
67+ month: Data$dInt.toNumber((() => {
68+ if (v._1._2.tag === "January") { return 0; }
69+ if (v._1._2.tag === "February") { return 1; }
70+ if (v._1._2.tag === "March") { return 2; }
71+ if (v._1._2.tag === "April") { return 3; }
72+ if (v._1._2.tag === "May") { return 4; }
73+ if (v._1._2.tag === "June") { return 5; }
74+ if (v._1._2.tag === "July") { return 6; }
75+ if (v._1._2.tag === "August") { return 7; }
76+ if (v._1._2.tag === "September") { return 8; }
77+ if (v._1._2.tag === "October") { return 9; }
78+ if (v._1._2.tag === "November") { return 10; }
79+ if (v._1._2.tag === "December") { return 11; }
80+ $runtime.fail();
81+ })()),
82+ day: Data$dInt.toNumber(v._1._3),
83+ hour: Data$dInt.toNumber(v._2._1),
84+ minute: Data$dInt.toNumber(v._2._2),
85+ second: Data$dInt.toNumber(v._2._3),
86+ millisecond: Data$dInt.toNumber(v._2._4)
87+});
88+const eqJSDate = {eq: a => b => dateMethod("getTime", a) === dateMethod("getTime", b)};
89+const ordJSDate = {compare: a => b => Data$dOrd.ordNumber.compare(dateMethod("getTime", a))(dateMethod("getTime", b)), Eq0: () => eqJSDate};
90+export {
91+ eqJSDate,
92+ fromDateTime,
93+ getDate,
94+ getDay,
95+ getFullYear,
96+ getHours,
97+ getMilliseconds,
98+ getMinutes,
99+ getMonth,
100+ getSeconds,
101+ getTime,
102+ getTimezoneOffset,
103+ getUTCDate,
104+ getUTCDay,
105+ getUTCFullYear,
106+ getUTCHours,
107+ getUTCMilliseconds,
108+ getUTCMinutes,
109+ getUTCMonth,
110+ getUTCSeconds,
111+ ordJSDate,
112+ readDate,
113+ showJSDate,
114+ toDate,
115+ toDateString,
116+ toDateTime,
117+ toISOString,
118+ toInstant,
119+ toString,
120+ toTimeString,
121+ toUTCString
122+};
123+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.Lazy/foreign.jsnew file+14
@@ -0,0 +1,14 @@
1+export const defer = function (thunk) {
2+ var v = null;
3+ return function() {
4+ if (thunk === undefined) return v;
5+
6+ v = thunk();
7+ thunk = undefined; // eslint-disable-line no-param-reassign
8+ return v;
9+ };
10+};
11+
12+export const force = function (l) {
13+ return l();
14+};
.storybook/purescript-indexer/output-es/Data.Lazy/index.jsnew file+153
@@ -0,0 +1,153 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dUnit from "../Data.Unit/index.js";
3+import {defer, force} from "./foreign.js";
4+const showLazy = dictShow => ({show: x => "(defer \\_ -> " + (dictShow.show(force(x)) + ")")});
5+const semiringLazy = dictSemiring => (
6+ {
7+ add: a => b => defer(v => dictSemiring.add(force(a))(force(b))),
8+ zero: defer(v => dictSemiring.zero),
9+ mul: a => b => defer(v => dictSemiring.mul(force(a))(force(b))),
10+ one: defer(v => dictSemiring.one)
11+ }
12+);
13+const semigroupLazy = dictSemigroup => ({append: a => b => defer(v => dictSemigroup.append(force(a))(force(b)))});
14+const ringLazy = dictRing => {
15+ const semiringLazy1 = semiringLazy(dictRing.Semiring0());
16+ return {sub: a => b => defer(v => dictRing.sub(force(a))(force(b))), Semiring0: () => semiringLazy1};
17+};
18+const monoidLazy = dictMonoid => {
19+ const semigroupLazy1 = semigroupLazy(dictMonoid.Semigroup0());
20+ return {mempty: defer(v => dictMonoid.mempty), Semigroup0: () => semigroupLazy1};
21+};
22+const lazyLazy = {defer: f => defer(v => force(f(Data$dUnit.unit)))};
23+const functorLazy = {map: f => l => defer(v => f(force(l)))};
24+const functorWithIndexLazy = {mapWithIndex: f => functorLazy.map(f(Data$dUnit.unit)), Functor0: () => functorLazy};
25+const invariantLazy = {imap: f => v => functorLazy.map(f)};
26+const foldableLazy = {foldr: f => z => l => f(force(l))(z), foldl: f => z => l => f(z)(force(l)), foldMap: dictMonoid => f => l => f(force(l))};
27+const foldableWithIndexLazy = {
28+ foldrWithIndex: f => foldableLazy.foldr(f(Data$dUnit.unit)),
29+ foldlWithIndex: f => foldableLazy.foldl(f(Data$dUnit.unit)),
30+ foldMapWithIndex: dictMonoid => f => foldableLazy.foldMap(dictMonoid)(f(Data$dUnit.unit)),
31+ Foldable0: () => foldableLazy
32+};
33+const traversableLazy = {
34+ traverse: dictApplicative => {
35+ const map1 = dictApplicative.Apply0().Functor0().map;
36+ return f => l => map1(x => defer(v => x))(f(force(l)));
37+ },
38+ sequence: dictApplicative => {
39+ const map1 = dictApplicative.Apply0().Functor0().map;
40+ return l => map1(x => defer(v => x))(force(l));
41+ },
42+ Functor0: () => functorLazy,
43+ Foldable1: () => foldableLazy
44+};
45+const traversableWithIndexLazy = {
46+ traverseWithIndex: dictApplicative => {
47+ const traverse1 = traversableLazy.traverse(dictApplicative);
48+ return f => traverse1(f(Data$dUnit.unit));
49+ },
50+ FunctorWithIndex0: () => functorWithIndexLazy,
51+ FoldableWithIndex1: () => foldableWithIndexLazy,
52+ Traversable2: () => traversableLazy
53+};
54+const foldable1Lazy = {foldMap1: dictSemigroup => f => l => f(force(l)), foldr1: v => l => force(l), foldl1: v => l => force(l), Foldable0: () => foldableLazy};
55+const traversable1Lazy = {
56+ traverse1: dictApply => {
57+ const map1 = dictApply.Functor0().map;
58+ return f => l => map1(x => defer(v => x))(f(force(l)));
59+ },
60+ sequence1: dictApply => {
61+ const map1 = dictApply.Functor0().map;
62+ return l => map1(x => defer(v => x))(force(l));
63+ },
64+ Foldable10: () => foldable1Lazy,
65+ Traversable1: () => traversableLazy
66+};
67+const extendLazy = {extend: f => x => defer(v => f(x)), Functor0: () => functorLazy};
68+const eqLazy = dictEq => ({eq: x => y => dictEq.eq(force(x))(force(y))});
69+const ordLazy = dictOrd => {
70+ const $1 = dictOrd.Eq0();
71+ const eqLazy1 = {eq: x => y => $1.eq(force(x))(force(y))};
72+ return {compare: x => y => dictOrd.compare(force(x))(force(y)), Eq0: () => eqLazy1};
73+};
74+const eq1Lazy = {eq1: dictEq => x => y => dictEq.eq(force(x))(force(y))};
75+const ord1Lazy = {compare1: dictOrd => ordLazy(dictOrd).compare, Eq10: () => eq1Lazy};
76+const comonadLazy = {extract: force, Extend0: () => extendLazy};
77+const commutativeRingLazy = dictCommutativeRing => {
78+ const ringLazy1 = ringLazy(dictCommutativeRing.Ring0());
79+ return {Ring0: () => ringLazy1};
80+};
81+const euclideanRingLazy = dictEuclideanRing => {
82+ const ringLazy1 = ringLazy(dictEuclideanRing.CommutativeRing0().Ring0());
83+ return {
84+ degree: x => dictEuclideanRing.degree(force(x)),
85+ div: a => b => defer(v => dictEuclideanRing.div(force(a))(force(b))),
86+ mod: a => b => defer(v => dictEuclideanRing.mod(force(a))(force(b))),
87+ CommutativeRing0: () => ({Ring0: () => ringLazy1})
88+ };
89+};
90+const boundedLazy = dictBounded => {
91+ const ordLazy1 = ordLazy(dictBounded.Ord0());
92+ return {top: defer(v => dictBounded.top), bottom: defer(v => dictBounded.bottom), Ord0: () => ordLazy1};
93+};
94+const applyLazy = {apply: f => x => defer(v => force(f)(force(x))), Functor0: () => functorLazy};
95+const bindLazy = {bind: l => f => defer(v => force(f(force(l)))), Apply0: () => applyLazy};
96+const heytingAlgebraLazy = dictHeytingAlgebra => (
97+ {
98+ ff: defer(v => dictHeytingAlgebra.ff),
99+ tt: defer(v => dictHeytingAlgebra.tt),
100+ implies: a => b => {
101+ const $3 = defer(v => dictHeytingAlgebra.implies(force(a)));
102+ return defer(v => force($3)(force(b)));
103+ },
104+ conj: a => b => {
105+ const $3 = defer(v => dictHeytingAlgebra.conj(force(a)));
106+ return defer(v => force($3)(force(b)));
107+ },
108+ disj: a => b => {
109+ const $3 = defer(v => dictHeytingAlgebra.disj(force(a)));
110+ return defer(v => force($3)(force(b)));
111+ },
112+ not: a => defer(v => dictHeytingAlgebra.not(force(a)))
113+ }
114+);
115+const booleanAlgebraLazy = dictBooleanAlgebra => {
116+ const heytingAlgebraLazy1 = heytingAlgebraLazy(dictBooleanAlgebra.HeytingAlgebra0());
117+ return {HeytingAlgebra0: () => heytingAlgebraLazy1};
118+};
119+const applicativeLazy = {pure: a => defer(v => a), Apply0: () => applyLazy};
120+const monadLazy = {Applicative0: () => applicativeLazy, Bind1: () => bindLazy};
121+export {
122+ applicativeLazy,
123+ applyLazy,
124+ bindLazy,
125+ booleanAlgebraLazy,
126+ boundedLazy,
127+ commutativeRingLazy,
128+ comonadLazy,
129+ eq1Lazy,
130+ eqLazy,
131+ euclideanRingLazy,
132+ extendLazy,
133+ foldable1Lazy,
134+ foldableLazy,
135+ foldableWithIndexLazy,
136+ functorLazy,
137+ functorWithIndexLazy,
138+ heytingAlgebraLazy,
139+ invariantLazy,
140+ lazyLazy,
141+ monadLazy,
142+ monoidLazy,
143+ ord1Lazy,
144+ ordLazy,
145+ ringLazy,
146+ semigroupLazy,
147+ semiringLazy,
148+ showLazy,
149+ traversable1Lazy,
150+ traversableLazy,
151+ traversableWithIndexLazy
152+};
153+export * from "./foreign.js";
.storybook/purescript-indexer/output-es/Data.List.Internal/index.jsnew file+162
@@ -0,0 +1,162 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
3+const $KickUp = (_1, _2, _3) => ({tag: "KickUp", _1, _2, _3});
4+const $Set = (tag, _1, _2, _3, _4, _5) => ({tag, _1, _2, _3, _4, _5});
5+const $TreeContext = (tag, _1, _2, _3, _4) => ({tag, _1, _2, _3, _4});
6+const Leaf = /* #__PURE__ */ $Set("Leaf");
7+const Two = value0 => value1 => value2 => $Set("Two", value0, value1, value2);
8+const Three = value0 => value1 => value2 => value3 => value4 => $Set("Three", value0, value1, value2, value3, value4);
9+const TwoLeft = value0 => value1 => $TreeContext("TwoLeft", value0, value1);
10+const TwoRight = value0 => value1 => $TreeContext("TwoRight", value0, value1);
11+const ThreeLeft = value0 => value1 => value2 => value3 => $TreeContext("ThreeLeft", value0, value1, value2, value3);
12+const ThreeMiddle = value0 => value1 => value2 => value3 => $TreeContext("ThreeMiddle", value0, value1, value2, value3);
13+const ThreeRight = value0 => value1 => value2 => value3 => $TreeContext("ThreeRight", value0, value1, value2, value3);
14+const KickUp = value0 => value1 => value2 => $KickUp(value0, value1, value2);
15+const fromZipper = fromZipper$a0$copy => fromZipper$a1$copy => {
16+ let fromZipper$a0 = fromZipper$a0$copy, fromZipper$a1 = fromZipper$a1$copy, fromZipper$c = true, fromZipper$r;
17+ while (fromZipper$c) {
18+ const v = fromZipper$a0, v1 = fromZipper$a1;
19+ if (v.tag === "Nil") {
20+ fromZipper$c = false;
21+ fromZipper$r = v1;
22+ continue;
23+ }
24+ if (v.tag === "Cons") {
25+ if (v._1.tag === "TwoLeft") {
26+ fromZipper$a0 = v._2;
27+ fromZipper$a1 = $Set("Two", v1, v._1._1, v._1._2);
28+ continue;
29+ }
30+ if (v._1.tag === "TwoRight") {
31+ fromZipper$a0 = v._2;
32+ fromZipper$a1 = $Set("Two", v._1._1, v._1._2, v1);
33+ continue;
34+ }
35+ if (v._1.tag === "ThreeLeft") {
36+ fromZipper$a0 = v._2;
37+ fromZipper$a1 = $Set("Three", v1, v._1._1, v._1._2, v._1._3, v._1._4);
38+ continue;
39+ }
40+ if (v._1.tag === "ThreeMiddle") {
41+ fromZipper$a0 = v._2;
42+ fromZipper$a1 = $Set("Three", v._1._1, v._1._2, v1, v._1._3, v._1._4);
43+ continue;
44+ }
45+ if (v._1.tag === "ThreeRight") {
46+ fromZipper$a0 = v._2;
47+ fromZipper$a1 = $Set("Three", v._1._1, v._1._2, v._1._3, v._1._4, v1);
48+ continue;
49+ }
50+ $runtime.fail();
51+ }
52+ $runtime.fail();
53+ };
54+ return fromZipper$r;
55+};
56+const insertAndLookupBy = comp => k => orig => {
57+ const up = up$a0$copy => up$a1$copy => {
58+ let up$a0 = up$a0$copy, up$a1 = up$a1$copy, up$c = true, up$r;
59+ while (up$c) {
60+ const v = up$a0, v1 = up$a1;
61+ if (v.tag === "Nil") {
62+ up$c = false;
63+ up$r = $Set("Two", v1._1, v1._2, v1._3);
64+ continue;
65+ }
66+ if (v.tag === "Cons") {
67+ if (v._1.tag === "TwoLeft") {
68+ up$c = false;
69+ up$r = fromZipper(v._2)($Set("Three", v1._1, v1._2, v1._3, v._1._1, v._1._2));
70+ continue;
71+ }
72+ if (v._1.tag === "TwoRight") {
73+ up$c = false;
74+ up$r = fromZipper(v._2)($Set("Three", v._1._1, v._1._2, v1._1, v1._2, v1._3));
75+ continue;
76+ }
77+ if (v._1.tag === "ThreeLeft") {
78+ up$a0 = v._2;
79+ up$a1 = $KickUp($Set("Two", v1._1, v1._2, v1._3), v._1._1, $Set("Two", v._1._2, v._1._3, v._1._4));
80+ continue;
81+ }
82+ if (v._1.tag === "ThreeMiddle") {
83+ up$a0 = v._2;
84+ up$a1 = $KickUp($Set("Two", v._1._1, v._1._2, v1._1), v1._2, $Set("Two", v1._3, v._1._3, v._1._4));
85+ continue;
86+ }
87+ if (v._1.tag === "ThreeRight") {
88+ up$a0 = v._2;
89+ up$a1 = $KickUp($Set("Two", v._1._1, v._1._2, v._1._3), v._1._4, $Set("Two", v1._1, v1._2, v1._3));
90+ continue;
91+ }
92+ $runtime.fail();
93+ }
94+ $runtime.fail();
95+ };
96+ return up$r;
97+ };
98+ const down = down$a0$copy => down$a1$copy => {
99+ let down$a0 = down$a0$copy, down$a1 = down$a1$copy, down$c = true, down$r;
100+ while (down$c) {
101+ const v = down$a0, v1 = down$a1;
102+ if (v1.tag === "Leaf") {
103+ down$c = false;
104+ down$r = {found: false, result: up(v)($KickUp(Leaf, k, Leaf))};
105+ continue;
106+ }
107+ if (v1.tag === "Two") {
108+ const v2 = comp(k)(v1._2);
109+ if (v2.tag === "EQ") {
110+ down$c = false;
111+ down$r = {found: true, result: orig};
112+ continue;
113+ }
114+ if (v2.tag === "LT") {
115+ down$a0 = Data$dList$dTypes.$List("Cons", $TreeContext("TwoLeft", v1._2, v1._3), v);
116+ down$a1 = v1._1;
117+ continue;
118+ }
119+ down$a0 = Data$dList$dTypes.$List("Cons", $TreeContext("TwoRight", v1._1, v1._2), v);
120+ down$a1 = v1._3;
121+ continue;
122+ }
123+ if (v1.tag === "Three") {
124+ const v2 = comp(k)(v1._2);
125+ if (v2.tag === "EQ") {
126+ down$c = false;
127+ down$r = {found: true, result: orig};
128+ continue;
129+ }
130+ const v3 = comp(k)(v1._4);
131+ if (v3.tag === "EQ") {
132+ down$c = false;
133+ down$r = {found: true, result: orig};
134+ continue;
135+ }
136+ if (v2.tag === "LT") {
137+ down$a0 = Data$dList$dTypes.$List("Cons", $TreeContext("ThreeLeft", v1._2, v1._3, v1._4, v1._5), v);
138+ down$a1 = v1._1;
139+ continue;
140+ }
141+ if (v2.tag === "GT") {
142+ if (v3.tag === "LT") {
143+ down$a0 = Data$dList$dTypes.$List("Cons", $TreeContext("ThreeMiddle", v1._1, v1._2, v1._4, v1._5), v);
144+ down$a1 = v1._3;
145+ continue;
146+ }
147+ down$a0 = Data$dList$dTypes.$List("Cons", $TreeContext("ThreeRight", v1._1, v1._2, v1._3, v1._4), v);
148+ down$a1 = v1._5;
149+ continue;
150+ }
151+ down$a0 = Data$dList$dTypes.$List("Cons", $TreeContext("ThreeRight", v1._1, v1._2, v1._3, v1._4), v);
152+ down$a1 = v1._5;
153+ continue;
154+ }
155+ $runtime.fail();
156+ };
157+ return down$r;
158+ };
159+ return down(Data$dList$dTypes.Nil)(orig);
160+};
161+const emptySet = Leaf;
162+export {$KickUp, $Set, $TreeContext, KickUp, Leaf, Three, ThreeLeft, ThreeMiddle, ThreeRight, Two, TwoLeft, TwoRight, emptySet, fromZipper, insertAndLookupBy};
.storybook/purescript-indexer/output-es/Data.List.Lazy.NonEmpty/index.jsnew file+69
@@ -0,0 +1,69 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dLazy from "../Data.Lazy/index.js";
3+import * as Data$dList$dLazy from "../Data.List.Lazy/index.js";
4+import * as Data$dList$dLazy$dTypes from "../Data.List.Lazy.Types/index.js";
5+import * as Data$dMaybe from "../Data.Maybe/index.js";
6+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
7+import * as Data$dTuple from "../Data.Tuple/index.js";
8+const uncons = v => {
9+ const v1 = Data$dLazy.force(v);
10+ return {head: v1._1, tail: v1._2};
11+};
12+const toList = v => {
13+ const v1 = Data$dLazy.force(v);
14+ return Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v1._1, v1._2));
15+};
16+const toUnfoldable = dictUnfoldable => {
17+ const $1 = dictUnfoldable.unfoldr(xs => {
18+ const $2 = Data$dList$dLazy.uncons(xs);
19+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple($2._1.head, $2._1.tail)); }
20+ return Data$dMaybe.Nothing;
21+ });
22+ return x => $1((() => {
23+ const v1 = Data$dLazy.force(x);
24+ return Data$dLazy.defer(v => Data$dList$dLazy$dTypes.$Step("Cons", v1._1, v1._2));
25+ })());
26+};
27+const tail = v => Data$dLazy.force(v)._2;
28+const singleton = /* #__PURE__ */ (() => Data$dList$dLazy$dTypes.applicativeNonEmptyList.pure)();
29+const repeat = x => Data$dLazy.defer(v => Data$dNonEmpty.$NonEmpty(x, Data$dList$dLazy.repeat(x)));
30+const length = v => 1 + Data$dList$dLazy.length(Data$dLazy.force(v)._2) | 0;
31+const last = v => {
32+ const v1 = Data$dLazy.force(v);
33+ const $2 = Data$dList$dLazy.last(v1._2);
34+ if ($2.tag === "Nothing") { return v1._1; }
35+ if ($2.tag === "Just") { return $2._1; }
36+ $runtime.fail();
37+};
38+const iterate = f => x => Data$dLazy.defer(v => Data$dNonEmpty.$NonEmpty(x, Data$dList$dLazy.iterate(f)(f(x))));
39+const init = v => {
40+ const v1 = Data$dLazy.force(v);
41+ const $2 = Data$dList$dLazy.init(v1._2);
42+ if ($2.tag === "Nothing") { return Data$dList$dLazy$dTypes.nil; }
43+ if ($2.tag === "Just") { return Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v1._1, $2._1)); }
44+ $runtime.fail();
45+};
46+const head = v => Data$dLazy.force(v)._1;
47+const fromList = l => {
48+ const v = Data$dLazy.force(l);
49+ if (v.tag === "Nil") { return Data$dMaybe.Nothing; }
50+ if (v.tag === "Cons") { return Data$dMaybe.$Maybe("Just", Data$dLazy.defer(v1 => Data$dNonEmpty.$NonEmpty(v._1, v._2))); }
51+ $runtime.fail();
52+};
53+const fromFoldable = dictFoldable => {
54+ const $1 = dictFoldable.foldr(Data$dList$dLazy$dTypes.cons)(Data$dList$dLazy$dTypes.nil);
55+ return x => fromList($1(x));
56+};
57+const cons = y => v => Data$dLazy.defer(v1 => {
58+ const v2 = Data$dLazy.force(v);
59+ return Data$dNonEmpty.$NonEmpty(y, Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v2._1, v2._2)));
60+});
61+const concatMap = b => a => Data$dList$dLazy$dTypes.bindNonEmptyList.bind(a)(b);
62+const appendFoldable = dictFoldable => {
63+ const fromFoldable1 = dictFoldable.foldr(Data$dList$dLazy$dTypes.cons)(Data$dList$dLazy$dTypes.nil);
64+ return nel => ys => Data$dLazy.defer(v => Data$dNonEmpty.$NonEmpty(
65+ Data$dLazy.force(nel)._1,
66+ Data$dList$dLazy$dTypes.semigroupList.append(Data$dLazy.force(nel)._2)(fromFoldable1(ys))
67+ ));
68+};
69+export {appendFoldable, concatMap, cons, fromFoldable, fromList, head, init, iterate, last, length, repeat, singleton, tail, toList, toUnfoldable, uncons};
.storybook/purescript-indexer/output-es/Data.List.Lazy.Types/index.jsnew file+510
@@ -0,0 +1,510 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dLazy from "../Data.Lazy/index.js";
3+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
4+import * as Data$dOrdering from "../Data.Ordering/index.js";
5+import * as Data$dTuple from "../Data.Tuple/index.js";
6+const $Step = (tag, _1, _2) => ({tag, _1, _2});
7+const identity = x => x;
8+const List = x => x;
9+const Nil = /* #__PURE__ */ $Step("Nil");
10+const Cons = value0 => value1 => $Step("Cons", value0, value1);
11+const NonEmptyList = x => x;
12+const nil = /* #__PURE__ */ Data$dLazy.defer(v => Nil);
13+const newtypeNonEmptyList = {Coercible0: () => undefined};
14+const newtypeList = {Coercible0: () => undefined};
15+const step = x => Data$dLazy.force(x);
16+const semigroupList = {
17+ append: xs => ys => Data$dLazy.defer(v => {
18+ const $3 = Data$dLazy.force(xs);
19+ if ($3.tag === "Nil") { return Data$dLazy.force(ys); }
20+ if ($3.tag === "Cons") { return $Step("Cons", $3._1, semigroupList.append($3._2)(ys)); }
21+ $runtime.fail();
22+ })
23+};
24+const monoidList = {mempty: nil, Semigroup0: () => semigroupList};
25+const lazyList = {defer: f => Data$dLazy.defer(x => Data$dLazy.force(f(x)))};
26+const functorList = {
27+ map: f => xs => Data$dLazy.defer(v => {
28+ const $3 = Data$dLazy.force(xs);
29+ if ($3.tag === "Nil") { return Nil; }
30+ if ($3.tag === "Cons") { return $Step("Cons", f($3._1), functorList.map(f)($3._2)); }
31+ $runtime.fail();
32+ })
33+};
34+const map1 = /* #__PURE__ */ (() => Data$dNonEmpty.functorNonEmpty(functorList).map)();
35+const functorNonEmptyList = {
36+ map: f => v => {
37+ const $2 = map1(f);
38+ return Data$dLazy.defer(v$1 => $2(Data$dLazy.force(v)));
39+ }
40+};
41+const eq1List = {
42+ eq1: dictEq => xs => ys => {
43+ const go = go$a0$copy => go$a1$copy => {
44+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
45+ while (go$c) {
46+ const v = go$a0, v1 = go$a1;
47+ if (v.tag === "Nil") {
48+ go$c = false;
49+ go$r = v1.tag === "Nil";
50+ continue;
51+ }
52+ if (v.tag === "Cons") {
53+ if (v1.tag === "Cons") {
54+ if (dictEq.eq(v._1)(v1._1)) {
55+ go$a0 = Data$dLazy.force(v._2);
56+ go$a1 = Data$dLazy.force(v1._2);
57+ continue;
58+ }
59+ go$c = false;
60+ go$r = false;
61+ continue;
62+ }
63+ go$c = false;
64+ go$r = false;
65+ continue;
66+ }
67+ go$c = false;
68+ go$r = false;
69+ continue;
70+ };
71+ return go$r;
72+ };
73+ return go(Data$dLazy.force(xs))(Data$dLazy.force(ys));
74+ }
75+};
76+const eqNonEmpty = dictEq => ({eq: x => y => dictEq.eq(x._1)(y._1) && eq1List.eq1(dictEq)(x._2)(y._2)});
77+const eq1NonEmptyList = {eq1: dictEq => Data$dLazy.eq1Lazy.eq1(eqNonEmpty(dictEq))};
78+const eqList = dictEq => ({eq: eq1List.eq1(dictEq)});
79+const eqNonEmptyList = dictEq => {
80+ const $1 = eqNonEmpty(dictEq);
81+ return {eq: x => y => $1.eq(Data$dLazy.force(x))(Data$dLazy.force(y))};
82+};
83+const ord1List = {
84+ compare1: dictOrd => xs => ys => {
85+ const go = go$a0$copy => go$a1$copy => {
86+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
87+ while (go$c) {
88+ const v = go$a0, v1 = go$a1;
89+ if (v.tag === "Nil") {
90+ if (v1.tag === "Nil") {
91+ go$c = false;
92+ go$r = Data$dOrdering.EQ;
93+ continue;
94+ }
95+ go$c = false;
96+ go$r = Data$dOrdering.LT;
97+ continue;
98+ }
99+ if (v1.tag === "Nil") {
100+ go$c = false;
101+ go$r = Data$dOrdering.GT;
102+ continue;
103+ }
104+ if (v.tag === "Cons") {
105+ if (v1.tag === "Cons") {
106+ const v2 = dictOrd.compare(v._1)(v1._1);
107+ if (v2.tag === "EQ") {
108+ go$a0 = Data$dLazy.force(v._2);
109+ go$a1 = Data$dLazy.force(v1._2);
110+ continue;
111+ }
112+ go$c = false;
113+ go$r = v2;
114+ continue;
115+ }
116+ $runtime.fail();
117+ }
118+ $runtime.fail();
119+ };
120+ return go$r;
121+ };
122+ return go(Data$dLazy.force(xs))(Data$dLazy.force(ys));
123+ },
124+ Eq10: () => eq1List
125+};
126+const ordNonEmpty = /* #__PURE__ */ Data$dNonEmpty.ordNonEmpty(ord1List);
127+const ord1NonEmptyList = {compare1: dictOrd => Data$dLazy.ordLazy(ordNonEmpty(dictOrd)).compare, Eq10: () => eq1NonEmptyList};
128+const ordList = dictOrd => {
129+ const eqList1 = {eq: eq1List.eq1(dictOrd.Eq0())};
130+ return {compare: ord1List.compare1(dictOrd), Eq0: () => eqList1};
131+};
132+const ordNonEmptyList = dictOrd => Data$dLazy.ordLazy(ordNonEmpty(dictOrd));
133+const cons = x => xs => Data$dLazy.defer(v => $Step("Cons", x, xs));
134+const foldableList = {
135+ foldr: op => z => xs => foldableList.foldl(b => a => op(a)(b))(z)(foldableList.foldl(b => a => Data$dLazy.defer(v => $Step("Cons", a, b)))(nil)(xs)),
136+ foldl: op => {
137+ const go = go$a0$copy => go$a1$copy => {
138+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
139+ while (go$c) {
140+ const b = go$a0, xs = go$a1;
141+ const v = Data$dLazy.force(xs);
142+ if (v.tag === "Nil") {
143+ go$c = false;
144+ go$r = b;
145+ continue;
146+ }
147+ if (v.tag === "Cons") {
148+ go$a0 = op(b)(v._1);
149+ go$a1 = v._2;
150+ continue;
151+ }
152+ $runtime.fail();
153+ };
154+ return go$r;
155+ };
156+ return go;
157+ },
158+ foldMap: dictMonoid => {
159+ const append2 = dictMonoid.Semigroup0().append;
160+ return f => foldableList.foldl(b => a => append2(b)(f(a)))(dictMonoid.mempty);
161+ }
162+};
163+const foldableNonEmpty = {
164+ foldMap: dictMonoid => {
165+ const append1 = dictMonoid.Semigroup0().append;
166+ const foldMap1 = foldableList.foldMap(dictMonoid);
167+ return f => v => append1(f(v._1))(foldMap1(f)(v._2));
168+ },
169+ foldl: f => b => v => foldableList.foldl(f)(f(b)(v._1))(v._2),
170+ foldr: f => b => v => f(v._1)(foldableList.foldr(f)(b)(v._2))
171+};
172+const extendList = {
173+ extend: f => l => {
174+ const v = Data$dLazy.force(l);
175+ if (v.tag === "Nil") { return nil; }
176+ if (v.tag === "Cons") {
177+ const $3 = f(l);
178+ const $4 = foldableList.foldr(a => v$1 => {
179+ const acc$p = Data$dLazy.defer(v$2 => $Step("Cons", a, v$1.acc));
180+ return {
181+ val: (() => {
182+ const $7 = f(acc$p);
183+ return Data$dLazy.defer(v$2 => $Step("Cons", $7, v$1.val));
184+ })(),
185+ acc: acc$p
186+ };
187+ })({val: nil, acc: nil})(v._2).val;
188+ return Data$dLazy.defer(v$1 => $Step("Cons", $3, $4));
189+ }
190+ $runtime.fail();
191+ },
192+ Functor0: () => functorList
193+};
194+const extendNonEmptyList = {
195+ extend: f => v => {
196+ const $2 = Data$dLazy.force(v)._2;
197+ return Data$dLazy.defer(v2 => Data$dNonEmpty.$NonEmpty(
198+ f(v),
199+ foldableList.foldr(a => v1 => (
200+ {
201+ val: (() => {
202+ const $6 = f(Data$dLazy.defer(v2$1 => Data$dNonEmpty.$NonEmpty(a, v1.acc)));
203+ return Data$dLazy.defer(v$1 => $Step("Cons", $6, v1.val));
204+ })(),
205+ acc: Data$dLazy.defer(v$1 => $Step("Cons", a, v1.acc))
206+ }
207+ ))({val: nil, acc: nil})($2).val
208+ ));
209+ },
210+ Functor0: () => functorNonEmptyList
211+};
212+const foldableNonEmptyList = {
213+ foldr: f => b => v => {
214+ const $3 = Data$dLazy.force(v);
215+ return f($3._1)(foldableList.foldr(f)(b)($3._2));
216+ },
217+ foldl: f => b => v => {
218+ const $3 = Data$dLazy.force(v);
219+ return foldableList.foldl(f)(f(b)($3._1))($3._2);
220+ },
221+ foldMap: dictMonoid => {
222+ const foldMap1 = foldableNonEmpty.foldMap(dictMonoid);
223+ return f => v => foldMap1(f)(Data$dLazy.force(v));
224+ }
225+};
226+const showList = dictShow => (
227+ {
228+ show: xs => {
229+ const v = Data$dLazy.force(xs);
230+ if (v.tag === "Nil") { return "(fromFoldable [])"; }
231+ if (v.tag === "Cons") { return "(fromFoldable [" + (dictShow.show(v._1) + foldableList.foldl(shown => x$p => shown + ("," + dictShow.show(x$p)))("")(v._2) + "])"); }
232+ $runtime.fail();
233+ }
234+ }
235+);
236+const showNonEmptyList = dictShow => {
237+ const $1 = showList(dictShow);
238+ return {
239+ show: v => {
240+ const $3 = Data$dLazy.force(v);
241+ return "(NonEmptyList (defer \\_ -> (NonEmpty " + (dictShow.show($3._1) + (" " + ($1.show($3._2) + ")"))) + "))";
242+ }
243+ };
244+};
245+const showStep = dictShow => {
246+ const show1 = showList(dictShow).show;
247+ return {
248+ show: v => {
249+ if (v.tag === "Nil") { return "Nil"; }
250+ if (v.tag === "Cons") { return "(" + (dictShow.show(v._1) + (" : " + (show1(v._2) + ")"))); }
251+ $runtime.fail();
252+ }
253+ };
254+};
255+const foldableWithIndexList = {
256+ foldrWithIndex: f => b => xs => {
257+ const v = foldableList.foldl(v1 => a => Data$dTuple.$Tuple(v1._1 + 1 | 0, Data$dLazy.defer(v => $Step("Cons", a, v1._2))))(Data$dTuple.$Tuple(0, nil))(xs);
258+ return foldableList.foldl(v1 => a => Data$dTuple.$Tuple(v1._1 - 1 | 0, f(v1._1 - 1 | 0)(a)(v1._2)))(Data$dTuple.$Tuple(v._1, b))(v._2)._2;
259+ },
260+ foldlWithIndex: f => acc => {
261+ const $2 = foldableList.foldl(v => a => Data$dTuple.$Tuple(v._1 + 1 | 0, f(v._1)(v._2)(a)))(Data$dTuple.$Tuple(0, acc));
262+ return x => $2(x)._2;
263+ },
264+ foldMapWithIndex: dictMonoid => {
265+ const append2 = dictMonoid.Semigroup0().append;
266+ return f => foldableWithIndexList.foldlWithIndex(i => acc => {
267+ const $5 = append2(acc);
268+ const $6 = f(i);
269+ return x => $5($6(x));
270+ })(dictMonoid.mempty);
271+ },
272+ Foldable0: () => foldableList
273+};
274+const foldableWithIndexNonEmpty = /* #__PURE__ */ Data$dNonEmpty.foldableWithIndexNonEmpty(foldableWithIndexList);
275+const foldableWithIndexNonEmptyList = {
276+ foldMapWithIndex: dictMonoid => {
277+ const foldMapWithIndex1 = foldableWithIndexNonEmpty.foldMapWithIndex(dictMonoid);
278+ return f => v => foldMapWithIndex1(x => f((() => {
279+ if (x.tag === "Nothing") { return 0; }
280+ if (x.tag === "Just") { return 1 + x._1 | 0; }
281+ $runtime.fail();
282+ })()))(Data$dLazy.force(v));
283+ },
284+ foldlWithIndex: f => b => v => foldableWithIndexNonEmpty.foldlWithIndex(x => f((() => {
285+ if (x.tag === "Nothing") { return 0; }
286+ if (x.tag === "Just") { return 1 + x._1 | 0; }
287+ $runtime.fail();
288+ })()))(b)(Data$dLazy.force(v)),
289+ foldrWithIndex: f => b => v => foldableWithIndexNonEmpty.foldrWithIndex(x => f((() => {
290+ if (x.tag === "Nothing") { return 0; }
291+ if (x.tag === "Just") { return 1 + x._1 | 0; }
292+ $runtime.fail();
293+ })()))(b)(Data$dLazy.force(v)),
294+ Foldable0: () => foldableNonEmptyList
295+};
296+const functorWithIndexList = {
297+ mapWithIndex: f => foldableWithIndexList.foldrWithIndex(i => x => acc => {
298+ const $4 = f(i)(x);
299+ return Data$dLazy.defer(v => $Step("Cons", $4, acc));
300+ })(nil),
301+ Functor0: () => functorList
302+};
303+const mapWithIndex = /* #__PURE__ */ (() => Data$dNonEmpty.functorWithIndex(functorWithIndexList).mapWithIndex)();
304+const functorWithIndexNonEmptyList = {
305+ mapWithIndex: f => v => Data$dLazy.defer(v1 => mapWithIndex(x => f((() => {
306+ if (x.tag === "Nothing") { return 0; }
307+ if (x.tag === "Just") { return 1 + x._1 | 0; }
308+ $runtime.fail();
309+ })()))(Data$dLazy.force(v))),
310+ Functor0: () => functorNonEmptyList
311+};
312+const toList = v => Data$dLazy.defer(x => Data$dLazy.force((() => {
313+ const v2 = Data$dLazy.force(v);
314+ return Data$dLazy.defer(v$1 => $Step("Cons", v2._1, v2._2));
315+})()));
316+const semigroupNonEmptyList = {
317+ append: v => as$p => {
318+ const v1 = Data$dLazy.force(v);
319+ return Data$dLazy.defer(v2 => Data$dNonEmpty.$NonEmpty(v1._1, semigroupList.append(v1._2)(toList(as$p))));
320+ }
321+};
322+const traversableList = {
323+ traverse: dictApplicative => {
324+ const Apply0 = dictApplicative.Apply0();
325+ const map2 = Apply0.Functor0().map;
326+ return f => foldableList.foldr(a => b => Apply0.apply(map2(cons)(f(a)))(b))(dictApplicative.pure(nil));
327+ },
328+ sequence: dictApplicative => traversableList.traverse(dictApplicative)(identity),
329+ Functor0: () => functorList,
330+ Foldable1: () => foldableList
331+};
332+const traversableNonEmpty = /* #__PURE__ */ Data$dNonEmpty.traversableNonEmpty(traversableList);
333+const traversableNonEmptyList = {
334+ traverse: dictApplicative => {
335+ const map2 = dictApplicative.Apply0().Functor0().map;
336+ const traverse1 = traversableNonEmpty.traverse(dictApplicative);
337+ return f => v => map2(xxs => Data$dLazy.defer(v1 => xxs))(traverse1(f)(Data$dLazy.force(v)));
338+ },
339+ sequence: dictApplicative => {
340+ const map2 = dictApplicative.Apply0().Functor0().map;
341+ const sequence1 = traversableNonEmpty.sequence(dictApplicative);
342+ return v => map2(xxs => Data$dLazy.defer(v1 => xxs))(sequence1(Data$dLazy.force(v)));
343+ },
344+ Functor0: () => functorNonEmptyList,
345+ Foldable1: () => foldableNonEmptyList
346+};
347+const traversableWithIndexList = {
348+ traverseWithIndex: dictApplicative => {
349+ const Apply0 = dictApplicative.Apply0();
350+ const map2 = Apply0.Functor0().map;
351+ return f => foldableWithIndexList.foldrWithIndex(i => a => b => Apply0.apply(map2(cons)(f(i)(a)))(b))(dictApplicative.pure(nil));
352+ },
353+ FunctorWithIndex0: () => functorWithIndexList,
354+ FoldableWithIndex1: () => foldableWithIndexList,
355+ Traversable2: () => traversableList
356+};
357+const traverseWithIndex = /* #__PURE__ */ (() => Data$dNonEmpty.traversableWithIndexNonEmpty(traversableWithIndexList).traverseWithIndex)();
358+const traversableWithIndexNonEmptyList = {
359+ traverseWithIndex: dictApplicative => {
360+ const map2 = dictApplicative.Apply0().Functor0().map;
361+ const traverseWithIndex1 = traverseWithIndex(dictApplicative);
362+ return f => v => map2(xxs => Data$dLazy.defer(v1 => xxs))(traverseWithIndex1(x => f((() => {
363+ if (x.tag === "Nothing") { return 0; }
364+ if (x.tag === "Just") { return 1 + x._1 | 0; }
365+ $runtime.fail();
366+ })()))(Data$dLazy.force(v)));
367+ },
368+ FunctorWithIndex0: () => functorWithIndexNonEmptyList,
369+ FoldableWithIndex1: () => foldableWithIndexNonEmptyList,
370+ Traversable2: () => traversableNonEmptyList
371+};
372+const unfoldable1List = {
373+ unfoldr1: /* #__PURE__ */ (() => {
374+ const go = f => b => Data$dLazy.defer(x => Data$dLazy.force((() => {
375+ const v1 = f(b);
376+ if (v1._2.tag === "Just") {
377+ const $5 = go(f)(v1._2._1);
378+ return Data$dLazy.defer(v => $Step("Cons", v1._1, $5));
379+ }
380+ if (v1._2.tag === "Nothing") { return Data$dLazy.defer(v => $Step("Cons", v1._1, nil)); }
381+ $runtime.fail();
382+ })()));
383+ return go;
384+ })()
385+};
386+const unfoldableList = {
387+ unfoldr: /* #__PURE__ */ (() => {
388+ const go = f => b => Data$dLazy.defer(x => Data$dLazy.force((() => {
389+ const v1 = f(b);
390+ if (v1.tag === "Nothing") { return nil; }
391+ if (v1.tag === "Just") {
392+ const $5 = go(f)(v1._1._2);
393+ return Data$dLazy.defer(v => $Step("Cons", v1._1._1, $5));
394+ }
395+ $runtime.fail();
396+ })()));
397+ return go;
398+ })(),
399+ Unfoldable10: () => unfoldable1List
400+};
401+const unfoldr1 = /* #__PURE__ */ (() => Data$dNonEmpty.unfoldable1NonEmpty(unfoldableList).unfoldr1)();
402+const unfoldable1NonEmptyList = {unfoldr1: f => b => Data$dLazy.defer(v => unfoldr1(f)(b))};
403+const comonadNonEmptyList = {extract: v => Data$dLazy.force(v)._1, Extend0: () => extendNonEmptyList};
404+const monadList = {Applicative0: () => applicativeList, Bind1: () => bindList};
405+const bindList = {
406+ bind: xs => f => Data$dLazy.defer(v => {
407+ const $3 = Data$dLazy.force(xs);
408+ if ($3.tag === "Nil") { return Nil; }
409+ if ($3.tag === "Cons") { return Data$dLazy.force(semigroupList.append(f($3._1))(bindList.bind($3._2)(f))); }
410+ $runtime.fail();
411+ }),
412+ Apply0: () => applyList
413+};
414+const applyList = {apply: f => a => bindList.bind(f)(f$p => bindList.bind(a)(a$p => applicativeList.pure(f$p(a$p)))), Functor0: () => functorList};
415+const applicativeList = {pure: a => Data$dLazy.defer(v => $Step("Cons", a, nil)), Apply0: () => applyList};
416+const applyNonEmptyList = {
417+ apply: v => v1 => {
418+ const v2 = Data$dLazy.force(v1);
419+ const v3 = Data$dLazy.force(v);
420+ return Data$dLazy.defer(v4 => Data$dNonEmpty.$NonEmpty(
421+ v3._1(v2._1),
422+ semigroupList.append(applyList.apply(v3._2)(Data$dLazy.defer(v$1 => $Step("Cons", v2._1, nil))))(applyList.apply(Data$dLazy.defer(v$1 => $Step("Cons", v3._1, v3._2)))(v2._2))
423+ ));
424+ },
425+ Functor0: () => functorNonEmptyList
426+};
427+const bindNonEmptyList = {
428+ bind: v => f => {
429+ const v1 = Data$dLazy.force(v);
430+ const v2 = Data$dLazy.force(f(v1._1));
431+ return Data$dLazy.defer(v3 => Data$dNonEmpty.$NonEmpty(v2._1, semigroupList.append(v2._2)(bindList.bind(v1._2)(x => toList(f(x))))));
432+ },
433+ Apply0: () => applyNonEmptyList
434+};
435+const altNonEmptyList = /* #__PURE__ */ (() => ({alt: semigroupNonEmptyList.append, Functor0: () => functorNonEmptyList}))();
436+const altList = /* #__PURE__ */ (() => ({alt: semigroupList.append, Functor0: () => functorList}))();
437+const plusList = {empty: nil, Alt0: () => altList};
438+const alternativeList = {Applicative0: () => applicativeList, Plus1: () => plusList};
439+const monadPlusList = {Monad0: () => monadList, Alternative1: () => alternativeList};
440+const applicativeNonEmptyList = {pure: a => Data$dLazy.defer(v => Data$dNonEmpty.$NonEmpty(a, nil)), Apply0: () => applyNonEmptyList};
441+const monadNonEmptyList = {Applicative0: () => applicativeNonEmptyList, Bind1: () => bindNonEmptyList};
442+export {
443+ $Step,
444+ Cons,
445+ List,
446+ Nil,
447+ NonEmptyList,
448+ altList,
449+ altNonEmptyList,
450+ alternativeList,
451+ applicativeList,
452+ applicativeNonEmptyList,
453+ applyList,
454+ applyNonEmptyList,
455+ bindList,
456+ bindNonEmptyList,
457+ comonadNonEmptyList,
458+ cons,
459+ eq1List,
460+ eq1NonEmptyList,
461+ eqList,
462+ eqNonEmpty,
463+ eqNonEmptyList,
464+ extendList,
465+ extendNonEmptyList,
466+ foldableList,
467+ foldableNonEmpty,
468+ foldableNonEmptyList,
469+ foldableWithIndexList,
470+ foldableWithIndexNonEmpty,
471+ foldableWithIndexNonEmptyList,
472+ functorList,
473+ functorNonEmptyList,
474+ functorWithIndexList,
475+ functorWithIndexNonEmptyList,
476+ identity,
477+ lazyList,
478+ map1,
479+ mapWithIndex,
480+ monadList,
481+ monadNonEmptyList,
482+ monadPlusList,
483+ monoidList,
484+ newtypeList,
485+ newtypeNonEmptyList,
486+ nil,
487+ ord1List,
488+ ord1NonEmptyList,
489+ ordList,
490+ ordNonEmpty,
491+ ordNonEmptyList,
492+ plusList,
493+ semigroupList,
494+ semigroupNonEmptyList,
495+ showList,
496+ showNonEmptyList,
497+ showStep,
498+ step,
499+ toList,
500+ traversableList,
501+ traversableNonEmpty,
502+ traversableNonEmptyList,
503+ traversableWithIndexList,
504+ traversableWithIndexNonEmptyList,
505+ traverseWithIndex,
506+ unfoldable1List,
507+ unfoldable1NonEmptyList,
508+ unfoldableList,
509+ unfoldr1
510+};
.storybook/purescript-indexer/output-es/Data.List.Lazy/index.jsnew file+641
@@ -0,0 +1,641 @@
1+// | This module defines a type of _lazy_ linked lists, and associated helper
2+// | functions and type class instances.
3+// |
4+// | _Note_: Depending on your use-case, you may prefer to use
5+// | `Data.Sequence` instead, which might give better performance for certain
6+// | use cases. This module is an improvement over `Data.Array` when working with
7+// | immutable lists of data in a purely-functional setting, but does not have
8+// | good random-access performance.
9+import * as $runtime from "../runtime.js";
10+import * as Control$dMonad$dRec$dClass from "../Control.Monad.Rec.Class/index.js";
11+import * as Data$dLazy from "../Data.Lazy/index.js";
12+import * as Data$dList$dInternal from "../Data.List.Internal/index.js";
13+import * as Data$dList$dLazy$dTypes from "../Data.List.Lazy.Types/index.js";
14+import * as Data$dMaybe from "../Data.Maybe/index.js";
15+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
16+import * as Data$dTuple from "../Data.Tuple/index.js";
17+const tailRecM2 = f => a => b => Control$dMonad$dRec$dClass.monadRecMaybe.tailRecM(o => f(o.a)(o.b))({a: a, b: b});
18+const any = /* #__PURE__ */ (() => Data$dList$dLazy$dTypes.foldableList.foldMap((() => {
19+ const semigroupDisj1 = {append: v => v1 => v || v1};
20+ return {mempty: false, Semigroup0: () => semigroupDisj1};
21+})()))();
22+const identity = x => x;
23+const Pattern = x => x;
24+const zipWith = f => xs => ys => {
25+ const $3 = Data$dLazy.defer(v => {
26+ const $4 = Data$dLazy.force(xs);
27+ return v1 => {
28+ if ($4.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
29+ if (v1.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
30+ if ($4.tag === "Cons") {
31+ if (v1.tag === "Cons") { return Data$dList$dLazy$dTypes.$Step("Cons", f($4._1)(v1._1), zipWith(f)($4._2)(v1._2)); }
32+ $runtime.fail();
33+ }
34+ $runtime.fail();
35+ };
36+ });
37+ return Data$dLazy.defer(v => Data$dLazy.force($3)(Data$dLazy.force(ys)));
38+};
39+const zipWithA = dictApplicative => {
40+ const sequence1 = Data$dList$dLazy$dTypes.traversableList.traverse(dictApplicative)(Data$dList$dLazy$dTypes.identity);
41+ return f => xs => ys => sequence1(zipWith(f)(xs)(ys));
42+};
43+const zip = /* #__PURE__ */ zipWith(Data$dTuple.Tuple);
44+const updateAt = n => x => xs => Data$dLazy.defer(v => {
45+ const $4 = Data$dLazy.force(xs);
46+ if ($4.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
47+ if ($4.tag === "Cons") {
48+ if (n === 0) { return Data$dList$dLazy$dTypes.$Step("Cons", x, $4._2); }
49+ return Data$dList$dLazy$dTypes.$Step("Cons", $4._1, updateAt(n - 1 | 0)(x)($4._2));
50+ }
51+ $runtime.fail();
52+});
53+const unzip = /* #__PURE__ */ (() => Data$dList$dLazy$dTypes.foldableList.foldr(v => v1 => Data$dTuple.$Tuple(
54+ Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v._1, v1._1)),
55+ Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v._2, v1._2))
56+))(Data$dTuple.$Tuple(Data$dList$dLazy$dTypes.nil, Data$dList$dLazy$dTypes.nil)))();
57+const uncons = xs => {
58+ const v = Data$dLazy.force(xs);
59+ if (v.tag === "Nil") { return Data$dMaybe.Nothing; }
60+ if (v.tag === "Cons") { return Data$dMaybe.$Maybe("Just", {head: v._1, tail: v._2}); }
61+ $runtime.fail();
62+};
63+const toUnfoldable = dictUnfoldable => dictUnfoldable.unfoldr(xs => {
64+ const $2 = uncons(xs);
65+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple($2._1.head, $2._1.tail)); }
66+ return Data$dMaybe.Nothing;
67+});
68+const takeWhile = p => Data$dLazy.functorLazy.map(v => {
69+ if (v.tag === "Cons") {
70+ if (p(v._1)) { return Data$dList$dLazy$dTypes.$Step("Cons", v._1, takeWhile(p)(v._2)); }
71+ return Data$dList$dLazy$dTypes.Nil;
72+ }
73+ return Data$dList$dLazy$dTypes.Nil;
74+});
75+const take = n => {
76+ if (n <= 0) { return v => Data$dList$dLazy$dTypes.nil; }
77+ return Data$dLazy.functorLazy.map(v1 => {
78+ if (v1.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
79+ if (v1.tag === "Cons") { return Data$dList$dLazy$dTypes.$Step("Cons", v1._1, take(n - 1 | 0)(v1._2)); }
80+ $runtime.fail();
81+ });
82+};
83+const tail = xs => {
84+ const $1 = uncons(xs);
85+ if ($1.tag === "Just") { return Data$dMaybe.$Maybe("Just", $1._1.tail); }
86+ return Data$dMaybe.Nothing;
87+};
88+const stripPrefix = dictEq => v => s => tailRecM2(prefix => input => {
89+ const v1 = Data$dLazy.force(prefix);
90+ if (v1.tag === "Nil") { return Data$dMaybe.$Maybe("Just", Control$dMonad$dRec$dClass.$Step("Done", input)); }
91+ if (v1.tag === "Cons") {
92+ const v2 = Data$dLazy.force(input);
93+ if (v2.tag === "Cons") {
94+ if (dictEq.eq(v1._1)(v2._1)) { return Data$dMaybe.$Maybe("Just", Control$dMonad$dRec$dClass.$Step("Loop", {a: v1._2, b: v2._2})); }
95+ return Data$dMaybe.Nothing;
96+ }
97+ return Data$dMaybe.Nothing;
98+ }
99+ $runtime.fail();
100+})(v)(s);
101+const span = p => xs => {
102+ const v = uncons(xs);
103+ if (v.tag === "Just") {
104+ if (p(v._1.head)) {
105+ const v1 = span(p)(v._1.tail);
106+ return {init: Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v._1.head, v1.init)), rest: v1.rest};
107+ }
108+ return {init: Data$dList$dLazy$dTypes.nil, rest: xs};
109+ }
110+ return {init: Data$dList$dLazy$dTypes.nil, rest: xs};
111+};
112+const snoc = xs => x => Data$dList$dLazy$dTypes.foldableList.foldr(Data$dList$dLazy$dTypes.cons)(Data$dLazy.defer(v => Data$dList$dLazy$dTypes.$Step(
113+ "Cons",
114+ x,
115+ Data$dList$dLazy$dTypes.nil
116+)))(xs);
117+const singleton = a => Data$dLazy.defer(v => Data$dList$dLazy$dTypes.$Step("Cons", a, Data$dList$dLazy$dTypes.nil));
118+const showPattern = dictShow => {
119+ const show = Data$dList$dLazy$dTypes.showList(dictShow).show;
120+ return {show: v => "(Pattern " + (show(v) + ")")};
121+};
122+const scanlLazy = f => acc => xs => Data$dLazy.defer(v => {
123+ const $4 = Data$dLazy.force(xs);
124+ if ($4.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
125+ if ($4.tag === "Cons") {
126+ const acc$p = f(acc)($4._1);
127+ return Data$dList$dLazy$dTypes.$Step("Cons", acc$p, scanlLazy(f)(acc$p)($4._2));
128+ }
129+ $runtime.fail();
130+});
131+const reverse = xs => Data$dLazy.defer(x => Data$dLazy.force(Data$dList$dLazy$dTypes.foldableList.foldl(b => a => Data$dLazy.defer(v => Data$dList$dLazy$dTypes.$Step("Cons", a, b)))(Data$dList$dLazy$dTypes.nil)(xs)));
132+const replicateM = dictMonad => {
133+ const pure1 = dictMonad.Applicative0().pure;
134+ const bind2 = dictMonad.Bind1().bind;
135+ return n => m => {
136+ if (n < 1) { return pure1(Data$dList$dLazy$dTypes.nil); }
137+ return bind2(m)(a => bind2(replicateM(dictMonad)(n - 1 | 0)(m))(as => pure1(Data$dLazy.defer(v => Data$dList$dLazy$dTypes.$Step("Cons", a, as)))));
138+ };
139+};
140+const repeat = x => {
141+ const go$lazy = $runtime.binding(() => Data$dLazy.defer(x$1 => Data$dLazy.force(Data$dLazy.defer(v => Data$dList$dLazy$dTypes.$Step("Cons", x, go$lazy())))));
142+ const go = go$lazy();
143+ return go;
144+};
145+const replicate = i => xs => take(i)(repeat(xs));
146+const range = start => end => {
147+ if (start > end) {
148+ return Data$dList$dLazy$dTypes.unfoldableList.unfoldr(x => {
149+ if (x >= end) { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(x, x - 1 | 0)); }
150+ return Data$dMaybe.Nothing;
151+ })(start);
152+ }
153+ return Data$dList$dLazy$dTypes.unfoldableList.unfoldr(x => {
154+ if (x <= end) { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(x, x + 1 | 0)); }
155+ return Data$dMaybe.Nothing;
156+ })(start);
157+};
158+const partition = f => Data$dList$dLazy$dTypes.foldableList.foldr(x => v => {
159+ if (f(x)) { return {yes: Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", x, v.yes)), no: v.no}; }
160+ return {yes: v.yes, no: Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", x, v.no))};
161+})({yes: Data$dList$dLazy$dTypes.nil, no: Data$dList$dLazy$dTypes.nil});
162+const $$null = x => {
163+ const $1 = uncons(x);
164+ if ($1.tag === "Nothing") { return true; }
165+ if ($1.tag === "Just") { return false; }
166+ $runtime.fail();
167+};
168+const nubBy = p => {
169+ const goStep = v => v1 => {
170+ if (v1.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
171+ if (v1.tag === "Cons") {
172+ const v2 = Data$dList$dInternal.insertAndLookupBy(p)(v1._1)(v);
173+ if (v2.found) { return Data$dLazy.force(go(v2.result)(v1._2)); }
174+ return Data$dList$dLazy$dTypes.$Step("Cons", v1._1, go(v2.result)(v1._2));
175+ }
176+ $runtime.fail();
177+ };
178+ const go = s => v => {
179+ const $4 = goStep(s);
180+ return Data$dLazy.defer(v$1 => $4(Data$dLazy.force(v)));
181+ };
182+ return go(Data$dList$dInternal.Leaf);
183+};
184+const nub = dictOrd => nubBy(dictOrd.compare);
185+const newtypePattern = {Coercible0: () => undefined};
186+const mapMaybe = f => {
187+ const go = go$a0$copy => {
188+ let go$a0 = go$a0$copy, go$c = true, go$r;
189+ while (go$c) {
190+ const v = go$a0;
191+ if (v.tag === "Nil") {
192+ go$c = false;
193+ go$r = Data$dList$dLazy$dTypes.Nil;
194+ continue;
195+ }
196+ if (v.tag === "Cons") {
197+ const v1 = f(v._1);
198+ if (v1.tag === "Nothing") {
199+ go$a0 = Data$dLazy.force(v._2);
200+ continue;
201+ }
202+ if (v1.tag === "Just") {
203+ go$c = false;
204+ go$r = Data$dList$dLazy$dTypes.$Step("Cons", v1._1, mapMaybe(f)(v._2));
205+ continue;
206+ }
207+ $runtime.fail();
208+ }
209+ $runtime.fail();
210+ };
211+ return go$r;
212+ };
213+ return x => Data$dLazy.defer(v => go(Data$dLazy.force(x)));
214+};
215+const some = dictAlternative => {
216+ const apply1 = dictAlternative.Applicative0().Apply0().apply;
217+ const map3 = dictAlternative.Plus1().Alt0().Functor0().map;
218+ return dictLazy => v => apply1(map3(Data$dList$dLazy$dTypes.cons)(v))(dictLazy.defer(v1 => many(dictAlternative)(dictLazy)(v)));
219+};
220+const many = dictAlternative => {
221+ const alt = dictAlternative.Plus1().Alt0().alt;
222+ const pure1 = dictAlternative.Applicative0().pure;
223+ return dictLazy => v => alt(some(dictAlternative)(dictLazy)(v))(pure1(Data$dList$dLazy$dTypes.nil));
224+};
225+const length = /* #__PURE__ */ (() => Data$dList$dLazy$dTypes.foldableList.foldl(l => v => l + 1 | 0)(0))();
226+const last = /* #__PURE__ */ (() => {
227+ const go = go$a0$copy => {
228+ let go$a0 = go$a0$copy, go$c = true, go$r;
229+ while (go$c) {
230+ const v = go$a0;
231+ if (v.tag === "Cons") {
232+ if (
233+ (() => {
234+ const $2 = uncons(v._2);
235+ if ($2.tag === "Nothing") { return true; }
236+ if ($2.tag === "Just") { return false; }
237+ $runtime.fail();
238+ })()
239+ ) {
240+ go$c = false;
241+ go$r = Data$dMaybe.$Maybe("Just", v._1);
242+ continue;
243+ }
244+ go$a0 = Data$dLazy.force(v._2);
245+ continue;
246+ }
247+ go$c = false;
248+ go$r = Data$dMaybe.Nothing;
249+ continue;
250+ };
251+ return go$r;
252+ };
253+ return x => go(Data$dLazy.force(x));
254+})();
255+const iterate = f => x => {
256+ const go$lazy = $runtime.binding(() => Data$dLazy.defer(x$1 => Data$dLazy.force((() => {
257+ const $4 = Data$dList$dLazy$dTypes.functorList.map(f)(go$lazy());
258+ return Data$dLazy.defer(v => Data$dList$dLazy$dTypes.$Step("Cons", x, $4));
259+ })())));
260+ const go = go$lazy();
261+ return go;
262+};
263+const insertAt = v => v1 => v2 => {
264+ if (v === 0) { return Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v1, v2)); }
265+ return Data$dLazy.defer(v$1 => {
266+ const $4 = Data$dLazy.force(v2);
267+ if ($4.tag === "Nil") { return Data$dList$dLazy$dTypes.$Step("Cons", v1, Data$dList$dLazy$dTypes.nil); }
268+ if ($4.tag === "Cons") { return Data$dList$dLazy$dTypes.$Step("Cons", $4._1, insertAt(v - 1 | 0)(v1)($4._2)); }
269+ $runtime.fail();
270+ });
271+};
272+const init = /* #__PURE__ */ (() => {
273+ const go = v => {
274+ if (v.tag === "Cons") {
275+ if (
276+ (() => {
277+ const $2 = uncons(v._2);
278+ if ($2.tag === "Nothing") { return true; }
279+ if ($2.tag === "Just") { return false; }
280+ $runtime.fail();
281+ })()
282+ ) {
283+ return Data$dMaybe.$Maybe("Just", Data$dList$dLazy$dTypes.nil);
284+ }
285+ const $2 = go(Data$dLazy.force(v._2));
286+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v._1, $2._1))); }
287+ return Data$dMaybe.Nothing;
288+ }
289+ return Data$dMaybe.Nothing;
290+ };
291+ return x => go(Data$dLazy.force(x));
292+})();
293+const index = xs => {
294+ const go = go$a0$copy => go$a1$copy => {
295+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
296+ while (go$c) {
297+ const v = go$a0, v1 = go$a1;
298+ if (v.tag === "Nil") {
299+ go$c = false;
300+ go$r = Data$dMaybe.Nothing;
301+ continue;
302+ }
303+ if (v.tag === "Cons") {
304+ if (v1 === 0) {
305+ go$c = false;
306+ go$r = Data$dMaybe.$Maybe("Just", v._1);
307+ continue;
308+ }
309+ go$a0 = Data$dLazy.force(v._2);
310+ go$a1 = v1 - 1 | 0;
311+ continue;
312+ }
313+ $runtime.fail();
314+ };
315+ return go$r;
316+ };
317+ return go(Data$dLazy.force(xs));
318+};
319+const head = xs => {
320+ const $1 = uncons(xs);
321+ if ($1.tag === "Just") { return Data$dMaybe.$Maybe("Just", $1._1.head); }
322+ return Data$dMaybe.Nothing;
323+};
324+const transpose = xs => {
325+ const v = uncons(xs);
326+ if (v.tag === "Nothing") { return xs; }
327+ if (v.tag === "Just") {
328+ const v1 = uncons(v._1.head);
329+ if (v1.tag === "Nothing") { return transpose(v._1.tail); }
330+ if (v1.tag === "Just") {
331+ const $3 = mapMaybe(head)(v._1.tail);
332+ const $4 = Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v1._1.head, $3));
333+ const $5 = transpose((() => {
334+ const $5 = mapMaybe(tail)(v._1.tail);
335+ return Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v1._1.tail, $5));
336+ })());
337+ return Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", $4, $5));
338+ }
339+ $runtime.fail();
340+ }
341+ $runtime.fail();
342+};
343+const groupBy = eq => Data$dLazy.functorLazy.map(v => {
344+ if (v.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
345+ if (v.tag === "Cons") {
346+ const v1 = span(eq(v._1))(v._2);
347+ return Data$dList$dLazy$dTypes.$Step("Cons", Data$dLazy.defer(v2 => Data$dNonEmpty.$NonEmpty(v._1, v1.init)), groupBy(eq)(v1.rest));
348+ }
349+ $runtime.fail();
350+});
351+const group = dictEq => groupBy(dictEq.eq);
352+const insertBy = cmp => x => xs => Data$dLazy.defer(v => {
353+ const $4 = Data$dLazy.force(xs);
354+ if ($4.tag === "Nil") { return Data$dList$dLazy$dTypes.$Step("Cons", x, Data$dList$dLazy$dTypes.nil); }
355+ if ($4.tag === "Cons") {
356+ if (cmp(x)($4._1).tag === "GT") { return Data$dList$dLazy$dTypes.$Step("Cons", $4._1, insertBy(cmp)(x)($4._2)); }
357+ return Data$dList$dLazy$dTypes.$Step("Cons", x, Data$dLazy.defer(v$1 => $4));
358+ }
359+ $runtime.fail();
360+});
361+const insert = dictOrd => insertBy(dictOrd.compare);
362+const fromFoldable = dictFoldable => dictFoldable.foldr(Data$dList$dLazy$dTypes.cons)(Data$dList$dLazy$dTypes.nil);
363+const foldrLazy = dictLazy => op => z => {
364+ const go = xs => {
365+ const v = Data$dLazy.force(xs);
366+ if (v.tag === "Cons") { return dictLazy.defer(v1 => op(v._1)(go(v._2))); }
367+ if (v.tag === "Nil") { return z; }
368+ $runtime.fail();
369+ };
370+ return go;
371+};
372+const foldM = dictMonad => {
373+ const pure1 = dictMonad.Applicative0().pure;
374+ const bind2 = dictMonad.Bind1().bind;
375+ return f => b => xs => {
376+ const v = uncons(xs);
377+ if (v.tag === "Nothing") { return pure1(b); }
378+ if (v.tag === "Just") { return bind2(f(b)(v._1.head))(b$p => foldM(dictMonad)(f)(b$p)(v._1.tail)); }
379+ $runtime.fail();
380+ };
381+};
382+const findIndex = fn => {
383+ const go = go$a0$copy => go$a1$copy => {
384+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
385+ while (go$c) {
386+ const n = go$a0, list = go$a1;
387+ const $4 = uncons(list);
388+ if ($4.tag === "Just") {
389+ if (fn($4._1.head)) {
390+ go$c = false;
391+ go$r = Data$dMaybe.$Maybe("Just", n);
392+ continue;
393+ }
394+ go$a0 = n + 1 | 0;
395+ go$a1 = $4._1.tail;
396+ continue;
397+ }
398+ if ($4.tag === "Nothing") {
399+ go$c = false;
400+ go$r = Data$dMaybe.Nothing;
401+ continue;
402+ }
403+ $runtime.fail();
404+ };
405+ return go$r;
406+ };
407+ return go(0);
408+};
409+const findLastIndex = fn => xs => {
410+ const $2 = findIndex(fn)(reverse(xs));
411+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", (length(xs) - 1 | 0) - $2._1 | 0); }
412+ return Data$dMaybe.Nothing;
413+};
414+const filterM = dictMonad => {
415+ const pure1 = dictMonad.Applicative0().pure;
416+ const bind2 = dictMonad.Bind1().bind;
417+ return p => list => {
418+ const v = uncons(list);
419+ if (v.tag === "Nothing") { return pure1(Data$dList$dLazy$dTypes.nil); }
420+ if (v.tag === "Just") {
421+ return bind2(p(v._1.head))(b => bind2(filterM(dictMonad)(p)(v._1.tail))(xs$p => pure1((() => {
422+ if (b) { return Data$dLazy.defer(v$1 => Data$dList$dLazy$dTypes.$Step("Cons", v._1.head, xs$p)); }
423+ return xs$p;
424+ })())));
425+ }
426+ $runtime.fail();
427+ };
428+};
429+const filter = p => {
430+ const go = go$a0$copy => {
431+ let go$a0 = go$a0$copy, go$c = true, go$r;
432+ while (go$c) {
433+ const v = go$a0;
434+ if (v.tag === "Nil") {
435+ go$c = false;
436+ go$r = Data$dList$dLazy$dTypes.Nil;
437+ continue;
438+ }
439+ if (v.tag === "Cons") {
440+ if (p(v._1)) {
441+ go$c = false;
442+ go$r = Data$dList$dLazy$dTypes.$Step("Cons", v._1, filter(p)(v._2));
443+ continue;
444+ }
445+ go$a0 = Data$dLazy.force(v._2);
446+ continue;
447+ }
448+ $runtime.fail();
449+ };
450+ return go$r;
451+ };
452+ return x => Data$dLazy.defer(v => go(Data$dLazy.force(x)));
453+};
454+const intersectBy = eq => xs => ys => filter(x => any(eq(x))(ys))(xs);
455+const intersect = dictEq => intersectBy(dictEq.eq);
456+const nubByEq = eq => Data$dLazy.functorLazy.map(v => {
457+ if (v.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
458+ if (v.tag === "Cons") { return Data$dList$dLazy$dTypes.$Step("Cons", v._1, nubByEq(eq)(filter(y => !eq(v._1)(y))(v._2))); }
459+ $runtime.fail();
460+});
461+const nubEq = dictEq => nubByEq(dictEq.eq);
462+const eqPattern = dictEq => ({eq: x => y => Data$dList$dLazy$dTypes.eq1List.eq1(dictEq)(x)(y)});
463+const ordPattern = dictOrd => {
464+ const compare = Data$dList$dLazy$dTypes.ordList(dictOrd).compare;
465+ const $2 = dictOrd.Eq0();
466+ const eqPattern1 = {eq: x => y => Data$dList$dLazy$dTypes.eq1List.eq1($2)(x)(y)};
467+ return {compare: x => y => compare(x)(y), Eq0: () => eqPattern1};
468+};
469+const elemLastIndex = dictEq => x => findLastIndex(v => dictEq.eq(v)(x));
470+const elemIndex = dictEq => x => findIndex(v => dictEq.eq(v)(x));
471+const dropWhile = p => {
472+ const go = go$a0$copy => {
473+ let go$a0 = go$a0$copy, go$c = true, go$r;
474+ while (go$c) {
475+ const v = go$a0;
476+ if (v.tag === "Cons") {
477+ if (p(v._1)) {
478+ go$a0 = Data$dLazy.force(v._2);
479+ continue;
480+ }
481+ go$c = false;
482+ go$r = Data$dLazy.defer(v$1 => v);
483+ continue;
484+ }
485+ go$c = false;
486+ go$r = Data$dLazy.defer(v$1 => v);
487+ continue;
488+ };
489+ return go$r;
490+ };
491+ return x => go(Data$dLazy.force(x));
492+};
493+const drop = n => {
494+ const go = go$a0$copy => go$a1$copy => {
495+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
496+ while (go$c) {
497+ const v = go$a0, v1 = go$a1;
498+ if (v === 0) {
499+ go$c = false;
500+ go$r = v1;
501+ continue;
502+ }
503+ if (v1.tag === "Nil") {
504+ go$c = false;
505+ go$r = Data$dList$dLazy$dTypes.Nil;
506+ continue;
507+ }
508+ if (v1.tag === "Cons") {
509+ go$a0 = v - 1 | 0;
510+ go$a1 = Data$dLazy.force(v1._2);
511+ continue;
512+ }
513+ $runtime.fail();
514+ };
515+ return go$r;
516+ };
517+ return Data$dLazy.functorLazy.map(go(n));
518+};
519+const slice = start => end => xs => take(end - start | 0)(drop(start)(xs));
520+const deleteBy = eq => x => xs => Data$dLazy.defer(v => {
521+ const $4 = Data$dLazy.force(xs);
522+ if ($4.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
523+ if ($4.tag === "Cons") {
524+ if (eq(x)($4._1)) { return Data$dLazy.force($4._2); }
525+ return Data$dList$dLazy$dTypes.$Step("Cons", $4._1, deleteBy(eq)(x)($4._2));
526+ }
527+ $runtime.fail();
528+});
529+const unionBy = eq => xs => ys => Data$dList$dLazy$dTypes.semigroupList.append(xs)(Data$dList$dLazy$dTypes.foldableList.foldl(b => a => deleteBy(eq)(a)(b))(nubByEq(eq)(ys))(xs));
530+const union = dictEq => unionBy(dictEq.eq);
531+const deleteAt = n => xs => Data$dLazy.defer(v => {
532+ const $3 = Data$dLazy.force(xs);
533+ if ($3.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
534+ if ($3.tag === "Cons") {
535+ if (n === 0) { return Data$dLazy.force($3._2); }
536+ return Data$dList$dLazy$dTypes.$Step("Cons", $3._1, deleteAt(n - 1 | 0)($3._2));
537+ }
538+ $runtime.fail();
539+});
540+const $$delete = dictEq => deleteBy(dictEq.eq);
541+const difference = dictEq => Data$dList$dLazy$dTypes.foldableList.foldl(b => a => deleteBy(dictEq.eq)(a)(b));
542+const cycle = xs => {
543+ const go$lazy = $runtime.binding(() => Data$dLazy.defer(x => Data$dLazy.force(Data$dList$dLazy$dTypes.semigroupList.append(xs)(go$lazy()))));
544+ const go = go$lazy();
545+ return go;
546+};
547+const concatMap = b => a => Data$dList$dLazy$dTypes.bindList.bind(a)(b);
548+const concat = v => Data$dList$dLazy$dTypes.bindList.bind(v)(identity);
549+const catMaybes = /* #__PURE__ */ mapMaybe(identity);
550+const alterAt = n => f => xs => Data$dLazy.defer(v => {
551+ const $4 = Data$dLazy.force(xs);
552+ if ($4.tag === "Nil") { return Data$dList$dLazy$dTypes.Nil; }
553+ if ($4.tag === "Cons") {
554+ if (n === 0) {
555+ const v2 = f($4._1);
556+ if (v2.tag === "Nothing") { return Data$dLazy.force($4._2); }
557+ if (v2.tag === "Just") { return Data$dList$dLazy$dTypes.$Step("Cons", v2._1, $4._2); }
558+ $runtime.fail();
559+ }
560+ return Data$dList$dLazy$dTypes.$Step("Cons", $4._1, alterAt(n - 1 | 0)(f)($4._2));
561+ }
562+ $runtime.fail();
563+});
564+const modifyAt = n => f => alterAt(n)(x => Data$dMaybe.$Maybe("Just", f(x)));
565+export {
566+ Pattern,
567+ alterAt,
568+ any,
569+ catMaybes,
570+ concat,
571+ concatMap,
572+ cycle,
573+ $$delete as delete,
574+ deleteAt,
575+ deleteBy,
576+ difference,
577+ drop,
578+ dropWhile,
579+ elemIndex,
580+ elemLastIndex,
581+ eqPattern,
582+ filter,
583+ filterM,
584+ findIndex,
585+ findLastIndex,
586+ foldM,
587+ foldrLazy,
588+ fromFoldable,
589+ group,
590+ groupBy,
591+ head,
592+ identity,
593+ index,
594+ init,
595+ insert,
596+ insertAt,
597+ insertBy,
598+ intersect,
599+ intersectBy,
600+ iterate,
601+ last,
602+ length,
603+ many,
604+ mapMaybe,
605+ modifyAt,
606+ newtypePattern,
607+ nub,
608+ nubBy,
609+ nubByEq,
610+ nubEq,
611+ $$null as null,
612+ ordPattern,
613+ partition,
614+ range,
615+ repeat,
616+ replicate,
617+ replicateM,
618+ reverse,
619+ scanlLazy,
620+ showPattern,
621+ singleton,
622+ slice,
623+ snoc,
624+ some,
625+ span,
626+ stripPrefix,
627+ tail,
628+ tailRecM2,
629+ take,
630+ takeWhile,
631+ toUnfoldable,
632+ transpose,
633+ uncons,
634+ union,
635+ unionBy,
636+ unzip,
637+ updateAt,
638+ zip,
639+ zipWith,
640+ zipWithA
641+};
.storybook/purescript-indexer/output-es/Data.List.NonEmpty/index.jsnew file+268
@@ -0,0 +1,268 @@
1+import * as $runtime from "../runtime.js";
2+import * as Data$dList from "../Data.List/index.js";
3+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
4+import * as Data$dMaybe from "../Data.Maybe/index.js";
5+import * as Data$dNonEmpty from "../Data.NonEmpty/index.js";
6+import * as Data$dTuple from "../Data.Tuple/index.js";
7+import * as Partial from "../Partial/index.js";
8+const identity = x => x;
9+const zipWith = f => v => v1 => Data$dNonEmpty.$NonEmpty(f(v._1)(v1._1), Data$dList.zipWith(f)(v._2)(v1._2));
10+const zipWithA = dictApplicative => {
11+ const sequence11 = Data$dList$dTypes.traversable1NonEmptyList.traverse1(dictApplicative.Apply0())(Data$dList$dTypes.identity);
12+ return f => xs => ys => sequence11(zipWith(f)(xs)(ys));
13+};
14+const zip = /* #__PURE__ */ zipWith(Data$dTuple.Tuple);
15+const wrappedOperation2 = name => f => v => v1 => {
16+ const v2 = f(Data$dList$dTypes.$List("Cons", v._1, v._2))(Data$dList$dTypes.$List("Cons", v1._1, v1._2));
17+ if (v2.tag === "Cons") { return Data$dNonEmpty.$NonEmpty(v2._1, v2._2); }
18+ if (v2.tag === "Nil") { return Partial._crashWith("Impossible: empty list in NonEmptyList " + name); }
19+ $runtime.fail();
20+};
21+const wrappedOperation = name => f => v => {
22+ const v1 = f(Data$dList$dTypes.$List("Cons", v._1, v._2));
23+ if (v1.tag === "Cons") { return Data$dNonEmpty.$NonEmpty(v1._1, v1._2); }
24+ if (v1.tag === "Nil") { return Partial._crashWith("Impossible: empty list in NonEmptyList " + name); }
25+ $runtime.fail();
26+};
27+const updateAt = i => a => v => {
28+ if (i === 0) { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty(a, v._2)); }
29+ const $3 = Data$dList.updateAt(i - 1 | 0)(a)(v._2);
30+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty(v._1, $3._1)); }
31+ return Data$dMaybe.Nothing;
32+};
33+const unzip = ts => Data$dTuple.$Tuple(Data$dList$dTypes.functorNonEmptyList.map(Data$dTuple.fst)(ts), Data$dList$dTypes.functorNonEmptyList.map(Data$dTuple.snd)(ts));
34+const unsnoc = v => {
35+ const v1 = Data$dList.unsnoc(v._2);
36+ if (v1.tag === "Nothing") { return {init: Data$dList$dTypes.Nil, last: v._1}; }
37+ if (v1.tag === "Just") { return {init: Data$dList$dTypes.$List("Cons", v._1, v1._1.init), last: v1._1.last}; }
38+ $runtime.fail();
39+};
40+const unionBy = x => wrappedOperation2("unionBy")(Data$dList.unionBy(x));
41+const union = dictEq => wrappedOperation2("union")(Data$dList.union(dictEq));
42+const uncons = v => ({head: v._1, tail: v._2});
43+const toList = v => Data$dList$dTypes.$List("Cons", v._1, v._2);
44+const toUnfoldable = dictUnfoldable => {
45+ const $1 = dictUnfoldable.unfoldr(xs => {
46+ if (xs.tag === "Nil") { return Data$dMaybe.Nothing; }
47+ if (xs.tag === "Cons") { return Data$dMaybe.$Maybe("Just", Data$dTuple.$Tuple(xs._1, xs._2)); }
48+ $runtime.fail();
49+ });
50+ return x => $1(Data$dList$dTypes.$List("Cons", x._1, x._2));
51+};
52+const tail = v => v._2;
53+const sortBy = x => wrappedOperation("sortBy")(Data$dList.sortBy(x));
54+const sort = dictOrd => xs => wrappedOperation("sortBy")(Data$dList.sortBy(dictOrd.compare))(xs);
55+const snoc = v => y => Data$dNonEmpty.$NonEmpty(v._1, Data$dList$dTypes.foldableList.foldr(Data$dList$dTypes.Cons)(Data$dList$dTypes.$List("Cons", y, Data$dList$dTypes.Nil))(v._2));
56+const singleton = x => Data$dNonEmpty.$NonEmpty(x, Data$dList$dTypes.Nil);
57+const snoc$p = v => v1 => {
58+ if (v.tag === "Cons") {
59+ return Data$dNonEmpty.$NonEmpty(v._1, Data$dList$dTypes.foldableList.foldr(Data$dList$dTypes.Cons)(Data$dList$dTypes.$List("Cons", v1, Data$dList$dTypes.Nil))(v._2));
60+ }
61+ if (v.tag === "Nil") { return Data$dNonEmpty.$NonEmpty(v1, Data$dList$dTypes.Nil); }
62+ $runtime.fail();
63+};
64+const reverse = /* #__PURE__ */ wrappedOperation("reverse")(Data$dList.reverse);
65+const nubEq = dictEq => wrappedOperation("nubEq")(Data$dList.nubEq(dictEq));
66+const nubByEq = x => wrappedOperation("nubByEq")(Data$dList.nubByEq(x));
67+const nubBy = x => wrappedOperation("nubBy")(Data$dList.nubBy(x));
68+const nub = dictOrd => wrappedOperation("nub")(Data$dList.nubBy(dictOrd.compare));
69+const modifyAt = i => f => v => {
70+ if (i === 0) { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty(f(v._1), v._2)); }
71+ const $3 = Data$dList.alterAt(i - 1 | 0)(x => Data$dMaybe.$Maybe("Just", f(x)))(v._2);
72+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty(v._1, $3._1)); }
73+ return Data$dMaybe.Nothing;
74+};
75+const lift = f => v => f(Data$dList$dTypes.$List("Cons", v._1, v._2));
76+const mapMaybe = x => lift(Data$dList.mapMaybe(x));
77+const partition = x => lift(Data$dList.partition(x));
78+const span = x => lift(Data$dList.span(x));
79+const take = x => lift(Data$dList.take(x));
80+const takeWhile = x => lift(Data$dList.takeWhile(x));
81+const length = v => {
82+ const go = go$a0$copy => go$a1$copy => {
83+ let go$a0 = go$a0$copy, go$a1 = go$a1$copy, go$c = true, go$r;
84+ while (go$c) {
85+ const b = go$a0, v$1 = go$a1;
86+ if (v$1.tag === "Nil") {
87+ go$c = false;
88+ go$r = b;
89+ continue;
90+ }
91+ if (v$1.tag === "Cons") {
92+ go$a0 = b + 1 | 0;
93+ go$a1 = v$1._2;
94+ continue;
95+ }
96+ $runtime.fail();
97+ };
98+ return go$r;
99+ };
100+ return 1 + go(0)(v._2) | 0;
101+};
102+const last = v => {
103+ if (v._2.tag === "Cons") {
104+ if (v._2._2.tag === "Nil") { return v._2._1; }
105+ if (Data$dList.last(v._2._2).tag === "Nothing") { return v._1; }
106+ if (Data$dList.last(v._2._2).tag === "Just") { return Data$dList.last(v._2._2)._1; }
107+ $runtime.fail();
108+ }
109+ return v._1;
110+};
111+const intersectBy = x => wrappedOperation2("intersectBy")(Data$dList.intersectBy(x));
112+const intersect = dictEq => wrappedOperation2("intersect")(Data$dList.intersect(dictEq));
113+const insertAt = i => a => v => {
114+ if (i === 0) { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty(a, Data$dList$dTypes.$List("Cons", v._1, v._2))); }
115+ const $3 = Data$dList.insertAt(i - 1 | 0)(a)(v._2);
116+ if ($3.tag === "Just") { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty(v._1, $3._1)); }
117+ return Data$dMaybe.Nothing;
118+};
119+const init = v => {
120+ const $1 = Data$dList.unsnoc(v._2);
121+ if ($1.tag === "Just") { return Data$dList$dTypes.$List("Cons", v._1, $1._1.init); }
122+ return Data$dList$dTypes.Nil;
123+};
124+const index = v => i => {
125+ if (i === 0) { return Data$dMaybe.$Maybe("Just", v._1); }
126+ return Data$dList.index(v._2)(i - 1 | 0);
127+};
128+const head = v => v._1;
129+const groupBy = x => wrappedOperation("groupBy")(Data$dList.groupBy(x));
130+const groupAllBy = x => wrappedOperation("groupAllBy")(Data$dList.groupAllBy(x));
131+const groupAll = dictOrd => wrappedOperation("groupAll")(Data$dList.groupAll(dictOrd));
132+const group = dictEq => wrappedOperation("group")(Data$dList.group(dictEq));
133+const fromList = v => {
134+ if (v.tag === "Nil") { return Data$dMaybe.Nothing; }
135+ if (v.tag === "Cons") { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty(v._1, v._2)); }
136+ $runtime.fail();
137+};
138+const fromFoldable = dictFoldable => {
139+ const $1 = dictFoldable.foldr(Data$dList$dTypes.Cons)(Data$dList$dTypes.Nil);
140+ return x => {
141+ const $3 = $1(x);
142+ if ($3.tag === "Nil") { return Data$dMaybe.Nothing; }
143+ if ($3.tag === "Cons") { return Data$dMaybe.$Maybe("Just", Data$dNonEmpty.$NonEmpty($3._1, $3._2)); }
144+ $runtime.fail();
145+ };
146+};
147+const foldM = dictMonad => {
148+ const bind1 = dictMonad.Bind1().bind;
149+ const foldM1 = Data$dList.foldM(dictMonad);
150+ return f => b => v => bind1(f(b)(v._1))(b$p => foldM1(f)(b$p)(v._2));
151+};
152+const findLastIndex = f => v => {
153+ const v1 = Data$dList.findLastIndex(f)(v._2);
154+ if (v1.tag === "Just") { return Data$dMaybe.$Maybe("Just", v1._1 + 1 | 0); }
155+ if (v1.tag === "Nothing") {
156+ if (f(v._1)) { return Data$dMaybe.$Maybe("Just", 0); }
157+ return Data$dMaybe.Nothing;
158+ }
159+ $runtime.fail();
160+};
161+const findIndex = f => v => {
162+ if (f(v._1)) { return Data$dMaybe.$Maybe("Just", 0); }
163+ const $2 = Data$dList.findIndex(f)(v._2);
164+ if ($2.tag === "Just") { return Data$dMaybe.$Maybe("Just", $2._1 + 1 | 0); }
165+ return Data$dMaybe.Nothing;
166+};
167+const filterM = dictMonad => {
168+ const $1 = Data$dList.filterM(dictMonad);
169+ return x => lift($1(x));
170+};
171+const filter = x => lift(Data$dList.filter(x));
172+const elemLastIndex = dictEq => x => findLastIndex(v => dictEq.eq(v)(x));
173+const elemIndex = dictEq => x => findIndex(v => dictEq.eq(v)(x));
174+const dropWhile = x => lift((() => {
175+ const go = go$a0$copy => {
176+ let go$a0 = go$a0$copy, go$c = true, go$r;
177+ while (go$c) {
178+ const v = go$a0;
179+ if (v.tag === "Cons") {
180+ if (x(v._1)) {
181+ go$a0 = v._2;
182+ continue;
183+ }
184+ go$c = false;
185+ go$r = v;
186+ continue;
187+ }
188+ go$c = false;
189+ go$r = v;
190+ continue;
191+ };
192+ return go$r;
193+ };
194+ return go;
195+})());
196+const drop = x => lift(Data$dList.drop(x));
197+const cons$p = x => xs => Data$dNonEmpty.$NonEmpty(x, xs);
198+const cons = y => v => Data$dNonEmpty.$NonEmpty(y, Data$dList$dTypes.$List("Cons", v._1, v._2));
199+const concatMap = b => a => Data$dList$dTypes.bindNonEmptyList.bind(a)(b);
200+const concat = v => Data$dList$dTypes.bindNonEmptyList.bind(v)(identity);
201+const catMaybes = /* #__PURE__ */ lift(Data$dList.catMaybes);
202+const appendFoldable = dictFoldable => {
203+ const fromFoldable1 = dictFoldable.foldr(Data$dList$dTypes.Cons)(Data$dList$dTypes.Nil);
204+ return v => ys => Data$dNonEmpty.$NonEmpty(v._1, Data$dList$dTypes.foldableList.foldr(Data$dList$dTypes.Cons)(fromFoldable1(ys))(v._2));
205+};
206+export {
207+ appendFoldable,
208+ catMaybes,
209+ concat,
210+ concatMap,
211+ cons,
212+ cons$p,
213+ drop,
214+ dropWhile,
215+ elemIndex,
216+ elemLastIndex,
217+ filter,
218+ filterM,
219+ findIndex,
220+ findLastIndex,
221+ foldM,
222+ fromFoldable,
223+ fromList,
224+ group,
225+ groupAll,
226+ groupAllBy,
227+ groupBy,
228+ head,
229+ identity,
230+ index,
231+ init,
232+ insertAt,
233+ intersect,
234+ intersectBy,
235+ last,
236+ length,
237+ lift,
238+ mapMaybe,
239+ modifyAt,
240+ nub,
241+ nubBy,
242+ nubByEq,
243+ nubEq,
244+ partition,
245+ reverse,
246+ singleton,
247+ snoc,
248+ snoc$p,
249+ sort,
250+ sortBy,
251+ span,
252+ tail,
253+ take,
254+ takeWhile,
255+ toList,
256+ toUnfoldable,
257+ uncons,
258+ union,
259+ unionBy,
260+ unsnoc,
261+ unzip,
262+ updateAt,
263+ wrappedOperation,
264+ wrappedOperation2,
265+ zip,
266+ zipWith,
267+ zipWithA
268+};
.storybook/purescript-indexer/output-es/Data.List.Partial/index.jsnew file+37
@@ -0,0 +1,37 @@
1+// | Partial helper functions for working with strict linked lists.
2+import * as $runtime from "../runtime.js";
3+import * as Data$dList$dTypes from "../Data.List.Types/index.js";
4+const tail = () => v => {
5+ if (v.tag === "Cons") { return v._2; }
6+ $runtime.fail();
7+};
8+const last = last$a0$copy => last$a1$copy => {
9+ let last$a0 = last$a0$copy, last$a1 = last$a1$copy, last$c = true, last$r;
10+ while (last$c) {
11+ const $__unused = last$a0, v = last$a1;
12+ if (v.tag === "Cons") {
13+ if (v._2.tag === "Nil") {
14+ last$c = false;
15+ last$r = v._1;
16+ continue;
17+ }
18+ last$a0 = undefined;
19+ last$a1 = v._2;
20+ continue;
21+ }
22+ $runtime.fail();
23+ };
24+ return last$r;
25+};
26+const init = () => v => {
27+ if (v.tag === "Cons") {
28+ if (v._2.tag === "Nil") { return Data$dList$dTypes.Nil; }
29+ return Data$dList$dTypes.$List("Cons", v._1, init()(v._2));
30+ }
31+ $runtime.fail();
32+};
33+const head = () => v => {
34+ if (v.tag === "Cons") { return v._1; }
35+ $runtime.fail();
36+};
37+export {head, init, last, tail};
.storybook/purescript-indexer/output-es/Data.List.Types/index.jsnew file+947

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.List.ZipList/index.jsnew file+47

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.List/index.jsnew file+1042

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Map.Gen/index.jsnew file+16

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Map.Internal/index.jsnew file+1729

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Map/index.jsnew file+48

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Maybe.First/index.jsnew file+68

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Maybe.Last/index.jsnew file+69

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Maybe/index.jsnew file+232

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Additive/index.jsnew file+34

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Alternate/index.jsnew file+47

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Conj/index.jsnew file+22

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Disj/index.jsnew file+22

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Dual/index.jsnew file+20

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Endo/index.jsnew file+13

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Generic/index.jsnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid.Multiplicative/index.jsnew file+34

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Monoid/index.jsnew file+61

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.NaturalTransformation/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Newtype/index.jsnew file+52

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.NonEmpty/index.jsnew file+213

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Nullable/foreign.jsnew file+12

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Nullable/index.jsnew file+49

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Number.Approximate/index.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Number.Format/foreign.jsnew file+12

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Number.Format/index.jsnew file+53

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Number/foreign.jsnew file+80

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Number/index.jsnew file+16

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Op/index.jsnew file+13

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ord.Down/index.jsnew file+24

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ord.Generic/index.jsnew file+35

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ord.Max/index.jsnew file+34

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ord.Min/index.jsnew file+34

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ord/foreign.jsnew file+43

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ord/index.jsnew file+159

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ordering/index.jsnew file+36

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Posix.Signal/index.jsnew file+409

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Posix/index.jsnew file+20

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Predicate/index.jsnew file+15

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Choice/index.jsnew file+34

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Closed/index.jsnew file+6

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Cochoice/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Costrong/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Join/index.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Split/index.jsnew file+12

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Star/index.jsnew file+232

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor.Strong/index.jsnew file+22

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Profunctor/index.jsnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Reflectable/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Reflectable/index.jsnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ring.Generic/index.jsnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ring/foreign.jsnew file+12

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Ring/index.jsnew file+42

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semigroup.First/index.jsnew file+15

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semigroup.Foldable/index.jsnew file+131

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semigroup.Generic/index.jsnew file+12

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semigroup.Last/index.jsnew file+15

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semigroup.Traversable/index.jsnew file+61

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semigroup/foreign.jsnew file+13

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semigroup/index.jsnew file+27

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semiring.Generic/index.jsnew file+49

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semiring/foreign.jsnew file+25

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Semiring/index.jsnew file+64

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Set.NonEmpty/index.jsnew file+142

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Set/index.jsnew file+228

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Show.Generic/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Show.Generic/index.jsnew file+44

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Show/foreign.jsnew file+59

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Show/index.jsnew file+57

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.CaseInsensitive/index.jsnew file+13

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.CodePoints/foreign.jsnew file+107

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.CodePoints/index.jsnew file+209

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.CodeUnits/foreign.jsnew file+116

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.CodeUnits/index.jsnew file+55

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Common/foreign.jsnew file+52

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Common/index.jsnew file+7

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Gen/index.jsnew file+27

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.NonEmpty.CaseInsensitive/index.jsnew file+13

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.NonEmpty.CodePoints/index.jsnew file+98

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.NonEmpty.CodeUnits/index.jsnew file+107

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.NonEmpty.Internal/index.jsnew file+119

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.NonEmpty/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Pattern/index.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Regex.Flags/index.jsnew file+59

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Regex.Unsafe/index.jsnew file+10

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Regex/foreign.jsnew file+103

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Regex/index.jsnew file+79

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Unsafe/foreign.jsnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String.Unsafe/index.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.String/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Symbol/foreign.jsnew file+6

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Symbol/index.jsnew file+7

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Time.Component.Gen/index.jsnew file+8

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Time.Component/index.jsnew file+139

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Time.Duration.Gen/index.jsnew file+8

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Time.Duration/index.jsnew file+96

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Time.Gen/index.jsnew file+9

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Time/index.jsnew file+101

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Traversable.Accum.Internal/index.jsnew file+36

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Traversable.Accum/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Traversable/foreign.jsnew file+52

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Traversable/index.jsnew file+372

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.TraversableWithIndex/index.jsnew file+305

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Tuple.Nested/index.jsnew file+295

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Tuple/index.jsnew file+151

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Unfoldable/foreign.jsnew file+21

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Unfoldable/index.jsnew file+43

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Unfoldable1/foreign.jsnew file+21

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Unfoldable1/index.jsnew file+45

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Unit/foreign.jsnew file+1

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Unit/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Variant.Internal/index.jsnew file+401

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Variant/index.jsnew file+219

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Void/index.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Data.Yoneda/index.jsnew file+86

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Debug/foreign.jsnew file+57

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Debug/index.jsnew file+16

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Dodo.Ansi/index.jsnew file+120

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Dodo.Box/index.jsnew file+692

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Dodo.Common/index.jsnew file+87

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Dodo.Internal.Buffer/index.jsnew file+18

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Dodo.Internal/index.jsnew file+69

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Dodo/index.jsnew file+634

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.AVar/foreign.jsnew file+307

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.AVar/index.jsnew file+23

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Aff.AVar/index.jsnew file+35

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Aff.Class/index.jsnew file+106

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Aff.Compat/index.jsnew file+15

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Aff/foreign.jsnew file+1154

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Aff/index.jsnew file+264

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Class.Console/index.jsnew file+17

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Class/index.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Console/foreign.jsnew file+51

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Console/index.jsnew file+9

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Exception.Unsafe/index.jsnew file+6

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Exception/foreign.jsnew file+45

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Exception/index.jsnew file+15

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Now/foreign.jsnew file+8

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Now/index.jsnew file+17

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Ref/foreign.jsnew file+37

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Ref/index.jsnew file+37

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Uncurried/foreign.jsnew file+229

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Uncurried/index.jsnew file+377

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Unsafe/foreign.jsnew file+3

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect.Unsafe/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect/foreign.jsnew file+51

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Effect/index.jsnew file+44

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Index/foreign.jsnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Index/index.jsnew file+81

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Keys/foreign.jsnew file+9

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Keys/index.jsnew file+20

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object.Gen/index.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object.ST.Unsafe/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object.ST.Unsafe/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object.ST/foreign.jsnew file+37

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object.ST/index.jsnew file+10

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object.Unsafe/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object.Unsafe/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object/foreign.jsnew file+116

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign.Object/index.jsnew file+233

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign/foreign.jsnew file+19

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Foreign/index.jsnew file+208

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Js.BigInt.BigInt/foreign.jsnew file+59

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Js.BigInt.BigInt/index.jsnew file+47

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Main/index.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer.Class/index.jsnew file+49

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer.Immutable/foreign.jsnew file+99

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer.Immutable/index.jsnew file+91

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer.Internal/foreign.jsnew file+68

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer.Internal/index.jsnew file+135

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer.ST/index.jsnew file+32

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer.Types/index.jsnew file+36

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Buffer/index.jsnew file+32

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.ChildProcess/foreign.jsnew file+96

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.ChildProcess/index.jsnew file+318

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Encoding/foreign.jsnew file+6

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Encoding/index.jsnew file+48

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Aff/index.jsnew file+111

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Async/foreign.jsnew file+25

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Async/index.jsnew file+235

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Perms/index.jsnew file+147

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Stats/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Stats/index.jsnew file+31

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Stream/foreign.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Stream/index.jsnew file+119

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Sync/foreign.jsnew file+27

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS.Sync/index.jsnew file+231

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.FS/index.jsnew file+128

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Path/foreign.jsnew file+30

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Path/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Platform/index.jsnew file+108

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Process/foreign.jsnew file+70

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Process/index.jsnew file+46

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Stream/foreign.jsnew file+143

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Node.Stream/index.jsnew file+116

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Partial.Unsafe/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Partial.Unsafe/index.jsnew file+9

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Partial/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Partial/index.jsnew file+7

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Performance.Minibench/foreign.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Performance.Minibench/index.jsnew file+57

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Prelude/index.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Errors/index.jsnew file+121

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Layout/index.jsnew file+971

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Lexer/index.jsnew file+523

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.ModuleGraph/index.jsnew file+174

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Parser.Monad/index.jsnew file+179

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Parser/index.jsnew file+3863

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Print/index.jsnew file+133

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Range.TokenList/index.jsnew file+234

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Range/index.jsnew file+2178

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.TokenStream/index.jsnew file+48

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Traversal/index.jsnew file+889

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST.Types/index.jsnew file+681

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScript.CST/index.jsnew file+87

This diff is too big to show here.

.storybook/purescript-indexer/output-es/PureScriptCSFIndexer/index.jsnew file+140

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Record.Builder/foreign.jsnew file+44

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Record.Builder/index.jsnew file+21

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Record.Unsafe.Union/foreign.jsnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Record.Unsafe.Union/index.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Record.Unsafe/foreign.jsnew file+38

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Record.Unsafe/index.jsnew file+10

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Record/index.jsnew file+24

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Safe.Coerce/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/SourceMap.Types/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/SourceMap/foreign.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/SourceMap/index.jsnew file+27

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Storybook.CSFTools.Types/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Storybook.CSFTools/foreign.jsnew file+22

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Storybook.CSFTools/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Test.Main/index.jsnew file+10

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy.Doc/index.jsnew file+578

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy.Hang/index.jsnew file+844

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy.Operators.Defaults/index.jsnew file+357

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy.Operators/index.jsnew file+147

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy.Precedence/index.jsnew file+358

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy.Token/index.jsnew file+121

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy.Util/index.jsnew file+9

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Tidy/index.jsnew file+2659

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Data.Boolean/index.jsnew file+22

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Data.Ordering/index.jsnew file+56

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Data.Symbol/index.jsnew file+8

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Equality/index.jsnew file+6

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Function/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Prelude/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Proxy/index.jsnew file+52

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Row.Homogeneous/index.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.Row/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Type.RowList/index.jsnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Unsafe.Coerce/foreign.jsnew file+5

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Unsafe.Coerce/index.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON.Error/index.jsnew file+63

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON.Generics.EnumSumRep/index.jsnew file+72

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON.Generics.TaggedSumRep/index.jsnew file+150

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON.Generics.UntaggedProductRep/index.jsnew file+73

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON.Generics.UntaggedSumRep/index.jsnew file+75

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON.Generics/index.jsnew file+2

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON.Variant/index.jsnew file+127

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON/foreign.jsnew file+18

This diff is too big to show here.

.storybook/purescript-indexer/output-es/Yoga.JSON/index.jsnew file+595

This diff is too big to show here.

.storybook/purescript-indexer/output-es/package.jsonnew file+1

This diff is too big to show here.

.storybook/purescript-indexer/output-es/runtime.jsnew file+21

This diff is too big to show here.

.storybook/purescript-indexer/package-lock.jsonnew file+623

This diff is too big to show here.

.storybook/purescript-indexer/package.jsonnew file+26

This diff is too big to show here.

.storybook/purescript-indexer/packages.dhallnew file+124

This diff is too big to show here.

.storybook/purescript-indexer/production.dhallnew file+1

This diff is too big to show here.

.storybook/purescript-indexer/spago.dhallnew file+46

This diff is too big to show here.

.storybook/purescript-indexer/src/Main.pursnew file+11

This diff is too big to show here.

.storybook/purescript-indexer/src/PureScriptCSFIndexer.pursnew file+124

This diff is too big to show here.

.storybook/purescript-indexer/src/SourceMap.jsnew file+4

This diff is too big to show here.

.storybook/purescript-indexer/src/SourceMap.pursnew file+29

This diff is too big to show here.

.storybook/purescript-indexer/src/SourceMap/Types.pursnew file+14

This diff is too big to show here.

.storybook/purescript-indexer/src/Storybook/CSFTools.jsnew file+16

This diff is too big to show here.

.storybook/purescript-indexer/src/Storybook/CSFTools.pursnew file+12

This diff is too big to show here.

.storybook/purescript-indexer/src/Storybook/CSFTools/Types.pursnew file+8

This diff is too big to show here.

.storybook/purescript-indexer/test/Main.pursnew file+11

This diff is too big to show here.

.storybook/purescript-loader.tsnew file+51

This diff is too big to show here.

.storybook/rowtype-yoga-theme.jsdeleted−31

This diff is too big to show here.

.tidyrc.jsonnew file+11

This diff is too big to show here.

.vscode/settings.json+11−2

This diff is too big to show here.

README.mdnew file+33

This diff is too big to show here.

assets/mat.webmnew file

Binary file not shown.

assets/unsplash-mat-2400.jpgnew file

Binary file not shown.

assets/unsplash-mat-320.jpgnew file

Binary file not shown.

assets/unsplash-mat-4160.jpgnew file

Binary file not shown.

assets/unsplash-mat-640.jpgnew file

Binary file not shown.

package.json+39−32

This diff is too big to show here.

packages.dhall+126−130

This diff is too big to show here.

spago.dhall+50−7

This diff is too big to show here.

src/Data/TwoOrMore.pursdeleted−99

This diff is too big to show here.

src/Framer/Motion.jsdeleted−5

This diff is too big to show here.

src/Framer/Motion.pursdeleted−36

This diff is too big to show here.

src/Framer/Motion/MotionComponent.jsdeleted−14

This diff is too big to show here.

src/Framer/Motion/MotionComponent.pursdeleted−521

This diff is too big to show here.

src/Framer/Motion/Types.jsdeleted−4

This diff is too big to show here.

src/Framer/Motion/Types.pursdeleted−290

This diff is too big to show here.

src/Framer/MotionValue.jsdeleted−10

This diff is too big to show here.

src/Framer/MotionValue.pursdeleted−36

This diff is too big to show here.

src/MediaQuery.jsnew file+24

This diff is too big to show here.

src/MediaQuery.pursnew file+9

This diff is too big to show here.

src/MediaQuery/Types.pursnew file+9

This diff is too big to show here.

src/React/Basic/Popper/Hook.jsdeleted−3

This diff is too big to show here.

src/React/Basic/Popper/Hook.pursdeleted−32

This diff is too big to show here.

src/React/Basic/Popper/Placement/Types.pursdeleted−36

This diff is too big to show here.

src/React/Basic/Popper/Story.pursdeleted−243

This diff is too big to show here.

src/React/Basic/Popper/Types.pursdeleted−41

This diff is too big to show here.

src/React/Basic/SyntaxHighlighter/Component.js+148−148

This diff is too big to show here.

src/React/Basic/SyntaxHighlighter/Component.purs+1−1

This diff is too big to show here.

src/React/DndKit.jsnew file+45

This diff is too big to show here.

src/React/DndKit.pursnew file+186

This diff is too big to show here.

src/Web/DOM/ResizeObserver.jsnew file+20

This diff is too big to show here.

src/Web/DOM/ResizeObserver.pursnew file+67

This diff is too big to show here.

src/Yoga.purs+45−21

This diff is too big to show here.

src/Yoga/Block.purs+181−25

This diff is too big to show here.

src/Yoga/Block/Atom/Button.purs+3−1

This diff is too big to show here.

src/Yoga/Block/Atom/Button/Story.purs+85−32

This diff is too big to show here.

src/Yoga/Block/Atom/Button/Style.purs+115−76

This diff is too big to show here.

src/Yoga/Block/Atom/Button/Types.purs+39−2

This diff is too big to show here.

src/Yoga/Block/Atom/Button/View.purs+78−14

This diff is too big to show here.

src/Yoga/Block/Atom/Checkbox.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Atom/Checkbox/Style.pursnew file+118

This diff is too big to show here.

src/Yoga/Block/Atom/Checkbox/View.pursnew file+66

This diff is too big to show here.

src/Yoga/Block/Atom/CodeInput.pursdeleted−5

This diff is too big to show here.

src/Yoga/Block/Atom/CodeInput/Spec.pursdeleted−20

This diff is too big to show here.

src/Yoga/Block/Atom/CodeInput/Story.pursdeleted−83

This diff is too big to show here.

src/Yoga/Block/Atom/CodeInput/Style.pursdeleted−55

This diff is too big to show here.

src/Yoga/Block/Atom/CodeInput/View.pursdeleted−42

This diff is too big to show here.

src/Yoga/Block/Atom/Icon/Story.pursdeleted−39

This diff is too big to show here.

src/Yoga/Block/Atom/Icon/Style.purs+27−19

This diff is too big to show here.

src/Yoga/Block/Atom/Icon/View.purs+3−2

This diff is too big to show here.

src/Yoga/Block/Atom/Image.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Atom/Image/FFI.jsnew file+4

This diff is too big to show here.

src/Yoga/Block/Atom/Image/FFI.pursnew file+8

This diff is too big to show here.

src/Yoga/Block/Atom/Image/Style.pursnew file+12

This diff is too big to show here.

src/Yoga/Block/Atom/Image/Types.pursnew file+96

This diff is too big to show here.

src/Yoga/Block/Atom/Image/View.pursnew file+63

This diff is too big to show here.

src/Yoga/Block/Atom/Input/Hook/UseTypingPlaceholders.pursnew file+165

This diff is too big to show here.

src/Yoga/Block/Atom/Input/Story.purs+79−30

This diff is too big to show here.

src/Yoga/Block/Atom/Input/Style.purs+261−168

This diff is too big to show here.

src/Yoga/Block/Atom/Input/View.purs+155−132

This diff is too big to show here.

src/Yoga/Block/Atom/Input/View/Container.purs+132−78

This diff is too big to show here.

src/Yoga/Block/Atom/Input/View/HTMLInput.purs+10−9

This diff is too big to show here.

src/Yoga/Block/Atom/Input/View/Label.purs+99−65

This diff is too big to show here.

src/Yoga/Block/Atom/Popover.pursdeleted−5

This diff is too big to show here.

src/Yoga/Block/Atom/Popover/Story.pursdeleted−340

This diff is too big to show here.

src/Yoga/Block/Atom/Popover/Style.pursdeleted−19

This diff is too big to show here.

src/Yoga/Block/Atom/Popover/View.pursdeleted−68

This diff is too big to show here.

src/Yoga/Block/Atom/Range/Story.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Atom/Range/Style.purs+39−27

This diff is too big to show here.

src/Yoga/Block/Atom/Range/View.purs+30−18

This diff is too big to show here.

src/Yoga/Block/Atom/Segmented.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Atom/Segmented/Story.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Atom/Segmented/Style.purs+58−61

This diff is too big to show here.

src/Yoga/Block/Atom/Segmented/View.purs+50−38

This diff is too big to show here.

src/Yoga/Block/Atom/Segmented/View/ActiveIndicator.purs+92−82

This diff is too big to show here.

src/Yoga/Block/Atom/Segmented/View/Types.pursnew file+4

This diff is too big to show here.

src/Yoga/Block/Atom/Select.pursnew file+6

This diff is too big to show here.

src/Yoga/Block/Atom/Select/Style.pursnew file+53

This diff is too big to show here.

src/Yoga/Block/Atom/Select/View.pursnew file+40

This diff is too big to show here.

src/Yoga/Block/Atom/Toggle.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Atom/Toggle/Spec.purs+13−2

This diff is too big to show here.

src/Yoga/Block/Atom/Toggle/Story.purs+36−34

This diff is too big to show here.

src/Yoga/Block/Atom/Toggle/Style.purs+37−36

This diff is too big to show here.

src/Yoga/Block/Atom/Toggle/View.purs+158−137

This diff is too big to show here.

src/Yoga/Block/Atom/Tooltip.pursdeleted−5

This diff is too big to show here.

src/Yoga/Block/Atom/Tooltip/Spec.pursdeleted−16

This diff is too big to show here.

src/Yoga/Block/Atom/Tooltip/Story.pursdeleted−39

This diff is too big to show here.

src/Yoga/Block/Atom/Tooltip/Style.pursdeleted−57

This diff is too big to show here.

src/Yoga/Block/Atom/Tooltip/View.pursdeleted−134

This diff is too big to show here.

src/Yoga/Block/Container/Spec.purs+2−3

This diff is too big to show here.

src/Yoga/Block/Container/Story.purs+86−11

This diff is too big to show here.

src/Yoga/Block/Container/Style.jsnew file+21

This diff is too big to show here.

src/Yoga/Block/Container/Style.purs+476−228

This diff is too big to show here.

src/Yoga/Block/Container/View.purs+73−23

This diff is too big to show here.

src/Yoga/Block/Hook/Key.js+7−7

This diff is too big to show here.

src/Yoga/Block/Hook/Key.purs+42−3

This diff is too big to show here.

src/Yoga/Block/Hook/UseDocumentSize.pursnew file+42

This diff is too big to show here.

src/Yoga/Block/Hook/UseDrip.pursnew file+54

This diff is too big to show here.

src/Yoga/Block/Hook/UseElementResize.pursnew file+43

This diff is too big to show here.

src/Yoga/Block/Hook/UseInView.jsnew file+3

This diff is too big to show here.

src/Yoga/Block/Hook/UseInView.pursnew file+51

This diff is too big to show here.

src/Yoga/Block/Hook/UseKeyDown.purs+13−7

This diff is too big to show here.

src/Yoga/Block/Hook/UseKeyUp.purs+17−10

This diff is too big to show here.

src/Yoga/Block/Hook/UseMediaQuery.pursnew file+36

This diff is too big to show here.

src/Yoga/Block/Hook/UseOverflows.pursnew file+61

This diff is too big to show here.

src/Yoga/Block/Hook/UsePopOver.pursnew file+57

This diff is too big to show here.

src/Yoga/Block/Hook/UseRenderInPortal.pursnew file+28

This diff is too big to show here.

src/Yoga/Block/Hook/UseResize.pursdeleted−61

This diff is too big to show here.

src/Yoga/Block/Hook/UseResize2.pursnew file+113

This diff is too big to show here.

src/Yoga/Block/Hook/UseStateEq.pursnew file+29

This diff is too big to show here.

src/Yoga/Block/Hook/UseTypeAhead.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Hook/UseWindowResize.pursnew file+102

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/After.pursnew file+18

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/BG.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Background.pursnew file+266

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Before.pursnew file+23

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Bg.pursnew file+115

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Bin.pursnew file+28

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Checkmark.pursnew file+24

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/DraggableIndicator.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Ellipsis.pursnew file+25

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/EyeClosed.purs−4

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Filter.pursnew file+40

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Folder.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/GithubLogo.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/GithubLogo.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconCalendar.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconCalendar.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconClock.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconClock.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconGroup.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconGroup.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconMoon.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconMoon.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconSun.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/HeroiconSun.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Icon.purs+20−6

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/LogoNew.pursnew file+44

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/MagnifyingGlass.purs+19−20

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Murmuras.pursnew file+22

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/MurmurasLogos.pursnew file+33

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/MurmurasLogos.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Pixel4.pursnew file+60

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Plus.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Spd.pursnew file+25

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Spinner.pursnew file+193

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/TMP.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Tmp.pursnew file+172

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Warn.purs+16−20

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/WhatsAppLogo.pursnew file+77

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/WhatsAppLogo.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/Yoga1.pursnew file+223

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/after.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/background.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/before.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/bin.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/checkmark.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/draggableIndicator.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/ellipsis.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/eyeOpen.svg+1−1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/filter.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/folder.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/key.svg+1−1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/logoNew.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/magnifyingGlass.svg+1−1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/moon.svg+1−1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/murmuras.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/pixel4.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/plus.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/spd.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/spinner.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/sun.svg+1−1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/warn.svg+1−1

This diff is too big to show here.

src/Yoga/Block/Icon/SVG/yoga1.svgnew file+1

This diff is too big to show here.

src/Yoga/Block/Internal.js+52−39

This diff is too big to show here.

src/Yoga/Block/Internal.purs+257−127

This diff is too big to show here.

src/Yoga/Block/Internal/OptionalProp.purs+14−12

This diff is too big to show here.

src/Yoga/Block/Layout/Box.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Layout/Box/Story.purs+108−15

This diff is too big to show here.

src/Yoga/Block/Layout/Box/Style.purs+24−9

This diff is too big to show here.

src/Yoga/Block/Layout/Box/View.purs+12−3

This diff is too big to show here.

src/Yoga/Block/Layout/Centre.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Layout/Centre/Story.purs+35−22

This diff is too big to show here.

src/Yoga/Block/Layout/Centre/Style.purs+12−10

This diff is too big to show here.

src/Yoga/Block/Layout/Centre/View.purs+20−5

This diff is too big to show here.

src/Yoga/Block/Layout/Cluster.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Layout/Cluster/Story.purs+51−33

This diff is too big to show here.

src/Yoga/Block/Layout/Cluster/Style.purs+16−16

This diff is too big to show here.

src/Yoga/Block/Layout/Cluster/View.purs+20−4

This diff is too big to show here.

src/Yoga/Block/Layout/Cover.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Layout/Cover/Spec.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Layout/Cover/Story.pursnew file+85

This diff is too big to show here.

src/Yoga/Block/Layout/Cover/Style.pursnew file+36

This diff is too big to show here.

src/Yoga/Block/Layout/Cover/View.pursnew file+68

This diff is too big to show here.

src/Yoga/Block/Layout/Grid.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Layout/Grid/Spec.pursnew file+22

This diff is too big to show here.

src/Yoga/Block/Layout/Grid/Story.pursnew file+44

This diff is too big to show here.

src/Yoga/Block/Layout/Grid/Style.pursnew file+21

This diff is too big to show here.

src/Yoga/Block/Layout/Grid/View.pursnew file+29

This diff is too big to show here.

src/Yoga/Block/Layout/Imposter/Style.purs+1

This diff is too big to show here.

src/Yoga/Block/Layout/Sidebar/Spec.purs+2−1

This diff is too big to show here.

src/Yoga/Block/Layout/Sidebar/Story.purs+24−15

This diff is too big to show here.

src/Yoga/Block/Layout/Sidebar/Style.purs+29−38

This diff is too big to show here.

src/Yoga/Block/Layout/Sidebar/View.purs+38−13

This diff is too big to show here.

src/Yoga/Block/Layout/Stack.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Layout/Stack/Style.purs+24−18

This diff is too big to show here.

src/Yoga/Block/Layout/Stack/View.purs+13−5

This diff is too big to show here.

src/Yoga/Block/Layout/Story.pursnew file+223

This diff is too big to show here.

src/Yoga/Block/Layout/Switcher.purs+1−1

This diff is too big to show here.

src/Yoga/Block/Layout/Switcher/Story.purs+36−24

This diff is too big to show here.

src/Yoga/Block/Layout/Switcher/Style.purs+34−36

This diff is too big to show here.

src/Yoga/Block/Layout/Switcher/View.purs+13−5

This diff is too big to show here.

src/Yoga/Block/Layout/Types.pursnew file+22

This diff is too big to show here.

src/Yoga/Block/Modal.pursdeleted−5

This diff is too big to show here.

src/Yoga/Block/Modal/Story.pursdeleted−55

This diff is too big to show here.

src/Yoga/Block/Modal/Style.pursdeleted−30

This diff is too big to show here.

src/Yoga/Block/Modal/View.pursdeleted−81

This diff is too big to show here.

src/Yoga/Block/Molecule/DatePicker.pursnew file+70

This diff is too big to show here.

src/Yoga/Block/Molecule/DatePicker/Style.pursnew file+131

This diff is too big to show here.

src/Yoga/Block/Molecule/DatePicker/View.pursnew file+338

This diff is too big to show here.

src/Yoga/Block/Molecule/Modal.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Molecule/Modal/Style.pursnew file+15

This diff is too big to show here.

src/Yoga/Block/Molecule/Modal/View.pursnew file+90

This diff is too big to show here.

src/Yoga/Block/Molecule/ReadMore.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Molecule/ReadMore/Story.pursnew file+52

This diff is too big to show here.

src/Yoga/Block/Molecule/ReadMore/Style.pursnew file+72

This diff is too big to show here.

src/Yoga/Block/Molecule/ReadMore/View.pursnew file+91

This diff is too big to show here.

src/Yoga/Block/Molecule/Sheet.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Molecule/Sheet/Story.pursnew file+95

This diff is too big to show here.

src/Yoga/Block/Molecule/Sheet/Style.pursnew file+65

This diff is too big to show here.

src/Yoga/Block/Molecule/Sheet/View.pursnew file+187

This diff is too big to show here.

src/Yoga/Block/Molecule/Tooltip/View.pursnew file+53

This diff is too big to show here.

src/Yoga/Block/Molecule/Typeahead.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Molecule/Typeahead/Style.pursnew file+48

This diff is too big to show here.

src/Yoga/Block/Molecule/Typeahead/View.pursnew file+582

This diff is too big to show here.

src/Yoga/Block/Motion/Story.pursdeleted−274

This diff is too big to show here.

src/Yoga/Block/Organism/Form.pursnew file+847

This diff is too big to show here.

src/Yoga/Block/Organism/Form/Defaults.pursnew file+101

This diff is too big to show here.

src/Yoga/Block/Organism/Form/Internal.pursnew file+252

This diff is too big to show here.

src/Yoga/Block/Organism/Form/Story.pursnew file+169

This diff is too big to show here.

src/Yoga/Block/Organism/Form/Types.pursnew file+6

This diff is too big to show here.

src/Yoga/Block/Organism/Form/Validation.pursnew file+539

This diff is too big to show here.

src/Yoga/Block/Organism/NotificationCentre.pursnew file+61

This diff is too big to show here.

src/Yoga/Block/Organism/NotificationCentre/Notification/Story.pursnew file+58

This diff is too big to show here.

src/Yoga/Block/Organism/NotificationCentre/Notification/Style.pursnew file+74

This diff is too big to show here.

src/Yoga/Block/Organism/NotificationCentre/Notification/View.pursnew file+122

This diff is too big to show here.

src/Yoga/Block/Organism/NotificationCentre/Types.pursnew file+35

This diff is too big to show here.

src/Yoga/Block/Quark/ClickAway/Style.pursnew file+12

This diff is too big to show here.

src/Yoga/Block/Quark/ClickAway/View.pursnew file+34

This diff is too big to show here.

src/Yoga/Block/Quark/Drip/Style.pursnew file+33

This diff is too big to show here.

src/Yoga/Block/Quark/Drip/View.pursnew file+91

This diff is too big to show here.

src/Yoga/Block/Quark/Layer.pursnew file+5

This diff is too big to show here.

src/Yoga/Block/Quark/Layer/Style.pursnew file+12

This diff is too big to show here.

src/Yoga/Block/Quark/Layer/View.pursnew file+24

This diff is too big to show here.

src/Yoga/Block/Quark/PopOver/Types.pursnew file+63

This diff is too big to show here.

src/Yoga/Block/Quark/PopOver/View.pursnew file+418

This diff is too big to show here.

src/Yoga/Block/Quark/Skeleton/Style.pursnew file+37

This diff is too big to show here.

src/Yoga/Block/Typography.pursnew file+92

This diff is too big to show here.

src/Yoga/Prelude/Default.purs+1−1

This diff is too big to show here.

src/Yoga/Prelude/Style.purs+9−4

This diff is too big to show here.

src/Yoga/Prelude/View.purs+10−4

This diff is too big to show here.

src/Yoga/Prelude/View/HTML.pursnew file+88

This diff is too big to show here.

stories.dhallnew file+16

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Button.pursnew file+64

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Checkbox.pursnew file+83

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Icon.pursnew file+53

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Image.pursnew file+56

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Input.pursnew file+89

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Range.pursnew file+53

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Segmented.pursnew file+51

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Select.pursnew file+44

This diff is too big to show here.

stories/Story/Yoga/Block/Atom/Toggle.pursnew file+69

This diff is too big to show here.

stories/Story/Yoga/Block/Layout.pursnew file+126

This diff is too big to show here.

stories/Story/Yoga/Block/Molecule/Modal.pursnew file+71

This diff is too big to show here.

stories/Story/Yoga/Block/Molecule/Typeahead.pursnew file+90

This diff is too big to show here.

test/Main.purs−1

This diff is too big to show here.

webpack.common.js+3−3

This diff is too big to show here.

yarn-error.lognew file+91

This diff is too big to show here.

yarn.lock+6790−6639

This diff is too big to show here.