Hi!
Specifically, pushBack(x) and moveFront() operations should be a
thread safe.

Not in Phobos. No containers in Phobos contain any kind of synchronization.
The same goes for the built-in array types. If any of them are shared, you'll
need to protect them appropriately.
If any kind of thread-safe container exists, it's in a third party library
somewhere.
- Jonathan M Davis

Thanks for answer!
After investigation came to the conclusion that here is needed
not synchronized-based solution. I am need compare-and-swap
single linked list because it will be used in callback proc from
C, and it cannot be throwable, but synchronized contains
throwable _d_monitorenter and_d_monitorexit.
I would be grateful if someone share singly linked list based on
cas()

Thanks for answer!
=20
After investigation came to the conclusion that here is needed not =

synchronized-based solution. I am need compare-and-swap single linked =
list because it will be used in callback proc from C, and it cannot be =
throwable, but synchronized contains throwable _d_monitorenter =
and_d_monitorexit.

=20
I would be grateful if someone share singly linked list based on cas()

Of course, I read this article.
I think that SList is not the same thing as FIFO list - get the
first entry in the queue and get queue entry by numerical order
are two different things in multithreaded environment, right?
I think its necessary to implement "primitives" like a CASN from
article "A Pratial Multi-Word Compare-and-Swap Operation" (by
Timothy L. Harris, Keir Fraser and Ian A. Pratt.) This titanic
challenge as I see it, but sooner or later it will have to do.
Then we will be able to create various thread safe structures.