| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Fixed #23395 -- Limited line lengths to 119 characters. | Dražen Odobašić | 2015-09-12 | 1 | -3/+13 |
| | | |||||
| * | Fixed #24883 -- Added MigrationGraph.__repr__() | Yoong Kang Lim | 2015-06-01 | 1 | -0/+1 |
| | | |||||
| * | Refs #24652 -- Used SimpleTestCase where appropriate. | Simon Charette | 2015-05-20 | 1 | -2/+2 |
| | | |||||
| * | Moved migration exception classes to shared module | Markus Holtermann | 2015-05-02 | 1 | -3/+3 |
| | | | | | Thanks Aymeric Augustin for the review. | ||||
| * | Refs #24366 -- Fixed recursion depth error in migration ↵ | Marten Kenbeek | 2015-03-29 | 1 | -7/+25 |
| | | | | | | | | | graph Made MigrationGraph forwards_plan() and backwards_plan() fall back to an iterative approach in case the recursive approach exceeds the recursion depth limit. | ||||
| * | Refs #24366 -- Renamed arguments in MigrationGraph, ↵ | Marten Kenbeek | 2015-03-29 | 1 | -2/+2 |
| | | | | | renamed tests | ||||
| * | Fixed #24366 -- Optimized traversal of large migration ↵ | Marten Kenbeek | 2015-02-23 | 1 | -2/+20 |
| | | | | | | | | | | | | | | dependency graphs. Switched from an adjancency list and uncached, iterative depth-first search to a Node-based design with direct parent/child links and a cached, recursive depth-first search. With this change, calculating a migration plan for a large graph takes several seconds instead of several hours. Marked test `migrations.test_graph.GraphTests.test_dfs` as an expected failure due to reaching the maximum recursion depth. | ||||
| * | Sorted imports with isort; refs #23860. | Tim Graham | 2015-02-06 | 1 | -1/+3 |
| | | |||||
| * | Fixed #24017 -- Added python_2_unicode_compatible in ↵ | Josh Schneier | 2014-12-21 | 1 | -1/+17 |
| | | | | | db/migrations | ||||
| * | Fixed flake8 warnings. | Tim Graham | 2014-11-25 | 1 | -3/+3 |
| | | |||||
| * | Fixed bug in circular dependency algo for migration ↵ | Luke Plant | 2014-11-25 | 1 | -0/+14 |
| | | | | | | | | | | | | | dependencies. Previous algo only worked if the first item was a part of the loop, and you would get an infinite loop otherwise (see test). To fix this, it was much easier to do a pre-pass. A bonus is that you now get an error message that actually helps you debug the dependency problem. | ||||
| * | Fixed #23835: Changed circular dependency in DFS to be ↵ | Andrew Godwin | 2014-11-15 | 1 | -0/+27 |
| | | | | | less infinite | ||||
| * | Fixed #23556 -- Raised a more meaningful error message ↵ | Markus Holtermann | 2014-10-30 | 1 | -5/+5 |
| | | | | | when migrations refer to an unavailable node | ||||
| * | Corrected grammar in migrations error message. | Markus Bertheau | 2014-09-10 | 1 | -2/+4 |
| | | |||||
| * | Fix Python 3 incompatability | Andrew Godwin | 2014-09-06 | 1 | -1/+1 |
| | | |||||
| * | switch out recursive dfs for stack based approach, to ↵ | Ben Reilly | 2014-09-06 | 1 | -0/+15 |
| | | | | | avoid possibly hitting the recursion limit | ||||
| * | Fixed #23341 -- Added migration name to nonexistent ↵ | Raffaele Salmaso | 2014-08-24 | 1 | -19/+44 |
| | | | | | migration error in makemigrations. | ||||
| * | Fixed #23352 -- Added tests for ↵ | Raffaele Salmaso | 2014-08-23 | 1 | -0/+13 |
| | | | | | MigrationGraph.{forwards,backwards}_plan | ||||
| * | Fixed #22861: Internal migrations done first so ↵ | Andrew Godwin | 2014-06-18 | 1 | -4/+4 |
| | | | | | | | __first__ works Thanks to Chris Beaven. | ||||
| * | Fix graph tests | Andrew Godwin | 2013-05-30 | 1 | -0/+19 |
| | | |||||
| * | Start adding operations that work and tests for them | Andrew Godwin | 2013-05-29 | 1 | -22/+2 |
| | | |||||
| * | Split up test and make the State classes a bit better. | Andrew Godwin | 2013-05-18 | 1 | -0/+136 |