`UnionToUnorderedTuple` type

[sindresorhus]

`UnionToUnorderedTuple` type

[voxpelli]

We basically want to do what's described here, right? https://stackoverflow.com/a/55128956

Any other techniques?

[voxpelli]

Basically:

1. Convert union values to return values of functions
2. UnionToIntersection to make it an intersection
3. Intersection will be treated as a function overload from which the base return value (the last one in the original union) can be easily extracted
4. Add that extracted last value to the the tuple result we want
5. Repeat everything again with the remaining values that has not yet been extracted, adding one more item to the tuple for every iteration