from .helper_functions import generate_dim_variables, parse_expr, getIndexTensorAlongDim, as_tensor, prepare_inputs, make_zero_like, normalize_to_common_shape, checkLazyNew from .Parser.UnifiedMathVisitor import UnifiedMathVisitor from comfy_api.latest import io from .Stack import MrmthStack from .ParseTree import MrmthParseTree import copy class SigmasMathNode(io.ComfyNode): """ Enables math expressions on Images with autogrow support. Inputs: I: Autogrow image inputs (I0, I1, ...) F: Autogrow float inputs (F0, F1, ...) Image: Expression """ @classmethod def define_schema(cls) -> io.Schema: return io.Schema( node_id="mrmth_ag_SigmasMathNode", category="More math", display_name="Sigmas math", inputs=[ io.Autogrow.Input(id="V",template=io.Autogrow.TemplatePrefix(io.Sigmas.Input("values"), prefix="V", min=1, max=50)), io.Autogrow.Input(id="F", template=io.Autogrow.TemplatePrefix(io.Float.Input("float", default=0.0, optional=True, lazy=True, force_input=True), prefix="F", min=1, max=50)), io.MultiType.Input( io.String.Input("Expression", default="I0*(1-F0)+I1*F0", multiline=False), types=[io.String,MrmthParseTree], tooltip="Expression to apply on input images", ), io.Combo.Input( id="length_mismatch", options=["do nothing","error","tile", "pad"], display_name="on size mismatch", default="error", tooltip="How to handle mismatched image batch sizes. tile: repeat shorter inputs; error: raise error on mismatch; pad: treat missing frames as zero." ), MrmthStack.Input(id="stack", tooltip="Access stack between nodes",optional=True) ], outputs=[ io.Sigmas.Output(), MrmthStack.Output(), ], ) @classmethod def check_lazy_status(cls, Expression, V, F, length_mismatch="tile",stack={}): return checkLazyNew(Expression,V,F) @classmethod def execute(cls, V, F, Expression, length_mismatch="tile",stack={}): # I and F are Autogrow.Type which is dict[str, Any] # Determine reference image for zero-initialization (fallback for a,b,c,d) ref_image = None for img in V.values(): if img is not None: ref_image = img break if ref_image is None: raise ValueError("At least one input is required.") stack = copy.deepcopy(stack) if stack is not None else {} a = V.get("V0") b = V.get("V1") c = V.get("V2") d = V.get("V3") if a is None: a = make_zero_like(ref_image) ae, be, ce, de = prepare_inputs(a, b, c, d) ae, be, ce, de = normalize_to_common_shape(ae, be, ce, de, mode=length_mismatch) if(length_mismatch == "error"): max_length = ae.shape[0] for name, tensor in V.items(): if tensor is not None and tensor.shape[0] != max_length: raise ValueError(f"Input '{name}' has shape {tensor.shape[0]}, expected {max_length} to match largest input.") variables = { "a": ae, "b": be, "c": ce, "d": de, "w": F.get("F0", 0.0) if F.get("F0") is not None else 0.0, "x": F.get("F1", 0.0) if F.get("F1") is not None else 0.0, "y": F.get("F2", 0.0) if F.get("F2") is not None else 0.0, "z": F.get("F3", 0.0) if F.get("F3") is not None else 0.0, "B": getIndexTensorAlongDim(ae, 0), "batch": getIndexTensorAlongDim(ae, 0), "T": ae.shape[0], "batch_count": ae.shape[0], } | generate_dim_variables(ae) # Add all dynamic inputs for k, v in V.items(): if v is not None: # Normalize all images in I to match ae.shape norm_v = normalize_to_common_shape(ae, v, mode=length_mismatch)[1] variables[k] = norm_v for k, v in F.items(): variables[k] = v if v is not None else 0.0 tree = None if isinstance(Expression,str): tree = parse_expr(Expression) else: tree = Expression visitor = UnifiedMathVisitor(variables, ae.shape,ae.device,state_storage=stack) result = visitor.visit(tree) result = as_tensor(result, ae.shape) return (result,stack)