tricc-oo 1.0.1__py3-none-any.whl → 1.4.15__py3-none-any.whl

tricc/visitors/tricc.py

@@ -1,375 +0,0 @@
-import re
-
-from tricc.converters.utils import *
-from tricc.models.tricc import *
-
-
-
-def merge_node(from_node,to_node):
-    if from_node.activity != to_node.activity:
-        logger.error("Cannot merge nodes from different activities")
-    elif issubclass(from_node.__class__, TriccNodeCalculateBase) and issubclass(to_node.__class__, TriccNodeCalculateBase):
-        for e in to_node.activity.edges:
-            if e.target == from_node.id:
-                e.target = to_node.id
-    else:
-        logger.error("Cannot merge not calculate nodes ")
-    
-
-def get_max_version(dict):
-    max_version = None
-    for id, sim_node in dict.items():
-        if max_version is None or  max_version.version < sim_node.version :
-            max_version = sim_node
-    return max_version
-
-def get_last_version(dict, name):
-    max_version = None
-    if name in dict:
-        for  sim_node in dict[name].values():
-            if max_version is None or  max_version.path_len < sim_node.path_len :
-                max_version = sim_node
-    return max_version
-
-
-
-
-def process_calculate(node,processed_nodes, stashed_nodes, calculates, used_calculates, warn = False, **kwargs ):
-     # used_calculates dict[name, Dict[id, node]]
-     # processed_nodes Dict[id, node]
-     # calculates  dict[name, Dict[id, node]]
-    if node not in processed_nodes:
-        # generate condition
-        if is_ready_to_process(node, processed_nodes,False) and process_reference(node, calculates,used_calculates,processed_nodes,warn = warn):
-            if is_rhombus_ready_to_process(node,processed_nodes):
-                generate_calculates(node,calculates, used_calculates,processed_nodes)
-                if issubclass(node.__class__, (TriccNodeDisplayCalculateBase )) and node.name is not None:
-                    # generate the calc node version by looking in the processed calculate
-                    last_calc = get_last_version(calculates, node.name)
-                    # get max version used 
-                    #last_used_version =  get_max_named_version(used_calculates, node.name)
-                    last_used_calc = get_last_version(used_calculates, node.name)
-                    # add calculate is added after the version collection so it is 0 in case there is no calc found
-                    add_calculate(calculates,node)  
-                    # merge is there is unused version ->
-                    # current node not yet in the list so 1 item is enough
-                    if last_calc is not None:
-                        if last_used_calc is None or last_calc.path_len > last_used_calc.path_len:
-                            node.version = last_calc.version + 1
-                            node_to_delete = merge_calculate(node, calculates[node.name],last_used_calc)
-                            if node_to_delete is not None:  
-                                for d_node in node_to_delete:               
-                                    del calculates[d_node.name][d_node.id]
-                                    
-                                    if d_node.name in used_calculates:
-                                        if d_node.id in used_calculates[d_node.name]:
-                                            logger.error("node {} used but deleted".format(d_node.get_name()))
-                                    if d_node.id in d_node.activity.nodes:
-                                        # mostly for end nodes
-                                        if isinstance(d_node,(TriccNodeEnd,TriccNodeActivityEnd)):
-                                            del d_node.activity.nodes[d_node.id]
-                                    if  d_node  in stashed_nodes:
-                                        logger.error("node {} not porcessed but deleted".format(d_node.get_name()))
-                        # chaining the calculate, this is needed each time there is a last used version       
-                        if last_used_calc is not None :
-                            logger.debug("set last to false for node {}  and add its link it to next one".format(last_used_calc.get_name()))
-                            set_prev_next_node(last_used_calc,node)
-                            last_used_calc.last = False
-                        update_calc_version(calculates,node.name)
-                #if hasattr(node, 'next_nodes'):
-                    #node.next_nodes=reorder_node_list(node.next_nodes, node.group)
-                return True
-        # not ready to process or already processed
-
-    return False
-      
-def update_calc_version(calculates,name):
-    if name in calculates and len(calculates[name])>1:
-        ordered_list = sorted(list(calculates[name].values()), key=lambda x:x.path_len)
-        i = 1
-        len_max=len(calculates[name])
-        for elm in ordered_list:
-            elm.version=i
-            elm.last= (i == len_max)
-            i+=1
-        
-
-def get_max_named_version(calculates,name):
-    max = 0
-    if name  in calculates:
-        for  node in calculates[name].values():
-            if node.version > max:
-                max = node.version
-    return max
-
-def get_count_node(node):
-    count_id = generate_id()
-    count_name = "cnt_"+count_id
-    return TriccNodeCount(
-        id = count_id,
-        group = node.group,
-        activity = node.activity,
-        label = "count: "+node.get_name(),
-        name = count_name,
-        path_len=node.path_len
-    )
-    
-### Function that inject a wait after path that will wait for the nodes
-def get_activity_wait(prev_nodes, nodes_to_wait, next_nodes, replaced_node = None, edge_only = False, activity = None):
-    
-    if not isinstance(nodes_to_wait, list):
-        nodes_to_wait = [nodes_to_wait]
-    path = prev_nodes[0] if len(prev_nodes) == 1 else get_bridge_path(prev_nodes, activity)
-    activity = activity or prev_nodes[0].activity
-    calc_node = TriccNodeWait(
-            id = "ar_"+generate_id(),
-            reference = nodes_to_wait,
-            activity = activity,
-            group = activity,
-            path = path
-        )
-
-    #start the wait and the next_nodes from the prev_nodes
-    #add the wait as dependency of the next_nodes
-
-        # add edge between rhombus and node
-
-    set_prev_next_node(path,calc_node, edge_only=edge_only, activity=activity )
-    for next_node in next_nodes:
-            #if prev != replaced_node and next_node != replaced_node :
-            #    set_prev_next_node(prev,next_node,replaced_node)
-                #if first:
-                #first = False 
-        set_prev_next_node(calc_node,next_node, edge_only=edge_only,activity=activity)
-    return calc_node
-    
-def get_bridge_path(prev_nodes, node=None,edge_only=False):
-    if node is None:
-        node = prev_nodes[0]
-    calc_id  = generate_id()
-    calc_name = "path_"+calc_id
-    data = {
-        'id': calc_id,
-        'group':  node.group,
-        'activity': node.activity,
-        'label': "path: " + ( node.get_name()),
-        'name': calc_name,
-        'path_len': node.path_len + 1 * (node == prev_nodes[0])
-    }
-    
-    if sum([0 if issubclass(n.__class__, (TriccNodeDisplayCalculateBase, TriccNodeRhombus)) else 1 for n in prev_nodes])>0 : #and len(node.prev_nodes)>1:
-        calc= TriccNodeDisplayBridge( **data)
-    else:
-        calc =  TriccNodeBridge( **data)
-    for prev in prev_nodes:
-        set_prev_next_node(prev, calc, activity=node.activity, edge_only=edge_only )
-    
-def inject_bridge_path(node, nodes):
-
-    prev_nodes = [nodes[n.source] for n in list(filter(lambda x: (x.target == node.id or x.target == node) and x.source in nodes ,node.activity.edges ))] 
-    calc = get_bridge_path(prev_nodes, node,edge_only=True)
-
-    for e in node.activity.edges:
-        if e.target == node.id:
-            e.target = calc.id
-   
-    # add edge between bridge and node
-    set_prev_next_node(calc,node,edge_only=True, activity=node.activity)
-    node.path_len += 1
-    return calc
-    
-def generate_calculates(node,calculates, used_calculates,processed_nodes):
-    list_calc = []
-    ## add select calcualte
-    if issubclass(node.__class__, TriccNodeCalculateBase):
-        if isinstance(node, TriccNodeRhombus):
-            if node.expression_reference is None and len(node.reference)==1 and issubclass(node.reference[0].__class__, TriccNodeSelect):
-                count_node = get_count_node(node)
-                list_calc.append(count_node)
-                set_prev_next_node(node.reference[0],count_node)
-                node.path_len+=1
-                node.reference[0] =  count_node
-                processed_nodes.append(count_node)
-                add_calculate(calculates, count_node)
-                add_used_calculate(node, count_node, calculates, used_calculates, processed_nodes)
-            
-    # if a prev node is a calculate then it must be added in used_calc
-    for prev in node.prev_nodes:
-        add_used_calculate(node, prev, calculates, used_calculates, processed_nodes)
-    #if the node have a save 
-    if hasattr(node, 'save') and node.save is not None and node.save != '':
-        # get fragments type.name.icdcode
-        save_fragments=node.save.split('.')
-        if len(save_fragments)>1:
-            calculate_name = "{0}.{1}".format(save_fragments[0], save_fragments[1])
-        else:
-            calculate_name = "{0}.{1}".format(save_fragments[0], node.name)
-            
-        
-
-    
-        if not isinstance(node, TriccNodeSelectYesNo) and  issubclass(node.__class__, (TriccNodeSelect)):
-            calc_node = get_count_node(node)
-            calc_node.path_len += 1
-            calc_node.name=calculate_name
-            calc_node.label =  "save select: " +node.get_name()        
-        else:
-            calc_id = generate_id()
-            calc_node = TriccNodeCalculate(
-                name=calculate_name,
-                id = calc_id,
-                group = node.group,
-                activity = node.activity,
-                label =  "save: " +node.get_name(),
-                path_len=node.path_len+ 1
-            )
-        logger.debug("generate_save_calculate:{}:{} as {}".format(calc_node.tricc_type, node.name if hasattr(node,'name') else node.id, calculate_name))
-        if isinstance(node, TriccNodeSelectYesNo):
-            yesNode =  node.options[0]
-            set_prev_next_node(yesNode,calc_node)
-        else:
-            set_prev_next_node(node,calc_node)
-        list_calc.append(calc_node)
-        #add_save_calculate(calc_node, calculates, used_calculates,processed_nodes)
-    return list_calc
-
-
-
-def add_calculate(calculates, calc_node):
-    if issubclass(calc_node.__class__, TriccNodeDisplayCalculateBase):
-        if calc_node.name not in calculates:
-            calculates[calc_node.name]= {}
-        calculates[calc_node.name][calc_node.id] = calc_node
-
-def process_reference(node,  calculates ,used_calculates,processed_nodes, warn = False ):
-    #global last_unfound_ref
-    reference = []
-    expression_reference = None
-    if issubclass(node.__class__, TriccRhombusMixIn):
-        if isinstance(node.reference, str) :
-            logger.debug("process_reference:{}: {} ".format(node.get_name(), node.reference))
-            ref_regex=r'(\$\{[^\}]+\})'
-            lookup = re.findall(ref_regex, node.reference)
-            if lookup and len(lookup)>0:
-                ref_list = [x[2:-1] for x in lookup]
-                expression_reference = re.sub(ref_regex,r"${{{}}}", node.reference )
-            else:
-                ref_list= [node.reference]
-            for ref in ref_list:
-                ref = ref.strip()
-                last_found = get_prev_node_by_name(processed_nodes, ref, node)
-                # ref is still a string here
-                if last_found is None  or issubclass(last_found.__class__, TriccNodeCalculateBase):
-                    if ref in calculates and len(calculates[ref])>0 :
-                        # issue is that it can be further in another path
-                        last_found = get_last_version(calculates, ref)
-                if last_found is None:
-                    if warn:
-                        logger.warning("reference {} not found for a calculate {}".format(ref, node.get_name()))
-                    else:
-                        logger.debug("reference {} not found for a calculate {}".format(ref, node.get_name()))
-                    #if last_unfound_ref == node:
-                    #    logger.warning("reference not found for a calculate twice in a row {}".format(node.get_name()))
-                    #last_unfound_ref = node
-                    return False
-                else:
-                    reference.append(last_found) 
-                    last_found.next_nodes.append(node)
-                    node.path_len = max(node.path_len,last_found.path_len )
-            for ref in reference:
-                add_used_calculate(node, ref, calculates, used_calculates, processed_nodes)
-            node.reference = reference
-            node.expression_reference = expression_reference
-        elif isinstance(node.reference,list):
-            for ref in node.reference:
-                #add_calculate(calculates,ref )
-                add_used_calculate(ref, node,calculates, used_calculates, processed_nodes)
-        elif node.reference is None:
-            logger.error("process_calculate_version_requirement:reference is None for {0} ".format(node.get_name()))
-            exit()             
-            
-    return True
-
-
-#add_used_calculate(node, calc_node, calculates, used_calculates, processed_nodes)
-
-def add_used_calculate(node, prev_node, calculates, used_calculates, processed_nodes):
-    if issubclass(prev_node.__class__, TriccNodeDisplayCalculateBase):
-        if prev_node in processed_nodes:
-            # if not a verison, index will equal -1
-            if prev_node.name not in calculates :
-                logger.debug("node {} refered before being processed".format(node.get_name()))
-                return False
-            max_version = prev_node#get_max_version(calculates[node_clean_name])
-            if prev_node.name not in used_calculates:
-                used_calculates[prev_node.name] = {}
-            #save the max version only once
-            if max_version.id not in used_calculates[prev_node.name]:
-                used_calculates[prev_node.name][max_version.id] = max_version
-        else:
-            logger.debug("process_calculate_version_requirement: failed for {0} , prev Node {1} ".format(node.get_name(), prev_node.get_name()))
-
-def merge_calculate(node, calculates, last_used_calc):
-    #calcualtes list[ node]
-    node_to_delete = []
-    for calc_node in calculates.values():
-        # merge only if same name, version >= fromm version but < node version   and we don't merge the end node from differentes instance 
-        if  calc_node!=node and node.tricc_type == calc_node.tricc_type:
-            # if there is a calculate and a count, merge on the count
-            remaining = node
-            to_remove = calc_node
-            if not(isinstance(remaining,(TriccNodeActivityEnd, TriccNodeActivityStart))) or remaining.instance == to_remove.instance:
-                if (last_used_calc is None or to_remove.path_len > last_used_calc.path_len )and  to_remove.path_len<=remaining.path_len:
-                    logger.debug("merge_calculate:{} ".format(remaining.name if hasattr(remaining,'name') else remaining.id))
-                    # unlink the merged node in its next nodes
-                    # list node is used to not update to_remove.next_nodes in a loop not porcessed but deleted
-                    list_nodes = []
-                    for next_node in to_remove.next_nodes:
-                        list_nodes.append(next_node)
-                    for next_node in list_nodes:
-                        set_prev_next_node(remaining, next_node, to_remove )
-                    # unlink the merged node in its prev nodes
-                    # list node is used to not update to_remove.prev_nodes in a loop
-                    list_nodes = []
-                    for prev_node in to_remove.prev_nodes:
-                        list_nodes.append(prev_node)
-                    for prev_node in list_nodes:
-                        set_prev_next_node(prev_node, remaining, to_remove )                 
-                    node_to_delete.append(to_remove)
-            else:
-                logger.info("activity {} instance {} and {} might be merged (end node mergables)".format(remaining.activity.get_name(), remaining.activity.instance, to_remove.activity.instance))
-        elif node.tricc_type != calc_node.tricc_type:
-            logger.warning("two different type of calculate node share the same name {}::{}::{}".format(node.name,node.tricc_type, calc_node.tricc_type))
-    return node_to_delete
-    
-    
-
-        
-def get_select_not_available_options(node,group,label):
-    return {0:TriccNodeSelectOption(
-                id = generate_id(),
-                name="1",
-                label=label,
-                select = node,
-                group = group,
-                list_name = node.list_name
-            )}
-        
-def get_select_yes_no_options(node, group):
-    yes = TriccNodeSelectOption(
-                id = generate_id(),
-                name="1",
-                label="Yes",
-                select = node,
-                group = group,
-                list_name =  node.list_name
-            )
-    no = TriccNodeSelectOption(
-                id = generate_id(),
-                name="-1",
-                label="No",
-                select = node,
-                group = group,
-                list_name =  node.list_name
-            )
-    return {0:yes, 1:no }

tricc_oo-1.0.1.dist-info/LICENSE

@@ -1,78 +0,0 @@
-Attribution-NonCommercial 3.0 Unported
-CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE LEGAL SERVICES. DISTRIBUTION OF THIS LICENSE DOES NOT CREATE AN ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES REGARDING THE INFORMATION PROVIDED, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM ITS USE.
-
-License
-
-THE WORK (AS DEFINED BELOW) IS PROVIDED UNDER THE TERMS OF THIS CREATIVE COMMONS PUBLIC LICENSE ("CCPL" OR "LICENSE"). THE WORK IS PROTECTED BY COPYRIGHT AND/OR OTHER APPLICABLE LAW. ANY USE OF THE WORK OTHER THAN AS AUTHORIZED UNDER THIS LICENSE OR COPYRIGHT LAW IS PROHIBITED.
-
-BY EXERCISING ANY RIGHTS TO THE WORK PROVIDED HERE, YOU ACCEPT AND AGREE TO BE BOUND BY THE TERMS OF THIS LICENSE. TO THE EXTENT THIS LICENSE MAY BE CONSIDERED TO BE A CONTRACT, THE LICENSOR GRANTS YOU THE RIGHTS CONTAINED HERE IN CONSIDERATION OF YOUR ACCEPTANCE OF SUCH TERMS AND CONDITIONS.
-
-1. Definitions
-
-Adaptation means a work based upon the Work, or upon the Work and other pre-existing works, such as a translation, adaptation, derivative work, arrangement of music or other alterations of a literary or artistic work, or phonogram or performance and includes cinematographic adaptations or any other form in which the Work may be recast, transformed, or adapted including in any form recognizably derived from the original, except that a work that constitutes a Collection will not be considered an Adaptation for the purpose of this License. For the avoidance of doubt, where the Work is a musical work, performance or phonogram, the synchronization of the Work in timed-relation with a moving image ("synching") will be considered an Adaptation for the purpose of this License.
-Collection means a collection of literary or artistic works, such as encyclopedias and anthologies, or performances, phonograms or broadcasts, or other works or subject matter other than works listed in Section 1(f) below, which, by reason of the selection and arrangement of their contents, constitute intellectual creations, in which the Work is included in its entirety in unmodified form along with one or more other contributions, each constituting separate and independent works in themselves, which together are assembled into a collective whole. A work that constitutes a Collection will not be considered an Adaptation (as defined above) for the purposes of this License.
-Distribute means to make available to the public the original and copies of the Work or Adaptation, as appropriate, through sale or other transfer of ownership.
-Licensor means the individual, individuals, entity or entities that offer(s) the Work under the terms of this License.
-Original Author means, in the case of a literary or artistic work, the individual, individuals, entity or entities who created the Work or if no individual or entity can be identified, the publisher; and in addition (i) in the case of a performance the actors, singers, musicians, dancers, and other persons who act, sing, deliver, declaim, play in, interpret or otherwise perform literary or artistic works or expressions of folklore; (ii) in the case of a phonogram the producer being the person or legal entity who first fixes the sounds of a performance or other sounds; and, (iii) in the case of broadcasts, the organization that transmits the broadcast.
-Work means the literary and/or artistic work offered under the terms of this License including without limitation any production in the literary, scientific and artistic domain, whatever may be the mode or form of its expression including digital form, such as a book, pamphlet and other writing; a lecture, address, sermon or other work of the same nature; a dramatic or dramatico-musical work; a choreographic work or entertainment in dumb show; a musical composition with or without words; a cinematographic work to which are assimilated works expressed by a process analogous to cinematography; a work of drawing, painting, architecture, sculpture, engraving or lithography; a photographic work to which are assimilated works expressed by a process analogous to photography; a work of applied art; an illustration, map, plan, sketch or three-dimensional work relative to geography, topography, architecture or science; a performance; a broadcast; a phonogram; a compilation of data to the extent it is protected as a copyrightable work; or a work performed by a variety or circus performer to the extent it is not otherwise considered a literary or artistic work.
-You means an individual or entity exercising rights under this License who has not previously violated the terms of this License with respect to the Work, or who has received express permission from the Licensor to exercise rights under this License despite a previous violation.
-Publicly Perform means to perform public recitations of the Work and to communicate to the public those public recitations, by any means or process, including by wire or wireless means or public digital performances; to make available to the public Works in such a way that members of the public may access these Works from a place and at a place individually chosen by them; to perform the Work to the public by any means or process and the communication to the public of the performances of the Work, including by public digital performance; to broadcast and rebroadcast the Work by any means including signs, sounds or images.
-Reproduce means to make copies of the Work by any means including without limitation by sound or visual recordings and the right of fixation and reproducing fixations of the Work, including storage of a protected performance or phonogram in digital form or other electronic medium.
-2. Fair Dealing Rights.
-
-Nothing in this License is intended to reduce, limit, or restrict any uses free from copyright or rights arising from limitations or exceptions that are provided for in connection with the copyright protection under copyright law or other applicable laws.
-
-3. License Grant.
-
-Subject to the terms and conditions of this License, Licensor hereby grants You a worldwide, royalty-free, non-exclusive, perpetual (for the duration of the applicable copyright) license to exercise the rights in the Work as stated below:
-
-to Reproduce the Work, to incorporate the Work into one or more Collections, and to Reproduce the Work as incorporated in the Collections;
-
-to create and Reproduce Adaptations provided that any such Adaptation, including any translation in any medium, takes reasonable steps to clearly label, demarcate or otherwise identify that changes were made to the original Work. For example, a translation could be marked "The original work was translated from English to Spanish," or a modification could indicate "The original work has been modified.";
-
-to Distribute and Publicly Perform the Work including as incorporated in Collections; and,
-
-to Distribute and Publicly Perform Adaptations.
-
-The above rights may be exercised in all media and formats whether now known or hereafter devised. The above rights include the right to make such modifications as are technically necessary to exercise the rights in other media and formats. Subject to Section 8(f) , all rights not expressly granted by Licensor are hereby reserved, including but not limited to the rights set forth in Section 4(d) .
-
-4. Restrictions.
-
-The license granted in Section 3 above is expressly made subject to and limited by the following restrictions:
-
-You may Distribute or Publicly Perform the Work only under the terms of this License. You must include a copy of, or the Uniform Resource Identifier (URI) for, this License with every copy of the Work You Distribute or Publicly Perform. You may not offer or impose any terms on the Work that restrict the terms of this License or the ability of the recipient of the Work to exercise the rights granted to that recipient under the terms of the License. You may not sublicense the Work. You must keep intact all notices that refer to this License and to the disclaimer of warranties with every copy of the Work You Distribute or Publicly Perform. When You Distribute or Publicly Perform the Work, You may not impose any effective technological measures on the Work that restrict the ability of a recipient of the Work from You to exercise the rights granted to that recipient under the terms of the License. This Section 4(a) applies to the Work as incorporated in a Collection, but this does not require the Collection apart from the Work itself to be made subject to the terms of this License. If You create a Collection, upon notice from any Licensor You must, to the extent practicable, remove from the Collection any credit as required by Section 4(c) , as requested. If You create an Adaptation, upon notice from any Licensor You must, to the extent practicable, remove from the Adaptation any credit as required by Section 4(c) , as requested.
-
-You may not exercise any of the rights granted to You in Section 3 above in any manner that is primarily intended for or directed toward commercial advantage or private monetary compensation. The exchange of the Work for other copyrighted works by means of digital file-sharing or otherwise shall not be considered to be intended for or directed toward commercial advantage or private monetary compensation, provided there is no payment of any monetary compensation in con-nection with the exchange of copyrighted works.
-
-If You Distribute, or Publicly Perform the Work or any Adaptations or Collections, You must, unless a request has been made pursuant to Section 4(a) , keep intact all copyright notices for the Work and provide, reasonable to the medium or means You are utilizing: (i) the name of the Original Author (or pseudonym, if applicable) if supplied, and/or if the Original Author and/or Licensor designate another party or parties (e.g., a sponsor institute, publishing entity, journal) for attribution ("Attribution Parties") in Licensor's copyright notice, terms of service or by other reasonable means, the name of such party or parties; (ii) the title of the Work if supplied; (iii) to the extent reasonably practicable, the URI, if any, that Licensor specifies to be associated with the Work, unless such URI does not refer to the copyright notice or licensing information for the Work; and, (iv) consistent with Section 3(b) , in the case of an Adaptation, a credit identifying the use of the Work in the Adaptation (e.g., "French translation of the Work by Original Author," or "Screenplay based on original Work by Original Author"). The credit required by this Section 4(c) may be implemented in any reasonable manner; provided, however, that in the case of a Adaptation or Collection, at a minimum such credit will appear, if a credit for all contributing authors of the Adaptation or Collection appears, then as part of these credits and in a manner at least as prominent as the credits for the other contributing authors. For the avoidance of doubt, You may only use the credit required by this Section for the purpose of attribution in the manner set out above and, by exercising Your rights under this License, You may not implicitly or explicitly assert or imply any connection with, sponsorship or endorsement by the Original Author, Licensor and/or Attribution Parties, as appropriate, of You or Your use of the Work, without the separate, express prior written permission of the Original Author, Licensor and/or Attribution Parties.
-
-For the avoidance of doubt:
-
-Non-waivable Compulsory License Schemes . In those jurisdictions in which the right to collect royalties through any statutory or compulsory licensing scheme cannot be waived, the Licensor reserves the exclusive right to collect such royalties for any exercise by You of the rights granted under this License;
-
-Waivable Compulsory License Schemes . In those jurisdictions in which the right to collect royalties through any statutory or compulsory licensing scheme can be waived, the Licensor reserves the exclusive right to collect such royalties for any exercise by You of the rights granted under this License if Your exercise of such rights is for a purpose or use which is otherwise than noncommercial as permitted under Section 4(c) , and otherwise waives the right to collect royalties through any statutory or compulsory licensing scheme; and,
-
-Voluntary License Schemes . The Licensor reserves the right to collect royalties, whether individually or, in the event that the Licensor is a member of a collecting society that administers voluntary licensing schemes, via that society, from any exercise by You of the rights granted under this License that is for a purpose or use which is otherwise than noncommercial as permitted under Section 4(c) , .
-
-Except as otherwise agreed in writing by the Licensor or as may be otherwise permitted by applicable law, if You Reproduce, Distribute or Publicly Perform the Work either by itself or as part of any Adaptations or Collections, You must not distort, mutilate, modify or take other derogatory action in relation to the Work which would be prejudicial to the Original Author's honor or reputation. Licensor agrees that in those jurisdictions (e.g. Japan), in which any exercise of the right granted in Section 3(b) of this License (the right to make Adaptations) would be deemed to be a distortion, mutilation, modification or other derogatory action prejudicial to the Original Author's honor and reputation, the Licensor will waive or not assert, as appropriate, this Section, to the fullest extent permitted by the applicable national law, to enable You to reasonably exercise Your right under Section 3(b) of this License (right to make Adaptations) but not otherwise.
-
-5. Representations, Warranties and Disclaimer
-
-UNLESS OTHERWISE MUTUALLY AGREED TO BY THE PARTIES IN WRITING AND TO THE FULLEST EXTENT PERMITTED BY APPLICABLE LAW, LICENSOR OFFERS THE WORK AS-IS AND MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE WORK, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS, WHETHER OR NOT DISCOVERABLE. SOME JURISDICTIONS DO NOT ALLOW THE EXCLUSION OF IMPLIED WARRANTIES, SO THIS EXCLUSION MAY NOT APPLY TO YOU.
-
-6. Limitation on Liability.
-
-EXCEPT TO THE EXTENT REQUIRED BY APPLICABLE LAW, IN NO EVENT WILL LICENSOR BE LIABLE TO YOU ON ANY LEGAL THEORY FOR ANY SPECIAL, INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES ARISING OUT OF THIS LICENSE OR THE USE OF THE WORK, EVEN IF LICENSOR HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
-
-7. Termination
-
-This License and the rights granted hereunder will terminate automatically upon any breach by You of the terms of this License. Individuals or entities who have received Adaptations or Collections from You under this License, however, will not have their licenses terminated provided such individuals or entities remain in full compliance with those licenses. Sections 1, 2, 5, 6, 7, and 8 will survive any termination of this License.
-Subject to the above terms and conditions, the license granted here is perpetual (for the duration of the applicable copyright in the Work). Notwithstanding the above, Licensor reserves the right to release the Work under different license terms or to stop distributing the Work at any time; provided, however that any such election will not serve to withdraw this License (or any other license that has been, or is required to be, granted under the terms of this License), and this License will continue in full force and effect unless terminated as stated above.
-8. Miscellaneous
-
-Each time You Distribute or Publicly Perform the Work or a Collection, the Licensor offers to the recipient a license to the Work on the same terms and conditions as the license granted to You under this License.
-Each time You Distribute or Publicly Perform an Adaptation, Licensor offers to the recipient a license to the original Work on the same terms and conditions as the license granted to You under this License.
-If any provision of this License is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this License, and without further action by the parties to this agreement, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable.
-No term or provision of this License shall be deemed waived and no breach consented to unless such waiver or consent shall be in writing and signed by the party to be charged with such waiver or consent.
-This License constitutes the entire agreement between the parties with respect to the Work licensed here. There are no understandings, agreements or representations with respect to the Work not specified here. Licensor shall not be bound by any additional provisions that may appear in any communication from You. This License may not be modified without the mutual written agreement of the Licensor and You.
-The rights granted under, and the subject matter referenced, in this License were drafted utilizing the terminology of the Berne Convention for the Protection of Literary and Artistic Works (as amended on September 28, 1979), the Rome Convention of 1961, the WIPO Copyright Treaty of 1996, the WIPO Performances and Phonograms Treaty of 1996 and the Universal Copyright Convention (as revised on July 24, 1971). These rights and subject matter take effect in the relevant jurisdiction in which the License terms are sought to be enforced according to the corresponding provisions of the implementation of those treaty provisions in the applicable national law. If the standard suite of rights granted under applicable copyright law includes additional rights not granted under this License, such additional rights are deemed to be included in the License; this License is not intended to restrict the license of any rights under applicable law.