summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMike Bayer <mike_mp@zzzcomputing.com>2015-04-03 18:04:29 -0400
committerMike Bayer <mike_mp@zzzcomputing.com>2015-04-03 18:04:29 -0400
commitee40c7afaabe33e2080607de0045a9fd0a4748d8 (patch)
tree842530c7977a8dfe5a0879b779ae37c700376745
parentad7cb2ebd38629599e7105ac016a96d81ed9ee07 (diff)
downloadsqlalchemy-ee40c7afaabe33e2080607de0045a9fd0a4748d8.tar.gz
- changelog for #3084, fixes #3084
-rw-r--r--doc/build/changelog/changelog_10.rst15
1 files changed, 15 insertions, 0 deletions
diff --git a/doc/build/changelog/changelog_10.rst b/doc/build/changelog/changelog_10.rst
index e73e9897e..7b101389d 100644
--- a/doc/build/changelog/changelog_10.rst
+++ b/doc/build/changelog/changelog_10.rst
@@ -19,6 +19,21 @@
:version: 1.0.0
.. change::
+ :tags: feature, sql
+ :tickets: 3084
+ :pullreq: bitbucket:47
+
+ The topological sorting used to sort :class:`.Table` objects
+ and available via the :attr:`.MetaData.sorted_tables` collection
+ will now produce a **deterministic** ordering; that is, the same
+ ordering each time given a set of tables with particular names
+ and dependencies. This is to help with comparison of DDL scripts
+ and other use cases. The tables are sent to the topological sort
+ sorted by name, and the topological sort itself will process
+ the incoming data in an ordered fashion. Pull request
+ courtesy Sebastian Bank.
+
+ .. change::
:tags: feature, orm
:pullreq: github:164