pytrilogy 0.0.3.83__tar.gz → 0.0.3.84__tar.gz

{pytrilogy-0.0.3.83/pytrilogy.egg-info → pytrilogy-0.0.3.84}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pytrilogy
-Version: 0.0.3.83
+Version: 0.0.3.84
 Summary: Declarative, typed query language that compiles to SQL.
 Home-page: 
 Author: 

{pytrilogy-0.0.3.83 → pytrilogy-0.0.3.84/pytrilogy.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pytrilogy
-Version: 0.0.3.83
+Version: 0.0.3.84
 Summary: Declarative, typed query language that compiles to SQL.
 Home-page: 
 Author: 

{pytrilogy-0.0.3.83 → pytrilogy-0.0.3.84}/trilogy/__init__.py

@@ -4,6 +4,6 @@ from trilogy.dialect.enums import Dialects
 from trilogy.executor import Executor
 from trilogy.parser import parse
 
-__version__ = "0.0.3.83"
+__version__ = "0.0.3.84"
 
 __all__ = ["parse", "Executor", "Dialects", "Environment", "CONFIG"]

{pytrilogy-0.0.3.83 → pytrilogy-0.0.3.84}/trilogy/core/processing/node_generators/node_merge_node.py

@@ -104,16 +104,16 @@ def determine_induced_minimal_nodes(
             if filter_downstream and lookup.derivation not in (Derivation.ROOT,):
                 nodes_to_remove.append(node)
     if nodes_to_remove:
-        logger.debug(f"Removing nodes {nodes_to_remove} from graph")
+        # logger.debug(f"Removing nodes {nodes_to_remove} from graph")
         H.remove_nodes_from(nodes_to_remove)
     isolates = list(nx.isolates(H))
     if isolates:
-        logger.debug(f"Removing isolates {isolates} from graph")
+        # logger.debug(f"Removing isolates {isolates} from graph")
         H.remove_nodes_from(isolates)
 
     zero_out = list(x for x in H.nodes if G.out_degree(x) == 0 and x not in nodelist)
     while zero_out:
-        logger.debug(f"Removing zero out nodes {zero_out} from graph")
+        # logger.debug(f"Removing zero out nodes {zero_out} from graph")
         H.remove_nodes_from(zero_out)
         zero_out = list(
             x for x in H.nodes if G.out_degree(x) == 0 and x not in nodelist
@@ -128,7 +128,7 @@ def determine_induced_minimal_nodes(
     if path_removals:
         logger.debug(f"Removing paths {path_removals} from graph")
         H.remove_nodes_from(path_removals)
-    logger.debug(f"Graph after path removal {H.nodes}")
+    # logger.debug(f"Graph after path removal {H.nodes}")
     sG: nx.Graph = ax.steinertree.steiner_tree(H, nodelist).copy()
     if not sG.nodes:
         logger.debug(f"No Steiner tree found for nodes {nodelist}")

{pytrilogy-0.0.3.83 → pytrilogy-0.0.3.84}/trilogy/core/processing/utility.py

@@ -169,9 +169,9 @@ def resolve_join_order_v2(
                 right_is_nullable = any(
                     key in nullables.get(right, []) for key in common
                 )
-                if left_is_partial:
+                if left_is_partial or right_is_nullable:
                     join_type = JoinType.FULL
-                elif right_is_partial or right_is_nullable:
+                elif right_is_partial:
                     join_type = JoinType.LEFT_OUTER
                 # we can't inner join if the left was an outer join
                 else: