a h@sddlmZddlZddlmZddlmZddl m Z ddl m Z dd Z d d Ze d d gd gdddddZddZddZdS))suppressN)sparse) is_scalar_nan)validate_params)_object_dtype_isnancCsttt:ddl}||jur6||WdSWdn1sJ0Yt|r|jjdkrtt |}q|jjdvrt j |j t d}qt|}n||k}|S)Nrf)iudtype)r ImportErrorAttributeErrorpandasZNAZisnarr kindnpisnanzerosshapeboolr)X value_to_maskrXtrO/var/www/html/assistant/venv/lib/python3.9/site-packages/sklearn/utils/_mask.py_get_dense_masks  6    rcCs\t|st||St|j|}|jdkr0tjntj}|||j|j f|j t d}|S)aCompute the boolean mask X == value_to_mask. Parameters ---------- X : {ndarray, sparse matrix} of shape (n_samples, n_features) Input data, where ``n_samples`` is the number of samples and ``n_features`` is the number of features. value_to_mask : {int, float} The value which is to be masked in X. Returns ------- X_mask : {ndarray, sparse matrix} of shape (n_samples, n_features) Missing mask. Zcsr)rr ) spissparserdataformatZ csr_matrixZ csc_matrixindicescopyZindptrrr)rrrZsparse_constructorZ Xt_sparserrr _get_mask&s   r"z array-likez sparse matrix)rmaskT)Zprefer_skip_nested_validationcCsDt|}t|jtjr|St|dr@t|jd}||}|S)asReturn a mask which is safe to use on X. Parameters ---------- X : {array-like, sparse matrix} Data on which to apply mask. mask : array-like Mask to be used on X. Returns ------- mask : ndarray Array that is safe to use on X. Examples -------- >>> from sklearn.utils import safe_mask >>> from scipy.sparse import csr_matrix >>> data = csr_matrix([[1], [2], [3], [4], [5]]) >>> condition = [False, True, True, False, True] >>> mask = safe_mask(data, condition) >>> data[mask].toarray() array([[2], [3], [5]]) Ztoarrayr)rZasarrayZ issubdtyper Z signedintegerhasattrZaranger)rr#indrrr safe_maskFs#  r&cCs4|dkr|t||ddfStjd|jdfdS)aReturn a mask which is safer to use on X than safe_mask. This mask is safer than safe_mask since it returns an empty array, when a sparse matrix is sliced with a boolean mask with all False, instead of raising an unhelpful error in older versions of SciPy. See: https://github.com/scipy/scipy/issues/5361 Also note that we can avoid doing the dot product by checking if the len_mask is not zero in _huber_loss_and_gradient but this is not going to be the bottleneck, since the number of outliers and non_outliers are typically non-zero and it makes the code tougher to follow. Parameters ---------- X : {array-like, sparse matrix} Data on which to apply mask. mask : ndarray Mask to be used on X. len_mask : int The length of the mask. Returns ------- mask : ndarray Array that is safe to use on X. rNr)r)r&rrr)rr#Zlen_maskrrraxis0_safe_slicess r'cCs0|t|krtdtj|td}d||<|S)aYConvert list of indices to boolean mask. Parameters ---------- indices : list-like List of integers treated as indices. mask_length : int Length of boolean mask to be generated. This parameter must be greater than max(indices). Returns ------- mask : 1d boolean nd-array Boolean array that is True where indices are present, else False. Examples -------- >>> from sklearn.utils._mask import indices_to_mask >>> indices = [1, 2 , 3, 4] >>> indices_to_mask(indices, 5) array([False, True, True, True, True]) z-mask_length must be greater than max(indices)r T)rmax ValueErrorrr)r Z mask_lengthr#rrrindices_to_masks r*) contextlibrnumpyrZscipyrrZ_missingrZ_param_validationrfixesrrr"r&r'r*rrrrs       &%