- Committer: John Arbash Meinel
- Date: 2009-06-19 17:37:01 UTC
- Revision ID: john@arbash-meinel.com-20090619173701-56p7yg3ionug2slb
Big performance win, back to 650ms.
Note that we don't need to grow known_parent_gdfos indefinitely.
Once we have queued up a node to be walked, we should never walk
it again, so we can remove the entry.
We also can avoid ever *setting* the item if we resolve it in
the first pass.
Will update the python version as well.
Note that we don't need to grow known_parent_gdfos indefinitely.
Once we have queued up a node to be walked, we should never walk
it again, so we can remove the entry.
We also can avoid ever *setting* the item if we resolve it in
the first pass.
Will update the python version as well.
| Filename | Latest Rev | Last Changed | Committer | Comment | Size | ||
|---|---|---|---|---|---|---|---|
 ..
|
|||||||