Movatterモバイル変換


[0]ホーム

URL:


tuple

Primitive Typetuple 

1.0.0
Expand description

A finite heterogeneous sequence,(T, U, ..).

Let’s cover each of those in turn:

Tuples arefinite. In other words, a tuple has a length. Here’s a tupleof length3:

("hello",5,'c');

‘Length’ is also sometimes called ‘arity’ here; each tuple of a differentlength is a different, distinct type.

Tuples areheterogeneous. This means that each element of the tuple canhave a different type. In that tuple above, it has the type:

(&'staticstr, i32, char)

Tuples are asequence. This means that they can be accessed by position;this is called ‘tuple indexing’, and it looks like this:

lettuple = ("hello",5,'c');assert_eq!(tuple.0,"hello");assert_eq!(tuple.1,5);assert_eq!(tuple.2,'c');

The sequential nature of the tuple applies to its implementations of varioustraits. For example, inPartialOrd andOrd, the elements are comparedsequentially until the first non-equal set is found.

For more about tuples, seethe book.

§Trait implementations

In this documentation the shorthand(T₁, T₂, …, Tₙ) is used to represent tuples of varyinglength. When that is used, any trait bound expressed onT applies to each element of thetuple independently. Note that this is a convenience notation to avoid repetitivedocumentation, not valid Rust syntax.

Due to a temporary restriction in Rust’s type system, the following traits are onlyimplemented on tuples of arity 12 or less. In the future, this may change:

The following traits are implemented for tuples of any length. These traits haveimplementations that are automatically generated by the compiler, so are not limited bymissing language features.

§Examples

Basic usage:

lettuple = ("hello",5,'c');assert_eq!(tuple.0,"hello");

Tuples are often used as a return type when you want to return more thanone value:

fncalculate_point() -> (i32, i32) {// Don't do a calculation, that's not the point of the example(4,5)}letpoint = calculate_point();assert_eq!(point.0,4);assert_eq!(point.1,5);// Combining this with patterns can be nicer.let(x, y) = calculate_point();assert_eq!(x,4);assert_eq!(y,5);

Homogeneous tuples can be created from arrays of appropriate length:

letarray: [u32;3] = [1,2,3];lettuple: (u32, u32, u32) = array.into();

Trait Implementations§

1.0.0 ·Source§

impl<T>Debug for(T₁, T₂, …, Tₙ)
where T:Debug,

This trait is implemented for tuples up to twelve items long.

Source§

fnfmt(&self, f: &mutFormatter<'_>) ->Result<(),Error>

Formats the value using the given formatter.Read more
1.0.0 ·Source§

impl<T>Default for(T₁, T₂, …, Tₙ)
where T:Default,

This trait is implemented for tuples up to twelve items long.

Source§

fndefault() ->(T,)

Returns the “default value” for a type.Read more
1.2.0 ·Source§

impl<'a, K, V, A>Extend<(&'a K,&'a V)> forBTreeMap<K, V, A>
where K:Ord +Copy, V:Copy, A:Allocator +Clone,

Source§

fnextend<I>(&mut self, iter: I)
where I:IntoIterator<Item = (&'a K,&'a V)>,

Extends a collection with the contents of an iterator.Read more
Source§

fnextend_one(&mut self, _: (&'a K,&'a V))

🔬This is a nightly-only experimental API. (extend_one #72631)
Extends a collection with exactly one element.
Source§

fnextend_reserve(&mut self, additional:usize)

🔬This is a nightly-only experimental API. (extend_one #72631)
Reserves capacity in a collection for the given number of additional elements.Read more
1.4.0 ·Source§

impl<'a, K, V, S>Extend<(&'a K,&'a V)> forHashMap<K, V, S>
where K:Eq +Hash +Copy, V:Copy, S:BuildHasher,

Source§

fnextend<T:IntoIterator<Item = (&'a K,&'a V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.Read more
Source§

fnextend_one(&mut self, (k, v): (&'a K,&'a V))

🔬This is a nightly-only experimental API. (extend_one #72631)
Extends a collection with exactly one element.
Source§

fnextend_reserve(&mut self, additional:usize)

🔬This is a nightly-only experimental API. (extend_one #72631)
Reserves capacity in a collection for the given number of additional elements.Read more
1.0.0 ·Source§

impl<K, V, A>Extend<(K, V)> forBTreeMap<K, V, A>
where K:Ord, A:Allocator +Clone,

Source§

fnextend<T>(&mut self, iter: T)
where T:IntoIterator<Item =(K, V)>,

Extends a collection with the contents of an iterator.Read more
Source§

fnextend_one(&mut self, _:(K, V))

🔬This is a nightly-only experimental API. (extend_one #72631)
Extends a collection with exactly one element.
Source§

fnextend_reserve(&mut self, additional:usize)

🔬This is a nightly-only experimental API. (extend_one #72631)
Reserves capacity in a collection for the given number of additional elements.Read more
1.0.0 ·Source§

impl<K, V, S>Extend<(K, V)> forHashMap<K, V, S>
where K:Eq +Hash, S:BuildHasher,

Inserts all new key-values from the iterator and replaces values with existingkeys with new values returned from the iterator.

Source§

fnextend<T:IntoIterator<Item =(K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.Read more
Source§

fnextend_one(&mut self, (k, v):(K, V))

🔬This is a nightly-only experimental API. (extend_one #72631)
Extends a collection with exactly one element.
Source§

fnextend_reserve(&mut self, additional:usize)

🔬This is a nightly-only experimental API. (extend_one #72631)
Reserves capacity in a collection for the given number of additional elements.Read more
1.56.0 ·Source§

impl<T, ExtendT>Extend<(T₁, T₂, …, Tₙ)> for(ExtendT₁, ExtendT₂, …, ExtendTₙ)
where ExtendT:Extend<T>,

This trait is implemented for tuples up to twelve items long. Theimpls for1- and 3- through 12-ary tuples were stabilized after 2-tuples, in 1.85.0.

Source§

fnextend<I>(&mut self, iter: I)
where I:IntoIterator<Item =(T,)>,

Allows toextend a tuple of collections that also implementExtend.

See also:Iterator::unzip

§Examples
// Example given for a 2-tuple, but 1- through 12-tuples are supportedletmuttuple = (vec![0],vec![1]);tuple.extend([(2,3), (4,5), (6,7)]);assert_eq!(tuple.0, [0,2,4,6]);assert_eq!(tuple.1, [1,3,5,7]);// also allows for arbitrarily nested tuples as elementsletmutnested_tuple = (vec![1], (vec![2],vec![3]));nested_tuple.extend([(4, (5,6)), (7, (8,9))]);let(a, (b, c)) = nested_tuple;assert_eq!(a, [1,4,7]);assert_eq!(b, [2,5,8]);assert_eq!(c, [3,6,9]);
Source§

fnextend_one(&mut self, item:(T,))

🔬This is a nightly-only experimental API. (extend_one #72631)
Extends a collection with exactly one element.
Source§

fnextend_reserve(&mut self, additional:usize)

🔬This is a nightly-only experimental API. (extend_one #72631)
Reserves capacity in a collection for the given number of additional elements.Read more
1.71.0 ·Source§

impl<T>From<[T; N]> for(T₁, T₂, …, Tₙ)

This trait is implemented for tuples up to twelve items long.

Source§

fnfrom(array:[T; 1]) ->(T,)

Converts to this type from the input type.
1.17.0 (const:unstable) ·Source§

impl<I>From<(I,u16)> forSocketAddr
where I:Into<IpAddr>,

Source§

fnfrom(pieces: (I,u16)) ->SocketAddr

Converts a tuple struct (Into<IpAddr>,u16) into aSocketAddr.

This conversion creates aSocketAddr::V4 for anIpAddr::V4and creates aSocketAddr::V6 for anIpAddr::V6.

u16 is treated as port of the newly createdSocketAddr.

1.71.0 ·Source§

impl<T>From<(T₁, T₂, …, Tₙ)> for[T; N]

This trait is implemented for tuples up to twelve items long.

Source§

fnfrom(tuple:(T,)) ->[T; 1]

Converts to this type from the input type.
1.0.0 ·Source§

impl<K, V>FromIterator<(K, V)> forBTreeMap<K, V>
where K:Ord,

Source§

fnfrom_iter<T>(iter: T) ->BTreeMap<K, V>
where T:IntoIterator<Item =(K, V)>,

Constructs aBTreeMap<K, V> from an iterator of key-value pairs.

If the iterator produces any pairs with equal keys,all but one of the corresponding values will be dropped.

1.0.0 ·Source§

impl<K, V, S>FromIterator<(K, V)> forHashMap<K, V, S>
where K:Eq +Hash, S:BuildHasher +Default,

Source§

fnfrom_iter<T:IntoIterator<Item =(K, V)>>(iter: T) ->HashMap<K, V, S>

Constructs aHashMap<K, V> from an iterator of key-value pairs.

If the iterator produces any pairs with equal keys,all but one of the corresponding values will be dropped.

1.79.0 ·Source§

impl<T, ExtendT>FromIterator<(T₁, T₂, …, Tₙ)> for(ExtendT₁, ExtendT₂, …, ExtendTₙ)
where ExtendT:Default +Extend<T>,

This implementation turns an iterator of tuples into a tuple of types which implementDefault andExtend.

This is similar toIterator::unzip, but is also composable with otherFromIteratorimplementations:

letstring ="1,2,123,4";// Example given for a 2-tuple, but 1- through 12-tuples are supportedlet(numbers, lengths): (Vec<_>, Vec<_>) = string    .split(',')    .map(|s| s.parse().map(|n: u32| (n, s.len())))    .collect::<Result<_,_>>()?;assert_eq!(numbers, [1,2,123,4]);assert_eq!(lengths, [1,1,3,1]);
Source§

fnfrom_iter<Iter>(iter: Iter) ->(ExtendT,)
where Iter:IntoIterator<Item =(T,)>,

Creates a value from an iterator.Read more
1.0.0 ·Source§

impl<T>Hash for(T₁, T₂, …, Tₙ)
where T:Hash,

This trait is implemented for tuples up to twelve items long.

Source§

fnhash<S>(&self, state:&mut S)
where S:Hasher,

Feeds this value into the givenHasher.Read more
1.3.0 ·Source§

fnhash_slice<H>(data: &[Self], state:&mut H)
where H:Hasher, Self:Sized,

Feeds a slice of this type into the givenHasher.Read more
Source§

impl<T>IntoBounds<T> for (Bound<T>,Bound<T>)

Source§

fninto_bounds(self) -> (Bound<T>,Bound<T>)

🔬This is a nightly-only experimental API. (range_into_bounds #136903)
Convert this range into the start and end bounds.Returns(start_bound, end_bound).Read more
Source§

fnintersect<R>(self, other: R) -> (Bound<T>,Bound<T>)
where Self:Sized, T:Ord, R:IntoBounds<T>,

🔬This is a nightly-only experimental API. (range_into_bounds #136903)
Compute the intersection ofself andother.Read more
1.0.0 (const:unstable) ·Source§

impl<T>Ord for(T₁, T₂, …, Tₙ)
where T:Ord,

This trait is implemented for tuples up to twelve items long.

Source§

fncmp(&self, other: &(T,)) ->Ordering

This method returns anOrdering betweenself andother.Read more
1.21.0 ·Source§

fnmax(self, other: Self) -> Self
where Self:Sized,

Compares and returns the maximum of two values.Read more
1.21.0 ·Source§

fnmin(self, other: Self) -> Self
where Self:Sized,

Compares and returns the minimum of two values.Read more
1.50.0 ·Source§

fnclamp(self, min: Self, max: Self) -> Self
where Self:Sized,

Restrict a value to a certain interval.Read more
1.0.0 (const:unstable) ·Source§

impl<T>PartialEq for(T₁, T₂, …, Tₙ)
where T:PartialEq,

This trait is implemented for tuples up to twelve items long.

Source§

fneq(&self, other: &(T,)) ->bool

Tests forself andother values to be equal, and is used by==.
Source§

fnne(&self, other: &(T,)) ->bool

Tests for!=. The default implementation is almost always sufficient,and should not be overridden without very good reason.
1.0.0 (const:unstable) ·Source§

impl<T>PartialOrd for(T₁, T₂, …, Tₙ)
where T:PartialOrd,

This trait is implemented for tuples up to twelve items long.

Source§

fnpartial_cmp(&self, other: &(T,)) ->Option<Ordering>

This method returns an ordering betweenself andother values if one exists.Read more
Source§

fnlt(&self, other: &(T,)) ->bool

Tests less than (forself andother) and is used by the< operator.Read more
Source§

fnle(&self, other: &(T,)) ->bool

Tests less than or equal to (forself andother) and is used by the<= operator.Read more
Source§

fnge(&self, other: &(T,)) ->bool

Tests greater than or equal to (forself andother) and is used bythe>= operator.Read more
Source§

fngt(&self, other: &(T,)) ->bool

Tests greater than (forself andother) and is used by the>operator.Read more
1.28.0 (const: unstable) ·Source§

impl<'a, T>RangeBounds<T> for (Bound<&'a T>,Bound<&'a T>)
where T: 'a + ?Sized,

Source§

fnstart_bound(&self) ->Bound<&T>

Start index bound.Read more
Source§

fnend_bound(&self) ->Bound<&T>

End index bound.Read more
1.35.0 ·Source§

fncontains<U>(&self, item:&U) ->bool
where T:PartialOrd<U>, U:PartialOrd<T> + ?Sized,

Returnstrue ifitem is contained in the range.Read more
Source§

fnis_empty(&self) ->bool
where T:PartialOrd,

🔬This is a nightly-only experimental API. (range_bounds_is_empty #137300)
Returnstrue if the range contains no items.One-sided ranges (RangeFrom, etc) always returnfalse.Read more
1.28.0 (const: unstable) ·Source§

impl<T>RangeBounds<T> for (Bound<T>,Bound<T>)

Source§

fnstart_bound(&self) ->Bound<&T>

Start index bound.Read more
Source§

fnend_bound(&self) ->Bound<&T>

End index bound.Read more
1.35.0 ·Source§

fncontains<U>(&self, item:&U) ->bool
where T:PartialOrd<U>, U:PartialOrd<T> + ?Sized,

Returnstrue ifitem is contained in the range.Read more
Source§

fnis_empty(&self) ->bool
where T:PartialOrd,

🔬This is a nightly-only experimental API. (range_bounds_is_empty #137300)
Returnstrue if the range contains no items.One-sided ranges (RangeFrom, etc) always returnfalse.Read more
1.53.0 ·Source§

impl<T>SliceIndex<[T]> for (Bound<usize>,Bound<usize>)

Source§

typeOutput =[T]

The output type returned by methods.
Source§

fnget( self, slice: &[T],) ->Option<&<(Bound<usize>,Bound<usize>) asSliceIndex<[T]>>::Output>

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a shared reference to the output at this location, if inbounds.
Source§

fnget_mut( self, slice: &mut[T],) ->Option<&mut <(Bound<usize>,Bound<usize>) asSliceIndex<[T]>>::Output>

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable reference to the output at this location, if inbounds.
Source§

unsafe fnget_unchecked( self, slice:*const[T],) ->*const<(Bound<usize>,Bound<usize>) asSliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a pointer to the output at this location, withoutperforming any bounds checking.Read more
Source§

unsafe fnget_unchecked_mut( self, slice:*mut[T],) ->*mut<(Bound<usize>,Bound<usize>) asSliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable pointer to the output at this location, withoutperforming any bounds checking.Read more
Source§

fnindex( self, slice: &[T],) -> &<(Bound<usize>,Bound<usize>) asSliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a shared reference to the output at this location, panickingif out of bounds.
Source§

fnindex_mut( self, slice: &mut[T],) -> &mut <(Bound<usize>,Bound<usize>) asSliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable reference to the output at this location, panickingif out of bounds.
Source§

implSliceIndex<ByteStr> for (Bound<usize>,Bound<usize>)

Source§

typeOutput =ByteStr

The output type returned by methods.
Source§

fnget( self, slice: &ByteStr,) ->Option<&<(Bound<usize>,Bound<usize>) asSliceIndex<ByteStr>>::Output>

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a shared reference to the output at this location, if inbounds.
Source§

fnget_mut( self, slice: &mutByteStr,) ->Option<&mut <(Bound<usize>,Bound<usize>) asSliceIndex<ByteStr>>::Output>

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable reference to the output at this location, if inbounds.
Source§

unsafe fnget_unchecked( self, slice:*constByteStr,) ->*const<(Bound<usize>,Bound<usize>) asSliceIndex<ByteStr>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a pointer to the output at this location, withoutperforming any bounds checking.Read more
Source§

unsafe fnget_unchecked_mut( self, slice:*mutByteStr,) ->*mut<(Bound<usize>,Bound<usize>) asSliceIndex<ByteStr>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable pointer to the output at this location, withoutperforming any bounds checking.Read more
Source§

fnindex( self, slice: &ByteStr,) -> &<(Bound<usize>,Bound<usize>) asSliceIndex<ByteStr>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a shared reference to the output at this location, panickingif out of bounds.
Source§

fnindex_mut( self, slice: &mutByteStr,) -> &mut <(Bound<usize>,Bound<usize>) asSliceIndex<ByteStr>>::Output

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable reference to the output at this location, panickingif out of bounds.
1.73.0 ·Source§

implSliceIndex<str> for (Bound<usize>,Bound<usize>)

Implements substring slicing for arbitrary bounds.

Returns a slice of the given string bounded by the byte indicesprovided by each bound.

This operation isO(1).

§Panics

Panics ifbegin orend (if it exists and once adjusted forinclusion/exclusion) does not point to the starting byte offset ofa character (as defined byis_char_boundary), ifbegin > end, or ifend > len.

Source§

typeOutput =str

The output type returned by methods.
Source§

fnget(self, slice: &str) ->Option<&str>

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a shared reference to the output at this location, if inbounds.
Source§

fnget_mut(self, slice: &mutstr) ->Option<&mutstr>

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable reference to the output at this location, if inbounds.
Source§

unsafe fnget_unchecked(self, slice:*conststr) ->*conststr

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a pointer to the output at this location, withoutperforming any bounds checking.Read more
Source§

unsafe fnget_unchecked_mut(self, slice:*mutstr) ->*mutstr

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable pointer to the output at this location, withoutperforming any bounds checking.Read more
Source§

fnindex(self, slice: &str) -> &str

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a shared reference to the output at this location, panickingif out of bounds.
Source§

fnindex_mut(self, slice: &mutstr) -> &mutstr

🔬This is a nightly-only experimental API. (slice_index_methods)
Returns a mutable reference to the output at this location, panickingif out of bounds.
1.0.0 ·Source§

implToSocketAddrs for (&str,u16)

Source§

typeIter =IntoIter<SocketAddr>

Returned iterator over socket addresses which this type may correspondto.
Source§

fnto_socket_addrs(&self) ->Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolvedSocketAddrs.Read more
1.0.0 ·Source§

implToSocketAddrs for (IpAddr,u16)

Source§

typeIter =IntoIter<SocketAddr>

Returned iterator over socket addresses which this type may correspondto.
Source§

fnto_socket_addrs(&self) ->Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolvedSocketAddrs.Read more
1.0.0 ·Source§

implToSocketAddrs for (Ipv4Addr,u16)

Source§

typeIter =IntoIter<SocketAddr>

Returned iterator over socket addresses which this type may correspondto.
Source§

fnto_socket_addrs(&self) ->Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolvedSocketAddrs.Read more
1.0.0 ·Source§

implToSocketAddrs for (Ipv6Addr,u16)

Source§

typeIter =IntoIter<SocketAddr>

Returned iterator over socket addresses which this type may correspondto.
Source§

fnto_socket_addrs(&self) ->Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolvedSocketAddrs.Read more
1.46.0 ·Source§

implToSocketAddrs for (String,u16)

Source§

typeIter =IntoIter<SocketAddr>

Returned iterator over socket addresses which this type may correspondto.
Source§

fnto_socket_addrs(&self) ->Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolvedSocketAddrs.Read more
Source§

impl<T>CloneFromCell for(T₁, T₂, …, Tₙ)
where T:CloneFromCell,

This trait is implemented for tuples up to twelve items long.

Source§

impl<T>ConstParamTy_ for(T₁, T₂, …, Tₙ)
where T:ConstParamTy_,

This trait is implemented for tuples up to twelve items long.

1.0.0 (const:unstable) ·Source§

impl<T>Eq for(T₁, T₂, …, Tₙ)
where T:Eq,

This trait is implemented for tuples up to twelve items long.

Source§

impl<T>StructuralPartialEq for(T₁, T₂, …, Tₙ)

This trait is implemented for tuples up to twelve items long.

Auto Trait Implementations§

§

impl<T>Freeze for(T₁, T₂, …, Tₙ)
where T:Freeze,

§

impl<T>RefUnwindSafe for(T₁, T₂, …, Tₙ)
where T:RefUnwindSafe,

§

impl<T>Send for(T₁, T₂, …, Tₙ)
where T:Send,

§

impl<T>Sync for(T₁, T₂, …, Tₙ)
where T:Sync,

§

impl<T>Unpin for(T₁, T₂, …, Tₙ)
where T:Unpin,

§

impl<T>UnwindSafe for(T₁, T₂, …, Tₙ)
where T:UnwindSafe,

Blanket Implementations§

Source§

impl<T>Any for T
where T: 'static + ?Sized,

Source§

fntype_id(&self) ->TypeId

Gets theTypeId ofself.Read more
Source§

impl<T>Borrow<T> for T
where T: ?Sized,

Source§

fnborrow(&self) ->&T

Immutably borrows from an owned value.Read more
Source§

impl<T>BorrowMut<T> for T
where T: ?Sized,

Source§

fnborrow_mut(&mut self) ->&mut T

Mutably borrows from an owned value.Read more
Source§

impl<T>CloneToUninit for T
where T:Clone,

Source§

unsafe fnclone_to_uninit(&self, dest:*mutu8)

🔬This is a nightly-only experimental API. (clone_to_uninit #126799)
Performs copy-assignment fromself todest.Read more
Source§

impl<T>From<T> for T

Source§

fnfrom(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U>Into<U> for T
where U:From<T>,

Source§

fninto(self) -> U

CallsU::from(self).

That is, this conversion is whatever the implementation ofFrom<T> for U chooses to do.

Source§

impl<T>ToOwned for T
where T:Clone,

Source§

typeOwned = T

The resulting type after obtaining ownership.
Source§

fnto_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning.Read more
Source§

fnclone_into(&self, target:&mut T)

Uses borrowed data to replace owned data, usually by cloning.Read more
Source§

impl<T, U>TryFrom<U> for T
where U:Into<T>,

Source§

typeError =Infallible

The type returned in the event of a conversion error.
Source§

fntry_from(value: U) ->Result<T, <T asTryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U>TryInto<U> for T
where U:TryFrom<T>,

Source§

typeError = <U asTryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fntry_into(self) ->Result<U, <U asTryFrom<T>>::Error>

Performs the conversion.

[8]ページ先頭

©2009-2026 Movatter.jp