At 08:25 PM 6/02/2005 +0000, you wrote:

>using SP, UDF or other FB 1.5 features need to implement function,
>which randomly orders dataset (get from the select statement) using
>iterative algorithm (actually, every function call reorders element
>position in the set).
>As I know, the FB doesn't have set or list containers as in the STL.
>Is it possible to use table as a temporary container, but if several
>concurent calls to such function would occur?

This isn't clear at all. How about a simple example showing what the
alternative sets should look like.

./hb