4 ms·
I wasn't talking about recursion but composition. Can I write template A and then apply it to itself to get template B and then apply that onto template C to ge
by valenterry 4y ago
I wasn't talking about recursion but composition. Can I write template A and then apply it to itself to get template B and then apply that onto template C to get template D.
- WalterBright 4y agoYes.
- valenterry 4y agoI can't quite wrap my head around how that would work, but I'll trust you and then take my original claim back!
- he_the_great 4y agoauto alist = [1, 3, 2]; alist .sort .map!(x => x * x) .map!(x => x - x/2) .map!(x => x + 1); This seems like what you're asking. Each of those is a template. And while this is all logic code, D has inferred the type aka: SortedRange!Map!Map!Map With some details removed.