{"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":"da63a99a-33ca-539e-8e8f-db32fcc3c76c","task_key":"default--v0~2e1~2e0~5fhf--da63a99a-33ca-539e-8e8f-db32fcc3c76c","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf da63a99a-33ca-539e-8e8f-db32fcc3c76c","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from itertools import zip_longest\\nfrom scipy.spatial import distance\\ndef task_func(points):\\n\",\"complete_prompt\":\"from itertools import zip_longest\\nfrom scipy.spatial import distance\\n\\ndef task_func(points):\\n    \\\"\\\"\\\"\\n    Calculate the Euclidean distances between consecutive points in a provided \\n    list of 2D coordinates.\\n\\n    This function takes a list of tuples, where each tuple contains two numbers\\n    representing a point in 2D space. It computes the Euclidean distance between\\n    each consecutive pair of points.\\n\\n    If an empty list or a single point is passed, the function returns an empty list.\\n    If a tuple contains just one number it is assumed that both coordinates are equal to this number.\\n    Example: (2) == (2, 2)\\n\\n    Parameters:\\n    points (list of tuples): A list of tuples where each tuple contains two \\n                             numbers (x, y), representing a point in 2D space.\\n\\n    Returns:\\n    list of floats: A list containing the Euclidean distances between \\n                    consecutive points. Each distance is a float.\\n    \\n    Requirements:\\n    - itertools\\n    - scipy.spatial\\n\\n    Example:\\n    >>> task_func([(1, 2), (3, 4), (5, 6), (7, 8)])\\n    [2.8284271247461903, 2.8284271247461903, 2.8284271247461903]\\n\\n    >>> task_func([(1, 2), (4), (-1.2, 4)])\\n    [3.605551275463989, 5.2]\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Calculate the Euclidean distances between consecutive points in a provided list of 2D coordinates. This function takes a list of tuples, where each tuple contains two numbers representing a point in 2D space. It computes the Euclidean distance between each consecutive pair of points. If an empty list or a single point is passed, the function returns an empty list. If a tuple contains just one number it is assumed that both coordinates are equal to this number. >>> task_func([(1, 2), (4), (-1.2, 4)]) [3.605551275463989, 5.2]\\nThe function should output with:\\n    list of floats: A list containing the Euclidean distances between\\n    consecutive points. Each distance is a float.\\nYou should write self-contained code starting with:\\n```\\nfrom itertools import zip_longest\\nfrom scipy.spatial import distance\\ndef task_func(points):\\n```\",\"libs\":\"['itertools', 'scipy']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}