Hi David,

Thank you for the suggestion.

Those string operation was a minor speed problem. There is a tricky encoder that consumes the biggest part of time. I guess that I have to figure out how to run the whole C project if I run into real speed problems.

Agnes
>Agnes,
>
>Look at the DeQoute example code on my website, it contains a VC++6 project and all the instructions on how to create a DLL with it that you can call from VFP. It would be blazingly fast because you can run the code with one pointer for the output buffer and N pointers for the number of strings. I'd switch based on the number of inputs
>
>

>/* pseudo code */
>case 1
>   for ( i = 0, i < len( input1 ), i++ )
>      {
>      *output++ = *input1++;
>      }
>
>case 2
>   for ( i = 0, i < len( input1 ), i++ )
>      {
>      *output++ = *input1++;
>      *output++ = *input2++;
>      }
>
>case 4
>   for ( i = 0, i < len( input1 ), i++ )
>      {
>      *output++ = *input1++;
>      *output++ = *input2++;
>      *output++ = *input3++;
>      *output++ = *input4++;
>      }
>

>
>>My first idea. But my compiler (VC++6) doesn't like the code and did I mention that I have no knowledge about C? ::)
>>
>>It's just that the C puts the chars in its array style of handling and that would mean something like STUFF to implement it into the Fox. Since it is all appended this seems to tricky.