o ۷i0 @s2dZddlZddlZddlmZddlmZddlm Z dd gZ ej d d d d ej d ej fddZ ej d d d ddZej d d d  d!dej dej dedej fddZ d!dej dej dedej fddZ d"de de dededej f dd Zej d d d  d"dej dej dej dedef dd ZdS)#zMatching functionsN)ParameterError)valid_intervals) _SequenceLikematch_intervals match_eventsT)nopythoncacheint_aint_bcCs|d|dg}|d|dkr||d|dg}|d|dkr(||d|d}|dkr6d}|d|d}|dkrF||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 intersectionunionrK/home/ubuntu/vllm_env/lib/python3.10/site-packages/librosa/util/matching.py __jaccards rcCs6d}d}|D]}t|||}||kr||}}q|S)z4Find the best Jaccard match from query to candidates)r)query intervals_to candidates best_scorebest_idxidxscorerrr__match_interval_overlaps/s rintervals_fromrstrictreturncCst|dddf}t|dddf}||df}||df}tj||dddfdd}tj||dddfdd}tjt|tjd} tt|D]x} || } || } || } t|d| t|| d@}t|dkr{t | ||| | <qN|rt tj }tj }|| dkr| d||| d}|| dt|kr||| d| d}||kr||| d| | <qN||| d| | <qN| S)z.Numba-accelerated interval matching algorithm.Nrrright)sideleftdtype) npargsort searchsortedemptylennumbauint32rangesetrrinf)rrr start_index end_index start_sorted end_sorted search_ends search_startsoutputir after_query before_queryr dist_before dist_afterrrr__match_intervals<s4     r<c Csjt|dks t|dkrtdt|t|zt|||dWSty4}ztd||d}~ww)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)rz&Unable to match intervals with strict=N)r*rrr<)rrrexcrrrrrsR events_from events_tor#r!cCst|dks t|dkrtd|s!|s!tt||s!td|s/t|t|kr/td|s=t|t|kr=tdtj|tjd}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)r>r?r#r!r6rrrrs ?r6cCsxt|}||}t|}||}t||} t| D]\} } d} d} d}t| }d}d}d}| | } || }| t|krB| d8} |rN| dkrN| d}d} |r^| t|dkr^| d}d} t|| |}|rr| rrt|||}|r~| r~t|||}| r|s|| |ks| s||ks||kr||kr|||| <q| r||kr|||| <q|| || <qt|}|||<|S)NFrrrT)r&r'r( enumerater*absrD)r6r>r?r#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 solutionsrrrrF4sV        rF)T)TT)__doc__numpyr&r+ exceptionsrutilsr_typingr__all__jitndarrayrrboolr<rrrFrrrrsv        6 c b