Ko Sv

perhapes there is an easy method for this but I just can't figure it out...

perhapes there is an easy method for this but I just can't figure it out...
binay list -> 1 0 0 1 0 1 1 1 0 0
need to convert to:  list -> 3 2 1 1 3
so it should slice like so:
[100][10][1][1][100]

hi guys,
perhapes there is an easy method for this but I just can't figure it out...
binay list -> 1 0 0 1 0 1 1 1 0 0
need to convert to:  

binary-counting-grouping

Will the binary list always break down into groups of 3 - 2 - 1 - 1 - 3 digits? Otherwise, how will the patch know which groups of digits to count and convert?

[zl] to the rescue. (Plus a couple of other bits.)

@BILL CANTY -> that is exactly what I was looking for!

@RICK -> the [int][int][...] example was to illustrate the method but it is really cool to have also this kind of grouping!!

thank you guys!!!
@BILL CANTY -> that is exactly what I was looking for!
@RICK -> the [int][int][...] example was to illustrate the method but it is really cool to have also this kind of grouping!!
cheers!!

binary counting/ grouping