multi: comprehensive typo fixes across all packages

routing/chainview/bitcoind.go

@@ -228,7 +228,7 @@ func (b *BitcoindFilteredChainView) FilterBlock(blockHash *chainhash.Hash) (*Fil
 }
 
 // chainFilterer is the primary goroutine which: listens for new blocks coming
-// and dispatches the relevent FilteredBlock notifications, updates the filter
+// and dispatches the relevant FilteredBlock notifications, updates the filter
 // due to requests by callers, and finally is able to preform targeted block
 // filtration.
 //
@@ -236,7 +236,7 @@ func (b *BitcoindFilteredChainView) FilterBlock(blockHash *chainhash.Hash) (*Fil
 func (b *BitcoindFilteredChainView) chainFilterer() {
 	defer b.wg.Done()
 
-	// filterBlock is a helper funciton that scans the given block, and
+	// filterBlock is a helper function that scans the given block, and
 	// notes which transactions spend outputs which are currently being
 	// watched. Additionally, the chain filter will also be updated by
 	// removing any spent outputs.

routing/chainview/btcd.go

@@ -241,7 +241,7 @@ func (b *BtcdFilteredChainView) FilterBlock(blockHash *chainhash.Hash) (*Filtere
 }
 
 // chainFilterer is the primary goroutine which: listens for new blocks coming
-// and dispatches the relevent FilteredBlock notifications, updates the filter
+// and dispatches the relevant FilteredBlock notifications, updates the filter
 // due to requests by callers, and finally is able to preform targeted block
 // filtration.
 //
@@ -249,7 +249,7 @@ func (b *BtcdFilteredChainView) FilterBlock(blockHash *chainhash.Hash) (*Filtere
 func (b *BtcdFilteredChainView) chainFilterer() {
 	defer b.wg.Done()
 
-	// filterBlock is a helper funciton that scans the given block, and
+	// filterBlock is a helper function that scans the given block, and
 	// notes which transactions spend outputs which are currently being
 	// watched. Additionally, the chain filter will also be updated by
 	// removing any spent outputs.

routing/chainview/interface.go

@@ -7,7 +7,7 @@ import (
 
 // FilteredChainView represents a subscription to a certain subset of of the
 // UTXO set for a particular chain. This interface is useful from the point of
-// view of maintaining an up-to-date channel graph for the Lighting Network.
+// view of maintaining an up-to-date channel graph for the Lightning Network.
 // The subset of the UTXO to be subscribed is that of all the currently opened
 // channels. Each time a channel is closed (the output is spent), a
 // notification is to be sent allowing the graph to be pruned.

routing/chainview/interface_test.go

@@ -371,7 +371,7 @@ func testUpdateFilterBackTrack(node *rpctest.Harness,
 		t.Fatalf("unable to generate block: %v", err)
 	}
 
-	// We should've received another empty filtered block notification.
+	// We should have received another empty filtered block notification.
 	select {
 	case filteredBlock := <-blockChan:
 		assertFilteredBlock(t, filteredBlock, currentHeight+1,
@@ -606,7 +606,7 @@ func testFilterBlockDisconnected(node *rpctest.Harness,
 			}
 			expectedHeight := uint32(oldHeight - i)
 			if block.Height != expectedHeight {
-				t.Fatalf("expected to receive disconencted "+
+				t.Fatalf("expected to receive disconnected "+
 					"block at height %d, instead got at %d",
 					expectedHeight, block.Height)
 			}
@@ -878,7 +878,7 @@ var interfaceImpls = []struct {
 func TestFilteredChainView(t *testing.T) {
 	// Initialize the harness around a btcd node which will serve as our
 	// dedicated miner to generate blocks, cause re-orgs, etc. We'll set up
-	// this node with a chain length of 125, so we have plentyyy of BTC to
+	// this node with a chain length of 125, so we have plenty of BTC to
 	// play around with.
 	miner, err := rpctest.New(netParams, nil, nil)
 	if err != nil {

routing/chainview/neutrino.go

@@ -17,7 +17,7 @@ import (
 // CfFilteredChainView is an implementation of the FilteredChainView interface
 // which is supported by an underlying Bitcoin light client which supports
 // client side filtering of Golomb Coded Sets. Rather than fetching all the
-// blocks, the light client is able to query fitlers locally, to test if an
+// blocks, the light client is able to query filters locally, to test if an
 // item in a block modifies any of our watched set of UTXOs.
 type CfFilteredChainView struct {
 	started int32

routing/chainview/queue.go

@@ -39,7 +39,7 @@ type blockEventQueue struct {
 	// will receive connected/new blocks from the FilteredChainView.
 	newBlocks chan *FilteredBlock
 
-	// stleBlocks is the channel where the consumer of the queue will
+	// staleBlocks is the channel where the consumer of the queue will
 	// receive disconnected/stale blocks from the FilteredChainView.
 	staleBlocks chan *FilteredBlock
 

routing/missioncontrol.go

@@ -92,7 +92,7 @@ type graphPruneView struct {
 // consulted during path finding. If a vertex/edge is found within the returned
 // prune view, it is to be ignored as a goroutine has had issues routing
 // through it successfully. Within this method the main view of the
-// missionControl is garbage collected as entires are detected to be "stale".
+// missionControl is garbage collected as entries are detected to be "stale".
 func (m *missionControl) GraphPruneView() graphPruneView {
 	// First, we'll grab the current time, this value will be used to
 	// determine if an entry is stale or not.

routing/notifications.go

@@ -135,7 +135,7 @@ func (r *ChannelRouter) notifyTopologyChange(topologyDiff *TopologyChange) {
 			// directly to the upstream client consumer.
 			case c.ntfnChan <- topologyDiff:
 
-			// If the client cancel's the notifications, then we'll
+			// If the client cancels the notifications, then we'll
 			// exit early.
 			case <-c.exit:
 

routing/notifications_test.go

@@ -347,7 +347,7 @@ func TestEdgeUpdateNotification(t *testing.T) {
 		bitcoinKey1.SerializeCompressed(), bitcoinKey2.SerializeCompressed(),
 		chanValue, 0)
 	if err != nil {
-		t.Fatalf("unbale create channel edge: %v", err)
+		t.Fatalf("unable create channel edge: %v", err)
 	}
 
 	// We'll also add a record for the block that included our funding
@@ -871,7 +871,7 @@ func TestChannelCloseNotification(t *testing.T) {
 		if len(closedChans) == 0 {
 			t.Fatal("close channel ntfn not populated")
 		} else if len(closedChans) != 1 {
-			t.Fatalf("only one should've been detected as closed, "+
+			t.Fatalf("only one should have been detected as closed, "+
 				"instead %v were", len(closedChans))
 		}
 

routing/pathfind_test.go

@@ -120,7 +120,7 @@ func makeTestGraph() (*channeldb.ChannelGraph, func(), error) {
 }
 
 // aliasMap is a map from a node's alias to its public key. This type is
-// provided in order to allow easily look up from the human rememberable alias
+// provided in order to allow easily look up from the human memorable alias
 // to an exact node's public key.
 type aliasMap map[string]*btcec.PublicKey
 
@@ -498,9 +498,9 @@ func TestKShortestPathFinding(t *testing.T) {
 		t.Fatalf("unable to fetch source node: %v", err)
 	}
 
-	// In this test we'd like to ensure that our algoirthm to find the
+	// In this test we'd like to ensure that our algorithm to find the
 	// k-shortest paths from a given source node to any destination node
-	// works as exepcted.
+	// works as expected.
 
 	// In our basic_graph.json, there exist two paths from roasbeef to luo
 	// ji. Our algorithm should properly find both paths, and also rank
@@ -514,13 +514,13 @@ func TestKShortestPathFinding(t *testing.T) {
 			"luo ji: %v", err)
 	}
 
-	// The algorithm should've found two paths from roasbeef to luo ji.
+	// The algorithm should have found two paths from roasbeef to luo ji.
 	if len(paths) != 2 {
 		t.Fatalf("two path shouldn't been found, instead %v were",
 			len(paths))
 	}
 
-	// Additinoally, the total hop length of the first path returned should
+	// Additionally, the total hop length of the first path returned should
 	// be _less_ than that of the second path returned.
 	if len(paths[0]) > len(paths[1]) {
 		t.Fatalf("paths found not ordered properly")
@@ -566,7 +566,7 @@ func TestNewRoutePathTooLong(t *testing.T) {
 
 	paymentAmt := lnwire.NewMSatFromSatoshis(100)
 
-	// We start by confirminig that routing a payment 20 hops away is possible.
+	// We start by confirming that routing a payment 20 hops away is possible.
 	// Alice should be able to find a valid route to ursula.
 	target := aliases["ursula"]
 	_, err = findPath(nil, graph, sourceNode, target, ignoredVertexes,
@@ -705,7 +705,7 @@ func TestRouteFailDisabledEdge(t *testing.T) {
 	ignoredVertexes := make(map[Vertex]struct{})
 
 	// First, we'll try to route from roasbeef -> songoku. This should
-	// suceed without issue, and return a single path.
+	// succeed without issue, and return a single path.
 	target := aliases["songoku"]
 	payAmt := lnwire.NewMSatFromSatoshis(10000)
 	_, err = findPath(nil, graph, sourceNode, target, ignoredVertexes,
@@ -726,7 +726,7 @@ func TestRouteFailDisabledEdge(t *testing.T) {
 	}
 
 	// Now, if we attempt to route through that edge, we should get a
-	// failure as it is no longer elligble.
+	// failure as it is no longer eligible.
 	_, err = findPath(nil, graph, sourceNode, target, ignoredVertexes,
 		ignoredEdges, payAmt)
 	if !IsError(err, ErrNoPathFound) {
@@ -792,7 +792,7 @@ func TestPathFindSpecExample(t *testing.T) {
 
 	// Now we'll examine the first route returned for correctness.
 	//
-	// It should be sending the exact payment amount as there're no
+	// It should be sending the exact payment amount as there are no
 	// additional hops.
 	firstRoute := routes[0]
 	if firstRoute.TotalAmount != amt {

routing/router.go

@@ -79,7 +79,7 @@ type ChannelGraphSource interface {
 		e1, e2 *channeldb.ChannelEdgePolicy) error) error
 }
 
-// FeeSchema is the set fee configuration for a Lighting Node on the network.
+// FeeSchema is the set fee configuration for a Lightning Node on the network.
 // Using the coefficients described within the schema, the required fee to
 // forward outgoing payments can be derived.
 type FeeSchema struct {
@@ -96,7 +96,7 @@ type FeeSchema struct {
 }
 
 // ChannelPolicy holds the parameters that determine the policy we enforce
-// when fowarding payments on a channel. These parameters are communicated
+// when forwarding payments on a channel. These parameters are communicated
 // to the rest of the network in ChannelUpdate messages.
 type ChannelPolicy struct {
 	// FeeSchema holds the fee configuration for a channel.
@@ -471,7 +471,7 @@ func (r *ChannelRouter) syncGraphWithChain() error {
 			return err
 		}
 
-		// We're only interested in all prior outputs that've been
+		// We're only interested in all prior outputs that have been
 		// spent in the block, so collate all the referenced previous
 		// outpoints within each tx and input.
 		var spentOutputs []*wire.OutPoint
@@ -529,7 +529,7 @@ func (r *ChannelRouter) networkHandler() {
 			// We'll set up any dependants, and wait until a free
 			// slot for this job opens up, this allow us to not
 			// have thousands of goroutines active.
-			validationBarrier.InitJobDependancies(updateMsg.msg)
+			validationBarrier.InitJobDependencies(updateMsg.msg)
 
 			go func() {
 				defer validationBarrier.CompleteJob()
@@ -632,7 +632,7 @@ func (r *ChannelRouter) networkHandler() {
 			log.Infof("Pruning channel graph using block %v (height=%v)",
 				chainUpdate.Hash, blockHeight)
 
-			// We're only interested in all prior outputs that've
+			// We're only interested in all prior outputs that have
 			// been spent in the block, so collate all the
 			// referenced previous outpoints within each tx and
 			// input.
@@ -730,7 +730,7 @@ func (r *ChannelRouter) networkHandler() {
 
 				// We'll ensure that we don't attempt to prune
 				// our *own* channels from the graph, as in any
-				// case this shuold be re-advertised by the
+				// case this should be re-advertised by the
 				// sub-system above us.
 				if info.NodeKey1.IsEqual(r.selfNode.PubKey) ||
 					info.NodeKey2.IsEqual(r.selfNode.PubKey) {
@@ -1572,7 +1572,7 @@ func (r *ChannelRouter) SendPayment(payment *LightningPayment) ([32]byte, *Route
 				// As this error indicates that the target
 				// channel was unable to carry this HTLC (for
 				// w/e reason), we'll query the index to find
-				// the _outgoign_ channel the source of the
+				// the _outgoing_ channel the source of the
 				// error was meant to pass the HTLC along to.
 				badChan, ok := route.nextHopChannel(errSource)
 				if !ok {
@@ -1648,7 +1648,7 @@ func (r *ChannelRouter) SendPayment(payment *LightningPayment) ([32]byte, *Route
 				// As this error indicates that the target
 				// channel was unable to carry this HTLC (for
 				// w/e reason), we'll query the index to find
-				// the _outgoign_ channel the source of the
+				// the _outgoing_ channel the source of the
 				// error was meant to pass the HTLC along to.
 				badChan, ok := route.nextHopChannel(errSource)
 				if !ok {
@@ -1671,7 +1671,7 @@ func (r *ChannelRouter) SendPayment(payment *LightningPayment) ([32]byte, *Route
 				continue
 
 			case *lnwire.FailPermanentNodeFailure:
-				// TODO(rosabeef): remove node from path
+				// TODO(roasbeef): remove node from path
 				continue
 
 			default:

routing/validation_barrier.go

@@ -26,17 +26,17 @@ type ValidationBarrier struct {
 	// dependants.
 	chanAnnFinSignal map[lnwire.ShortChannelID]chan struct{}
 
-	// chanEdgeDependancies tracks any channel edge updates which should
+	// chanEdgeDependencies tracks any channel edge updates which should
 	// wait until the completion of the ChannelAnnouncement before
 	// proceeding. This is a dependency, as we can't validate the update
 	// before we validate the announcement which creates the channel
 	// itself.
-	chanEdgeDependancies map[lnwire.ShortChannelID]chan struct{}
+	chanEdgeDependencies map[lnwire.ShortChannelID]chan struct{}
 
-	// nodeAnnDependancies tracks any pending NodeAnnouncement validation
+	// nodeAnnDependencies tracks any pending NodeAnnouncement validation
 	// jobs which should wait until the completion of the
 	// ChannelAnnouncement before proceeding.
-	nodeAnnDependancies map[Vertex]chan struct{}
+	nodeAnnDependencies map[Vertex]chan struct{}
 
 	quit chan struct{}
 	sync.Mutex
@@ -50,8 +50,8 @@ func NewValidationBarrier(numActiveReqs int,
 
 	v := &ValidationBarrier{
 		chanAnnFinSignal:     make(map[lnwire.ShortChannelID]chan struct{}),
-		chanEdgeDependancies: make(map[lnwire.ShortChannelID]chan struct{}),
-		nodeAnnDependancies:  make(map[Vertex]chan struct{}),
+		chanEdgeDependencies: make(map[lnwire.ShortChannelID]chan struct{}),
+		nodeAnnDependencies:  make(map[Vertex]chan struct{}),
 		quit:                 quitChan,
 	}
 
@@ -65,9 +65,9 @@ func NewValidationBarrier(numActiveReqs int,
 	return v
 }
 
-// InitJobDependancies will wait for a new job slot to become open, and then
-// sets up any dependant signals/trigger for the new job
-func (v *ValidationBarrier) InitJobDependancies(job interface{}) {
+// InitJobDependencies will wait for a new job slot to become open, and then
+// sets up any dependent signals/trigger for the new job
+func (v *ValidationBarrier) InitJobDependencies(job interface{}) {
 	// We'll wait for either a new slot to become open, or for the quit
 	// channel to be closed.
 	select {
@@ -79,7 +79,7 @@ func (v *ValidationBarrier) InitJobDependancies(job interface{}) {
 	defer v.Unlock()
 
 	// Once a slot is open, we'll examine the message of the job, to see if
-	// there need to be any dependant barriers set up.
+	// there need to be any dependent barriers set up.
 	switch msg := job.(type) {
 
 	// If this is a channel announcement, then we'll need to set up den
@@ -93,7 +93,7 @@ func (v *ValidationBarrier) InitJobDependancies(job interface{}) {
 		// one doesn't already exist, as there may be duplicate
 		// announcements.  We'll close this signal once the
 		// ChannelAnnouncement has been validated. This will result in
-		// all the dependant jobs being unlocked so they can finish
+		// all the dependent jobs being unlocked so they can finish
 		// execution themselves.
 		if _, ok := v.chanAnnFinSignal[msg.ShortChannelID]; !ok {
 			// We'll create the channel that we close after we
@@ -102,10 +102,10 @@ func (v *ValidationBarrier) InitJobDependancies(job interface{}) {
 			// at the same time.
 			annFinCond := make(chan struct{})
 			v.chanAnnFinSignal[msg.ShortChannelID] = annFinCond
-			v.chanEdgeDependancies[msg.ShortChannelID] = annFinCond
+			v.chanEdgeDependencies[msg.ShortChannelID] = annFinCond
 
-			v.nodeAnnDependancies[NewVertex(msg.NodeID1)] = annFinCond
-			v.nodeAnnDependancies[NewVertex(msg.NodeID2)] = annFinCond
+			v.nodeAnnDependencies[NewVertex(msg.NodeID1)] = annFinCond
+			v.nodeAnnDependencies[NewVertex(msg.NodeID2)] = annFinCond
 		}
 	case *channeldb.ChannelEdgeInfo:
 
@@ -114,10 +114,10 @@ func (v *ValidationBarrier) InitJobDependancies(job interface{}) {
 			annFinCond := make(chan struct{})
 
 			v.chanAnnFinSignal[shortID] = annFinCond
-			v.chanEdgeDependancies[shortID] = annFinCond
+			v.chanEdgeDependencies[shortID] = annFinCond
 
-			v.nodeAnnDependancies[NewVertex(msg.NodeKey1)] = annFinCond
-			v.nodeAnnDependancies[NewVertex(msg.NodeKey2)] = annFinCond
+			v.nodeAnnDependencies[NewVertex(msg.NodeKey1)] = annFinCond
+			v.nodeAnnDependencies[NewVertex(msg.NodeKey2)] = annFinCond
 		}
 
 	// These other types don't have any dependants, so no further
@@ -149,8 +149,8 @@ func (v *ValidationBarrier) CompleteJob() {
 
 // WaitForDependants will block until any jobs that this job dependants on have
 // finished executing. This allows us a graceful way to schedule goroutines
-// based on any pending uncompleted dependant jobs. If this job doesn't have an
-// active dependant, then this function will return immediately.
+// based on any pending uncompleted dependent jobs. If this job doesn't have an
+// active dependent, then this function will return immediately.
 func (v *ValidationBarrier) WaitForDependants(job interface{}) {
 
 	var (
@@ -165,15 +165,15 @@ func (v *ValidationBarrier) WaitForDependants(job interface{}) {
 	// completion of any active ChannelAnnouncement jobs related to them.
 	case *channeldb.ChannelEdgePolicy:
 		shortID := lnwire.NewShortChanIDFromInt(msg.ChannelID)
-		signal, ok = v.chanEdgeDependancies[shortID]
+		signal, ok = v.chanEdgeDependencies[shortID]
 	case *channeldb.LightningNode:
 		vertex := NewVertex(msg.PubKey)
-		signal, ok = v.nodeAnnDependancies[vertex]
+		signal, ok = v.nodeAnnDependencies[vertex]
 	case *lnwire.ChannelUpdate:
-		signal, ok = v.chanEdgeDependancies[msg.ShortChannelID]
+		signal, ok = v.chanEdgeDependencies[msg.ShortChannelID]
 	case *lnwire.NodeAnnouncement:
 		vertex := NewVertex(msg.NodeID)
-		signal, ok = v.nodeAnnDependancies[vertex]
+		signal, ok = v.nodeAnnDependencies[vertex]
 
 	// Other types of jobs can be executed immediately, so we'll just
 	// return directly.
@@ -201,7 +201,7 @@ func (v *ValidationBarrier) WaitForDependants(job interface{}) {
 	}
 }
 
-// SignalDependants will signal any jobs that are dependant on this job that
+// SignalDependants will signal any jobs that are dependent on this job that
 // they can continue execution. If the job doesn't have any dependants, then
 // this function sill exit immediately.
 func (v *ValidationBarrier) SignalDependants(job interface{}) {
@@ -212,7 +212,7 @@ func (v *ValidationBarrier) SignalDependants(job interface{}) {
 
 	// If we've just finished executing a ChannelAnnouncement, then we'll
 	// close out the signal, and remove the signal from the map of active
-	// ones. This will allow any dependant jobs to continue execution.
+	// ones. This will allow any dependent jobs to continue execution.
 	case *channeldb.ChannelEdgeInfo:
 		shortID := lnwire.NewShortChanIDFromInt(msg.ChannelID)
 		finSignal, ok := v.chanAnnFinSignal[shortID]
@@ -227,20 +227,20 @@ func (v *ValidationBarrier) SignalDependants(job interface{}) {
 			delete(v.chanAnnFinSignal, msg.ShortChannelID)
 		}
 
-		delete(v.chanEdgeDependancies, msg.ShortChannelID)
+		delete(v.chanEdgeDependencies, msg.ShortChannelID)
 
 	// For all other job types, we'll delete the tracking entries from the
 	// map, as if we reach this point, then all dependants have already
 	// finished executing and we can proceed.
 	case *channeldb.LightningNode:
-		delete(v.nodeAnnDependancies, NewVertex(msg.PubKey))
+		delete(v.nodeAnnDependencies, NewVertex(msg.PubKey))
 	case *lnwire.NodeAnnouncement:
-		delete(v.nodeAnnDependancies, NewVertex(msg.NodeID))
+		delete(v.nodeAnnDependencies, NewVertex(msg.NodeID))
 	case *lnwire.ChannelUpdate:
-		delete(v.chanEdgeDependancies, msg.ShortChannelID)
+		delete(v.chanEdgeDependencies, msg.ShortChannelID)
 	case *channeldb.ChannelEdgePolicy:
 		shortID := lnwire.NewShortChanIDFromInt(msg.ChannelID)
-		delete(v.chanEdgeDependancies, shortID)
+		delete(v.chanEdgeDependencies, shortID)
 
 	case *lnwire.AnnounceSignatures:
 		return