3js$ VdZddlmZddlmZddlZddlm Z ddl m Z Gdde jZ ejd d efd e fd efd efdefdefgZGdd eZeddddddZedde dddZeddedddZedk(rddl Z e j,yy)a This module defines a single class, SortTuple, which is a named tuple that can sort against bare offsets and other SortTuples. This is a performance-critical object. It also defines three singleton instances of the SortTupleLow class as ZeroSortTupleDefault, ZeroSortTupleLow and ZeroSortTupleHigh which are sortTuple at offset 0.0, priority [0, -inf, inf] respectively: >>> sorting.ZeroSortTupleDefault SortTuple(atEnd=0, offset=0.0, priority=0, classSortOrder=0, isNotGrace=1, insertIndex=0) >>> sorting.ZeroSortTupleLow SortTuple(atEnd=0, offset=0.0, priority=-inf, classSortOrder=0, isNotGrace=1, insertIndex=0) >>> sorting.ZeroSortTupleHigh SortTuple(atEnd=0, offset=0.0, priority=inf, classSortOrder=0, isNotGrace=1, insertIndex=0) ) annotations)infN)OffsetQL) exceptions21c eZdZy)SortingExceptionN)__name__ __module__ __qualname__>> n = note.Note() >>> s = stream.Stream() >>> s.insert(4, n) >>> st = n.sortTuple() >>> st SortTuple(atEnd=0, offset=4.0, priority=0, classSortOrder=20, isNotGrace=1, insertIndex=...) >>> st.shortRepr() '4.0 <0.20...>' >>> st.atEnd 0 >>> st.offset 4.0 >>> st < 5.0 True >>> 5.0 > st True >>> st > 3.0 True >>> 3.0 < st True >>> st == 4.0 True >>> ts = bar.Barline('double') >>> s2 = stream.Stream() >>> s2.storeAtEnd(ts) >>> ts_st = ts.sortTuple() >>> ts_st SortTuple(atEnd=1, offset=0.0, priority=0, classSortOrder=-5, isNotGrace=1, insertIndex=...) >>> st < ts_st True >>> ts_st > 999999 True >>> import math >>> ts_st == math.inf True Construct one w/ keywords: >>> st = sorting.SortTuple(atEnd=0, offset=1.0, priority=0, classSortOrder=20, ... isNotGrace=1, insertIndex=323) >>> st.shortRepr() '1.0 <0.20.323>' or as tuple: >>> st = sorting.SortTuple(0, 1.0, 0, 20, 1, 323) >>> st.shortRepr() '1.0 <0.20.323>' c2tt| |g|i|SN)superr__new__)clstupElskeywords __class__s rrzSortTuple.__new__jsY,SF6FXFFr ct|trt| |S |jdk(r |t k7ry|jdk(ry|j |k(S#t$r tcYSwxYw)NFT) isinstancetupler__eq__rINFINITYr ValueErrorNotImplementedselfotherrs rr#zSortTuple.__eq__nsh eU #7>%( ( "zzQ5H#4q{{e++ "! ! "AA AA,+A,ct|trt| |S |jdk(ry|j |kS#t $r tcYSwxYw)Nr F)r!r"r__lt__rrr%r&r's rr,zSortTuple.__lt__{sS eU #7>%( ( "zzQ{{U** "! ! "sAAAAct|trt| |S |jdk(r |t k7ry|jdk(ry|j |kDS#t$r tcYSwxYw)Nr TF) r!r"r__gt__rr$rr%r&r's rr.zSortTuple.__gt__sh eU #7>%( ( "zzQ5H#4q{{U** "! ! "r*c&|j| Sr)r#r(r)s r__ne__zSortTuple.__ne__s;;u%%%r cJ|j|xs|j|Sr)r,r#r0s r__le__zSortTuple.__le__{{5!7T[[%77r cJ|j|xs|j|Sr)r.r#r0s r__ge__zSortTuple.__ge__r4r cLg}|jr|jdn$|jt|j|jd|jt|j|jd|jt|j |j dk(r|jd|jd|jt|j|jddj|S)a Returns a nice representation of a SortTuple >>> st = sorting.SortTuple(atEnd=0, offset=1.0, priority=0, classSortOrder=20, ... isNotGrace=1, insertIndex=323) >>> st.shortRepr() '1.0 <0.20.323>' >>> st = sorting.SortTuple(atEnd=1, offset=1.0, priority=4, classSortOrder=7, ... isNotGrace=0, insertIndex=200) >>> st.shortRepr() 'End <4.7.[Grace].200>' Endz <.rz.[Grace]>) rappendstrrrrrrjoin)r( reprPartss r shortReprzSortTuple.shortReprs ::   U #   S- .T]]+,T0012 ??a    Z (T--./wwy!!r c |jDcgc]}|j|t|| }}|j|Scc}w)a return a new SortTuple identical to the previous, except with the given keyword modified. Works only with keywords. >>> st = sorting.SortTuple(atEnd=0, offset=1.0, priority=0, classSortOrder=20, ... isNotGrace=1, insertIndex=32) >>> st2 = st.modify(offset=2.0) >>> st2.shortRepr() '2.0 <0.20.32>' >>> st2 SortTuple(atEnd=0, offset=2.0, priority=0, classSortOrder=20, isNotGrace=1, insertIndex=32) >>> st3 = st2.modify(atEnd=1, isNotGrace=0) >>> st3.shortRepr() 'End <0.20.[Grace].32>' The original tuple is never modified (hence tuple): >>> st.offset 1.0 Changing offset, but nothing else, helps in creating .flatten() positions. )_fieldsgetgetattrr)r(rattroutLists rmodifyzSortTuple.modifysG2HL||T|t8<<gdD&9:|Tt~~w''Us#Ac t||js td|jDcgc]?}|dvr t t ||t ||nt ||t ||zA}}|j|Scc}w)a Add all attributes from one sortTuple to another, returning a new one. >>> n = note.Note() >>> n.offset = 10 >>> s = stream.Stream() >>> s.offset = 10 >>> n.sortTuple() SortTuple(atEnd=0, offset=10.0, priority=0, classSortOrder=20, isNotGrace=1, insertIndex=0) >>> s.sortTuple() SortTuple(atEnd=0, offset=10.0, priority=0, classSortOrder=-20, isNotGrace=1, insertIndex=0) >>> s.sortTuple().add(n.sortTuple()) SortTuple(atEnd=0, offset=20.0, priority=0, classSortOrder=0, isNotGrace=1, insertIndex=0) Note that atEnd and isNotGrace are equal to other's value. are upper bounded at 1 and take the maxValue of either. ,Cannot add attributes from a different classrr)r!rrrBmaxrDr(r)rErFs raddz SortTuple.adds&%0"#QR R !% .!-66wtT*GE4,@A!$-t0DDF!- . t~~w'' .ABc t||js td|jDcgc]?}|dvr t t ||t ||nt ||t ||z A}}|j|Scc}w)a Subtract all attributes from to another. atEnd and isNotGrace take the min value of either. >>> n = note.Note() >>> n.offset = 10 >>> s = stream.Stream() >>> s.offset = 10 >>> n.sortTuple() SortTuple(atEnd=0, offset=10.0, priority=0, classSortOrder=20, isNotGrace=1, insertIndex=0) >>> s.sortTuple() SortTuple(atEnd=0, offset=10.0, priority=0, classSortOrder=-20, isNotGrace=1, insertIndex=0) >>> s.sortTuple().sub(n.sortTuple()) SortTuple(atEnd=0, offset=0.0, priority=0, classSortOrder=-40, isNotGrace=1, insertIndex=0) Note that atEnd and isNotGrace are lower bounded at 0. rIrJ)r!rrrBminrDrLs rsubz SortTuple.subs"%0"#QR R $||- ,t55wtT*GE4,@A t,wud/CCE , - t~~w'' -rN)r r r __doc__rr#r,r.r1r3r6r@rGrMrQ __classcell__)rs@rrr1sA7pG " " "&88">(8(:(r gr )rrrrrr__main__)rR __future__rmathrr$typingtmusic21.common.typesrmusic21rMusic21Exceptionr NamedTupleint_SortTupleBaserZeroSortTupleDefaultZeroSortTupleLowZeroSortTupleHighr mainTestr r rrcs$# )  |44 k cN xs3C ,\(\(~!qqQR,-1>1SH9UV()q:AcHUV)*;  zGr