Re:Nim 2.0 thoughts
by xigoi on Saturday May 15, 2021 @11:35AM
(#27166134)
The equivalent in Python would be:
I don't really find that less verbose, in terms of brackets and symbols…
[ Parent
| on HN ]
Yeah, I guess you're right.
Does Nim have comprehensions? Even if you're striving for equivalent signatures the inner body of the function can be expressed as a comprehension in Python:
T = TypeVar("T")
def odd_numbers(a: Iterable[T]) -> Iterator[T]:
yield from (n for n in a if n % 2 == 1)
Re:Nim 2.0 thoughts
by michaelsbradley on Saturday May 15, 2021 @02:18PM
(#27167568)
I think the "full" version is easier to read:
T = TypeVar("T")
def odd_numbers(nums: Iterable[T]) -> Iterator[T]:
for n in nums:
if n % 2 == 1:
yield n
Although yet another option is to just return the generator instead of immediately yielding from it: T = TypeVar("T")
def odd_numbers(nums: Iterable[T]) -> Iterator[T]:
return (n for n in a if n % 2 == 1)Unfortunately, Nim doesn't have `yield from`, which would make a comprehension useless here. That's one of the things I'm missing in the language.
That's an obscure/not optimal way to write this code though. I mean why would you use LIST comprehension if you are going to yield each element.