loubnabnl HF staff commited on
Commit
3c86f8d
·
1 Parent(s): baefbf1

update examples

Browse files
Files changed (1) hide show
  1. app.py +11 -6
app.py CHANGED
@@ -9,13 +9,18 @@ This dataset includes Python code accompanied by docstrings that explain it. The
9
  Limitations: The model was fine-tuned on a small dataset from Jupyter Notebooks, so it can only explain simple,\
10
  common functions that are found in these notebooks, in a similar fashion to the text in markdown cells."
11
 
12
- EXAMPLE_1 = "def sort_function(arr):\n n = len(arr)\n \n # Traverse through all array elements\n for i in range(n):\n \n # Last i elements are already in place\n for j in range(0, n-i-1):\n \n # traverse the array from 0 to n-i-1\n # Swap if the element found is greater\n # than the next element\n if arr[j] > arr[j+1]:\n arr[j], arr[j+1] = arr[j+1], arr[j]"
13
- EXAMPLE_2 = "from sklearn import model_selection\nX_train, X_test, Y_train, Y_test = model_selection.train_test_split(X, Y, test_size=0.2)"
14
- EXAMPLE_3 = "def load_text(file)\n with open(filename, 'r') as f:\n text = f.read()\n return text"
 
 
 
15
  example = [
16
- [EXAMPLE_1, 32, 0.6, 42],
17
- [EXAMPLE_2, 16, 0.6, 42],
18
- [EXAMPLE_3, 11, 0.2, 42],
 
 
19
  ]
20
 
21
  device="cuda:0"
 
9
  Limitations: The model was fine-tuned on a small dataset from Jupyter Notebooks, so it can only explain simple,\
10
  common functions that are found in these notebooks, in a similar fashion to the text in markdown cells."
11
 
12
+ EXAMPLE_1 = "from sklearn import model_selection\nX_train, X_test, Y_train, Y_test = model_selection.train_test_split(X, Y, test_size=0.2)"
13
+ EXAMPLE_2 = "def load_text(file)\n with open(filename, 'r') as f:\n text = f.read()\n return text"
14
+ EXAMPLE_3 = "net.zero_grad()\nloss.backward()"
15
+ EXAMPLE_4 = "net.zero_grad()\nloss.backward()\n\nnoptimizer.step()"
16
+ EXAMPLE_5 = "def sort_function(arr):\n n = len(arr)\n \n # Traverse through all array elements\n for i in range(n):\n \n # Last i elements are already in place\n for j in range(0, n-i-1):\n \n # traverse the array from 0 to n-i-1\n # Swap if the element found is greater\n # than the next element\n if arr[j] > arr[j+1]:\n arr[j], arr[j+1] = arr[j+1], arr[j]"
17
+
18
  example = [
19
+ [EXAMPLE_1, 34, 0.6, 42],
20
+ [EXAMPLE_2, 11, 0.6, 42],
21
+ [EXAMPLE_3, 30, 0.6, 42],
22
+ [EXAMPLE_4, 46, 0.6, 42],
23
+ [EXAMPLE_5, 32, 0.6, 42],
24
  ]
25
 
26
  device="cuda:0"