import{s as ht,n as ft,o as gt}from"../chunks/scheduler.53228c21.js";import{S as _t,i as vt,e as i,s as r,c as u,h as Mt,a as d,d as o,b as s,f as M,g as p,j as m,k as v,l as t,m as c,n as h,t as f,o as g,p as _}from"../chunks/index.100fac89.js";import{C as Dt}from"../chunks/CopyLLMTxtMenu.fb2ec027.js";import{D as S}from"../chunks/Docstring.86a664ae.js";import{H as Qe,E as St}from"../chunks/MermaidChart.svelte_svelte_type_style_lang.09d4dba9.js";function bt(Re){let b,ce,le,ue,L,pe,O,me,I,Xe='<code>EDMDPMSolverMultistepScheduler</code> is a <a href="https://huggingface.co/papers/2206.00364" rel="nofollow">Karras formulation</a> of <code>DPMSolverMultistepScheduler</code>, a multistep scheduler from <a href="https://huggingface.co/papers/2206.00927" rel="nofollow">DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps</a> and <a href="https://huggingface.co/papers/2211.01095" rel="nofollow">DPM-Solver++: Fast Solver for Guided Sampling of Diffusion Probabilistic Models</a> by Cheng Lu, Yuhao Zhou, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu.',he,H,et=`DPMSolver (and the improved version DPMSolver++) is a fast dedicated high-order solver for diffusion ODEs with convergence order guarantee. Empirically, DPMSolver sampling with only 20 steps can generate high-quality
samples, and it can generate quite good samples even in 10 steps.`,fe,q,ge,n,V,Ce,Y,tt=`Implements DPMSolverMultistepScheduler in EDM formulation as presented in Karras et al. 2022 [1].
<code>EDMDPMSolverMultistepScheduler</code> is a fast dedicated high-order solver for diffusion ODEs.`,Le,Z,rt=`[1] Karras, Tero, et al. “Elucidating the Design Space of Diffusion-Based Generative Models.”
<a href="https://huggingface.co/papers/2206.00364" rel="nofollow">https://huggingface.co/papers/2206.00364</a>`,Oe,Q,st=`This model inherits from <a href="/docs/diffusers/main/en/api/schedulers/overview#diffusers.SchedulerMixin">SchedulerMixin</a> and <a href="/docs/diffusers/main/en/api/configuration#diffusers.ConfigMixin">ConfigMixin</a>. Check the superclass documentation for the generic
methods the library implements for all schedulers such as loading and saving.`,Ie,D,z,He,R,ot=`Convert the model output to the corresponding type the DPMSolver/DPMSolver++ algorithm needs. DPM-Solver is
designed to discretize an integral of the noise prediction model, and DPM-Solver++ is designed to discretize an
integral of the data prediction model.`,qe,k,nt=`<p>&gt; The algorithm and model type are decoupled. You can use either DPMSolver or DPMSolver++ for both
noise &gt; prediction and data prediction models.</p>`,Ve,$,A,ze,X,it="One step for the first-order DPMSolver (equivalent to DDIM).",ke,T,N,Ae,ee,dt="One step for the second-order multistep DPMSolver.",Ne,y,F,Fe,te,lt="One step for the third-order multistep DPMSolver.",Be,P,B,Ue,re,at=`Ensures interchangeability with schedulers that need to scale the denoising model input depending on the
current timestep. Scales the denoising model input by <code>(sigma**2 + 1) ** 0.5</code> to match the Euler algorithm.`,je,E,U,Ge,se,ct="Sets the begin index for the scheduler. This function should be run from pipeline before the inference.",Ke,w,j,We,oe,ut="Sets the discrete timesteps used for the diffusion chain (to be run before inference).",Je,C,G,Ye,ne,pt=`Predict the sample from the previous timestep by reversing the SDE. This function propagates the sample with
the multistep DPMSolver.`,_e,K,ve,x,W,Ze,ie,mt="Base class for the output of a scheduler’s <code>step</code> function.",Me,J,De,ae,Se;return L=new Dt({props:{containerStyle:"float: right; margin-left: 10px; display: inline-flex; position: relative; z-index: 10;"}}),O=new Qe({props:{title:"EDMDPMSolverMultistepScheduler",local:"edmdpmsolvermultistepscheduler",headingTag:"h1"}}),q=new Qe({props:{title:"EDMDPMSolverMultistepScheduler",local:"diffusers.EDMDPMSolverMultistepScheduler",headingTag:"h2"}}),V=new S({props:{name:"class diffusers.EDMDPMSolverMultistepScheduler",anchor:"diffusers.EDMDPMSolverMultistepScheduler",parameters:[{name:"sigma_min",val:": float = 0.002"},{name:"sigma_max",val:": float = 80.0"},{name:"sigma_data",val:": float = 0.5"},{name:"sigma_schedule",val:": str = 'karras'"},{name:"num_train_timesteps",val:": int = 1000"},{name:"prediction_type",val:": str = 'epsilon'"},{name:"rho",val:": float = 7.0"},{name:"solver_order",val:": int = 2"},{name:"thresholding",val:": bool = False"},{name:"dynamic_thresholding_ratio",val:": float = 0.995"},{name:"sample_max_value",val:": float = 1.0"},{name:"algorithm_type",val:": str = 'dpmsolver++'"},{name:"solver_type",val:": str = 'midpoint'"},{name:"lower_order_final",val:": bool = True"},{name:"euler_at_final",val:": bool = False"},{name:"final_sigmas_type",val:": typing.Optional[str] = 'zero'"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_min",description:`<strong>sigma_min</strong> (<code>float</code>, <em>optional</em>, defaults to 0.002) &#x2014;
Minimum noise magnitude in the sigma schedule. This was set to 0.002 in the EDM paper [1]; a reasonable
range is [0, 10].`,name:"sigma_min"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_max",description:`<strong>sigma_max</strong> (<code>float</code>, <em>optional</em>, defaults to 80.0) &#x2014;
Maximum noise magnitude in the sigma schedule. This was set to 80.0 in the EDM paper [1]; a reasonable
range is [0.2, 80.0].`,name:"sigma_max"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_data",description:`<strong>sigma_data</strong> (<code>float</code>, <em>optional</em>, defaults to 0.5) &#x2014;
The standard deviation of the data distribution. This is set to 0.5 in the EDM paper [1].`,name:"sigma_data"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_schedule",description:`<strong>sigma_schedule</strong> (<code>str</code>, <em>optional</em>, defaults to <code>karras</code>) &#x2014;
Sigma schedule to compute the <code>sigmas</code>. By default, we the schedule introduced in the EDM paper
(<a href="https://huggingface.co/papers/2206.00364" rel="nofollow">https://huggingface.co/papers/2206.00364</a>). Other acceptable value is &#x201C;exponential&#x201D;. The exponential
schedule was incorporated in this model: <a href="https://huggingface.co/stabilityai/cosxl" rel="nofollow">https://huggingface.co/stabilityai/cosxl</a>.`,name:"sigma_schedule"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.num_train_timesteps",description:`<strong>num_train_timesteps</strong> (<code>int</code>, defaults to 1000) &#x2014;
The number of diffusion steps to train the model.`,name:"num_train_timesteps"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.solver_order",description:`<strong>solver_order</strong> (<code>int</code>, defaults to 2) &#x2014;
The DPMSolver order which can be <code>1</code> or <code>2</code> or <code>3</code>. It is recommended to use <code>solver_order=2</code> for guided
sampling, and <code>solver_order=3</code> for unconditional sampling.`,name:"solver_order"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.prediction_type",description:`<strong>prediction_type</strong> (<code>str</code>, defaults to <code>epsilon</code>, <em>optional</em>) &#x2014;
Prediction type of the scheduler function; can be <code>epsilon</code> (predicts the noise of the diffusion process),
<code>sample</code> (directly predicts the noisy sample<code>) or </code>v_prediction\` (see section 2.4 of <a href="https://imagen.research.google/video/paper.pdf" rel="nofollow">Imagen
Video</a> paper).`,name:"prediction_type"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.thresholding",description:`<strong>thresholding</strong> (<code>bool</code>, defaults to <code>False</code>) &#x2014;
Whether to use the &#x201C;dynamic thresholding&#x201D; method. This is unsuitable for latent-space diffusion models such
as Stable Diffusion.`,name:"thresholding"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.dynamic_thresholding_ratio",description:`<strong>dynamic_thresholding_ratio</strong> (<code>float</code>, defaults to 0.995) &#x2014;
The ratio for the dynamic thresholding method. Valid only when <code>thresholding=True</code>.`,name:"dynamic_thresholding_ratio"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sample_max_value",description:`<strong>sample_max_value</strong> (<code>float</code>, defaults to 1.0) &#x2014;
The threshold value for dynamic thresholding. Valid only when <code>thresholding=True</code> and
<code>algorithm_type=&quot;dpmsolver++&quot;</code>.`,name:"sample_max_value"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.algorithm_type",description:`<strong>algorithm_type</strong> (<code>str</code>, defaults to <code>dpmsolver++</code>) &#x2014;
Algorithm type for the solver; can be <code>dpmsolver++</code> or <code>sde-dpmsolver++</code>. The <code>dpmsolver++</code> type implements
the algorithms in the <a href="https://huggingface.co/papers/2211.01095" rel="nofollow">DPMSolver++</a> paper. It is recommended to
use <code>dpmsolver++</code> or <code>sde-dpmsolver++</code> with <code>solver_order=2</code> for guided sampling like in Stable Diffusion.`,name:"algorithm_type"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.solver_type",description:`<strong>solver_type</strong> (<code>str</code>, defaults to <code>midpoint</code>) &#x2014;
Solver type for the second-order solver; can be <code>midpoint</code> or <code>heun</code>. The solver type slightly affects the
sample quality, especially for a small number of steps. It is recommended to use <code>midpoint</code> solvers.`,name:"solver_type"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.lower_order_final",description:`<strong>lower_order_final</strong> (<code>bool</code>, defaults to <code>True</code>) &#x2014;
Whether to use lower-order solvers in the final steps. Only valid for &lt; 15 inference steps. This can
stabilize the sampling of DPMSolver for steps &lt; 15, especially for steps &lt;= 10.`,name:"lower_order_final"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.euler_at_final",description:`<strong>euler_at_final</strong> (<code>bool</code>, defaults to <code>False</code>) &#x2014;
Whether to use Euler&#x2019;s method in the final step. It is a trade-off between numerical stability and detail
richness. This can stabilize the sampling of the SDE variant of DPMSolver for small number of inference
steps, but sometimes may result in blurring.`,name:"euler_at_final"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.final_sigmas_type",description:`<strong>final_sigmas_type</strong> (<code>str</code>, defaults to <code>&quot;zero&quot;</code>) &#x2014;
The final <code>sigma</code> value for the noise schedule during the sampling process. If <code>&quot;sigma_min&quot;</code>, the final
sigma is the same as the last sigma in the training schedule. If <code>zero</code>, the final sigma is set to 0.`,name:"final_sigmas_type"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L28"}}),z=new S({props:{name:"convert_model_output",anchor:"diffusers.EDMDPMSolverMultistepScheduler.convert_model_output",parameters:[{name:"model_output",val:": Tensor"},{name:"sample",val:": Tensor = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.convert_model_output.model_output",description:`<strong>model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The direct output from the learned diffusion model.`,name:"model_output"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.convert_model_output.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L363",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The converted model output.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),A=new S({props:{name:"dpm_solver_first_order_update",anchor:"diffusers.EDMDPMSolverMultistepScheduler.dpm_solver_first_order_update",parameters:[{name:"model_output",val:": Tensor"},{name:"sample",val:": Tensor = None"},{name:"noise",val:": typing.Optional[torch.Tensor] = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.dpm_solver_first_order_update.model_output",description:`<strong>model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The direct output from the learned diffusion model.`,name:"model_output"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.dpm_solver_first_order_update.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L394",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The sample tensor at the previous timestep.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),N=new S({props:{name:"multistep_dpm_solver_second_order_update",anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_second_order_update",parameters:[{name:"model_output_list",val:": typing.List[torch.Tensor]"},{name:"sample",val:": Tensor = None"},{name:"noise",val:": typing.Optional[torch.Tensor] = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_second_order_update.model_output_list",description:`<strong>model_output_list</strong> (<code>List[torch.Tensor]</code>) &#x2014;
The direct outputs from learned diffusion model at current and latter timesteps.`,name:"model_output_list"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_second_order_update.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L432",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The sample tensor at the previous timestep.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),F=new S({props:{name:"multistep_dpm_solver_third_order_update",anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_third_order_update",parameters:[{name:"model_output_list",val:": typing.List[torch.Tensor]"},{name:"sample",val:": Tensor = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_third_order_update.model_output_list",description:`<strong>model_output_list</strong> (<code>List[torch.Tensor]</code>) &#x2014;
The direct outputs from learned diffusion model at current and latter timesteps.`,name:"model_output_list"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_third_order_update.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L503",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The sample tensor at the previous timestep.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),B=new S({props:{name:"scale_model_input",anchor:"diffusers.EDMDPMSolverMultistepScheduler.scale_model_input",parameters:[{name:"sample",val:": Tensor"},{name:"timestep",val:": typing.Union[float, torch.Tensor]"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.scale_model_input.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
The input sample.`,name:"sample"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.scale_model_input.timestep",description:`<strong>timestep</strong> (<code>int</code>, <em>optional</em>) &#x2014;
The current timestep in the diffusion chain.`,name:"timestep"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L209",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>A scaled input sample.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),U=new S({props:{name:"set_begin_index",anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_begin_index",parameters:[{name:"begin_index",val:": int = 0"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_begin_index.begin_index",description:`<strong>begin_index</strong> (<code>int</code>) &#x2014;
The begin index for the scheduler.`,name:"begin_index"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L167"}}),j=new S({props:{name:"set_timesteps",anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_timesteps",parameters:[{name:"num_inference_steps",val:": int = None"},{name:"device",val:": typing.Union[str, torch.device] = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_timesteps.num_inference_steps",description:`<strong>num_inference_steps</strong> (<code>int</code>) &#x2014;
The number of diffusion steps used when generating samples with a pre-trained model.`,name:"num_inference_steps"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_timesteps.device",description:`<strong>device</strong> (<code>str</code> or <code>torch.device</code>, <em>optional</em>) &#x2014;
The device to which the timesteps should be moved to. If <code>None</code>, the timesteps are not moved.`,name:"device"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L233"}}),G=new S({props:{name:"step",anchor:"diffusers.EDMDPMSolverMultistepScheduler.step",parameters:[{name:"model_output",val:": Tensor"},{name:"timestep",val:": typing.Union[int, torch.Tensor]"},{name:"sample",val:": Tensor"},{name:"generator",val:" = None"},{name:"return_dict",val:": bool = True"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.model_output",description:`<strong>model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The direct output from learned diffusion model.`,name:"model_output"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.timestep",description:`<strong>timestep</strong> (<code>int</code>) &#x2014;
The current discrete timestep in the diffusion chain.`,name:"timestep"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.generator",description:`<strong>generator</strong> (<code>torch.Generator</code>, <em>optional</em>) &#x2014;
A random number generator.`,name:"generator"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.return_dict",description:`<strong>return_dict</strong> (<code>bool</code>) &#x2014;
Whether or not to return a <a href="/docs/diffusers/main/en/api/schedulers/pndm#diffusers.schedulers.scheduling_utils.SchedulerOutput">SchedulerOutput</a> or <code>tuple</code>.`,name:"return_dict"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L590",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>If return_dict is <code>True</code>, <a
  href="/docs/diffusers/main/en/api/schedulers/pndm#diffusers.schedulers.scheduling_utils.SchedulerOutput"
>SchedulerOutput</a> is returned, otherwise a
tuple is returned where the first element is the sample tensor.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><a
  href="/docs/diffusers/main/en/api/schedulers/pndm#diffusers.schedulers.scheduling_utils.SchedulerOutput"
>SchedulerOutput</a> or <code>tuple</code></p>
`}}),K=new Qe({props:{title:"SchedulerOutput",local:"diffusers.schedulers.scheduling_utils.SchedulerOutput",headingTag:"h2"}}),W=new S({props:{name:"class diffusers.schedulers.scheduling_utils.SchedulerOutput",anchor:"diffusers.schedulers.scheduling_utils.SchedulerOutput",parameters:[{name:"prev_sample",val:": Tensor"}],parametersDescription:[{anchor:"diffusers.schedulers.scheduling_utils.SchedulerOutput.prev_sample",description:`<strong>prev_sample</strong> (<code>torch.Tensor</code> of shape <code>(batch_size, num_channels, height, width)</code> for images) &#x2014;
Computed sample <code>(x_{t-1})</code> of previous timestep. <code>prev_sample</code> should be used as next model input in the
denoising loop.`,name:"prev_sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_utils.py#L62"}}),J=new St({props:{source:"https://github.com/huggingface/diffusers/blob/main/docs/source/en/api/schedulers/edm_multistep_dpm_solver.md"}}),{c(){b=i("meta"),ce=r(),le=i("p"),ue=r(),u(L.$$.fragment),pe=r(),u(O.$$.fragment),me=r(),I=i("p"),I.innerHTML=Xe,he=r(),H=i("p"),H.textContent=et,fe=r(),u(q.$$.fragment),ge=r(),n=i("div"),u(V.$$.fragment),Ce=r(),Y=i("p"),Y.innerHTML=tt,Le=r(),Z=i("p"),Z.innerHTML=rt,Oe=r(),Q=i("p"),Q.innerHTML=st,Ie=r(),D=i("div"),u(z.$$.fragment),He=r(),R=i("p"),R.textContent=ot,qe=r(),k=i("blockquote"),k.innerHTML=nt,Ve=r(),$=i("div"),u(A.$$.fragment),ze=r(),X=i("p"),X.textContent=it,ke=r(),T=i("div"),u(N.$$.fragment),Ae=r(),ee=i("p"),ee.textContent=dt,Ne=r(),y=i("div"),u(F.$$.fragment),Fe=r(),te=i("p"),te.textContent=lt,Be=r(),P=i("div"),u(B.$$.fragment),Ue=r(),re=i("p"),re.innerHTML=at,je=r(),E=i("div"),u(U.$$.fragment),Ge=r(),se=i("p"),se.textContent=ct,Ke=r(),w=i("div"),u(j.$$.fragment),We=r(),oe=i("p"),oe.textContent=ut,Je=r(),C=i("div"),u(G.$$.fragment),Ye=r(),ne=i("p"),ne.textContent=pt,_e=r(),u(K.$$.fragment),ve=r(),x=i("div"),u(W.$$.fragment),Ze=r(),ie=i("p"),ie.innerHTML=mt,Me=r(),u(J.$$.fragment),De=r(),ae=i("p"),this.h()},l(e){const l=Mt("svelte-u9bgzb",document.head);b=d(l,"META",{name:!0,content:!0}),l.forEach(o),ce=s(e),le=d(e,"P",{}),M(le).forEach(o),ue=s(e),p(L.$$.fragment,e),pe=s(e),p(O.$$.fragment,e),me=s(e),I=d(e,"P",{"data-svelte-h":!0}),m(I)!=="svelte-1ak0e1h"&&(I.innerHTML=Xe),he=s(e),H=d(e,"P",{"data-svelte-h":!0}),m(H)!=="svelte-l6rv24"&&(H.textContent=et),fe=s(e),p(q.$$.fragment,e),ge=s(e),n=d(e,"DIV",{class:!0});var a=M(n);p(V.$$.fragment,a),Ce=s(a),Y=d(a,"P",{"data-svelte-h":!0}),m(Y)!=="svelte-5b1txv"&&(Y.innerHTML=tt),Le=s(a),Z=d(a,"P",{"data-svelte-h":!0}),m(Z)!=="svelte-bibwfr"&&(Z.innerHTML=rt),Oe=s(a),Q=d(a,"P",{"data-svelte-h":!0}),m(Q)!=="svelte-linuuh"&&(Q.innerHTML=st),Ie=s(a),D=d(a,"DIV",{class:!0});var de=M(D);p(z.$$.fragment,de),He=s(de),R=d(de,"P",{"data-svelte-h":!0}),m(R)!=="svelte-1st02i8"&&(R.textContent=ot),qe=s(de),k=d(de,"BLOCKQUOTE",{class:!0,"data-svelte-h":!0}),m(k)!=="svelte-lwd2ft"&&(k.innerHTML=nt),de.forEach(o),Ve=s(a),$=d(a,"DIV",{class:!0});var be=M($);p(A.$$.fragment,be),ze=s(be),X=d(be,"P",{"data-svelte-h":!0}),m(X)!=="svelte-4nw43d"&&(X.textContent=it),be.forEach(o),ke=s(a),T=d(a,"DIV",{class:!0});var xe=M(T);p(N.$$.fragment,xe),Ae=s(xe),ee=d(xe,"P",{"data-svelte-h":!0}),m(ee)!=="svelte-1d6o6zu"&&(ee.textContent=dt),xe.forEach(o),Ne=s(a),y=d(a,"DIV",{class:!0});var $e=M(y);p(F.$$.fragment,$e),Fe=s($e),te=d($e,"P",{"data-svelte-h":!0}),m(te)!=="svelte-17nne8p"&&(te.textContent=lt),$e.forEach(o),Be=s(a),P=d(a,"DIV",{class:!0});var Te=M(P);p(B.$$.fragment,Te),Ue=s(Te),re=d(Te,"P",{"data-svelte-h":!0}),m(re)!=="svelte-1hew89w"&&(re.innerHTML=at),Te.forEach(o),je=s(a),E=d(a,"DIV",{class:!0});var ye=M(E);p(U.$$.fragment,ye),Ge=s(ye),se=d(ye,"P",{"data-svelte-h":!0}),m(se)!=="svelte-1k141rk"&&(se.textContent=ct),ye.forEach(o),Ke=s(a),w=d(a,"DIV",{class:!0});var Pe=M(w);p(j.$$.fragment,Pe),We=s(Pe),oe=d(Pe,"P",{"data-svelte-h":!0}),m(oe)!=="svelte-1vzm9q"&&(oe.textContent=ut),Pe.forEach(o),Je=s(a),C=d(a,"DIV",{class:!0});var Ee=M(C);p(G.$$.fragment,Ee),Ye=s(Ee),ne=d(Ee,"P",{"data-svelte-h":!0}),m(ne)!=="svelte-7jbjgx"&&(ne.textContent=pt),Ee.forEach(o),a.forEach(o),_e=s(e),p(K.$$.fragment,e),ve=s(e),x=d(e,"DIV",{class:!0});var we=M(x);p(W.$$.fragment,we),Ze=s(we),ie=d(we,"P",{"data-svelte-h":!0}),m(ie)!=="svelte-6ojmkw"&&(ie.innerHTML=mt),we.forEach(o),Me=s(e),p(J.$$.fragment,e),De=s(e),ae=d(e,"P",{}),M(ae).forEach(o),this.h()},h(){v(b,"name","hf:doc:metadata"),v(b,"content",xt),v(k,"class","tip"),v(D,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v($,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(T,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(y,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(P,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(E,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(w,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(C,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(n,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(x,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8")},m(e,l){t(document.head,b),c(e,ce,l),c(e,le,l),c(e,ue,l),h(L,e,l),c(e,pe,l),h(O,e,l),c(e,me,l),c(e,I,l),c(e,he,l),c(e,H,l),c(e,fe,l),h(q,e,l),c(e,ge,l),c(e,n,l),h(V,n,null),t(n,Ce),t(n,Y),t(n,Le),t(n,Z),t(n,Oe),t(n,Q),t(n,Ie),t(n,D),h(z,D,null),t(D,He),t(D,R),t(D,qe),t(D,k),t(n,Ve),t(n,$),h(A,$,null),t($,ze),t($,X),t(n,ke),t(n,T),h(N,T,null),t(T,Ae),t(T,ee),t(n,Ne),t(n,y),h(F,y,null),t(y,Fe),t(y,te),t(n,Be),t(n,P),h(B,P,null),t(P,Ue),t(P,re),t(n,je),t(n,E),h(U,E,null),t(E,Ge),t(E,se),t(n,Ke),t(n,w),h(j,w,null),t(w,We),t(w,oe),t(n,Je),t(n,C),h(G,C,null),t(C,Ye),t(C,ne),c(e,_e,l),h(K,e,l),c(e,ve,l),c(e,x,l),h(W,x,null),t(x,Ze),t(x,ie),c(e,Me,l),h(J,e,l),c(e,De,l),c(e,ae,l),Se=!0},p:ft,i(e){Se||(f(L.$$.fragment,e),f(O.$$.fragment,e),f(q.$$.fragment,e),f(V.$$.fragment,e),f(z.$$.fragment,e),f(A.$$.fragment,e),f(N.$$.fragment,e),f(F.$$.fragment,e),f(B.$$.fragment,e),f(U.$$.fragment,e),f(j.$$.fragment,e),f(G.$$.fragment,e),f(K.$$.fragment,e),f(W.$$.fragment,e),f(J.$$.fragment,e),Se=!0)},o(e){g(L.$$.fragment,e),g(O.$$.fragment,e),g(q.$$.fragment,e),g(V.$$.fragment,e),g(z.$$.fragment,e),g(A.$$.fragment,e),g(N.$$.fragment,e),g(F.$$.fragment,e),g(B.$$.fragment,e),g(U.$$.fragment,e),g(j.$$.fragment,e),g(G.$$.fragment,e),g(K.$$.fragment,e),g(W.$$.fragment,e),g(J.$$.fragment,e),Se=!1},d(e){e&&(o(ce),o(le),o(ue),o(pe),o(me),o(I),o(he),o(H),o(fe),o(ge),o(n),o(_e),o(ve),o(x),o(Me),o(De),o(ae)),o(b),_(L,e),_(O,e),_(q,e),_(V),_(z),_(A),_(N),_(F),_(B),_(U),_(j),_(G),_(K,e),_(W),_(J,e)}}}const xt='{"title":"EDMDPMSolverMultistepScheduler","local":"edmdpmsolvermultistepscheduler","sections":[{"title":"EDMDPMSolverMultistepScheduler","local":"diffusers.EDMDPMSolverMultistepScheduler","sections":[],"depth":2},{"title":"SchedulerOutput","local":"diffusers.schedulers.scheduling_utils.SchedulerOutput","sections":[],"depth":2}],"depth":1}';function $t(Re){return gt(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class Ct extends _t{constructor(b){super(),vt(this,b,$t,bt,ht,{})}}export{Ct as component};
