1import{S as d,i as b,s as g,C as w,a as h,c as y,b as k,g as l,d as c,f as v,D as B,E as P,F as C,h as E,I,y as M,z as S,A as q,B as z,v as A}from"../chunks/index.3b539184.js";import{p as D}from"../chunks/stores.4580d5b4.js";import{P as F}from"../chunks/PreviewBanner.62d9bebc.js";function p(a){let s,o;return s=new F({props:{embedded:a[1]}}),{c(){M(s.$$.fragment)},l(e){S(s.$$.fragment,e)},m(e,r){q(s,e,r),o=!0},p(e,r){const n={};r&2&&(n.embedded=e[1]),s.$set(n)},i(e){o||(l(s.$$.fragment,e),o=!0)},o(e){c(s.$$.fragment,e),o=!1},d(e){z(s,e)}}}function L(a){let s,o,e=a[0]&&p(a);const r=a[6].default,n=w(r,a,a[5],null);return{c(){e&&e.c(),s=h(),n&&n.c()},l(t){e&&e.l(t),s=y(t),n&&n.l(t)},m(t,i){e&&e.m(t,i),k(t,s,i),n&&n.m(t,i),o=!0},p(t,[i]){t[0]?e?(e.p(t,i),i&1&&l(e,1)):(e=p(t),e.c(),l(e,1),e.m(s.parentNode,s)):e&&(A(),c(e,1,1,()=>{e=null}),v()),n&&n.p&&(!o||i&32)&&B(n,r,t,t[5],o?C(r,t[5],i,null):P(t[5]),null)},i(t){o||(l(e),l(n,t),o=!0)},o(t){c(e),c(n,t),o=!1},d(t){e&&e.d(t),t&&E(s),n&&n.d(t)}}}function N(a,s,o){let e,r,n,t;I(a,D,f=>o(4,t=f));let{$$slots:i={},$$scope:m}=s,{data:u}=s;const _=["/docs/(app)/posts/[slug]"];return a.$$set=f=>{"data"in f&&o(2,u=f.data),"$$scope"in f&&o(5,m=f.$$scope)},a.$$.update=()=>{a.$$.dirty&4&&o(3,{previewMode:e,previewModeEmbed:r}=u,e,(o(1,r),o(2,u))),a.$$.dirty&24&&o(0,n=e&&_.includes(t.route.id||""))},[n,r,u,e,t,m,i]}class H extends d{constructor(s){super(),b(this,s,N,L,g,{data:2})}}export{H as component};
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.