Cover image for Rust, Iterators, and Skill Regression

Rust, Iterators, and Skill Regression

rpalo profile image Ryan Palo Originally published at assertnotmagic.com ・4 min read

Cover image by Matthew Henry on Unsplash.

Our dog training instructor taught us that a situation becomes harder for a dog to handle—based on the 3 D’s: distance from you, distraction, and duration of the activity. As you increase any of these three D’s, those high-level skills that you’ve worked on so hard with your pet become harder, and when they become too hard to manage, they regress to an easier level of skill. If they can’t heel, maybe they can handle sit. And if they can’t handle sit, maybe they can handle look at me or, at the very least, find the treat I’m throwing.

This seems like about how my brain handles problems in code. Except, instead of the 3 D’s, I have the 3 L’s: language, logic, and level of focus. If I’m working in a language I’m super comfortable in, the logic of what I’m trying to do is straightforward, and I’ve had adequate food/sleep/coffee/quiet/non-anxiety, I’m pretty proud of the fact that I can come up with some pretty, readable, idiomatic code. However, when working in a language I’m not as familiar with, the logic of something is a little more complex, or I’m beyond the point of focus no-return, I regress to simpler, easier to process skills.


return [value*2 for value in values]


result = []
for value in values:
    result.append(value * 2)


result = []
for i in range(len(values)):
    result.append(values[i] * 2)

And that’s usually how the progression goes:

  1. Do I know a slick language-specific trick/builtin/standard library module that could solve my problem succinctly and clearly?
  2. Do I know a 3rd party library that can do what I want (and am I OK with the cost of importing/installing/using that library)?
  3. Fine. We’ll do it the hard way. I’ll just for-loop through all the values.
  4. OK, that’s not working or too complicated. I’ll add some more helper variables and make my loop more verbose, but simpler on each line.
  5. OK, you know what? Screw it. I’m going nuclear and resorting to integer indexing.

Invariably, as I wallow further and further from my comfort zone, I end up looping over collections by indices. Why? Because it’s usually pretty much consistent behavior in all languages, it works, and it’s not that bug-prone and hard to read (or, at least, that’s what I convince myself when I’m in this deep, dark place).

So, that’s why, anytime I can find my way back up the ladder, it feels really good and means I’m learning something good. That happened to me yesterday. Here’s the problem I was trying to solve (a smaller sub-problem in the main problem):

Decide whether or not a string has a set of double-letters (e.g. ll, rr, aa, ee).

Seems simple enough. I just want to compare each consecutive pair! But I was a little tired, and I was working in Rust, which I’m still learning the ins and outs of—especially in terms of writing idiomatic code. I started right at the bottom of the ladder… indices:

fn has_double(s: &str) -> bool {
    for i in 0..s.len() {
        if i == s.len() - 1 {
            return false;
        if s[i] == s[i + 1] {
            return true;


Not pretty. I know. Also, it doesn’t work.

That’s right! Due to the fact that Rust handles strings responsibly, it’s unfortunately and frustratingly hard to index to a single character in the middle of a raw string. For UTF-8/ASCII/encoding reasons. This is actually a good and responsible thing. But it means my code doesn’t work.

And then, as careened around my search engine, opening tabs left and right, searching for some sort of an answer, something showed up on an otherwise unrelated thread that made everything clearer like someone had lifted a curtain: iterators.

And my Python brain fired and connected to my dumb little Rust brain (with maybe a little help from my existing-but-out-of-shape Ruby brain) and the gears meshed, and I came up with:

fn has_double(s: &str) -> bool {
        .any(|(a, b)| a == b)

Yes! Anytime you can iterate on items and not indices, it’s almost always cleaner and less error prone. In this case I’m making use of four fabulous iterator methods:

  1. chars: Turns a string into an iterator of its characters.
  2. zip: iterates over two or more iterators in parallel. Almost always the right choice when trying to go through multiple collections or views of the same collection at the same time. It stops when any collection runs out, which helps us avoid index errors and off-by-ones.
  3. skip: skips our iterator forward one item so that it is ahead of the other one. This, coupled with the “stop-on-shortest” behavior of zip gives us exactly what we need.
  4. any: searches the iterator for any instance of a case that would cause its lambda/anonymous function argument to return true. Short circuits if it finds a true, because it’s extra awesome.

So, when I run this on the string "banana":

# => false

but when I run it on "apple":

# => true

and my faith is restored in humanity, myself, and that I’m actually learning some Rust as I’m writing this code. I’m happy that Rust is a lot like Python in this respect.

If you’re trying to iterate using indices, you’re probably not doing it the Rusty way. There’s probably a better way, and it’s probably a slick combination of shwoopy iterator methods.

Posted on by:

rpalo profile

Ryan Palo


Ryan is an engineer in the Sacramento Area with a focus in Python, Ruby, and Rust. Bash/Python Exercism mentor. Coding, physics, calculus, music, woodworking. Message me on DEV!


markdown guide

Last week I was fucked up, I need to tear down some connection in Python and this is what spawned out of my normal functional programming brain:

map(teardown, connections)

My code didn't work, and I spent 1 hour to realize the teardown function never run. I end up with:

for damn in map(teardown, connections):

In python3, map returns an iterator and functions inside never run until being iterated on. In my opinion, this is inconsistent behavior: Python is sync by default, so map should be sync, asynchronous map should be mapAsync or be imported from asyncio. Why makes such simple thing so surprising?


Well in general, I would say that in Python at least, you should probably almost never need the map function. If you’re using map, you probably want a for loop or a list comprehension. Especially if you’re not using the result of the teardown function, it probably ought to be:

for connection in connections:

What do you think?


Thank you, I knew it and did it since the first days I learn programming. It's more a matter of preference, the functional programming way seems more natural and straightforward to me.

IFAIK, FP isn't a recommended paradigm in Python, even Guido has said he wants to remove map, reduce and filter. Now I think he's right, anyone wishes for FP favor should use a third party module rather than rely on the standard library.


A better name for this behaviour would be lazy instead of asynchronous.

An async operation generally means stuff happening "behind the scenes/at the same time", while a lazy operation delivers results "on demand", which is the case for the iterators.


Yeah, lazy evaluation in contrast to eager evaluation.

Thank you!

fn has_double(s: &str) -> bool {
        .any(|(a, b)| a == b)

This is so much clearer! Great article!

BTW in Python this is how I'd do it:

import operator

def has_double(s):
    return any(operator.eq(a, b) for a, b in zip(s, s[1:]))

if __name__ == '__main__':
    print(f"banana: {has_double('banana')}")
    print(f"apple: {has_double('apple')}")

Just my 50 cents, there's indeed a 3rd party library for things like that:

use itertools::Itertools;

fn has_double(s: &str) -> bool {
    s.chars().tuple_windows().any(|(a, b)| a == b)

Here's this code in playground


Good to know, thank you!


Oooh that’s awesome! I’ll have to look closer at slice methods. Thanks!