akovalenko/lnd.xprv
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

config+pathfind_test+notifications_test: format and fix newVertex import

Browse Source 
Run go fmt so config file is formatted correctly. Also rename
newVertex to NewVertex in pathfind_test and notifications_test
as it is now exported from the routing package.
This commit is contained in:
Laura Cressman 2017-11-03 17:42:02 -04:00 committed by Olaoluwa Osuntokun
parent 918ef2808f
commit 7408aa6c8d
3 changed files with 7 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
config.go
View File

@ -131,7 +131,6 @@ type config struct {
NoNetBootstrap bool `long:"nobootstrap" description:"If true, then automatic network bootstrapping will not be attempted."`
NoEncryptWallet bool `long:"noencryptwallet" description:"If set, wallet will be encrypted using the default passphrase."`
TrickleDelay int `long:"trickledelay" description:"Time in milliseconds between each release of announcements to the network"`

12
routing/notifications_test.go
View File

@ -450,8 +450,8 @@ func TestEdgeUpdateNotification(t *testing.T) {
// Create lookup map for notifications we are intending to receive. Entries
// are removed from the map when the anticipated notification is received.
var waitingFor = map[Vertex]int{
newVertex(node1.PubKey): 1,
newVertex(node2.PubKey): 2,
NewVertex(node1.PubKey): 1,
NewVertex(node2.PubKey): 2,
}
const numEdgePolicies = 2
@ -466,7 +466,7 @@ func TestEdgeUpdateNotification(t *testing.T) {
}
edgeUpdate := ntfn.ChannelEdgeUpdates[0]
nodeVertex := newVertex(edgeUpdate.AdvertisingNode)
nodeVertex := NewVertex(edgeUpdate.AdvertisingNode)
if idx, ok := waitingFor[nodeVertex]; ok {
switch idx {
@ -609,8 +609,8 @@ func TestNodeUpdateNotification(t *testing.T) {
// Create lookup map for notifications we are intending to receive. Entries
// are removed from the map when the anticipated notification is received.
var waitingFor = map[Vertex]int{
newVertex(node1.PubKey): 1,
newVertex(node2.PubKey): 2,
NewVertex(node1.PubKey): 1,
NewVertex(node2.PubKey): 2,
}
// Exactly two notifications should be sent, each corresponding to the
@ -627,7 +627,7 @@ func TestNodeUpdateNotification(t *testing.T) {
}
nodeUpdate := ntfn.NodeUpdates[0]
nodeVertex := newVertex(nodeUpdate.IdentityKey)
nodeVertex := NewVertex(nodeUpdate.IdentityKey)
if idx, ok := waitingFor[nodeVertex]; ok {
switch idx {
case 1:

2
routing/pathfind_test.go
View File

@ -300,7 +300,7 @@ func TestBasicGraphPathFinding(t *testing.T) {
if err != nil {
t.Fatalf("unable to fetch source node: %v", err)
}
sourceVertex := newVertex(sourceNode.PubKey)
sourceVertex := NewVertex(sourceNode.PubKey)
ignoredEdges := make(map[uint64]struct{})
ignoredVertexes := make(map[Vertex]struct{})