suppose there is the initial set:
1 2 3 4 5 6 7 8 9 10 11 12
first call:
1 10 4 9 8 11 2 6 12 5 7 3
second call:
6 9 10 3 1 7 11 2 4 8 12 5
and so on

--- In firebird-support@yahoogroups.com, Helen Borrie <helebor@t...>
wrote:

> 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.