History of Reading on Queues

28 April 1997 [Henry Walker and/or John David Stone]

• This date is given as the created date in a subsequent document that Sam Rebelsky based this reading on. However, that corresponding document seems to be http://www.cs.grinnell.edu/~stone/courses/scheme/spring-1997/lab-oop.html, which lacks any discussion of queues. (Nothing else in the course seems to mention queues.)

8 December 1997 [Henry Walker and/or John David Stone]

• The earliest dated 151 reading that mentions queues (and also stacks).
• This combined reading can be found at http://www.cs.grinnell.edu/~stone/courses/scheme/fall-1997/stacks-and-queues.html.

1 May 2000 [John David Stone and/or Henry Walker]

• Last update by Stone and/or Walker in this branch.
• This version available at http://www.cs.grinnell.edu/~stone/courses/scheme/spring-2000/queues.xhtml.

December 2003 [Samuel A. Rebelsky]

• First Rebelsky version.
• Changed the implementation significantly, so that it no longer requires calls to set-cdr! nor a dummy header.
• This version available at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003F/Readings/queues.html.

Tuesday, 21 November 2006 [Samuel A. Rebelsky]

• Added illustration of the implementation details.
• Cleaned up implementation to use multiple, clearly named vectors, instead of one bigger vector (which made us refer to positions).
• Added now-standard :type and :->string messages.
• Wrote history. (Boy, it's a bad idea to write history this late in the game. Some changes are still unclear. I did eventually figure out that I'd written the new implementation.)
• Added link to PDF version.
• This version available at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2006F/Readings/queues.html.