Buckets:

rtrm's picture
download
raw
3 kB
import{s as z,n as F,o as J}from"../chunks/scheduler.852ec091.js";import{S as R,i as W,g as h,s,r as H,A as Y,h as d,f as i,c as l,j as B,u as C,x as A,k as Q,y as D,a as n,v as j,d as E,t as k,w as I}from"../chunks/index.28275fd3.js";import{C as K}from"../chunks/CodeBlock.c866bcf2.js";import{H as q,E as N}from"../chunks/index.6348f961.js";function V(S){let a,g,$,_,o,w,m,G="<em>WIP: Still incomplete… Community contributions would be greatly welcome!</em>",M,r,O="This is an overview of the <code>bnb.functional</code> API in <code>bitsandbytes</code> that we think would also be useful as standalone entities.",x,p,v,u,U="For straight Int8 matrix multiplication without mixed precision decomposition you can use <code>bnb.matmul(...)</code>. To enable mixed precision decomposition, use the threshold parameter:",y,c,P,f,T,b,L;return o=new q({props:{title:"Other algorithms",local:"other-algorithms",headingTag:"h1"}}),p=new q({props:{title:"Using Int8 Matrix Multiplication",local:"using-int8-matrix-multiplication",headingTag:"h2"}}),c=new K({props:{code:"Ym5iLm1hdG11bCguLi4lMkMlMjB0aHJlc2hvbGQlM0Q2LjAp",highlighted:'bnb.matmul(..., threshold=<span class="hljs-number">6.0</span>)',wrap:!1}}),f=new N({props:{source:"https://github.com/bitsandbytes-foundation/bitsandbytes/blob/main/docs/source/algorithms.mdx"}}),{c(){a=h("meta"),g=s(),$=h("p"),_=s(),H(o.$$.fragment),w=s(),m=h("p"),m.innerHTML=G,M=s(),r=h("p"),r.innerHTML=O,x=s(),H(p.$$.fragment),v=s(),u=h("p"),u.innerHTML=U,y=s(),H(c.$$.fragment),P=s(),H(f.$$.fragment),T=s(),b=h("p"),this.h()},l(t){const e=Y("svelte-u9bgzb",document.head);a=d(e,"META",{name:!0,content:!0}),e.forEach(i),g=l(t),$=d(t,"P",{}),B($).forEach(i),_=l(t),C(o.$$.fragment,t),w=l(t),m=d(t,"P",{"data-svelte-h":!0}),A(m)!=="svelte-107u62y"&&(m.innerHTML=G),M=l(t),r=d(t,"P",{"data-svelte-h":!0}),A(r)!=="svelte-1sl20j8"&&(r.innerHTML=O),x=l(t),C(p.$$.fragment,t),v=l(t),u=d(t,"P",{"data-svelte-h":!0}),A(u)!=="svelte-1w1fpjt"&&(u.innerHTML=U),y=l(t),C(c.$$.fragment,t),P=l(t),C(f.$$.fragment,t),T=l(t),b=d(t,"P",{}),B(b).forEach(i),this.h()},h(){Q(a,"name","hf:doc:metadata"),Q(a,"content",X)},m(t,e){D(document.head,a),n(t,g,e),n(t,$,e),n(t,_,e),j(o,t,e),n(t,w,e),n(t,m,e),n(t,M,e),n(t,r,e),n(t,x,e),j(p,t,e),n(t,v,e),n(t,u,e),n(t,y,e),j(c,t,e),n(t,P,e),j(f,t,e),n(t,T,e),n(t,b,e),L=!0},p:F,i(t){L||(E(o.$$.fragment,t),E(p.$$.fragment,t),E(c.$$.fragment,t),E(f.$$.fragment,t),L=!0)},o(t){k(o.$$.fragment,t),k(p.$$.fragment,t),k(c.$$.fragment,t),k(f.$$.fragment,t),L=!1},d(t){t&&(i(g),i($),i(_),i(w),i(m),i(M),i(r),i(x),i(v),i(u),i(y),i(P),i(T),i(b)),i(a),I(o,t),I(p,t),I(c,t),I(f,t)}}}const X='{"title":"Other algorithms","local":"other-algorithms","sections":[{"title":"Using Int8 Matrix Multiplication","local":"using-int8-matrix-multiplication","sections":[],"depth":2}],"depth":1}';function Z(S){return J(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class at extends R{constructor(a){super(),W(this,a,Z,V,z,{})}}export{at as component};

Xet Storage Details

Size:
3 kB
·
Xet hash:
78c039188ebe59578bf5b9ce2b6e7a545034b1339405f6efa147d8a1fd35cb48

Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.