findDocuments: improve performance of positions queries
References #2935
This commit is contained in:
parent
8d25e3be78
commit
09ebbc9cc6
1 changed files with 28 additions and 2 deletions
|
@ -165,6 +165,33 @@ def parse_query(data, user):
|
||||||
return query
|
return query
|
||||||
|
|
||||||
|
|
||||||
|
def get_positions(qs, query_positions):
|
||||||
|
'''
|
||||||
|
qs: a QuerySet
|
||||||
|
query_positions: a list of AZ ids
|
||||||
|
|
||||||
|
TODO: merge this with item.utils.get_positions. The win is to fetch
|
||||||
|
only the integer IDs and convert the (smaller) set of query_positions to
|
||||||
|
ints, rather than fetch all keys for everything in qs (expected to be many
|
||||||
|
orders of magnitude larger), ignore most of it, and convert those ids to
|
||||||
|
strings.
|
||||||
|
|
||||||
|
Returns:
|
||||||
|
{
|
||||||
|
i: index of i in qs
|
||||||
|
for i in query_positions
|
||||||
|
}
|
||||||
|
'''
|
||||||
|
ids = list(qs.values_list('id', flat=True))
|
||||||
|
ret = {}
|
||||||
|
for i in query_positions:
|
||||||
|
try:
|
||||||
|
ret[i] = ids.index(ox.fromAZ(i))
|
||||||
|
except:
|
||||||
|
pass
|
||||||
|
return ret
|
||||||
|
|
||||||
|
|
||||||
def findDocuments(request, data):
|
def findDocuments(request, data):
|
||||||
'''
|
'''
|
||||||
Finds documents for a given query
|
Finds documents for a given query
|
||||||
|
@ -198,8 +225,7 @@ def findDocuments(request, data):
|
||||||
#FIXME: actually implement position requests
|
#FIXME: actually implement position requests
|
||||||
response['data']['position'] = 0
|
response['data']['position'] = 0
|
||||||
elif 'positions' in data:
|
elif 'positions' in data:
|
||||||
ids = [i.get_id() for i in qs]
|
response['data']['positions'] = get_positions(qs, query['positions'])
|
||||||
response['data']['positions'] = utils.get_positions(ids, query['positions'])
|
|
||||||
else:
|
else:
|
||||||
r = qs.aggregate(
|
r = qs.aggregate(
|
||||||
Sum('size')
|
Sum('size')
|
||||||
|
|
Loading…
Reference in a new issue