Check if all elements in vector fall within specified range

Question

I have x_min and x_max, both i16 and x_coordinates, which is a Vec<i16>. Now, I want to check whether every x_coordinate lies between x_min and x_max.

I came up with the following solution, which does indeed work, I think.

!x_coordinates.iter().map(|x| (x_min..=x_max).contains(&x)).collect::<Vec<bool>>().contains(&false)

But this does O(n) passes thrice before giving an answer. Is there a way to short-circuit the Iterator as soon as it finds something that returns a falsey condition?

Note that this code only goes through the data twice not three times: once for the collect and once for the final contains. (x_min..=x_max).contains (&x) is O(1) and the other operations are all lazy. — Jmb
– Jmb, Commented Jun 23 at 18:33

Naitik Mundra · Accepted Answer · 2025-06-23 13:13:53Z

3

Thanks to Chayim in the comments, I have now a better solution:

x_coordinates.iter().all(|x| (x_min..=x_max).contains(&x))

answered Jun 23 at 13:13

Naitik Mundra

5025 silver badges20 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

Chayim Friedman Jun 23 at 13:23

I mean, even a for loop will do. all() is just nicer and shorter.

Naitik Mundra Jun 24 at 7:45

Of course, it is just I prefer solutions which are more functional in style.

Collectives™ on Stack Overflow

Check if all elements in vector fall within specified range

1 Answer 1

2 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

2 Comments

Your Answer

Sign up or log in

Post as a guest

Related