this post was submitted on 14 Feb 2024
534 points (96.7% liked)

Programmer Humor

27175 readers
2073 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 2 years ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev
534
??? (lemm.ee)
submitted 2 years ago* (last edited 1 year ago) by YIj54yALOJxEsY20eU@lemm.ee to c/programmer_humor@programming.dev
75 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] anton@lemmy.blahaj.zone 1 points 2 years ago (1 children)

You can't random-access an iterator and use it again later.

If your specific use case really needs random access to a list while lazy computing the elements just wrap them in Lazy and put them in a vector.

Can Rust compute the value of calling a function an infinite number of times?

The return type of an infinitely recursive function / infinite loops is ⊥, a type that by definition has no values. (Known in rust as !)

[–] PoolloverNathan@programming.dev 1 points 2 years ago

Haskell lets you infinitely recurse while still completing in finite time, and there's even a function (fix) for that. Doing e.g. fix (+ 2) would be an infinite loop if evaluated, yes, but fix (2 :) would give you a useful value that's an infinite stream of 2s. (it's also useful for other things too)