Add code-generation tag, link to paper

README.md

@@ -1,17 +1,20 @@
 ---
-tags:
-- code
 base_model:
 - deepseek-ai/deepseek-coder-6.7b-base
 library_name: transformers
-pipeline_tag: text-generation
 license: other
 license_name: deepseek
 license_link: LICENSE
+pipeline_tag: text-generation
+tags:
+- code
+- code-generation
 ---
 
 # CursorCore: Assist Programming through Aligning Anything
 
+This repository contains the model for the paper [CursorCore: Assist Programming through Aligning Anything](https://huggingface.co/papers/2410.07002).
+
 <p align="center">
 <a href="http://arxiv.org/abs/2410.07002">[📄arXiv]</a> |
 <a href="https://hf.co/papers/2410.07002">[🤗HF Paper]</a> |
@@ -116,13 +119,27 @@ sample = {
         {
             "type": "code",
             "lang": "python",
-            "code": """def quick_sort(arr):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+            "code": """def quick_sort(arr):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
         }
     ],
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": ""
 }
@@ -204,7 +221,14 @@ sample = {
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": "Add Docstring."
 }
@@ -275,7 +299,14 @@ sample = {
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": "Add Docstring."
 }
@@ -344,7 +375,14 @@ sample = {
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": "Add Docstring."
 }
@@ -416,4 +454,4 @@ CursorCore is still in a very early stage, and lots of work is needed to achieve
 
 ## Contribution
 
-Contributions are welcome! If you find any bugs or have suggestions for improvements, please open an issue or submit a pull request.
+Contributions are welcome! If you find any bugs or have suggestions for improvements, please open an issue or submit a pull request.