404
+ +Page not found
+ + +'+ escapeHtml(title) + '
' + escapeHtml(summary) +'
+
+
+
+ '.concat(d,"
"))),k(d))){"none"==d.style.display&&(d.style.display="block");var c=document.createElement("div");c.className="ginlined-content",c.appendChild(d),s=c}if(r){var u=document.getElementById(r);if(!u)return!1;var g=u.cloneNode(!0);g.style.height=t.height,g.style.maxWidth=t.width,h(g,"ginlined-content"),s=g}if(!s)return console.error("Unable to append inline slide content",t),!1;o.style.height=t.height,o.style.width=t.width,o.appendChild(s),this.events["inlineclose"+r]=a("click",{onElement:o.querySelectorAll(".gtrigger-close"),withCallback:function(e){e.preventDefault(),l.close()}}),T(n)&&n()}function Z(e,t,i,n){var s=e.querySelector(".gslide-media"),l=function(e){var t=e.url,i=e.allow,n=e.callback,s=e.appendTo,l=document.createElement("iframe");return l.className="vimeo-video gvideo",l.src=t,l.style.width="100%",l.style.height="100%",i&&l.setAttribute("allow",i),l.onload=function(){h(l,"node-ready"),T(n)&&n()},s&&s.appendChild(l),l}({url:t.href,callback:n});s.parentNode.style.maxWidth=t.width,s.parentNode.style.height=t.height,s.appendChild(l)}var $=function(){function e(){var i=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};t(this,e),this.defaults={href:"",sizes:"",srcset:"",title:"",type:"",description:"",alt:"",descPosition:"bottom",effect:"",width:"",height:"",content:!1,zoomable:!0,draggable:!0},L(i)&&(this.defaults=l(this.defaults,i))}return n(e,[{key:"sourceType",value:function(e){var t=e;if(null!==(e=e.toLowerCase()).match(/\.(jpeg|jpg|jpe|gif|png|apn|webp|avif|svg)/))return"image";if(e.match(/(youtube\.com|youtube-nocookie\.com)\/watch\?v=([a-zA-Z0-9\-_]+)/)||e.match(/youtu\.be\/([a-zA-Z0-9\-_]+)/)||e.match(/(youtube\.com|youtube-nocookie\.com)\/embed\/([a-zA-Z0-9\-_]+)/))return"video";if(e.match(/vimeo\.com\/([0-9]*)/))return"video";if(null!==e.match(/\.(mp4|ogg|webm|mov)/))return"video";if(null!==e.match(/\.(mp3|wav|wma|aac|ogg)/))return"audio";if(e.indexOf("#")>-1&&""!==t.split("#").pop().trim())return"inline";return e.indexOf("goajax=true")>-1?"ajax":"external"}},{key:"parseConfig",value:function(e,t){var i=this,n=l({descPosition:t.descPosition},this.defaults);if(L(e)&&!k(e)){O(e,"type")||(O(e,"content")&&e.content?e.type="inline":O(e,"href")&&(e.type=this.sourceType(e.href)));var s=l(n,e);return this.setSize(s,t),s}var r="",a=e.getAttribute("data-glightbox"),h=e.nodeName.toLowerCase();if("a"===h&&(r=e.href),"img"===h&&(r=e.src,n.alt=e.alt),n.href=r,o(n,(function(s,l){O(t,l)&&"width"!==l&&(n[l]=t[l]);var o=e.dataset[l];I(o)||(n[l]=i.sanitizeValue(o))})),n.content&&(n.type="inline"),!n.type&&r&&(n.type=this.sourceType(r)),I(a)){if(!n.title&&"a"==h){var d=e.title;I(d)||""===d||(n.title=d)}if(!n.title&&"img"==h){var c=e.alt;I(c)||""===c||(n.title=c)}}else{var u=[];o(n,(function(e,t){u.push(";\\s?"+t)})),u=u.join("\\s?:|"),""!==a.trim()&&o(n,(function(e,t){var s=a,l=new RegExp("s?"+t+"s?:s?(.*?)("+u+"s?:|$)"),o=s.match(l);if(o&&o.length&&o[1]){var r=o[1].trim().replace(/;\s*$/,"");n[t]=i.sanitizeValue(r)}}))}if(n.description&&"."===n.description.substring(0,1)){var g;try{g=document.querySelector(n.description).innerHTML}catch(e){if(!(e instanceof DOMException))throw e}g&&(n.description=g)}if(!n.description){var v=e.querySelector(".glightbox-desc");v&&(n.description=v.innerHTML)}return this.setSize(n,t,e),this.slideConfig=n,n}},{key:"setSize",value:function(e,t){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null,n="video"==e.type?this.checkSize(t.videosWidth):this.checkSize(t.width),s=this.checkSize(t.height);return e.width=O(e,"width")&&""!==e.width?this.checkSize(e.width):n,e.height=O(e,"height")&&""!==e.height?this.checkSize(e.height):s,i&&"image"==e.type&&(e._hasCustomWidth=!!i.dataset.width,e._hasCustomHeight=!!i.dataset.height),e}},{key:"checkSize",value:function(e){return M(e)?"".concat(e,"px"):e}},{key:"sanitizeValue",value:function(e){return"true"!==e&&"false"!==e?e:"true"===e}}]),e}(),U=function(){function e(i,n,s){t(this,e),this.element=i,this.instance=n,this.index=s}return n(e,[{key:"setContent",value:function(){var e=this,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null,i=arguments.length>1&&void 0!==arguments[1]&&arguments[1];if(c(t,"loaded"))return!1;var n=this.instance.settings,s=this.slideConfig,l=w();T(n.beforeSlideLoad)&&n.beforeSlideLoad({index:this.index,slide:t,player:!1});var o=s.type,r=s.descPosition,a=t.querySelector(".gslide-media"),d=t.querySelector(".gslide-title"),u=t.querySelector(".gslide-desc"),g=t.querySelector(".gdesc-inner"),v=i,f="gSlideTitle_"+this.index,p="gSlideDesc_"+this.index;if(T(n.afterSlideLoad)&&(v=function(){T(i)&&i(),n.afterSlideLoad({index:e.index,slide:t,player:e.instance.getSlidePlayerInstance(e.index)})}),""==s.title&&""==s.description?g&&g.parentNode.parentNode.removeChild(g.parentNode):(d&&""!==s.title?(d.id=f,d.innerHTML=s.title):d.parentNode.removeChild(d),u&&""!==s.description?(u.id=p,l&&n.moreLength>0?(s.smallDescription=this.slideShortDesc(s.description,n.moreLength,n.moreText),u.innerHTML=s.smallDescription,this.descriptionEvents(u,s)):u.innerHTML=s.description):u.parentNode.removeChild(u),h(a.parentNode,"desc-".concat(r)),h(g.parentNode,"description-".concat(r))),h(a,"gslide-".concat(o)),h(t,"loaded"),"video"!==o){if("external"!==o)return"inline"===o?(G.apply(this.instance,[t,s,this.index,v]),void(s.draggable&&new V({dragEl:t.querySelector(".gslide-inline"),toleranceX:n.dragToleranceX,toleranceY:n.dragToleranceY,slide:t,instance:this.instance}))):void("image"!==o?T(v)&&v():j(t,s,this.index,(function(){var i=t.querySelector("img");s.draggable&&new V({dragEl:i,toleranceX:n.dragToleranceX,toleranceY:n.dragToleranceY,slide:t,instance:e.instance}),s.zoomable&&i.naturalWidth>i.offsetWidth&&(h(i,"zoomable"),new H(i,t,(function(){e.instance.resize()}))),T(v)&&v()})));Z.apply(this,[t,s,this.index,v])}else F.apply(this.instance,[t,s,this.index,v])}},{key:"slideShortDesc",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:50,i=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=document.createElement("div");n.innerHTML=e;var s=n.innerText,l=i;if((e=s.trim()).length<=t)return e;var o=e.substr(0,t-1);return l?(n=null,o+'... '+i+""):o}},{key:"descriptionEvents",value:function(e,t){var i=this,n=e.querySelector(".desc-more");if(!n)return!1;a("click",{onElement:n,withCallback:function(e,n){e.preventDefault();var s=document.body,l=u(n,".gslide-desc");if(!l)return!1;l.innerHTML=t.description,h(s,"gdesc-open");var o=a("click",{onElement:[s,u(l,".gslide-description")],withCallback:function(e,n){"a"!==e.target.nodeName.toLowerCase()&&(d(s,"gdesc-open"),h(s,"gdesc-closed"),l.innerHTML=t.smallDescription,i.descriptionEvents(l,t),setTimeout((function(){d(s,"gdesc-closed")}),400),o.destroy())}})}})}},{key:"create",value:function(){return m(this.instance.settings.slideHTML)}},{key:"getConfig",value:function(){k(this.element)||this.element.hasOwnProperty("draggable")||(this.element.draggable=this.instance.settings.draggable);var e=new $(this.instance.settings.slideExtraAttributes);return this.slideConfig=e.parseConfig(this.element,this.instance.settings),this.slideConfig}}]),e}(),J=w(),K=null!==w()||void 0!==document.createTouch||"ontouchstart"in window||"onmsgesturechange"in window||navigator.msMaxTouchPoints,Q=document.getElementsByTagName("html")[0],ee={selector:".glightbox",elements:null,skin:"clean",theme:"clean",closeButton:!0,startAt:null,autoplayVideos:!0,autofocusVideos:!0,descPosition:"bottom",width:"900px",height:"506px",videosWidth:"960px",beforeSlideChange:null,afterSlideChange:null,beforeSlideLoad:null,afterSlideLoad:null,slideInserted:null,slideRemoved:null,slideExtraAttributes:null,onOpen:null,onClose:null,loop:!1,zoomable:!0,draggable:!0,dragAutoSnap:!1,dragToleranceX:40,dragToleranceY:65,preload:!0,oneSlidePerOpen:!1,touchNavigation:!0,touchFollowAxis:!0,keyboardNavigation:!0,closeOnOutsideClick:!0,plugins:!1,plyr:{css:"https://cdn.plyr.io/3.6.8/plyr.css",js:"https://cdn.plyr.io/3.6.8/plyr.js",config:{ratio:"16:9",fullscreen:{enabled:!0,iosNative:!0},youtube:{noCookie:!0,rel:0,showinfo:0,iv_load_policy:3},vimeo:{byline:!1,portrait:!1,title:!1,transparent:!1}}},openEffect:"zoom",closeEffect:"zoom",slideEffect:"slide",moreText:"See more",moreLength:60,cssEfects:{fade:{in:"fadeIn",out:"fadeOut"},zoom:{in:"zoomIn",out:"zoomOut"},slide:{in:"slideInRight",out:"slideOutLeft"},slideBack:{in:"slideInLeft",out:"slideOutRight"},none:{in:"none",out:"none"}},svg:{close:'',next:'',prev:''},slideHTML:'',lightboxHTML:'\n \n \n
'},te=function(){function e(){var i=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};t(this,e),this.customOptions=i,this.settings=l(ee,i),this.effectsClasses=this.getAnimationClasses(),this.videoPlayers={},this.apiEvents=[],this.fullElementsList=!1}return n(e,[{key:"init",value:function(){var e=this,t=this.getSelector();t&&(this.baseEvents=a("click",{onElement:t,withCallback:function(t,i){t.preventDefault(),e.open(i)}})),this.elements=this.getElements()}},{key:"open",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null,t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;if(0==this.elements.length)return!1;this.activeSlide=null,this.prevActiveSlideIndex=null,this.prevActiveSlide=null;var i=M(t)?t:this.settings.startAt;if(k(e)){var n=e.getAttribute("data-gallery");n&&(this.fullElementsList=this.elements,this.elements=this.getGalleryElements(this.elements,n)),I(i)&&(i=this.getElementIndex(e))<0&&(i=0)}M(i)||(i=0),this.build(),g(this.overlay,"none"==this.settings.openEffect?"none":this.settings.cssEfects.fade.in);var s=document.body,l=window.innerWidth-document.documentElement.clientWidth;if(l>0){var o=document.createElement("style");o.type="text/css",o.className="gcss-styles",o.innerText=".gscrollbar-fixer {margin-right: ".concat(l,"px}"),document.head.appendChild(o),h(s,"gscrollbar-fixer")}h(s,"glightbox-open"),h(Q,"glightbox-open"),J&&(h(document.body,"glightbox-mobile"),this.settings.slideEffect="slide"),this.showSlide(i,!0),1==this.elements.length?(h(this.prevButton,"glightbox-button-hidden"),h(this.nextButton,"glightbox-button-hidden")):(d(this.prevButton,"glightbox-button-hidden"),d(this.nextButton,"glightbox-button-hidden")),this.lightboxOpen=!0,this.trigger("open"),T(this.settings.onOpen)&&this.settings.onOpen(),K&&this.settings.touchNavigation&&B(this),this.settings.keyboardNavigation&&X(this)}},{key:"openAt",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:0;this.open(null,e)}},{key:"showSlide",value:function(){var e=this,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:0,i=arguments.length>1&&void 0!==arguments[1]&&arguments[1];f(this.loader),this.index=parseInt(t);var n=this.slidesContainer.querySelector(".current");n&&d(n,"current"),this.slideAnimateOut();var s=this.slidesContainer.querySelectorAll(".gslide")[t];if(c(s,"loaded"))this.slideAnimateIn(s,i),p(this.loader);else{f(this.loader);var l=this.elements[t],o={index:this.index,slide:s,slideNode:s,slideConfig:l.slideConfig,slideIndex:this.index,trigger:l.node,player:null};this.trigger("slide_before_load",o),l.instance.setContent(s,(function(){p(e.loader),e.resize(),e.slideAnimateIn(s,i),e.trigger("slide_after_load",o)}))}this.slideDescription=s.querySelector(".gslide-description"),this.slideDescriptionContained=this.slideDescription&&c(this.slideDescription.parentNode,"gslide-media"),this.settings.preload&&(this.preloadSlide(t+1),this.preloadSlide(t-1)),this.updateNavigationClasses(),this.activeSlide=s}},{key:"preloadSlide",value:function(e){var t=this;if(e<0||e>this.elements.length-1)return!1;if(I(this.elements[e]))return!1;var i=this.slidesContainer.querySelectorAll(".gslide")[e];if(c(i,"loaded"))return!1;var n=this.elements[e],s=n.type,l={index:e,slide:i,slideNode:i,slideConfig:n.slideConfig,slideIndex:e,trigger:n.node,player:null};this.trigger("slide_before_load",l),"video"==s||"external"==s?setTimeout((function(){n.instance.setContent(i,(function(){t.trigger("slide_after_load",l)}))}),200):n.instance.setContent(i,(function(){t.trigger("slide_after_load",l)}))}},{key:"prevSlide",value:function(){this.goToSlide(this.index-1)}},{key:"nextSlide",value:function(){this.goToSlide(this.index+1)}},{key:"goToSlide",value:function(){var e=arguments.length>0&&void 0!==arguments[0]&&arguments[0];if(this.prevActiveSlide=this.activeSlide,this.prevActiveSlideIndex=this.index,!this.loop()&&(e<0||e>this.elements.length-1))return!1;e<0?e=this.elements.length-1:e>=this.elements.length&&(e=0),this.showSlide(e)}},{key:"insertSlide",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{},t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:-1;t<0&&(t=this.elements.length);var i=new U(e,this,t),n=i.getConfig(),s=l({},n),o=i.create(),r=this.elements.length-1;s.index=t,s.node=!1,s.instance=i,s.slideConfig=n,this.elements.splice(t,0,s);var a=null,h=null;if(this.slidesContainer){if(t>r)this.slidesContainer.appendChild(o);else{var d=this.slidesContainer.querySelectorAll(".gslide")[t];this.slidesContainer.insertBefore(o,d)}(this.settings.preload&&0==this.index&&0==t||this.index-1==t||this.index+1==t)&&this.preloadSlide(t),0==this.index&&0==t&&(this.index=1),this.updateNavigationClasses(),a=this.slidesContainer.querySelectorAll(".gslide")[t],h=this.getSlidePlayerInstance(t),s.slideNode=a}this.trigger("slide_inserted",{index:t,slide:a,slideNode:a,slideConfig:n,slideIndex:t,trigger:null,player:h}),T(this.settings.slideInserted)&&this.settings.slideInserted({index:t,slide:a,player:h})}},{key:"removeSlide",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:-1;if(e<0||e>this.elements.length-1)return!1;var t=this.slidesContainer&&this.slidesContainer.querySelectorAll(".gslide")[e];t&&(this.getActiveSlideIndex()==e&&(e==this.elements.length-1?this.prevSlide():this.nextSlide()),t.parentNode.removeChild(t)),this.elements.splice(e,1),this.trigger("slide_removed",e),T(this.settings.slideRemoved)&&this.settings.slideRemoved(e)}},{key:"slideAnimateIn",value:function(e,t){var i=this,n=e.querySelector(".gslide-media"),s=e.querySelector(".gslide-description"),l={index:this.prevActiveSlideIndex,slide:this.prevActiveSlide,slideNode:this.prevActiveSlide,slideIndex:this.prevActiveSlide,slideConfig:I(this.prevActiveSlideIndex)?null:this.elements[this.prevActiveSlideIndex].slideConfig,trigger:I(this.prevActiveSlideIndex)?null:this.elements[this.prevActiveSlideIndex].node,player:this.getSlidePlayerInstance(this.prevActiveSlideIndex)},o={index:this.index,slide:this.activeSlide,slideNode:this.activeSlide,slideConfig:this.elements[this.index].slideConfig,slideIndex:this.index,trigger:this.elements[this.index].node,player:this.getSlidePlayerInstance(this.index)};if(n.offsetWidth>0&&s&&(p(s),s.style.display=""),d(e,this.effectsClasses),t)g(e,this.settings.cssEfects[this.settings.openEffect].in,(function(){i.settings.autoplayVideos&&i.slidePlayerPlay(e),i.trigger("slide_changed",{prev:l,current:o}),T(i.settings.afterSlideChange)&&i.settings.afterSlideChange.apply(i,[l,o])}));else{var r=this.settings.slideEffect,a="none"!==r?this.settings.cssEfects[r].in:r;this.prevActiveSlideIndex>this.index&&"slide"==this.settings.slideEffect&&(a=this.settings.cssEfects.slideBack.in),g(e,a,(function(){i.settings.autoplayVideos&&i.slidePlayerPlay(e),i.trigger("slide_changed",{prev:l,current:o}),T(i.settings.afterSlideChange)&&i.settings.afterSlideChange.apply(i,[l,o])}))}setTimeout((function(){i.resize(e)}),100),h(e,"current")}},{key:"slideAnimateOut",value:function(){if(!this.prevActiveSlide)return!1;var e=this.prevActiveSlide;d(e,this.effectsClasses),h(e,"prev");var t=this.settings.slideEffect,i="none"!==t?this.settings.cssEfects[t].out:t;this.slidePlayerPause(e),this.trigger("slide_before_change",{prev:{index:this.prevActiveSlideIndex,slide:this.prevActiveSlide,slideNode:this.prevActiveSlide,slideIndex:this.prevActiveSlideIndex,slideConfig:I(this.prevActiveSlideIndex)?null:this.elements[this.prevActiveSlideIndex].slideConfig,trigger:I(this.prevActiveSlideIndex)?null:this.elements[this.prevActiveSlideIndex].node,player:this.getSlidePlayerInstance(this.prevActiveSlideIndex)},current:{index:this.index,slide:this.activeSlide,slideNode:this.activeSlide,slideIndex:this.index,slideConfig:this.elements[this.index].slideConfig,trigger:this.elements[this.index].node,player:this.getSlidePlayerInstance(this.index)}}),T(this.settings.beforeSlideChange)&&this.settings.beforeSlideChange.apply(this,[{index:this.prevActiveSlideIndex,slide:this.prevActiveSlide,player:this.getSlidePlayerInstance(this.prevActiveSlideIndex)},{index:this.index,slide:this.activeSlide,player:this.getSlidePlayerInstance(this.index)}]),this.prevActiveSlideIndex>this.index&&"slide"==this.settings.slideEffect&&(i=this.settings.cssEfects.slideBack.out),g(e,i,(function(){var t=e.querySelector(".ginner-container"),i=e.querySelector(".gslide-media"),n=e.querySelector(".gslide-description");t.style.transform="",i.style.transform="",d(i,"greset"),i.style.opacity="",n&&(n.style.opacity=""),d(e,"prev")}))}},{key:"getAllPlayers",value:function(){return this.videoPlayers}},{key:"getSlidePlayerInstance",value:function(e){var t="gvideo"+e,i=this.getAllPlayers();return!(!O(i,t)||!i[t])&&i[t]}},{key:"stopSlideVideo",value:function(e){if(k(e)){var t=e.querySelector(".gvideo-wrapper");t&&(e=t.getAttribute("data-index"))}console.log("stopSlideVideo is deprecated, use slidePlayerPause");var i=this.getSlidePlayerInstance(e);i&&i.playing&&i.pause()}},{key:"slidePlayerPause",value:function(e){if(k(e)){var t=e.querySelector(".gvideo-wrapper");t&&(e=t.getAttribute("data-index"))}var i=this.getSlidePlayerInstance(e);i&&i.playing&&i.pause()}},{key:"playSlideVideo",value:function(e){if(k(e)){var t=e.querySelector(".gvideo-wrapper");t&&(e=t.getAttribute("data-index"))}console.log("playSlideVideo is deprecated, use slidePlayerPlay");var i=this.getSlidePlayerInstance(e);i&&!i.playing&&i.play()}},{key:"slidePlayerPlay",value:function(e){if(k(e)){var t=e.querySelector(".gvideo-wrapper");t&&(e=t.getAttribute("data-index"))}var i=this.getSlidePlayerInstance(e);i&&!i.playing&&(i.play(),this.settings.autofocusVideos&&i.elements.container.focus())}},{key:"setElements",value:function(e){var t=this;this.settings.elements=!1;var i=[];e&&e.length&&o(e,(function(e,n){var s=new U(e,t,n),o=s.getConfig(),r=l({},o);r.slideConfig=o,r.instance=s,r.index=n,i.push(r)})),this.elements=i,this.lightboxOpen&&(this.slidesContainer.innerHTML="",this.elements.length&&(o(this.elements,(function(){var e=m(t.settings.slideHTML);t.slidesContainer.appendChild(e)})),this.showSlide(0,!0)))}},{key:"getElementIndex",value:function(e){var t=!1;return o(this.elements,(function(i,n){if(O(i,"node")&&i.node==e)return t=n,!0})),t}},{key:"getElements",value:function(){var e=this,t=[];this.elements=this.elements?this.elements:[],!I(this.settings.elements)&&E(this.settings.elements)&&this.settings.elements.length&&o(this.settings.elements,(function(i,n){var s=new U(i,e,n),o=s.getConfig(),r=l({},o);r.node=!1,r.index=n,r.instance=s,r.slideConfig=o,t.push(r)}));var i=!1;return this.getSelector()&&(i=document.querySelectorAll(this.getSelector())),i?(o(i,(function(i,n){var s=new U(i,e,n),o=s.getConfig(),r=l({},o);r.node=i,r.index=n,r.instance=s,r.slideConfig=o,r.gallery=i.getAttribute("data-gallery"),t.push(r)})),t):t}},{key:"getGalleryElements",value:function(e,t){return e.filter((function(e){return e.gallery==t}))}},{key:"getSelector",value:function(){return!this.settings.elements&&(this.settings.selector&&"data-"==this.settings.selector.substring(0,5)?"*[".concat(this.settings.selector,"]"):this.settings.selector)}},{key:"getActiveSlide",value:function(){return this.slidesContainer.querySelectorAll(".gslide")[this.index]}},{key:"getActiveSlideIndex",value:function(){return this.index}},{key:"getAnimationClasses",value:function(){var e=[];for(var t in this.settings.cssEfects)if(this.settings.cssEfects.hasOwnProperty(t)){var i=this.settings.cssEfects[t];e.push("g".concat(i.in)),e.push("g".concat(i.out))}return e.join(" ")}},{key:"build",value:function(){var e=this;if(this.built)return!1;var t=document.body.childNodes,i=[];o(t,(function(e){e.parentNode==document.body&&"#"!==e.nodeName.charAt(0)&&e.hasAttribute&&!e.hasAttribute("aria-hidden")&&(i.push(e),e.setAttribute("aria-hidden","true"))}));var n=O(this.settings.svg,"next")?this.settings.svg.next:"",s=O(this.settings.svg,"prev")?this.settings.svg.prev:"",l=O(this.settings.svg,"close")?this.settings.svg.close:"",r=this.settings.lightboxHTML;r=m(r=(r=(r=r.replace(/{nextSVG}/g,n)).replace(/{prevSVG}/g,s)).replace(/{closeSVG}/g,l)),document.body.appendChild(r);var d=document.getElementById("glightbox-body");this.modal=d;var g=d.querySelector(".gclose");this.prevButton=d.querySelector(".gprev"),this.nextButton=d.querySelector(".gnext"),this.overlay=d.querySelector(".goverlay"),this.loader=d.querySelector(".gloader"),this.slidesContainer=document.getElementById("glightbox-slider"),this.bodyHiddenChildElms=i,this.events={},h(this.modal,"glightbox-"+this.settings.skin),this.settings.closeButton&&g&&(this.events.close=a("click",{onElement:g,withCallback:function(t,i){t.preventDefault(),e.close()}})),g&&!this.settings.closeButton&&g.parentNode.removeChild(g),this.nextButton&&(this.events.next=a("click",{onElement:this.nextButton,withCallback:function(t,i){t.preventDefault(),e.nextSlide()}})),this.prevButton&&(this.events.prev=a("click",{onElement:this.prevButton,withCallback:function(t,i){t.preventDefault(),e.prevSlide()}})),this.settings.closeOnOutsideClick&&(this.events.outClose=a("click",{onElement:d,withCallback:function(t,i){e.preventOutsideClick||c(document.body,"glightbox-mobile")||u(t.target,".ginner-container")||u(t.target,".gbtn")||c(t.target,"gnext")||c(t.target,"gprev")||e.close()}})),o(this.elements,(function(t,i){e.slidesContainer.appendChild(t.instance.create()),t.slideNode=e.slidesContainer.querySelectorAll(".gslide")[i]})),K&&h(document.body,"glightbox-touch"),this.events.resize=a("resize",{onElement:window,withCallback:function(){e.resize()}}),this.built=!0}},{key:"resize",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null;if((e=e||this.activeSlide)&&!c(e,"zoomed")){var t=y(),i=e.querySelector(".gvideo-wrapper"),n=e.querySelector(".gslide-image"),s=this.slideDescription,l=t.width,o=t.height;if(l<=768?h(document.body,"glightbox-mobile"):d(document.body,"glightbox-mobile"),i||n){var r=!1;if(s&&(c(s,"description-bottom")||c(s,"description-top"))&&!c(s,"gabsolute")&&(r=!0),n)if(l<=768)n.querySelector("img");else if(r){var a=s.offsetHeight,u=n.querySelector("img");u.setAttribute("style","max-height: calc(100vh - ".concat(a,"px)")),s.setAttribute("style","max-width: ".concat(u.offsetWidth,"px;"))}if(i){var g=O(this.settings.plyr.config,"ratio")?this.settings.plyr.config.ratio:"";if(!g){var v=i.clientWidth,f=i.clientHeight,p=v/f;g="".concat(v/p,":").concat(f/p)}var m=g.split(":"),x=this.settings.videosWidth,b=this.settings.videosWidth,S=(b=M(x)||-1!==x.indexOf("px")?parseInt(x):-1!==x.indexOf("vw")?l*parseInt(x)/100:-1!==x.indexOf("vh")?o*parseInt(x)/100:-1!==x.indexOf("%")?l*parseInt(x)/100:parseInt(i.clientWidth))/(parseInt(m[0])/parseInt(m[1]));if(S=Math.floor(S),r&&(o-=s.offsetHeight),b>l||S>o||o\n \n \n \n \n
\n
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ GRASS GIS Addon
+Installation instructions
+-
+
- Install GRASS GIS: https://grass.osgeo.org/download/ +
- Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases +
- Open GRASS Addon located in
bin/grass/r.smoderp2d/r.smoderp2d.py
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/img/AG_model_face.png b/img/AG_model_face.png
new file mode 100644
index 0000000..5ad9276
Binary files /dev/null and b/img/AG_model_face.png differ
diff --git a/img/dem_byk.png b/img/dem_byk.png
new file mode 100644
index 0000000..4fb71f9
Binary files /dev/null and b/img/dem_byk.png differ
diff --git a/img/favicon.ico b/img/favicon.ico
new file mode 100644
index 0000000..e85006a
Binary files /dev/null and b/img/favicon.ico differ
diff --git a/img/land_cover_byk.png b/img/land_cover_byk.png
new file mode 100644
index 0000000..b3502b0
Binary files /dev/null and b/img/land_cover_byk.png differ
diff --git a/img/qgis_plugin_advanced.png b/img/qgis_plugin_advanced.png
new file mode 100644
index 0000000..2de8ce4
Binary files /dev/null and b/img/qgis_plugin_advanced.png differ
diff --git a/img/qgis_plugin_comp_options.png b/img/qgis_plugin_comp_options.png
new file mode 100644
index 0000000..8d4f00e
Binary files /dev/null and b/img/qgis_plugin_comp_options.png differ
diff --git a/img/qgis_plugin_history.png b/img/qgis_plugin_history.png
new file mode 100644
index 0000000..e7d5ea9
Binary files /dev/null and b/img/qgis_plugin_history.png differ
diff --git a/img/qgis_plugin_icon.png b/img/qgis_plugin_icon.png
new file mode 100644
index 0000000..f222927
Binary files /dev/null and b/img/qgis_plugin_icon.png differ
diff --git a/img/qgis_plugin_install.png b/img/qgis_plugin_install.png
new file mode 100644
index 0000000..f6c67b4
Binary files /dev/null and b/img/qgis_plugin_install.png differ
diff --git a/img/qgis_plugin_model_parameters.png b/img/qgis_plugin_model_parameters.png
new file mode 100644
index 0000000..7a50986
Binary files /dev/null and b/img/qgis_plugin_model_parameters.png differ
diff --git a/img/qgis_plugin_spatial_data.png b/img/qgis_plugin_spatial_data.png
new file mode 100644
index 0000000..31aba96
Binary files /dev/null and b/img/qgis_plugin_spatial_data.png differ
diff --git a/img/soil_map.png b/img/soil_map.png
new file mode 100644
index 0000000..974bcbb
Binary files /dev/null and b/img/soil_map.png differ
diff --git a/img/workflow.drawio b/img/workflow.drawio
new file mode 100644
index 0000000..d92d729
--- /dev/null
+++ b/img/workflow.drawio
@@ -0,0 +1,109 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ SMODERP2D
+Distributed event-based model for surface a sheet runoff and for design of erosion control measure
+Welcome to the user guide for the SMODERP2D model. The aim of this text is +to provide basic information to users on how to run the SMODERP2D model.
+ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @
+ @ @ @ @ @ @ @ @ @ @ @ @ @ @
+ @ @ @ @ @ @ @ @ @ @ @ @ @
+ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @
+ @ @ @ @ @ @ @ @ @ @ @
+ @ @ @ @ @ @ @ @ @ @ @
+ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @
+ \ \ / / / \ \ / \ / / / @ @ @ @ @ @
+ \ _\/ /_/ \ \/ \/ /_____/ @ @ @ @
+ \__/ \ / _\___/ @ @ @
+ \____ \/ / @ @ @
+ \_____/______/ @ @ @
+ \ @ @ @
+ \___________________ @ @ @ @ @ @ @
+The SMODERP2D model is designed to calculate hydrological and erosion processes on +individual plots or small catchments. The outputs of the model are primarily +used to determine runoff conditions in a catchment and obtain parameters for +runoff and erosion control measures on agricultural land. Additionally, +the model can assist in designing more complex systems, including sediment +retention ponds, dry basins, or polders. Its use complies with current +methods, technical standards, and recommended practices.
+The SMODERP2D model is open source project developed by the Department +of Landscape Water Conservation, Faculty of Civil Engineering, Czech +Technical University in Prague. Source code is licenced under GNU GPL +and available from GitHub repository https://github.com/storm-fsv-cvut/smoderp2d.
+About model
+Users
+Model definition and simulated processes
+ +
+
+
+
+
+ Next »
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/input_data.html b/input_data.html
new file mode 100644
index 0000000..4070bd0
--- /dev/null
+++ b/input_data.html
@@ -0,0 +1,295 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Input data
+Input data are divided to two groups a) for surface runoff processes and b) stream flow
+Input data - surface flow
+The inputes to the model incorporates information about the area's topography, soil types and +land use spatial distribution, rainfall for surface ruonoff processes, where applicable, the geometry of +hydrographic network for stream ruonff.
+Inputes are describe in goups (see the picture). Left are for QIGS, right for ArcGIS platform.
+
.
+Data types of inputes data are descrime in table ** link to the tabel**
Digital elevation model (Compulsory)
+A digital elevation model (DEM) or digital terrain model (DTM) raster +represents the morphology of the modelled area. Each cell in the raster contains +information about the land elevation.
+The model numerical scheme spatial discrimination is inherited from the DEM +layer cell size. The cell size can vary depending on the size of the modelled +area. For the SMODERP2D model the stabile computation minimum cell size is recommended 2 meters, with an +optimum of 5 meters. Cell size with total area are crucial parameters for computing time.
+
Soil characteristics map (Compulsory)
+Vector (polygon) layer with polygons indicating the spatial distribution of soil +types.
+The figure shows a example of soil map layer. The attribute table of the layer +must include field with soil type identifier. These identifiers correspond to +unique soil and land use characteristics, which are stored in a separate table (see below). +Physical meanings of these parameters and their implementation in the model are +in detail described in the reference manual.
+For instance, in Czechia soil type data from agricultural land can be obtain +via https://rain.fsv.cvut.cz/pudy.
+
Land use / Land cover (Compulsory)
+Similar to soils in the previous section, the attribute table of the land use +**vector layer (polygon) ** requires supplementation with an identifier field for land use. +These identifiers correspond to +unique soil and land use characteristics, defined in a separate table (see below).
+Physical meanings of the land used parameters and their implementation in the +model are in detail described in the reference manual.
+
+For instance, in Czechia soil type data from agricultural land can be obtain
+from combination of ZABAGED and LPIS data.
Soil and landuse parameters table (Compulsory)
+Another compulsory input is a table containing the values of individual soil +type and land cover parameters.
+This table is referenced by combinations of soil type and land use type
+identifiers defined for each polygon in the attribute tables of the vector
+inputs. In the example below, the first column contains parameters for the
+combination of soil type CA and land cover ZP.
The table may be inserted into the model as a text file (.csv).
+The meanings of the individual parameters are described in reference manual.
+| soilveg | +k | +s | +nrill | +pi | +ppl | +ret | +b | +nsheet | +y | +tau | +v | +
|---|---|---|---|---|---|---|---|---|---|---|---|
| CAZP | +1.26e-07 | +0.000125 | +0.0035 | +0 | +0 | +0 | +1.5847 | +0.0073 | +0.488872 | +100 | +0.28 | +
Ranfall data
+The next input is a file containing rainfall data. The rainfall is entered as a text file with two columns. The left column is the time interval in minutes, the right column is the cumulative total for the time interval in millimetres. Real measured or design precipitation data can be used in model. +For instance, in Czechia design precipitation can be obtain via web map services https://rain.fsv.cvut.cz.
+Input data - stream flow
+Data for the watercoures are also divided to topology part and data table with unique characteristics of segments
+Water course network (Optional)
+Vector (polyline) layer with polylines indicating the thopology of watercourses and/or temporal ditches technical conservation measure). +The figure shows a example of water courses data. The attribute table of the layer +must include field with stream type. The watercourse network must be hydrologically correct. Individual end points of the watercourse network must have a different elevation taken from the DMR and at the same time bifurcation of the watercourse cannot be allowed. +These identifiers correspond to +unique stream characteristics, which are stored in a separate table (see below). +Physical meanings of these parameters and their implementation in the model are +in detail described in the reference manual.
+For instance, in Czechia stream shape data can be obtain from ZABAGED data.
+
Water course table (Optional)
+This table is referenced to unique stream types defined for each polygon in the attribute tables of the watercourse network
+inputs. In the example below, the first column contains parameters ** channel_ID ** for unioque stream part named.
+The table may be inserted into the model as a text file (.csv).
+The meanings of the individual parameters are described in reference manual.
| | | +
|---|
| | | +
| 11.12.10.0300default 1shape0 00.20.00.0350 2rectangle1 10.22.00.0350 3trapezoid1 20.02.00.0300 4triangle1 30.70.00.0300b.surface5parabola1 00.20.00.0350 6obdelnik1 10.22.00.0350 7lichobeznik1 20.02.00.0300 8trojuhelnik1 | +
Input data - other inputes and model settings
+Points of interest (Optional)
+Vector (point) layer with point for detail outputs as hydrographs (describe in outpust). In this points are indicating the thopology of watercourses and/or temporal ditches technical conservation measure).
+The monitored output data are continuously stored at these points. In the case of a point located outside the watercourse, surface runoff data are recorded. If the point is inserted into a watercourse, data are recorded for the relevant watercourse section.
+ +
+
+
+
+ « Previous
+
+
+ Next »
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/js/html5shiv.min.js b/js/html5shiv.min.js
new file mode 100644
index 0000000..1a01c94
--- /dev/null
+++ b/js/html5shiv.min.js
@@ -0,0 +1,4 @@
+/**
+* @preserve HTML5 Shiv 3.7.3 | @afarkas @jdalton @jon_neal @rem | MIT/GPL2 Licensed
+*/
+!function(a,b){function c(a,b){var c=a.createElement("p"),d=a.getElementsByTagName("head")[0]||a.documentElement;return c.innerHTML="x",d.insertBefore(c.lastChild,d.firstChild)}function d(){var a=t.elements;return"string"==typeof a?a.split(" "):a}function e(a,b){var c=t.elements;"string"!=typeof c&&(c=c.join(" ")),"string"!=typeof a&&(a=a.join(" ")),t.elements=c+" "+a,j(b)}function f(a){var b=s[a[q]];return b||(b={},r++,a[q]=r,s[r]=b),b}function g(a,c,d){if(c||(c=b),l)return c.createElement(a);d||(d=f(c));var e;return e=d.cache[a]?d.cache[a].cloneNode():p.test(a)?(d.cache[a]=d.createElem(a)).cloneNode():d.createElem(a),!e.canHaveChildren||o.test(a)||e.tagUrn?e:d.frag.appendChild(e)}function h(a,c){if(a||(a=b),l)return a.createDocumentFragment();c=c||f(a);for(var e=c.frag.cloneNode(),g=0,h=d(),i=h.length;i>g;g++)e.createElement(h[g]);return e}function i(a,b){b.cache||(b.cache={},b.createElem=a.createElement,b.createFrag=a.createDocumentFragment,b.frag=b.createFrag()),a.createElement=function(c){return t.shivMethods?g(c,a,b):b.createElem(c)},a.createDocumentFragment=Function("h,f","return function(){var n=f.cloneNode(),c=n.createElement;h.shivMethods&&("+d().join().replace(/[\w\-:]+/g,function(a){return b.createElem(a),b.frag.createElement(a),'c("'+a+'")'})+");return n}")(t,b.frag)}function j(a){a||(a=b);var d=f(a);return!t.shivCSS||k||d.hasCSS||(d.hasCSS=!!c(a,"article,aside,dialog,figcaption,figure,footer,header,hgroup,main,nav,section{display:block}mark{background:#FF0;color:#000}template{display:none}")),l||i(a,d),a}var k,l,m="3.7.3",n=a.html5||{},o=/^<|^(?:button|map|select|textarea|object|iframe|option|optgroup)$/i,p=/^(?:a|b|code|div|fieldset|h1|h2|h3|h4|h5|h6|i|label|li|ol|p|q|span|strong|style|table|tbody|td|th|tr|ul)$/i,q="_html5shiv",r=0,s={};!function(){try{var a=b.createElement("a");a.innerHTML="
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Model settings
+Maximum time step
+-
+
- initial time step Δt is the value in seconds. The input parameter is the maximum time step. The time step Δt is adjusted during the calculation according to the numerical stability condition to maintain numerical stability. The length of the time step depends on the surface runoff velocity and the spatial step size (DMT cell size). The maximum time step depends on the desired detail of the output data, especially during a precipitation episode when flow velocities are already lower and when the stabiliti criterion would allow too large a time step. The implementation of the numerical stability are described in reference manual. +
Total runnig time
+Output directory
+D8/MFDA
+ + +
+
+
+
+ « Previous
+
+
+ Next »
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/nic.html b/nic.html
new file mode 100644
index 0000000..dcec6e0
--- /dev/null
+++ b/nic.html
@@ -0,0 +1,139 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/output.html b/output.html
new file mode 100644
index 0000000..7870742
--- /dev/null
+++ b/output.html
@@ -0,0 +1,175 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ « Previous
+
+
+ Next »
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/providers.html b/providers.html
new file mode 100644
index 0000000..57b2ff6
--- /dev/null
+++ b/providers.html
@@ -0,0 +1,172 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ GIS providers and install
+SMODERP2D model relies on a GIS software were the input and output +data can be acquired, modified and visualized. Currently, SMODERP2D +supports three GIS solutions:
+ +Installation instructions
+See specific instructions for +QGIS, GRASS +GIS and ArcGIS +Pro for details
+In case you will run SMODERP2D without the above mentioned GIS +solutions, the recommended installation procedure is based on PyPI: https://pypi.org/project/smoderp2d/
+pip install smoderp2d
+
+
+
+
+ « Previous
+
+
+ Next »
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/qgis.html b/qgis.html
new file mode 100644
index 0000000..91fcc92
--- /dev/null
+++ b/qgis.html
@@ -0,0 +1,157 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ QGIS Plugin
+Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus +nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum +convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, +commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex +eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi +tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit +amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui +lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. +Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, +felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi +auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus +imperdiet purus quis scelerisque.
+Installation instructions
+-
+
- Install QGIS: https://www.qgis.org/en/site/forusers/download.html +
- Install SMODERP2D plugin from QGIS plugin repository +
Open the plugin from the menu Plugins ➤ SMODERP2D or from the
+toolbar 
.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/recom.html b/recom.html
new file mode 100644
index 0000000..56796cf
--- /dev/null
+++ b/recom.html
@@ -0,0 +1,184 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Providers
+QGIS Plugin
+Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus +nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum +convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, +commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex +eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi +tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit +amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui +lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. +Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, +felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi +auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus +imperdiet purus quis scelerisque.
+Installation instructions
+-
+
- Install QGIS: https://www.qgis.org/en/site/forusers/download.html +
- Install SMODERP2D plugin from QGIS plugin repository +
Open the plugin from the menu Plugins ➤ SMODERP2D or from the
+toolbar .
GRASS GIS Addon
+Installation instructions
+-
+
- Install GRASS GIS: https://grass.osgeo.org/download/ +
- Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases +
- Open GRASS Addon located in
bin/grass/r.smoderp2d/r.smoderp2d.py
+
ArcGIS Pro Toolbox
+Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus +nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum +convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, +commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex +eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi +tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit +amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui +lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. +Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, +felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi +auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus +imperdiet purus quis scelerisque.
+Installation instructions
+-
+
- Download ArcGIS Pro: https://pro.arcgis.com/en/pro-app/latest/get-started/download-arcgis-pro.htm +
- Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases +
- Open ArcGIS Toolbox located in
bin\arcgis\SMODERP2D.pyt
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/reference_manual.html b/reference_manual.html
new file mode 100644
index 0000000..124be62
--- /dev/null
+++ b/reference_manual.html
@@ -0,0 +1,145 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Reference manual
+will be as soon as possible, preprint version on https://github.com/storm-fsv-cvut/smoderp2d-manual.
+ +
+
+
+
+ « Previous
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/requirements.html b/requirements.html
new file mode 100644
index 0000000..d9bd201
--- /dev/null
+++ b/requirements.html
@@ -0,0 +1,154 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ « Previous
+
+
+ Next »
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/search.html b/search.html
new file mode 100644
index 0000000..a7bc70e
--- /dev/null
+++ b/search.html
@@ -0,0 +1,136 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Search Results
+ + + +
+ Searching...
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/search/lunr.js b/search/lunr.js
new file mode 100644
index 0000000..aca0a16
--- /dev/null
+++ b/search/lunr.js
@@ -0,0 +1,3475 @@
+/**
+ * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.9
+ * Copyright (C) 2020 Oliver Nightingale
+ * @license MIT
+ */
+
+;(function(){
+
+/**
+ * A convenience function for configuring and constructing
+ * a new lunr Index.
+ *
+ * A lunr.Builder instance is created and the pipeline setup
+ * with a trimmer, stop word filter and stemmer.
+ *
+ * This builder object is yielded to the configuration function
+ * that is passed as a parameter, allowing the list of fields
+ * and other builder parameters to be customised.
+ *
+ * All documents _must_ be added within the passed config function.
+ *
+ * @example
+ * var idx = lunr(function () {
+ * this.field('title')
+ * this.field('body')
+ * this.ref('id')
+ *
+ * documents.forEach(function (doc) {
+ * this.add(doc)
+ * }, this)
+ * })
+ *
+ * @see {@link lunr.Builder}
+ * @see {@link lunr.Pipeline}
+ * @see {@link lunr.trimmer}
+ * @see {@link lunr.stopWordFilter}
+ * @see {@link lunr.stemmer}
+ * @namespace {function} lunr
+ */
+var lunr = function (config) {
+ var builder = new lunr.Builder
+
+ builder.pipeline.add(
+ lunr.trimmer,
+ lunr.stopWordFilter,
+ lunr.stemmer
+ )
+
+ builder.searchPipeline.add(
+ lunr.stemmer
+ )
+
+ config.call(builder, builder)
+ return builder.build()
+}
+
+lunr.version = "2.3.9"
+/*!
+ * lunr.utils
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * A namespace containing utils for the rest of the lunr library
+ * @namespace lunr.utils
+ */
+lunr.utils = {}
+
+/**
+ * Print a warning message to the console.
+ *
+ * @param {String} message The message to be printed.
+ * @memberOf lunr.utils
+ * @function
+ */
+lunr.utils.warn = (function (global) {
+ /* eslint-disable no-console */
+ return function (message) {
+ if (global.console && console.warn) {
+ console.warn(message)
+ }
+ }
+ /* eslint-enable no-console */
+})(this)
+
+/**
+ * Convert an object to a string.
+ *
+ * In the case of `null` and `undefined` the function returns
+ * the empty string, in all other cases the result of calling
+ * `toString` on the passed object is returned.
+ *
+ * @param {Any} obj The object to convert to a string.
+ * @return {String} string representation of the passed object.
+ * @memberOf lunr.utils
+ */
+lunr.utils.asString = function (obj) {
+ if (obj === void 0 || obj === null) {
+ return ""
+ } else {
+ return obj.toString()
+ }
+}
+
+/**
+ * Clones an object.
+ *
+ * Will create a copy of an existing object such that any mutations
+ * on the copy cannot affect the original.
+ *
+ * Only shallow objects are supported, passing a nested object to this
+ * function will cause a TypeError.
+ *
+ * Objects with primitives, and arrays of primitives are supported.
+ *
+ * @param {Object} obj The object to clone.
+ * @return {Object} a clone of the passed object.
+ * @throws {TypeError} when a nested object is passed.
+ * @memberOf Utils
+ */
+lunr.utils.clone = function (obj) {
+ if (obj === null || obj === undefined) {
+ return obj
+ }
+
+ var clone = Object.create(null),
+ keys = Object.keys(obj)
+
+ for (var i = 0; i < keys.length; i++) {
+ var key = keys[i],
+ val = obj[key]
+
+ if (Array.isArray(val)) {
+ clone[key] = val.slice()
+ continue
+ }
+
+ if (typeof val === 'string' ||
+ typeof val === 'number' ||
+ typeof val === 'boolean') {
+ clone[key] = val
+ continue
+ }
+
+ throw new TypeError("clone is not deep and does not support nested objects")
+ }
+
+ return clone
+}
+lunr.FieldRef = function (docRef, fieldName, stringValue) {
+ this.docRef = docRef
+ this.fieldName = fieldName
+ this._stringValue = stringValue
+}
+
+lunr.FieldRef.joiner = "/"
+
+lunr.FieldRef.fromString = function (s) {
+ var n = s.indexOf(lunr.FieldRef.joiner)
+
+ if (n === -1) {
+ throw "malformed field ref string"
+ }
+
+ var fieldRef = s.slice(0, n),
+ docRef = s.slice(n + 1)
+
+ return new lunr.FieldRef (docRef, fieldRef, s)
+}
+
+lunr.FieldRef.prototype.toString = function () {
+ if (this._stringValue == undefined) {
+ this._stringValue = this.fieldName + lunr.FieldRef.joiner + this.docRef
+ }
+
+ return this._stringValue
+}
+/*!
+ * lunr.Set
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * A lunr set.
+ *
+ * @constructor
+ */
+lunr.Set = function (elements) {
+ this.elements = Object.create(null)
+
+ if (elements) {
+ this.length = elements.length
+
+ for (var i = 0; i < this.length; i++) {
+ this.elements[elements[i]] = true
+ }
+ } else {
+ this.length = 0
+ }
+}
+
+/**
+ * A complete set that contains all elements.
+ *
+ * @static
+ * @readonly
+ * @type {lunr.Set}
+ */
+lunr.Set.complete = {
+ intersect: function (other) {
+ return other
+ },
+
+ union: function () {
+ return this
+ },
+
+ contains: function () {
+ return true
+ }
+}
+
+/**
+ * An empty set that contains no elements.
+ *
+ * @static
+ * @readonly
+ * @type {lunr.Set}
+ */
+lunr.Set.empty = {
+ intersect: function () {
+ return this
+ },
+
+ union: function (other) {
+ return other
+ },
+
+ contains: function () {
+ return false
+ }
+}
+
+/**
+ * Returns true if this set contains the specified object.
+ *
+ * @param {object} object - Object whose presence in this set is to be tested.
+ * @returns {boolean} - True if this set contains the specified object.
+ */
+lunr.Set.prototype.contains = function (object) {
+ return !!this.elements[object]
+}
+
+/**
+ * Returns a new set containing only the elements that are present in both
+ * this set and the specified set.
+ *
+ * @param {lunr.Set} other - set to intersect with this set.
+ * @returns {lunr.Set} a new set that is the intersection of this and the specified set.
+ */
+
+lunr.Set.prototype.intersect = function (other) {
+ var a, b, elements, intersection = []
+
+ if (other === lunr.Set.complete) {
+ return this
+ }
+
+ if (other === lunr.Set.empty) {
+ return other
+ }
+
+ if (this.length < other.length) {
+ a = this
+ b = other
+ } else {
+ a = other
+ b = this
+ }
+
+ elements = Object.keys(a.elements)
+
+ for (var i = 0; i < elements.length; i++) {
+ var element = elements[i]
+ if (element in b.elements) {
+ intersection.push(element)
+ }
+ }
+
+ return new lunr.Set (intersection)
+}
+
+/**
+ * Returns a new set combining the elements of this and the specified set.
+ *
+ * @param {lunr.Set} other - set to union with this set.
+ * @return {lunr.Set} a new set that is the union of this and the specified set.
+ */
+
+lunr.Set.prototype.union = function (other) {
+ if (other === lunr.Set.complete) {
+ return lunr.Set.complete
+ }
+
+ if (other === lunr.Set.empty) {
+ return this
+ }
+
+ return new lunr.Set(Object.keys(this.elements).concat(Object.keys(other.elements)))
+}
+/**
+ * A function to calculate the inverse document frequency for
+ * a posting. This is shared between the builder and the index
+ *
+ * @private
+ * @param {object} posting - The posting for a given term
+ * @param {number} documentCount - The total number of documents.
+ */
+lunr.idf = function (posting, documentCount) {
+ var documentsWithTerm = 0
+
+ for (var fieldName in posting) {
+ if (fieldName == '_index') continue // Ignore the term index, its not a field
+ documentsWithTerm += Object.keys(posting[fieldName]).length
+ }
+
+ var x = (documentCount - documentsWithTerm + 0.5) / (documentsWithTerm + 0.5)
+
+ return Math.log(1 + Math.abs(x))
+}
+
+/**
+ * A token wraps a string representation of a token
+ * as it is passed through the text processing pipeline.
+ *
+ * @constructor
+ * @param {string} [str=''] - The string token being wrapped.
+ * @param {object} [metadata={}] - Metadata associated with this token.
+ */
+lunr.Token = function (str, metadata) {
+ this.str = str || ""
+ this.metadata = metadata || {}
+}
+
+/**
+ * Returns the token string that is being wrapped by this object.
+ *
+ * @returns {string}
+ */
+lunr.Token.prototype.toString = function () {
+ return this.str
+}
+
+/**
+ * A token update function is used when updating or optionally
+ * when cloning a token.
+ *
+ * @callback lunr.Token~updateFunction
+ * @param {string} str - The string representation of the token.
+ * @param {Object} metadata - All metadata associated with this token.
+ */
+
+/**
+ * Applies the given function to the wrapped string token.
+ *
+ * @example
+ * token.update(function (str, metadata) {
+ * return str.toUpperCase()
+ * })
+ *
+ * @param {lunr.Token~updateFunction} fn - A function to apply to the token string.
+ * @returns {lunr.Token}
+ */
+lunr.Token.prototype.update = function (fn) {
+ this.str = fn(this.str, this.metadata)
+ return this
+}
+
+/**
+ * Creates a clone of this token. Optionally a function can be
+ * applied to the cloned token.
+ *
+ * @param {lunr.Token~updateFunction} [fn] - An optional function to apply to the cloned token.
+ * @returns {lunr.Token}
+ */
+lunr.Token.prototype.clone = function (fn) {
+ fn = fn || function (s) { return s }
+ return new lunr.Token (fn(this.str, this.metadata), this.metadata)
+}
+/*!
+ * lunr.tokenizer
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * A function for splitting a string into tokens ready to be inserted into
+ * the search index. Uses `lunr.tokenizer.separator` to split strings, change
+ * the value of this property to change how strings are split into tokens.
+ *
+ * This tokenizer will convert its parameter to a string by calling `toString` and
+ * then will split this string on the character in `lunr.tokenizer.separator`.
+ * Arrays will have their elements converted to strings and wrapped in a lunr.Token.
+ *
+ * Optional metadata can be passed to the tokenizer, this metadata will be cloned and
+ * added as metadata to every token that is created from the object to be tokenized.
+ *
+ * @static
+ * @param {?(string|object|object[])} obj - The object to convert into tokens
+ * @param {?object} metadata - Optional metadata to associate with every token
+ * @returns {lunr.Token[]}
+ * @see {@link lunr.Pipeline}
+ */
+lunr.tokenizer = function (obj, metadata) {
+ if (obj == null || obj == undefined) {
+ return []
+ }
+
+ if (Array.isArray(obj)) {
+ return obj.map(function (t) {
+ return new lunr.Token(
+ lunr.utils.asString(t).toLowerCase(),
+ lunr.utils.clone(metadata)
+ )
+ })
+ }
+
+ var str = obj.toString().toLowerCase(),
+ len = str.length,
+ tokens = []
+
+ for (var sliceEnd = 0, sliceStart = 0; sliceEnd <= len; sliceEnd++) {
+ var char = str.charAt(sliceEnd),
+ sliceLength = sliceEnd - sliceStart
+
+ if ((char.match(lunr.tokenizer.separator) || sliceEnd == len)) {
+
+ if (sliceLength > 0) {
+ var tokenMetadata = lunr.utils.clone(metadata) || {}
+ tokenMetadata["position"] = [sliceStart, sliceLength]
+ tokenMetadata["index"] = tokens.length
+
+ tokens.push(
+ new lunr.Token (
+ str.slice(sliceStart, sliceEnd),
+ tokenMetadata
+ )
+ )
+ }
+
+ sliceStart = sliceEnd + 1
+ }
+
+ }
+
+ return tokens
+}
+
+/**
+ * The separator used to split a string into tokens. Override this property to change the behaviour of
+ * `lunr.tokenizer` behaviour when tokenizing strings. By default this splits on whitespace and hyphens.
+ *
+ * @static
+ * @see lunr.tokenizer
+ */
+lunr.tokenizer.separator = /[\s\-]+/
+/*!
+ * lunr.Pipeline
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * lunr.Pipelines maintain an ordered list of functions to be applied to all
+ * tokens in documents entering the search index and queries being ran against
+ * the index.
+ *
+ * An instance of lunr.Index created with the lunr shortcut will contain a
+ * pipeline with a stop word filter and an English language stemmer. Extra
+ * functions can be added before or after either of these functions or these
+ * default functions can be removed.
+ *
+ * When run the pipeline will call each function in turn, passing a token, the
+ * index of that token in the original list of all tokens and finally a list of
+ * all the original tokens.
+ *
+ * The output of functions in the pipeline will be passed to the next function
+ * in the pipeline. To exclude a token from entering the index the function
+ * should return undefined, the rest of the pipeline will not be called with
+ * this token.
+ *
+ * For serialisation of pipelines to work, all functions used in an instance of
+ * a pipeline should be registered with lunr.Pipeline. Registered functions can
+ * then be loaded. If trying to load a serialised pipeline that uses functions
+ * that are not registered an error will be thrown.
+ *
+ * If not planning on serialising the pipeline then registering pipeline functions
+ * is not necessary.
+ *
+ * @constructor
+ */
+lunr.Pipeline = function () {
+ this._stack = []
+}
+
+lunr.Pipeline.registeredFunctions = Object.create(null)
+
+/**
+ * A pipeline function maps lunr.Token to lunr.Token. A lunr.Token contains the token
+ * string as well as all known metadata. A pipeline function can mutate the token string
+ * or mutate (or add) metadata for a given token.
+ *
+ * A pipeline function can indicate that the passed token should be discarded by returning
+ * null, undefined or an empty string. This token will not be passed to any downstream pipeline
+ * functions and will not be added to the index.
+ *
+ * Multiple tokens can be returned by returning an array of tokens. Each token will be passed
+ * to any downstream pipeline functions and all will returned tokens will be added to the index.
+ *
+ * Any number of pipeline functions may be chained together using a lunr.Pipeline.
+ *
+ * @interface lunr.PipelineFunction
+ * @param {lunr.Token} token - A token from the document being processed.
+ * @param {number} i - The index of this token in the complete list of tokens for this document/field.
+ * @param {lunr.Token[]} tokens - All tokens for this document/field.
+ * @returns {(?lunr.Token|lunr.Token[])}
+ */
+
+/**
+ * Register a function with the pipeline.
+ *
+ * Functions that are used in the pipeline should be registered if the pipeline
+ * needs to be serialised, or a serialised pipeline needs to be loaded.
+ *
+ * Registering a function does not add it to a pipeline, functions must still be
+ * added to instances of the pipeline for them to be used when running a pipeline.
+ *
+ * @param {lunr.PipelineFunction} fn - The function to check for.
+ * @param {String} label - The label to register this function with
+ */
+lunr.Pipeline.registerFunction = function (fn, label) {
+ if (label in this.registeredFunctions) {
+ lunr.utils.warn('Overwriting existing registered function: ' + label)
+ }
+
+ fn.label = label
+ lunr.Pipeline.registeredFunctions[fn.label] = fn
+}
+
+/**
+ * Warns if the function is not registered as a Pipeline function.
+ *
+ * @param {lunr.PipelineFunction} fn - The function to check for.
+ * @private
+ */
+lunr.Pipeline.warnIfFunctionNotRegistered = function (fn) {
+ var isRegistered = fn.label && (fn.label in this.registeredFunctions)
+
+ if (!isRegistered) {
+ lunr.utils.warn('Function is not registered with pipeline. This may cause problems when serialising the index.\n', fn)
+ }
+}
+
+/**
+ * Loads a previously serialised pipeline.
+ *
+ * All functions to be loaded must already be registered with lunr.Pipeline.
+ * If any function from the serialised data has not been registered then an
+ * error will be thrown.
+ *
+ * @param {Object} serialised - The serialised pipeline to load.
+ * @returns {lunr.Pipeline}
+ */
+lunr.Pipeline.load = function (serialised) {
+ var pipeline = new lunr.Pipeline
+
+ serialised.forEach(function (fnName) {
+ var fn = lunr.Pipeline.registeredFunctions[fnName]
+
+ if (fn) {
+ pipeline.add(fn)
+ } else {
+ throw new Error('Cannot load unregistered function: ' + fnName)
+ }
+ })
+
+ return pipeline
+}
+
+/**
+ * Adds new functions to the end of the pipeline.
+ *
+ * Logs a warning if the function has not been registered.
+ *
+ * @param {lunr.PipelineFunction[]} functions - Any number of functions to add to the pipeline.
+ */
+lunr.Pipeline.prototype.add = function () {
+ var fns = Array.prototype.slice.call(arguments)
+
+ fns.forEach(function (fn) {
+ lunr.Pipeline.warnIfFunctionNotRegistered(fn)
+ this._stack.push(fn)
+ }, this)
+}
+
+/**
+ * Adds a single function after a function that already exists in the
+ * pipeline.
+ *
+ * Logs a warning if the function has not been registered.
+ *
+ * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.
+ * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.
+ */
+lunr.Pipeline.prototype.after = function (existingFn, newFn) {
+ lunr.Pipeline.warnIfFunctionNotRegistered(newFn)
+
+ var pos = this._stack.indexOf(existingFn)
+ if (pos == -1) {
+ throw new Error('Cannot find existingFn')
+ }
+
+ pos = pos + 1
+ this._stack.splice(pos, 0, newFn)
+}
+
+/**
+ * Adds a single function before a function that already exists in the
+ * pipeline.
+ *
+ * Logs a warning if the function has not been registered.
+ *
+ * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.
+ * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.
+ */
+lunr.Pipeline.prototype.before = function (existingFn, newFn) {
+ lunr.Pipeline.warnIfFunctionNotRegistered(newFn)
+
+ var pos = this._stack.indexOf(existingFn)
+ if (pos == -1) {
+ throw new Error('Cannot find existingFn')
+ }
+
+ this._stack.splice(pos, 0, newFn)
+}
+
+/**
+ * Removes a function from the pipeline.
+ *
+ * @param {lunr.PipelineFunction} fn The function to remove from the pipeline.
+ */
+lunr.Pipeline.prototype.remove = function (fn) {
+ var pos = this._stack.indexOf(fn)
+ if (pos == -1) {
+ return
+ }
+
+ this._stack.splice(pos, 1)
+}
+
+/**
+ * Runs the current list of functions that make up the pipeline against the
+ * passed tokens.
+ *
+ * @param {Array} tokens The tokens to run through the pipeline.
+ * @returns {Array}
+ */
+lunr.Pipeline.prototype.run = function (tokens) {
+ var stackLength = this._stack.length
+
+ for (var i = 0; i < stackLength; i++) {
+ var fn = this._stack[i]
+ var memo = []
+
+ for (var j = 0; j < tokens.length; j++) {
+ var result = fn(tokens[j], j, tokens)
+
+ if (result === null || result === void 0 || result === '') continue
+
+ if (Array.isArray(result)) {
+ for (var k = 0; k < result.length; k++) {
+ memo.push(result[k])
+ }
+ } else {
+ memo.push(result)
+ }
+ }
+
+ tokens = memo
+ }
+
+ return tokens
+}
+
+/**
+ * Convenience method for passing a string through a pipeline and getting
+ * strings out. This method takes care of wrapping the passed string in a
+ * token and mapping the resulting tokens back to strings.
+ *
+ * @param {string} str - The string to pass through the pipeline.
+ * @param {?object} metadata - Optional metadata to associate with the token
+ * passed to the pipeline.
+ * @returns {string[]}
+ */
+lunr.Pipeline.prototype.runString = function (str, metadata) {
+ var token = new lunr.Token (str, metadata)
+
+ return this.run([token]).map(function (t) {
+ return t.toString()
+ })
+}
+
+/**
+ * Resets the pipeline by removing any existing processors.
+ *
+ */
+lunr.Pipeline.prototype.reset = function () {
+ this._stack = []
+}
+
+/**
+ * Returns a representation of the pipeline ready for serialisation.
+ *
+ * Logs a warning if the function has not been registered.
+ *
+ * @returns {Array}
+ */
+lunr.Pipeline.prototype.toJSON = function () {
+ return this._stack.map(function (fn) {
+ lunr.Pipeline.warnIfFunctionNotRegistered(fn)
+
+ return fn.label
+ })
+}
+/*!
+ * lunr.Vector
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * A vector is used to construct the vector space of documents and queries. These
+ * vectors support operations to determine the similarity between two documents or
+ * a document and a query.
+ *
+ * Normally no parameters are required for initializing a vector, but in the case of
+ * loading a previously dumped vector the raw elements can be provided to the constructor.
+ *
+ * For performance reasons vectors are implemented with a flat array, where an elements
+ * index is immediately followed by its value. E.g. [index, value, index, value]. This
+ * allows the underlying array to be as sparse as possible and still offer decent
+ * performance when being used for vector calculations.
+ *
+ * @constructor
+ * @param {Number[]} [elements] - The flat list of element index and element value pairs.
+ */
+lunr.Vector = function (elements) {
+ this._magnitude = 0
+ this.elements = elements || []
+}
+
+
+/**
+ * Calculates the position within the vector to insert a given index.
+ *
+ * This is used internally by insert and upsert. If there are duplicate indexes then
+ * the position is returned as if the value for that index were to be updated, but it
+ * is the callers responsibility to check whether there is a duplicate at that index
+ *
+ * @param {Number} insertIdx - The index at which the element should be inserted.
+ * @returns {Number}
+ */
+lunr.Vector.prototype.positionForIndex = function (index) {
+ // For an empty vector the tuple can be inserted at the beginning
+ if (this.elements.length == 0) {
+ return 0
+ }
+
+ var start = 0,
+ end = this.elements.length / 2,
+ sliceLength = end - start,
+ pivotPoint = Math.floor(sliceLength / 2),
+ pivotIndex = this.elements[pivotPoint * 2]
+
+ while (sliceLength > 1) {
+ if (pivotIndex < index) {
+ start = pivotPoint
+ }
+
+ if (pivotIndex > index) {
+ end = pivotPoint
+ }
+
+ if (pivotIndex == index) {
+ break
+ }
+
+ sliceLength = end - start
+ pivotPoint = start + Math.floor(sliceLength / 2)
+ pivotIndex = this.elements[pivotPoint * 2]
+ }
+
+ if (pivotIndex == index) {
+ return pivotPoint * 2
+ }
+
+ if (pivotIndex > index) {
+ return pivotPoint * 2
+ }
+
+ if (pivotIndex < index) {
+ return (pivotPoint + 1) * 2
+ }
+}
+
+/**
+ * Inserts an element at an index within the vector.
+ *
+ * Does not allow duplicates, will throw an error if there is already an entry
+ * for this index.
+ *
+ * @param {Number} insertIdx - The index at which the element should be inserted.
+ * @param {Number} val - The value to be inserted into the vector.
+ */
+lunr.Vector.prototype.insert = function (insertIdx, val) {
+ this.upsert(insertIdx, val, function () {
+ throw "duplicate index"
+ })
+}
+
+/**
+ * Inserts or updates an existing index within the vector.
+ *
+ * @param {Number} insertIdx - The index at which the element should be inserted.
+ * @param {Number} val - The value to be inserted into the vector.
+ * @param {function} fn - A function that is called for updates, the existing value and the
+ * requested value are passed as arguments
+ */
+lunr.Vector.prototype.upsert = function (insertIdx, val, fn) {
+ this._magnitude = 0
+ var position = this.positionForIndex(insertIdx)
+
+ if (this.elements[position] == insertIdx) {
+ this.elements[position + 1] = fn(this.elements[position + 1], val)
+ } else {
+ this.elements.splice(position, 0, insertIdx, val)
+ }
+}
+
+/**
+ * Calculates the magnitude of this vector.
+ *
+ * @returns {Number}
+ */
+lunr.Vector.prototype.magnitude = function () {
+ if (this._magnitude) return this._magnitude
+
+ var sumOfSquares = 0,
+ elementsLength = this.elements.length
+
+ for (var i = 1; i < elementsLength; i += 2) {
+ var val = this.elements[i]
+ sumOfSquares += val * val
+ }
+
+ return this._magnitude = Math.sqrt(sumOfSquares)
+}
+
+/**
+ * Calculates the dot product of this vector and another vector.
+ *
+ * @param {lunr.Vector} otherVector - The vector to compute the dot product with.
+ * @returns {Number}
+ */
+lunr.Vector.prototype.dot = function (otherVector) {
+ var dotProduct = 0,
+ a = this.elements, b = otherVector.elements,
+ aLen = a.length, bLen = b.length,
+ aVal = 0, bVal = 0,
+ i = 0, j = 0
+
+ while (i < aLen && j < bLen) {
+ aVal = a[i], bVal = b[j]
+ if (aVal < bVal) {
+ i += 2
+ } else if (aVal > bVal) {
+ j += 2
+ } else if (aVal == bVal) {
+ dotProduct += a[i + 1] * b[j + 1]
+ i += 2
+ j += 2
+ }
+ }
+
+ return dotProduct
+}
+
+/**
+ * Calculates the similarity between this vector and another vector.
+ *
+ * @param {lunr.Vector} otherVector - The other vector to calculate the
+ * similarity with.
+ * @returns {Number}
+ */
+lunr.Vector.prototype.similarity = function (otherVector) {
+ return this.dot(otherVector) / this.magnitude() || 0
+}
+
+/**
+ * Converts the vector to an array of the elements within the vector.
+ *
+ * @returns {Number[]}
+ */
+lunr.Vector.prototype.toArray = function () {
+ var output = new Array (this.elements.length / 2)
+
+ for (var i = 1, j = 0; i < this.elements.length; i += 2, j++) {
+ output[j] = this.elements[i]
+ }
+
+ return output
+}
+
+/**
+ * A JSON serializable representation of the vector.
+ *
+ * @returns {Number[]}
+ */
+lunr.Vector.prototype.toJSON = function () {
+ return this.elements
+}
+/* eslint-disable */
+/*!
+ * lunr.stemmer
+ * Copyright (C) 2020 Oliver Nightingale
+ * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt
+ */
+
+/**
+ * lunr.stemmer is an english language stemmer, this is a JavaScript
+ * implementation of the PorterStemmer taken from http://tartarus.org/~martin
+ *
+ * @static
+ * @implements {lunr.PipelineFunction}
+ * @param {lunr.Token} token - The string to stem
+ * @returns {lunr.Token}
+ * @see {@link lunr.Pipeline}
+ * @function
+ */
+lunr.stemmer = (function(){
+ var step2list = {
+ "ational" : "ate",
+ "tional" : "tion",
+ "enci" : "ence",
+ "anci" : "ance",
+ "izer" : "ize",
+ "bli" : "ble",
+ "alli" : "al",
+ "entli" : "ent",
+ "eli" : "e",
+ "ousli" : "ous",
+ "ization" : "ize",
+ "ation" : "ate",
+ "ator" : "ate",
+ "alism" : "al",
+ "iveness" : "ive",
+ "fulness" : "ful",
+ "ousness" : "ous",
+ "aliti" : "al",
+ "iviti" : "ive",
+ "biliti" : "ble",
+ "logi" : "log"
+ },
+
+ step3list = {
+ "icate" : "ic",
+ "ative" : "",
+ "alize" : "al",
+ "iciti" : "ic",
+ "ical" : "ic",
+ "ful" : "",
+ "ness" : ""
+ },
+
+ c = "[^aeiou]", // consonant
+ v = "[aeiouy]", // vowel
+ C = c + "[^aeiouy]*", // consonant sequence
+ V = v + "[aeiou]*", // vowel sequence
+
+ mgr0 = "^(" + C + ")?" + V + C, // [C]VC... is m>0
+ meq1 = "^(" + C + ")?" + V + C + "(" + V + ")?$", // [C]VC[V] is m=1
+ mgr1 = "^(" + C + ")?" + V + C + V + C, // [C]VCVC... is m>1
+ s_v = "^(" + C + ")?" + v; // vowel in stem
+
+ var re_mgr0 = new RegExp(mgr0);
+ var re_mgr1 = new RegExp(mgr1);
+ var re_meq1 = new RegExp(meq1);
+ var re_s_v = new RegExp(s_v);
+
+ var re_1a = /^(.+?)(ss|i)es$/;
+ var re2_1a = /^(.+?)([^s])s$/;
+ var re_1b = /^(.+?)eed$/;
+ var re2_1b = /^(.+?)(ed|ing)$/;
+ var re_1b_2 = /.$/;
+ var re2_1b_2 = /(at|bl|iz)$/;
+ var re3_1b_2 = new RegExp("([^aeiouylsz])\\1$");
+ var re4_1b_2 = new RegExp("^" + C + v + "[^aeiouwxy]$");
+
+ var re_1c = /^(.+?[^aeiou])y$/;
+ var re_2 = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;
+
+ var re_3 = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;
+
+ var re_4 = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;
+ var re2_4 = /^(.+?)(s|t)(ion)$/;
+
+ var re_5 = /^(.+?)e$/;
+ var re_5_1 = /ll$/;
+ var re3_5 = new RegExp("^" + C + v + "[^aeiouwxy]$");
+
+ var porterStemmer = function porterStemmer(w) {
+ var stem,
+ suffix,
+ firstch,
+ re,
+ re2,
+ re3,
+ re4;
+
+ if (w.length < 3) { return w; }
+
+ firstch = w.substr(0,1);
+ if (firstch == "y") {
+ w = firstch.toUpperCase() + w.substr(1);
+ }
+
+ // Step 1a
+ re = re_1a
+ re2 = re2_1a;
+
+ if (re.test(w)) { w = w.replace(re,"$1$2"); }
+ else if (re2.test(w)) { w = w.replace(re2,"$1$2"); }
+
+ // Step 1b
+ re = re_1b;
+ re2 = re2_1b;
+ if (re.test(w)) {
+ var fp = re.exec(w);
+ re = re_mgr0;
+ if (re.test(fp[1])) {
+ re = re_1b_2;
+ w = w.replace(re,"");
+ }
+ } else if (re2.test(w)) {
+ var fp = re2.exec(w);
+ stem = fp[1];
+ re2 = re_s_v;
+ if (re2.test(stem)) {
+ w = stem;
+ re2 = re2_1b_2;
+ re3 = re3_1b_2;
+ re4 = re4_1b_2;
+ if (re2.test(w)) { w = w + "e"; }
+ else if (re3.test(w)) { re = re_1b_2; w = w.replace(re,""); }
+ else if (re4.test(w)) { w = w + "e"; }
+ }
+ }
+
+ // Step 1c - replace suffix y or Y by i if preceded by a non-vowel which is not the first letter of the word (so cry -> cri, by -> by, say -> say)
+ re = re_1c;
+ if (re.test(w)) {
+ var fp = re.exec(w);
+ stem = fp[1];
+ w = stem + "i";
+ }
+
+ // Step 2
+ re = re_2;
+ if (re.test(w)) {
+ var fp = re.exec(w);
+ stem = fp[1];
+ suffix = fp[2];
+ re = re_mgr0;
+ if (re.test(stem)) {
+ w = stem + step2list[suffix];
+ }
+ }
+
+ // Step 3
+ re = re_3;
+ if (re.test(w)) {
+ var fp = re.exec(w);
+ stem = fp[1];
+ suffix = fp[2];
+ re = re_mgr0;
+ if (re.test(stem)) {
+ w = stem + step3list[suffix];
+ }
+ }
+
+ // Step 4
+ re = re_4;
+ re2 = re2_4;
+ if (re.test(w)) {
+ var fp = re.exec(w);
+ stem = fp[1];
+ re = re_mgr1;
+ if (re.test(stem)) {
+ w = stem;
+ }
+ } else if (re2.test(w)) {
+ var fp = re2.exec(w);
+ stem = fp[1] + fp[2];
+ re2 = re_mgr1;
+ if (re2.test(stem)) {
+ w = stem;
+ }
+ }
+
+ // Step 5
+ re = re_5;
+ if (re.test(w)) {
+ var fp = re.exec(w);
+ stem = fp[1];
+ re = re_mgr1;
+ re2 = re_meq1;
+ re3 = re3_5;
+ if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) {
+ w = stem;
+ }
+ }
+
+ re = re_5_1;
+ re2 = re_mgr1;
+ if (re.test(w) && re2.test(w)) {
+ re = re_1b_2;
+ w = w.replace(re,"");
+ }
+
+ // and turn initial Y back to y
+
+ if (firstch == "y") {
+ w = firstch.toLowerCase() + w.substr(1);
+ }
+
+ return w;
+ };
+
+ return function (token) {
+ return token.update(porterStemmer);
+ }
+})();
+
+lunr.Pipeline.registerFunction(lunr.stemmer, 'stemmer')
+/*!
+ * lunr.stopWordFilter
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * lunr.generateStopWordFilter builds a stopWordFilter function from the provided
+ * list of stop words.
+ *
+ * The built in lunr.stopWordFilter is built using this generator and can be used
+ * to generate custom stopWordFilters for applications or non English languages.
+ *
+ * @function
+ * @param {Array} token The token to pass through the filter
+ * @returns {lunr.PipelineFunction}
+ * @see lunr.Pipeline
+ * @see lunr.stopWordFilter
+ */
+lunr.generateStopWordFilter = function (stopWords) {
+ var words = stopWords.reduce(function (memo, stopWord) {
+ memo[stopWord] = stopWord
+ return memo
+ }, {})
+
+ return function (token) {
+ if (token && words[token.toString()] !== token.toString()) return token
+ }
+}
+
+/**
+ * lunr.stopWordFilter is an English language stop word list filter, any words
+ * contained in the list will not be passed through the filter.
+ *
+ * This is intended to be used in the Pipeline. If the token does not pass the
+ * filter then undefined will be returned.
+ *
+ * @function
+ * @implements {lunr.PipelineFunction}
+ * @params {lunr.Token} token - A token to check for being a stop word.
+ * @returns {lunr.Token}
+ * @see {@link lunr.Pipeline}
+ */
+lunr.stopWordFilter = lunr.generateStopWordFilter([
+ 'a',
+ 'able',
+ 'about',
+ 'across',
+ 'after',
+ 'all',
+ 'almost',
+ 'also',
+ 'am',
+ 'among',
+ 'an',
+ 'and',
+ 'any',
+ 'are',
+ 'as',
+ 'at',
+ 'be',
+ 'because',
+ 'been',
+ 'but',
+ 'by',
+ 'can',
+ 'cannot',
+ 'could',
+ 'dear',
+ 'did',
+ 'do',
+ 'does',
+ 'either',
+ 'else',
+ 'ever',
+ 'every',
+ 'for',
+ 'from',
+ 'get',
+ 'got',
+ 'had',
+ 'has',
+ 'have',
+ 'he',
+ 'her',
+ 'hers',
+ 'him',
+ 'his',
+ 'how',
+ 'however',
+ 'i',
+ 'if',
+ 'in',
+ 'into',
+ 'is',
+ 'it',
+ 'its',
+ 'just',
+ 'least',
+ 'let',
+ 'like',
+ 'likely',
+ 'may',
+ 'me',
+ 'might',
+ 'most',
+ 'must',
+ 'my',
+ 'neither',
+ 'no',
+ 'nor',
+ 'not',
+ 'of',
+ 'off',
+ 'often',
+ 'on',
+ 'only',
+ 'or',
+ 'other',
+ 'our',
+ 'own',
+ 'rather',
+ 'said',
+ 'say',
+ 'says',
+ 'she',
+ 'should',
+ 'since',
+ 'so',
+ 'some',
+ 'than',
+ 'that',
+ 'the',
+ 'their',
+ 'them',
+ 'then',
+ 'there',
+ 'these',
+ 'they',
+ 'this',
+ 'tis',
+ 'to',
+ 'too',
+ 'twas',
+ 'us',
+ 'wants',
+ 'was',
+ 'we',
+ 'were',
+ 'what',
+ 'when',
+ 'where',
+ 'which',
+ 'while',
+ 'who',
+ 'whom',
+ 'why',
+ 'will',
+ 'with',
+ 'would',
+ 'yet',
+ 'you',
+ 'your'
+])
+
+lunr.Pipeline.registerFunction(lunr.stopWordFilter, 'stopWordFilter')
+/*!
+ * lunr.trimmer
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * lunr.trimmer is a pipeline function for trimming non word
+ * characters from the beginning and end of tokens before they
+ * enter the index.
+ *
+ * This implementation may not work correctly for non latin
+ * characters and should either be removed or adapted for use
+ * with languages with non-latin characters.
+ *
+ * @static
+ * @implements {lunr.PipelineFunction}
+ * @param {lunr.Token} token The token to pass through the filter
+ * @returns {lunr.Token}
+ * @see lunr.Pipeline
+ */
+lunr.trimmer = function (token) {
+ return token.update(function (s) {
+ return s.replace(/^\W+/, '').replace(/\W+$/, '')
+ })
+}
+
+lunr.Pipeline.registerFunction(lunr.trimmer, 'trimmer')
+/*!
+ * lunr.TokenSet
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * A token set is used to store the unique list of all tokens
+ * within an index. Token sets are also used to represent an
+ * incoming query to the index, this query token set and index
+ * token set are then intersected to find which tokens to look
+ * up in the inverted index.
+ *
+ * A token set can hold multiple tokens, as in the case of the
+ * index token set, or it can hold a single token as in the
+ * case of a simple query token set.
+ *
+ * Additionally token sets are used to perform wildcard matching.
+ * Leading, contained and trailing wildcards are supported, and
+ * from this edit distance matching can also be provided.
+ *
+ * Token sets are implemented as a minimal finite state automata,
+ * where both common prefixes and suffixes are shared between tokens.
+ * This helps to reduce the space used for storing the token set.
+ *
+ * @constructor
+ */
+lunr.TokenSet = function () {
+ this.final = false
+ this.edges = {}
+ this.id = lunr.TokenSet._nextId
+ lunr.TokenSet._nextId += 1
+}
+
+/**
+ * Keeps track of the next, auto increment, identifier to assign
+ * to a new tokenSet.
+ *
+ * TokenSets require a unique identifier to be correctly minimised.
+ *
+ * @private
+ */
+lunr.TokenSet._nextId = 1
+
+/**
+ * Creates a TokenSet instance from the given sorted array of words.
+ *
+ * @param {String[]} arr - A sorted array of strings to create the set from.
+ * @returns {lunr.TokenSet}
+ * @throws Will throw an error if the input array is not sorted.
+ */
+lunr.TokenSet.fromArray = function (arr) {
+ var builder = new lunr.TokenSet.Builder
+
+ for (var i = 0, len = arr.length; i < len; i++) {
+ builder.insert(arr[i])
+ }
+
+ builder.finish()
+ return builder.root
+}
+
+/**
+ * Creates a token set from a query clause.
+ *
+ * @private
+ * @param {Object} clause - A single clause from lunr.Query.
+ * @param {string} clause.term - The query clause term.
+ * @param {number} [clause.editDistance] - The optional edit distance for the term.
+ * @returns {lunr.TokenSet}
+ */
+lunr.TokenSet.fromClause = function (clause) {
+ if ('editDistance' in clause) {
+ return lunr.TokenSet.fromFuzzyString(clause.term, clause.editDistance)
+ } else {
+ return lunr.TokenSet.fromString(clause.term)
+ }
+}
+
+/**
+ * Creates a token set representing a single string with a specified
+ * edit distance.
+ *
+ * Insertions, deletions, substitutions and transpositions are each
+ * treated as an edit distance of 1.
+ *
+ * Increasing the allowed edit distance will have a dramatic impact
+ * on the performance of both creating and intersecting these TokenSets.
+ * It is advised to keep the edit distance less than 3.
+ *
+ * @param {string} str - The string to create the token set from.
+ * @param {number} editDistance - The allowed edit distance to match.
+ * @returns {lunr.Vector}
+ */
+lunr.TokenSet.fromFuzzyString = function (str, editDistance) {
+ var root = new lunr.TokenSet
+
+ var stack = [{
+ node: root,
+ editsRemaining: editDistance,
+ str: str
+ }]
+
+ while (stack.length) {
+ var frame = stack.pop()
+
+ // no edit
+ if (frame.str.length > 0) {
+ var char = frame.str.charAt(0),
+ noEditNode
+
+ if (char in frame.node.edges) {
+ noEditNode = frame.node.edges[char]
+ } else {
+ noEditNode = new lunr.TokenSet
+ frame.node.edges[char] = noEditNode
+ }
+
+ if (frame.str.length == 1) {
+ noEditNode.final = true
+ }
+
+ stack.push({
+ node: noEditNode,
+ editsRemaining: frame.editsRemaining,
+ str: frame.str.slice(1)
+ })
+ }
+
+ if (frame.editsRemaining == 0) {
+ continue
+ }
+
+ // insertion
+ if ("*" in frame.node.edges) {
+ var insertionNode = frame.node.edges["*"]
+ } else {
+ var insertionNode = new lunr.TokenSet
+ frame.node.edges["*"] = insertionNode
+ }
+
+ if (frame.str.length == 0) {
+ insertionNode.final = true
+ }
+
+ stack.push({
+ node: insertionNode,
+ editsRemaining: frame.editsRemaining - 1,
+ str: frame.str
+ })
+
+ // deletion
+ // can only do a deletion if we have enough edits remaining
+ // and if there are characters left to delete in the string
+ if (frame.str.length > 1) {
+ stack.push({
+ node: frame.node,
+ editsRemaining: frame.editsRemaining - 1,
+ str: frame.str.slice(1)
+ })
+ }
+
+ // deletion
+ // just removing the last character from the str
+ if (frame.str.length == 1) {
+ frame.node.final = true
+ }
+
+ // substitution
+ // can only do a substitution if we have enough edits remaining
+ // and if there are characters left to substitute
+ if (frame.str.length >= 1) {
+ if ("*" in frame.node.edges) {
+ var substitutionNode = frame.node.edges["*"]
+ } else {
+ var substitutionNode = new lunr.TokenSet
+ frame.node.edges["*"] = substitutionNode
+ }
+
+ if (frame.str.length == 1) {
+ substitutionNode.final = true
+ }
+
+ stack.push({
+ node: substitutionNode,
+ editsRemaining: frame.editsRemaining - 1,
+ str: frame.str.slice(1)
+ })
+ }
+
+ // transposition
+ // can only do a transposition if there are edits remaining
+ // and there are enough characters to transpose
+ if (frame.str.length > 1) {
+ var charA = frame.str.charAt(0),
+ charB = frame.str.charAt(1),
+ transposeNode
+
+ if (charB in frame.node.edges) {
+ transposeNode = frame.node.edges[charB]
+ } else {
+ transposeNode = new lunr.TokenSet
+ frame.node.edges[charB] = transposeNode
+ }
+
+ if (frame.str.length == 1) {
+ transposeNode.final = true
+ }
+
+ stack.push({
+ node: transposeNode,
+ editsRemaining: frame.editsRemaining - 1,
+ str: charA + frame.str.slice(2)
+ })
+ }
+ }
+
+ return root
+}
+
+/**
+ * Creates a TokenSet from a string.
+ *
+ * The string may contain one or more wildcard characters (*)
+ * that will allow wildcard matching when intersecting with
+ * another TokenSet.
+ *
+ * @param {string} str - The string to create a TokenSet from.
+ * @returns {lunr.TokenSet}
+ */
+lunr.TokenSet.fromString = function (str) {
+ var node = new lunr.TokenSet,
+ root = node
+
+ /*
+ * Iterates through all characters within the passed string
+ * appending a node for each character.
+ *
+ * When a wildcard character is found then a self
+ * referencing edge is introduced to continually match
+ * any number of any characters.
+ */
+ for (var i = 0, len = str.length; i < len; i++) {
+ var char = str[i],
+ final = (i == len - 1)
+
+ if (char == "*") {
+ node.edges[char] = node
+ node.final = final
+
+ } else {
+ var next = new lunr.TokenSet
+ next.final = final
+
+ node.edges[char] = next
+ node = next
+ }
+ }
+
+ return root
+}
+
+/**
+ * Converts this TokenSet into an array of strings
+ * contained within the TokenSet.
+ *
+ * This is not intended to be used on a TokenSet that
+ * contains wildcards, in these cases the results are
+ * undefined and are likely to cause an infinite loop.
+ *
+ * @returns {string[]}
+ */
+lunr.TokenSet.prototype.toArray = function () {
+ var words = []
+
+ var stack = [{
+ prefix: "",
+ node: this
+ }]
+
+ while (stack.length) {
+ var frame = stack.pop(),
+ edges = Object.keys(frame.node.edges),
+ len = edges.length
+
+ if (frame.node.final) {
+ /* In Safari, at this point the prefix is sometimes corrupted, see:
+ * https://github.com/olivernn/lunr.js/issues/279 Calling any
+ * String.prototype method forces Safari to "cast" this string to what
+ * it's supposed to be, fixing the bug. */
+ frame.prefix.charAt(0)
+ words.push(frame.prefix)
+ }
+
+ for (var i = 0; i < len; i++) {
+ var edge = edges[i]
+
+ stack.push({
+ prefix: frame.prefix.concat(edge),
+ node: frame.node.edges[edge]
+ })
+ }
+ }
+
+ return words
+}
+
+/**
+ * Generates a string representation of a TokenSet.
+ *
+ * This is intended to allow TokenSets to be used as keys
+ * in objects, largely to aid the construction and minimisation
+ * of a TokenSet. As such it is not designed to be a human
+ * friendly representation of the TokenSet.
+ *
+ * @returns {string}
+ */
+lunr.TokenSet.prototype.toString = function () {
+ // NOTE: Using Object.keys here as this.edges is very likely
+ // to enter 'hash-mode' with many keys being added
+ //
+ // avoiding a for-in loop here as it leads to the function
+ // being de-optimised (at least in V8). From some simple
+ // benchmarks the performance is comparable, but allowing
+ // V8 to optimize may mean easy performance wins in the future.
+
+ if (this._str) {
+ return this._str
+ }
+
+ var str = this.final ? '1' : '0',
+ labels = Object.keys(this.edges).sort(),
+ len = labels.length
+
+ for (var i = 0; i < len; i++) {
+ var label = labels[i],
+ node = this.edges[label]
+
+ str = str + label + node.id
+ }
+
+ return str
+}
+
+/**
+ * Returns a new TokenSet that is the intersection of
+ * this TokenSet and the passed TokenSet.
+ *
+ * This intersection will take into account any wildcards
+ * contained within the TokenSet.
+ *
+ * @param {lunr.TokenSet} b - An other TokenSet to intersect with.
+ * @returns {lunr.TokenSet}
+ */
+lunr.TokenSet.prototype.intersect = function (b) {
+ var output = new lunr.TokenSet,
+ frame = undefined
+
+ var stack = [{
+ qNode: b,
+ output: output,
+ node: this
+ }]
+
+ while (stack.length) {
+ frame = stack.pop()
+
+ // NOTE: As with the #toString method, we are using
+ // Object.keys and a for loop instead of a for-in loop
+ // as both of these objects enter 'hash' mode, causing
+ // the function to be de-optimised in V8
+ var qEdges = Object.keys(frame.qNode.edges),
+ qLen = qEdges.length,
+ nEdges = Object.keys(frame.node.edges),
+ nLen = nEdges.length
+
+ for (var q = 0; q < qLen; q++) {
+ var qEdge = qEdges[q]
+
+ for (var n = 0; n < nLen; n++) {
+ var nEdge = nEdges[n]
+
+ if (nEdge == qEdge || qEdge == '*') {
+ var node = frame.node.edges[nEdge],
+ qNode = frame.qNode.edges[qEdge],
+ final = node.final && qNode.final,
+ next = undefined
+
+ if (nEdge in frame.output.edges) {
+ // an edge already exists for this character
+ // no need to create a new node, just set the finality
+ // bit unless this node is already final
+ next = frame.output.edges[nEdge]
+ next.final = next.final || final
+
+ } else {
+ // no edge exists yet, must create one
+ // set the finality bit and insert it
+ // into the output
+ next = new lunr.TokenSet
+ next.final = final
+ frame.output.edges[nEdge] = next
+ }
+
+ stack.push({
+ qNode: qNode,
+ output: next,
+ node: node
+ })
+ }
+ }
+ }
+ }
+
+ return output
+}
+lunr.TokenSet.Builder = function () {
+ this.previousWord = ""
+ this.root = new lunr.TokenSet
+ this.uncheckedNodes = []
+ this.minimizedNodes = {}
+}
+
+lunr.TokenSet.Builder.prototype.insert = function (word) {
+ var node,
+ commonPrefix = 0
+
+ if (word < this.previousWord) {
+ throw new Error ("Out of order word insertion")
+ }
+
+ for (var i = 0; i < word.length && i < this.previousWord.length; i++) {
+ if (word[i] != this.previousWord[i]) break
+ commonPrefix++
+ }
+
+ this.minimize(commonPrefix)
+
+ if (this.uncheckedNodes.length == 0) {
+ node = this.root
+ } else {
+ node = this.uncheckedNodes[this.uncheckedNodes.length - 1].child
+ }
+
+ for (var i = commonPrefix; i < word.length; i++) {
+ var nextNode = new lunr.TokenSet,
+ char = word[i]
+
+ node.edges[char] = nextNode
+
+ this.uncheckedNodes.push({
+ parent: node,
+ char: char,
+ child: nextNode
+ })
+
+ node = nextNode
+ }
+
+ node.final = true
+ this.previousWord = word
+}
+
+lunr.TokenSet.Builder.prototype.finish = function () {
+ this.minimize(0)
+}
+
+lunr.TokenSet.Builder.prototype.minimize = function (downTo) {
+ for (var i = this.uncheckedNodes.length - 1; i >= downTo; i--) {
+ var node = this.uncheckedNodes[i],
+ childKey = node.child.toString()
+
+ if (childKey in this.minimizedNodes) {
+ node.parent.edges[node.char] = this.minimizedNodes[childKey]
+ } else {
+ // Cache the key for this node since
+ // we know it can't change anymore
+ node.child._str = childKey
+
+ this.minimizedNodes[childKey] = node.child
+ }
+
+ this.uncheckedNodes.pop()
+ }
+}
+/*!
+ * lunr.Index
+ * Copyright (C) 2020 Oliver Nightingale
+ */
+
+/**
+ * An index contains the built index of all documents and provides a query interface
+ * to the index.
+ *
+ * Usually instances of lunr.Index will not be created using this constructor, instead
+ * lunr.Builder should be used to construct new indexes, or lunr.Index.load should be
+ * used to load previously built and serialized indexes.
+ *
+ * @constructor
+ * @param {Object} attrs - The attributes of the built search index.
+ * @param {Object} attrs.invertedIndex - An index of term/field to document reference.
+ * @param {Object' + noResultsText + '
'); + } +} + +function doSearch () { + var query = document.getElementById('mkdocs-search-query').value; + if (query.length > min_search_length) { + if (!window.Worker) { + displayResults(search(query)); + } else { + searchWorker.postMessage({query: query}); + } + } else { + // Clear results for short queries + displayResults([]); + } +} + +function initSearch () { + var search_input = document.getElementById('mkdocs-search-query'); + if (search_input) { + search_input.addEventListener("keyup", doSearch); + } + var term = getSearchTermFromLocation(); + if (term) { + search_input.value = term; + doSearch(); + } +} + +function onWorkerMessage (e) { + if (e.data.allowSearch) { + initSearch(); + } else if (e.data.results) { + var results = e.data.results; + displayResults(results); + } else if (e.data.config) { + min_search_length = e.data.config.min_search_length-1; + } +} + +if (!window.Worker) { + console.log('Web Worker API not supported'); + // load index in main thread + $.getScript(joinUrl(base_url, "search/worker.js")).done(function () { + console.log('Loaded worker'); + init(); + window.postMessage = function (msg) { + onWorkerMessage({data: msg}); + }; + }).fail(function (jqxhr, settings, exception) { + console.error('Could not load worker.js'); + }); +} else { + // Wrap search in a web worker + var searchWorker = new Worker(joinUrl(base_url, "search/worker.js")); + searchWorker.postMessage({init: true}); + searchWorker.onmessage = onWorkerMessage; +} diff --git a/search/search_index.json b/search/search_index.json new file mode 100644 index 0000000..ac130ec --- /dev/null +++ b/search/search_index.json @@ -0,0 +1 @@ +{"config":{"indexing":"full","lang":["en"],"min_search_length":3,"prebuild_index":false,"separator":"[\\s\\-]+"},"docs":[{"location":"index.html","text":"SMODERP2D \uf0c1 Distributed event-based model for surface a sheet runoff and for design of erosion control measure Welcome to the user guide for the SMODERP2D model. The aim of this text is to provide basic information to users on how to run the SMODERP2D model. @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ \\ \\ / / / \\ \\ / \\ / / / @ @ @ @ @ @ \\ _\\/ /_/ \\ \\/ \\/ /_____/ @ @ @ @ \\__/ \\ / _\\___/ @ @ @ \\____ \\/ / @ @ @ \\_____/______/ @ @ @ \\ @ @ @ \\___________________ @ @ @ @ @ @ @ The SMODERP2D model is designed to calculate hydrological and erosion processes on individual plots or small catchments. The outputs of the model are primarily used to determine runoff conditions in a catchment and obtain parameters for runoff and erosion control measures on agricultural land. Additionally, the model can assist in designing more complex systems, including sediment retention ponds, dry basins, or polders. Its use complies with current methods, technical standards, and recommended practices. The SMODERP2D model is open source project developed by the Department of Landscape Water Conservation, Faculty of Civil Engineering, Czech Technical University in Prague. Source code is licenced under GNU GPL and available from GitHub repository https://github.com/storm-fsv-cvut/smoderp2d . About model \uf0c1 Users \uf0c1 Model definition and simulated processes \uf0c1","title":"SMODERP2D"},{"location":"index.html#smoderp2d","text":"Distributed event-based model for surface a sheet runoff and for design of erosion control measure Welcome to the user guide for the SMODERP2D model. The aim of this text is to provide basic information to users on how to run the SMODERP2D model. @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ \\ \\ / / / \\ \\ / \\ / / / @ @ @ @ @ @ \\ _\\/ /_/ \\ \\/ \\/ /_____/ @ @ @ @ \\__/ \\ / _\\___/ @ @ @ \\____ \\/ / @ @ @ \\_____/______/ @ @ @ \\ @ @ @ \\___________________ @ @ @ @ @ @ @ The SMODERP2D model is designed to calculate hydrological and erosion processes on individual plots or small catchments. The outputs of the model are primarily used to determine runoff conditions in a catchment and obtain parameters for runoff and erosion control measures on agricultural land. Additionally, the model can assist in designing more complex systems, including sediment retention ponds, dry basins, or polders. Its use complies with current methods, technical standards, and recommended practices. The SMODERP2D model is open source project developed by the Department of Landscape Water Conservation, Faculty of Civil Engineering, Czech Technical University in Prague. Source code is licenced under GNU GPL and available from GitHub repository https://github.com/storm-fsv-cvut/smoderp2d .","title":"SMODERP2D"},{"location":"index.html#about-model","text":"","title":"About model"},{"location":"index.html#users","text":"","title":"Users"},{"location":"index.html#model-definition-and-simulated-processes","text":"","title":"Model definition and simulated processes"},{"location":"PK_structure.html","text":"User guide Introduction \uf0c1 Abut model \uf0c1 Users \uf0c1 Model definition and simulated processes \uf0c1 Requirements \uf0c1 Data types Model limits and recommendation \uf0c1 Providers ad sw implementation \uf0c1 Hardware requirements \uf0c1 Inpute data \uf0c1 surface flow \uf0c1 topologie \uf0c1 data types \uf0c1 resolution \uf0c1 Data source for Czechia region \uf0c1 CUZK data source description (may be in the future also descriptino how to get data from CUZK site types. land use \uf0c1 data types \uf0c1 Data source for Czechia region \uf0c1 ZABAGED data source description (may be in the future also descriptino how to get data from CUZK site ad categoraziton of data + LPIS data source and theirs combination) soil data \uf0c1 data types \uf0c1 Data source for Czechia region \uf0c1 soil texture a Ks values from rain.fsv.cvut.cz, link to paper aout initial condition or tables directli put here precipitation \uf0c1 data types and format \uf0c1 Data source for Czechia region \uf0c1 from rain.fsv.cvut.cz - description how get data in QG and HYDRORAIN-6H table data \uf0c1 data types \uf0c1 link to \"manual data\" channel flow \uf0c1 watercourses and canals \uf0c1 table data \uf0c1 Data source for Czechia region \uf0c1 ZABAGED watercourses ** dry channel ** Model computation setup \uf0c1 Modelated processes Outputs \uf0c1 Basic outputs \uf0c1 Raster data \uf0c1 Vector and point data \uf0c1 Hydrograph data \uf0c1 Advanced outputs \uf0c1 Control \uf0c1 Temp \uf0c1 Hydrograph data \uf0c1 Reference manual \uf0c1 here reference (processed manual) will be follow","title":"PK structure"},{"location":"PK_structure.html#introduction","text":"","title":"Introduction"},{"location":"PK_structure.html#abut-model","text":"","title":"Abut model"},{"location":"PK_structure.html#users","text":"","title":"Users"},{"location":"PK_structure.html#model-definition-and-simulated-processes","text":"","title":"Model definition and simulated processes"},{"location":"PK_structure.html#requirements","text":"Data types","title":"Requirements"},{"location":"PK_structure.html#model-limits-and-recommendation","text":"","title":"Model limits and recommendation"},{"location":"PK_structure.html#providers-ad-sw-implementation","text":"","title":"Providers ad sw implementation"},{"location":"PK_structure.html#hardware-requirements","text":"","title":"Hardware requirements"},{"location":"PK_structure.html#inpute-data","text":"","title":"Inpute data"},{"location":"PK_structure.html#surface-flow","text":"","title":"surface flow"},{"location":"PK_structure.html#topologie","text":"","title":"topologie"},{"location":"PK_structure.html#data-types","text":"","title":"data types"},{"location":"PK_structure.html#resolution","text":"","title":"resolution"},{"location":"PK_structure.html#data-source-for-czechia-region","text":"CUZK data source description (may be in the future also descriptino how to get data from CUZK site types.","title":"Data source for Czechia region"},{"location":"PK_structure.html#land-use","text":"","title":"land use"},{"location":"PK_structure.html#data-types_1","text":"","title":"data types"},{"location":"PK_structure.html#data-source-for-czechia-region_1","text":"ZABAGED data source description (may be in the future also descriptino how to get data from CUZK site ad categoraziton of data + LPIS data source and theirs combination)","title":"Data source for Czechia region"},{"location":"PK_structure.html#soil-data","text":"","title":"soil data"},{"location":"PK_structure.html#data-types_2","text":"","title":"data types"},{"location":"PK_structure.html#data-source-for-czechia-region_2","text":"soil texture a Ks values from rain.fsv.cvut.cz, link to paper aout initial condition or tables directli put here","title":"Data source for Czechia region"},{"location":"PK_structure.html#precipitation","text":"","title":"precipitation"},{"location":"PK_structure.html#data-types-and-format","text":"","title":"data types and format"},{"location":"PK_structure.html#data-source-for-czechia-region_3","text":"from rain.fsv.cvut.cz - description how get data in QG and HYDRORAIN-6H","title":"Data source for Czechia region"},{"location":"PK_structure.html#table-data","text":"","title":"table data"},{"location":"PK_structure.html#data-types_3","text":"link to \"manual data\"","title":"data types"},{"location":"PK_structure.html#channel-flow","text":"","title":"channel flow"},{"location":"PK_structure.html#watercourses-and-canals","text":"","title":"watercourses and canals"},{"location":"PK_structure.html#table-data_1","text":"","title":"table data"},{"location":"PK_structure.html#data-source-for-czechia-region_4","text":"ZABAGED watercourses ** dry channel **","title":"Data source for Czechia region"},{"location":"PK_structure.html#model-computation-setup","text":"Modelated processes","title":"Model computation setup"},{"location":"PK_structure.html#outputs","text":"","title":"Outputs"},{"location":"PK_structure.html#basic-outputs","text":"","title":"Basic outputs"},{"location":"PK_structure.html#raster-data","text":"","title":"Raster data"},{"location":"PK_structure.html#vector-and-point-data","text":"","title":"Vector and point data"},{"location":"PK_structure.html#hydrograph-data","text":"","title":"Hydrograph data"},{"location":"PK_structure.html#advanced-outputs","text":"","title":"Advanced outputs"},{"location":"PK_structure.html#control","text":"","title":"Control"},{"location":"PK_structure.html#temp","text":"","title":"Temp"},{"location":"PK_structure.html#hydrograph-data_1","text":"","title":"Hydrograph data"},{"location":"PK_structure.html#reference-manual","text":"here reference (processed manual) will be follow","title":"Reference manual"},{"location":"arcgis.html","text":"ArcGIS Pro Toolbox \uf0c1 Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque. Installation instructions \uf0c1 Download ArcGIS Pro: https://pro.arcgis.com/en/pro-app/latest/get-started/download-arcgis-pro.htm Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open ArcGIS Toolbox located in bin\\arcgis\\SMODERP2D.pyt","title":"ArcGIS Pro Toolbox"},{"location":"arcgis.html#arcgis-pro-toolbox","text":"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque.","title":"ArcGIS Pro Toolbox"},{"location":"arcgis.html#installation-instructions","text":"Download ArcGIS Pro: https://pro.arcgis.com/en/pro-app/latest/get-started/download-arcgis-pro.htm Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open ArcGIS Toolbox located in bin\\arcgis\\SMODERP2D.pyt","title":"Installation instructions"},{"location":"grass.html","text":"GRASS GIS Addon \uf0c1 Installation instructions \uf0c1 Install GRASS GIS: https://grass.osgeo.org/download/ Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open GRASS Addon located in bin/grass/r.smoderp2d/r.smoderp2d.py","title":"GRASS GIS Addon"},{"location":"grass.html#grass-gis-addon","text":"","title":"GRASS GIS Addon"},{"location":"grass.html#installation-instructions","text":"Install GRASS GIS: https://grass.osgeo.org/download/ Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open GRASS Addon located in bin/grass/r.smoderp2d/r.smoderp2d.py","title":"Installation instructions"},{"location":"input_data.html","text":"Input data \uf0c1 Input data are divided to two groups a) for surface runoff processes and b) stream flow Input data - surface flow \uf0c1 The inputes to the model incorporates information about the area's topography, soil types and land use spatial distribution, rainfall for surface ruonoff processes, where applicable, the geometry of hydrographic network for stream ruonff. Inputes are describe in goups (see the picture). Left are for QIGS, right for ArcGIS platform. . Data types of inputes data are descrime in table ** link to the tabel** Digital elevation model (Compulsory) \uf0c1 A digital elevation model (DEM) or digital terrain model (DTM) raster represents the morphology of the modelled area. Each cell in the raster contains information about the land elevation. The model numerical scheme spatial discrimination is inherited from the DEM layer cell size. The cell size can vary depending on the size of the modelled area. For the SMODERP2D model the stabile computation minimum cell size is recommended 2 meters, with an optimum of 5 meters. Cell size with total area are crucial parameters for computing time. Soil characteristics map (Compulsory) \uf0c1 Vector (polygon) layer with polygons indicating the spatial distribution of soil types. The figure shows a example of soil map layer. The attribute table of the layer must include field with soil type identifier. These identifiers correspond to unique soil and land use characteristics, which are stored in a separate table (see below). Physical meanings of these parameters and their implementation in the model are in detail described in the reference manual. For instance, in Czechia soil type data from agricultural land can be obtain via https://rain.fsv.cvut.cz/pudy . Land use / Land cover (Compulsory) \uf0c1 Similar to soils in the previous section, the attribute table of the land use **vector layer (polygon) ** requires supplementation with an identifier field for land use. These identifiers correspond to unique soil and land use characteristics, defined in a separate table (see below). Physical meanings of the land used parameters and their implementation in the model are in detail described in the reference manual. For instance, in Czechia soil type data from agricultural land can be obtain from combination of ZABAGED and LPIS data. Soil and landuse parameters table (Compulsory) \uf0c1 Another compulsory input is a table containing the values of individual soil type and land cover parameters. This table is referenced by combinations of soil type and land use type identifiers defined for each polygon in the attribute tables of the vector inputs. In the example below, the first column contains parameters for the combination of soil type CA and land cover ZP . The table may be inserted into the model as a text file (.csv). The meanings of the individual parameters are described in reference manual. soilveg k s nrill pi ppl ret b nsheet y tau v CAZP 1.26e-07 0.000125 0.0035 0 0 0 1.5847 0.0073 0.488872 100 0.28 Ranfall data \uf0c1 The next input is a file containing rainfall data. The rainfall is entered as a text file with two columns. The left column is the time interval in minutes, the right column is the cumulative total for the time interval in millimetres. Real measured or design precipitation data can be used in model. For instance, in Czechia design precipitation can be obtain via web map services https://rain.fsv.cvut.cz . Input data - stream flow \uf0c1 Data for the watercoures are also divided to topology part and data table with unique characteristics of segments Water course network (Optional) \uf0c1 Vector (polyline) layer with polylines indicating the thopology of watercourses and/or temporal ditches technical conservation measure). The figure shows a example of water courses data. The attribute table of the layer must include field with stream type. The watercourse network must be hydrologically correct. Individual end points of the watercourse network must have a different elevation taken from the DMR and at the same time bifurcation of the watercourse cannot be allowed. These identifiers correspond to unique stream characteristics, which are stored in a separate table (see below). Physical meanings of these parameters and their implementation in the model are in detail described in the reference manual. For instance, in Czechia stream shape data can be obtain from ZABAGED data. Water course table (Optional) \uf0c1 This table is referenced to unique stream types defined for each polygon in the attribute tables of the watercourse network inputs. In the example below, the first column contains parameters ** channel_ID ** for unioque stream part named. The table may be inserted into the model as a text file (.csv). The meanings of the individual parameters are described in reference manual. |\u0001\u0013\b |\u0001\u0013\b 11.12.10.0300default 1shape0 00.20.00.0350 2rectangle1 10.22.00.0350 3trapezoid1 20.02.00.0300 4triangle1 30.70.00.0300b.surface5parabola1 00.20.00.0350 6obdelnik1 10.22.00.0350 7lichobeznik1 20.02.00.0300 8trojuhelnik1\u001a Input data - other inputes and model settings \uf0c1 Points of interest (Optional) \uf0c1 Vector (point) layer with point for detail outputs as hydrographs (describe in outpust). In this points are indicating the thopology of watercourses and/or temporal ditches technical conservation measure). The monitored output data are continuously stored at these points. In the case of a point located outside the watercourse, surface runoff data are recorded. If the point is inserted into a watercourse, data are recorded for the relevant watercourse section.","title":"Input data"},{"location":"input_data.html#input-data","text":"Input data are divided to two groups a) for surface runoff processes and b) stream flow","title":"Input data"},{"location":"input_data.html#input-data-surface-flow","text":"The inputes to the model incorporates information about the area's topography, soil types and land use spatial distribution, rainfall for surface ruonoff processes, where applicable, the geometry of hydrographic network for stream ruonff. Inputes are describe in goups (see the picture). Left are for QIGS, right for ArcGIS platform. . Data types of inputes data are descrime in table ** link to the tabel**","title":"Input data - surface flow"},{"location":"input_data.html#digital-elevation-model-compulsory","text":"A digital elevation model (DEM) or digital terrain model (DTM) raster represents the morphology of the modelled area. Each cell in the raster contains information about the land elevation. The model numerical scheme spatial discrimination is inherited from the DEM layer cell size. The cell size can vary depending on the size of the modelled area. For the SMODERP2D model the stabile computation minimum cell size is recommended 2 meters, with an optimum of 5 meters. Cell size with total area are crucial parameters for computing time.","title":"Digital elevation model (Compulsory)"},{"location":"input_data.html#soil-characteristics-map-compulsory","text":"Vector (polygon) layer with polygons indicating the spatial distribution of soil types. The figure shows a example of soil map layer. The attribute table of the layer must include field with soil type identifier. These identifiers correspond to unique soil and land use characteristics, which are stored in a separate table (see below). Physical meanings of these parameters and their implementation in the model are in detail described in the reference manual. For instance, in Czechia soil type data from agricultural land can be obtain via https://rain.fsv.cvut.cz/pudy .","title":"Soil characteristics map (Compulsory)"},{"location":"input_data.html#land-use-land-cover-compulsory","text":"Similar to soils in the previous section, the attribute table of the land use **vector layer (polygon) ** requires supplementation with an identifier field for land use. These identifiers correspond to unique soil and land use characteristics, defined in a separate table (see below). Physical meanings of the land used parameters and their implementation in the model are in detail described in the reference manual. For instance, in Czechia soil type data from agricultural land can be obtain from combination of ZABAGED and LPIS data.","title":"Land use / Land cover (Compulsory)"},{"location":"input_data.html#soil-and-landuse-parameters-table-compulsory","text":"Another compulsory input is a table containing the values of individual soil type and land cover parameters. This table is referenced by combinations of soil type and land use type identifiers defined for each polygon in the attribute tables of the vector inputs. In the example below, the first column contains parameters for the combination of soil type CA and land cover ZP . The table may be inserted into the model as a text file (.csv). The meanings of the individual parameters are described in reference manual. soilveg k s nrill pi ppl ret b nsheet y tau v CAZP 1.26e-07 0.000125 0.0035 0 0 0 1.5847 0.0073 0.488872 100 0.28","title":"Soil and landuse parameters table (Compulsory)"},{"location":"input_data.html#ranfall-data","text":"The next input is a file containing rainfall data. The rainfall is entered as a text file with two columns. The left column is the time interval in minutes, the right column is the cumulative total for the time interval in millimetres. Real measured or design precipitation data can be used in model. For instance, in Czechia design precipitation can be obtain via web map services https://rain.fsv.cvut.cz .","title":"Ranfall data"},{"location":"input_data.html#input-data-stream-flow","text":"Data for the watercoures are also divided to topology part and data table with unique characteristics of segments","title":"Input data - stream flow"},{"location":"input_data.html#water-course-network-optional","text":"Vector (polyline) layer with polylines indicating the thopology of watercourses and/or temporal ditches technical conservation measure). The figure shows a example of water courses data. The attribute table of the layer must include field with stream type. The watercourse network must be hydrologically correct. Individual end points of the watercourse network must have a different elevation taken from the DMR and at the same time bifurcation of the watercourse cannot be allowed. These identifiers correspond to unique stream characteristics, which are stored in a separate table (see below). Physical meanings of these parameters and their implementation in the model are in detail described in the reference manual. For instance, in Czechia stream shape data can be obtain from ZABAGED data.","title":"Water course network (Optional)"},{"location":"input_data.html#water-course-table-optional","text":"This table is referenced to unique stream types defined for each polygon in the attribute tables of the watercourse network inputs. In the example below, the first column contains parameters ** channel_ID ** for unioque stream part named. The table may be inserted into the model as a text file (.csv). The meanings of the individual parameters are described in reference manual. |\u0001\u0013\b |\u0001\u0013\b 11.12.10.0300default 1shape0 00.20.00.0350 2rectangle1 10.22.00.0350 3trapezoid1 20.02.00.0300 4triangle1 30.70.00.0300b.surface5parabola1 00.20.00.0350 6obdelnik1 10.22.00.0350 7lichobeznik1 20.02.00.0300 8trojuhelnik1\u001a","title":"Water course table (Optional)"},{"location":"input_data.html#input-data-other-inputes-and-model-settings","text":"","title":"Input data - other inputes and model settings"},{"location":"input_data.html#points-of-interest-optional","text":"Vector (point) layer with point for detail outputs as hydrographs (describe in outpust). In this points are indicating the thopology of watercourses and/or temporal ditches technical conservation measure). The monitored output data are continuously stored at these points. In the case of a point located outside the watercourse, surface runoff data are recorded. If the point is inserted into a watercourse, data are recorded for the relevant watercourse section.","title":"Points of interest (Optional)"},{"location":"model_setup.html","text":"Model settings \uf0c1 Maximum time step \uf0c1 initial time step \u0394t is the value in seconds. The input parameter is the maximum time step. The time step \u0394t is adjusted during the calculation according to the numerical stability condition to maintain numerical stability. The length of the time step depends on the surface runoff velocity and the spatial step size (DMT cell size). The maximum time step depends on the desired detail of the output data, especially during a precipitation episode when flow velocities are already lower and when the stabiliti criterion would allow too large a time step. The implementation of the numerical stability are described in reference manual. Total runnig time \uf0c1 Output directory \uf0c1 D8/MFDA \uf0c1","title":"Model settings"},{"location":"model_setup.html#model-settings","text":"","title":"Model settings"},{"location":"model_setup.html#maximum-time-step","text":"initial time step \u0394t is the value in seconds. The input parameter is the maximum time step. The time step \u0394t is adjusted during the calculation according to the numerical stability condition to maintain numerical stability. The length of the time step depends on the surface runoff velocity and the spatial step size (DMT cell size). The maximum time step depends on the desired detail of the output data, especially during a precipitation episode when flow velocities are already lower and when the stabiliti criterion would allow too large a time step. The implementation of the numerical stability are described in reference manual.","title":"Maximum time step"},{"location":"model_setup.html#total-runnig-time","text":"","title":"Total runnig time"},{"location":"model_setup.html#output-directory","text":"","title":"Output directory"},{"location":"model_setup.html#d8mfda","text":"","title":"D8/MFDA"},{"location":"nic.html","text":"Nic \uf0c1 Nic \uf0c1 uplny_nic","title":"Nic"},{"location":"nic.html#nic","text":"","title":"Nic"},{"location":"nic.html#nic_1","text":"uplny_nic","title":"Nic"},{"location":"output.html","text":"Outputs \uf0c1 Basic outputs \uf0c1 Raster data \uf0c1 Vector and point data \uf0c1 Hydrograph data \uf0c1 Advanced outputs \uf0c1 Control \uf0c1 Temp \uf0c1 Hydrograph data \uf0c1","title":"Outputs"},{"location":"output.html#outputs","text":"","title":"Outputs"},{"location":"output.html#basic-outputs","text":"","title":"Basic outputs"},{"location":"output.html#raster-data","text":"","title":"Raster data"},{"location":"output.html#vector-and-point-data","text":"","title":"Vector and point data"},{"location":"output.html#hydrograph-data","text":"","title":"Hydrograph data"},{"location":"output.html#advanced-outputs","text":"","title":"Advanced outputs"},{"location":"output.html#control","text":"","title":"Control"},{"location":"output.html#temp","text":"","title":"Temp"},{"location":"output.html#hydrograph-data_1","text":"","title":"Hydrograph data"},{"location":"providers.html","text":"GIS providers and install \uf0c1 SMODERP2D model relies on a GIS software were the input and output data can be acquired, modified and visualized. Currently, SMODERP2D supports three GIS solutions: QGIS GRASS GIS ArcGIS Installation instructions \uf0c1 See specific instructions for QGIS , GRASS GIS and ArcGIS Pro for details In case you will run SMODERP2D without the above mentioned GIS solutions, the recommended installation procedure is based on PyPI: https://pypi.org/project/smoderp2d/ pip install smoderp2d","title":"GIS providers and install"},{"location":"providers.html#gis-providers-and-install","text":"SMODERP2D model relies on a GIS software were the input and output data can be acquired, modified and visualized. Currently, SMODERP2D supports three GIS solutions: QGIS GRASS GIS ArcGIS","title":"GIS providers and install"},{"location":"providers.html#installation-instructions","text":"See specific instructions for QGIS , GRASS GIS and ArcGIS Pro for details In case you will run SMODERP2D without the above mentioned GIS solutions, the recommended installation procedure is based on PyPI: https://pypi.org/project/smoderp2d/ pip install smoderp2d","title":"Installation instructions"},{"location":"qgis.html","text":"QGIS Plugin \uf0c1 Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque. Installation instructions \uf0c1 Install QGIS: https://www.qgis.org/en/site/forusers/download.html Install SMODERP2D plugin from QGIS plugin repository Open the plugin from the menu Plugins \u27a4 SMODERP2D or from the toolbar .","title":"QGIS Plugin"},{"location":"qgis.html#qgis-plugin","text":"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque.","title":"QGIS Plugin"},{"location":"qgis.html#installation-instructions","text":"Install QGIS: https://www.qgis.org/en/site/forusers/download.html Install SMODERP2D plugin from QGIS plugin repository Open the plugin from the menu Plugins \u27a4 SMODERP2D or from the toolbar .","title":"Installation instructions"},{"location":"recom.html","text":"Providers \uf0c1 QGIS Plugin \uf0c1 Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque. Installation instructions \uf0c1 Install QGIS: https://www.qgis.org/en/site/forusers/download.html Install SMODERP2D plugin from QGIS plugin repository Open the plugin from the menu Plugins \u27a4 SMODERP2D or from the toolbar . GRASS GIS Addon \uf0c1 Installation instructions \uf0c1 Install GRASS GIS: https://grass.osgeo.org/download/ Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open GRASS Addon located in bin/grass/r.smoderp2d/r.smoderp2d.py ArcGIS Pro Toolbox \uf0c1 Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque. Installation instructions \uf0c1 Download ArcGIS Pro: https://pro.arcgis.com/en/pro-app/latest/get-started/download-arcgis-pro.htm Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open ArcGIS Toolbox located in bin\\arcgis\\SMODERP2D.pyt","title":"Providers"},{"location":"recom.html#providers","text":"","title":"Providers"},{"location":"recom.html#qgis-plugin","text":"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque.","title":"QGIS Plugin"},{"location":"recom.html#installation-instructions","text":"Install QGIS: https://www.qgis.org/en/site/forusers/download.html Install SMODERP2D plugin from QGIS plugin repository Open the plugin from the menu Plugins \u27a4 SMODERP2D or from the toolbar .","title":"Installation instructions"},{"location":"recom.html#grass-gis-addon","text":"","title":"GRASS GIS Addon"},{"location":"recom.html#installation-instructions_1","text":"Install GRASS GIS: https://grass.osgeo.org/download/ Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open GRASS Addon located in bin/grass/r.smoderp2d/r.smoderp2d.py","title":"Installation instructions"},{"location":"recom.html#arcgis-pro-toolbox","text":"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis vehicula tempus nunc a vulputate. Cras mauris ligula, ultrices facilisis diam quis, condimentum convallis magna. Duis bibendum sapien ac mi tristique volutpat. Morbi dolor mi, commodo consectetur ligula id, laoreet porttitor sapien. Nam aliquet posuere ex eget tincidunt. Praesent vehicula erat lorem. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aenean sit amet elit ac velit placerat blandit dictum faucibus massa. Integer sed dui lectus. Aenean non fermentum enim, sed molestie diam. Cras mollis euismod arcu. Ut eu elit et eros aliquet elementum. Aenean semper, augue quis tempus dapibus, felis ligula sodales justo, sit amet vulputate turpis velit a lorem. Morbi auctor dignissim tincidunt. In hac habitasse platea dictumst. Morbi rhoncus imperdiet purus quis scelerisque.","title":"ArcGIS Pro Toolbox"},{"location":"recom.html#installation-instructions_2","text":"Download ArcGIS Pro: https://pro.arcgis.com/en/pro-app/latest/get-started/download-arcgis-pro.htm Download latest SMODERP2D version: https://github.com/storm-fsv-cvut/smoderp2d/releases Open ArcGIS Toolbox located in bin\\arcgis\\SMODERP2D.pyt","title":"Installation instructions"},{"location":"reference_manual.html","text":"Reference manual \uf0c1 will be as soon as possible, preprint version on https://github.com/storm-fsv-cvut/smoderp2d-manual .","title":"Reference manual"},{"location":"reference_manual.html#reference-manual","text":"will be as soon as possible, preprint version on https://github.com/storm-fsv-cvut/smoderp2d-manual .","title":"Reference manual"},{"location":"requirements.html","text":"Requirements \uf0c1 Data types Model limits and recommendation \uf0c1 Hardware requirements \uf0c1","title":"Requirements"},{"location":"requirements.html#requirements","text":"Data types","title":"Requirements"},{"location":"requirements.html#model-limits-and-recommendation","text":"","title":"Model limits and recommendation"},{"location":"requirements.html#hardware-requirements","text":"","title":"Hardware requirements"}]} \ No newline at end of file diff --git a/search/worker.js b/search/worker.js new file mode 100644 index 0000000..8628dbc --- /dev/null +++ b/search/worker.js @@ -0,0 +1,133 @@ +var base_path = 'function' === typeof importScripts ? '.' : '/search/'; +var allowSearch = false; +var index; +var documents = {}; +var lang = ['en']; +var data; + +function getScript(script, callback) { + console.log('Loading script: ' + script); + $.getScript(base_path + script).done(function () { + callback(); + }).fail(function (jqxhr, settings, exception) { + console.log('Error: ' + exception); + }); +} + +function getScriptsInOrder(scripts, callback) { + if (scripts.length === 0) { + callback(); + return; + } + getScript(scripts[0], function() { + getScriptsInOrder(scripts.slice(1), callback); + }); +} + +function loadScripts(urls, callback) { + if( 'function' === typeof importScripts ) { + importScripts.apply(null, urls); + callback(); + } else { + getScriptsInOrder(urls, callback); + } +} + +function onJSONLoaded () { + data = JSON.parse(this.responseText); + var scriptsToLoad = ['lunr.js']; + if (data.config && data.config.lang && data.config.lang.length) { + lang = data.config.lang; + } + if (lang.length > 1 || lang[0] !== "en") { + scriptsToLoad.push('lunr.stemmer.support.js'); + if (lang.length > 1) { + scriptsToLoad.push('lunr.multi.js'); + } + if (lang.includes("ja") || lang.includes("jp")) { + scriptsToLoad.push('tinyseg.js'); + } + for (var i=0; i < lang.length; i++) { + if (lang[i] != 'en') { + scriptsToLoad.push(['lunr', lang[i], 'js'].join('.')); + } + } + } + loadScripts(scriptsToLoad, onScriptsLoaded); +} + +function onScriptsLoaded () { + console.log('All search scripts loaded, building Lunr index...'); + if (data.config && data.config.separator && data.config.separator.length) { + lunr.tokenizer.separator = new RegExp(data.config.separator); + } + + if (data.index) { + index = lunr.Index.load(data.index); + data.docs.forEach(function (doc) { + documents[doc.location] = doc; + }); + console.log('Lunr pre-built index loaded, search ready'); + } else { + index = lunr(function () { + if (lang.length === 1 && lang[0] !== "en" && lunr[lang[0]]) { + this.use(lunr[lang[0]]); + } else if (lang.length > 1) { + this.use(lunr.multiLanguage.apply(null, lang)); // spread operator not supported in all browsers: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_operator#Browser_compatibility + } + this.field('title'); + this.field('text'); + this.ref('location'); + + for (var i=0; i < data.docs.length; i++) { + var doc = data.docs[i]; + this.add(doc); + documents[doc.location] = doc; + } + }); + console.log('Lunr index built, search ready'); + } + allowSearch = true; + postMessage({config: data.config}); + postMessage({allowSearch: allowSearch}); +} + +function init () { + var oReq = new XMLHttpRequest(); + oReq.addEventListener("load", onJSONLoaded); + var index_path = base_path + '/search_index.json'; + if( 'function' === typeof importScripts ){ + index_path = 'search_index.json'; + } + oReq.open("GET", index_path); + oReq.send(); +} + +function search (query) { + if (!allowSearch) { + console.error('Assets for search still loading'); + return; + } + + var resultDocuments = []; + var results = index.search(query); + for (var i=0; i < results.length; i++){ + var result = results[i]; + doc = documents[result.ref]; + doc.summary = doc.text.substring(0, 200); + resultDocuments.push(doc); + } + return resultDocuments; +} + +if( 'function' === typeof importScripts ) { + onmessage = function (e) { + if (e.data.init) { + init(); + } else if (e.data.query) { + postMessage({ results: search(e.data.query) }); + } else { + console.error("Worker - Unrecognized message: " + e); + } + }; +} diff --git a/sitemap.xml b/sitemap.xml new file mode 100644 index 0000000..c3e156a --- /dev/null +++ b/sitemap.xml @@ -0,0 +1,68 @@ + +