PageSourceSearch

https://www.prittworld.co.uk/etc.clientlibs/heliux/clientlibs/publ…-166bc029eed50ab333d12e27a5ef4004-lc.min.js

js prittworld.co.uk collected 2026-10-08 11:06:23 UTC 3,657 bytes, 1 lines download raw bytes

1"use strict";(self.heliuxModules=self.heliuxModules||[]).push([[9686],{92815(t,n,e){var i=e(23029),s=e(49530),o=e(50388),a=e(53954),r=e(85501),l=e(31526);const c={selectors:{shownItems:".searchpagination__shownItems",totalItems:".searchpagination__totalItems",progress:".searchpagination__progress",button:".searchpagination__button",content:".searchpagination__content",skeleton:".searchpagination__skeleton",lazyScrollingSpinner:".searchpagination__lazyScrollingSpinner"},publishes:{loadMoreClicked:"searchpagination::loadmore::clicked",showSpinner:t=>`spinner:${t}:show`,hideSpinner:t=>`spinner:${t}:hide`},subscribes:{lodadMoreUpdated:"searchpagination::loadmore::update"},states:{disabled:"disabled"},classes:{paginationContentHidden:"searchpagination__content--hidden",paginationSkeletonHidden:"searchpagination__skeleton--hidden"}};function h(t,n,e){return n=(0,a.A)(n),(0,o.A)(t,d()?Reflect.construct(n,e||[],(0,a.A)(t).constructor):n.apply(t,e))}function d(){try{var t=!Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],function(){}))}catch(t){}return(d=function(){return!!t})()}let u=function(t){function n(){return(0,i.A)(this,n),h(this,n,arguments)}return(0,r.A)(n,t),(0,s.A)(n,[{key:"init",value:function(){this.config={...c,...this.config},this.increasedBy=parseInt(this.config.increasedBy,10),this.lazyScrollingInProgress=!0,this.maxItemsReached=!1,this.getElements(),this.listeners()}},{key:"listeners",value:function(){const{lazyScrollingEnabled:t,subscribes:n}=this.config;(0,l.B1)(n.lodadMoreUpdated,({current:t,total:n,state:e,show:i,error:s})=>{this.updatePagination({current:t,total:n,state:e,show:i,error:s})}),t&&document.addEventListener("scroll",this.onScrolling.bind(this)),this.button&&this.button.addEventListener("click",this.onLoadMoreBtnClick.bind(this))}},{key:"onScrolling",value:function(){const{publishes:t}=this.config;if(this.maxItemsReached)return;const n=this.el.getBoundingClientRect().bottom,e=window.innerHeight+window.innerHeight;!this.lazyScrollingInProgress&&n>0&&n<=e&&(this.lazyScrollingInProgress=!0,(0,l.publish)(t.showSpinner(this.lazyScrollingSpinner?.id)),(0,l.publish)(t.loadMoreClicked,{increment:this.increasedBy,lazyScrolling:!0}))}},{key:"onLoadMoreBtnClick",value:function(){const{publishes:t}=this.config;(0,l.publish)(t.loadMoreClicked,{increment:this.increasedBy})}},{key:"updatePagination",value:function(t){const{lazyScrollingEnabled:n,publishes:e}=this.config;this.maxItemsReached=t.current===t.total,n&&(this.lazyScrollingInProgress=!1,(0,l.publish)(e.hideSpinner(this.lazyScrollingSpinner?.id))),this.button&&this.updateLoadMoreButtonInformation(t)}},{key:"updateLoadMoreButtonInformation",value:function({current:t,total:n,show:e,error:i}){let s=!1,o=t;o>=n&&(o=n,s=!0),this.updateLoadMoreButton(s);const a=0===n?0:o;(a||0===a)&&(this.shownItems.innerText=a,this.progress.value=a),(n||0===n)&&(this.totalItems.innerText=n,this.progress.max=n),e&&this.updateLoadMoreButtonVisibility(),i&&this.hideAllLoadMoreButtonContent()}},{key:"updateLoadMoreButton",value:function(t){t?this.button.setAttribute(this.config.states.disabled,""):this.button.removeAttribute(this.config.states.disabled)}},{key:"hideAllLoadMoreButtonContent",value:function(){this.skeleton.classList.add(this.config.classes.paginationSkeletonHidden),this.content.classList.add(this.config.classes.paginationContentHidden)}},{key:"updateLoadMoreButtonVisibility",value:function(){this.skeleton.classList.add(this.config.classes.paginationSkeletonHidden),this.content.classList.remove(this.config.classes.paginationContentHidden)}}])}(l.xu);(0,l.kz)({SearchPagination:u},0)}},t=>{t.O(0,[750],()=>t(92815)),t.O()}]);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.