Struct RouteHop
pub struct RouteHop {
pub pubkey: PublicKey,
pub node_features: Features<NodeContext>,
pub short_channel_id: u64,
pub channel_features: Features<ChannelContext>,
pub fee_msat: u64,
pub cltv_expiry_delta: u32,
pub maybe_announced_channel: bool,
}
Expand description
A hop in a route, and additional metadata about it. “Hop” is defined as a node and the channel that leads to it.
Fields§
§pubkey: PublicKey
The node_id of the node at this hop.
node_features: Features<NodeContext>
The node_announcement features of the node at this hop. For the last hop, these may be amended to match the features present in the invoice this node generated.
short_channel_id: u64
The channel that should be used from the previous hop to reach this node.
channel_features: Features<ChannelContext>
The channel_announcement features of the channel that should be used from the previous hop to reach this node.
fee_msat: u64
The fee taken on this hop (for paying for the use of the next channel in the path).
If this is the last hop in Path::hops
:
- if we’re sending to a
BlindedPath
, this is the fee paid for use of the entire blinded path - otherwise, this is the full value of this
Path
’s part of the payment
cltv_expiry_delta: u32
The CLTV delta added for this hop.
If this is the last hop in Path::hops
:
- if we’re sending to a
BlindedPath
, this is the CLTV delta for the entire blinded path - otherwise, this is the CLTV delta expected at the destination
maybe_announced_channel: bool
Indicates whether this hop is possibly announced in the public network graph.
Will be true
if there is a possibility that the channel is publicly known, i.e., if we
either know for sure it’s announced in the public graph, or if any public channels exist
for which the given short_channel_id
could be an alias for. Will be false
if we believe
the channel to be unannounced.
Will be true
for objects serialized with LDK version 0.0.116 and before.
Trait Implementations§
§impl Writeable for RouteHop
impl Writeable for RouteHop
impl Eq for RouteHop
impl StructuralPartialEq for RouteHop
Auto Trait Implementations§
impl Freeze for RouteHop
impl RefUnwindSafe for RouteHop
impl Send for RouteHop
impl Sync for RouteHop
impl Unpin for RouteHop
impl UnwindSafe for RouteHop
Blanket Implementations§
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request