-
Committer:
John Arbash Meinel
-
Date:
2010-10-15 21:07:28 UTC
-
Revision ID:
john@arbash-meinel.com-20101015210728-05zq6w7rq9p9129d
Re-introduced --expand-all.
It turns out it will be useful for Aaron while testing, so I brought it
back. This way we can determine the worst-case scaling of the data
structure. It is O(C*N_branches) and it has a fair multiplier (probably C<100)
However, that is much better than O(History*N_branches).