summaryrefslogtreecommitdiffhomepage
path: root/table
diff options
context:
space:
mode:
authorIWASE Yusuke <iwase.yusuke0@gmail.com>2017-10-12 11:37:54 +0900
committerFUJITA Tomonori <fujita.tomonori@lab.ntt.co.jp>2017-11-01 21:56:21 +0900
commitd8a897a0dd04a0d641ea10622180938c76f8e924 (patch)
treeeb803e611de80e3ab41f1470be3702387a662327 /table
parentfbc493411b3656c97cc979d086e5eecb942859c1 (diff)
Fix some typos found by spell checker
Signed-off-by: IWASE Yusuke <iwase.yusuke0@gmail.com>
Diffstat (limited to 'table')
-rw-r--r--table/destination.go2
1 files changed, 1 insertions, 1 deletions
diff --git a/table/destination.go b/table/destination.go
index 0ad0f6f9..9631fc1c 100644
--- a/table/destination.go
+++ b/table/destination.go
@@ -500,7 +500,7 @@ func (dest *Destination) computeKnownBestPath() (*Path, BestPathReason, error) {
log.WithFields(log.Fields{
"Topic": "Table",
- }).Debugf("computeKnownBestPath known pathlist: %d", len(dest.knownPathList))
+ }).Debugf("computeKnownBestPath knownPathList: %d", len(dest.knownPathList))
// We pick the first path as current best path. This helps in breaking
// tie between two new paths learned in one cycle for which best-path