Comments on: q, textual queue manager http://probablyprogramming.com/2009/04/21/q-textual-queue-manager/ It's what I'm doing, and what posts on this blog are about. Thu, 04 Mar 2010 13:05:27 +0000 http://wordpress.org/?v=2.9.2 hourly 1 By: pib http://probablyprogramming.com/2009/04/21/q-textual-queue-manager/comment-page-1/#comment-6186 pib Tue, 21 Apr 2009 18:16:40 +0000 http://probablyprogramming.com/?p=278#comment-6186 <p>Jawa: It's kind of a hybrid of the two, since with the append command makes it act as a queue. If I added a way to pop off the end of it, it would be a deque, which is like a stack which you can push and pop from either end (double-ended queue).</p> <p>Really, I was just going for the more general meaning of the word queue, some sort of in-order list of things. Also, there's not a single-letter that sounds like "stack" :)</p> <p>And yes, after each command it shows you the item at the top of the queue.</p> Jawa: It’s kind of a hybrid of the two, since with the append command makes it act as a queue. If I added a way to pop off the end of it, it would be a deque, which is like a stack which you can push and pop from either end (double-ended queue).

Really, I was just going for the more general meaning of the word queue, some sort of in-order list of things. Also, there’s not a single-letter that sounds like “stack” :)

And yes, after each command it shows you the item at the top of the queue.

]]> By: Silly Jawa http://probablyprogramming.com/2009/04/21/q-textual-queue-manager/comment-page-1/#comment-6166 Silly Jawa Tue, 21 Apr 2009 07:13:28 +0000 http://probablyprogramming.com/?p=278#comment-6166 <p>Hi Paul,</p> <p>From what I can gather in your examples and your supported command names, it seems that you've implemented a "stack" [which follows a last in, first out (LIFO) policy] rather than a traditional "queue" [which follows first in, first out (FIFO) rules].</p> <p>I made an assumption about q.py (please correct me if I'm wrong) to come to this conclusion: it looks like the output of "./q.py queuename [command [params]]" is the "next" of that structure after the command has been carried out. (The best evidence of this is in the output of the 'append' command.)</p> <p>Overall, quite a nifty idea. I trust that people will find good use for it.</p> Hi Paul,

From what I can gather in your examples and your supported command names, it seems that you’ve implemented a “stack” [which follows a last in, first out (LIFO) policy] rather than a traditional “queue” [which follows first in, first out (FIFO) rules].

I made an assumption about q.py (please correct me if I’m wrong) to come to this conclusion: it looks like the output of “./q.py queuename [command [params]]” is the “next” of that structure after the command has been carried out. (The best evidence of this is in the output of the ‘append’ command.)

Overall, quite a nifty idea. I trust that people will find good use for it.

]]>