com.stripe.dagon
This represents literal expressions (no variable redirection) of container nodes of type N[T]
Here we memoize as we check equality and always check reference equality first.
Here we memoize as we check equality and always check reference equality first. This can dramatically improve performance on graphs that merge back often
This represents literal expressions (no variable redirection) of container nodes of type N[T]