regluit/core/userlists.py

44 lines
1.7 KiB
Python
Raw Normal View History

#put logic for retrieving userlists here
import random
from django.contrib.auth.models import User
from regluit.core.models import Work
def other_users(user, how_many):
# do something more sophisticated later?
# limit to candidates with nonempty wishlists
candidates = User.objects.filter(wishlist__wishes__gte=1).distinct()
count = candidates.count()
if count <= how_many :
user_list = candidates[0: count]
else :
slice = random.random() * (count - how_many)
user_list = candidates.filter(is_staff=False)[slice: slice+how_many]
return user_list
def supporting_users(work, how_many):
2011-12-03 03:31:39 +00:00
# do something more sophisticated sometime later
count = work.num_wishes
if count <= how_many :
user_list = work.wished_by()[0: count]
else :
slice = random.random() * (count - how_many)
2013-02-06 20:05:16 +00:00
user_list = work.wished_by().filter(is_staff=False)[slice: slice+how_many]
return user_list
2011-12-03 03:31:39 +00:00
def work_list_users(work_list, how_many):
"""return up to how_many users with one of the works on work_list in their wishlist"""
#users = User.objects.filter(wishlist__works__in=work_list).distinct().reverse()
# for MySQL, avoiding a nested query is more efficient: https://docs.djangoproject.com/en/dev/ref/models/querysets/#in
2013-02-06 20:05:16 +00:00
users = User.objects.filter(wishlist__works__in=list(work_list[:100]), is_staff=False).distinct().reverse()
return users.all()[0:how_many]
def campaign_list_users(campaign_list, how_many):
2013-02-06 20:05:16 +00:00
users = User.objects.filter(wishlist__works__campaigns__in=list(campaign_list[:100]), is_staff=False).distinct().reverse()
count = users.count()
if count <= how_many :
user_list = users[0: count]
else :
2011-12-03 17:02:26 +00:00
user_list = users[0: how_many]
return user_list