Upload folder using huggingface_hub

demo.yaml

@@ -1,8 +1,9 @@
 lite_metadata:
   gradio_version: 3.32.0
+  liteobj_version: 0.0.7
 class_string: gradio.interface.Interface
 kwargs:
-  title: Gradio Webapp
+  title: gitio sum combination
   description: Given an array of distinct integers candidates and a target integer
     target, return a list of all unique combinations of candidates where the chosen
     numbers sum to target
@@ -12,40 +13,31 @@ kwargs:
   css: null
   allow_flagging: never
   inputs:
-    class_string: liteobj.listify
-    args:
-    - class_string: gradio.components.Dataframe
-      kwargs:
-        label: candidates
-        type: array
-    - class_string: gradio.components.Number
-      kwargs:
-        label: target
-        precision: 0
+  - class_string: gradio.components.Dataframe
+    kwargs:
+      label: candidates
+      type: array
+  - class_string: gradio.components.Number
+    kwargs:
+      label: target
+      precision: 0
   outputs:
-    class_string: liteobj.listify
-    args:
-    - class_string: gradio.components.Dataframe
-      kwargs:
-        label: output
-        type: array
+  - class_string: gradio.components.Dataframe
+    kwargs:
+      label: output
+      type: array
   fn:
     class_string: gradify.gradify_closure
     kwargs:
       argmaps:
-        class_string: liteobj.listify
-        args:
-        - label: candidates
-          postprocessing: 'lambda array: list(map(int, array[0]))'
-        - label: target
-          postprocessing: null
+      - label: candidates
+        postprocessing: 'lambda array: list(map(int, array[0]))'
+      - label: target
+        postprocessing: null
       func_kwargs: {}
-      ldict:
-        class_string: gradify.exec_to_dict
-        kwargs:
-          source: "def combinationSum(candidates, target):\n    res = []\n\n    def\
-            \ backtrack(start, path, target):\n        if target == 0:\n         \
-            \   res.append(path)\n            return\n        for i in range(start,\
-            \ len(candidates)):\n            if candidates[i] > target:\n        \
-            \        break\n            backtrack(i, path + [candidates[i]], target\
-            \ - candidates[i])\n    backtrack(0, [], target)\n    return res\n"
+      source: "def combinationSum(candidates, target):\n    res = []\n\n    def backtrack(start,\
+        \ path, target):\n        if target == 0:\n            res.append(path)\n\
+        \            return\n        for i in range(start, len(candidates)):\n   \
+        \         if candidates[i] > target:\n                break\n            backtrack(i,\
+        \ path + [candidates[i]], target - candidates[i])\n    backtrack(0, [], target)\n\
+        \    return res\n"

gradify.py

@@ -1,7 +1,10 @@
 
 
-def gradify_closure(ldict, argmaps, func_kwargs={}):
+def gradify_closure(source, argmaps, func_kwargs={}):
     
+    ldict = {}
+    exec(source, globals(), ldict)
+
     from types import FunctionType
     for k, v in ldict.items():
         if isinstance(v, FunctionType):
@@ -29,10 +32,3 @@ def gradify_closure(ldict, argmaps, func_kwargs={}):
             raise gr.Error(f"Error: {e}")
 
     return gradify_func
-
-def exec_to_dict(source, target=None):
-
-    ldict = {}
-    exec(source, globals(), ldict)
-
-    return ldict.get(target, None) if target else ldict

requirements.txt

@@ -1,2 +1,2 @@
 gradio==3.32
-liteobj==0.0.4
+liteobj==0.0.7