a jP@s UdZddlZddlZddlZddlZddlZddlZddlmZm Z ddl Z ddl Z ddl Z ddlmZddlmZddlmZmZmZddlmZddlmZdd lmZdd lmZmZmZdd l m!Z!m"Z"dd l#m$Z$dd l%m&Z&ddl'm(Z(m)Z)m*Z*m+Z+ddl,m-Z-m.Z.m/Z/m0Z0ddl1m2Z2ddl3m4Z4m5Z5m6Z6m7Z7m8Z8m9Z9m:Z:ddl3m;Z<ddl=m>Z>ddl?m@Z@mAZAmBZBmCZCmDZDmEZEddlFmGZGmHZHmIZImJZJddlKmLZLdZMdZNe(e*dZOe)e+dZPeQZReQeSd<eRTeOeRTePgdZUe Vgdgdgdgdgd gd!gd"gd#gd$gd%gd&gd'gd(gd)gd*gd+gd,gd-gd.gd/gd0gd1gd2gZWgd3ZXgd4ZYd5d6gd6d6gd6d5gd7d7gd7d8gd8d7ggZZgd9Z[d6d6gd8d8gd:d8ggZ\gd;Z]e^Z_e j`ad7Zbebce_jdjeZfe_jgefe__ge_jdefe__dehZiebceijdjeZfeijgefei_geijdefei_dejZkebcekjdjeZfekjgefek_gekjdefek_deLdZlejmdd\ZnZoeljpd?d@ZqdAeqeqdBk<eljrddCdDd@Zse&dEd=dFddGtZue_jge_jddHeijgeijddHekjgekjddHeZe[dHeWeXdHeWeYdHeneodHeqesdHeq esdHeuesdHe vdIesdHdJ ZwdKdLZxdMdNZydOdPZze j{|dQeP}e j{|dReNdSdTZ~dUdVZdWdXZe j{|dYePe j{|dReNdZd[ZeEe j{|dYePe j{|d\d]d^ed_fd`dEed_fdad^ed_fdbd^edge Ve je jd:dCd=d>ge Vd7d8d:dCe je jge Vd7d8d:e jd>e jgge j{|dRd]dagd?d@ZdAdBZdCdDZdEdFZdGdHZdIdJZdS(Nz- Testing for the tree module (sklearn.tree). N)chainproduct) NumpyPickler)assert_allclose)clonedatasetstree)DummyRegressor)NotFittedError) SimpleImputer)accuracy_scoremean_poisson_deviancemean_squared_error)cross_val_scoretrain_test_split) make_pipeline)_sparse_random_matrix)DecisionTreeClassifierDecisionTreeRegressorExtraTreeClassifierExtraTreeRegressor) CRITERIA_CLF CRITERIA_REGDENSE_SPLITTERSSPARSE_SPLITTERS)_py_sort) NODE_DTYPE TREE_LEAFTREE_UNDEFINED_build_pruned_tree_py_check_n_classes_check_node_ndarray_check_value_ndarray)Tree)compute_sample_weight)assert_almost_equalassert_array_almost_equalassert_array_equalcreate_memmap_backed_dataignore_warnings skip_if_32bit) _IS_32BITCOO_CONTAINERSCSC_CONTAINERSCSR_CONTAINERS)check_random_state)ginilog_loss) squared_errorabsolute_error friedman_msepoisson)rr)rr ALL_TREES)rrrrrirrrrr)rrrr9rrr8皙?rr7r8)r>rrrr@r8rrr?rr8)r>r>rg333333rrrrrrr=rrr8)r>r>rrrrrr;rrrrrr8)r>rr7 r7r皙 rr7r;r9r8)zG@rr rrrD?rrBr8)rErrFrGrrHrrrDrIrrrAr8)rErFrGrrHrrrDrIrrrAr8)rErKrFrGrrHrrrDrIrJrr>r)rKr:r8rJr9rCrr8r<r;rrLr)rLrr8r8r8r>r8rrrAr;rr8r)rLrr8rLr;r>rCrLrr>r8rLrLr)r8r8rrLrLr>r8rLrr<r8rLr;r)r;r8rr;rr9rCrr8r<r;rr;r8)rErKrFrGrr8rrrDrIrJrrBr8)rErKrFrGrr8rrrDrI?r8r>r>)rErKrFrGrrCrrrDrIrJrr>r>)rLrr:r8rJrArCrr8r<r;r8rr>)rLrr8r8r8rAr8rrrArrrr8)rLr8r8r8rLr>rCrLrr>rrLr8r8)r8r8rrr8rBr8rLrr<r8rLr8r8)r;r8rr8rr9r8rr8rArrr8r)r8r8rrrrr8r8r8r8r8r8rrrr8rrr8rrrr)?r@333333?皙?rCg333333@@g)\(?{Gz?gףp= @rQg?rOrLrHrr@g|?5^?g(\??rrAr>r8rL)r>r>r>r8r8r8r;)r>r8r8rC) random_state n_samples n_features)r:sizerSg?r7)rZrZg?)ZdensityrWXy)rZr;) irisdiabetesdigitstoy clf_small reg_small multilabel sparse-pos sparse-neg sparse-mixzeroscCs|j|jks"Jd||j|jt|j|j|dt|j|j|d|jtk}t|}t|j||j||dt|j ||j ||dt|j |j |dt|j |j |dt |j |j |dd t|j||j||d d dS) Nz({0}: inequal number of node ({1} != {2})z: inequal children_rightz: inequal children_leftz: inequal featuresz: inequal thresholdz: inequal sum(n_node_samples)z: inequal n_node_samplesz: inequal impurityerr_msgz: inequal value) node_countformatr'children_right children_leftrnpZ logical_notfeature thresholdn_node_samplessumr%impurityr&value)dsmessageZexternalinternalr|BE:\soccer\ml_env\Lib\site-packages\sklearn/tree/tests/test_tree.pyassert_tree_equals@    r~cCsttD]f\}}|dd}|ttt|ttd ||ddd}|ttt|ttd |qdS)NrrWFailed with {0}r8) max_featuresrW) CLF_TREESitemsfitr^r_r'predictT true_resultrnnamer#clfr|r|r}test_classification_toys    rcCstD]x\}}|dd}|jtttttdt| t t d ||jttt ttddt| t t d |qdS)Nrr sample_weightrrJ)rrrr^r_rqoneslenr'rrrrnfullrr|r|r} test_weighted_classification_toys  rr# criterioncCs|dkr:tttd}tt|}tt|}nt}t}||dd}|t|t| t |||ddd}|t|t| t |dS)Nr5r8rrWrrrW) rqabsminr_arrayrrr^rrr)r#ray_trainy_testregrr|r|r}test_regression_toys   rcCstd}d|ddddf<d|ddddf<t|j\}}t||gj}|}tD]r\}}|dd}| ||| ||dksJd ||ddd}| ||| ||dksjJd |qjdS) N)rCrCr8r:rrrNrrWr) rqrjindicesshapevstackravelrrrrscorern)r_ZgridxZgridyr^rr#rr|r|r}test_xors     rcCstttD]\\}}}||dd}|tjtjt| tjtj}|dksdJd |||||ddd}|tjtjt| tjtj}|dksJd |||qdS)NrrrUz0Failed with {0}, criterion = {1} and score = {2}rLrrJ) rrrCLF_CRITERIONSrr`datatargetr rrn)rr#rrrr|r|r} test_iris3s rz name, TreecCs\||dd}|tjtjttj|tj}|tdksXJd|d|d|dS)Nrrz Failed with z, criterion = z and score = )rrarrrrpytestapprox)rr#rrrr|r|r}test_diabetes_overfitEs rz&criterion, max_depth, metric, max_lossr2<r3r4r5cCsR|||ddd}|tjtj|tj|tj}d|krH|ksNnJdS)NrIr)r max_depthrrW)rrarrr)rr#rrZmetricZmax_lossrZlossr|r|r}test_diabetes_underfitRsrcCstD]\}}|dddd}|tjtj|tj}tt |dt tjj dd |dt t|d|tjd |dt|tjt|tjdd |dqdS)Nr8*rrrWrrrkrK)rrrr`rr predict_probar&rqrurrrnr'Zargmaxrr%exppredict_log_proba)rr#rZ prob_predictr|r|r}test_probabilitygs(     rcCsPtdddtjf}td}tD] \}}|ddd}|||q*dS)Ni'rrrW)rqarangenewaxis REG_TREESrrr^r_rr#rr|r|r}test_arrayreprs   rcCsddgddgddgddgddgddgg}gd}tD]8\}}|dd}|||t|||d|d q8tD]8\}}|dd}|||t|||d|d qzdS) NrAr>r8rL)r8r8r8r8r8r8rrrrk)rrrr'rrnrr%)r^r_rTreeClassifierr TreeRegressorrr|r|r} test_pure_sets(    rc Cstgdgdgdgdgdgdgdg}tgd}tjd d dtD]J\}}|d d }|||||| || ||| | qXWdn1s0YdS) N)gs_c@d a@籛`8`@?c@)g_9a@g 8`@g-V u]@g@Xd@)gSW j_@rrr)g ً`@4Ta@ lKa@{c@)g|@Y@g~G`a@gwI?lKa@g/"c@)g_@rrr)g :^@rrr)rNgAw?gtQ?5??rSg7G?gۺ?gb'?raise)allrr)rqrZerrstaterrrrr|r|r}test_numerical_stabilitys$   rc Cstjdddddddd\}}tD]d\}}|dd}||||j}t|dk}|jddksrJd ||dks$Jd |q$t dd}|t j t j t dtt j d }|t j t j t|j|jdS) NrCr;rFrXrY n_informative n_redundantZ n_repeatedshufflerWr皙?rrWmax_leaf_nodes)rmake_classificationrrrfeature_importances_rqrurrnrr`rrrr')r^r_rr#rZ importancesZ n_importantclf2r|r|r}test_importancess*    rcCs>t}ttt|dWdn1s00YdS)Nr)rrraises ValueErrorgetattrrr|r|r}test_importances_raisess rc Cstjdddddddd\}}tdddd ||}td ddd ||}t|j|jt|jj |jj t|jj |jj t|jj |jj t|jj |jj dS) NirCr;rFrr0r:)rrrWr2) rrrrrr%rr'tree_rrrprort)r^r_rrr|r|r})test_importances_gini_equal_squared_errors, rcCstD]\}}|dd}|tjtj|jtt tjj dksLJ|dd}|tjtj|jtt tjj dksJ|dd}|tjtj|jdksJ|dd}|tjtj|jdksJ|dd}|tjtj|jdksJ|dd}|tjtj|jtdtjj dks8J|dd}|tjtj|jtjj dksjJ|dd}|tjtj|jtjj dksJqdS) Nsqrt)rr8log2r;rRrJrN) r6rrr`rrZ max_features_intrqrrr)r TreeEstimatorestr|r|r}test_max_featuress2           rc CstD]\}}|}tt|tWdn1sB0Y|ttgdg}tt ||Wdn1s0Y|}tdd}tt |t|Wdn1s0Yt t}|}||tt | tt|}tt| tWdn1s<0Y|ttt t}tt *| |ddddfWdn1s0Yt tj}|}|t t|ttt | tWdn1s0Ytt |tWdn1s*0Y|}|tttt | |Wdn1sr0Ytt ||Wdn1s0Y|}tt|tWdq1s0Yqtdd}tjt dd&|gdggd Wdn1s60Ytjt d d&|gdggd Wdn1s|0YdS) N)rAr>r8r>r8r5rzy is not positive.*Poissonmatchrr8rL)rrrzSome.*y are negative.*Poisson)r:grL)rrrrr rr^rr_rrqasfortranarrayr%rrrasarrayrdotapplyr) rrrX2y2ZXftZXtrr|r|r} test_errorsX (   (  *   *   :  * *  * * , 6rcCstjtjtjjd}tj}tdt D]\}}t |}|d|dd}| |||j j |j jdk}t|dksJd||d |dd}| |||j j |j jdk}t|dks(Jd|q(d S) z Test min_samples_split parameterdtypeNrCr)min_samples_splitrrWr> rr=N)rqrr`rr_treeDTYPErrr6keysrrrtrprrn)r^r_rrrrZ node_samplesr|r|r}test_min_samples_split_s   rc Cstjtjtjjd}tj}tdt D]\}}t |}|d|dd}| |||j |}t|}||dk}t|dksJd||d|dd}| |||j |}t|}||dk}t|dks(Jd|q(dS) Nrrr:r)min_samples_leafrrWr7rr)rqrr`rrrrrrr6rrrrbincountrrn) r^r_rrrroutZ node_countsZ leaf_countr|r|r}test_min_samples_leaf~s(        rcCst|dtj}|dur$||}t|d}t|jd}t|}t|}t dt dddD]\}} || |dd} | j |||d |dur| j |} n | j |} tj| |d } | | dk} t| || jksfJd || jqf|jd}t dt dddD]\}} || |dd} | |||durP| j |} n | j |} t| } | | dk} t| || jksJd || jqdS) zPTest if leaves contain at least min_weight_fraction_leaf of the training setr^Nr_rrrJrI)min_weight_fraction_leafrrWr)weightsz,Failed with {0} min_weight_fraction_leaf={1})DATASETSastyperqfloat32rngrandrrur6rlinspacerrrtocsrrrrrn)rrsparse_containerr^r_r total_weightrrfracrr node_weights leaf_weightsr|r|r}check_min_weight_fraction_leafsP          rrcCst|ddSNr`rrr|r|r},test_min_weight_fraction_leaf_on_dense_inputsr  csc_containercCst|d|ddSNrf)rr rr r|r|r}-test_min_weight_fraction_leaf_on_sparse_inputsrc Cst|dtj}|dur$||}t|d}|jd}t|}tdtdddD]\}}|||ddd } | |||dur| j | } n | j |} t | } | | dk} t | t|| jdksVJd || j| jqVtdtdddD]\}}|||d dd } | |||dur<| j | } n | j |} t | } | | dk} t | t|| j|| jksJd || j| jqdS) zzTest the interaction between min_weight_fraction_leaf and min_samples_leaf when sample_weights is not provided in fit.r^Nr_rrrJr;r:)rrrrWzBFailed with {0} min_weight_fraction_leaf={1}, min_samples_leaf={2}r)rrrqrrr6rrrrrrrrmaxrrnr) rrrr^r_rrrrrrrrr|r|r}4check_min_weight_fraction_leaf_with_min_samples_leafs^                rcCst|ddSr rr r|r|r}Btest_min_weight_fraction_leaf_with_min_samples_leaf_on_dense_input"srcCst|d|ddSrrrr|r|r}Ctest_min_weight_fraction_leaf_with_min_samples_leaf_on_sparse_input'srcCstjd|d\}}tdtD]r\}}t|}||dd}||ddd}||ddd}||d dd} |d f|df|df| d ffD] \} } | j| ksJd | j| | ||t| j j D]} | j j | t kr| j j | } | j j| }| j j | }| j j|}| j j |}||}| j j| }| j j|}| j j |}||}||}||}| j j| |jd}|| |}|| ksJd || qqq dS) NdrXrWrrrrWrP)rmin_impurity_decreaserWg-C6?rgHz>z)Failed, min_impurity_decrease = {0} > {1}z2Failed with {0} expected min_impurity_decrease={1})rrrr6rrrnrrangerrmrprrvweighted_n_node_samplesror)global_random_seedr^r_rrrZest1est2Zest3Zest4rZexpected_decreasenodeZ imp_parentZ wtd_n_nodeleftZ wtd_n_leftZimp_leftZ wtd_imp_leftrightZ wtd_n_rightZ imp_rightZ wtd_imp_rightZwtd_avg_left_right_impZfractional_node_weightZactual_decreaser|r|r}test_min_impurity_decrease1sd          r!c stD]\}}d|vr(tjtj}}ntjtj}}|dd||||}gd}fdd|D}t }t |}t |j ksJ|||} || ksJd ||D]*} tt|j| || d| d |d qqd S) z8Test pickling preserves Tree properties and performance. Classifierrr) rrmcapacity n_classesrproZn_leavesrrrsrvrtrrwcsi|]}|tj|qSr|)rr).0 attributerr|r} sztest_pickle..z6Failed to generate same score after pickling with {0}z"Failed to generate same attribute z after pickling with rkN)r6rr`rrrarrpickledumpsloadstype __class__rnr'rr) rrr^r_r attributesZfitted_attributeZserialized_objectrZscore2r&r|r'r} test_pickleys6        r/c Csddgddgddgddgddgddgddgddgddgddgddgddgg }ddgddgddgddgddgddgddgddgddgddgddgddgg }ddgddgddgddgg}ddgddgddgddgg}tD]\}}|dd}||||}t|||jdksJ||}t|dks2J|djdksFJ|djd ksZJ||} t| dksvJ| djdksJ| djd ksJqt D]@\}} | dd} | |||}t |||jdksJqdS) NrAr>r8rLrr;rr7rL)r7r7) rrrrr'rrrrrr%) r^r_rZy_truerrrZy_hatZprobaZ log_probarrr|r|r}test_multioutputs\      r1cCstD]\}}|dd}|tt|jdks4Jt|jddgt tt tdfj }|dd}|t|t |jdksJt |jdksJt|jddgt|jddgddggqdS)NrrrLr>r8rA) rrrr^r_ n_classes_r'Zclasses_rqrrrr)rrr_yr|r|r}test_classes_shapes    r4cCsftjdd}tjdd}td|}tD]2\}}|dd}|j|||dt|||q.dS)N}balancedrrr) r`rrr$rrrr%r)Z unbalanced_XZ unbalanced_yrrrrr|r|r}test_unbalanced_iriss  r7cCstttjtjgD]\\}}}|dd}tjtj|d}tj }t | || ||tjtjd|d}tj }t | || ||tjtjd|d}tj }t | || ||tj tj|d}tj }t | || ||tD]0}|tj|d}tj }t | || ||qtD]2}|tj|d}tj }t | || ||q$tjtjddd|d}tj ddd}t | || ||qdS)NrrrC)orderrFr;)rr6rrqfloat64rrr`rrr'rrZascontiguousarrayr.r-)rrrrr^r_ csr_containerr r|r|r}test_memory_layouts6 r=cCstdddtjf}td}d|dd<td}d||dk<tdd}|j|||dt||tdtdddtjf}td}d|dd<d |dd<d|dddf<td}d ||d k<tddd }|j|||d|j j dd ksJd ||d k<tddd }|j|||d|j j ddksDJt j }t j }td|jdd}tdd}|||||tj||jdd}tdd}|j|||d|j jtjjk}t|j j ||j j |dS)NrrS2rrrr8rLgRQ?rgb@rJgH@)Z minlength)rqrrrrrr'rrjrrsr`rrrrandintrrrprrrr&)r^r_rr duplicatesrr{r|r|r}test_sample_weight5sD               rBcCstdddtjf}td}d|dd<tdd}tjdd}tt  |j |||dWdn1sv0Yt d}t d}tjt|d  |j |||dWdn1s0YdS) NrrSr>rrr8rzgInput should have at least 1 dimension i.e. satisfy `len(x.shape) > 0`, got scalar `array(0.)` instead.r)rqrrrrrandomrrrrrrreescape TypeError)r^r_rrZ expected_errr|r|r}test_sample_weight_invalidis    . rGc Cst|}|dd}|tjtj|ddd}|tjtjt|j|jttjtjtjfj }|ddddddddddddgdd}|tj|t|j|j|ddd}|tj|t|j|jt tjj }|tjdkd 9<dd dd}|dd}|tjtj|||dd}|tjtjt|j|j|dd}|tjtj|d ||dd}|tjtj|t|j|jdS) Nrrr6 class_weightrWg@rNrr8rgY@rL) rrr`rrr%rrqrrrr) rrclf1rZ iris_multiZclf3Zclf4rrIr|r|r}test_class_weightss@           rKcCsxt|}ttttdfj}|dddgdd}d}tjt|d| t |Wdn1sj0YdS) NrLrJrNr>r8rrHzBnumber of elements in class_weight should match number of outputs.r) rrqrr_rrrrrrr^)rrr3rrlr|r|r}test_class_weight_errorss rMcCsXtjddd\}}d}tD]4\}}|d|dd||}||dksJqdSNrr8rr7)rr)rmake_hastie_10_2r6rrZ get_n_leavesr^r_krrrr|r|r}test_max_leaf_nodess rRcCsPtjddd\}}d}tD],\}}|d|d||}|dksJqdSrN)rrOr6rrZ get_depthrPr|r|r}test_max_leaf_nodes_max_depths rScCsTdD]J}ttdgdggddgj|}d|jdkrDdksnJdqdS)N)r$rwrprorsrvrrrtrr8rBr;z Array points to arbitrary memory)rrrrflat)attrrwr|r|r}test_arrays_persists "rVcCs\td}td}|ddd}tD].\}}|dd}||||jjdks(Jq(dS)Nr)rCrZrL)rCr) r/rqrjr@r6rrrr)rWr^r_rrrr|r|r}test_only_constant_featuress   rWcCs~ttgdgtdf}gd}tD]H\}}d|vr0|ddd}||||jjdkshJ|jj d ks0Jq0dS) N) rrrrrr8rLr7r:rI)r7rH) rrrr8r8rLrLrLr;r;r;Z ExtraTreerr8rrLr:) rqZ transposerrjr6rrrrrmr^r_rrrr|r|r},test_behaviour_constant_feature_after_splitss  rZcCsttdgdgdgdggtdg}tgd}tD]H\}}|ddd}||||jjdkspJt | |t dd q@t D]H\}}|ddd}||||jjdksJt | |t d d qdS) NrNrS)r7r)rSrNrSrNrr8rr0rJ)r7)rqZhstackrrjrrrrrr'rrrrrYr|r|r}(test_with_only_one_non_constant_featuress*    r[cCsdtddtjdd}t}tjtdd | |gdWdn1sV0YdS)Ng\)c=Hr7r>r8rr)rr8rr8) rqrepeatrr;reshaperrrrr)r^rr|r|r}test_big_input sr^cCs@ddlm}tt|Wdn1s20YdS)Nr _realloc_test)Zsklearn.tree._utilsr`rr MemoryErrorr_r|r|r} test_reallocs  rbcCsdtd}tjdd}tjddd}d|d}td|d}tt | ||Wdn1sp0Yd|dd}td|d}tt | ||Wdn1s0YdS) NrKPrCrLrr8best)splitterr) structcalcsizerqrCrandnr@rrr Exceptionrra)Zn_bitsr^r_Zhugerr|r|r}test_huge_allocationss   *  rjcCs(t|}t|d}t|d}|dvrN|jdd}|d|}|d|}tttD]}||}|d|d||} |d|d||} t| j| jd || |} |t vr| |} | |} tttD]J}||tjd}t| || |t vrt| || t| || qqZdS) Nr^r_)rbrarr:rWr5{0} with dense and sparse format gave different treesr)r6rrr,r-r.rr~rrnrrrrrqrr&)rdatasetrrr^r_rXrX_sparserxryy_predZy_probaZ y_log_probaZsparse_container_test X_sparse_testr|r|r}check_sparse_input/s8        rq tree_typerm)rdrcrbrfrgrhrirjcCs |dkr dnd}t|||dS)Nrbr;rq)rrrmrr|r|r}test_sparse_inputXsrtrarecCst||ddS)NrLrs)rrrmr|r|r}test_sparse_input_reg_treesksru)rgrhrirjc Cst|}t|d}||}t|d}|dddd||}|dddd||}t|j|jd|t|||||dddd ||}|dddd ||}t|j|jd|t|||||d|jddd ||}|d|jddd ||}t|j|jd|t|||||dd d ||}|dd d ||}t|j|jd|t||||dS) Nr^r_rr8rL)rWrrrlrC)rWrr)rWrr;r) r6rrr~rrnr&rr) rrrmr rr^rnr_rxryr|r|r}test_sparse_parametersssP  rvztree_type, criterioncCsg|]}|tvr|qSr|)rr%rr|r|r} rxcCsg|]}|tvr|qSr|)rrwr|r|r}rxryc Cst|}t|d}||}t|d}|dd|d||}|dd|d||} t|j| jd|t| |||dS)Nr^r_rr;rWrrrl)r6rrr~rrnr&r) rrrmr rrr^rnr_rxryr|r|r}test_sparse_criterias   r{zcsc_container,csr_containercCst|}d}d}|}t|}td}g} g} d} | g} t|D]^} ||d}||d|}| ||jdd|fdd}| || |7} | | q@t|  tj } tj | tj d} tj t| tj d} || | | f||fd}| }|| | | f||fd}| }|jdd|fd}|}|jd kdksFJ|jd kdks^J|d|d ||}|d|d ||}t|j|jd t||f}t||D]\}}t|j||j|t||||t|||j|t|j| |j| t|| || t|| |j| t||||ttvrt||||qdS) Nr;rCrrJr[r8rrrSrkrl)r6rqrr/rbinomial permutationappend concatenaterint32rrtoarrayr@copyrrurr~rrnrrr&r decision_pathrrr)rrr r<rrrYrXsamplesrWrroffsetindptriZ n_nonzero_iZ indices_iZdata_irnr^rpX_testr_rxryZXsZX1rr|r|r}test_explicit_sparse_zerossn       rcCst|}tjdddf}tjdddfd}tj}tt"|dd ||Wdn1sn0Y|dd}| ||tt| |gWdn1s0YdS)NrrLr) r6r`rrr]rrrrrr)rrr^ZX_2dr_rr|r|r}check_raise_error_on_1d_inputs 0   rcCs2tt|Wdn1s$0YdSN)r)rr r|r|r} test_1d_input"srrcCst|}tdgdgdgdgdgg}gd}gd}|durF||}|dd}|j|||d|jjdkspJ|ddd}|j|||d|jjdksJdS) Nrr8)rrrrr8)r=r=r=r=r=rrg?)rWr)r6rqrrrr)rrrr^r_rrr|r|r} test_min_weight_leaf_split_level(s  rcCsDtjtjjdd}t|}|ttt| t|j |dSNFr X_smallrrrrr6ry_smallr'rr)r X_small32rr|r|r}test_public_apply_all_trees<s  rr<cCsH|tjtjjdd}t|}|ttt| t|j |dSrr)rr<rrr|r|r}test_public_apply_sparse_treesEs  rcCsPtj}tj}tddd||}||dd}t|gdgdgdS)Nrr8rkrL)r8r8rr8rr8)r`rrrrrrr')r^r_rnode_indicatorr|r|r}test_decision_path_hardcodedOs rc stj}tj}|jd}t|}|ddd}|||||}|j||jj fks^J| |}fddt |D}t |t j|d|jjtk} t t | t j|djdd} |jj| ksJdS) NrrLrkcsg|]\}}||fqSr|r|)r%rjrr|r}rxgryz&test_decision_path..r|r8Zaxis)r`rrrr6rrrrrmr enumerater&rqrrprrrurr) rr^r_rXrrZnode_indicator_csrleavesZleave_indicatorZ all_leavesrr|rr}test_decision_pathWs$      rcCsVt|t}}t|}tt"|dd||Wdn1sH0YdSNrr) X_multilabel y_multilabelr6rrrFr)rr<r^r_rr|r|r}test_no_sparse_y_supportus rcCstdddd}|jdgdgdgdgdgggdgd d t|jjgd t|jjjgd |jdgdgdgdgdgggdt dd t|jjgd t|jjjgd|jdgdgdgdgdgggddt|jjgd t|jjjgddS)aQ Check MAE criterion produces correct results on small toy dataset: ------------------ | X | y | weight | ------------------ | 3 | 3 | 0.1 | | 5 | 3 | 0.3 | | 8 | 4 | 1.0 | | 3 | 6 | 0.6 | | 5 | 7 | 0.3 | ------------------ |sum wt:| 2.3 | ------------------ Because we are dealing with sample weights, we cannot find the median by simply choosing/averaging the centre value(s), instead we consider the median where 50% of the cumulative weight is found (in a y sorted data set) . Therefore with regards to this test data, the cumulative weight is >= 50% when y = 4. Therefore: Median = 4 For all the samples, we can get the total error by summing: Absolute(Median - y) * weight I.e., total error = (Absolute(4 - 3) * 0.1) + (Absolute(4 - 3) * 0.3) + (Absolute(4 - 4) * 1.0) + (Absolute(4 - 6) * 0.6) + (Absolute(4 - 7) * 0.3) = 2.5 Impurity = Total error / total weight = 2.5 / 2.3 = 1.08695652173913 ------------------ From this root node, the next best split is between X values of 3 and 5. Thus, we have left and right child nodes: LEFT RIGHT ------------------ ------------------ | X | y | weight | | X | y | weight | ------------------ ------------------ | 3 | 3 | 0.1 | | 5 | 3 | 0.3 | | 3 | 6 | 0.6 | | 8 | 4 | 1.0 | ------------------ | 5 | 7 | 0.3 | |sum wt:| 0.7 | ------------------ ------------------ |sum wt:| 1.6 | ------------------ Impurity is found in the same way: Left node Median = 6 Total error = (Absolute(6 - 3) * 0.1) + (Absolute(6 - 6) * 0.6) = 0.3 Left Impurity = Total error / total weight = 0.3 / 0.7 = 0.428571428571429 ------------------- Likewise for Right node: Right node Median = 4 Total error = (Absolute(4 - 3) * 0.3) + (Absolute(4 - 4) * 1.0) + (Absolute(4 - 7) * 0.3) = 1.2 Right Impurity = Total error / total weight = 1.2 / 1.6 = 0.75 ------ rr3rL)rWrrr;r:rK)rIrXr;r7r;)333333?333333?rrNr)r^r_r)g,d?gܶm۶m?g?)@g@r)ffffff?rMgUUUUUU?)r7rTrr]N) rrrrrvr'rwrTrqr)Zdt_maer|r|r}test_maes J.&rc Csd}tjdtjd}d}dd}tjtj|fD]}tD]N\}}|||}||}|\} \} } }|| ksrJ|| ks~Jt|| q:t D]P\}}|||}||}|\} \} } }|| ksJ|| ksJ|| ksJqq.dS)Nr;rrcSstt|Sr)r)r+r*)objr|r|r} _pickle_copysz)test_criterion_copy.._pickle_copy) rqrintprdeepcopyrr __reduce__r'r) n_outputsr$rXrZ copy_func_typenamecriteriaresultZ typename_ n_outputs_r2Z n_samples_r|r|r}test_criterion_copys&         rc Cstjdddd}t|d}|ddddf}|durL||}|dddf}tdd||}||}t t |j j t kd}||}t t|j jd}t|dksJt|dksJdS)NrrrHg*Grr>r)rqrC RandomStaterhZ nan_to_numrrrrsetwhererrpr differenceisfinitersr) rrr^r_rZterminal_regionsZ left_leafZ empty_leafZinfinite_thresholdr|r|r}"test_empty_leaf_infinite_thresholds  rtree_clscCst|}|d|d}}|ddd}|||}|j}|j}tt|dksVJtt|dksnJt||||dSNr^r_rZrrrZcost_complexity_pruning_pathZ ccp_alphas impuritiesrqrdiffassert_pruning_creates_subtreermrr^r_rinfo pruning_pathrr|r|r}'test_prune_tree_classifier_are_subtreess  rcCst|}|d|d}}|ddd}|||}|j}|j}tt|dksVJtt|dksnJt||||dSrrrr|r|r}'test_prune_tree_regression_are_subtrees$s  rcCsXtdd}|dgdggddgtddd}|dgdggddgt|j|jdS)Nrrr8rC)rW ccp_alpha)rrassert_is_subtreer)rJrr|r|r}test_prune_single_node_tree5s   rc Cs\g}|D]$}|d|dd||}||qt||ddD]\}}t|j|jq@dS)NrZr)rrrWr8)rrziprr) Z estimator_clsr^r_rZ estimatorsrrZprev_estZnext_estr|r|r}rAs rc Cs|j|jksJ|j|jks J|j}|j}|j}|j}dg}|r|\}}t|j||j|t|j||j|t|j ||j |t|j ||j |||||krtt |j |q>t|j ||j || ||||f| ||||fq>dS)N)rr)rmrrpropopr&rwr%rvrtrrrsr) rZsubtreeZ tree_c_leftZ tree_c_rightZsubtree_c_leftZsubtree_c_rightstackZ tree_node_idxZsubtree_node_idxr|r|r}rPs> rrerdrCcCstd}|djtjjdd}|dur0t|}nB||d}tj|jtjjd|_t|j|j |j f\|_|_ |_ ttjt tjjd}t ||d}| ||t||||t||||dS)Nrdr^Frr)re)rrrrrr(rqrrrrrr6rr'rrZtodense)rrerrmrZ X_readonlyZ y_readonlyrr|r|r}"test_apply_path_readonly_all_treesxs(   r)r2r4r5cCsLtjtj}}||d}|||t||tt|ksHJdS)Nr) rarrrrqrurrr)rr#r^r_rr|r|r}test_balance_propertys  rseedc Csddgddgddgddgddgddgddgddgg}gd}td|d}|||t||dkslJtd|d}|||t||dksJd }tj|ddd d ||dd|d \}}d|d |k|dk@<t|}td|d}|||t||dksJdS)Nrr8rLr;)rrrrr8rLr;r7r2rr5rCrr)Zeffective_rankZ tail_strengthrXrYrrWr>) rrrqZaminrrrmake_regressionr)rr^r_rrYr|r|r}test_poisson_zero_nodess,4          rcCsFtjd}d\}}}tj||||d}|jdd|dtj|dd}|jt||d }t ||||d \}}} } t d d |d } t dd |d } | || | || t dd || } || df|| dffD]p\}}}t || |}t |t| |dd}t || |}|dkr0|d|ks0J|d|ksJqdS)Nr)rrCrXrYrWrArL)lowhighr\rr)Zlam)Z test_sizerWr5rC)rrrWr2mean)ZstrategytraintestgV瞯r:rr)r$rXrYrrrWr1+rentropyz> with criterion 'entropy' and 'log_loss' gave different trees.N)rrrr~rrr)r#r$rXrYr^r_Z tree_log_lossZ tree_entropyr|r|r}'test_criterion_entropy_same_as_log_losss" rcsvtjdd\}}tddd||||}ddfdd}t|}|||}t||srJdS) Nrrr;rkcSs||jSr)byteswapviewr newbyteorderr)arrr|r|r}reduce_ndarraysz8test_different_endianness_pickle..reduce_ndarraycsBt}t|}tj|_|jtj<| | d|SNr) ioBytesIOr)Picklercopyregdispatch_tablerrqndarraydumpseekfprrr|r} get_pickle_non_native_endiannesss     zJtest_different_endianness_pickle..get_pickle_non_native_endianness) rrrrrr)loadrqisclose)r^r_rrnew_clf new_scorer|rr} test_different_endianness_pickles     rcs~tjdd\}}tddd||||}Gdddtfdd}t|}|||}t ||szJdS) Nrrr;rkcseZdZfddZZS)zPtest_different_endianness_joblib_pickle..NonNativeEndiannessNumpyPicklercs0t|tjr ||j}t|dSr) isinstancerqrrrrrsupersave)selfrr-r|r}r(s zUtest_different_endianness_joblib_pickle..NonNativeEndiannessNumpyPickler.save)__name__ __module__ __qualname__r __classcell__r|r|rr}NonNativeEndiannessNumpyPickler'srcs(t}|}||d|Sr)rrrrrrrr|r}'get_joblib_pickle_non_native_endianness-s   zXtest_different_endianness_joblib_pickle..get_joblib_pickle_non_native_endianness) rrrrrrjoblibrrqr)r^r_rrrrr|rr}'test_different_endianness_joblib_pickle s     rcCsntr tjntj}gd}dd|jjD}|D] }|||<q2tt|t| d}|j |ddS)N) left_child right_childrrrtcSsi|]\}\}}||qSr|r|r%rrrr|r|r}r(@sz6get_different_bitness_node_ndarray..namesformats same_kindZcasting) r+rqint64rrfieldsrlistrvaluesr) node_ndarrayZnew_dtype_for_indexing_fieldsZindexing_field_namesnew_dtype_dictr new_dtyper|r|r}"get_different_bitness_node_ndarray:s  rcCsjdd|jjD}dd|jjD}dd|D}tt|t||d}|j|ddS) NcSsi|]\}\}}||qSr|r|rr|r|r}r(Msz8get_different_alignment_node_ndarray..cSsg|] \}}|qSr|r|)r%rrr|r|r}rxPryz8get_different_alignment_node_ndarray..cSsg|] }d|qS)rKr|)r%rr|r|r}rxQry)r r offsetsr r )rrrrrqrrr)rrrZshifted_offsetsrr|r|r}$get_different_alignment_node_ndarrayLs   rc CsZtr tjntj}|\}\}}}}|j|dd}|}t|d|d<||||f|fS)Nr r nodes)r+rqrrrrrr) rrrrYr$rstateZ new_n_classes new_stater|r|r}"reduce_tree_with_different_bitness]s rcsntjdd\}}tddd||||}fdd}t|}|||}|t|ksjJdS)Nrrr;rkcs@t}t|}tj|_t|jt<| | d|Sr) rrr)rrrrr CythonTreerrrrr|r}"pickle_dump_with_different_bitnessos     zItest_different_bitness_pickle..pickle_dump_with_different_bitness) rrrrrr)rrr)r^r_rrrrr|rr}test_different_bitness_picklehs     rcsntjdd\}}tddd||||}fdd}t|}|||}|t|ksjJdS)Nrrr;rkcs>t}t|}tj|_t|jt<|| d|Sr) rrrrrrrrrrrrr|r}"joblib_dump_with_different_bitnesss    zPtest_different_bitness_joblib_pickle..joblib_dump_with_different_bitness) rrrrrrrrr)r^r_rrrrr|rr}$test_different_bitness_joblib_pickle~s     r cCstrttjn ttj}ttjttjg}|dd|D7}tjddg|d}|D]}t|||q\tj t dd.tjddgg|d}t||Wdn1s0Ytj t dd&|tj }t||Wdn1s0YdS) NcSsg|] }|qSr|)r)r%dtr|r|r}rxryz(test_check_n_classes..rr8rzWrong dimensions.+n_classesrzn_classes.+incompatible dtype) r+rqrrrrr rrrrr;)expected_dtypeallowed_dtypesr$r!Zwrong_dim_n_classesZwrong_dtype_n_classesr|r|r}test_check_n_classess( r$c Cs0ttj}d}tj||d}||g}|D]}t|||dq.tjtddt||ddWdn1st0Y|ddddddft |fD]B}tjtdd t|||j dWdq1s0Yqtjtd d&t| tj ||dWdn1s"0YdS) N)r:r8rLr)r"expected_shapezWrong shape.+value arrayr)r8rLr8zvalue array.+C-contiguouszvalue array.+incompatible dtype) rqrr;rjrr"rrrrrrr)r"r%Z value_ndarrayr#r!Zproblematic_arrr|r|r}test_check_value_ndarrays2  $(& r&cCst}tjd|d}|t|t|g}|dd|D7}|D]}t||dq:tjtdd*tjd|d}t||dWdn1s0Ytjtd d*|ddd }t||dWdn1s0Yd d |j j D}| }tj |d <t t|t|d}||}tjtddt||dWdn1s`0Y| }tj|d<t t|t|d}||}tjtddt||dWdn1s0YdS)N)r:rcSsg|]}||jqSr|)rrr)r%rr|r|r}rxsz+test_check_node_ndarray..)r"zWrong dimensions.+node arrayr)r:rLznode array.+C-contiguousrLcSsi|]\}\}}||qSr|r|rr|r|r}r(ryz+test_check_node_ndarray..rsr znode array.+incompatible dtyper)rrqrjrrr!rrrrrrrrrrrrr;)r"rZvalid_node_ndarraysrZproblematic_node_ndarrayZ dtype_dictrrr|r|r}test_check_node_ndarraysD**  ,  r'Splitterc Cstjd}d}dtjddgtjd}}td||}|||dd|d d }t|}t|}|j |ksnJt ||s|Jd S) z&Check that splitters are serializable.rrCrLr;rr0r:rJN)Z monotonic_cst) rqrCrrrrr)r*r+rr) r(rrrr$rreZsplitter_serializeZ splitter_backr|r|r}test_splitter_serializable s   r)cCsRt|d}tdd}|ttt||tj|dd}t |j |j ddS)zhCheck that Trees can be deserialized with read only buffers. Non-regression test for gh-25584. z clf.joblibrrr)Z mmap_modez?The trees of the original and loaded classifiers are not equal.N) strjoinrrrrrrrr~r)ZtmpdirZ pickle_pathrZ loaded_clfr|r|r}/test_tree_deserialization_from_read_only_buffer s   r-cCstddgddgg}tddg}|dd|||dd}d}tjt|d|||Wdn1st0YdS)zhCheck that an error is raised when min_sample_split=1. non-regression test for issue gh-25481. rr8rN)rzb'min_samples_split' .* must be an int in the range \[2, inf\) or a float in the range \(0.0, 1.0\]rN)rqrrrrr)r#r^r_rmsgr|r|r}test_min_sample_split_1_error% s r/cCstgdgj}tgd}tdd|d}||||tjgg}t|t|ddg|dd}|dd}tdd|d}||||tjgg}t|t|d dgdS) z=Check missing values goes to correct node during predictions. rr8rLr;rKrrH r rr=rr=rrrMg?g@rr8rzr<Nr>r9) rqrrrrrnanrr)rr^r_dtcroZX_equalZy_equalr|r|r};test_missing_values_best_splitter_on_equal_nodes_no_missing; s    r5c Cstgdgj}tgd}t|d|d}||||jjd}|jjd}|jj|}|jj|}||k} |jj |d} |jj |d} | tj gg} | rt | | n t | | dS)zCheck missing values go to the correct node during predictions for ExtraTree. Since ETC use random splits, we use different seeds to verify that the left/right node is chosen correctly when the splits occur. r0r2r8rzrN) rqrrrrrrprorrwrr3r) rrr^r_ZetrrrZ left_samplesZ right_samplesZ went_leftZ y_pred_leftZ y_pred_rightror|r|r}=test_missing_values_random_splitter_on_equal_nodes_no_missingU s      r6rr0cCsd}ttjgdgdgj}t|gddgddgd}tdd|d}|||ttjdd ggj}||}t||ddgd S) zITest when missing values are uniquely present in a class among 3 classes.rr7)rr8rLr;rKrrHr1r8rLrrzr;r1Nrqrr3rrrrr')rZmissing_values_classr^r_r4rZ y_nan_predr|r|r}/test_missing_values_best_splitter_three_classesx s$  r8cCsttjgdgdgj}tdgddgd}tdd|d}|||ttjd tjggj}||}t|gd d S) zMissing values spanning only one class at fit-time must make missing values at predict-time be classified has belonging to this class.r7rr8rLr;r7r:rr8rIrrLrzr:)rr8rNr7rr^r_r4rror|r|r})test_missing_values_best_splitter_to_left s  r;cCsttjgdgdgj}tdgddgddgd}tdd|d}|||ttjdd ggj}||}t|gd d S) zMissing values and non-missing values sharing one class at fit-time must make missing values at predict-time be classified has belonging to this class.r7r9r8rrLrrzrOg333333@rNr7r:r|r|r}*test_missing_values_best_splitter_to_right s$  r<c Cstddddtjddddtjg gj}td gddgd}td d|d }|||ttjd d ggj}||}t|gddS)zNCheck behavior of missing value when there is one missing value in each class.r8rLr;r:rCrZrVrrrrzgffffff@gA@rNr7r:r|r|r}>test_missing_values_best_splitter_missing_both_classes_has_nan s&  r=rrc Cstddddtjddddtjg gj}td gddgd}|d urP||}tjtd d |||Wd n1s0Yd S) z4Check unsupported configurations for missing values.r8rLr;r:rCrZrVrrNzInput X contains NaNr)rqrr3rrrrr)rrr^r_r|r|r}test_missing_value_errors s &r>cCsptjtj}}tj|ddddf<tj|ddddf<|ddd}|||||}|d kslJdS) z5Smoke test for poisson regression and missing values.Nr:rrIr>r5rrrS) rarrrrqr3rrr)r#r^r_rror|r|r}test_missing_values_poisson s   r?cOs$tj|i|\}}|dk}||fS)N)rmake_friedman1)argskwargsr^r_r|r|r}make_friedman1_classification srDzmake_data, Tree, tolerancegQ?gQ?gQ?sample_weight_trainrcCsd\}}|||d|d\}}|} tj|} tj| | jddg|jddgd<t| ||d \} } } }|d krt| jd }nd }d }|||d}|j | | |d| | |}t t |||d}| | | | | |}|||ksJd|d|d|d S)zFCheck that trees can deal with missing values have decent performance.)rrCrN)rXrYnoiserWFTrUrr\rrrrNrCrrzscore_native_tree=z + z! should be strictly greater than ) rrqrCrr3choicerrrrrrr ) make_datar#rErZ tolerancerXrYr^r_ X_missingrZX_missing_trainZX_missing_testrrrrZ native_treeZscore_native_treeZtree_with_imputerZscore_tree_with_imputerr|r|r}!test_missing_values_is_resilience s<       rKzTree, expected_scoreg333333?g(\?c Cstjd}d}|j|dfd}tt|dt|dg}|jddg|dd gd }| t }||||<|j|d} tj | |<| |d d d f<||d } t | ||d d } | |ksJd|d| d S)z@Check the tree learns when only the missing value is predictive.rrrZr[rLFTgffffff?rPrGNr:r)ZcvzExpected CV score: z but got )rqrCrZstandard_normalrrjrrHrrboolr3rr) r#Zexpected_scorerrrXr^r_Z X_random_maskZy_maskZ X_predictiverZ tree_cv_scorer|r|r} test_missing_value_is_predictive s  "   rMzmake_data, Treec Cstjd}d\}}||||d\}}tj||jddg|jddgd<t|jd}d |d d d <|dd }|j|||d |dd } | |dd d d d f|dd d t| || |d S)z=Check sample weight is correctly handled with missing values.r)rrCrFTrUrrGrSNrLrrr8) rqrCrr3rHrrrrr) rIr#rrXrYr^r_rZ tree_with_swZtree_samples_removedr|r|r}test_sample_weight_non_uniform> s    (rNcCsPtddtjtj}tddtjtj}t|}t|}||ksLJdSr)rrr`rrr)r*)Ztree1Ztree2Zpickle1Zpickle2r|r|r}test_deterministic_pickle[ s   rOr^r:rIcCs|dd}td}||dd||}t||dd|}|jj}t|dksbJ|t |jjdd|jjddt |jj dk|jj dk@}t |jj|ddS) a'Check that we properly handle missing values in regression trees using a toy dataset. The regression targeted by this test was that we were not reinitializing the criterion when it comes to the number of missing values. Therefore, the value of the critetion (i.e. MSE) was completely wrong. This test check that the MSE is null when there is a single sample in the leaf. Non-regression test for: https://github.com/scikit-learn/scikit-learn/issues/28254 https://github.com/scikit-learn/scikit-learn/issues/28316 r>r8rIrrNrLrS) r]rqrrrrrvrrr flatnonzerorprt)r#r^rr_rZtree_refrv leaves_idxr|r|r}'test_regression_tree_missing_values_toyh s  "rRcCstj|}d}tj|tjddd}tj|ddddf<||t|}t|dd ||}|j j }t |dksJ|dS) Nrrr>r8ir:rkr) rqrCrrr;r]r3rrrrrvr)rrrXr^r_rrvr|r|r}-test_regression_extra_tree_missing_values_toy s   rSc Cstjdd\}}tjd}|}|jtjdtjd|dddgfdd  t }tj ||<t ||d d \}}}}tj gd tjd }tdddd} | ||||t| jjdksJt| jjdk| jjdk@} t| jj| ddS)aCheck that we properly handle missing values in clasification trees using a toy dataset. The test is more involved because we use a case where we detected a regression in a random forest. We therefore define the seed and bootstrap indices to detect one of the non-frequent regression. Here, we check that the impurity is null or positive in the leaves. Non-regression test for: https://github.com/scikit-learn/scikit-learn/issues/28254 T)Z return_X_yr)r8r7)rrNrLrK)nr r)prLQ'a[&.erUYRrrErVIJ3/kKnrZrh9rriO#MZrer[rU^rYrK]rtrcrpr1rUrdmrjrCrsrkra\4rZrurKrKraror1r1rXrrrVr\Nr1rvir>rrcr1fr{rUr\r8r`rH rirqjrrr8rorh>UrVrWPrb?rIrTr;r;Lrzrr;riHnrrr>r8rS)r load_irisrqrCrrr}rrrrLr3rrrrrrrvrPrprtr) r^r_rrJmaskrrrrrrQr|r|r}+test_classification_tree_missing_values_toy s,  "   rcCsLtddd}|tjtjt|j}t|j ||j }tj |j j tjd}d|d<t||j ||j j dksrJ|j dksJtt t|j j|jWdn1s0Yt|j jd|jdt|j ||j }tj |j j tjd}d|dd<t||j ||j j dks"J|j dks8J|j t|j j|jdS)zHTest pruning a tree with the Python caller of the Cythonized prune tree.rr8rkrr;N)rrr`rrrq atleast_1dr2rn_features_in_rrjrrmuint8rrrAssertionErrorr'rwrr$Z pruned_treeZleave_in_subtreer|r|r}test_build_pruned_tree_py s&   . rcCstddd}|tjtjt|j}t|j ||j }tj |j j tjd}d|d<tjtddt||j |Wdn1s0YdS)z8Test pruning a tree does not result in an infinite loop.rr8rkrz,Node has reached a leaf in the original treerN)rrr`rrrqrr2rrrrjrrmrrrrrrr|r|r}$test_build_pruned_tree_infinite_loop s  rcCs`tjd}|jddddtj}t|gd}td}t||dgd}t ||d S) zNon-regression test for gh-30554. Using log2 and log in sort correctly sorts feature_values, but the tie breaking is different which can results in placing samples in a different order. rirSg$@rC)locscaler\r:r>)2r(rVrZrCrW1r-rror:rHr\)r8r1rLrr}rsrUrr;!rI$r[rbrmr7r@rv",rarfrX%rhrKrZ0ryN) rqrCZ default_rngnormalrrrrrr')rZsomeZfeature_valuesrZexpected_samplesr|r|r}test_sort_log2_build s   r)N)N)N)__doc__rrrr)rDrf itertoolsrrrnumpyrqrZjoblib.numpy_picklerZ numpy.testingrZsklearnrrrZ sklearn.dummyr Zsklearn.exceptionsr Zsklearn.imputer Zsklearn.metricsr r rZsklearn.model_selectionrrZsklearn.pipelinerZsklearn.random_projectionrZ sklearn.treerrrrZsklearn.tree._classesrrrrZsklearn.tree._partitionerrZsklearn.tree._treerrrrr r!r"r#rZ sklearn.utilsr$Zsklearn.utils._testingr%r&r'r(r)r*Zsklearn.utils.fixesr+r,r-r.Zsklearn.utils.validationr/rZREG_CRITERIONSrrdictr6__annotations__updateZ SPARSE_TREESrrrZ y_small_regr^r_rrrr`rCrrr~rr\permrZ load_diabetesraZ load_digitsrbrWZmake_multilabel_classificationrrrZ X_sparse_posr@Zy_randomrZ X_sparse_mixrjrr~rrmarkZ parametrizerrrrrrrrrrrrrrrrrrrr rrrrr!r/r1r4r7r=rBrGrKrMrRrSrVrWrZr[r^rbrjrqrtsortedr intersectionrurvrr{rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr r$r&r'r)r-r/r5r6r8r;r<r=r>r?rDrArKrMrrrNrOr3rRrSrrrrr|r|r|r}s        $      (              '             $B! ;      =     H3< -4  /      )     3    K              d    (   !*      ! 4 !        -   !  /