From 6fd6001571d973041679c3c57eb80184e188205c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Robin=20H=C3=BCbner?= <profan@pagefault.se>
Date: Tue, 13 Jan 2015 01:59:09 +0100
Subject: [PATCH] Sort again.

---
 rockspecs/bk-tree-1.0.0-1.rockspec | 11 +++++------
 rockspecs/bk-tree-1.0.0-2.rockspec | 27 ---------------------------
 rockspecs/bk-tree-1.0.0-3.rockspec | 25 -------------------------
 3 files changed, 5 insertions(+), 58 deletions(-)
 delete mode 100644 rockspecs/bk-tree-1.0.0-2.rockspec
 delete mode 100644 rockspecs/bk-tree-1.0.0-3.rockspec

diff --git a/rockspecs/bk-tree-1.0.0-1.rockspec b/rockspecs/bk-tree-1.0.0-1.rockspec
index 6d4d782..70c26f3 100644
--- a/rockspecs/bk-tree-1.0.0-1.rockspec
+++ b/rockspecs/bk-tree-1.0.0-1.rockspec
@@ -1,15 +1,14 @@
 package = "bk-tree"
-version = "1.0-1"
+version = "1.0.0-1"
 source = {
-	url = "https://github.com/profan/lua-bk-tree/archive/lua-bk-tree-1.0.0.tar.gz"
+	url = "https://github.com/profan/lua-bk-tree/archive/lua-bk-tree-1.0.0.tar.gz",
+	dir = "lua-bk-tree-1.0.0"
 }
 
 description = {
-	summary = "bk-tree datastructure",
+	summary = "BK-trees, commonly used for finding near matches to strings.",
 	detailed = [[
-		Burkhard-Keller Trees or bk-trees, 
-		a datastructure commonly used for fuzzy
-		string matching, spell checkign or similar.
+Burkhard-Keller Trees or bk-trees, a datastructure commonly used for fuzzy string matching, spell checking or similar, comes with a levenshtein distance metric for measuring similarity.
 	]],
 	homepage = "http://profan.github.io/lua-bk-tree/",
 	license = "MIT/X11"
diff --git a/rockspecs/bk-tree-1.0.0-2.rockspec b/rockspecs/bk-tree-1.0.0-2.rockspec
deleted file mode 100644
index 0ff101e..0000000
--- a/rockspecs/bk-tree-1.0.0-2.rockspec
+++ /dev/null
@@ -1,27 +0,0 @@
-package = "bk-tree"
-version = "1.0.0-2"
-source = {
-	url = "https://github.com/profan/lua-bk-tree/archive/lua-bk-tree-1.0.0.tar.gz"
-}
-
-description = {
-	summary = "BK-trees, commonly used for finding near matches to strings.",
-	detailed = [[
-		Burkhard-Keller Trees or bk-trees, 
-		a datastructure commonly used for fuzzy
-		string matching, spell checking or similar.
-	]],
-	homepage = "http://profan.github.io/lua-bk-tree/",
-	license = "MIT/X11"
-}
-
-dependencies = {
-	"lua >= 5.1"
-}
-
-build = {
-	type = "builtin",
-	modules = {
-		["bk-tree"] = "bk-tree.lua"
-	}
-}
diff --git a/rockspecs/bk-tree-1.0.0-3.rockspec b/rockspecs/bk-tree-1.0.0-3.rockspec
deleted file mode 100644
index acbdfee..0000000
--- a/rockspecs/bk-tree-1.0.0-3.rockspec
+++ /dev/null
@@ -1,25 +0,0 @@
-package = "bk-tree"
-version = "1.0.0-3"
-source = {
-	url = "https://github.com/profan/lua-bk-tree/archive/lua-bk-tree-1.0.0.tar.gz"
-}
-
-description = {
-	summary = "BK-trees, commonly used for finding near matches to strings.",
-	detailed = [[
-Burkhard-Keller Trees or bk-trees, a datastructure commonly used for fuzzy string matching, spell checking or similar, comes with a levenshtein distance metric for measuring similarity.
-	]],
-	homepage = "http://profan.github.io/lua-bk-tree/",
-	license = "MIT/X11"
-}
-
-dependencies = {
-	"lua >= 5.1"
-}
-
-build = {
-	type = "builtin",
-	modules = {
-		["bk-tree"] = "bk-tree.lua"
-	}
-}