"deque" meaning in English

{
  "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": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 2 entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "67 17 16",
          "kind": "other",
          "name": "Pages with 2 entries",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "60 23 17",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "text": "This algorithm is difficult to implement with a standard queue, but with a deque it's easy.",
          "type": "example"
        },
        {
          "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/"
    },
    {
      "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": [
        {
          "text": "This algorithm is difficult to implement with a standard queue, but with a deque it's easy.",
          "type": "example"
        },
        {
          "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/"
    },
    {
      "rhymes": "-ɛk"
    },
    {
      "homophone": "deck"
    }
  ],
  "word": "deque"
}