内容简介:One surprising feature of type inference in languages like Rust is defining functions with generic return types. The idea is that by specifying at some later point in the code which type you want your function to return, the compiler can go back and fill i
One surprising feature of type inference in languages like Rust is defining functions with generic return types. The idea is that by specifying at some later point in the code which type you want your function to return, the compiler can go back and fill in the blanks.
For example, let’s have a look at this function:
fn new<T: Default>() -> T {
T::default()
}
You pick the output
It has no value parameters, but one type parameter, T
.
That T
is its return type and also used in the function body.
You can call it like so:
let x: u32 = new();
Or, being explicit about the type parameter, like this:
let x = new::<i32>();
This is quite neat!
More generic: collect
A promising way to be more generic in Rust
is to use more traits!
Have a look at how the
Iterator::collect
method is defined:
fn collect<B: FromIterator<Self::Item>>(self) -> B // ...
You can read this type signature as
Consume self and return something
of a type that implements can be made From [an] Iterator
for the type of items we are iterating over.
Like above,
we call this by specifying what kind of output type want.
[Looking][ FromIterator
implementors] at some of the types FromIterator
is implemented for
is pretty revealing of the use cases.
You can get:
-
a
Vecby collecting any items, -
a
BTreeMaporHashMapby collecting tuples, -
but also
PathBufby collectingPaths, -
and
Stringfor strings and string slices.
Note: All these types are what you might call “container” types.
One more for the road
More generic? More traits.
There is one more gem hidden in FromIterator
:
impl<A, E, V> FromIterator<Result<A, E>> for Result<V, E> where
V: FromIterator<A>, // ...
This means:
You can construct a
Result
containing
any type of container of items A
by collecting items that are Result
s of type A
.
(The first Err
will make the outer Result
be an Err
.)
Here’s an example, see the docs
for another one:
let input: Vec<Result<i32, ()>> = vec![Ok(1), Ok(2)]; let output: Result<Vec<i32>, ()> = input.into_iter().collect();
Note: If you like type theory:
What we’re building is a Result<<T<A>, E>>
by collecting Result<A, E>
s and specifying T
.
以上所述就是小编给大家介绍的《Return-type based dispatch》,希望对大家有所帮助,如果大家有任何疑问请给我留言,小编会及时回复大家的。在此也非常感谢大家对 码农网 的支持!
猜你喜欢:本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们。
UML基础与Rose建模教程
人民邮电出版社 / 人民邮电出版社 / 2006-1 / 36.00元
《UML基础与Rose建模教程》全面,详细地介绍了 UML 的基础知识和Rational Rose的使用方法,并通过4个综合性的案例,展示了使用UML和Rose进行软件建模的具体方法和步骤。全书共分20章,前4章是基础部分,介绍了UML和Rose的基础知识;第5章到第13章是《UML基础与Rose建模教程》的重点,介绍了UML的9种图和组成元素,以及相关的建模技术,并在每章的最后介绍了各种图在Ro......一起来看看 《UML基础与Rose建模教程》 这本书的介绍吧!