( ( ) => { var t , e = { 837 : ( t , e , n ) => { "use strict" ; var i = { } ; n . r ( i ) , n . d ( i , { _ _ : ( ) => ee , component : ( ) => Zt , install : ( ) => qt , mount : ( ) => $t , pure : ( ) => Jt , register : ( ) => Wt , uninstall : ( ) => Kt , unmount : ( ) => Gt , unregister : ( ) => Vt , version : ( ) => te , withTypes : ( ) => Qt } ) ;
/* Riot WIP, @license MIT */
const r = new Map , s = Symbol ( "riot-component" ) , o = new Set , a = "mount" , u = "update" , c = "unmount" , l = "shouldUpdate" , h = "onBeforeMount" , p = "onMounted" , d = "onBeforeUpdate" , f = "onUpdated" , m = "onBeforeUnmount" , v = "onUnmounted" , g = "props" , y = "state" , b = "slots" , T = "root" , x = Symbol ( "pure" ) , E = Symbol ( "is_updating" ) , O = Symbol ( "parent" ) , A = Symbol ( "attributes" ) , w = Symbol ( "template" ) , _ = { ATTRIBUTE : 0 , EVENT : 1 , TEXT : 2 , VALUE : 3 } ; function N ( t ) { return t . replace ( /-(\w)/g , ( ( t , e ) => e . toUpperCase ( ) ) ) }
/* Riot WIP, @license MIT */
function S ( t , e ) { throw new Error ( t , { cause : e } ) } function j ( t ) { const e = new Map , n = n => ( e . has ( n ) || e . set ( n , t . call ( this , n ) ) ) && e . get ( n ) ; return n . cache = e , n } function C ( t ) { return t . reduce ( ( ( t , e ) => { const { value : n , type : i } = e ; switch ( ! 0 ) { case ! e . name && 0 === i : return Object . assign ( { } , t , n ) ; case 3 === i : t . value = e . value ; break ; default : t [ N ( e . name ) ] = e . value } return t } ) , { } ) }
/* Riot WIP, @license MIT */
function M ( t , e ) { return typeof t === e } function I ( t ) { const e = t . ownerSVGElement ; return ! ! e || null === e } function P ( t ) { return "template" === t . tagName . toLowerCase ( ) } function D ( t ) { return M ( t , "function" ) } function R ( t ) { return ! k ( t ) && t . constructor === Object } function k ( t ) { return null == t }
/* Riot WIP, @license MIT */
function z ( ) { return this } function L ( t ) { return D ( t ) ? t . prototype && t . prototype . constructor ? new t : t ( ) : t }
/* Riot v7.1.0, @license MIT */
const U = Object . freeze ( { [ a ] : z , [ u ] : z , [ c ] : z } ) , Y = Object . assign ( { } , U , { clone : z , createDOM : z } ) ; function X ( t ) { for ( ; t . firstChild ; ) t . removeChild ( t . firstChild ) } const F = t => t . remove ( ) , H = ( t , e ) => e && e . parentNode && e . parentNode . insertBefore ( t , e ) , B = { EACH : 0 , IF : 1 , SIMPLE : 2 , TAG : 3 , SLOT : 4 } ;
/* Riot WIP, @license MIT */
function W ( t , e , n , i ) { return void 0 === i && ( i = { } ) , Object . defineProperty ( t , e , Object . assign ( { value : n , enumerable : ! 1 , writable : ! 1 , configurable : ! 0 } , i ) ) , t } function q ( t , e , n ) { return Object . entries ( e ) . forEach ( ( e => { let [ i , r ] = e ; W ( t , i , r , n ) } ) ) , t } function V ( t , e ) { return Object . entries ( e ) . forEach ( ( e => { let [ n , i ] = e ; t [ n ] || ( t [ n ] = i ) } ) ) , t }
/* Riot WIP, @license MIT */
const $ = Symbol ( ) , G = Symbol ( ) ; function K ( t ) { const e = t . dom . cloneNode ( ! 0 ) , { head : n , tail : i } = function ( ) { const t = document . createTextNode ( "" ) , e = document . createTextNode ( "" ) ; return t [ $ ] = ! 0 , e [ G ] = ! 0 , { head : t , tail : e } } ( ) ; return { avoidDOMInjection : ! 0 , fragment : e , head : n , tail : i , children : [ n , ... Array . from ( e . childNodes ) , i ] } } const Z = Symbol ( "unmount" ) , J = { nodes : [ ] , mount ( t , e ) { return this . update ( t , e ) } , update ( t , e ) { const { placeholder : n , nodes : i , childrenMap : r } = this , s = t === Z ? null : this . evaluate ( t ) , o = s ? Array . from ( s ) : [ ] , { newChildrenMap : a , batches : u , futureNodes : c } = function ( t , e , n , i ) { const { condition : r , template : s , childrenMap : o , itemName : a , getKey : u , indexName : c , root : l , isTemplateTag : h } = i , p = new Map , d = [ ] , f = [ ] ; return t . forEach ( ( ( t , i ) => { const m = function ( t , e ) { let { itemName : n , indexName : i , index : r , item : s } = e ; W ( t , n , s ) , i && W ( t , i , r ) ; return t } ( Object . create ( e ) , { itemName : a , indexName : c , index : i , item : t } ) , v = u ? u ( m ) : i , g = o . get ( v ) , y = [ ] ; if ( function ( t , e ) { return ! ! t && ! t ( e ) } ( r , m ) ) return ; const b = ! g , T = g ? g . template : s . clone ( ) , x = T . el || l . cloneNode ( ) , E = h && b ? K ( T ) : T . meta ; b ? d . push ( ( ( ) => T . mount ( x , m , n , E ) ) ) : d . push ( ( ( ) => T . update ( m , n ) ) ) , h ? y . push ( ... E . children ) : y . push ( x ) , o . delete ( v ) , f . push ( ... y ) , p . set ( v , { nodes : y , template : T , context : m , index : i } ) } ) ) , { newChildrenMap : p , batches : d , futureNodes : f } } ( o , t , e , this ) ; return ( ( t , e , n , i ) => { const r = e . length ; let s = t . length , o = r , a = 0 , u = 0 , c = null ; for ( ; a < s || u < o ; ) if ( s === a ) { const t = o < r ? u ? n ( e [ u - 1 ] , - 0 ) . nextSibling : n ( e [ o - u ] , 0 ) : i ; for ( ; u < o ; ) H ( n ( e [ u ++ ] , 1 ) , t ) } else if ( o === u ) for ( ; a < s ; ) c && c . has ( t [ a ] ) || F ( n ( t [ a ] , - 1 ) ) , a ++ ; else if ( t [ a ] === e [ u ] ) a ++ , u ++ ; else if ( t [ s - 1 ] === e [ o - 1 ] ) s -- , o -- ; else if ( t [ a ] === e [ o - 1 ] && e [ u ] === t [ s - 1 ] ) { const i = n ( t [ -- s ] , - 1 ) . nextSibling ; H ( n ( e [ u ++ ] , 1 ) , n ( t [ a ++ ] , - 1 ) . nextSibling ) , H ( n ( e [ -- o ] , 1 ) , i ) , t [ s ] = e [ o ] } else { if ( ! c ) { c = new Map ; let t = u ; for ( ; t < o ; ) c . set ( e [ t ] , t ++ ) } if ( c . has ( t [ a ] ) ) { const i = c . get ( t [ a ] ) ; if ( u < i && i < o ) { let r = a , p = 1 ; for ( ; ++ r < s && r < o && c . get ( t [ r ] ) === i + p ; ) p ++ ; if ( p > i - u ) { const r = n ( t [ a ] , 0 ) ; for ( ; u < i ; ) H ( n ( e [ u ++ ] , 1 ) , r ) } else l = n ( e [ u ++ ] , 1 ) , ( h = n ( t [ a ++ ] , - 1 ) ) && h . parentNode && h . parentNode . replaceChild ( l , h ) } else a ++ } else F ( n ( t [ a ++ ] , - 1 ) ) } var l , h } ) ( i , c , function ( t , e ) { return ( n , i ) => { if ( i < 0 ) { const n = t [ t . length - 1 ] ; if ( n ) { const { template : i , nodes : r , context : s } = n ; r . pop ( ) , r . length || ( t . pop ( ) , i . unmount ( s , e , null ) ) } } return n } } ( Array . from ( r . values ( ) ) , e ) , n ) , u . forEach ( ( t => t ( ) ) ) , this . childrenMap = a , this . nodes = c , this } , unmount ( t , e ) { return this . update ( Z , e ) , this } } ; const Q = { mount ( t , e ) { return this . update ( t , e ) } , update ( t , e ) { const n = ! ! this . evaluate ( t ) , i = ! this . value && n , r = this . value && ! n , s = ( ) => { const n = this . node . cloneNode ( ) ; H ( n , this . placeholder ) , this . template = this . template . clone ( ) , this . template . mount ( n , t , e ) } ; switch ( ! 0 ) { case i : s ( ) ; break ; case r : this . unmount ( t ) ; break ; default : n && this . template . update ( t , e ) } return this . value = n , this } , unmount ( t , e ) { return this . template . unmount ( t , e , ! 0 ) , this } } ; const tt = "undefined" == typeof Element ? { } : Element . prototype , et = j ( ( t => tt . hasOwnProperty ( t ) ) ) ; function nt ( t , e , n , i ) { let { name : r } = e ; if ( ! r ) return i && function ( t , e , n ) { const i = e ? Object . keys ( e ) : [ ] ; Object . keys ( n ) . filter ( ( t => ! i . includes ( t ) ) ) . forEach ( ( e => t . removeAttribute ( e ) ) ) } ( t , n , i ) , void ( n && function ( t , e ) { Object . entries ( e ) . forEach ( ( e => { let [ n , i ] = e ; return nt ( t , { name : n } , i ) } ) ) } ( t , n ) ) ; ! et ( r ) && ( function ( t ) { return M ( t , "boolean" ) } ( n ) || R ( n ) || D ( n ) ) && ( t [ r ] = n ) , ! function ( t ) { return ! t && 0 !== t } ( n ) ? function ( t ) { return ! 0 === t || [ "string" , "number" ] . includes ( typeof t ) } ( n ) && t . setAttribute ( r , function ( t , e ) { return ! 0 === e ? t : e } ( r , n ) ) : t . removeAttribute ( r ) } const it = /^on/ , rt = { handleEvent ( t ) { this [ t . type ] ( t ) } } , st = new WeakMap ; function ot ( t ) { return k ( t ) ? "" : t } const at = ( t , e ) => { const n = t . childNodes [ e ] ; if ( n . nodeType === Node . COMMENT _NODE ) { const e = document . createTextNode ( "" ) ; return t . replaceChild ( e , n ) , e } return n } ; const ut = { 0 : nt , 1 : function ( t , e , n ) { let { name : i } = e ; const r = i . replace ( it , "" ) , s = st . get ( t ) || ( t => { const e = Object . create ( rt ) ; return st . set ( t , e ) , e } ) ( t ) , [ o , a ] = ( t => Array . isArray ( t ) ? t : [ t , ! 1 ] ) ( n ) , u = s [ r ] , c = o && ! u ; u && ! o && t . removeEventListener ( r , s ) , c && t . addEventListener ( r , s , a ) , s [ r ] = o } , 2 : function ( t , e , n ) { t . data = ot ( n ) } , 3 : function ( t , e , n ) { t . value = ot ( n ) } } , ct = { mount ( t ) { return this . value = this . evaluate ( t ) , lt ( this , this . value ) , this } , update ( t ) { const e = this . evaluate ( t ) ; return this . value !== e && ( lt ( this , e ) , this . value = e ) , this } , unmount ( ) { return 1 ==
/* Riot v7.1.0, @license MIT */
const Ot = ( t , e ) => t [ s ] = e ;
/* Riot v7.1.0, @license MIT */
function At ( t ) { return [ a , u , c ] . reduce ( ( ( e , n ) => ( e [ n ] = t ( n ) , e ) ) , { } ) }
/* Riot WIP, @license MIT */
function wt ( t ) { return Array . isArray ( t ) ? t : /^\[object (HTMLCollection|NodeList|Object)\]$/ . test ( Object . prototype . toString . call ( t ) ) && "number" == typeof t . length ? Array . from ( t ) : [ t ] }
/* Riot WIP, @license MIT */
function _t ( t , e ) { return wt ( "string" == typeof t ? ( e || document ) . querySelectorAll ( t ) : t ) }
/* Riot v7.1.0, @license MIT */
const Nt = Object . freeze ( { $ ( t ) { return _t ( t , this . root ) [ 0 ] } , $$ ( t ) { return _t ( t , this . root ) } } ) , St = Object . freeze ( { [ l ] : z , [ h ] : z , [ p ] : z , [ d ] : z , [ f ] : z , [ m ] : z , [ v ] : z } ) , jt = t => 1 === t . length ? t [ 0 ] : t ; function Ct ( t , e , n ) { const i = "object" == typeof e ? e : { [ e ] : n } , r = Object . keys ( i ) ; return wt ( t ) . forEach ( ( t => { r . forEach ( ( e => t . setAttribute ( e , i [ e ] ) ) ) } ) ) , t } function Mt ( t , e ) { return function ( t , e , n ) { const i = "string" == typeof e ? [ e ] : e ; return jt ( wt ( t ) . map ( ( t => jt ( i . map ( ( e => t [ n ] ( e ) ) ) ) ) ) ) } ( t , e , "getAttribute" ) }
/* Riot v7.1.0, @license MIT */
const It = new Map , Pt = ( ) => Dt || ( Ct ( Dt = _t ( "style[riot]" ) [ 0 ] || document . createElement ( "style" ) , "type" , "text/css" ) , Dt . parentNode || document . head . appendChild ( Dt ) , Dt ) ; var Dt ; const Rt = { CSS _BY _NAME : It , add ( t , e ) { return It . has ( t ) || ( It . set ( t , e ) , this . inject ( ) ) , this } , inject ( ) { return Pt ( ) . innerHTML = [ ... It . values ( ) ] . join ( "\n" ) , this } , remove ( t ) { return It . has ( t ) && ( It . delete ( t ) , this . inject ( ) ) , this } } ;
/* Riot WIP, @license MIT */
function kt ( t ) { for ( var e = arguments . length , n = new Array ( e > 1 ? e - 1 : 0 ) , i = 1 ; i < e ; i ++ ) n [ i - 1 ] = arguments [ i ] ; return function ( ) { for ( var e = arguments . length , i = new Array ( e ) , r = 0 ; r < e ; r ++ ) i [ r ] = arguments [ r ] ; return ( i = [ ... n , ... i ] ) . length < t . length ? kt ( t , ... i ) : t ( ... i ) } }
/* Riot v7.1.0, @license MIT */
function zt ( t ) { return Mt ( t , "is" ) || t . tagName . toLowerCase ( ) }
/* Riot v7.1.0, @license MIT */
function Lt ( t , e ) { return Object . assign ( { } , t , L ( e ) ) }
/* Riot v7.1.0, @license MIT */
function Ut ( t , e ) { return void 0 === e && ( e = { } ) , Object . assign ( { } ,
/* Riot WIP, @license MIT */
function ( t ) { return Array . from ( t . attributes ) . reduce ( ( ( t , e ) => ( t [ N ( e . name ) ] = e . value , t ) ) , { } ) } ( t ) , L ( e ) ) }
/* Riot v7.1.0, @license MIT */
function Yt ( t , e ) { let { slots : n , attributes : i , props : r } = e ; return s =
/* Riot v7.1.0, @license MIT */
function ( t ) { return [ ... o ] . reduce ( ( ( t , e ) => e ( t ) || t ) , t ) } ( q ( R ( t ) ? Object . create ( t ) : t , { mount ( e , s , o ) { return void 0 === s && ( s = { } ) , W ( e , x , ! 1 ) , this [ O ] = o , this [ A ] =
/* Riot v7.1.0, @license MIT */
function ( t , e ) { void 0 === e && ( e = [ ] ) ; const n = e . map ( ( e => ht ( t , e ) ) ) , i = { } ; return Object . assign ( i , Object . assign ( { expressions : n } , At ( ( t => e => ( n . forEach ( ( n => n [ t ] ( e ) ) ) , i ) ) ) ) ) } ( e , i ) . mount ( o ) , W ( this , g , Object . freeze ( Object . assign ( { } , Ut ( e , r ) , C ( this [ A ] . expressions ) ) ) ) , this [ y ] = Lt ( this [ y ] , s ) , this [ w ] = this . template . createDOM ( e ) . clone ( ) , Ot ( e , this ) , t . name &&
/* Riot v7.1.0, @license MIT */
function ( t , e ) { zt ( t ) !== e && Ct ( t , "is" , e ) } ( e , t . name ) , W ( this , T , e ) , W ( this , b , n ) , this [ h ] ( this [ g ] , this [ y ] ) , this [ w ] . mount ( e , this , o ) , this [ p ] ( this [ g ] , this [ y ] ) , this } , update ( t , e ) { void 0 === t && ( t = { } ) , e && ( this [ O ] = e , this [ A ] . update ( e ) ) ; const n = C ( this [ A ] . expressions ) ; if ( ! 1 !== this [ l ] ( n , this [ g ] ) ) return W ( this , g , Object . freeze ( Object . assign ( { } , this [ g ] , n ) ) ) , this [ y ] = Lt ( this [ y ] , t ) , this [ d ] ( this [ g ] , this [ y ] ) , this [ E ] || ( this [ E ] = ! 0 , this [ w ] . update ( this , this [ O ] ) ) , this [ f ] ( this [ g ] , this [ y ] ) , this [ E ] = ! 1 , this } , unmount ( t ) { return this [ m ] ( this [ g ] , this [ y ] ) , this [ A ] . unmount ( ) , this [ w ] . unmount ( this , this [ O ] , null === t ? null : ! t ) , this [ v ] ( this [ g ] , this [ y ] ) , this } } ) ) , Object . keys ( t ) . filter ( ( e => D ( t [ e ] ) ) ) . forEach ( ( t => { s [ t ] = s [ t ] . bind ( s ) } ) ) , s ; var s }
/* Riot v7.1.0, @license MIT */
function Xt ( t ) { let { css : e , template : n , componentAPI : i , name : r } = t ; return e && r && Rt . add ( r , e ) , kt ( Yt ) ( q ( V ( i , Object . assign ( { } , St , { [ g ] : { } , [ y ] : { } } ) ) , Object . assign ( { [ b ] : null , [ T ] : null } , Nt , { name : r , css : e , template : n } ) ) ) } const Ft = t => { const e = ( void 0 === ( n = t . exports ? t . exports . components : { } ) && ( n = { } ) , Object . entries ( L ( n ) ) . reduce ( ( ( t , e ) => { let [ n , i ] = e ;
/* Riot WIP, @license MIT */
var r ; return t [ ( r = n , r . replace ( /([a-z])([A-Z])/g , "$1-$2" ) . toLowerCase ( ) ) ] = Bt ( i ) , t } ) , { } ) ) ;
/* Riot v7.1.0, @license MIT */
var n ; return n => n === t . name ? Ht ( t ) : e [ n ] || r . get ( n ) } , Ht = j ( Bt ) ; function Bt ( t ) { const { css : e , template : n , exports : i , name : r } = t , s = n ?
/* Riot v7.1.0, @license MIT */
function ( t , e , n ) { return t ( Et , _ , B , n ) } ( n , 0 , Ft ( t ) ) : Y ; return t => { let { slots : o , attributes : u , props : c } = t ; if ( i && i [ x ] )
/* Riot v7.1.0, @license MIT */ return function ( t , e ) { let { slots : n , attributes : i , props : r , css : s , template : o } = e ; o && S ( "Pure components can not have html" ) , s && S ( "Pure components do not have css" ) ; const u = V ( t ( { slots : n , attributes : i , props : r } ) , U ) ; return At ( ( t => function ( ) { for ( var e = arguments . length , n = new Array ( e ) , i = 0 ; i < e ; i ++ ) n [ i ] = arguments [ i ] ; if ( t === a ) { const [ t ] = n ; W ( t , x , ! 0 ) , Ot ( t , u ) } return u [ t ] ( ... n ) , u } ) ) } ( i , { slots : o , attributes : u , props : c , css : e , template : n } ) ; const l = L ( i ) || { } , h = Xt ( { css : e , template : s , componentAPI : l , name : r } ) ( { slots : o , attributes : u , props : c } ) ; return { mount : ( t , e , n ) => h . mount ( t , n , e ) , update : ( t , e ) => h . update ( e , t ) , unmount : t => h . unmount ( t ) } } }
/* Riot v7.1.0, @license MIT */
function Wt ( t , e ) { let { css : n , template : i , exports : s } = e ; return r . has ( t ) && S ( ` The component " ${ t } " was already registered ` ) , r . set ( t , Bt ( { name : t , css : n , template : i , exports : s } ) ) , r }
/* Riot v7.1.0, @license MIT */
function qt ( t ) { return D ( t ) || S ( "Plugins must be of type function" ) , o . has ( t ) && S ( "This plugin was already installed" ) , o . add ( t ) , o }
/* Riot v7.1.0, @license MIT */
function Vt ( t ) { return r . has ( t ) || S ( ` The component " ${ t } " was never registered ` ) , r . delete ( t ) , Rt . remove ( t ) , r }
/* Riot v7.1.0, @license MIT */
function $t ( t , e , n ) { return _t ( t ) . map ( ( t =>
/* Riot v7.1.0, @license MIT */
function ( t , e , n , i ) { const s = n || zt ( t ) ; return r . has ( s ) || S ( ` The component named " ${ s } " was never registered ` ) , r . get ( s ) ( { props : e , slots : i } ) . mount ( t ) } ( t , e , n ) ) ) }
/* Riot v7.1.0, @license MIT */
function Gt ( t , e ) { return _t ( t ) . map ( ( t => ( t [ s ] && t [ s ] . unmount ( e ) , t ) ) ) }
/* Riot v7.1.0, @license MIT */
function Kt ( t ) { return o . has ( t ) || S ( "This plugin was never installed" ) , o . delete ( t ) , o }
/* Riot v7.1.0, @license MIT */
function Zt ( t ) { return function ( e , n , i ) { let { slots : r , attributes : s , parentScope : o } = void 0 === i ? { } : i ;
/* Riot WIP, @license MIT */
return function ( ) { for ( var t = arguments . length , e = new Array ( t ) , n = 0 ; n < t ; n ++ ) e [ n ] = arguments [ n ] ; return e . reduce ( ( ( t , e ) => function ( ) { return t ( e ( ... arguments ) ) } ) ) } ( ( t => t . mount ( e , o ) ) , ( t => t ( { props : n , slots : r , attributes : s } ) ) , Bt ) ( t ) } }
/* Riot v7.1.0, @license MIT */
function Jt ( t ) { return D ( t ) || S ( 'riot.pure accepts only arguments of type "function"' ) , t [ x ] = ! 0 , t }
/* Riot v7.1.0, @license MIT */
const Qt = t => t , te = "v7.1.0" , ee = { cssManager : Rt , DOMBindings : { template : Et , createBinding : bt , createExpression : ht , bindingTypes : B , expressionTypes : _ } , globals : { DOM _COMPONENT _INSTANCE _PROPERTY : s , PARENT _KEY _SYMBOL : O } } ;
/* Riot v7.1.0, @license MIT */
var ne = n ( 840 ) ;
/ * *
* Mixin for extends Riot - Component
*
* @ author Björn Hase
* @ license http : //opensource.org/licenses/MIT The MIT License
* @ link https : //gitea.node001.net/tiny-components/slider
*
* /const ie={state:{position:0,max:0,slides:void 0,classes:{item:"tiny-slider__item"}},onMounted:function(){var t=this;this.props.slides&&(this.state.slides=this.props.slides),window.addEventListener("resize",this.update.bind(this)),setTimeout((function(){t.update()}),100),new ne(this.root).on("swipe",(function(e){4===e.direction?t.handlePrevious(e):2===e.direction&&t.handleNext(e)}))},onBeforeUnmount:function(){window.removeEventListener("resize",this.update.bind(this))},onBeforeUpdate:function(t,e){var n=this,i=this.state.max,r=this.$("."+this.state.classes.item);if(r){this.state.max=0,this.state.width=r.offsetWidth,this.$$("."+this.state.classes.item).forEach((function(t,e){t.offsetLeft<n.root.offsetWidth&&n.state.max++}));var s=Math.abs(this.state.max-i);this.state.position>=s&&this.state.position>1&&(this.state.position-=s)}},handleSelect:function(t,e){t.preventDefault(),this.state.position!==e&&this.update({position:e})},handlePrevious:function(t){t.preventDefault(),this.state.position>0&&this.update({position:--this.state.position})},handleNext:function(t){t.preventDefault(),this.state.position<this.props.slides.length-1&&this.update({position:++this.state.position})},getPreviousClasses:function(){var t=["tiny-slider__button","tiny-slider__button--previous"];return this.state.position>0?t.push("visibility-visible"):t.push("visibility-hidden"),t.join(" ")},getNextClasses:function(){var t=["tiny-slider__button","tiny-slider__button--next"];return this.state.position<=this.props.slides.length-this.state.max?t.push("visibility-visible"):t.push("visibility-hidden"),t.join(" ")},getSelectClasses:function(t){var e=["tiny-slider__select-item"];return this.state.position===t&&e.push("tiny-slider__select-item--current"),e.join(" ")},getContentStyles:function(){var t=-this.state.position*this.state.width;return this.styles({transform:"translate("+t+"px, 0px)"})}};Wt("tiny-raw",{css:null,exports:{setInnerHTML(){this.root.innerHTML=this.props.html},onMounted(){this.setInnerHTML()},onUpdated(){this.setInnerHTML()}},template:(t,e,n,i)=>t("\n\n / * * \ n * tiny raw \ n * \ n * @ author Björn Hase \ n * @ license http : //opensource.org/licenses/MIT The MIT License\n * @link https://gitea.node001.net/tiny-components/raw\n *\n */\n\n ",[]),name:"tiny-raw"});const re={css:null,exports:()=>({...ie}),template:(t,e,n,i)=>t('<div class="slider tiny-slider"><div class="display-flex"><button expr0="expr0"><svg class="icon"><use xlink:href="/symbol-defs.svg#icon-previous"/></svg></button><div class="overflow-hidden"><div expr1="expr1" class="slider__inner tiny-slider__inner"><div expr2="expr2" class="slider__item tiny-slider__item"></div></div></div><button expr7="expr7"><svg class="icon"><use xlink:href="/symbol-defs.svg#icon-next"/></svg></button></div><div class="tiny-slider__select display-flex m-top-4"><span expr8="expr8"></span></div></div>',[{redundantAttribute:"expr0",selector:"[expr0]",expressions:[{type:e.ATTRIBUTE,name:"class",evaluate:t=>t.getPreviousClasses()},{type:e.EVENT,name:"onclick",evaluate:t=>e=>{t.handlePrevious(e)}}]},{redundantAttribute:"expr1",selector:"[expr1]",expressions:[{type:e.ATTRIBUTE,name:"style",evaluate:t=>t.getContentStyles()}]},{type:n.EACH,getKey:null,condition:null,template:t('<h3 expr3="expr3" class="tiny-slider__title"> </h3><figure expr4="expr4" class="tiny-slider__figure"></figure><div class="tiny-slider__content"><div class="content"><tiny-raw expr6="expr6"></tiny-raw></div></div>',[{redundantAttribute:"expr3",selector:"[expr3]",expressions:[{type:e.TEXT,childNodeIndex:0,evaluate:t=>[t.slide.title].join("")}]},{type:n.IF,evaluate:t=>t.slide.media,redundantAttribute:"expr4",selector:"[expr4]",template:t('<img expr5="expr5" class="tiny-slider__media" loading="lazy"/>',[{redundantAttribute:"expr5",selector:"[expr5]",expressions:[{type:e.ATTRIBUTE,name:"src",evaluate:t=>t.slide.media.url},{type:e.ATTRIBUTE,name:"alt",evaluate:t=>t.slide.media.description}]}])},{type:n.TAG,getComponent:i,evaluate:t=>"tiny-raw",slots:[],attributes:[{type:e.ATTRIBUTE,name:"html",evaluate:t=>t.
/ * ! H a m m e r . J S - v 2 . 0 . 7 - 2 0 1 6 - 0 4 - 2 2
* http : //hammerjs.github.io/
*
* Copyright ( c ) 2016 Jorik Tangelder ;
* Licensed under the MIT license * /!function(r,s,o,a){"use strict";var u,c=["","webkit","Moz","MS","ms","o"],l=s.createElement("div"),h=Math.round,p=Math.abs,d=Date.now;function f(t,e,n){return setTimeout(x(t,n),e)}function m(t,e,n){return!!Array.isArray(t)&&(v(t,n[e],n),!0)}function v(t,e,n){var i;if(t)if(t.forEach)t.forEach(e,n);else if(t.length!==a)for(i=0;i<t.length;)e.call(n,t[i],i,t),i++;else for(i in t)t.hasOwnProperty(i)&&e.call(n,t[i],i,t)}function g(t,e,n){var i="DEPRECATED METHOD: "+e+"\n"+n+" AT \n";return function(){var e=new Error("get-stack-trace"),n=e&&e.stack?e.stack.replace(/ ^ [ ^ \ ( ] + ? [ \ n$ ] / gm , "" ) . replace ( /^\s+at\s+/gm , "" ) . replace ( /^Object.<anonymous>\s*\(/gm , "{anonymous}()@" ) : "Unknown Stack Trace" , s = r . console && ( r . console . warn || r . console . log ) ; return s && s . call ( r . console , i , n ) , t . apply ( this , arguments ) } } u = "function" != typeof Object . assign ? function ( t ) { if ( t === a || null === t ) throw new TypeError ( "Cannot convert undefined or null to object" ) ; for ( var e = Object ( t ) , n = 1 ; n < arguments . length ; n ++ ) { var i = arguments [ n ] ; if ( i !== a && null !== i ) for ( var r in i ) i . hasOwnProperty ( r ) && ( e [ r ] = i [ r ] ) } return e } : Object . assign ; var y = g ( ( function ( t , e , n ) { for ( var i = Object . keys ( e ) , r = 0 ; r < i . length ; ) ( ! n || n && t [ i [ r ] ] === a ) && ( t [ i [ r ] ] = e [ i [ r ] ] ) , r ++ ; return t } ) , "extend" , "Use `assign`." ) , b = g ( ( function ( t , e ) { return y ( t , e , ! 0 ) } ) , "merge" , "Use `assign`." ) ; function T ( t , e , n ) { var i , r = e . prototype ; ( i = t . prototype = Object . create ( r ) ) . constructor = t , i . _super = r , n && u ( i , n ) } function x ( t , e ) { return function ( ) { return t . apply ( e , arguments ) } } function E ( t , e ) { return "function" == typeof t ? t . apply ( e && e [ 0 ] || a , e ) : t } function O ( t , e ) { return t === a ? e : t } function A ( t , e , n ) { v ( S ( e ) , ( function ( e ) { t . addEventListener ( e , n , ! 1 ) } ) ) } function w ( t , e , n ) { v ( S ( e ) , ( function ( e ) { t . removeEventListener ( e , n , ! 1 ) } ) ) } function _ ( t , e ) { for ( ; t ; ) { if ( t == e ) return ! 0 ; t = t . parentNode } return ! 1 } function N ( t , e ) { return t . indexOf ( e ) > - 1 } function S ( t ) { return t . trim ( ) . split ( /\s+/g ) } function j ( t , e , n ) { if ( t . indexOf && ! n ) return t . indexOf ( e ) ; for ( var i = 0 ; i < t . length ; ) { if ( n && t [ i ] [ n ] == e || ! n && t [ i ] === e ) return i ; i ++ } return - 1 } function C ( t ) { return Array . prototype . slice . call ( t , 0 ) } function M ( t , e , n ) { for ( var i = [ ] , r = [ ] , s = 0 ; s < t . length ; ) { var o = e ? t [ s ] [ e ] : t [ s ] ; j ( r , o ) < 0 && i . push ( t [ s ] ) , r [ s ] = o , s ++ } return n && ( i = e ? i . sort ( ( function ( t , n ) { return t [ e ] > n [ e ] } ) ) : i . sort ( ) ) , i } function I ( t , e ) { for ( var n , i , r = e [ 0 ] . toUpperCase ( ) + e . slice ( 1 ) , s = 0 ; s < c . length ; ) { if ( ( i = ( n = c [ s ] ) ? n + r : e ) in t ) return i ; s ++ } return a } var P = 1 ; function D ( t ) { var e = t . ownerDocument || t ; return e . defaultView || e . parentWindow || r } var R = "ontouchstart" in r , k = I ( r , "PointerEvent" ) !== a , z = R && /mobile|tablet|ip(ad|hone|od)|android/i . test ( navigator . userAgent ) , L = "touch" , U = "mouse" , Y = 24 , X = [ "x" , "y" ] , F = [ "clientX" , "clientY" ] ; function H ( t , e ) { var n = this ; this . manager = t , this . callback = e , this . element = t . element , this . target = t . options . inputTarget , this . domHandler = function ( e ) { E ( t . options . enable , [ t ] ) && n . handler ( e ) } , this . init ( ) } function B ( t , e , n ) { var i = n . pointers . length , r = n . changedPointers . length , s = 1 & e && i - r == 0 , o = 12 & e && i - r == 0 ; n . isFirst = ! ! s , n . isFinal = ! ! o , s && ( t . session = { } ) , n . eventType = e , function ( t , e ) { var n = t . session , i = e . pointers , r = i . length ; n . firstInput || ( n . firstInput = W ( e ) ) ; r > 1 && ! n . firstMultiple ? n . firstMultiple = W ( e ) : 1 === r && ( n . firstMultiple = ! 1 ) ; var s = n . firstInput , o = n . firstMultiple , u = o ? o . center : s . center , c = e . center = q ( i ) ; e . timeStamp = d ( ) , e . deltaTime = e . timeStamp - s . timeStamp , e . angle = K ( u , c ) , e . distance = G ( u , c ) , function ( t , e ) { var n = e . center , i = t . offsetDelta || { } , r = t . prevDelta || { } , s = t . prevInput || { } ; 1 !== e . eventType && 4 !== s . eventType || ( r = t . prevDelta = { x : s . deltaX || 0 , y : s . deltaY || 0 } , i = t . offsetDelta = { x : n . x , y : n . y } ) ; e . deltaX = r . x + ( n . x - i . x ) , e . deltaY = r . y + ( n . y - i . y ) } ( n , e ) , e . offsetDirection = $ ( e . deltaX , e . deltaY ) ; var l = V ( e . deltaTime , e . deltaX , e . deltaY ) ; e . overallVelocityX = l . x , e . overallVelocityY = l . y , e . overallVelocity = p ( l . x ) > p ( l . y ) ? l . x : l . y , e . scale = o ? ( h = o . pointers , f = i , G ( f [ 0 ] , f [ 1 ] , F ) / G ( h [ 0 ] , h [ 1 ] , F ) ) : 1 , e . rotation = o ? function ( t , e ) { return K ( e [ 1 ] , e [ 0 ] , F ) + K ( t [ 1 ] , t [ 0 ] , F ) } ( o . pointers , i ) : 0 , e . maxPointers = n . prevInput ? e . pointers . length > n . prevInput . maxPointers ? e . pointers . length : n . prevInput . maxPointers : e . pointers . length , function ( t , e ) { var n , i , r , s , o = t . lastInterval || e , u = e . timeStamp - o . timeStamp ; if ( 8 != e . eventType && ( u > 25 || o . v
