Upload folder using huggingface_hub

demo.yaml

@@ -3,8 +3,7 @@ lite_metadata:
 class_string: gradio.interface.Interface
 kwargs:
   title: Gradio Webapp
-  description: Given two sorted arrays nums1 and nums2 of size m and n respectively,
-    return the median of the two sorted arrays
+  description: Given list of strings, create regex to extract dates
   article: null
   thumbnail: null
   theme: gradio/seafoam
@@ -15,43 +14,27 @@ kwargs:
     args:
     - class_string: gradio.components.Dataframe
       kwargs:
-        label: nums1
-        type: array
-    - class_string: gradio.components.Dataframe
-      kwargs:
-        label: nums2
+        label: strings
         type: array
   outputs:
     class_string: liteobj.listify
     args:
-    - class_string: gradio.components.Number
+    - class_string: gradio.components.Dataframe
       kwargs:
         label: output
+        type: array
   fn:
     class_string: gradify.gradify_closure
     kwargs:
       argmaps:
         class_string: liteobj.listify
         args:
-        - label: nums1
-          postprocessing: 'lambda array: list(map(int, array[0]))'
-        - label: nums2
-          postprocessing: 'lambda array: list(map(int, array[0]))'
+        - label: strings
+          postprocessing: 'lambda array: list(map(str, array[0]))'
       func_kwargs: {}
       ldict:
         class_string: gradify.exec_to_dict
         kwargs:
-          source: "def func(nums1, nums2):\n    m, n = len(nums1), len(nums2)\n  \
-            \  if m > n:\n        nums1, nums2, m, n = nums2, nums1, n, m\n    i_min,\
-            \ i_max, half_len = 0, m, (m + n + 1) // 2\n    while i_min <= i_max:\n\
-            \        i = (i_min + i_max) // 2\n        j = half_len - i\n        if\
-            \ i < m and nums2[j - 1] > nums1[i]:\n            i_min = i + 1\n    \
-            \    elif i > 0 and nums1[i - 1] > nums2[j]:\n            i_max = i -\
-            \ 1\n        else:\n            if i == 0:\n                max_of_left\
-            \ = nums2[j - 1]\n            elif j == 0:\n                max_of_left\
-            \ = nums1[i - 1]\n            else:\n                max_of_left = max(nums1[i\
-            \ - 1], nums2[j - 1])\n            if (m + n) % 2 == 1:\n            \
-            \    return max_of_left\n            if i == m:\n                min_of_right\
-            \ = nums2[j]\n            elif j == n:\n                min_of_right =\
-            \ nums1[i]\n            else:\n                min_of_right = min(nums1[i],\
-            \ nums2[j])\n            return (max_of_left + min_of_right) / 2.0\n"
+          source: "import re\n\n\ndef func(strings):\n    regex = '\\\\d{1,2}/\\\\\
+            d{1,2}/\\\\d{4}'\n    dates = []\n    for string in strings:\n       \
+            \ dates += re.findall(regex, string)\n    return dates\n"

gradify.py

@@ -29,7 +29,4 @@ def exec_to_dict(source, target=None):
     ldict = {}
     exec(source, globals(), ldict)
 
-    if target:
-        return ldict.get(target, None)
-
-    return ldict
+    return ldict.get(target, None) if target else ldict