Struct graph::prelude::DirectedCsrGraph

source [−]

pub struct DirectedCsrGraph<NI, NV = (), EV = ()> where
    NI: Idx,  { /* private fields */ }

Implementations

source

impl<NI, NV, EV> DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

source

pub fn new(
 node_values: NodeValues<NV>,
 csr_out: Csr<NI, NI, EV>,
 csr_inc: Csr<NI, NI, EV>
) -> DirectedCsrGraph<NI, NV, EV>

Trait Implementations

source

impl<R, NI, NV, EV> DeserializeGraphOp<R, DirectedCsrGraph<NI, NV, EV>> for DirectedCsrGraph<NI, NV, EV> where
 R: Read,
 NI: Idx + ToMutByteSlice,
 NV: ToMutByteSlice,
 EV: ToMutByteSlice,

source

pub fn deserialize(read: R) -> Result<DirectedCsrGraph<NI, NV, EV>, Error>

source

impl<NI, NV, EV> DirectedDegrees<NI> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

source

pub fn out_degree(&self, node: NI) -> NI

Returns the number of edges where the given node is a source node.

source

pub fn in_degree(&self, node: NI) -> NI

Returns the number of edges where the given node is a target node.

source

impl<NI, NV> DirectedNeighbors<NI> for DirectedCsrGraph<NI, NV, ()> where
NI: Idx,

source

pub fn out_neighbors(&self, node: NI) -> &[NI]ⓘ
Notable traits for &'_ [u8 ]
`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

Returns a slice of all nodes which are connected in outgoing direction to the given node, i.e., the given node is the source node of the connecting edge. Read more

source

pub fn in_neighbors(&self, node: NI) -> &[NI]ⓘ
Notable traits for &'_ [u8 ]
`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

Returns a slice of all nodes which are connected in incoming direction to the given node, i.e., the given node is the target node of the connecting edge. Read more

source

impl<NI, NV, EV> DirectedNeighborsWithValues<NI, EV> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

source

pub fn out_neighbors_with_values(&self, node: NI) -> &[Target<NI, EV>]

Returns a slice of all nodes which are connected in outgoing direction to the given node, i.e., the given node is the source node of the connecting edge. Read more

source

pub fn in_neighbors_with_values(&self, node: NI) -> &[Target<NI, EV>]

Returns a slice of all nodes which are connected in incoming direction to the given node, i.e., the given node is the target node of the connecting edge. Read more

source

impl<NI, Label> From<(DotGraph<NI, Label>, CsrLayout )> for DirectedCsrGraph<NI, Label, ()> where
NI: Idx,
Label: Idx + Hash,

source

pub fn from((DotGraph<NI, Label>, CsrLayout )) -> DirectedCsrGraph<NI, Label, ()>

Performs the conversion.

source

impl<NI, Label> From<(DotGraph<NI, Label>, CsrLayout )> for DirectedCsrGraph<NI, (), ()> where
NI: Idx,
Label: Idx + Hash,

source

pub fn from((DotGraph<NI, Label>, CsrLayout )) -> DirectedCsrGraph<NI, (), ()>

Performs the conversion.

source

impl<NI, EV> From<(EdgeList<NI, EV>, CsrLayout )> for DirectedCsrGraph<NI, (), EV> where
NI: Idx,
EV: Copy + Send + Sync,

source

pub fn from((EdgeList<NI, EV>, CsrLayout )) -> DirectedCsrGraph<NI, (), EV>

Performs the conversion.

source

impl<NI> From<(Graph500<NI>, CsrLayout )> for DirectedCsrGraph<NI, (), ()> where
NI: Idx,

source

pub fn from((Graph500<NI>, CsrLayout )) -> DirectedCsrGraph<NI, (), ()>

Performs the conversion.

source

impl<NI, NV, EV> From<(NodeValues<NV>, EdgeList<NI, EV>, CsrLayout )> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,
EV: Copy + Send + Sync,

source

pub fn from(
(NodeValues<NV>, EdgeList<NI, EV>, CsrLayout )
) -> DirectedCsrGraph<NI, NV, EV>

Performs the conversion.

source

impl<NI, NV, EV> Graph<NI> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

source

pub fn node_count(&self) -> NI

Returns the number of nodes in the graph.

source

pub fn edge_count(&self) -> NI

Returns the number of edges in the graph.

source

impl<NI, NV, EV> NodeValues<NI, NV> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

source

pub fn node_value(&self, node: NI) -> &NV

source

impl<W, NI, NV, EV> SerializeGraphOp<W> for DirectedCsrGraph<NI, NV, EV> where
 W: Write,
 NI: Idx + ToByteSlice,
 NV: ToByteSlice,
 EV: ToByteSlice,

source

pub fn serialize(&self, output: W) -> Result<(), Error>

source

impl<NI, EV> TryFrom<(PathBuf, CsrLayout )> for DirectedCsrGraph<NI, EV, ()> where
NI: Idx + ToMutByteSlice,
EV: ToMutByteSlice,

type Error = Error

The type returned in the event of a conversion error.

source

pub fn try_from(
(PathBuf, CsrLayout )
) -> Result<DirectedCsrGraph<NI, EV, ()>, <DirectedCsrGraph<NI, EV, ()> as TryFrom<(PathBuf, CsrLayout )>>::Error>

Performs the conversion.

Auto Trait Implementations

impl<NI, NV, EV> RefUnwindSafe for DirectedCsrGraph<NI, NV, EV> where
 EV: RefUnwindSafe,
 NI: RefUnwindSafe,
 NV: RefUnwindSafe,

impl<NI, NV, EV> Send for DirectedCsrGraph<NI, NV, EV> where
EV: Send,
NV: Send,

impl<NI, NV, EV> Sync for DirectedCsrGraph<NI, NV, EV> where
EV: Sync,
NV: Sync,

impl<NI, NV, EV> Unpin for DirectedCsrGraph<NI, NV, EV>

impl<NI, NV, EV> UnwindSafe for DirectedCsrGraph<NI, NV, EV> where
 EV: UnwindSafe,
 NI: UnwindSafe,
 NV: UnwindSafe,

Blanket Implementations

source

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

source

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

source

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<NI, G> ForEachNodeParallelByPartitionOp<NI> for G where
NI: Idx,
G: Graph<NI> + Sync,

source

pub fn for_each_node_par_by_partition<T, F>(
 &self,
 partition: &[Range<NI>],
 node_values: &mut [T],
 node_fn: F
) -> Result<(), Error> where
 T: Send,
 F: Fn(&G, NI, &mut T) + Send + Sync,

For each node calls a given function with the node and its corresponding mutable state in parallel based on the provided node partition.

The parallelization is done by means of a rayon based fork join with a task for each range in the provided node partition.

source

impl<NI, G> ForEachNodeParallelOp<NI> for G where
NI: Idx,
G: Graph<NI> + Sync,

source

pub fn for_each_node_par<T, F>(
 &self,
 node_values: &mut [T],
 node_fn: F
) -> Result<(), Error> where
 T: Send,
 F: Fn(&G, NI, &mut T) + Send + Sync,

For each node calls a given function with the node and its corresponding mutable state in parallel.

The parallelization is done by means of a rayon based fork join with a task for each node.

source

impl<T> From<T> for T

source

pub fn from(t: T) -> T

Performs the conversion.

source

impl<NI, EV, D> InDegreePartitionOp<NI, EV> for D where
NI: Idx,
D: Graph<NI> + DirectedDegrees<NI> + DirectedNeighborsWithValues<NI, EV>,

source

pub fn in_degree_partition(&self, concurrency: usize) -> Vec<Range<NI>, Global>

Creates a greedy range-based in degree partition of the nodes.

It is greedy in the sense that it goes through the node set only once and simply adds a new range to the result whenever the current range’s nodes’ in degrees sum up to at least the average node in degree.

Example

let graph: DirectedCsrGraph<u32> = GraphBuilder::new()
    .edges(vec![(1, 0), (1, 2), (2, 0), (3, 2)])
    .build();

let partition: Vec<Range<u32>> = graph.in_degree_partition(2);

assert_eq!(partition.len(), 2);
assert_eq!(partition[0], 0..1);
assert_eq!(partition[1], 1..4);

source

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

source

pub fn into(self) -> U

Performs the conversion.

source

impl<NI, EV, D> OutDegreePartitionOp<NI, EV> for D where
NI: Idx,
D: Graph<NI> + DirectedDegrees<NI> + DirectedNeighborsWithValues<NI, EV>,

source

pub fn out_degree_partition(&self, concurrency: usize) -> Vec<Range<NI>, Global>

Creates a greedy range-based out degree partition of the nodes.

It is greedy in the sense that it goes through the node set only once and simply adds a new range to the result whenever the current range’s nodes’ out degrees sum up to at least the average node out degree.

Example

let graph: DirectedCsrGraph<u32> = GraphBuilder::new()
    .edges(vec![(0, 1), (0, 2), (2, 1), (2, 3)])
    .build();

let partition: Vec<Range<u32>> = graph.out_degree_partition(2);

assert_eq!(partition.len(), 2);
assert_eq!(partition[0], 0..1);
assert_eq!(partition[1], 1..4);

impl<T> Pointable for T

pub const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

pub unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

source

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

type Error = Infallible

The type returned in the event of a conversion error.

source

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

source

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct graph::prelude::DirectedCsrGraph

Implementations

impl<NI, NV, EV> DirectedCsrGraph<NI, NV, EV> where NI: Idx,

pub fn new( node_values: NodeValues<NV>, csr_out: Csr<NI, NI, EV>, csr_inc: Csr<NI, NI, EV>) -> DirectedCsrGraph<NI, NV, EV>

Trait Implementations

impl<R, NI, NV, EV> DeserializeGraphOp<R, DirectedCsrGraph<NI, NV, EV>> for DirectedCsrGraph<NI, NV, EV> where R: Read, NI: Idx + ToMutByteSlice, NV: ToMutByteSlice, EV: ToMutByteSlice,

pub fn deserialize(read: R) -> Result<DirectedCsrGraph<NI, NV, EV>, Error>

impl<NI, NV, EV> DirectedDegrees<NI> for DirectedCsrGraph<NI, NV, EV> where NI: Idx,

pub fn out_degree(&self, node: NI) -> NI

pub fn in_degree(&self, node: NI) -> NI

impl<NI, NV> DirectedNeighbors<NI> for DirectedCsrGraph<NI, NV, ()> where NI: Idx,

pub fn out_neighbors(&self, node: NI) -> &[NI]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

pub fn in_neighbors(&self, node: NI) -> &[NI]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

impl<NI, NV, EV> DirectedNeighborsWithValues<NI, EV> for DirectedCsrGraph<NI, NV, EV> where NI: Idx,

pub fn out_neighbors_with_values(&self, node: NI) -> &[Target<NI, EV>]

pub fn in_neighbors_with_values(&self, node: NI) -> &[Target<NI, EV>]

impl<NI, Label> From<(DotGraph<NI, Label>, CsrLayout)> for DirectedCsrGraph<NI, Label, ()> where NI: Idx, Label: Idx + Hash,

pub fn from((DotGraph<NI, Label>, CsrLayout)) -> DirectedCsrGraph<NI, Label, ()>

impl<NI, Label> From<(DotGraph<NI, Label>, CsrLayout)> for DirectedCsrGraph<NI, (), ()> where NI: Idx, Label: Idx + Hash,

pub fn from((DotGraph<NI, Label>, CsrLayout)) -> DirectedCsrGraph<NI, (), ()>

impl<NI, EV> From<(EdgeList<NI, EV>, CsrLayout)> for DirectedCsrGraph<NI, (), EV> where NI: Idx, EV: Copy + Send + Sync,

pub fn from((EdgeList<NI, EV>, CsrLayout)) -> DirectedCsrGraph<NI, (), EV>

impl<NI> From<(Graph500<NI>, CsrLayout)> for DirectedCsrGraph<NI, (), ()> where NI: Idx,

pub fn from((Graph500<NI>, CsrLayout)) -> DirectedCsrGraph<NI, (), ()>

impl<NI, NV, EV> From<(NodeValues<NV>, EdgeList<NI, EV>, CsrLayout)> for DirectedCsrGraph<NI, NV, EV> where NI: Idx, EV: Copy + Send + Sync,

pub fn from( (NodeValues<NV>, EdgeList<NI, EV>, CsrLayout)) -> DirectedCsrGraph<NI, NV, EV>

impl<NI, NV, EV> Graph<NI> for DirectedCsrGraph<NI, NV, EV> where NI: Idx,

pub fn node_count(&self) -> NI

pub fn edge_count(&self) -> NI

impl<NI, NV, EV> NodeValues<NI, NV> for DirectedCsrGraph<NI, NV, EV> where NI: Idx,

pub fn node_value(&self, node: NI) -> &NV

impl<W, NI, NV, EV> SerializeGraphOp<W> for DirectedCsrGraph<NI, NV, EV> where W: Write, NI: Idx + ToByteSlice, NV: ToByteSlice, EV: ToByteSlice,

pub fn serialize(&self, output: W) -> Result<(), Error>

impl<NI, EV> TryFrom<(PathBuf, CsrLayout)> for DirectedCsrGraph<NI, EV, ()> where NI: Idx + ToMutByteSlice, EV: ToMutByteSlice,

type Error = Error

pub fn try_from( (PathBuf, CsrLayout)) -> Result<DirectedCsrGraph<NI, EV, ()>, <DirectedCsrGraph<NI, EV, ()> as TryFrom<(PathBuf, CsrLayout)>>::Error>

Auto Trait Implementations

impl<NI, NV, EV> RefUnwindSafe for DirectedCsrGraph<NI, NV, EV> where EV: RefUnwindSafe, NI: RefUnwindSafe, NV: RefUnwindSafe,

impl<NI, NV, EV> Send for DirectedCsrGraph<NI, NV, EV> where EV: Send, NV: Send,

impl<NI, NV, EV> Sync for DirectedCsrGraph<NI, NV, EV> where EV: Sync, NV: Sync,

impl<NI, NV, EV> Unpin for DirectedCsrGraph<NI, NV, EV>

impl<NI, NV, EV> UnwindSafe for DirectedCsrGraph<NI, NV, EV> where EV: UnwindSafe, NI: UnwindSafe, NV: UnwindSafe,

Blanket Implementations

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

pub fn type_id(&self) -> TypeId

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

pub fn borrow(&self) -> &T

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

pub fn borrow_mut(&mut self) -> &mut T

impl<NI, G> ForEachNodeParallelByPartitionOp<NI> for G where NI: Idx, G: Graph<NI> + Sync,

pub fn for_each_node_par_by_partition<T, F>( &self, partition: &[Range<NI>], node_values: &mut [T], node_fn: F) -> Result<(), Error> where T: Send, F: Fn(&G, NI, &mut T) + Send + Sync,

impl<NI, G> ForEachNodeParallelOp<NI> for G where NI: Idx, G: Graph<NI> + Sync,

pub fn for_each_node_par<T, F>( &self, node_values: &mut [T], node_fn: F) -> Result<(), Error> where T: Send, F: Fn(&G, NI, &mut T) + Send + Sync,

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<NI, EV, D> InDegreePartitionOp<NI, EV> for D where NI: Idx, D: Graph<NI> + DirectedDegrees<NI> + DirectedNeighborsWithValues<NI, EV>,

pub fn in_degree_partition(&self, concurrency: usize) -> Vec<Range<NI>, Global>

Example

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

pub fn into(self) -> U

impl<NI, EV, D> OutDegreePartitionOp<NI, EV> for D where NI: Idx, D: Graph<NI> + DirectedDegrees<NI> + DirectedNeighborsWithValues<NI, EV>,

pub fn out_degree_partition(&self, concurrency: usize) -> Vec<Range<NI>, Global>

Example

impl<T> Pointable for T

pub const ALIGN: usize

type Init = T

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

pub unsafe fn drop(ptr: usize)

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

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

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

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<NI, NV, EV> DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

pub fn new(
node_values: NodeValues<NV>,
csr_out: Csr<NI, NI, EV>,
csr_inc: Csr<NI, NI, EV>
) -> DirectedCsrGraph<NI, NV, EV>

impl<R, NI, NV, EV> DeserializeGraphOp<R, DirectedCsrGraph<NI, NV, EV>> for DirectedCsrGraph<NI, NV, EV> where
R: Read,
NI: Idx + ToMutByteSlice,
NV: ToMutByteSlice,
EV: ToMutByteSlice,

impl<NI, NV, EV> DirectedDegrees<NI> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

impl<NI, NV> DirectedNeighbors<NI> for DirectedCsrGraph<NI, NV, ()> where
NI: Idx,

pub fn out_neighbors(&self, node: NI) -> &[NI]ⓘ
Notable traits for &'_ [u8 ]
`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

pub fn in_neighbors(&self, node: NI) -> &[NI]ⓘ
Notable traits for &'_ [u8 ]
`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

impl<NI, NV, EV> DirectedNeighborsWithValues<NI, EV> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

impl<NI, Label> From<(DotGraph<NI, Label>, CsrLayout )> for DirectedCsrGraph<NI, Label, ()> where
NI: Idx,
Label: Idx + Hash,

pub fn from((DotGraph<NI, Label>, CsrLayout )) -> DirectedCsrGraph<NI, Label, ()>

impl<NI, Label> From<(DotGraph<NI, Label>, CsrLayout )> for DirectedCsrGraph<NI, (), ()> where
NI: Idx,
Label: Idx + Hash,

pub fn from((DotGraph<NI, Label>, CsrLayout )) -> DirectedCsrGraph<NI, (), ()>

impl<NI, EV> From<(EdgeList<NI, EV>, CsrLayout )> for DirectedCsrGraph<NI, (), EV> where
NI: Idx,
EV: Copy + Send + Sync,

pub fn from((EdgeList<NI, EV>, CsrLayout )) -> DirectedCsrGraph<NI, (), EV>

impl<NI> From<(Graph500<NI>, CsrLayout )> for DirectedCsrGraph<NI, (), ()> where
NI: Idx,

pub fn from((Graph500<NI>, CsrLayout )) -> DirectedCsrGraph<NI, (), ()>

impl<NI, NV, EV> From<(NodeValues<NV>, EdgeList<NI, EV>, CsrLayout )> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,
EV: Copy + Send + Sync,

pub fn from(
(NodeValues<NV>, EdgeList<NI, EV>, CsrLayout )
) -> DirectedCsrGraph<NI, NV, EV>

impl<NI, NV, EV> Graph<NI> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

impl<NI, NV, EV> NodeValues<NI, NV> for DirectedCsrGraph<NI, NV, EV> where
NI: Idx,

impl<W, NI, NV, EV> SerializeGraphOp<W> for DirectedCsrGraph<NI, NV, EV> where
W: Write,
NI: Idx + ToByteSlice,
NV: ToByteSlice,
EV: ToByteSlice,

impl<NI, EV> TryFrom<(PathBuf, CsrLayout )> for DirectedCsrGraph<NI, EV, ()> where
NI: Idx + ToMutByteSlice,
EV: ToMutByteSlice,

pub fn try_from(
(PathBuf, CsrLayout )
) -> Result<DirectedCsrGraph<NI, EV, ()>, <DirectedCsrGraph<NI, EV, ()> as TryFrom<(PathBuf, CsrLayout )>>::Error>

impl<NI, NV, EV> RefUnwindSafe for DirectedCsrGraph<NI, NV, EV> where
EV: RefUnwindSafe,
NI: RefUnwindSafe,
NV: RefUnwindSafe,

impl<NI, NV, EV> Send for DirectedCsrGraph<NI, NV, EV> where
EV: Send,
NV: Send,

impl<NI, NV, EV> Sync for DirectedCsrGraph<NI, NV, EV> where
EV: Sync,
NV: Sync,

impl<NI, NV, EV> UnwindSafe for DirectedCsrGraph<NI, NV, EV> where
EV: UnwindSafe,
NI: UnwindSafe,
NV: UnwindSafe,

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

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

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

impl<NI, G> ForEachNodeParallelByPartitionOp<NI> for G where
NI: Idx,
G: Graph<NI> + Sync,

pub fn for_each_node_par_by_partition<T, F>(
&self,
partition: &[Range<NI>],
node_values: &mut [T],
node_fn: F
) -> Result<(), Error> where
T: Send,
F: Fn(&G, NI, &mut T) + Send + Sync,

impl<NI, G> ForEachNodeParallelOp<NI> for G where
NI: Idx,
G: Graph<NI> + Sync,

pub fn for_each_node_par<T, F>(
&self,
node_values: &mut [T],
node_fn: F
) -> Result<(), Error> where
T: Send,
F: Fn(&G, NI, &mut T) + Send + Sync,

impl<NI, EV, D> InDegreePartitionOp<NI, EV> for D where
NI: Idx,
D: Graph<NI> + DirectedDegrees<NI> + DirectedNeighborsWithValues<NI, EV>,

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

impl<NI, EV, D> OutDegreePartitionOp<NI, EV> for D where
NI: Idx,
D: Graph<NI> + DirectedDegrees<NI> + DirectedNeighborsWithValues<NI, EV>,

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

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