GitHub-Proxy/Cura
1
0
Fork 0
mirror of https://git.mirrors.martin98.com/https://github.com/Ultimaker/Cura synced 2025-08-12 11:39:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update OneAtATimeIterator.py

Browse Source 
saving node_list after sorting
This commit is contained in:
Saumya Jain 2024-02-09 11:20:04 +01:00 committed by GitHub
parent 355f24e29f
commit a7292c7baf
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
cura/OneAtATimeIterator.py
View File

@ -68,7 +68,7 @@ class OneAtATimeIterator(Iterator.Iterator):
# Sort the original list so that items that block the most other objects are at the beginning. # Sort the original list so that items that block the most other objects are at the beginning.
# This does not decrease the worst case running time, but should improve it in most cases. # This does not decrease the worst case running time, but should improve it in most cases.
sorted(node_list, key = cmp_to_key(hit_checker.calculateScore)) node_list = sorted(node_list, key = cmp_to_key(hit_checker.calculateScore))
todo_node_list = [_ObjectOrder([], node_list)] todo_node_list = [_ObjectOrder([], node_list)]
while len(todo_node_list) > 0: while len(todo_node_list) > 0: