{
    "mode": "perldoc",
    "parameter": "Tie::Array::Sorted::Lazy",
    "section": "",
    "url": "https://www.chedong.com/phpMan.php/perldoc/Tie%3A%3AArray%3A%3ASorted%3A%3ALazy/json",
    "generated": "2026-06-14T00:36:23Z",
    "synopsis": "use Tie::Array::Sorted::Lazy;\ntie @a, \"Tie::Array::Sorted::Lazy\", sub { $[0] <=> $[1] };\npush @a, 10, 4, 7, 3, 4;\nprint \"@a\"; # \"3 4 4 7 10\"",
    "sections": {
        "NAME": {
            "content": "Tie::Array::Sorted::Lazy - An array which is kept sorted\n",
            "subsections": []
        },
        "SYNOPSIS": {
            "content": "use Tie::Array::Sorted::Lazy;\n\ntie @a, \"Tie::Array::Sorted::Lazy\", sub { $[0] <=> $[1] };\n\npush @a, 10, 4, 7, 3, 4;\nprint \"@a\"; # \"3 4 4 7 10\"\n",
            "subsections": []
        },
        "DESCRIPTION": {
            "content": "This is a version Tie::Array::Sorted optimised for arrays which are stored to more often than\nfetching. In this case the array is resorted on retrieval, rather than insertion. (It only\nre-sorts if data has been modified since the last sort).\n\ntie @a, \"Tie::Array::Sorted::Lazy\", sub { -s $[0] <=> -s $[1] };\n",
            "subsections": []
        }
    },
    "summary": "Tie::Array::Sorted::Lazy - An array which is kept sorted",
    "flags": [],
    "examples": [],
    "see_also": []
}