Count number of consecutive T or F in a boolean array

[tintin_99]

Hi,

IN the attachad boolean array I should ignore the first consecutive true or false values and then count the number of second consecutive T or F. In this example it is 4 but it can be any value. Could you please help me how can I ignore the first bits and then count up the second one

Thanks

[JÞB]

nothing easier

There are probably 20 ways to do this without getting nominated for inclusion in the Rube Goldberg thread

[altenbach]

---

tintin_99 wrote:

IN the attachad boolean array I should ignore the first consecutive true or false values and then count the number of second consecutive T or F. In this example it is 4 but it can be any value. Could you please help me how can I ignore the first bits and then count up the second one

---

Well, a unique solution does not go well with "or" (...count the number of second consecutive T or F...). Are the T and F stretches always the same size? How is this assumption guaranteed?

---

Jeff·Þ·Bohrer wrote:

There are probably 20 ways to do this without getting nominated for inclusion in the Rube Goldberg thread

---

And there are hundreds more that qualify for an inclusion. I would do a "boolean to 0,1", followed by an FFT, then looking for the fundamental frequency and convert it to a wavelenght. 😄