← Back
Editing: typing.cpython-35.pyc
��Yf9 � D @ sK d d l Z d d l m Z m Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z y d d l j Z Wn e k r� d d l Z Yn Xe j d d � d d f k r� d d l Z y d d l m Z m Z m Z WnB e k r-e e j � Z e e � j � Z e e j � Z Yn Xd d d d d d d d d d d d d d d d d d d d d d d d d d d! d" d# d$ d% d& d' d( d) d* d+ d, d- d. d/ d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 d: g4 Z d; d< � Z d= d> � Z Gd? d@ � d@ e � Z GdA dB � dB dC e dD dE �Z GdF dG � dG e dD dE �Z GdH dI � dI e dD dE �Z GdJ dK � dK e dD dE �Z dL dM � Z dN dO � Z! dP dQ � Z" dR dS � Z# dT dU � Z$ GdV dW � dW e dD dE �Z% e% dD dE � Z& GdX dY � dY e dD dE �Z' e' dD dE � Z( GdZ d � d e dD dE �Z) e) d[ � Z* e) d\ � Z+ e) d] � Z, e) d^ d_ dE �Z- e) d` d_ dE �Z. e) da d_ dE �Z/ e) db dc dE �Z0 e) d2 e1 e � Z2 dd de � Z3 d d df dg � Z4 dh di � Z5 dj dk � Z6 g Z7 dl dm � Z8 Gdn do � do e dD dE �Z9 e9 dD dE � Z: Gdp dq � dq e dD dE �Z; e; dD dE � Z< dr ds � Z= dt du � Z> dv dw � Z? dx dy � Z@ dz d{ � ZA Gd| d � d e e jB � ZC d ZD d} d~ � ZE Gd d � d dC eC �ZD Gd� d� � d� � ZF Gd� d� � d� � ZG Gd� d� � d� eC � ZH Gd� d � d eI d� eI dC eH �ZJ Gd� d� � d� eC � ZK Gd� d � d d� e jL dC eK �ZL Gd� d� � d� e dD dE �ZM eM dD dE � ZN d� d3 � ZO d� d� � ZP e jQ e jR e jS e jT e e e f ZU d d d� d4 � ZV d� d6 � ZW d� d7 � ZX d� d� � ZY d� d8 � ZZ Gd� d� � d� eC � Z[ Gd� d� � d� dC e[ �Z\ e j] Z] e^ e d� � rwGd� d� � d� eD e- d� e j_ �Z_ e j` d� � e^ e d� � r�Gd� d� � d� e_ e. eD e- e0 e. f d� e ja �Za e j` d� � e^ e d� � r5Gd� d� � d� eD e- d� e jb �Zb Gd� d� � d� eb e- d� e jc �Zc e j` d� � e j` d� � Gd� d � d eD e- d� e jd �Zd Gd� d � d ed e- d� e je �Ze Gd� d' � d' e\ � Zf Gd� d& � d& e\ � Zg Gd� d% � d% e\ � Zh Gd� d$ � d$ e\ � Zi Gd� d# � d# e\ e- � Zj Gd� d( � d( e\ e- � Zk e^ e d" � r<Gd� d" � d" ed e- d� e jl �Zl n Gd� d" � d" e\ e- � Zl e jm Zm Gd� d � d eD e- d� e jn �Zn e^ e d� � r�Gd� d� � d� em ed e- en e- d� e jo �Zo e j` d� � e^ e d� � r Gd� d � d eo e- d� e jp �Zq n- Gd� d � d em ed e- en e- d� e jp �Zq Gd� d � d eq e* d� e jr �Zr e^ e d� � r� Gd� d � d eo e+ eD e+ e/ f d� e js �Zs n: Gd� d � d em ed e+ en e+ eD e+ e/ f d� e js �Zs Gd� d � d es e+ e, f d� e jt �Zt e^ e d" � rp e^ e d� � r@ Gd� d � d el e- eo e- d� e ju �Zu n- Gd� d � d em el e- en e- d� e ju �Zu n- Gd� d � d em ed e- en e- d� e ju �Zu Gd� d � d eu e* d� e jv �Zv Gd� d � d eu ew d� e jx �Zx Gd� d- � d- ey ev e* d� ey �Zz Gd� d* � d* e j{ ev e* d� e j{ �Z| Gd� d. � d. e} er e* d� e} �Zp Gd� d/ � d/ e~ eq e- d� e~ �Z Gd� d � d em ed e- d� e j� �Z� Gd� d � d e� e+ eq e+ d� e j� �Z� Gd� d � d e� eJ e+ e/ f eq eJ e+ e/ f eD e+ e/ f d� e j� �Z� Gd� d! � d! e� e/ d� e j� �Z� e^ e d� � rh Gd� d � d eD e- d� e j� �Z� n Gd� d � d eD e- � Z� e^ e d� � r� Gd� d� � d� eD e- d� e j� �Z� e j` d� � n) e j d d � d d� f k r� e� d� � Gd� d+ � d+ e� et e+ e, f d� e� �Z� Gd� d, � d, e j� et e+ e, f d� e j� �Z� Gd� d) � d) e j� e� e* ew f d� e j� �Z� e^ e d� � r� e j` d� � Gd� d� � d� e j� et e+ e, f d� e j� �Z� e^ e d1 � r� e j� Z� n e j� Z� Gd� d1 � d1 ee e- eD e- e0 e. f d� e� �Z� e^ e d� � r_Gd� d� � d� ec e- eD e- e0 f d� e j� �Z� e j` d� � e) d� d_ dE d� e �Z� Gd� d � d eD e� d� e �Z� d� d� � Z� e j d d � d d f k Z� d� d� d� d� d� d� d� d� d� d� d� f Z� d� d� d� d� f Z� Gd� d� � d� e � Z� Gd� d0 � d0 dC e� �Z� d� d5 � Z� e Z� d� Z� Gd� d� � d� eD e2 � Z� Gd� d� � d� e� e1 � Z� Gd� d� � d� e� e � Z� Gd� d� � d� � Z� e� d� e� _� e� e j� e� j� <e d� e2 e e j� d� � � d� d� � � Z� e d� e2 e e j� d� d� � � d� d� � � Z� Gd� d� � d� � Z e� d� e _� e e j� e j� <d S)�� N)�abstractmethod�abstractproperty� � � )�WrapperDescriptorType�MethodWrapperType�MethodDescriptorType�Any�Callable�ClassVar�Generic�Optional�Tuple�Type�TypeVar�Union� AbstractSet� GenericMeta� ByteString� Container�ContextManager�Hashable� ItemsView�Iterable�Iterator�KeysView�Mapping� MappingView�MutableMapping�MutableSequence� MutableSet�Sequence�Sized� ValuesView� Reversible� SupportsAbs� SupportsBytes�SupportsComplex� SupportsFloat� SupportsInt� SupportsRound�Counter�Deque�Dict� DefaultDict�List�Set� FrozenSet� NamedTuple� Generator�AnyStr�cast�get_type_hints�NewType� no_type_check�no_type_check_decorator�overload�Text� TYPE_CHECKINGc C s+ t j d d � d k r | j S| j Sd S)Nr r )r r )�sys� version_info� __qualname__�__name__)�x� rC �+/opt/alt/python35/lib64/python3.5/typing.py� _qualnameg s rE c C s5 d } | j d � r1 | | k r1 | d d � } | S)N� _TypeAlias� _ForwardRef� _TypingBase�_FinalTypingBase�_� )rF rG rH rI )� startswith)ZnmZ whitelistrC rC rD � _trim_nameo s rM c sd e Z d Z d Z d Z d d � f d d � Z d d � Z d d � Z d d � Z d d � Z � S)� TypingMetaa� Metaclass for most types defined in typing module (not a part of public API). This overrides __new__() to require an extra keyword parameter '_root', which serves as a guard against naive subclassing of the typing classes. Any legitimate class defined using a metaclass derived from TypingMeta must pass _root=True. This also defines a dummy constructor (all the work for most typing constructs is done in __new__) and a nicer repr(). F�_rootc sG | s. t d d j t t | � � p' d � � t � j | | | | � S)NzCannot subclass %sz, z())� TypeError�join�map� _type_repr�super�__new__)�cls�name�bases� namespacerO )� __class__rC rD rU � s "zTypingMeta.__new__c O s d S)NrC )�self�args�kwdsrC rC rD �__init__� s zTypingMeta.__init__c C s | S)a' Override this in subclasses to interpret forward references. For example, List['C'] is internally stored as List[_ForwardRef('C')], which should evaluate to List[C], where C is an object found in globalns or localns (searching localns first, of course). rC )r[ �globalns�localnsrC rC rD � _eval_type� s zTypingMeta._eval_typec C s d S)NrC )r[ �tvarsrC rC rD �_get_type_vars� s zTypingMeta._get_type_varsc C s# t t | � � } d | j | f S)Nz%s.%s)rM rE � __module__)r[ �qnamerC rC rD �__repr__� s zTypingMeta.__repr__) rA rd r@ �__doc__� _is_protocolrU r^ ra rc rf rC rC )rZ rD rN v s rN c sj e Z d Z d Z d Z d d � Z � f d d � Z d d � Z d d � Z d d � Z d d � Z � S)rH z0Internal indicator of special typing constructs.� __weakref__c O s d S)NrC )r[ r\ r] rC rC rD r^ � s z_TypingBase.__init__c sX t | � d k rH t | d t � rH t | d t � rH t d | � � t � j | � S)z�Constructor. This only exists to give a better error message in case someone tries to subclass a special typing object (not a good idea). r r rK zCannot subclass %r)�len� isinstance�str�tuplerP rT rU )rV r\ r] )rZ rC rD rU � s z_TypingBase.__new__c C s | S)NrC )r[ r_ r` rC rC rD ra � s z_TypingBase._eval_typec C s d S)NrC )r[ rb rC rC rD rc � s z_TypingBase._get_type_varsc C s/ t | � } t t | � � } d | j | f S)Nz%s.%s)�typerM rE rd )r[ rV re rC rC rD rf � s z_TypingBase.__repr__c O s t d t | � � � d S)NzCannot instantiate %r)rP rn )r[ r\ r] rC rC rD �__call__� s z_TypingBase.__call__)ri ) rA rd r@ rg � __slots__r^ rU ra rc rf ro rC rC )rZ rD rH � s rH � metaclassrO Tc s@ e Z d Z d Z f Z d d � f d d � Z d d � Z � S)rI z�Internal mix-in class to prevent instantiation. Prevents instantiation unless _root=True is given in class call. It is used to create pseudo-singleton instances Any, Union, Optional, etc. rO Fc s< t � j | | | � } | d k r( | St d | � � d S)NTzCannot instantiate %r)rT rU rP )rV rO r\ r] r[ )rZ rC rD rU � s z_FinalTypingBase.__new__c C s t t | � j � S)N)rM rn rA )r[ rC rC rD � __reduce__� s z_FinalTypingBase.__reduce__)rA rd r@ rg rp rU rr rC rC )rZ rD rI � s rI c sv e Z d Z d Z d Z � f d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z � S)rG z-Internal wrapper to hold a forward reference.�__forward_arg__�__forward_code__�__forward_evaluated__�__forward_value__c s� t � j | � t | t � s2 t d | f � � y t | d d � } Wn% t k ro t d | f � � Yn X| | _ | | _ d | _ d | _ d S)Nz,Forward reference must be a string -- got %rz<string>�evalz1Forward reference must be an expression -- got %rF) rT r^ rk rl rP �compile� SyntaxErrorrs rt ru rv )r[ �arg�code)rZ rC rD r^ � s z_ForwardRef.__init__c C s� | j s | | k r� | d k r; | d k r; i } } n' | d k rP | } n | d k rb | } t t | j | | � d � | _ d | _ | j S)Nz*Forward references must evaluate to types.T)ru � _type_checkrw rt rv )r[ r_ r` rC rC rD ra � s z_ForwardRef._eval_typec C s5 t | t � s t S| j | j k o4 | j | j k S)N)rk rG �NotImplementedrs rv )r[ �otherrC rC rD �__eq__� s z_ForwardRef.__eq__c C s t | j | j f � S)N)�hashrs rv )r[ rC rC rD �__hash__ s z_ForwardRef.__hash__c C s t d � � d S)Nz4Forward references cannot be used with isinstance().)rP )r[ �objrC rC rD �__instancecheck__ s z _ForwardRef.__instancecheck__c C s t d � � d S)Nz4Forward references cannot be used with issubclass().)rP )r[ rV rC rC rD �__subclasscheck__ s z _ForwardRef.__subclasscheck__c C s d | j f S)Nz_ForwardRef(%r))rs )r[ rC rC rD rf s z_ForwardRef.__repr__)rs rt ru rv ) rA rd r@ rg rp r^ ra r r� r� r� rf rC rC )rZ rD rG � s rG c @ sp e Z d Z d Z d Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d S)rF a: Internal helper class for defining generic variants of concrete types. Note that this is not a type; let's call it a pseudo-type. It cannot be used in instance and subclass checks in parameterized form, i.e. ``isinstance(42, Match[str])`` raises ``TypeError`` instead of returning ``False``. rW �type_var� impl_type� type_checkerc C s� t | t � s! t t | � � � t | t � sB t t | � � � t | t � sd t t | � � � t | t t f � s� t t | � � � | | _ | | _ | | _ | | _ d S)at Initializer. Args: name: The name, e.g. 'Pattern'. type_var: The type parameter, e.g. AnyStr, or the specific type, e.g. str. impl_type: The implementation type. type_checker: Function that takes an impl_type instance. and returns a value that should be a type_var instance. N) rk rl �AssertionError�reprrn rN rH rW r� r� r� )r[ rW r� r� r� rC rC rD r^ s !!"' z_TypeAlias.__init__c C s d | j t | j � f S)Nz%s[%s])rW rS r� )r[ rC rC rD rf , s z_TypeAlias.__repr__c C s� t | j t � s" t d | � � | j j rk t | t � rk t | | j j � sk t d | | j f � � t | t � r� | | j k r� t d | � � | j | j | | j | j � S)Nz#%s cannot be further parameterized.z&%s is not a valid substitution for %s.z %s cannot be re-parameterized.) rk r� r rP �__constraints__rn � issubclassrZ rW r� r� )r[ Z parameterrC rC rD � __getitem__/ s z_TypeAlias.__getitem__c C s5 t | t � s t S| j | j k o4 | j | j k S)N)rk rF r} rW r� )r[ r~ rC rC rD r ; s z_TypeAlias.__eq__c C s t | j | j f � S)N)r� rW r� )r[ rC rC rD r� @ s z_TypeAlias.__hash__c C s. t | j t � s t d � � t | | j � S)Nz<Parameterized type aliases cannot be used with isinstance().)rk r� r rP r� )r[ r� rC rC rD r� C s z _TypeAlias.__instancecheck__c C s. t | j t � s t d � � t | | j � S)Nz<Parameterized type aliases cannot be used with issubclass().)rk r� r rP r� r� )r[ rV rC rC rD r� I s z _TypeAlias.__subclasscheck__N)rW r� r� r� ) rA rd r@ rg rp r^ rf r� r r� r� r� rC rC rC rD rF s rF c C s@ x9 | D]1 } t | t � s+ t | t � r | j | � q Wd S)N)rk rN rH rc )�typesrb �trC rC rD rc P s rc c C s g } t | | � t | � S)N)rc rm )r� rb rC rC rD � _type_varsV s r� c C s2 t | t � s t | t � r. | j | | � S| S)N)rk rN rH ra )r� r_ r` rC rC rD ra \ s ra c C s� | d k r t d � St | t � r1 t | � } t | t � rU t | � j d k sx t | t t f � r� t | � r� t | d | f � � t | � j d k r� t | d d � s� t | t � r� t | � t t f k r� t d | � � | S) a� Check that the argument is a type, and return it (internal helper). As a special case, accept None and return type(None) instead. Also, _TypeAlias instances (e.g. Match, Pattern) are acceptable. The msg argument is a human-readable error message, e.g. "Union[arg, ...]: arg should be a type." We append the repr() of the actual value (truncated to 100 chars). N� _ClassVarz Got %.100r.�_Union� _Optional� __origin__z&Plain %s is not valid as type argument)r� r� ) rn rk rl rG rH rA �callablerP �getattrrN �_gorgr � _Protocol)rz �msgrC rC rD r| b s $#'r| c C s� t | t � rO t | t � rO | j d k r8 t | � Sd | j t | � f S| d k r_ d St | t j � rx | j St | � S)a; Return the repr() of an object, special-casing types (internal helper). If obj is a type, we return a shorter version than the default type.__repr__, based on the module and qualified name, which is typically enough to uniquely identify a type. For everything else, we fall back on repr(obj). �builtinsz%s.%s.z...) rk rn rN rd rE r� � FunctionTyperA r� )r� rC rC rD rS � s rS c @ s4 e Z d Z d Z f Z d d � Z d d � Z d S)�_Anya` Special type indicating an unconstrained type. - Any is compatible with every type. - Any assumed to have all methods. - All values assumed to be instances of Any. Note that all the above statements are true from the point of view of static type checkers. At runtime, Any should not be used with instance or class checks. c C s t d � � d S)Nz%Any cannot be used with isinstance().)rP )r[ r� rC rC rD r� � s z_Any.__instancecheck__c C s t d � � d S)Nz%Any cannot be used with issubclass().)rP )r[ rV rC rC rD r� � s z_Any.__subclasscheck__N)rA rd r@ rg rp r� r� rC rC rC rD r� � s r� c @ s4 e Z d Z d Z f Z d d � Z d d � Z d S)� _NoReturna Special type indicating functions that never return. Example:: from typing import NoReturn def stop() -> NoReturn: raise Exception('no way') This type is invalid in other positions, e.g., ``List[NoReturn]`` will fail in static type checkers. c C s t d � � d S)Nz*NoReturn cannot be used with isinstance().)rP )r[ r� rC rC rD r� � s z_NoReturn.__instancecheck__c C s t d � � d S)Nz*NoReturn cannot be used with issubclass().)rP )r[ rV rC rC rD r� � s z_NoReturn.__subclasscheck__N)rA rd r@ rg rp r� r� rC rC rC rD r� � s r� c sp e Z d Z d Z d Z d d d d d d � f d d � Z d d � Z d d � Z d d � Z d d � Z � S)r a� Type variable. Usage:: T = TypeVar('T') # Can be anything A = TypeVar('A', str, bytes) # Must be str or bytes Type variables exist primarily for the benefit of static type checkers. They serve as the parameters for generic types as well as for generic function definitions. See class Generic for more information on generic types. Generic functions work as follows: def repeat(x: T, n: int) -> List[T]: '''Return a list containing n references to x.''' return [x]*n def longest(x: A, y: A) -> A: '''Return the longest of two strings.''' return x if len(x) >= len(y) else y The latter example's signature is essentially the overloading of (str, str) -> str and (bytes, bytes) -> bytes. Also note that if the arguments are instances of some subclass of str, the return type is still plain str. At runtime, isinstance(x, T) and issubclass(C, T) will raise TypeError. Type variables defined with covariant=True or contravariant=True can be used do declare covariant or contravariant generic types. See PEP 484 for more details. By default generic types are invariant in all type variables. Type variables can be introspected. e.g.: T.__name__ == 'T' T.__constraints__ == () T.__covariant__ == False T.__contravariant__ = False A.__constraints__ == (str, bytes) rA � __bound__r� � __covariant__�__contravariant__�boundN� covariantF� contravariantc s� t � j | | d | d | d | �| | _ | rF | rF t d � � t | � | _ t | � | _ | r� | d k r� t d � � | r� t | � d k r� t d � � d � t � f d d � | D� � | _ | r� t | d � | _ n d | _ d S) Nr� r� r� z"Bivariant types are not supported.z-Constraints cannot be combined with bound=...rK z"A single constraint is not allowedz:TypeVar(name, constraint, ...): constraints must be types.c 3 s | ] } t | � � Vq d S)N)r| )�.0r� )r� rC rD � <genexpr> s z#TypeVar.__init__.<locals>.<genexpr>zBound must be a type.) rT r^ rA � ValueError�boolr� r� rP rj rm r� r| r� )r[ rW r� r� r� Z constraints)rZ )r� rD r^ � s "zTypeVar.__init__c C s | | k r | j | � d S)N)�append)r[ rb rC rC rD rc s zTypeVar._get_type_varsc C s5 | j r d } n | j r$ d } n d } | | j S)N�+�-�~)r� r� rA )r[ �prefixrC rC rD rf s zTypeVar.__repr__c C s t d � � d S)Nz0Type variables cannot be used with isinstance().)rP )r[ �instancerC rC rD r� s zTypeVar.__instancecheck__c C s t d � � d S)Nz0Type variables cannot be used with issubclass().)rP )r[ rV rC rC rD r� s zTypeVar.__subclasscheck__)rA r� r� r� r� ) rA rd r@ rg rp r^ rc rf r� r� rC rC )rZ rD r � s ( �T�KT�VT�T_cor� �V_co�VT_co�T_contrar� c C s� | d k r g } t | d � rF t | t t f � rF | j | | � St | t � r� x. t | � D] \ } } | | k rb | | Sqb W| S)z�An internal helper function: replace arg if it is a type variable found in tvars with corresponding substitution from args or with corresponding substitution sub-tree if arg is a generic type. N� _subs_tree)�hasattrrk r rH r� r � enumerate)rz rb r\ �iZtvarrC rC rD � _replace_arg) s $ r� c C s� | j d k r | S| j } g } x) | j d k rM | j | � | j } q% Wg } x* | j D] } | j t | | | � � q^ WxJ | D]B } g } x- | j D]" } | j t | | j | � � q� W| } q� W| S)a� An internal helper function: calculate substitution tree for generic cls after replacing its type parameters with substitutions in tvars -> args (if any). Repeat the same following __origin__'s. Return a list of arguments with all possible substitutions performed. Arguments that are generic classes themselves are represented as tuples (so that no new classes are created by this function). For example: _subs_tree(List[Tuple[int, T]][str]) == [(Tuple, int, str)] N)r� r� �__args__r� �__parameters__) rV rb r\ ZcurrentZ orig_chain� tree_argsrz ZoclsZ new_tree_argsrC rC rD r� D s r� c s� g } x� | D]� } t | t � rD | j t k rD | j | j � q t | t � r� t | � d k r� | d t k r� | j | d d � � q | j | � q Wt | � � t � � t | � k rg } x4 | D], } | � k r� | j | � � j | � q� W| } � st � � � t | � � xS | D]K � t � t � sEq-t � f d d � � � h D� � r-� j � � q-Wt � f d d � | D� � S)z�An internal helper for Union creation and substitution: flatten Union's among parameters, then remove duplicates and strict subclasses. r rK Nc 3 sK | ]A } t | t � o$ | j d k s t | t � oB t � | � Vq d S)N)rk r r� rn r� )r� Zt2)�t1rC rD r� � s z'_remove_dups_flatten.<locals>.<genexpr>c 3 s! | ] } | � k r | Vq d S)NrC )r� r� )� all_paramsrC rD r� � s )rk r� r� r �extendr� rm rj r� �set�remover� rn �any)� parameters�params�pZ new_paramsr� rC )r� r� rD �_remove_dups_flattene s0 1 r� c C s~ | j s t d t | � � � t | � } t | j � } | | k rz t d | | k r^ d n d t | � | | f � � d S)Nz%s is not a generic classz0Too %s parameters for %s; actual %s, expected %sZmanyZfew)r� rP r� rj )rV r� ZalenZelenrC rC rD �_check_generic� s r� c sJ t j � � � � t j � j � t j � � � � f d d � � } | S)zInternal wrapper caching __getitem__ of generic types with a fallback to original function for non-hashable arguments. c s3 y � | | � SWn t k r% Yn X� | | � S)N)rP )r\ r] )�cached�funcrC rD �inner� s z_tp_cache.<locals>.inner)� functools� lru_cache� _cleanupsr� � cache_clear�wraps)r� r� rC )r� r� rD � _tp_cache� s $r� c s� e Z d Z d Z d Z d d d d � f d d �Z d d � Z d d � Z � f d d � Z � f d d � Z e d d � � Z d d d d � Z d d � Z d d � Z d d � Z d d � Z � S) r� a� Union type; Union[X, Y] means either X or Y. To define a union, use e.g. Union[int, str]. Details: - The arguments must be types and there must be at least one. - None as an argument is a special case and is replaced by type(None). - Unions of unions are flattened, e.g.:: Union[Union[int, str], float] == Union[int, str, float] - Unions of a single argument vanish, e.g.:: Union[int] == int # The constructor actually returns int - Redundant arguments are skipped, e.g.:: Union[int, str, int] == Union[int, str] - When comparing unions, the argument order is ignored, e.g.:: Union[int, str] == Union[str, int] - When two arguments have a subclass relationship, the least derived argument is kept, e.g.:: class Employee: pass class Manager(Employee): pass Union[int, Employee, Manager] == Union[int, Employee] Union[Manager, int, Employee] == Union[int, Employee] Union[Employee, Manager] == Employee - Similar for object:: Union[int, object] == object - You cannot subclass or instantiate a union. - You can use Optional[X] as a shorthand for Union[X, None]. r� r� r� � __tree_hash__NrO Fc s t � j | | | | d | �} | d k ra d | _ d | _ d | _ t t d � � | _ | St | t � s| t d � � | t k r� t | � } t | � d k r� | d St | � | _ | | _ | | _ | j � } t | t � rt t | � � | _ n t | � | _ | S)NrO r zExpected parameters=<tuple>rK r )r )rT rU r� r� r� r� � frozensetr� rk rm rP r r� rj r� r� )rV r� �originrO r\ r[ Z subs_tree)rZ rC rD rU � s* ! z_Union.__new__c s� | j d k r | St � � f d d � | j D� � } t | j � � � } | | j k ro | | j k ro | S| j | | d d �S)Nc 3 s! | ] } t | � � � Vq d S)N)ra )r� r� )r_ r` rC rD r� � s z$_Union._eval_type.<locals>.<genexpr>rO T)r� rm ra r� rZ )r[ r_ r` �ev_args� ev_originrC )r_ r` rD ra � s % z_Union._eval_typec C s& | j r" | j r" t | j | � d S)N)r� r� rc )r[ rb rC rC rD rc s z_Union._get_type_varsc sR | j d k r t � j � S| j � } t | t � sA t | � S| d j | � S)Nr )r� rT rf r� rk rm r� � _tree_repr)r[ �tree)rZ rC rD rf s z_Union.__repr__c s~ g } xW | d d � D]E } t | t � sB | j t | � � q | j | d j | � � q Wt � j � d d j | � S)NrK r z[%s]z, )rk rm r� rS r� rT rf rQ )r[ r� �arg_listrz )rZ rC rD r� s z_Union._tree_reprc s� | f k r t d � � t | t � s0 | f } | j d k rH d � n d � t � f d d � | D� � } | t k r� t | | � | j | d | d d �S) Nz Cannot take a Union of no types.z)Union[arg, ...]: each arg must be a type.z*Parameters to generic types must be types.c 3 s | ] } t | � � Vq d S)N)r| )r� r� )r� rC rD r� s z%_Union.__getitem__.<locals>.<genexpr>r� rO T)rP rk rm r� r r� rZ )r[ r� rC )r� rD r� s z_Union.__getitem__c C sS | t k r t St | | | � } t | � } t | � d k rH | d St f | S)NrK r )r r� r� rj )r[ rb r\ r� rC rC rD r� % s z_Union._subs_treec C sI t | t � r | j | j k S| t k r; | j � | k S| | k Sd S)N)rk r� r� r r� )r[ r~ rC rC rD r . s z _Union.__eq__c C s | j S)N)r� )r[ rC rC rD r� 6 s z_Union.__hash__c C s t d � � d S)Nz(Unions cannot be used with isinstance().)rP )r[ r� rC rC rD r� 9 s z_Union.__instancecheck__c C s t d � � d S)Nz(Unions cannot be used with issubclass().)rP )r[ rV rC rC rD r� < s z_Union.__subclasscheck__)r� r� r� r� )rA rd r@ rg rp rU ra rc rf r� r� r� r� r r� r� r� rC rC )rZ rD r� � s * r� c @ s. e Z d Z d Z f Z e d d � � Z d S)r� zEOptional type. Optional[X] is equivalent to Union[X, None]. c C s# t | d � } t | t d � f S)Nz#Optional[t] requires a single type.)r| r rn )r[ rz rC rC rD r� K s z_Optional.__getitem__N)rA rd r@ rg rp r� r� rC rC rC rD r� C s r� c C s8 t | t � s t � x | j d k r3 | j } q W| S)z@Return the farthest origin of a generic class (internal helper).N)rk r r� r� )�arC rC rD r� T s r� c C s: t | t � r t | t � s$ t � t | � t | � k S)a6 Return whether two generic classes are equivalent (internal helper). The intention is to consider generic class X and any of its parameterized forms (X[T], X[int], etc.) as equivalent. However, X is not equivalent to a subclass of X. The relation is reflexive, symmetric and transitive. )rk r r� r� )r� �brC rC rD �_geqv\ s $r� c C sf t } xY t | j d d � � D]> \ } } t | t � r t | � t k r | j | d } q W| S)z�Helper for Generic.__new__. Returns the class after the last occurrence of Generic or Generic[...] in cls.__mro__. NrK ���)�objectr� �__mro__rk r r� r )rV Z next_in_mror� �crC rC rD � _next_in_mrok s &!r� c s@ t � j t j � r* � f d d � } n � f d d � } | S)z�Construct a __subclasshook__ callable that incorporates the associated __extra__ class in subclass checks performed against cls. c s{ � j j | � } | t k r" | S� j | j k r8 d Sx< � j j � D]+ } t | t � r` qH t | | � rH d SqH Wt S)NT)� __extra__�__subclasshook__r} r� �__subclasses__rk r r� )�subclass�res�scls)rV rC rD � __extrahook__� s z)_make_subclasshook.<locals>.__extrahook__c s# � j r t | � j � r d St S)NT)r� r� r} )r� )rV rC rD r� � s )rk r� �abc�ABCMeta)rV r� rC )rV rD �_make_subclasshooky s r� c C sA t | � } d | k r= x" | d D] } | j | d � q# W| S)z�Internal helper: copy class __dict__ and clean slots class variables. (They will be re-created if necessary by normal class machinery.) rp N)�dict�pop)ZdctZ dict_copyZslotrC rC rD �_no_slots_copy� s r� c s9 e Z d Z d Z d d d d d � f d d � Z e d d � � Z e j d d � � Z e d d � � Z e j d d � � Z d d � Z d d � Z � f d d � Z � f d d � Z d d d d � Z d d � Z d d � Z e d d � � Z � f d d � Z d d � Z d d � Z � f d! d" � Z � S)#r ac Metaclass for generic types. This is a metaclass for typing.Generic and generic ABCs defined in typing module. User defined subclasses of GenericMeta can override __new__ and invoke super().__new__. Note that GenericMeta.__new__ has strict rules on what is allowed in its bases argument: * plain Generic is disallowed in bases; * Generic[...] should appear in bases at most once; * if Generic[...] is present, then it should list all type variables that appear in other bases. In addition, type of all generic bases is erased, e.g., C[int] is stripped to plain C. Nc s� | d k rF | d k s t � t d d � | D� � s�t | � � nI| d k s^ t | � � | d k sv t | � � | d k s� t | � � t | � } d } xe | D]] } | t k r� t d � � t | t � r� | j t k r� | d k r� t d � � | j } q� W| d k r | } nr t | � } t | � � | � k s�t d d j � f d d � | D� � d j d d � | D� � f � � | } | } | d k r�t | � t j k r�| | k r�| f | } t d d � | D� � } t d d � | D� � rt d d � | D� � } | j d | d | i � t � j | | | | d d �} | | _ | r|t d d � | D� � n d | _ t | � | _ | d k r�| | _ d | k r�| s�t | j d d � d k r�t | � | _ t | t j � r| j | _ | j | _ n$ | d k r6| j | _ | j | _ | rWt | d � rW| j | _ | rot | j � � n t t | � j � | _! | S)z�Create a new generic class. GenericMeta.__new__ accepts keyword arguments that are used for internal bookkeeping, therefore an override should pass unused keyword arguments to super(). Nc s s | ] } t | t � Vq d S)N)rk r )r� r� rC rC rD r� � s z&GenericMeta.__new__.<locals>.<genexpr>z!Cannot inherit from plain Genericz0Cannot inherit from Generic[...] multiple types.z6Some type variables (%s) are not listed in Generic[%s]z, c 3 s' | ] } | � k r t | � Vq d S)N)rl )r� r� )�gvarsetrC rD r� � s c s s | ] } t | � Vq d S)N)rl )r� �grC rC rD r� � s c s s0 | ]& } t | t � r$ t | � n | Vq d S)N)rk r r� )r� r� rC rC rD r� � s c s s* | ] } t | t � o! | t k Vq d S)N)rk r r )r� r� rC rC rD r� � s c s s! | ] } | t k r | Vq d S)N)r )r� r� rC rC rD r� � s r� r� rO Tc s s9 | ]/ } | t k r d n | t k r- f n | Vq d S).N)�_TypingEllipsis� _TypingEmpty)r� r� rC rC rD r� � s r� rA � r� r@ )"r� �allr� r rP rk r r� r� r� rQ rn r� r� rm r� �updaterT rU r� r� �__next_in_mro__�__orig_bases__r� r� r� � _abc_registry� _abc_cacher� r@ r� r� r� r� )rV rW rX rY rb r\ r� �extra� orig_basesZgvars�baseZtvarsetZ initial_basesr[ )rZ )r� rD rU � sl ( #- ! ( zGenericMeta.__new__c C s, t | j t j � r | j j St | � j S)N)rk r� r� r� �_abc_negative_cacher� �_abc_generic_negative_cache)r[ rC rC rD r� s z GenericMeta._abc_negative_cachec C s@ | j d k r< t | j t j � r3 | | j _ n | | _ d S)N)r� rk r� r� r� r� r� )r[ �valuerC rC rD r� s c C s, t | j t j � r | j j St | � j S)N)rk r� r� r� �_abc_negative_cache_versionr� �#_abc_generic_negative_cache_version)r[ rC rC rD r� s z'GenericMeta._abc_negative_cache_versionc C s@ | j d k r< t | j t j � r3 | | j _ n | | _ d S)N)r� rk r� r� r� r� r� )r[ r� rC rC rD r� $ s c C s& | j r" | j r" t | j | � d S)N)r� r� rc )r[ rb rC rC rD rc , s zGenericMeta._get_type_varsc s� | j r | j j � � � n d } | j rR t � � f d d � | j D� � n d } | | j k rz | | j k rz | S| j | j | j t | j � d | r� t | � n d d | d | d | j d | j �S)Nc 3 s! | ] } t | � � � Vq d S)N)ra )r� r� )r_ r` rC rD r� 3 s z)GenericMeta._eval_type.<locals>.<genexpr>rb r\ r� r� r� ) r� ra r� rm rZ rA � __bases__r� �__dict__r� r� r� )r[ r_ r` r� r� rC )r_ r` rD ra 0 s $4 zGenericMeta._eval_typec s/ | j d k r t � j � S| j | j � � S)N)r� rT rf r� r� )r[ )rZ rC rD rf @ s zGenericMeta.__repr__c s� g } xs | d d � D]a } | f k r9 | j d � q t | t � s^ | j t | � � q | j | d j | � � q Wt � j � d d j | � S)NrK z()r z[%s]z, )r� rk rm rS r� rT rf rQ )r[ r� r� rz )rZ rC rD r� E s zGenericMeta._tree_reprc C s< | j d k r | St | | | � } t | � f t | � S)N)r� r� r� rm )r[ rb r\ r� rC rC rD r� P s zGenericMeta._subs_treec C sK t | t � s t S| j d k s1 | j d k r; | | k S| j | j k S)N)rk r r} r� r� )r[ r~ rC rC rD r V s zGenericMeta.__eq__c C s | j S)N)r� )r[ rC rC rD r� ] s zGenericMeta.__hash__c s� t | t � s | f } | rG t | � t k rG t d t | � � � d � t � f d d � | D� � } | t k r� t d d � | D� � s� t d � � t t | � � t | � k r� t d � � | } | } n� | t t f k r� t | � } | } nh | t k r| } | } nM | j t t f k rFt d t | � � � n t | | � t | � } | } | j d k r}| f n f } | j | j | | j t | j � d | d | d | d | j d | j �S)Nz)Parameter list to %s[...] cannot be emptyz*Parameters to generic types must be types.c 3 s | ] } t | � � Vq d S)N)r| )r� r� )r� rC rD r� h s z*GenericMeta.__getitem__.<locals>.<genexpr>c s s | ] } t | t � Vq d S)N)rk r )r� r� rC rC rD r� k s z5Parameters to Generic[...] must all be type variablesz-Parameters to Generic[...] must all be uniquez'Cannot subscript already-subscripted %srb r\ r� r� r� )rk rm r� r rP rE r r� rj r� r r� r� r� r� r� rZ rA r r� r r� r� )r[ r� rb r\ ZprependrC )r� rD r� ` sJ zGenericMeta.__getitem__c sg | j d k r; t j d � j d d k r7 t d � � d S| t k rW t d | � � t � j | � S) NrK rA r� r� zCParameterized generics cannot be used with class or instance checksFz5Class %r cannot be used with class or instance checks)r� r� )r� r> � _getframe� f_globalsrP r rT r� )r[ rV )rZ rC rD r� � s z GenericMeta.__subclasscheck__c C s t | j | � S)N)r� rZ )r[ r� rC rC rD r� � s z GenericMeta.__instancecheck__c C s@ | j | j | j t | j � | j | j | j | j | j � S)N) rZ rA r r� r r� r� r� r� r� )r[ rC rC rD �__copy__� s zGenericMeta.__copy__c sl | j d � r | j d � s- | j d � rI t t | � j | | � n t t t | � � j | | � d S)N�__�_abc_)rL �endswithrT r � __setattr__r� )r[ �attrr� )rZ rC rD r � s zGenericMeta.__setattr__)rA rd r@ rg rU �propertyr� �setterr� rc ra rf r� r� r r� r� r� r� r� r r rC rC )rZ rD r � s$ !^ . c O sq | j d k r | j | � St | � } | j | � } y | | _ Wn t k rX Yn X| j | | � | Sd S)N)r� rU r� Z__orig_class__�AttributeErrorr^ )Zbase_clsrV r\ r] r� r� rC rC rD � _generic_new� s r c @ s( e Z d Z d Z f Z d d � Z d S)r aC Abstract base class for generic types. A generic type is typically declared by inheriting from this class parameterized with one or more type variables. For example, a generic mapping type might be defined as:: class Mapping(Generic[KT, VT]): def __getitem__(self, key: KT) -> VT: ... # Etc. This class can then be used as follows:: def lookup_name(mapping: Mapping[KT, VT], key: KT, default: VT) -> VT: try: return mapping[key] except KeyError: return default c O s1 t | t � r t d � � t | j | | | � S)NzHType Generic cannot be instantiated; it can be used only as a base class)r� r rP r r� )rV r\ r] rC rC rD rU � s zGeneric.__new__N)rA rd r@ rg rp rU rC rC rC rD r � s c @ s e Z d Z d Z d S)r� z�Internal placeholder for () or []. Used by TupleMeta and CallableMeta to allow empty list/tuple in specific places, without allowing them to sneak in where prohibited. N)rA rd r@ rg rC rC rC rD r� � s r� c @ s e Z d Z d Z d S)r� z(Internal placeholder for ... (ellipsis).N)rA rd r@ rg rC rC rC rD r� � s r� c sF e Z d Z d Z e � f d d � � Z d d � Z d d � Z � S)� TupleMetaz Metaclass for Tuple (internal).c s� | j d k s t | t � r/ t � j | � S| f k rN t � j t f � St | t � sf | f } t | � d k r� | d d k r� d � t | d � � } t � j | t f � Sd � t � f d d � | D� � } t � j | � S) Nr rK .z Tuple[t, ...]: t must be a type.r z*Tuple[t0, t1, ...]: each t must be a type.c 3 s | ] } t | � � Vq d S)N)r| )r� r� )r� rC rD r� s z(TupleMeta.__getitem__.<locals>.<genexpr>) r� r� r rT r� r� rk rm rj r| r� )r[ r� r� )rZ )r� rD r� � s " zTupleMeta.__getitem__c C s, | j d k r t | t � St d � � d S)Nz5Parameterized Tuple cannot be used with isinstance().)r� rk rm rP )r[ r� rC rC rD r� s zTupleMeta.__instancecheck__c C s, | j d k r t | t � St d � � d S)Nz5Parameterized Tuple cannot be used with issubclass().)r� r� rm rP )r[ rV rC rC rD r� s zTupleMeta.__subclasscheck__)rA rd r@ rg r� r� r� r� rC rC )rZ rD r � s r c @ s( e Z d Z d Z f Z d d � Z d S)r a@ Tuple type; Tuple[X, Y] is the cross-product type of X and Y. Example: Tuple[T1, T2] is a tuple of two elements corresponding to type variables T1 and T2. Tuple[int, float, str] is a tuple of an int, a float and a string. To specify a variable-length tuple of homogeneous type, use Tuple[T, ...]. c O s. t | t � r t d � � t t | | | � S)Nz6Type Tuple cannot be instantiated; use tuple() instead)r� r rP r rm )rV r\ r] rC rC rD rU s z Tuple.__new__N)rA rd r@ rg rp rU rC rC rC rD r s r� c sd e Z d Z d Z � f d d � Z � f d d � Z � f d d � Z e � f d d � � Z � S) � CallableMetaz"Metaclass for Callable (internal).c s/ | j d k r t � j � S| j | j � � S)N)r� rT rf r� r� )r[ )rZ rC rD rf ' s zCallableMeta.__repr__c s� t | � t k r" t � j | � Sg } xW | d d � D]E } t | t � sd | j t | � � q9 | j | d j | � � q9 W| d d k r� t | d � d | d St | d � d d j | d d � � | d f S) NrK r z...z [..., %s]z [[%s], %s]z, r� r� ) r� r rT r� rk rm r� rS r� rQ )r[ r� r� rz )rZ rC rD r� , s zCallableMeta._tree_reprc s� | j d k s t | t � r/ t � j | � St | t � sQ t | � d k r] t d � � | \ } } | t k r� t | f } n4 t | t � s� t d | f � � t | � | f } | j | � S)zxA thin wrapper around __getitem_inner__ to provide the latter with hashable arguments to improve speed. Nr z6Callable must be used as Callable[[arg, ...], result].z8Callable[args, result]: args must be a list. Got %.100r.) r� r� r rT r� rk rm rj rP �Ellipsis�list�__getitem_inner__)r[ r� r\ �result)rZ rC rD r� < s " zCallableMeta.__getitem__c s� | \ } } d � t | � � } | t k rC t � j t | f � Sd � t � f d d � | D� � } | | f } t � j | � S)Nz.Callable[args, result]: result must be a type.z6Callable[[arg, ...], result]: each arg must be a type.c 3 s | ] } t | � � Vq d S)N)r| )r� rz )r� rC rD r� X s z1CallableMeta.__getitem_inner__.<locals>.<genexpr>)r| r rT r� r� rm )r[ r� r\ r )rZ )r� rD r P s z CallableMeta.__getitem_inner__) rA rd r@ rg rf r� r� r� r rC rC )rZ rD r $ s r c @ s( e Z d Z d Z f Z d d � Z d S)r a� Callable type; Callable[[int], str] is a function of (int) -> str. The subscription syntax must always be used with exactly two values: the argument list and the return type. The argument list must be a list of types or ellipsis; the return type must be a single type. There is no syntax to indicate optional or keyword arguments, such function types are rarely used as callback types. c O s1 t | t � r t d � � t | j | | | � S)NzIType Callable cannot be instantiated; use a non-abstract subclass instead)r� r rP r r� )rV r\ r] rC rC rD rU j s zCallable.__new__N)rA rd r@ rg rp rU rC rC rC rD r ] s c sm e Z d Z d Z d Z d d d � Z d d � Z d d � Z � f d d � Z d d � Z d d � Z � S)r� a3 Special type construct to mark class variables. An annotation wrapped in ClassVar indicates that a given attribute is intended to be used as a class variable and should not be set on instances of that class. Usage:: class Starship: stats: ClassVar[Dict[str, int]] = {} # class variable damage: int = 10 # instance variable ClassVar accepts only types and cannot be further subscribed. Note that ClassVar is not a class itself, and should not be used with isinstance() or issubclass(). �__type__Nc K s | | _ d S)N)r )r[ �tpr] rC rC rD r^ � s z_ClassVar.__init__c C sp t | � } | j d k rJ | t | d j | j d d � � � d d �St d j | j d d � � � � d S)Nz {} accepts only single type.rK rO Tz {} cannot be further subscripted)rn r r| �formatrA rP )r[ �itemrV rC rC rD r� � s z_ClassVar.__getitem__c C s> t | j | | � } | | j k r( | St | � | d d �S)NrO T)ra r rn )r[ r_ r` Znew_tprC rC rD ra � s z_ClassVar._eval_typec s> t � j � } | j d k r: | d j t | j � � 7} | S)Nz[{}])rT rf r r rS )r[ �r)rZ rC rD rf � s z_ClassVar.__repr__c C s t t | � j | j f � S)N)r� rn rA r )r[ rC rC rD r� � s z_ClassVar.__hash__c C s< t | t � s t S| j d k r2 | j | j k S| | k S)N)rk r� r} r )r[ r~ rC rC rD r � s z_ClassVar.__eq__)r ) rA rd r@ rg rp r^ r� ra rf r� r rC rC )rZ rD r� q s r� c C s | S)z�Cast a value to a type. This returns the value unchanged. To the type checker this signals that the return value has the designated type, but at runtime we intentionally don't check anything (we want this to be as fast as possible). rC )�typ�valrC rC rD r6 � s c C s� y | j } Wn t k r% i SYn X| j } | j } | d | � } | j pT f } | j } | rr t | � n i } | t | � } xC t | | d � | � D]( \ } } | | k s� t � | | | <q� W| S)z:Internal helper to extract the default arguments, by name.N) �__code__r � co_argcount� co_varnames� __defaults__�__kwdefaults__r� rj �zipr� ) r� r{ Z pos_countZ arg_names�defaultsZ kwdefaultsr� Z pos_offsetrW r� rC rC rD � _get_defaults� s &r" c C s t | d d � r i S| d k rI t | d i � } | d k r[ | } n | d k r[ | } t | t � ri } x� t | j � D]� } | j j d i � } xi | j � D][ \ } } | d k r� t d � } t | t � r� t | � } t | | | � } | | | <q� Wq� W| St | d d � } | d k rUt | t � r@i St d j | � � � t | � } t | � } x� | j � D]� \ } } | d k r�t d � } t | t � r�t | � } t | | | � } | | k r�| | d k r�t | } | | | <qzW| S)a} Return type hints for an object. This is often the same as obj.__annotations__, but it handles forward references encoded as string literals, and if necessary adds Optional[t] if a default value equal to None is set. The argument may be a module, class, method, or function. The annotations are returned as a dictionary. For classes, annotations include also inherited members. TypeError is raised if the argument is not of a type that can contain annotations, and an empty dictionary is returned if no annotations are present. BEWARE -- the behavior of globalns and localns is counterintuitive (unless you are familiar with how eval() and exec() work). The search order is locals first, then globals. - If no dict arguments are passed, an attempt is made to use the globals from obj, and these are also used as the locals. If the object does not appear to have globals, an exception is raised. - If one dict argument is passed, it is used for both globals and locals. - If two dict arguments are passed, they specify globals and locals, respectively. �__no_type_check__N� __globals__�__annotations__z1{!r} is not a module, class, method, or function.)r� rk rn �reversedr� r �get�itemsrl rG ra �_allowed_typesrP r r" r� r ) r� r_ r` Zhintsr� ZannrW r� r! rC rC rD r7 � sL c C s� t | t � r� | j j � } x9 | j j � D]( \ } } | | j k r. | j | � q. WxH | j � D]: } t | t j � r� d | _ t | t � rg t | � qg Wy d | _ Wn t k r� Yn X| S)aI Decorator to indicate that annotations are not type hints. The argument must be a class or function; if it is a class, it applies recursively to all methods and classes defined in that class (but not to methods defined in its superclasses or subclasses). This mutates the function(s) or class(es) in place. T) rk rn r �copyr( r r� �valuesr� r� r# r9 rP )rz Z arg_attrsr r r� rC rC rD r9 s c s% t j � � � f d d � � } | S)z�Decorator to give another decorator the @no_type_check effect. This wraps the decorator with something that wraps the decorated function in @no_type_check. c s � | | � } t | � } | S)N)r9 )r\ r] r� )� decoratorrC rD �wrapped_decorator8 s z2no_type_check_decorator.<locals>.wrapped_decorator)r� r� )r, r- rC )r, rD r: 1 s !c O s t d � � d S)z*Helper for @overload to raise when called.z�You should not call an overloaded function. A series of @overload-decorated functions outside a stub module should always be followed by an implementation that is not @overload-ed.N)�NotImplementedError)r\ r] rC rC rD �_overload_dummyA s r/ c C s t S)a Decorator for overloaded functions/methods. In a stub file, place two or more stub definitions for the same function in a row, each decorated with @overload. For example: @overload def utf8(value: None) -> None: ... @overload def utf8(value: bytes) -> bytes: ... @overload def utf8(value: str) -> bytes: ... In a non-stub file (i.e. a regular .py file), do the same but follow it with an implementation. The implementation should *not* be decorated with @overload. For example: @overload def utf8(value: None) -> None: ... @overload def utf8(value: bytes) -> bytes: ... @overload def utf8(value: str) -> bytes: ... def utf8(value): # implementation goes here )r/ )r� rC rC rD r; J s c s@ e Z d Z d Z � f d d � Z d d � Z d d � Z � S)� _ProtocolMetaz~Internal metaclass for _Protocol. This exists so _Protocol classes can be generic without deriving from Generic. c s/ t | j k r t � j | � St d � � d S)Nz+Protocols cannot be used with isinstance().)r� r rT r� rP )r[ r� )rZ rC rD r� n s z _ProtocolMeta.__instancecheck__c sd | j s t S| t k r d S| j � } x4 | D], � t � f d d � | j D� � s0 d Sq0 Wd S)NTc 3 s | ] } � | j k Vq d S)N)r )r� �d)r rC rD r� � s z2_ProtocolMeta.__subclasscheck__.<locals>.<genexpr>F)rh r} r� �_get_protocol_attrsr� r� )r[ rV �attrsrC )r rD r� s s "z _ProtocolMeta.__subclasscheck__c C s� g } x? | j D]4 } t | d d � r | j d k r | j | � q Wt � } x<| D]4} x+| j j � D]} x| j D]5 } | | k r~ | | j k r~ t | d d � r~ Pq~ W| j d � rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | d k rn | j | � qn WqX W| S)Nrh Fr� r �__abstractmethods__r% ri r r� rp r2 r� r� r� r� r� r� rd ) r� r� rA r� r� r �keysrL �add)r[ Zprotocol_basesr� r3 r� r rC rC rD r2 � s: ! z!_ProtocolMeta._get_protocol_attrs)rA rd r@ rg r� r� r2 rC rC )rZ rD r0 g s r0 c @ s" e Z d Z d Z f Z d Z d S)r� z�Internal base class for protocol classes. This implements a simple-minded structural issubclass check (similar but more general than the one-offs in collections.abc such as Hashable). TN)rA rd r@ rg rp rh rC rC rC rD r� � s r� � Awaitablec @ s e Z d Z f Z d S)r7 N)rA rd r@ rp rC rC rC rD r7 � s � Coroutinec @ s e Z d Z f Z d S)r8 N)rA rd r@ rp rC rC rC rD r8 � s � AsyncIterablec @ s e Z d Z f Z d S)r9 N)rA rd r@ rp rC rC rC rD r9 � s c @ s e Z d Z f Z d S)� AsyncIteratorN)rA rd r@ rp rC rC rC rD r: � s r: c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r � s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r � s c @ s1 e Z d Z f Z e e d d d � � � Z d S)r* )�returnc C s d S)NrC )r[ rC rC rD �__int__� s zSupportsInt.__int__N)rA rd r@ rp r �intr< rC rC rC rD r* � s c @ s1 e Z d Z f Z e e d d d � � � Z d S)r) )r; c C s d S)NrC )r[ rC rC rD � __float__� s zSupportsFloat.__float__N)rA rd r@ rp r �floatr> rC rC rC rD r) � s c @ s1 e Z d Z f Z e e d d d � � � Z d S)r( )r; c C s d S)NrC )r[ rC rC rD � __complex__� s zSupportsComplex.__complex__N)rA rd r@ rp r �complexr@ rC rC rC rD r( � s c @ s1 e Z d Z f Z e e d d d � � � Z d S)r' )r; c C s d S)NrC )r[ rC rC rD � __bytes__� s zSupportsBytes.__bytes__N)rA rd r@ rp r �bytesrB rC rC rC rD r' � s c @ s1 e Z d Z f Z e e d d d � � � Z d S)r& )r; c C s d S)NrC )r[ rC rC rD �__abs__ s zSupportsAbs.__abs__N)rA rd r@ rp r r� rD rC rC rC rD r& s c @ s7 e Z d Z f Z e d e e d d d � � � Z d S)r+ r )�ndigitsr; c C s d S)NrC )r[ rE rC rC rD � __round__ s zSupportsRound.__round__N)rA rd r@ rp r r= r� rF rC rC rC rD r+ s c @ s e Z d Z f Z d S)r% N)rA rd r@ rp rC rC rC rD r% s c @ s1 e Z d Z f Z e d d d d � � � Z d S)r% zIterator[T_co])r; c C s d S)NrC )r[ rC rC rD � __reversed__ s zReversible.__reversed__N)rA rd r@ rp r rG rC rC rC rD r% s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r s � Collectionc @ s e Z d Z f Z d S)rH N)rA rd r@ rp rC rC rC rD rH % s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r / s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r 3 s c @ s e Z d Z f Z d S)r! N)rA rd r@ rp rC rC rC rD r! 8 s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r > s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r B s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r G s c @ s e Z d Z f Z d S)r" N)rA rd r@ rp rC rC rC rD r" M s c @ s e Z d Z f Z d S)r" N)rA rd r@ rp rC rC rC rD r" Q s c @ s e Z d Z f Z d S)r" N)rA rd r@ rp rC rC rC rD r" U s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r Z s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r ^ s c @ s" e Z d Z f Z d d � Z d S)r0 c O s. t | t � r t d � � t t | | | � S)Nz4Type List cannot be instantiated; use list() instead)r� r0 rP r r )rV r\ r] rC rC rD rU f s z List.__new__N)rA rd r@ rp rU rC rC rC rD r0 b s c @ s" e Z d Z f Z d d � Z d S)r- c O s5 t | t � r t j | | � St t j | | | � S)N)r� r- � collections�dequer )rV r\ r] rC rC rD rU q s z Deque.__new__N)rA rd r@ rp rU rC rC rC rD r- m s c @ s" e Z d Z f Z d d � Z d S)r1 c O s. t | t � r t d � � t t | | | � S)Nz2Type Set cannot be instantiated; use set() instead)r� r1 rP r r� )rV r\ r] rC rC rD rU { s z Set.__new__N)rA rd r@ rp rU rC rC rC rD r1 w s c @ s" e Z d Z f Z d d � Z d S)r2 c O s. t | t � r t d � � t t | | | � S)Nz>Type FrozenSet cannot be instantiated; use frozenset() instead)r� r2 rP r r� )rV r\ r] rC rC rD rU � s zFrozenSet.__new__N)rA rd r@ rp rU rC rC rC rD r2 � s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r � s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r � s c @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r � s c @ s e Z d Z f Z d S)r$ N)rA rd r@ rp rC rC rC rD r$ � s �AbstractContextManagerc @ s e Z d Z f Z d S)r N)rA rd r@ rp rC rC rC rD r � s c @ sI e Z d Z f Z d d � Z e j d d � � Z e d d � � Z d S)r c C s | S)NrC )r[ rC rC rD � __enter__� s zContextManager.__enter__c C s d S)NrC )r[ �exc_type� exc_value� tracebackrC rC rD �__exit__� s zContextManager.__exit__c C sL | t k rH t d d � | j D� � rH t d d � | j D� � rH d St S)Nc s s | ] } d | j k Vq d S)rL N)r )r� �BrC rC rD r� � s z2ContextManager.__subclasshook__.<locals>.<genexpr>c s s | ] } d | j k Vq d S)rP N)r )r� rQ rC rC rD r� � s T)r r� r� r} )rV �CrC rC rD r� � s z ContextManager.__subclasshook__N) rA rd r@ rp rL r� r rP � classmethodr� rC rC rC rD r � s �AbstractAsyncContextManagerc @ s e Z d Z f Z d S)�AsyncContextManagerN)rA rd r@ rp rC rC rC rD rU � s rU � a� class AsyncContextManager(Generic[T_co]): __slots__ = () async def __aenter__(self): return self @abc.abstractmethod async def __aexit__(self, exc_type, exc_value, traceback): return None @classmethod def __subclasshook__(cls, C): if cls is AsyncContextManager: if sys.version_info[:2] >= (3, 6): return _collections_abc._check_methods(C, "__aenter__", "__aexit__") if (any("__aenter__" in B.__dict__ for B in C.__mro__) and any("__aexit__" in B.__dict__ for B in C.__mro__)): return True return NotImplemented __all__.append('AsyncContextManager') c @ s" e Z d Z f Z d d � Z d S)r. c O s. t | t � r t d � � t t | | | � S)Nz4Type Dict cannot be instantiated; use dict() instead)r� r. rP r r� )rV r\ r] rC rC rD rU � s z Dict.__new__N)rA rd r@ rp rU rC rC rC rD r. � s c @ s" e Z d Z f Z d d � Z d S)r/ c O s5 t | t � r t j | | � St t j | | | � S)N)r� r/ rI � defaultdictr )rV r\ r] rC rC rD rU � s zDefaultDict.__new__N)rA rd r@ rp rU rC rC rC rD r/ � s c @ s" e Z d Z f Z d d � Z d S)r, c O s5 t | t � r t j | | � St t j | | | � S)N)r� r, rI r )rV r\ r] rC rC rD rU � s zCounter.__new__N)rA rd r@ rp rU rC rC rC rD r, � s �ChainMapc @ s" e Z d Z f Z d d � Z d S)rX c O s5 t | t � r t j | | � St t j | | | � S)N)r� rX rI r )rV r\ r] rC rC rD rU s zChainMap.__new__N)rA rd r@ rp rU rC rC rC rD rX s c @ s" e Z d Z f Z d d � Z d S)r4 c O s. t | t � r t d � � t t | | | � S)Nz@Type Generator cannot be instantiated; create a subclass instead)r� r4 rP r �_G_base)rV r\ r] rC rC rD rU s zGenerator.__new__N)rA rd r@ rp rU rC rC rC rD r4 s �AsyncGeneratorc @ s e Z d Z f Z d S)rZ N)rA rd r@ rp rC rC rC rD rZ s �CT_cor� c @ s e Z d Z d Z f Z d S)r a� A special construct usable to annotate class objects. For example, suppose we have the following classes:: class User: ... # Abstract base for User classes class BasicUser(User): ... class ProUser(User): ... class TeamUser(User): ... And a function that takes a class argument that's a subclass of User and returns an instance of the corresponding class:: U = TypeVar('U', bound=User) def new_user(user_class: Type[U]) -> U: user = user_class() # (Here we could write the user object to a database) return user joe = new_user(BasicUser) At this point the type checker knows that joe has type BasicUser. N)rA rd r@ rg rp rC rC rC rD r , s c s� d � � f d d � | D� } t j | d d � | D� � } t j | � | _ | _ y% t j d � j j d d � | _ Wn t t f k r� Yn X| S)NzDNamedTuple('Name', [(f0, t0), (f1, t1), ...]); each t must be a typec s+ g | ]! \ } } | t | � � f � q SrC )r| )r� �nr� )r� rC rD � <listcomp>I s z!_make_nmtuple.<locals>.<listcomp>c S s g | ] \ } } | � q SrC rC )r� r\ r� rC rC rD r] J s r rA �__main__) rI � namedtuple� OrderedDictr% � _field_typesr> r r r' rd r r� )rW r� �nm_tplrC )r� rD � _make_nmtupleG s %rc rU r^ rp �__getnewargs__�_fields�_field_defaultsra �_make�_replace�_asdict�_sourcerd rA r@ r% c s" e Z d Z � f d d � Z � S)�NamedTupleMetac sb | j d d � r+ t � j | | | | � St s= t d � � | j d i � } t | | j � � } g } i } xq | D]i } | | k r� | | } | j | � | | | <qw | rw t d j d | d d j | j � � � � � qw Wt | � | j _ | | _ x\ | D]T } | t k r+t d | � � q| t k r| | j k rt | | | | � qW| S) NrO Fz<Class syntax for NamedTuple is only supported in Python 3.6+r% zXNon-default namedtuple field {field_name} cannot follow default field(s) {default_names}� field_nameZ default_namesz, z&Cannot overwrite NamedTuple attribute )r' rT rU �_PY36rP rc r( r� r rQ r5 rm r rf � _prohibitedr �_specialre �setattr) rV �typenamerX �nsr� rb r! Z defaults_dictrl Z default_value�key)rZ rC rD rU a s2 zNamedTupleMeta.__new__)rA rd r@ rU rC rC )rZ rD rk _ s rk c @ s+ e Z d Z d Z d Z d d d � Z d S)r3 a4 Typed version of namedtuple. Usage in Python versions >= 3.6:: class Employee(NamedTuple): name: str id: int This is equivalent to:: Employee = collections.namedtuple('Employee', ['name', 'id']) The resulting class has extra __annotations__ and _field_types attributes, giving an ordered dict mapping field names to types. __annotations__ should be preferred, while _field_types is kept to maintain pre PEP 526 compatibility. (The field names are in the _fields attribute, which is part of the namedtuple API.) Alternative equivalent keyword syntax is also accepted:: Employee = NamedTuple('Employee', name=str, id=int) In Python versions <= 3.5 use:: Employee = NamedTuple('Employee', [('name', str), ('id', int)]) TNc K sS | r t r t d � � | d k r4 | j � } n | rF t d � � t | | � S)Nz>Keyword syntax for NamedTuple is only supported in Python 3.6+zIEither list of fields or keywords can be provided to NamedTuple, not both)rm rP r( rc )r[ rq Zfields�kwargsrC rC rD rU � s zNamedTuple.__new__)rA rd r@ rg rO rU rC rC rC rD r3 � s c C s" d d � } | | _ | | _ | S)a% NewType creates simple unique types with almost zero runtime overhead. NewType(name, tp) is considered a subtype of tp by static type checkers. At runtime, NewType(name, tp) returns a dummy function that simply returns its argument. Usage:: UserId = NewType('UserId', int) def name_by_id(user_id: UserId) -> str: ... UserId('user') # Fails type check name_by_id(42) # Fails type check name_by_id(UserId(42)) # OK num = UserId(5) + 1 # type: int c S s | S)NrC )rB rC rC rD �new_type� s zNewType.<locals>.new_type)rA Z __supertype__)rW r ru rC rC rD r8 � s Fc @ sg e Z d Z d Z f Z e e d d d � � � Z e e d d d � � � Z e d d d d � � � Z e e d d d � � � Z e e d d d � � � Z e d d d d � � � Z e e d d d � � � Z e d6 e e d d d � � � Z e e d d d � � � Z e d7 e e d d d � � � Z e d8 e e e d d d � � � Z e d e e e d d d! � � � Z e e d d" d# � � � Z e e d d$ d% � � � Z e d e e d& d' d( � � � Z e e d d) d* � � � Z e e e d+ d, d- � � � Z e e e d d. d/ d0 � � � Z e d1 d d2 d3 � � � Z e d d d4 d5 � � � Z d S)9�IOa� Generic base class for TextIO and BinaryIO. This is an abstract, generic version of the return of open(). NOTE: This does not distinguish between the different possible classes (text vs. binary, read vs. write vs. read/write, append-only, unbuffered). The TextIO and BinaryIO subclasses below capture the distinctions between text vs. binary, which is pervasive in the interface; however we currently do not offer a way to track the other distinctions in the type system. )r; c C s d S)NrC )r[ rC rC rD �mode� s zIO.modec C s d S)NrC )r[ rC rC rD rW � s zIO.nameNc C s d S)NrC )r[ rC rC rD �close� s zIO.closec C s d S)NrC )r[ rC rC rD �closed� s z IO.closedc C s d S)NrC )r[ rC rC rD �fileno� s z IO.filenoc C s d S)NrC )r[ rC rC rD �flush� s zIO.flushc C s d S)NrC )r[ rC rC rD �isatty� s z IO.isattyrK )r\ r; c C s d S)NrC )r[ r\ rC rC rD �read� s zIO.readc C s d S)NrC )r[ rC rC rD �readable� s z IO.readable)�limitr; c C s d S)NrC )r[ r rC rC rD �readline� s z IO.readline)�hintr; c C s d S)NrC )r[ r� rC rC rD � readlines s z IO.readlinesr )�offset�whencer; c C s d S)NrC )r[ r� r� rC rC rD �seek s zIO.seekc C s d S)NrC )r[ rC rC rD �seekable s z IO.seekablec C s d S)NrC )r[ rC rC rD �tell s zIO.tell)�sizer; c C s d S)NrC )r[ r� rC rC rD �truncate s z IO.truncatec C s d S)NrC )r[ rC rC rD �writable s z IO.writable)�sr; c C s d S)NrC )r[ r� rC rC rD �write s zIO.write)�linesr; c C s d S)NrC )r[ r� rC rC rD � writelines s z IO.writelinesz IO[AnyStr]c C s d S)NrC )r[ rC rC rD rL " s z IO.__enter__c C s d S)NrC )r[ rn r� rO rC rC rD rP & s z IO.__exit__r� r� r� ) rA rd r@ rg rp r rl rw rW r rx r� ry r= rz r{ r| r5 r} r~ r� r0 r� r� r� r� r� r� r� r� rL rP rC rC rC rD rv � sT "! rv c @ s_ e Z d Z d Z f Z e e e e f e d d d � � � Z e d d d d � � � Z d S) �BinaryIOz5Typed version of the return of open() in binary mode.)r� r; c C s d S)NrC )r[ r� rC rC rD r� 0 s zBinaryIO.write)r; c C s d S)NrC )r[ rC rC rD rL 4 s zBinaryIO.__enter__N) rA rd r@ rg rp r r rC � bytearrayr= r� rL rC rC rC rD r� + s %r� c @ s� e Z d Z d Z f Z e e d d d � � � Z e e d d d � � � Z e e e d d d � � � Z e e d d d � � � Z e e d d d � � � Z e d d d d � � � Z d S)�TextIOz3Typed version of the return of open() in text mode.)r; c C s d S)NrC )r[ rC rC rD �buffer> s z TextIO.bufferc C s d S)NrC )r[ rC rC rD �encodingB s zTextIO.encodingc C s d S)NrC )r[ rC rC rD �errorsF s z TextIO.errorsc C s d S)NrC )r[ rC rC rD �line_bufferingJ s zTextIO.line_bufferingc C s d S)NrC )r[ rC rC rD �newlinesN s zTextIO.newlinesc C s d S)NrC )r[ rC rC rD rL R s zTextIO.__enter__N)rA rd r@ rg rp r r� r� rl r� r r� r� r� r r� r rL rC rC rC rD r� 9 s r� c @ s7 e Z d Z d Z d d d g Z e Z e Z e Z d S)�ioz)Wrapper namespace for IO generic classes.rv r� r� N)rA rd r@ rg �__all__rv r� r� rC rC rC rD r� W s r� z.io�Patternr� c C s | j S)N)�pattern)r� rC rC rD �<lambda>e s r� �Matchc C s | j j S)N)�rer� )�mrC rC rD r� g s c @ s. e Z d Z d Z d d g Z e Z e Z d S)r� z&Wrapper namespace for re type aliases.r� r� N)rA rd r@ rg r� r� r� rC rC rC rD r� j s r� z.re)�r� r r rI � contextlibr� r� Z stdlib_rer> r� �collections.abcZcollections_abc� ImportErrorr? �_collections_abcr r r rn r� r^ �__str__rl rQ r� rE rM rN rH rI rG rF rc r� ra r| rS r� r r� ZNoReturnr r� r� r� r� r� r� r� rC r5 r� r� r� r� r� r� r� r r� r r� r� r� r� r� r� r r r r� r� r rm r r r r� r r6 r" r� �BuiltinFunctionType� MethodType� ModuleTyper) r7 r9 r: r/ r; r0 r� r r� r7 r� r8 r9 r: r r r* r) r( r' r& r+ r% r# r rH r1 r r! r r r" r r= r r r0 rJ r- r� r� r2 r r r r$ rK r rT rU �execr� r. rW r/ r, rX r4 rY � GeneratorTyperZ r[ r rc rm rn ro rk r3 r8 r< r= rv r� r� r� rA �modulesrx r� �matchr� rC rC rC rD �<module> s� * % 5 C W ! ) � � ""9" 6 I C # ' # ##& #! ! #$. ) !! ### ) # # & #& ) # / # ' $ !( `
Save File
Cancel