I’ve seen that a new “range-over-func” experiment is available with Go 1.22. In this article, I took a closer look and evaluated the feature for myself.

  • nemith@programming.dev
    link
    fedilink
    arrow-up
    0
    ·
    5 months ago

    Article is missing a lot of keys points. With iterator you can chain them together to provide even higher level abstractions.

    There are plenty of containers (new maps with different algorithms like a BtreeMap, linked lists, etc) that now with generics could also use a generic way of iterating over them.

    There was a pre-proposal discussion that went into a lot of detail of what is possible that wasn’t intended the release notes. I highly suggest the writer of this article dig much deeper into more benefits of iterators than the two trivial options that were included in the experiment description.

    • codesoap@feddit.deOP
      link
      fedilink
      arrow-up
      0
      arrow-down
      1
      ·
      5 months ago

      Thanks for sharing your opinion with me!

      What I’m hearing is basically “you don’t understand the real benefits, so your not qualified to judge the proposal”. I find this attitude quite harmful. If you think, I’m missing something important, please tell me about it. You will only convince me with arguments, not by patronizing me. Could you at least link the mentioned discussion?

      There are plenty of containers […] could also use a generic way of iterating over them.

      To me, it seemed intended, that Go only has two first-level containers (slices and maps). It forces a certain amount of “uniformity” by giving other containers a disadvantage. Of course, in some scenarios you really need a different container and it will be more cumbersome to use, but it is by no means impossible without range-over-func.