import{s as mt,n as ht,o as ft}from"../chunks/scheduler.8c3d61f6.js";import{S as gt,i as _t,g as i,s as r,r as p,A as vt,h as a,f as t,c as o,j as v,u as m,x as u,k as b,y as s,a as l,v as h,d as f,t as g,w as _}from"../chunks/index.da70eac4.js";import{D as y}from"../chunks/Docstring.6b390b9a.js";import{H as Ie,E as bt}from"../chunks/EditOnGithub.1e64e623.js";function xt(Ge){let x,de,ie,le,D,ce,L,Ke='<code>UniPCMultistepScheduler</code> is a training-free framework designed for fast sampling of diffusion models. It was introduced in <a href="https://huggingface.co/papers/2302.04867" rel="nofollow">UniPC: A Unified Predictor-Corrector Framework for Fast Sampling of Diffusion Models</a> by Wenliang Zhao, Lujia Bai, Yongming Rao, Jie Zhou, Jiwen Lu.',ue,I,Qe=`It consists of a corrector (UniC) and a predictor (UniP) that share a unified analytical form and support arbitrary orders.
UniPC is by design model-agnostic, supporting pixel-space/latent-space DPMs on unconditional/conditional sampling. It can also be applied to both noise prediction and data prediction models. The corrector UniC can be also applied after any off-the-shelf solvers to increase the order of accuracy.`,pe,O,Xe="The abstract from the paper is:",me,k,et='<em>Diffusion probabilistic models (DPMs) have demonstrated a very promising ability in high-resolution image synthesis. However, sampling from a pre-trained DPM is time-consuming due to the multiple evaluations of the denoising network, making it more and more important to accelerate the sampling of DPMs. Despite recent progress in designing fast samplers, existing methods still cannot generate satisfying images in many applications where fewer steps (e.g., &lt;10) are favored. In this paper, we develop a unified corrector (UniC) that can be applied after any existing DPM sampler to increase the order of accuracy without extra model evaluations, and derive a unified predictor (UniP) that supports arbitrary order as a byproduct. Combining UniP and UniC, we propose a unified predictor-corrector framework called UniPC for the fast sampling of DPMs, which has a unified analytical form for any order and can significantly improve the sampling quality over previous methods, especially in extremely few steps. We evaluate our methods through extensive experiments including both unconditional and conditional sampling using pixel-space and latent-space DPMs. Our UniPC can achieve 3.87 FID on CIFAR10 (unconditional) and 7.51 FID on ImageNet 256×256 (conditional) with only 10 function evaluations. Code is available at <a href="https://github.com/wl-zhao/UniPC" rel="nofollow">this https URL</a>.</em>',he,H,fe,z,tt="It is recommended to set <code>solver_order</code> to 2 for guide sampling, and <code>solver_order=3</code> for unconditional sampling.",ge,E,st=`Dynamic thresholding from <a href="https://huggingface.co/papers/2205.11487" rel="nofollow">Imagen</a> is supported, and for pixel-space
diffusion models, you can set both <code>predict_x0=True</code> and <code>thresholding=True</code> to use dynamic thresholding. This thresholding method is unsuitable for latent-space diffusion models such as Stable Diffusion.`,_e,q,ve,d,F,Oe,G,nt="<code>UniPCMultistepScheduler</code> is a training-free framework designed for the fast sampling of diffusion models.",ke,K,rt=`This model inherits from <a href="/docs/diffusers/pr_10021/en/api/schedulers/overview#diffusers.SchedulerMixin">SchedulerMixin</a> and <a href="/docs/diffusers/pr_10021/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.`,He,$,N,ze,Q,ot="Convert the model output to the corresponding type the UniPC algorithm needs.",Ee,P,A,qe,X,it="One step for the UniC (B(h) version).",Fe,T,V,Ne,ee,at="One step for the UniP (B(h) version). Alternatively, <code>self.solver_p</code> is used if is specified.",Ae,M,W,Ve,te,dt=`Ensures interchangeability with schedulers that need to scale the denoising model input depending on the
current timestep.`,We,S,R,Re,se,lt="Sets the begin index for the scheduler. This function should be run from pipeline before the inference.",je,U,j,Be,ne,ct="Sets the discrete timesteps used for the diffusion chain (to be run before inference).",Je,w,B,Ye,re,ut=`Predict the sample from the previous timestep by reversing the SDE. This function propagates the sample with
the multistep UniPC.`,be,J,xe,C,Y,Ze,oe,pt="Base class for the output of a scheduler’s <code>step</code> function.",Ce,Z,ye,ae,$e;return D=new Ie({props:{title:"UniPCMultistepScheduler",local:"unipcmultistepscheduler",headingTag:"h1"}}),H=new Ie({props:{title:"Tips",local:"tips",headingTag:"h2"}}),q=new Ie({props:{title:"UniPCMultistepScheduler",local:"diffusers.UniPCMultistepScheduler",headingTag:"h2"}}),F=new y({props:{name:"class diffusers.UniPCMultistepScheduler",anchor:"diffusers.UniPCMultistepScheduler",parameters:[{name:"num_train_timesteps",val:": int = 1000"},{name:"beta_start",val:": float = 0.0001"},{name:"beta_end",val:": float = 0.02"},{name:"beta_schedule",val:": str = 'linear'"},{name:"trained_betas",val:": typing.Union[numpy.ndarray, typing.List[float], NoneType] = None"},{name:"solver_order",val:": int = 2"},{name:"prediction_type",val:": str = 'epsilon'"},{name:"thresholding",val:": bool = False"},{name:"dynamic_thresholding_ratio",val:": float = 0.995"},{name:"sample_max_value",val:": float = 1.0"},{name:"predict_x0",val:": bool = True"},{name:"solver_type",val:": str = 'bh2'"},{name:"lower_order_final",val:": bool = True"},{name:"disable_corrector",val:": typing.List[int] = []"},{name:"solver_p",val:": SchedulerMixin = None"},{name:"use_karras_sigmas",val:": typing.Optional[bool] = False"},{name:"use_exponential_sigmas",val:": typing.Optional[bool] = False"},{name:"use_beta_sigmas",val:": typing.Optional[bool] = False"},{name:"timestep_spacing",val:": str = 'linspace'"},{name:"steps_offset",val:": int = 0"},{name:"final_sigmas_type",val:": typing.Optional[str] = 'zero'"},{name:"rescale_betas_zero_snr",val:": bool = False"}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.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.UniPCMultistepScheduler.beta_start",description:`<strong>beta_start</strong> (<code>float</code>, defaults to 0.0001) &#x2014;
The starting <code>beta</code> value of inference.`,name:"beta_start"},{anchor:"diffusers.UniPCMultistepScheduler.beta_end",description:`<strong>beta_end</strong> (<code>float</code>, defaults to 0.02) &#x2014;
The final <code>beta</code> value.`,name:"beta_end"},{anchor:"diffusers.UniPCMultistepScheduler.beta_schedule",description:`<strong>beta_schedule</strong> (<code>str</code>, defaults to <code>&quot;linear&quot;</code>) &#x2014;
The beta schedule, a mapping from a beta range to a sequence of betas for stepping the model. Choose from
<code>linear</code>, <code>scaled_linear</code>, or <code>squaredcos_cap_v2</code>.`,name:"beta_schedule"},{anchor:"diffusers.UniPCMultistepScheduler.trained_betas",description:`<strong>trained_betas</strong> (<code>np.ndarray</code>, <em>optional</em>) &#x2014;
Pass an array of betas directly to the constructor to bypass <code>beta_start</code> and <code>beta_end</code>.`,name:"trained_betas"},{anchor:"diffusers.UniPCMultistepScheduler.solver_order",description:`<strong>solver_order</strong> (<code>int</code>, default <code>2</code>) &#x2014;
The UniPC order which can be any positive integer. The effective order of accuracy is <code>solver_order + 1</code>
due to the UniC. 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.UniPCMultistepScheduler.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.UniPCMultistepScheduler.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.UniPCMultistepScheduler.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.UniPCMultistepScheduler.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>predict_x0=True</code>.`,name:"sample_max_value"},{anchor:"diffusers.UniPCMultistepScheduler.predict_x0",description:`<strong>predict_x0</strong> (<code>bool</code>, defaults to <code>True</code>) &#x2014;
Whether to use the updating algorithm on the predicted x0.`,name:"predict_x0"},{anchor:"diffusers.UniPCMultistepScheduler.solver_type",description:`<strong>solver_type</strong> (<code>str</code>, default <code>bh2</code>) &#x2014;
Solver type for UniPC. It is recommended to use <code>bh1</code> for unconditional sampling when steps &lt; 10, and <code>bh2</code>
otherwise.`,name:"solver_type"},{anchor:"diffusers.UniPCMultistepScheduler.lower_order_final",description:`<strong>lower_order_final</strong> (<code>bool</code>, default <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.UniPCMultistepScheduler.disable_corrector",description:`<strong>disable_corrector</strong> (<code>list</code>, default <code>[]</code>) &#x2014;
Decides which step to disable the corrector to mitigate the misalignment between <code>epsilon_theta(x_t, c)</code>
and <code>epsilon_theta(x_t^c, c)</code> which can influence convergence for a large guidance scale. Corrector is
usually disabled during the first few steps.`,name:"disable_corrector"},{anchor:"diffusers.UniPCMultistepScheduler.solver_p",description:`<strong>solver_p</strong> (<code>SchedulerMixin</code>, default <code>None</code>) &#x2014;
Any other scheduler that if specified, the algorithm becomes <code>solver_p + UniC</code>.`,name:"solver_p"},{anchor:"diffusers.UniPCMultistepScheduler.use_karras_sigmas",description:`<strong>use_karras_sigmas</strong> (<code>bool</code>, <em>optional</em>, defaults to <code>False</code>) &#x2014;
Whether to use Karras sigmas for step sizes in the noise schedule during the sampling process. If <code>True</code>,
the sigmas are determined according to a sequence of noise levels {&#x3C3;i}.`,name:"use_karras_sigmas"},{anchor:"diffusers.UniPCMultistepScheduler.use_exponential_sigmas",description:`<strong>use_exponential_sigmas</strong> (<code>bool</code>, <em>optional</em>, defaults to <code>False</code>) &#x2014;
Whether to use exponential sigmas for step sizes in the noise schedule during the sampling process.`,name:"use_exponential_sigmas"},{anchor:"diffusers.UniPCMultistepScheduler.use_beta_sigmas",description:`<strong>use_beta_sigmas</strong> (<code>bool</code>, <em>optional</em>, defaults to <code>False</code>) &#x2014;
Whether to use beta sigmas for step sizes in the noise schedule during the sampling process. Refer to <a href="https://huggingface.co/papers/2407.12173" rel="nofollow">Beta
Sampling is All You Need</a> for more information.`,name:"use_beta_sigmas"},{anchor:"diffusers.UniPCMultistepScheduler.timestep_spacing",description:`<strong>timestep_spacing</strong> (<code>str</code>, defaults to <code>&quot;linspace&quot;</code>) &#x2014;
The way the timesteps should be scaled. Refer to Table 2 of the <a href="https://huggingface.co/papers/2305.08891" rel="nofollow">Common Diffusion Noise Schedules and
Sample Steps are Flawed</a> for more information.`,name:"timestep_spacing"},{anchor:"diffusers.UniPCMultistepScheduler.steps_offset",description:`<strong>steps_offset</strong> (<code>int</code>, defaults to 0) &#x2014;
An offset added to the inference steps, as required by some model families.`,name:"steps_offset"},{anchor:"diffusers.UniPCMultistepScheduler.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"},{anchor:"diffusers.UniPCMultistepScheduler.rescale_betas_zero_snr",description:`<strong>rescale_betas_zero_snr</strong> (<code>bool</code>, defaults to <code>False</code>) &#x2014;
Whether to rescale the betas to have zero terminal SNR. This enables the model to generate very bright and
dark samples instead of limiting it to samples with medium brightness. Loosely related to
<a href="https://github.com/huggingface/diffusers/blob/74fd735eb073eb1d774b1ab4154a0876eb82f055/examples/dreambooth/train_dreambooth.py#L506" rel="nofollow"><code>--offset_noise</code></a>.`,name:"rescale_betas_zero_snr"}],source:"https://github.com/huggingface/diffusers/blob/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L115"}}),N=new y({props:{name:"convert_model_output",anchor:"diffusers.UniPCMultistepScheduler.convert_model_output",parameters:[{name:"model_output",val:": Tensor"},{name:"*args",val:""},{name:"sample",val:": Tensor = None"},{name:"**kwargs",val:""}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.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.UniPCMultistepScheduler.convert_model_output.timestep",description:`<strong>timestep</strong> (<code>int</code>) &#x2014;
The current discrete timestep in the diffusion chain.`,name:"timestep"},{anchor:"diffusers.UniPCMultistepScheduler.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/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L552",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 y({props:{name:"multistep_uni_c_bh_update",anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_c_bh_update",parameters:[{name:"this_model_output",val:": Tensor"},{name:"*args",val:""},{name:"last_sample",val:": Tensor = None"},{name:"this_sample",val:": Tensor = None"},{name:"order",val:": int = None"},{name:"**kwargs",val:""}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_c_bh_update.this_model_output",description:`<strong>this_model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The model outputs at <code>x_t</code>.`,name:"this_model_output"},{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_c_bh_update.this_timestep",description:`<strong>this_timestep</strong> (<code>int</code>) &#x2014;
The current timestep <code>t</code>.`,name:"this_timestep"},{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_c_bh_update.last_sample",description:`<strong>last_sample</strong> (<code>torch.Tensor</code>) &#x2014;
The generated sample before the last predictor <code>x_{t-1}</code>.`,name:"last_sample"},{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_c_bh_update.this_sample",description:`<strong>this_sample</strong> (<code>torch.Tensor</code>) &#x2014;
The generated sample after the last predictor <code>x_{t}</code>.`,name:"this_sample"},{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_c_bh_update.order",description:`<strong>order</strong> (<code>int</code>) &#x2014;
The <code>p</code> of UniC-p at this step. The effective order of accuracy should be <code>order + 1</code>.`,name:"order"}],source:"https://github.com/huggingface/diffusers/blob/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L751",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


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


<p><code>torch.Tensor</code></p>
`}}),V=new y({props:{name:"multistep_uni_p_bh_update",anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_p_bh_update",parameters:[{name:"model_output",val:": Tensor"},{name:"*args",val:""},{name:"sample",val:": Tensor = None"},{name:"order",val:": int = None"},{name:"**kwargs",val:""}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_p_bh_update.model_output",description:`<strong>model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The direct output from the learned diffusion model at the current timestep.`,name:"model_output"},{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_p_bh_update.prev_timestep",description:`<strong>prev_timestep</strong> (<code>int</code>) &#x2014;
The previous discrete timestep in the diffusion chain.`,name:"prev_timestep"},{anchor:"diffusers.UniPCMultistepScheduler.multistep_uni_p_bh_update.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.UniPCMultistepScheduler.multistep_uni_p_bh_update.order",description:`<strong>order</strong> (<code>int</code>) &#x2014;
The order of UniP at this timestep (corresponds to the <em>p</em> in UniPC-p).`,name:"order"}],source:"https://github.com/huggingface/diffusers/blob/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L622",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>
`}}),W=new y({props:{name:"scale_model_input",anchor:"diffusers.UniPCMultistepScheduler.scale_model_input",parameters:[{name:"sample",val:": Tensor"},{name:"*args",val:""},{name:"**kwargs",val:""}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.scale_model_input.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
The input sample.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L1002",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>
`}}),R=new y({props:{name:"set_begin_index",anchor:"diffusers.UniPCMultistepScheduler.set_begin_index",parameters:[{name:"begin_index",val:": int = 0"}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.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/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L289"}}),j=new y({props:{name:"set_timesteps",anchor:"diffusers.UniPCMultistepScheduler.set_timesteps",parameters:[{name:"num_inference_steps",val:": int"},{name:"device",val:": typing.Union[str, torch.device] = None"}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.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.UniPCMultistepScheduler.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/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L299"}}),B=new y({props:{name:"step",anchor:"diffusers.UniPCMultistepScheduler.step",parameters:[{name:"model_output",val:": Tensor"},{name:"timestep",val:": typing.Union[int, torch.Tensor]"},{name:"sample",val:": Tensor"},{name:"return_dict",val:": bool = True"}],parametersDescription:[{anchor:"diffusers.UniPCMultistepScheduler.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.UniPCMultistepScheduler.step.timestep",description:`<strong>timestep</strong> (<code>int</code>) &#x2014;
The current discrete timestep in the diffusion chain.`,name:"timestep"},{anchor:"diffusers.UniPCMultistepScheduler.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.UniPCMultistepScheduler.step.return_dict",description:`<strong>return_dict</strong> (<code>bool</code>) &#x2014;
Whether or not to return a <a href="/docs/diffusers/pr_10021/en/api/schedulers/multistep_dpm_solver#diffusers.schedulers.scheduling_utils.SchedulerOutput">SchedulerOutput</a> or <code>tuple</code>.`,name:"return_dict"}],source:"https://github.com/huggingface/diffusers/blob/vr_10021/src/diffusers/schedulers/scheduling_unipc_multistep.py#L921",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>If return_dict is <code>True</code>, <a
  href="/docs/diffusers/pr_10021/en/api/schedulers/multistep_dpm_solver#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/pr_10021/en/api/schedulers/multistep_dpm_solver#diffusers.schedulers.scheduling_utils.SchedulerOutput"
>SchedulerOutput</a> or <code>tuple</code></p>
`}}),J=new Ie({props:{title:"SchedulerOutput",local:"diffusers.schedulers.scheduling_utils.SchedulerOutput",headingTag:"h2"}}),Y=new y({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/vr_10021/src/diffusers/schedulers/scheduling_utils.py#L60"}}),Z=new bt({props:{source:"https://github.com/huggingface/diffusers/blob/main/docs/source/en/api/schedulers/unipc.md"}}),{c(){x=i("meta"),de=r(),ie=i("p"),le=r(),p(D.$$.fragment),ce=r(),L=i("p"),L.innerHTML=Ke,ue=r(),I=i("p"),I.textContent=Qe,pe=r(),O=i("p"),O.textContent=Xe,me=r(),k=i("p"),k.innerHTML=et,he=r(),p(H.$$.fragment),fe=r(),z=i("p"),z.innerHTML=tt,ge=r(),E=i("p"),E.innerHTML=st,_e=r(),p(q.$$.fragment),ve=r(),d=i("div"),p(F.$$.fragment),Oe=r(),G=i("p"),G.innerHTML=nt,ke=r(),K=i("p"),K.innerHTML=rt,He=r(),$=i("div"),p(N.$$.fragment),ze=r(),Q=i("p"),Q.textContent=ot,Ee=r(),P=i("div"),p(A.$$.fragment),qe=r(),X=i("p"),X.textContent=it,Fe=r(),T=i("div"),p(V.$$.fragment),Ne=r(),ee=i("p"),ee.innerHTML=at,Ae=r(),M=i("div"),p(W.$$.fragment),Ve=r(),te=i("p"),te.textContent=dt,We=r(),S=i("div"),p(R.$$.fragment),Re=r(),se=i("p"),se.textContent=lt,je=r(),U=i("div"),p(j.$$.fragment),Be=r(),ne=i("p"),ne.textContent=ct,Je=r(),w=i("div"),p(B.$$.fragment),Ye=r(),re=i("p"),re.textContent=ut,be=r(),p(J.$$.fragment),xe=r(),C=i("div"),p(Y.$$.fragment),Ze=r(),oe=i("p"),oe.innerHTML=pt,Ce=r(),p(Z.$$.fragment),ye=r(),ae=i("p"),this.h()},l(e){const n=vt("svelte-u9bgzb",document.head);x=a(n,"META",{name:!0,content:!0}),n.forEach(t),de=o(e),ie=a(e,"P",{}),v(ie).forEach(t),le=o(e),m(D.$$.fragment,e),ce=o(e),L=a(e,"P",{"data-svelte-h":!0}),u(L)!=="svelte-1tyrzxd"&&(L.innerHTML=Ke),ue=o(e),I=a(e,"P",{"data-svelte-h":!0}),u(I)!=="svelte-16di28y"&&(I.textContent=Qe),pe=o(e),O=a(e,"P",{"data-svelte-h":!0}),u(O)!=="svelte-1cwsb16"&&(O.textContent=Xe),me=o(e),k=a(e,"P",{"data-svelte-h":!0}),u(k)!=="svelte-1n6uqo6"&&(k.innerHTML=et),he=o(e),m(H.$$.fragment,e),fe=o(e),z=a(e,"P",{"data-svelte-h":!0}),u(z)!=="svelte-pt2glg"&&(z.innerHTML=tt),ge=o(e),E=a(e,"P",{"data-svelte-h":!0}),u(E)!=="svelte-j7jp76"&&(E.innerHTML=st),_e=o(e),m(q.$$.fragment,e),ve=o(e),d=a(e,"DIV",{class:!0});var c=v(d);m(F.$$.fragment,c),Oe=o(c),G=a(c,"P",{"data-svelte-h":!0}),u(G)!=="svelte-lu1m8w"&&(G.innerHTML=nt),ke=o(c),K=a(c,"P",{"data-svelte-h":!0}),u(K)!=="svelte-mpz851"&&(K.innerHTML=rt),He=o(c),$=a(c,"DIV",{class:!0});var Pe=v($);m(N.$$.fragment,Pe),ze=o(Pe),Q=a(Pe,"P",{"data-svelte-h":!0}),u(Q)!=="svelte-ixnexx"&&(Q.textContent=ot),Pe.forEach(t),Ee=o(c),P=a(c,"DIV",{class:!0});var Te=v(P);m(A.$$.fragment,Te),qe=o(Te),X=a(Te,"P",{"data-svelte-h":!0}),u(X)!=="svelte-d0n1u7"&&(X.textContent=it),Te.forEach(t),Fe=o(c),T=a(c,"DIV",{class:!0});var Me=v(T);m(V.$$.fragment,Me),Ne=o(Me),ee=a(Me,"P",{"data-svelte-h":!0}),u(ee)!=="svelte-s6vwmd"&&(ee.innerHTML=at),Me.forEach(t),Ae=o(c),M=a(c,"DIV",{class:!0});var Se=v(M);m(W.$$.fragment,Se),Ve=o(Se),te=a(Se,"P",{"data-svelte-h":!0}),u(te)!=="svelte-1rkfgpx"&&(te.textContent=dt),Se.forEach(t),We=o(c),S=a(c,"DIV",{class:!0});var Ue=v(S);m(R.$$.fragment,Ue),Re=o(Ue),se=a(Ue,"P",{"data-svelte-h":!0}),u(se)!=="svelte-1k141rk"&&(se.textContent=lt),Ue.forEach(t),je=o(c),U=a(c,"DIV",{class:!0});var we=v(U);m(j.$$.fragment,we),Be=o(we),ne=a(we,"P",{"data-svelte-h":!0}),u(ne)!=="svelte-1vzm9q"&&(ne.textContent=ct),we.forEach(t),Je=o(c),w=a(c,"DIV",{class:!0});var De=v(w);m(B.$$.fragment,De),Ye=o(De),re=a(De,"P",{"data-svelte-h":!0}),u(re)!=="svelte-5y602c"&&(re.textContent=ut),De.forEach(t),c.forEach(t),be=o(e),m(J.$$.fragment,e),xe=o(e),C=a(e,"DIV",{class:!0});var Le=v(C);m(Y.$$.fragment,Le),Ze=o(Le),oe=a(Le,"P",{"data-svelte-h":!0}),u(oe)!=="svelte-6ojmkw"&&(oe.innerHTML=pt),Le.forEach(t),Ce=o(e),m(Z.$$.fragment,e),ye=o(e),ae=a(e,"P",{}),v(ae).forEach(t),this.h()},h(){b(x,"name","hf:doc:metadata"),b(x,"content",Ct),b($,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(P,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(T,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(M,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(S,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(U,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(w,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(d,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),b(C,"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,n){s(document.head,x),l(e,de,n),l(e,ie,n),l(e,le,n),h(D,e,n),l(e,ce,n),l(e,L,n),l(e,ue,n),l(e,I,n),l(e,pe,n),l(e,O,n),l(e,me,n),l(e,k,n),l(e,he,n),h(H,e,n),l(e,fe,n),l(e,z,n),l(e,ge,n),l(e,E,n),l(e,_e,n),h(q,e,n),l(e,ve,n),l(e,d,n),h(F,d,null),s(d,Oe),s(d,G),s(d,ke),s(d,K),s(d,He),s(d,$),h(N,$,null),s($,ze),s($,Q),s(d,Ee),s(d,P),h(A,P,null),s(P,qe),s(P,X),s(d,Fe),s(d,T),h(V,T,null),s(T,Ne),s(T,ee),s(d,Ae),s(d,M),h(W,M,null),s(M,Ve),s(M,te),s(d,We),s(d,S),h(R,S,null),s(S,Re),s(S,se),s(d,je),s(d,U),h(j,U,null),s(U,Be),s(U,ne),s(d,Je),s(d,w),h(B,w,null),s(w,Ye),s(w,re),l(e,be,n),h(J,e,n),l(e,xe,n),l(e,C,n),h(Y,C,null),s(C,Ze),s(C,oe),l(e,Ce,n),h(Z,e,n),l(e,ye,n),l(e,ae,n),$e=!0},p:ht,i(e){$e||(f(D.$$.fragment,e),f(H.$$.fragment,e),f(q.$$.fragment,e),f(F.$$.fragment,e),f(N.$$.fragment,e),f(A.$$.fragment,e),f(V.$$.fragment,e),f(W.$$.fragment,e),f(R.$$.fragment,e),f(j.$$.fragment,e),f(B.$$.fragment,e),f(J.$$.fragment,e),f(Y.$$.fragment,e),f(Z.$$.fragment,e),$e=!0)},o(e){g(D.$$.fragment,e),g(H.$$.fragment,e),g(q.$$.fragment,e),g(F.$$.fragment,e),g(N.$$.fragment,e),g(A.$$.fragment,e),g(V.$$.fragment,e),g(W.$$.fragment,e),g(R.$$.fragment,e),g(j.$$.fragment,e),g(B.$$.fragment,e),g(J.$$.fragment,e),g(Y.$$.fragment,e),g(Z.$$.fragment,e),$e=!1},d(e){e&&(t(de),t(ie),t(le),t(ce),t(L),t(ue),t(I),t(pe),t(O),t(me),t(k),t(he),t(fe),t(z),t(ge),t(E),t(_e),t(ve),t(d),t(be),t(xe),t(C),t(Ce),t(ye),t(ae)),t(x),_(D,e),_(H,e),_(q,e),_(F),_(N),_(A),_(V),_(W),_(R),_(j),_(B),_(J,e),_(Y),_(Z,e)}}}const Ct='{"title":"UniPCMultistepScheduler","local":"unipcmultistepscheduler","sections":[{"title":"Tips","local":"tips","sections":[],"depth":2},{"title":"UniPCMultistepScheduler","local":"diffusers.UniPCMultistepScheduler","sections":[],"depth":2},{"title":"SchedulerOutput","local":"diffusers.schedulers.scheduling_utils.SchedulerOutput","sections":[],"depth":2}],"depth":1}';function yt(Ge){return ft(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class St extends gt{constructor(x){super(),_t(this,x,yt,xt,mt,{})}}export{St as component};
