( ( ) => { var e , t = { 432 : e => { ! function ( t , n ) { const r = "*" , o = Object . defineProperties , s = Object . entries , i = ( e , t ) => ( n , r ) => ( e . has ( n ) ? e . get ( n ) . add ( r ) : e . set ( n , ( new Set ) . add ( r ) ) , t ) , a = ( e , t ) => ( n , o ) => ( n !== r || o ? ( ( e , t , n , r ) => { if ( r ) { const t = e . get ( n ) ; t && ( t . delete ( r ) , 0 === t . size && e . delete ( n ) ) } else e . delete ( n ) } ) ( e , 0 , n , o ) : e . clear ( ) , t ) , u = ( e , t ) => ( e , n ) => t . on ( e , ( function r ( ... o ) { t . off ( e , r ) , n . apply ( t , o ) } ) ) , c = ( e , t ) => ( n , ... o ) => { const s = e . get ( n ) ; return s && s . forEach ( ( e => e . apply ( t , o ) ) ) , e . get ( r ) && n !== r && t . trigger ( r , n , ... o ) , t } ; e . exports = function ( e ) { const t = new Map ; return o ( e = e || { } , s ( { on : i , off : a , one : u , trigger : c } ) . reduce ( ( ( n , [ r , o ] ) => ( n [ r ] = { value : o ( t , e ) , enumerable : ! 1 , writable : ! 1 , configurable : ! 1 } , n ) ) , { } ) ) , e } } ( "undefined" != typeof window && window ) } , 766 : ( e , t , n ) => { "use strict" ; n ( 155 ) ; function r ( e , t ) { return typeof e === t } function o ( e ) { return r ( e , "function" ) } function s ( e ) { return ! function ( e ) { return null == e } ( e ) && e . constructor === Object } const i = new Map , a = Symbol ( "riot-component" ) , u = new Set , c = "mount" , l = "update" , p = "unmount" , d = "shouldUpdate" , h = "onBeforeMount" , m = "onMounted" , f = "onBeforeUpdate" , b = "onUpdated" , v = "onBeforeUnmount" , g = "onUnmounted" , y = "props" , x = "state" , T = "slots" , w = "root" , O = Symbol ( "pure" ) , E = Symbol ( "is_updating" ) , N = Symbol ( "parent" ) , A = Symbol ( "attributes" ) , j = Symbol ( "template" ) ; function M ( e ) { return e . replace ( /-(\w)/g , ( ( e , t ) => t . toUpperCase ( ) ) ) } function C ( ) { return this } function S ( e ) { return o ( e ) ? e . prototype && e . prototype . constructor ? new e : e ( ) : e } function k ( e ) { throw new Error ( e ) } function _ ( e ) { return e . reduce ( ( ( e , t ) => { const { value : n , type : r } = t ; switch ( ! 0 ) { case ! t . name && 0 === r : return { ... e , ... n } ; case 3 === r : e . value = t . value ; break ; default : e [ M ( t . name ) ] = t . value } return e } ) , { } ) } function L ( e , t , n , r = { } ) { return Object . defineProperty ( e , t , { value : n , enumerable : ! 1 , writable : ! 1 , configurable : ! 0 , ... r } ) , e } function U ( e , t , n ) { return Object . entries ( t ) . forEach ( ( ( [ t , r ] ) => { L ( e , t , r , n ) } ) ) , e } function I ( e , t ) { return Object . entries ( t ) . forEach ( ( ( [ t , n ] ) => { e [ t ] || ( e [ t ] = n ) } ) ) , e }
/* Riot WIP, @license MIT */
const B = Object . freeze ( { [ c ] : C , [ l ] : C , [ p ] : C } ) , D = Object . assign ( { } , B , { clone : C , createDOM : C } ) ; function P ( e ) { for ( ; e . firstChild ; ) e . removeChild ( e . firstChild ) } const $ = e => e && e . parentNode && e . parentNode . removeChild ( e ) , R = ( e , t ) => t && t . parentNode && t . parentNode . insertBefore ( e , t ) , z = ( new Map , Symbol ( "riot-component" ) , new Set , Symbol ( "pure" ) ) , F = ( Symbol ( "is_updating" ) , Symbol ( "parent" ) ) , V = ( Symbol ( "attributes" ) , Symbol ( "template" ) , { EACH : 0 , IF : 1 , SIMPLE : 2 , TAG : 3 , SLOT : 4 } ) , G = { ATTRIBUTE : 0 , EVENT : 1 , TEXT : 2 , VALUE : 3 } ; function H ( e , t , n , r = { } ) { return Object . defineProperty ( e , t , { value : n , enumerable : ! 1 , writable : ! 1 , configurable : ! 0 , ... r } ) , e } n ( 155 ) ; function K ( e , t ) { return typeof e === t } function q ( e ) { const t = e . ownerSVGElement ; return ! ! t || null === t } function X ( e ) { return "template" === e . tagName . toLowerCase ( ) } function W ( e ) { return null == e } const Y = Symbol ( ) , Z = Symbol ( ) ; function J ( e ) { const t = e . dom . cloneNode ( ! 0 ) , { head : n , tail : r } = function ( ) { const e = document . createTextNode ( "" ) , t = document . createTextNode ( "" ) ; return e [ Y ] = ! 0 , t [ Z ] = ! 0 , { head : e , tail : t } } ( ) ; return { avoidDOMInjection : ! 0 , fragment : t , head : n , tail : r , children : [ n , ... Array . from ( t . childNodes ) , r ] } } const Q = Symbol ( "unmount" ) , ee = { nodes : [ ] , mount ( e , t ) { return this . update ( e , t ) } , update ( e , t ) { const { placeholder : n , nodes : r , childrenMap : o } = this , s = e === Q ? null : this . evaluate ( e ) , i = s ? Array . from ( s ) : [ ] , { newChildrenMap : a , batches : u , futureNodes : c } = function ( e , t , n , r ) { const { condition : o , template : s , childrenMap : i , itemName : a , getKey : u , indexName : c , root : l , isTemplateTag : p } = r , d = new Map , h = [ ] , m = [ ] ; return e . forEach ( ( ( e , r ) => { const f = function ( e , { itemName : t , indexName : n , index : r , item : o } ) { H ( e , t , o ) , n && H ( e , n , r ) ; return e } ( Object . create ( t ) , { itemName : a , indexName : c , index : r , item : e } ) , b = u ? u ( f ) : r , v = i . get ( b ) , g = [ ] ; if ( function ( e , t ) { return ! ! e && ! e ( t ) } ( o , f ) ) return ; const y = ! v , x = v ? v . template : s . clone ( ) , T = x . el || l . cloneNode ( ) , w = p && y ? J ( x ) : x . meta ; y ? h . push ( ( ( ) => x . mount ( T , f , n , w ) ) ) : h . push ( ( ( ) => x . update ( f , n ) ) ) , p ? g . push ( ... w . children ) : g . push ( T ) , i . delete ( b ) , m . push ( ... g ) , d . set ( b , { nodes : g , template : x , context : f , index : r } ) } ) ) , { newChildrenMap : d , batches : h , futureNodes : m } } ( i , e , t , this ) ; return ( ( e , t , n , r ) => { const o = t . length ; let s = e . length , i = o , a = 0 , u = 0 , c = null ; for ( ; a < s || u < i ; ) if ( s === a ) { const e = i < o ? u ? n ( t [ u - 1 ] , - 0 ) . nextSibling : n ( t [ i - u ] , 0 ) : r ; for ( ; u < i ; ) R ( n ( t [ u ++ ] , 1 ) , e ) } else if ( i === u ) for ( ; a < s ; ) c && c . has ( e [ a ] ) || $ ( n ( e [ a ] , - 1 ) ) , a ++ ; else if ( e [ a ] === t [ u ] ) a ++ , u ++ ; else if ( e [ s - 1 ] === t [ i - 1 ] ) s -- , i -- ; else if ( e [ a ] === t [ i - 1 ] && t [ u ] === e [ s - 1 ] ) { const r = n ( e [ -- s ] , - 1 ) . nextSibling ; R ( n ( t [ u ++ ] , 1 ) , n ( e [ a ++ ] , - 1 ) . nextSibling ) , R ( n ( t [ -- i ] , 1 ) , r ) , e [ s ] = t [ i ] } else { if ( ! c ) { c = new Map ; let e = u ; for ( ; e < i ; ) c . set ( t [ e ] , e ++ ) } if ( c . has ( e [ a ] ) ) { const r = c . get ( e [ a ] ) ; if ( u < r && r < i ) { let o = a , d = 1 ; for ( ; ++ o < s && o < i && c . get ( e [ o ] ) === r + d ; ) d ++ ; if ( d > r - u ) { const o = n ( e [ a ] , 0 ) ; for ( ; u < r ; ) R ( n ( t [ u ++ ] , 1 ) , o ) } else l = n ( t [ u ++ ] , 1 ) , ( p = n ( e [ a ++ ] , - 1 ) ) && p . parentNode && p . parentNode . replaceChild ( l , p ) } else a ++ } else $ ( n ( e [ a ++ ] , - 1 ) ) } var l , p } ) ( r , c , function ( e , t ) { return ( n , r ) => { if ( r < 0 ) { const n = e [ e . length - 1 ] ; if ( n ) { const { template : r , nodes : o , context : s } = n ; o . pop ( ) , o . length || ( e . pop ( ) , r . unmount ( s , t , null ) ) } } return n } } ( Array . from ( o . values ( ) ) , t ) , n ) , u . forEach ( ( e => e ( ) ) ) , this . childrenMap = a , this . nodes = c , this } , unmount ( e , t ) { return this . update ( Q , t ) , this } } ; const te = { mount ( e , t ) { return this . update ( e , t ) } , update ( e , t ) { const n = ! ! this . evaluate ( e ) , r = ! this . value && n , o = this . value && ! n , s = ( ) => { const n = this . node . cloneNode ( ) ; R ( n , this . placeholder ) , this . template = this . template . clone ( ) , this . template . mount ( n , e , t ) } ; switch ( ! 0 ) { case r : s ( ) ; break ; case o : this . unmount ( e ) ; break ; default : n && this . template . update ( e , t ) } return this . value = n , this } , unmount ( e , t ) { return this . template . unmount ( e , t , ! 0 ) , this } } ; const ne = "undefined" == typeof Element ? { } : Element . prototype , re = function ( e ) { const t = new Map , n = n => ( t . has ( n ) || t . set ( n , e . call ( this , n ) ) ) && t . get ( n ) ; return n . cache = t , n } ( ( e => ne . hasOwnProperty ( e ) ) ) ; function oe ( e , { name : t } , n , r ) { if ( ! t ) return r && function ( e , t , n ) { const r = t ? Object . keys ( t ) : [ ] ; Object . keys ( n ) . filter ( ( e => ! r . includes ( e ) ) ) . forEach ( ( t => e . removeAttribute ( t ) ) ) } ( e , n , r ) , void ( n && function ( e , t ) { Object . entries ( t ) . forEach ( ( ( [ t , n ] ) => oe ( e , { name : t } , n ) ) ) } ( e , n ) ) ; ! re ( t ) && ( function ( e ) { return K ( e , "boolean" ) } ( n ) || function ( e ) { return ! W ( e ) && e . constructor === Object } ( n ) || function ( e ) { return K ( e , "function" ) } ( n ) ) && ( e [ t ] = n ) , ! functi
/* Riot WIP, @license MIT */
function Ee ( e , t ) { const n =
/* Riot WIP, @license MIT */
function ( e ) { return void 0 === e && ( e = { } ) , Object . entries ( S ( e ) ) . reduce ( ( ( e , t ) => { let [ n , r ] = t ; var o ; return e [ ( o = n , o . replace ( /([a-z])([A-Z])/g , "$1-$2" ) . toLowerCase ( ) ) ] = He ( r ) , e } ) , { } ) } ( t . exports ? t . exports . components : { } ) ; return e ( Oe , G , V , ( e => e === t . name ? Ke ( t ) : n [ e ] || i . get ( e ) ) ) }
/* Riot WIP, @license MIT */
const Ne = ( e , t ) => e [ a ] = t ;
/* Riot WIP, @license MIT */
function Ae ( e ) { return [ c , l , p ] . reduce ( ( ( t , n ) => ( t [ n ] = e ( n ) , t ) ) , { } ) } function je ( e ) { return Array . isArray ( e ) ? e : /^\[object (HTMLCollection|NodeList|Object)\]$/ . test ( Object . prototype . toString . call ( e ) ) && "number" == typeof e . length ? Array . from ( e ) : [ e ] } function Me ( e , t ) { return je ( "string" == typeof e ? ( t || document ) . querySelectorAll ( e ) : e ) }
/* Riot WIP, @license MIT */
const Ce = Object . freeze ( { $ ( e ) { return Me ( e , this . root ) [ 0 ] } , $$ ( e ) { return Me ( e , this . root ) } } ) , Se = Object . freeze ( { [ d ] : C , [ h ] : C , [ m ] : C , [ f ] : C , [ b ] : C , [ v ] : C , [ g ] : C } ) , ke = e => 1 === e . length ? e [ 0 ] : e ; function _e ( e , t , n ) { const r = "string" == typeof t ? [ t ] : t ; return ke ( je ( e ) . map ( ( e => ke ( r . map ( ( t => e [ n ] ( t ) ) ) ) ) ) ) } function Le ( e , t , n ) { const r = "object" == typeof t ? t : { [ t ] : n } , o = Object . keys ( r ) ; return je ( e ) . forEach ( ( e => { o . forEach ( ( t => e . setAttribute ( t , r [ t ] ) ) ) } ) ) , e } function Ue ( e , t ) { return _e ( e , t , "getAttribute" ) } const Ie = new Map , Be = ( ) => De || ( Le ( De = Me ( "style[riot]" ) [ 0 ] || document . createElement ( "style" ) , "type" , "text/css" ) , De . parentNode || document . head . appendChild ( De ) , De ) ; var De ; const Pe = { CSS _BY _NAME : Ie , add ( e , t ) { return Ie . has ( e ) || ( Ie . set ( e , t ) , this . inject ( ) ) , this } , inject ( ) { return Be ( ) . innerHTML = [ ... Ie . values ( ) ] . join ( "\n" ) , this } , remove ( e ) { return Ie . has ( e ) && ( Ie . delete ( e ) , this . inject ( ) ) , this } } ; function $e ( e , ... t ) { return ( ... n ) => ( n = [ ... t , ... n ] ) . length < e . length ? $e ( e , ... n ) : e ( ... n ) }
/* Riot WIP, @license MIT */
function Re ( e ) { return Ue ( e , "is" ) || e . tagName . toLowerCase ( ) }
/* Riot WIP, @license MIT */
function ze ( e , t ) { return Object . assign ( { } , e , S ( t ) ) }
/* Riot WIP, @license MIT */
function Fe ( e , t ) { return void 0 === t && ( t = { } ) , Object . assign ( { } , function ( e ) { return Array . from ( e . attributes ) . reduce ( ( ( e , t ) => ( e [ M ( t . name ) ] = t . value , e ) ) , { } ) } ( e ) , S ( t ) ) }
/* Riot WIP, @license MIT */
function Ve ( e , t ) { let { slots : n , attributes : r , props : i } = t ; return a =
/* Riot WIP, @license MIT */
function ( e ) { return [ ... u ] . reduce ( ( ( e , t ) => t ( e ) || e ) , e ) } ( U ( s ( e ) ? Object . create ( e ) : e , { mount ( t , o , s ) { return void 0 === o && ( o = { } ) , L ( t , O , ! 1 ) , this [ N ] = s , this [ A ] =
/* Riot WIP, @license MIT */
function ( e , t ) { void 0 === t && ( t = [ ] ) ; const n = t . map ( ( t => he ( e , t ) ) ) , r = { } ; return Object . assign ( r , Object . assign ( { expressions : n } , Ae ( ( e => t => ( n . forEach ( ( n => n [ e ] ( t ) ) ) , r ) ) ) ) ) } ( t , r ) . mount ( s ) , L ( this , y , Object . freeze ( Object . assign ( { } , Fe ( t , i ) , _ ( this [ A ] . expressions ) ) ) ) , this . state = ze ( this . state , o ) , this [ j ] = this . template . createDOM ( t ) . clone ( ) , Ne ( t , this ) , e . name &&
/* Riot WIP, @license MIT */
function ( e , t ) { Re ( e ) !== t && Le ( e , "is" , t ) } ( t , e . name ) , L ( this , w , t ) , L ( this , T , n ) , this . onBeforeMount ( this . props , this . state ) , this [ j ] . mount ( t , this , s ) , this . onMounted ( this . props , this . state ) , this } , update ( e , t ) { void 0 === e && ( e = { } ) , t && ( this [ N ] = t , this [ A ] . update ( t ) ) ; const n = _ ( this [ A ] . expressions ) ; if ( ! 1 !== this . shouldUpdate ( n , this . props ) ) return L ( this , y , Object . freeze ( Object . assign ( { } , this . props , n ) ) ) , this . state = ze ( this . state , e ) , this . onBeforeUpdate ( this . props , this . state ) , this [ E ] || ( this [ E ] = ! 0 , this [ j ] . update ( this , this [ N ] ) ) , this . onUpdated ( this . props , this . state ) , this [ E ] = ! 1 , this } , unmount ( e ) { return this . onBeforeUnmount ( this . props , this . state ) , this [ A ] . unmount ( ) , this [ j ] . unmount ( this , this [ N ] , null === e ? null : ! e ) , this . onUnmounted ( this . props , this . state ) , this } } ) ) , Object . keys ( e ) . filter ( ( t => o ( e [ t ] ) ) ) . forEach ( ( e => { a [ e ] = a [ e ] . bind ( a ) } ) ) , a ; var a }
/* Riot WIP, @license MIT */
function Ge ( e ) { let { css : t , template : n , componentAPI : r , name : o } = e ; return t && o && Pe . add ( o , t ) , $e ( Ve ) ( U ( I ( r , Object . assign ( { } , Se , { [ y ] : { } , [ x ] : { } } ) ) , Object . assign ( { [ T ] : null , [ w ] : null } , Ce , { name : o , css : t , template : n } ) ) ) }
/* Riot WIP, @license MIT */
function He ( e ) { const { css : t , template : n , exports : r , name : o } = e , s = n ? Ee ( n , e ) : D ; return e => { let { slots : i , attributes : a , props : u } = e ; if ( r && r [ O ] )
/* Riot WIP, @license MIT */ return function ( e , t ) { let { slots : n , attributes : r , props : o , css : s , template : i } = t ; i && k ( "Pure components can not have html" ) , s && k ( "Pure components do not have css" ) ; const a = I ( e ( { slots : n , attributes : r , props : o } ) , B ) ; return Ae ( ( e => function ( ) { for ( var t = arguments . length , n = new Array ( t ) , r = 0 ; r < t ; r ++ ) n [ r ] = arguments [ r ] ; if ( e === c ) { const [ e ] = n ; L ( e , O , ! 0 ) , Ne ( e , a ) } return a [ e ] ( ... n ) , a } ) ) } ( r , { slots : i , attributes : a , props : u , css : t , template : n } ) ; const l = S ( r ) || { } , p = Ge ( { css : t , template : s , componentAPI : l , name : o } ) ( { slots : i , attributes : a , props : u } ) ; return { mount : ( e , t , n ) => p . mount ( e , n , t ) , update : ( e , t ) => p . update ( t , e ) , unmount : e => p . unmount ( e ) } } } const Ke = function ( e ) { const t = new Map , n = n => ( t . has ( n ) || t . set ( n , e . call ( this , n ) ) ) && t . get ( n ) ; return n . cache = t , n } ( He ) ;
/* Riot WIP, @license MIT */
function qe ( e , t ) { let { css : n , template : r , exports : o } = t ; return i . has ( e ) && k ( ` The component " ${ e } " was already registered ` ) , i . set ( e , He ( { name : e , css : n , template : r , exports : o } ) ) , i }
/* Riot WIP, @license MIT */
function Xe ( e , t , n ) { return Me ( e ) . map ( ( e =>
/* Riot WIP, @license MIT */
function ( e , t , n , r ) { const o = n || Re ( e ) ; return i . has ( o ) || k ( ` The component named " ${ o } " was never registered ` ) , i . get ( o ) ( { props : t , slots : r } ) . mount ( e ) } ( e , t , n ) ) ) } var We = n ( 432 ) ;
/ * *
* example store for trigger open
*
* @ author Björn Hase
* @ license http : //opensource.org/licenses/MIT The MIT License
* @ link https : //gitea.node001.net/tiny-components/sidebar-form
*
* / c o n s t Y e = n . n ( W e ) ( ) ( { o p e n : f u n c t i o n ( ) { t h i s . t r i g g e r ( " o p e n " ) } } ) , Z e = { s t a t e : { o p e n : ! 1 , i s L o a d i n g : ! 1 , c u r r e n t : { } } , h a n d l e C l o s e : f u n c t i o n ( ) { t h i s . r e s e t ( ) , t h i s . s t a t e . i s O p e n = ! 1 , t h i s . u p d a t e ( ) } , g e t C s s C l a s s e s : f u n c t i o n ( ) { v a r e = [ " s i d e b a r " ] ; r e t u r n ! 0 = = = t h i s . s t a t e . i s O p e n & & e . p u s h ( " s i d e b a r - - o p e n " ) , e . j o i n ( " " ) } , o n B e f o r e M o u n t : f u n c t i o n ( ) { i f ( ! t h i s . h a s O w n P r o p e r t y ( " r e s e t " ) ) t h r o w n e w E r r o r ( " r e s e t - F u n c t i o n i n F o r m i s m i s s i n g " ) ; t h i s . r e s e t ( ) } } ; q e ( " t i n y - l o a d i n g " , { c s s : n u l l , e x p o r t s : n u l l , t e m p l a t e : ( e , t , n , r ) = > e ( ' < d i v e x p r 1 0 = " e x p r 1 0 " c l a s s = " l o a d i n g - w r a p p e r " > < / d i v > ' , [ { t y p e : n . I F , e v a l u a t e : e = > e . p r o p s . a c t i v e , r e d u n d a n t A t t r i b u t e : " e x p r 1 0 " , s e l e c t o r : " [ e x p r 1 0 ] " , t e m p l a t e : e ( ' < d i v c l a s s = " l o a d i n g " > < s p a n > < / s p a n > < s p a n > < / s p a n > < s p a n > < / s p a n > < / d i v > ' , [ ] ) } ] ) , n a m e : " t i n y - l o a d i n g " } ) , q e ( " t i n y - s i d e b a r - f o r m - h e a d e r " , { c s s : n u l l , e x p o r t s : n u l l , t e m p l a t e : ( e , t , n , r ) = > e ( ' < d i v c l a s s = " b a r " > < d i v e x p r 6 = " e x p r 6 " c l a s s = " b a r _ _ m a i n " > < / d i v > < d i v c l a s s = " b a r _ _ e n d " > < b u t t o n e x p r 7 = " e x p r 7 " c l a s s = " b u t t o n b u t t o n - - i c o n b u t t o n - - h o v e r - i c o n - c o n t r a s t m - t o p - 3 m - b o t t o m - 3 " t y p e = " b u t t o n " > < s v g c l a s s = " i c o n f i l l - d a n g e r " a r i a - h i d d e n = " t r u e " > < u s e x l i n k : h r e f = " / s y m b o l - d e f s . s v g # i c o n - c l o s e " / > < / s v g > < / b u t t o n > < / d i v > < / d i v > ' , [ { r e d u n d a n t A t t r i b u t e : " e x p r 6 " , s e l e c t o r : " [ e x p r 6 ] " , e x p r e s s i o n s : [ { t y p e : t . T E X T , c h i l d N o d e I n d e x : 0 , e v a l u a t e : e = > [ e . p r o p s . t i t l e ] . j o i n ( " " ) } ] } , { r e d u n d a n t A t t r i b u t e : " e x p r 7 " , s e l e c t o r : " [ e x p r 7 ] " , e x p r e s s i o n s : [ { t y p e : t . E V E N T , n a m e : " o n c l i c k " , e v a l u a t e : e = > e . p r o p s . c l o s e } ] } ] ) , n a m e : " t i n y - s i d e b a r - f o r m - h e a d e r " } ) , q e ( " t i n y - s i d e b a r - f o r m - f o o t e r " , { c s s : n u l l , e x p o r t s : n u l l , t e m p l a t e : ( e , t , n , r ) = > e ( ' < d i v c l a s s = " s i d e b a r _ _ f o o t e r " > < b u t t o n e x p r 8 = " e x p r 8 " c l a s s = " b u t t o n m - b o t t o m - 0 " t y p e = " s u b m i t " > \ n S a v e \ n < s v g c l a s s = " i c o n f i l l - s u c c e s s p - l e f t - 3 " a r i a - h i d d e n = " t r u e " > < u s e x l i n k : h r e f = " s y m b o l - d e f s . s v g # i c o n - c h e c k " / > < / s v g > < / b u t t o n > < b u t t o n e x p r 9 = " e x p r 9 " c l a s s = " b u t t o n m - b o t t o m - 0 " t y p e = " s u b m i t " c l o s e > \ n S a v e a n d C l o s e \ n < s v g c l a s s = " i c o n f i l l - s u c c e s s p - l e f t - 3 " a r i a - h i d d e n = " t r u e " > < u s e x l i n k : h r e f = " s y m b o l - d e f s . s v g # i c o n - c h e c k " / > < / s v g > < / b u t t o n > < / d i v > ' , [ { r e d u n d a n t A t t r i b u t e : " e x p r 8 " , s e l e c t o r : " [ e x p r 8 ] " , e x p r e s s i o n s : [ { t y p e : t . A T T R I B U T E , n a m e : " d i s a b l e d " , e v a l u a t e : e = > e . p r o p s . a c t i v e } ] } , { r e d u n d a n t A t t r i b u t e : " e x p r 9 " , s e l e c t o r : " [ e x p r 9 ] " , e x p r e s s i o n s : [ { t y p e : t . A T T R I B U T E , n a m e : " d i s a b l e d " , e v a l u a t e : e = > e . p r o p s . a c t i v e } ] } ] ) , n a m e : " t i n y - s i d e b a r - f o r m - f o o t e r " } ) ; c o n s t J e = { c s s : n u l l , e x p o r t s : { h a n d l e C l i c k ( ) { Y e . t r i g g e r ( " o p e n " ) } } , t e m p l a t e : ( e , t , n , r ) = > e ( ' < b u t t o n e x p r 5 = " e x p r 5 " c l a s s = " b u t t o n " > \ n O p e n \ n < / b u t t o n > ' , [ { r e d u n d a n t A t t r i b u t e : " e x p r 5 " , s e l e c t o r : " [ e x p r 5 ] " , e x p r e s s i o n s : [ { t y p e : t . E V E N T , n a m e : " o n c l i c k " , e v a l u a t e : e = > t = > { e . h a n d l e C l i c k ( t ) } } ] } ] ) , n a m e : " e x a m p l e - b u t t o n " } ; q e ( " e x a m p l e - s i d e b a r - f o r m " , { c s s : n u l l , e x p o r t s : ( ) = > ( { . . . Z e , o n M o u n t e d ( ) { Y e . o n ( " o p e n " , ( ( ) = > { t h i s . s t a t e . i s O p e n = ! 0 , t h i s . u p d a t e ( ) } ) ) } , h a n d l e S u b m i t ( e ) { e . p r e v e n t D e f a u l t ( ) , t h i s . s t a t e . i s L o a d i n g = ! 0 , t h i s . u p d a t e ( ) , s e t T i m e o u t ( ( ( ) = > { t h i s . s t a t e . i s L o a d i n g = ! 1 , e . s u b m i t t e r . a t t r i b u t e s . c l o s e & & t h i s . h a n d l e C l o s e ( ) , t h i s . u p d a t e ( ) } ) , 2 5 0 0 ) } , r e s e t ( ) { } } ) , t e m p l a t e : ( e , t , n , r ) = > e ( ' < d i v e x p r 0 = " e x p r 0 " > < d i v c l a s s = " s i d e b a r _ _ i n n e r " > < t i n y - s i d e b a r - f o r m - h e a d e r e x p r 1 = " e x p r 1 " > < / t i n y - s i d e b a r - f o r m - h e a d e r > < d i v c l a s s = " s i d e b a r _ _ f o r m " > < f o r m e x p r 2 = " e x p r 2 " c l a s s = " f o r m " n o v a l i d a t e m e t h o d = " p o s t " > < d i v c l a s s = " s i d e b a r _ _ b o d y " > < d i v c l a s s = " f i e l d - g r o u p " > < l a b e l c l a s s = " f i e l d - l a b e l " > \ n N o t e \ n < t e x t a r e a c l a s s = " f i e l d - t e x t " n a m e = " n o t e " > < / t e x t a r e a > < / l a b e l > < / d i v > < t i n y - l o a d i n g e x p r 3 = " e x p r 3 " > < / t i n y - l o a d i n g > < / d i v > < t i n y - s i d e b a r - f o r m - f o o t e r e x p r 4 = " e x p r 4 " > < / t i n y - s i d e b a r - f o r m - f o o t e r > < / f o r m > < / d i v > < / d i v > < / d i v > ' , [ { r e d u n d a n t A t t r i b u t e : " e x p r 0 " , s e l e c t o r : " [ e x p r 0 ] " , e x p r e s s i o n s : [ { t y p e : t . A T T R I B U T E , n a m e : " c l a s s " , e v a l u a t e : e = > e . g e t C s s C l a s s e s ( ) } ] } , { t y p e : n . T A G , g e t C o m p o n e n t : r , e v a l u a t e : e = > " t i n y - s i d e b a r - f o r m - h e a d e r " , s l o t s : [ ] , a t t r i b u t e s : [ { t y p e : t . A T T R I B U T E , n a m e : " t i t l e " , e v a l u a t e : e = > e . s t a t e . c u r r e n t . n o t e ? " E d i t " : " N e w " } , { t y p e : t . A T T R I B U T E , n a m e : " c l o s e " , e v a l u a t e : e = > t = > { e . h a n d l e C l o s e ( t ) } } ] , r e d u n d a n t A t t r i b u t e : " e x p r 1 " , s e l e c t o r : " [ e x p r 1 ] " } , { r e d u n d a n t A t t r i b u t e : " e x p r 2 " , s e l e c t o r : " [ e x p r 2 ] " , e x p r e s s i o n s : [ { t y p e : t . E V E N T , n a m e : " o n s u b m i t " , e v a l u a t e : e = > t = > { e . h a n d l e S u b m i t ( t ) } } ] } , { t y p e : n . T A G , g e t C o m p o n e n t : r , e v a l u a t e : e = > " t i n y - l o a d i n g " , s l o t s : [ ] , a t t r i b u t e s : [ { t y p e : t . A T T R I B U T E , n a m e : " a c