diff options
| author | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-04-05 17:49:58 -0400 |
|---|---|---|
| committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-04-05 17:49:58 -0400 |
| commit | 55382b4deac137feffc50ee541cc1e5118fa809b (patch) | |
| tree | 4e4e1ec55a391962e434783e62514b76dee24d9f /lib/sqlalchemy/sql/util.py | |
| parent | f288339e95ff1624473ecaa70f977db4059dfe2b (diff) | |
| download | sqlalchemy-55382b4deac137feffc50ee541cc1e5118fa809b.tar.gz | |
so here is kind of the idea. but it doesn't work like it used to.
so I think I want to try to build a smarter "find everything without a dependency"
system that is more inline with how this is running now anyway - i.e.
go through the whole list, find nodes with no dependencies. maybe the
original topological.sort() can do that, not sure.
Diffstat (limited to 'lib/sqlalchemy/sql/util.py')
0 files changed, 0 insertions, 0 deletions