If your requests are stored in hash references, you could easily build yourself a FIFO queue with a simple array of hashrefs, using push to insert a new request and shift to pick up the oldest one (or possibly using pop and unshift). But using existing CPAN modules is probably better.
In reply to Re: Handling multiple requests in a queue on FIFO based and process
by Laurent_R
in thread Handling multiple requests in a queue on FIFO based and process
by mvinayk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |