Typo fix autopilot

This commit is contained in:
ErikEk 2018-10-09 18:28:34 +02:00
parent 61e8677419
commit c5f61b3c06
3 changed files with 7 additions and 7 deletions

@ -43,7 +43,7 @@ type Config struct {
DisconnectPeer func(*btcec.PublicKey) error DisconnectPeer func(*btcec.PublicKey) error
// WalletBalance is a function closure that should return the current // WalletBalance is a function closure that should return the current
// available balance o the backing wallet. // available balance of the backing wallet.
WalletBalance func() (btcutil.Amount, error) WalletBalance func() (btcutil.Amount, error)
// Graph is an abstract channel graph that the Heuristic and the Agent // Graph is an abstract channel graph that the Heuristic and the Agent
@ -53,7 +53,7 @@ type Config struct {
// MaxPendingOpens is the maximum number of pending channel // MaxPendingOpens is the maximum number of pending channel
// establishment goroutines that can be lingering. We cap this value in // establishment goroutines that can be lingering. We cap this value in
// order to control the level of parallelism caused by the autopiloit // order to control the level of parallelism caused by the autopilot
// agent. // agent.
MaxPendingOpens uint16 MaxPendingOpens uint16
@ -62,7 +62,7 @@ type Config struct {
} }
// channelState is a type that represents the set of active channels of the // channelState is a type that represents the set of active channels of the
// backing LN node that the Agent should be ware of. This type contains a few // backing LN node that the Agent should be aware of. This type contains a few
// helper utility methods. // helper utility methods.
type channelState map[lnwire.ShortChannelID]Channel type channelState map[lnwire.ShortChannelID]Channel
@ -485,7 +485,7 @@ func (a *Agent) controller() {
log.Infof("Triggering attachment directive dispatch, "+ log.Infof("Triggering attachment directive dispatch, "+
"total_funds=%v", a.totalBalance) "total_funds=%v", a.totalBalance)
// We're to attempt an attachment so we'll o obtain the set of // We're to attempt an attachment so we'll obtain the set of
// nodes that we currently have channels with so we avoid // nodes that we currently have channels with so we avoid
// duplicate edges. // duplicate edges.
connectedNodes := a.chanState.ConnectedNodes() connectedNodes := a.chanState.ConnectedNodes()

@ -88,7 +88,7 @@ func (d dbNode) ForEachChannel(cb func(ChannelEdge) error) error {
// Skip channels for which no outgoing edge policy is available. // Skip channels for which no outgoing edge policy is available.
// //
// TODO(joostjager): Ideally the case where channels have a nil // TODO(joostjager): Ideally the case where channels have a nil
// policy should be supported, as auto pilot is not looking at // policy should be supported, as autopilot is not looking at
// the policies. For now, it is not easily possible to get a // the policies. For now, it is not easily possible to get a
// reference to the other end LightningNode object without // reference to the other end LightningNode object without
// retrieving the policy. // retrieving the policy.

@ -15,7 +15,7 @@ import (
// heuristic. This means that given a threshold to allocate to automatic // heuristic. This means that given a threshold to allocate to automatic
// channel establishment, the heuristic will attempt to favor connecting to // channel establishment, the heuristic will attempt to favor connecting to
// nodes which already have a set amount of links, selected by sampling from a // nodes which already have a set amount of links, selected by sampling from a
// power law distribution. The attachment ins non-linear in that it favors // power law distribution. The attachment is non-linear in that it favors
// nodes with a higher in-degree but less so that regular linear preferential // nodes with a higher in-degree but less so that regular linear preferential
// attachment. As a result, this creates smaller and less clusters than regular // attachment. As a result, this creates smaller and less clusters than regular
// linear preferential attachment. // linear preferential attachment.
@ -193,7 +193,7 @@ func (p *ConstrainedPrefAttachment) Select(self *btcec.PublicKey, g ChannelGraph
return nil return nil
} }
// Additionally, if this node is in the backlist, then // Additionally, if this node is in the blacklist, then
// we'll skip it. // we'll skip it.
if _, ok := skipNodes[nID]; ok { if _, ok := skipNodes[nID]; ok {
return nil return nil