rhCSrSSKJr SSKJr SSKrSSKrSSKJ r SSK J r J r SSK Jr SSK Jr SS KJr SS KJr SS KJr \R((aSS K Jr S SSSSS.SSjjrSSSSS.SSjjrSS.SSjjrSSS.SSjjr"SS\R45r\S:XaSSK r \ R:"\5 gg)zG Tools for creating timespans (fast, manipulable objects) from Streams ) annotations)SequenceN) Music21Object) M21ObjType StreamType)common)note)spans) timespanTree)treesstreamF) classListscurrentParentage initialOffsetflatten useTimespansc SSKJn UcU4nUSnU(a[RnO[R nU(dU"US9/n OUV s/sHo"US9PM n n UR SSUR-n U GHn URU 5U-n SnU R(a}[R"SU 5n X,4-n[U UU UUUS9n[U U5HAunnUSLaURUSS5 M!URUR5U5 MC S nU(aUS :XdMUnX7R R"-nXR R"-n[X5HunnU(a"U R$R'U5(aM/U(a|[)U [*R,UR.45(a[0R2nO[0R4nU"U [7[9U55UUU US 9nURU5 MURX5 M GM U $s sn f) a> To be DEPRECATED in v8: this is no faster than calling streamToTimespanTree multiple times with different classLists. Recurses through `inputStream`, and constructs TimespanTrees for each encountered substream and PitchedTimespan for each encountered non-stream element. `classLists` should be a sequence of elements contained in `classSet`. One TimespanTree will be constructed for each element in `classLists`, in a single optimized pass through the `inputStream`. This is used internally by `streamToTimespanTree`. >>> score = tree.makeExampleScore() Get everything in the score >>> treeList = tree.fromStream.listOfTreesByClass(score, useTimespans=True) >>> treeList [>] >>> tl0 = treeList[0] >>> for t in tl0: ... print(t) > > > > > > > > > > Now filter the Notes and the Clefs & TimeSignatures of the score (flattened) into a list of two TimespanTrees >>> classLists = ((note.Note,), (clef.Clef, meter.TimeSignature)) >>> treeList = tree.fromStream.listOfTreesByClass(score, useTimespans=True, ... classLists=classLists, flatten=True) >>> treeList [>, >] * Changed in v8: it is now a stickler that classLists must be sequences of sequences, such as tuples of tuples. rr NsourceFzmusic21.stream.Stream)rrrrrTsemiFlatelement parentage parentOffset parentEndTimeoffsetendTime)music21rr TimespanTreer OffsetTree _elements _endElements elementOffsetisStreamtcastlistOfTreesByClasszipinsertlowestPositionduration quarterLengthclassSet isdisjoint isinstancer NotRestStreamr PitchedTimespanElementTimespantuplereversed) inputStreamrrrrrr lastParentage treeClass outputTrees_inputStreamElementsrr wasStreamlocalParentagecontainedTrees outputTreesubTreerrr!classBasedTree classList spanClasselementTimespans Q/home/james-whalen/.local/lib/python3.13/site-packages/music21/tree/fromStream.pyr+r+!s'v'>$R(M -- $$  67 @JK 1y 6 K%//2[5M5MM&,,W5 E   ff4g>G- :N/AO>D8?;E=I KN (+;'G# G%'%%gaj1%%g&<&<&>H (H IGz1(L),B,B,P,PPM//===G-0-I) !1!1!K7=8? 'AO #))/:"))&:#.J3'X _Ls H>)rrFr groupOffsetsc^^^^^^SUUUUUU4SjjmT(a[RmO&TSLa[RmO[RmUR (d!UR (aUR5 UR (a,TSLa'UR(dTSLaT"US9n[UUTS9$T"UU4SS9$)a Converts a Stream and constructs an :class:`~music21.tree.trees.ElementTree` based on this. Use Stream.asTree() generally since that caches the ElementTree. >>> score = tree.makeExampleScore() >>> elementTree = tree.fromStream.asTree(score) >>> elementTree to 8.0) > >>> for x in elementTree.iterNodes(): ... x Indices:(l:0 *0* r:1) Payload:> Indices:(l:0 *1* r:2) Payload:> >>> etFlat = tree.fromStream.asTree(score, flatten=True) >>> etFlat to 8.0) > The elementTree's classSortOrder has changed to -25 to match the lowest positioned element in the score, which is an Instrument object (classSortOrder=-25) >>> for x in etFlat.iterNodes(): ... x Indices:(l:0 *0* r:2) Payload:> Indices:(l:1 *1* r:2) Payload:> Indices:(l:0 *2* r:4) Payload:> Indices:(l:3 *3* r:4) Payload:> ... Indices:(l:5 *6* r:8) Payload:> Indices:(l:7 *7* r:8) Payload:> Indices:(l:0 *8* r:20) Payload:> ... Indices:(l:15 *17* r:20) Payload:> Indices:(l:18 *18* r:20) Payload:> Indices:(l:19 *19* r:20) Payload:> >>> etFlat.getPositionAfter(0.5) SortTuple(atEnd=0, offset=1.0, priority=0, classSortOrder=20, isNotGrace=1, insertIndex=...) >>> etFlatNotes = tree.fromStream.asTree(score, flatten=True, classList=(note.Note,)) >>> etFlatNotes to 8.0) > c >USnUcT"US9nURSSUR-nX$RR-nUGH(n[R "UR U5U-5nUR(aTSLaX4-n T"UU UUS9 TS:waMXT(a"URRT5(aMT(aVXRR-n [R"U[[U55UUUU S9n URU 5 MTSLa4URU5n U R!US9n URX5 GMURX5 GM+ U$)NrrF)rrinner_outputTreerr)r )r%r&r/r0ropFracr'r(r1r2r r6r8r9r- sortTuplemodify) innerStreamrrrMr;innerStreamElementsrr flatOffsetrAr!pitchedTimespanposition flatPositionrFrrJrecurseGetTreeByClassr<rs rIrW%asTree..recurseGetTreeByClasssr ),  #( > *33A69Q9QQ%(>(>(L(LL *G}'B'B7'Km'[\JG5$8!1J!>%g7E4>7GIj(W--88CC$'7'7'E'EE"'"7"7##H-=$>?!."/%# #%!''8&",,];'jA  '' > '' H=FH H%[7Bn368 8rY)rFcURSSUR-nUc#UVs/sHoDRU5U4PM nnOEUVs/sH8nURR U5(aM%URU5U4PM: nnUR U5 UR bUR R5 U$s snfs snf)a Use populateFromSortedList to quickly make a tree from a stream. This only works if the stream is flat (or we are not flattening) and sorts have already been run, and we are not making an OffsetTree. Returns the same outputTree that was put in, only with elements in it. N)r%r&rOr1r2populateFromSortedListrootNodeupdateEndTimes)r:rCrFr?eelementTupleLists rIr_r_#s&//2[5M5MMCVWCVa[[5q9CVWCVECVa#$::#8#8#C:Q[[5q9CVE%%&67&**, XEsC$C/C)rrFcUc [//nOU/n[USUUSS9nUSn[R(a![ U[ R 5(deU$)a Recurses through a score and constructs a :class:`~music21.tree.trees.TimespanTree`. Use Stream.asTimespans() generally since that caches the TimespanTree. >>> score = corpus.parse('bwv66.6') >>> scoreTree = tree.fromStream.asTimespans(score, flatten=True, ... classList=(note.Note, chord.Chord)) >>> scoreTree > >>> for x in scoreTree[:5]: ... x ... > > > > > >>> scoreTree = tree.fromStream.asTimespans(score, flatten=False, classList=()) Each of these has 11 elements -- mainly the Measures >>> for x in scoreTree: ... x ... > > > > > > >>> tenorElements = scoreTree[4] >>> tenorElements > >>> tenorElements.source >>> tenorElements.source is score[3] True rT)rrrrr)rr+r) TYPE_CHECKINGr3r r#)r:rrFrlistOfTimespanTreestimespanTreeFirsts rI asTimespansrk>sjd$o& [ ,[;>5<8B:> @ ,A.+\-F-FGGGG rYc \rSrSrSrSrSrg)TesticSSKJn URS5R5nUR 5nSUl0UlUR 5nUR[U5[U55 UR[U5[U55 [X45HupVURXV5 M g)zM tests that the isSorted speed up trick ends up producing identical results. r)corpuszbwv66.6FN) r"roparserr`r[_cache assertEquallenr,assertIs)selfrosfsfTree sfTreeSlowfastIslowIs rItestFastPopulateTest.testFastPopulates # \\) $ , , .  YY[  R#j/2 R#f+.3LE MM% '4rYcSSKJn U"5nUR5 [U5nUR UR S5 g)Nr)makeExampleScoreg @) music21.treer~r]r`rrr!)rur~scscTrees rItestAutoSortExampleTest.testAutoSortExamples31     -rYrN)__name__ __module__ __qualname____firstlineno__r{r__static_attributes__rrYrIrmrms (".rYrm__main__)r:rrz$Sequence[Sequence[type[M21ObjType]]]rz tuple[stream.Stream, ...] | Nonerfloatrz bool | strrboolreturnz2list[trees.OffsetTree | timespanTree.TimespanTree]) r:rrzt.Literal['semiFlat'] | boolrFSequence[type] | NonerrrJrrz@trees.OffsetTree | trees.ElementTree | timespanTree.TimespanTree)r:z stream.StreamrC$trees.OffsetTree | trees.ElementTreerFrrr)rz str | boolrFz$Sequence[type[Music21Object]] | NonerztimespanTree.TimespanTree)__doc__ __future__rcollections.abcrtypingr)unittest music21.basermusic21.common.typesrrr"rr rr r r rhrr+r`r_rkTestCasermrmainTestrrYrIrs~#$&7%?? 8:7;zz5z5 z  z  zz6z@+0%) C8C8(C8# C8  C8  C8BC8R&* 3#  ( <48 >>2 >  >D.8  .< z TrY