Hi guys,

Ikegami i already use the three last solutions that you said
and the regular expression is the best one...


Now about the C solution the problem is that i dont know very well
this language unfortunately and i dont have time to learn it..


I believe if i will work the bit string without unpack it
will be the fastest solution ..
Can you give me some help with the mask and vec functions???

About what i want to do with the bit string...

In the string i save possitive compressed integers and to
decode them i read from the start the string how many
1s exist until i will find the first 0 (lets assume N ones).Then the compressed
number is (in binary) the next N bits after the 0, plus an
additional bit in the begining of the next N digits. Like this way for the next bits..


For example lets assume that i compressed in the below bit string just one number...

BitString: 1110,001
N=3 (the first 1s until the first 0)
The next N digits are : 001
So the number in binary is 1001 by add one bit in the start of the next N bits...


Can you tell me an optimal way to decode this bit string...??

Thanks Guys!!!

Mimis