Proposal: Python's list, generator, and dictionary comprehensions

[Gerzer (Gabriel Jacoby-Cooper)]

Or…

import Algorithms

_ = Dictionary(
    uniqueKeysWithValues: inputWords
        .indexed()
        .lazy
        .map(reverse)
)

[tevamerlin]

@Gerzer

I still think that input_token_map = {word: index for index, word in enumerate(input_words)} is both more efficient (conceptually, not computationally) and, indeed, more readable than either of your reduce(into:_:) suggestions.

I’m used to both and yet I still have a preference for the reduce-based approach. I guess it comes from the left-to-right ordering of this approach, or the fact that the action producing the result (reduce) is more explicitly stated.
Anyway, my point was not based on this preference, but just on the existence of this approach.

It sounds like you don’t think that the added benefits of comprehensions are sufficient to warrant introducing new syntax.

Indeed. My point was that since Swift already provides ways to write compact code similar to what comprehensions would allow, I don’t think it is worth adding the complexity of a new syntax, whose main benefit would only be its familiarity to Python users.

But of course, that’s just the opinion of one Swift user, with no weight in the evolution process.