o fu1@sUdZddlmZddlZddlZddlZddlZddlm Z m Z m Z ddl m Z ddlmZddlmZmZmZmZmZmZddlmZmZmZdd lmZmZd d lmZmZej rnd Z!d e"d<dZ#d e"d<ddl$m%Z%e&e'e(e)e*e+e,ej-eeeej.eee/j0e1j0hZ2de"d<e3e4e5e6e7e e e hZ8de"d<dSddZ9dTdd Z:dUd"d#Z;dVd%d&ZdXd/d0Z?dYd4d5Z@ed6ZAe)d7dZd=d>ZBGd?d@d@ejCZDej rd[dCdDZEnGdEdDdDZEedFZFd\dHdIZGeHZId]dMdNZJejKdOdPGdQdRdRZLdS)^zBucket of reusable internal utilities. This should be reduced as much as possible with functions only used in one place, moved to that place. ) annotationsN) OrderedDict defaultdictdeque)deepcopy) zip_longest)BuiltinFunctionTypeCodeType FunctionType GeneratorType LambdaType ModuleType)AnyMappingTypeVar) TypeAlias TypeGuard)_repr _typing_extraz3typing.Mapping[int, Any] | typing.Mapping[str, Any]rMappingIntStrAnyz1typing.AbstractSet[int] | typing.AbstractSet[str]AbstractSetIntStr BaseModelzset[type[Any]]IMMUTABLE_NON_COLLECTIONS_TYPESBUILTIN_COLLECTIONSvrreturnboolcCst|ttttttfSN) isinstancelisttupleset frozensetr rrr'Q/var/www/NoticeGen/venv/lib/python3.10/site-packages/pydantic/_internal/_utils.py sequence_like@sr)oclass_or_tuple(type[Any] | tuple[type[Any], ...] | NonecCs"zt||WStyYdSwNF)r! TypeError)r*r+r'r'r(lenient_isinstanceDs   r/clscCs:z t|to t||WStyt|tjrYdSwr-)r!type issubclassr.r WithArgsTypes)r0r+r'r'r(lenient_issubclassKs  r4TypeGuard[type[BaseModel]]cCsddlm}t||o||uS)zReturns true if cls is a _proper_ subclass of BaseModel, and provides proper type-checking, unlike raw calls to lenient_issubclass. rr)mainrr4)r0rr'r'r(is_model_classTs r7 identifierstrcCs|o t| S)zChecks that a string is a valid identifier and not a Python keyword. :param identifier: The identifier to test. :return: True if the identifier is valid. ) isidentifierkeyword iskeyword)r8r'r'r(is_valid_identifier]sr=KeyTypemappingdict[KeyType, Any]updating_mappingscGsd|}|D])}|D]"\}}||vr*t||tr*t|tr*t|||||<q |||<q q|Sr )copyitemsr!dict deep_update)r?rAupdated_mappingupdating_mappingkrr'r'r(rEhs  rEdict[Any, Any]updateNonecKs|dd|DdS)NcSsi|] \}}|dur||qSr r').0rHrr'r'r( tsz#update_not_none..)rJrC)r?rJr'r'r(update_not_nonessrNT) name_factory input_listlist[T] | tuple[T, ...]rPtyping.Callable[[T], str]list[T]cCsJg}g}|D]}||}||vr||||q||||<q|S)zMake a list unique while maintaining order. We update the list if another one with the same name is set (e.g. model validator overridden in subclass). )appendindex)rQrPresult result_namesrv_namer'r'r( unique_listzs   rZc@seZdZdZdZd-d d Zd.d dZd.ddZd/ddZd0ddZ e d1d2d d!Z e d3d"d#Z e d4d$d%Ze d5d'd(Zd6d*d+Zd,S)7 ValueItemszOClass for more convenient calculation of excluded or included fields on values.)_items_typevaluerrC$AbstractSetIntStr | MappingIntStrAnyrrKcCs2||}t|ttfr||t|}||_dSr ) _coerce_itemsr!r"r#_normalize_indexeslenr\)selfr^rCr'r'r(__init__s  zValueItems.__init__itemrcCs||j|S)zWCheck if item is fully excluded. :param item: key or index of a value )is_truer\getrcrer'r'r( is_excludedszValueItems.is_excludedcCs ||jvS)z`Check if value is contained in self._items. :param item: key or index of value r\rhr'r'r( is_includeds zValueItems.is_includede int | str+AbstractSetIntStr | MappingIntStrAny | NonecCs|j|}||s |SdS)z:param e: key or index of element on value :return: raw values for element if self._items is dict and contain needed element N)r\rgrf)rcrlrer'r'r( for_elements zValueItems.for_elementrv_lengthintdict[int | str, Any]c Cs i}d}|D]H\}}t|tjs(t|tjs(||s(td|d|j|dkr2||}qt|t s;td|dkrC||n|}| || |||<q|sU|S||rit |D]}| |dq^|St |D]}| |i}||s| ||||<qm|S)a]:param items: dict or set of indexes which will be normalized :param v_length: length of sequence indexes of which will be >>> self._normalize_indexes({0: True, -2: True, -1: True}, 4) {0: True, 2: True, 3: True} >>> self._normalize_indexes({'__all__': True}, 4) {0: True, 1: True, 2: True, 3: True} Nz,Unexpected type of exclude value for index "z" __all__zExcluding fields from a sequence of sub-models or dicts must be performed index-wise: expected integer keys or keyword "__all__"r.)rCr!typingr AbstractSetrfr. __class__ _coerce_valuerqmergergrange setdefault) rcrCrpnormalized_items all_itemsir normalized_inormalized_itemr'r'r(ras4 "       zValueItems._normalize_indexesFbaseoverride intersectcs||durS|sdurS|r&|r$SS|r;fddDfddD}n tfddD}i}|D]}|j|||d}|durd|||<qL|S)aHMerge a `base` item with an `override` item. Both `base` and `override` are converted to dictionaries if possible. Sets are converted to dictionaries with the sets entries as keys and Ellipsis as values. Each key-value pair existing in `base` is merged with `override`, while the rest of the key-value pairs are updated recursively with this function. Merging takes place based on the "union" of keys if `intersect` is set to `False` (default) and on the intersection of keys if `intersect` is set to `True`. Ncg|]}|vr|qSr'r'rLrH)rr'r( z$ValueItems.merge..crr'r'rrr'r(rrcsg|]}|vr|qSr'r'rrr'r(rr)r)rwrfr"rxrg)r0rrr merge_keysmergedrH merged_itemr')rrr(rxs$    &zValueItems.mergecCsHt|tjr |St|tjrt|d}|St|dd}td|)N.rvz???z!Unexpected type of exclude value )r!rtrrurDfromkeysgetattrr.)rC class_namer'r'r(r`s   zValueItems._coerce_itemscCs |dus ||r |S||Sr )rfr`)r0r^r'r'r(rws zValueItems._coerce_valuercCs|dup|duS)NT.r'r&r'r'r(rfszValueItems.is_true_repr.ReprArgscCs d|jfgSr rj)rcr'r'r( __repr_args__ zValueItems.__repr_args__N)r^rrCr_rrK)rerrr)rlrmrrn)rCrrprqrrr)F)rrrrrrrr)rCr_rr)r^rrrrrrr)rr)__name__ __module__ __qualname____doc__ __slots__rdrirkrora classmethodrx staticmethodr`rwrfrr'r'r'r(r[s"     %%   r[namer^cCsdSr r'rr^r'r'r(ClassAttributesrc@s(eZdZdZdZdd d ZdddZdS)rz(Hide class attribute from its instances.rrr9r^rrrKcCs||_||_dSr r)rcrr^r'r'r(rd!s zClassAttribute.__init__instanceowner type[Any]cCs&|dur|jSt|jd|jd)Nz attribute of z is class-only)r^AttributeErrorrr)rcrrr'r'r(__get__%szClassAttribute.__get__N)rr9r^rrrK)rrrrrrK)rrrrrrdrr'r'r'r(rs  Objobjc Csj|j}|tvr |Sz|s|tvr!|tur|WS|WSWt|SWt|Stttfy4Yt|Sw)zReturn type as is for immutable built-in types Use obj.copy() for built-in empty collections Use copy.deepcopy() for non-empty collections and unknown objects. ) rvrrr#rBr. ValueError RuntimeErrorr)robj_typer'r'r(smart_deepcopy.s rlefttyping.Iterable[Any]rightcCs*t||tdD] \}}||urdSqdS)aCheck that the items of `left` are the same objects as those in `right`. >>> a, b = object(), object() >>> all_identical([a, b, a], [a, b, a]) True >>> all_identical([a, b, [a]], [a, b, [a]]) # new list object, while "equal" is not "identical" False ) fillvalueFT)r _SENTINEL)rr left_item right_itemr'r'r( all_identicalDs  rT)frozenc@s<eZdZUdZdZded<dd d Zejrdd d Z dSdS)SafeGetItemProxyzWrapper redirecting `__getitem__` to `get` with a sentinel value as default This makes is safe to use in `operator.itemgetter` when some keys may be missing )wrappedzMapping[str, Any]rkeyr9rrcCs|j|tSr )rrgrrcrr'r'r( __getitem__`szSafeGetItemProxy.__getitem__rcCs |j|Sr )r __contains__rr'r'r(rirzSafeGetItemProxy.__contains__N)rr9rr)rr9rr) rrrrr__annotations__rrt TYPE_CHECKINGrr'r'r'r(rSs  rr)r*rr+r,rr)r0rr+rrr)r0rrr5)r8r9rr)r?r@rAr@rr@)r?rIrJrrrK)rQrRrPrSrrT)rr9r^rOrrO)rrrr)rrrrrr)Mr __future__r _annotations dataclassesr;rtweakref collectionsrrrrBr itertoolsrtypesrr r r r r rrrtyping_extensionsrrrrrrrrr6rrqfloatcomplexr9rbytesr1NoneTyperefNotImplementedrvEllipsisrr"r$r#r%rDrr)r/r4r7r=r>rErNrOrZRepresentationr[rrrobjectrr dataclassrr'r'r'r(s