iterator performance #2

Open
opened 2014-12-19 12:15:08 +13:00 by mikedilger · 0 comments
mikedilger commented 2014-12-19 12:15:08 +13:00 (Migrated from github.com)

Iterators currently re-walk the tree every time iter() is called, going one deeper each time. The satisfied nodes are quickly passed in get_next_dependency(), but there is probably a faster way to do this.

Iterators currently re-walk the tree every time iter() is called, going one deeper each time. The satisfied nodes are quickly passed in get_next_dependency(), but there is probably a faster way to do this.
Sign in to join this conversation.
No milestone
No project
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference
mikedilger/solvent#2
No description provided.