Talk:Double-ended queue
Add topic | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
 Archives (Index) |
|
This page is archived by ClueBot III. |
Persistent implementations
[edit]Two related questions. Both about this change. I think this whole part should be removed from Language support. We should keep what Haskell currently is. The remaining should be in a section about persistent implementations. Also, User:Dfeuer can you please add references for the various implementations you mention. I can't find any paper co-authored by Tarjan and by some Mihaesau. I find some reference online mentioning a version with Mihaescu, but nothing that lead to an article. Appart from wikipedia quality, I'd also like to read the implementation. Arthur MILCHIOR (talk) 07:24, 18 July 2021 (UTC)
- The name is Mihaescu, Radu. I added the missing references. AFAIK no implementation nor official publication. You can find some comments on stackoverflow. Xavier-gl71 (talk) 13:21, 29 November 2023 (UTC)
- I believe there has been an implementation, which Ed Kmett pointed me to. No, I don't remember where. It's rather absurdly complex. Dfeuer (talk) 03:33, 31 January 2024 (UTC)
"Common name(s)" in the chart makes no sense
[edit]Last year @Defur added this column to the chart of various language names, with no references and no clue as to what qualification makes them "common" when not a single listed language uses them. Maybe a few old CS papers once did? I'm inclined to remove the column, but I'd like to make sure I'm not missing something here. SilverbackNet talk 05:29, 10 August 2023 (UTC)
Early usage or description of a deque
[edit]Knuth writes that E. J. (Earl Justin) Schweppe "coined" the term deque in 1966 [1]. I found only two books that Schweppe contributed to at that time: Consequent Procedures in Conventional computer (1964) and An Introduction to Algorithmic Methods Using the MAD Language (1966). None of them are about a deque.
The older paper I found about a (output-restricted) deque is an article in IBM Systems Journal in 1969, about APAM, an extension for 360 systems, with a reference to Knuth 1968. Do you know any other usage or description of a queue/stack/list that would be accessed on both ends, before 1968? Maybe in another language?
Time-sharing system
[edit]Would you say the multi-level scheduler of the Compatible Time-Sharing System is deque-based? See An experimental time-sharing system and CTSS technical notes (pages 36—…; some MAD code pages 49—…)
Further readings: CTSS Documents
- ↑ Donald Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4. Section 2.2.1: History and bibliography, p.459.