diff options
author | Mike Bayer <mike_mp@zzzcomputing.com> | 2015-04-22 11:59:08 -0400 |
---|---|---|
committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2015-04-22 11:59:08 -0400 |
commit | f704b7265a634be70f0255adfb2a084b7384b727 (patch) | |
tree | 99b9efc8f60412d8f2f1d309cfd52d66164f2e6e | |
parent | 4442eb3e1edea1652ce0ab5f4d16925207dcf2c5 (diff) | |
download | sqlalchemy-f704b7265a634be70f0255adfb2a084b7384b727.tar.gz |
- correct migration note for #3084; doesn't apply to create/drop
-rw-r--r-- | doc/build/changelog/migration_10.rst | 17 |
1 files changed, 9 insertions, 8 deletions
diff --git a/doc/build/changelog/migration_10.rst b/doc/build/changelog/migration_10.rst index 8841fafc2..49ca37b2b 100644 --- a/doc/build/changelog/migration_10.rst +++ b/doc/build/changelog/migration_10.rst @@ -2043,16 +2043,17 @@ state. .. _feature_3084: -MetaData sorting of Tables is now fully deterministic +MetaData.sorted_tables accessor is "deterministic" ----------------------------------------------------- -The sorting of tables which results when emitting :meth:`.MetaData.create_all`, -:meth:`.MetaData.drop_all`, and :meth:`.MetaData.sorted_tables` is now -fully deterministic; that is, the :class:`.Table` objects are as always -sorted by dependency, but the full ordering is generated in a deterministic -way based on the set of tables first sorted alphabetically by name, -then run through the foreign key sort, such that these methods will -produce the identical topological ordering each time. +The sorting of tables resulting from the :attr:`.MetaData.sorted_tables` +accessor is "deterministic"; the ordering should be the same in all cases +regardless of Python hashing. This is done by first sorting the tables +by name before passing them to the topological algorithm, which maintains +that ordering as it iterates. + +Note that this change does **not** yet apply to the ordering applied +when emitting :meth:`.MetaData.create_all` or :meth:`.MetaData.drop_all`. :ticket:`3084` |