U vIdk/@sddlZddlmZmZddlmZmZmZmZm Z ddl Z ddl Z ddl ZddlmZddlmZddlmZeeZedd Zeejd d Zeed d Zee jddZeedddZeeedddZ eej!ej!dddZ"ee#dddddZ$eddZ%z@ddl&m'Z(ddZ)e%e(j*dd Z+ee(j*d!d"Z,Wne-k rYnXd8e j.e/d$d%d&Z0e/d'd(d)Z1e j2e/eej!ej3fd*d+d,Z4ee/eefd-d.d/Z5e/d0d1d2Z6Gd3d4d4e#Z7e/e/e d5d6d7Z8dS)9N)wrapssingledispatch)MappingAnySequenceUnionCallable)sparse) get_logger) SparseDatasetcCs t|S)zConvert x to a numpy array)npasarrayxrF/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/anndata/utils.pyrsrcCs|SN)Ztoarrayrrrrasarray_sparsesrcCs t|jSr)rvaluerrrrasarray_sparse_datasetsrcCs|dS)N.rrrrrasarray_h5py_dataset sr)returncCst|Srdictobjrrrconvert_to_dict%srrcCs|Srrrrrrconvert_to_dict_dict*srcs8jjdkrtdjdfddjjDS)NuNCan only convert np.ndarray with compound dtypes to dict, passed array had “u”.csi|]}||qSrr).0krrr 6sz+convert_to_dict_ndarray..)dtypefields TypeErrorkeysrrrrconvert_to_dict_ndarray/s   r&cCstSrrrrrrconvert_to_dict_nonetype9sr'cCs |j|S)z Return the size of an array in dimension `axis`. Returns None if `x` is an awkward array with variable length in the requested dimension. shape)raxisrrrdim_len>sr+)awkwardc Ks|jrl|jrd}n|j}|d|d}d|kr@t|ksVntd|dd|||d<tjS|jr||dkr| ddkrtd|dd|j r|j |d<nd |d<tjS|j r||dkrt|j |d<tjS|j r td |dn|jrd }|jD]Z}d|di}tjt||d |d krP|d}n$||dkrd |d<tjSq||d<tjSd S) zNCallback function for dim_len_awkward, resolving the dim_len for a given level)rr*r zaxis=z is too deepoutZ __array__)string bytestringz.Cannot recurse into record type found at axis=Nlateral_context)Zis_numpyZ is_unknownr)lenr$akcontentsZ EmptyArrayZis_listZ parameterZ is_regularsizeZ is_recordr#Zis_union transform_size_at_depth) Zlayoutdepthr2kwargsr)Z numpy_axisresultcontentcontextrrrr8KsN          r8cCsV|dkrtdn@|dkr"t|Sd|i}tjt||d|ddkrJdS|dSdS)aGet the length of an awkward array in a given dimension Returns None if the dimension is of variable length. Code adapted from @jpivarski's solution in https://github.com/scikit-hep/awkward/discussions/1654#discussioncomment-3521574 rzDoes not support negative axisr*r1r-r0N)NotImplementedErrorr3r4r7r8)arrayr*r=rrrdim_len_awkwards r@cCs|Srrrrrrasarray_awkwardsrA-)indexjoinc Cs|jr |Sddlm}|j}|jdd}||}t|}|}d}g} t|D]d\} } || d7<| |t|| } | |kr| | | || <qRd}t | dkrZ| | qZqR|rt d |d d d d dt| |||<tj||jd}|S)a Makes the index unique by appending a number string to each duplicate index element: '1', '2', etc. If a tentative name created by the algorithm already exists in the index, it tries the next integer in the sequence. The first occurrence of a non-unique value is ignored. Parameters ---------- join The connecting string between name and integer. Examples -------- >>> from anndata import AnnData >>> adata = AnnData(np.ones((2, 3)), var=pd.DataFrame(index=["a", "a", "b"])) >>> adata.var_names Index(['a', 'a', 'b'], dtype='object') >>> adata.var_names_make_unique() >>> adata.var_names Index(['a', 'a-1', 'b'], dtype='object') r)Counterfirst)ZkeepFr Tz Suffix used (z3[0-9]+) to deduplicate index values may make index zGvalues difficult to interpret. There values with a similar suffixes in z;the index. Consider using a different delimiter by passing z`join={delimiter}`zEExample key collisions generated by the make_index_unique algorithm: )name)Z is_unique collectionsrEvaluescopyZ duplicatedset enumeratestraddr3appendwarningswarnpdIndexrH) rCrDrErJZ indices_dupZ values_dupZ values_setcounterZissue_interpretation_warningZexample_colliding_valuesivZtentative_new_namerrrmake_index_uniquesJ      rXattrcCs0|dkr dnd}tj|d|dtdddS)NZobsZ ObservationVariablez3 names are not unique. To make them unique, call `.z_names_make_unique`.) stacklevel)rQrR UserWarning)rZnamesrrrwarn_names_duplicatess r`)dfrHrcCsTtdd|jDr$|j}n|}|jdkrPt|d|j |S)Ncss|]}t|tjVqdSr) isinstancerSZ SparseDtype)rdtrrr sz(ensure_df_homogeneous..r z% converted to numpy array with dtype ) allZdtypesr Zto_cooZtocsrZto_numpyZnuniquerQrRr")rarHarrrrrensure_df_homogeneouss rg)sourcecCst|}zdd|D}Wntk r>tdYnXtt|dd|Ddd|D}t|}tt |df|}t |j D]&\}}tj ||||dd||<q|S) NcSs<g|]4}t|djjdkr(t|nt|dqS)r>USri)r r?r"charrZastype)rcolrrr s z:convert_dictionary_to_structured_array..uVCurrently only support ascii strings. Don’t use “ö” etc. for sample annotation.cSsg|]}t|jqSr)rNr"rcrrrrmscSsg|]}|jdfqS)r r(rnrrrrmsrr )r") listr%rJUnicodeEncodeError ValueErrorzipr r"Zzerosr3rMr_r?)rhr_colsZ dtype_listr"rfrVrHrrr&convert_dictionary_to_structured_arrays"     runew_namecsfdd}|S)z This is a decorator which can be used to mark functions as deprecated. It will result in a warning being emitted when the function is used. cs&tfdd}t|dd|S)NcsJtdttjddjdjdtddtdt||S) NalwayszUse z instead of z, z will be removed in the future.r\)categoryr]default)rQ simplefilterDeprecationWarningrR__name__)argsr:)funcrwrrnew_func-s  z/deprecated..decorator..new_func __deprecatedT)rsetattr)rrrv)rr decorator,s zdeprecated..decoratorr)rwrrrvr deprecated%s rc@seZdZdZddZdS)DeprecationMixinMetazt Use this as superclass so deprecated methods and properties do not appear in vars(MyClass)/dir(MyClass) cs"ddfddtDS)NcSst|tr|j}t|ddS)NrF)rbpropertyfgetgetattrrYrrr is_deprecatedGs z3DeprecationMixinMeta.__dir__..is_deprecatedcs g|]}t|ds|qSr)r)ritemclsrrrrmLsz0DeprecationMixinMeta.__dir__..)type__dir__)rrrrrFs zDeprecationMixinMeta.__dir__N)r} __module__ __qualname____doc__rrrrrr@sr)modulerHrc s^ddlm}z||}t||}Wn6ttfk rX}z|fdd}W5d}~XYnX|S)a Try to import function from module. If the module is not installed or function is not part of the module, it returns a dummy function that raises the respective import error once the function is called. This could be a ModuleNotFoundError if the module is missing or an AttributeError if the module is installed but the function is not exported by it. Params ------- module Module to import from. Can be nested, e.g. "sklearn.utils". name Name of function to import from module. r) import_modulecsdSrr)___errorrrrjszimport_function..funcN) importlibrr ImportErrorAttributeError)rrHrrerrrimport_functionSs r)rB)9rQ functoolsrrtypingrrrrrZh5pyZpandasrSnumpyr Zscipyr loggingr Z_core.sparse_datasetr r}loggerrregisterZspmatrixrrZDatasetrrrrZndarrayr&rr'r+compatr,r4r8ZArrayr@rArrTrNrXr`Z DataFrameZ csr_matrixrgrurrrrrrrs\             >   >  %