[EMAIL PROTECTED] wrote:
> Your code will identify sequences in a list, but how to index them? I
> have an idea, which seems ridiculously long-winded, but should work.
> First, put the groups from the âmake_diffsâ function into a list
> and do a search for the sequence identified from the
> âcompa
Iâve had chance to look at your code. I had an idea that I the answer
to my problem some how involved breaking down the list into groups and
that the notes would be easier to work with as numbers. However, I
think your âmake_diffsâ function is really a very cunning way to
go about things ï I would
[EMAIL PROTECTED] wrote:
> Hi Michael,
>
> Thanks for a quick response, I appreciate it. I will have to get back
> to you tomorrow, as I can't check what you've given me right now. I
> presume the fact that you mention the word note in your code you have
> realised that I'm trying to search for mu
Hi Michael,
Thanks for a quick response, I appreciate it. I will have to get back
to you tomorrow, as I can't check what you've given me right now. I
presume the fact that you mention the word note in your code you have
realised that I'm trying to search for musical sequences. I tried to
put my pr
Michael Spencer wrote:
>
> def compare_forms(sequence):
> """test whether all groups of a sequence have the same form"""
> for length in range(4,2,-1): # look for longest match first
oops, make that range(4,1,-1) or, simply (4,3,2)
Michael
--
http://mail.python.org/mailman/listinfo/
[EMAIL PROTECTED] wrote:
> Hi All,
>
> I wonder could someone help me with this?
>
> What I want to do is search through a list of letters and look for
> adjacent groups of letters that form sequences, not in the usual way of
> matching say abc to another appearance later on in the list but to lo
