{
    "content": [
        {
            "type": "text",
            "text": "# Heap::Binomial (perldoc)\n\n## NAME\n\nHeap::Binomial - a binomial heap to keep data partially sorted\n\n## SYNOPSIS\n\nuse Heap::Binomial;\n$heap = Heap::Binomial->new;\n# see Heap(3) for usage\n\n## DESCRIPTION\n\nKeeps elements in heap order using a linked list of binomial trees. The *heap* method of an\nelement is used to store a reference to the node in the list that refers to the element.\n\n## Sections\n\n- **NAME**\n- **SYNOPSIS**\n- **DESCRIPTION**\n- **AUTHOR**\n- **COPYRIGHT**\n- **SEE ALSO**\n\nUse structuredContent.sections for detailed options, examples, and full documentation.\n"
        }
    ],
    "structuredContent": {
        "command": "Heap::Binomial",
        "section": "",
        "mode": "perldoc",
        "summary": "Heap::Binomial - a binomial heap to keep data partially sorted",
        "synopsis": "use Heap::Binomial;\n$heap = Heap::Binomial->new;\n# see Heap(3) for usage",
        "tldr_summary": null,
        "tldr_examples": [],
        "tldr_source": null,
        "flags": [],
        "examples": [],
        "see_also": [
            {
                "name": "Heap",
                "section": "3",
                "url": "https://www.chedong.com/phpMan.php/man/Heap/3/json"
            },
            {
                "name": "Elem",
                "section": "3",
                "url": "https://www.chedong.com/phpMan.php/man/Elem/3/json"
            }
        ],
        "section_outline": [
            {
                "name": "NAME",
                "lines": 2,
                "subsections": []
            },
            {
                "name": "SYNOPSIS",
                "lines": 5,
                "subsections": []
            },
            {
                "name": "DESCRIPTION",
                "lines": 5,
                "subsections": []
            },
            {
                "name": "AUTHOR",
                "lines": 2,
                "subsections": []
            },
            {
                "name": "COPYRIGHT",
                "lines": 4,
                "subsections": []
            },
            {
                "name": "SEE ALSO",
                "lines": 2,
                "subsections": []
            }
        ],
        "sections": {
            "NAME": {
                "content": "Heap::Binomial - a binomial heap to keep data partially sorted\n",
                "subsections": []
            },
            "SYNOPSIS": {
                "content": "use Heap::Binomial;\n\n$heap = Heap::Binomial->new;\n# see Heap(3) for usage\n",
                "subsections": []
            },
            "DESCRIPTION": {
                "content": "Keeps elements in heap order using a linked list of binomial trees. The *heap* method of an\nelement is used to store a reference to the node in the list that refers to the element.\n\nSee Heap for details on using this module.\n",
                "subsections": []
            },
            "AUTHOR": {
                "content": "John Macdonald, john@perlwolf.com\n",
                "subsections": []
            },
            "COPYRIGHT": {
                "content": "Copyright 1998-2007, O'Reilly & Associates.\n\nThis code is distributed under the same copyright terms as perl itself.\n",
                "subsections": []
            },
            "SEE ALSO": {
                "content": "Heap(3), Heap::Elem(3).\n",
                "subsections": []
            }
        }
    }
}