>> - If the original list to be processed is very long, then the construction of
>> the second phase list shouldn't wait for bottle neck items to cons the list
>> elsewhere where possible. The speed gain wouldn't be substantial though,
>> since it is just building a list, and you cannot finish it until the last
>> item is available, anyway.
>You'd want to basically make the result list into a queue in which
>elements are inserted.
According to the documentation:
"(</span><span class="RktSym"><a class="RktStxLink">require</a></span><span class="stt"> </span><a class="RktModLink"><span class="RktSym">data/queue</span></a><span class="RktPn">)</span></pre>
This module provides a simple mutable queue representation, first-in/first-out only. Operations on queues mutate it in a thread-unsafe way.</p>
So this is not thread-safe. Is it futures safe?</p>
Is there any queue implementation which is thread-safe?</p>