See deque in All languages combined, or Wiktionary
{ "etymology_text": "Shortened from double-ended queue.", "forms": [ { "form": "deques", "tags": [ "plural" ] }, { "form": "dequeue", "tags": [ "alternative" ] } ], "head_templates": [ { "args": {}, "expansion": "deque (plural deques)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with 2 entries", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "other", "langcode": "en", "name": "Computing", "orig": "en:Computing", "parents": [], "source": "w" }, { "_dis": "68 15 17", "kind": "other", "name": "Pages with 2 entries", "parents": [], "source": "w+disamb" }, { "_dis": "60 21 18", "kind": "other", "name": "Pages with entries", "parents": [], "source": "w+disamb" } ], "examples": [ { "bold_text_offsets": [ [ 75, 80 ] ], "text": "This algorithm is difficult to implement with a standard queue, but with a deque it's easy.", "type": "example" }, { "bold_text_offsets": [ [ 91, 96 ] ], "ref": "2011, Michael T. Goodrich, Roberto Tamassia, David M. Mount, Data Structures and Algorithms in C++, John Wiley & Sons, →ISBN, page 218:", "text": "As with the stack and queue, the Standard Template Library provides an implementation of a deque.", "type": "quote" } ], "glosses": [ "A linear data structure in which elements may be appended to or removed from either end." ], "id": "en-deque-en-noun-TcSIJVdY", "links": [ [ "computing", "computing#Noun" ], [ "data structure", "data structure" ] ], "raw_glosses": [ "(computing) A linear data structure in which elements may be appended to or removed from either end." ], "topics": [ "computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences" ] } ], "sounds": [ { "ipa": "/dɛk/" }, { "audio": "LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-deque.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/f/fa/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/f/fa/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav.ogg" }, { "rhymes": "-ɛk" }, { "homophone": "deck" } ], "word": "deque" }
{ "categories": [ "Pages with 2 entries", "Pages with entries" ], "etymology_text": "Shortened from double-ended queue.", "forms": [ { "form": "deques", "tags": [ "plural" ] }, { "form": "dequeue", "tags": [ "alternative" ] } ], "head_templates": [ { "args": {}, "expansion": "deque (plural deques)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English nouns", "English terms with homophones", "English terms with quotations", "English terms with usage examples", "Pages with 2 entries", "Pages with entries", "Rhymes:English/ɛk", "Rhymes:English/ɛk/1 syllable", "en:Computing" ], "examples": [ { "bold_text_offsets": [ [ 75, 80 ] ], "text": "This algorithm is difficult to implement with a standard queue, but with a deque it's easy.", "type": "example" }, { "bold_text_offsets": [ [ 91, 96 ] ], "ref": "2011, Michael T. Goodrich, Roberto Tamassia, David M. Mount, Data Structures and Algorithms in C++, John Wiley & Sons, →ISBN, page 218:", "text": "As with the stack and queue, the Standard Template Library provides an implementation of a deque.", "type": "quote" } ], "glosses": [ "A linear data structure in which elements may be appended to or removed from either end." ], "links": [ [ "computing", "computing#Noun" ], [ "data structure", "data structure" ] ], "raw_glosses": [ "(computing) A linear data structure in which elements may be appended to or removed from either end." ], "topics": [ "computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences" ] } ], "sounds": [ { "ipa": "/dɛk/" }, { "audio": "LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-deque.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/f/fa/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/f/fa/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-deque.wav.ogg" }, { "rhymes": "-ɛk" }, { "homophone": "deck" } ], "word": "deque" }
Download raw JSONL data for deque meaning in English (2.2kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-06-05 from the enwiktionary dump dated 2025-06-01 using wiktextract (5ee713e and f1c2b61). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.