Buckets:
| import{s as B,n as F,o as G}from"../chunks/scheduler.505acc25.js";import{S as O,i as R,e as g,s as f,c as E,u as U,h as D,a as h,d as a,b as u,f as k,g as L,v as I,j as N,k as A,l as J,m as n,n as M,t as T,o as H,p as S}from"../chunks/index.821724d0.js";import{C as K,H as Q,E as V}from"../chunks/MermaidChart.svelte_svelte_type_style_lang.2b0b811a.js";import{C as W}from"../chunks/CourseFloatingBanner.a3154b9b.js";function X(q){let s,_,c,d,i,x,m,b,r,v,l,z='이제 다양한 NLP 작업을 처리하고 이에 대한 모델을 파인 튜닝하거나 사전 학습할 수 있습니다. <a href="https://huggingface.co/models" rel="nofollow">모델 허브</a>에서 커뮤니티와 결과를 공유하는 것을 잊지 마세요.',w,o,j="여러분이 얻은 지식으로 무엇을 구축할지 기대됩니다!",C,p,P,$,y;return i=new K({props:{containerStyle:"float: right; margin-left: 10px; display: inline-flex; position: relative; z-index: 10;"}}),m=new Q({props:{title:"2단원 완료!",local:"2단원-완료",headingTag:"h1"}}),r=new W({props:{chapter:8,classNames:"absolute z-10 right-0 top-0"}}),p=new V({props:{source:"https://github.com/huggingface/course/blob/main/chapters/ko/chapter8/6.mdx"}}),{c(){s=g("meta"),_=f(),c=g("p"),d=f(),E(i.$$.fragment),x=f(),E(m.$$.fragment),b=f(),E(r.$$.fragment),v=U(` | |
| 축하합니다. 코스의 두 번째 부분을 통과했습니다! 세 번째 소식을 열심히 준비 중이니 [뉴스레터](https://huggingface.curated.co/)를 구독하여 소식을 놓치지 않도록 하세요. | |
| `),l=g("p"),l.innerHTML=z,w=f(),o=g("p"),o.textContent=j,C=f(),E(p.$$.fragment),P=f(),$=g("p"),this.h()},l(t){const e=D("svelte-u9bgzb",document.head);s=h(e,"META",{name:!0,content:!0}),e.forEach(a),_=u(t),c=h(t,"P",{}),k(c).forEach(a),d=u(t),L(i.$$.fragment,t),x=u(t),L(m.$$.fragment,t),b=u(t),L(r.$$.fragment,t),v=I(t,` | |
| 축하합니다. 코스의 두 번째 부분을 통과했습니다! 세 번째 소식을 열심히 준비 중이니 [뉴스레터](https://huggingface.curated.co/)를 구독하여 소식을 놓치지 않도록 하세요. | |
| `),l=h(t,"P",{"data-svelte-h":!0}),N(l)!=="svelte-12pmjgq"&&(l.innerHTML=z),w=u(t),o=h(t,"P",{"data-svelte-h":!0}),N(o)!=="svelte-q0ylnu"&&(o.textContent=j),C=u(t),L(p.$$.fragment,t),P=u(t),$=h(t,"P",{}),k($).forEach(a),this.h()},h(){A(s,"name","hf:doc:metadata"),A(s,"content",Y)},m(t,e){J(document.head,s),n(t,_,e),n(t,c,e),n(t,d,e),M(i,t,e),n(t,x,e),M(m,t,e),n(t,b,e),M(r,t,e),n(t,v,e),n(t,l,e),n(t,w,e),n(t,o,e),n(t,C,e),M(p,t,e),n(t,P,e),n(t,$,e),y=!0},p:F,i(t){y||(T(i.$$.fragment,t),T(m.$$.fragment,t),T(r.$$.fragment,t),T(p.$$.fragment,t),y=!0)},o(t){H(i.$$.fragment,t),H(m.$$.fragment,t),H(r.$$.fragment,t),H(p.$$.fragment,t),y=!1},d(t){t&&(a(_),a(c),a(d),a(x),a(b),a(v),a(l),a(w),a(o),a(C),a(P),a($)),a(s),S(i,t),S(m,t),S(r,t),S(p,t)}}}const Y='{"title":"2단원 완료!","local":"2단원-완료","sections":[],"depth":1}';function Z(q){return G(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class st extends O{constructor(s){super(),R(this,s,Z,X,B,{})}}export{st as component}; | |
Xet Storage Details
- Size:
- 3.08 kB
- Xet hash:
- fa8803044452e06926bf3133b659bcab3469553426845cf1706786c3ab5e8fa4
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.