From 847c7d336b70e0cab48621905c8cd85d9a342bee Mon Sep 17 00:00:00 2001
From: bfs15 <bruno.serbena@gmail.com>
Date: Wed, 21 Jun 2017 10:28:24 -0300
Subject: [PATCH] sort order fix, started wdf fun
---
lib/tasks/tag_clustering.rake | 20 ++++++++++++++++++--
1 file changed, 18 insertions(+), 2 deletions(-)
diff --git a/lib/tasks/tag_clustering.rake b/lib/tasks/tag_clustering.rake
index 7baea600c..81afb55c3 100644
--- a/lib/tasks/tag_clustering.rake
+++ b/lib/tasks/tag_clustering.rake
@@ -135,6 +135,22 @@ namespace :tag do
private
+ def tagWdfSorted()
+ tagWdf = []
+
+ Tag.all.each_with_index do |t,i|
+ tagWdf << [t.id, wdfSearch(t.name)]
+ end
+
+ tagWdf = tagWdf.sort_by { |t| t[1] }
+
+ return tagWdf
+ end
+
+ def wdfSearch(tname)
+
+ end
+
def merge(search_los, relevant_los)
merged_los = []
@@ -172,8 +188,8 @@ namespace :tag do
end
merged_los.push(*relevant_los)
- merged_los = merged_los.sort_by { |lo| lo[1] }
- return merged_los.reverse.first(50)
+ merged_los = merged_los.sort_by { |lo| lo[1]*-1 }
+ return merged_los.first(50)
end
# hash[id1][id2] will equal how many times tags with id1 and id2 appear together on a LO
--
GitLab