For context: I am trying to write a Rust wrapper over a C library.
Like many C libraries, most of its functions return an int. Positive return values are meaningful (provides information) and negative values are error codes.
To give an example, think of something like int get_items_from_record(const struct record *rec, struct item *items). A positive value indicates how many items were returned. -1 could mean ErrorA, -2 ErrorB, and so on.
Since this is Rust, I want to represent this kind of integer as Result<T, E>, e.g.:
enum LibError {
A = -1,
B = -2,
// ....
}
// LibResult is ideally just represented as an integer.
type LibResult = Result<NonNegativeInteger, LibError>;
// Then I can pass LibResult values back to the C code as i32 trivially.
Is there a way/crate to do this?
I think you can implement Into<i32> for Result<…, LibError>. You can also implement the branching trait of Result so ? works. I’ve done it for booleans in the past as a learning experiment.
Unfortunately on mobile so I can’t link or copy paste code but that should give you some pointers to the right doc.
This is not possible, because Rust still stores a discriminant even when the enum values don’t overlap.
As far as I can tell, the only situation where Rust doesn’t store a discriminant is when either the
OkorErrvariant is zero-sized, and the other variant has a niche. So,Result<(), ErrorEnum>can be represented as an integer, butResultcan not.You can still use enums, and implement simple conversions like this:
#[repr(i8)] pub enum Error { E1 = -1, E2 = -2, E3 = -3, E4 = -4, } #[repr(i8)] pub enum Success { S0 = 0, S1 = 1, S2 = 2, S3 = 3, } pub type LibResult = Result; pub fn number_to_result(value: i32) -> Option { match value { -4 ..= -1 => Some(Err(unsafe { std::mem::transmute(value as i8) })), 0 ..= 3 => Some(Err(unsafe { std::mem::transmute(value as i8) })), _ => return None, } } pub fn result_to_number(res: LibResult) -> i32 { match res { Ok(value) => value as i32, Err(error) => error as i32, } }P.S. Sorry that the generics aren’t displayed due to Lemmy’s bad santiziation.
Discriminant is irrelevant and you’re not supposed to fuck with it.
And there is zero reason to use unsafe/transmute for this.
pub enum LibErr { ErrX, ErrY, ErrZ, Unknown(i32), } struct RetVal(i32); impl From<RetVal> for Result<i32, LibErr> { fn from(RetVal(ret_val): RetVal) -> Self { if ret_val < 0 { match ret_val { -1 => Err(LibErr::ErrX), -2 => Err(LibErr::ErrY), -3 => Err(LibErr::ErrZ), unknown => Err(LibErr::Unknown(unknown)), } } else { Ok(ret_val) } } } // RetVal(call_function()).into()And just to explicitly point out, your code’s also better because of the use of the standard traits. It took me a while to get into the habit, but using what’s already there is always a good idea.
Discriminant is irrelevant and you’re not supposed to fuck with it
It matters because the conversion between i32 and the Result is only “free” if they have the same layout (which they do not, because of the discriminant). So a more costly conversion method is required.
And there is zero reason to use unsafe/transmute for this.
You are right, because the compiler is able to optimize your code quite well. However, if that optimization were to break at some point (as there is no guarantee that an optimization will continue to work in the future), it would become less efficient.
That seems like strong premature optimisation. Perhaps worth a note, but I’d presume the majority of people the majority of the time wouldn’t need to worry about that.
For real. Unless he’s converting between results and ints millions of times a second, I think he’s going to be just fine using the idiomatic solution. That transmute shit I’d wack lol
So what! Who cares if it’s free? Write first, profile and optimize later. Not everyone cares about whether the conversion is free. Simply matching and converting to the right integer is fast enough.
The reason I asked the question, was that I wanted to keep an
intanintthroughout the program.It’s not for performance reasons, it’s just that I feel like there is a certain elegance in keeping things type safe entirely “for free” much like how
Option<&T>is actually just a regularT*, even if it could be pointless in the big picture.
You’ve pretty much got it figured out. Create your result type and write an Impl for covering to/from integers. You can use From/Into to keep it idiomatic.