本文整理汇总了Python中south.migration.utils.depends函数的典型用法代码示例。如果您正苦于以下问题：Python depends函数的具体用法？Python depends怎么用？Python depends使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了depends函数的7个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: assertCircularDependency
def assertCircularDependency(self, trace, target, graph):
"Custom assertion that checks a circular dependency is detected correctly."
self.assertRaises(exceptions.CircularDependency, depends, target, lambda n: graph[n])
try:
depends(target, lambda n: graph[n])
except exceptions.CircularDependency, e:
self.assertEqual(trace, e.trace)示例2: assertCircularDependency
def assertCircularDependency(self, trace, target, graph):
self.assertRaises(exceptions.CircularDependency,
depends, target, lambda n: graph[n])
try:
depends(target, lambda n: graph[n])
except exceptions.CircularDependency, e:
self.assertEqual(trace, e.trace)示例3: test_depends
def test_depends(self):
graph = {"A1": []}
self.assertEqual(["A1"], depends("A1", lambda n: graph[n]))
graph = {"A1": [], "A2": ["A1"], "A3": ["A2"]}
self.assertEqual(["A1", "A2", "A3"], depends("A3", lambda n: graph[n]))
graph = {"A1": [], "A2": ["A1"], "A3": ["A2", "A1"]}
self.assertEqual(["A1", "A2", "A3"], depends("A3", lambda n: graph[n]))
graph = {"A1": [], "A2": ["A1"], "A3": ["A2", "A1", "B1"], "B1": []}
self.assertEqual(["A1", "A2", "B1", "A3"], depends("A3", lambda n: graph[n]))
graph = {"A1": [], "A2": ["A1"], "A3": ["A2", "A1", "B2"], "B1": [], "B2": ["B1"]}
self.assertEqual(["A1", "A2", "B1", "B2", "A3"], depends("A3", lambda n: graph[n]))
graph = {"A1": [], "A2": ["A1", "B1"], "A3": ["A2"], "B1": ["A1"]}
self.assertEqual(["A1", "B1", "A2", "A3"], depends("A3", lambda n: graph[n]))
graph = {"A1": [], "A2": ["A1"], "A3": ["A2", "A1", "B2"], "B1": [], "B2": ["B1", "C1"], "C1": ["B1"]}
self.assertEqual(["A1", "A2", "B1", "C1", "B2", "A3"], depends("A3", lambda n: graph[n]))
graph = {
"A1": [],
"A2": ["A1"],
"A3": ["A2", "B2", "A1", "C1"],
"B1": ["A1"],
"B2": ["B1", "C2", "A1"],
"C1": ["B1"],
"C2": ["C1", "A1"],
"C3": ["C2"],
}
self.assertEqual(["A1", "A2", "B1", "C1", "C2", "B2", "A3"], depends("A3", lambda n: graph[n]))示例4: test_depends
def test_depends(self):
graph = {'A1': []}
self.assertEqual(['A1'],
depends('A1', lambda n: graph[n]))
graph = {'A1': [],
'A2': ['A1'],
'A3': ['A2']}
self.assertEqual(['A1', 'A2', 'A3'],
depends('A3', lambda n: graph[n]))
graph = {'A1': [],
'A2': ['A1'],
'A3': ['A2', 'A1']}
self.assertEqual(['A1', 'A2', 'A3'],
depends('A3', lambda n: graph[n]))
graph = {'A1': [],
'A2': ['A1'],
'A3': ['A2', 'A1', 'B1'],
'B1': []}
self.assertEqual(
['B1', 'A1', 'A2', 'A3'],
depends('A3', lambda n: graph[n]),
)
graph = {'A1': [],
'A2': ['A1'],
'A3': ['A2', 'A1', 'B2'],
'B1': [],
'B2': ['B1']}
self.assertEqual(
['B1', 'B2', 'A1', 'A2', 'A3'],
depends('A3', lambda n: graph[n]),
)
graph = {'A1': [],
'A2': ['A1', 'B1'],
'A3': ['A2'],
'B1': ['A1']}
self.assertEqual(['A1', 'B1', 'A2', 'A3'],
depends('A3', lambda n: graph[n]))
graph = {'A1': [],
'A2': ['A1'],
'A3': ['A2', 'A1', 'B2'],
'B1': [],
'B2': ['B1', 'C1'],
'C1': ['B1']}
self.assertEqual(
['B1', 'C1', 'B2', 'A1', 'A2', 'A3'],
depends('A3', lambda n: graph[n]),
)
graph = {'A1': [],
'A2': ['A1'],
'A3': ['A2', 'B2', 'A1', 'C1'],
'B1': ['A1'],
'B2': ['B1', 'C2', 'A1'],
'C1': ['B1'],
'C2': ['C1', 'A1'],
'C3': ['C2']}
self.assertEqual(
['A1', 'B1', 'C1', 'C2', 'B2', 'A2', 'A3'],
depends('A3', lambda n: graph[n]),
)示例5: forwards_plan
def forwards_plan(self):
"""
Returns a list of Migration objects to be applied, in order.
This list includes `self`, which will be applied last.
"""
return depends(self, lambda x: x.dependencies)示例6: _backwards_plan
def _backwards_plan(self):
return depends(self, lambda x: x.dependents)示例7: _backwards_plan
def _backwards_plan(self):
return depends(self, self.__class__.dependents)