Renamed package lev -> levenshtein

agext · Apr 12, 2016 · 3e941b9 · 3e941b9
1 parent 84e2e47
commit 3e941b9
Show file tree

Hide file tree

Showing 6 changed files with 10 additions and 10 deletions.
diff --git a/NOTICE b/NOTICE
@@ -1,4 +1,4 @@
-Alrux Go EXTensions (AGExt) - package lev
+Alrux Go EXTensions (AGExt) - package levenshtein
 Copyright 2016 ALRUX Inc.
 
 This product includes software developed at ALRUX Inc.

diff --git a/README.md b/README.md
@@ -4,13 +4,13 @@ This package implements distance and similarity metrics for strings, based on th
 
 ## Maturity
 
-[![Build Status](https://travis-ci.org/agext/lev.svg?branch=master)](https://travis-ci.org/agext/lev)
+[![Build Status](https://travis-ci.org/agext/levenshtein.svg?branch=master)](https://travis-ci.org/agext/levenshtein)
 
 v1.1 Stable: Guaranteed no breaking changes to the API in future v1.x releases. No known bugs or performance issues. Probably safe to use in production, though provided on "AS IS" basis.
 
 ## Overview
 
-[![GoDoc](https://godoc.org/github.com/agext/lev?status.png)](https://godoc.org/github.com/agext/lev)
+[![GoDoc](https://godoc.org/github.com/agext/levenshtein?status.png)](https://godoc.org/github.com/agext/levenshtein)
 
 The Levenshtein `Distance` between two strings is the minimum total cost of edits that would convert the first string into the second. The allowed edit operations are insertions, deletions, and substitutions, all at character (one UTF-8 code point) level. Each operation has a default cost of 1, but each can be assigned its own cost equal to or greater than 0.
 
@@ -25,9 +25,9 @@ The underlying `Calculate` function is also exported, to allow the building of o
 ## Installation
 
 ```
-go get github.com/agext/lev
+go get github.com/agext/levenshtein
 ```
 
 ## License
 
-Package lev is released under the Apache 2.0 license. See the [LICENSE](LICENSE) file for details.
+Package levenshtein is released under the Apache 2.0 license. See the [LICENSE](LICENSE) file for details.
diff --git a/lev.go → levenshtein.go b/lev.go → levenshtein.go
@@ -13,7 +13,7 @@
 // limitations under the License.
 
 /*
-Package lev implements distance and similarity metrics for strings, based on the Levenshtein measure.
+Package levenshtein implements distance and similarity metrics for strings, based on the Levenshtein measure.
 
 The Levenshtein `Distance` between two strings is the minimum total cost of edits that would convert the first string into the second. The allowed edit operations are insertions, deletions, and substitutions, all at character (one UTF-8 code point) level. Each operation has a default cost of 1, but each can be assigned its own cost equal to or greater than 0.
 
@@ -25,7 +25,7 @@ The `Match` function provides a similarity metric, with the same range and meani
 
 The underlying `Calculate` function is also exported, to allow the building of other derivative metrics, if needed.
 */
-package lev
+package levenshtein
 
 // Calculate determines the Levenshtein distance between two strings, using
 // the given costs for each edit operation. It returns the distance along with

diff --git a/lev_test.go → levenshtein_test.go b/lev_test.go → levenshtein_test.go
@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package lev
+package levenshtein
 
 import (
 	"testing"

diff --git a/params.go b/params.go
@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package lev
+package levenshtein
 
 // Params represents a set of parameter values for the various formulas involved
 // in the calculation of the Levenshtein string metrics.

diff --git a/params_test.go b/params_test.go
@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package lev
+package levenshtein
 
 import (
 	"testing"