-
Notifications
You must be signed in to change notification settings - Fork 22
Description
Proposal
Problem statement
It is often useful to clamp a calculated index to be within the bounds of a slice or array.
Motivating examples or use cases
Take up to the first few elements of a list: x.get_clamped(..5)
.
Get the second element in a list, or the first element if there are no elements: x.get_clamped(2)
.
Solution sketch
impl<T> [T] {
pub fn get_clamped<I>(&self, index: I) -> Option<&I::Output>
where
I: SliceIndex<Self>;
pub fn get_clamped_mut<I>(&mut self, index: I) -> Option<&mut I::Output>
where
I: SliceIndex<Self>
}
This would require adding a clamp
method to SliceIndex
, but that should be fine since its a sealed trait.
These functions would only return None
if the slice was empty.
Alternatives
- Allow
get_clamped
to be called withisize
and ranges ofisize
, so it can handle the wraparound case too (although using Saturating for calulations would probably be more robust, asisize
would still be susceptible to overflow in extreme cases) - This can be written using
clamp
(ormin
) andget
, but doing so requires listing the name of the slice variable twice, and if you're working with mutable slices, the length would need to be stored in a temporary due to aliasing rules. This is all made worse if you're taking an existing range as a parameter, as you would need to deconstruct then reconstruct that range.
Links and related work
What happens now?
This issue contains an API change proposal (or ACP) and is part of the libs-api team feature lifecycle. Once this issue is filed, the libs-api team will review open proposals as capability becomes available. Current response times do not have a clear estimate, but may be up to several months.
Possible responses
The libs team may respond in various different ways. First, the team will consider the problem (this doesn't require any concrete solution or alternatives to have been proposed):
- We think this problem seems worth solving, and the standard library might be the right place to solve it.
- We think that this probably doesn't belong in the standard library.
Second, if there's a concrete solution:
- We think this specific solution looks roughly right, approved, you or someone else should implement this. (Further review will still happen on the subsequent implementation PR.)
- We're not sure this is the right solution, and the alternatives or other materials don't give us enough information to be sure about that. Here are some questions we have that aren't answered, or rough ideas about alternatives we'd want to see discussed.