VimPlug/django-stubs
1
0
Fork 0
mirror of https://github.com/davidhalter/django-stubs.git synced 2025-12-16 00:37:11 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

run black over stubs, add checking to travis

Browse Source
This commit is contained in:
Maxim Kurnikov
2018-12-03 18:52:44 +03:00
parent d5bc7d4ab2
commit cf6119bf9b
420 changed files with 2295 additions and 8384 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
django-stubs-generated/db/migrations/graph.pyi
View File

@@ -27,9 +27,7 @@ class DummyNode(Node):
parents: Set[Any]
origin: Any = ...
error_message: Any = ...
def __init__(
self, key: Tuple[str, str], origin: Migration, error_message: str
) -> None: ...
def __init__(self, key: Tuple[str, str], origin: Migration, error_message: str) -> None: ...
__class__: Any = ...
def promote(self) -> None: ...
def raise_error(self) -> None: ...
@@ -39,12 +37,8 @@ class MigrationGraph:
nodes: Dict[Any, Any] = ...
cached: bool = ...
def __init__(self) -> None: ...
def add_node(
self, key: Tuple[str, str], migration: Optional[Migration]
) -> None: ...
def add_dummy_node(
self, key: Tuple[str, str], origin: Migration, error_message: str
) -> None: ...
def add_node(self, key: Tuple[str, str], migration: Optional[Migration]) -> None: ...
def add_dummy_node(self, key: Tuple[str, str], origin: Migration, error_message: str) -> None: ...
def add_dependency(
self,
migration: Optional[Union[Migration, str]],
@@ -52,32 +46,17 @@ class MigrationGraph:
parent: Tuple[str, str],
skip_validation: bool = ...,
) -> None: ...
def remove_replaced_nodes(
self, replacement: Tuple[str, str], replaced: List[Tuple[str, str]]
) -> None: ...
def remove_replacement_node(
self, replacement: Tuple[str, str], replaced: List[Tuple[str, str]]
) -> None: ...
def remove_replaced_nodes(self, replacement: Tuple[str, str], replaced: List[Tuple[str, str]]) -> None: ...
def remove_replacement_node(self, replacement: Tuple[str, str], replaced: List[Tuple[str, str]]) -> None: ...
def validate_consistency(self) -> None: ...
def clear_cache(self) -> None: ...
def forwards_plan(
self, target: Tuple[str, str]
) -> List[Tuple[str, str]]: ...
def backwards_plan(
self, target: Union[Tuple[str, str], Node]
) -> List[Tuple[str, str]]: ...
def forwards_plan(self, target: Tuple[str, str]) -> List[Tuple[str, str]]: ...
def backwards_plan(self, target: Union[Tuple[str, str], Node]) -> List[Tuple[str, str]]: ...
def iterative_dfs(self, start: Any, forwards: bool = ...): ...
def root_nodes(self, app: Optional[str] = ...) -> List[Tuple[str, str]]: ...
def leaf_nodes(self, app: Optional[str] = ...) -> List[Tuple[str, str]]: ...
def ensure_not_cyclic(
self, start: Union[Tuple[str, str], Node], get_children: Callable
) -> None: ...
def ensure_not_cyclic(self, start: Union[Tuple[str, str], Node], get_children: Callable) -> None: ...
def make_state(
self,
nodes: Optional[Tuple[str, str]] = ...,
at_end: bool = ...,
real_apps: List[str] = ...,
self, nodes: Optional[Tuple[str, str]] = ..., at_end: bool = ..., real_apps: List[str] = ...
) -> ProjectState: ...
def __contains__(
self, node: Union[Tuple[str, str], SwappableTuple]
) -> bool: ...
def __contains__(self, node: Union[Tuple[str, str], SwappableTuple]) -> bool: ...