mloda 0.3.2__py3-none-any.whl → 0.3.3__py3-none-any.whl

{mloda-0.3.2.dist-info → mloda-0.3.3.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: mloda
-Version: 0.3.2
+Version: 0.3.3
 Summary: Rethinking Data and Feature Engineering
 Author-email: Tom Kaltofen <info@mloda.ai>
 License: Apache-2.0

{mloda-0.3.2.dist-info → mloda-0.3.3.dist-info}/RECORD

@@ -1,5 +1,5 @@
-mloda-0.3.2.dist-info/licenses/LICENSE.TXT,sha256=gmhQwSkHxjiShsqQ1FpJ-20YFtaa4vRCE7aCx55-6nk,11366
-mloda-0.3.2.dist-info/licenses/NOTICE.md,sha256=Hu10B2sPnGLIHxZ4QhACSLLxukJpeJzjvkzCu48q5fY,520
+mloda-0.3.3.dist-info/licenses/LICENSE.TXT,sha256=gmhQwSkHxjiShsqQ1FpJ-20YFtaa4vRCE7aCx55-6nk,11366
+mloda-0.3.3.dist-info/licenses/NOTICE.md,sha256=Hu10B2sPnGLIHxZ4QhACSLLxukJpeJzjvkzCu48q5fY,520
 mloda_core/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 mloda_core/abstract_plugins/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 mloda_core/abstract_plugins/abstract_feature_group.py,sha256=I3fVEULHUtrvPoc94iyxyBQVacD7GGI5piqJ6FoqgAY,18435
@@ -70,7 +70,7 @@ mloda_core/prepare/identify_feature_group.py,sha256=U0oFNVrR1pN7MAQVfXZ8rP-SKuCr
 mloda_core/prepare/joinstep_collection.py,sha256=_uy4NdWdFCR30K-p_pUgaF9Zn2l-7cdwM6_jM2zzE-M,1464
 mloda_core/prepare/resolve_compute_frameworks.py,sha256=NA1VdilKsLOnfo0CXpgR2qUiogFEVBMdkupsXQwjyPs,6347
 mloda_core/prepare/resolve_graph.py,sha256=i79p3OOSBqlRC-XzQYM2Bm-tNWy3CJU5d7SQbFxOLVU,3576
-mloda_core/prepare/resolve_links.py,sha256=JqoMzIzGhPmwmQk4tvOW083X333A0zoBWqDtSme3rz8,15405
+mloda_core/prepare/resolve_links.py,sha256=Hx5bRZLstQiEEVS1sqHTbftfrtMIdgXXaOlYmqhCwN8,15919
 mloda_core/prepare/graph/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 mloda_core/prepare/graph/build_graph.py,sha256=Ex2nFaCv1WRY2xO18_Zt0IsoRfj5xZMBXvS-sPcOTb8,2209
 mloda_core/prepare/graph/graph.py,sha256=nhtVkT1Hg9oZff_QSk9J17KQKn0Zh4AC69p_1aHAjA0,3818
@@ -223,8 +223,8 @@ mloda_plugins/function_extender/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm
 mloda_plugins/function_extender/base_implementations/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 mloda_plugins/function_extender/base_implementations/otel/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 mloda_plugins/function_extender/base_implementations/otel/otel_extender.py,sha256=qY-oBOh6UUDtkUzGJjzC2dT3KKxyvt3sgwXJH2lWLYY,743
-mloda-0.3.2.dist-info/METADATA,sha256=U_SIP63u-GoR9fAKLbmJmB4cGcu0CzGdgP_whLt--bE,16633
-mloda-0.3.2.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-mloda-0.3.2.dist-info/entry_points.txt,sha256=f7hp7s4laABj9eN5YwEjQAyInF-fa687MXdz-hKYMIA,80
-mloda-0.3.2.dist-info/top_level.txt,sha256=KScNbTs4_vV-mJ1pIlP6cyvMl611B3hNxVYj2hA0Ex4,25
-mloda-0.3.2.dist-info/RECORD,,
+mloda-0.3.3.dist-info/METADATA,sha256=me70MqVWqB-0q7ycZHD5CPqxP680TvWCwsKyu0E34nA,16633
+mloda-0.3.3.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+mloda-0.3.3.dist-info/entry_points.txt,sha256=f7hp7s4laABj9eN5YwEjQAyInF-fa687MXdz-hKYMIA,80
+mloda-0.3.3.dist-info/top_level.txt,sha256=KScNbTs4_vV-mJ1pIlP6cyvMl611B3hNxVYj2hA0Ex4,25
+mloda-0.3.3.dist-info/RECORD,,

mloda_core/prepare/resolve_links.py

@@ -327,26 +327,37 @@ class ResolveLinks:
     def _select_most_specific_links(self, links: List[Link], left_fg: type, right_fg: type) -> List[Link]:
         """Select links that are most specific (closest in inheritance hierarchy).
 
-        For each link, calculates the inheritance distance on both sides.
-        Only considers links where both sides have the same inheritance distance
-        (to avoid sibling mismatches). Returns links with the minimum distance.
+        For self-joins, requires balanced inheritance distance to prevent sibling mismatches.
+        For non-self-joins with unrelated classes, accepts asymmetric polymorphic+exact matches.
         """
         if not links:
             return []
 
-        # Calculate distance for each link, filtering out unbalanced matches
         link_distances: List[Tuple[Link, int]] = []
         for link in links:
             left_dist = self._inheritance_distance(left_fg, link.left_feature_group)
             right_dist = self._inheritance_distance(right_fg, link.right_feature_group)
 
-            # Only consider links where both sides have the same inheritance level
-            # This prevents sibling class mismatches for self-join patterns
             link_is_self_join = link.left_feature_group == link.right_feature_group
-            # For self-joins: require same concrete class to prevent sibling mismatches
-            # For different-class joins: balanced distance is sufficient
-            if left_dist == right_dist and (not link_is_self_join or left_fg == right_fg):
+
+            if link_is_self_join:
+                # For self-joins: require same concrete class and balanced inheritance
+                if left_fg == right_fg and left_dist == right_dist:
+                    link_distances.append((link, left_dist))
+            elif left_dist == right_dist:
+                # Balanced match (both exact or both polymorphic at same level)
                 link_distances.append((link, left_dist))
+            else:
+                # Check if asymmetric match is allowed
+                # Only allow when one side is exact (distance 0) AND
+                # the Link's classes are not related by inheritance
+                # (to prevent sibling class mismatches)
+                link_classes_related = issubclass(link.left_feature_group, link.right_feature_group) or issubclass(
+                    link.right_feature_group, link.left_feature_group
+                )
+                if not link_classes_related and (left_dist == 0 or right_dist == 0):
+                    max_dist = max(left_dist, right_dist)
+                    link_distances.append((link, max_dist))
 
         if not link_distances:
             return []