GitHub user skrawcz edited a comment on the discussion: APIs for updating underlying function of a node (2 part question)
thanks. Not sure I fully grok (2) yet, but just to mention Hamilton's main design principle is static-ness. Why? because it's easier to debug; sure it's more verbose, but it's explicit and you're more likely to understand someone else's code. Now I think there could be something here to help support a graph transform to functionally get what you want.. But I'd argue: 1. the Ds are not the same on the right. They are a function of their inputs and thus their result is different. 2. So from a debugging and understanding standpoint, if they are to be executed together then they are separate nodes IMO. 3. Which in Hamilton requires you to create the graph on the right -- you can reuse logic, but structurally you need to declare the right. That said, applying some transform from left to right that doesn't seem un-reasonable. So this is where your input and ideas would be needed. I see you did already mention some APIs (thanks!) -- some questions that come to mind: 1. is this for quick ad-hoc stuff? 2. or structurally you want to swap things like this out in "production"? 3. or? GitHub link: https://github.com/apache/hamilton/discussions/1397#discussioncomment-14570575 ---- This is an automatically sent email for [email protected]. To unsubscribe, please send an email to: [email protected]
