rh + SSKJr /SQrSSKrSSKrSSKrSSKr"SS\R5r"SS\ 5r SS0r "S S 5r "S S 5r "S S\ 5r"SS\5r"SS5r\S:XaSSKr\R&"5 gg)) annotations) defaultlistSingletonCounterRelativeCounterSlottedObjectMixinEqualSlottedObjectMixin FrozenObjectTimerNc>^\rSrSrSrU4SjrSrSrSrSr U=r $)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#^>^# [[TT] 5U4SjSS9nUShvN gN7f)Nc>TU$N)xselfs P/home/james-whalen/.local/lib/python3.13/site-packages/music21/common/objects.py*RelativeCounter.__iter__..Es d1gT)keyreverse)sortedsuper__iter__)r sortedKeys __class__s` rrRelativeCounter.__iter__Ds&EG,.4EtT s !-+-c#.# UH nXU4v M g7frr)rks ritemsRelativeCounter.itemsHsA!W* sc~^[U4SjT55n0nTH nTUU- X#'M TRU5nU$)Nc3.># UH nTUv M g7frr.0rrs r /RelativeCounter.asProportion..M,t!d1gtsumrrselfLenoutDictynews` r asProportionRelativeCounter.asProportionLsG,t,,Aa7*GJnnW% rc^[U4SjT55n0nTHnTUS-U- X#'M TRU5nU$)Nc3.># UH nTUv M g7frrr%s rr'/RelativeCounter.asPercentage..Vr)r*dr+r-s` r asPercentageRelativeCounter.asPercentageUsK,t,,Aa30GJnnW% rr) __name__ __module__ __qualname____firstlineno____doc__rr!r2r8__static_attributes__ __classcell__rs@rrrs""Jrrc>^\rSrSrSrU4SjrSrSrSrSr U=r $)r_zm Call a function for every time something is missing: >>> a = common.defaultlist(lambda:True) >>> a[5] True c.>[TU]5 Xlgr)r__init___fx)rfxrs rrEdefaultlist.__init__gs rc[U5U::a1URUR55 [U5U::aM0ggr)lenappendrFrindexs r_filldefaultlist._fillks.$i5 KK #$i5 rcRURU5 [RXU5 gr)rNlist __setitem__)rrMvalues rrRdefaultlist.__setitem__os 5 e,rcNURU5 [RX5$r)rNrQ __getitem__rLs rrVdefaultlist.__getitem__ss 5,,r)rF) r:r;r<r=r>rErNrRrVr?r@rAs@rrr_s!$---rrrSc$\rSrSrSrSrSrSrg)r{a# 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 cgrrrs rrESingletonCounter.__init__s rc:[Sn[S==S- ss'U$)NrS)_singletonCounter)rposts r__call__SingletonCounter.__call__s! )'"a'" rrN)r:r;r<r=r>rErar?rrrrr{s  rrc:\rSrSr%SrSrS\S'SrSrSr Sr g ) raH 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__c&[USS5b[US5R5nO0nUR5nUHOn[XS5n[U[R 5(aU"5n[ SU<SUS3S-5 XAU'MQ U$)N__dict__z#Warning: uncaught weakref found in z - z, zwill not be wrapped again)getattrcopy_getSlotsRecursive isinstanceweakref ReferenceTypeprint)rstateslotsslotsValues r __getstate__SlottedObjectMixin.__getstate__s 4T * 6D*-224EE'')DT.F&'"7"788;D83tfBO345 $K  rcNUR5Hup#[XU5 M gr)r!setattr)rrprrrSs r __setstate__SlottedObjectMixin.__setstate__s ;;=KD D &)rc[5nURR5HnUR[ USS55 M! U$)a 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'] rfr)setrmroupdateri)rrqclss rrk%SlottedObjectMixin._getSlotsRecursives<6>>%%'C LLk26 7( rN) r:r;r<r=r>rf__annotations__rtrxrkr?rrrrrs##N"$I# 'rrc4\rSrSr%SrSrS\S'SrSrSr g) 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 rrerfc[U5[U5LagUR5H%nUS:XaM [X5[X5:wdM% g g)NFidT)typerkri)rotherthisSlots r__eq__EqualSlottedObjectMixin.__eq__sM :T%[ (//1H4t&'%*BB 2 rc X:X+$)zC Defining __ne__ explicitly so that it inherits the same as __eq__ r)rrs r__ne__EqualSlottedObjectMixin.__ne__ s ""rN) r:r;r<r=r>rfrrrr?rrrrrs"$I##rrc|^\rSrSr%SrS\S'S S SjjrS U4SjjrS U4SjjrU4Sjr U4S jr SS jr Sr U=r $)r irrerfcUS:Xag[USS5(dg[R"5HxnURRR S;dM)SURR ;dMEURR SRUR:XdMx g [SURRS35e)NrTfrozen)rE__new__rxrzThis z instance is immutable.) riinspectstackframef_codeco_namef_localsr TypeErrorr:)rrsts r _check_initFrozenObject._check_inits + tXt,,--/B''+RR"(("3"33))&1;;t~~M " % 7 788OPQQrcF>URU5 [TU] X5 gr)rr __setattr__rrrSrs rrFrozenObject.__setattr__$s  C'rcF>URU5 [TU] U5 gr)rr __delattr__rrrs rrFrozenObject.__delattr__(s  C rc>[[5S5(aUR5 [TU] X5 [ UR S35e)NrR object is not subscriptable)hasattrrrrRrrrs rrRFrozenObject.__setitem__,sC 57M * *     G  +4>>**FGHHrc>[[5S5(aUR5 [TU] U5 [ UR S35e)N __delitem__r)rrrrrrrs rrFrozenObject.__delitem__2sC 57M * *     G  $4>>**FGHHrc/nUR5HnURU[X545 M! [[ U55$r)rkrKrihashtuple)routss r__hash__FrozenObject.__hash__8s?((*A JJ74+, -+E#Jrr)returnbool)rstr)rint)r:r;r<r=rfrrrrrRrrr?r@rAs@rr r s3!#I# R(!I I   rr c<\rSrSrSrSrSrSrSrSr Sr S r g ) r i@a 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 cT[R"5UlSUlSUlgNr)time_tStart_tDif_tStopr[s rrETimer.__init__Ysyy{   rcT[R"5UlSUlSUlg)z] Explicit start method; will clear previous values. Start always happens on initialization. Nr)rrrrr[s rstart Timer.start_s yy{   rct[R"5UlURUR- Ulgr)rrrrr[s rstop Timer.stopis#iik [[4<</ rc.SUlSUlSUlgr)rrrr[s rclear Timer.clearms   rcURc$[R"5UR- nU$URnU$)z4 Reports current time or, if stopped, stopped time. )rrrrrtimeDifferences rraTimer.__call__rs; ;; !YY[4<<7N"ZZNrcURc#[R"5UR- nO URn[ [ US55$)N)rrrrrroundrs r__str__ Timer.__str__}s; ;; !YY[4<<7N!ZZN5+,,r)rrrN) r:r;r<r=r>rErrrrarr?rrrr r @s%0 0 -rr __main__) __future__r__all__ collectionsrrrmCounterrrQrr_rrrr r r:music21mainTestrrrrs#  >k))>B-$-2aL8]]@#0#:( *( XB-B-J z r