Fix typos

Author: NathanBaulch

CHANGELOG.md

@@ -73,7 +73,7 @@ This tag is broken, please use v0.7.1 instead.
 
 ### Breaking Changes
 
--   tilecover now returns an error (vs. panicing) on non-closed 2d geometry by [@paulmach](https://github.com/paulmach) in https://github.com/paulmach/orb/pull/87
+-   tilecover now returns an error (vs. panicking) on non-closed 2d geometry by [@paulmach](https://github.com/paulmach) in https://github.com/paulmach/orb/pull/87
 
     This changes the signature of many of the methods in the [maptile/tilecover](https://github.com/paulmach/orb/tree/master/maptile/tilecover) package.
     To emulate the old behavior replace:

README.md

@@ -10,7 +10,7 @@ They each provide their own README with extra info.
 -   **GeoJSON** - support as part of the [`geojson`](geojson) sub-package.
 -   **Mapbox Vector Tile** - encoding and decoding as part of the [`encoding/mvt`](encoding/mvt) sub-package.
 -   **Direct to type from DB query results** - by scanning WKB data directly into types.
--   **Rich set of sub-packages** - including [`clipping`](clip), [`simplifing`](simplify), [`quadtree`](quadtree) and more.
+-   **Rich set of sub-packages** - including [`clipping`](clip), [`simplifying`](simplify), [`quadtree`](quadtree) and more.
 
 ## Type definitions
 
@@ -142,7 +142,7 @@ layers.RemoveEmpty(1.0, 2.0)
 // encoding using the Mapbox Vector Tile protobuf encoding.
 data, err := mvt.Marshal(layers) // this data is NOT gzipped.
 
-// Sometimes MVT data is stored and transfered gzip compressed. In that case:
+// Sometimes MVT data is stored and transferred gzip compressed. In that case:
 data, err := mvt.MarshalGzipped(layers)
 ```
 

bound.go

@@ -156,12 +156,12 @@ func (b Bound) IsEmpty() bool {
 	return b.Min[0] > b.Max[0] || b.Min[1] > b.Max[1]
 }
 
-// IsZero return true if the bound just includes just null island.
+// IsZero return true if the bound includes just null island.
 func (b Bound) IsZero() bool {
 	return b.Max == Point{} && b.Min == Point{}
 }
 
-// Bound returns the the same bound.
+// Bound returns the same bound.
 func (b Bound) Bound() Bound {
 	return b
 }

clip/clip_test.go

@@ -29,7 +29,7 @@ func TestInternalLine(t *testing.T) {
 			},
 		},
 		{
-			name:  "clips line crossign many times",
+			name:  "clips line crossing many times",
 			bound: orb.Bound{Min: orb.Point{0, 0}, Max: orb.Point{20, 20}},
 			input: orb.LineString{
 				{10, -10}, {10, 30}, {20, 30}, {20, -10},
@@ -175,7 +175,7 @@ func TestLineString(t *testing.T) {
 		output orb.MultiLineString
 	}{
 		{
-			name:  "clips line crossign many times",
+			name:  "clips line crossing many times",
 			bound: orb.Bound{Min: orb.Point{0, 0}, Max: orb.Point{20, 20}},
 			input: orb.LineString{
 				{10, -10}, {10, 30}, {20, 30}, {20, -10},
@@ -233,7 +233,7 @@ func TestLineString_OpenBound(t *testing.T) {
 		output orb.MultiLineString
 	}{
 		{
-			name:  "clips line crossign many times",
+			name:  "clips line crossing many times",
 			bound: orb.Bound{Min: orb.Point{0, 0}, Max: orb.Point{20, 20}},
 			input: orb.LineString{
 				{10, -10}, {10, 30}, {20, 30}, {20, -10},

clip/smartclip/README.md

@@ -4,7 +4,7 @@ This package extends the clip functionality to handle partial 2d geometries. The
 rings need to only intersect the bound. The algorithm will use that, plus the orientation, to
 wrap/close the rings around the edge of the bound.
 
-The use case is [OSM multipolyon relations](https://wiki.openstreetmap.org/wiki/Relation#Multipolygon)
+The use case is [OSM multipolygon relations](https://wiki.openstreetmap.org/wiki/Relation#Multipolygon)
 where a ring (inner or outer) contains multiple ways but only one is in the current viewport.
 With only the ways intersecting the viewport and their orientation the correct shape can be drawn.
 
@@ -17,7 +17,7 @@ bound := orb.Bound{Min: orb.Point{1, 1}, Max: orb.Point{10, 10}}
 ring := orb.Ring{{0, 0}, {11, 11}}
 clipped := smartclip.Ring(bound, ring, orb.CCW)
 
-// clipped is a multipolyon with one ring that wraps counter-clockwise
+// clipped is a multipolygon with one ring that wraps counter-clockwise
 // around the top triangle of the box
 // [[[[1 1] [10 10] [5.5 10] [1 10] [1 5.5] [1 1]]]]
 ```

clip/smartclip/smart.go

@@ -287,7 +287,7 @@ func smartWrap(box orb.Bound, input []orb.LineString, o orb.Orientation) orb.Mul
 
 	// this operation is O(n^2). Technically we could use a linked list
 	// and remove points instead of marking them as "used".
-	// However since n is 2x the number of segements I think we're okay.
+	// However since n is 2x the number of segments I think we're okay.
 	for i := 0; i < 2*len(points); i++ {
 		ep := points[i%len(points)]
 		if ep.Used {

clip/smartclip/smart_test.go

@@ -137,7 +137,7 @@ func TestRing(t *testing.T) {
 					t.Logf("%v", expected)
 				}
 
-				// should give same result if mulipolygon
+				// should give same result if multipolygon
 				result = MultiPolygon(bound, orb.MultiPolygon{{input}}, o)
 				if !deepEqualMultiPolygon(result, expected) {
 					t.Errorf("incorrect multipolygon")
@@ -159,7 +159,7 @@ func TestPolygon(t *testing.T) {
 		expected orb.MultiPolygon
 	}{
 		{
-			name:  "with innner ring",
+			name:  "with inner ring",
 			bound: oneSix,
 			input: orb.Polygon{
 				{{0, 2}, {5, 2}, {5, 5}, {0, 5}, {0, 2}},
@@ -171,7 +171,7 @@ func TestPolygon(t *testing.T) {
 			}},
 		},
 		{
-			name:  "with innner ring that will share a side with the outer ring",
+			name:  "with inner ring that will share a side with the outer ring",
 			bound: oneSix,
 			input: orb.Polygon{
 				{{0, 2}, {3, 2}, {3, 5}, {0, 5}},
@@ -321,7 +321,7 @@ func TestPolygon(t *testing.T) {
 					t.Logf("%v", expected)
 				}
 
-				// should give same result if inputed as multi polygon
+				// should give same result if inputted as multi polygon
 				result = MultiPolygon(bound, orb.MultiPolygon{input}, o)
 				if !deepEqualMultiPolygon(result, expected) {
 					t.Errorf("incorrect multipolygon")
@@ -378,7 +378,7 @@ func TestClipMultiPolygon(t *testing.T) {
 			},
 		},
 		{
-			name:  "polygon with innner ring and single ring polygon",
+			name:  "polygon with inner ring and single ring polygon",
 			bound: orb.Bound{Min: orb.Point{1, 1}, Max: orb.Point{9, 9}},
 			input: orb.MultiPolygon{
 				{

encoding/ewkb/ewkb_test.go

@@ -83,7 +83,7 @@ func compare(t testing.TB, e orb.Geometry, s int, b []byte) {
 		t.Errorf("decoder: incorrect srid: %v != %v", srid, s)
 	}
 
-	// Umarshal
+	// Unmarshal
 	g, srid, err = Unmarshal(b)
 	if err != nil {
 		t.Fatalf("unmarshal: read error: %v", err)
@@ -111,7 +111,7 @@ func compare(t testing.TB, e orb.Geometry, s int, b []byte) {
 	if !bytes.Equal(data, b) {
 		t.Logf("%v", data)
 		t.Logf("%v", b)
-		t.Errorf("marshal: incorrent encoding")
+		t.Errorf("marshal: incorrect encoding")
 	}
 
 	// Encode
@@ -132,7 +132,7 @@ func compare(t testing.TB, e orb.Geometry, s int, b []byte) {
 	if !bytes.Equal(data, buf.Bytes()) {
 		t.Logf("%v", data)
 		t.Logf("%v", b)
-		t.Errorf("encode: incorrent encoding")
+		t.Errorf("encode: incorrect encoding")
 	}
 
 	// pass in srid
@@ -146,7 +146,7 @@ func compare(t testing.TB, e orb.Geometry, s int, b []byte) {
 	if !bytes.Equal(data, buf.Bytes()) {
 		t.Logf("%v", data)
 		t.Logf("%v", b)
-		t.Errorf("encode with srid: incorrent encoding")
+		t.Errorf("encode with srid: incorrect encoding")
 	}
 
 	// preallocation

encoding/ewkb/scanner_test.go

@@ -1184,7 +1184,7 @@ func TestScanBound_errors(t *testing.T) {
 }
 
 func TestValue(t *testing.T) {
-	t.Run("marshalls geometry", func(t *testing.T) {
+	t.Run("marshals geometry", func(t *testing.T) {
 		testPoint := orb.Point{1, 2}
 		testPointData := MustMarshal(testPoint, 4326)
 		val, err := Value(testPoint, 4326).Value()

encoding/internal/wkbcommon/wkb.go

@@ -30,7 +30,7 @@ const (
 
 const (
 	// limits so that bad data can't come in and preallocate tons of memory.
-	// Well formed data with less elements will allocate the correct amount just fine.
+	// Well formed data with fewer elements will allocate the correct amount just fine.
 	MaxPointsAlloc = 10000
 	MaxMultiAlloc  = 100
 )