Re^2: Persistent stack implementation (s/L/F/)

I guess your persistency criterion rules out a unix fifo (mkfifo foo)?

That and the fact that FIFO is a pipe not a stack (FILO). :)

Another option would perhaps be system V message queues

Queues are usually FIFOs as well.

I can almost hear it: "FILO?! D'Oh!" - tye

Comment on Re^2: Persistent stack implementation (s/L/F/)

Replies are listed 'Best First'.
Re^3: Persistent stack implementation (s/L/F/) by jbert (Priest) on Nov 09, 2007 at 21:37 UTC
Very prescient. D'oh! In which case, you just need to reverse your puts and gets. I'm sure it will all work out all right in the end. More seriously, the suggestion of using a file (with locking and fixed length records) is a good one. That should be fairly straightforward.	[reply]