j*@ddlmZgdZddlZddlZddlZddlZGddejZGdde Z ddiZ Gd d Z Gd d Z Gd de ZGddeZGddZedkrddlZejdSdS)) annotations) defaultlistSingletonCounterRelativeCounterSlottedObjectMixinEqualSlottedObjectMixin FrozenObjectTimerNc4eZdZdZfdZdZdZdZxZS)ra A counter that iterates from most common to least common and can return new RelativeCounters that adjust for proportion or percentage. >>> l = ['b', 'b', 'a', 'a', 'a', 'a', 'c', 'd', 'd', 'd'] + ['e'] * 10 >>> rc = common.RelativeCounter(l) >>> for k in rc: ... print(k, rc[k]) e 10 a 4 d 3 b 2 c 1 Ties are iterated according to which appeared first in the generated list. >>> rcProportion = rc.asProportion() >>> rcProportion['b'] 0.1 >>> rcProportion['e'] 0.5 >>> rcPercentage = rc.asPercentage() >>> rcPercentage['b'] 10.0 >>> rcPercentage['e'] 50.0 >>> for k, perc in rcPercentage.items(): ... print(k, perc) e 50.0 a 20.0 d 15.0 b 10.0 c 5.0 c#Kttfdd}|Ed{VdS)Nc|SN)xselfs /Users/tedpeters/Documents/Projects/Claude Projects/Misc Tools/notename-sheets/.venv/lib/python3.11/site-packages/music21/common/objects.pyz*RelativeCounter.__iter__..Ds d1gT)keyreverse)sortedsuper__iter__)r sortedKeys __class__s` rrzRelativeCounter.__iter__CsTEGG,,..4E4E4E4EtTTT rc#,K|D]}|||fVdSrr)rks ritemszRelativeCounter.itemsGs6  AT!W*      rctfdD}i}D]}||z ||<|}|S)Nc3(K|] }|V dSrr.0rrs r z/RelativeCounter.asProportion..L',,!d1g,,,,,,rsumrrselfLenoutDictynews` r asProportionzRelativeCounter.asProportionKsc,,,,t,,,,, + +Aa7*GAJJnnW%% rctfdD}i}D]}|dz|z ||<|}|S)Nc3(K|] }|V dSrrr!s rr#z/RelativeCounter.asPercentage..Ur$rdr%r's` r asPercentagezRelativeCounter.asPercentageTsg,,,,t,,,,, 1 1Aa30GAJJnnW%% r) __name__ __module__ __qualname____doc__rrr,r0 __classcell__rs@rrrsp""Jrrc4eZdZdZfdZdZdZdZxZS)rz Call a function for every time something is missing: >>> a = common.defaultlist(lambda:True) >>> a[5] True cVt||_dSr)r__init___fx)rfxrs rr9zdefaultlist.__init__fs$ rct||kr<||t||k:dSdSr)lenappendr:rindexs r_fillzdefaultlist._filljsL$ii5  KK # # #$ii5      rch||t|||dSr)rAlist __setitem__)rr@values rrDzdefaultlist.__setitem__ns2 5 ue,,,,,rcb||t||Sr)rArC __getitem__r?s rrGzdefaultlist.__getitem__rs* 5e,,,r) r1r2r3r4r9rArDrGr5r6s@rrr^so$$$----------rrrEceZdZdZdZdZdS)raW A simple counter that can produce unique numbers (in ascending order) regardless of how many instances exist. Instantiate and then call it. >>> sc = common.SingletonCounter() >>> v0 = sc() >>> v1 = sc() >>> v1 > v0 True >>> sc2 = common.SingletonCounter() >>> v2 = sc2() >>> v2 > v1 True cdSrrrs rr9zSingletonCounter.__init__s rcJtd}tdxxdz cc<|S)NrE)_singletonCounter)rposts r__call__zSingletonCounter.__call__s- )'"""a'""" rN)r1r2r3r4r9rOrrrrrzs<    rrc4eZdZUdZdZded<dZdZdZdS) ra Provides template for classes implementing slots allowing it to be pickled properly, even if there are weakrefs in the slots, or it is subclassed by something that does not define slots. Only use SlottedObjectMixins for objects that we expect to make so many of that memory storage and speed become an issue. Thus, unless you are Xenakis, Glissdata is probably not the best example: >>> import pickle >>> class Glissdata(common.SlottedObjectMixin): ... __slots__ = ('time', 'frequency') >>> s = Glissdata() >>> s.time = 0.125 >>> s.frequency = 440.0 >>> #_DOCS_SHOW out = pickle.dumps(s) >>> #_DOCS_SHOW pickleLoad = pickle.loads(out) >>> pickleLoad = s #_DOCS_HIDE -- cannot define classes for pickling in doctests >>> pickleLoad.time, pickleLoad.frequency (0.125, 440.0) OMIT_FROM_DOCS >>> class BadSubclass(Glissdata): ... pass >>> bsc = BadSubclass() >>> bsc.amplitude = 2 >>> #_DOCS_SHOW out = pickle.dumps(bsc) >>> #_DOCS_SHOW outLoad = pickle.loads(out) >>> outLoad = bsc #_DOCS_HIDE -- cannot define classes for pickling in doctests >>> outLoad.amplitude 2 This is in OMIT rtuple[str, ...] __slots__c8t|dd|j}ni}|}|D]U}t||d}t |t jr#|}td|d|ddz|||<V|S)N__dict__z#Warning: uncaught weakref found in z - z, zwill not be wrapped again)getattrrTcopy_getSlotsRecursive isinstanceweakref ReferenceTypeprint)rstateslotsslotsValues r __getstate__zSlottedObjectMixin.__getstate__s 4T * * 6M&&((EEE'')) ! !DT4..F&'"788 5ODOOtOOO34555 E$KK rc\|D]\}}t|||dSr)rsetattr)rr\r^rEs r __setstate__zSlottedObjectMixin.__setstate__s< ;;== ' 'KD% D$ & & & & ' 'rct}|jD]&}|t |dd'|S)aA Find all slots recursively. A private attribute so as not to change the contents of inheriting objects private interfaces: >>> b = beam.Beam() >>> sSet = b._getSlotsRecursive() sSet is a set -- independent order. Thus, for the doctest we need to preserve the order: >>> sorted(list(sSet)) ['_editorial', '_style', 'direction', 'id', 'independentAngle', 'number', 'type'] When a normal Beam won't cut it: >>> class FunkyBeam(beam.Beam): ... __slots__ = ('funkiness', 'groovability') >>> fb = FunkyBeam() >>> sSet = fb._getSlotsRecursive() >>> sorted(list(sSet)) ['_editorial', '_style', 'direction', 'funkiness', 'groovability', 'id', 'independentAngle', 'number', 'type'] rRr)setrmroupdaterU)rr]clss rrWz%SlottedObjectMixin._getSlotsRecursivesP6>%%'' 8 8C LLk266 7 7 7 7 rN) r1r2r3r4rR__annotations__r`rcrWrrrrrsa##N"$I####   '''rrc.eZdZUdZdZded<dZdZdS)rz Same as above, but __eq__ and __ne__ functions are defined based on the slots. Slots are the only things compared, so do not mix with a __dict__ based object. The equal comparison ignores differences in .id rrQrRct|t|urdS|D].}|dkr t||t||krdS/dS)NFidT)typerWrU)rotherthisSlots r__eq__zEqualSlottedObjectMixin.__eq__sx ::T%[[ ( (5//11  H4tX&&'%*B*BBBuuCtrc||k S)zS Defining __ne__ explicitly so that it inherits the same as __eq__ r)rrns r__ne__zEqualSlottedObjectMixin.__ne__ sEM""rN)r1r2r3r4rRrirprrrrrrrsQ"$I#########rrcbeZdZUdZded<dddZdfd Zdfd Zfd Zfd Z ddZ xZ S)r rrQrRNreturnboolc&|dkrdSt|ddsdStjD]F}|jjjdvr1d|jjvr#|jjdj|jkrdSGtd|jj d)NrTfrozen)r9__new__rcrzThis z instance is immutable.) rUinspectstackframef_codeco_namef_localsr TypeErrorr1)rrsts r _check_initzFrozenObject._check_inits +  4tXt,, 4-//  B'+RRR"("333)&1;t~MMttP 7PPPQQQrrstrcv||t||dSr)rr __setattr__rrrErs rrzFrozenObject.__setattr__#s7  C'''''rct||t|dSr)rr __delattr__rrrs rrzFrozenObject.__delattr__'s5  C     rcttdr6|t||t |jd)NrD object is not subscriptable)hasattrrrrDrrrs rrDzFrozenObject.__setitem__+s^ 577M * * ,       GG  U + + +4>GGGHHHrcttdr5|t|t |jd)N __delitem__r)rrrrrrrs rrzFrozenObject.__delitem__1s\ 577M * * %       GG   $ $ $4>GGGHHHrintcg}|D]'}||t||f(tt |Sr)rWr>rUhashtuple)routss r__hash__zFrozenObject.__hash__7sZ((** . .A JJ74++, - - - -E#JJrr)rtru)rr)rtr) r1r2r3rRrirrrrDrrr5r6s@rr r s!#I#### R R R R R((((((!!!!!!IIIII IIIII         rr c6eZdZdZdZdZdZdZdZdZ dS) r aG An object for timing. Call it to get the current time since starting. >>> timer = common.Timer() >>> now = timer() >>> import time #_DOCS_HIDE >>> time.sleep(0.01) #_DOCS_HIDE -- some systems are extremely fast or have wide deltas >>> nowNow = timer() >>> nowNow > now True Call `stop` to stop it. Calling `start` again will reset the number >>> timer.stop() >>> stopTime = timer() >>> stopNow = timer() >>> stopTime == stopNow True All this had better take less than one second! >>> stopTime < 1 True cRtj|_d|_d|_dSNr)time_tStart_tDif_tStoprJs rr9zTimer.__init__Xs!y{{   rcRtj|_d|_d|_dS)zu Explicit start method; will clear previous values. Start always happens on initialization. Nr)rrrrrJs rstartz Timer.start^s# y{{   rc^tj|_|j|jz |_dSr)rrrrrJs rstopz Timer.stophs#ikk [4</ rc0d|_d|_d|_dSr)rrrrJs rclearz Timer.clearls   rcZ|jtj|jz }n|j}|S)zD Reports current time or, if stopped, stopped time. )rrrrrtimeDifferences rrOzTimer.__call__qs- ; !Y[[4<7NN!ZNrc|jtj|jz }n|j}t t |dS)N)rrrrrroundrs r__str__z Timer.__str__|s= ; !Y[[4<7NN!ZN5++,,,rN) r1r2r3r4r9rrrrOrrrrr r ?sx0 000   -----rr __main__) __future__r__all__ collectionsryrrYCounterrrCrrMrrrr r r1music21mainTestrrrrs#"""""    >>>>>k)>>>B-----$---2aL8]]]]]]]]@#####0###:( ( ( ( ( *( ( ( XB-B-B-B-B-B-B-B-J zNNNGr