"minheap" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "minimum",
        "3": "heap"
      },
      "expansion": "Blend of minimum + heap",
      "name": "blend"
    }
  ],
  "etymology_text": "Blend of minimum + heap.",
  "forms": [
    {
      "form": "minheaps",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "minheap (plural minheaps)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English blends",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              0,
              8
            ]
          ],
          "text": "Minheaps are often used to implement priority queues.",
          "type": "example"
        }
      ],
      "glosses": [
        "A heap data structure with a \"greater than or equal to\" comparison function."
      ],
      "id": "en-minheap-en-noun-ov9YuDmB",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "heap",
          "heap"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "comparison",
          "comparison"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A heap data structure with a \"greater than or equal to\" comparison function."
      ],
      "related": [
        {
          "word": "maxheap"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-minheap.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4a/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4a/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav.ogg"
    }
  ],
  "word": "minheap"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "minimum",
        "3": "heap"
      },
      "expansion": "Blend of minimum + heap",
      "name": "blend"
    }
  ],
  "etymology_text": "Blend of minimum + heap.",
  "forms": [
    {
      "form": "minheaps",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "minheap (plural minheaps)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "maxheap"
    }
  ],
  "senses": [
    {
      "categories": [
        "English blends",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with usage examples",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              0,
              8
            ]
          ],
          "text": "Minheaps are often used to implement priority queues.",
          "type": "example"
        }
      ],
      "glosses": [
        "A heap data structure with a \"greater than or equal to\" comparison function."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "heap",
          "heap"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "comparison",
          "comparison"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A heap data structure with a \"greater than or equal to\" comparison function."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-minheap.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4a/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4a/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-minheap.wav.ogg"
    }
  ],
  "word": "minheap"
}