benchmarks.wiki

benchmarks.wiki / Public workspace

BigCodeBench / BigCodeBench v0.1.0_hf ff5537a8-9d89-556b-a634-daa27991d800

Problem

Answer published by the source. Consult the official source to check your work against its answer.

complete prompt

import re
import os
import glob


def task_func(dir_path):
    """
    Search for occurrences of the word "error" in all text files within a 
    specified directory and its subdirectories.
    
    Parameters:
    dir_path (str): The path of the directory.
    
    Returns:
    dict: A dictionary with relative file paths as keys and the count of 
            occurrences of the word "error" as values.
    
    Raises:
    - ValueError: If directory in dir_path does not exist.

    Requirements:
    - re: For regex pattern matching.
    - os: For retrieving relative file paths.
    - glob: For fetching all text file paths in the directory.
    
    The function specifically searches for the word "error" in text files
    (with the extension ".txt").
    This function is NOT case sensitive, e.g. also "ERROr" will be counted.
    
    Example:
    >>> task_func("/path/to/directory")
    {'file1.txt': 2, 'subdir/file2.txt': 1}
    """

instruct prompt

Search for occurrences of the word "error" in all text files within a specified directory and its subdirectories. The function specifically searches for the word "error" in text files (with the extension ".txt"). This function is NOT case sensitive, e.g. also "ERROr" will be counted.
The function should raise the exception for: ValueError: If directory in dir_path does not exist.
The function should output with:
    dict: A dictionary with relative file paths as keys and the count of
    occurrences of the word "error" as values.
You should write self-contained code starting with:

Code

import re
import os
import glob
def task_func(dir_path):

code prompt

Code

import re
import os
import glob
def task_func(dir_path):

entry point

task_func

libs

  • glob
  • re
  • os

Discussion

Discussion

No discussion posts on this page yet. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

Source and history

task_id
ff5537a8-9d89-556b-a634-daa27991d800
task_key
default--v0~2e1~2e0~5fhf--ff5537a8-9d89-556b-a634-daa27991d800
task_revision_id
1
config / split
default / v0.1.0_hf

Official source

initial import