double-ended queue in English

[Show JSON for post-processed kaikki.org data shown on this page ▼] [Hide JSON for post-processed kaikki.org data shown on this page ▲]

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "double-ended"
      },
      "expansion": "double-ended",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "queue"
      },
      "expansion": "queue",
      "name": "m"
    }
  ],
  "etymology_text": "double-ended + queue",
  "forms": [
    {
      "form": "double-ended queues",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "double-ended queue (plural double-ended queues)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "derived": [
        {
          "word": "deque"
        }
      ],
      "glosses": [
        "An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail)."
      ],
      "id": "en-double-ended_queue-en-noun-bSPVp0Xh",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "abstract",
          "abstract"
        ],
        [
          "list",
          "list"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "element",
          "element"
        ]
      ],
      "raw_glosses": [
        "(computing) An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail)."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "ja",
          "lang": "Japanese",
          "roman": "ryōtan kyū",
          "sense": "data structure",
          "word": "両端キュー"
        }
      ],
      "wikipedia": [
        "Deque"
      ]
    }
  ],
  "word": "double-ended queue"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "derived": [
    {
      "word": "deque"
    }
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "double-ended"
      },
      "expansion": "double-ended",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "queue"
      },
      "expansion": "queue",
      "name": "m"
    }
  ],
  "etymology_text": "double-ended + queue",
  "forms": [
    {
      "form": "double-ended queues",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "double-ended queue (plural double-ended queues)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "en:Computing"
      ],
      "glosses": [
        "An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail)."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "abstract",
          "abstract"
        ],
        [
          "list",
          "list"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "element",
          "element"
        ]
      ],
      "raw_glosses": [
        "(computing) An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail)."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Deque"
      ]
    }
  ],
  "translations": [
    {
      "code": "ja",
      "lang": "Japanese",
      "roman": "ryōtan kyū",
      "sense": "data structure",
      "word": "両端キュー"
    }
  ],
  "word": "double-ended queue"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). 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.

"double-ended queue" meaning in English

Noun

Inflected forms