This is a hacky function to return some garbages so that we can successfully run the function .
(entry_point)
| 16 | |
| 17 | |
| 18 | def _ret(entry_point) -> str: |
| 19 | """ |
| 20 | This is a hacky function to return some garbages so that we can |
| 21 | successfully run the function . |
| 22 | """ |
| 23 | set_assertion_func = [ |
| 24 | "similar_elements", |
| 25 | "find_char_long", |
| 26 | "common_in_nested_lists", |
| 27 | "extract_singly", |
| 28 | "larg_nnum", |
| 29 | "intersection_array", |
| 30 | "k_smallest_pairs", |
| 31 | ] |
| 32 | if entry_point in set_assertion_func: |
| 33 | return "()" |
| 34 | return "1" |
| 35 | |
| 36 | |
| 37 | def get_entry_point(task_id: int, assertion: str) -> str: |
no outgoing calls
no test coverage detected
searching dependent graphs…