| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Fixed #23844 -- Used topological sort for migration ↵ | Patryk Zawadzki | 2014-11-20 | 1 | -0/+31 |
| | | | | | | | | | | | | | | | | operation dependency resolution. This removes the concept of equality between operations to guarantee compatilibity with Python 3. Python 3 requires equality to result in identical object hashes. It's impossible to implement a unique hash that preserves equality as operations such as field creation depend on being able to accept arbitrary dicts that cannot be hashed reliably. Thanks Klaas van Schelven for the original patch in 13d613f80011852404198dfafd1f09c0c0ea42e6. | ||||
| * | Revert "Use topological sort for migration operation ↵ | Tim Graham | 2014-11-15 | 1 | -34/+0 |
| | | | | | | | | | dependency resolution" This commit broke the tests on Python 3. This reverts commit 13d613f80011852404198dfafd1f09c0c0ea42e6. | ||||
| * | Use topological sort for migration operation dependency ↵ | Klaas van Schelven | 2014-11-15 | 1 | -0/+34 |
| resolution rather than an ad-hoc algorithm | |||||