Skip to content

Commit

Permalink
Apply suggestions from code review
Browse files Browse the repository at this point in the history
  • Loading branch information
patrickvonplaten authored Oct 25, 2023
1 parent bf863cb commit a8259be
Show file tree
Hide file tree
Showing 3 changed files with 0 additions and 3 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -898,7 +898,6 @@ def get_timesteps(self, num_inference_steps, strength, device, denoising_start=N
)

num_inference_steps = (timesteps < discrete_timestep_cutoff).sum().item()
print(num_inference_steps)
if self.scheduler.order == 2 and num_inference_steps % 2 == 0:
# if the scheduler is a 2nd order scheduler we might have to do +1
# because `num_inference_steps` might be even given that every timestep
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -555,7 +555,6 @@ def get_timesteps(self, num_inference_steps, strength, device, denoising_start=N
)

num_inference_steps = (timesteps < discrete_timestep_cutoff).sum().item()
print(num_inference_steps)
if self.scheduler.order == 2 and num_inference_steps % 2 == 0:
# if the scheduler is a 2nd order scheduler we might have to do +1
# because `num_inference_steps` might be even given that every timestep
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -840,7 +840,6 @@ def get_timesteps(self, num_inference_steps, strength, device, denoising_start=N
)

num_inference_steps = (timesteps < discrete_timestep_cutoff).sum().item()
print(num_inference_steps)
if self.scheduler.order == 2 and num_inference_steps % 2 == 0:
# if the scheduler is a 2nd order scheduler we might have to do +1
# because `num_inference_steps` might be even given that every timestep
Expand Down

0 comments on commit a8259be

Please sign in to comment.