[erlang-questions]: : queues (previously: documentation of data structures)

[Andras Georgy Bekes]

> Elements normally enters the first end and exits the last end.
>
> Regular (forward) direction:
>
> put_first(Item, Q1) -> Q2
> get_last(Q) -> Item

A queue is "FIFO" (First In First Out), so the first element is the one 
that entered the queue first, and that will leave the queue first.

Your proposal is the opposite of this. Why?

	Georgy