mirror
/
tile38
mirror of https://github.com/tidwall/tile38.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

misspellings

This commit is contained in:
Josh Baker 2016-04-02 18:31:45 -07:00
parent 8092fa4db9
commit 8a97ea2218
4 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
client/conn_test.go
View File

@ -40,7 +40,7 @@ func ExampleDialPool() {
}() }()
time.Sleep(time.Second / 2) // wait a moment time.Sleep(time.Second / 2) // wait a moment
// Retreive the point we just set. // Retrieve the point we just set.
go func() { go func() {
conn, err := pool.Get() // get a conn from the pool conn, err := pool.Get() // get a conn from the pool
if err != nil { if err != nil {

1
controller/dev.go
View File

@ -20,7 +20,6 @@ func (c *Controller) cmdMassInsert(msg *server.Message) (res string, err error)
start := time.Now() start := time.Now()
vs := msg.Values[1:] vs := msg.Values[1:]
// massinsert simply forwards a bunch of cmdSets
var snumCols, snumPoints string var snumCols, snumPoints string
var cols, objs int var cols, objs int
var ok bool var ok bool

2
index/qtree/qtree.go
View File

@ -24,7 +24,7 @@ type nodeT struct {
nodes [4]*nodeT nodes [4]*nodeT
} }
// QTree is an implentation of a quad tree // QTree is an implementation of a quad tree
type QTree struct { type QTree struct {
root *nodeT root *nodeT
minX, minY float64 minX, minY float64

2
index/rtree/rtree.go
View File

@ -274,7 +274,7 @@ func disconnectBranch(node *nodeT, index int) {
} }
// Pick a branch. Pick the one that will need the smallest increase // 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. // 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 // In case of a tie, pick the one which was smaller before, to get
// the best resolution when searching. // the best resolution when searching.