Permalink
Browse files

I like this frecency algorithm better. comments welcome

  • Loading branch information...
1 parent 8bc0199 commit 44a86225d1aa68bba952337d10da2d451796dac3 @rupa committed Jun 25, 2009
Showing with 2 additions and 2 deletions.
  1. +2 −2 j.py
View
@@ -73,13 +73,13 @@ def frecent(self):
r = []
for i in self.m:
if i[1] <= 3600:
- r.append((i[0]*10, i[2]))
+ r.append((i[0]*4, i[2]))
elif i[1] <= 86400:
r.append((i[0]*2, i[2]))
elif i[1] <= 604800:
r.append((i[0]/2, i[2]))
else:
- r.append((i[0]/10, i[2]))
+ r.append((i[0]/4, i[2]))
return sorted(r)
def matches(self, args, nocase=False):

0 comments on commit 44a8622

Please sign in to comment.