tricc-oo 1.4.6__tar.gz → 1.4.8__tar.gz

{tricc_oo-1.4.6 → tricc_oo-1.4.8}/PKG-INFO

@@ -1,6 +1,6 @@
-Metadata-Version: 2.4
+Metadata-Version: 2.3
 Name: tricc-oo
-Version: 1.4.6
+Version: 1.4.8
 Summary: Python library that converts CDSS L2 in L3
 Project-URL: Homepage, https://github.com/SwissTPH/tricc
 Project-URL: Issues, https://github.com/SwissTPH/tricc/issues
@@ -11,7 +11,7 @@ Requires-Python: >=3.8
 Description-Content-Type: text/markdown
 
 Requires-Dist: lxml
-Requires-Dist: html2text
+Requires-Dist: markdownify
 Requires-Dist: pydantic
 Requires-Dist: babel
 Requires-Dist: xlsxwriter

{tricc_oo-1.4.6 → tricc_oo-1.4.8}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "tricc-oo"
-version = "1.4.6"
+version = "1.4.8"
 description = "Python library that converts CDSS L2 in L3"
 readme = "README.md"
 license-files = ["LICENSE"]
@@ -16,7 +16,7 @@ classifiers = [
 ]
 dependencies = [
     "lxml",
-    "html2text",
+    "markdownify",
     "pydantic",
     "babel",
     "xlsxwriter",

tricc_oo-1.4.8/tricc_oo/converters/utils.py

@@ -0,0 +1,52 @@
+import logging
+import random
+import string
+import hashlib
+from markdownify import markdownify as md
+
+
+logger = logging.getLogger("default")
+
+
+def replace_all(text, list_char, replacement):
+    for i in list_char:
+        text = text.replace(i, replacement)
+    return text
+
+
+def clean_str(name, replace_dots=False):
+    replacement_list = ["-", " ", ",", "."] if replace_dots else ["-", " ", ","]
+    return replace_all(name, replacement_list, "_")
+
+
+def clean_name(name, prefix="", replace_dots=False):
+    name = clean_str(name, replace_dots)
+    if name[0].isdigit():
+        name = "id_" + name
+    elif name[0].isdigit() == "_":
+        name = name[1:]
+    return name
+
+
+def generate_id(name=None, length=18):
+    if name:
+        h = hashlib.blake2b(digest_size=length)
+        h.update(name.encode("utf-8") if isinstance(name, str) else name)
+        return h.hexdigest()
+    else:
+        return "".join(
+            random.choices(
+                string.ascii_lowercase + string.digits + string.ascii_uppercase,
+                k=length,
+            )
+        )
+
+
+def get_rand_name(name=None, length=8):
+    return "n" + generate_id(name=name, length=length)
+
+
+# the soup.text strips off the html formatting also
+def remove_html(string):
+    text = md(string, strip=["img", "table", "a"])
+    return text

{tricc_oo-1.4.6 → tricc_oo-1.4.8}/tricc_oo/converters/xml_to_tricc.py

@@ -29,7 +29,11 @@ TRICC_FOLLOW_LABEL = ["follow", "suivre", "continue"]
 NO_LABEL = "NO_LABEL"
 TRICC_LIST_NAME = "list_{0}"
 import logging
-
+DISPLAY_ATTRIBUTES = [
+    'label',
+    'hint',
+    'help'
+]
 logger = logging.getLogger("default")
 
 
@@ -753,10 +757,12 @@ def set_mandatory_attribute(elm, mandatory_attributes, diagram=None):
             exit(1)
         if attributes == "link":
             param[attributes] = clean_link(attribute_value)
-        elif attributes in ("parent", "id", "source", "target"):
-            param[attributes] = attribute_value
+
         elif attribute_value is not None:
-            param[attributes] = remove_html(attribute_value.strip())
+            if attributes in DISPLAY_ATTRIBUTES:
+                param[attributes] = remove_html(attribute_value.strip())
+            else:
+                param[attributes] = attribute_value.strip() if isinstance(attribute_value, str) else attribute_value
     return param
 
 

{tricc_oo-1.4.6 → tricc_oo-1.4.8}/tricc_oo/strategies/output/xlsform_cht.py

@@ -117,7 +117,7 @@ class XLSFormCHTStrategy(XLSFormCDSSStrategy):
         # pause
         ends = []
         for p in self.project.pages.values():
-            p_ends = list(filter(lambda x:  issubclass(x.__class__, TriccNodeEnd) and hasattr(x, 'hint'), p.nodes.values() ))
+            p_ends = list(filter(lambda x:  issubclass(x.__class__, TriccNodeEnd) and getattr(x, 'hint', None) is not None, p.nodes.values() ))
             if p_ends:
                 ends += p_ends
         if ends:

{tricc_oo-1.4.6 → tricc_oo-1.4.8}/tricc_oo/visitors/tricc.py

@@ -115,7 +115,8 @@ def process_calculate(node,processed_nodes, stashed_nodes, calculates, used_calc
         ):
             if kwargs.get('warn', True):
                 logger.debug('Processing relevance for node {0}'.format(node.get_name()))
-            last_version = get_last_version(node.name, processed_nodes) if issubclass(node.__class__, (TriccNodeDisplayModel, TriccNodeDisplayCalculateBase)) and not isinstance(node, TriccNodeSelectOption)  else  None
+            node_name = node.name if not isinstance(node, TriccNodeEnd) else 'tricc_end'
+            last_version = get_last_version(node_name, processed_nodes) if issubclass(node.__class__, (TriccNodeDisplayModel, TriccNodeDisplayCalculateBase)) and not isinstance(node, TriccNodeSelectOption)  else  None
             #last_version = processed_nodes.find_prev(node, lambda item: hasattr(item, 'name') and item.name == node.name)
             if last_version:
                 # 0-100 for manually specified instance.  100-200 for auto instance 
@@ -128,9 +129,7 @@ def process_calculate(node,processed_nodes, stashed_nodes, calculates, used_calc
                     if (
                         issubclass(node.__class__, (TriccNodeDisplayCalculateBase )) and node.name is not None
                     ):
-                        node_name = node.name if not isinstance(node, TriccNodeEnd) else 'tricc_end'
-
-                                #logger.debug("set last to false for node {}  and add its link it to next one".format(last_used_calc.get_name()))
+                        #logger.debug("set last to false for node {}  and add its link it to next one".format(last_used_calc.get_name()))
                         if node.prev_nodes:    
                             set_prev_next_node(last_version, node)
                         else:
@@ -1113,21 +1112,38 @@ def check_stashed_loop(stashed_nodes, prev_stashed_nodes, processed_nodes, len_p
                     logger.critical("Stashed node list was unchanged: loop likely or unresolved dependence")
                     waited, looped =  get_all_dependant(stashed_nodes, stashed_nodes, processed_nodes)               
                     logger.debug(f"{len(looped)} nodes waiting stashed nodes")
-                    logger.info("looped nodes")
-                    for es_node in looped:
+                    logger.info("unresolved reference")
+                    for es_node in [n for n in stashed_nodes if isinstance(n, TriccReference)]:
                         logger.info("Stashed node {}:{}|{} {}".format(
                             es_node.activity.get_name() if hasattr(es_node,'activity') else '' ,
                             es_node.activity.instance if hasattr(es_node,'activity') else '',
                             es_node.__class__, 
                             es_node.get_name()))
+                    logger.info("looped nodes")
+                    for dep_list in looped:
+                        for d in looped[dep_list]:
+                            if d.get_name() == dep_list:
+                                logger.critical("[{}] depends on itself".format(
+                                    dep_list, 
+                                    ))
+                            logger.error("[{}] depends on [{}]".format(
+                                dep_list, str(d)
+                                ))
+                        if dep_list in waited:
+                            for d in waited[dep_list]:
+                                logger.warning("[{}] depends on [{}]".format(
+                                    dep_list, str(d)
+                                    ))
+                        
                         #reverse_walkthrough(es_node, es_node, print_trace, processed_nodes, stashed_nodes)
                     logger.info("waited nodes")
-                    for es_node in waited:
-                        logger.info("Stashed node {}:{}|{} {}".format(
-                            es_node.activity.get_name() if hasattr(es_node,'activity') else '' ,
-                            es_node.activity.instance if hasattr(es_node,'activity') else '',
-                            es_node.__class__, 
-                            es_node.get_name()))
+                    for dep_list in waited:
+                        if dep_list not in looped:
+                            for d in waited[dep_list]:
+                                logger.warning("[{}] depends on [{}]".format(
+                                    dep_list, d.get_name()
+                                    ))
+                            
                     if len(stashed_nodes) == len(prev_stashed_nodes):
                         exit(1)
             else:
@@ -1136,12 +1152,25 @@ def check_stashed_loop(stashed_nodes, prev_stashed_nodes, processed_nodes, len_p
         loop_count = 0
     return loop_count
 
+
+def add_to_tree(tree, n, d):
+    n_str = str(n)
+    if n_str not in tree:
+        tree[n_str] = []
+    if d not in tree[n_str]:
+        tree[n_str].append(d)
+    return tree
+
         
-def get_all_dependant(loop, stashed_nodes, processed_nodes, depth=0, waited=[] , looped=[]):
+def get_all_dependant(loop, stashed_nodes, processed_nodes, depth=0, waited=None , looped=None):
+    if looped is None:
+        looped = {}
+    if waited is None:
+        waited = {}
     for n in loop:
         dependant = OrderedSet()
         i=0
-        logger.critical(f"{i}: {n.__class__}::{n.get_name()}::{getattr(n,'instance','')}::{process_reference(n, processed_nodes, [])}")
+        #logger.critical(f"{i}: {n.__class__}::{n.get_name()}::{getattr(n,'instance','')}::{process_reference(n, processed_nodes, [])}")
         i += 1
         if hasattr(n, 'prev_nodes') and n.prev_nodes:
             dependant =  dependant | n.prev_nodes
@@ -1156,16 +1185,15 @@ def get_all_dependant(loop, stashed_nodes, processed_nodes, depth=0, waited=[] ,
                 if isinstance(d, TriccReference):
                     if not any(n.name == d.value for n in processed_nodes):
                         if not any(n.name == d.value for n in stashed_nodes):
-                            waited.append(d)
+                            waited = add_to_tree(waited, n, d) 
                         else :
-                            looped.append(d)
+                            looped = add_to_tree(looped, n, d)
                 
                 elif d  not in processed_nodes:
-                    
-                    if d not in stashed_nodes:
-                        waited.append(d)
+                    if d in stashed_nodes:
+                        looped = add_to_tree(looped, n, d) 
                     else :
-                        looped.append(d)
+                        waited = add_to_tree(waited, n, d) 
     if depth < MAX_DRILL:
         return get_all_dependant(waited, stashed_nodes, processed_nodes, depth+1, waited , looped)
 

{tricc_oo-1.4.6 → tricc_oo-1.4.8}/tricc_oo.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: tricc-oo
-Version: 1.4.6
+Version: 1.4.8
 Summary: Python library that converts CDSS L2 in L3
 Project-URL: Homepage, https://github.com/SwissTPH/tricc
 Project-URL: Issues, https://github.com/SwissTPH/tricc/issues
@@ -11,7 +11,7 @@ Requires-Python: >=3.8
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: lxml
-Requires-Dist: html2text
+Requires-Dist: markdownify
 Requires-Dist: pydantic
 Requires-Dist: babel
 Requires-Dist: xlsxwriter

{tricc_oo-1.4.6 → tricc_oo-1.4.8}/tricc_oo.egg-info/requires.txt

@@ -1,5 +1,5 @@
 lxml
-html2text
+markdownify
 pydantic
 babel
 xlsxwriter

tricc_oo-1.4.6/tricc_oo/converters/utils.py

@@ -1,57 +0,0 @@
-import logging
-import random
-import string
-import hashlib
-import html2text
-
-
-
-logger = logging.getLogger("default")
-
-def replace_all(text, list_char, replacement):
-    for i in list_char:
-        text = text.replace(i, replacement)
-    return text
-
-def clean_str(name, replace_dots=False):
-    replacement_list = ['-', ' ', ',', '.'] if replace_dots else ['-', ' ', ',']
-    return replace_all(name, replacement_list,'_')
-
-def clean_name( name, prefix='', replace_dots=False):
-    name = clean_str(name, replace_dots)
-    if name[0].isdigit():
-        name = 'id_' + name
-    elif  name[0].isdigit() == '_':
-        name =  name[1:]
-    return name
-
-def generate_id(name=None, length=18):
-    if name:
-        h = hashlib.blake2b(digest_size=length)
-        h.update(name.encode('utf-8') if isinstance(name, str) else name)
-        return h.hexdigest()
-    else:
-        return ''.join(random.choices(string.ascii_lowercase + string.digits + string.ascii_uppercase, k=length))
-
-
-def get_rand_name(name=None, length=8):
-    return "n" + generate_id(name=name, length=length)
-
-# the soup.text strips off the html formatting also
-def remove_html(string):
-    h = html2text.HTML2Text()
-    h.body_width = 0  # Prevents line wrapping
-    h.ignore_links = True  # Ignores any link processing
-    h.ignore_images = True  # Ignores image processing
-    h.ignore_tables = True  # Ignores table formatting
-    text = h.handle(string).rstrip()  # rstrip()
-    text = text.strip('\n') # get rid of empty lines at the end (and beginning)
-    text = text.split('\n') # split string into a list at new lines
-    text = '\n'.join([i.strip(' ') for i in text if i]) # in each element in that list strip empty space (at the end of line) 
-    # and delete empty lines
-    return text
-
-
-
-
-