Buckets:
| import{s as B,n as G,o as O}from"../chunks/scheduler.37c15a92.js";import{S as R,i as U,g as f,s,r as L,A as D,h as $,f as a,c as r,j as q,u as M,x as E,k as F,y as I,a as n,v as T,d as j,t as y,w as A}from"../chunks/index.2bf4358c.js";import{C as J}from"../chunks/CourseFloatingBanner.6add7356.js";import{H as K,E as Q}from"../chunks/getInferenceSnippets.ebf8be91.js";function V(z){let i,g,h,_,l,v,o,b,u,N='Felicitări, ați ajuns la sfârșitul celei de-a doua părți a cursului! Lucrăm activ la cea de-a treia, așa că abonați-vă la <a href="https://huggingface.curated.co/" rel="nofollow">newsletter-ul</a> nostru pentru a vă asigura că nu îi ratați lansarea.',w,m,S='Ar trebui să puteți acum să abordați o gamă largă de sarcini NLP și să ajustați fin sau să preantrenați un model pe ele. Nu uitați să vă partajați rezultatele cu comunitatea pe <a href="https://huggingface.co/models" rel="nofollow">Model Hub</a>.',P,p,k="Abia așteptăm să vedem ce veți construi cu cunoștințele pe care le-ați câștigat!",x,c,C,d,H;return l=new K({props:{title:"Partea 2 completă!",local:"partea-2-completa",headingTag:"h1"}}),o=new J({props:{chapter:8,classNames:"absolute z-10 right-0 top-0"}}),c=new Q({props:{source:"https://github.com/huggingface/course/blob/main/chapters/rum/chapter8/6.mdx"}}),{c(){i=f("meta"),g=s(),h=f("p"),_=s(),L(l.$$.fragment),v=s(),L(o.$$.fragment),b=s(),u=f("p"),u.innerHTML=N,w=s(),m=f("p"),m.innerHTML=S,P=s(),p=f("p"),p.textContent=k,x=s(),L(c.$$.fragment),C=s(),d=f("p"),this.h()},l(e){const t=D("svelte-u9bgzb",document.head);i=$(t,"META",{name:!0,content:!0}),t.forEach(a),g=r(e),h=$(e,"P",{}),q(h).forEach(a),_=r(e),M(l.$$.fragment,e),v=r(e),M(o.$$.fragment,e),b=r(e),u=$(e,"P",{"data-svelte-h":!0}),E(u)!=="svelte-16dpqb0"&&(u.innerHTML=N),w=r(e),m=$(e,"P",{"data-svelte-h":!0}),E(m)!=="svelte-1xnk4w1"&&(m.innerHTML=S),P=r(e),p=$(e,"P",{"data-svelte-h":!0}),E(p)!=="svelte-1ru1o5o"&&(p.textContent=k),x=r(e),M(c.$$.fragment,e),C=r(e),d=$(e,"P",{}),q(d).forEach(a),this.h()},h(){F(i,"name","hf:doc:metadata"),F(i,"content",W)},m(e,t){I(document.head,i),n(e,g,t),n(e,h,t),n(e,_,t),T(l,e,t),n(e,v,t),T(o,e,t),n(e,b,t),n(e,u,t),n(e,w,t),n(e,m,t),n(e,P,t),n(e,p,t),n(e,x,t),T(c,e,t),n(e,C,t),n(e,d,t),H=!0},p:G,i(e){H||(j(l.$$.fragment,e),j(o.$$.fragment,e),j(c.$$.fragment,e),H=!0)},o(e){y(l.$$.fragment,e),y(o.$$.fragment,e),y(c.$$.fragment,e),H=!1},d(e){e&&(a(g),a(h),a(_),a(v),a(b),a(u),a(w),a(m),a(P),a(p),a(x),a(C),a(d)),a(i),A(l,e),A(o,e),A(c,e)}}}const W='{"title":"Partea 2 completă!","local":"partea-2-completa","sections":[],"depth":1}';function X(z){return O(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class ae extends R{constructor(i){super(),U(this,i,X,V,B,{})}}export{ae as component}; | |
Xet Storage Details
- Size:
- 2.78 kB
- Xet hash:
- 726c2cd8fc068fc499cfcd8ee68410316c8b8431cf445b93c4ddcbbeb3299678
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.