diff options
author | Arjen Hiemstra <ahiemstra@heimr.nl> | 2015-11-27 15:57:53 +0300 |
---|---|---|
committer | Arjen Hiemstra <ahiemstra@heimr.nl> | 2015-11-27 18:53:32 +0300 |
commit | 9267b517d60c5356b9bd425d33c4c8e53cb77e15 (patch) | |
tree | 4eb0b66da84741ccb76979a3aa2acc1b9426d378 /cura/OneAtATimeIterator.py | |
parent | 743b403b2964e05d3b4b818341f0397cf46b490b (diff) |
Fix coding style issues
Diffstat (limited to 'cura/OneAtATimeIterator.py')
-rw-r--r-- | cura/OneAtATimeIterator.py | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/cura/OneAtATimeIterator.py b/cura/OneAtATimeIterator.py index 64f25c6b64..449ca87c31 100644 --- a/cura/OneAtATimeIterator.py +++ b/cura/OneAtATimeIterator.py @@ -45,7 +45,7 @@ class OneAtATimeIterator(Iterator.Iterator): # This does not decrease the worst case running time, but should improve it in most cases. sorted(node_list, key = cmp_to_key(self._calculateScore)) - todo_node_list = [_objectOrder([], node_list)] + todo_node_list = [_ObjectOrder([], node_list)] while len(todo_node_list) > 0: current = todo_node_list.pop() for node in current.todo: @@ -61,7 +61,7 @@ class OneAtATimeIterator(Iterator.Iterator): self._node_stack = new_order return - todo_node_list.append(_objectOrder(new_order, new_todo_list)) + todo_node_list.append(_ObjectOrder(new_order, new_todo_list)) self._node_stack = [] #No result found! @@ -99,7 +99,7 @@ class OneAtATimeIterator(Iterator.Iterator): ## Internal object used to keep track of a possible order in which to print objects. -class _objectOrder(): +class _ObjectOrder(): def __init__(self, order, todo): """ :param order: List of indexes in which to print objects, ordered by printing order. |