From 8a97ea2218601b8d7754f18c8335539a64bb5a83 Mon Sep 17 00:00:00 2001 From: Josh Baker Date: Sat, 2 Apr 2016 18:31:45 -0700 Subject: [PATCH] misspellings --- client/conn_test.go | 2 +- controller/dev.go | 1 - index/qtree/qtree.go | 2 +- index/rtree/rtree.go | 2 +- 4 files changed, 3 insertions(+), 4 deletions(-) diff --git a/client/conn_test.go b/client/conn_test.go index ceefff13..2e5521eb 100644 --- a/client/conn_test.go +++ b/client/conn_test.go @@ -40,7 +40,7 @@ func ExampleDialPool() { }() time.Sleep(time.Second / 2) // wait a moment - // Retreive the point we just set. + // Retrieve the point we just set. go func() { conn, err := pool.Get() // get a conn from the pool if err != nil { diff --git a/controller/dev.go b/controller/dev.go index 8cd5be04..ee81aeaf 100644 --- a/controller/dev.go +++ b/controller/dev.go @@ -20,7 +20,6 @@ func (c *Controller) cmdMassInsert(msg *server.Message) (res string, err error) start := time.Now() vs := msg.Values[1:] - // massinsert simply forwards a bunch of cmdSets var snumCols, snumPoints string var cols, objs int var ok bool diff --git a/index/qtree/qtree.go b/index/qtree/qtree.go index 49d57b6c..39f78ff1 100644 --- a/index/qtree/qtree.go +++ b/index/qtree/qtree.go @@ -24,7 +24,7 @@ type nodeT struct { nodes [4]*nodeT } -// QTree is an implentation of a quad tree +// QTree is an implementation of a quad tree type QTree struct { root *nodeT minX, minY float64 diff --git a/index/rtree/rtree.go b/index/rtree/rtree.go index a5b77517..41189196 100644 --- a/index/rtree/rtree.go +++ b/index/rtree/rtree.go @@ -274,7 +274,7 @@ func disconnectBranch(node *nodeT, index int) { } // Pick a branch. Pick the one that will need the smallest increase -// in area to accomodate the new rectangle. This will result in the +// in area to accommodate the new rectangle. This will result in the // least total area for the covering rectangles in the current node. // In case of a tie, pick the one which was smaller before, to get // the best resolution when searching.