PageSourceSearch

https://taaghche.com/tmp/_next/static/chunks/8251.95712e3bbead6ae5.js

js taaghche.com collected 2026-09-24 09:19:41 UTC 3,785 bytes, 1 lines download raw bytes

1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[8251],{48251:function(e,o,t){"use strict";t.r(o);var l=t(85893),n=t(62688),a=t(11163),s=t(87447);o.default=e=>{let{isOpen:o,onClose:t,bookId:i}=e,d=(0,a.useRouter)();return(0,l.jsx)(n.Z,{text:(0,l.jsxs)("span",{children:["دوست عزیز",(0,l.jsx)("br",{}),"شنیدن کتاب‌‌های صوتی تنها از طریق برنامۀ ",s.Z.appNameFA," ","امکان پذیر می‌باشد."]}),isOpen:o,onClose:t,buttons:[{title:"ورود به برنامهٔ ".concat(s.Z.appNameFA),color:"green",isFilled:!1,onClick:()=>{let e=new Date().valueOf();setTimeout(()=>{new Date().valueOf()-e>100||d.push("/download")},25),window.location.href="taaghche://taaghche.com/book/".concat(i)}}]})}},80899:function(e,o,t){"use strict";t.d(o,{Z:function(){return r}});var l=t(85893),n=t(67294),a=t(73935),s=t(97163),i=t(67799),d=t(26299),c=t.n(d);class r extends n.PureComponent{componentDidMount(){"undefined"!=typeof document&&(this.modalRoot=document.body,this.modalRoot.appendChild(this.el),this.props.isOpen&&(document.body.style.overflow="hidden",this.setBodyOverflow=!0))}componentDidUpdate(e){"undefined"!=typeof document&&(this.props.isOpen&&!e.isOpen?(document.body.style.overflow="hidden",this.setBodyOverflow=!0):!this.props.isOpen&&e.isOpen&&this.setBodyOverflow&&(document.body.style.overflow="auto",this.setBodyOverflow=!1))}componentWillUnmount(){this.modalRoot.removeChild(this.el),document.body.style.overflow="auto"}render(){let{isOpen:e,isfull:o,children:t,forArticle:n=!1}=this.props;return e?n?(0,l.jsx)("div",{children:o?(0,l.jsx)("div",{className:c().back,onClick:this.handleBackdropClick,children:t}):(0,l.jsx)("div",{className:"".concat(c().overlay),onClick:this.handleBackdropClick,children:t})}):(0,a.createPortal)((0,l.jsx)("div",{children:o?(0,l.jsx)("div",{className:c().back,onClick:this.handleBackdropClick,children:t}):(0,l.jsx)("div",{className:"".concat(c().overlay," ").concat(this.context===i.Q2.dark?c().dark:""),onClick:this.handleBackdropClick,children:t})}),this.el):null}constructor(e){super(e),this.modalRoot=null,this.setBodyOverflow=!1,this.handleBackdropClick=e=>{var o;if(e.target!==e.currentTarget)return;let t=null!==(o=this.props.onClickOverlay)&&void 0!==o?o:this.props.closeModal;null==t||t()},this.el="undefined"!=typeof document?document.createElement("div"):{}}}r.contextType=s.Ni},62688:function(e,o,t){"use strict";var l=t(85893),n=t(80899),a=t(6398),s=t.n(a);let i={orange:{btn:"#F07000",txt:"#FFFFFF"},red:{btn:"#e51c22",txt:"#FFFFFF"},green:{btn:"var(--tg-brand)",txt:"#FFFFFF"},gray:{btn:"#E9E9EA",txt:"#212121"}};o.Z=e=>{let{isOpen:o,onClose:t,text:a,buttons:d}=e;return(0,l.jsx)(n.Z,{isOpen:o,isfull:!1,closeModal:t,children:(0,l.jsxs)("div",{className:s().modal,children:[(0,l.jsx)("span",{className:s().close,onClick:()=>t()}),(0,l.jsx)("div",{className:s().text,children:a}),(0,l.jsx)("div",{className:s().buttonContainer,children:d.map(e=>(0,l.jsx)("button",{style:{color:e.isFilled?i[e.color].txt:i[e.color].btn,backgroundColor:e.isFilled?i[e.color].btn:"transparent",border:e.isFilled?"none":"1px solid ".concat(i[e.color].btn),pointerEvents:e.isDisabled?"none":"all"},disabled:e.isDisabled,className:s().modalBtn,onClick:()=>e.onClick(),children:e.title},e.title))})]})})}},26299:function(e){e.exports={back:"modal_back__6USx7",BackFlash:"modal_BackFlash__b92aa",overlay:"modal_overlay__MR62_",OverlayFlash:"modal_OverlayFlash__9gYzB",content:"modal_content__ChqFp",OverlayFlashDark:"modal_OverlayFlashDark__H8t0a",dark:"modal_dark__Q7Thb"}},6398:function(e){e.exports={close:"simpleModal_close__xloka",modal:"simpleModal_modal__e9bcZ",text:"simpleModal_text__ugeRA",buttonContainer:"simpleModal_buttonContainer__iVj44",modalBtn:"simpleModal_modalBtn__lORKv"}}}]);

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.