3j*ddlmZgdZddlZddlZddlZddlZGddejZGdde Z ddiZ Gd d Z Gd d Z Gd de ZGddeZGddZedk(rddlZej&yy)) 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#bKtt fdd}|Ed{y7w)Nc|SN)xselfs C/DATA/.local/lib/python3.12/site-packages/music21/common/objects.pyz*RelativeCounter.__iter__..Ds d1gT)keyreverse)sortedsuper__iter__)r sortedKeys __class__s` rrzRelativeCounter.__iter__Cs'EG,.4EtT s #/-/c#,K|D] }|||f ywrr)rks ritemszRelativeCounter.itemsGsAT!W* scztfdD}i}D] }||z ||<j|}|S)Nc3(K|] }| ywrr.0rrs r z/RelativeCounter.asProportion..L,t!d1gtsumrrselfLenoutDictynews` r asProportionzRelativeCounter.asProportionKsI,t,,Aa7*GAJnnW% rctfdD}i}D]}|dz|z ||<j|}|S)Nc3(K|] }| ywrrr!s rr#z/RelativeCounter.asPercentage..Ur$r%dr&r(s` r asPercentagezRelativeCounter.asPercentageTsM,t,,Aa30GAJnnW% r) __name__ __module__ __qualname____doc__rrr-r1 __classcell__rs@rrrs"Jrrc4eZdZdZfdZdZdZdZxZS)rz Call a function for every time something is missing: >>> a = common.defaultlist(lambda:True) >>> a[5] True c0t|||_yr)r__init___fx)rfxrs rr:zdefaultlist.__init__fs rc~t||kr/|j|jt||kr.yyr)lenappendr;rindexs r_fillzdefaultlist._filljs.$i5 KK #$i5 rcT|j|tj|||yr)rBlist __setitem__)rrAvalues rrEzdefaultlist.__setitem__ns  5 ue,rcP|j|tj||Sr)rBrD __getitem__r@s rrHzdefaultlist.__getitem__rs! 5e,,r) r2r3r4r5r:rBrErHr6r7s@rrr^s$--rrrFceZdZdZdZdZy)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 cyrrrs rr:zSingletonCounter.__init__s rc:td}tdxxdz cc<|S)NrF)_singletonCounter)rposts r__call__zSingletonCounter.__call__s! )'"a'" rN)r2r3r4r5r:rPrrrrrzs  rrc2eZdZUdZdZded<dZdZdZy) 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__ct|dd|jj}ni}|j}|D]J}t||d}t |t j r|}td|d|ddz|||<L|S)N__dict__z#Warning: uncaught weakref found in z - z, zwill not be wrapped again)getattrrUcopy_getSlotsRecursive isinstanceweakref ReferenceTypeprint)rstateslotsslotsValues r __getstate__zSlottedObjectMixin.__getstate__s 4T * 6MM&&(EE'')DT4.F&'"7"78;D83tfBO345 E$K  rcN|jD]\}}t|||yr)rsetattr)rr]r_rFs r __setstate__zSlottedObjectMixin.__setstate__s" ;;=KD% D$ &)rct}|jjD]}|jt |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'] rSr)setrmroupdaterV)rr^clss rrXz%SlottedObjectMixin._getSlotsRecursives<6>>%%'C LLk26 7( rN) r2r3r4r5rS__annotations__rardrXrrrrrs##N"$I# 'rrc,eZdZUdZdZded<dZdZy)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 rrRrSct|t|ury|jD]#}|dk(r t||t||k7s#yy)NFidT)typerXrV)rotherthisSlots r__eq__zEqualSlottedObjectMixin.__eq__sQ :T%[ (//1H4tX&'%*BB 2 rc||k( S)zS Defining __ne__ explicitly so that it inherits the same as __eq__ r)rros r__ne__zEqualSlottedObjectMixin.__ne__ sEM""rN)r2r3r4r5rSrjrqrsrrrrrs"$I##rrcbeZdZUdZded<d d dZd fd Zd fd ZfdZfdZ d d Z xZ S)r rrRrSc~|dk(ryt|ddsytjD]p}|jjj dvs&d|jj vs?|jj dj|jk(spytd|jjd)NrTfrozen)r:__new__rdrzThis z instance is immutable.) rVinspectstackframef_codeco_namef_localsr TypeErrorr2)rrsts r _check_initzFrozenObject._check_inits + tXt,--/B''+RR"(("3"33))&1;;t~~M " % 7 788OPQQrcH|j|t| ||yr)rr __setattr__rrrFrs rrzFrozenObject.__setattr__#s   C'rcF|j|t| |yr)rr __delattr__rrrs rrzFrozenObject.__delattr__'s  C rcttdr |jt| ||t |j d)NrE object is not subscriptable)hasattrrrrEr~rrs rrEzFrozenObject.__setitem__+sB 57M *     G U +4>>**FGHHrcttdr|jt| |t |j d)N __delitem__r)rrrrr~rrs rrzFrozenObject.__delitem__1s@ 57M *     G  $4>>**FGHHrcg}|jD]}|j|t||f!tt |Sr)rXr?rVhashtuple)routss r__hash__zFrozenObject.__hash__7sA((*A JJ74+, -+E#Jrr)returnbool)rstr)rint) r2r3r4rSrjrrrrErrr6r7s@rr r s.!#I# R(!I I  rr c4eZdZdZdZdZdZdZdZdZ y) 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|_yNr)time_tStart_tDif_tStoprKs rr:zTimer.__init__Xsyy{   rcRtj|_d|_d|_y)zu Explicit start method; will clear previous values. Start always happens on initialization. Nr)rrrrrKs rstartz Timer.start^s yy{   rcrtj|_|j|jz |_yr)rrrrrKs rstopz Timer.stophs#iik [[4<</ rc.d|_d|_d|_yr)rrrrKs rclearz Timer.clearls   rc||j#tj|jz }|S|j}|S)zD Reports current time or, if stopped, stopped time. )rrrrrtimeDifferences rrPzTimer.__call__qs; ;; !YY[4<<7N"ZZNrc|j"tj|jz }n |j}t t |dS)N)rrrrrroundrs r__str__z Timer.__str__|s; ;; !YY[4<<7N!ZZN5+,,rN) r2r3r4r5r:rrrrPrrrrr r ?s%0 0 -rr __main__) __future__r__all__ collectionsrxrrZCounterrrDrrNrrrr r r2music21mainTestrrrrs#  >k))>B-$-2aL8]]@#0#:( *( XB-B-J zGr