"double-ended queue" meaning in English

{
  "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": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Japanese translations",
          "parents": [],
          "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"
}

{
  "derived": [
    {
      "word": "deque"
    }
  ],
  "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",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Terms with Japanese translations",
        "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"
}