Datasets:
Tasks:
Text Retrieval
Modalities:
Text
Sub-tasks:
document-retrieval
Languages:
code
Size:
100K - 1M
ArXiv:
License:
fix math display
Browse files
README.md
CHANGED
@@ -62,7 +62,7 @@ The dataset supports two programming languages, Python and Java, and contains tw
|
|
62 |
- `cff`: short for `cross_file_first`, where the cross-file module in next line is first used in the current file.
|
63 |
- `cfr`: short for `cross_file_random`, where the cross-file module in next line is not first used in the current file.
|
64 |
|
65 |
-
For each setting, we provide two levels of difficulty: `easy` and `hard`. Suppose the number of code snippets in the context is
|
66 |
|
67 |
So, the specific information of each split is as follows:
|
68 |
|
|
|
62 |
- `cff`: short for `cross_file_first`, where the cross-file module in next line is first used in the current file.
|
63 |
- `cfr`: short for `cross_file_random`, where the cross-file module in next line is not first used in the current file.
|
64 |
|
65 |
+
For each setting, we provide two levels of difficulty: `easy` and `hard`. Suppose the number of code snippets in the context is \(k\), then for the `easy` subset, we have \(5 \leq k < 10\), while for the `hard` subset, we have \(k \geq 10\).
|
66 |
|
67 |
So, the specific information of each split is as follows:
|
68 |
|