On Sat, Dec 31, 2016 at 1:55 PM, Robert Widmann <devteam.cod...@gmail.com> wrote:
> > As for why this works with non-chained binops no simplification occurs in > that case because, well, there’s no chain here. The solver walks each part > in turn instead. > What do you mean by this? The LinkedExprAnalyzer is still used in the "x! + x!" case. Maybe I just haven't followed the execution quite far enough to see why the current behavior doesn't cause problems. > > The walker is, I think, appropriate. It is a very domain-specific > optimization that doesn’t quite know about its entire domain yet. However, > I don’t think anyone would be opposed to a little meta-programming with an > ASTVisitor to refactor it into a more manageable form. > > ~Robert Widmann > >
_______________________________________________ swift-dev mailing list swift-dev@swift.org https://lists.swift.org/mailman/listinfo/swift-dev
