Pi0 dZddlZddlZddlmZddlmZddlm Z dd gZ ej d d d ej d ej fdZ ej d d dZej d d  ddej dej dedej fdZ ddej dej dedej fdZ dde de dededej f dZej d d  ddej dej dej dedef dZdS)zMatching functionsN)ParameterError)valid_intervals) _SequenceLikematch_intervals match_eventsT)nopythoncacheint_aint_bcH|d|dg}|d|dkr||d|dg}|d|dkr||d|dz }|dkrd}|d|dz }|dkr||z SdS)zJaccard similarity between two intervals Parameters ---------- int_a, int_b : np.ndarrays, shape=(2,) Returns ------- Jaccard similarity between intervals rrg)reverse)r r endsstarts intersectionunions i/home/jaya/work/projects/VOICE-AGENT/VIET/agent-env/lib/python3.11/site-packages/librosa/util/matching.py __jaccardrs !HeAh D Awa Aha !F ay6!97VAY&La GfQi E qyye## 3cXd}d}|D]"}t|||}||kr||}}#|S)z4Find the best Jaccard match from query to candidates)r)query intervals_to candidates best_scorebest_idxidxscores r__match_interval_overlapsr /sKJH..%c!233 :  #(#J Orintervals_fromrstrictreturnctj|dddf}tj|dddf}||df}||df}tj||dddfd}tj||dddfd}tjt |t j} tt |D]} || } || } || } t|d| t|| dz}t |dkrt| ||| | <r|rttj }tj }|| dkr| d||| dz z }|| dzt |kr||| dz| dz }||kr||| dz | | < ||| dz| | <!| S)z.Numba-accelerated interval matching algorithm.Nrrright)sideleftdtype) npargsort searchsortedemptylennumbauint32rangesetr rinf)r!rr" start_index end_index start_sorted end_sorted search_ends search_startsoutputir after_query before_queryr dist_before dist_afters r__match_intervalsr@<s *\!!!Q$/00K <1-..I Q/Lil+J/,qqq!t0D7SSSKOJqqq!t0D6RRRM Xc.)) > > >F 3~&& ' '<<q!"!n $Q' \k\233c)LMM:R6S6SS  z??Q  1%zRRF1II  < &KJQ!###AhM!4Dq4H)II 1~!C $5$555)+a.1*<=aH Z''%mA&6&:;q ' A(:;q Mrct|dkst|dkrtdt|t| t|||S#t$r}td||d}~wwxYw)a Match one set of time intervals to another. This can be useful for tasks such as mapping beat timings to segments. Each element ``[a, b]`` of ``intervals_from`` is matched to the element ``[c, d]`` of ``intervals_to`` which maximizes the Jaccard similarity between the intervals:: max(0, |min(b, d) - max(a, c)|) / |max(d, b) - min(a, c)| In ``strict=True`` mode, if there is no interval with positive intersection with ``[a,b]``, an exception is thrown. In ``strict=False`` mode, any interval ``[a, b]`` that has no intersection with any element of ``intervals_to`` is instead matched to the interval ``[c, d]`` which minimizes:: min(|b - c|, |a - d|) that is, the disjoint interval [c, d] with a boundary closest to [a, b]. .. note:: An element of ``intervals_to`` may be matched to multiple entries of ``intervals_from``. Parameters ---------- intervals_from : np.ndarray [shape=(n, 2)] The time range for source intervals. The ``i`` th interval spans time ``intervals_from[i, 0]`` to ``intervals_from[i, 1]``. ``intervals_from[0, 0]`` should be 0, ``intervals_from[-1, 1]`` should be the track duration. intervals_to : np.ndarray [shape=(m, 2)] Analogous to ``intervals_from``. strict : bool If ``True``, intervals can only match if they intersect. If ``False``, disjoint intervals can match. Returns ------- interval_mapping : np.ndarray [shape=(n,)] For each interval in ``intervals_from``, the corresponding interval in ``intervals_to``. See Also -------- match_events Raises ------ ParameterError If either array of input intervals is not the correct shape If ``strict=True`` and some element of ``intervals_from`` is disjoint from every element of ``intervals_to``. Examples -------- >>> ints_from = np.array([[3, 5], [1, 4], [4, 5]]) >>> ints_to = np.array([[0, 2], [1, 3], [4, 5], [6, 7]]) >>> librosa.util.match_intervals(ints_from, ints_to) array([2, 1, 2], dtype=uint32) >>> # [3, 5] => [4, 5] (ints_to[2]) >>> # [1, 4] => [1, 3] (ints_to[1]) >>> # [4, 5] => [4, 5] (ints_to[2]) The reverse matching of the above is not possible in ``strict`` mode because ``[6, 7]`` is disjoint from all intervals in ``ints_from``. With ``strict=False``, we get the following: >>> librosa.util.match_intervals(ints_to, ints_from, strict=False) array([1, 1, 2, 2], dtype=uint32) >>> # [0, 2] => [1, 4] (ints_from[1]) >>> # [1, 3] => [1, 4] (ints_from[1]) >>> # [4, 5] => [4, 5] (ints_from[2]) >>> # [6, 7] => [4, 5] (ints_from[2]) rz'Attempting to match empty interval list)r"z&Unable to match intervals with strict=N)r.rrr@)r!rr"excs rrrrsd >a3|#4#4#9#9FGGGN###L!!!Y fMMMM YYYNfNNOOUXXYsA'' B 1BB  events_from events_tor'r%c t|dkst|dkrtd|s8|s6tjtj||std|s/t |t |krtd|s/t |t |krtdtj|tj}t|||||S)aMatch one set of events to another. This is useful for tasks such as matching beats to the nearest detected onsets, or frame-aligned events to the nearest zero-crossing. .. note:: A target event may be matched to multiple source events. Examples -------- >>> # Sources are multiples of 7 >>> s_from = np.arange(0, 100, 7) >>> s_from array([ 0, 7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 91, 98]) >>> # Targets are multiples of 10 >>> s_to = np.arange(0, 100, 10) >>> s_to array([ 0, 10, 20, 30, 40, 50, 60, 70, 80, 90]) >>> # Find the matching >>> idx = librosa.util.match_events(s_from, s_to) >>> idx array([0, 1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 8, 8, 9, 9]) >>> # Print each source value to its matching target >>> zip(s_from, s_to[idx]) [(0, 0), (7, 10), (14, 10), (21, 20), (28, 30), (35, 30), (42, 40), (49, 50), (56, 60), (63, 60), (70, 70), (77, 80), (84, 80), (91, 90), (98, 90)] Parameters ---------- events_from : ndarray [shape=(n,)] Array of events (eg, times, sample or frame indices) to match from. events_to : ndarray [shape=(m,)] Array of events (eg, times, sample or frame indices) to match against. left : bool right : bool If ``False``, then matched events cannot be to the left (or right) of source events. Returns ------- event_mapping : np.ndarray [shape=(n,)] For each event in ``events_from``, the corresponding event index in ``events_to``:: event_mapping[i] == arg min |events_from[i] - events_to[:]| See Also -------- match_intervals Raises ------ ParameterError If either array of input events is not the correct shape rz$Attempting to match empty event listzWCannot match events with left=right=False and events_from is not contained in events_tozICannot match events with left=False and max(events_to) < max(events_from)zJCannot match events with right=False and min(events_to) > min(events_from)r() r.rr*allisinmaxmin empty_likeint32__match_events_helper)rCrDr'r%r:s rr r s~ ;1I! 3 3CDDD  E 26"'+y*I*I#J#J       c)nns;'7'777 4     s9~~K(8(888 4   ];bh 7 7 7F !iu M MMrr:c"tj|}||}tj|}||}tj||} t| D]\} } d} d} d}t | }d}d}d}| | } || }| t |kr| dz} |r | dkr| dz }d} |r| t |dz kr| dz}d} t || |z }|r| rt |||z }|r| rt |||z }| r.|s || |ks| s||ks ||kr||kr |||| <| r||kr |||| < || || <tj|}|||<|S)NFrrrT)r*r+r, enumerater.absrJ)r:rCrDr'r%from_idx sorted_fromto_idx sorted_tomatching_indicesind middle_ind left_flag right_flagleft_ind right_ind left_diff right_diffmid_diffsorted_from_num solutionss rrLrL4s'z+&&Hh'K Z " "F&!Iy+>>%%5660-0-Z  ())   %c* %c* Y ' ' !OJ  JNN!A~HI  Z#i..1"444"QIJy,>??  CI CIh//ABBI  EZ EYy1OCDDJ  - -:&889#,x#7#7J&&9x+?+? *F3KK -Z(22 +F3KK!,F3KK f%%I Ih r)T)TT)__doc__numpyr*r/ exceptionsrutilsr_typingr__all__jitndarrayrr boolr@rr rLrrrjs| &&&&&&""""""###### n - D%%%RZ &%> D%%%  &%  D%%%IM22J2.0j2BF2Z222&%2lJN]Y]YJ]Y.0j]YBF]YZ]Y]Y]Y]YF _N_N_N_N _N  _N Z _N_N_N_ND D%%%  HH JHHzH  H  HHH&%HHHr