[swift-evolution] Variadic generics discussion

Joe Groff jgroff at apple.com
Wed Jun 1 08:18:59 CDT 2016

> On May 31, 2016, at 6:49 PM, Austin Zheng <austinzheng at gmail.com> wrote:
> I agree that this is a better design for Swift than the monstrosity I started out with.
> The "biggest" technical challenge I see is being able to type a reduction sort of operator on a heterogenous tuple based on on whatever protocols and constraints are common to its constituent members. For example:
> // Every Tn in T... is Fooable and Barrable
> let x : (T...)
> reduce(x, reducer, startingValue)
> func reducer<X : ???>(startingValue: U, eachMemberOfT: X) -> U { ... }
> How do we bound ??? such that 'reducer' is useful while still being statically type sound? Honestly, that's the most interesting question to me. Generalized existentials might help with that.

If every T is Fooable and Barrable, couldn't `eachMemberOfT` be (inout U, protocol<Fooable, Barrable>) -> ()?

> Other questions (inherent to any proposal) would be:
> - How do we resolve the impedance mismatch between tuples and function argument lists? Is it even worth trying to resolve this mismatch, given that argument lists are intentionally not intended to mirror tuples?

The impedance mismatch between function arguments and tuples is superficial. You ought to be able to splat and bind tuples into function arguments, e.g.:

	let args = (1, 2)

	func variadicFn<T: Runcible...>(_ args: T...) { ... }

> - As you said, how do variadic generics work in the 0- and 1-member cases?

What problem are you referring to?


More information about the swift-evolution mailing list