j%UdZddlmZddlmZddlmZddlZddlm Z m Z ddl Z ddl Z ddl ZddlZddlmZddlmZdd lmZdd lmZdd lmZejd ZGd dejZGddejZGddejZGddejZGddejZdZdZdZ dZ!dZ"eee e!e"gZ#dZ$e%e j&dgzZ'd;dZ(d Z)dd*Z-d+Z.Gd,d-Z/Gd.d/Z0Gd0d1Z1Gd2d3Z2Gd4d5Z3Gd6d7ej4Z5gZ6d8e7d9<e8d:krddlZej9e5dSdS)?a A comprehensive, object model of the Xenakis Sieve. :class:`music21.sieve.Sieve` objects can be created from high-level string notations, and used to generate line segments in various representation. Additional functionality is available through associated objects. The :class:`music21.sieve.Sieve` class permits generation segments in four formats. >>> a = sieve.Sieve('3@2|7@1') >>> a.segment() [1, 2, 5, 8, 11, 14, 15, 17, 20, 22, 23, 26, 29, 32, 35, 36, 38, 41, 43, 44, 47, 50, 53, 56, 57, 59, 62, 64, 65, 68, 71, 74, 77, 78, 80, 83, 85, 86, 89, 92, 95, 98, 99] >>> a.segment(segmentFormat='binary') [0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1] >>> a.segment(segmentFormat='width') [1, 3, 3, 3, 3, 1, 2, 3, 2, 1, 3, 3, 3, 3, 1, 2, 3, 2, 1, 3, 3, 3, 3, 1, 2, 3, 2, 1, 3, 3, 3, 3, 1, 2, 3, 2, 1, 3, 3, 3, 3, 1] >>> len(a.segment(segmentFormat='unit')) 43 A :class:`music21.sieve.CompressionSegment` can be used to derive a Sieve from a ny sequence of integers. >>> a = sieve.CompressionSegment([3, 4, 5, 6, 7, 8, 13, 19]) >>> str(a) '6@1|7@6|8@5|9@4|10@3|11@8' The :class:`music21.sieve.PitchSieve` class provides a quick generation of :class:`music21.pitch.Pitch` lists from Sieves. >>> a = sieve.PitchSieve('13@3|13@6|13@9', 'c1', 'c10', 'f#4') >>> pitches = a() >>> ', '.join([str(p) for p in pitches]) 'F#1, A1, C2, G2, B-2, C#3, G#3, B3, D4, A4, C5, E-5, B-5, C#6, E6, B6, D7, F7, C8, E-8, F#8, C#9, E9, G9' ) annotations) literal_eval)IterableN)gcdlcm)common) environment) exceptions21)interval)pitchsieveceZdZdS) UnitExceptionN__name__ __module__ __qualname__/Users/tedpeters/Documents/Projects/Claude Projects/Misc Tools/notename-sheets/.venv/lib/python3.11/site-packages/music21/sieve.pyrrIDrrceZdZdS)ResidualExceptionNrrrrrrMrrrceZdZdS)SieveExceptionNrrrrrrQrrrceZdZdS)CompressionSegmentExceptionNrrrrrrUrrrceZdZdS)PitchSieveExceptionNrrrrrrYrrr{}&|^-@c#Ki}d} ||d}|||z}||vr ||z}||v |||<n||z}|||<||kr|V|dz}J)a Yields the sequence of prime numbers via the Sieve of Eratosthenes. rather than creating a fixed list of a range (z) and crossing out multiples of sequential candidates, this algorithm stores primes under their next possible candidate, thus allowing the generation of primes in sequence without storing a complete range (z). Create a dictionary. Each entry in the dictionary is a key:item pair of (key) the largest multiple of this prime so far found and (item) the prime. The dictionary only has as many entries as found primes. If a candidate is not a key in the dictionary, it is not a multiple of any already-found prime; it is thus a prime. a new entry is added to the dictionary, with the square of the prime as the key. The square of the prime is the next possible multiple to be found. To use this generator, create an instance and then call the .next() method on the instance. >>> a = sieve.eratosthenes() >>> next(a) 2 >>> next(a) 3 We can also specify a starting value for the sequence, skipping over initial primes smaller than this number: >>> a = sieve.eratosthenes(95) >>> next(a) 97 >>> next(a) 101 r'TN)pop)firstCandidateDqpnextMults r eratosthenesr0psF A A EE!TNN =1uHa--#a<a--AhKK1uHAhKN"" E)rct|}|dvrdS|dz}|dvrdSgd}|dkr||vrdSdS|D]}||zdkrdS|d z d }}|d zs|d z}|d z}|d ztd D]b}ttjd |d z ||}|d kr0td |D]}||d z krnt|d |}dScdS) a Returns True if an integer is likely prime or False if it is likely composite using the Rabin Miller primality test. See also here: http://www.4dsolutions.net/ocn/numeracy2.html >>> sieve.rabinMiller(234) False >>> sieve.rabinMiller(5) True >>> sieve.rabinMiller(4) False >>> sieve.rabinMiller(97 * 2) False >>> sieve.rabinMiller(6 ** 4 + 1) # prime True >>> sieve.rabinMiller(123986234193) # divisible by 3, runs fast False )r'T)r)F)r4 %)+/5;=CGIOSYadrr) r')absrangepowrandomrandint) nmprimesprimesriyjs r rabinMillerr[sW. AAF{{t AAu;;;F Cxx ;;4u u9>>55  q5!qA!e a E!e2YY   q!a%((!Q / / 66 q!  AAEzzAq! AA55 4rseries Iterable[int]return list[int]c|D]%}tj|std&g}|%||d}|d}nEt t j|}||d}|d}t||dzD]1}||vr|d|d2|S)a Treat a sequence of integers as defining contiguous binary integers, where provided values are 1's and excluded values are zero. For instance, running [3, 10, 12] through this method gives a 1 for the first entry (signifying 3), 0s for the next six entries (signifying 4-9), a 1 (for 10), a 0 (for 11), and a 1 (for 12). >>> sieve.discreteBinaryPad([3, 10, 12]) [1, 0, 0, 0, 0, 0, 0, 1, 0, 1] >>> sieve.discreteBinaryPad([3, 4, 5]) [1, 1, 1] znon-integer value foundNrr)) risNumrsortlistcopydeepcopyrNappend)r\fixRangexdiscreteminValmaxVal seriesAlts rdiscreteBinaryPadrns";;|A ; 9:: : ;H !"v..// 12 66A: & & ;; OOA     OOA     Orc|%||d}|d}nt|}t|}||z }g}t|dkrb|D]^}||z }t j|rt |}|dkr|||z I|d_n|d|S)a3 Given a list of numbers, create a proportional spacing across the unit interval. The first entry will always be 0 and the last 1, other entries will be spaced according to their distance between these two units. For instance, for 0, 3, 4 the middle entry will be 0.75 since 3 is 3/4 of the distance between 0 and 4: >>> sieve.unitNormRange([0, 3, 4]) [0.0, 0.75, 1.0] but for [1, 3, 4], it will be 0.666... because 3 is 2/3 of the distance between 1 and 4 >>> sieve.unitNormRange([1, 3, 4]) [0.0, 0.666..., 1.0] Nrrar))rcminmaxlenrrbfloatrg)r\rhminFoundmaxFoundspanunitvaldifs r unitNormRangerzs$ A;B<v;;v;; h D D 6{{Q  C.C|C   !Cjjqyy C$J'''' A  A Krc|dkrdgS|dkrddgSg}d|dz z }t|dz D]}|||z|d|S)a9 Given a certain number of parts, return a list unit-interval values between 0 and 1, with as many divisions as parts; 0 and 1 are always inclusive. >>> sieve.unitNormEqual(3) [0.0, 0.5, 1] If parts is 0 or 1, then a single entry of [0] is given: >>> sieve.unitNormEqual(1) [0] r)rr')rNrg)partsrwsteprYs r unitNormEqualr~As zzs !1v EAIuqy!! " "A KKD ! ! ! ! A rr)Tc||krgS||kr|}|}n|}|}d}g}|}||kr%||||z }|dz }||k%|rt|S|S)a Given a step size and an a/b min/max range, calculate number of parts to fill step through inclusive a,b, then return a unit interval list of values necessary to cover region. Note that returned values are, by default, normalized within the unit interval. >>> sieve.unitNormStep(0.5, 0, 1) [0.0, 0.5, 1] >>> sieve.unitNormStep(0.5, -1, 1) [0.0, 0.25, 0.5, 0.75, 1] >>> sieve.unitNormStep(0.5, -1, 1, normalized=False) [-1, -0.5, 0.0, 0.5, 1.0] >>> post = sieve.unitNormStep(0.25, 0, 20) >>> len(post) 81 >>> post = sieve.unitNormStep(0.25, 0, 20, normalized=False) >>> len(post) 81 rr))rgr~) r}ab normalizedrkrlcountvaluesris r unitNormStepr[s2 Avv 1uu E FA v++ a T    v++U### rcnd}|dkrd}n)||krd}n |dkr||z|z}|dkrn |dz}|dk|S)Nrr)'r)c1c2grxs r _meziriacrsf A Qww  r %iir6R-CaxxAA %ii Hrc*eZdZdZddZdZddZdS) PrimeSegmentcXg|_||_||_|dS)a A generator of prime number segments, given a start value and desired length of primes. >>> ps = sieve.PrimeSegment(3, 20) >>> ps() [3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73] N)segstartlength _fillRange)selfrrs r__init__zPrimeSegment.__init__s/   rNupc(g}d}|dzdkr||kr|dkr|dz}n|dz }n|} t|r)||t||krn1||krn*||kr|dkr|dz}n|dz }n|dkr|dz}n|dz }i|S)z scan all number in range and return a list of primes provide a max to force stoppage at certain point before the maximum length direction determines which way things go. r'rrr))r[rgrr)rrrstop directionr _oddBoundaryrRs r_fillRabinMillerzPrimeSegment._fillRabinMillers 19>>el22D  AIAIA 1~~  1 s88v%%Dyy<$$AAAAAA$$AAAAA! " rc|jdkr|t|j|jdd}d|D}t ||jkr9|d|jt |z dd}||z|_dS||_dS||j|jdd|_dS)z2 fill positive and negative range rdowncg|]}| Srr).0ris r z+PrimeSegment._fillRange..s)))Qqb)))rNr)rrrMrrrr)rsegNegsegPoss rrzPrimeSegment._fillRanges :>>**3tz??DKFSSF))&)))F6{{T[((..q$+F 2K9=tEE!F?!,,TZdDQQDHHHrcl|jd|jdg}|dvrt|j|S|dkrt|j|S|dvr\g}tt |jdz D]3}||j|dz|j|z 4|S|jS)z assumes that min and max values are derived from found primes means that primes will always be at boundaries rrabinbinaryrwwidwidthr))rrnrzrNrrrg)r segmentFormatzrrXs r__call__zPrimeSegment.__call__s Xa[$(2, ' - - -$TXq11 1 f $ $ 1-- - . . .C3tx==1,-- < < DHQUOdhqk9;;;;J8Or)NrN)rrrrrrrrrrrrs^   ####JRRR$rrceZdZdZddZdZdZdZddZdd Z d Z dd Z ddZ dZ dZdZdZdZdZdZdZdZdS)Residuala object that represents a modulus and a start point each object stores a range of integers (self._z) from which sections are drawn this range of integers can be changed whenever the section os drawn >>> residual = sieve.Residual(3, 2) rNc|ttd}||_||_|dvrt d||_|jdkr||_n||jz|_gd|_d|_dS)NrK)rr)z)negative value must be 0, 1, or a Booleanrintrrwrr) rdrN_z_mr_neg_shift_segmentFormatOptions_segmentFormat)rrSshiftnegrs rrzResidual.__init__s 9U3ZZ  A f  #$OPP P 7a<<DKK$'/DK%B%B%B"#rc||_dS)zJ z is the range of integers to use when generating a list Nrrrs rsetZz Residual.setZ%srcPtt||dz|_dS)zv z is the range of integers to use when generating a list convenience function that fixes max r)NrdrNrrminIntmaxInts r setZRangezResidual.setZRange+% uVVaZ0011rc|}||jvrtd|||_dS)Nzformat not in format options: )striplowerrrrrfmts rsetSegmentFormatzResidual.setSegmentFormat2sNiikk!! $, , ,#$JS$J$JKK K!rc||j}||j}g}|jdkr|S||jz|jz}|D]%}|||jzkr||&|jr1t j|}|D]}|||}n|}|dvrt||S|dkrt||S|dvr|jgt|dz z}|S|dvr|St|d) a get a residual subset of this modulus at this n within the integer range provided by z format can be 'int' or 'bin', for integer or binary >>> a = sieve.Residual(3, 2) >>> a.segment(3) [2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 98] >>> a.segment(3, range(3, 15)) [5, 8, 11, 14] Nrrrwrr))rintegerz( not a valid sieve segmentFormat string.) rrrrrgrrerfremovernrzrrr) rrRrrsubsetvaluecompSetrrs rsegmentzResidual.segment:sI 9A   /M 7a<<M _ ' % %EEDGO## e$$$ 9 mA&&G & &u%%%%CCC - - -$S!,, , f $ $ a(( ( . . .7)s3xx!|,CJ 0 0 0J#}$^$^$^__ _rr^rc|jS)z period is M; obvious, but nice for completeness >>> a = sieve.Residual(3, 2) >>> a.period() 3 )rrs rperiodzResidual.periodis wrctj|j}tj|j}tj|j}t ||||jSr)rerrrrr)rrSrrs rrez Residual.copytsK Idg   $+&&i ""5#tw///rc0||||S)a calls self.segment(); uses _segmentFormat >>> a = sieve.Residual(3, 2) >>> a() [2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 98] )rrrRrrs rrzResidual.__call__|s||Aq-000rc|dkr5|jdkr|jd|jd}n |jd}|jrd|}n|jd|j}|jrd|}|S)zG does not show any logical operator but unary negation classicrz(n+)z(n)r%r&)rrr)rstylerepStrs r representzResidual.represents I  {a G66 666 Gy &%V//$+//Fy &%V rc*|S)z str representation using M(n + shift) style notation >>> a = sieve.Residual(3, 2) >>> str(a) '3@2' rrs r__str__zResidual.__str__s~~rcr|dS|j|jkr"|j|jkr|j|jkrdSdS)zF ==, compare residual classes in terms of m and shift Nrr)rrrrothers r__eq__zResidual.__eq__sE =1 Gux  K5<//I++11rc|j|jkrdS|j|jkrdS|j|jkrE|j|jkrdS|j|jkrdS|j|jkr|jdkrdSdSdSdS)z allow comparison based on m and shift; if all equal look at neg Still being used internally even though __cmp__ is not used in Python 3 rar)rNrrs r__cmp__zResidual.__cmp__s 7UX  2 Wux  1 W {U\))ru|++q9 **yA~~!r q1! rc<||dkrdSdS)NraTFrrs r__lt__zResidual.__lt__s# <<  " $ $45rc<||dkrdSdS)Nr)TFrrs r__gt__zResidual.__gt__s# <<  ! # #45rc\|jrd}nd}t|j|j||jS)z8 unary neg operators; return neg object rr))rrrrr)rrs r__neg__zResidual.__neg__s4 9 CCCc47;;;rc.|js|jrtd||j|j|j|j\}}t |jt |jz}t|}t||d|S)a  &, produces an intersection of two Residual classes returns a new Residual class cannot be done if R under complementation >>> a = sieve.Residual(3, 2) >>> b = sieve.Residual(5, 1) >>> c = a & b >>> str(c) '15@11' z3complemented Residual objects cannot be intersectedr) rr_cmpIntersectionrrsetrrdr)rrrSrRzSetrs r__and__zResidual.__and__s : [ [#$YZZ Z$$TWeh U\RR147||c%(mm+ JJ1a###rcdS)z ``|``, not sure if this can be implemented i.e., a union of two Residual classes can not be expressed as a single Residual, that is intersections can always be reduced, whereas unions cannot be reduced. Nrrs r__or__zResidual.__or__s  rcFt||}||z}||z}d}d} |dkr|dkr ||z}||z}n|| fS|dkr||z |zdkr|| fS|dkr ||z |zdkr||kr||kr|} |}| |fS||z|z} t||} || ||z z|zz| z}| |fS)z compression by intersection find m,n such that the intersection of two Residuals can be reduced to one Residual. Xenakis p 273. rr))rr) rm1m2n1n2drrn3m3rs rrzResidual._cmpIntersections BKK 1W 1W   77rQwwbBbBBr6M 66R1}))r6M !VV"r'Q!++"((rBBr6Mb1B"b!!AR"W *+r1Br6Mr)rrNrNNr^rr)rrr__doc__rrrrrrrerrrrrrrrrrrrrrrrsJ$$$$* 222"""-`-`-`-`^000 1 1 1 1"      6  <<<$$$*   rrc@eZdZdZd dZd dZdZdZdZdZ d Z dS) CompressionSegmenta Utility to convert from a point sequence to sieve. A z range can be supplied to explicitly provide the complete sieve segment, both positive and negative values. all values in the z range not in the segment are interpreted as negative values. thus, there is an essential dependency on the z range and the realized sieve. No matter the size of the z range, there is a modulus at which one point in the segment can be found. As such, any segment can be reduced to, at a minimum, a residual for each point in the segment, each, for the supplied z, providing a segment with one point. The same segment can then have multiplied logical string representations, depending on the provided z. >>> a = sieve.CompressionSegment([3, 4, 5, 6, 7, 8, 13, 19]) >>> str(a) '6@1|7@6|8@5|9@4|10@3|11@8' >>> b = sieve.CompressionSegment([0, 2, 4, 6, 8]) >>> str(b) '2@0' >>> c = sieve.CompressionSegment([0, 2, 4, 5, 7, 9, 11, 12]) >>> str(c) '5@2|5@4|6@5|7@0' Ncttj|}|g|_|D]%}||jvr|j|&t |jdkrtd||t |j |_ | dS#t$r}td|d}~wwxYw)Nr)z'segment must have more than one elementz*no Residual classes found for this z range) rdrerfrc_matchrgrrr_zUpdater_maxMod_processAssertionError)rsrcrnum assertErrors rrzCompressionSegment.__init__=s4=%%&&    ( (C$+%% ""3''' t{  q -.WXX X a47||   MMOOOOO   -<  s;C C0C++C0c"|M||j|std||_|jd|jd}}dS|jd|jd}}t t ||dz|_dS)Nz-z range must be a superset of desired segmentrrar))_subsetrrrrdrN)rrzMinzMaxs rrzCompressionSegment._zUpdateWs =<< Q// E1CEEEDGTWR[$DDDQR$D5q2233DGGGrc|jS)z >>> a = sieve.CompressionSegment([3, 4, 5, 6, 7, 8]) >>> b = a() >>> str(b[0]) '1@0' ) _residualsrs rrzCompressionSegment.__call__fs rcg}t|jdkrt|jd}nA|jD]$}|t|%d|}|S)Nr)rr#)rrrstrrgjoin)rresStrresObjs rrzCompressionSegment.__str__pst t  1 $ $+,,FF/ + + c&kk****XXf%%F rcPd}|D] }||vr|dz} |t|krdSdS)zM True if sub is part of set; assumes no redundancies in each rr))rr)rsubthisSet commonNumris rrzCompressionSegment._subset{sF  * *AG||%M C 11rcd}||jkret||d|j}|}|||r||fS|||r||fS|dz}||jket d|j)z_ given a point, and SieveSegment, find a modulus and shift that match. r)rza mod was not found less than )rrrrr)rrRpartwholerSobjrs r_findzCompressionSegment._finds $,1aDG,,C#%%C||C&& Cxc5)) CxAA$,LdlLLMMMrcg|_tj|j}d}|r|dz}|d}||||j\}}|t d||jvr8|j||D]}||vr|||sn||jdS)a take a copy of match; move through each value of this list as if it were n; for each n test each modulo (from 1 to len(z) + 1) to find a residual. when found (one will be found), keep it; remove the found segments from the match, and repeat. rr)rNz_find() returned a None object)rrerr rrgrrc)rmatchmaxToRunrRrrris rrzCompressionSegment._processs $+&&  MHaAzz!UDK88HC{12RSSS$/))&&s+++((AEzz Q   rr) rrrrrrrrrr rrrrrrs:4 4 4 4 4   NNN&rrceZdZdZd8d9dZdZd Zd Zd Zd8d Z d Z dZ dZ dZ dZdZdZdZdZdZdZdZdZd:dZdZdZd;d Zd!Zd"Zd8d#Zd$Zd8d%Zd&Z d'Z! dd,Z#d?d-Z$ d@dAd5Z%dBd6Z&d7Z'dS)CSievez Create a sieve segment from a sieve logical string of any complexity. >>> a = sieve.Sieve('3@11') >>> b = sieve.Sieve('2&4&8|5') >>> c = sieve.Sieve('(5|2)&4&8') NusrStrstr | list[str]rlist[int] | Nonec|2t|trttd}n|t j|r ||_d|_d|_d|_ gd|_ d|_ i|_ d|_ d|_d|_d|_d|_||_|j|dSdS) NrKexprrFrra) isinstancerrdrNr isListLiker_state_expTyperr_nonCompressible_resLib_resId_expTree _expPeriod_cmpTree _cmpPeriod_usrStr_load)rr&rs rrzSieve.__init__s 9FC009U3ZZ  AA Y6,V44Y /4  #%B%B%B" %,.     < # JJLLLLL $ #rc8tj|jrD|||j|dS|||dSr)rr-r7 _resClear_initLoadSegment_initCompression _initParsers rr8z Sieve._loads  T\ * * $ NN     ! !$, / / /  ! ! # # # # # NN    OO     ! ! # # # # #rcd|_t|jvs*t|jvst|jvst |jvr- |nq#t$r d|_Yn^wxYw | d|_n=#t$r0 |n#t$r d|_YnwxYwYnwxYwd}|jrd}n|jdkrd}n |jdkrd}|S)Ncomplexr)simpler+zno compression possibler intersection) r/NEGr3LGROUPRGROUPXOR _cmpSegment IndexErrorr0r TypeError)rmethods rr<zSieve._initCompressionsF" 4= T]**T]**$-'' *  """" * * *()%%% * .%%''' (  . . ..$$&&&&!...,-D))). .    $.FF ]i ' 'FF ]h & &#F sHAA*)A*.B CB*)C*B>;C=B>>CCc|d}|d}t|}||kr||_||_dS||_t||_dS)zb Lazy period initialization, called only when needed from public period() method. r*cmpN)_resPeriodListrr4r6)rmListExpmListCmplcmExps r _initPeriodzSieve._initPeriod/sf&&u--&&u--h x  $DO$DOOO$DO!8nDOOOrcd|_dS)z7 Set this Sieve to its expanded state. r*N)r.rs rexpandz Sieve.expand?s rc|;||jkr0||_|d||jrdSd|_dS)z9 Set this sieve to its compressed state. NrK)rr:r<r0r.rs rcompresszSieve.compressEsY =Q$'\\DG NN5 ! ! !  ! ! # # #   DDKKKrcd|di}|j)|j|dj|d<n |j|d<|S)zH Provides a dictionary data representation for exchange logStrr*Nrr)rrr1 _resKeyStrr)rdatas r_getParameterDatazSieve._getParameterDataUsV dnnU++  7? T__Q%7%78:DIIDI rc||_dS)zu Set the z as a list. The z is the range of integers to use when generating a sieve segment. Nrrs rrz Sieve.setZds rcPtt||dz|_dS)z Set the z as a min and max value. The z is the range of integers to use when generating a sieve segment. r)Nrrs rrzSieve.setZRangekrrc|}||jvrtd|||_dS)Nzcannot set to format: )rrrrrrs rrzSieve.setSegmentFormatrsNiikk!! d0 0 0 !?#!?!?@@ @!rc|}dtt|dtg}|d}t ||S)z9 unary neg operators; return neg object. r+rVr)rYrrBrCrDr%)rdataSelfr&rs rrz Sieve.__neg__}sY))++   X       SMVQrc h|}|}dt|dttt|dtg}t |dt |dz}t |}t||S)z &, produces an intersection of two >>> a = sieve.Sieve('3@11') >>> b = sieve.Sieve('2&4&8|5') >>> c = sieve.Sieve('(5|2)&4&8') >>> d = a & b >>> str(d) '{2@0&4@0&8@0|5@0}&{3@2}' r+rVr)rYrrCrDANDrrdr%rrr^ dataOtherr&rrs rrz Sieve.__and__s))++++--   h     X     8C=!!C #$7$77 JJVQrc h|}|}dt|dttt|dtg}t |dt |dz}t |}t||S)z ``|``, produces a union >>> a = sieve.Sieve('3@11') >>> b = sieve.Sieve('2&4&8|5') >>> d = a | b >>> str(d) '{2@0&4@0&8@0|5@0}|{3@2}' r+rVr)rYrrCrDORrrdr%ras rrz Sieve.__or__s))++++--   h     X     8C=!!C #$7$77 JJVQrc h|}|}dt|dttt|dtg}t |dt |dz}t |}t||S)z4 ^, produces exclusive disjunction. r+rVr)rYrrCrDrErrdr%ras r__xor__z Sieve.__xor__s))++++--   h     X     8C=!!C #$7$77 JJVQrc,d}tj|rt|dddS|}|sdS|dr|dd}|dr|dd}|t d}|td}|ddkrd }|d d}nd}|sdS t|}n#tttf$rYdSwxYwd}tj|rt|}d}n:tj |r&|d}t|d kr |d }nd}|||d S) ai process an arg string for proper Residual creation valid syntax for Mod, shift pairs: all valid: MsubN, M@N, M,N, M if M is given alone, shift is assumed to be 0 this method assumes that all brackets have been replaced with parentheses returns a dictionary of args suitable for creating a Residual class r)rSrRrNr,r&r+r%r))rSrr)rrbrrfindreplacerCrDr NameError SyntaxErrorrHr-rr)rr&rSrargsrs r_parseResidualzSieve._parseResiduals  <   8V1Q77 7 4 ;;u   0^^E3//F ;;s   .^^C--F++++ !9  CABBZ%%''FFC 4  ''DD; 2   44  <   D AEE  t $ $ QA4yy1}}Q sDD+*D+ctj|rt|}|d}|ddkr|dt }|ddkr|dt }|ddkr|dt }|ddkr|dt }|ddkr|dt }|d dkr|d t}|d dkr|d t}|d dkr|d t}|d dkr|d t}|d dkr|d t}|dd}|S)a provide synonyms for logical symbols:: intersection == and, &, * union == or, |, + not == not, - the native format for str representation uses only ``&``, ``|``, ``-``; this method converts all other string representations all brackets and braces are replaced with parenthesis parentheses are only used for the internal representation on string representation, braces are restored z@0andr*or+xorr$not[](r r+) rrbrrirjr`rdrBrCrD)rr&s r _parseLogiczSieve._parseLogics <   #[[F]]]F ;;u   " "^^E3//F ;;s  q ^^C--F ;;t   ! !^^D"--F ;;s  q ^^C,,F ;;u   " "^^C,,F ;;u   " "^^E3//F ;;s  q ^^C00F ;;s  q ^^C00F ;;s  q ^^C00F ;;s  q ^^C00FR(( rcrt|}t|dd}d|dS)zF return string necessary to instantiate a set object. ryr+zset(r)rdreprrj)rvalLists r_setInstantiateStrzSieve._setInstantiateStrCs;w--w--''R00 g    rcd|dS)Nzr)rresIds rrWzSieve._resKeyStrKsE}}}rc|dvrtd|dkr,g}|jD] }||jvr||!|S|dkr,g}|jD] }||jvr||!|SdS)z5 get residual keys based on library. )rKr*zstate must be 'cmp' or 'exp'rKr*N)rr1r5rgr3)rstatelibKeyskeys r_resKeyszSieve._resKeysNs  & & !?@@ @ E>>G| ( ($-''NN3'''N e^^G| ( ($-''NN3'''N ^rr^r_cg}||D]:}|j|}||vr||;||S)z For all residual classes, get the period, or the value of M, and return these in a list. Remove any redundant values and sort. )rr1rrgrc)rrmListrr.s rrLzSieve._resPeriodListasg ==''  C S!((**A~~ Q  rcf|d|}|-d|}d|}td|dt|d|d|d|j}||j||<||S) z create a residual object, store in expResidualLib return a string id representation this uses self._z at initialization. r+Nz cannot parse zbad residual class notation: (rrSrr)rnrrrrr1rW)rrrresDictjoinedmsgrs r _resCreatezSieve._resCreatens %%bggfoo66 ?WWV__F*&**C !J#!J!J!JKK K'#,(8!%.$'3306 T__U++,u%%%rcf||j||<||Sr)r1rW)rrrs r _resAssignzSieve._resAssigns,/5 T__U++,u%%%rrc||j}tj|s|td||j|||}||S)z this is where residuals are converted to set evaluating strings z should not be stored; should be a temporary value Nz"z must be a list of integers, not )rrr-rr1r~)rrrRrr}s r _resToSetStrzSieve._resToSetStrsk 9A ## M  !Ka!K!KLL L%$,u%a++&&w///rc$|jdz|_dS)z' increment the _resId. r)N)r2rs r_resIdIncrementzSieve._resIdIncrementskAo rc8tt|j}|D]8}||}||jvr||jvrtd9t|j|_dS)z reset self._resId to the next available number may need to re-label some residual classes if gaps develop ids should be contiguous integer sequence zgap in residual keysN) rNrrr1keysrWr5r3rr2)riValsrXtestKeys r _resResetIdzSieve._resResetIds c$,++--..// = =Aooa((Gdm++t}0L0L$%;<<<$,++--.. rc|i|_d|_dS|dkr8||}|D] }|j|= |dS|dkrt ddS)NrrKr*z1Expanded residual classes should never be cleared)r1r2rrr)rrcmpKeysrs rr:zSieve._resClears =DLDKKK e^^mmE**G & &L%%         e^^ !TUU U^rcXg|_t||j}|j |j|_|}|D]I}|j||j||Jt|j|_dS)z= load from a segments reload _resId. N) r3rrrgrr2rrdr)rusrDatasegObjunionrs rr;zSieve._initLoadSegments  #GTW55 7?iDG # #F M f!E!E F F F  " " " " .. rci|_d|_g|_|t j|j}d} |t|krnA||}|dkrd}n ||dz }|t|dz krd}n ||dz}|tvr!|j ||dz}n|tkr|d}td|d|tkr ||tvrd}td|d|tkra|_|tkrT|1|tttt fvrd }td |d|j ||dz }n|t"jvs |tkrg}t j|} d} || | ztkr| t| dz} | | zt|krn;|| | z} | tvs | tkrn| | | dz} R|j ||jd |||| z}n|dz}V|jstd d |j|_dS) zV process usrStr string into proper argument dictionaries for Residual rr)Nz(negation cannot be used without operandsz"badly formed logical string (a): (rz,negation cannot be used as a binary operatorz"badly formed logical string (b): (z6negation must be of a group and isolated by delimitersz"badly formed logical string (c): (r+zno residual classes defined)r1r2r3rzrerfr7rrBOUNDSrgrBrRESIDUALrCr`rdrEstringdigitsrrr) rrrVrXchar charPreviouscharNextrrsubStartsubLensubChars rr=zSieve._initParses    !!$- "="=>> G CKK!9DAvv# %a!e} CKK!O##!!a%=v~~ $$T***E!1@$%P#%P%P%PQQQ#++"."h..D$%P#%P%P%PQQQ#++*&((!,(b#0FFFRC()Tc)T)T)TUUU $$T***Q &&$#++9Q<<(V+,33MM#&&&#aZF , 6)c&kk99$X%67G&((GsNN g...!'! , $$T__T["''&//%R%RSSS$$&&&JEOG R| @ !>?? ? .. rcg|_tj|j}|t}d}|D]}|dkr |t }t |dkr|j|d}nYtt |dz D]9}|dkr|j||}n|}|j||dz}||z}:|j | |j || t |j|_dS)z9 an unbound sieve, intersection Residual rr+r)N)r5rer3splitrdr`rrr1rNrgrr2rr) rrVorListrAorGroupandListrXrrs rrzSieve._cmpIntersection!s6 4=))b!!  # #G"}}mmC((G7||q  #|GAJ7 s7||a/00))AAvv L4( WQU^4A#$q5LL M l!K!K L L L  " " " " .. rczg|_|d}|stdt||j}|D]I}|j||j||Jt |j|_dS)z< a bound sieve, uss a newly created segment r*z/empty segment; segment compression not possibleN) r5rrGrrrgrr2rrdr)rrrrs rrFzSieve._cmpSegmentAs  ll5!! PNOO O#C11fhh # #F M f!E!E F F F  " " " " .. rr*t.Literal['cmp'] | t.Literal['exp'] | Nonec ||j}||j}||j}|dkrtj|j}n"|dkrtj|j}nd}||}tddd|}||}| d|dz}|D]-} | | | | ||}.| td}| td } t|d d tiii} n&#t$r} t!d |d | d} ~ wwxYwt#| } | |d vrt'| |S|dkrt)| |S|dvrMg} t+t-| dz D])} | | | dz| | z *| S| S)a Return a sieve segment in various formats. >>> a = sieve.Sieve('3@11') >>> a.segment('exp') [2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 98] >>> c = sieve.Sieve('(5|2)&4&8') >>> c.segment('cmp', segmentFormat='wid') [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8] Nr*rKr+r)rr%rxr __builtins__rzbadly formed logical string (rrwr)r.rrrer3r5rrr~rjrrCrDevalrrlrrdrcrnrzrNrrrg)rrrRrrevalStrrrsetStrrrserrXs rrz Sieve.segmentTs7& =KE 9A   /M E>>i ..GG e^^i ..GGG}}U##!Q1%%((22//#v|44 I ICooc4+<+CCCC    ::::   3ii  - - -$S!,, , f $ $ a(( ( . . .C3s88a<(( 2 2 CAJQ/1111JJs"D== E EE rc|j}|jdkr||dkr|jS|dkr|jSt d)aE Return the period of the sieve. >>> a = sieve.Sieve('3@11') >>> a.period() 3 >>> b = sieve.Sieve('2&4&8|5') >>> b.period() 40 >>> c = sieve.Sieve('(5|2)&4&8') >>> c.period() 40 * Changed in v9: state is taken from the object. rar*rKzState must be exp or cmp)r.r4rPr6 ValueError)rrs rrz Sieve.periods[(  ?b       E>>? " e^^? "788 8rc<||j|||Sr)rr.rs rrzSieve.__call__s||DKA}===rrKrRzMinimumrrrzStepc g}|}d}|dkr|} ||z} |dvr9||j|tt| | |} n8||j|tt| | d} || ddz}||z}|dz}t ||krn|dk|d|} t | |krt d|dkr-t | t| d| d dzS|d vr-t| t| d| d dzS| S) z Collect sieve segment points for the provided length and format. >>> a = sieve.Sieve('3@11') >>> a.collect(10, 100, 10, 'int') [102, 105, 108, 111, 114, 117, 120, 123, 126, 129] rrrrNr)z/desired length of sieve segment cannot be foundrwrar)rr.rdrNrrrrzrn) rrRrrrrfoundr. zExtendCountrrsegmentPartialrs rcollectz Sieve.collects*  U""Du9D 000!%dk1.25t3D3D.E.E}"V"V"&dk1.25t3D3D.E.Eu"N"NN111--EE A'!+L5zzV###U""(GVGn s88v   !RSS S F " " eCFCGaK&@&@AA A / / /$S%AB! *D*DEE EJrc8||j}|dkrtj|j}n"|dkrtj|j}nd}||}|D]6}|||j||}7|S)z style of None is use for users; adds | to single residuals style abs (absolute) does not add | tos single residual class Nr*rKr+)r.rer3r5rrjr1r)rrrrrrs rrzSieve.represents =KE E>>)DM**CC e^^)DM**CCC}}U## G GC++c4<#4#>#>u#E#EFFCC rc*|Srrrs rrz Sieve.__str__s~~rr)r&r'rr()r^r_)rN)NrNN)rrr^r_rr)rK) rRrrrrrrrrrr^r_)NN)(rrrrrr8r<rPrRrTrYrrrrrrrfrnrzr~rWrrLrrrrrr:r;r=rrFrrrrrrrrrr%r%s8 $ $ $> - - -        222"""       6   6   .;;;z+++\!!!&    &&&"&&& 0 0 0 0&&& / / / V V V V ///$V/V/V/V/v///@///*9=  KKKKKZ9999>>>>> 99999v*     rr%c2eZdZdZ ddd Zd ZddZdS) PitchSieveat Quick utility generator of :class:`music21.pitch.Pitch` lists from :class:`music21.sieve.Sieve` objects. >>> ps = sieve.PitchSieve('6@0', 'c4', 'c8') >>> [str(p) for p in ps()] ['C4', 'F#4', 'C5', 'F#5', 'C6', 'F#6', 'C7', 'F#7', 'C8'] >>> a = sieve.PitchSieve('4@7') >>> [str(p) for p in a()] ['E-3', 'G3', 'B3', 'E-4', 'G4', 'B4'] Nr) pitchLower str | None pitchUpper pitchOrigineld int | floatc||_t|j|_|tj||_ntjd|_|tj||_ntjd|_|tj||_ntj |j|_|t||_ dS||_ dS)Nc3c5) sieveStringr% sieveObjectr Pitchrrrrerfrsr)rrrrrrs rrzPitchSieve.__init__(s '#((8"9"9  !#k*55DOO#k$//DO  !#k*55DOO#k$//DO  "${;77D  #}T_==D  ?SzzDHHHDHHHrc |jj}|jj}tt t |t |dz}|jj}|jdkrM|||}g}|D]1}tj }||_| |2nt|j||d} tt t| }|||d} g}t t| D]C} | | dkr5tj }| | |_| |D|S)ag Return a sieve segment as a list of :class:`music21.pitch.Pitch` objects, mapped to the range between pitchLower and pitchUpper. >>> a = sieve.PitchSieve('4@7&5@4') >>> a() [] >>> a = sieve.PitchSieve('13@3|13@6|13@9', 'c1', 'c10') >>> ', '.join([str(p) for p in a()]) 'E-1, F#1, A1, E2, G2, B-2, F3, G#3, B3, F#4, A4, C5, G5, B-5, C#6, G#6, B6, D7, A7, C8, E-8, B-8, C#9, E9, B9' >>> a = sieve.PitchSieve('3@0', 'c4', 'c5', 'c4', 0.5) >>> a.eld 0.5 The following is a microtonal pitch sieve; presently these are not displayed; true values are [0, 1.5, 3.0, 4.5, 6.0, 7.5, 9.0, 10.5, 12.0] >>> pitches = a() >>> ', '.join([str(p) for p in pitches]) 'C4, C#~4, E-4, E~4, F#4, G~4, A4, B`4, C5' True values: [0.5, 2.0, 3.5, 5.0, 6.5, 8.0, 9.5, 11.0] >>> a = sieve.PitchSieve('3@0', 'c4', 'c5', 'c#4', 0.5) >>> pitches = a() >>> ', '.join([str(p) for p in pitches]) 'C~4, D4, E`4, F4, F#~4, G#4, A~4, B4' r)F)rr)rpsrrdrNrrrrr rrgrrr) rminPSmaxPSrrRsieveSegIntegerssieveSegpsNumr.r}binSegrXs rrzPitchSieve.__call__HsYD"" s5zz3uqy>>22 3 3    8q==#//155 H) # #KMM"""" # #48UEeLLLGU3w<<(())A%%aE22FH3v;;'' ' '!9>> A"1:ADOOA&&&rr^list[interval.Interval]cj|j}|dkr tt|dz}nd}|d|d}g}t |D]6\}}t j||jz}||7|std|S)ax Return a list of Interval objects that defines the complete structure of this :class:`music21.sieve.Sieve`. >>> a = sieve.PitchSieve('3@0') >>> a.getIntervalSequence() [] >>> a = sieve.PitchSieve('3@0|7@0') >>> a.sieveObject.segment() [0, 3, 6, 7, 9, 12, 14, 15, 18, 21, 24, 27, 28, 30, 33, 35, 36, 39, 42, 45, 48, 49, 51, 54, 56, 57, 60, 63, 66, 69, 70, 72, 75, 77, 78, 81, 84, 87, 90, 91, 93, 96, 98, 99] >>> a.sieveObject.period() 21 >>> a.getIntervalSequence() [, , , , , , , , ] This is the PitchSieve for a major scale: >>> b = sieve.PitchSieve('(-3@2 & 4) | (-3@1 & 4@1) | (3@2 & 4@2) | (-3 & 4@3)') >>> b.getIntervalSequence() [, , , , , , ] iɚ;r)Nrr)rzinterval segment has no values) rrrdrN enumerater Intervalrrgr)rr.r widthSegmentspostrXr intervalObjs rgetIntervalSequencezPitchSieve.getIntervalSequencesP   # # % % y==U1q5\\""AAA((AU(CC (*!-00 % %HAu"+EDH,<==K KK $ $ $ $ H%&FGG G r)NNNr))rrrrrrrr)r^r)rrrrrrrrrrrrsj  )-(,)-"# @>>>@======rrcDeZdZdZdZdZdZdZdZdZ dZ d Z d S) Testc2|dddS)NT) assertEqualrs r testDummyzTest.testDummys t$$$$$rc|d}|D]}|t|dzz }|dt|dz }|dz }|S)Nrvz, rr'rw)rrr)rlistInoutr.s rpitchOutz Test.pitchOutsR ! !A 3q66D= CC!CHHqL.! s  rctd}gd}|D],\}}}}t||}t||}||z}-dS)Nr2))r2r3r'r4)rr3r)r2)r4rr2r')r) rrtestArgsrrrrrrXs rtestIntersectionzTest.testIntersectionsb QKK???&  NBBR  AR  AAAA  rc gd}|D]7}t|}|dttd}8dS)N)z-5 | 4 & 4sub3 & 6 | 4 & 4z2 or 4 and 4 & 6 or 4 & 4r2)r'rr3)r)r3r6r8r)r%rdrN)rrargtestObjdummys rtestSieveParsezTest.testSieveParsesX 0 0CCjjGGAtE"II//EE 0 0rcvtddd}td}|j|jf}|}dS)Nz-5 | 4 & 4sub3 & 6b3zf#4)rrr)runused_testObjrrs rtestSievePitchzTest.testSievePitchsA#$8$FF122"G$66 rcgd}|D]7}t|}tt|}|}8dS)N))r2r3 ) rr3rr$*)rr3r7)r'r2rr4r rLr6r8r9r:rr;r<)rr'rr4r5rr6rrrr8r9r:r) r)r'r2rr4r3r5rrrL)iirr'r))rr%r)rrmr rsObjrs r testTimePointzTest.testTimePointsY  C$S))CS??DDFFEE  rcPttd}d}t||}|t |dd}t||}|t |dd}t||}|t |dd}t||}|t |d d }t||}|t |d dS) NrKz"3@2 & 4@1 | 2@0 & 3@1 | 3@3 | -4@2z3@2&4@1|2@0&3@1|3@0|-4@2z5-(3@2 & -4@1 & -(12@3 | 12@8) | (-2@0 & 3@1 | (3@3)))z)-{3@2&-4@1&-{12@3|12@8}|{-2@0&3@1|{3@0}}}z[(8@0 | 8@1 | 8@7) & (5@1 | 5@3)] | [(8@0 | 8@1 | 8@2) & 5@0] | [8@3 & (5@0 | 5@1 | 5@2 | 5@3 | 5@4)] | [8@4 & (5@0 | 5@1 | 5@2 | 5@3 | 5@4)] | [(8@5 | 8@6) & (5@2 | 5@3 | 5@4)] | (8@1 & 5@2) | (8@6 & 5@1)z{{8@0|8@1|8@7}&{5@1|5@3}}|{{8@0|8@1|8@2}&5@0}|{8@3&{5@0|5@1|5@2|5@3|5@4}}|{8@4&{5@0|5@1|5@2|5@3|5@4}}|{{8@5|8@6}&{5@2|5@3|5@4}}|{8@1&5@2}|{8@6&5@1}z4(-3@2 & 4) | (-3@1 & 4@1) | (3@2 & 4@2) | (-3 & 4@3)z*{-3@2&4@0}|{-3@1&4@1}|{3@2&4@2}|{-3@0&4@3}zV(-(13@3 | 13@5 | 13@7 | 13@9) & 11@2) | (-(11@4 | 11@8) & 13@9) | (13@0 | 13@1 | 13@6)zB{-{13@3|13@5|13@7|13@9}&11@2}|{-{11@4|11@8}&13@9}|{13@0|13@1|13@6})rdrNr%rr)rrr&rs r testSievezTest.testSieves5 s  5 &!   Q!;<<<H &!   Q!LMMMR &!   QI J J J H &!   Q!MNNN) &!   Q] _ _ _ _ _rc6ddlm}|ddd}|||d|dddd}|||d dS) Nrr z3@0|7@0rc6z\[C2, E-2, F#2, G2, A2, C3, D3, E-3, F#3, A3, C4, E-4, E4, F#4, A4, B4, C5, E-5, F#5, A5, C6]r'rz5[C2, D2, F#2, C3, E3, F#3, C4, F#4, C5, F#5, G#5, C6]music21r rrrrr s1s rtestPitchSieveAzTest.testPitchSieveA3s!!!!!!   it 4 4 rrtt,,B C C C  it  ; ; rrtt,,P R R R R Rrc:ddlm}|dddd}|||d|d ddd}|||d dS) Nrr z1@0rr g?ra[C2, C~2, C#2, C#~2, D2, D~2, E-2, E`2, E2, E~2, F2, F~2, F#2, F#~2, G2, G~2, G#2, G#~2, A2, A~2, B-2, B`2, B2, B~2, C3, C~3, C#3, C#~3, D3, D~3, E-3, E`3, E3, E~3, F3, F~3, F#3, F#~3, G3, G~3, G#3, G#~3, A3, A~3, B-3, B`3, B3, B~3, C4, C~4, C#4, C#~4, D4, D~4, E-4, E`4, E4, E~4, F4, F~4, F#4, F#~4, G4, G~4, G#4, G#~4, A4, A~4, B-4, B`4, B4, B~4, C5, C~5, C#5, C#~5, D5, D~5, E-5, E`5, E5, E~5, F5, F~5, F#5, F#~5, G5, G~5, G#5, G#~5, A5, A~5, B-5, B`5, B5, B~5, C6]z3@0z[C2, C#~2, E-2, E~2, F#2, G~2, A2, B`2, C3, C#~3, E-3, E~3, F#3, G~3, A3, B`3, C4, C#~4, E-4, E~4, F#4, G~4, A4, B`4, C5, C#~5, E-5, E~5, F#5, G~5, A5, B`5, C6]rrs rtestPitchSieveBzTest.testPitchSieveB?s!!!!!!  eT4S  9 9 rrtt,,Z [ [ [  eT4S  9 9 rrtt,,- . . . . .rN) rrrrrrrrrr rrrrrrrs%%% 0 0 0   ___B R R R.....rrz list[type] _DOC_ORDER__main__)r'r)r\r]r^r_)rr)T):r __future__rastrcollections.abcrremathrrrPrtypingtunittestrrr r r r Environment environLocalMusic21ExceptionrrrrrrCrDr`rdrErrBrdrrr0r[rnrzr~rrrrrr%rTestCaserr__annotations__rmainTestrrrr%s$(((R#"""""$$$$$$   &{&w//      L1        5        \2        ,"?        ,7        &#r3 '  4  # &::::z>>>J#####L&&&&R4....l   4XXXXXXXXxTTTTTTTTpUUUUUUUUBt  t  t  t  t  t  t  t  tkkkkkkkkBv.v.v.v.v.8 v.v.v.|  zNNNGTr