{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"bigcodebench","formal_name":"BigCodeBench","introduction":"BigCodeBench poses 1,140 function-level tasks drawn across 139 libraries. It tests whether a model can compose several real APIs correctly rather than write one self-contained function.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://bigcode-bench.github.io/","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"b9231a38-f95b-541e-a78f-807e45c193d9","task_key":"default--v0~2e1~2e0~5fhf--b9231a38-f95b-541e-a78f-807e45c193d9","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf b9231a38-f95b-541e-a78f-807e45c193d9","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import collections\\nfrom queue import PriorityQueue\\nimport random\\n# Constants\\nLETTERS = ['a', 'b', 'c', 'd', 'e']\\ndef task_func(string_length=100):\\n\",\"complete_prompt\":\"import collections\\nfrom queue import PriorityQueue\\nimport random\\n\\n# Constants\\nLETTERS = ['a', 'b', 'c', 'd', 'e']\\n\\ndef task_func(string_length=100):\\n    \\\"\\\"\\\"\\n    Create a random string of a given length from a predefined list of letters and count the frequency \\n    of each letter, returning an ordered dictionary sorted by frequency in descending order.\\n\\n    Parameters:\\n    - string_length (int, optional): The length of the random string to be generated. Default is 100.\\n\\n    Returns:\\n    - collections.OrderedDict: An ordered dictionary where keys are letters and values are \\n      their frequencies in the generated string, sorted in descending order of frequency.\\n\\n    Requirements:\\n    - collections\\n    - queue.PriorityQueue\\n    - random\\n\\n    Example:\\n    >>> random.seed(0)\\n    >>> freq = task_func(50)\\n    >>> freq  # Example output: OrderedDict([('e', 15), ('a', 12), ('b', 10), ('d', 8), ('c', 5)])\\n    OrderedDict(...)\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Create a random string of a given length from a predefined list of letters and count the frequency of each letter, returning an ordered dictionary sorted by frequency in descending order.\\nThe function should output with:\\n    collections.OrderedDict: An ordered dictionary where keys are letters and values are\\n    their frequencies in the generated string, sorted in descending order of frequency.\\nYou should write self-contained code starting with:\\n```\\nimport collections\\nfrom queue import PriorityQueue\\nimport random\\n# Constants\\nLETTERS = ['a', 'b', 'c', 'd', 'e']\\ndef task_func(string_length=100):\\n```\",\"libs\":\"['queue', 'collections', 'random']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}