§
    +Áôgâ0  ã                   óž   — d dl Zd dlmZmZ  eddd¬¦  «        d„ ¦   «         Z edddd¬¦  «        d	„ ¦   «         Z G d
„ de¦  «        Zd„ Z	dS )é    N)ÚnjitÚprangezNi8(i8[:], i8[:], i8[:], i8[:], i8[:], f4[:, :, :], f4[:], f4[:, :], i8[:], i8)T)ÚcacheÚnogilc
                 óò  — |j         d         }
t          j        dt          j        ¦  «        }d}d}d|	z  }d||<   |dz  }|j         d         ||<   |dz  }|||<   |dz  }|dz  }|dk    �rŒ|dz  }||         }|dz  }||         }|dz  }||         }||df         }||df         }t	          |
¦  «        D ]}|||f         ||<   |||f         ||<   Œt	          |dz   |¦  «        D ]V}t	          |
¦  «        D ]D}t          ||         |||f         ¦  «        ||<   t          ||         |||f         ¦  «        ||<   ŒEŒW||z
  |k    r || |<   |||<   d||<   d||<   d||<   d||<   �n‹||z
  }t          j        |¦  «        }||         d||         z  z   }|}|dz
  }||k     r°||k     r'|||f         |k     r|dz  }||k     r|||f         |k     °||k     r'|||f         |k    r|dz  }||k     r|||f         |k    °||k     rJt	          |
¦  «        D ]"}|||f         }|||f         |||f<   ||||f<   Œ#||         }||         ||<   |||<   ||k     °°|||f         |k     r|dz  }|}t          ||	z   t          ||	z
  |¦  «        ¦  «        }|}|dz  }|}|dz  }|||<   |dz  }|||<   |dz  }|||<   |dz  }|||<   |dz  }|||<   |dz  }|||<   |dz  }|| |<   |||<   |||<   |||<   |||<   |||<   |dk    �°Œ|S )Né   éè  r   é   éÿÿÿÿç        g      à?)ÚshapeÚnpÚemptyÚint64ÚrangeÚminÚmaxÚargmax)Úi0_indsÚi1_indsÚ	less_indsÚ	more_indsÚ
split_dimsÚboundsÚsplit_valuesÚpointsÚindicesÚmin_leaf_sizeÚ	dimensionÚstackÚ
stack_sizeÚn_nodesÚmax_leaf_sizeÚi_nodeÚi1Úi0ÚloÚhiÚdÚiÚlengthsÚ	split_dimÚsplit_valueÚjÚtempÚtemp_i_nodeÚi_splitÚlessÚmores                                  ú^/var/www/html/bac/bac_backend/python/env/lib/python3.11/site-packages/pymatting/util/kdtree.pyÚ
_make_treer5      s[  € ð ”˜Q”€IåŒH�T�2œ8Ñ$Ô$€EØ€JØ€Gà˜Ñ%€Mð €Eˆ*ÑØ�!�O€JØœ Qœ€Eˆ*ÑØ�!�O€JØ€Eˆ*ÑØˆq�L€GØ�!�O€Jð �qŠ.‰.Ø�a‰ˆ
Ø�zÔ"ˆØ�a‰ˆ
Ø�:ÔˆØ�a‰ˆ
Ø�:Ôˆà�F˜A�IÔˆØ�F˜A�IÔˆå�yÑ!Ô!ð 	"ð 	"ˆAØ˜2˜q˜5”MˆBˆq‰EØ˜2˜q˜5”MˆBˆq‰EˆEõ �r˜A‘v˜rÑ"Ô"ð 	1ð 	1ˆAÝ˜9Ñ%Ô%ð 1ð 1�Ý˜B˜qœE 6¨!¨Q¨$¤<Ñ0Ô0��1‘Ý˜B˜qœE 6¨!¨Q¨$¤<Ñ0Ô0��1‘�ð1ð
 �‰7�mÒ#Ð#Ø ˆG�F‰OØ ˆG�F‰OØ "ˆI�fÑØ "ˆI�fÑØ!#ˆJ�vÑØ#&ˆL˜Ñ Ñ ð ˜2‘gˆGÝœ	 'Ñ*Ô*ˆIØ˜Yœ-¨#°¸	Ô0BÑ*BÑBˆKð ˆAØ�Q‘ˆAà�a’%�%Ø˜!’e�e  q¨) |Ô 4°{Ò BÐ BØ˜‘F�Að ˜!’e�e  q¨) |Ô 4°{Ò BÐ Bà˜!’e�e  q¨) |Ô 4¸Ò CÐ CØ˜‘F�Að ˜!’e�e  q¨) |Ô 4¸Ò CÐ Cð �q’5�5Ý" 9Ñ-Ô-ð ,ð ,˜Ø% a¨ dœ|˜Ø'-¨a°¨d¤|˜˜q !˜t™Ø'+˜˜q !˜t™˜à")¨!¤*�KØ!(¨¤�G˜A‘JØ!,�G˜A‘Jð �a’%�%ð" �a˜�lÔ# kÒ1Ð1Ø�Q‘�àˆGõ ˜"˜}Ñ,­c°"°}Ñ2DÀgÑ.NÔ.NÑOÔOˆGàˆDØ�q‰LˆGØˆDØ�q‰LˆGð !#ˆE�*ÑØ˜!‰OˆJØ 'ˆE�*ÑØ˜!‰OˆJØ $ˆE�*ÑØ˜!‰OˆJð !(ˆE�*ÑØ˜!‰OˆJØ "ˆE�*ÑØ˜!‰OˆJØ $ˆE�*ÑØ˜!‰OˆJà ˆG�F‰OØ ˆG�F‰OØ $ˆI�fÑØ $ˆI�fÑØ!*ˆJ�vÑØ#.ˆL˜Ñ ð} �qŠ.‰.ð@ €Nó    zgvoid(i8[:], i8[:], i8[:], i8[:], i8[:], f4[:, :, :], f4[:], f4[:, :], f4[:, :], i8[:, :], f4[:, :], i8))r   r   Úparallelc                 ój  — |j         d         }t          |j         d         ¦  «        D �]	}||         }|
|         }|	|         }t          j        dt          j        ¦  «        }d}d|d<   d}|dk    �rº|dz  }||         }||k    rgd}t          |¦  «        D ]E}||         }|t          ||d|f         t          ||d|f         |¦  «        ¦  «        z
  }|||z  z  }ŒF|||dz
           k    rŒ�||         dk    rÚt          | |         ||         ¦  «        D ]¼}d}t          |¦  «        D ]}||         |||f         z
  }|||z  z  }Œ|}t          |dz
  dd¦  «        D ]}||         |k    r|}Œ||k     r^t          t          ||dz
  ¦  «        |d¦  «        D ]}||dz
           ||<   ||dz
           ||<   Œ|||<   |||<   t          |dz   |¦  «        }Œ½nS||         }||         }||         } ||          ||         k     r|||<   |dz  }|||<   |dz  }n|||<   |dz  }|||<   |dz  }|dk    �°º|dz  }�Œd S )Nr   r   r	   r   r   )r   r   r   r   r   r   r   r   )!r   r   r   r   r   r   r   r   Úquery_pointsÚout_indicesÚout_distancesÚkr   Úi_queryÚquery_pointÚ	distancesr   r    Ún_neighborsr!   r$   Údistr)   ÚpÚdpr*   ÚdistanceÚddÚ
insert_posr.   r2   r3   r,   s!                                    r4   Ú	_find_knnrG   ‰   s  € ð ”˜Q”€Iõ ˜,Ô,¨QÔ/Ñ0Ô0ð Oñ OˆØ" 7Ô+ˆà! 'Ô*ˆ	Ø˜gÔ&ˆõ ”˜�rœxÑ(Ô(ˆàˆØˆˆa‰Øˆ
ð ˜1Šn‰nØ˜!‰OˆJØ˜:Ô&ˆFð ˜aÒÐà�Ý˜yÑ)Ô)ð $ð $�AØ# Aœ�AØ�S ¨°°1¨Ô!5µs¸6À&È!ÈQÀ,Ô;OÐQRÑ7SÔ7SÑTÔTÑT�BØ˜B ™G‘O�D�Dð ˜) K°!¡OÔ4Ò4Ð4Øð ˜&Ô! RÒ'Ð'å˜w vœ°¸´Ñ@Ô@ð >ð >�Aà"�HÝ" 9Ñ-Ô-ð ,ð ,˜Ø(¨œ^¨f°Q¸°T¬lÑ:˜Ø  B¨¡GÑ+˜˜ð "-�JÝ" ;°¡?°B¸Ñ;Ô;ð +ð +˜Ø$ Qœ<¨(Ò2Ð2Ø)*˜Jøð " A’~�~å!&¥s¨;¸¸A¹Ñ'>Ô'>À
ÈBÑ!OÔ!Oð <ð <˜AØ)0°°Q±¬˜G A™JØ+4°Q¸±UÔ+;˜I a™L˜Lð /0˜ 
Ñ+Ø08˜	 *Ñ-Ý&)¨+¸©/¸1Ñ&=Ô&=˜øð/>ð4 ! Ô(�Ø  Ô(�Ø& vÔ.�	ð ˜yÔ)¨L¸Ô,@Ò@Ð@Ø(,�E˜*Ñ%Ø !‘O�JØ(,�E˜*Ñ%Ø !‘O�J�Jð )-�E˜*Ñ%Ø !‘O�JØ(,�E˜*Ñ%Ø !‘O�Jð} ˜1Šn‰nðB 	�a‰ˆ
‰
ð_Oð Or6   c                   ó    — e Zd ZdZdd„Zd„ ZdS )ÚKDTreezKDTree implementationé   c                 ó”  — |j         t          j        k    sJ ‚|j        \  }}d||z   dz
  |z  z  }t          j        |t          j        ¦  «        | _        t          j        |t          j        ¦  «        | _        t          j        |t          j        ¦  «        | _        t          j        |t          j        ¦  «        | _	        t          j        |t          j        ¦  «        | _
        t          j        |d|ft          j        ¦  «        | _        t          j        |t          j        ¦  «        | _        |                     ¦   «         | _        t          j        |¦  «                             t          j        ¦  «        | _        t%          | j        | j        | j        | j	        | j
        | j        | j        | j        | j        |¦
  «
        | _        dS )a›  Constructs a KDTree for given data points. The implementation currently only supports data type `np.float32`.

        Parameters
        ----------
        data_points: numpy.ndarray (of type `np.float32`)
            Dataset with shape :math:`n \times d`, where :math:`n` is the number of data points in the data set and :math:`d` is the dimension of each data point
        min_leaf_size: int
            Minimum number of nodes in a leaf, defaults to 8

        Example
        -------
        >>> from pymatting import *
        >>> import numpy as np
        >>> data_set = np.random.randn(100, 2)
        >>> tree = KDTree(data_set.astype(np.float32))
        r
   r   N)Údtyper   Úfloat32r   r   r   r   r   r   r   r   r   r   ÚcopyÚshuffled_data_pointsÚarangeÚastypeÚshuffled_indicesr5   r"   )ÚselfÚdata_pointsr   Ún_datar   Ú	max_nodess         r4   Ú__init__zKDTree.__init__ï   sY  € ð" Ô ¥B¤JÒ.Ð.Ð.Ð.à'Ô-Ñˆ�	à˜& =Ñ0°1Ñ4¸ÑFÑGˆ	å”x 	­2¬8Ñ4Ô4ˆŒÝ”x 	­2¬8Ñ4Ô4ˆŒÝœ )­R¬XÑ6Ô6ˆŒÝœ )­R¬XÑ6Ô6ˆŒÝœ( 9­b¬hÑ7Ô7ˆŒÝ”h 	¨1¨iÐ8½"¼*ÑEÔEˆŒÝœH Yµ´
Ñ;Ô;ˆÔØ$/×$4Ò$4Ñ$6Ô$6ˆÔ!Ý "¤	¨&Ñ 1Ô 1× 8Ò 8½¼Ñ BÔ BˆÔå!ØŒLØŒLØŒNØŒNØŒOØŒKØÔØÔ%ØÔ!Øñ
ô 
ˆŒˆˆr6   c                 ó  — |j         t          j        k    sJ ‚| j        j        d         |k     r&t          d| j        j        d         › d|› d�¦  «        ‚|j        d         }t          j        ||ft          j        ¦  «        }t          j        ||ft          j        ¦  «        }t          | j	        | j
        | j        | j        | j        | j        | j        | j        ||||¦  «         | j        |         }t          j        |¦  «        }||fS )a6  Query the tree

        Parameters
        ----------
        query_points: numpy.ndarray (of type `np.float32`)
            Data points for which the next neighbours should be calculated
        k: int
            Number of neighbors to find

        Returns
        -------
        distances: numpy.ndarray
            Distances to the neighbors
        indices: numpy.ndarray
            Indices of the k nearest neighbors in original data array

        Example
        -------
        >>> from pymatting import *
        >>> import numpy as np
        >>> data_set = np.random.randn(100, 2)
        >>> tree = KDTree(data_set.astype(np.float32))
        >>> tree.query(np.array([[0.5,0.5]], dtype=np.float32), k=3)
        (array([[0.14234178, 0.15879704, 0.26760164]], dtype=float32), array([[29, 21, 20]]))
        r   zNumber of data points (z4) is less than the number of neighbors requested (k=z<). Please provide a larger dataset or reduce the value of k.)rL   r   rM   rO   r   Ú
ValueErrorr   r   rG   r   r   r   r   r   r   r   rR   Úsqrt)rS   r9   r<   Ún_queryÚsquared_distancesr   r?   s          r4   ÚqueryzKDTree.query  s*  € ð4 Ô!¥R¤ZÒ/Ð/Ð/Ð/àÔ$Ô*¨1Ô-°Ò1Ð1ÝðM¨$Ô*CÔ*IÈ!Ô*Lð Mð Mð  CDð Mð Mð Mñô ð ð
 Ô$ QÔ'ˆåœH g¨q \µ2´:Ñ>Ô>ÐÝ”(˜G Q˜<­¬Ñ2Ô2ˆåØŒLØŒLØŒNØŒNØŒOØŒKØÔØÔ%ØØØØñ	
ô 	
ð 	
ð Ô'¨Ô0ˆÝ”GÐ-Ñ.Ô.ˆ	à˜'Ð!Ð!r6   N)rJ   )Ú__name__Ú
__module__Ú__qualname__Ú__doc__rW   r]   © r6   r4   rI   rI   ì   s>   € € € € € ØÐð,
ð ,
ð ,
ð ,
ð\9"ð 9"ð 9"ð 9"ð 9"r6   rI   c                 óL   — t          | ¦  «        }|                     ||¦  «        S )aå  Find k nearest neighbors in a data set. The implementation currently only supports data type `np.float32`.

    Parameters
    ----------
    data_points: numpy.ndarray (of type `np.float32`)
        Dataset with shape :math:`n \times d`, where :math:`n` is the number of data points in the data set and :math:`d` is the dimension of each data point
    query_points: numpy.ndarray (of type `np.float32`)
        Data points for which the next neighbours should be calculated
    k: int
        Number of neighbors to find

    Returns
    -------
    distances: numpy.ndarray
        Distances to the neighbors
    indices: numpy.ndarray
        Indices of the k nearest neighbors in original data array

    Example
    -------
    >>> from pymatting import *
    >>> import numpy as np
    >>> data_set = np.random.randn(100, 2)
    >>> knn(data_set.astype(np.float32), np.array([[0.5,0.5]], dtype=np.float32), k=2)
    (array([[0.16233477, 0.25393516]], dtype=float32), array([[25, 17]]))
    )rI   r]   )rT   r9   r<   Útrees       r4   Úknnre   Y  s%   € õ6 �+ÑÔ€DØ�:Š:�l AÑ&Ô&Ð&r6   )
Únumpyr   Únumbar   r   r5   rG   ÚobjectrI   re   rb   r6   r4   ú<module>ri      sö   ðØ Ð Ð Ð Ø Ð Ð Ð Ð Ð Ð Ð ð
 €ÐVÐ^bÐjnÐoÑoÔoð~ð ~ñ pÔoð~ðB €ÐoÐw{ð  DHð  SWð  Xñ  Xô  Xð`ð `ñ Xô  Xð`ðDj"ð j"ð j"ð j"ð j"ˆVñ j"ô j"ð j"ðZ'ð 'ð 'ð 'ð 'r6   