:vj `dZddlZddlmZmZmZdedeedeefdZd d ed edeefd Z y) zk interval.py -------------- Deal with 1D intervals which are defined by: [start position, end position] N) ArrayLikeNDArrayfloat64abreturnc*tj|tj}tj|tj}|jdk(}|j d}|j d}|j d|j d|j \}}|j \}}tjtj||k\||k\}tj|jtj}tjtj||||gjdtj||||gjdf||<|r|dS|S)a Given pairs of ranges merge them in to one range if they overlap. Parameters -------------- a : (2, ) or (n, 2) Start and end of a 1D interval b : (2, ) float Start and end of a 1D interval Returns -------------- inter : (2, ) or (2, 2) float The unioned range from the two inputs, if not np.ptp(`inter, axis=1)` will be zero. )dtype))r raxisr) nparrayrshapereshapesortT logical_not logical_orzeros column_stackmaxmin) rris_1Da_lowa_highb_lowb_highcheckoverlaps a/workspace/moltex-experiments/.pixi/envs/default/lib/python3.12/site-packages/trimesh/interval.py intersectionr$sA$ "**%A "**%A GGtOE 'A 'AFFFNFFFNCCME6CCME6 NN2==&%6/J KEhhqwwbjj1G__ HHeElE%L1 2 6 6A 6 > HHfUmVE]3 4 8 8a 8 @ GEN qz N intervalsrct|dk(rtjdS|r1tj|d}||dddfj }|dj g}|ddD]<\}}|dd|k\rt |dd||dd<*|j||g>tj|S)a& For array of multiple intervals union them all into the subset of intervals. For example: `intervals = [[1,2], [2,3]] -> [[1, 3]]` `intervals = [[1,2], [2.5,3]] -> [[1, 2], [2.5, 3]]` Parameters ------------ intervals : (n, 2) Pairs of `(min, max)` values. sort If the array is already ordered into (min, max) pairs and then pairs sorted by minimum value you can skip the sorting in this function. Returns ---------- unioned : (m, 2) New intervals where `m <= n` rrrNr ) lenrrrargsorttolistrappendr)r&runionsbeginends r#unionr/>s0 9~xx{ GGIA. i1o5578 l!!# $Fm s ":a=E !r 1 s3F2JqM MM5#, ' $ 88F r%)T) __doc__numpyrtypedrrrr$boolr/r%r#r5sY..-I-''"2-ww7G-`,Y,d,gg6F,r%